HomeSort by relevance Sort by last modified time
    Searched defs:addNode (Results 1 - 24 of 24) sorted by null

  /external/apache-xml/src/main/java/org/apache/xpath/objects/
XNodeSetForDOM.java 46 ((NodeSetDTM) m_obj).addNode(dtmHandle);
XNodeSet.java 113 ((NodeSetDTM) m_obj).addNode(n);
  /external/llvm/include/llvm/CodeGen/
LatencyPriorityQueue.h 57 void addNode(const SUnit *SU) {
ResourcePriorityQueue.h 88 void addNode(const SUnit *SU) {
  /external/chromium/chrome/browser/resources/net_internals/
util.js 50 function addNode(parentNode, tagName) {
313 var table = addNode(parent, 'table');
316 var thead = addNode(table, 'thead');
317 var tbody = addNode(table, 'tbody');
321 var tableTitleRow = addNode(thead, 'tr');
332 row = addNode(thead, 'tr');
335 row = addNode(tbody, 'tr');
341 var tableCell = addNode(row, cellType, cell.text);
  /external/clang/lib/StaticAnalyzer/Core/
ExplodedGraph.cpp 161 Preds.addNode(V, G);
162 V->Succs.addNode(this, G);
174 void ExplodedNode::NodeGroup::addNode(ExplodedNode *N, ExplodedGraph &G) {
  /external/apache-xml/src/main/java/org/apache/xpath/
NodeSet.java 135 addNode(node);
379 public void addNode(Node n)
    [all...]
NodeSetDTM.java 173 addNode(handle); // addNodeInDocOrder(handle, xctxt);
189 addNode(node);
535 public void addNode(int n)
    [all...]
  /external/guava/guava/src/com/google/common/collect/
LinkedListMultimap.java 189 private Node<K, V> addNode(
493 previous = addNode((K) key, value, next);
547 addNode(key, value, null);
    [all...]
  /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
LinkedListMultimap.java 185 private Node<K, V> addNode(
489 previous = addNode((K) key, value, next);
543 addNode(key, value, null);
  /external/llvm/include/llvm/ADT/
Trie.h 159 inline Node* addNode(const Payload& data, const std::string label = "") {
174 Node* nNode = addNode(Empty, l1);
189 addNode(Empty);
230 tNode = addNode(data, s1.substr(r));
234 tNode = addNode(data, s1);
  /external/llvm/include/llvm/CodeGen/PBQP/
Graph.h 168 NodeItr addNode(const Vector &costs) {
454 nodeMap[nItr] = addNode(other.getNodeCosts(nItr));
  /external/llvm/lib/Analysis/
PathNumbering.cpp 239 _root = addNode(&(_function.getEntryBlock()));
240 _exit = addNode(NULL);
435 childNode = addNode(succBB);
490 BallLarusNode* BallLarusDag::addNode(BasicBlock* BB) {
  /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/
DTMNodeProxy.java 767 nodeSet.addNode((Node) listVector.elementAt(i));
892 nodeSet.addNode((Node)listVector.elementAt(i));
    [all...]
  /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/dom2dtm/
DOM2DTM.java 130 m_last_kid=addNode(m_root, m_last_parent,m_last_kid, NULL);
135 // %REVIEW% Move this logic into addNode and recurse? Cleaner!
153 // addNode() will take care of switching it from
155 attrIndex=addNode(attrs.item(i),0,attrIndex,NULL);
182 protected int addNode(Node node, int parentIndex,
470 // contiguous sequence, and -- AFTER the DTM addNode -- can be used to
523 int nextindex=addNode(next,m_last_parent,m_last_kid,
540 // addNode() will take care of switching it from
542 attrIndex=addNode(attrs.item(i),
570 attrIndex=addNode(new DOM2DTMdefaultNamespaceDeclarationNode
    [all...]
  /external/icu4c/common/
triedict.cpp 742 void addNode(UChar ch, BuildCompactTrieNode *link, UErrorCode &status) {
867 building->addNode(node->ch, link, status);
    [all...]
  /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/sax2dtm/
SAX2DTM.java 867 protected int addNode(int type, int expandedTypeID,
    [all...]
SAX2DTM2.java     [all...]
  /external/antlr/antlr-3.4/runtime/ActionScript/project/lib/
FlexAntTasks.jar 
  /prebuilt/common/netbeans-visual/
org-netbeans-api-visual.jar 
  /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
org.eclipse.team.core_3.5.100.R36x_v20100825-0800.jar 
  /prebuilt/common/tradefed/
tradefed-prebuilt.jar 
  /prebuilts/tools/common/guava-tools/
guava-10.0.1.jar 
  /prebuilt/common/groovy/
groovy-all-1.7.0.jar 

Completed in 6061 milliseconds