Searched refs:Edge (Results 1 - 15 of 15) sorted by relevance

/openjdk7/langtools/test/tools/javac/generics/wildcards/
H A DT5097548.java33 interface Edge<N extends Node<? extends Edge<? extends N>>> {} interface
34 interface Node<E extends Edge<? extends Node<? extends E>>> {}
H A DT5097548b.java32 interface Edge<N extends Node<? extends Edge<N>>> { interface
35 interface Node<E extends Edge<? extends Node<E>>> {
/openjdk7/langtools/test/tools/javac/generics/6213818/
H A DT6213818.java32 static interface Edge<N extends Node<? extends Edge<N>>> { } interface in class:T6213818
33 static interface Node<E extends Edge<? extends Node<E>>> { }
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/jaxws/src/share/jaxws_classes/com/sun/xml/internal/ws/org/objectweb/asm/
H A DEdge.java67 class Edge { class
76 * More precisely any {@link Edge} whose {@link #info} is strictly positive
104 Edge next;
H A DLabel.java192 * the graph, as a linked list of Edge objects.
253 * are stored in a linked list of {@link Edge Edge} objects, linked to each
254 * other by their {@link Edge#next} field.
256 Edge successors;
516 Edge e = new Edge();
532 Edge e = successors;
H A DMethodWriter.java373 * stores the list of its successors in the graph, as a linked list of Edge
895 addSuccessor(Edge.NORMAL, label);
993 addSuccessor(Edge.NORMAL, label);
1131 addSuccessor(Edge.NORMAL, dflt);
1134 addSuccessor(Edge.NORMAL, labels[i]);
1253 Edge b = new Edge();
1297 Edge e = l.successors;
1350 Edge b = new Edge();
[all...]
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/
H A DNode.java37 private List<Edge<N, E>> inEdges;
38 private List<Edge<N, E>> outEdges;
77 for (Edge<N, E> e : inEdges) {
93 inEdges = new ArrayList<Edge<N, E>>();
94 outEdges = new ArrayList<Edge<N, E>>();
97 protected void addInEdge(Edge<N, E> e) {
105 protected void addOutEdge(Edge<N, E> e) {
109 protected void removeInEdge(Edge<N, E> e) {
114 protected void removeOutEdge(Edge<N, E> e) {
119 public List<Edge<
[all...]
H A DGraph.java41 private HashMap<Object, Edge<N, E>> edges;
46 edges = new HashMap<Object, Edge<N, E>>();
60 public Edge<N, E> createEdge(Node<N, E> source, Node<N, E> dest, E data, Object key) {
61 Edge<N, E> e = new Edge<N, E>(this, source, dest, data);
74 public Edge<N, E> getEdge(Object key) {
78 public Collection<Edge<N, E>> getEdges() {
86 public void removeEdge(Edge<N, E> e, Object key) {
100 public boolean visitEdge(Edge<N, E> e, boolean backEdge) {
168 for (Edge<
[all...]
H A DEdge.java30 public class Edge<N, E> { class
36 protected Edge(Graph<N, E> graph, Node<N, E> source, Node<N, E> dest, E data) { method in class:Edge
87 return "Edge (" + source + " -- " + dest + "): " + data;
H A DOldHierarchicalLayoutManager.java161 public void addReversedStartEdge(Edge<NodeData, EdgeData> e) {
183 public void addReversedEndEdge(Edge<NodeData, EdgeData> e) {
452 List<Edge<NodeData, EdgeData>> edges = new ArrayList<Edge<NodeData, EdgeData>>(n.getOutEdges());
453 Collections.sort(edges, new Comparator<Edge<NodeData, EdgeData>>() {
455 public int compare(Edge<NodeData, EdgeData> o1, Edge<NodeData, EdgeData> o2) {
461 for (Edge<NodeData, EdgeData> e : edges) {
470 List<Edge<NodeData, EdgeData>> edges = new ArrayList<Edge<NodeDat
[all...]
/openjdk7/jdk/src/share/classes/sun/awt/geom/
H A DEdge.java28 final class Edge { class
38 public Edge(Curve c, int ctag) { method in class:Edge
42 public Edge(Curve c, int ctag, int etag) { method in class:Edge
72 private Edge lastEdge;
76 public int compareTo(Edge other, double yrange[]) {
117 return ("Edge["+curve+
H A DAreaOp.java45 public int classify(Edge e) {
98 public int classify(Edge e) {
120 public int classify(Edge e) {
151 public abstract int classify(Edge e);
176 edges.add(new Edge(c, curvetag));
183 Curve c1 = ((Edge) o1).getCurve();
184 Curve c2 = ((Edge) o2).getCurve();
203 Edge[] edgelist = (Edge[]) edges.toArray(new Edge[numedge
[all...]
/openjdk7/jdk/test/java/lang/reflect/Generics/
H A DHashCodeTest.java37 interface Edge<N extends Node<? extends Edge<N>>> { interface in class:HashCodeTest
40 interface Node<E extends Edge<? extends Node<E>>> {
51 classes.add(Edge.class);
/openjdk7/jdk/src/share/classes/sun/java2d/loops/
H A DProcessPath.java1707 public Edge edge;
1715 private static class Edge { class in class:ProcessPath
1720 Edge prev;
1721 Edge next;
1723 public Edge(Point p, int x, int dx, int dir) { method in class:ProcessPath.Edge
1775 Edge head;
1785 Edge ne;
1817 ne = new Edge(pnt, x0, stepx, dir);
1828 public void delete(Edge e) {
1829 Edge prev
[all...]
/openjdk7/jdk/src/share/native/sun/java2d/loops/
H A DProcessPath.c1757 } Edge; typedef in typeref:struct:_Edge
1879 /* Accessors for the Edge structure to work with LBUBBLE_SORT */
1887 Edge *prevp = pnt->prev; \
1888 Edge *nextp = pnt->next; \
1902 Edge *ne = active + nact; \
1949 Edge* activeList, *active;
1950 Edge* curEdge, *prevEdge;
1987 ALLOC(active, Edge, n);
2048 LBUBBLE_SORT((&activeList), Edge, GET_ACTIVE_NEXT, GET_ACTIVE_KEY);

Completed in 62 milliseconds