当前位置: 首页>>代码示例>>Python>>正文


Python TreeDict.set方法代码示例

本文整理汇总了Python中treedict.TreeDict.set方法的典型用法代码示例。如果您正苦于以下问题:Python TreeDict.set方法的具体用法?Python TreeDict.set怎么用?Python TreeDict.set使用的例子?那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在treedict.TreeDict的用法示例。


在下文中一共展示了TreeDict.set方法的15个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的Python代码示例。

示例1: testSet_20_setting_linked_branch_02

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

        p.a = p.defs.a1

        p.set("defs.a1.v", 1)

        self.assert_(p.a.v == 1)
开发者ID:aurora1625,项目名称:treedict,代码行数:10,代码来源:test_setting.py

示例2: testSet_19_overwriting_value_with_branch_01_okay

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

        p.a = 12

        p.set("a.b.c", 1, protect_values=False)

        self.assert_(p.a.b.c == 1)
开发者ID:aurora1625,项目名称:treedict,代码行数:10,代码来源:test_setting.py

示例3: testSet_21_Setting_ThroughTreeDict_01

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

        p.a.b = TreeDict()

        p.set("a.b.c.d.x", 1)

        self.assert_(p.a.b.c.d.x == 1)
        self.assert_(p.a.b.isRoot())
开发者ID:aurora1625,项目名称:treedict,代码行数:11,代码来源:test_setting.py

示例4: testIterators_02_recursive

# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import set [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))
开发者ID:real666maverick,项目名称:treedict,代码行数:11,代码来源:test_iterators_lists.py

示例5: testItemlists_01_flat

# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import set [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))
开发者ID:real666maverick,项目名称:treedict,代码行数:11,代码来源:test_iterators_lists.py

示例6: testIterators_06_large_recursive

# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import set [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)))
开发者ID:real666maverick,项目名称:treedict,代码行数:13,代码来源:test_iterators_lists.py

示例7: testIterators_05_branches

# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import set [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))
开发者ID:real666maverick,项目名称:treedict,代码行数:15,代码来源:test_iterators_lists.py

示例8: testIterators_03_nonrecursive_skipbranches

# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import set [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))
开发者ID:real666maverick,项目名称:treedict,代码行数:17,代码来源:test_iterators_lists.py

示例9: testSize_07_large_recursive

# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import set [as 别名]
    def testSize_07_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)

        n_root_leaves = len([k for k in kl if '.' not in k])

        self.assert_(len(p) == n)
        self.assert_(p.size() == n)
        self.assert_(p.size(recursive = False) == n_root_leaves)
        self.assert_(p.size(recursive = False, branch_mode = "all") == n)
        self.assert_(p.size(recursive = False, branch_mode = "only") == n - n_root_leaves)
开发者ID:real666maverick,项目名称:treedict,代码行数:18,代码来源:test_properties.py

示例10: testSet_10_validation_first

# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import set [as 别名]
    def testSet_10_validation_first(self):
        p = TreeDict()
        v1 = (1,2,3)
        v2 = (3,2,1)

        p.a = v1

        p1 = deepcopy(p)

        try:
            p.set("a", v2, "0123", None)
        except Exception:
            pass

        self.assert_(p.a is v1)
        self.assert_(p1 == p)
开发者ID:aurora1625,项目名称:treedict,代码行数:18,代码来源:test_setting.py

示例11: testIterators_04_nonrecursive_withbranches

# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import set [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))
开发者ID:real666maverick,项目名称:treedict,代码行数:18,代码来源:test_iterators_lists.py

示例12: testSet_19_overwriting_value_with_branch_02_nochange_on_bad

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

        p.a = 12

        pc = p.copy()

        self.assertRaises(NameError, lambda: p.set("a.b.c.123.d", 1, protect_structure = False))

        self.assert_(p.a == 12)
        self.assert_(p == pc)
开发者ID:aurora1625,项目名称:treedict,代码行数:13,代码来源:test_setting.py

示例13: testFreezingStructure_01

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

        p.a = 1

        p.freeze(structure_only = True)

        p.a = 2

        self.assert_(p.a == 2)
        self.assertRaises(TypeError, lambda: p.set('b',1))
开发者ID:real666maverick,项目名称:treedict,代码行数:13,代码来源:test_properties.py

示例14: testPicklingWithIteratorReferencing

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

        p = TreeDict()

        p.a = 1
        p.b = 2
        p.c = 3

        it = p.iteritems()

        p2 = cPickle.loads(cPickle.dumps(p, protocol=2))

        self.assert_(p == p2)

        self.assertRaises(RuntimeError, lambda: p.set('d', 4))
        p2.d = 4
开发者ID:real666maverick,项目名称:treedict,代码行数:18,代码来源:test_pickling.py

示例15: testSet_19_overwriting_value_with_branch_03_error

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

        p.a = 12

        self.assertRaises(TypeError, lambda: p.set("a.b.c", 1, protect_structure = True))
开发者ID:aurora1625,项目名称:treedict,代码行数:8,代码来源:test_setting.py


注:本文中的treedict.TreeDict.set方法示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。