/macosx-10.9.5/BerkeleyDB-21/db/examples_java/src/persist/ |
H A D | PersonExample.java | 176 * Add a parent and two children using the Person primary index. 178 * sub-index of children for that parent key. 187 /* Print the children of a parent using a sub-index and a cursor. */ 188 EntityCursor<Person> children = 191 for (Person child : children) { 195 children.close();
|
/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.) 86 CFIndex numBytes; /* Number of actual bytes in this node and all its children */ 428 /* Creates an (unfrozen) copy of the given node. This is shallow in the sense that it shares children for branches, but deep in that it copies memory for leaves. */ 444 /* If we are copying children from a frozen node to an unfrozen node, we need to freeze the children */ 459 /* Prototypes for deletion and insertion. The *Frozen and *Unfrozen variants should only be called for nodes that we know are frozen or unfrozen. Frozen nodes may only have frozen children, so it makes sense for the Frozen functions to call other Frozen functions. Unfrozen nodes may have frozen or unfrozen children, so they should call the non-suffixed variants (which dispatch on whether the node is frozen or not). 501 /* Helper function for both frozen and unfrozen branch deletion. Walks the children of the node, calling __CFStorageDelete (or __CFStorageDeleteFrozen if childrenAreDefinitelyFrozen is YES), and assigning the results back to newChildren. Returns the number of new children. The newChildren nodes all acquire a reference count! 508 if (! existingChild) break; //no more children 996 CFStorageNode *children[3] = {node->info.notLeaf.child[0], node->info.notLeaf.child[1], node->info.notLeaf.child[2]}; local 1046 CFStorageNode *children[3] = {node->info.notLeaf.child[0], node->info.notLeaf.child[1], node->info.notLeaf.child[2]}; local 1467 CFStorageNode **children = node->info.notLeaf.child; local [all...] |
H A D | CFTree.c | 43 CFTreeRef _child; /* All children get a retain from the parent */ 100 CFStringAppendFormat(result, NULL, CFSTR("<CFTree %p [%p]>{children = %lu, context = %@}"), cf, allocator, (unsigned long)CFTreeGetChildCount(tree), contextDesc); 308 void CFTreeGetChildren(CFTreeRef tree, CFTreeRef *children) { argument 312 *children++ = tree; 434 CFIndex children; local 437 children = CFTreeGetChildCount(tree); 438 if (1 < children) { 444 list = (children < 128) ? buffer : (CFTreeRef *)CFAllocatorAllocate(kCFAllocatorSystemDefault, children * sizeof(CFTreeRef), 0); // XXX_PCB GC OK 454 CFQSortArray(list, children, sizeo [all...] |
H A D | CFTree.h | 30 Each tree may have a parent, and a variable number of children. 122 memory for the tree and storage for its children. This 184 Returns the number of children of the specified tree. 187 @result The number of children. 198 is less than zero or greater than the number of children of the 207 Fills the buffer with children from the tree. 210 @param children A C array of pointer-sized values to be filled with 211 children from the tree. If this parameter is not a valid pointer to a 216 void CFTreeGetChildren(CFTreeRef tree, CFTreeRef *children); 222 removed than the immediate children o [all...] |
/macosx-10.9.5/CPANInternal-140/Class-Inspector/lib/Class/ |
H A D | Inspector.pm | 520 # just search the children in namespace only, or if I should do it via 524 sub children { subroutine 537 my @children = ( $name ); 543 while ( my $namespace = $children[$i++] ) { 544 push @children, map { "${namespace}::$_" } 550 sort @children;
|
/macosx-10.9.5/CPANInternal-140/DBIx-Class-Schema-Loader-0.07033/t/lib/ |
H A D | dbixcsl_common_tests.pm | 928 ok($m2m = (try { $class18->_m2m_metadata->{children} }), 'many_to_many created');
|
/macosx-10.9.5/CPANInternal-140/HTTP-Proxy-0.25/lib/HTTP/Proxy/Engine/ |
H A D | Legacy.pm | 79 # wait for remaining children 127 I<It seems that forked children are really slow when calling select for handling C<keep-alive>d requests!>
|
/macosx-10.9.5/CPANInternal-140/Ima-DBI-0.35/lib/Ima/ |
H A D | DBI.pm | 152 its children via normal method inheritance.
|
/macosx-10.9.5/CPANInternal-140/Ima-DBI/lib/Ima/ |
H A D | DBI.pm | 152 its children via normal method inheritance.
|
/macosx-10.9.5/CPANInternal-140/Log-Log4perl-1.40/ |
H A D | Changes | 258 avoid semaphore cleanup in spawned children.
|
/macosx-10.9.5/CPANInternal-140/Log-Log4perl-1.40/lib/Log/Log4perl/Appender/ |
H A D | Socket.pm | 148 the socket and the connections are shared among the forked children--all 149 the children writing to the same socket could intermingle messages. So instead
|
H A D | Synchronized.pm | 126 for this would be a process spawning children, each of which inherits 236 destroy the semaphore on exit. Spawned children of the process won't
|
/macosx-10.9.5/CPANInternal-140/Log-Log4perl/lib/Log/Log4perl/Appender/ |
H A D | Socket.pm | 143 the socket and the connections are shared among the forked children--all 144 the children writing to the same socket could intermingle messages. So instead
|
H A D | Synchronized.pm | 126 for this would be a process spawning children, each of which inherits
|
/macosx-10.9.5/CPANInternal-140/Path-Class/lib/Path/Class/ |
H A D | Dir.pm | 145 unshift @queue, $dir->children; 151 push @queue, $dir->children; 155 $visit_entry->($_) foreach $dir->children; 170 sub children { subroutine 444 =item @list = $dir->children 449 exist and be readable in order to find its children. 451 Note that the children are returned as subdirectories of C<$dir>, 452 i.e. the children of F<foo> will be F<foo/bar> and F<foo/baz>, not 455 Ordinarily C<children()> will not include the I<self> and I<parent> 461 @c = $dir->children(); # Jus [all...] |
/macosx-10.9.5/CPANInternal-140/SOAP-Lite-0.69/lib/OldDocs/SOAP/ |
H A D | Lite.pm | 414 use of a namespace prefix for the children of the /Envelope/Body element. 940 node children:
|
/macosx-10.9.5/CPANInternal-140/SOAP-Lite-0.69/lib/SOAP/ |
H A D | Lite.pm | 1825 # can be list of children or value itself. Traverse only children 1961 my($undef, $attrs, $children) = @$ref; 1964 return unless ref $children; 1965 for (@$children) {$self->traverse_ids($_)}; 1971 my($name, $attrs, $children, $value) = @$ref; 2008 ($children, $value) = (undef, $children) unless ref $children; 2011 [$ref->[5], $attrs, $children, [all...] |
H A D | SOM.pm | 51 This method sets the internal pointers within the data structure so that the retrieval methods that follow will have access to the desired data. In the example path, the match is being made against the method entity, which is the first child tag of the body in a SOAP response. The enumeration of container children starts at 1 in this syntax, not 0. The returned value is dependent on the context of the call. If the call is made in a boolean context (such as C<< if ($som->match($path)) >>), the return value is a boolean indicating whether the requested path matched at all. Otherwise, an object reference is returned. The returned object is also a SOAP::SOM instance but is smaller, containing the subset of the document tree matched by the expression.
|
/macosx-10.9.5/CPANInternal-140/SOAP-Lite-0.69/lib/UDDI/ |
H A D | Lite.pm | 232 my($name, $attrs, $children, $value) = @$ref; 242 -> set_value(ref $children && @$children ? map(scalar(($self->decode_object($_))[1]), @$children) : $value);
|
/macosx-10.9.5/CPANInternal-140/SOAP-Lite-0.69/lib/XMLRPC/ |
H A D | Lite.pm | 266 my($name, $attrs, $children, $value) = @$ref; 269 $children ? scalar(($self->decode_object($children->[0]))[1]) : $value; 271 return [map {scalar(($self->decode_object($_))[1])} @{o_child($children->[0]) || []}]; 277 } @{$children || []}}; 284 return [map {scalar(($self->decode_object($_))[1])} @{$children || []}]; 286 return +{map {$self->decode_object($_)} @{$children || []}}; 288 return scalar(($self->decode_object($children->[0]))[1]);
|
/macosx-10.9.5/CPANInternal-140/SOAP-Lite-0.69/t/ |
H A D | 02-payload.t | 338 my($value, $name, $attrs, $children, $type) = @_; 339 $desc = "$name @{[scalar @$children]}" if $name eq 'a';
|
/macosx-10.9.5/CPANInternal-140/SOAP-Lite-0.715/lib/SOAP/ |
H A D | Lite.pm | 1965 my @children; 1967 push( @children, $self->_as_data($child) ); 1969 $data->set_value( \SOAP::Data->value(@children) ); 2032 # can be list of children or value itself. Traverse only children 2172 my($undef, $attrs, $children) = @$ref; 2175 return unless ref $children; 2176 for (@$children) { 2187 my($name, $attrs_ref, $children, $value) = @$ref; 2227 ($children, [all...] |
/macosx-10.9.5/CPANInternal-140/SOAP-Lite-0.715/lib/UDDI/ |
H A D | Lite.pm | 936 my ( $name, $attrs, $children, $value ) = @$ref; 944 ->set_value( ref $children 945 && @$children 946 ? map( scalar( ( $self->decode_object($_) )[1] ), @$children )
|
/macosx-10.9.5/CPANInternal-140/SOAP-Lite-0.715/lib/XMLRPC/ |
H A D | Lite.pm | 285 my($name, $attrs, $children, $value) = @$ref; 288 $children ? scalar(($self->decode_object($children->[0]))[1]) : $value; 291 return [map {scalar(($self->decode_object($_))[1])} @{o_child($children->[0]) || []}]; 299 } @{$children || []}}; 309 return [map {scalar(($self->decode_object($_))[1])} @{$children || []}]; 312 return +{map {$self->decode_object($_)} @{$children || []}}; 315 return scalar(($self->decode_object($children->[0]))[1]);
|
/macosx-10.9.5/CPANInternal-140/SOAP-Lite-0.715/t/ |
H A D | 02-payload.t | 370 my($value, $name, $attrs, $children, $type) = @_; 371 $desc = "$name @{[scalar @$children]}" if $name eq 'a';
|