Searched refs:item (Results 1 - 25 of 590) sorted by relevance

1234567891011>>

/libcore/luni/src/main/java/org/w3c/dom/
H A DDOMImplementationList.java26 * Returns the <code>index</code>th item in the collection. If
35 public DOMImplementation item(int index); method in interface:DOMImplementationList
H A DNodeList.java25 * Returns the <code>index</code>th item in the collection. If
33 public Node item(int index); method in interface:NodeList
H A DDOMStringList.java26 * Returns the <code>index</code>th item in the collection. If
34 public String item(int index); method in interface:DOMStringList
/libcore/tools/docs/crypto/
H A Dcrypto_docs.py36 for item in seq:
37 if item['name'] == name:
38 return item
/libcore/ojluni/src/main/java/java/util/
H A DStack.java33 * 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 DLinkedList.java92 * (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;
971 E item; field in class:LinkedList.Node
[all...]
/libcore/luni/src/main/java/javax/xml/xpath/
H A DXPathExpression.java38 * 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 Dhc_namednodemapchildnoderange.java72 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 Dnamednodemapchildnoderange.java73 testEmployee = elementList.item(2);
77 child = attributes.item(0);
78 child = attributes.item(1);
H A Dhc_attrchildnodes2.java69 testNode = acronymList.item(3);
76 textNode = (Text) childNodes.item(0);
79 textNode = (Text) childNodes.item(1);
82 textNode = (Text) childNodes.item(2);
H A Dhc_nodeinsertbeforedocfragment.java81 employeeNode = elementList.item(1);
83 refChild = childList.item(3);
90 child = childList.item(3);
93 child = childList.item(4);
H A Dnodeinsertbeforedocfragment.java81 employeeNode = elementList.item(1);
83 refChild = childList.item(3);
90 child = childList.item(3);
93 child = childList.item(4);
H A Dnodeinsertbeforenewchildexists.java105 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 Dnodereplacechildnewchildexists.java101 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 Dhc_nodeattributenodeattribute.java70 testAddr = (Element) elementList.item(0);
72 attrNode = addrAttr.item(0);
H A Dhc_nodeclonefalsenocopytext.java72 employeeNode = elementList.item(1);
74 childNode = childList.item(3);
H A Dhc_nodelistindexnotzero.java73 employeeNode = elementList.item(2);
75 child = employeeList.item(3);
H A Dhc_nodelistreturnfirstitem.java33 * "item(index)" method with an index=0. This should
69 employeeNode = elementList.item(2);
71 child = employeeList.item(0);
H A Dnamednodemapreturnfirstitem.java31 * 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 Dnamednodemapreturnlastitem.java31 * 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);
/libcore/ojluni/src/main/java/sun/security/util/
H A DAbstractAlgorithmConstraints.java84 for (String item : algorithms) {
85 if (item == null || item.isEmpty()) {
90 if (item.equalsIgnoreCase(algorithm)) {
101 if (item.equalsIgnoreCase(element)) {
/libcore/ojluni/src/main/java/java/util/concurrent/
H A DConcurrentLinkedQueue.java130 * Nodes that are reachable from head. CASing the item
160 * CASing a Node's item reference to null atomically removes the
169 * for a volatile write to item by using Unsafe.putObject instead
174 * non-null item. If the queue is empty, all items must of course
176 * Node with null item. Both head and tail are only updated using
182 volatile E item; field in class:ConcurrentLinkedQueue.Node
187 * Returns a new node holding item. Uses relaxed write because item
190 static <E> Node<E> newNode(E item) { argument
192 U.putObject(node, ITEM, item);
[all...]
H A DConcurrentLinkedDeque.java113 * A node contains the expected E ("item") and links to predecessor
116 * class Node<E> { volatile Node<E> prev, next; volatile E item; }
118 * A node p is considered "live" if it contains a non-null item
119 * (p.item != null). When an item is CASed to null, the item is
144 * p.item != null ||
159 * 1. "logical deletion" by CASing item to null atomically removes
260 * - head.item may or may not be null
274 * - tail.item ma
293 volatile E item; field in class:ConcurrentLinkedDeque.Node
303 Node(E item) argument
[all...]
H A DLinkedTransferQueue.java137 * "item" field from a non-null data value to null upon match, and
157 * from a pointer to the initial node; CASing the item of the
201 * operations up to the point of matching or appending an item
453 volatile Object item; // initially non-null if isData; CASed to match field in class:LinkedTransferQueue.Node
468 * Constructs a new node. Uses relaxed write because item can
471 Node(Object item, boolean isData) { argument
472 U.putObject(this, ITEM, item); // relaxed write
485 * Sets item to self and waiter to null, to avoid garbage
488 * contexts: item is forgotten only after volatile/atomic
503 Object x = item;
[all...]
H A DExchanger.java106 * and a participant (caller) with an item:
110 * place item in a Node;
113 * return matching item in node;
117 * get the item in node;
118 * set matching item in node;
243 * uses. Note that field Node.item is not declared as volatile
315 Object item; // This thread's current item field in class:Exchanger.Node
352 * @param item the (non-null) item t
358 arenaExchange(Object item, boolean timed, long ns) argument
451 slotExchange(Object item, boolean timed, long ns) argument
[all...]

Completed in 511 milliseconds

1234567891011>>