1 |
578 |
markom |
#include "default.h"
|
2 |
|
|
#include "tkInt.h"
|
3 |
|
|
#include "tkPort.h"
|
4 |
|
|
#include "tkCanvas.h"
|
5 |
|
|
#include "tkCanvLayout.h"
|
6 |
|
|
|
7 |
|
|
extern Tk_ItemType tkEdgeType;
|
8 |
|
|
|
9 |
|
|
static Tk_Uid allUid = NULL;
|
10 |
|
|
|
11 |
|
|
typedef struct Layout_Graph Layout_Graph;
|
12 |
|
|
|
13 |
|
|
static
|
14 |
|
|
char* layableitems[] = {
|
15 |
|
|
"bitmap",
|
16 |
|
|
"edge",
|
17 |
|
|
"oval",
|
18 |
|
|
"polygon",
|
19 |
|
|
"rectangle",
|
20 |
|
|
"text",
|
21 |
|
|
"window",
|
22 |
|
|
(char*)0
|
23 |
|
|
};
|
24 |
|
|
|
25 |
|
|
/* Define a config set for graph command */
|
26 |
|
|
static Tk_ConfigSpec graphspecs[] = {
|
27 |
|
|
{TK_CONFIG_BOOLEAN, "-computenodesize", (char*)NULL, (char*)NULL,
|
28 |
|
|
"0", Tk_Offset(LayoutConfig,computenodesize), 0, (Tk_CustomOption*)NULL},
|
29 |
|
|
{TK_CONFIG_INT, "-gridlock", (char*)NULL, (char*)NULL,
|
30 |
|
|
"0", Tk_Offset(LayoutConfig,gridlock), 0, (Tk_CustomOption*)NULL},
|
31 |
|
|
{TK_CONFIG_INT, "-elementsperline", (char*)NULL, (char*)NULL,
|
32 |
|
|
"0", Tk_Offset(LayoutConfig,elementsperline), 0, (Tk_CustomOption*)NULL},
|
33 |
|
|
{TK_CONFIG_BOOLEAN, "-hideedges", (char*)NULL, (char*)NULL,
|
34 |
|
|
"0", Tk_Offset(LayoutConfig,hideedges), 0, (Tk_CustomOption*)NULL},
|
35 |
|
|
{TK_CONFIG_BOOLEAN, "-keeprandompositions", (char*)NULL, (char*)NULL,
|
36 |
|
|
"0", Tk_Offset(LayoutConfig,keeprandompositions), 0, (Tk_CustomOption*)NULL},
|
37 |
|
|
{TK_CONFIG_PIXELS, "-nodespaceh", (char*)NULL, (char*)NULL,
|
38 |
|
|
"5", Tk_Offset(LayoutConfig,nodespaceH), 0, (Tk_CustomOption*)NULL},
|
39 |
|
|
{TK_CONFIG_PIXELS, "-nodespacev", (char*)NULL, (char*)NULL,
|
40 |
|
|
"5", Tk_Offset(LayoutConfig,nodespaceV), 0, (Tk_CustomOption*)NULL},
|
41 |
|
|
{TK_CONFIG_PIXELS, "-maxx", (char*)NULL, (char*)NULL,
|
42 |
|
|
(char*)NULL, Tk_Offset(LayoutConfig,maxx),
|
43 |
|
|
TK_CONFIG_DONT_SET_DEFAULT, (Tk_CustomOption*)NULL},
|
44 |
|
|
{TK_CONFIG_PIXELS, "-maxy", (char*)NULL, (char*)NULL,
|
45 |
|
|
(char*)NULL, Tk_Offset(LayoutConfig,maxy),
|
46 |
|
|
TK_CONFIG_DONT_SET_DEFAULT, (Tk_CustomOption*)NULL},
|
47 |
|
|
{TK_CONFIG_INT, "-order", (char*)NULL, (char*)NULL,
|
48 |
|
|
"0", Tk_Offset(LayoutConfig,graphorder), 0, (Tk_CustomOption*)NULL},
|
49 |
|
|
{TK_CONFIG_PIXELS, "-xoffset", (char*)NULL, (char*)NULL,
|
50 |
|
|
"4", Tk_Offset(LayoutConfig,xoffset), 0, (Tk_CustomOption*)NULL},
|
51 |
|
|
{TK_CONFIG_PIXELS, "-yoffset", (char*)NULL, (char*)NULL,
|
52 |
|
|
"4", Tk_Offset(LayoutConfig,yoffset), 0, (Tk_CustomOption*)NULL},
|
53 |
|
|
{TK_CONFIG_END, (char *) NULL, (char *) NULL, (char *) NULL,
|
54 |
|
|
(char *) NULL, 0, 0}
|
55 |
|
|
};
|
56 |
|
|
|
57 |
|
|
/*
|
58 |
|
|
* See tkCanvas.h for key data structures used to implement canvases.
|
59 |
|
|
*/
|
60 |
|
|
|
61 |
|
|
/*
|
62 |
|
|
* The structure defined below is used to keep track of a tag search
|
63 |
|
|
* in progress. Only the "prevPtr" field should be accessed by anyone
|
64 |
|
|
* other than StartTagSearch and NextItem.
|
65 |
|
|
*/
|
66 |
|
|
|
67 |
|
|
typedef struct TagSearch {
|
68 |
|
|
TkCanvas *canvasPtr; /* Canvas widget being searched. */
|
69 |
|
|
Tk_Uid tag; /* Tag to search for. 0 means return
|
70 |
|
|
* all items. */
|
71 |
|
|
Tk_Item *prevPtr; /* Item just before last one found (or NULL
|
72 |
|
|
* if last one found was first in the item
|
73 |
|
|
* list of canvasPtr). */
|
74 |
|
|
Tk_Item *currentPtr; /* Pointer to last item returned. */
|
75 |
|
|
int searchOver; /* Non-zero means NextItem should always
|
76 |
|
|
* return NULL. */
|
77 |
|
|
} TagSearch;
|
78 |
|
|
|
79 |
|
|
static Tk_Item * NextItem _ANSI_ARGS_((TagSearch *searchPtr));
|
80 |
|
|
static Tk_Item * StartTagSearch _ANSI_ARGS_((TkCanvas *canvasPtr,
|
81 |
|
|
char *tag, TagSearch *searchPtr));
|
82 |
|
|
static Tcl_HashTable * graph_table _ANSI_ARGS_((Tcl_Interp *interp));
|
83 |
|
|
|
84 |
|
|
int MY_graphOrder (struct Layout_Graph* This);
|
85 |
|
|
void * MY_EdgeParent (struct Layout_Graph* This, int i, int num);
|
86 |
|
|
void * MY_EdgeFromNode (struct Layout_Graph* This, int i);
|
87 |
|
|
|
88 |
|
|
|
89 |
|
|
static
|
90 |
|
|
int
|
91 |
|
|
getnodebbox(interp,canvasPtr, iPtr, bbox)
|
92 |
|
|
Tcl_Interp* interp;
|
93 |
|
|
TkCanvas* canvasPtr;
|
94 |
|
|
Tk_Item* iPtr;
|
95 |
|
|
ItemGeom* bbox;
|
96 |
|
|
{
|
97 |
|
|
bbox->x1 = iPtr->x1;
|
98 |
|
|
bbox->y1 = iPtr->y1;
|
99 |
|
|
bbox->x2 = iPtr->x2;
|
100 |
|
|
bbox->y2 = iPtr->y2;
|
101 |
|
|
return TCL_OK;
|
102 |
|
|
}
|
103 |
|
|
|
104 |
|
|
static
|
105 |
|
|
int
|
106 |
|
|
getedgedim(canvasPtr, e, dim)
|
107 |
|
|
TkCanvas* canvasPtr;
|
108 |
|
|
Tk_Item* e;
|
109 |
|
|
ItemGeom* dim;
|
110 |
|
|
{
|
111 |
|
|
int argc2;
|
112 |
|
|
char **argv2;
|
113 |
|
|
|
114 |
|
|
/* Read the text height of this edge. */
|
115 |
|
|
Tk_ConfigureInfo(canvasPtr->interp, canvasPtr->tkwin,
|
116 |
|
|
e->typePtr->configSpecs,
|
117 |
|
|
(char *) e, "-textheight", 0);
|
118 |
|
|
if(Tcl_SplitList(canvasPtr->interp, canvasPtr->interp->result,
|
119 |
|
|
&argc2, &argv2) != TCL_OK) {
|
120 |
|
|
return TCL_ERROR;
|
121 |
|
|
}
|
122 |
|
|
dim->height = atol(argv2[4]);
|
123 |
|
|
ckfree((char *) argv2);
|
124 |
|
|
/* Read the text width of this edge. */
|
125 |
|
|
Tk_ConfigureInfo(canvasPtr->interp, canvasPtr->tkwin,
|
126 |
|
|
e->typePtr->configSpecs,
|
127 |
|
|
(char *) e, "-textwidth", 0);
|
128 |
|
|
if(Tcl_SplitList(canvasPtr->interp, canvasPtr->interp->result,
|
129 |
|
|
&argc2, &argv2) != TCL_OK) {
|
130 |
|
|
return TCL_ERROR;
|
131 |
|
|
}
|
132 |
|
|
dim->width = atol(argv2[4]);
|
133 |
|
|
ckfree((char *) argv2);
|
134 |
|
|
Tcl_ResetResult(canvasPtr->interp);
|
135 |
|
|
return TCL_OK;
|
136 |
|
|
}
|
137 |
|
|
|
138 |
|
|
static
|
139 |
|
|
int
|
140 |
|
|
setnodegeom(interp,canvasPtr,iPtr,geom)
|
141 |
|
|
Tcl_Interp* interp;
|
142 |
|
|
TkCanvas* canvasPtr;
|
143 |
|
|
Tk_Item* iPtr;
|
144 |
|
|
ItemGeom geom;
|
145 |
|
|
{
|
146 |
|
|
double deltax, deltay;
|
147 |
|
|
|
148 |
|
|
if(iPtr->typePtr->translateProc == NULL) {
|
149 |
|
|
Tcl_AppendResult(interp,"item has no translation proc",(char*)0);
|
150 |
|
|
return TCL_ERROR;
|
151 |
|
|
}
|
152 |
|
|
|
153 |
|
|
/* get the delta x,y of the item */
|
154 |
|
|
deltax = geom.x1 - iPtr->x1;
|
155 |
|
|
deltay = geom.y1 - iPtr->y1;
|
156 |
|
|
|
157 |
|
|
Tk_CanvasEventuallyRedraw((Tk_Canvas) canvasPtr, iPtr->x1, iPtr->y1, iPtr->x2, iPtr->y2);
|
158 |
|
|
(void)(*iPtr->typePtr->translateProc)((Tk_Canvas) canvasPtr, iPtr, deltax, deltay);
|
159 |
|
|
Tk_CanvasEventuallyRedraw((Tk_Canvas) canvasPtr, iPtr->x1, iPtr->y1, iPtr->x2, iPtr->y2);
|
160 |
|
|
return TCL_OK;
|
161 |
|
|
}
|
162 |
|
|
|
163 |
|
|
static Layout_Graph *
|
164 |
|
|
GetGraphLayoutII(TkCanvas *canvasPtr, Tcl_Interp *interp);
|
165 |
|
|
static
|
166 |
|
|
int
|
167 |
|
|
setedgegeom(interp,canvasPtr,iPtr,geom,i)
|
168 |
|
|
Tcl_Interp* interp;
|
169 |
|
|
TkCanvas* canvasPtr;
|
170 |
|
|
Tk_Item* iPtr;
|
171 |
|
|
ItemGeom geom;
|
172 |
|
|
int i;
|
173 |
|
|
{
|
174 |
|
|
/* register char* nm;
|
175 |
|
|
register int c; */
|
176 |
|
|
int argc = 4;
|
177 |
|
|
char x1[TCL_DOUBLE_SPACE];
|
178 |
|
|
char y1[TCL_DOUBLE_SPACE];
|
179 |
|
|
char x2[TCL_DOUBLE_SPACE];
|
180 |
|
|
char y2[TCL_DOUBLE_SPACE];
|
181 |
|
|
char x3[TCL_DOUBLE_SPACE];
|
182 |
|
|
char y3[TCL_DOUBLE_SPACE];
|
183 |
|
|
char x4[TCL_DOUBLE_SPACE];
|
184 |
|
|
char y4[TCL_DOUBLE_SPACE];
|
185 |
|
|
char* argv[8];
|
186 |
|
|
Layout_Graph *graph=GetGraphLayoutII(canvasPtr, interp);
|
187 |
|
|
|
188 |
|
|
LayoutConfig cnf = GetLayoutConfig (/*canvasPtr->*/graph);
|
189 |
|
|
double xd = geom.x1 - geom.x2 /*- 10.0*/ , xdiff;
|
190 |
|
|
|
191 |
|
|
if (xd < 0.0) xd = geom.x2 - geom.x1 /*- 10.0*/;
|
192 |
|
|
|
193 |
|
|
if(iPtr->typePtr->coordProc == NULL) {
|
194 |
|
|
Tcl_AppendResult(interp,"could not set edge item coordinates",(char*)0);
|
195 |
|
|
return TCL_ERROR;
|
196 |
|
|
}
|
197 |
|
|
argv[0] = x1;
|
198 |
|
|
argv[1] = y1;
|
199 |
|
|
argv[2] = x2;
|
200 |
|
|
argv[3] = y2;
|
201 |
|
|
argv[4] = x3;
|
202 |
|
|
argv[5] = y3;
|
203 |
|
|
argv[6] = x4;
|
204 |
|
|
argv[7] = y4;
|
205 |
|
|
|
206 |
|
|
sprintf(x1,"%g",geom.x1);
|
207 |
|
|
sprintf(y1,"%g",geom.y1);
|
208 |
|
|
sprintf(x2,"%g",geom.x2);
|
209 |
|
|
sprintf(y2,"%g",geom.y2);
|
210 |
|
|
|
211 |
|
|
if (cnf.gridlock!=0)
|
212 |
|
|
{
|
213 |
|
|
/* changing lines, only when right to left */
|
214 |
|
|
if (! MY_graphOrder (/*canvasPtr->*/graph))
|
215 |
|
|
{
|
216 |
|
|
xdiff = (double) cnf.nodespaceH - xd;
|
217 |
|
|
if (xdiff < 0.0) xdiff = xd - (double) cnf.nodespaceH;
|
218 |
|
|
|
219 |
|
|
if (xdiff < 2.0 &&
|
220 |
|
|
MY_EdgeParent(/*canvasPtr->*/graph, i, 0) ==
|
221 |
|
|
MY_EdgeFromNode (/*canvasPtr->*/graph, i))
|
222 |
|
|
{
|
223 |
|
|
sprintf (x4, "%g", geom.x2);
|
224 |
|
|
sprintf (y4, "%g", geom.y2);
|
225 |
|
|
|
226 |
|
|
sprintf (x2, "%g", geom.x1 + (geom.x2 - geom.x1) / 2);
|
227 |
|
|
sprintf (y2, "%g", geom.y1);
|
228 |
|
|
sprintf (x3, "%g", geom.x1 + (geom.x2 - geom.x1) / 2);
|
229 |
|
|
sprintf (y3, "%g", geom.y2);
|
230 |
|
|
argc = 8;
|
231 |
|
|
}
|
232 |
|
|
}
|
233 |
|
|
}
|
234 |
|
|
Tk_CanvasEventuallyRedraw((Tk_Canvas) canvasPtr, iPtr->x1, iPtr->y1, iPtr->x2, iPtr->y2);
|
235 |
|
|
(void)(*iPtr->typePtr->coordProc)(interp, (Tk_Canvas) canvasPtr, iPtr,
|
236 |
|
|
/* argc-3, argv+3); 08nov95 wmt */
|
237 |
|
|
argc, argv);
|
238 |
|
|
Tk_CanvasEventuallyRedraw((Tk_Canvas) canvasPtr, iPtr->x1, iPtr->y1, iPtr->x2, iPtr->y2);
|
239 |
|
|
return TCL_OK;
|
240 |
|
|
}
|
241 |
|
|
|
242 |
|
|
static
|
243 |
|
|
int
|
244 |
|
|
GetEdgeNodes(interp,canvasPtr,i,fp,tp)
|
245 |
|
|
Tcl_Interp* interp;
|
246 |
|
|
TkCanvas* canvasPtr;
|
247 |
|
|
Tk_Item* i;
|
248 |
|
|
char** fp;
|
249 |
|
|
char** tp;
|
250 |
|
|
{
|
251 |
|
|
int argc;
|
252 |
|
|
char** argv;
|
253 |
|
|
char * buf;
|
254 |
|
|
|
255 |
|
|
/* Read the from node id of this edge. */
|
256 |
|
|
Tk_ConfigureInfo(interp, canvasPtr->tkwin,
|
257 |
|
|
i->typePtr->configSpecs,
|
258 |
|
|
(char *) i, "-from", 0);
|
259 |
|
|
if(Tcl_SplitList(interp, interp->result,
|
260 |
|
|
&argc, &argv) != TCL_OK) {
|
261 |
|
|
return TCL_ERROR;
|
262 |
|
|
}
|
263 |
|
|
/* This should actuall be a call like Tcl_Strdup() */
|
264 |
|
|
buf = (char*)ckalloc (strlen(argv[4])+1);
|
265 |
|
|
strcpy (buf, argv[4]);
|
266 |
|
|
*fp = buf;
|
267 |
|
|
ckfree((char*)argv);
|
268 |
|
|
/* Read the to node id of this edge. */
|
269 |
|
|
Tk_ConfigureInfo(interp, canvasPtr->tkwin,
|
270 |
|
|
i->typePtr->configSpecs,
|
271 |
|
|
(char *) i, "-to", 0);
|
272 |
|
|
if(Tcl_SplitList(interp, interp->result,
|
273 |
|
|
&argc, &argv) != TCL_OK) {
|
274 |
|
|
return TCL_ERROR;
|
275 |
|
|
}
|
276 |
|
|
buf = (char*)ckalloc (strlen(argv[4])+1);
|
277 |
|
|
strcpy (buf, argv[4]);
|
278 |
|
|
*tp = buf;
|
279 |
|
|
ckfree((char*)argv);
|
280 |
|
|
Tcl_ResetResult(interp);
|
281 |
|
|
return TCL_OK;
|
282 |
|
|
}
|
283 |
|
|
|
284 |
|
|
|
285 |
|
|
int
|
286 |
|
|
createcanvasgraph(interp,canvCmd,graph)
|
287 |
|
|
Tcl_Interp* interp;
|
288 |
|
|
Tcl_CmdInfo *canvCmd;
|
289 |
|
|
Layout_Graph **graph;
|
290 |
|
|
{
|
291 |
|
|
LayoutConfig cfg;
|
292 |
|
|
int argc1; char* argv1[3];
|
293 |
|
|
|
294 |
|
|
*graph = LayoutCreateGraph();
|
295 |
|
|
if(!*graph) {
|
296 |
|
|
Tcl_AppendResult(interp,"cannot create graph for canvas",(char*)0);
|
297 |
|
|
return TCL_ERROR;
|
298 |
|
|
}
|
299 |
|
|
cfg = GetLayoutConfig(*graph);
|
300 |
|
|
/* Establish max x and max y based on canvas height/width */
|
301 |
|
|
argv1[0] = "<graph-canvas>";
|
302 |
|
|
argv1[1] = "cget";
|
303 |
|
|
argv1[2] = "-width";
|
304 |
|
|
argc1 = 3;
|
305 |
|
|
if ((canvCmd->proc)(canvCmd->clientData, interp, argc1, argv1)
|
306 |
|
|
!= TCL_OK) {
|
307 |
|
|
return TCL_ERROR;
|
308 |
|
|
}
|
309 |
|
|
cfg.maxx = atol(Tcl_GetStringResult(interp));
|
310 |
|
|
|
311 |
|
|
argv1[2] = "-height";
|
312 |
|
|
if ((canvCmd->proc) (canvCmd->clientData, interp, argc1, argv1)
|
313 |
|
|
!= TCL_OK) {
|
314 |
|
|
return TCL_ERROR;
|
315 |
|
|
}
|
316 |
|
|
cfg.maxy = atol(Tcl_GetStringResult(interp));
|
317 |
|
|
Tcl_ResetResult(interp);
|
318 |
|
|
SetLayoutConfig(*graph,cfg);
|
319 |
|
|
return TCL_OK;
|
320 |
|
|
}
|
321 |
|
|
|
322 |
|
|
static Tcl_HashTable *
|
323 |
|
|
graph_table (Tcl_Interp *interp)
|
324 |
|
|
{
|
325 |
|
|
return (Tcl_HashTable *) Tcl_GetAssocData (interp, "canvasgraph", NULL);
|
326 |
|
|
}
|
327 |
|
|
|
328 |
|
|
/*
|
329 |
|
|
*-------------------------------------------------------------
|
330 |
|
|
*
|
331 |
|
|
* GetGraphLayout --
|
332 |
|
|
* Gets graph info for canvas. Adds a new entry if needed.
|
333 |
|
|
*
|
334 |
|
|
* Results:
|
335 |
|
|
* Standard Tcl Error
|
336 |
|
|
*-------------------------------------------------------------
|
337 |
|
|
*/
|
338 |
|
|
|
339 |
|
|
static Layout_Graph *
|
340 |
|
|
GetGraphLayout(canvCmd, interp)
|
341 |
|
|
Tcl_CmdInfo *canvCmd;
|
342 |
|
|
Tcl_Interp *interp;
|
343 |
|
|
{
|
344 |
|
|
Tcl_HashEntry *entry;
|
345 |
|
|
|
346 |
|
|
entry = Tcl_FindHashEntry(graph_table(interp), (char *)canvCmd->clientData);
|
347 |
|
|
if (entry)
|
348 |
|
|
return (Layout_Graph *)Tcl_GetHashValue(entry);
|
349 |
|
|
|
350 |
|
|
return NULL;
|
351 |
|
|
}
|
352 |
|
|
|
353 |
|
|
static Layout_Graph *
|
354 |
|
|
GetGraphLayoutII(canvasPtr, interp)
|
355 |
|
|
TkCanvas *canvasPtr;
|
356 |
|
|
Tcl_Interp *interp;
|
357 |
|
|
{
|
358 |
|
|
Tcl_HashEntry *entry;
|
359 |
|
|
entry = Tcl_FindHashEntry(graph_table(interp), (char *)canvasPtr);
|
360 |
|
|
if (entry)
|
361 |
|
|
return (Layout_Graph *)Tcl_GetHashValue(entry);
|
362 |
|
|
|
363 |
|
|
return NULL;
|
364 |
|
|
}
|
365 |
|
|
|
366 |
|
|
static int
|
367 |
|
|
GetCreatedGraphLayout(interp, canvCmd, graph)
|
368 |
|
|
Tcl_Interp *interp;
|
369 |
|
|
Tcl_CmdInfo *canvCmd;
|
370 |
|
|
Layout_Graph **graph;
|
371 |
|
|
{
|
372 |
|
|
*graph = GetGraphLayout(canvCmd, interp);
|
373 |
|
|
if (*graph == NULL) {
|
374 |
|
|
Tcl_HashEntry *newitem;
|
375 |
|
|
int new;
|
376 |
|
|
|
377 |
|
|
/* No item, let's make one and add it to the table. */
|
378 |
|
|
if (createcanvasgraph(interp, canvCmd, graph) != TCL_OK)
|
379 |
|
|
return TCL_ERROR;
|
380 |
|
|
newitem = Tcl_CreateHashEntry(graph_table(interp),
|
381 |
|
|
(char *)(canvCmd->clientData), &new);
|
382 |
|
|
Tcl_SetHashValue(newitem, (ClientData) *graph);
|
383 |
|
|
}
|
384 |
|
|
return TCL_OK;
|
385 |
|
|
}
|
386 |
|
|
|
387 |
|
|
/*
|
388 |
|
|
*--------------------------------------------------------------
|
389 |
|
|
*
|
390 |
|
|
* GraphCanvasCmd --
|
391 |
|
|
* This procedure is invoked to process the new "graph"
|
392 |
|
|
* command. This command takes a canvas and uses it to layout
|
393 |
|
|
* the canvas items with a pretty graph structure.
|
394 |
|
|
*
|
395 |
|
|
* Results:
|
396 |
|
|
* Standard Tcl result.
|
397 |
|
|
*
|
398 |
|
|
*--------------------------------------------------------------
|
399 |
|
|
*/
|
400 |
|
|
|
401 |
|
|
int
|
402 |
|
|
GraphCanvasCmd(clientData, interp, argc, argv)
|
403 |
|
|
ClientData clientData;
|
404 |
|
|
Tcl_Interp *interp;
|
405 |
|
|
int argc;
|
406 |
|
|
char **argv;
|
407 |
|
|
{
|
408 |
|
|
Tcl_CmdInfo canvCmd;
|
409 |
|
|
size_t length;
|
410 |
|
|
int c, i;
|
411 |
|
|
Layout_Graph *graph;
|
412 |
|
|
TkCanvas *canvasPtr;
|
413 |
|
|
|
414 |
|
|
if (argc < 3) {
|
415 |
|
|
Tcl_AppendResult(interp, "wrong # args: should be \"",
|
416 |
|
|
argv[0], " canvas option ?arg arg ...?\"",
|
417 |
|
|
(char *) NULL);
|
418 |
|
|
return TCL_ERROR;
|
419 |
|
|
}
|
420 |
|
|
|
421 |
|
|
/* The second arg is the canvas widget */
|
422 |
|
|
if (!Tcl_GetCommandInfo(interp, argv[1], &canvCmd)) {
|
423 |
|
|
Tcl_AppendResult(interp, "couldn't get canvas information for \"",
|
424 |
|
|
argv[1], "\"", (char *) NULL);
|
425 |
|
|
return TCL_ERROR;
|
426 |
|
|
}
|
427 |
|
|
canvasPtr = (TkCanvas *)(canvCmd.clientData);
|
428 |
|
|
|
429 |
|
|
c = argv[2][0];
|
430 |
|
|
length = strlen(argv[2]);
|
431 |
|
|
if ((c == 'a') && (strncmp(argv[2], "add", length) == 0)) {
|
432 |
|
|
char* newargv[4];
|
433 |
|
|
if (argc < 4) {
|
434 |
|
|
Tcl_AppendResult(interp, "wrong # args: should be \"", argv[0],
|
435 |
|
|
" ", argv[1], " add tagOrId ?tagOrId ...?\"",
|
436 |
|
|
(char *) NULL);
|
437 |
|
|
goto error;
|
438 |
|
|
}
|
439 |
|
|
|
440 |
|
|
if (GetCreatedGraphLayout(interp, &canvCmd, &graph) != TCL_OK)
|
441 |
|
|
goto error;
|
442 |
|
|
|
443 |
|
|
for (i = 3; i < argc; i++) {
|
444 |
|
|
Tk_Item *itemPtr;
|
445 |
|
|
TagSearch search;
|
446 |
|
|
/* Loop through all the items */
|
447 |
|
|
for (itemPtr = StartTagSearch(canvasPtr, argv[i], &search);
|
448 |
|
|
itemPtr != NULL; itemPtr = NextItem(&search)) {
|
449 |
|
|
char* nm = itemPtr->typePtr->name;
|
450 |
|
|
/* create a new edge or node */
|
451 |
|
|
if(strcmp(nm,"edge") == 0) {
|
452 |
|
|
char* fname;
|
453 |
|
|
char* tname;
|
454 |
|
|
Tk_Item* f;
|
455 |
|
|
Tk_Item* t;
|
456 |
|
|
/* find the from and to node pItems */
|
457 |
|
|
if(GetEdgeNodes(interp,canvasPtr,itemPtr,&fname,&tname) != TCL_OK)
|
458 |
|
|
goto error;
|
459 |
|
|
/* find the from and to node pItems */
|
460 |
|
|
f = StartTagSearch(canvasPtr, fname, &search);
|
461 |
|
|
t = StartTagSearch(canvasPtr, tname, &search);
|
462 |
|
|
ckfree(fname); ckfree(tname);
|
463 |
|
|
if(LayoutCreateEdge(graph,
|
464 |
|
|
(pItem)itemPtr,
|
465 |
|
|
(pItem)f, (pItem)t) != TCL_OK) {
|
466 |
|
|
char* msg = LayoutGetError(graph);
|
467 |
|
|
if(!msg)
|
468 |
|
|
msg = "could not record edge in graph";
|
469 |
|
|
Tcl_AppendResult(interp,msg,(char*)0);
|
470 |
|
|
goto error;
|
471 |
|
|
}
|
472 |
|
|
} else { /* not an edge; assume a node */
|
473 |
|
|
/* verify that we can handle this */
|
474 |
|
|
char** p;
|
475 |
|
|
for(p=layableitems;*p;p++) {
|
476 |
|
|
if(strcmp(*p,nm)==0) break;
|
477 |
|
|
}
|
478 |
|
|
if(!*p) {
|
479 |
|
|
Tcl_AppendResult(interp,"cannot yet handle ",nm,(char*)0);
|
480 |
|
|
goto error;
|
481 |
|
|
}
|
482 |
|
|
if(LayoutCreateNode(graph,
|
483 |
|
|
(pItem)itemPtr,NULL,NULL) !=TCL_OK) {
|
484 |
|
|
char* msg = LayoutGetError(graph);
|
485 |
|
|
if(!msg)
|
486 |
|
|
msg = "could not record node in graph";
|
487 |
|
|
Tcl_AppendResult(interp,msg,(char*)0);
|
488 |
|
|
goto error;
|
489 |
|
|
}
|
490 |
|
|
}
|
491 |
|
|
}
|
492 |
|
|
}
|
493 |
|
|
|
494 |
|
|
} else if ((c == 'c') && (strncmp(argv[2], "configure", length) == 0)) {
|
495 |
|
|
register int ok;
|
496 |
|
|
LayoutConfig cfg;
|
497 |
|
|
if (GetCreatedGraphLayout(interp, &canvCmd, &graph) != TCL_OK)
|
498 |
|
|
goto error;
|
499 |
|
|
cfg = GetLayoutConfig(graph);
|
500 |
|
|
|
501 |
|
|
if(argc == 3) {
|
502 |
|
|
/* get all options */
|
503 |
|
|
ok = Tk_ConfigureInfo(interp,
|
504 |
|
|
Tk_CanvasTkwin(*(Tk_Canvas *)canvasPtr),
|
505 |
|
|
graphspecs,(char*)&cfg, (char*)NULL, 0);
|
506 |
|
|
} else if(argc == 4) {
|
507 |
|
|
/* get one option */
|
508 |
|
|
ok = Tk_ConfigureInfo(interp,
|
509 |
|
|
Tk_CanvasTkwin(*(Tk_Canvas *)canvasPtr),
|
510 |
|
|
graphspecs,(char*)&cfg, argv[3], 0);
|
511 |
|
|
} else { /* setting one or more options */
|
512 |
|
|
ok = Tk_ConfigureWidget(interp,
|
513 |
|
|
Tk_CanvasTkwin(*(Tk_Canvas *)canvasPtr),
|
514 |
|
|
graphspecs, argc-3, argv+3,
|
515 |
|
|
(char*)&cfg, TK_CONFIG_ARGV_ONLY);
|
516 |
|
|
if(ok == TCL_OK) {
|
517 |
|
|
SetLayoutConfig(graph,cfg);
|
518 |
|
|
}
|
519 |
|
|
}
|
520 |
|
|
if(ok != TCL_OK) goto error;
|
521 |
|
|
} else if ((c == 'c') && (strncmp(argv[2], "clear", length) == 0)) {
|
522 |
|
|
/* clear graph; ignore if no graph */
|
523 |
|
|
Layout_Graph *graph = GetGraphLayout(&canvCmd, interp);
|
524 |
|
|
if (graph)
|
525 |
|
|
LayoutClearGraph(graph);
|
526 |
|
|
} else if ((c == 'd') && (strncmp(argv[2], "destroy", length) == 0)) {
|
527 |
|
|
/* destroy any graph info connected to the canvas,
|
528 |
|
|
but without destroying the canvas
|
529 |
|
|
*/
|
530 |
|
|
Layout_Graph *graph = GetGraphLayout(&canvCmd, interp);
|
531 |
|
|
if (graph) {
|
532 |
|
|
Tcl_HashEntry *entry;
|
533 |
|
|
entry = Tcl_FindHashEntry(graph_table(interp),
|
534 |
|
|
(char *)(canvCmd.clientData));
|
535 |
|
|
|
536 |
|
|
LayoutFreeGraph(graph);
|
537 |
|
|
/* Remove hash table entry */
|
538 |
|
|
Tcl_DeleteHashEntry(entry);
|
539 |
|
|
}
|
540 |
|
|
} else if ((c == 'e') && (strncmp(argv[2], "edges", length) == 0)) {
|
541 |
|
|
Tk_Item* ip;
|
542 |
|
|
Layout_Graph *graph = GetGraphLayout(&canvCmd, interp);
|
543 |
|
|
/* return list of edges associated with graph, if any */
|
544 |
|
|
if(!graph) goto done;
|
545 |
|
|
for(i=0;LayoutGetIthEdge(graph,i,(pItem*)&ip)==TCL_OK;i++) {
|
546 |
|
|
char convertbuffer[20];
|
547 |
|
|
sprintf(convertbuffer, "%d", ip->id);
|
548 |
|
|
Tcl_AppendElement(interp,convertbuffer);
|
549 |
|
|
}
|
550 |
|
|
} else if ((c == 'l') && (strncmp(argv[2], "layout", length) == 0)) {
|
551 |
|
|
char* which;
|
552 |
|
|
Tk_Item* ip;
|
553 |
|
|
Layout_Graph *graph = GetGraphLayout(&canvCmd, interp);
|
554 |
|
|
|
555 |
|
|
if(!graph) goto done;
|
556 |
|
|
|
557 |
|
|
/* get the geometries of the items attached to the graph */
|
558 |
|
|
for(i=0;LayoutGetIthNode(graph,i,(pItem*)&ip)==TCL_OK;i++) {
|
559 |
|
|
ItemGeom geom;
|
560 |
|
|
if(getnodebbox(interp,canvasPtr,ip,&geom) != TCL_OK
|
561 |
|
|
|| LayoutSetNodeBBox(graph,ip,geom) != TCL_OK) {
|
562 |
|
|
Tcl_AppendResult(interp, "could not get node location", (char *) NULL);
|
563 |
|
|
goto error;
|
564 |
|
|
}
|
565 |
|
|
}
|
566 |
|
|
for(i=0;LayoutGetIthEdge(graph,i,(pItem*)&ip)==TCL_OK;i++) {
|
567 |
|
|
ItemGeom geom;
|
568 |
|
|
if(getedgedim(canvasPtr,ip,&geom) != TCL_OK
|
569 |
|
|
|| LayoutSetEdgeDim(graph,ip,geom) != TCL_OK) {
|
570 |
|
|
Tcl_AppendResult(interp, "could not get edge location", (char *) NULL);
|
571 |
|
|
goto error;
|
572 |
|
|
}
|
573 |
|
|
}
|
574 |
|
|
|
575 |
|
|
if(argc > 3) which = argv[3]; else which = "isi";
|
576 |
|
|
if(strcmp(which,"tree")==0) {
|
577 |
|
|
if(LayoutTree(graph) == TCL_ERROR) {
|
578 |
|
|
Tcl_AppendResult(interp, "layout failed",(char *) NULL);
|
579 |
|
|
goto error;
|
580 |
|
|
}
|
581 |
|
|
} else if(strcmp(which,"isi")==0) {
|
582 |
|
|
if(LayoutISI(graph) == TCL_ERROR) {
|
583 |
|
|
Tcl_AppendResult(interp, "layout failed",(char *) NULL);
|
584 |
|
|
goto error;
|
585 |
|
|
}
|
586 |
|
|
} else if(strcmp(which,"matrix")==0) {
|
587 |
|
|
if(LayoutMatrix(graph) == TCL_ERROR) {
|
588 |
|
|
Tcl_AppendResult(interp, "layout failed",(char *) NULL);
|
589 |
|
|
goto error;
|
590 |
|
|
}
|
591 |
|
|
} else if(strcmp(which,"random")==0) {
|
592 |
|
|
if(LayoutRandom(graph) == TCL_ERROR) {
|
593 |
|
|
Tcl_AppendResult(interp, "layout failed",(char *) NULL);
|
594 |
|
|
goto error;
|
595 |
|
|
}
|
596 |
|
|
} else {
|
597 |
|
|
Tcl_AppendResult(interp, "unknown layout algorithm", which, (char *) NULL);
|
598 |
|
|
goto error;
|
599 |
|
|
}
|
600 |
|
|
/* move the various items into place after layout */
|
601 |
|
|
for(i=0;LayoutGetIthNode(graph,i,(pItem*)&ip)==TCL_OK;i++) {
|
602 |
|
|
ItemGeom geom;
|
603 |
|
|
if(LayoutGetNodeBBox(graph,ip,&geom) != TCL_OK
|
604 |
|
|
|| setnodegeom(interp,canvasPtr,ip,geom) != TCL_OK) {
|
605 |
|
|
Tcl_AppendResult(interp, "could not set node location", (char *) NULL);
|
606 |
|
|
goto error;
|
607 |
|
|
}
|
608 |
|
|
}
|
609 |
|
|
for(i=0;LayoutGetIthEdge(graph,i,(pItem*)&ip)==TCL_OK;i++) {
|
610 |
|
|
ItemGeom geom;
|
611 |
|
|
if(LayoutGetEdgeEndPoints(graph,ip,&geom) != TCL_OK
|
612 |
|
|
|| setedgegeom(interp,canvasPtr,ip,geom,i) != TCL_OK) {
|
613 |
|
|
Tcl_AppendResult(interp, "could not set edge location", (char *) NULL);
|
614 |
|
|
goto error;
|
615 |
|
|
}
|
616 |
|
|
}
|
617 |
|
|
} else if ((c == 'n') && (strncmp(argv[2], "nodes", length) == 0)) {
|
618 |
|
|
Tk_Item* ip;
|
619 |
|
|
Layout_Graph *graph = GetGraphLayout(&canvCmd, interp);
|
620 |
|
|
|
621 |
|
|
/* return list of nodes associated with graph */
|
622 |
|
|
if(!graph) goto done;
|
623 |
|
|
for(i=0;LayoutGetIthNode(graph,i,(pItem*)&ip)==TCL_OK;i++) {
|
624 |
|
|
char convertbuffer[20];
|
625 |
|
|
sprintf(convertbuffer, "%d", ip->id);
|
626 |
|
|
Tcl_AppendElement(interp,convertbuffer);
|
627 |
|
|
}
|
628 |
|
|
} else if ((c == 'r') && (strncmp(argv[2], "remove", length) == 0)) {
|
629 |
|
|
char* nm;
|
630 |
|
|
Tk_Item *itemPtr;
|
631 |
|
|
TagSearch search;
|
632 |
|
|
Layout_Graph *graph = GetGraphLayout(&canvCmd, interp);
|
633 |
|
|
|
634 |
|
|
if(!graph) goto done;
|
635 |
|
|
for (i = 3; i < argc; i++) {
|
636 |
|
|
for (itemPtr = StartTagSearch(canvasPtr, argv[i], &search);
|
637 |
|
|
itemPtr != NULL; itemPtr = NextItem(&search)) {
|
638 |
|
|
nm = itemPtr->typePtr->name;
|
639 |
|
|
/* delete a new edge or node */
|
640 |
|
|
if(strcmp(nm,"edge") == 0) {
|
641 |
|
|
(void)LayoutDeleteEdge(graph,itemPtr);
|
642 |
|
|
} else { /* not an edge; assume a node */
|
643 |
|
|
(void)LayoutDeleteNode(graph,itemPtr);
|
644 |
|
|
}
|
645 |
|
|
}
|
646 |
|
|
}
|
647 |
|
|
} else {
|
648 |
|
|
Tcl_AppendResult(interp, "bad option \"", argv[2],
|
649 |
|
|
"\": must be add, configure, clear, ",
|
650 |
|
|
"destroy, edges, layout, nodes, remove",
|
651 |
|
|
(char *) NULL);
|
652 |
|
|
goto error;
|
653 |
|
|
}
|
654 |
|
|
done:
|
655 |
|
|
return TCL_OK;
|
656 |
|
|
error:
|
657 |
|
|
return TCL_ERROR;
|
658 |
|
|
}
|
659 |
|
|
|
660 |
|
|
/* If graph is deleted, make it go away */
|
661 |
|
|
static void
|
662 |
|
|
delete_graph_command(ClientData clientData, Tcl_Interp *interp)
|
663 |
|
|
{
|
664 |
|
|
Tcl_DeleteHashTable((Tcl_HashTable *) clientData);
|
665 |
|
|
|
666 |
|
|
ckfree ((char*) clientData);
|
667 |
|
|
}
|
668 |
|
|
|
669 |
|
|
/*
|
670 |
|
|
*-------------------------------------------------------------
|
671 |
|
|
* GraphLayoutInit()
|
672 |
|
|
* Adds appropriate commands to Tcl interpreter, and
|
673 |
|
|
* inits necessary tables.
|
674 |
|
|
*-------------------------------------------------------------
|
675 |
|
|
*/
|
676 |
|
|
int
|
677 |
|
|
create_graph_command(Tcl_Interp *interp)
|
678 |
|
|
{
|
679 |
|
|
Tcl_HashTable *graphTable= (Tcl_HashTable*)ckalloc (sizeof (Tcl_HashTable));
|
680 |
|
|
|
681 |
|
|
Tcl_InitHashTable(graphTable, TCL_ONE_WORD_KEYS);
|
682 |
|
|
|
683 |
|
|
/*
|
684 |
|
|
* Create an associated data that stores the
|
685 |
|
|
* hash table
|
686 |
|
|
*/
|
687 |
|
|
Tcl_SetAssocData (interp, "canvasgraph",
|
688 |
|
|
delete_graph_command,
|
689 |
|
|
(void*) graphTable);
|
690 |
|
|
|
691 |
|
|
allUid = Tk_GetUid("all");
|
692 |
|
|
|
693 |
|
|
if (Tcl_CreateCommand(interp, "graph", GraphCanvasCmd,
|
694 |
|
|
NULL, NULL /*delete_graph_command*/ ) == NULL)
|
695 |
|
|
return TCL_ERROR;
|
696 |
|
|
|
697 |
|
|
Tk_CreateItemType(&tkEdgeType);
|
698 |
|
|
|
699 |
|
|
return TCL_OK;
|
700 |
|
|
}
|
701 |
|
|
|
702 |
|
|
/*
|
703 |
|
|
*--------------------------------------------------------------
|
704 |
|
|
*
|
705 |
|
|
* StartTagSearch --
|
706 |
|
|
*
|
707 |
|
|
* This procedure is called to initiate an enumeration of
|
708 |
|
|
* all items in a given canvas that contain a given tag.
|
709 |
|
|
*
|
710 |
|
|
* Results:
|
711 |
|
|
* The return value is a pointer to the first item in
|
712 |
|
|
* canvasPtr that matches tag, or NULL if there is no
|
713 |
|
|
* such item. The information at *searchPtr is initialized
|
714 |
|
|
* such that successive calls to NextItem will return
|
715 |
|
|
* successive items that match tag.
|
716 |
|
|
*
|
717 |
|
|
* Side effects:
|
718 |
|
|
* SearchPtr is linked into a list of searches in progress
|
719 |
|
|
* on canvasPtr, so that elements can safely be deleted
|
720 |
|
|
* while the search is in progress. EndTagSearch must be
|
721 |
|
|
* called at the end of the search to unlink searchPtr from
|
722 |
|
|
* this list.
|
723 |
|
|
*
|
724 |
|
|
*--------------------------------------------------------------
|
725 |
|
|
*/
|
726 |
|
|
|
727 |
|
|
static Tk_Item *
|
728 |
|
|
StartTagSearch(canvasPtr, tag, searchPtr)
|
729 |
|
|
TkCanvas *canvasPtr; /* Canvas whose items are to be
|
730 |
|
|
* searched. */
|
731 |
|
|
char *tag; /* String giving tag value. */
|
732 |
|
|
TagSearch *searchPtr; /* Record describing tag search;
|
733 |
|
|
* will be initialized here. */
|
734 |
|
|
{
|
735 |
|
|
int id;
|
736 |
|
|
Tk_Item *itemPtr, *prevPtr;
|
737 |
|
|
Tk_Uid *tagPtr;
|
738 |
|
|
Tk_Uid uid;
|
739 |
|
|
int count;
|
740 |
|
|
|
741 |
|
|
/*
|
742 |
|
|
* Initialize the search.
|
743 |
|
|
*/
|
744 |
|
|
|
745 |
|
|
searchPtr->canvasPtr = canvasPtr;
|
746 |
|
|
searchPtr->searchOver = 0;
|
747 |
|
|
|
748 |
|
|
/*
|
749 |
|
|
* Find the first matching item in one of several ways. If the tag
|
750 |
|
|
* is a number then it selects the single item with the matching
|
751 |
|
|
* identifier. In this case see if the item being requested is the
|
752 |
|
|
* hot item, in which case the search can be skipped.
|
753 |
|
|
*/
|
754 |
|
|
|
755 |
|
|
if (isdigit(UCHAR(*tag))) {
|
756 |
|
|
char *end;
|
757 |
|
|
|
758 |
|
|
id = strtoul(tag, &end, 0);
|
759 |
|
|
if (*end == 0) {
|
760 |
|
|
itemPtr = canvasPtr->hotPtr;
|
761 |
|
|
prevPtr = canvasPtr->hotPrevPtr;
|
762 |
|
|
if ((itemPtr == NULL) || (itemPtr->id != id) || (prevPtr == NULL)
|
763 |
|
|
|| (prevPtr->nextPtr != itemPtr)) {
|
764 |
|
|
for (prevPtr = NULL, itemPtr = canvasPtr->firstItemPtr;
|
765 |
|
|
itemPtr != NULL;
|
766 |
|
|
prevPtr = itemPtr, itemPtr = itemPtr->nextPtr) {
|
767 |
|
|
if (itemPtr->id == id) {
|
768 |
|
|
break;
|
769 |
|
|
}
|
770 |
|
|
}
|
771 |
|
|
}
|
772 |
|
|
searchPtr->prevPtr = prevPtr;
|
773 |
|
|
searchPtr->searchOver = 1;
|
774 |
|
|
canvasPtr->hotPtr = itemPtr;
|
775 |
|
|
canvasPtr->hotPrevPtr = prevPtr;
|
776 |
|
|
return itemPtr;
|
777 |
|
|
}
|
778 |
|
|
}
|
779 |
|
|
|
780 |
|
|
searchPtr->tag = uid = Tk_GetUid(tag);
|
781 |
|
|
if (uid == allUid) {
|
782 |
|
|
|
783 |
|
|
/*
|
784 |
|
|
* All items match.
|
785 |
|
|
*/
|
786 |
|
|
|
787 |
|
|
searchPtr->tag = NULL;
|
788 |
|
|
searchPtr->prevPtr = NULL;
|
789 |
|
|
searchPtr->currentPtr = canvasPtr->firstItemPtr;
|
790 |
|
|
return canvasPtr->firstItemPtr;
|
791 |
|
|
}
|
792 |
|
|
|
793 |
|
|
/*
|
794 |
|
|
* None of the above. Search for an item with a matching tag.
|
795 |
|
|
*/
|
796 |
|
|
|
797 |
|
|
for (prevPtr = NULL, itemPtr = canvasPtr->firstItemPtr; itemPtr != NULL;
|
798 |
|
|
prevPtr = itemPtr, itemPtr = itemPtr->nextPtr) {
|
799 |
|
|
for (tagPtr = itemPtr->tagPtr, count = itemPtr->numTags;
|
800 |
|
|
count > 0; tagPtr++, count--) {
|
801 |
|
|
if (*tagPtr == uid) {
|
802 |
|
|
searchPtr->prevPtr = prevPtr;
|
803 |
|
|
searchPtr->currentPtr = itemPtr;
|
804 |
|
|
return itemPtr;
|
805 |
|
|
}
|
806 |
|
|
}
|
807 |
|
|
}
|
808 |
|
|
searchPtr->prevPtr = prevPtr;
|
809 |
|
|
searchPtr->searchOver = 1;
|
810 |
|
|
return NULL;
|
811 |
|
|
}
|
812 |
|
|
|
813 |
|
|
/*
|
814 |
|
|
*--------------------------------------------------------------
|
815 |
|
|
*
|
816 |
|
|
* NextItem --
|
817 |
|
|
*
|
818 |
|
|
* This procedure returns successive items that match a given
|
819 |
|
|
* tag; it should be called only after StartTagSearch has been
|
820 |
|
|
* used to begin a search.
|
821 |
|
|
*
|
822 |
|
|
* Results:
|
823 |
|
|
* The return value is a pointer to the next item that matches
|
824 |
|
|
* the tag specified to StartTagSearch, or NULL if no such
|
825 |
|
|
* item exists. *SearchPtr is updated so that the next call
|
826 |
|
|
* to this procedure will return the next item.
|
827 |
|
|
*
|
828 |
|
|
* Side effects:
|
829 |
|
|
* None.
|
830 |
|
|
*
|
831 |
|
|
*--------------------------------------------------------------
|
832 |
|
|
*/
|
833 |
|
|
|
834 |
|
|
static Tk_Item *
|
835 |
|
|
NextItem(searchPtr)
|
836 |
|
|
TagSearch *searchPtr; /* Record describing search in
|
837 |
|
|
* progress. */
|
838 |
|
|
{
|
839 |
|
|
Tk_Item *itemPtr, *prevPtr;
|
840 |
|
|
int count;
|
841 |
|
|
Tk_Uid uid;
|
842 |
|
|
Tk_Uid *tagPtr;
|
843 |
|
|
|
844 |
|
|
/*
|
845 |
|
|
* Find next item in list (this may not actually be a suitable
|
846 |
|
|
* one to return), and return if there are no items left.
|
847 |
|
|
*/
|
848 |
|
|
|
849 |
|
|
prevPtr = searchPtr->prevPtr;
|
850 |
|
|
if (prevPtr == NULL) {
|
851 |
|
|
itemPtr = searchPtr->canvasPtr->firstItemPtr;
|
852 |
|
|
} else {
|
853 |
|
|
itemPtr = prevPtr->nextPtr;
|
854 |
|
|
}
|
855 |
|
|
if ((itemPtr == NULL) || (searchPtr->searchOver)) {
|
856 |
|
|
searchPtr->searchOver = 1;
|
857 |
|
|
return NULL;
|
858 |
|
|
}
|
859 |
|
|
if (itemPtr != searchPtr->currentPtr) {
|
860 |
|
|
/*
|
861 |
|
|
* The structure of the list has changed. Probably the
|
862 |
|
|
* previously-returned item was removed from the list.
|
863 |
|
|
* In this case, don't advance prevPtr; just return
|
864 |
|
|
* its new successor (i.e. do nothing here).
|
865 |
|
|
*/
|
866 |
|
|
} else {
|
867 |
|
|
prevPtr = itemPtr;
|
868 |
|
|
itemPtr = prevPtr->nextPtr;
|
869 |
|
|
}
|
870 |
|
|
|
871 |
|
|
/*
|
872 |
|
|
* Handle special case of "all" search by returning next item.
|
873 |
|
|
*/
|
874 |
|
|
|
875 |
|
|
uid = searchPtr->tag;
|
876 |
|
|
if (uid == NULL) {
|
877 |
|
|
searchPtr->prevPtr = prevPtr;
|
878 |
|
|
searchPtr->currentPtr = itemPtr;
|
879 |
|
|
return itemPtr;
|
880 |
|
|
}
|
881 |
|
|
|
882 |
|
|
/*
|
883 |
|
|
* Look for an item with a particular tag.
|
884 |
|
|
*/
|
885 |
|
|
|
886 |
|
|
for ( ; itemPtr != NULL; prevPtr = itemPtr, itemPtr = itemPtr->nextPtr) {
|
887 |
|
|
for (tagPtr = itemPtr->tagPtr, count = itemPtr->numTags;
|
888 |
|
|
count > 0; tagPtr++, count--) {
|
889 |
|
|
if (*tagPtr == uid) {
|
890 |
|
|
searchPtr->prevPtr = prevPtr;
|
891 |
|
|
searchPtr->currentPtr = itemPtr;
|
892 |
|
|
return itemPtr;
|
893 |
|
|
}
|
894 |
|
|
}
|
895 |
|
|
}
|
896 |
|
|
searchPtr->prevPtr = prevPtr;
|
897 |
|
|
searchPtr->searchOver = 1;
|
898 |
|
|
return NULL;
|
899 |
|
|
}
|