/external/chromium_org/third_party/freetype/src/base/ |
H A D | ftdbgmem.c | 115 FT_ULong nodes; member in struct:FT_MemTableRec_ 260 new_size = ft_mem_closest_prime( table->nodes ); 317 table->nodes = 0; 395 table->nodes = 0; 593 table->nodes++; 600 if ( table->nodes * 3 < table->size || 601 table->size * 3 < table->nodes ) 656 table->nodes--; 665 if ( table->nodes * 3 < table->size || 666 table->size * 3 < table->nodes ) [all...] |
/external/freetype/src/base/ |
H A D | ftdbgmem.c | 115 FT_ULong nodes; member in struct:FT_MemTableRec_ 260 new_size = ft_mem_closest_prime( table->nodes ); 317 table->nodes = 0; 391 table->nodes = 0; 588 table->nodes++; 595 if ( table->nodes * 3 < table->size || 596 table->size * 3 < table->nodes ) 651 table->nodes--; 660 if ( table->nodes * 3 < table->size || 661 table->size * 3 < table->nodes ) [all...] |
/external/icu4c/common/ |
H A D | stringtriebuilder.cpp | 37 StringTrieBuilder::StringTrieBuilder() : nodes(NULL) {} 48 nodes=uhash_openSize(hashStringTrieNode, equalStringTrieNodes, NULL, 51 if(nodes==NULL) { 54 uhash_setKeyDeleter(nodes, uprv_deleteUObject); 61 uhash_close(nodes); 62 nodes=NULL; 163 // Write the sub-nodes in reverse order: The jump lengths are deltas from 193 // Write the split-branch nodes. 307 // Create the split-branch nodes. 326 const UHashElement *old=uhash_find(nodes, newNod [all...] |
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
H A D | dot.rb | 43 Abstract Syntax Tree nodes. 78 | <%= @nodes.join("\n ") %> 109 tree_template = Context.new( tree_template, :nodes => [], :edges => [] ) 125 tree_template[ :nodes ] << parent_node_template 134 tree_template[ :nodes ] << node_template
|
/external/apache-xml/src/main/java/org/apache/xalan/templates/ |
H A D | FuncDocument.java | 103 XNodeSet nodes = new XNodeSet(xctxt.getDTMManager()); 104 return nodes; 144 XNodeSet nodes = new XNodeSet(xctxt.getDTMManager()); 145 NodeSetDTM mnl = nodes.mutableNodeset(); 196 // nodes.mutableNodeset().addNode(newDoc); 210 return nodes;
|
/external/chromium/chrome/browser/bookmarks/ |
H A D | bookmark_model.cc | 166 std::vector<const BookmarkNode*> nodes = local 168 return nodes.empty() ? bookmark_bar_node_ : nodes[0]; 325 std::vector<const BookmarkNode*>* nodes) { 330 nodes->push_back(*i); 337 std::vector<const BookmarkNode*> nodes; local 338 GetNodesByURL(url, &nodes); 339 if (nodes.empty()) 342 std::sort(nodes.begin(), nodes 324 GetNodesByURL(const GURL& url, std::vector<const BookmarkNode*>* nodes) argument 789 std::vector<const BookmarkNode*> nodes; local [all...] |
H A D | bookmark_node_data_unittest.cc | 193 // Tests reading/writing of multiple nodes. 208 // Write the nodes to the clipboard. 209 std::vector<const BookmarkNode*> nodes; local 210 nodes.push_back(folder); 211 nodes.push_back(url_node); 212 BookmarkNodeData drag_data(nodes);
|
/external/chromium_org/chrome/browser/bookmarks/ |
H A D | bookmark_model.cc | 278 std::vector<const BookmarkNode*> nodes = local 280 DCHECK(!nodes.empty()); // This list is always padded with default folders. 281 return nodes[0]; 324 // Skip deleting permanent nodes. Permanent bookmark nodes are the root and 325 // its immediate children. For removing all non permanent nodes just remove 326 // all children of non-root permanent nodes. 536 std::vector<const BookmarkNode*>* nodes) { 541 nodes->push_back(*i); 548 std::vector<const BookmarkNode*> nodes; local 535 GetNodesByURL(const GURL& url, std::vector<const BookmarkNode*>* nodes) argument 1015 std::vector<const BookmarkNode*> nodes; local [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
H A D | nv50_ir_ra.cpp | 663 inline RIG_Node *getNode(const LValue *v) const { return &nodes[v->id]; } 693 RIG_Node *nodes; member in class:nv50_ir::GCRA 722 if (!nodes[i].colors) 726 nodes[i].f,nodes[i].reg,nodes[i].colors, 727 nodes[i].weight, 728 nodes[i].degree, nodes[i].degreeLimit); 730 for (Graph::EdgeIterator ei = nodes[ [all...] |
/external/mesa3d/src/gallium/drivers/nv50/codegen/ |
H A D | nv50_ir_ra.cpp | 663 inline RIG_Node *getNode(const LValue *v) const { return &nodes[v->id]; } 693 RIG_Node *nodes; member in class:nv50_ir::GCRA 722 if (!nodes[i].colors) 726 nodes[i].f,nodes[i].reg,nodes[i].colors, 727 nodes[i].weight, 728 nodes[i].degree, nodes[i].degreeLimit); 730 for (Graph::EdgeIterator ei = nodes[ [all...] |
/external/chromium_org/content/browser/accessibility/ |
H A D | browser_accessibility_manager_unittest.cc | 132 // the three nodes in the tree. 148 // Now delete the manager, and only one of the three nodes in the tree 255 msg->nodes.push_back(tree2_root); 256 msg->nodes.push_back(tree2_child0); 431 msg->nodes.push_back(tree2_container); 432 msg->nodes.push_back(tree2_child0); 433 msg->nodes.push_back(tree2_grandchild0); 538 msg->nodes.push_back(tree2_1); 539 msg->nodes.push_back(tree2_4); 540 msg->nodes [all...] |
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
H A D | NavigatorView.js | 100 var nodes = this._uiSourceCodeNodes.values(); 101 for (var i = 0; i < nodes.length; ++i) { 102 var uiSourceCode = nodes[i].uiSourceCode(); 233 var nodes = this._uiSourceCodeNodes.values(); 234 for (var i = 0; i < nodes.length; ++i) 235 nodes[i].dispose(); 1104 var nodes = []; 1107 nodes.push(treeNode); 1115 for (var i = 0; i < nodes.length; ++i) { 1116 delete nodes[ [all...] |
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
H A D | GrammarAST.java | 50 * class to track variables for many different kinds of nodes. It wastes 51 * space for nodes that don't need the values and OO principles cry out 75 /** This is used for TREE_BEGIN nodes to point into 81 /** Rule ref nodes, token refs, set, and NOT set refs need to track their 402 List<GrammarAST> nodes = new ArrayList<GrammarAST>(); 403 _findAllType(ttype, nodes); 404 return nodes; 407 public void _findAllType(int ttype, List<GrammarAST> nodes) { argument 409 if ( this.getType()==ttype ) nodes.add(this); 413 child._findAllType(ttype, nodes); [all...] |
/external/chromium_org/chrome/browser/ui/views/bookmarks/ |
H A D | bookmark_menu_delegate.cc | 211 // Dropping after these nodes makes no sense. 282 std::vector<const BookmarkNode*> nodes; local 283 nodes.push_back(menu_id_to_node_map_[id]); 285 (nodes[0]->parent() == BookmarkModelFactory::GetForProfile( 287 nodes[0]->parent()->child_count() == 1); 294 nodes[0]->parent(), 295 nodes, 371 // to support different parents, but this would need to prune any nodes whose 372 // parent has been removed. As all nodes currently have the same parent, there 376 // Remove any descendants of the removed nodes i [all...] |
/external/chromium_org/third_party/WebKit/Source/core/page/ |
H A D | PageSerializer.cpp | 113 SerializerMarkupAccumulator::SerializerMarkupAccumulator(PageSerializer* serializer, Document* document, Vector<Node*>* nodes) argument 114 : MarkupAccumulator(nodes, ResolveAllURLs) 200 Vector<Node*> nodes; local 201 SerializerMarkupAccumulator accumulator(this, document, &nodes); 213 for (Vector<Node*>::iterator iter = nodes.begin(); iter != nodes.end(); ++iter) {
|
/external/doclava/res/assets/templates/assets/ |
H A D | doclava-developer-docs.js | 449 var nodes = $("#header-tabs").find("."+lang); 450 for (i=0; i < nodes.length; i++) { // for each node in this language 451 var node = $(nodes[i]); 463 var nodes = $("#side-nav").find("."+lang); 464 for (i=0; i < nodes.length; i++) { // for each node in this language 465 var node = $(nodes[i]);
|
/external/chromium_org/chrome/browser/sync/test/integration/ |
H A D | bookmarks_helper.cc | 129 // Returns the number of nodes of node type |node_type| in |model| whose 135 // Walk through the model tree looking for bookmark nodes of node type 668 std::vector<const BookmarkNode*> nodes; local 669 GetBookmarkModel(profile)->GetNodesByURL(node->url(), &nodes); 670 EXPECT_TRUE(nodes.size() >= 1); 671 for (std::vector<const BookmarkNode*>::const_iterator it = nodes.begin(); 672 it != nodes.end(); ++it) { 684 std::vector<const BookmarkNode*> nodes; local 685 GetBookmarkModel(profile)->GetNodesByURL(url, &nodes); 686 return !nodes 690 std::vector<const BookmarkNode*> nodes; local [all...] |
/external/chromium_org/chrome/test/pyautolib/ |
H A D | dom_mutation_observer.js | 141 var nodes = document.evaluate(xpath, document, null, 144 while ( (node = nodes.iterateNext()) ) {
|
/external/chromium_org/third_party/openssl/openssl/apps/ |
H A D | CA.sh | 58 echo "usage: $0 -newcert|-newreq|-newreq-nodes|-newca|-sign|-verify" >&2 96 -newreq-nodes) 98 $REQ -new -nodes -keyout newreq.pem -out newreq.pem $DAYS
|
/external/libsepol/ |
H A D | Android.mk | 27 src/nodes.c \
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter5/ |
H A D | ast.ml | 5 (* expr - Base type for all expression nodes. *)
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter6/ |
H A D | ast.ml | 5 (* expr - Base type for all expression nodes. *)
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter7/ |
H A D | ast.ml | 5 (* expr - Base type for all expression nodes. *)
|
/external/openssl/apps/ |
H A D | CA.sh | 58 echo "usage: $0 -newcert|-newreq|-newreq-nodes|-newca|-sign|-verify" >&2 96 -newreq-nodes) 98 $REQ -new -nodes -keyout newreq.pem -out newreq.pem $DAYS
|
/external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
H A D | NodeSorter.java | 35 * This class can sort vectors of DOM nodes according to a select pattern. 65 * Given a vector of nodes, sort each node according to 87 // based on the input vector of nodes 88 Vector nodes = new Vector(); 94 nodes.addElement(elem); 99 mergesort(nodes, scratchVector, 0, n - 1, support); 101 // return sorted vector of nodes 104 v.setItem(((NodeCompareElem) nodes.elementAt(i)).m_node, i); 114 * Return the results of a compare of two nodes. 122 * @return The results of the compare of the two nodes [all...] |