/libcore/luni/src/main/java/org/w3c/dom/ |
H A D | DOMImplementationList.java | 26 * Returns the <code>index</code>th item in the collection. If 35 public DOMImplementation item(int index); method in interface:DOMImplementationList
|
H A D | NodeList.java | 25 * Returns the <code>index</code>th item in the collection. If 33 public Node item(int index); method in interface:NodeList
|
H A D | DOMStringList.java | 26 * Returns the <code>index</code>th item in the collection. If 34 public String item(int index); method in interface:DOMStringList
|
/libcore/ojluni/src/main/java/java/util/ |
H A D | Stack.java | 33 * method to <tt>peek</tt> at the top item on the stack, a method to test 35 * the stack for an item and discover how far it is from the top. 57 * Pushes an item onto the top of this stack. This has exactly 60 * addElement(item)</pre></blockquote> 62 * @param item the item to be pushed onto this stack. 63 * @return the <code>item</code> argument. 66 public E push(E item) { argument 67 addElement(item); 69 return item; [all...] |
H A D | LinkedList.java | 92 * (first.prev == null && first.item != null) 99 * (last.next == null && last.item != null) 173 final E element = f.item; 175 f.item = null; 192 final E element = l.item; 194 l.item = null; 211 final E element = x.item; 229 x.item = null; 245 return f.item; 258 return l.item; 972 E item; field in class:LinkedList.Node [all...] |
/libcore/luni/src/main/java/javax/xml/xpath/ |
H A D | XPathExpression.java | 38 * of a context item, an empty document node will be used for the context. 87 * <p>See <a href="#XPathExpression-evaluation">Evaluation of XPath Expressions</a> for context item evaluation, 94 * <code>item</code>, an empty document will be used for the 98 * @param item The starting context (node or node list, for example). 108 public Object evaluate(Object item, QName returnType) argument 114 * <p>This method calls {@link #evaluate(Object item, QName returnType)} with a <code>returnType</code> of 117 * <p>See <a href="#XPathExpression-evaluation">Evaluation of XPath Expressions</a> for context item evaluation, 121 * <code>item</code>, an empty document will be used for the 124 * @param item The starting context (node or node list, for example). 131 public String evaluate(Object item) argument [all...] |
/libcore/dom/src/test/java/org/w3c/domts/level1/core/ |
H A D | hc_namednodemapchildnoderange.java | 72 testEmployee = elementList.item(2); 80 child = attributes.item(2); 84 child = attributes.item(0); 86 child = attributes.item(1); 88 child = attributes.item(3);
|
H A D | namednodemapchildnoderange.java | 73 testEmployee = elementList.item(2); 77 child = attributes.item(0); 78 child = attributes.item(1);
|
H A D | hc_attrchildnodes2.java | 69 testNode = acronymList.item(3); 76 textNode = (Text) childNodes.item(0); 79 textNode = (Text) childNodes.item(1); 82 textNode = (Text) childNodes.item(2);
|
H A D | hc_nodeinsertbeforedocfragment.java | 81 employeeNode = elementList.item(1); 83 refChild = childList.item(3); 90 child = childList.item(3); 93 child = childList.item(4);
|
H A D | nodeinsertbeforedocfragment.java | 81 employeeNode = elementList.item(1); 83 refChild = childList.item(3); 90 child = childList.item(3); 93 child = childList.item(4);
|
H A D | nodeinsertbeforenewchildexists.java | 105 employeeNode = elementList.item(1); 111 refChild = childList.item(5); 112 newChild = childList.item(0); 115 refChild = childList.item(11); 116 newChild = childList.item(1); 121 child = (Node) childList.item(indexN100DD);
|
H A D | nodereplacechildnewchildexists.java | 101 employeeNode = elementList.item(1); 106 newChild = childList.item(1); 107 oldChild = childList.item(11); 110 newChild = childList.item(0); 111 oldChild = childList.item(5); 118 childNode = (Node) childList.item(indexN100DE);
|
H A D | hc_nodeattributenodeattribute.java | 70 testAddr = (Element) elementList.item(0); 72 attrNode = addrAttr.item(0);
|
H A D | hc_nodeclonefalsenocopytext.java | 72 employeeNode = elementList.item(1); 74 childNode = childList.item(3);
|
H A D | hc_nodelistindexnotzero.java | 73 employeeNode = elementList.item(2); 75 child = employeeList.item(3);
|
H A D | hc_nodelistreturnfirstitem.java | 33 * "item(index)" method with an index=0. This should 69 employeeNode = elementList.item(2); 71 child = employeeList.item(0);
|
H A D | namednodemapreturnfirstitem.java | 31 * The "item(index)" method returns the indexth item in 32 * the map(test for first item). 74 testAddress = elementList.item(1); 76 child = attributes.item(0);
|
H A D | namednodemapreturnlastitem.java | 31 * The "item(index)" method returns the indexth item in 32 * the map(test for last item). 74 testEmployee = elementList.item(1); 76 child = attributes.item(1);
|
H A D | nodeattributenodeattribute.java | 71 testAddr = (Element) elementList.item(0); 73 attrNode = addrAttr.item(0);
|
H A D | nodechildnodesempty.java | 73 employeeNode = elementList.item(1); 75 secondCNode = childList.item(1);
|
/libcore/luni/src/main/java/java/util/concurrent/ |
H A D | ConcurrentLinkedQueue.java | 101 * Nodes that are reachable from head. CASing the item 131 * CASing a Node's item reference to null atomically removes the 140 * for a volatile write to item by using Unsafe.putObject instead 145 * non-null item. If the queue is empty, all items must of course 147 * Node with null item. Both head and tail are only updated using 153 volatile E item; field in class:ConcurrentLinkedQueue.Node 158 * Returns a new node holding item. Uses relaxed write because item 161 static <E> Node<E> newNode(E item) { argument 163 U.putObject(node, ITEM, item); [all...] |
H A D | ConcurrentLinkedDeque.java | 84 * A node contains the expected E ("item") and links to predecessor 87 * class Node<E> { volatile Node<E> prev, next; volatile E item; } 89 * A node p is considered "live" if it contains a non-null item 90 * (p.item != null). When an item is CASed to null, the item is 115 * p.item != null || 130 * 1. "logical deletion" by CASing item to null atomically removes 231 * - head.item may or may not be null 245 * - tail.item ma 264 volatile E item; field in class:ConcurrentLinkedDeque.Node 274 Node(E item) argument [all...] |
H A D | LinkedTransferQueue.java | 108 * "item" field from a non-null data value to null upon match, and 128 * from a pointer to the initial node; CASing the item of the 172 * operations up to the point of matching or appending an item 424 volatile Object item; // initially non-null if isData; CASed to match field in class:LinkedTransferQueue.Node 439 * Constructs a new node. Uses relaxed write because item can 442 Node(Object item, boolean isData) { argument 443 U.putObject(this, ITEM, item); // relaxed write 456 * Sets item to self and waiter to null, to avoid garbage 459 * contexts: item is forgotten only after volatile/atomic 474 Object x = item; [all...] |
H A D | Exchanger.java | 77 * and a participant (caller) with an item: 81 * place item in a Node; 84 * return matching item in node; 88 * get the item in node; 89 * set matching item in node; 214 * uses. Note that field Node.item is not declared as volatile 286 Object item; // This thread's current item field in class:Exchanger.Node 323 * @param item the (non-null) item t 329 arenaExchange(Object item, boolean timed, long ns) argument 422 slotExchange(Object item, boolean timed, long ns) argument [all...] |