Python TreeDict.keys方法代码示例

# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import keys [as 别名]
    def testAttaching_10_Atomic_02_noImplicitOverwrite(self):
        p = TreeDict()
        p.makeBranch('a')
        p.freeze()

        self.assert_('a' in p.keys(branch_mode = 'only', recursive=False))

        self.assertRaises(TypeError, lambda: p.attach("a.b.c.d", TreeDict(x = 1),
                                                      protect_structure=True))

        self.assert_('a' in p.keys(branch_mode = 'only', recursive=False))

        self.assert_(p.a.size() == 0)

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

        p = TreeDict()
        p.a.x = 1
        p.b = p.a

        self.assert_('b' not in p.keys(recursive = False, branch_mode = 'only'))

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

        p.set(**dict(items))
 
        self.assert_(set(p.keys())   == set([k for k, v in items]))
        self.assert_(set(p.values()) == set([v for k, v in items]))
        self.assert_(set(p.items())  == set(items))

# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import keys [as 别名]
    def testItemlists_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.keys())   == set([k for k, v in items]))
        self.assert_(set(p.values()) == set([v for k, v in items]))
        self.assert_(set(p.items())  == set(items))

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

        pt = p
        for i in range(depth-1):
            pt = pt.a

        pt.a = 1

        self.assert_(p.keys() == ['.'.join(['a']*depth)])
        self.assert_(p.values() == [1])

# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import keys [as 别名]
    def testItemlists_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.values(False, "only")) == set([v for k, v in bl]))
        self.assert_(set(p.keys(False, "only")) == set([k for k, v in bl]))
        self.assert_(set(p.items(False, "only")) == set(bl))

# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import keys [as 别名]
    def testItemlists_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.keys(recursive=False)) 
                         == set([k for k, v in non_recursive]))
        self.assert_(set(p.values(recursive=False))
                         == set([v for k, v in non_recursive]))
        self.assert_(set(p.items(recursive=False))
                         == set(non_recursive))

# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import keys [as 别名]
    def testItemlists_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.keys(recursive=False, branch_mode = "all"))
                     == set([k for k, v in nrwb]))
        self.assert_(set(p.values(recursive=False, branch_mode = "all"))
                     == set([v for k, v in nrwb]))
        self.assert_(set(p.items(recursive=False, branch_mode = "all"))
                     == set(nrwb))

# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import keys [as 别名]
              ('Tomography', 'tomography_excitation_amplitude'):WithUnit(-11.0, 'dBm'),
              }

if __name__ == '__main__':
    import labrad
    cxn = labrad.connect()
    import time
    from treedict import TreeDict
    params = test_parameters.parameters
    d = TreeDict()
    #make a treedictionary out of the parameters
    for (collection,param), value in test_parameters.parameters.iteritems():
        d['{0}.{1}'.format(collection, param)] = value
        if not (collection,param) in tested_sequence.required_parameters:
            print 'parameter not listed among requirments', collection, param
    for key in d.keys():
        a = TreeDict()
        a.update(d)
        a.pop(key)
        try:
            sequence = tested_sequence(a)
        except Exception:
            pass
        else:
            print 'key not needed', key
    tinit = time.time()
    cs = tested_sequence(d)
    cs.programSequence(cxn.pulser)
    print 'to program', time.time() - tinit
#    cxn.pulser.start_number(10)
#    cxn.pulser.wait_sequence_done()

# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import keys [as 别名]
 def testItemLists_07_empty_fo(self):
     
     p = TreeDict()
     self.assert_(p.keys(False, "only") == [])
     self.assert_(p.items(False, "only") == [])
     self.assert_(p.values(False, "only") == [])

# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import keys [as 别名]
 def testItemLists_07_empty_ra(self):
     
     p = TreeDict()
     self.assert_(p.keys(True, "all") == [])
     self.assert_(p.items(True, "all") == [])
     self.assert_(p.values(True, "all") == [])

# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import keys [as 别名]
    def _check_RTE(self, keys, recursive, branch_mode, mode):

        p = TreeDict()

        for k in keys:
            p[k] = 1
            
        # Get a list of what will occur next 
        key_list = p.keys(recursive, branch_mode)

        def test_it(action, isokay = False):
            for ret_mode in ["keys", "items"]:
        
                def f():
                    n = p.size(recursive, branch_mode)

                    if ret_mode == "keys":
                        kiter = p.iterkeys(recursive, branch_mode)
                        for i, t in enumerate(kiter):
                            action(i, n, t)

                    if ret_mode == "items":
                        iiter = p.iteritems(recursive, branch_mode)
                        for i, (t,v) in enumerate(iiter):
                            action(i, n, t)

                if isokay:
                    f()
                else:
                    if p.size(recursive, branch_mode) != 0:
                        self.assertRaises(RuntimeError, f)
            
        if mode == "delete_all":
            def action(i,n,t):
                del p[t]

            test_it(action)

        if mode == "delete_last":
            def action(i,n,t):
                if i == n-1:
                    del p[t]

            test_it(action, True)

        if mode == "insert_each":
            def action(i,n,t):
                tn = unique_name()
                p[tn] = 1

            test_it(action)

        if mode == "insert_last":
            def action(i,n,t):
                if i == n-1:
                    tn = unique_name()
                    p[tn] = 1

            test_it(action, True)
            
        if mode == "insert_middle":
            def action(i,n,t):
                if i >= n // 2:
                    tn = unique_name()
                    p[tn] = 1

            test_it(action)

        if mode == "attach_branch":
            np = TreeDict(unique_name())
            np.a.b.c = 1
        
            def action(i,n,t):
                if i == n//2:
                    p.attach(np)
                    
            test_it(action)

        if mode == "attach_recursive":
            np = TreeDict(unique_name())
            np.a.b.c = 1
            p.attach(np)

            def action(i,n,t):
                if i == n//2:
                    p.attach(recursive=True)

            test_it(action)

        if mode == "pop":
            def action(i,n,t):
                if i == n//2:
                    p.pop(key_list[i+1])

            test_it(action)

        if mode == "clear":
            def action(i,n,t):
                if i == n//2:
                    p.clear()
#.........这里部分代码省略.........