Home
last modified time | relevance | path

Searched refs:IEDGE (Results 1 – 12 of 12) sorted by relevance

/dports/science/siconos/siconos-4.4.0/externals/netlib/dftemplates/double/
H A DMatGen.f132 IEDGE = 1
138 POINTR(NODE) = IEDGE
150 IEDGE=IEDGE + 1
158 IEDGE=IEDGE + 1
166 IEDGE=IEDGE + 1
171 INDX(IEDGE) = NODE
173 IEDGE = IEDGE + 1
182 IEDGE=IEDGE + 1
187 IEDGE=IEDGE + 1
195 IEDGE=IEDGE + 1
[all …]
/dports/graphics/pgplot/pgplot/applications/plot10/
H A Dplot10.f882 , IBORDER,IEDGE,IFLAG,NI,KS local
937 IEDGE = L
938 IF (IBORDER.EQ.2) IEDGE = IEDGE+2
954 IF (IEDGE.EQ.3) JJ = JJ-1
955 IF (IEDGE.EQ.4) II = II-1
959 IF (K.NE.IEDGE) THEN
985 KS = 3-IEDGE
988 KS = 5-IEDGE
996 IEDGE = KS+2
1002 IEDGE = KS-2
[all …]
/dports/math/asymptote/asymptote-2.67/
H A DDelaunay.cc56 IEDGE *edges = new IEDGE[emax]; in Triangulate()
122 IEDGE *p_EdgeTemp = new IEDGE[emax]; in Triangulate()
H A DDelaunay.h15 struct IEDGE{ struct
/dports/print/texlive-base/texlive-20150521-source/utils/asymptote/
H A DDelaunay.cc56 IEDGE *edges = new IEDGE[emax]; in Triangulate()
122 IEDGE *p_EdgeTemp = new IEDGE[emax]; in Triangulate()
H A DDelaunay.h15 struct IEDGE{ struct
/dports/x11/xscreensaver/xscreensaver-5.44/hacks/
H A Ddelaunay.c29 } IEDGE; typedef
111 IEDGE *edges = NULL; in delaunay()
130 if ((edges = malloc(emax*(long)sizeof(IEDGE))) == NULL) { in delaunay()
208 if ((edges = realloc(edges,emax*(long)sizeof(IEDGE))) == NULL) { in delaunay()
/dports/textproc/fox-xml/fox-4.1.2-91-g9c6716e/wkml/
H A Dm_contours.F901119 IEDGE = L ! horizontal or vertical?
1121 IF (IX.NE.1) IEDGE = IEDGE + 2 ! ... ?
1140 IF (IEDGE.LT.3) GO TO 220
1141 I = I - I3(IEDGE)
1142 J = J - I3(IEDGE+2)
1144 IF (K.EQ.IEDGE) cycle
1173 KS = 5 - IEDGE
1175 KS = 3 - IEDGE
1194 290 IEDGE = KS + 2
1195 IF (IEDGE.GT.4) IEDGE = IEDGE - 4
[all …]
/dports/devel/asl/asl-current/include/z8/
H A Dz86xx.inc84 IEDGE __z8bfield 6,2 ; IRQ Edge Selection
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/blossom/MATCH/
H A Dmatch.c104 #define IEDGE(e) ((e) - G->edgelist) macro
708 nodelist[e->nod1].matched_edge = IEDGE(e);
709 nodelist[e->nod2].matched_edge = IEDGE(e);
962 node_j->blossom_next_edge = IEDGE(e);
1099 nodelist[e->nod1].matched_edge = IEDGE(e);
1100 nodelist[e->nod2].matched_edge = IEDGE(e);
1349 node_j->matched_edge = node_k->matched_edge = IEDGE(e);
1496 node_j->parent_edge = IEDGE(e);
1511 node_k->parent_edge = IEDGE(f);
/dports/graphics/dataplot/dataplot-2c1b27601a3b7523449de612613eadeead9a8f70/src/
H A Ddp43.F30110 1IEDGE,IX,NV,IWORK1,
30170 INTEGER IEDGE(*)
30257 IEDGE(IT1)=INT(EDGE1(I)+0.1)
30270 WRITE(ICOUT,231)I,IEDGE(IT1),IEDGE(IT2)
30309 ITEMP1=IEDGE(IT1)
30310 ITEMP2=IEDGE(IT2)
30388 1IEDGE,IX,NV,K,IWORK1,
30442 INTEGER IEDGE(*)
30537 WRITE(ICOUT,231)I,IEDGE(IT1),IEDGE(IT2)
30563 EDGE1(I)=REAL(IEDGE(IT1))
[all …]
H A Ddp14.F3479 INTEGER IEDGE
3623 IEDGE=I
3640 WRITE(ICOUT,395)IEDGE,ISAVE,JSAVE,KSAVE,MSAVE