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

12

/openjdk7/jdk/test/java/rmi/reliability/benchmark/bench/rmi/altroot/
H A DNode.java30 public class Node implements Serializable { class in inherits:Serializable
/openjdk7/langtools/test/tools/javac/generics/
H A DCyclicInheritance5.java32 class G<N extends G.Node<N>> {
33 static class Node<N extends Node<N>> { class in class:G
37 static class MyNode extends G.Node<MyNode> {
/openjdk7/langtools/test/tools/javac/generics/6213818/
H A DT6213818.java32 static interface Edge<N extends Node<? extends Edge<N>>> { }
33 static interface Node<E extends Edge<? extends Node<E>>> { } interface in class:T6213818
34 static class BasicNode<E extends BasicEdge<N, E> & Edge<N>, N extends BasicNode<E, N> & Node<E>> implements Node<E> { }
35 static class BasicEdge<N extends BasicNode<E, N> & Node<E>, E extends BasicEdge<N, E> & Edge<N>> implements Edge<N> { }
/openjdk7/langtools/test/tools/javac/generics/wildcards/
H A DT5097548.java33 interface Edge<N extends Node<? extends Edge<? extends N>>> {}
34 interface Node<E extends Edge<? extends Node<? extends E>>> {} interface
H A DT5097548b.java32 interface Edge<N extends Node<? extends Edge<N>>> {
35 interface Node<E extends Edge<? extends Node<E>>> { interface
41 Node<?> node = null;
/openjdk7/jaxp/src/com/sun/org/apache/bcel/internal/classfile/
H A DNode.java66 public interface Node { interface
/openjdk7/corba/src/share/classes/com/sun/corba/se/impl/orbutil/graph/
H A DNode.java30 /** Node in a graph.
32 public interface Node interface
36 Set /* Set<Node> */ getChildren() ;
/openjdk7/jdk/test/java/lang/reflect/Generics/
H A DHashCodeTest.java37 interface Edge<N extends Node<? extends Edge<N>>> {
40 interface Node<E extends Edge<? extends Node<E>>> { interface in class:HashCodeTest
52 classes.add(Node.class);
/openjdk7/jaxp/src/com/sun/org/apache/xalan/internal/xsltc/runtime/
H A DNode.java21 * $Id: Node.java,v 1.2.4.1 2005/09/06 11:10:29 pvedula Exp $
32 public class Node { class
36 public Node(int n, int t) { method in class:Node
/openjdk7/jdk/src/share/classes/com/sun/jmx/snmp/IPAcl/
H A DNode.java27 /* Generated By:JJTree: Do not edit this line. Node.java */
35 interface Node { interface
47 public void jjtSetParent(Node n);
48 public Node jjtGetParent();
52 public void jjtAddChild(Node n, int i);
56 public Node jjtGetChild(int i);
/openjdk7/jaxws/src/share/jaxws_classes/javax/xml/soap/
H A DNode.java30 * This interface extnends the standard DOM Node interface with methods for
34 public interface Node extends org.w3c.dom.Node { interface in inherits:org.w3c.dom.Node
38 * If there is an immediate child of this <code>Node</code> that it is a
41 * <code>Text</code> Node will be returned.
46 * immediate child of this <code>Node</code> object that is a
69 * Sets the parent of this <code>Node</code> object to the given
73 * the parent of this <code>Node</code> object
82 * Returns the parent element of this <code>Node</code> object.
87 * this <code>Node</cod
[all...]
/openjdk7/jdk/test/java/rmi/reliability/benchmark/bench/rmi/
H A DSmallObjTreeCalls.java42 static class Node implements Serializable { class in class:SmallObjTreeCalls
45 Node(Object parent, int depth) { method in class:SmallObjTreeCalls.Node
48 left = new Node(this, depth - 1);
49 right = new Node(this, depth - 1);
55 public Node call(Node val) throws RemoteException;
62 public Node call(Node val) throws RemoteException {
82 Node node = new Node(nul
[all...]
H A DObjArrayCalls.java42 static class Node implements Serializable { class in class:ObjArrayCalls
54 Node(Object parent, int depth) { method in class:ObjArrayCalls.Node
57 left = new Node(this, depth - 1);
58 right = new Node(this, depth - 1);
64 public Node[] call(Node[] a) throws RemoteException;
71 public Node[] call(Node[] a) throws RemoteException {
91 Node[] nodes = new Node[siz
[all...]
H A DObjTreeCalls.java42 static class Node implements Serializable { class in class:ObjTreeCalls
54 Node(Object parent, int depth) { method in class:ObjTreeCalls.Node
57 left = new Node(this, depth - 1);
58 right = new Node(this, depth - 1);
64 public Node call(Node val) throws RemoteException;
71 public Node call(Node val) throws RemoteException {
91 Node node = new Node(nul
[all...]
/openjdk7/jdk/test/java/rmi/reliability/benchmark/bench/serial/
H A DRepeatObjs.java40 static class Node implements Serializable { class in class:RepeatObjs
54 Node[] objs = genObjs(size);
71 Node[] genObjs(int nobjs) {
72 Node[] objs = new Node[nobjs];
74 objs[i] = new Node();
82 StreamBuffer sbuf, Node[] objs, int nbatches)
H A DSmallObjTrees.java40 static class Node implements Serializable { class in class:SmallObjTrees
43 Node(Object parent, int depth) { method in class:SmallObjTrees.Node
46 left = new Node(this, depth - 1);
47 right = new Node(this, depth - 1);
63 Node[] trees = genTrees(depth, ncycles);
80 Node[] genTrees(int depth, int ntrees) {
81 Node[] trees = new Node[ntrees];
83 trees[i] = new Node(null, depth);
93 StreamBuffer sbuf, Node[] tree
[all...]
H A DObjArrays.java40 static class Node implements Serializable { class in class:ObjArrays
52 Node(Object parent, int depth) { method in class:ObjArrays.Node
55 left = new Node(this, depth - 1);
56 right = new Node(this, depth - 1);
72 Node[][] arrays = genArrays(size, ncycles);
89 Node[][] genArrays(int size, int narrays) {
90 Node[][] arrays = new Node[narrays][size];
93 arrays[i][j] = new Node(null, 0);
104 StreamBuffer sbuf, Node[][] array
[all...]
H A DObjTrees.java40 static class Node implements Serializable { class in class:ObjTrees
52 Node(Object parent, int depth) { method in class:ObjTrees.Node
55 left = new Node(this, depth - 1);
56 right = new Node(this, depth - 1);
72 Node[] trees = genTrees(depth, ncycles);
89 Node[] genTrees(int depth, int ntrees) {
90 Node[] trees = new Node[ntrees];
92 trees[i] = new Node(null, depth);
102 StreamBuffer sbuf, Node[] tree
[all...]
H A DReplaceTrees.java41 static class Node implements Serializable { class in class:ReplaceTrees
44 Node(Object parent, Object left, Object right) { method in class:ReplaceTrees.Node
50 Node(Object parent, int depth) { method in class:ReplaceTrees.Node
53 left = new Node(this, depth - 1);
54 right = new Node(this, depth - 1);
73 return new Node(parent, left, right);
88 Node[] trees = genTrees(depth, ncycles);
105 Node[] genTrees(int depth, int ntrees) {
106 Node[] trees = new Node[ntree
[all...]
H A DCustomDefaultObjTrees.java43 static class Node implements Serializable { class in class:CustomDefaultObjTrees
55 Node(Object parent, int depth) { method in class:CustomDefaultObjTrees.Node
58 left = new Node(this, depth - 1);
59 right = new Node(this, depth - 1);
85 Node[] trees = genTrees(depth, ncycles);
102 Node[] genTrees(int depth, int ntrees) {
103 Node[] trees = new Node[ntrees];
105 trees[i] = new Node(null, depth);
115 StreamBuffer sbuf, Node[] tree
[all...]
/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/utils/
H A DTrie.java39 Node m_Root;
49 m_Root = new Node();
70 Node node = m_Root;
74 Node nextNode = node.m_nextChar[Character.toUpperCase(key.charAt(i))];
84 Node newNode = new Node();
119 Node node = m_Root;
189 class Node class in class:Trie
193 * Constructor, creates a Node[ALPHA_SIZE].
195 Node() method in class:Trie.Node
[all...]
/openjdk7/jdk/test/java/rmi/MarshalledObject/compare/
H A DCompare.java39 static class Node implements Serializable { class in class:Compare
41 Node next;
97 Node head = null;
98 Node cur = null;
101 cur = head = new Node();
103 cur = cur.next = new Node();
/openjdk7/jdk/src/share/classes/sun/tools/tree/
H A DNode.java38 class Node implements Constants, Cloneable { class in inherits:Constants,Cloneable
45 Node(int op, long where) { method in class:Node
/openjdk7/jdk/src/share/demo/java2d/J2DBench/src/j2dbench/
H A DNode.java47 public abstract class Node { class
51 private Node next;
53 protected Node() { method in class:Node
56 public Node(Group parent, String nodeName, String description) { method in class:Node
90 public Node getNext() {
94 public void setNext(Node node) {
109 public void visit(Node node);
114 public Node next();
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/
H A DNode.java34 public class Node<N, E> { class
90 protected Node(Graph<N, E> graph, N data) { method in class:Node
127 public List<Node<N, E>> getSuccessors() {
128 ArrayList<Node<N, E>> succ = new ArrayList<Node<N, E>>();
130 Node<N, E> n = e.getDest();
138 public List<Node<N, E>> getPredecessors() {
139 ArrayList<Node<N, E>> pred = new ArrayList<Node<N, E>>();
141 Node<
[all...]

Completed in 148 milliseconds

12