/libcore/dom/src/test/java/org/w3c/domts/level2/core/ |
namednodemapsetnameditemns03.java | 86 Node newNode; 98 newNode = attributesAlt.removeNamedItemNS(nullNS, "street"); 103 newNode = attributes.setNamedItemNS(attr);
|
namednodemapsetnameditemns04.java | 84 Node newNode; 98 newNode = attributes.setNamedItemNS(attrAlt);
|
namednodemapsetnameditemns05.java | 78 Node newNode; 93 newNode = entities.setNamedItemNS(entity); 103 newNode = notations.setNamedItemNS(notation);
|
namednodemapsetnameditemns06.java | 76 Node newNode; 88 newNode = attributes.setNamedItemNS(attr);
|
namednodemapsetnameditemns07.java | 82 Node newNode; 94 newNode = attributes.setNamedItemNS(attr);
|
namednodemapsetnameditemns08.java | 78 Node newNode; 90 newNode = attributes.setNamedItemNS(attr);
|
namednodemapsetnameditemns09.java | 76 Node newNode; 86 newNode = entities.setNamedItemNS(attr); 96 newNode = notations.setNamedItemNS(attr);
|
namednodemapsetnameditemns10.java | 81 Node newNode; 94 newNode = attributes.setNamedItemNS(entity);
|
namednodemapsetnameditemns11.java | 80 Node newNode; 95 newNode = attributes.setNamedItemNS(notation);
|
/external/antlr/antlr-3.4/runtime/C/src/ |
antlr3basetree.c | 272 pANTLR3_BASE_TREE newNode; 278 newNode = t->dupTree(t); 279 newTree->addChild(newTree, newNode);
|
/external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/ |
inttree.c | 317 IntervalTreeNode *x, *y, *newNode; 322 newNode = x; 371 return newNode;
|
/packages/inputmethods/LatinIME/native/jni/src/suggest/core/dicnode/ |
dic_node_priority_queue.h | 202 DicNode *newNode = searchEmptyDicNode(); 203 if (newNode) { 204 DicNodeUtils::initByCopy(dicNode, newNode); 206 return newNode;
|
/sdk/eclipse/plugins/com.android.ide.eclipse.tests/unittests/com/android/ide/common/layout/ |
BaseLayoutRuleTest.java | 168 INode newNode = TestNode.create("a.w.B").id("@+id/foo").set("u", "key", "value").set("u", 175 layout.addAttributes(newNode, oldElement, idMap, filter); 176 assertEquals("value", newNode.getStringAttr("u", "key")); 177 assertEquals("nothiddenvalue", newNode.getStringAttr("u", "nothidden")); 186 INode newNode = TestNode.create("a.w.B").id("@+id/foo").set("u", "key", "value").set("u", 203 layout.addAttributes(newNode, oldElement, idMap, filter); 204 assertEquals("value", newNode.getStringAttr("u", "key")); 237 INode newNode = TestNode.create("a.w.B").id("@+id/foo"); 240 layout.addInnerElements(newNode, oldElement, idMap); 241 assertEquals(2, newNode.getChildren().length) [all...] |
/external/chromium_org/third_party/WebKit/Source/core/inspector/ |
DOMEditor.cpp | 240 Node* newNode() 292 ReplaceChildNodeAction(Node* parentNode, PassRefPtr<Node> newNode, Node* oldNode) 295 , m_newNode(newNode) 381 bool DOMEditor::setOuterHTML(Node* node, const String& html, Node** newNode, ExceptionState& exceptionState) 387 *newNode = rawAction->newNode(); 396 bool DOMEditor::replaceChild(Node* parentNode, PassRefPtr<Node> newNode, Node* oldNode, ExceptionState& exceptionState) 398 return m_history->perform(adoptPtr(new ReplaceChildNodeAction(parentNode, newNode, oldNode)), exceptionState); 444 bool DOMEditor::setOuterHTML(Node* node, const String& html, Node** newNode, ErrorString* errorString) 447 bool result = setOuterHTML(node, html, newNode, exceptionState) [all...] |
DOMPatchSupport.cpp | 167 Node* newNode = newDigest->m_node; 169 if (newNode->nodeType() != oldNode->nodeType() || newNode->nodeName() != oldNode->nodeName()) 170 return m_domEditor->replaceChild(oldNode->parentNode(), newNode, oldNode, exceptionState); 172 if (oldNode->nodeValue() != newNode->nodeValue()) { 173 if (!m_domEditor->setNodeValue(oldNode, newNode->nodeValue(), exceptionState)) 182 Element* newElement = toElement(newNode); 472 Node* newNode = newDigest->m_node; 473 if (!m_domEditor->replaceChild(newNode->parentNode(), oldNode, newNode, exceptionState) [all...] |
/external/chromium_org/third_party/WebKit/Source/core/rendering/ |
RenderCounter.cpp | 312 RefPtr<CounterNode> newNode = CounterNode::create(object, isReset, value); 314 newParent->insertAfter(newNode.get(), newPreviousSibling.get(), identifier); 323 nodeMap->set(identifier, newNode); 324 if (newNode->parent()) 325 return newNode.get(); 343 newNode->insertAfter(currentCounter, newNode->lastChild(), identifier); 345 return newNode.get();
|
/external/chromium_org/third_party/angle/src/compiler/ |
Intermediate.cpp | 474 // Add a new newNode for the conversion. 476 TIntermUnary* newNode = 0; 513 newNode = new TIntermUnary(newOp, type); 514 newNode->setLine(node->getLine()); 515 newNode->setOperand(node); 517 return newNode; [all...] |
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.build.tools/src_rss/org/eclipse/releng/generators/rss/ |
RSSFeedUpdateEntryTask.java | 140 Node newNode=findAndReplace(document); 141 if (debug > 1 && newNode != null) { 144 transformer.transform(new DOMSource(newNode),new StreamResult(System.out)); 151 if (!isNullString(replacement) && newNode != null) {
|
/external/icu4c/common/ |
stringtriebuilder.cpp | 317 StringTrieBuilder::registerNode(Node *newNode, UErrorCode &errorCode) { 319 delete newNode; 322 if(newNode==NULL) { 326 const UHashElement *old=uhash_find(nodes, newNode); 328 delete newNode; 332 // registered node, then uhash_find() failed to find that and we will leak newNode. 336 uhash_puti(nodes, newNode, 1, &errorCode); 339 delete newNode; 342 return newNode; 355 Node *newNode=new FinalValueNode(value) [all...] |
/packages/apps/Gallery2/src/com/android/photos/data/ |
SparseArrayBitmapPool.java | 173 Node newNode = mNodePool.acquire(); 174 if (newNode == null) { 175 newNode = new Node(); 177 newNode.bitmap = b; 181 newNode.prevInBucket = null; 182 newNode.prevInPool = null; 183 newNode.nextInPool = mPoolNodesHead; 184 mPoolNodesHead = newNode; 188 newNode.nextInBucket = mStore.get(key); 189 if (newNode.nextInBucket != null) [all...] |
/system/core/include/sysutils/ |
List.h | 214 _Node* newNode = new _Node(val); // alloc & copy-construct 215 newNode->setNext(posn.getNode()); 216 newNode->setPrev(posn.getNode()->getPrev()); 217 posn.getNode()->getPrev()->setNext(newNode); 218 posn.getNode()->setPrev(newNode); 219 return iterator(newNode);
|
/system/core/include/utils/ |
List.h | 213 _Node* newNode = new _Node(val); // alloc & copy-construct 214 newNode->setNext(posn.getNode()); 215 newNode->setPrev(posn.getNode()->getPrev()); 216 posn.getNode()->getPrev()->setNext(newNode); 217 posn.getNode()->setPrev(newNode); 218 return iterator(newNode);
|
/system/netd/ |
List.h | 214 _Node* newNode = new _Node(val); // alloc & copy-construct 215 newNode->setNext(posn.getNode()); 216 newNode->setPrev(posn.getNode()->getPrev()); 217 posn.getNode()->getPrev()->setNext(newNode); 218 posn.getNode()->setPrev(newNode); 219 return iterator(newNode);
|
/external/llvm/lib/Analysis/ |
PathNumbering.cpp | 490 BallLarusNode* newNode = createNode(BB); 491 _nodes.push_back(newNode); 492 return( newNode );
|
/libcore/luni/src/main/java/java/util/concurrent/ |
ConcurrentLinkedQueue.java | 240 Node<E> newNode = new Node<E>(e); 242 h = t = newNode; 244 t.lazySetNext(newNode); 245 t = newNode; 296 final Node<E> newNode = new Node<E>(e); 302 if (p.casNext(null, newNode)) { 305 // and for newNode to become "live". 307 casTail(t, newNode); // Failure is OK. 494 Node<E> newNode = new Node<E>(e); 496 beginningOfTheEnd = last = newNode; [all...] |