Searched defs:Edge (Results 1 - 9 of 9) sorted by relevance

/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/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/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/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;
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/
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;
/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+
/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 350 milliseconds