|
|
1.1 root 1:
2: typedef struct temp100 {
3: struct temp100 *Link;
4: int type;
5: int min;
6: transform *trans;
7: Command *item;
8: int depth;
9: } instance;
10:
11: typedef struct {
12: int refs,count,level;
13: real dy,iy;
14: } PolyDesc;
15:
16: typedef struct temp101 {
17: struct temp101 *Link;
18: int type;
19: int min;
20: int x1,y1,x2,y2;
21: int dir;
22: PolyDesc *poly;
23: } iedge;
24:
25: typedef struct temp102 {
26: struct temp102 *Link;
27: int type;
28: int ix,ex;
29: real iy,dy;
30: int dir;
31: PolyDesc *poly;
32: } edge;
33:
34: typedef struct temp103 {
35: struct temp103 *Link;
36: real start,dstart,end,dend;
37: int level;
38: } nedge;
39:
40: int Top,Bottom;
41:
42: Queue *EdgeQueue,*NecEdgeQueue,*NEdgeQueue;
43: Queue FreeHolders;
44: List *ActiveEdges;
45: List TempList;
46:
47: int *EdgeStart,NextEdge,*EdgeEnd,LastEdge;
48: int *EdgeIntersection,NextIntersection,*Valid,*Drawn,*change;
49: int *NextChange;
50: int *xprev;
51: int xLast; /* last line sent to plotter */
52: int finishBuf; /* flag set when outputting end of output buffer */
53:
54: nedge **EdgeHolder;
55:
56: extern int UsedLayers;
57: int ModCount;
58:
59: PolyDesc DummyPoly;
60:
61: int NextUnAct;
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.