/macosx-10.9.5/CPANInternal-140/XML-XPath/t/ |
H A D | remove.t | 19 my @nodes = $xp->findnodes('//Cart',$root); 21 ok(@nodes, 2); 23 $root->removeChild($nodes[0]); 25 @nodes = $xp->findnodes('//Cart', $root); 26 ok(@nodes, 1); 28 my $cart = $nodes[0]; 30 @nodes = $xp->findnodes('//Cart/@*', $root); 31 ok(@nodes, 2); 34 @nodes = $xp->findnodes('//Cart/@*', $root); 36 ok(@nodes, [all...] |
H A D | insert.t | 19 my @nodes = $root->findnodes('//Cart'); 21 ok(@nodes, 2); 25 $root->insertBefore($comment, $nodes[0]); 29 $root->insertAfter($other_comment, $nodes[0]); 31 @nodes = $xp->findnodes('/Shop/node()'); 33 # foreach (@nodes) { 37 ok($nodes[1]->isCommentNode); 38 ok($nodes[3]->isCommentNode);
|
/macosx-10.9.5/CPANInternal-140/XML-XPath/examples/ |
H A D | xpath | 33 my $nodes = $xpath->find(shift @ARGV); 35 unless ($nodes->isa('XML::XPath::NodeSet')) { 38 print $nodes->value, "\n"; 43 $nodes = find_more($nodes); 44 goto NOTNODES unless $nodes->isa('XML::XPath::NodeSet'); 47 if ($nodes->size) { 48 print STDERR "Found ", $nodes->size, " nodes:\n"; 49 foreach my $node ($nodes [all...] |
/macosx-10.9.5/tcl-102/tcl_ext/tcllib/tcllib/modules/struct/ |
H A D | skiplist.tcl | 32 # nodes - all the nodes in the skiplist, including a dummy header node 116 variable nodes 125 set nodes(nil,key) $::struct::skiplist::MAXINT 126 set nodes(header,key) "---" 127 set nodes(header,value) "---" 130 set nodes(header,$i) nil 199 upvar ::struct::skiplist::skiplist${name}::nodes nodes 204 set fwd $nodes( [all...] |
/macosx-10.9.5/cups-372.4/cups/cgi-bin/ |
H A D | testhi.c | 18 * list_nodes() - List nodes in an array... 32 static void list_nodes(const char *title, cups_array_t *nodes); 53 list_nodes("nodes", hi->nodes); 70 printf("%s (0 nodes)\n", argv[1]); 84 * 'list_nodes()' - List nodes in an array... 89 cups_array_t *nodes) /* I - Nodes */ 95 printf("%s (%d nodes):\n", title, cupsArrayCount(nodes)); 96 for (i = 1, node = (help_node_t *)cupsArrayFirst(nodes); 88 list_nodes(const char *title, cups_array_t *nodes) argument [all...] |
H A D | websearch.c | 22 * list_nodes() - List matching nodes. 37 cups_array_t *nodes); 84 * 'list_nodes()' - List nodes in an array... 90 cups_array_t *nodes) /* I - Nodes */ 96 printf("%d\n", cupsArrayCount(nodes)); 97 for (node = (help_node_t *)cupsArrayFirst(nodes); 99 node = (help_node_t *)cupsArrayNext(nodes)) 88 list_nodes(help_index_t *hi, const char *title, cups_array_t *nodes) argument
|
/macosx-10.9.5/ruby-104/ruby/test/ |
H A D | test_tsort.rb | 30 h.strongly_connected_components.map {|nodes| nodes.sort}) 37 a.strongly_connected_components.map {|nodes| nodes.sort}) 41 a.strongly_connected_components.map {|nodes| nodes.sort})
|
/macosx-10.9.5/llvmCore-3425.0.33/utils/ |
H A D | DSAextract.py | 3 #this is a script to extract given named nodes from a dot file, with 5 # x and y are both nodes specified to be kept. 19 #nodes in the file 35 <output_file> [list of nodes to extract]' 66 #for the node (it will be Node(hex number)) to our set of nodes 96 #check to make sure that both nodes are in the node list 98 nodes = arrowexp.split(buffer) variable 99 nodes[0] = string.strip(nodes[0]) 100 nodes[ [all...] |
/macosx-10.9.5/WebCore-7537.78.1/xml/ |
H A D | XPathPath.cpp | 57 NodeSet& nodes = v.modifiableNodeSet(); local 58 nodes.sort(); 63 evaluationContext.size = nodes.size(); 66 for (unsigned j = 0; j < nodes.size(); j++) { 67 Node* node = nodes[j]; 75 nodes.swap(newNodes); 112 NodeSet nodes; local 113 nodes.append(context); 114 evaluate(nodes); 117 return Value(nodes, Valu 208 NodeSet& nodes = v.modifiableNodeSet(); local [all...] |
H A D | XPathStep.cpp | 58 // E.g., there is no need to build a set of all "foo" nodes to evaluate "foo[@bar]", we can check the predicate while enumerating. 112 void Step::evaluate(Node* context, NodeSet& nodes) const 117 nodesInAxis(context, nodes); 124 if (!nodes.isSorted()) 127 for (unsigned j = 0; j < nodes.size(); j++) { 128 Node* node = nodes[j]; 131 evaluationContext.size = nodes.size(); 137 nodes.swap(newNodes); 174 // In XPath land, namespace nodes are not accessible on the attribute axis. 200 // An expression without any prefix shouldn't match no-namespace nodes (becaus [all...] |
/macosx-10.9.5/tcl-102/tcl_ext/tcllib/tcllib/modules/treeql/ |
H A D | treeql84.tcl | 17 variable nodes ;# set of all nodes 18 variable tree ;# tree over which nodes are defined 30 foreach node $nodes { 45 # filter nodes by [$tree cmd {*}$args] 49 foreach node $nodes { 65 # filter nodes by the predicate [$tree cmd {*}$args] 70 #set result [::struct::list filter $nodes [list $tree $cmd {*}$args]] 71 #puts stderr "Bool: $tree $cmd - $nodes - $args -> $result" 76 foreach node $nodes { [all...] |
H A D | treeql85.tcl | 17 variable nodes ;# set of all nodes 18 variable tree ;# tree over which nodes are defined 30 foreach node $nodes { 44 # filter nodes by [$tree cmd {*}$args] 48 foreach node $nodes { 63 # filter nodes by the predicate [$tree cmd {*}$args] 68 #set result [::struct::list filter $nodes [list $tree $cmd {*}$args]] 69 #puts stderr "Bool: $tree $cmd - $nodes - $args -> $result" 74 foreach node $nodes { [all...] |
/macosx-10.9.5/ruby-104/ruby/test/rexml/ |
H A D | test_xpathtext.rb | 30 nodes = @doc.get_elements('//b') 31 assert_equal(1, nodes.size, "document has one element") 33 nodes = REXML::XPath.match(@doc, '//text()') 34 assert_equal(1, nodes.size, "//text() should yield one Text element") 35 assert_equal(REXML::Text, nodes[0].class) 42 nodes = REXML::XPath.match(@doc, '//comment()') 43 assert_equal(1, nodes.size, "//comment() should yield one Comment element") 44 assert_same commentnode, nodes[0] 66 nodes = @doc.get_elements('//b/ancestor::*') 67 assert_equal(1, nodes [all...] |
/macosx-10.9.5/llvmCore-3425.0.33/lib/CodeGen/ |
H A D | SpillPlacement.cpp | 66 /// value can change when linked nodes change, but convergence is very fast 90 /// from ingoing and outgoing nodes separately add up to a most 1. The weight 97 // Undecided nodes (Value==0) go on the stack. 146 bool update(const Node nodes[]) { argument 150 Sum += I->first * nodes[I->second].Value; 175 assert(!nodes && "Leaking node array"); 176 nodes = new Node[bundles->getNumBundles()]; 185 nodes[bundles->getBundle(Num, 1)].Scale[0] += Freq; 186 nodes[bundles->getBundle(Num, 0)].Scale[1] += Freq; 192 if (nodes[ [all...] |
/macosx-10.9.5/libxml2-26/libxml2/doc/examples/ |
H A D | xpath2.c | 28 static void update_xpath_nodes(xmlNodeSetPtr nodes, const xmlChar * value); 79 * Parses input XML file, evaluates XPath expression and update the nodes 118 /* update selected nodes */ 138 * @nodes: the nodes set. 141 * Prints the @nodes content to @output. 144 update_xpath_nodes(xmlNodeSetPtr nodes, const xmlChar* value) { argument 149 size = (nodes) ? nodes->nodeNr : 0; 152 * NOTE: the nodes ar [all...] |
H A D | xpath1.c | 27 void print_xpath_nodes(xmlNodeSetPtr nodes, FILE* output); 199 * @nodes: the nodes set. 202 * Prints the @nodes content to @output. 205 print_xpath_nodes(xmlNodeSetPtr nodes, FILE* output) { argument 211 size = (nodes) ? nodes->nodeNr : 0; 213 fprintf(output, "Result (%d nodes):\n", size); 215 assert(nodes->nodeTab[i]); 217 if(nodes [all...] |
/macosx-10.9.5/CPANInternal-140/XML-XPath/XPath/ |
H A D | NodeSet.pm | 31 my (@nodes) = @_; 32 CORE::push @$self, @nodes; 48 my (@nodes) = @_; 49 CORE::unshift @$self, @nodes; 109 XML::XPath::NodeSet - a list of XML document nodes 113 An XML::XPath::NodeSet object contains an ordered list of nodes. The nodes 137 Returns a list of nodes. See L<XML::XPath::XMLParser> for the format of 138 the nodes. 148 the nodes i [all...] |
/macosx-10.9.5/swig-10/Source/Modules/ |
H A D | overload.cxx | 59 Overloaded nodes[MAX_OVERLOAD]; local 82 nodes[nnodes].n = c; 83 nodes[nnodes].parms = Getattr(c, "wrap:parms"); 84 nodes[nnodes].argc = emit_num_required(nodes[nnodes].parms); 85 nodes[nnodes].error = 0; 96 if (nodes[i].argc > nodes[j].argc) { 97 Overloaded t = nodes[i]; 98 nodes[ [all...] |
/macosx-10.9.5/curl-78.94.1/curl/tests/unit/ |
H A D | unit1309.c | 70 /* number of nodes to add to the splay tree */ 74 struct Curl_tree nodes[NUM_NODES]; variable in typeref:struct:Curl_tree 85 nodes[i].payload = (void *)key.tv_usec; /* for simplicity */ 86 root = Curl_splayinsert(key, root, &nodes[i]); 97 (long)(nodes[rem].payload)); 98 rc = Curl_splayremovebyaddr(root, &nodes[rem], &root);
|
/macosx-10.9.5/libxml2-26/libxml2/include/libxml/ |
H A D | c14n.h | 38 * a) default attributes (if any) are added to all nodes 69 xmlNodeSetPtr nodes, 77 xmlNodeSetPtr nodes, 85 xmlNodeSetPtr nodes, 102 * Signature for a C14N callback on visible nodes
|
/macosx-10.9.5/pyobjc-42/pyobjc/pyobjc-core/libxml2-src/include/libxml/ |
H A D | c14n.h | 38 * a) default attributes (if any) are added to all nodes 69 xmlNodeSetPtr nodes, 77 xmlNodeSetPtr nodes, 85 xmlNodeSetPtr nodes, 102 * Signature for a C14N callback on visible nodes
|
/macosx-10.9.5/tcl-102/tcl_ext/tcllib/tcllib/modules/struct/tree/ |
H A D | t.c | 20 t->nodes = NULL; 33 /* Delete a tree in toto. Recursively deletes all nodes first, 34 * starting at root. This also handles the nodes/leaves lists. 66 int nodes; local 93 nodes = listc/3; 109 ASSERT_BOUNDS (j, nodes); 138 ASSERT_BOUNDS (j, nodes); 145 "error in serialization: multiple root nodes.", 172 parent = NALLOC (nodes, int); 174 ASSERT_BOUNDS (root, nodes); [all...] |
/macosx-10.9.5/WebCore-7537.78.1/editing/ |
H A D | SetNodeAttributeCommand.cpp | 58 void SetNodeAttributeCommand::getNodesInCommand(HashSet<Node*>& nodes) argument 60 addNodeAndDescendants(m_element.get(), nodes);
|
H A D | RemoveNodeCommand.cpp | 69 void RemoveNodeCommand::getNodesInCommand(HashSet<Node*>& nodes) argument 71 addNodeAndDescendants(m_parent.get(), nodes); 72 addNodeAndDescendants(m_refChild.get(), nodes); 73 addNodeAndDescendants(m_node.get(), nodes);
|
/macosx-10.9.5/tcl-102/tcl/tcl/generic/ |
H A D | tclCompExpr.c | 511 static void CompileExprTree(Tcl_Interp *interp, OpNode *nodes, 516 OpNode *nodes, Tcl_Token *tokenPtr, 518 static int ExecConstantExprTree(Tcl_Interp *interp, OpNode *nodes, 578 OpNode *nodes = NULL; /* Pointer to the OpNode storage array where 629 nodes = (OpNode *) attemptckalloc(nodesAvailable * sizeof(OpNode)); 630 if (nodes == NULL) { 636 nodes->lexeme = START; 637 nodes->precedence = prec[START]; 638 nodes->mark = MARK_RIGHT; 639 nodes 577 OpNode *nodes = NULL; /* Pointer to the OpNode storage array where local 1427 ConvertTreeToTokens( const char *start, int numBytes, OpNode *nodes, Tcl_Token *tokenPtr, Tcl_Parse *parsePtr) argument 2065 ExecConstantExprTree( Tcl_Interp *interp, OpNode *nodes, int index, Tcl_Obj *const **litObjvPtr) argument 2121 CompileExprTree( Tcl_Interp *interp, OpNode *nodes, int index, Tcl_Obj *const **litObjvPtr, Tcl_Obj *const *funcObjv, Tcl_Token *tokenPtr, CompileEnv *envPtr, int optimize) argument 2413 OpNode nodes[2]; local 2471 OpNode *nodes = (OpNode *) TclStackAlloc(interp, local 2558 OpNode nodes[2]; local 2599 OpNode *nodes = (OpNode *) TclStackAlloc(interp, local [all...] |