Searched defs:nodes (Results 1 - 25 of 50) sorted by relevance

12

/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...]
/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/View/src/com/sun/hotspot/igv/view/
H A DEditorInputGraphProvider.java46 public void setSelectedNodes(Set<InputNode> nodes) { argument
49 e.setSelectedNodes(nodes);
H A DDiagramViewModel.java209 public void setSelectedNodes(Set<Integer> nodes) { argument
210 this.selectedNodes = nodes;
215 if (nodes.size() >= 1) {
216 for (Integer id : nodes) {
251 public void setHiddenNodes(Set<Integer> nodes) { argument
252 this.hiddenNodes = nodes;
H A DEditorTopComponent.java447 public void setSelectedNodes(Set<InputNode> nodes) { argument
451 for (InputNode n : nodes) {
494 HashSet<Integer> nodes = new HashSet<Integer>(scene.getModel().getHiddenNodes());
495 nodes.addAll(selectedNodes);
496 this.scene.showNot(nodes);
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Coordinator/src/com/sun/hotspot/igv/coordinator/actions/
H A DRemoveAction.java28 import org.openide.nodes.Node;
70 protected boolean enable(Node[] nodes) { argument
71 return nodes.length > 0;
H A DSaveAsAction.java38 import org.openide.nodes.Node;
113 protected boolean enable(Node[] nodes) { argument
116 for (Node n : nodes) {
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/dom/
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...]
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...]
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/opto/
H A DBlock.java74 public Node_List nodes() { method in class:Block
82 Node_List nl = nodes();
H A DNode.java71 static HashMap nodes = new HashMap(); field in class:Node
81 Node result = (Node)nodes.get(addr);
84 nodes.put(addr, result);
/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/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/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/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/xalan/internal/xsltc/dom/
H A DArrayNodeListIterator.java38 public ArrayNodeListIterator(int[] nodes) { argument
39 _nodes = nodes;
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/ControlFlow/src/com/sun/hotspot/igv/controlflow/
H A DHierarchicalGraphLayout.java164 protected void performNodesLayout(UniversalGraph<N, E> graph, Collection<N> nodes) { argument
/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/jaxp/src/com/sun/org/apache/xml/internal/utils/
H A DNodeVector.java44 * Array of nodes this points to.
50 * Number of nodes in this NodeVector.
106 * @return Number of nodes in this NodeVector
239 * Push a pair of nodes into the stack.
274 * Pop a pair of nodes from the tail of the stack.
394 * Append the nodes to the list.
396 * @param nodes NodeVector to append to this list
398 public void appendNodes(NodeVector nodes) argument
401 int nNodes = nodes.size();
419 System.arraycopy(nodes
[all...]
/openjdk7/jdk/src/share/classes/com/sun/org/apache/xml/internal/security/c14n/implementations/
H A DCanonicalizer11.java75 List nodes = new ArrayList(); field in class:Canonicalizer11.XmlAttrStack.XmlsStackElement
99 cur.nodes.add(n);
119 col.addAll(cur.nodes);
132 Iterator it = e.nodes.iterator();
144 Iterator it = cur.nodes.iterator();
H A DCanonicalizer20010315.java70 List nodes=new ArrayList(); field in class:Canonicalizer20010315.XmlAttrStack.XmlsStackElement
94 cur.nodes.add(n);
115 col.addAll(cur.nodes);
123 Iterator it=e.nodes.iterator();
133 //cur.nodes.clear();
134 //cur.nodes.addAll(loa.values());
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/
H A DGraph.java40 private HashMap<Object, Node<N, E>> nodes; field in class:Graph
45 nodes = new HashMap<Object, Node<N, E>>();
52 assert key == null || !nodes.containsKey(key);
54 nodes.put(key, n);
71 return nodes.get(key);
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/ServerCompiler/src/com/sun/hotspot/igv/servercompiler/
H A DServerCompilerScheduler.java60 private Collection<Node> nodes; field in class:ServerCompilerScheduler
104 // Special treatment of Halt-nodes
169 for (Node n : nodes) {
200 nodes = new ArrayList<Node>();
223 // Mark all nodes reachable in backward traversal from root
239 for (Node n : this.nodes) {
253 // Phi nodes in same block as region nodes
542 for (Node n : nodes) {
557 nodes
[all...]

Completed in 93 milliseconds

12