Searched refs:nodes (Results 1 - 25 of 81) sorted by relevance

1234

/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Bytecodes/src/com/sun/hotspot/igv/bytecodes/
H A DSelectBytecodesCookie.java29 import org.openide.nodes.Node;
37 private Set<InputNode> nodes; field in class:SelectBytecodesCookie
40 public SelectBytecodesCookie(Set<InputNode> nodes) { argument
41 this.nodes = nodes;
45 return Collections.unmodifiableSet(nodes);
H A DBytecodeNode.java36 import org.openide.nodes.AbstractNode;
37 import org.openide.nodes.Children;
38 import org.openide.nodes.Node;
47 private Set<InputNode> nodes; field in class:BytecodeNode
61 nodes = new HashSet<InputNode>();
63 nodes.add(n);
65 this.setDisplayName(this.getDisplayName() + " (" + nodes.size() + " nodes)");
71 if (nodes != null) {
95 if (aClass == SelectBytecodesCookie.class && nodes !
[all...]
H A DMethodNode.java30 import org.openide.nodes.AbstractNode;
31 import org.openide.nodes.Children;
32 import org.openide.nodes.Node;
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/dom/
H A DNamedNodeMapImpl.java37 * by name. Entity and Notation nodes are stored in NamedNodeMaps
48 * accessed by DOM level 2 nodes. All nodes, even DOM Level 2 nodes are stored
51 * NOTE: item()'s integer index does _not_ imply that the named nodes
54 * contents, the indices associated with nodes may change.
83 protected List nodes; field in class:NamedNodeMapImpl
101 * Report how many nodes are currently stored in this NamedNodeMap.
107 return (nodes != null) ? nodes
[all...]
H A DAttributeMap.java33 * <li>managing ownership of attribute nodes
60 if (nodes != null) {
112 previous = (AttrImpl) nodes.get(i);
113 nodes.set(i, arg);
120 if (null == nodes) {
121 nodes = new ArrayList(5);
123 nodes.add(i, arg);
181 previous = (AttrImpl) nodes.get(i);
182 nodes.set(i, arg);
192 previous = (AttrImpl) nodes
[all...]
H A DDeepNodeListImpl.java34 * 1) It may represent EITHER nodes scattered through a subtree (when
46 * 3) Its API accesses individual nodes via an integer index, with the
47 * listed nodes numbered sequentially in the order that they were
50 * nodes are inserted or deleted in the tree, and hence the NodeList,
51 * the numbering of nodes that follow them in the NodeList will
86 protected Vector nodes; field in class:DeepNodeListImpl
99 nodes = new Vector();
118 return nodes.size();
127 nodes = new Vector();
132 if (index < nodes
[all...]
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Coordinator/src/com/sun/hotspot/igv/coordinator/actions/
H A DRemoveCookie.java28 import org.openide.nodes.Node;
H A DRemoveAction.java28 import org.openide.nodes.Node;
70 protected boolean enable(Node[] nodes) { argument
71 return nodes.length > 0;
H A DDiffGraphAction.java27 import org.openide.nodes.Node;
/openjdk7/jaxp/src/com/sun/org/apache/xalan/internal/xsltc/dom/
H A DKeyIndex.java40 * Stores mappings of key values or IDs to DTM nodes.
101 IntegerArray nodes = (IntegerArray) _index.get(value);
103 if (nodes == null) {
104 nodes = new IntegerArray();
105 _index.put(value, nodes);
106 nodes.add(node);
108 // Because nodes are added in document order,
110 } else if (node != nodes.at(nodes.cardinality() - 1)) {
111 nodes
566 KeyIndexHeapNode(IntegerArray nodes) argument
[all...]
H A DArrayNodeListIterator.java38 public ArrayNodeListIterator(int[] nodes) { argument
39 _nodes = nodes;
/openjdk7/jdk/src/share/classes/com/sun/org/apache/xml/internal/security/utils/
H A DHelperNodeList.java36 /** Field nodes */
37 ArrayList nodes = new ArrayList(20); field in class:HelperNodeList
63 // log.log(java.util.logging.Level.FINE, "item(" + index + ") of " + this.getLength() + " nodes");
65 return (Node) nodes.get(index);
74 return nodes.size();
89 nodes.add(node);
/openjdk7/jdk/src/share/classes/com/sun/jmx/snmp/IPAcl/
H A DJJTParserState.java32 private java.util.Stack nodes; field in class:JJTParserState
35 private int sp; // number of nodes on stack
40 nodes = new java.util.Stack();
56 nodes.removeAllElements();
65 return (Node)nodes.elementAt(0);
70 nodes.push(n);
80 return (Node)nodes.pop();
85 return (Node)nodes.peek();
111 children. That number of nodes are popped from the stack and
128 the nodes tha
[all...]
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/View/src/com/sun/hotspot/igv/view/
H A DEditorInputGraphProvider.java46 public void setSelectedNodes(Set<InputNode> nodes) { argument
49 e.setSelectedNodes(nodes);
/openjdk7/hotspot/src/share/tools/LogCompilation/src/com/sun/hotspot/tools/compiler/
H A DPhase.java36 Phase(String n, double s, int nodes, int live) { argument
38 startNodes = nodes;
61 /* Number of live nodes added by the phase */
/openjdk7/jaxp/src/com/sun/org/apache/xpath/internal/functions/
H A DFuncSum.java51 DTMIterator nodes = m_arg0.asIterator(xctxt, xctxt.getCurrentNode());
55 while (DTM.NULL != (pos = nodes.nextNode()))
57 DTM dtm = nodes.getDTM(pos);
63 nodes.detach();
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Data/src/com/sun/hotspot/igv/data/services/
H A DInputGraphProvider.java39 void setSelectedNodes(Set<InputNode> nodes); argument
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/FilterWindow/src/com/sun/hotspot/igv/filterwindow/
H A DCheckNode.java27 import org.openide.nodes.AbstractNode;
28 import org.openide.nodes.Children;
H A DCheckNodeListModel.java27 import org.openide.nodes.Node;
/openjdk7/jdk/test/java/rmi/reliability/benchmark/bench/rmi/
H A DObjArrayCalls.java91 Node[] nodes = new Node[size];
93 nodes[i] = new Node(null, 0);
97 stub.call(nodes);
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Data/src/com/sun/hotspot/igv/data/
H A DInputBlock.java39 private List<InputNode> nodes; field in class:InputBlock
52 nodes = new ArrayList<InputNode>();
81 return Collections.unmodifiableList(nodes);
92 assert !nodes.contains(node);
93 nodes.add(node);
H A DInputGraph.java40 private HashMap<Integer, InputNode> nodes; field in class:InputGraph
63 nodes = new HashMap<Integer, InputNode>();
92 assert nodes.get(n.getId()) == n;
161 return Collections.unmodifiableCollection(nodes.values());
165 return Collections.unmodifiableSet(nodes.keySet());
173 nodes.put(node.getId(), node);
177 return nodes.get(id);
181 return nodes.remove(index);
208 for (InputNode n : nodes.values()) {
/openjdk7/jdk/src/share/classes/javax/imageio/spi/
H A DPartiallyOrderedSet.java64 private Set nodes = poNodes.keySet(); field in class:PartiallyOrderedSet
72 return nodes.size();
76 return nodes.contains(o);
93 if (nodes.contains(o)) {
122 * Sets an ordering between two nodes. When an iterator is
125 * between the nodes in the opposite order, it is removed.
128 * between the nodes, <code>false</code>otherwise.
141 * Removes any ordering between two nodes.
143 * @return true if a prior prefence existed between the nodes.
157 * nodes
[all...]
/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/dtm/ref/
H A DDTMDocumentImpl.java119 // nodes array: integer array blocks to hold the first level reference of the nodes,
123 ChunkedIntArray nodes = new ChunkedIntArray(4); field in class:DTMDocumentImpl
166 initDocument(documentNumber); // clear nodes and document handle
170 /** Bind a IncrementalSAXSource to this DTM. If we discover we need nodes
211 int slotnumber = nodes.appendSlot(w0, w1, w2, w3);
216 nodes.writeEntry(previousSibling,2,slotnumber);
630 nodes.writeSlot(0,DOCUMENT_NODE,-1,-1,0);
687 // // do document root node creation here on the first element, create nodes for
689 // // name indexes to the nodes arra
[all...]
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Util/src/com/sun/hotspot/igv/util/
H A DPropertiesSheet.java30 import org.openide.nodes.Node;
31 import org.openide.nodes.Sheet;

Completed in 5112 milliseconds

1234