/macosx-10.9.5/CF-855.17/ |
H A D | CFStorage.c | 83 /* Each node in the storage. isLeaf determines whether the node is a leaf node or a node inside the tree. If latter, number of children are determined by the number of non-NULL entries in child[]. (NULL entries are at the end.) 89 bool isLeaf; member in struct:__CFStorageNode 237 if (node->isLeaf) { 261 ASSERT(! parentNode->isLeaf); 267 ASSERT(! parent->isLeaf); 285 ASSERT(node->isLeaf); 299 ASSERT(cachedNode->isLeaf); 356 if (node->isLeaf) { 395 ASSERT(srcLeaf->isLeaf); 396 ASSERT(dstLeaf->isLeaf); 409 __CFStorageCreateNode(CFAllocatorRef allocator, CFStorageRef storage, bool isLeaf, CFIndex numBytes) argument [all...] |
/macosx-10.9.5/CPANInternal-140/Perl-Ldap/lib/Net/LDAP/ |
H A D | ASN.pm | 124 -- 35 reserved for undefined isLeaf --
|
/macosx-10.9.5/CPANInternal-140/Tree-Simple-1.18/lib/Tree/ |
H A D | Simple.pm | 167 $tree->fixDepth() unless $tree->isLeaf(); 227 $removed_child->fixDepth() unless $removed_child->isLeaf(); 351 sub isLeaf { $_[0]->getChildCount == 0 } subroutine 410 unless ($self->isLeaf()) { 487 ) unless $self->isLeaf(); 868 =item B<isLeaf>
|
/macosx-10.9.5/CPANInternal-140/Tree-Simple-1.18/t/ |
H A D | 10_Tree_Simple_test.t | 38 can_ok($tree, 'isLeaf'); 77 ok($tree->isLeaf()); 120 ok($sub_tree->isLeaf()); 127 ok(!$tree->isLeaf()); 174 ok($sub_tree_2->isLeaf()); 229 ok($sub_tree_4->isLeaf()); 259 ok($sub_tree_3->isLeaf()); 339 ok($sub_child->isLeaf()); 352 ok(!$sub_tree->isLeaf()); 370 ok($sub_child->isLeaf()); [all...] |
H A D | 11_Tree_Simple_fixDepth_test.t | 31 ok(!$tree->isLeaf(), '... and it is not a leaf'); 45 ok($sub_tree->isLeaf(), '... however it is a leaf'); 75 ok(!$parent_tree->isLeaf(), '... our parent tree is a leaf'); 88 ok($sub_tree->isLeaf(), '... but it is a leaf'); 139 ok(!$removed->isLeaf(), '... and it is not a leaf');
|
H A D | 14_Tree_Simple_leak_test.t | 63 ok($tree2->isLeaf(), '... tree2 is a Leaf'); 66 ok($tree3->isLeaf(), '... tree3 is a Leaf'); 73 ok(!$tree2->isLeaf(), '... now tree2 is not a Leaf'); 75 ok($tree3->isLeaf(), '... but tree3 is still a Leaf'); 87 ok(!$tree2->isLeaf(), '... now tree2 is not a leaf again'); 92 ok($tree3->isLeaf(), '... now tree3 is still a leaf');
|
H A D | 14a_Tree_Simple_weak_refs_test.t | 41 ok($tree2->isLeaf(), '... tree2 is a Leaf'); 44 ok($tree3->isLeaf(), '... tree3 is a Leaf'); 51 ok(!$tree2->isLeaf(), '... now tree2 is not a Leaf'); 53 ok($tree3->isLeaf(), '... but tree3 is still a Leaf'); 62 ok(!$tree2->isLeaf(), '... now tree2 is a not a leaf again'); 67 ok($tree3->isLeaf(), '... now tree3 is still a leaf');
|
/macosx-10.9.5/CPANInternal-140/Tree-Simple-VisitorFactory-0.10/lib/Tree/Simple/Visitor/ |
H A D | CreateDirectoryTree.pm | 68 if ($tree->isLeaf() && $node !~ /\/|\\$/) {
|
H A D | LoadClassHierarchy.pm | 46 ($tree->isLeaf()) || die "Illegal Operation : The tree must be a leaf node to load a class hierarchy";
|
H A D | LoadDirectoryTree.pm | 64 ($tree->isLeaf()) || die "Illegal Operation : The tree must be a leaf node to load a directory";
|
H A D | Sort.pm | 47 return if $tree->isLeaf(); 83 $self->_sortTree($sort_function, $child) unless $child->isLeaf();
|
H A D | ToNestedArray.pm | 47 push @{$accumulator} => $self->_buildArray($child, [], $filter) unless $child->isLeaf();
|
H A D | ToNestedHash.pm | 47 $self->_buildHash($child, $node_value, $filter) unless $child->isLeaf();
|
H A D | VariableDepthClone.pm | 76 $self->_cloneTree($child, $cloned_child, $depth - 1, $filter) unless $child->isLeaf();
|
/macosx-10.9.5/CPANInternal-140/Tree-Simple-VisitorFactory-0.10/t/ |
H A D | 90_Tree_Simple_Visitor_FromNestedHash_test.t | 51 ok($grandchild1->isLeaf(), '... GrandChild1 is a leaf node'); 54 ok($grandchild2->isLeaf(), '... GrandChild2 is a leaf node'); 57 ok($child2->isLeaf(), '... Child2 is a leaf node'); 86 ok($grandchild1->isLeaf(), '... GrandChild1 is a leaf node'); 89 ok($grandchild2->isLeaf(), '... GrandChild2 is a leaf node'); 92 ok($child2->isLeaf(), '... Child2 is a leaf node'); 124 ok($grandchild1->isLeaf(), '... GrandChild1 is a leaf node'); 127 ok($grandchild2->isLeaf(), '... GrandChild2 is a leaf node'); 130 ok($child2->isLeaf(), '... Child2 is a leaf node');
|
H A D | 91_Tree_Simple_Visitor_FromNestedArray_test.t | 51 ok($grandchild1->isLeaf(), '... GrandChild1 is a leaf node'); 54 ok($grandchild2->isLeaf(), '... GrandChild2 is a leaf node'); 57 ok($child2->isLeaf(), '... Child2 is a leaf node'); 86 ok($grandchild1->isLeaf(), '... GrandChild1 is a leaf node'); 89 ok($grandchild2->isLeaf(), '... GrandChild2 is a leaf node'); 92 ok($child2->isLeaf(), '... Child2 is a leaf node'); 124 ok($grandchild1->isLeaf(), '... GrandChild1 is a leaf node'); 127 ok($grandchild2->isLeaf(), '... GrandChild2 is a leaf node'); 130 ok($child2->isLeaf(), '... Child2 is a leaf node');
|
/macosx-10.9.5/CPANInternal-140/Tree-Simple-VisitorFactory/lib/Tree/Simple/Visitor/ |
H A D | CreateDirectoryTree.pm | 68 if ($tree->isLeaf() && $node !~ /\/|\\$/) {
|
H A D | LoadClassHierarchy.pm | 46 ($tree->isLeaf()) || die "Illegal Operation : The tree must be a leaf node to load a class hierarchy";
|
H A D | LoadDirectoryTree.pm | 64 ($tree->isLeaf()) || die "Illegal Operation : The tree must be a leaf node to load a directory";
|
H A D | Sort.pm | 47 return if $tree->isLeaf(); 83 $self->_sortTree($sort_function, $child) unless $child->isLeaf();
|
H A D | ToNestedArray.pm | 47 push @{$accumulator} => $self->_buildArray($child, [], $filter) unless $child->isLeaf();
|
H A D | ToNestedHash.pm | 47 $self->_buildHash($child, $node_value, $filter) unless $child->isLeaf();
|
H A D | VariableDepthClone.pm | 76 $self->_cloneTree($child, $cloned_child, $depth - 1, $filter) unless $child->isLeaf();
|
/macosx-10.9.5/CPANInternal-140/Tree-Simple-VisitorFactory/t/ |
H A D | 90_Tree_Simple_Visitor_FromNestedHash_test.t | 51 ok($grandchild1->isLeaf(), '... GrandChild1 is a leaf node'); 54 ok($grandchild2->isLeaf(), '... GrandChild2 is a leaf node'); 57 ok($child2->isLeaf(), '... Child2 is a leaf node'); 86 ok($grandchild1->isLeaf(), '... GrandChild1 is a leaf node'); 89 ok($grandchild2->isLeaf(), '... GrandChild2 is a leaf node'); 92 ok($child2->isLeaf(), '... Child2 is a leaf node'); 124 ok($grandchild1->isLeaf(), '... GrandChild1 is a leaf node'); 127 ok($grandchild2->isLeaf(), '... GrandChild2 is a leaf node'); 130 ok($child2->isLeaf(), '... Child2 is a leaf node');
|
H A D | 91_Tree_Simple_Visitor_FromNestedArray_test.t | 51 ok($grandchild1->isLeaf(), '... GrandChild1 is a leaf node'); 54 ok($grandchild2->isLeaf(), '... GrandChild2 is a leaf node'); 57 ok($child2->isLeaf(), '... Child2 is a leaf node'); 86 ok($grandchild1->isLeaf(), '... GrandChild1 is a leaf node'); 89 ok($grandchild2->isLeaf(), '... GrandChild2 is a leaf node'); 92 ok($child2->isLeaf(), '... Child2 is a leaf node'); 124 ok($grandchild1->isLeaf(), '... GrandChild1 is a leaf node'); 127 ok($grandchild2->isLeaf(), '... GrandChild2 is a leaf node'); 130 ok($child2->isLeaf(), '... Child2 is a leaf node');
|