Python TreeDict.iterkeys方法代码示例

# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import iterkeys [as 别名]
    def testIterators_02_recursive(self):
        p = TreeDict()
        items = [('a.v', 1), ('b', 2), ('c', 3), ('aa.b.c.d.e', 4)]

        p.set(**dict(items))

        self.assert_(set(p.iterkeys())   == set([k for k, v in items]))
        self.assert_(set(p.itervalues()) == set([v for k, v in items]))
        self.assert_(set(p.iteritems())  == set(items))

# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import iterkeys [as 别名]
    def testIterators_01_flat(self):
        p = TreeDict()
        items = [('a', 1), ('b', 2), ('c', 3)]

        p.set(**dict(items))
 
        self.assert_(set(p.iterkeys())   == set([k for k, v in items]))
        self.assert_(set(p.itervalues()) == set([v for k, v in items]))
        self.assert_(set(p.iteritems())  == set(items))

# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import iterkeys [as 别名]
    def testIterators_06_large_recursive(self):
        n = 500

        p = TreeDict()
        kl = random_node_list(0, n, 0.75)

        for i, k in enumerate(kl):
            p.set(k, i)

        self.assert_(set(p.iterkeys()) == set(kl))
        self.assert_(set(p.itervalues()) == set(range(n)))

# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import iterkeys [as 别名]
    def testIterators_05_branches(self):
        p = TreeDict()
        items = [('a.v', 1), ('b', 2), ('c', 3), ('aa.b.c.d.e', 4)]

        p.set(**dict(items))

        bl  = [(k, p.get(k)) for k in ['a', 'aa']]

        p.freeze()

        self.assert_(set(p.itervalues(False, branch_mode = "only")) == set([v for k, v in bl]))
        self.assert_(set(p.iterkeys(False, branch_mode = "only")) == set([k for k, v in bl]))
        self.assert_(set(p.iteritems(False, branch_mode = "only")) == set(bl))

# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import iterkeys [as 别名]
    def testIterators_03_nonrecursive_skipbranches(self):
        p = TreeDict()
        items = [('a.v', 1), ('b', 2), ('c', 3), ('aa.b.c.d.e', 4)]

        p.set(**dict(items))

        non_recursive = [(k,v) for k, v in items
                         if '.' not in k]

        self.assert_(set(p.iterkeys(recursive=False)) 
                         == set([k for k, v in non_recursive]))
        self.assert_(set(p.itervalues(recursive=False))
                         == set([v for k, v in non_recursive]))
        self.assert_(set(p.iteritems(recursive=False))
                         == set(non_recursive))

# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import iterkeys [as 别名]
    def testIterators_04_nonrecursive_withbranches(self):
        p = TreeDict()
        items = [('a.v', 1), ('b', 2), ('c', 3), ('aa.b.c.d.e', 4)]

        p.set(**dict(items))

        nrwb  = [(k, p.get(k)) for k in ['a', 'b', 'c', 'aa']]

        p.freeze()

        self.assert_(set(p.iterkeys(recursive=False, branch_mode = "all"))
                     == set([k for k, v in nrwb]))
        self.assert_(set(p.itervalues(recursive=False, branch_mode = "all"))
                     == set([v for k, v in nrwb]))
        self.assert_(set(p.iteritems(recursive=False, branch_mode = "all"))
                     == set(nrwb))

# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import iterkeys [as 别名]
    def testIterators_12_Deletion(self):
        p = TreeDict()

        p.a = 1
        p.b = 2
        p.c = 3
        p.d = 4 
        p.e = 5

        it = p.iterkeys()
        
        self.assertRaises(RuntimeError, lambda: p.pop('a'))
        it.next()
        self.assertRaises(RuntimeError, lambda: p.pop('a'))
        
        del it

        p.pop('a')

# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import iterkeys [as 别名]
 def testIterators_07_empty_fo(self):
     
     p = TreeDict()
     self.assert_([l for l in p.iterkeys(False, "only")] == [])
     self.assert_([l for l in p.iteritems(False, "only")] == [])
     self.assert_([l for l in p.itervalues(False, "only")] == [])

# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import iterkeys [as 别名]
 def testIterators_07_empty_ra(self):
     
     p = TreeDict()
     self.assert_([l for l in p.iterkeys(True, "all")] == [])
     self.assert_([l for l in p.iteritems(True, "all")] == [])
     self.assert_([l for l in p.itervalues(True, "all")] == [])

# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import iterkeys [as 别名]

#.........这里部分代码省略.........
                printBlock(print_list, sorted(self.items.iteritems()), "  ", width)
            else:
                printBlock(print_list, sorted(self.items.iteritems()), "", width+2)

    class GroupOrganizer:

        def __init__(self):

            self.name_map = {}
            self.group_map = {}

        def addGroup(self, name, description):
            name = name.strip()
            description = description.strip()
            self.group_map[name] = description

        def addPreset(self, name, description):
            name = name.strip()
            description = description.strip()
            if name:
                self.name_map[name] = description

        def printGroups(self, print_list):

            if not self.name_map:
                return
            
            def _getGroupName(group_map, name):

                group = ''

                if name in group_map:
                    return name

                # Get whether it's a part of a group
                cur_pos = 0

                while True:
                    cur_pos = name.find('.', cur_pos+1)

                    if cur_pos == -1:
                        break

                    if name[:cur_pos] in group_map:
                        group = name[:cur_pos]

                return group

            # put all the groups together
            groups = dict( (n, Group(n, d) ) for n, d in self.group_map.iteritems())
            groups[''] = Group('', '')
            
            # put all the presets into groups
            for n, d in self.name_map.iteritems():
                g = _getGroupName(groups, n)
                if g == n:
                    groups[g].add(n, "(As preset) " + d)
                else:
                    groups[g].add(n, d)

            print_width = max(len(n) for n in self.name_map.iterkeys())

            # give them back
            for k, g in sorted(groups.iteritems()):
                g.printGroup(print_list, print_width)


    ##################################################
    # This is to deal with the special case of presets also being names
    pl_alt = TreeDict()
    pl_alt.update( (__cleanPresetTreeName(k), v)
                   for k,v in sorted(__preset_lookup.iteritems(), reverse=True) )

    __preset_description_lookup.attach(recursive = True)

    print_list = []

    org = GroupOrganizer()

    if preset_list is None:

        # Have to sanitize the description tree
        for k in pl_alt.iterkeys(recursive = True, branch_mode = 'only'):
            query_key = k + ".__description__"
            d = __preset_description_lookup.get(query_key, None)
            org.addGroup(k, d if d else "")

        for n in sorted(pl_alt.iterkeys(recursive = True, branch_mode = 'all')):

            k = __presetTreeName(n)

            if k in __preset_lookup:
                org.addPreset(n, __preset_lookup[k].description)

        org.printGroups(print_list)

    else:
        printBlock(print_list, [(n, __preset_lookup[__presetTreeName(n)].description) for n in preset_list])

    return print_list

# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import iterkeys [as 别名]
list(t.iteritems())
list(t.iteritems(recursive=False))
list(t.iteritems(recursive=False, branch_mode='none'))
list(t.iteritems(recursive=False, branch_mode='only'))
list(t.iteritems(recursive=False, branch_mode='all'))
list(t.iteritems(recursive=True, branch_mode='only'))
list(t.iteritems(recursive=True, branch_mode='all'))


########################################
# iterkeys

from treedict import TreeDict
t = TreeDict() ; t.set('b.x', 1, 'b.c.y', 2, x = 1)
print t.makeReport()
list(t.iterkeys())
list(t.iterkeys(recursive=False))
list(t.iterkeys(recursive=False, branch_mode='none'))
list(t.iterkeys(recursive=False, branch_mode='only'))
list(t.iterkeys(recursive=False, branch_mode='all'))
list(t.iterkeys(recursive=True, branch_mode='only'))
list(t.iterkeys(recursive=True, branch_mode='all'))


########################################
# itervalues

from treedict import TreeDict
t = TreeDict() ; t.set('b.x', 1, 'b.c.y', 2, x = 1)
print t.makeReport()
list(t.itervalues())