本文整理汇总了Python中treedict.TreeDict.items方法的典型用法代码示例。如果您正苦于以下问题：Python TreeDict.items方法的具体用法？Python TreeDict.items怎么用？Python TreeDict.items使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类treedict.TreeDict的用法示例。
在下文中一共展示了TreeDict.items方法的8个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Python代码示例。
示例1: testItemlists_01_flat
# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import items [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))示例2: testItemlists_02_recursive
# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import items [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))示例3: testItemlists_05_branches
# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import items [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))示例4: testItemlists_03_nonrecursive_skipbranches
# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import items [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))示例5: testItemlists_04_nonrecursive_withbranches
# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import items [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))示例6: testItemLists_07_empty_fo
# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import items [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") == [])示例7: testItemLists_07_empty_ra
# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import items [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") == [])示例8: TreeDict
# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import items [as 别名]
from treedict import TreeDict
d = {"x" : 1, "y" : 2, "a.b.x" : 3, "a.b.c.y" : 4}
t = TreeDict()
t.update(d)
print t.makeReport()
from treedict import TreeDict
t = TreeDict() ; t.set("x" , 1, "y" , 2, "a.b.x", 3, "a.b.c.y", 4)
dict(t.iteritems())
from treedict import TreeDict
t = TreeDict()
t.a.b.x = 1
t.a.c.x = 2
t.d.y = 3
t.items()
t.a.items()
t.a.b.items()
########################################
# Memoize decorator
from treedict import TreeDict
class memoized_with_treedict(object):
"""
Based on 'memoized' python decorator from
http://wiki.python.org/moin/PythonDecoratorLibrary.
Decorator that caches a function's return value each time it is
called. If called later with the same arguments, the cached value
is returned, and not re-evaluated. In this case, TreeDicts are