Home
last modified time | relevance | path

Searched refs:edgelist (Results 1 – 25 of 419) sorted by relevance

12345678910>>...17

/dports/graphics/reallyslick/rss-glx_0.9.1/src/Implicit/
H A DimpCubeTables.cpp84 triStripPatterns[row][totalcount+1] = edgelist[0]; in addtotable()
85 triStripPatterns[row][totalcount+2] = edgelist[1]; in addtotable()
86 triStripPatterns[row][totalcount+3] = edgelist[2]; in addtotable()
89 triStripPatterns[row][totalcount+1] = edgelist[0]; in addtotable()
90 triStripPatterns[row][totalcount+2] = edgelist[1]; in addtotable()
91 triStripPatterns[row][totalcount+3] = edgelist[3]; in addtotable()
92 triStripPatterns[row][totalcount+4] = edgelist[2]; in addtotable()
95 triStripPatterns[row][totalcount+1] = edgelist[0]; in addtotable()
96 triStripPatterns[row][totalcount+2] = edgelist[1]; in addtotable()
175 edgelist[edgecount] = currentedge; in makeTriStripPatterns()
[all …]
/dports/print/texlive-base/texlive-20150521-source/texk/ps2pk/
H A Dregions.c57 static void vertjoin(register struct edgelist *, register struct edgelist *);
58 static void discard(register struct edgelist *, register struct edgelist *);
61 static struct edgelist *splitedge(struct edgelist *, pel);
284 static struct edgelist *NewEdge( in NewEdge()
314 r = (struct edgelist *)Allocate(sizeof(struct edgelist), &template, in NewEdge()
366 static struct edgelist *SortSwath( struct edgelist *, struct edgelist *,
367 struct edgelist *(*)());
738 static struct edgelist *swathxsort(struct edgelist *, struct edgelist *);
799 struct edgelist base; in SortSwath()
923 r = (struct edgelist *)Allocate(sizeof(struct edgelist), list, 0); in splitedge()
[all …]
H A Dprotos.h57 static int ImpliedHorizontalLine(struct edgelist *e1,struct edgelist *e2,int y);
60 static struct edgelist *before(struct edgelist *e);
62 static void CollapseWhiteRun(struct edgelist *anchor,short yblack,struct edgelist *left,struct edge…
172 static int Unwind(struct edgelist *area);
175 extern struct edgelist *t1_SortSwath(struct edgelist *anchor,struct edgelist *edge,struct edgelist …
176 static struct edgelist *splitedge(struct edgelist *list,short y);
177 static void vertjoin(struct edgelist *top,struct edgelist *bottom);
178 extern struct edgelist *swathxsort(struct edgelist *before0,struct edgelist *edge);
179 extern struct edgelist *t1_SwathUnion(struct edgelist *before0,struct edgelist *edge);
180 extern struct edgelist *swathrightmost(struct edgelist *before,struct edgelist *edge);
[all …]
H A Dhints.c419 register struct edgelist *e3,*e4; in ImpliedHorizontalLine()
629 static struct edgelist *before(struct edgelist *); /* subroutine of DumpSubPaths */
631 static void DumpSubPaths(struct edgelist *anchor) in DumpSubPaths()
634 register struct edgelist *edge,*e,*e2; in DumpSubPaths()
674 static struct edgelist *before(struct edgelist *e) in before()
676 struct edgelist *r; in before()
747 struct edgelist *edge; in CollapseWhiteRun()
748 struct edgelist *swathstart = anchor; in CollapseWhiteRun()
813 struct edgelist *left; in ApplyContinuity()
814 struct edgelist *right; in ApplyContinuity()
[all …]
/dports/net/tightvnc/vnc_unixsrc/Xvnc/lib/font/Type1/
H A Dregions.c56 static struct edgelist *splitedge();
64 static struct edgelist *NewEdge();
311 r = (struct edgelist *)Allocate(sizeof(struct edgelist), &template,
799 struct edgelist base;
929 r = (struct edgelist *)Allocate(sizeof(struct edgelist), list, 0);
1006 register struct edgelist *before;
1007 register struct edgelist *after;
1239 register struct edgelist *after;
1675 register struct edgelist *edges; in DumpEdges()
1677 register struct edgelist *p,*p2;
[all …]
H A Dhints.c420 register struct edgelist *e3,*e4;
632 struct edgelist *anchor; in DumpSubPaths()
635 register struct edgelist *edge,*e,*e2;
675 static struct edgelist *before(e) in before()
676 struct edgelist *e; in before()
678 struct edgelist *r;
749 struct edgelist *edge;
750 struct edgelist *swathstart = anchor;
816 struct edgelist *left;
817 struct edgelist *right;
[all …]
/dports/graphics/graphviz/graphviz-2.44.1/lib/circogen/
H A Dedgelist.h28 typedef Dt_t edgelist; typedef
30 extern edgelist *init_edgelist(void);
31 extern void add_edge(edgelist * list, Agedge_t * e);
32 extern void remove_edge(edgelist * list, Agedge_t * e);
33 extern void free_edgelist(edgelist * list);
34 extern int size_edgelist(edgelist * list);
36 extern void print_edge(edgelist *);
H A Dedgelist.c54 edgelist *init_edgelist() in init_edgelist()
56 edgelist *list = dtopen(&ELDisc, Dtoset); in init_edgelist()
60 void free_edgelist(edgelist * list) in free_edgelist()
65 void add_edge(edgelist * list, Agedge_t * e) in add_edge()
73 void remove_edge(edgelist * list, Agedge_t * e) in remove_edge()
82 void print_edge(edgelist * list) in print_edge()
97 int size_edgelist(edgelist * list) in size_edgelist()
/dports/math/py-networkx/networkx-2.6.3/networkx/drawing/tests/
H A Dtest_pylab.py87 edgelist=[(1, 2), (1, 3), (2, 3), (3, 4)],
95 edgelist=[(3, 4)],
111 edgelist=[(9, 10), (10, 11), (10, 12), (10, 13)],
118 edgelist=[(9, 10), (10, 11), (10, 12), (10, 13)],
136 edgelist=[(7, 8), (8, 9)],
165 edgelist=[(0, 1), (1, 2), (2, 3), (3, 0)],
173 edgelist=[(4, 5), (5, 6), (6, 7), (7, 4)],
181 edgelist=[(4, 5), (5, 6), (6, 7), (7, 4)],
239 nx.draw_networkx(G, edgelist=[(0, 1, 0)])
268 nx.draw_networkx(barbell, edgelist=np.array([(0, 2), (0, 3)]))
[all …]
/dports/devel/t1lib/t1lib-5.1.2/lib/type1/
H A Dregions.c59 static struct edgelist *splitedge();
67 static struct edgelist *NewEdge();
323 r = (struct edgelist *)Allocate(sizeof(struct edgelist), &template,
804 struct edgelist base;
937 r = (struct edgelist *)Allocate(sizeof(struct edgelist), list, 0);
1025 register struct edgelist *before;
1026 register struct edgelist *after;
1258 register struct edgelist *after;
1709 register struct edgelist *edges; in DumpEdges()
1711 register struct edgelist *p,*p2;
[all …]
/dports/math/grace/grace-5.1.25/T1lib/type1/
H A Dregions.c59 static struct edgelist *splitedge();
67 static struct edgelist *NewEdge();
318 r = (struct edgelist *)Allocate(sizeof(struct edgelist), &template,
816 struct edgelist base;
946 r = (struct edgelist *)Allocate(sizeof(struct edgelist), list, 0);
1023 register struct edgelist *before;
1024 register struct edgelist *after;
1256 register struct edgelist *after;
1707 register struct edgelist *edges; in DumpEdges()
1709 register struct edgelist *p,*p2;
[all …]
H A Dhints.c426 register struct edgelist *e3,*e4;
641 struct edgelist *anchor; in DumpSubPaths()
644 register struct edgelist *edge,*e,*e2;
684 static struct edgelist *before(e) in before()
685 struct edgelist *e; in before()
687 struct edgelist *r;
758 struct edgelist *edge;
759 struct edgelist *swathstart = anchor;
825 struct edgelist *left;
826 struct edgelist *right;
[all …]
/dports/science/PETSc/petsc-3.14.1/src/ksp/ksp/tutorials/network/
H A Dex1.c65 PetscInt *edgelist; in read_data() local
106 edgelist[2*i] = 0; in read_data()
107 edgelist[2*i + 1] = 1; in read_data()
110 edgelist[2*i] = 0; in read_data()
111 edgelist[2*i + 1] = 2; in read_data()
114 edgelist[2*i] = 1; in read_data()
115 edgelist[2*i + 1] = 2; in read_data()
118 edgelist[2*i] = 0; in read_data()
119 edgelist[2*i + 1] = 3; in read_data()
137 *pedgelist = edgelist; in read_data()
[all …]
H A Dex1_nest.c65 PetscInt *edgelist; in read_data() local
107 edgelist[2*i] = 0; in read_data()
108 edgelist[2*i + 1] = 1; in read_data()
111 edgelist[2*i] = 0; in read_data()
112 edgelist[2*i + 1] = 2; in read_data()
115 edgelist[2*i] = 1; in read_data()
116 edgelist[2*i + 1] = 2; in read_data()
119 edgelist[2*i] = 0; in read_data()
120 edgelist[2*i + 1] = 3; in read_data()
138 *pedgelist = edgelist; in read_data()
[all …]
/dports/math/reduce/Reduce-svn5758-src/packages/hephys/
H A Dcvitmap.red408 defedge:=car edgelist$
411 edgelist:=cdr edgelist$
895 car edgelist . all_edge (edgename,cdr edgelist)
1290 if edgelist then
1316 if null edgelist then
1375 coeff_sortl1 (coeff_ordn (atlaslist,edgelist),passed,edgelist)$
2127 else car edgelist) .
2166 if memq_edgelist (edge,edgelist) then edgelist
2167 else edge . edgelist$
2171 edgelist)$
[all …]
/dports/math/gambit/gambit-16.0.1/library/src/enummixed/
H A Dclique.cc33 workonco(numco, firstedge, edgelist); in CliqueEnumerator()
325 Array<Edge> &edgelist, in genincidence() argument
358 i= edgelist[e].node1; in genincidence()
359 j= edgelist[e].node2; in genincidence()
392 e = edgelist[e].nextedge ; in genincidence()
398 Array<Edge> &edgelist in getconnco() argument
427 i = edgelist[newedge].node1; in getconnco()
428 j = edgelist[newedge].node2; in getconnco()
482 co1[edgelist[e].node1] = co2[edgelist[e].node2] = newco ; in getconnco()
484 e = edgelist[e].nextedge; in getconnco()
[all …]
/dports/graphics/graphviz/graphviz-2.44.1/lib/spine/
H A Dspine.c274 nbrs[ND_id(n)] = edgelist; in setEdgeWeights()
277 *edgelist++ = e; in setEdgeWeights()
281 *edgelist++ = e; in setEdgeWeights()
289 nbrs[ncnt] = edgelist; in setEdgeWeights()
297 e = *edgelist++; in setEdgeWeights()
314 e = *edgelist++; in setEdgeWeights()
419 Agedge_t **edgelist; in genSpine() local
449 edgelist[i++] = e; in genSpine()
457 e = edgelist[i]; in genSpine()
491 e = edgelist[i - 1]; in genSpine()
[all …]
/dports/math/py-networkx/networkx-2.6.3/networkx/linalg/tests/
H A Dtest_graphmatrix.py110 edgelist=sorted(self.G.edges()),
122 edgelist=sorted(self.G.edges()),
134 edgelist=sorted(self.MG.edges()),
146 edgelist=sorted(self.MG.edges()),
158 edgelist=sorted(self.MG2.edges()),
170 edgelist=sorted(self.MG2.edges()),
183 edgelist=sorted(self.WG.edges()),
195 edgelist=sorted(self.WG.edges()),
213 edgelist=sorted(self.WG.edges()),
222 edgelist=sorted(self.WG.edges()),
[all …]
/dports/games/quakeforge/quakeforge-0.7.2/libs/video/renderer/sw/
H A Dsw_redge.c160 if (edgelist->u >= edgestoadd->u) in R_InsertNewEdges()
162 edgelist = edgelist->next; in R_InsertNewEdges()
163 if (edgelist->u >= edgestoadd->u) in R_InsertNewEdges()
165 edgelist = edgelist->next; in R_InsertNewEdges()
166 if (edgelist->u >= edgestoadd->u) in R_InsertNewEdges()
168 edgelist = edgelist->next; in R_InsertNewEdges()
169 if (edgelist->u >= edgestoadd->u) in R_InsertNewEdges()
171 edgelist = edgelist->next; in R_InsertNewEdges()
176 edgestoadd->next = edgelist; in R_InsertNewEdges()
177 edgestoadd->prev = edgelist->prev; in R_InsertNewEdges()
[all …]
/dports/games/quakeforge/quakeforge-0.7.2/libs/video/renderer/sw32/
H A Dsw32_redge.c155 if (edgelist->u >= edgestoadd->u) in sw32_R_InsertNewEdges()
157 edgelist = edgelist->next; in sw32_R_InsertNewEdges()
158 if (edgelist->u >= edgestoadd->u) in sw32_R_InsertNewEdges()
160 edgelist = edgelist->next; in sw32_R_InsertNewEdges()
161 if (edgelist->u >= edgestoadd->u) in sw32_R_InsertNewEdges()
163 edgelist = edgelist->next; in sw32_R_InsertNewEdges()
164 if (edgelist->u >= edgestoadd->u) in sw32_R_InsertNewEdges()
166 edgelist = edgelist->next; in sw32_R_InsertNewEdges()
171 edgestoadd->next = edgelist; in sw32_R_InsertNewEdges()
172 edgestoadd->prev = edgelist->prev; in sw32_R_InsertNewEdges()
[all …]
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/java.desktop/share/classes/sun/awt/geom/
H A DAreaOp.java205 Arrays.sort(edgelist, YXTopComparator); in pruneEdges()
226 e = edgelist[cur]; in pruneEdges()
229 edgelist[next] = e; in pruneEdges()
240 y = edgelist[right].getCurve().getYTop(); in pruneEdges()
248 e = edgelist[right]; in pruneEdges()
275 e = edgelist[cur]; in pruneEdges()
278 Edge prevedge = edgelist[next-1]; in pruneEdges()
299 edgelist[next] = prevedge; in pruneEdges()
301 edgelist[next] = e; in pruneEdges()
319 e = edgelist[cur]; in pruneEdges()
[all …]
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/java.desktop/share/classes/sun/awt/geom/
H A DAreaOp.java205 Arrays.sort(edgelist, YXTopComparator); in pruneEdges()
226 e = edgelist[cur]; in pruneEdges()
229 edgelist[next] = e; in pruneEdges()
240 y = edgelist[right].getCurve().getYTop(); in pruneEdges()
248 e = edgelist[right]; in pruneEdges()
275 e = edgelist[cur]; in pruneEdges()
278 Edge prevedge = edgelist[next-1]; in pruneEdges()
299 edgelist[next] = prevedge; in pruneEdges()
301 edgelist[next] = e; in pruneEdges()
319 e = edgelist[cur]; in pruneEdges()
[all …]
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/java.desktop/share/classes/sun/awt/geom/
H A DAreaOp.java205 Arrays.sort(edgelist, YXTopComparator); in pruneEdges()
226 e = edgelist[cur]; in pruneEdges()
229 edgelist[next] = e; in pruneEdges()
240 y = edgelist[right].getCurve().getYTop(); in pruneEdges()
248 e = edgelist[right]; in pruneEdges()
275 e = edgelist[cur]; in pruneEdges()
278 Edge prevedge = edgelist[next-1]; in pruneEdges()
299 edgelist[next] = prevedge; in pruneEdges()
301 edgelist[next] = e; in pruneEdges()
319 e = edgelist[cur]; in pruneEdges()
[all …]
/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/jdk/src/share/classes/sun/awt/geom/
H A DAreaOp.java204 Arrays.sort(edgelist, YXTopComparator); in pruneEdges()
225 e = edgelist[cur]; in pruneEdges()
228 edgelist[next] = e; in pruneEdges()
239 y = edgelist[right].getCurve().getYTop(); in pruneEdges()
247 e = edgelist[right]; in pruneEdges()
274 e = edgelist[cur]; in pruneEdges()
277 Edge prevedge = edgelist[next-1]; in pruneEdges()
298 edgelist[next] = prevedge; in pruneEdges()
300 edgelist[next] = e; in pruneEdges()
318 e = edgelist[cur]; in pruneEdges()
[all …]
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/java.desktop/share/classes/sun/awt/geom/
H A DAreaOp.java205 Arrays.sort(edgelist, YXTopComparator); in pruneEdges()
226 e = edgelist[cur]; in pruneEdges()
229 edgelist[next] = e; in pruneEdges()
240 y = edgelist[right].getCurve().getYTop(); in pruneEdges()
248 e = edgelist[right]; in pruneEdges()
275 e = edgelist[cur]; in pruneEdges()
278 Edge prevedge = edgelist[next-1]; in pruneEdges()
299 edgelist[next] = prevedge; in pruneEdges()
301 edgelist[next] = e; in pruneEdges()
319 e = edgelist[cur]; in pruneEdges()
[all …]

12345678910>>...17