| /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/compiler-rt/lib/sanitizer_common/tests/ |
| sanitizer_deadlock_detector_test.cc | 53 uptr node = d.newNode(0);
61 uptr node = d.newNode(0);
69 uptr node = d.newNode(0);
77 uptr n1 = d.newNode(1);
78 uptr n2 = d.newNode(2);
101 uptr n1 = d.newNode(1);
102 uptr n2 = d.newNode(2);
103 uptr n3 = d.newNode(3);
143 uptr l0 = d.newNode(0);
144 uptr l1 = d.newNode(1)
[all...] |
| /external/chromium-trace/catapult/third_party/vinn/third_party/parse5/lib/tree_adapters/ |
| htmlparser2.js | 162 var appendChild = exports.appendChild = function (parentNode, newNode) {
166 prev.next = newNode;
167 newNode.prev = prev;
170 parentNode.children.push(newNode);
171 newNode.parent = parentNode;
174 var insertBefore = exports.insertBefore = function (parentNode, newNode, referenceNode) {
179 prev.next = newNode;
180 newNode.prev = prev;
183 referenceNode.prev = newNode;
184 newNode.next = referenceNode
[all...] |
| default.js | 83 var appendChild = exports.appendChild = function (parentNode, newNode) {
84 parentNode.childNodes.push(newNode);
85 newNode.parentNode = parentNode;
88 var insertBefore = exports.insertBefore = function (parentNode, newNode, referenceNode) {
91 parentNode.childNodes.splice(insertionIdx, 0, newNode);
92 newNode.parentNode = parentNode;
|
| /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);
|
| namednodemapsetnameditemns05.java | 78 Node newNode;
93 newNode = entities.setNamedItemNS(entity);
103 newNode = notations.setNamedItemNS(notation);
|
| namednodemapsetnameditemns02.java | 78 Node newNode;
84 newNode = attributes.setNamedItemNS(attribute1);
|
| namednodemapsetnameditemns04.java | 84 Node newNode;
98 newNode = attributes.setNamedItemNS(attrAlt);
|
| 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);
|
| namednodemapsetnameditemns10.java | 81 Node newNode;
94 newNode = attributes.setNamedItemNS(entity);
|
| namednodemapsetnameditemns11.java | 80 Node newNode;
95 newNode = attributes.setNamedItemNS(notation);
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentLinkedQueue.java | 161 static <E> Node<E> newNode(E item) {
211 head = tail = newNode(null);
226 Node<E> newNode = newNode(Objects.requireNonNull(e));
228 h = t = newNode;
230 lazySetNext(t, newNode);
231 t = newNode;
235 h = t = newNode(null);
282 final Node<E> newNode = newNode(Objects.requireNonNull(e))
[all...] |
| ConcurrentLinkedDeque.java | 323 final Node<E> newNode = new Node<E>(Objects.requireNonNull(e));
337 newNode.lazySetNext(p); // CAS piggyback
338 if (p.casPrev(null, newNode)) {
341 // and for newNode to become "live".
343 casHead(h, newNode); // Failure is OK.
355 final Node<E> newNode = new Node<E>(Objects.requireNonNull(e));
369 newNode.lazySetPrev(p); // CAS piggyback
370 if (p.casNext(null, newNode)) {
373 // and for newNode to become "live".
375 casTail(t, newNode); // Failure is OK
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| DOMBuilder.java | 173 * @param newNode New node to append
175 protected void append(Node newNode) throws org.xml.sax.SAXException
183 currentNode.insertBefore(newNode, m_nextSibling);
185 currentNode.appendChild(newNode);
187 // System.out.println(newNode.getNodeName());
192 m_docFrag.insertBefore(newNode, m_nextSibling);
194 m_docFrag.appendChild(newNode);
199 short type = newNode.getNodeType();
203 String data = newNode.getNodeValue();
229 m_doc.insertBefore(newNode, m_nextSibling)
[all...] |
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/prefs/ |
| MockAbstractPreferences.java | 52 boolean newNode) {
54 super.newNode = newNode;
201 return newNode;
|
| /libcore/ojluni/src/main/java/java/util/ |
| LinkedList.java | 127 final Node<E> newNode = new Node<>(null, e, f);
128 first = newNode;
130 last = newNode;
132 f.prev = newNode;
142 final Node<E> newNode = new Node<>(l, e, null);
143 last = newNode;
145 first = newNode;
147 l.next = newNode;
158 final Node<E> newNode = new Node<>(pred, e, succ);
159 succ.prev = newNode;
[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/keymaster/ |
| 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);
|
| /external/icu/icu4c/source/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...] |
| /external/icu/android_icu4j/src/main/java/android/icu/util/ |
| StringTrieBuilder.java | 132 * equivalent to newNode, unless BUILDING_FAST.
133 * @param newNode Input node. The builder takes ownership.
134 * @return newNode if it is the first of its kind, or
135 * an equivalent node if newNode is a duplicate.
137 private final Node registerNode(Node newNode) {
139 return newNode;
142 Node oldNode=nodes.get(newNode);
147 // registered node, then get() failed to find that and we will leak newNode.
148 oldNode=nodes.put(newNode, newNode);
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
| StringTrieBuilder.java | 134 * equivalent to newNode, unless BUILDING_FAST.
135 * @param newNode Input node. The builder takes ownership.
136 * @return newNode if it is the first of its kind, or
137 * an equivalent node if newNode is a duplicate.
139 private final Node registerNode(Node newNode) {
141 return newNode;
144 Node oldNode=nodes.get(newNode);
149 // registered node, then get() failed to find that and we will leak newNode.
150 oldNode=nodes.put(newNode, newNode);
[all...] |
| /frameworks/base/tools/aapt2/xml/ |
| XmlDom.cpp | 246 std::unique_ptr<Node> newNode;
260 newNode = std::move(node);
279 newNode = std::move(node);
290 newNode = std::move(node);
305 if (newNode) {
306 newNode->lineNumber = tree.getLineNumber();
308 Node* thisNode = newNode.get();
311 root = std::move(newNode);
314 nodeStack.top()->addChild(std::move(newNode));
|
