本文整理汇总了Python中treedict.TreeDict._numDangling方法的典型用法代码示例。如果您正苦于以下问题：Python TreeDict._numDangling方法的具体用法？Python TreeDict._numDangling怎么用？Python TreeDict._numDangling使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类treedict.TreeDict的用法示例。
在下文中一共展示了TreeDict._numDangling方法的4个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Python代码示例。
示例1: testDangling_09_Count_03b_Deletion
# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import _numDangling [as 别名]
def testDangling_09_Count_03b_Deletion(self):
p = TreeDict()
self.assert_(p._numDangling() == 0)
p.a
self.assert_(p._numDangling() == 1)
del p["a"]
self.assert_(p._numDangling() == 0)示例2: testDangling_09_Count_04_Branching
# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import _numDangling [as 别名]
def testDangling_09_Count_04_Branching(self):
p = TreeDict()
self.assert_(p._numDangling() == 0)
p.a
self.assert_(p._numDangling() == 1)
p.makeBranch("a")
self.assert_(p._numDangling() == 0)示例3: testDangling_13_CorrectCountsThroughSiblingReferences
# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import _numDangling [as 别名]
def testDangling_13_CorrectCountsThroughSiblingReferences(self):
p = TreeDict()
p.a = p.d
self.assert_(p._numDangling() == 2)
# Overwrite p.d; p.a still points to the dangling node, so the
# count should not go down.
p.d = 1
self.assert_(p._numDangling() == 1)示例4: testDangling_09_Count_02
# 需要导入模块: from treedict import TreeDict [as 别名]
# 或者: from treedict.TreeDict import _numDangling [as 别名]
def testDangling_09_Count_02(self):
p = TreeDict()
self.assert_(p._numDangling() == 0)
p.a.b
self.assert_(p._numDangling() == 1)