Graphviz 13.0.0~dev.20241220.2304
Loading...
Searching...
No Matches
gv_ruby.cpp
Go to the documentation of this file.
1/* ----------------------------------------------------------------------------
2 * This file was automatically generated by SWIG (https://www.swig.org).
3 * Version 4.2.0
4 *
5 * Do not make changes to this file unless you know what you are doing - modify
6 * the SWIG interface file instead.
7 * ----------------------------------------------------------------------------- */
8
9
10#define SWIG_VERSION 0x040200
11#define SWIGRUBY
12
13/* -----------------------------------------------------------------------------
14 * This section contains generic SWIG labels for method/variable
15 * declarations/attributes, and other compiler dependent labels.
16 * ----------------------------------------------------------------------------- */
17
18/* template workaround for compilers that cannot correctly implement the C++ standard */
19#ifndef SWIGTEMPLATEDISAMBIGUATOR
20# if defined(__SUNPRO_CC) && (__SUNPRO_CC <= 0x560)
21# define SWIGTEMPLATEDISAMBIGUATOR template
22# elif defined(__HP_aCC)
23/* Needed even with `aCC -AA' when `aCC -V' reports HP ANSI C++ B3910B A.03.55 */
24/* If we find a maximum version that requires this, the test would be __HP_aCC <= 35500 for A.03.55 */
25# define SWIGTEMPLATEDISAMBIGUATOR template
26# else
27# define SWIGTEMPLATEDISAMBIGUATOR
28# endif
29#endif
30
31/* inline attribute */
32#ifndef SWIGINLINE
33# if defined(__cplusplus) || (defined(__GNUC__) && !defined(__STRICT_ANSI__))
34# define SWIGINLINE inline
35# else
36# define SWIGINLINE
37# endif
38#endif
39
40/* attribute recognised by some compilers to avoid 'unused' warnings */
41#ifndef SWIGUNUSED
42# if defined(__GNUC__)
43# if !(defined(__cplusplus)) || (__GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4))
44# define SWIGUNUSED __attribute__ ((__unused__))
45# else
46# define SWIGUNUSED
47# endif
48# elif defined(__ICC)
49# define SWIGUNUSED __attribute__ ((__unused__))
50# else
51# define SWIGUNUSED
52# endif
53#endif
54
55#ifndef SWIG_MSC_UNSUPPRESS_4505
56# if defined(_MSC_VER)
57# pragma warning(disable : 4505) /* unreferenced local function has been removed */
58# endif
59#endif
60
61#ifndef SWIGUNUSEDPARM
62# ifdef __cplusplus
63# define SWIGUNUSEDPARM(p)
64# else
65# define SWIGUNUSEDPARM(p) p SWIGUNUSED
66# endif
67#endif
68
69/* internal SWIG method */
70#ifndef SWIGINTERN
71# define SWIGINTERN static SWIGUNUSED
72#endif
73
74/* internal inline SWIG method */
75#ifndef SWIGINTERNINLINE
76# define SWIGINTERNINLINE SWIGINTERN SWIGINLINE
77#endif
78
79/* exporting methods */
80#if defined(__GNUC__)
81# if (__GNUC__ >= 4) || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4)
82# ifndef GCC_HASCLASSVISIBILITY
83# define GCC_HASCLASSVISIBILITY
84# endif
85# endif
86#endif
87
88#ifndef SWIGEXPORT
89# if defined(_WIN32) || defined(__WIN32__) || defined(__CYGWIN__)
90# if defined(STATIC_LINKED)
91# define SWIGEXPORT
92# else
93# define SWIGEXPORT __declspec(dllexport)
94# endif
95# else
96# if defined(__GNUC__) && defined(GCC_HASCLASSVISIBILITY)
97# define SWIGEXPORT __attribute__ ((visibility("default")))
98# else
99# define SWIGEXPORT
100# endif
101# endif
102#endif
103
104/* calling conventions for Windows */
105#ifndef SWIGSTDCALL
106# if defined(_WIN32) || defined(__WIN32__) || defined(__CYGWIN__)
107# define SWIGSTDCALL __stdcall
108# else
109# define SWIGSTDCALL
110# endif
111#endif
112
113/* Deal with Microsoft's attempt at deprecating C standard runtime functions */
114#if !defined(SWIG_NO_CRT_SECURE_NO_DEPRECATE) && defined(_MSC_VER) && !defined(_CRT_SECURE_NO_DEPRECATE)
115# define _CRT_SECURE_NO_DEPRECATE
116#endif
117
118/* Deal with Microsoft's attempt at deprecating methods in the standard C++ library */
119#if !defined(SWIG_NO_SCL_SECURE_NO_DEPRECATE) && defined(_MSC_VER) && !defined(_SCL_SECURE_NO_DEPRECATE)
120# define _SCL_SECURE_NO_DEPRECATE
121#endif
122
123/* Deal with Apple's deprecated 'AssertMacros.h' from Carbon-framework */
124#if defined(__APPLE__) && !defined(__ASSERT_MACROS_DEFINE_VERSIONS_WITHOUT_UNDERSCORES)
125# define __ASSERT_MACROS_DEFINE_VERSIONS_WITHOUT_UNDERSCORES 0
126#endif
127
128/* Intel's compiler complains if a variable which was never initialised is
129 * cast to void, which is a common idiom which we use to indicate that we
130 * are aware a variable isn't used. So we just silence that warning.
131 * See: https://github.com/swig/swig/issues/192 for more discussion.
132 */
133#ifdef __INTEL_COMPILER
134# pragma warning disable 592
135#endif
136
137#if __cplusplus >=201103L
138# define SWIG_NULLPTR nullptr
139#else
140# define SWIG_NULLPTR NULL
141#endif
142
143/* -----------------------------------------------------------------------------
144 * This section contains generic SWIG labels for method/variable
145 * declarations/attributes, and other compiler dependent labels.
146 * ----------------------------------------------------------------------------- */
147
148/* template workaround for compilers that cannot correctly implement the C++ standard */
149#ifndef SWIGTEMPLATEDISAMBIGUATOR
150# if defined(__SUNPRO_CC) && (__SUNPRO_CC <= 0x560)
151# define SWIGTEMPLATEDISAMBIGUATOR template
152# elif defined(__HP_aCC)
153/* Needed even with `aCC -AA' when `aCC -V' reports HP ANSI C++ B3910B A.03.55 */
154/* If we find a maximum version that requires this, the test would be __HP_aCC <= 35500 for A.03.55 */
155# define SWIGTEMPLATEDISAMBIGUATOR template
156# else
157# define SWIGTEMPLATEDISAMBIGUATOR
158# endif
159#endif
160
161/* inline attribute */
162#ifndef SWIGINLINE
163# if defined(__cplusplus) || (defined(__GNUC__) && !defined(__STRICT_ANSI__))
164# define SWIGINLINE inline
165# else
166# define SWIGINLINE
167# endif
168#endif
169
170/* attribute recognised by some compilers to avoid 'unused' warnings */
171#ifndef SWIGUNUSED
172# if defined(__GNUC__)
173# if !(defined(__cplusplus)) || (__GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4))
174# define SWIGUNUSED __attribute__ ((__unused__))
175# else
176# define SWIGUNUSED
177# endif
178# elif defined(__ICC)
179# define SWIGUNUSED __attribute__ ((__unused__))
180# else
181# define SWIGUNUSED
182# endif
183#endif
184
185#ifndef SWIG_MSC_UNSUPPRESS_4505
186# if defined(_MSC_VER)
187# pragma warning(disable : 4505) /* unreferenced local function has been removed */
188# endif
189#endif
190
191#ifndef SWIGUNUSEDPARM
192# ifdef __cplusplus
193# define SWIGUNUSEDPARM(p)
194# else
195# define SWIGUNUSEDPARM(p) p SWIGUNUSED
196# endif
197#endif
198
199/* internal SWIG method */
200#ifndef SWIGINTERN
201# define SWIGINTERN static SWIGUNUSED
202#endif
203
204/* internal inline SWIG method */
205#ifndef SWIGINTERNINLINE
206# define SWIGINTERNINLINE SWIGINTERN SWIGINLINE
207#endif
208
209/* exporting methods */
210#if defined(__GNUC__)
211# if (__GNUC__ >= 4) || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4)
212# ifndef GCC_HASCLASSVISIBILITY
213# define GCC_HASCLASSVISIBILITY
214# endif
215# endif
216#endif
217
218#ifndef SWIGEXPORT
219# if defined(_WIN32) || defined(__WIN32__) || defined(__CYGWIN__)
220# if defined(STATIC_LINKED)
221# define SWIGEXPORT
222# else
223# define SWIGEXPORT __declspec(dllexport)
224# endif
225# else
226# if defined(__GNUC__) && defined(GCC_HASCLASSVISIBILITY)
227# define SWIGEXPORT __attribute__ ((visibility("default")))
228# else
229# define SWIGEXPORT
230# endif
231# endif
232#endif
233
234/* calling conventions for Windows */
235#ifndef SWIGSTDCALL
236# if defined(_WIN32) || defined(__WIN32__) || defined(__CYGWIN__)
237# define SWIGSTDCALL __stdcall
238# else
239# define SWIGSTDCALL
240# endif
241#endif
242
243/* Deal with Microsoft's attempt at deprecating C standard runtime functions */
244#if !defined(SWIG_NO_CRT_SECURE_NO_DEPRECATE) && defined(_MSC_VER) && !defined(_CRT_SECURE_NO_DEPRECATE)
245# define _CRT_SECURE_NO_DEPRECATE
246#endif
247
248/* Deal with Microsoft's attempt at deprecating methods in the standard C++ library */
249#if !defined(SWIG_NO_SCL_SECURE_NO_DEPRECATE) && defined(_MSC_VER) && !defined(_SCL_SECURE_NO_DEPRECATE)
250# define _SCL_SECURE_NO_DEPRECATE
251#endif
252
253/* Deal with Apple's deprecated 'AssertMacros.h' from Carbon-framework */
254#if defined(__APPLE__) && !defined(__ASSERT_MACROS_DEFINE_VERSIONS_WITHOUT_UNDERSCORES)
255# define __ASSERT_MACROS_DEFINE_VERSIONS_WITHOUT_UNDERSCORES 0
256#endif
257
258/* Intel's compiler complains if a variable which was never initialised is
259 * cast to void, which is a common idiom which we use to indicate that we
260 * are aware a variable isn't used. So we just silence that warning.
261 * See: https://github.com/swig/swig/issues/192 for more discussion.
262 */
263#ifdef __INTEL_COMPILER
264# pragma warning disable 592
265#endif
266
267#if __cplusplus >=201103L
268# define SWIG_NULLPTR nullptr
269#else
270# define SWIG_NULLPTR NULL
271#endif
272
273/* -----------------------------------------------------------------------------
274 * swigrun.swg
275 *
276 * This file contains generic C API SWIG runtime support for pointer
277 * type checking.
278 * ----------------------------------------------------------------------------- */
279
280/* This should only be incremented when either the layout of swig_type_info changes,
281 or for whatever reason, the runtime changes incompatibly */
282#define SWIG_RUNTIME_VERSION "4"
283
284/* define SWIG_TYPE_TABLE_NAME as "SWIG_TYPE_TABLE" */
285#ifdef SWIG_TYPE_TABLE
286# define SWIG_QUOTE_STRING(x) #x
287# define SWIG_EXPAND_AND_QUOTE_STRING(x) SWIG_QUOTE_STRING(x)
288# define SWIG_TYPE_TABLE_NAME SWIG_EXPAND_AND_QUOTE_STRING(SWIG_TYPE_TABLE)
289#else
290# define SWIG_TYPE_TABLE_NAME
291#endif
292
293/*
294 You can use the SWIGRUNTIME and SWIGRUNTIMEINLINE macros for
295 creating a static or dynamic library from the SWIG runtime code.
296 In 99.9% of the cases, SWIG just needs to declare them as 'static'.
297
298 But only do this if strictly necessary, ie, if you have problems
299 with your compiler or suchlike.
300*/
301
302#ifndef SWIGRUNTIME
303# define SWIGRUNTIME SWIGINTERN
304#endif
305
306#ifndef SWIGRUNTIMEINLINE
307# define SWIGRUNTIMEINLINE SWIGRUNTIME SWIGINLINE
308#endif
309
310/* Generic buffer size */
311#ifndef SWIG_BUFFER_SIZE
312# define SWIG_BUFFER_SIZE 1024
313#endif
314
315/* Flags for pointer conversions */
316#define SWIG_POINTER_DISOWN 0x1
317#define SWIG_CAST_NEW_MEMORY 0x2
318#define SWIG_POINTER_NO_NULL 0x4
319#define SWIG_POINTER_CLEAR 0x8
320#define SWIG_POINTER_RELEASE (SWIG_POINTER_CLEAR | SWIG_POINTER_DISOWN)
321
322/* Flags for new pointer objects */
323#define SWIG_POINTER_OWN 0x1
324
325
326/*
327 Flags/methods for returning states.
328
329 The SWIG conversion methods, as ConvertPtr, return an integer
330 that tells if the conversion was successful or not. And if not,
331 an error code can be returned (see swigerrors.swg for the codes).
332
333 Use the following macros/flags to set or process the returning
334 states.
335
336 In old versions of SWIG, code such as the following was usually written:
337
338 if (SWIG_ConvertPtr(obj,vptr,ty.flags) != -1) {
339 // success code
340 } else {
341 //fail code
342 }
343
344 Now you can be more explicit:
345
346 int res = SWIG_ConvertPtr(obj,vptr,ty.flags);
347 if (SWIG_IsOK(res)) {
348 // success code
349 } else {
350 // fail code
351 }
352
353 which is the same really, but now you can also do
354
355 Type *ptr;
356 int res = SWIG_ConvertPtr(obj,(void **)(&ptr),ty.flags);
357 if (SWIG_IsOK(res)) {
358 // success code
359 if (SWIG_IsNewObj(res) {
360 ...
361 delete *ptr;
362 } else {
363 ...
364 }
365 } else {
366 // fail code
367 }
368
369 I.e., now SWIG_ConvertPtr can return new objects and you can
370 identify the case and take care of the deallocation. Of course that
371 also requires SWIG_ConvertPtr to return new result values, such as
372
373 int SWIG_ConvertPtr(obj, ptr,...) {
374 if (<obj is ok>) {
375 if (<need new object>) {
376 *ptr = <ptr to new allocated object>;
377 return SWIG_NEWOBJ;
378 } else {
379 *ptr = <ptr to old object>;
380 return SWIG_OLDOBJ;
381 }
382 } else {
383 return SWIG_BADOBJ;
384 }
385 }
386
387 Of course, returning the plain '0(success)/-1(fail)' still works, but you can be
388 more explicit by returning SWIG_BADOBJ, SWIG_ERROR or any of the
389 SWIG errors code.
390
391 Finally, if the SWIG_CASTRANK_MODE is enabled, the result code
392 allows returning the 'cast rank', for example, if you have this
393
394 int food(double)
395 int fooi(int);
396
397 and you call
398
399 food(1) // cast rank '1' (1 -> 1.0)
400 fooi(1) // cast rank '0'
401
402 just use the SWIG_AddCast()/SWIG_CheckState()
403*/
404
405#define SWIG_OK (0)
406/* Runtime errors are < 0 */
407#define SWIG_ERROR (-1)
408/* Errors in range -1 to -99 are in swigerrors.swg (errors for all languages including those not using the runtime) */
409/* Errors in range -100 to -199 are language specific errors defined in *errors.swg */
410/* Errors < -200 are generic runtime specific errors */
411#define SWIG_ERROR_RELEASE_NOT_OWNED (-200)
412
413#define SWIG_IsOK(r) (r >= 0)
414#define SWIG_ArgError(r) ((r != SWIG_ERROR) ? r : SWIG_TypeError)
415
416/* The CastRankLimit says how many bits are used for the cast rank */
417#define SWIG_CASTRANKLIMIT (1 << 8)
418/* The NewMask denotes the object was created (using new/malloc) */
419#define SWIG_NEWOBJMASK (SWIG_CASTRANKLIMIT << 1)
420/* The TmpMask is for in/out typemaps that use temporary objects */
421#define SWIG_TMPOBJMASK (SWIG_NEWOBJMASK << 1)
422/* Simple returning values */
423#define SWIG_BADOBJ (SWIG_ERROR)
424#define SWIG_OLDOBJ (SWIG_OK)
425#define SWIG_NEWOBJ (SWIG_OK | SWIG_NEWOBJMASK)
426#define SWIG_TMPOBJ (SWIG_OK | SWIG_TMPOBJMASK)
427/* Check, add and del object mask methods */
428#define SWIG_AddNewMask(r) (SWIG_IsOK(r) ? (r | SWIG_NEWOBJMASK) : r)
429#define SWIG_DelNewMask(r) (SWIG_IsOK(r) ? (r & ~SWIG_NEWOBJMASK) : r)
430#define SWIG_IsNewObj(r) (SWIG_IsOK(r) && (r & SWIG_NEWOBJMASK))
431#define SWIG_AddTmpMask(r) (SWIG_IsOK(r) ? (r | SWIG_TMPOBJMASK) : r)
432#define SWIG_DelTmpMask(r) (SWIG_IsOK(r) ? (r & ~SWIG_TMPOBJMASK) : r)
433#define SWIG_IsTmpObj(r) (SWIG_IsOK(r) && (r & SWIG_TMPOBJMASK))
434
435/* Cast-Rank Mode */
436#if defined(SWIG_CASTRANK_MODE)
437# ifndef SWIG_TypeRank
438# define SWIG_TypeRank unsigned long
439# endif
440# ifndef SWIG_MAXCASTRANK /* Default cast allowed */
441# define SWIG_MAXCASTRANK (2)
442# endif
443# define SWIG_CASTRANKMASK ((SWIG_CASTRANKLIMIT) -1)
444# define SWIG_CastRank(r) (r & SWIG_CASTRANKMASK)
446 return SWIG_IsOK(r) ? ((SWIG_CastRank(r) < SWIG_MAXCASTRANK) ? (r + 1) : SWIG_ERROR) : r;
447}
449 return SWIG_IsOK(r) ? SWIG_CastRank(r) + 1 : 0;
450}
451#else /* no cast-rank mode */
452# define SWIG_AddCast(r) (r)
453# define SWIG_CheckState(r) (SWIG_IsOK(r) ? 1 : 0)
454#endif
455
456/* C99 and C++11 should provide snprintf, but define SWIG_NO_SNPRINTF
457 * if you're missing it.
458 */
459#if ((defined __STDC_VERSION__ && __STDC_VERSION__ >= 199901L) || \
460 (defined __cplusplus && __cplusplus >= 201103L) || \
461 defined SWIG_HAVE_SNPRINTF) && \
462 !defined SWIG_NO_SNPRINTF
463# define SWIG_snprintf(O,S,F,A) snprintf(O,S,F,A)
464# define SWIG_snprintf2(O,S,F,A,B) snprintf(O,S,F,A,B)
465#else
466/* Fallback versions ignore the buffer size, but most of our uses either have a
467 * fixed maximum possible size or dynamically allocate a buffer that's large
468 * enough.
469 */
470# define SWIG_snprintf(O,S,F,A) sprintf(O,F,A)
471# define SWIG_snprintf2(O,S,F,A,B) sprintf(O,F,A,B)
472#endif
473
474#include <string.h>
475
476#ifdef __cplusplus
477extern "C" {
478#endif
479
480typedef void *(*swig_converter_func)(void *, int *);
481typedef struct swig_type_info *(*swig_dycast_func)(void **);
482
483/* Structure to store information on one type */
484typedef struct swig_type_info {
485 const char *name; /* mangled name of this type */
486 const char *str; /* human readable name of this type */
487 swig_dycast_func dcast; /* dynamic cast function down a hierarchy */
488 struct swig_cast_info *cast; /* linked list of types that can cast into this type */
489 void *clientdata; /* language specific type data */
490 int owndata; /* flag if the structure owns the clientdata */
492
493/* Structure to store a type and conversion function used for casting */
494typedef struct swig_cast_info {
495 swig_type_info *type; /* pointer to type that is equivalent to this type */
496 swig_converter_func converter; /* function to cast the void pointers */
497 struct swig_cast_info *next; /* pointer to next cast in linked list */
498 struct swig_cast_info *prev; /* pointer to the previous cast */
500
501/* Structure used to store module information
502 * Each module generates one structure like this, and the runtime collects
503 * all of these structures and stores them in a circularly linked list.*/
504typedef struct swig_module_info {
505 swig_type_info **types; /* Array of pointers to swig_type_info structures that are in this module */
506 size_t size; /* Number of types in this module */
507 struct swig_module_info *next; /* Pointer to next element in circularly linked list */
508 swig_type_info **type_initial; /* Array of initially generated type structures */
509 swig_cast_info **cast_initial; /* Array of initially generated casting structures */
510 void *clientdata; /* Language specific module data */
512
513/*
514 Compare two type names skipping the space characters, therefore
515 "char*" == "char *" and "Class<int>" == "Class<int >", etc.
516
517 Return 0 when the two name types are equivalent, as in
518 strncmp, but skipping ' '.
519*/
520SWIGRUNTIME int
521SWIG_TypeNameComp(const char *f1, const char *l1,
522 const char *f2, const char *l2) {
523 for (;(f1 != l1) && (f2 != l2); ++f1, ++f2) {
524 while ((*f1 == ' ') && (f1 != l1)) ++f1;
525 while ((*f2 == ' ') && (f2 != l2)) ++f2;
526 if (*f1 != *f2) return (*f1 > *f2) ? 1 : -1;
527 }
528 return (int)((l1 - f1) - (l2 - f2));
529}
530
531/*
532 Check type equivalence in a name list like <name1>|<name2>|...
533 Return 0 if equal, -1 if nb < tb, 1 if nb > tb
534*/
535SWIGRUNTIME int
536SWIG_TypeCmp(const char *nb, const char *tb) {
537 int equiv = 1;
538 const char* te = tb + strlen(tb);
539 const char* ne = nb;
540 while (equiv != 0 && *ne) {
541 for (nb = ne; *ne; ++ne) {
542 if (*ne == '|') break;
543 }
544 equiv = SWIG_TypeNameComp(nb, ne, tb, te);
545 if (*ne) ++ne;
546 }
547 return equiv;
548}
549
550/*
551 Check type equivalence in a name list like <name1>|<name2>|...
552 Return 0 if not equal, 1 if equal
553*/
554SWIGRUNTIME int
555SWIG_TypeEquiv(const char *nb, const char *tb) {
556 return SWIG_TypeCmp(nb, tb) == 0 ? 1 : 0;
557}
558
559/*
560 Check the typename
561*/
563SWIG_TypeCheck(const char *c, swig_type_info *ty) {
564 if (ty) {
565 swig_cast_info *iter = ty->cast;
566 while (iter) {
567 if (strcmp(iter->type->name, c) == 0) {
568 if (iter == ty->cast)
569 return iter;
570 /* Move iter to the top of the linked list */
571 iter->prev->next = iter->next;
572 if (iter->next)
573 iter->next->prev = iter->prev;
574 iter->next = ty->cast;
575 iter->prev = 0;
576 if (ty->cast) ty->cast->prev = iter;
577 ty->cast = iter;
578 return iter;
579 }
580 iter = iter->next;
581 }
582 }
583 return 0;
584}
585
586/*
587 Identical to SWIG_TypeCheck, except strcmp is replaced with a pointer comparison
588*/
591 if (ty) {
592 swig_cast_info *iter = ty->cast;
593 while (iter) {
594 if (iter->type == from) {
595 if (iter == ty->cast)
596 return iter;
597 /* Move iter to the top of the linked list */
598 iter->prev->next = iter->next;
599 if (iter->next)
600 iter->next->prev = iter->prev;
601 iter->next = ty->cast;
602 iter->prev = 0;
603 if (ty->cast) ty->cast->prev = iter;
604 ty->cast = iter;
605 return iter;
606 }
607 iter = iter->next;
608 }
609 }
610 return 0;
611}
612
613/*
614 Cast a pointer up an inheritance hierarchy
615*/
617SWIG_TypeCast(swig_cast_info *ty, void *ptr, int *newmemory) {
618 return ((!ty) || (!ty->converter)) ? ptr : (*ty->converter)(ptr, newmemory);
619}
620
621/*
622 Dynamic pointer casting. Down an inheritance hierarchy
623*/
626 swig_type_info *lastty = ty;
627 if (!ty || !ty->dcast) return ty;
628 while (ty && (ty->dcast)) {
629 ty = (*ty->dcast)(ptr);
630 if (ty) lastty = ty;
631 }
632 return lastty;
633}
634
635/*
636 Return the name associated with this type
637*/
638SWIGRUNTIMEINLINE const char *
640 return ty->name;
641}
642
643/*
644 Return the pretty name associated with this type,
645 that is an unmangled type name in a form presentable to the user.
646*/
647SWIGRUNTIME const char *
649 /* The "str" field contains the equivalent pretty names of the
650 type, separated by vertical-bar characters. Choose the last
651 name. It should be the most specific; a fully resolved name
652 but not necessarily with default template parameters expanded. */
653 if (!type) return NULL;
654 if (type->str != NULL) {
655 const char *last_name = type->str;
656 const char *s;
657 for (s = type->str; *s; s++)
658 if (*s == '|') last_name = s+1;
659 return last_name;
660 }
661 else
662 return type->name;
663}
664
665/*
666 Set the clientdata field for a type
667*/
668SWIGRUNTIME void
670 swig_cast_info *cast = ti->cast;
671 /* if (ti->clientdata == clientdata) return; */
673
674 while (cast) {
675 if (!cast->converter) {
676 swig_type_info *tc = cast->type;
677 if (!tc->clientdata) {
679 }
680 }
681 cast = cast->next;
682 }
683}
684SWIGRUNTIME void
689
690/*
691 Search for a swig_type_info structure only by mangled name
692 Search is a O(log #types)
693
694 We start searching at module start, and finish searching when start == end.
695 Note: if start == end at the beginning of the function, we go all the way around
696 the circular list.
697*/
700 swig_module_info *end,
701 const char *name) {
702 swig_module_info *iter = start;
703 do {
704 if (iter->size) {
705 size_t l = 0;
706 size_t r = iter->size - 1;
707 do {
708 /* since l+r >= 0, we can (>> 1) instead (/ 2) */
709 size_t i = (l + r) >> 1;
710 const char *iname = iter->types[i]->name;
711 if (iname) {
712 int compare = strcmp(name, iname);
713 if (compare == 0) {
714 return iter->types[i];
715 } else if (compare < 0) {
716 if (i) {
717 r = i - 1;
718 } else {
719 break;
720 }
721 } else if (compare > 0) {
722 l = i + 1;
723 }
724 } else {
725 break; /* should never happen */
726 }
727 } while (l <= r);
728 }
729 iter = iter->next;
730 } while (iter != end);
731 return 0;
732}
733
734/*
735 Search for a swig_type_info structure for either a mangled name or a human readable name.
736 It first searches the mangled names of the types, which is a O(log #types)
737 If a type is not found it then searches the human readable names, which is O(#types).
738
739 We start searching at module start, and finish searching when start == end.
740 Note: if start == end at the beginning of the function, we go all the way around
741 the circular list.
742*/
745 swig_module_info *end,
746 const char *name) {
747 /* STEP 1: Search the name field using binary search */
748 swig_type_info *ret = SWIG_MangledTypeQueryModule(start, end, name);
749 if (ret) {
750 return ret;
751 } else {
752 /* STEP 2: If the type hasn't been found, do a complete search
753 of the str field (the human readable name) */
754 swig_module_info *iter = start;
755 do {
756 size_t i = 0;
757 for (; i < iter->size; ++i) {
758 if (iter->types[i]->str && (SWIG_TypeEquiv(iter->types[i]->str, name)))
759 return iter->types[i];
760 }
761 iter = iter->next;
762 } while (iter != end);
763 }
764
765 /* neither found a match */
766 return 0;
767}
768
769/*
770 Pack binary data into a string
771*/
772SWIGRUNTIME char *
773SWIG_PackData(char *c, void *ptr, size_t sz) {
774 static const char hex[17] = "0123456789abcdef";
775 const unsigned char *u = (unsigned char *) ptr;
776 const unsigned char *eu = u + sz;
777 for (; u != eu; ++u) {
778 unsigned char uu = *u;
779 *(c++) = hex[(uu & 0xf0) >> 4];
780 *(c++) = hex[uu & 0xf];
781 }
782 return c;
783}
784
785/*
786 Unpack binary data from a string
787*/
788SWIGRUNTIME const char *
789SWIG_UnpackData(const char *c, void *ptr, size_t sz) {
790 unsigned char *u = (unsigned char *) ptr;
791 const unsigned char *eu = u + sz;
792 for (; u != eu; ++u) {
793 char d = *(c++);
794 unsigned char uu;
795 if ((d >= '0') && (d <= '9'))
796 uu = (unsigned char)((d - '0') << 4);
797 else if ((d >= 'a') && (d <= 'f'))
798 uu = (unsigned char)((d - ('a'-10)) << 4);
799 else
800 return (char *) 0;
801 d = *(c++);
802 if ((d >= '0') && (d <= '9'))
803 uu |= (unsigned char)(d - '0');
804 else if ((d >= 'a') && (d <= 'f'))
805 uu |= (unsigned char)(d - ('a'-10));
806 else
807 return (char *) 0;
808 *u = uu;
809 }
810 return c;
811}
812
813/*
814 Pack 'void *' into a string buffer.
815*/
816SWIGRUNTIME char *
817SWIG_PackVoidPtr(char *buff, void *ptr, const char *name, size_t bsz) {
818 char *r = buff;
819 if ((2*sizeof(void *) + 2) > bsz) return 0;
820 *(r++) = '_';
821 r = SWIG_PackData(r,&ptr,sizeof(void *));
822 if (strlen(name) + 1 > (bsz - (r - buff))) return 0;
823 strcpy(r,name);
824 return buff;
825}
826
827SWIGRUNTIME const char *
828SWIG_UnpackVoidPtr(const char *c, void **ptr, const char *name) {
829 if (*c != '_') {
830 if (strcmp(c,"NULL") == 0) {
831 *ptr = (void *) 0;
832 return name;
833 } else {
834 return 0;
835 }
836 }
837 return SWIG_UnpackData(++c,ptr,sizeof(void *));
838}
839
840SWIGRUNTIME char *
841SWIG_PackDataName(char *buff, void *ptr, size_t sz, const char *name, size_t bsz) {
842 char *r = buff;
843 size_t lname = (name ? strlen(name) : 0);
844 if ((2*sz + 2 + lname) > bsz) return 0;
845 *(r++) = '_';
846 r = SWIG_PackData(r,ptr,sz);
847 if (lname) {
848 strncpy(r,name,lname+1);
849 } else {
850 *r = 0;
851 }
852 return buff;
853}
854
855SWIGRUNTIME const char *
856SWIG_UnpackDataName(const char *c, void *ptr, size_t sz, const char *name) {
857 if (*c != '_') {
858 if (strcmp(c,"NULL") == 0) {
859 memset(ptr,0,sz);
860 return name;
861 } else {
862 return 0;
863 }
864 }
865 return SWIG_UnpackData(++c,ptr,sz);
866}
867
868#ifdef __cplusplus
869}
870#endif
871
872/* SWIG Errors applicable to all language modules, values are reserved from -1 to -99 */
873#define SWIG_UnknownError -1
874#define SWIG_IOError -2
875#define SWIG_RuntimeError -3
876#define SWIG_IndexError -4
877#define SWIG_TypeError -5
878#define SWIG_DivisionByZero -6
879#define SWIG_OverflowError -7
880#define SWIG_SyntaxError -8
881#define SWIG_ValueError -9
882#define SWIG_SystemError -10
883#define SWIG_AttributeError -11
884#define SWIG_MemoryError -12
885#define SWIG_NullReferenceError -13
886
887
888#if __GNUC__ >= 7
889#pragma GCC diagnostic push
890#if defined(__cplusplus)
891#pragma GCC diagnostic ignored "-Wregister"
892#if __GNUC__ >= 10
893#pragma GCC diagnostic ignored "-Wvolatile"
894#if __GNUC__ >= 11
895#pragma GCC diagnostic ignored "-Wdeprecated-enum-enum-conversion"
896#endif
897#endif
898#endif
899#endif
900
901#include <ruby.h>
902#include <ruby/version.h> /* For RUBY_API_VERSION_CODE */
903
904#if __GNUC__ >= 7
905#pragma GCC diagnostic pop
906#endif
907
908/* Ruby 1.9.1 has a "memoisation optimisation" when compiling with GCC which
909 * breaks using rb_intern as an lvalue, as SWIG does. We work around this
910 * issue for now by disabling this.
911 * https://sourceforge.net/tracker/?func=detail&aid=2859614&group_id=1645&atid=101645
912 */
913#ifdef rb_intern
914# undef rb_intern
915#endif
916
917/* Remove global macros defined in Ruby's win32.h */
918#ifdef write
919# undef write
920#endif
921#ifdef read
922# undef read
923#endif
924#ifdef bind
925# undef bind
926#endif
927#ifdef close
928# undef close
929#endif
930#ifdef connect
931# undef connect
932#endif
933
934
935/* Ruby 1.7 defines NUM2LL(), LL2NUM() and ULL2NUM() macros */
936#ifndef NUM2LL
937#define NUM2LL(x) NUM2LONG((x))
938#endif
939#ifndef LL2NUM
940#define LL2NUM(x) INT2NUM((long) (x))
941#endif
942#ifndef ULL2NUM
943#define ULL2NUM(x) UINT2NUM((unsigned long) (x))
944#endif
945
946/* Ruby 1.7 doesn't (yet) define NUM2ULL() */
947#ifndef NUM2ULL
948#ifdef HAVE_LONG_LONG
949#define NUM2ULL(x) rb_num2ull((x))
950#else
951#define NUM2ULL(x) NUM2ULONG(x)
952#endif
953#endif
954
955/* RSTRING_LEN, etc are new in Ruby 1.9, but ->ptr and ->len no longer work */
956/* Define these for older versions so we can just write code the new way */
957#ifndef RSTRING_LEN
958# define RSTRING_LEN(x) RSTRING(x)->len
959#endif
960#ifndef RSTRING_PTR
961# define RSTRING_PTR(x) RSTRING(x)->ptr
962#endif
963#ifndef RSTRING_END
964# define RSTRING_END(x) (RSTRING_PTR(x) + RSTRING_LEN(x))
965#endif
966#ifndef RARRAY_LEN
967# define RARRAY_LEN(x) RARRAY(x)->len
968#endif
969#ifndef RARRAY_PTR
970# define RARRAY_PTR(x) RARRAY(x)->ptr
971#endif
972#ifndef RFLOAT_VALUE
973# define RFLOAT_VALUE(x) RFLOAT(x)->value
974#endif
975#ifndef DOUBLE2NUM
976# define DOUBLE2NUM(x) rb_float_new(x)
977#endif
978#ifndef RHASH_TBL
979# define RHASH_TBL(x) (RHASH(x)->tbl)
980#endif
981#ifndef RHASH_ITER_LEV
982# define RHASH_ITER_LEV(x) (RHASH(x)->iter_lev)
983#endif
984#ifndef RHASH_IFNONE
985# define RHASH_IFNONE(x) (RHASH(x)->ifnone)
986#endif
987#ifndef RHASH_SIZE
988# define RHASH_SIZE(x) (RHASH(x)->tbl->num_entries)
989#endif
990#ifndef RHASH_EMPTY_P
991# define RHASH_EMPTY_P(x) (RHASH_SIZE(x) == 0)
992#endif
993#ifndef RSTRUCT_LEN
994# define RSTRUCT_LEN(x) RSTRUCT(x)->len
995#endif
996#ifndef RSTRUCT_PTR
997# define RSTRUCT_PTR(x) RSTRUCT(x)->ptr
998#endif
999#ifndef RTYPEDDATA_P
1000# define RTYPEDDATA_P(x) (TYPE(x) != T_DATA)
1001#endif
1002
1003
1004
1005/*
1006 * The following macros are used for providing the correct type of a
1007 * function pointer to the Ruby C API.
1008 *
1009 * Starting with Ruby 2.7 these macros act transparently due to Ruby's moving
1010 * moving away from ANYARGS and instead employing strict function signatures.
1011 *
1012 * Note: In case of C (not C++) the macros are transparent even before
1013 * Ruby 2.7 due to the fact that the Ruby C API used function declarators
1014 * with empty parentheses, which allows for an unspecified number of
1015 * arguments.
1016 *
1017 * PROTECTFUNC(f) is used for the function pointer argument of the Ruby
1018 * C API function rb_protect().
1019 *
1020 * VALUEFUNC(f) is used for the function pointer argument(s) of Ruby C API
1021 * functions like rb_define_method() and rb_define_singleton_method().
1022 *
1023 * VOIDFUNC(f) is used to typecast a C function that implements either
1024 * the "mark" or "free" stuff for a Ruby Data object, so that it can be
1025 * passed as an argument to Ruby C API functions like Data_Wrap_Struct()
1026 * and Data_Make_Struct().
1027 *
1028 * SWIG_RUBY_VOID_ANYARGS_FUNC(f) is used for the function pointer
1029 * argument(s) of Ruby C API functions like rb_define_virtual_variable().
1030 *
1031 * SWIG_RUBY_INT_ANYARGS_FUNC(f) is used for the function pointer
1032 * argument(s) of Ruby C API functions like st_foreach().
1033 */
1034#if defined(__cplusplus) && RUBY_API_VERSION_CODE < 20700
1035# define PROTECTFUNC(f) ((VALUE (*)(VALUE)) f)
1036# define VALUEFUNC(f) ((VALUE (*)(ANYARGS)) f)
1037# define VOIDFUNC(f) ((RUBY_DATA_FUNC) f)
1038# define SWIG_RUBY_VOID_ANYARGS_FUNC(f) ((void (*)(ANYARGS))(f))
1039# define SWIG_RUBY_INT_ANYARGS_FUNC(f) ((int (*)(ANYARGS))(f))
1040#else
1041# define PROTECTFUNC(f) (f)
1042# define VALUEFUNC(f) (f)
1043# define VOIDFUNC(f) (f)
1044# define SWIG_RUBY_VOID_ANYARGS_FUNC(f) (f)
1045# define SWIG_RUBY_INT_ANYARGS_FUNC(f) (f)
1046#endif
1047
1048/* Don't use for expressions have side effect */
1049#ifndef RB_STRING_VALUE
1050#define RB_STRING_VALUE(s) (TYPE(s) == T_STRING ? (s) : (*(volatile VALUE *)&(s) = rb_str_to_str(s)))
1051#endif
1052#ifndef StringValue
1053#define StringValue(s) RB_STRING_VALUE(s)
1054#endif
1055#ifndef StringValuePtr
1056#define StringValuePtr(s) RSTRING_PTR(RB_STRING_VALUE(s))
1057#endif
1058#ifndef StringValueLen
1059#define StringValueLen(s) RSTRING_LEN(RB_STRING_VALUE(s))
1060#endif
1061#ifndef SafeStringValue
1062#define SafeStringValue(v) do {\
1063 StringValue(v);\
1064 rb_check_safe_str(v);\
1065} while (0)
1066#endif
1067
1068#ifndef HAVE_RB_DEFINE_ALLOC_FUNC
1069#define rb_define_alloc_func(klass, func) rb_define_singleton_method((klass), "new", VALUEFUNC((func)), -1)
1070#define rb_undef_alloc_func(klass) rb_undef_method(CLASS_OF((klass)), "new")
1071#endif
1072
1073static VALUE _mSWIG = Qnil;
1074
1075/* -----------------------------------------------------------------------------
1076 * error manipulation
1077 * ----------------------------------------------------------------------------- */
1078
1079
1080/* Define some additional error types */
1081#define SWIG_ObjectPreviouslyDeletedError -100
1082
1083
1084/* Define custom exceptions for errors that do not map to existing Ruby
1085 exceptions. Note this only works for C++ since a global cannot be
1086 initialized by a function in C. For C, fallback to rb_eRuntimeError.*/
1087
1088SWIGINTERN VALUE
1090 static int init = 0;
1091 static VALUE rb_eNullReferenceError ;
1092 if (!init) {
1093 init = 1;
1094 rb_eNullReferenceError = rb_define_class("NullReferenceError", rb_eRuntimeError);
1095 }
1096 return rb_eNullReferenceError;
1097}
1098
1099SWIGINTERN VALUE
1101 static int init = 0;
1102 static VALUE rb_eObjectPreviouslyDeleted ;
1103 if (!init) {
1104 init = 1;
1105 rb_eObjectPreviouslyDeleted = rb_define_class("ObjectPreviouslyDeleted", rb_eRuntimeError);
1106 }
1107 return rb_eObjectPreviouslyDeleted;
1108}
1109
1110
1111SWIGINTERN VALUE
1112SWIG_Ruby_ErrorType(int SWIG_code) {
1113 VALUE type;
1114 switch (SWIG_code) {
1115 case SWIG_MemoryError:
1116 type = rb_eNoMemError;
1117 break;
1118 case SWIG_IOError:
1119 type = rb_eIOError;
1120 break;
1121 case SWIG_RuntimeError:
1122 type = rb_eRuntimeError;
1123 break;
1124 case SWIG_IndexError:
1125 type = rb_eIndexError;
1126 break;
1127 case SWIG_TypeError:
1128 type = rb_eTypeError;
1129 break;
1131 type = rb_eZeroDivError;
1132 break;
1133 case SWIG_OverflowError:
1134 type = rb_eRangeError;
1135 break;
1136 case SWIG_SyntaxError:
1137 type = rb_eSyntaxError;
1138 break;
1139 case SWIG_ValueError:
1140 type = rb_eArgError;
1141 break;
1142 case SWIG_SystemError:
1143 type = rb_eFatal;
1144 break;
1146 type = rb_eRuntimeError;
1147 break;
1150 break;
1153 break;
1154 case SWIG_UnknownError:
1155 type = rb_eRuntimeError;
1156 break;
1157 default:
1158 type = rb_eRuntimeError;
1159 }
1160 return type;
1161}
1162
1163
1164/* This function is called when a user inputs a wrong argument to
1165 a method.
1166 */
1168const char* Ruby_Format_TypeError( const char* msg,
1169 const char* type,
1170 const char* name,
1171 const int argn,
1172 VALUE input )
1173{
1174 char buf[128];
1175 VALUE str;
1176 VALUE asStr;
1177 if ( msg && *msg )
1178 {
1179 str = rb_str_new2(msg);
1180 }
1181 else
1182 {
1183 str = rb_str_new(NULL, 0);
1184 }
1185
1186 str = rb_str_cat2( str, "Expected argument " );
1187 SWIG_snprintf( buf, sizeof( buf), "%d of type ", argn-1 );
1188 str = rb_str_cat2( str, buf );
1189 str = rb_str_cat2( str, type );
1190 str = rb_str_cat2( str, ", but got " );
1191 str = rb_str_cat2( str, rb_obj_classname(input) );
1192 str = rb_str_cat2( str, " " );
1193 asStr = rb_inspect(input);
1194 if ( RSTRING_LEN(asStr) > 30 )
1195 {
1196 str = rb_str_cat( str, StringValuePtr(asStr), 30 );
1197 str = rb_str_cat2( str, "..." );
1198 }
1199 else
1200 {
1201 str = rb_str_append( str, asStr );
1202 }
1203
1204 if ( name )
1205 {
1206 str = rb_str_cat2( str, "\n\tin SWIG method '" );
1207 str = rb_str_cat2( str, name );
1208 str = rb_str_cat2( str, "'" );
1209 }
1210
1211 return StringValuePtr( str );
1212}
1213
1214/* This function is called when an overloaded method fails */
1217 const int argc,
1218 const int maxargs,
1219 const char* method,
1220 const char* prototypes
1221 )
1222{
1223 const char* msg = "Wrong # of arguments";
1224 if ( argc <= maxargs ) msg = "Wrong arguments";
1225 rb_raise(rb_eArgError,"%s for overloaded method '%s'.\n"
1226 "Possible C/C++ prototypes are:\n%s",
1227 msg, method, prototypes);
1228}
1229
1230/* -----------------------------------------------------------------------------
1231 * rubytracking.swg
1232 *
1233 * This file contains support for tracking mappings from
1234 * Ruby objects to C++ objects. This functionality is needed
1235 * to implement mark functions for Ruby's mark and sweep
1236 * garbage collector.
1237 * ----------------------------------------------------------------------------- */
1238
1239#ifdef __cplusplus
1240extern "C" {
1241#endif
1242
1243#if !defined(ST_DATA_T_DEFINED)
1244/* Needs to be explicitly included for Ruby 1.8 and earlier */
1245#include <st.h>
1246#endif
1247
1248/* Ruby 1.8 actually assumes the first case. */
1249#if SIZEOF_VOIDP == SIZEOF_LONG
1250# define SWIG2NUM(v) LONG2NUM((unsigned long)v)
1251# define NUM2SWIG(x) (unsigned long)NUM2LONG(x)
1252#elif SIZEOF_VOIDP == SIZEOF_LONG_LONG
1253# define SWIG2NUM(v) LL2NUM((unsigned long long)v)
1254# define NUM2SWIG(x) (unsigned long long)NUM2LL(x)
1255#else
1256# error sizeof(void*) is not the same as long or long long
1257#endif
1258
1259/* Global hash table to store Trackings from C/C++
1260 structs to Ruby Objects.
1261*/
1262static st_table* swig_ruby_trackings = NULL;
1263
1264static VALUE swig_ruby_trackings_count(ID id, VALUE *var) {
1265 return SWIG2NUM(swig_ruby_trackings->num_entries);
1266}
1267
1268
1269/* Setup a hash table to store Trackings */
1271 /* Create a hash table to store Trackings from C++
1272 objects to Ruby objects. */
1273
1274 /* Try to see if some other .so has already created a
1275 tracking hash table, which we keep hidden in an instance var
1276 in the SWIG module.
1277 This is done to allow multiple DSOs to share the same
1278 tracking table.
1279 */
1280 VALUE trackings_value = Qnil;
1281 /* change the variable name so that we can mix modules
1282 compiled with older SWIG's - this used to be called "@__trackings__" */
1283 ID trackings_id = rb_intern( "@__safetrackings__" );
1284 VALUE verbose = rb_gv_get("VERBOSE");
1285 rb_gv_set("VERBOSE", Qfalse);
1286 trackings_value = rb_ivar_get( _mSWIG, trackings_id );
1287 rb_gv_set("VERBOSE", verbose);
1288
1289 /* The trick here is that we have to store the hash table
1290 pointer in a Ruby variable. We do not want Ruby's GC to
1291 treat this pointer as a Ruby object, so we convert it to
1292 a Ruby numeric value. */
1293 if (trackings_value == Qnil) {
1294 /* No, it hasn't. Create one ourselves */
1295 swig_ruby_trackings = st_init_numtable();
1296 rb_ivar_set( _mSWIG, trackings_id, SWIG2NUM(swig_ruby_trackings) );
1297 } else {
1298 swig_ruby_trackings = (st_table*)NUM2SWIG(trackings_value);
1299 }
1300
1301 rb_define_virtual_variable("SWIG_TRACKINGS_COUNT",
1303 SWIG_RUBY_VOID_ANYARGS_FUNC((rb_gvar_setter_t*)NULL));
1304}
1305
1306/* Add a Tracking from a C/C++ struct to a Ruby object */
1307SWIGRUNTIME void SWIG_RubyAddTracking(void* ptr, VALUE object) {
1308 /* Store the mapping to the global hash table. */
1309 st_insert(swig_ruby_trackings, (st_data_t)ptr, object);
1310}
1311
1312/* Get the Ruby object that owns the specified C/C++ struct */
1314 /* Now lookup the value stored in the global hash table */
1315 VALUE value;
1316
1317 if (st_lookup(swig_ruby_trackings, (st_data_t)ptr, &value)) {
1318 return value;
1319 } else {
1320 return Qnil;
1321 }
1322}
1323
1324/* Remove a Tracking from a C/C++ struct to a Ruby object. It
1325 is very important to remove objects once they are destroyed
1326 since the same memory address may be reused later to create
1327 a new object. */
1329 /* Delete the object from the hash table */
1330 st_delete(swig_ruby_trackings, (st_data_t *)&ptr, NULL);
1331}
1332
1333/* This is a helper method that unlinks a Ruby object from its
1334 underlying C++ object. This is needed if the lifetime of the
1335 Ruby object is longer than the C++ object. */
1337 VALUE object = SWIG_RubyInstanceFor(ptr);
1338
1339 if (object != Qnil) {
1340 // object might have the T_ZOMBIE type, but that's just
1341 // because the GC has flagged it as such for a deferred
1342 // destruction. Until then, it's still a T_DATA object.
1343 DATA_PTR(object) = 0;
1344 }
1345}
1346
1347/* This is a helper method that iterates over all the trackings
1348 passing the C++ object pointer and its related Ruby object
1349 to the passed callback function. */
1350
1351/* Proxy method to abstract the internal trackings datatype */
1352static int swig_ruby_internal_iterate_callback(st_data_t ptr, st_data_t obj, st_data_t meth) {
1353 ((void (*) (void *, VALUE))meth)((void *)ptr, (VALUE)obj);
1354 return ST_CONTINUE;
1355}
1356
1357SWIGRUNTIME void SWIG_RubyIterateTrackings( void(*meth)(void* ptr, VALUE obj) ) {
1358 st_foreach(swig_ruby_trackings,
1360 (st_data_t)meth);
1361}
1362
1363#ifdef __cplusplus
1364}
1365#endif
1366
1367/* -----------------------------------------------------------------------------
1368 * Ruby API portion that goes into the runtime
1369 * ----------------------------------------------------------------------------- */
1370
1371#ifdef __cplusplus
1372extern "C" {
1373#endif
1374
1375SWIGINTERN VALUE
1376SWIG_Ruby_AppendOutput(VALUE target, VALUE o) {
1377 if (NIL_P(target)) {
1378 target = o;
1379 } else {
1380 if (TYPE(target) != T_ARRAY) {
1381 VALUE o2 = target;
1382 target = rb_ary_new();
1383 rb_ary_push(target, o2);
1384 }
1385 rb_ary_push(target, o);
1386 }
1387 return target;
1388}
1389
1390/* For ruby1.8.4 and earlier. */
1391#ifndef RUBY_INIT_STACK
1392 RUBY_EXTERN void Init_stack(VALUE* addr);
1393# define RUBY_INIT_STACK \
1394 VALUE variable_in_this_stack_frame; \
1395 Init_stack(&variable_in_this_stack_frame);
1396#endif
1397
1398
1399#ifdef __cplusplus
1400}
1401#endif
1402
1403
1404/* -----------------------------------------------------------------------------
1405 * rubyrun.swg
1406 *
1407 * This file contains the runtime support for Ruby modules
1408 * and includes code for managing global variables and pointer
1409 * type checking.
1410 * ----------------------------------------------------------------------------- */
1411
1412/* For backward compatibility only */
1413#define SWIG_POINTER_EXCEPTION 0
1414
1415/* for raw pointers */
1416#define SWIG_ConvertPtr(obj, pptr, type, flags) SWIG_Ruby_ConvertPtrAndOwn(obj, pptr, type, flags, 0)
1417#define SWIG_ConvertPtrAndOwn(obj,pptr,type,flags,own) SWIG_Ruby_ConvertPtrAndOwn(obj, pptr, type, flags, own)
1418#define SWIG_NewPointerObj(ptr, type, flags) SWIG_Ruby_NewPointerObj(ptr, type, flags)
1419#define SWIG_AcquirePtr(ptr, own) SWIG_Ruby_AcquirePtr(ptr, own)
1420#define swig_owntype swig_ruby_owntype
1421
1422/* for raw packed data */
1423#define SWIG_ConvertPacked(obj, ptr, sz, ty) SWIG_Ruby_ConvertPacked(obj, ptr, sz, ty, flags)
1424#define SWIG_NewPackedObj(ptr, sz, type) SWIG_Ruby_NewPackedObj(ptr, sz, type)
1425
1426/* for class or struct pointers */
1427#define SWIG_ConvertInstance(obj, pptr, type, flags) SWIG_ConvertPtr(obj, pptr, type, flags)
1428#define SWIG_NewInstanceObj(ptr, type, flags) SWIG_NewPointerObj(ptr, type, flags)
1429
1430/* for C or C++ function pointers */
1431#define SWIG_ConvertFunctionPtr(obj, pptr, type) SWIG_ConvertPtr(obj, pptr, type, 0)
1432#define SWIG_NewFunctionPtrObj(ptr, type) SWIG_NewPointerObj(ptr, type, 0)
1433
1434/* for C++ member pointers, ie, member methods */
1435#define SWIG_ConvertMember(obj, ptr, sz, ty) SWIG_Ruby_ConvertPacked(obj, ptr, sz, ty)
1436#define SWIG_NewMemberObj(ptr, sz, type) SWIG_Ruby_NewPackedObj(ptr, sz, type)
1437
1438
1439/* Runtime API */
1440
1441#define SWIG_GetModule(clientdata) SWIG_Ruby_GetModule(clientdata)
1442#define SWIG_SetModule(clientdata, pointer) SWIG_Ruby_SetModule(pointer)
1443
1444
1445/* Error manipulation */
1446
1447#define SWIG_ErrorType(code) SWIG_Ruby_ErrorType(code)
1448#define SWIG_Error(code, msg) rb_raise(SWIG_Ruby_ErrorType(code), "%s", msg)
1449#define SWIG_fail goto fail
1450
1451
1452/* Ruby-specific SWIG API */
1453
1454#define SWIG_InitRuntime() SWIG_Ruby_InitRuntime()
1455#define SWIG_define_class(ty) SWIG_Ruby_define_class(ty)
1456#define SWIG_NewClassInstance(value, ty) SWIG_Ruby_NewClassInstance(value, ty)
1457#define SWIG_MangleStr(value) SWIG_Ruby_MangleStr(value)
1458#define SWIG_CheckConvert(value, ty) SWIG_Ruby_CheckConvert(value, ty)
1459
1460#include "assert.h"
1461
1462/* -----------------------------------------------------------------------------
1463 * pointers/data manipulation
1464 * ----------------------------------------------------------------------------- */
1465
1466#ifdef __cplusplus
1467extern "C" {
1468#endif
1469
1470typedef struct {
1471 VALUE klass;
1472 VALUE mImpl;
1473 void (*mark)(void *);
1474 void (*destroy)(void *);
1476} swig_class;
1477
1478
1479/* Global pointer used to keep some internal SWIG stuff */
1480static VALUE _cSWIG_Pointer = Qnil;
1482
1483/* Global IDs used to keep some internal SWIG stuff */
1485static ID swig_call_id = 0;
1487
1488/*
1489 If your swig extension is to be run within an embedded ruby and has
1490 director callbacks, you should set -DRUBY_EMBEDDED during compilation.
1491 This will reset ruby's stack frame on each entry point from the main
1492 program the first time a virtual director function is invoked (in a
1493 non-recursive way).
1494 If this is not done, you run the risk of Ruby trashing the stack.
1495*/
1496
1497#ifdef RUBY_EMBEDDED
1498
1499# define SWIG_INIT_STACK \
1500 if ( !swig_virtual_calls ) { RUBY_INIT_STACK } \
1501 ++swig_virtual_calls;
1502# define SWIG_RELEASE_STACK --swig_virtual_calls;
1503# define Ruby_DirectorTypeMismatchException(x) \
1504 rb_raise( rb_eTypeError, "%s", x ); return c_result;
1505
1506 static unsigned int swig_virtual_calls = 0;
1507
1508#else /* normal non-embedded extension */
1509
1510# define SWIG_INIT_STACK
1511# define SWIG_RELEASE_STACK
1512# define Ruby_DirectorTypeMismatchException(x) \
1513 throw Swig::DirectorTypeMismatchException( x );
1514
1515#endif /* RUBY_EMBEDDED */
1516
1517
1518SWIGRUNTIME VALUE
1520 static int init = 0;
1521 static VALUE rubyExceptionClass ;
1522 if (!init) {
1523 init = 1;
1524 rubyExceptionClass = rb_const_get(_mSWIG, rb_intern("Exception"));
1525 }
1526 return rubyExceptionClass;
1527}
1528
1529/* This code checks to see if the Ruby object being raised as part
1530 of an exception inherits from the Ruby class Exception. If so,
1531 the object is simply returned. If not, then a new Ruby exception
1532 object is created and that will be returned to Ruby.*/
1533SWIGRUNTIME VALUE
1535 VALUE exceptionClass = getExceptionClass();
1536 if (rb_obj_is_kind_of(obj, exceptionClass)) {
1537 return obj;
1538 } else {
1539 return rb_exc_new3(rb_eRuntimeError, rb_obj_as_string(obj));
1540 }
1541}
1542
1543/* Initialize Ruby runtime support */
1544SWIGRUNTIME void
1546{
1547 if (_mSWIG == Qnil) {
1548 _mSWIG = rb_define_module("SWIG");
1549 swig_call_id = rb_intern("call");
1550 swig_arity_id = rb_intern("arity");
1551 swig_lowerthan_id = rb_intern("<");
1552 }
1553}
1554
1555/* Define Ruby class for C type */
1556SWIGRUNTIME void
1558{
1559 size_t klass_len = 4 + strlen(type->name) + 1;
1560 char *klass_name = (char *) malloc(klass_len);
1561 SWIG_snprintf(klass_name, klass_len, "TYPE%s", type->name);
1562 if (NIL_P(_cSWIG_Pointer)) {
1563 _cSWIG_Pointer = rb_define_class_under(_mSWIG, "Pointer", rb_cObject);
1564 rb_undef_method(CLASS_OF(_cSWIG_Pointer), "new");
1565 }
1566 rb_undef_alloc_func(rb_define_class_under(_mSWIG, klass_name, _cSWIG_Pointer));
1567 free((void *) klass_name);
1568}
1569
1570/* Create a new pointer object */
1571SWIGRUNTIME VALUE
1573{
1574 int own = flags & SWIG_POINTER_OWN;
1575 int track;
1576 char *klass_name;
1577 swig_class *sklass;
1578 VALUE klass;
1579 VALUE obj;
1580
1581 if (!ptr)
1582 return Qnil;
1583
1584 assert(type);
1585 if (type->clientdata) {
1586 sklass = (swig_class *) type->clientdata;
1587
1588 /* Are we tracking this class and have we already returned this Ruby object? */
1589 track = sklass->trackObjects;
1590 if (track) {
1591 obj = SWIG_RubyInstanceFor(ptr);
1592
1593 /* Check the object's type and make sure it has the correct type.
1594 It might not in cases where methods do things like
1595 downcast methods. */
1596 if (obj != Qnil) {
1597 VALUE value = rb_iv_get(obj, "@__swigtype__");
1598 const char* type_name = RSTRING_PTR(value);
1599
1600 if (strcmp(type->name, type_name) == 0) {
1601 return obj;
1602 }
1603 }
1604 }
1605
1606 /* Create a new Ruby object */
1607 obj = Data_Wrap_Struct(sklass->klass, VOIDFUNC(sklass->mark),
1608 ( own ? VOIDFUNC(sklass->destroy) :
1609 (track ? VOIDFUNC(SWIG_RubyRemoveTracking) : 0 )
1610 ), ptr);
1611
1612 /* If tracking is on for this class then track this object. */
1613 if (track) {
1614 SWIG_RubyAddTracking(ptr, obj);
1615 }
1616 } else {
1617 size_t klass_len = 4 + strlen(type->name) + 1;
1618 klass_name = (char *) malloc(klass_len);
1619 SWIG_snprintf(klass_name, klass_len, "TYPE%s", type->name);
1620 klass = rb_const_get(_mSWIG, rb_intern(klass_name));
1621 free((void *) klass_name);
1622 obj = Data_Wrap_Struct(klass, 0, 0, ptr);
1623 }
1624 rb_iv_set(obj, "@__swigtype__", rb_str_new2(type->name));
1625
1626 return obj;
1627}
1628
1629/* Create a new class instance (always owned) */
1630SWIGRUNTIME VALUE
1632{
1633 VALUE obj;
1634 swig_class *sklass = (swig_class *) type->clientdata;
1635 obj = Data_Wrap_Struct(klass, VOIDFUNC(sklass->mark), VOIDFUNC(sklass->destroy), 0);
1636 rb_iv_set(obj, "@__swigtype__", rb_str_new2(type->name));
1637 return obj;
1638}
1639
1640/* Get type mangle from class name */
1641SWIGRUNTIMEINLINE char *
1643{
1644 VALUE stype = rb_iv_get(obj, "@__swigtype__");
1645 if (NIL_P(stype))
1646 return NULL;
1647 return StringValuePtr(stype);
1648}
1649
1650/* Acquire a pointer value */
1651typedef struct {
1652 void (*datafree)(void *);
1653 int own;
1655
1658 swig_ruby_owntype oldown = {0, 0};
1659 if (TYPE(obj) == T_DATA && !RTYPEDDATA_P(obj)) {
1660 oldown.datafree = RDATA(obj)->dfree;
1661 RDATA(obj)->dfree = own.datafree;
1662 }
1663 return oldown;
1664}
1665
1666/* Convert a pointer value */
1667SWIGRUNTIME int
1669{
1670 char *c;
1671 swig_cast_info *tc;
1672 void *vptr = 0;
1673
1674 /* Grab the pointer */
1675 if (NIL_P(obj)) {
1676 if (ptr)
1677 *ptr = 0;
1679 } else {
1680 if (TYPE(obj) != T_DATA || (TYPE(obj) == T_DATA && RTYPEDDATA_P(obj))) {
1681 return SWIG_ERROR;
1682 }
1683 Data_Get_Struct(obj, void, vptr);
1684 }
1685
1686 if (own) {
1687 own->datafree = RDATA(obj)->dfree;
1688 own->own = 0;
1689 }
1690
1692 if (!RDATA(obj)->dfree)
1694 }
1695
1696 /* Check to see if the input object is giving up ownership
1697 of the underlying C struct or C++ object. If so then we
1698 need to reset the destructor since the Ruby object no
1699 longer owns the underlying C++ object.*/
1700 if (flags & SWIG_POINTER_DISOWN) {
1701 /* Is tracking on for this class? */
1702 int track = 0;
1703 if (ty && ty->clientdata) {
1704 swig_class *sklass = (swig_class *) ty->clientdata;
1705 track = sklass->trackObjects;
1706 }
1707
1708 if (track) {
1709 /* We are tracking objects for this class. Thus we change the destructor
1710 * to SWIG_RubyRemoveTracking. This allows us to
1711 * remove the mapping from the C++ to Ruby object
1712 * when the Ruby object is garbage collected. If we don't
1713 * do this, then it is possible we will return a reference
1714 * to a Ruby object that no longer exists thereby crashing Ruby. */
1715 RDATA(obj)->dfree = SWIG_RubyRemoveTracking;
1716 } else {
1717 RDATA(obj)->dfree = 0;
1718 }
1719 }
1720
1721 if (flags & SWIG_POINTER_CLEAR) {
1722 DATA_PTR(obj) = 0;
1723 }
1724
1725 /* Do type-checking if type info was provided */
1726 if (ty) {
1727 if (ty->clientdata) {
1728 if (rb_obj_is_kind_of(obj, ((swig_class *) (ty->clientdata))->klass)) {
1729 if (vptr == 0) {
1730 /* The object has already been deleted */
1732 }
1733 }
1734 }
1735 if ((c = SWIG_MangleStr(obj)) == NULL) {
1736 return SWIG_ERROR;
1737 }
1738 tc = SWIG_TypeCheck(c, ty);
1739 if (!tc) {
1740 return SWIG_ERROR;
1741 } else {
1742 if (ptr) {
1743 if (tc->type == ty) {
1744 *ptr = vptr;
1745 } else {
1746 int newmemory = 0;
1747 *ptr = SWIG_TypeCast(tc, vptr, &newmemory);
1748 if (newmemory == SWIG_CAST_NEW_MEMORY) {
1749 assert(own); /* badly formed typemap which will lead to a memory leak - it must set and use own to delete *ptr */
1750 if (own)
1751 own->own = own->own | SWIG_CAST_NEW_MEMORY;
1752 }
1753 }
1754 }
1755 }
1756 } else {
1757 if (ptr)
1758 *ptr = vptr;
1759 }
1760
1761 return SWIG_OK;
1762}
1763
1764/* Check convert */
1767{
1768 char *c = SWIG_MangleStr(obj);
1769 if (!c) return 0;
1770 return SWIG_TypeCheck(c,ty) != 0;
1771}
1772
1773SWIGRUNTIME VALUE
1775 char result[1024];
1776 char *r = result;
1777 if ((2*sz + 1 + strlen(type->name)) > 1000) return 0;
1778 *(r++) = '_';
1779 r = SWIG_PackData(r, ptr, sz);
1780 strcpy(r, type->name);
1781 return rb_str_new2(result);
1782}
1783
1784/* Convert a packed pointer value */
1785SWIGRUNTIME int
1786SWIG_Ruby_ConvertPacked(VALUE obj, void *ptr, int sz, swig_type_info *ty) {
1787 swig_cast_info *tc;
1788 const char *c;
1789
1790 if (TYPE(obj) != T_STRING) goto type_error;
1791 c = StringValuePtr(obj);
1792 /* Pointer values must start with leading underscore */
1793 if (*c != '_') goto type_error;
1794 c++;
1795 c = SWIG_UnpackData(c, ptr, sz);
1796 if (ty) {
1797 tc = SWIG_TypeCheck(c, ty);
1798 if (!tc) goto type_error;
1799 }
1800 return SWIG_OK;
1801
1802 type_error:
1803 return SWIG_ERROR;
1804}
1805
1808{
1809 VALUE pointer;
1810 swig_module_info *ret = 0;
1811 VALUE verbose = rb_gv_get("VERBOSE");
1812
1813 /* temporarily disable warnings, since the pointer check causes warnings with 'ruby -w' */
1814 rb_gv_set("VERBOSE", Qfalse);
1815
1816 /* first check if pointer already created */
1817 pointer = rb_gv_get("$swig_runtime_data_type_pointer" SWIG_RUNTIME_VERSION SWIG_TYPE_TABLE_NAME);
1818 if (pointer != Qnil) {
1819 Data_Get_Struct(pointer, swig_module_info, ret);
1820 }
1821
1822 /* reinstate warnings */
1823 rb_gv_set("VERBOSE", verbose);
1824 return ret;
1825}
1826
1827SWIGRUNTIME void
1829{
1830 /* register a new class */
1831 VALUE cl = rb_define_class("swig_runtime_data", rb_cObject);
1833 /* create and store the structure pointer to a global variable */
1834 swig_runtime_data_type_pointer = Data_Wrap_Struct(cl, 0, 0, pointer);
1835 rb_define_readonly_variable("$swig_runtime_data_type_pointer" SWIG_RUNTIME_VERSION SWIG_TYPE_TABLE_NAME, &swig_runtime_data_type_pointer);
1836}
1837
1838/* This function can be used to check whether a proc or method or similarly
1839 callable function has been passed. Usually used in a %typecheck, like:
1840
1841 %typecheck(c_callback_t, precedence=SWIG_TYPECHECK_POINTER) {
1842 $result = SWIG_Ruby_isCallable( $input );
1843 }
1844 */
1846int SWIG_Ruby_isCallable( VALUE proc )
1847{
1848 if ( rb_respond_to( proc, swig_call_id ) )
1849 return 1;
1850 return 0;
1851}
1852
1853/* This function can be used to check the arity (number of arguments)
1854 a proc or method can take. Usually used in a %typecheck.
1855 Valid arities will be that equal to minimal or those < 0
1856 which indicate a variable number of parameters at the end.
1857 */
1859int SWIG_Ruby_arity( VALUE proc, int minimal )
1860{
1861 if ( rb_respond_to( proc, swig_arity_id ) )
1862 {
1863 VALUE num = rb_funcall2( proc, swig_arity_id, 0, 0 );
1864 int arity = NUM2INT(num);
1865 if ( arity < 0 && (arity+1) < -minimal ) return 1;
1866 if ( arity == minimal ) return 1;
1867 return 1;
1868 }
1869 return 0;
1870}
1871
1872
1873#ifdef __cplusplus
1874}
1875#endif
1876
1877
1878
1879#define SWIG_exception_fail(code, msg) do { SWIG_Error(code, msg); SWIG_fail; } while(0)
1880
1881#define SWIG_contract_assert(expr, msg) do { if (!(expr)) { SWIG_Error(SWIG_RuntimeError, msg); SWIG_fail; } } while (0)
1882
1883
1884
1885/* -------- TYPES TABLE (BEGIN) -------- */
1886
1887#define SWIGTYPE_p_Agedge_t swig_types[0]
1888#define SWIGTYPE_p_Agnode_t swig_types[1]
1889#define SWIGTYPE_p_Agraph_t swig_types[2]
1890#define SWIGTYPE_p_Agsym_t swig_types[3]
1891#define SWIGTYPE_p_FILE swig_types[4]
1892#define SWIGTYPE_p_char swig_types[5]
1894static swig_module_info swig_module = {swig_types, 6, 0, 0, 0, 0};
1895#define SWIG_TypeQuery(name) SWIG_TypeQueryModule(&swig_module, &swig_module, name)
1896#define SWIG_MangledTypeQuery(name) SWIG_MangledTypeQueryModule(&swig_module, &swig_module, name)
1897
1898/* -------- TYPES TABLE (END) -------- */
1899
1900#define SWIG_init Init_gv
1901#define SWIG_name "Gv"
1902
1903static VALUE mGv;
1904
1905#ifdef __cplusplus
1906#include <utility>
1907/* SwigValueWrapper is described in swig.swg */
1908template<typename T> class SwigValueWrapper {
1909 struct SwigSmartPointer {
1910 T *ptr;
1911 SwigSmartPointer(T *p) : ptr(p) { }
1912 ~SwigSmartPointer() { delete ptr; }
1913 SwigSmartPointer& operator=(SwigSmartPointer& rhs) { T* oldptr = ptr; ptr = 0; delete oldptr; ptr = rhs.ptr; rhs.ptr = 0; return *this; }
1914 void reset(T *p) { T* oldptr = ptr; ptr = 0; delete oldptr; ptr = p; }
1915 } pointer;
1916 SwigValueWrapper& operator=(const SwigValueWrapper<T>& rhs);
1917 SwigValueWrapper(const SwigValueWrapper<T>& rhs);
1918public:
1919 SwigValueWrapper() : pointer(0) { }
1920 SwigValueWrapper& operator=(const T& t) { SwigSmartPointer tmp(new T(t)); pointer = tmp; return *this; }
1921#if __cplusplus >=201103L
1922 SwigValueWrapper& operator=(T&& t) { SwigSmartPointer tmp(new T(std::move(t))); pointer = tmp; return *this; }
1923 operator T&&() const { return std::move(*pointer.ptr); }
1924#else
1925 operator T&() const { return *pointer.ptr; }
1926#endif
1927 T *operator&() const { return pointer.ptr; }
1928 static void reset(SwigValueWrapper& t, T *p) { t.pointer.reset(p); }
1929};
1930
1931/*
1932 * SwigValueInit() is a generic initialisation solution as the following approach:
1933 *
1934 * T c_result = T();
1935 *
1936 * doesn't compile for all types for example:
1937 *
1938 * unsigned int c_result = unsigned int();
1939 */
1940template <typename T> T SwigValueInit() {
1941 return T();
1942}
1943
1944#if __cplusplus >=201103L
1945# define SWIG_STD_MOVE(OBJ) std::move(OBJ)
1946#else
1947# define SWIG_STD_MOVE(OBJ) OBJ
1948#endif
1949
1950#endif
1951
1952
1953#define SWIG_RUBY_THREAD_BEGIN_BLOCK
1954#define SWIG_RUBY_THREAD_END_BLOCK
1955
1956
1957#define SWIG_as_voidptr(a) const_cast< void * >(static_cast< const void * >(a))
1958#define SWIG_as_voidptrptr(a) ((void)SWIG_as_voidptr(*a),reinterpret_cast< void** >(a))
1959
1960
1961#include <stdexcept>
1962
1963
1964#include <gvc/gvc.h>
1965
1967/*** New empty graph */
1968extern Agraph_t *graph(char *name);
1969extern Agraph_t *digraph(char *name);
1970extern Agraph_t *strictgraph(char *name);
1971extern Agraph_t *strictdigraph(char *name);
1972/*** New graph from a dot-syntax string or file */
1973extern Agraph_t *readstring(char *string);
1974extern Agraph_t *read(const char *filename);
1975extern Agraph_t *read(FILE *f);
1976/*** Add new subgraph to existing graph */
1977extern Agraph_t *graph(Agraph_t *g, char *name);
1978
1980/*** Add new node to existing graph */
1981extern Agnode_t *node(Agraph_t *g, char *name);
1982
1984/*** Add new edge between existing nodes */
1985extern Agedge_t *edge(Agnode_t *t, Agnode_t *h);
1986/*** Add a new edge between an existing tail node, and a named head node which will be induced in the graph if it doesn't already exist */
1987extern Agedge_t *edge(Agnode_t *t, char *hname);
1988/*** Add a new edge between an existing head node, and a named tail node which will be induced in the graph if it doesn't already exist */
1989extern Agedge_t *edge(char *tname, Agnode_t *h);
1990/*** Add a new edge between named tail and head nodes which will be induced in the graph if they don't already exist */
1991extern Agedge_t *edge(Agraph_t *g, char *tname, char *hname);
1992
1994/*** Set value of named attribute of graph/node/edge - creating attribute if necessary */
1995extern char *setv(Agraph_t *g, char *attr, char *val);
1996extern char *setv(Agnode_t *n, char *attr, char *val);
1997extern char *setv(Agedge_t *e, char *attr, char *val);
1998
1999/*** Set value of existing attribute of graph/node/edge (using attribute handle) */
2000extern char *setv(Agraph_t *g, Agsym_t *a, char *val);
2001extern char *setv(Agnode_t *n, Agsym_t *a, char *val);
2002extern char *setv(Agedge_t *e, Agsym_t *a, char *val);
2003
2005/*** Get value of named attribute of graph/node/edge */
2006extern char *getv(Agraph_t *g, char *attr);
2007extern char *getv(Agnode_t *n, char *attr);
2008extern char *getv(Agedge_t *e, char *attr);
2009
2010/*** Get value of attribute of graph/node/edge (using attribute handle) */
2011extern char *getv(Agraph_t *g, Agsym_t *a);
2012extern char *getv(Agnode_t *n, Agsym_t *a);
2013extern char *getv(Agedge_t *e, Agsym_t *a);
2014
2016extern char *nameof(Agraph_t *g);
2017extern char *nameof(Agnode_t *n);
2018extern char *nameof(Agsym_t *a);
2019
2021extern Agraph_t *findsubg(Agraph_t *g, char *name);
2022extern Agnode_t *findnode(Agraph_t *g, char *name);
2023extern Agedge_t *findedge(Agnode_t *t, Agnode_t *h);
2024
2026extern Agsym_t *findattr(Agraph_t *g, char *name);
2027extern Agsym_t *findattr(Agnode_t *n, char *name);
2028extern Agsym_t *findattr(Agedge_t *e, char *name);
2029
2031extern Agnode_t *headof(Agedge_t *e);
2032extern Agnode_t *tailof(Agedge_t *e);
2033extern Agraph_t *graphof(Agraph_t *g);
2034extern Agraph_t *graphof(Agedge_t *e);
2035extern Agraph_t *graphof(Agnode_t *n);
2036extern Agraph_t *rootof(Agraph_t *g);
2037
2039extern Agnode_t *protonode(Agraph_t *g);
2040extern Agedge_t *protoedge(Agraph_t *g);
2041
2043/*** Iteration termination tests */
2044extern bool ok(Agraph_t *g);
2045extern bool ok(Agnode_t *n);
2046extern bool ok(Agedge_t *e);
2047extern bool ok(Agsym_t *a);
2048
2049/*** Iterate over subgraphs of a graph */
2050extern Agraph_t *firstsubg(Agraph_t *g);
2051extern Agraph_t *nextsubg(Agraph_t *g, Agraph_t *sg);
2052
2053/*** Iterate over supergraphs of a graph (obscure and rarely useful) */
2054extern Agraph_t *firstsupg(Agraph_t *g);
2055extern Agraph_t *nextsupg(Agraph_t *g, Agraph_t *sg);
2056
2057/*** Iterate over edges of a graph */
2058extern Agedge_t *firstedge(Agraph_t *g);
2059extern Agedge_t *nextedge(Agraph_t *g, Agedge_t *e);
2060
2061/*** Iterate over outedges of a graph */
2062extern Agedge_t *firstout(Agraph_t *g);
2063extern Agedge_t *nextout(Agraph_t *g, Agedge_t *e);
2064
2065/*** Iterate over edges of a node */
2066extern Agedge_t *firstedge(Agnode_t *n);
2067extern Agedge_t *nextedge(Agnode_t *n, Agedge_t *e);
2068
2069/*** Iterate over out-edges of a node */
2070extern Agedge_t *firstout(Agnode_t *n);
2071extern Agedge_t *nextout(Agnode_t *n, Agedge_t *e);
2072
2073/*** Iterate over head nodes reachable from out-edges of a node */
2074extern Agnode_t *firsthead(Agnode_t *n);
2075extern Agnode_t *nexthead(Agnode_t *n, Agnode_t *h);
2076
2077/*** Iterate over in-edges of a graph */
2078extern Agedge_t *firstin(Agraph_t *g);
2079extern Agedge_t *nextin(Agnode_t *n, Agedge_t *e);
2080
2081/*** Iterate over in-edges of a node */
2082extern Agedge_t *firstin(Agnode_t *n);
2083extern Agedge_t *nextin(Agraph_t *g, Agedge_t *e);
2084
2085/*** Iterate over tail nodes reachable from in-edges of a node */
2086extern Agnode_t *firsttail(Agnode_t *n);
2087extern Agnode_t *nexttail(Agnode_t *n, Agnode_t *t);
2088
2089/*** Iterate over nodes of a graph */
2090extern Agnode_t *firstnode(Agraph_t *g);
2091extern Agnode_t *nextnode(Agraph_t *g, Agnode_t *n);
2092
2093/*** Iterate over nodes of an edge */
2094extern Agnode_t *firstnode(Agedge_t *e);
2095extern Agnode_t *nextnode(Agedge_t *e, Agnode_t *n);
2096
2097/*** Iterate over attributes of a graph */
2098extern Agsym_t *firstattr(Agraph_t *g);
2099extern Agsym_t *nextattr(Agraph_t *g, Agsym_t *a);
2100
2101/*** Iterate over attributes of an edge */
2102extern Agsym_t *firstattr(Agedge_t *e);
2103extern Agsym_t *nextattr(Agedge_t *e, Agsym_t *a);
2104
2105/*** Iterate over attributes of a node */
2106extern Agsym_t *firstattr(Agnode_t *n);
2107extern Agsym_t *nextattr(Agnode_t *n, Agsym_t *a);
2108
2110extern bool rm(Agraph_t *g);
2111extern bool rm(Agnode_t *n);
2112extern bool rm(Agedge_t *e);
2113
2115/*** Annotate a graph with layout attributes and values using a specific layout engine */
2116extern bool layout(Agraph_t *g, const char *engine);
2117
2119/*** Render a layout into attributes of the graph */
2120extern bool render(Agraph_t *g);
2121/*** Render a layout to stdout */
2122extern bool render(Agraph_t *g, const char *format);
2123/*** Render to an open file */
2124extern bool render(Agraph_t *g, const char *format, FILE *fout);
2125/*** Render a layout to an unopened file by name */
2126extern bool render(Agraph_t *g, const char *format, const char *filename);
2127/*** Render to a string result */
2128#ifdef SWIGJAVA
2129extern char* renderresult(Agraph_t *ing, const char *format);
2130#else
2131extern void renderresult(Agraph_t *g, const char *format, char *outdata);
2132/*** Render to an open channel */
2133extern bool renderchannel(Agraph_t *g, const char *format, const char *channelname);
2134#endif
2135/*** Render a layout to a malloc'ed string, to be free'd by the caller */
2136/*** (deprecated - too easy to leak memory) */
2137/*** (still needed for "eval [gv::renderdata $G tk]" ) */
2138extern char* renderdata(Agraph_t *g, const char *format);
2139
2140/*** Writing graph back to file */
2141extern bool write(Agraph_t *g, const char *filename);
2142extern bool write(Agraph_t *g, FILE *f);
2143
2144/*** Graph transformation tools */
2145extern bool tred(Agraph_t *g);
2146
2147
2148
2151{
2152 static int init = 0;
2153 static swig_type_info* info = 0;
2154 if (!init) {
2155 info = SWIG_TypeQuery("_p_char");
2156 init = 1;
2157 }
2158 return info;
2159}
2160
2161
2162SWIGINTERN int
2163SWIG_AsCharPtrAndSize(VALUE obj, char** cptr, size_t* psize, int *alloc)
2164{
2165 if (TYPE(obj) == T_STRING) {
2166 char *cstr = StringValuePtr(obj);
2167 size_t size = RSTRING_LEN(obj) + 1;
2168 if (cptr) {
2169 if (alloc) {
2170 if (*alloc == SWIG_NEWOBJ) {
2171 *cptr = reinterpret_cast< char* >(memcpy(new char[size], cstr, sizeof(char)*(size)));
2172 } else {
2173 *cptr = cstr;
2174 *alloc = SWIG_OLDOBJ;
2175 }
2176 }
2177 }
2178 if (psize) *psize = size;
2179 return SWIG_OK;
2180 } else {
2181 swig_type_info* pchar_descriptor = SWIG_pchar_descriptor();
2182 if (pchar_descriptor) {
2183 void* vptr = 0;
2184 if (SWIG_ConvertPtr(obj, &vptr, pchar_descriptor, 0) == SWIG_OK) {
2185 if (cptr) *cptr = (char *)vptr;
2186 if (psize) *psize = vptr ? (strlen((char*)vptr) + 1) : 0;
2187 if (alloc) *alloc = SWIG_OLDOBJ;
2188 return SWIG_OK;
2189 }
2190 }
2191 }
2192 return SWIG_TypeError;
2193}
2194
2195
2196
2197
2198
2199SWIGINTERNINLINE VALUE
2200SWIG_FromCharPtrAndSize(const char* carray, size_t size)
2201{
2202 if (carray) {
2203 if (size > LONG_MAX) {
2204 swig_type_info* pchar_descriptor = SWIG_pchar_descriptor();
2205 return pchar_descriptor ?
2206 SWIG_NewPointerObj(const_cast< char * >(carray), pchar_descriptor, 0) : Qnil;
2207 } else {
2208 return rb_str_new(carray, static_cast< long >(size));
2209 }
2210 } else {
2211 return Qnil;
2212 }
2213}
2214
2215
2216SWIGINTERNINLINE VALUE
2217SWIG_FromCharPtr(const char *cptr)
2218{
2219 return SWIG_FromCharPtrAndSize(cptr, (cptr ? strlen(cptr) : 0));
2220}
2221
2222
2223SWIGINTERNINLINE VALUE
2224SWIG_From_bool (bool value)
2225{
2226 return value ? Qtrue : Qfalse;
2227}
2228
2229SWIGINTERN VALUE
2230_wrap_graph__SWIG_0(int argc, VALUE *argv, VALUE self) {
2231 char *arg1 = (char *) 0 ;
2232 int res1 ;
2233 char *buf1 = 0 ;
2234 int alloc1 = 0 ;
2235 Agraph_t *result = 0 ;
2236 VALUE vresult = Qnil;
2237
2238 if ((argc < 1) || (argc > 1)) {
2239 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
2240 }
2241 res1 = SWIG_AsCharPtrAndSize(argv[0], &buf1, NULL, &alloc1);
2242 if (!SWIG_IsOK(res1)) {
2243 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "char *","graph", 1, argv[0] ));
2244 }
2245 arg1 = reinterpret_cast< char * >(buf1);
2246 result = (Agraph_t *)graph(arg1);
2247 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agraph_t, 0 | 0 );
2248 if (alloc1 == SWIG_NEWOBJ) delete[] buf1;
2249 return vresult;
2250fail:
2251 if (alloc1 == SWIG_NEWOBJ) delete[] buf1;
2252 return Qnil;
2253}
2254
2255
2256SWIGINTERN VALUE
2257_wrap_digraph(int argc, VALUE *argv, VALUE self) {
2258 char *arg1 = (char *) 0 ;
2259 int res1 ;
2260 char *buf1 = 0 ;
2261 int alloc1 = 0 ;
2262 Agraph_t *result = 0 ;
2263 VALUE vresult = Qnil;
2264
2265 if ((argc < 1) || (argc > 1)) {
2266 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
2267 }
2268 res1 = SWIG_AsCharPtrAndSize(argv[0], &buf1, NULL, &alloc1);
2269 if (!SWIG_IsOK(res1)) {
2270 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "char *","digraph", 1, argv[0] ));
2271 }
2272 arg1 = reinterpret_cast< char * >(buf1);
2273 result = (Agraph_t *)digraph(arg1);
2274 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agraph_t, 0 | 0 );
2275 if (alloc1 == SWIG_NEWOBJ) delete[] buf1;
2276 return vresult;
2277fail:
2278 if (alloc1 == SWIG_NEWOBJ) delete[] buf1;
2279 return Qnil;
2280}
2281
2282
2283SWIGINTERN VALUE
2284_wrap_strictgraph(int argc, VALUE *argv, VALUE self) {
2285 char *arg1 = (char *) 0 ;
2286 int res1 ;
2287 char *buf1 = 0 ;
2288 int alloc1 = 0 ;
2289 Agraph_t *result = 0 ;
2290 VALUE vresult = Qnil;
2291
2292 if ((argc < 1) || (argc > 1)) {
2293 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
2294 }
2295 res1 = SWIG_AsCharPtrAndSize(argv[0], &buf1, NULL, &alloc1);
2296 if (!SWIG_IsOK(res1)) {
2297 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "char *","strictgraph", 1, argv[0] ));
2298 }
2299 arg1 = reinterpret_cast< char * >(buf1);
2300 result = (Agraph_t *)strictgraph(arg1);
2301 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agraph_t, 0 | 0 );
2302 if (alloc1 == SWIG_NEWOBJ) delete[] buf1;
2303 return vresult;
2304fail:
2305 if (alloc1 == SWIG_NEWOBJ) delete[] buf1;
2306 return Qnil;
2307}
2308
2309
2310SWIGINTERN VALUE
2311_wrap_strictdigraph(int argc, VALUE *argv, VALUE self) {
2312 char *arg1 = (char *) 0 ;
2313 int res1 ;
2314 char *buf1 = 0 ;
2315 int alloc1 = 0 ;
2316 Agraph_t *result = 0 ;
2317 VALUE vresult = Qnil;
2318
2319 if ((argc < 1) || (argc > 1)) {
2320 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
2321 }
2322 res1 = SWIG_AsCharPtrAndSize(argv[0], &buf1, NULL, &alloc1);
2323 if (!SWIG_IsOK(res1)) {
2324 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "char *","strictdigraph", 1, argv[0] ));
2325 }
2326 arg1 = reinterpret_cast< char * >(buf1);
2327 result = (Agraph_t *)strictdigraph(arg1);
2328 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agraph_t, 0 | 0 );
2329 if (alloc1 == SWIG_NEWOBJ) delete[] buf1;
2330 return vresult;
2331fail:
2332 if (alloc1 == SWIG_NEWOBJ) delete[] buf1;
2333 return Qnil;
2334}
2335
2336
2337SWIGINTERN VALUE
2338_wrap_readstring(int argc, VALUE *argv, VALUE self) {
2339 char *arg1 = (char *) 0 ;
2340 int res1 ;
2341 char *buf1 = 0 ;
2342 int alloc1 = 0 ;
2343 Agraph_t *result = 0 ;
2344 VALUE vresult = Qnil;
2345
2346 if ((argc < 1) || (argc > 1)) {
2347 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
2348 }
2349 res1 = SWIG_AsCharPtrAndSize(argv[0], &buf1, NULL, &alloc1);
2350 if (!SWIG_IsOK(res1)) {
2351 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "char *","readstring", 1, argv[0] ));
2352 }
2353 arg1 = reinterpret_cast< char * >(buf1);
2354 result = (Agraph_t *)readstring(arg1);
2355 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agraph_t, 0 | 0 );
2356 if (alloc1 == SWIG_NEWOBJ) delete[] buf1;
2357 return vresult;
2358fail:
2359 if (alloc1 == SWIG_NEWOBJ) delete[] buf1;
2360 return Qnil;
2361}
2362
2363
2364SWIGINTERN VALUE
2365_wrap_read__SWIG_0(int argc, VALUE *argv, VALUE self) {
2366 char *arg1 = (char *) 0 ;
2367 int res1 ;
2368 char *buf1 = 0 ;
2369 int alloc1 = 0 ;
2370 Agraph_t *result = 0 ;
2371 VALUE vresult = Qnil;
2372
2373 if ((argc < 1) || (argc > 1)) {
2374 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
2375 }
2376 res1 = SWIG_AsCharPtrAndSize(argv[0], &buf1, NULL, &alloc1);
2377 if (!SWIG_IsOK(res1)) {
2378 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "char const *","read", 1, argv[0] ));
2379 }
2380 arg1 = reinterpret_cast< char * >(buf1);
2381 result = (Agraph_t *)read((char const *)arg1);
2382 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agraph_t, 0 | 0 );
2383 if (alloc1 == SWIG_NEWOBJ) delete[] buf1;
2384 return vresult;
2385fail:
2386 if (alloc1 == SWIG_NEWOBJ) delete[] buf1;
2387 return Qnil;
2388}
2389
2390
2391SWIGINTERN VALUE
2392_wrap_read__SWIG_1(int argc, VALUE *argv, VALUE self) {
2393 FILE *arg1 = (FILE *) 0 ;
2394 void *argp1 = 0 ;
2395 int res1 = 0 ;
2396 Agraph_t *result = 0 ;
2397 VALUE vresult = Qnil;
2398
2399 if ((argc < 1) || (argc > 1)) {
2400 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
2401 }
2402 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_FILE, 0 | 0 );
2403 if (!SWIG_IsOK(res1)) {
2404 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "FILE *","read", 1, argv[0] ));
2405 }
2406 arg1 = reinterpret_cast< FILE * >(argp1);
2407 result = (Agraph_t *)read(arg1);
2408 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agraph_t, 0 | 0 );
2409 return vresult;
2410fail:
2411 return Qnil;
2412}
2413
2414
2415SWIGINTERN VALUE _wrap_read(int nargs, VALUE *args, VALUE self) {
2416 int argc;
2417 VALUE argv[1];
2418 int ii;
2419
2420 argc = nargs;
2421 if (argc > 1) SWIG_fail;
2422 for (ii = 0; (ii < argc); ++ii) {
2423 argv[ii] = args[ii];
2424 }
2425 if (argc == 1) {
2426 int _v = 0;
2427 void *vptr = 0;
2428 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_FILE, 0);
2429 _v = SWIG_CheckState(res);
2430 if (_v) {
2431 return _wrap_read__SWIG_1(nargs, args, self);
2432 }
2433 }
2434 if (argc == 1) {
2435 int _v = 0;
2436 int res = SWIG_AsCharPtrAndSize(argv[0], 0, NULL, 0);
2437 _v = SWIG_CheckState(res);
2438 if (_v) {
2439 return _wrap_read__SWIG_0(nargs, args, self);
2440 }
2441 }
2442
2443fail:
2444 Ruby_Format_OverloadedError( argc, 1, "read",
2445 " Agraph_t read(char const *filename)\n"
2446 " Agraph_t * read(FILE *f)\n");
2447
2448 return Qnil;
2449}
2450
2451
2452SWIGINTERN VALUE
2453_wrap_graph__SWIG_1(int argc, VALUE *argv, VALUE self) {
2454 Agraph_t *arg1 = (Agraph_t *) 0 ;
2455 char *arg2 = (char *) 0 ;
2456 void *argp1 = 0 ;
2457 int res1 = 0 ;
2458 int res2 ;
2459 char *buf2 = 0 ;
2460 int alloc2 = 0 ;
2461 Agraph_t *result = 0 ;
2462 VALUE vresult = Qnil;
2463
2464 if ((argc < 2) || (argc > 2)) {
2465 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
2466 }
2467 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
2468 if (!SWIG_IsOK(res1)) {
2469 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","graph", 1, argv[0] ));
2470 }
2471 arg1 = reinterpret_cast< Agraph_t * >(argp1);
2472 res2 = SWIG_AsCharPtrAndSize(argv[1], &buf2, NULL, &alloc2);
2473 if (!SWIG_IsOK(res2)) {
2474 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "char *","graph", 2, argv[1] ));
2475 }
2476 arg2 = reinterpret_cast< char * >(buf2);
2477 result = (Agraph_t *)graph(arg1,arg2);
2478 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agraph_t, 0 | 0 );
2479 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
2480 return vresult;
2481fail:
2482 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
2483 return Qnil;
2484}
2485
2486
2487SWIGINTERN VALUE _wrap_graph(int nargs, VALUE *args, VALUE self) {
2488 int argc;
2489 VALUE argv[2];
2490 int ii;
2491
2492 argc = nargs;
2493 if (argc > 2) SWIG_fail;
2494 for (ii = 0; (ii < argc); ++ii) {
2495 argv[ii] = args[ii];
2496 }
2497 if (argc == 1) {
2498 int _v = 0;
2499 int res = SWIG_AsCharPtrAndSize(argv[0], 0, NULL, 0);
2500 _v = SWIG_CheckState(res);
2501 if (_v) {
2502 return _wrap_graph__SWIG_0(nargs, args, self);
2503 }
2504 }
2505 if (argc == 2) {
2506 int _v = 0;
2507 void *vptr = 0;
2508 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agraph_t, 0);
2509 _v = SWIG_CheckState(res);
2510 if (_v) {
2511 int res = SWIG_AsCharPtrAndSize(argv[1], 0, NULL, 0);
2512 _v = SWIG_CheckState(res);
2513 if (_v) {
2514 return _wrap_graph__SWIG_1(nargs, args, self);
2515 }
2516 }
2517 }
2518
2519fail:
2520 Ruby_Format_OverloadedError( argc, 2, "graph",
2521 " Agraph_t graph(char *name)\n"
2522 " Agraph_t * graph(Agraph_t *g, char *name)\n");
2523
2524 return Qnil;
2525}
2526
2527
2528SWIGINTERN VALUE
2529_wrap_node(int argc, VALUE *argv, VALUE self) {
2530 Agraph_t *arg1 = (Agraph_t *) 0 ;
2531 char *arg2 = (char *) 0 ;
2532 void *argp1 = 0 ;
2533 int res1 = 0 ;
2534 int res2 ;
2535 char *buf2 = 0 ;
2536 int alloc2 = 0 ;
2537 Agnode_t *result = 0 ;
2538 VALUE vresult = Qnil;
2539
2540 if ((argc < 2) || (argc > 2)) {
2541 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
2542 }
2543 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
2544 if (!SWIG_IsOK(res1)) {
2545 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","node", 1, argv[0] ));
2546 }
2547 arg1 = reinterpret_cast< Agraph_t * >(argp1);
2548 res2 = SWIG_AsCharPtrAndSize(argv[1], &buf2, NULL, &alloc2);
2549 if (!SWIG_IsOK(res2)) {
2550 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "char *","node", 2, argv[1] ));
2551 }
2552 arg2 = reinterpret_cast< char * >(buf2);
2553 result = (Agnode_t *)node(arg1,arg2);
2554 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agnode_t, 0 | 0 );
2555 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
2556 return vresult;
2557fail:
2558 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
2559 return Qnil;
2560}
2561
2562
2563SWIGINTERN VALUE
2564_wrap_edge__SWIG_0(int argc, VALUE *argv, VALUE self) {
2565 Agnode_t *arg1 = (Agnode_t *) 0 ;
2566 Agnode_t *arg2 = (Agnode_t *) 0 ;
2567 void *argp1 = 0 ;
2568 int res1 = 0 ;
2569 void *argp2 = 0 ;
2570 int res2 = 0 ;
2571 Agedge_t *result = 0 ;
2572 VALUE vresult = Qnil;
2573
2574 if ((argc < 2) || (argc > 2)) {
2575 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
2576 }
2577 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agnode_t, 0 | 0 );
2578 if (!SWIG_IsOK(res1)) {
2579 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agnode_t *","edge", 1, argv[0] ));
2580 }
2581 arg1 = reinterpret_cast< Agnode_t * >(argp1);
2582 res2 = SWIG_ConvertPtr(argv[1], &argp2,SWIGTYPE_p_Agnode_t, 0 | 0 );
2583 if (!SWIG_IsOK(res2)) {
2584 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Agnode_t *","edge", 2, argv[1] ));
2585 }
2586 arg2 = reinterpret_cast< Agnode_t * >(argp2);
2587 result = (Agedge_t *)edge(arg1,arg2);
2588 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agedge_t, 0 | 0 );
2589 return vresult;
2590fail:
2591 return Qnil;
2592}
2593
2594
2595SWIGINTERN VALUE
2596_wrap_edge__SWIG_1(int argc, VALUE *argv, VALUE self) {
2597 Agnode_t *arg1 = (Agnode_t *) 0 ;
2598 char *arg2 = (char *) 0 ;
2599 void *argp1 = 0 ;
2600 int res1 = 0 ;
2601 int res2 ;
2602 char *buf2 = 0 ;
2603 int alloc2 = 0 ;
2604 Agedge_t *result = 0 ;
2605 VALUE vresult = Qnil;
2606
2607 if ((argc < 2) || (argc > 2)) {
2608 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
2609 }
2610 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agnode_t, 0 | 0 );
2611 if (!SWIG_IsOK(res1)) {
2612 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agnode_t *","edge", 1, argv[0] ));
2613 }
2614 arg1 = reinterpret_cast< Agnode_t * >(argp1);
2615 res2 = SWIG_AsCharPtrAndSize(argv[1], &buf2, NULL, &alloc2);
2616 if (!SWIG_IsOK(res2)) {
2617 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "char *","edge", 2, argv[1] ));
2618 }
2619 arg2 = reinterpret_cast< char * >(buf2);
2620 result = (Agedge_t *)edge(arg1,arg2);
2621 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agedge_t, 0 | 0 );
2622 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
2623 return vresult;
2624fail:
2625 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
2626 return Qnil;
2627}
2628
2629
2630SWIGINTERN VALUE
2631_wrap_edge__SWIG_2(int argc, VALUE *argv, VALUE self) {
2632 char *arg1 = (char *) 0 ;
2633 Agnode_t *arg2 = (Agnode_t *) 0 ;
2634 int res1 ;
2635 char *buf1 = 0 ;
2636 int alloc1 = 0 ;
2637 void *argp2 = 0 ;
2638 int res2 = 0 ;
2639 Agedge_t *result = 0 ;
2640 VALUE vresult = Qnil;
2641
2642 if ((argc < 2) || (argc > 2)) {
2643 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
2644 }
2645 res1 = SWIG_AsCharPtrAndSize(argv[0], &buf1, NULL, &alloc1);
2646 if (!SWIG_IsOK(res1)) {
2647 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "char *","edge", 1, argv[0] ));
2648 }
2649 arg1 = reinterpret_cast< char * >(buf1);
2650 res2 = SWIG_ConvertPtr(argv[1], &argp2,SWIGTYPE_p_Agnode_t, 0 | 0 );
2651 if (!SWIG_IsOK(res2)) {
2652 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Agnode_t *","edge", 2, argv[1] ));
2653 }
2654 arg2 = reinterpret_cast< Agnode_t * >(argp2);
2655 result = (Agedge_t *)edge(arg1,arg2);
2656 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agedge_t, 0 | 0 );
2657 if (alloc1 == SWIG_NEWOBJ) delete[] buf1;
2658 return vresult;
2659fail:
2660 if (alloc1 == SWIG_NEWOBJ) delete[] buf1;
2661 return Qnil;
2662}
2663
2664
2665SWIGINTERN VALUE
2666_wrap_edge__SWIG_3(int argc, VALUE *argv, VALUE self) {
2667 Agraph_t *arg1 = (Agraph_t *) 0 ;
2668 char *arg2 = (char *) 0 ;
2669 char *arg3 = (char *) 0 ;
2670 void *argp1 = 0 ;
2671 int res1 = 0 ;
2672 int res2 ;
2673 char *buf2 = 0 ;
2674 int alloc2 = 0 ;
2675 int res3 ;
2676 char *buf3 = 0 ;
2677 int alloc3 = 0 ;
2678 Agedge_t *result = 0 ;
2679 VALUE vresult = Qnil;
2680
2681 if ((argc < 3) || (argc > 3)) {
2682 rb_raise(rb_eArgError, "wrong # of arguments(%d for 3)",argc); SWIG_fail;
2683 }
2684 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
2685 if (!SWIG_IsOK(res1)) {
2686 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","edge", 1, argv[0] ));
2687 }
2688 arg1 = reinterpret_cast< Agraph_t * >(argp1);
2689 res2 = SWIG_AsCharPtrAndSize(argv[1], &buf2, NULL, &alloc2);
2690 if (!SWIG_IsOK(res2)) {
2691 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "char *","edge", 2, argv[1] ));
2692 }
2693 arg2 = reinterpret_cast< char * >(buf2);
2694 res3 = SWIG_AsCharPtrAndSize(argv[2], &buf3, NULL, &alloc3);
2695 if (!SWIG_IsOK(res3)) {
2696 SWIG_exception_fail(SWIG_ArgError(res3), Ruby_Format_TypeError( "", "char *","edge", 3, argv[2] ));
2697 }
2698 arg3 = reinterpret_cast< char * >(buf3);
2699 result = (Agedge_t *)edge(arg1,arg2,arg3);
2700 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agedge_t, 0 | 0 );
2701 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
2702 if (alloc3 == SWIG_NEWOBJ) delete[] buf3;
2703 return vresult;
2704fail:
2705 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
2706 if (alloc3 == SWIG_NEWOBJ) delete[] buf3;
2707 return Qnil;
2708}
2709
2710
2711SWIGINTERN VALUE _wrap_edge(int nargs, VALUE *args, VALUE self) {
2712 int argc;
2713 VALUE argv[3];
2714 int ii;
2715
2716 argc = nargs;
2717 if (argc > 3) SWIG_fail;
2718 for (ii = 0; (ii < argc); ++ii) {
2719 argv[ii] = args[ii];
2720 }
2721 if (argc == 2) {
2722 int _v = 0;
2723 void *vptr = 0;
2724 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agnode_t, 0);
2725 _v = SWIG_CheckState(res);
2726 if (_v) {
2727 void *vptr = 0;
2728 int res = SWIG_ConvertPtr(argv[1], &vptr, SWIGTYPE_p_Agnode_t, 0);
2729 _v = SWIG_CheckState(res);
2730 if (_v) {
2731 return _wrap_edge__SWIG_0(nargs, args, self);
2732 }
2733 }
2734 }
2735 if (argc == 2) {
2736 int _v = 0;
2737 void *vptr = 0;
2738 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agnode_t, 0);
2739 _v = SWIG_CheckState(res);
2740 if (_v) {
2741 int res = SWIG_AsCharPtrAndSize(argv[1], 0, NULL, 0);
2742 _v = SWIG_CheckState(res);
2743 if (_v) {
2744 return _wrap_edge__SWIG_1(nargs, args, self);
2745 }
2746 }
2747 }
2748 if (argc == 2) {
2749 int _v = 0;
2750 int res = SWIG_AsCharPtrAndSize(argv[0], 0, NULL, 0);
2751 _v = SWIG_CheckState(res);
2752 if (_v) {
2753 void *vptr = 0;
2754 int res = SWIG_ConvertPtr(argv[1], &vptr, SWIGTYPE_p_Agnode_t, 0);
2755 _v = SWIG_CheckState(res);
2756 if (_v) {
2757 return _wrap_edge__SWIG_2(nargs, args, self);
2758 }
2759 }
2760 }
2761 if (argc == 3) {
2762 int _v = 0;
2763 void *vptr = 0;
2764 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agraph_t, 0);
2765 _v = SWIG_CheckState(res);
2766 if (_v) {
2767 int res = SWIG_AsCharPtrAndSize(argv[1], 0, NULL, 0);
2768 _v = SWIG_CheckState(res);
2769 if (_v) {
2770 int res = SWIG_AsCharPtrAndSize(argv[2], 0, NULL, 0);
2771 _v = SWIG_CheckState(res);
2772 if (_v) {
2773 return _wrap_edge__SWIG_3(nargs, args, self);
2774 }
2775 }
2776 }
2777 }
2778
2779fail:
2780 Ruby_Format_OverloadedError( argc, 3, "edge",
2781 " Agedge_t edge(Agnode_t *t, Agnode_t *h)\n"
2782 " Agedge_t edge(Agnode_t *t, char *hname)\n"
2783 " Agedge_t edge(char *tname, Agnode_t *h)\n"
2784 " Agedge_t * edge(Agraph_t *g, char *tname, char *hname)\n");
2785
2786 return Qnil;
2787}
2788
2789
2790SWIGINTERN VALUE
2791_wrap_setv__SWIG_0(int argc, VALUE *argv, VALUE self) {
2792 Agraph_t *arg1 = (Agraph_t *) 0 ;
2793 char *arg2 = (char *) 0 ;
2794 char *arg3 = (char *) 0 ;
2795 void *argp1 = 0 ;
2796 int res1 = 0 ;
2797 int res2 ;
2798 char *buf2 = 0 ;
2799 int alloc2 = 0 ;
2800 int res3 ;
2801 char *buf3 = 0 ;
2802 int alloc3 = 0 ;
2803 char *result = 0 ;
2804 VALUE vresult = Qnil;
2805
2806 if ((argc < 3) || (argc > 3)) {
2807 rb_raise(rb_eArgError, "wrong # of arguments(%d for 3)",argc); SWIG_fail;
2808 }
2809 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
2810 if (!SWIG_IsOK(res1)) {
2811 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","setv", 1, argv[0] ));
2812 }
2813 arg1 = reinterpret_cast< Agraph_t * >(argp1);
2814 res2 = SWIG_AsCharPtrAndSize(argv[1], &buf2, NULL, &alloc2);
2815 if (!SWIG_IsOK(res2)) {
2816 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "char *","setv", 2, argv[1] ));
2817 }
2818 arg2 = reinterpret_cast< char * >(buf2);
2819 res3 = SWIG_AsCharPtrAndSize(argv[2], &buf3, NULL, &alloc3);
2820 if (!SWIG_IsOK(res3)) {
2821 SWIG_exception_fail(SWIG_ArgError(res3), Ruby_Format_TypeError( "", "char *","setv", 3, argv[2] ));
2822 }
2823 arg3 = reinterpret_cast< char * >(buf3);
2824 result = (char *)setv(arg1,arg2,arg3);
2825 vresult = SWIG_FromCharPtr((const char *)result);
2826 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
2827 if (alloc3 == SWIG_NEWOBJ) delete[] buf3;
2828 return vresult;
2829fail:
2830 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
2831 if (alloc3 == SWIG_NEWOBJ) delete[] buf3;
2832 return Qnil;
2833}
2834
2835
2836SWIGINTERN VALUE
2837_wrap_setv__SWIG_1(int argc, VALUE *argv, VALUE self) {
2838 Agnode_t *arg1 = (Agnode_t *) 0 ;
2839 char *arg2 = (char *) 0 ;
2840 char *arg3 = (char *) 0 ;
2841 void *argp1 = 0 ;
2842 int res1 = 0 ;
2843 int res2 ;
2844 char *buf2 = 0 ;
2845 int alloc2 = 0 ;
2846 int res3 ;
2847 char *buf3 = 0 ;
2848 int alloc3 = 0 ;
2849 char *result = 0 ;
2850 VALUE vresult = Qnil;
2851
2852 if ((argc < 3) || (argc > 3)) {
2853 rb_raise(rb_eArgError, "wrong # of arguments(%d for 3)",argc); SWIG_fail;
2854 }
2855 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agnode_t, 0 | 0 );
2856 if (!SWIG_IsOK(res1)) {
2857 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agnode_t *","setv", 1, argv[0] ));
2858 }
2859 arg1 = reinterpret_cast< Agnode_t * >(argp1);
2860 res2 = SWIG_AsCharPtrAndSize(argv[1], &buf2, NULL, &alloc2);
2861 if (!SWIG_IsOK(res2)) {
2862 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "char *","setv", 2, argv[1] ));
2863 }
2864 arg2 = reinterpret_cast< char * >(buf2);
2865 res3 = SWIG_AsCharPtrAndSize(argv[2], &buf3, NULL, &alloc3);
2866 if (!SWIG_IsOK(res3)) {
2867 SWIG_exception_fail(SWIG_ArgError(res3), Ruby_Format_TypeError( "", "char *","setv", 3, argv[2] ));
2868 }
2869 arg3 = reinterpret_cast< char * >(buf3);
2870 result = (char *)setv(arg1,arg2,arg3);
2871 vresult = SWIG_FromCharPtr((const char *)result);
2872 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
2873 if (alloc3 == SWIG_NEWOBJ) delete[] buf3;
2874 return vresult;
2875fail:
2876 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
2877 if (alloc3 == SWIG_NEWOBJ) delete[] buf3;
2878 return Qnil;
2879}
2880
2881
2882SWIGINTERN VALUE
2883_wrap_setv__SWIG_2(int argc, VALUE *argv, VALUE self) {
2884 Agedge_t *arg1 = (Agedge_t *) 0 ;
2885 char *arg2 = (char *) 0 ;
2886 char *arg3 = (char *) 0 ;
2887 void *argp1 = 0 ;
2888 int res1 = 0 ;
2889 int res2 ;
2890 char *buf2 = 0 ;
2891 int alloc2 = 0 ;
2892 int res3 ;
2893 char *buf3 = 0 ;
2894 int alloc3 = 0 ;
2895 char *result = 0 ;
2896 VALUE vresult = Qnil;
2897
2898 if ((argc < 3) || (argc > 3)) {
2899 rb_raise(rb_eArgError, "wrong # of arguments(%d for 3)",argc); SWIG_fail;
2900 }
2901 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agedge_t, 0 | 0 );
2902 if (!SWIG_IsOK(res1)) {
2903 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agedge_t *","setv", 1, argv[0] ));
2904 }
2905 arg1 = reinterpret_cast< Agedge_t * >(argp1);
2906 res2 = SWIG_AsCharPtrAndSize(argv[1], &buf2, NULL, &alloc2);
2907 if (!SWIG_IsOK(res2)) {
2908 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "char *","setv", 2, argv[1] ));
2909 }
2910 arg2 = reinterpret_cast< char * >(buf2);
2911 res3 = SWIG_AsCharPtrAndSize(argv[2], &buf3, NULL, &alloc3);
2912 if (!SWIG_IsOK(res3)) {
2913 SWIG_exception_fail(SWIG_ArgError(res3), Ruby_Format_TypeError( "", "char *","setv", 3, argv[2] ));
2914 }
2915 arg3 = reinterpret_cast< char * >(buf3);
2916 result = (char *)setv(arg1,arg2,arg3);
2917 vresult = SWIG_FromCharPtr((const char *)result);
2918 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
2919 if (alloc3 == SWIG_NEWOBJ) delete[] buf3;
2920 return vresult;
2921fail:
2922 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
2923 if (alloc3 == SWIG_NEWOBJ) delete[] buf3;
2924 return Qnil;
2925}
2926
2927
2928SWIGINTERN VALUE
2929_wrap_setv__SWIG_3(int argc, VALUE *argv, VALUE self) {
2930 Agraph_t *arg1 = (Agraph_t *) 0 ;
2931 Agsym_t *arg2 = (Agsym_t *) 0 ;
2932 char *arg3 = (char *) 0 ;
2933 void *argp1 = 0 ;
2934 int res1 = 0 ;
2935 void *argp2 = 0 ;
2936 int res2 = 0 ;
2937 int res3 ;
2938 char *buf3 = 0 ;
2939 int alloc3 = 0 ;
2940 char *result = 0 ;
2941 VALUE vresult = Qnil;
2942
2943 if ((argc < 3) || (argc > 3)) {
2944 rb_raise(rb_eArgError, "wrong # of arguments(%d for 3)",argc); SWIG_fail;
2945 }
2946 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
2947 if (!SWIG_IsOK(res1)) {
2948 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","setv", 1, argv[0] ));
2949 }
2950 arg1 = reinterpret_cast< Agraph_t * >(argp1);
2951 res2 = SWIG_ConvertPtr(argv[1], &argp2,SWIGTYPE_p_Agsym_t, 0 | 0 );
2952 if (!SWIG_IsOK(res2)) {
2953 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Agsym_t *","setv", 2, argv[1] ));
2954 }
2955 arg2 = reinterpret_cast< Agsym_t * >(argp2);
2956 res3 = SWIG_AsCharPtrAndSize(argv[2], &buf3, NULL, &alloc3);
2957 if (!SWIG_IsOK(res3)) {
2958 SWIG_exception_fail(SWIG_ArgError(res3), Ruby_Format_TypeError( "", "char *","setv", 3, argv[2] ));
2959 }
2960 arg3 = reinterpret_cast< char * >(buf3);
2961 result = (char *)setv(arg1,arg2,arg3);
2962 vresult = SWIG_FromCharPtr((const char *)result);
2963 if (alloc3 == SWIG_NEWOBJ) delete[] buf3;
2964 return vresult;
2965fail:
2966 if (alloc3 == SWIG_NEWOBJ) delete[] buf3;
2967 return Qnil;
2968}
2969
2970
2971SWIGINTERN VALUE
2972_wrap_setv__SWIG_4(int argc, VALUE *argv, VALUE self) {
2973 Agnode_t *arg1 = (Agnode_t *) 0 ;
2974 Agsym_t *arg2 = (Agsym_t *) 0 ;
2975 char *arg3 = (char *) 0 ;
2976 void *argp1 = 0 ;
2977 int res1 = 0 ;
2978 void *argp2 = 0 ;
2979 int res2 = 0 ;
2980 int res3 ;
2981 char *buf3 = 0 ;
2982 int alloc3 = 0 ;
2983 char *result = 0 ;
2984 VALUE vresult = Qnil;
2985
2986 if ((argc < 3) || (argc > 3)) {
2987 rb_raise(rb_eArgError, "wrong # of arguments(%d for 3)",argc); SWIG_fail;
2988 }
2989 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agnode_t, 0 | 0 );
2990 if (!SWIG_IsOK(res1)) {
2991 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agnode_t *","setv", 1, argv[0] ));
2992 }
2993 arg1 = reinterpret_cast< Agnode_t * >(argp1);
2994 res2 = SWIG_ConvertPtr(argv[1], &argp2,SWIGTYPE_p_Agsym_t, 0 | 0 );
2995 if (!SWIG_IsOK(res2)) {
2996 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Agsym_t *","setv", 2, argv[1] ));
2997 }
2998 arg2 = reinterpret_cast< Agsym_t * >(argp2);
2999 res3 = SWIG_AsCharPtrAndSize(argv[2], &buf3, NULL, &alloc3);
3000 if (!SWIG_IsOK(res3)) {
3001 SWIG_exception_fail(SWIG_ArgError(res3), Ruby_Format_TypeError( "", "char *","setv", 3, argv[2] ));
3002 }
3003 arg3 = reinterpret_cast< char * >(buf3);
3004 result = (char *)setv(arg1,arg2,arg3);
3005 vresult = SWIG_FromCharPtr((const char *)result);
3006 if (alloc3 == SWIG_NEWOBJ) delete[] buf3;
3007 return vresult;
3008fail:
3009 if (alloc3 == SWIG_NEWOBJ) delete[] buf3;
3010 return Qnil;
3011}
3012
3013
3014SWIGINTERN VALUE
3015_wrap_setv__SWIG_5(int argc, VALUE *argv, VALUE self) {
3016 Agedge_t *arg1 = (Agedge_t *) 0 ;
3017 Agsym_t *arg2 = (Agsym_t *) 0 ;
3018 char *arg3 = (char *) 0 ;
3019 void *argp1 = 0 ;
3020 int res1 = 0 ;
3021 void *argp2 = 0 ;
3022 int res2 = 0 ;
3023 int res3 ;
3024 char *buf3 = 0 ;
3025 int alloc3 = 0 ;
3026 char *result = 0 ;
3027 VALUE vresult = Qnil;
3028
3029 if ((argc < 3) || (argc > 3)) {
3030 rb_raise(rb_eArgError, "wrong # of arguments(%d for 3)",argc); SWIG_fail;
3031 }
3032 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agedge_t, 0 | 0 );
3033 if (!SWIG_IsOK(res1)) {
3034 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agedge_t *","setv", 1, argv[0] ));
3035 }
3036 arg1 = reinterpret_cast< Agedge_t * >(argp1);
3037 res2 = SWIG_ConvertPtr(argv[1], &argp2,SWIGTYPE_p_Agsym_t, 0 | 0 );
3038 if (!SWIG_IsOK(res2)) {
3039 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Agsym_t *","setv", 2, argv[1] ));
3040 }
3041 arg2 = reinterpret_cast< Agsym_t * >(argp2);
3042 res3 = SWIG_AsCharPtrAndSize(argv[2], &buf3, NULL, &alloc3);
3043 if (!SWIG_IsOK(res3)) {
3044 SWIG_exception_fail(SWIG_ArgError(res3), Ruby_Format_TypeError( "", "char *","setv", 3, argv[2] ));
3045 }
3046 arg3 = reinterpret_cast< char * >(buf3);
3047 result = (char *)setv(arg1,arg2,arg3);
3048 vresult = SWIG_FromCharPtr((const char *)result);
3049 if (alloc3 == SWIG_NEWOBJ) delete[] buf3;
3050 return vresult;
3051fail:
3052 if (alloc3 == SWIG_NEWOBJ) delete[] buf3;
3053 return Qnil;
3054}
3055
3056
3057SWIGINTERN VALUE _wrap_setv(int nargs, VALUE *args, VALUE self) {
3058 int argc;
3059 VALUE argv[3];
3060 int ii;
3061
3062 argc = nargs;
3063 if (argc > 3) SWIG_fail;
3064 for (ii = 0; (ii < argc); ++ii) {
3065 argv[ii] = args[ii];
3066 }
3067 if (argc == 3) {
3068 int _v = 0;
3069 void *vptr = 0;
3070 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agraph_t, 0);
3071 _v = SWIG_CheckState(res);
3072 if (_v) {
3073 void *vptr = 0;
3074 int res = SWIG_ConvertPtr(argv[1], &vptr, SWIGTYPE_p_Agsym_t, 0);
3075 _v = SWIG_CheckState(res);
3076 if (_v) {
3077 int res = SWIG_AsCharPtrAndSize(argv[2], 0, NULL, 0);
3078 _v = SWIG_CheckState(res);
3079 if (_v) {
3080 return _wrap_setv__SWIG_3(nargs, args, self);
3081 }
3082 }
3083 }
3084 }
3085 if (argc == 3) {
3086 int _v = 0;
3087 void *vptr = 0;
3088 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agnode_t, 0);
3089 _v = SWIG_CheckState(res);
3090 if (_v) {
3091 void *vptr = 0;
3092 int res = SWIG_ConvertPtr(argv[1], &vptr, SWIGTYPE_p_Agsym_t, 0);
3093 _v = SWIG_CheckState(res);
3094 if (_v) {
3095 int res = SWIG_AsCharPtrAndSize(argv[2], 0, NULL, 0);
3096 _v = SWIG_CheckState(res);
3097 if (_v) {
3098 return _wrap_setv__SWIG_4(nargs, args, self);
3099 }
3100 }
3101 }
3102 }
3103 if (argc == 3) {
3104 int _v = 0;
3105 void *vptr = 0;
3106 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agedge_t, 0);
3107 _v = SWIG_CheckState(res);
3108 if (_v) {
3109 void *vptr = 0;
3110 int res = SWIG_ConvertPtr(argv[1], &vptr, SWIGTYPE_p_Agsym_t, 0);
3111 _v = SWIG_CheckState(res);
3112 if (_v) {
3113 int res = SWIG_AsCharPtrAndSize(argv[2], 0, NULL, 0);
3114 _v = SWIG_CheckState(res);
3115 if (_v) {
3116 return _wrap_setv__SWIG_5(nargs, args, self);
3117 }
3118 }
3119 }
3120 }
3121 if (argc == 3) {
3122 int _v = 0;
3123 void *vptr = 0;
3124 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agraph_t, 0);
3125 _v = SWIG_CheckState(res);
3126 if (_v) {
3127 int res = SWIG_AsCharPtrAndSize(argv[1], 0, NULL, 0);
3128 _v = SWIG_CheckState(res);
3129 if (_v) {
3130 int res = SWIG_AsCharPtrAndSize(argv[2], 0, NULL, 0);
3131 _v = SWIG_CheckState(res);
3132 if (_v) {
3133 return _wrap_setv__SWIG_0(nargs, args, self);
3134 }
3135 }
3136 }
3137 }
3138 if (argc == 3) {
3139 int _v = 0;
3140 void *vptr = 0;
3141 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agnode_t, 0);
3142 _v = SWIG_CheckState(res);
3143 if (_v) {
3144 int res = SWIG_AsCharPtrAndSize(argv[1], 0, NULL, 0);
3145 _v = SWIG_CheckState(res);
3146 if (_v) {
3147 int res = SWIG_AsCharPtrAndSize(argv[2], 0, NULL, 0);
3148 _v = SWIG_CheckState(res);
3149 if (_v) {
3150 return _wrap_setv__SWIG_1(nargs, args, self);
3151 }
3152 }
3153 }
3154 }
3155 if (argc == 3) {
3156 int _v = 0;
3157 void *vptr = 0;
3158 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agedge_t, 0);
3159 _v = SWIG_CheckState(res);
3160 if (_v) {
3161 int res = SWIG_AsCharPtrAndSize(argv[1], 0, NULL, 0);
3162 _v = SWIG_CheckState(res);
3163 if (_v) {
3164 int res = SWIG_AsCharPtrAndSize(argv[2], 0, NULL, 0);
3165 _v = SWIG_CheckState(res);
3166 if (_v) {
3167 return _wrap_setv__SWIG_2(nargs, args, self);
3168 }
3169 }
3170 }
3171 }
3172
3173fail:
3174 Ruby_Format_OverloadedError( argc, 3, "setv",
3175 " char setv(Agraph_t *g, char *attr, char *val)\n"
3176 " char setv(Agnode_t *n, char *attr, char *val)\n"
3177 " char setv(Agedge_t *e, char *attr, char *val)\n"
3178 " char setv(Agraph_t *g, Agsym_t *a, char *val)\n"
3179 " char setv(Agnode_t *n, Agsym_t *a, char *val)\n"
3180 " char * setv(Agedge_t *e, Agsym_t *a, char *val)\n");
3181
3182 return Qnil;
3183}
3184
3185
3186SWIGINTERN VALUE
3187_wrap_getv__SWIG_0(int argc, VALUE *argv, VALUE self) {
3188 Agraph_t *arg1 = (Agraph_t *) 0 ;
3189 char *arg2 = (char *) 0 ;
3190 void *argp1 = 0 ;
3191 int res1 = 0 ;
3192 int res2 ;
3193 char *buf2 = 0 ;
3194 int alloc2 = 0 ;
3195 char *result = 0 ;
3196 VALUE vresult = Qnil;
3197
3198 if ((argc < 2) || (argc > 2)) {
3199 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
3200 }
3201 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
3202 if (!SWIG_IsOK(res1)) {
3203 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","getv", 1, argv[0] ));
3204 }
3205 arg1 = reinterpret_cast< Agraph_t * >(argp1);
3206 res2 = SWIG_AsCharPtrAndSize(argv[1], &buf2, NULL, &alloc2);
3207 if (!SWIG_IsOK(res2)) {
3208 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "char *","getv", 2, argv[1] ));
3209 }
3210 arg2 = reinterpret_cast< char * >(buf2);
3211 result = (char *)getv(arg1,arg2);
3212 vresult = SWIG_FromCharPtr((const char *)result);
3213 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
3214 return vresult;
3215fail:
3216 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
3217 return Qnil;
3218}
3219
3220
3221SWIGINTERN VALUE
3222_wrap_getv__SWIG_1(int argc, VALUE *argv, VALUE self) {
3223 Agnode_t *arg1 = (Agnode_t *) 0 ;
3224 char *arg2 = (char *) 0 ;
3225 void *argp1 = 0 ;
3226 int res1 = 0 ;
3227 int res2 ;
3228 char *buf2 = 0 ;
3229 int alloc2 = 0 ;
3230 char *result = 0 ;
3231 VALUE vresult = Qnil;
3232
3233 if ((argc < 2) || (argc > 2)) {
3234 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
3235 }
3236 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agnode_t, 0 | 0 );
3237 if (!SWIG_IsOK(res1)) {
3238 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agnode_t *","getv", 1, argv[0] ));
3239 }
3240 arg1 = reinterpret_cast< Agnode_t * >(argp1);
3241 res2 = SWIG_AsCharPtrAndSize(argv[1], &buf2, NULL, &alloc2);
3242 if (!SWIG_IsOK(res2)) {
3243 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "char *","getv", 2, argv[1] ));
3244 }
3245 arg2 = reinterpret_cast< char * >(buf2);
3246 result = (char *)getv(arg1,arg2);
3247 vresult = SWIG_FromCharPtr((const char *)result);
3248 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
3249 return vresult;
3250fail:
3251 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
3252 return Qnil;
3253}
3254
3255
3256SWIGINTERN VALUE
3257_wrap_getv__SWIG_2(int argc, VALUE *argv, VALUE self) {
3258 Agedge_t *arg1 = (Agedge_t *) 0 ;
3259 char *arg2 = (char *) 0 ;
3260 void *argp1 = 0 ;
3261 int res1 = 0 ;
3262 int res2 ;
3263 char *buf2 = 0 ;
3264 int alloc2 = 0 ;
3265 char *result = 0 ;
3266 VALUE vresult = Qnil;
3267
3268 if ((argc < 2) || (argc > 2)) {
3269 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
3270 }
3271 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agedge_t, 0 | 0 );
3272 if (!SWIG_IsOK(res1)) {
3273 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agedge_t *","getv", 1, argv[0] ));
3274 }
3275 arg1 = reinterpret_cast< Agedge_t * >(argp1);
3276 res2 = SWIG_AsCharPtrAndSize(argv[1], &buf2, NULL, &alloc2);
3277 if (!SWIG_IsOK(res2)) {
3278 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "char *","getv", 2, argv[1] ));
3279 }
3280 arg2 = reinterpret_cast< char * >(buf2);
3281 result = (char *)getv(arg1,arg2);
3282 vresult = SWIG_FromCharPtr((const char *)result);
3283 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
3284 return vresult;
3285fail:
3286 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
3287 return Qnil;
3288}
3289
3290
3291SWIGINTERN VALUE
3292_wrap_getv__SWIG_3(int argc, VALUE *argv, VALUE self) {
3293 Agraph_t *arg1 = (Agraph_t *) 0 ;
3294 Agsym_t *arg2 = (Agsym_t *) 0 ;
3295 void *argp1 = 0 ;
3296 int res1 = 0 ;
3297 void *argp2 = 0 ;
3298 int res2 = 0 ;
3299 char *result = 0 ;
3300 VALUE vresult = Qnil;
3301
3302 if ((argc < 2) || (argc > 2)) {
3303 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
3304 }
3305 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
3306 if (!SWIG_IsOK(res1)) {
3307 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","getv", 1, argv[0] ));
3308 }
3309 arg1 = reinterpret_cast< Agraph_t * >(argp1);
3310 res2 = SWIG_ConvertPtr(argv[1], &argp2,SWIGTYPE_p_Agsym_t, 0 | 0 );
3311 if (!SWIG_IsOK(res2)) {
3312 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Agsym_t *","getv", 2, argv[1] ));
3313 }
3314 arg2 = reinterpret_cast< Agsym_t * >(argp2);
3315 result = (char *)getv(arg1,arg2);
3316 vresult = SWIG_FromCharPtr((const char *)result);
3317 return vresult;
3318fail:
3319 return Qnil;
3320}
3321
3322
3323SWIGINTERN VALUE
3324_wrap_getv__SWIG_4(int argc, VALUE *argv, VALUE self) {
3325 Agnode_t *arg1 = (Agnode_t *) 0 ;
3326 Agsym_t *arg2 = (Agsym_t *) 0 ;
3327 void *argp1 = 0 ;
3328 int res1 = 0 ;
3329 void *argp2 = 0 ;
3330 int res2 = 0 ;
3331 char *result = 0 ;
3332 VALUE vresult = Qnil;
3333
3334 if ((argc < 2) || (argc > 2)) {
3335 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
3336 }
3337 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agnode_t, 0 | 0 );
3338 if (!SWIG_IsOK(res1)) {
3339 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agnode_t *","getv", 1, argv[0] ));
3340 }
3341 arg1 = reinterpret_cast< Agnode_t * >(argp1);
3342 res2 = SWIG_ConvertPtr(argv[1], &argp2,SWIGTYPE_p_Agsym_t, 0 | 0 );
3343 if (!SWIG_IsOK(res2)) {
3344 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Agsym_t *","getv", 2, argv[1] ));
3345 }
3346 arg2 = reinterpret_cast< Agsym_t * >(argp2);
3347 result = (char *)getv(arg1,arg2);
3348 vresult = SWIG_FromCharPtr((const char *)result);
3349 return vresult;
3350fail:
3351 return Qnil;
3352}
3353
3354
3355SWIGINTERN VALUE
3356_wrap_getv__SWIG_5(int argc, VALUE *argv, VALUE self) {
3357 Agedge_t *arg1 = (Agedge_t *) 0 ;
3358 Agsym_t *arg2 = (Agsym_t *) 0 ;
3359 void *argp1 = 0 ;
3360 int res1 = 0 ;
3361 void *argp2 = 0 ;
3362 int res2 = 0 ;
3363 char *result = 0 ;
3364 VALUE vresult = Qnil;
3365
3366 if ((argc < 2) || (argc > 2)) {
3367 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
3368 }
3369 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agedge_t, 0 | 0 );
3370 if (!SWIG_IsOK(res1)) {
3371 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agedge_t *","getv", 1, argv[0] ));
3372 }
3373 arg1 = reinterpret_cast< Agedge_t * >(argp1);
3374 res2 = SWIG_ConvertPtr(argv[1], &argp2,SWIGTYPE_p_Agsym_t, 0 | 0 );
3375 if (!SWIG_IsOK(res2)) {
3376 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Agsym_t *","getv", 2, argv[1] ));
3377 }
3378 arg2 = reinterpret_cast< Agsym_t * >(argp2);
3379 result = (char *)getv(arg1,arg2);
3380 vresult = SWIG_FromCharPtr((const char *)result);
3381 return vresult;
3382fail:
3383 return Qnil;
3384}
3385
3386
3387SWIGINTERN VALUE _wrap_getv(int nargs, VALUE *args, VALUE self) {
3388 int argc;
3389 VALUE argv[2];
3390 int ii;
3391
3392 argc = nargs;
3393 if (argc > 2) SWIG_fail;
3394 for (ii = 0; (ii < argc); ++ii) {
3395 argv[ii] = args[ii];
3396 }
3397 if (argc == 2) {
3398 int _v = 0;
3399 void *vptr = 0;
3400 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agraph_t, 0);
3401 _v = SWIG_CheckState(res);
3402 if (_v) {
3403 void *vptr = 0;
3404 int res = SWIG_ConvertPtr(argv[1], &vptr, SWIGTYPE_p_Agsym_t, 0);
3405 _v = SWIG_CheckState(res);
3406 if (_v) {
3407 return _wrap_getv__SWIG_3(nargs, args, self);
3408 }
3409 }
3410 }
3411 if (argc == 2) {
3412 int _v = 0;
3413 void *vptr = 0;
3414 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agnode_t, 0);
3415 _v = SWIG_CheckState(res);
3416 if (_v) {
3417 void *vptr = 0;
3418 int res = SWIG_ConvertPtr(argv[1], &vptr, SWIGTYPE_p_Agsym_t, 0);
3419 _v = SWIG_CheckState(res);
3420 if (_v) {
3421 return _wrap_getv__SWIG_4(nargs, args, self);
3422 }
3423 }
3424 }
3425 if (argc == 2) {
3426 int _v = 0;
3427 void *vptr = 0;
3428 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agedge_t, 0);
3429 _v = SWIG_CheckState(res);
3430 if (_v) {
3431 void *vptr = 0;
3432 int res = SWIG_ConvertPtr(argv[1], &vptr, SWIGTYPE_p_Agsym_t, 0);
3433 _v = SWIG_CheckState(res);
3434 if (_v) {
3435 return _wrap_getv__SWIG_5(nargs, args, self);
3436 }
3437 }
3438 }
3439 if (argc == 2) {
3440 int _v = 0;
3441 void *vptr = 0;
3442 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agraph_t, 0);
3443 _v = SWIG_CheckState(res);
3444 if (_v) {
3445 int res = SWIG_AsCharPtrAndSize(argv[1], 0, NULL, 0);
3446 _v = SWIG_CheckState(res);
3447 if (_v) {
3448 return _wrap_getv__SWIG_0(nargs, args, self);
3449 }
3450 }
3451 }
3452 if (argc == 2) {
3453 int _v = 0;
3454 void *vptr = 0;
3455 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agnode_t, 0);
3456 _v = SWIG_CheckState(res);
3457 if (_v) {
3458 int res = SWIG_AsCharPtrAndSize(argv[1], 0, NULL, 0);
3459 _v = SWIG_CheckState(res);
3460 if (_v) {
3461 return _wrap_getv__SWIG_1(nargs, args, self);
3462 }
3463 }
3464 }
3465 if (argc == 2) {
3466 int _v = 0;
3467 void *vptr = 0;
3468 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agedge_t, 0);
3469 _v = SWIG_CheckState(res);
3470 if (_v) {
3471 int res = SWIG_AsCharPtrAndSize(argv[1], 0, NULL, 0);
3472 _v = SWIG_CheckState(res);
3473 if (_v) {
3474 return _wrap_getv__SWIG_2(nargs, args, self);
3475 }
3476 }
3477 }
3478
3479fail:
3480 Ruby_Format_OverloadedError( argc, 2, "getv",
3481 " char getv(Agraph_t *g, char *attr)\n"
3482 " char getv(Agnode_t *n, char *attr)\n"
3483 " char getv(Agedge_t *e, char *attr)\n"
3484 " char getv(Agraph_t *g, Agsym_t *a)\n"
3485 " char getv(Agnode_t *n, Agsym_t *a)\n"
3486 " char * getv(Agedge_t *e, Agsym_t *a)\n");
3487
3488 return Qnil;
3489}
3490
3491
3492SWIGINTERN VALUE
3493_wrap_nameof__SWIG_0(int argc, VALUE *argv, VALUE self) {
3494 Agraph_t *arg1 = (Agraph_t *) 0 ;
3495 void *argp1 = 0 ;
3496 int res1 = 0 ;
3497 char *result = 0 ;
3498 VALUE vresult = Qnil;
3499
3500 if ((argc < 1) || (argc > 1)) {
3501 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
3502 }
3503 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
3504 if (!SWIG_IsOK(res1)) {
3505 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","nameof", 1, argv[0] ));
3506 }
3507 arg1 = reinterpret_cast< Agraph_t * >(argp1);
3508 result = (char *)nameof(arg1);
3509 vresult = SWIG_FromCharPtr((const char *)result);
3510 return vresult;
3511fail:
3512 return Qnil;
3513}
3514
3515
3516SWIGINTERN VALUE
3517_wrap_nameof__SWIG_1(int argc, VALUE *argv, VALUE self) {
3518 Agnode_t *arg1 = (Agnode_t *) 0 ;
3519 void *argp1 = 0 ;
3520 int res1 = 0 ;
3521 char *result = 0 ;
3522 VALUE vresult = Qnil;
3523
3524 if ((argc < 1) || (argc > 1)) {
3525 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
3526 }
3527 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agnode_t, 0 | 0 );
3528 if (!SWIG_IsOK(res1)) {
3529 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agnode_t *","nameof", 1, argv[0] ));
3530 }
3531 arg1 = reinterpret_cast< Agnode_t * >(argp1);
3532 result = (char *)nameof(arg1);
3533 vresult = SWIG_FromCharPtr((const char *)result);
3534 return vresult;
3535fail:
3536 return Qnil;
3537}
3538
3539
3540SWIGINTERN VALUE
3541_wrap_nameof__SWIG_2(int argc, VALUE *argv, VALUE self) {
3542 Agsym_t *arg1 = (Agsym_t *) 0 ;
3543 void *argp1 = 0 ;
3544 int res1 = 0 ;
3545 char *result = 0 ;
3546 VALUE vresult = Qnil;
3547
3548 if ((argc < 1) || (argc > 1)) {
3549 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
3550 }
3551 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agsym_t, 0 | 0 );
3552 if (!SWIG_IsOK(res1)) {
3553 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agsym_t *","nameof", 1, argv[0] ));
3554 }
3555 arg1 = reinterpret_cast< Agsym_t * >(argp1);
3556 result = (char *)nameof(arg1);
3557 vresult = SWIG_FromCharPtr((const char *)result);
3558 return vresult;
3559fail:
3560 return Qnil;
3561}
3562
3563
3564SWIGINTERN VALUE _wrap_nameof(int nargs, VALUE *args, VALUE self) {
3565 int argc;
3566 VALUE argv[1];
3567 int ii;
3568
3569 argc = nargs;
3570 if (argc > 1) SWIG_fail;
3571 for (ii = 0; (ii < argc); ++ii) {
3572 argv[ii] = args[ii];
3573 }
3574 if (argc == 1) {
3575 int _v = 0;
3576 void *vptr = 0;
3577 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agraph_t, 0);
3578 _v = SWIG_CheckState(res);
3579 if (_v) {
3580 return _wrap_nameof__SWIG_0(nargs, args, self);
3581 }
3582 }
3583 if (argc == 1) {
3584 int _v = 0;
3585 void *vptr = 0;
3586 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agnode_t, 0);
3587 _v = SWIG_CheckState(res);
3588 if (_v) {
3589 return _wrap_nameof__SWIG_1(nargs, args, self);
3590 }
3591 }
3592 if (argc == 1) {
3593 int _v = 0;
3594 void *vptr = 0;
3595 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agsym_t, 0);
3596 _v = SWIG_CheckState(res);
3597 if (_v) {
3598 return _wrap_nameof__SWIG_2(nargs, args, self);
3599 }
3600 }
3601
3602fail:
3603 Ruby_Format_OverloadedError( argc, 1, "nameof",
3604 " char nameof(Agraph_t *g)\n"
3605 " char nameof(Agnode_t *n)\n"
3606 " char * nameof(Agsym_t *a)\n");
3607
3608 return Qnil;
3609}
3610
3611
3612SWIGINTERN VALUE
3613_wrap_findsubg(int argc, VALUE *argv, VALUE self) {
3614 Agraph_t *arg1 = (Agraph_t *) 0 ;
3615 char *arg2 = (char *) 0 ;
3616 void *argp1 = 0 ;
3617 int res1 = 0 ;
3618 int res2 ;
3619 char *buf2 = 0 ;
3620 int alloc2 = 0 ;
3621 Agraph_t *result = 0 ;
3622 VALUE vresult = Qnil;
3623
3624 if ((argc < 2) || (argc > 2)) {
3625 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
3626 }
3627 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
3628 if (!SWIG_IsOK(res1)) {
3629 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","findsubg", 1, argv[0] ));
3630 }
3631 arg1 = reinterpret_cast< Agraph_t * >(argp1);
3632 res2 = SWIG_AsCharPtrAndSize(argv[1], &buf2, NULL, &alloc2);
3633 if (!SWIG_IsOK(res2)) {
3634 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "char *","findsubg", 2, argv[1] ));
3635 }
3636 arg2 = reinterpret_cast< char * >(buf2);
3637 result = (Agraph_t *)findsubg(arg1,arg2);
3638 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agraph_t, 0 | 0 );
3639 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
3640 return vresult;
3641fail:
3642 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
3643 return Qnil;
3644}
3645
3646
3647SWIGINTERN VALUE
3648_wrap_findnode(int argc, VALUE *argv, VALUE self) {
3649 Agraph_t *arg1 = (Agraph_t *) 0 ;
3650 char *arg2 = (char *) 0 ;
3651 void *argp1 = 0 ;
3652 int res1 = 0 ;
3653 int res2 ;
3654 char *buf2 = 0 ;
3655 int alloc2 = 0 ;
3656 Agnode_t *result = 0 ;
3657 VALUE vresult = Qnil;
3658
3659 if ((argc < 2) || (argc > 2)) {
3660 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
3661 }
3662 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
3663 if (!SWIG_IsOK(res1)) {
3664 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","findnode", 1, argv[0] ));
3665 }
3666 arg1 = reinterpret_cast< Agraph_t * >(argp1);
3667 res2 = SWIG_AsCharPtrAndSize(argv[1], &buf2, NULL, &alloc2);
3668 if (!SWIG_IsOK(res2)) {
3669 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "char *","findnode", 2, argv[1] ));
3670 }
3671 arg2 = reinterpret_cast< char * >(buf2);
3672 result = (Agnode_t *)findnode(arg1,arg2);
3673 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agnode_t, 0 | 0 );
3674 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
3675 return vresult;
3676fail:
3677 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
3678 return Qnil;
3679}
3680
3681
3682SWIGINTERN VALUE
3683_wrap_findedge(int argc, VALUE *argv, VALUE self) {
3684 Agnode_t *arg1 = (Agnode_t *) 0 ;
3685 Agnode_t *arg2 = (Agnode_t *) 0 ;
3686 void *argp1 = 0 ;
3687 int res1 = 0 ;
3688 void *argp2 = 0 ;
3689 int res2 = 0 ;
3690 Agedge_t *result = 0 ;
3691 VALUE vresult = Qnil;
3692
3693 if ((argc < 2) || (argc > 2)) {
3694 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
3695 }
3696 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agnode_t, 0 | 0 );
3697 if (!SWIG_IsOK(res1)) {
3698 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agnode_t *","findedge", 1, argv[0] ));
3699 }
3700 arg1 = reinterpret_cast< Agnode_t * >(argp1);
3701 res2 = SWIG_ConvertPtr(argv[1], &argp2,SWIGTYPE_p_Agnode_t, 0 | 0 );
3702 if (!SWIG_IsOK(res2)) {
3703 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Agnode_t *","findedge", 2, argv[1] ));
3704 }
3705 arg2 = reinterpret_cast< Agnode_t * >(argp2);
3706 result = (Agedge_t *)findedge(arg1,arg2);
3707 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agedge_t, 0 | 0 );
3708 return vresult;
3709fail:
3710 return Qnil;
3711}
3712
3713
3714SWIGINTERN VALUE
3715_wrap_findattr__SWIG_0(int argc, VALUE *argv, VALUE self) {
3716 Agraph_t *arg1 = (Agraph_t *) 0 ;
3717 char *arg2 = (char *) 0 ;
3718 void *argp1 = 0 ;
3719 int res1 = 0 ;
3720 int res2 ;
3721 char *buf2 = 0 ;
3722 int alloc2 = 0 ;
3723 Agsym_t *result = 0 ;
3724 VALUE vresult = Qnil;
3725
3726 if ((argc < 2) || (argc > 2)) {
3727 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
3728 }
3729 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
3730 if (!SWIG_IsOK(res1)) {
3731 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","findattr", 1, argv[0] ));
3732 }
3733 arg1 = reinterpret_cast< Agraph_t * >(argp1);
3734 res2 = SWIG_AsCharPtrAndSize(argv[1], &buf2, NULL, &alloc2);
3735 if (!SWIG_IsOK(res2)) {
3736 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "char *","findattr", 2, argv[1] ));
3737 }
3738 arg2 = reinterpret_cast< char * >(buf2);
3739 result = (Agsym_t *)findattr(arg1,arg2);
3740 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agsym_t, 0 | 0 );
3741 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
3742 return vresult;
3743fail:
3744 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
3745 return Qnil;
3746}
3747
3748
3749SWIGINTERN VALUE
3750_wrap_findattr__SWIG_1(int argc, VALUE *argv, VALUE self) {
3751 Agnode_t *arg1 = (Agnode_t *) 0 ;
3752 char *arg2 = (char *) 0 ;
3753 void *argp1 = 0 ;
3754 int res1 = 0 ;
3755 int res2 ;
3756 char *buf2 = 0 ;
3757 int alloc2 = 0 ;
3758 Agsym_t *result = 0 ;
3759 VALUE vresult = Qnil;
3760
3761 if ((argc < 2) || (argc > 2)) {
3762 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
3763 }
3764 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agnode_t, 0 | 0 );
3765 if (!SWIG_IsOK(res1)) {
3766 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agnode_t *","findattr", 1, argv[0] ));
3767 }
3768 arg1 = reinterpret_cast< Agnode_t * >(argp1);
3769 res2 = SWIG_AsCharPtrAndSize(argv[1], &buf2, NULL, &alloc2);
3770 if (!SWIG_IsOK(res2)) {
3771 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "char *","findattr", 2, argv[1] ));
3772 }
3773 arg2 = reinterpret_cast< char * >(buf2);
3774 result = (Agsym_t *)findattr(arg1,arg2);
3775 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agsym_t, 0 | 0 );
3776 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
3777 return vresult;
3778fail:
3779 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
3780 return Qnil;
3781}
3782
3783
3784SWIGINTERN VALUE
3785_wrap_findattr__SWIG_2(int argc, VALUE *argv, VALUE self) {
3786 Agedge_t *arg1 = (Agedge_t *) 0 ;
3787 char *arg2 = (char *) 0 ;
3788 void *argp1 = 0 ;
3789 int res1 = 0 ;
3790 int res2 ;
3791 char *buf2 = 0 ;
3792 int alloc2 = 0 ;
3793 Agsym_t *result = 0 ;
3794 VALUE vresult = Qnil;
3795
3796 if ((argc < 2) || (argc > 2)) {
3797 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
3798 }
3799 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agedge_t, 0 | 0 );
3800 if (!SWIG_IsOK(res1)) {
3801 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agedge_t *","findattr", 1, argv[0] ));
3802 }
3803 arg1 = reinterpret_cast< Agedge_t * >(argp1);
3804 res2 = SWIG_AsCharPtrAndSize(argv[1], &buf2, NULL, &alloc2);
3805 if (!SWIG_IsOK(res2)) {
3806 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "char *","findattr", 2, argv[1] ));
3807 }
3808 arg2 = reinterpret_cast< char * >(buf2);
3809 result = (Agsym_t *)findattr(arg1,arg2);
3810 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agsym_t, 0 | 0 );
3811 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
3812 return vresult;
3813fail:
3814 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
3815 return Qnil;
3816}
3817
3818
3819SWIGINTERN VALUE _wrap_findattr(int nargs, VALUE *args, VALUE self) {
3820 int argc;
3821 VALUE argv[2];
3822 int ii;
3823
3824 argc = nargs;
3825 if (argc > 2) SWIG_fail;
3826 for (ii = 0; (ii < argc); ++ii) {
3827 argv[ii] = args[ii];
3828 }
3829 if (argc == 2) {
3830 int _v = 0;
3831 void *vptr = 0;
3832 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agraph_t, 0);
3833 _v = SWIG_CheckState(res);
3834 if (_v) {
3835 int res = SWIG_AsCharPtrAndSize(argv[1], 0, NULL, 0);
3836 _v = SWIG_CheckState(res);
3837 if (_v) {
3838 return _wrap_findattr__SWIG_0(nargs, args, self);
3839 }
3840 }
3841 }
3842 if (argc == 2) {
3843 int _v = 0;
3844 void *vptr = 0;
3845 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agnode_t, 0);
3846 _v = SWIG_CheckState(res);
3847 if (_v) {
3848 int res = SWIG_AsCharPtrAndSize(argv[1], 0, NULL, 0);
3849 _v = SWIG_CheckState(res);
3850 if (_v) {
3851 return _wrap_findattr__SWIG_1(nargs, args, self);
3852 }
3853 }
3854 }
3855 if (argc == 2) {
3856 int _v = 0;
3857 void *vptr = 0;
3858 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agedge_t, 0);
3859 _v = SWIG_CheckState(res);
3860 if (_v) {
3861 int res = SWIG_AsCharPtrAndSize(argv[1], 0, NULL, 0);
3862 _v = SWIG_CheckState(res);
3863 if (_v) {
3864 return _wrap_findattr__SWIG_2(nargs, args, self);
3865 }
3866 }
3867 }
3868
3869fail:
3870 Ruby_Format_OverloadedError( argc, 2, "findattr",
3871 " Agsym_t findattr(Agraph_t *g, char *name)\n"
3872 " Agsym_t findattr(Agnode_t *n, char *name)\n"
3873 " Agsym_t * findattr(Agedge_t *e, char *name)\n");
3874
3875 return Qnil;
3876}
3877
3878
3879SWIGINTERN VALUE
3880_wrap_headof(int argc, VALUE *argv, VALUE self) {
3881 Agedge_t *arg1 = (Agedge_t *) 0 ;
3882 void *argp1 = 0 ;
3883 int res1 = 0 ;
3884 Agnode_t *result = 0 ;
3885 VALUE vresult = Qnil;
3886
3887 if ((argc < 1) || (argc > 1)) {
3888 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
3889 }
3890 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agedge_t, 0 | 0 );
3891 if (!SWIG_IsOK(res1)) {
3892 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agedge_t *","headof", 1, argv[0] ));
3893 }
3894 arg1 = reinterpret_cast< Agedge_t * >(argp1);
3895 result = (Agnode_t *)headof(arg1);
3896 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agnode_t, 0 | 0 );
3897 return vresult;
3898fail:
3899 return Qnil;
3900}
3901
3902
3903SWIGINTERN VALUE
3904_wrap_tailof(int argc, VALUE *argv, VALUE self) {
3905 Agedge_t *arg1 = (Agedge_t *) 0 ;
3906 void *argp1 = 0 ;
3907 int res1 = 0 ;
3908 Agnode_t *result = 0 ;
3909 VALUE vresult = Qnil;
3910
3911 if ((argc < 1) || (argc > 1)) {
3912 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
3913 }
3914 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agedge_t, 0 | 0 );
3915 if (!SWIG_IsOK(res1)) {
3916 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agedge_t *","tailof", 1, argv[0] ));
3917 }
3918 arg1 = reinterpret_cast< Agedge_t * >(argp1);
3919 result = (Agnode_t *)tailof(arg1);
3920 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agnode_t, 0 | 0 );
3921 return vresult;
3922fail:
3923 return Qnil;
3924}
3925
3926
3927SWIGINTERN VALUE
3928_wrap_graphof__SWIG_0(int argc, VALUE *argv, VALUE self) {
3929 Agraph_t *arg1 = (Agraph_t *) 0 ;
3930 void *argp1 = 0 ;
3931 int res1 = 0 ;
3932 Agraph_t *result = 0 ;
3933 VALUE vresult = Qnil;
3934
3935 if ((argc < 1) || (argc > 1)) {
3936 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
3937 }
3938 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
3939 if (!SWIG_IsOK(res1)) {
3940 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","graphof", 1, argv[0] ));
3941 }
3942 arg1 = reinterpret_cast< Agraph_t * >(argp1);
3943 result = (Agraph_t *)graphof(arg1);
3944 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agraph_t, 0 | 0 );
3945 return vresult;
3946fail:
3947 return Qnil;
3948}
3949
3950
3951SWIGINTERN VALUE
3952_wrap_graphof__SWIG_1(int argc, VALUE *argv, VALUE self) {
3953 Agedge_t *arg1 = (Agedge_t *) 0 ;
3954 void *argp1 = 0 ;
3955 int res1 = 0 ;
3956 Agraph_t *result = 0 ;
3957 VALUE vresult = Qnil;
3958
3959 if ((argc < 1) || (argc > 1)) {
3960 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
3961 }
3962 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agedge_t, 0 | 0 );
3963 if (!SWIG_IsOK(res1)) {
3964 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agedge_t *","graphof", 1, argv[0] ));
3965 }
3966 arg1 = reinterpret_cast< Agedge_t * >(argp1);
3967 result = (Agraph_t *)graphof(arg1);
3968 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agraph_t, 0 | 0 );
3969 return vresult;
3970fail:
3971 return Qnil;
3972}
3973
3974
3975SWIGINTERN VALUE
3976_wrap_graphof__SWIG_2(int argc, VALUE *argv, VALUE self) {
3977 Agnode_t *arg1 = (Agnode_t *) 0 ;
3978 void *argp1 = 0 ;
3979 int res1 = 0 ;
3980 Agraph_t *result = 0 ;
3981 VALUE vresult = Qnil;
3982
3983 if ((argc < 1) || (argc > 1)) {
3984 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
3985 }
3986 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agnode_t, 0 | 0 );
3987 if (!SWIG_IsOK(res1)) {
3988 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agnode_t *","graphof", 1, argv[0] ));
3989 }
3990 arg1 = reinterpret_cast< Agnode_t * >(argp1);
3991 result = (Agraph_t *)graphof(arg1);
3992 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agraph_t, 0 | 0 );
3993 return vresult;
3994fail:
3995 return Qnil;
3996}
3997
3998
3999SWIGINTERN VALUE _wrap_graphof(int nargs, VALUE *args, VALUE self) {
4000 int argc;
4001 VALUE argv[1];
4002 int ii;
4003
4004 argc = nargs;
4005 if (argc > 1) SWIG_fail;
4006 for (ii = 0; (ii < argc); ++ii) {
4007 argv[ii] = args[ii];
4008 }
4009 if (argc == 1) {
4010 int _v = 0;
4011 void *vptr = 0;
4012 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agraph_t, 0);
4013 _v = SWIG_CheckState(res);
4014 if (_v) {
4015 return _wrap_graphof__SWIG_0(nargs, args, self);
4016 }
4017 }
4018 if (argc == 1) {
4019 int _v = 0;
4020 void *vptr = 0;
4021 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agedge_t, 0);
4022 _v = SWIG_CheckState(res);
4023 if (_v) {
4024 return _wrap_graphof__SWIG_1(nargs, args, self);
4025 }
4026 }
4027 if (argc == 1) {
4028 int _v = 0;
4029 void *vptr = 0;
4030 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agnode_t, 0);
4031 _v = SWIG_CheckState(res);
4032 if (_v) {
4033 return _wrap_graphof__SWIG_2(nargs, args, self);
4034 }
4035 }
4036
4037fail:
4038 Ruby_Format_OverloadedError( argc, 1, "graphof",
4039 " Agraph_t graphof(Agraph_t *g)\n"
4040 " Agraph_t graphof(Agedge_t *e)\n"
4041 " Agraph_t * graphof(Agnode_t *n)\n");
4042
4043 return Qnil;
4044}
4045
4046
4047SWIGINTERN VALUE
4048_wrap_rootof(int argc, VALUE *argv, VALUE self) {
4049 Agraph_t *arg1 = (Agraph_t *) 0 ;
4050 void *argp1 = 0 ;
4051 int res1 = 0 ;
4052 Agraph_t *result = 0 ;
4053 VALUE vresult = Qnil;
4054
4055 if ((argc < 1) || (argc > 1)) {
4056 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
4057 }
4058 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
4059 if (!SWIG_IsOK(res1)) {
4060 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","rootof", 1, argv[0] ));
4061 }
4062 arg1 = reinterpret_cast< Agraph_t * >(argp1);
4063 result = (Agraph_t *)rootof(arg1);
4064 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agraph_t, 0 | 0 );
4065 return vresult;
4066fail:
4067 return Qnil;
4068}
4069
4070
4071SWIGINTERN VALUE
4072_wrap_protonode(int argc, VALUE *argv, VALUE self) {
4073 Agraph_t *arg1 = (Agraph_t *) 0 ;
4074 void *argp1 = 0 ;
4075 int res1 = 0 ;
4076 Agnode_t *result = 0 ;
4077 VALUE vresult = Qnil;
4078
4079 if ((argc < 1) || (argc > 1)) {
4080 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
4081 }
4082 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
4083 if (!SWIG_IsOK(res1)) {
4084 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","protonode", 1, argv[0] ));
4085 }
4086 arg1 = reinterpret_cast< Agraph_t * >(argp1);
4087 result = (Agnode_t *)protonode(arg1);
4088 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agnode_t, 0 | 0 );
4089 return vresult;
4090fail:
4091 return Qnil;
4092}
4093
4094
4095SWIGINTERN VALUE
4096_wrap_protoedge(int argc, VALUE *argv, VALUE self) {
4097 Agraph_t *arg1 = (Agraph_t *) 0 ;
4098 void *argp1 = 0 ;
4099 int res1 = 0 ;
4100 Agedge_t *result = 0 ;
4101 VALUE vresult = Qnil;
4102
4103 if ((argc < 1) || (argc > 1)) {
4104 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
4105 }
4106 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
4107 if (!SWIG_IsOK(res1)) {
4108 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","protoedge", 1, argv[0] ));
4109 }
4110 arg1 = reinterpret_cast< Agraph_t * >(argp1);
4111 result = (Agedge_t *)protoedge(arg1);
4112 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agedge_t, 0 | 0 );
4113 return vresult;
4114fail:
4115 return Qnil;
4116}
4117
4118
4119SWIGINTERN VALUE
4120_wrap_ok__SWIG_0(int argc, VALUE *argv, VALUE self) {
4121 Agraph_t *arg1 = (Agraph_t *) 0 ;
4122 void *argp1 = 0 ;
4123 int res1 = 0 ;
4124 bool result;
4125 VALUE vresult = Qnil;
4126
4127 if ((argc < 1) || (argc > 1)) {
4128 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
4129 }
4130 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
4131 if (!SWIG_IsOK(res1)) {
4132 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","ok", 1, argv[0] ));
4133 }
4134 arg1 = reinterpret_cast< Agraph_t * >(argp1);
4135 result = (bool)ok(arg1);
4136 vresult = SWIG_From_bool(static_cast< bool >(result));
4137 return vresult;
4138fail:
4139 return Qnil;
4140}
4141
4142
4143SWIGINTERN VALUE
4144_wrap_ok__SWIG_1(int argc, VALUE *argv, VALUE self) {
4145 Agnode_t *arg1 = (Agnode_t *) 0 ;
4146 void *argp1 = 0 ;
4147 int res1 = 0 ;
4148 bool result;
4149 VALUE vresult = Qnil;
4150
4151 if ((argc < 1) || (argc > 1)) {
4152 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
4153 }
4154 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agnode_t, 0 | 0 );
4155 if (!SWIG_IsOK(res1)) {
4156 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agnode_t *","ok", 1, argv[0] ));
4157 }
4158 arg1 = reinterpret_cast< Agnode_t * >(argp1);
4159 result = (bool)ok(arg1);
4160 vresult = SWIG_From_bool(static_cast< bool >(result));
4161 return vresult;
4162fail:
4163 return Qnil;
4164}
4165
4166
4167SWIGINTERN VALUE
4168_wrap_ok__SWIG_2(int argc, VALUE *argv, VALUE self) {
4169 Agedge_t *arg1 = (Agedge_t *) 0 ;
4170 void *argp1 = 0 ;
4171 int res1 = 0 ;
4172 bool result;
4173 VALUE vresult = Qnil;
4174
4175 if ((argc < 1) || (argc > 1)) {
4176 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
4177 }
4178 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agedge_t, 0 | 0 );
4179 if (!SWIG_IsOK(res1)) {
4180 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agedge_t *","ok", 1, argv[0] ));
4181 }
4182 arg1 = reinterpret_cast< Agedge_t * >(argp1);
4183 result = (bool)ok(arg1);
4184 vresult = SWIG_From_bool(static_cast< bool >(result));
4185 return vresult;
4186fail:
4187 return Qnil;
4188}
4189
4190
4191SWIGINTERN VALUE
4192_wrap_ok__SWIG_3(int argc, VALUE *argv, VALUE self) {
4193 Agsym_t *arg1 = (Agsym_t *) 0 ;
4194 void *argp1 = 0 ;
4195 int res1 = 0 ;
4196 bool result;
4197 VALUE vresult = Qnil;
4198
4199 if ((argc < 1) || (argc > 1)) {
4200 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
4201 }
4202 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agsym_t, 0 | 0 );
4203 if (!SWIG_IsOK(res1)) {
4204 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agsym_t *","ok", 1, argv[0] ));
4205 }
4206 arg1 = reinterpret_cast< Agsym_t * >(argp1);
4207 result = (bool)ok(arg1);
4208 vresult = SWIG_From_bool(static_cast< bool >(result));
4209 return vresult;
4210fail:
4211 return Qnil;
4212}
4213
4214
4215SWIGINTERN VALUE _wrap_ok(int nargs, VALUE *args, VALUE self) {
4216 int argc;
4217 VALUE argv[1];
4218 int ii;
4219
4220 argc = nargs;
4221 if (argc > 1) SWIG_fail;
4222 for (ii = 0; (ii < argc); ++ii) {
4223 argv[ii] = args[ii];
4224 }
4225 if (argc == 1) {
4226 int _v = 0;
4227 void *vptr = 0;
4228 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agraph_t, 0);
4229 _v = SWIG_CheckState(res);
4230 if (_v) {
4231 return _wrap_ok__SWIG_0(nargs, args, self);
4232 }
4233 }
4234 if (argc == 1) {
4235 int _v = 0;
4236 void *vptr = 0;
4237 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agnode_t, 0);
4238 _v = SWIG_CheckState(res);
4239 if (_v) {
4240 return _wrap_ok__SWIG_1(nargs, args, self);
4241 }
4242 }
4243 if (argc == 1) {
4244 int _v = 0;
4245 void *vptr = 0;
4246 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agedge_t, 0);
4247 _v = SWIG_CheckState(res);
4248 if (_v) {
4249 return _wrap_ok__SWIG_2(nargs, args, self);
4250 }
4251 }
4252 if (argc == 1) {
4253 int _v = 0;
4254 void *vptr = 0;
4255 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agsym_t, 0);
4256 _v = SWIG_CheckState(res);
4257 if (_v) {
4258 return _wrap_ok__SWIG_3(nargs, args, self);
4259 }
4260 }
4261
4262fail:
4263 Ruby_Format_OverloadedError( argc, 1, "ok",
4264 " bool ok(Agraph_t *g)\n"
4265 " bool ok(Agnode_t *n)\n"
4266 " bool ok(Agedge_t *e)\n"
4267 " bool ok(Agsym_t *a)\n");
4268
4269 return Qnil;
4270}
4271
4272
4273SWIGINTERN VALUE
4274_wrap_firstsubg(int argc, VALUE *argv, VALUE self) {
4275 Agraph_t *arg1 = (Agraph_t *) 0 ;
4276 void *argp1 = 0 ;
4277 int res1 = 0 ;
4278 Agraph_t *result = 0 ;
4279 VALUE vresult = Qnil;
4280
4281 if ((argc < 1) || (argc > 1)) {
4282 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
4283 }
4284 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
4285 if (!SWIG_IsOK(res1)) {
4286 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","firstsubg", 1, argv[0] ));
4287 }
4288 arg1 = reinterpret_cast< Agraph_t * >(argp1);
4289 result = (Agraph_t *)firstsubg(arg1);
4290 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agraph_t, 0 | 0 );
4291 return vresult;
4292fail:
4293 return Qnil;
4294}
4295
4296
4297SWIGINTERN VALUE
4298_wrap_nextsubg(int argc, VALUE *argv, VALUE self) {
4299 Agraph_t *arg1 = (Agraph_t *) 0 ;
4300 Agraph_t *arg2 = (Agraph_t *) 0 ;
4301 void *argp1 = 0 ;
4302 int res1 = 0 ;
4303 void *argp2 = 0 ;
4304 int res2 = 0 ;
4305 Agraph_t *result = 0 ;
4306 VALUE vresult = Qnil;
4307
4308 if ((argc < 2) || (argc > 2)) {
4309 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
4310 }
4311 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
4312 if (!SWIG_IsOK(res1)) {
4313 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","nextsubg", 1, argv[0] ));
4314 }
4315 arg1 = reinterpret_cast< Agraph_t * >(argp1);
4316 res2 = SWIG_ConvertPtr(argv[1], &argp2,SWIGTYPE_p_Agraph_t, 0 | 0 );
4317 if (!SWIG_IsOK(res2)) {
4318 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Agraph_t *","nextsubg", 2, argv[1] ));
4319 }
4320 arg2 = reinterpret_cast< Agraph_t * >(argp2);
4321 result = (Agraph_t *)nextsubg(arg1,arg2);
4322 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agraph_t, 0 | 0 );
4323 return vresult;
4324fail:
4325 return Qnil;
4326}
4327
4328
4329SWIGINTERN VALUE
4330_wrap_firstsupg(int argc, VALUE *argv, VALUE self) {
4331 Agraph_t *arg1 = (Agraph_t *) 0 ;
4332 void *argp1 = 0 ;
4333 int res1 = 0 ;
4334 Agraph_t *result = 0 ;
4335 VALUE vresult = Qnil;
4336
4337 if ((argc < 1) || (argc > 1)) {
4338 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
4339 }
4340 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
4341 if (!SWIG_IsOK(res1)) {
4342 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","firstsupg", 1, argv[0] ));
4343 }
4344 arg1 = reinterpret_cast< Agraph_t * >(argp1);
4345 result = (Agraph_t *)firstsupg(arg1);
4346 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agraph_t, 0 | 0 );
4347 return vresult;
4348fail:
4349 return Qnil;
4350}
4351
4352
4353SWIGINTERN VALUE
4354_wrap_nextsupg(int argc, VALUE *argv, VALUE self) {
4355 Agraph_t *arg1 = (Agraph_t *) 0 ;
4356 Agraph_t *arg2 = (Agraph_t *) 0 ;
4357 void *argp1 = 0 ;
4358 int res1 = 0 ;
4359 void *argp2 = 0 ;
4360 int res2 = 0 ;
4361 Agraph_t *result = 0 ;
4362 VALUE vresult = Qnil;
4363
4364 if ((argc < 2) || (argc > 2)) {
4365 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
4366 }
4367 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
4368 if (!SWIG_IsOK(res1)) {
4369 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","nextsupg", 1, argv[0] ));
4370 }
4371 arg1 = reinterpret_cast< Agraph_t * >(argp1);
4372 res2 = SWIG_ConvertPtr(argv[1], &argp2,SWIGTYPE_p_Agraph_t, 0 | 0 );
4373 if (!SWIG_IsOK(res2)) {
4374 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Agraph_t *","nextsupg", 2, argv[1] ));
4375 }
4376 arg2 = reinterpret_cast< Agraph_t * >(argp2);
4377 result = (Agraph_t *)nextsupg(arg1,arg2);
4378 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agraph_t, 0 | 0 );
4379 return vresult;
4380fail:
4381 return Qnil;
4382}
4383
4384
4385SWIGINTERN VALUE
4386_wrap_firstedge__SWIG_0(int argc, VALUE *argv, VALUE self) {
4387 Agraph_t *arg1 = (Agraph_t *) 0 ;
4388 void *argp1 = 0 ;
4389 int res1 = 0 ;
4390 Agedge_t *result = 0 ;
4391 VALUE vresult = Qnil;
4392
4393 if ((argc < 1) || (argc > 1)) {
4394 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
4395 }
4396 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
4397 if (!SWIG_IsOK(res1)) {
4398 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","firstedge", 1, argv[0] ));
4399 }
4400 arg1 = reinterpret_cast< Agraph_t * >(argp1);
4401 result = (Agedge_t *)firstedge(arg1);
4402 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agedge_t, 0 | 0 );
4403 return vresult;
4404fail:
4405 return Qnil;
4406}
4407
4408
4409SWIGINTERN VALUE
4410_wrap_nextedge__SWIG_0(int argc, VALUE *argv, VALUE self) {
4411 Agraph_t *arg1 = (Agraph_t *) 0 ;
4412 Agedge_t *arg2 = (Agedge_t *) 0 ;
4413 void *argp1 = 0 ;
4414 int res1 = 0 ;
4415 void *argp2 = 0 ;
4416 int res2 = 0 ;
4417 Agedge_t *result = 0 ;
4418 VALUE vresult = Qnil;
4419
4420 if ((argc < 2) || (argc > 2)) {
4421 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
4422 }
4423 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
4424 if (!SWIG_IsOK(res1)) {
4425 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","nextedge", 1, argv[0] ));
4426 }
4427 arg1 = reinterpret_cast< Agraph_t * >(argp1);
4428 res2 = SWIG_ConvertPtr(argv[1], &argp2,SWIGTYPE_p_Agedge_t, 0 | 0 );
4429 if (!SWIG_IsOK(res2)) {
4430 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Agedge_t *","nextedge", 2, argv[1] ));
4431 }
4432 arg2 = reinterpret_cast< Agedge_t * >(argp2);
4433 result = (Agedge_t *)nextedge(arg1,arg2);
4434 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agedge_t, 0 | 0 );
4435 return vresult;
4436fail:
4437 return Qnil;
4438}
4439
4440
4441SWIGINTERN VALUE
4442_wrap_firstout__SWIG_0(int argc, VALUE *argv, VALUE self) {
4443 Agraph_t *arg1 = (Agraph_t *) 0 ;
4444 void *argp1 = 0 ;
4445 int res1 = 0 ;
4446 Agedge_t *result = 0 ;
4447 VALUE vresult = Qnil;
4448
4449 if ((argc < 1) || (argc > 1)) {
4450 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
4451 }
4452 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
4453 if (!SWIG_IsOK(res1)) {
4454 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","firstout", 1, argv[0] ));
4455 }
4456 arg1 = reinterpret_cast< Agraph_t * >(argp1);
4457 result = (Agedge_t *)firstout(arg1);
4458 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agedge_t, 0 | 0 );
4459 return vresult;
4460fail:
4461 return Qnil;
4462}
4463
4464
4465SWIGINTERN VALUE
4466_wrap_nextout__SWIG_0(int argc, VALUE *argv, VALUE self) {
4467 Agraph_t *arg1 = (Agraph_t *) 0 ;
4468 Agedge_t *arg2 = (Agedge_t *) 0 ;
4469 void *argp1 = 0 ;
4470 int res1 = 0 ;
4471 void *argp2 = 0 ;
4472 int res2 = 0 ;
4473 Agedge_t *result = 0 ;
4474 VALUE vresult = Qnil;
4475
4476 if ((argc < 2) || (argc > 2)) {
4477 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
4478 }
4479 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
4480 if (!SWIG_IsOK(res1)) {
4481 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","nextout", 1, argv[0] ));
4482 }
4483 arg1 = reinterpret_cast< Agraph_t * >(argp1);
4484 res2 = SWIG_ConvertPtr(argv[1], &argp2,SWIGTYPE_p_Agedge_t, 0 | 0 );
4485 if (!SWIG_IsOK(res2)) {
4486 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Agedge_t *","nextout", 2, argv[1] ));
4487 }
4488 arg2 = reinterpret_cast< Agedge_t * >(argp2);
4489 result = (Agedge_t *)nextout(arg1,arg2);
4490 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agedge_t, 0 | 0 );
4491 return vresult;
4492fail:
4493 return Qnil;
4494}
4495
4496
4497SWIGINTERN VALUE
4498_wrap_firstedge__SWIG_1(int argc, VALUE *argv, VALUE self) {
4499 Agnode_t *arg1 = (Agnode_t *) 0 ;
4500 void *argp1 = 0 ;
4501 int res1 = 0 ;
4502 Agedge_t *result = 0 ;
4503 VALUE vresult = Qnil;
4504
4505 if ((argc < 1) || (argc > 1)) {
4506 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
4507 }
4508 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agnode_t, 0 | 0 );
4509 if (!SWIG_IsOK(res1)) {
4510 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agnode_t *","firstedge", 1, argv[0] ));
4511 }
4512 arg1 = reinterpret_cast< Agnode_t * >(argp1);
4513 result = (Agedge_t *)firstedge(arg1);
4514 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agedge_t, 0 | 0 );
4515 return vresult;
4516fail:
4517 return Qnil;
4518}
4519
4520
4521SWIGINTERN VALUE _wrap_firstedge(int nargs, VALUE *args, VALUE self) {
4522 int argc;
4523 VALUE argv[1];
4524 int ii;
4525
4526 argc = nargs;
4527 if (argc > 1) SWIG_fail;
4528 for (ii = 0; (ii < argc); ++ii) {
4529 argv[ii] = args[ii];
4530 }
4531 if (argc == 1) {
4532 int _v = 0;
4533 void *vptr = 0;
4534 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agraph_t, 0);
4535 _v = SWIG_CheckState(res);
4536 if (_v) {
4537 return _wrap_firstedge__SWIG_0(nargs, args, self);
4538 }
4539 }
4540 if (argc == 1) {
4541 int _v = 0;
4542 void *vptr = 0;
4543 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agnode_t, 0);
4544 _v = SWIG_CheckState(res);
4545 if (_v) {
4546 return _wrap_firstedge__SWIG_1(nargs, args, self);
4547 }
4548 }
4549
4550fail:
4551 Ruby_Format_OverloadedError( argc, 1, "firstedge",
4552 " Agedge_t firstedge(Agraph_t *g)\n"
4553 " Agedge_t * firstedge(Agnode_t *n)\n");
4554
4555 return Qnil;
4556}
4557
4558
4559SWIGINTERN VALUE
4560_wrap_nextedge__SWIG_1(int argc, VALUE *argv, VALUE self) {
4561 Agnode_t *arg1 = (Agnode_t *) 0 ;
4562 Agedge_t *arg2 = (Agedge_t *) 0 ;
4563 void *argp1 = 0 ;
4564 int res1 = 0 ;
4565 void *argp2 = 0 ;
4566 int res2 = 0 ;
4567 Agedge_t *result = 0 ;
4568 VALUE vresult = Qnil;
4569
4570 if ((argc < 2) || (argc > 2)) {
4571 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
4572 }
4573 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agnode_t, 0 | 0 );
4574 if (!SWIG_IsOK(res1)) {
4575 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agnode_t *","nextedge", 1, argv[0] ));
4576 }
4577 arg1 = reinterpret_cast< Agnode_t * >(argp1);
4578 res2 = SWIG_ConvertPtr(argv[1], &argp2,SWIGTYPE_p_Agedge_t, 0 | 0 );
4579 if (!SWIG_IsOK(res2)) {
4580 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Agedge_t *","nextedge", 2, argv[1] ));
4581 }
4582 arg2 = reinterpret_cast< Agedge_t * >(argp2);
4583 result = (Agedge_t *)nextedge(arg1,arg2);
4584 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agedge_t, 0 | 0 );
4585 return vresult;
4586fail:
4587 return Qnil;
4588}
4589
4590
4591SWIGINTERN VALUE _wrap_nextedge(int nargs, VALUE *args, VALUE self) {
4592 int argc;
4593 VALUE argv[2];
4594 int ii;
4595
4596 argc = nargs;
4597 if (argc > 2) SWIG_fail;
4598 for (ii = 0; (ii < argc); ++ii) {
4599 argv[ii] = args[ii];
4600 }
4601 if (argc == 2) {
4602 int _v = 0;
4603 void *vptr = 0;
4604 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agraph_t, 0);
4605 _v = SWIG_CheckState(res);
4606 if (_v) {
4607 void *vptr = 0;
4608 int res = SWIG_ConvertPtr(argv[1], &vptr, SWIGTYPE_p_Agedge_t, 0);
4609 _v = SWIG_CheckState(res);
4610 if (_v) {
4611 return _wrap_nextedge__SWIG_0(nargs, args, self);
4612 }
4613 }
4614 }
4615 if (argc == 2) {
4616 int _v = 0;
4617 void *vptr = 0;
4618 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agnode_t, 0);
4619 _v = SWIG_CheckState(res);
4620 if (_v) {
4621 void *vptr = 0;
4622 int res = SWIG_ConvertPtr(argv[1], &vptr, SWIGTYPE_p_Agedge_t, 0);
4623 _v = SWIG_CheckState(res);
4624 if (_v) {
4625 return _wrap_nextedge__SWIG_1(nargs, args, self);
4626 }
4627 }
4628 }
4629
4630fail:
4631 Ruby_Format_OverloadedError( argc, 2, "nextedge",
4632 " Agedge_t nextedge(Agraph_t *g, Agedge_t *e)\n"
4633 " Agedge_t * nextedge(Agnode_t *n, Agedge_t *e)\n");
4634
4635 return Qnil;
4636}
4637
4638
4639SWIGINTERN VALUE
4640_wrap_firstout__SWIG_1(int argc, VALUE *argv, VALUE self) {
4641 Agnode_t *arg1 = (Agnode_t *) 0 ;
4642 void *argp1 = 0 ;
4643 int res1 = 0 ;
4644 Agedge_t *result = 0 ;
4645 VALUE vresult = Qnil;
4646
4647 if ((argc < 1) || (argc > 1)) {
4648 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
4649 }
4650 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agnode_t, 0 | 0 );
4651 if (!SWIG_IsOK(res1)) {
4652 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agnode_t *","firstout", 1, argv[0] ));
4653 }
4654 arg1 = reinterpret_cast< Agnode_t * >(argp1);
4655 result = (Agedge_t *)firstout(arg1);
4656 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agedge_t, 0 | 0 );
4657 return vresult;
4658fail:
4659 return Qnil;
4660}
4661
4662
4663SWIGINTERN VALUE _wrap_firstout(int nargs, VALUE *args, VALUE self) {
4664 int argc;
4665 VALUE argv[1];
4666 int ii;
4667
4668 argc = nargs;
4669 if (argc > 1) SWIG_fail;
4670 for (ii = 0; (ii < argc); ++ii) {
4671 argv[ii] = args[ii];
4672 }
4673 if (argc == 1) {
4674 int _v = 0;
4675 void *vptr = 0;
4676 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agraph_t, 0);
4677 _v = SWIG_CheckState(res);
4678 if (_v) {
4679 return _wrap_firstout__SWIG_0(nargs, args, self);
4680 }
4681 }
4682 if (argc == 1) {
4683 int _v = 0;
4684 void *vptr = 0;
4685 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agnode_t, 0);
4686 _v = SWIG_CheckState(res);
4687 if (_v) {
4688 return _wrap_firstout__SWIG_1(nargs, args, self);
4689 }
4690 }
4691
4692fail:
4693 Ruby_Format_OverloadedError( argc, 1, "firstout",
4694 " Agedge_t firstout(Agraph_t *g)\n"
4695 " Agedge_t * firstout(Agnode_t *n)\n");
4696
4697 return Qnil;
4698}
4699
4700
4701SWIGINTERN VALUE
4702_wrap_nextout__SWIG_1(int argc, VALUE *argv, VALUE self) {
4703 Agnode_t *arg1 = (Agnode_t *) 0 ;
4704 Agedge_t *arg2 = (Agedge_t *) 0 ;
4705 void *argp1 = 0 ;
4706 int res1 = 0 ;
4707 void *argp2 = 0 ;
4708 int res2 = 0 ;
4709 Agedge_t *result = 0 ;
4710 VALUE vresult = Qnil;
4711
4712 if ((argc < 2) || (argc > 2)) {
4713 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
4714 }
4715 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agnode_t, 0 | 0 );
4716 if (!SWIG_IsOK(res1)) {
4717 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agnode_t *","nextout", 1, argv[0] ));
4718 }
4719 arg1 = reinterpret_cast< Agnode_t * >(argp1);
4720 res2 = SWIG_ConvertPtr(argv[1], &argp2,SWIGTYPE_p_Agedge_t, 0 | 0 );
4721 if (!SWIG_IsOK(res2)) {
4722 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Agedge_t *","nextout", 2, argv[1] ));
4723 }
4724 arg2 = reinterpret_cast< Agedge_t * >(argp2);
4725 result = (Agedge_t *)nextout(arg1,arg2);
4726 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agedge_t, 0 | 0 );
4727 return vresult;
4728fail:
4729 return Qnil;
4730}
4731
4732
4733SWIGINTERN VALUE _wrap_nextout(int nargs, VALUE *args, VALUE self) {
4734 int argc;
4735 VALUE argv[2];
4736 int ii;
4737
4738 argc = nargs;
4739 if (argc > 2) SWIG_fail;
4740 for (ii = 0; (ii < argc); ++ii) {
4741 argv[ii] = args[ii];
4742 }
4743 if (argc == 2) {
4744 int _v = 0;
4745 void *vptr = 0;
4746 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agraph_t, 0);
4747 _v = SWIG_CheckState(res);
4748 if (_v) {
4749 void *vptr = 0;
4750 int res = SWIG_ConvertPtr(argv[1], &vptr, SWIGTYPE_p_Agedge_t, 0);
4751 _v = SWIG_CheckState(res);
4752 if (_v) {
4753 return _wrap_nextout__SWIG_0(nargs, args, self);
4754 }
4755 }
4756 }
4757 if (argc == 2) {
4758 int _v = 0;
4759 void *vptr = 0;
4760 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agnode_t, 0);
4761 _v = SWIG_CheckState(res);
4762 if (_v) {
4763 void *vptr = 0;
4764 int res = SWIG_ConvertPtr(argv[1], &vptr, SWIGTYPE_p_Agedge_t, 0);
4765 _v = SWIG_CheckState(res);
4766 if (_v) {
4767 return _wrap_nextout__SWIG_1(nargs, args, self);
4768 }
4769 }
4770 }
4771
4772fail:
4773 Ruby_Format_OverloadedError( argc, 2, "nextout",
4774 " Agedge_t nextout(Agraph_t *g, Agedge_t *e)\n"
4775 " Agedge_t * nextout(Agnode_t *n, Agedge_t *e)\n");
4776
4777 return Qnil;
4778}
4779
4780
4781SWIGINTERN VALUE
4782_wrap_firsthead(int argc, VALUE *argv, VALUE self) {
4783 Agnode_t *arg1 = (Agnode_t *) 0 ;
4784 void *argp1 = 0 ;
4785 int res1 = 0 ;
4786 Agnode_t *result = 0 ;
4787 VALUE vresult = Qnil;
4788
4789 if ((argc < 1) || (argc > 1)) {
4790 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
4791 }
4792 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agnode_t, 0 | 0 );
4793 if (!SWIG_IsOK(res1)) {
4794 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agnode_t *","firsthead", 1, argv[0] ));
4795 }
4796 arg1 = reinterpret_cast< Agnode_t * >(argp1);
4797 result = (Agnode_t *)firsthead(arg1);
4798 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agnode_t, 0 | 0 );
4799 return vresult;
4800fail:
4801 return Qnil;
4802}
4803
4804
4805SWIGINTERN VALUE
4806_wrap_nexthead(int argc, VALUE *argv, VALUE self) {
4807 Agnode_t *arg1 = (Agnode_t *) 0 ;
4808 Agnode_t *arg2 = (Agnode_t *) 0 ;
4809 void *argp1 = 0 ;
4810 int res1 = 0 ;
4811 void *argp2 = 0 ;
4812 int res2 = 0 ;
4813 Agnode_t *result = 0 ;
4814 VALUE vresult = Qnil;
4815
4816 if ((argc < 2) || (argc > 2)) {
4817 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
4818 }
4819 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agnode_t, 0 | 0 );
4820 if (!SWIG_IsOK(res1)) {
4821 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agnode_t *","nexthead", 1, argv[0] ));
4822 }
4823 arg1 = reinterpret_cast< Agnode_t * >(argp1);
4824 res2 = SWIG_ConvertPtr(argv[1], &argp2,SWIGTYPE_p_Agnode_t, 0 | 0 );
4825 if (!SWIG_IsOK(res2)) {
4826 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Agnode_t *","nexthead", 2, argv[1] ));
4827 }
4828 arg2 = reinterpret_cast< Agnode_t * >(argp2);
4829 result = (Agnode_t *)nexthead(arg1,arg2);
4830 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agnode_t, 0 | 0 );
4831 return vresult;
4832fail:
4833 return Qnil;
4834}
4835
4836
4837SWIGINTERN VALUE
4838_wrap_firstin__SWIG_0(int argc, VALUE *argv, VALUE self) {
4839 Agraph_t *arg1 = (Agraph_t *) 0 ;
4840 void *argp1 = 0 ;
4841 int res1 = 0 ;
4842 Agedge_t *result = 0 ;
4843 VALUE vresult = Qnil;
4844
4845 if ((argc < 1) || (argc > 1)) {
4846 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
4847 }
4848 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
4849 if (!SWIG_IsOK(res1)) {
4850 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","firstin", 1, argv[0] ));
4851 }
4852 arg1 = reinterpret_cast< Agraph_t * >(argp1);
4853 result = (Agedge_t *)firstin(arg1);
4854 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agedge_t, 0 | 0 );
4855 return vresult;
4856fail:
4857 return Qnil;
4858}
4859
4860
4861SWIGINTERN VALUE
4862_wrap_nextin__SWIG_0(int argc, VALUE *argv, VALUE self) {
4863 Agnode_t *arg1 = (Agnode_t *) 0 ;
4864 Agedge_t *arg2 = (Agedge_t *) 0 ;
4865 void *argp1 = 0 ;
4866 int res1 = 0 ;
4867 void *argp2 = 0 ;
4868 int res2 = 0 ;
4869 Agedge_t *result = 0 ;
4870 VALUE vresult = Qnil;
4871
4872 if ((argc < 2) || (argc > 2)) {
4873 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
4874 }
4875 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agnode_t, 0 | 0 );
4876 if (!SWIG_IsOK(res1)) {
4877 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agnode_t *","nextin", 1, argv[0] ));
4878 }
4879 arg1 = reinterpret_cast< Agnode_t * >(argp1);
4880 res2 = SWIG_ConvertPtr(argv[1], &argp2,SWIGTYPE_p_Agedge_t, 0 | 0 );
4881 if (!SWIG_IsOK(res2)) {
4882 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Agedge_t *","nextin", 2, argv[1] ));
4883 }
4884 arg2 = reinterpret_cast< Agedge_t * >(argp2);
4885 result = (Agedge_t *)nextin(arg1,arg2);
4886 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agedge_t, 0 | 0 );
4887 return vresult;
4888fail:
4889 return Qnil;
4890}
4891
4892
4893SWIGINTERN VALUE
4894_wrap_firstin__SWIG_1(int argc, VALUE *argv, VALUE self) {
4895 Agnode_t *arg1 = (Agnode_t *) 0 ;
4896 void *argp1 = 0 ;
4897 int res1 = 0 ;
4898 Agedge_t *result = 0 ;
4899 VALUE vresult = Qnil;
4900
4901 if ((argc < 1) || (argc > 1)) {
4902 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
4903 }
4904 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agnode_t, 0 | 0 );
4905 if (!SWIG_IsOK(res1)) {
4906 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agnode_t *","firstin", 1, argv[0] ));
4907 }
4908 arg1 = reinterpret_cast< Agnode_t * >(argp1);
4909 result = (Agedge_t *)firstin(arg1);
4910 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agedge_t, 0 | 0 );
4911 return vresult;
4912fail:
4913 return Qnil;
4914}
4915
4916
4917SWIGINTERN VALUE _wrap_firstin(int nargs, VALUE *args, VALUE self) {
4918 int argc;
4919 VALUE argv[1];
4920 int ii;
4921
4922 argc = nargs;
4923 if (argc > 1) SWIG_fail;
4924 for (ii = 0; (ii < argc); ++ii) {
4925 argv[ii] = args[ii];
4926 }
4927 if (argc == 1) {
4928 int _v = 0;
4929 void *vptr = 0;
4930 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agraph_t, 0);
4931 _v = SWIG_CheckState(res);
4932 if (_v) {
4933 return _wrap_firstin__SWIG_0(nargs, args, self);
4934 }
4935 }
4936 if (argc == 1) {
4937 int _v = 0;
4938 void *vptr = 0;
4939 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agnode_t, 0);
4940 _v = SWIG_CheckState(res);
4941 if (_v) {
4942 return _wrap_firstin__SWIG_1(nargs, args, self);
4943 }
4944 }
4945
4946fail:
4947 Ruby_Format_OverloadedError( argc, 1, "firstin",
4948 " Agedge_t firstin(Agraph_t *g)\n"
4949 " Agedge_t * firstin(Agnode_t *n)\n");
4950
4951 return Qnil;
4952}
4953
4954
4955SWIGINTERN VALUE
4956_wrap_nextin__SWIG_1(int argc, VALUE *argv, VALUE self) {
4957 Agraph_t *arg1 = (Agraph_t *) 0 ;
4958 Agedge_t *arg2 = (Agedge_t *) 0 ;
4959 void *argp1 = 0 ;
4960 int res1 = 0 ;
4961 void *argp2 = 0 ;
4962 int res2 = 0 ;
4963 Agedge_t *result = 0 ;
4964 VALUE vresult = Qnil;
4965
4966 if ((argc < 2) || (argc > 2)) {
4967 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
4968 }
4969 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
4970 if (!SWIG_IsOK(res1)) {
4971 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","nextin", 1, argv[0] ));
4972 }
4973 arg1 = reinterpret_cast< Agraph_t * >(argp1);
4974 res2 = SWIG_ConvertPtr(argv[1], &argp2,SWIGTYPE_p_Agedge_t, 0 | 0 );
4975 if (!SWIG_IsOK(res2)) {
4976 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Agedge_t *","nextin", 2, argv[1] ));
4977 }
4978 arg2 = reinterpret_cast< Agedge_t * >(argp2);
4979 result = (Agedge_t *)nextin(arg1,arg2);
4980 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agedge_t, 0 | 0 );
4981 return vresult;
4982fail:
4983 return Qnil;
4984}
4985
4986
4987SWIGINTERN VALUE _wrap_nextin(int nargs, VALUE *args, VALUE self) {
4988 int argc;
4989 VALUE argv[2];
4990 int ii;
4991
4992 argc = nargs;
4993 if (argc > 2) SWIG_fail;
4994 for (ii = 0; (ii < argc); ++ii) {
4995 argv[ii] = args[ii];
4996 }
4997 if (argc == 2) {
4998 int _v = 0;
4999 void *vptr = 0;
5000 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agnode_t, 0);
5001 _v = SWIG_CheckState(res);
5002 if (_v) {
5003 void *vptr = 0;
5004 int res = SWIG_ConvertPtr(argv[1], &vptr, SWIGTYPE_p_Agedge_t, 0);
5005 _v = SWIG_CheckState(res);
5006 if (_v) {
5007 return _wrap_nextin__SWIG_0(nargs, args, self);
5008 }
5009 }
5010 }
5011 if (argc == 2) {
5012 int _v = 0;
5013 void *vptr = 0;
5014 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agraph_t, 0);
5015 _v = SWIG_CheckState(res);
5016 if (_v) {
5017 void *vptr = 0;
5018 int res = SWIG_ConvertPtr(argv[1], &vptr, SWIGTYPE_p_Agedge_t, 0);
5019 _v = SWIG_CheckState(res);
5020 if (_v) {
5021 return _wrap_nextin__SWIG_1(nargs, args, self);
5022 }
5023 }
5024 }
5025
5026fail:
5027 Ruby_Format_OverloadedError( argc, 2, "nextin",
5028 " Agedge_t nextin(Agnode_t *n, Agedge_t *e)\n"
5029 " Agedge_t * nextin(Agraph_t *g, Agedge_t *e)\n");
5030
5031 return Qnil;
5032}
5033
5034
5035SWIGINTERN VALUE
5036_wrap_firsttail(int argc, VALUE *argv, VALUE self) {
5037 Agnode_t *arg1 = (Agnode_t *) 0 ;
5038 void *argp1 = 0 ;
5039 int res1 = 0 ;
5040 Agnode_t *result = 0 ;
5041 VALUE vresult = Qnil;
5042
5043 if ((argc < 1) || (argc > 1)) {
5044 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
5045 }
5046 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agnode_t, 0 | 0 );
5047 if (!SWIG_IsOK(res1)) {
5048 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agnode_t *","firsttail", 1, argv[0] ));
5049 }
5050 arg1 = reinterpret_cast< Agnode_t * >(argp1);
5051 result = (Agnode_t *)firsttail(arg1);
5052 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agnode_t, 0 | 0 );
5053 return vresult;
5054fail:
5055 return Qnil;
5056}
5057
5058
5059SWIGINTERN VALUE
5060_wrap_nexttail(int argc, VALUE *argv, VALUE self) {
5061 Agnode_t *arg1 = (Agnode_t *) 0 ;
5062 Agnode_t *arg2 = (Agnode_t *) 0 ;
5063 void *argp1 = 0 ;
5064 int res1 = 0 ;
5065 void *argp2 = 0 ;
5066 int res2 = 0 ;
5067 Agnode_t *result = 0 ;
5068 VALUE vresult = Qnil;
5069
5070 if ((argc < 2) || (argc > 2)) {
5071 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
5072 }
5073 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agnode_t, 0 | 0 );
5074 if (!SWIG_IsOK(res1)) {
5075 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agnode_t *","nexttail", 1, argv[0] ));
5076 }
5077 arg1 = reinterpret_cast< Agnode_t * >(argp1);
5078 res2 = SWIG_ConvertPtr(argv[1], &argp2,SWIGTYPE_p_Agnode_t, 0 | 0 );
5079 if (!SWIG_IsOK(res2)) {
5080 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Agnode_t *","nexttail", 2, argv[1] ));
5081 }
5082 arg2 = reinterpret_cast< Agnode_t * >(argp2);
5083 result = (Agnode_t *)nexttail(arg1,arg2);
5084 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agnode_t, 0 | 0 );
5085 return vresult;
5086fail:
5087 return Qnil;
5088}
5089
5090
5091SWIGINTERN VALUE
5092_wrap_firstnode__SWIG_0(int argc, VALUE *argv, VALUE self) {
5093 Agraph_t *arg1 = (Agraph_t *) 0 ;
5094 void *argp1 = 0 ;
5095 int res1 = 0 ;
5096 Agnode_t *result = 0 ;
5097 VALUE vresult = Qnil;
5098
5099 if ((argc < 1) || (argc > 1)) {
5100 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
5101 }
5102 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
5103 if (!SWIG_IsOK(res1)) {
5104 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","firstnode", 1, argv[0] ));
5105 }
5106 arg1 = reinterpret_cast< Agraph_t * >(argp1);
5107 result = (Agnode_t *)firstnode(arg1);
5108 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agnode_t, 0 | 0 );
5109 return vresult;
5110fail:
5111 return Qnil;
5112}
5113
5114
5115SWIGINTERN VALUE
5116_wrap_nextnode__SWIG_0(int argc, VALUE *argv, VALUE self) {
5117 Agraph_t *arg1 = (Agraph_t *) 0 ;
5118 Agnode_t *arg2 = (Agnode_t *) 0 ;
5119 void *argp1 = 0 ;
5120 int res1 = 0 ;
5121 void *argp2 = 0 ;
5122 int res2 = 0 ;
5123 Agnode_t *result = 0 ;
5124 VALUE vresult = Qnil;
5125
5126 if ((argc < 2) || (argc > 2)) {
5127 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
5128 }
5129 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
5130 if (!SWIG_IsOK(res1)) {
5131 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","nextnode", 1, argv[0] ));
5132 }
5133 arg1 = reinterpret_cast< Agraph_t * >(argp1);
5134 res2 = SWIG_ConvertPtr(argv[1], &argp2,SWIGTYPE_p_Agnode_t, 0 | 0 );
5135 if (!SWIG_IsOK(res2)) {
5136 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Agnode_t *","nextnode", 2, argv[1] ));
5137 }
5138 arg2 = reinterpret_cast< Agnode_t * >(argp2);
5139 result = (Agnode_t *)nextnode(arg1,arg2);
5140 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agnode_t, 0 | 0 );
5141 return vresult;
5142fail:
5143 return Qnil;
5144}
5145
5146
5147SWIGINTERN VALUE
5148_wrap_firstnode__SWIG_1(int argc, VALUE *argv, VALUE self) {
5149 Agedge_t *arg1 = (Agedge_t *) 0 ;
5150 void *argp1 = 0 ;
5151 int res1 = 0 ;
5152 Agnode_t *result = 0 ;
5153 VALUE vresult = Qnil;
5154
5155 if ((argc < 1) || (argc > 1)) {
5156 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
5157 }
5158 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agedge_t, 0 | 0 );
5159 if (!SWIG_IsOK(res1)) {
5160 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agedge_t *","firstnode", 1, argv[0] ));
5161 }
5162 arg1 = reinterpret_cast< Agedge_t * >(argp1);
5163 result = (Agnode_t *)firstnode(arg1);
5164 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agnode_t, 0 | 0 );
5165 return vresult;
5166fail:
5167 return Qnil;
5168}
5169
5170
5171SWIGINTERN VALUE _wrap_firstnode(int nargs, VALUE *args, VALUE self) {
5172 int argc;
5173 VALUE argv[1];
5174 int ii;
5175
5176 argc = nargs;
5177 if (argc > 1) SWIG_fail;
5178 for (ii = 0; (ii < argc); ++ii) {
5179 argv[ii] = args[ii];
5180 }
5181 if (argc == 1) {
5182 int _v = 0;
5183 void *vptr = 0;
5184 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agraph_t, 0);
5185 _v = SWIG_CheckState(res);
5186 if (_v) {
5187 return _wrap_firstnode__SWIG_0(nargs, args, self);
5188 }
5189 }
5190 if (argc == 1) {
5191 int _v = 0;
5192 void *vptr = 0;
5193 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agedge_t, 0);
5194 _v = SWIG_CheckState(res);
5195 if (_v) {
5196 return _wrap_firstnode__SWIG_1(nargs, args, self);
5197 }
5198 }
5199
5200fail:
5201 Ruby_Format_OverloadedError( argc, 1, "firstnode",
5202 " Agnode_t firstnode(Agraph_t *g)\n"
5203 " Agnode_t * firstnode(Agedge_t *e)\n");
5204
5205 return Qnil;
5206}
5207
5208
5209SWIGINTERN VALUE
5210_wrap_nextnode__SWIG_1(int argc, VALUE *argv, VALUE self) {
5211 Agedge_t *arg1 = (Agedge_t *) 0 ;
5212 Agnode_t *arg2 = (Agnode_t *) 0 ;
5213 void *argp1 = 0 ;
5214 int res1 = 0 ;
5215 void *argp2 = 0 ;
5216 int res2 = 0 ;
5217 Agnode_t *result = 0 ;
5218 VALUE vresult = Qnil;
5219
5220 if ((argc < 2) || (argc > 2)) {
5221 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
5222 }
5223 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agedge_t, 0 | 0 );
5224 if (!SWIG_IsOK(res1)) {
5225 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agedge_t *","nextnode", 1, argv[0] ));
5226 }
5227 arg1 = reinterpret_cast< Agedge_t * >(argp1);
5228 res2 = SWIG_ConvertPtr(argv[1], &argp2,SWIGTYPE_p_Agnode_t, 0 | 0 );
5229 if (!SWIG_IsOK(res2)) {
5230 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Agnode_t *","nextnode", 2, argv[1] ));
5231 }
5232 arg2 = reinterpret_cast< Agnode_t * >(argp2);
5233 result = (Agnode_t *)nextnode(arg1,arg2);
5234 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agnode_t, 0 | 0 );
5235 return vresult;
5236fail:
5237 return Qnil;
5238}
5239
5240
5241SWIGINTERN VALUE _wrap_nextnode(int nargs, VALUE *args, VALUE self) {
5242 int argc;
5243 VALUE argv[2];
5244 int ii;
5245
5246 argc = nargs;
5247 if (argc > 2) SWIG_fail;
5248 for (ii = 0; (ii < argc); ++ii) {
5249 argv[ii] = args[ii];
5250 }
5251 if (argc == 2) {
5252 int _v = 0;
5253 void *vptr = 0;
5254 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agraph_t, 0);
5255 _v = SWIG_CheckState(res);
5256 if (_v) {
5257 void *vptr = 0;
5258 int res = SWIG_ConvertPtr(argv[1], &vptr, SWIGTYPE_p_Agnode_t, 0);
5259 _v = SWIG_CheckState(res);
5260 if (_v) {
5261 return _wrap_nextnode__SWIG_0(nargs, args, self);
5262 }
5263 }
5264 }
5265 if (argc == 2) {
5266 int _v = 0;
5267 void *vptr = 0;
5268 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agedge_t, 0);
5269 _v = SWIG_CheckState(res);
5270 if (_v) {
5271 void *vptr = 0;
5272 int res = SWIG_ConvertPtr(argv[1], &vptr, SWIGTYPE_p_Agnode_t, 0);
5273 _v = SWIG_CheckState(res);
5274 if (_v) {
5275 return _wrap_nextnode__SWIG_1(nargs, args, self);
5276 }
5277 }
5278 }
5279
5280fail:
5281 Ruby_Format_OverloadedError( argc, 2, "nextnode",
5282 " Agnode_t nextnode(Agraph_t *g, Agnode_t *n)\n"
5283 " Agnode_t * nextnode(Agedge_t *e, Agnode_t *n)\n");
5284
5285 return Qnil;
5286}
5287
5288
5289SWIGINTERN VALUE
5290_wrap_firstattr__SWIG_0(int argc, VALUE *argv, VALUE self) {
5291 Agraph_t *arg1 = (Agraph_t *) 0 ;
5292 void *argp1 = 0 ;
5293 int res1 = 0 ;
5294 Agsym_t *result = 0 ;
5295 VALUE vresult = Qnil;
5296
5297 if ((argc < 1) || (argc > 1)) {
5298 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
5299 }
5300 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
5301 if (!SWIG_IsOK(res1)) {
5302 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","firstattr", 1, argv[0] ));
5303 }
5304 arg1 = reinterpret_cast< Agraph_t * >(argp1);
5305 result = (Agsym_t *)firstattr(arg1);
5306 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agsym_t, 0 | 0 );
5307 return vresult;
5308fail:
5309 return Qnil;
5310}
5311
5312
5313SWIGINTERN VALUE
5314_wrap_nextattr__SWIG_0(int argc, VALUE *argv, VALUE self) {
5315 Agraph_t *arg1 = (Agraph_t *) 0 ;
5316 Agsym_t *arg2 = (Agsym_t *) 0 ;
5317 void *argp1 = 0 ;
5318 int res1 = 0 ;
5319 void *argp2 = 0 ;
5320 int res2 = 0 ;
5321 Agsym_t *result = 0 ;
5322 VALUE vresult = Qnil;
5323
5324 if ((argc < 2) || (argc > 2)) {
5325 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
5326 }
5327 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
5328 if (!SWIG_IsOK(res1)) {
5329 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","nextattr", 1, argv[0] ));
5330 }
5331 arg1 = reinterpret_cast< Agraph_t * >(argp1);
5332 res2 = SWIG_ConvertPtr(argv[1], &argp2,SWIGTYPE_p_Agsym_t, 0 | 0 );
5333 if (!SWIG_IsOK(res2)) {
5334 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Agsym_t *","nextattr", 2, argv[1] ));
5335 }
5336 arg2 = reinterpret_cast< Agsym_t * >(argp2);
5337 result = (Agsym_t *)nextattr(arg1,arg2);
5338 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agsym_t, 0 | 0 );
5339 return vresult;
5340fail:
5341 return Qnil;
5342}
5343
5344
5345SWIGINTERN VALUE
5346_wrap_firstattr__SWIG_1(int argc, VALUE *argv, VALUE self) {
5347 Agedge_t *arg1 = (Agedge_t *) 0 ;
5348 void *argp1 = 0 ;
5349 int res1 = 0 ;
5350 Agsym_t *result = 0 ;
5351 VALUE vresult = Qnil;
5352
5353 if ((argc < 1) || (argc > 1)) {
5354 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
5355 }
5356 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agedge_t, 0 | 0 );
5357 if (!SWIG_IsOK(res1)) {
5358 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agedge_t *","firstattr", 1, argv[0] ));
5359 }
5360 arg1 = reinterpret_cast< Agedge_t * >(argp1);
5361 result = (Agsym_t *)firstattr(arg1);
5362 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agsym_t, 0 | 0 );
5363 return vresult;
5364fail:
5365 return Qnil;
5366}
5367
5368
5369SWIGINTERN VALUE
5370_wrap_nextattr__SWIG_1(int argc, VALUE *argv, VALUE self) {
5371 Agedge_t *arg1 = (Agedge_t *) 0 ;
5372 Agsym_t *arg2 = (Agsym_t *) 0 ;
5373 void *argp1 = 0 ;
5374 int res1 = 0 ;
5375 void *argp2 = 0 ;
5376 int res2 = 0 ;
5377 Agsym_t *result = 0 ;
5378 VALUE vresult = Qnil;
5379
5380 if ((argc < 2) || (argc > 2)) {
5381 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
5382 }
5383 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agedge_t, 0 | 0 );
5384 if (!SWIG_IsOK(res1)) {
5385 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agedge_t *","nextattr", 1, argv[0] ));
5386 }
5387 arg1 = reinterpret_cast< Agedge_t * >(argp1);
5388 res2 = SWIG_ConvertPtr(argv[1], &argp2,SWIGTYPE_p_Agsym_t, 0 | 0 );
5389 if (!SWIG_IsOK(res2)) {
5390 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Agsym_t *","nextattr", 2, argv[1] ));
5391 }
5392 arg2 = reinterpret_cast< Agsym_t * >(argp2);
5393 result = (Agsym_t *)nextattr(arg1,arg2);
5394 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agsym_t, 0 | 0 );
5395 return vresult;
5396fail:
5397 return Qnil;
5398}
5399
5400
5401SWIGINTERN VALUE
5402_wrap_firstattr__SWIG_2(int argc, VALUE *argv, VALUE self) {
5403 Agnode_t *arg1 = (Agnode_t *) 0 ;
5404 void *argp1 = 0 ;
5405 int res1 = 0 ;
5406 Agsym_t *result = 0 ;
5407 VALUE vresult = Qnil;
5408
5409 if ((argc < 1) || (argc > 1)) {
5410 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
5411 }
5412 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agnode_t, 0 | 0 );
5413 if (!SWIG_IsOK(res1)) {
5414 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agnode_t *","firstattr", 1, argv[0] ));
5415 }
5416 arg1 = reinterpret_cast< Agnode_t * >(argp1);
5417 result = (Agsym_t *)firstattr(arg1);
5418 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agsym_t, 0 | 0 );
5419 return vresult;
5420fail:
5421 return Qnil;
5422}
5423
5424
5425SWIGINTERN VALUE _wrap_firstattr(int nargs, VALUE *args, VALUE self) {
5426 int argc;
5427 VALUE argv[1];
5428 int ii;
5429
5430 argc = nargs;
5431 if (argc > 1) SWIG_fail;
5432 for (ii = 0; (ii < argc); ++ii) {
5433 argv[ii] = args[ii];
5434 }
5435 if (argc == 1) {
5436 int _v = 0;
5437 void *vptr = 0;
5438 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agraph_t, 0);
5439 _v = SWIG_CheckState(res);
5440 if (_v) {
5441 return _wrap_firstattr__SWIG_0(nargs, args, self);
5442 }
5443 }
5444 if (argc == 1) {
5445 int _v = 0;
5446 void *vptr = 0;
5447 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agedge_t, 0);
5448 _v = SWIG_CheckState(res);
5449 if (_v) {
5450 return _wrap_firstattr__SWIG_1(nargs, args, self);
5451 }
5452 }
5453 if (argc == 1) {
5454 int _v = 0;
5455 void *vptr = 0;
5456 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agnode_t, 0);
5457 _v = SWIG_CheckState(res);
5458 if (_v) {
5459 return _wrap_firstattr__SWIG_2(nargs, args, self);
5460 }
5461 }
5462
5463fail:
5464 Ruby_Format_OverloadedError( argc, 1, "firstattr",
5465 " Agsym_t firstattr(Agraph_t *g)\n"
5466 " Agsym_t firstattr(Agedge_t *e)\n"
5467 " Agsym_t * firstattr(Agnode_t *n)\n");
5468
5469 return Qnil;
5470}
5471
5472
5473SWIGINTERN VALUE
5474_wrap_nextattr__SWIG_2(int argc, VALUE *argv, VALUE self) {
5475 Agnode_t *arg1 = (Agnode_t *) 0 ;
5476 Agsym_t *arg2 = (Agsym_t *) 0 ;
5477 void *argp1 = 0 ;
5478 int res1 = 0 ;
5479 void *argp2 = 0 ;
5480 int res2 = 0 ;
5481 Agsym_t *result = 0 ;
5482 VALUE vresult = Qnil;
5483
5484 if ((argc < 2) || (argc > 2)) {
5485 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
5486 }
5487 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agnode_t, 0 | 0 );
5488 if (!SWIG_IsOK(res1)) {
5489 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agnode_t *","nextattr", 1, argv[0] ));
5490 }
5491 arg1 = reinterpret_cast< Agnode_t * >(argp1);
5492 res2 = SWIG_ConvertPtr(argv[1], &argp2,SWIGTYPE_p_Agsym_t, 0 | 0 );
5493 if (!SWIG_IsOK(res2)) {
5494 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "Agsym_t *","nextattr", 2, argv[1] ));
5495 }
5496 arg2 = reinterpret_cast< Agsym_t * >(argp2);
5497 result = (Agsym_t *)nextattr(arg1,arg2);
5498 vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_Agsym_t, 0 | 0 );
5499 return vresult;
5500fail:
5501 return Qnil;
5502}
5503
5504
5505SWIGINTERN VALUE _wrap_nextattr(int nargs, VALUE *args, VALUE self) {
5506 int argc;
5507 VALUE argv[2];
5508 int ii;
5509
5510 argc = nargs;
5511 if (argc > 2) SWIG_fail;
5512 for (ii = 0; (ii < argc); ++ii) {
5513 argv[ii] = args[ii];
5514 }
5515 if (argc == 2) {
5516 int _v = 0;
5517 void *vptr = 0;
5518 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agraph_t, 0);
5519 _v = SWIG_CheckState(res);
5520 if (_v) {
5521 void *vptr = 0;
5522 int res = SWIG_ConvertPtr(argv[1], &vptr, SWIGTYPE_p_Agsym_t, 0);
5523 _v = SWIG_CheckState(res);
5524 if (_v) {
5525 return _wrap_nextattr__SWIG_0(nargs, args, self);
5526 }
5527 }
5528 }
5529 if (argc == 2) {
5530 int _v = 0;
5531 void *vptr = 0;
5532 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agedge_t, 0);
5533 _v = SWIG_CheckState(res);
5534 if (_v) {
5535 void *vptr = 0;
5536 int res = SWIG_ConvertPtr(argv[1], &vptr, SWIGTYPE_p_Agsym_t, 0);
5537 _v = SWIG_CheckState(res);
5538 if (_v) {
5539 return _wrap_nextattr__SWIG_1(nargs, args, self);
5540 }
5541 }
5542 }
5543 if (argc == 2) {
5544 int _v = 0;
5545 void *vptr = 0;
5546 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agnode_t, 0);
5547 _v = SWIG_CheckState(res);
5548 if (_v) {
5549 void *vptr = 0;
5550 int res = SWIG_ConvertPtr(argv[1], &vptr, SWIGTYPE_p_Agsym_t, 0);
5551 _v = SWIG_CheckState(res);
5552 if (_v) {
5553 return _wrap_nextattr__SWIG_2(nargs, args, self);
5554 }
5555 }
5556 }
5557
5558fail:
5559 Ruby_Format_OverloadedError( argc, 2, "nextattr",
5560 " Agsym_t nextattr(Agraph_t *g, Agsym_t *a)\n"
5561 " Agsym_t nextattr(Agedge_t *e, Agsym_t *a)\n"
5562 " Agsym_t * nextattr(Agnode_t *n, Agsym_t *a)\n");
5563
5564 return Qnil;
5565}
5566
5567
5568SWIGINTERN VALUE
5569_wrap_rm__SWIG_0(int argc, VALUE *argv, VALUE self) {
5570 Agraph_t *arg1 = (Agraph_t *) 0 ;
5571 void *argp1 = 0 ;
5572 int res1 = 0 ;
5573 bool result;
5574 VALUE vresult = Qnil;
5575
5576 if ((argc < 1) || (argc > 1)) {
5577 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
5578 }
5579 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
5580 if (!SWIG_IsOK(res1)) {
5581 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","rm", 1, argv[0] ));
5582 }
5583 arg1 = reinterpret_cast< Agraph_t * >(argp1);
5584 result = (bool)rm(arg1);
5585 vresult = SWIG_From_bool(static_cast< bool >(result));
5586 return vresult;
5587fail:
5588 return Qnil;
5589}
5590
5591
5592SWIGINTERN VALUE
5593_wrap_rm__SWIG_1(int argc, VALUE *argv, VALUE self) {
5594 Agnode_t *arg1 = (Agnode_t *) 0 ;
5595 void *argp1 = 0 ;
5596 int res1 = 0 ;
5597 bool result;
5598 VALUE vresult = Qnil;
5599
5600 if ((argc < 1) || (argc > 1)) {
5601 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
5602 }
5603 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agnode_t, 0 | 0 );
5604 if (!SWIG_IsOK(res1)) {
5605 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agnode_t *","rm", 1, argv[0] ));
5606 }
5607 arg1 = reinterpret_cast< Agnode_t * >(argp1);
5608 result = (bool)rm(arg1);
5609 vresult = SWIG_From_bool(static_cast< bool >(result));
5610 return vresult;
5611fail:
5612 return Qnil;
5613}
5614
5615
5616SWIGINTERN VALUE
5617_wrap_rm__SWIG_2(int argc, VALUE *argv, VALUE self) {
5618 Agedge_t *arg1 = (Agedge_t *) 0 ;
5619 void *argp1 = 0 ;
5620 int res1 = 0 ;
5621 bool result;
5622 VALUE vresult = Qnil;
5623
5624 if ((argc < 1) || (argc > 1)) {
5625 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
5626 }
5627 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agedge_t, 0 | 0 );
5628 if (!SWIG_IsOK(res1)) {
5629 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agedge_t *","rm", 1, argv[0] ));
5630 }
5631 arg1 = reinterpret_cast< Agedge_t * >(argp1);
5632 result = (bool)rm(arg1);
5633 vresult = SWIG_From_bool(static_cast< bool >(result));
5634 return vresult;
5635fail:
5636 return Qnil;
5637}
5638
5639
5640SWIGINTERN VALUE _wrap_rm(int nargs, VALUE *args, VALUE self) {
5641 int argc;
5642 VALUE argv[1];
5643 int ii;
5644
5645 argc = nargs;
5646 if (argc > 1) SWIG_fail;
5647 for (ii = 0; (ii < argc); ++ii) {
5648 argv[ii] = args[ii];
5649 }
5650 if (argc == 1) {
5651 int _v = 0;
5652 void *vptr = 0;
5653 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agraph_t, 0);
5654 _v = SWIG_CheckState(res);
5655 if (_v) {
5656 return _wrap_rm__SWIG_0(nargs, args, self);
5657 }
5658 }
5659 if (argc == 1) {
5660 int _v = 0;
5661 void *vptr = 0;
5662 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agnode_t, 0);
5663 _v = SWIG_CheckState(res);
5664 if (_v) {
5665 return _wrap_rm__SWIG_1(nargs, args, self);
5666 }
5667 }
5668 if (argc == 1) {
5669 int _v = 0;
5670 void *vptr = 0;
5671 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agedge_t, 0);
5672 _v = SWIG_CheckState(res);
5673 if (_v) {
5674 return _wrap_rm__SWIG_2(nargs, args, self);
5675 }
5676 }
5677
5678fail:
5679 Ruby_Format_OverloadedError( argc, 1, "rm",
5680 " bool rm(Agraph_t *g)\n"
5681 " bool rm(Agnode_t *n)\n"
5682 " bool rm(Agedge_t *e)\n");
5683
5684 return Qnil;
5685}
5686
5687
5688SWIGINTERN VALUE
5689_wrap_layout(int argc, VALUE *argv, VALUE self) {
5690 Agraph_t *arg1 = (Agraph_t *) 0 ;
5691 char *arg2 = (char *) 0 ;
5692 void *argp1 = 0 ;
5693 int res1 = 0 ;
5694 int res2 ;
5695 char *buf2 = 0 ;
5696 int alloc2 = 0 ;
5697 bool result;
5698 VALUE vresult = Qnil;
5699
5700 if ((argc < 2) || (argc > 2)) {
5701 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
5702 }
5703 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
5704 if (!SWIG_IsOK(res1)) {
5705 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","layout", 1, argv[0] ));
5706 }
5707 arg1 = reinterpret_cast< Agraph_t * >(argp1);
5708 res2 = SWIG_AsCharPtrAndSize(argv[1], &buf2, NULL, &alloc2);
5709 if (!SWIG_IsOK(res2)) {
5710 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "char const *","layout", 2, argv[1] ));
5711 }
5712 arg2 = reinterpret_cast< char * >(buf2);
5713 result = (bool)layout(arg1,(char const *)arg2);
5714 vresult = SWIG_From_bool(static_cast< bool >(result));
5715 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
5716 return vresult;
5717fail:
5718 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
5719 return Qnil;
5720}
5721
5722
5723SWIGINTERN VALUE
5724_wrap_render__SWIG_0(int argc, VALUE *argv, VALUE self) {
5725 Agraph_t *arg1 = (Agraph_t *) 0 ;
5726 void *argp1 = 0 ;
5727 int res1 = 0 ;
5728 bool result;
5729 VALUE vresult = Qnil;
5730
5731 if ((argc < 1) || (argc > 1)) {
5732 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
5733 }
5734 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
5735 if (!SWIG_IsOK(res1)) {
5736 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","render", 1, argv[0] ));
5737 }
5738 arg1 = reinterpret_cast< Agraph_t * >(argp1);
5739 result = (bool)render(arg1);
5740 vresult = SWIG_From_bool(static_cast< bool >(result));
5741 return vresult;
5742fail:
5743 return Qnil;
5744}
5745
5746
5747SWIGINTERN VALUE
5748_wrap_render__SWIG_1(int argc, VALUE *argv, VALUE self) {
5749 Agraph_t *arg1 = (Agraph_t *) 0 ;
5750 char *arg2 = (char *) 0 ;
5751 void *argp1 = 0 ;
5752 int res1 = 0 ;
5753 int res2 ;
5754 char *buf2 = 0 ;
5755 int alloc2 = 0 ;
5756 bool result;
5757 VALUE vresult = Qnil;
5758
5759 if ((argc < 2) || (argc > 2)) {
5760 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
5761 }
5762 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
5763 if (!SWIG_IsOK(res1)) {
5764 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","render", 1, argv[0] ));
5765 }
5766 arg1 = reinterpret_cast< Agraph_t * >(argp1);
5767 res2 = SWIG_AsCharPtrAndSize(argv[1], &buf2, NULL, &alloc2);
5768 if (!SWIG_IsOK(res2)) {
5769 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "char const *","render", 2, argv[1] ));
5770 }
5771 arg2 = reinterpret_cast< char * >(buf2);
5772 result = (bool)render(arg1,(char const *)arg2);
5773 vresult = SWIG_From_bool(static_cast< bool >(result));
5774 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
5775 return vresult;
5776fail:
5777 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
5778 return Qnil;
5779}
5780
5781
5782SWIGINTERN VALUE
5783_wrap_render__SWIG_2(int argc, VALUE *argv, VALUE self) {
5784 Agraph_t *arg1 = (Agraph_t *) 0 ;
5785 char *arg2 = (char *) 0 ;
5786 FILE *arg3 = (FILE *) 0 ;
5787 void *argp1 = 0 ;
5788 int res1 = 0 ;
5789 int res2 ;
5790 char *buf2 = 0 ;
5791 int alloc2 = 0 ;
5792 void *argp3 = 0 ;
5793 int res3 = 0 ;
5794 bool result;
5795 VALUE vresult = Qnil;
5796
5797 if ((argc < 3) || (argc > 3)) {
5798 rb_raise(rb_eArgError, "wrong # of arguments(%d for 3)",argc); SWIG_fail;
5799 }
5800 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
5801 if (!SWIG_IsOK(res1)) {
5802 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","render", 1, argv[0] ));
5803 }
5804 arg1 = reinterpret_cast< Agraph_t * >(argp1);
5805 res2 = SWIG_AsCharPtrAndSize(argv[1], &buf2, NULL, &alloc2);
5806 if (!SWIG_IsOK(res2)) {
5807 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "char const *","render", 2, argv[1] ));
5808 }
5809 arg2 = reinterpret_cast< char * >(buf2);
5810 res3 = SWIG_ConvertPtr(argv[2], &argp3,SWIGTYPE_p_FILE, 0 | 0 );
5811 if (!SWIG_IsOK(res3)) {
5812 SWIG_exception_fail(SWIG_ArgError(res3), Ruby_Format_TypeError( "", "FILE *","render", 3, argv[2] ));
5813 }
5814 arg3 = reinterpret_cast< FILE * >(argp3);
5815 result = (bool)render(arg1,(char const *)arg2,arg3);
5816 vresult = SWIG_From_bool(static_cast< bool >(result));
5817 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
5818 return vresult;
5819fail:
5820 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
5821 return Qnil;
5822}
5823
5824
5825SWIGINTERN VALUE
5826_wrap_render__SWIG_3(int argc, VALUE *argv, VALUE self) {
5827 Agraph_t *arg1 = (Agraph_t *) 0 ;
5828 char *arg2 = (char *) 0 ;
5829 char *arg3 = (char *) 0 ;
5830 void *argp1 = 0 ;
5831 int res1 = 0 ;
5832 int res2 ;
5833 char *buf2 = 0 ;
5834 int alloc2 = 0 ;
5835 int res3 ;
5836 char *buf3 = 0 ;
5837 int alloc3 = 0 ;
5838 bool result;
5839 VALUE vresult = Qnil;
5840
5841 if ((argc < 3) || (argc > 3)) {
5842 rb_raise(rb_eArgError, "wrong # of arguments(%d for 3)",argc); SWIG_fail;
5843 }
5844 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
5845 if (!SWIG_IsOK(res1)) {
5846 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","render", 1, argv[0] ));
5847 }
5848 arg1 = reinterpret_cast< Agraph_t * >(argp1);
5849 res2 = SWIG_AsCharPtrAndSize(argv[1], &buf2, NULL, &alloc2);
5850 if (!SWIG_IsOK(res2)) {
5851 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "char const *","render", 2, argv[1] ));
5852 }
5853 arg2 = reinterpret_cast< char * >(buf2);
5854 res3 = SWIG_AsCharPtrAndSize(argv[2], &buf3, NULL, &alloc3);
5855 if (!SWIG_IsOK(res3)) {
5856 SWIG_exception_fail(SWIG_ArgError(res3), Ruby_Format_TypeError( "", "char const *","render", 3, argv[2] ));
5857 }
5858 arg3 = reinterpret_cast< char * >(buf3);
5859 result = (bool)render(arg1,(char const *)arg2,(char const *)arg3);
5860 vresult = SWIG_From_bool(static_cast< bool >(result));
5861 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
5862 if (alloc3 == SWIG_NEWOBJ) delete[] buf3;
5863 return vresult;
5864fail:
5865 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
5866 if (alloc3 == SWIG_NEWOBJ) delete[] buf3;
5867 return Qnil;
5868}
5869
5870
5871SWIGINTERN VALUE _wrap_render(int nargs, VALUE *args, VALUE self) {
5872 int argc;
5873 VALUE argv[3];
5874 int ii;
5875
5876 argc = nargs;
5877 if (argc > 3) SWIG_fail;
5878 for (ii = 0; (ii < argc); ++ii) {
5879 argv[ii] = args[ii];
5880 }
5881 if (argc == 1) {
5882 int _v = 0;
5883 void *vptr = 0;
5884 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agraph_t, 0);
5885 _v = SWIG_CheckState(res);
5886 if (_v) {
5887 return _wrap_render__SWIG_0(nargs, args, self);
5888 }
5889 }
5890 if (argc == 2) {
5891 int _v = 0;
5892 void *vptr = 0;
5893 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agraph_t, 0);
5894 _v = SWIG_CheckState(res);
5895 if (_v) {
5896 int res = SWIG_AsCharPtrAndSize(argv[1], 0, NULL, 0);
5897 _v = SWIG_CheckState(res);
5898 if (_v) {
5899 return _wrap_render__SWIG_1(nargs, args, self);
5900 }
5901 }
5902 }
5903 if (argc == 3) {
5904 int _v = 0;
5905 void *vptr = 0;
5906 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agraph_t, 0);
5907 _v = SWIG_CheckState(res);
5908 if (_v) {
5909 int res = SWIG_AsCharPtrAndSize(argv[1], 0, NULL, 0);
5910 _v = SWIG_CheckState(res);
5911 if (_v) {
5912 void *vptr = 0;
5913 int res = SWIG_ConvertPtr(argv[2], &vptr, SWIGTYPE_p_FILE, 0);
5914 _v = SWIG_CheckState(res);
5915 if (_v) {
5916 return _wrap_render__SWIG_2(nargs, args, self);
5917 }
5918 }
5919 }
5920 }
5921 if (argc == 3) {
5922 int _v = 0;
5923 void *vptr = 0;
5924 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agraph_t, 0);
5925 _v = SWIG_CheckState(res);
5926 if (_v) {
5927 int res = SWIG_AsCharPtrAndSize(argv[1], 0, NULL, 0);
5928 _v = SWIG_CheckState(res);
5929 if (_v) {
5930 int res = SWIG_AsCharPtrAndSize(argv[2], 0, NULL, 0);
5931 _v = SWIG_CheckState(res);
5932 if (_v) {
5933 return _wrap_render__SWIG_3(nargs, args, self);
5934 }
5935 }
5936 }
5937 }
5938
5939fail:
5940 Ruby_Format_OverloadedError( argc, 3, "render",
5941 " bool render(Agraph_t *g)\n"
5942 " bool render(Agraph_t *g, char const *format)\n"
5943 " bool render(Agraph_t *g, char const *format, FILE *fout)\n"
5944 " bool render(Agraph_t *g, char const *format, char const *filename)\n");
5945
5946 return Qnil;
5947}
5948
5949
5950SWIGINTERN VALUE
5951_wrap_renderresult(int argc, VALUE *argv, VALUE self) {
5952 Agraph_t *arg1 = (Agraph_t *) 0 ;
5953 char *arg2 = (char *) 0 ;
5954 char *arg3 = (char *) 0 ;
5955 void *argp1 = 0 ;
5956 int res1 = 0 ;
5957 int res2 ;
5958 char *buf2 = 0 ;
5959 int alloc2 = 0 ;
5960 int res3 ;
5961 char *buf3 = 0 ;
5962 int alloc3 = 0 ;
5963
5964 if ((argc < 3) || (argc > 3)) {
5965 rb_raise(rb_eArgError, "wrong # of arguments(%d for 3)",argc); SWIG_fail;
5966 }
5967 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
5968 if (!SWIG_IsOK(res1)) {
5969 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","renderresult", 1, argv[0] ));
5970 }
5971 arg1 = reinterpret_cast< Agraph_t * >(argp1);
5972 res2 = SWIG_AsCharPtrAndSize(argv[1], &buf2, NULL, &alloc2);
5973 if (!SWIG_IsOK(res2)) {
5974 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "char const *","renderresult", 2, argv[1] ));
5975 }
5976 arg2 = reinterpret_cast< char * >(buf2);
5977 res3 = SWIG_AsCharPtrAndSize(argv[2], &buf3, NULL, &alloc3);
5978 if (!SWIG_IsOK(res3)) {
5979 SWIG_exception_fail(SWIG_ArgError(res3), Ruby_Format_TypeError( "", "char *","renderresult", 3, argv[2] ));
5980 }
5981 arg3 = reinterpret_cast< char * >(buf3);
5982 renderresult(arg1,(char const *)arg2,arg3);
5983 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
5984 if (alloc3 == SWIG_NEWOBJ) delete[] buf3;
5985 return Qnil;
5986fail:
5987 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
5988 if (alloc3 == SWIG_NEWOBJ) delete[] buf3;
5989 return Qnil;
5990}
5991
5992
5993SWIGINTERN VALUE
5994_wrap_renderchannel(int argc, VALUE *argv, VALUE self) {
5995 Agraph_t *arg1 = (Agraph_t *) 0 ;
5996 char *arg2 = (char *) 0 ;
5997 char *arg3 = (char *) 0 ;
5998 void *argp1 = 0 ;
5999 int res1 = 0 ;
6000 int res2 ;
6001 char *buf2 = 0 ;
6002 int alloc2 = 0 ;
6003 int res3 ;
6004 char *buf3 = 0 ;
6005 int alloc3 = 0 ;
6006 bool result;
6007 VALUE vresult = Qnil;
6008
6009 if ((argc < 3) || (argc > 3)) {
6010 rb_raise(rb_eArgError, "wrong # of arguments(%d for 3)",argc); SWIG_fail;
6011 }
6012 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
6013 if (!SWIG_IsOK(res1)) {
6014 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","renderchannel", 1, argv[0] ));
6015 }
6016 arg1 = reinterpret_cast< Agraph_t * >(argp1);
6017 res2 = SWIG_AsCharPtrAndSize(argv[1], &buf2, NULL, &alloc2);
6018 if (!SWIG_IsOK(res2)) {
6019 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "char const *","renderchannel", 2, argv[1] ));
6020 }
6021 arg2 = reinterpret_cast< char * >(buf2);
6022 res3 = SWIG_AsCharPtrAndSize(argv[2], &buf3, NULL, &alloc3);
6023 if (!SWIG_IsOK(res3)) {
6024 SWIG_exception_fail(SWIG_ArgError(res3), Ruby_Format_TypeError( "", "char const *","renderchannel", 3, argv[2] ));
6025 }
6026 arg3 = reinterpret_cast< char * >(buf3);
6027 result = (bool)renderchannel(arg1,(char const *)arg2,(char const *)arg3);
6028 vresult = SWIG_From_bool(static_cast< bool >(result));
6029 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
6030 if (alloc3 == SWIG_NEWOBJ) delete[] buf3;
6031 return vresult;
6032fail:
6033 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
6034 if (alloc3 == SWIG_NEWOBJ) delete[] buf3;
6035 return Qnil;
6036}
6037
6038
6039SWIGINTERN VALUE
6040_wrap_renderdata(int argc, VALUE *argv, VALUE self) {
6041 Agraph_t *arg1 = (Agraph_t *) 0 ;
6042 char *arg2 = (char *) 0 ;
6043 void *argp1 = 0 ;
6044 int res1 = 0 ;
6045 int res2 ;
6046 char *buf2 = 0 ;
6047 int alloc2 = 0 ;
6048 char *result = 0 ;
6049 VALUE vresult = Qnil;
6050
6051 if ((argc < 2) || (argc > 2)) {
6052 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
6053 }
6054 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
6055 if (!SWIG_IsOK(res1)) {
6056 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","renderdata", 1, argv[0] ));
6057 }
6058 arg1 = reinterpret_cast< Agraph_t * >(argp1);
6059 res2 = SWIG_AsCharPtrAndSize(argv[1], &buf2, NULL, &alloc2);
6060 if (!SWIG_IsOK(res2)) {
6061 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "char const *","renderdata", 2, argv[1] ));
6062 }
6063 arg2 = reinterpret_cast< char * >(buf2);
6064 result = (char *)renderdata(arg1,(char const *)arg2);
6065 vresult = SWIG_FromCharPtr((const char *)result);
6066 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
6067 return vresult;
6068fail:
6069 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
6070 return Qnil;
6071}
6072
6073
6074SWIGINTERN VALUE
6075_wrap_write__SWIG_0(int argc, VALUE *argv, VALUE self) {
6076 Agraph_t *arg1 = (Agraph_t *) 0 ;
6077 char *arg2 = (char *) 0 ;
6078 void *argp1 = 0 ;
6079 int res1 = 0 ;
6080 int res2 ;
6081 char *buf2 = 0 ;
6082 int alloc2 = 0 ;
6083 bool result;
6084 VALUE vresult = Qnil;
6085
6086 if ((argc < 2) || (argc > 2)) {
6087 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
6088 }
6089 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
6090 if (!SWIG_IsOK(res1)) {
6091 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","write", 1, argv[0] ));
6092 }
6093 arg1 = reinterpret_cast< Agraph_t * >(argp1);
6094 res2 = SWIG_AsCharPtrAndSize(argv[1], &buf2, NULL, &alloc2);
6095 if (!SWIG_IsOK(res2)) {
6096 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "char const *","write", 2, argv[1] ));
6097 }
6098 arg2 = reinterpret_cast< char * >(buf2);
6099 result = (bool)write(arg1,(char const *)arg2);
6100 vresult = SWIG_From_bool(static_cast< bool >(result));
6101 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
6102 return vresult;
6103fail:
6104 if (alloc2 == SWIG_NEWOBJ) delete[] buf2;
6105 return Qnil;
6106}
6107
6108
6109SWIGINTERN VALUE
6110_wrap_write__SWIG_1(int argc, VALUE *argv, VALUE self) {
6111 Agraph_t *arg1 = (Agraph_t *) 0 ;
6112 FILE *arg2 = (FILE *) 0 ;
6113 void *argp1 = 0 ;
6114 int res1 = 0 ;
6115 void *argp2 = 0 ;
6116 int res2 = 0 ;
6117 bool result;
6118 VALUE vresult = Qnil;
6119
6120 if ((argc < 2) || (argc > 2)) {
6121 rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
6122 }
6123 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
6124 if (!SWIG_IsOK(res1)) {
6125 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","write", 1, argv[0] ));
6126 }
6127 arg1 = reinterpret_cast< Agraph_t * >(argp1);
6128 res2 = SWIG_ConvertPtr(argv[1], &argp2,SWIGTYPE_p_FILE, 0 | 0 );
6129 if (!SWIG_IsOK(res2)) {
6130 SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "FILE *","write", 2, argv[1] ));
6131 }
6132 arg2 = reinterpret_cast< FILE * >(argp2);
6133 result = (bool)write(arg1,arg2);
6134 vresult = SWIG_From_bool(static_cast< bool >(result));
6135 return vresult;
6136fail:
6137 return Qnil;
6138}
6139
6140
6141SWIGINTERN VALUE _wrap_write(int nargs, VALUE *args, VALUE self) {
6142 int argc;
6143 VALUE argv[2];
6144 int ii;
6145
6146 argc = nargs;
6147 if (argc > 2) SWIG_fail;
6148 for (ii = 0; (ii < argc); ++ii) {
6149 argv[ii] = args[ii];
6150 }
6151 if (argc == 2) {
6152 int _v = 0;
6153 void *vptr = 0;
6154 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agraph_t, 0);
6155 _v = SWIG_CheckState(res);
6156 if (_v) {
6157 void *vptr = 0;
6158 int res = SWIG_ConvertPtr(argv[1], &vptr, SWIGTYPE_p_FILE, 0);
6159 _v = SWIG_CheckState(res);
6160 if (_v) {
6161 return _wrap_write__SWIG_1(nargs, args, self);
6162 }
6163 }
6164 }
6165 if (argc == 2) {
6166 int _v = 0;
6167 void *vptr = 0;
6168 int res = SWIG_ConvertPtr(argv[0], &vptr, SWIGTYPE_p_Agraph_t, 0);
6169 _v = SWIG_CheckState(res);
6170 if (_v) {
6171 int res = SWIG_AsCharPtrAndSize(argv[1], 0, NULL, 0);
6172 _v = SWIG_CheckState(res);
6173 if (_v) {
6174 return _wrap_write__SWIG_0(nargs, args, self);
6175 }
6176 }
6177 }
6178
6179fail:
6180 Ruby_Format_OverloadedError( argc, 2, "write",
6181 " bool write(Agraph_t *g, char const *filename)\n"
6182 " bool write(Agraph_t *g, FILE *f)\n");
6183
6184 return Qnil;
6185}
6186
6187
6188SWIGINTERN VALUE
6189_wrap_tred(int argc, VALUE *argv, VALUE self) {
6190 Agraph_t *arg1 = (Agraph_t *) 0 ;
6191 void *argp1 = 0 ;
6192 int res1 = 0 ;
6193 bool result;
6194 VALUE vresult = Qnil;
6195
6196 if ((argc < 1) || (argc > 1)) {
6197 rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
6198 }
6199 res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_Agraph_t, 0 | 0 );
6200 if (!SWIG_IsOK(res1)) {
6201 SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "Agraph_t *","tred", 1, argv[0] ));
6202 }
6203 arg1 = reinterpret_cast< Agraph_t * >(argp1);
6204 result = (bool)tred(arg1);
6205 vresult = SWIG_From_bool(static_cast< bool >(result));
6206 return vresult;
6207fail:
6208 return Qnil;
6209}
6210
6211
6212
6213/* -------- TYPE CONVERSION AND EQUIVALENCE RULES (BEGIN) -------- */
6214
6215static swig_type_info _swigt__p_Agedge_t = {"_p_Agedge_t", "Agedge_t *", 0, 0, (void*)0, 0};
6216static swig_type_info _swigt__p_Agnode_t = {"_p_Agnode_t", "Agnode_t *", 0, 0, (void*)0, 0};
6217static swig_type_info _swigt__p_Agraph_t = {"_p_Agraph_t", "Agraph_t *", 0, 0, (void*)0, 0};
6218static swig_type_info _swigt__p_Agsym_t = {"_p_Agsym_t", "Agsym_t *", 0, 0, (void*)0, 0};
6219static swig_type_info _swigt__p_FILE = {"_p_FILE", "FILE *", 0, 0, (void*)0, 0};
6220static swig_type_info _swigt__p_char = {"_p_char", "char *", 0, 0, (void*)0, 0};
6221
6230
6231static swig_cast_info _swigc__p_Agedge_t[] = { {&_swigt__p_Agedge_t, 0, 0, 0},{0, 0, 0, 0}};
6232static swig_cast_info _swigc__p_Agnode_t[] = { {&_swigt__p_Agnode_t, 0, 0, 0},{0, 0, 0, 0}};
6233static swig_cast_info _swigc__p_Agraph_t[] = { {&_swigt__p_Agraph_t, 0, 0, 0},{0, 0, 0, 0}};
6234static swig_cast_info _swigc__p_Agsym_t[] = { {&_swigt__p_Agsym_t, 0, 0, 0},{0, 0, 0, 0}};
6235static swig_cast_info _swigc__p_FILE[] = { {&_swigt__p_FILE, 0, 0, 0},{0, 0, 0, 0}};
6236static swig_cast_info _swigc__p_char[] = { {&_swigt__p_char, 0, 0, 0},{0, 0, 0, 0}};
6237
6246
6247
6248/* -------- TYPE CONVERSION AND EQUIVALENCE RULES (END) -------- */
6249
6250/* -----------------------------------------------------------------------------
6251 * Type initialization:
6252 * This problem is tough by the requirement that no dynamic
6253 * memory is used. Also, since swig_type_info structures store pointers to
6254 * swig_cast_info structures and swig_cast_info structures store pointers back
6255 * to swig_type_info structures, we need some lookup code at initialization.
6256 * The idea is that swig generates all the structures that are needed.
6257 * The runtime then collects these partially filled structures.
6258 * The SWIG_InitializeModule function takes these initial arrays out of
6259 * swig_module, and does all the lookup, filling in the swig_module.types
6260 * array with the correct data and linking the correct swig_cast_info
6261 * structures together.
6262 *
6263 * The generated swig_type_info structures are assigned statically to an initial
6264 * array. We just loop through that array, and handle each type individually.
6265 * First we lookup if this type has been already loaded, and if so, use the
6266 * loaded structure instead of the generated one. Then we have to fill in the
6267 * cast linked list. The cast data is initially stored in something like a
6268 * two-dimensional array. Each row corresponds to a type (there are the same
6269 * number of rows as there are in the swig_type_initial array). Each entry in
6270 * a column is one of the swig_cast_info structures for that type.
6271 * The cast_initial array is actually an array of arrays, because each row has
6272 * a variable number of columns. So to actually build the cast linked list,
6273 * we find the array of casts associated with the type, and loop through it
6274 * adding the casts to the list. The one last trick we need to do is making
6275 * sure the type pointer in the swig_cast_info struct is correct.
6276 *
6277 * First off, we lookup the cast->type name to see if it is already loaded.
6278 * There are three cases to handle:
6279 * 1) If the cast->type has already been loaded AND the type we are adding
6280 * casting info to has not been loaded (it is in this module), THEN we
6281 * replace the cast->type pointer with the type pointer that has already
6282 * been loaded.
6283 * 2) If BOTH types (the one we are adding casting info to, and the
6284 * cast->type) are loaded, THEN the cast info has already been loaded by
6285 * the previous module so we just ignore it.
6286 * 3) Finally, if cast->type has not already been loaded, then we add that
6287 * swig_cast_info to the linked list (because the cast->type) pointer will
6288 * be correct.
6289 * ----------------------------------------------------------------------------- */
6290
6291#ifdef __cplusplus
6292extern "C" {
6293#if 0
6294} /* c-mode */
6295#endif
6296#endif
6297
6298#if 0
6299#define SWIGRUNTIME_DEBUG
6300#endif
6301
6302#ifndef SWIG_INIT_CLIENT_DATA_TYPE
6303#define SWIG_INIT_CLIENT_DATA_TYPE void *
6304#endif
6305
6306SWIGRUNTIME void
6308 size_t i;
6309 swig_module_info *module_head, *iter;
6310 int init;
6311
6312 /* check to see if the circular list has been setup, if not, set it up */
6313 if (swig_module.next==0) {
6314 /* Initialize the swig_module */
6318 init = 1;
6319 } else {
6320 init = 0;
6321 }
6322
6323 /* Try and load any already created modules */
6324 module_head = SWIG_GetModule(clientdata);
6325 if (!module_head) {
6326 /* This is the first module loaded for this interpreter */
6327 /* so set the swig module into the interpreter */
6328 SWIG_SetModule(clientdata, &swig_module);
6329 } else {
6330 /* the interpreter has loaded a SWIG module, but has it loaded this one? */
6331 iter=module_head;
6332 do {
6333 if (iter==&swig_module) {
6334 /* Our module is already in the list, so there's nothing more to do. */
6335 return;
6336 }
6337 iter=iter->next;
6338 } while (iter!= module_head);
6339
6340 /* otherwise we must add our module into the list */
6341 swig_module.next = module_head->next;
6342 module_head->next = &swig_module;
6343 }
6344
6345 /* When multiple interpreters are used, a module could have already been initialized in
6346 a different interpreter, but not yet have a pointer in this interpreter.
6347 In this case, we do not want to continue adding types... everything should be
6348 set up already */
6349 if (init == 0) return;
6350
6351 /* Now work on filling in swig_module.types */
6352#ifdef SWIGRUNTIME_DEBUG
6353 printf("SWIG_InitializeModule: size %lu\n", (unsigned long)swig_module.size);
6354#endif
6355 for (i = 0; i < swig_module.size; ++i) {
6356 swig_type_info *type = 0;
6357 swig_type_info *ret;
6358 swig_cast_info *cast;
6359
6360#ifdef SWIGRUNTIME_DEBUG
6361 printf("SWIG_InitializeModule: type %lu %s\n", (unsigned long)i, swig_module.type_initial[i]->name);
6362#endif
6363
6364 /* if there is another module already loaded */
6365 if (swig_module.next != &swig_module) {
6367 }
6368 if (type) {
6369 /* Overwrite clientdata field */
6370#ifdef SWIGRUNTIME_DEBUG
6371 printf("SWIG_InitializeModule: found type %s\n", type->name);
6372#endif
6374 type->clientdata = swig_module.type_initial[i]->clientdata;
6375#ifdef SWIGRUNTIME_DEBUG
6376 printf("SWIG_InitializeModule: found and overwrite type %s \n", type->name);
6377#endif
6378 }
6379 } else {
6381 }
6382
6383 /* Insert casting types */
6384 cast = swig_module.cast_initial[i];
6385 while (cast->type) {
6386
6387 /* Don't need to add information already in the list */
6388 ret = 0;
6389#ifdef SWIGRUNTIME_DEBUG
6390 printf("SWIG_InitializeModule: look cast %s\n", cast->type->name);
6391#endif
6392 if (swig_module.next != &swig_module) {
6394#ifdef SWIGRUNTIME_DEBUG
6395 if (ret) printf("SWIG_InitializeModule: found cast %s\n", ret->name);
6396#endif
6397 }
6398 if (ret) {
6399 if (type == swig_module.type_initial[i]) {
6400#ifdef SWIGRUNTIME_DEBUG
6401 printf("SWIG_InitializeModule: skip old type %s\n", ret->name);
6402#endif
6403 cast->type = ret;
6404 ret = 0;
6405 } else {
6406 /* Check for casting already in the list */
6407 swig_cast_info *ocast = SWIG_TypeCheck(ret->name, type);
6408#ifdef SWIGRUNTIME_DEBUG
6409 if (ocast) printf("SWIG_InitializeModule: skip old cast %s\n", ret->name);
6410#endif
6411 if (!ocast) ret = 0;
6412 }
6413 }
6414
6415 if (!ret) {
6416#ifdef SWIGRUNTIME_DEBUG
6417 printf("SWIG_InitializeModule: adding cast %s\n", cast->type->name);
6418#endif
6419 if (type->cast) {
6420 type->cast->prev = cast;
6421 cast->next = type->cast;
6422 }
6423 type->cast = cast;
6424 }
6425 cast++;
6426 }
6427 /* Set entry in modules->types array equal to the type */
6428 swig_module.types[i] = type;
6429 }
6430 swig_module.types[i] = 0;
6431
6432#ifdef SWIGRUNTIME_DEBUG
6433 printf("**** SWIG_InitializeModule: Cast List ******\n");
6434 for (i = 0; i < swig_module.size; ++i) {
6435 int j = 0;
6437 printf("SWIG_InitializeModule: type %lu %s\n", (unsigned long)i, swig_module.type_initial[i]->name);
6438 while (cast->type) {
6439 printf("SWIG_InitializeModule: cast type %s\n", cast->type->name);
6440 cast++;
6441 ++j;
6442 }
6443 printf("---- Total casts: %d\n",j);
6444 }
6445 printf("**** SWIG_InitializeModule: Cast List ******\n");
6446#endif
6447}
6448
6449/* This function will propagate the clientdata field of type to
6450* any new swig_type_info structures that have been added into the list
6451* of equivalent types. It is like calling
6452* SWIG_TypeClientData(type, clientdata) a second time.
6453*/
6454SWIGRUNTIME void
6456 size_t i;
6457 swig_cast_info *equiv;
6458 static int init_run = 0;
6459
6460 if (init_run) return;
6461 init_run = 1;
6462
6463 for (i = 0; i < swig_module.size; i++) {
6464 if (swig_module.types[i]->clientdata) {
6465 equiv = swig_module.types[i]->cast;
6466 while (equiv) {
6467 if (!equiv->converter) {
6468 if (equiv->type && !equiv->type->clientdata)
6470 }
6471 equiv = equiv->next;
6472 }
6473 }
6474 }
6475}
6476
6477#ifdef __cplusplus
6478#if 0
6479{ /* c-mode */
6480#endif
6481}
6482#endif
6483
6484/*
6485
6486*/
6487#ifdef __cplusplus
6488extern "C"
6489#endif
6491 size_t i;
6492
6494 mGv = rb_define_module("Gv");
6495
6497 for (i = 0; i < swig_module.size; i++) {
6499 }
6500
6502 rb_define_module_function(mGv, "digraph", VALUEFUNC(_wrap_digraph), -1);
6503 rb_define_module_function(mGv, "strictgraph", VALUEFUNC(_wrap_strictgraph), -1);
6504 rb_define_module_function(mGv, "strictdigraph", VALUEFUNC(_wrap_strictdigraph), -1);
6505 rb_define_module_function(mGv, "readstring", VALUEFUNC(_wrap_readstring), -1);
6506 rb_define_module_function(mGv, "read", VALUEFUNC(_wrap_read), -1);
6507 rb_define_module_function(mGv, "graph", VALUEFUNC(_wrap_graph), -1);
6508 rb_define_module_function(mGv, "node", VALUEFUNC(_wrap_node), -1);
6509 rb_define_module_function(mGv, "edge", VALUEFUNC(_wrap_edge), -1);
6510 rb_define_module_function(mGv, "setv", VALUEFUNC(_wrap_setv), -1);
6511 rb_define_module_function(mGv, "getv", VALUEFUNC(_wrap_getv), -1);
6512 rb_define_module_function(mGv, "nameof", VALUEFUNC(_wrap_nameof), -1);
6513 rb_define_module_function(mGv, "findsubg", VALUEFUNC(_wrap_findsubg), -1);
6514 rb_define_module_function(mGv, "findnode", VALUEFUNC(_wrap_findnode), -1);
6515 rb_define_module_function(mGv, "findedge", VALUEFUNC(_wrap_findedge), -1);
6516 rb_define_module_function(mGv, "findattr", VALUEFUNC(_wrap_findattr), -1);
6517 rb_define_module_function(mGv, "headof", VALUEFUNC(_wrap_headof), -1);
6518 rb_define_module_function(mGv, "tailof", VALUEFUNC(_wrap_tailof), -1);
6519 rb_define_module_function(mGv, "graphof", VALUEFUNC(_wrap_graphof), -1);
6520 rb_define_module_function(mGv, "rootof", VALUEFUNC(_wrap_rootof), -1);
6521 rb_define_module_function(mGv, "protonode", VALUEFUNC(_wrap_protonode), -1);
6522 rb_define_module_function(mGv, "protoedge", VALUEFUNC(_wrap_protoedge), -1);
6523 rb_define_module_function(mGv, "ok", VALUEFUNC(_wrap_ok), -1);
6524 rb_define_module_function(mGv, "firstsubg", VALUEFUNC(_wrap_firstsubg), -1);
6525 rb_define_module_function(mGv, "nextsubg", VALUEFUNC(_wrap_nextsubg), -1);
6526 rb_define_module_function(mGv, "firstsupg", VALUEFUNC(_wrap_firstsupg), -1);
6527 rb_define_module_function(mGv, "nextsupg", VALUEFUNC(_wrap_nextsupg), -1);
6528 rb_define_module_function(mGv, "firstedge", VALUEFUNC(_wrap_firstedge), -1);
6529 rb_define_module_function(mGv, "nextedge", VALUEFUNC(_wrap_nextedge), -1);
6530 rb_define_module_function(mGv, "firstout", VALUEFUNC(_wrap_firstout), -1);
6531 rb_define_module_function(mGv, "nextout", VALUEFUNC(_wrap_nextout), -1);
6532 rb_define_module_function(mGv, "firsthead", VALUEFUNC(_wrap_firsthead), -1);
6533 rb_define_module_function(mGv, "nexthead", VALUEFUNC(_wrap_nexthead), -1);
6534 rb_define_module_function(mGv, "firstin", VALUEFUNC(_wrap_firstin), -1);
6535 rb_define_module_function(mGv, "nextin", VALUEFUNC(_wrap_nextin), -1);
6536 rb_define_module_function(mGv, "firsttail", VALUEFUNC(_wrap_firsttail), -1);
6537 rb_define_module_function(mGv, "nexttail", VALUEFUNC(_wrap_nexttail), -1);
6538 rb_define_module_function(mGv, "firstnode", VALUEFUNC(_wrap_firstnode), -1);
6539 rb_define_module_function(mGv, "nextnode", VALUEFUNC(_wrap_nextnode), -1);
6540 rb_define_module_function(mGv, "firstattr", VALUEFUNC(_wrap_firstattr), -1);
6541 rb_define_module_function(mGv, "nextattr", VALUEFUNC(_wrap_nextattr), -1);
6542 rb_define_module_function(mGv, "rm", VALUEFUNC(_wrap_rm), -1);
6543 rb_define_module_function(mGv, "layout", VALUEFUNC(_wrap_layout), -1);
6544 rb_define_module_function(mGv, "render", VALUEFUNC(_wrap_render), -1);
6545 rb_define_module_function(mGv, "renderresult", VALUEFUNC(_wrap_renderresult), -1);
6546 rb_define_module_function(mGv, "renderchannel", VALUEFUNC(_wrap_renderchannel), -1);
6547 rb_define_module_function(mGv, "renderdata", VALUEFUNC(_wrap_renderdata), -1);
6548 rb_define_module_function(mGv, "write", VALUEFUNC(_wrap_write), -1);
6549 rb_define_module_function(mGv, "tred", VALUEFUNC(_wrap_tred), -1);
6550}
6551
int compare(Agobj_t *l, Agobj_t *r)
Definition actions.c:686
int verbose
Definition bcomps.c:62
static void init(int argc, char *argv[], double *angle, double *accuracy, int *check_edges_with_same_endpoint, int *seed, const char **color_scheme, int *lightness)
expr procedure type
Definition exparse.y:208
static int flags
Definition gc.c:61
#define TYPE
Definition gmlparse.c:360
#define ID
Definition gmlparse.c:376
void * malloc(YYSIZE_T)
void free(void *)
edge
Definition gmlparse.y:240
node NULL
Definition grammar.y:163
#define SWIG_MAXCASTRANK
Definition gv_perl.cpp:312
#define SWIG_CastRank(r)
Definition gv_perl.cpp:315
SWIGINTERN VALUE _wrap_getv__SWIG_4(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:3324
SWIGINTERN VALUE _wrap_setv__SWIG_4(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:2972
SWIGRUNTIME void SWIG_InitializeModule(SWIG_INIT_CLIENT_DATA_TYPE clientdata)
Definition gv_ruby.cpp:6307
static swig_type_info _swigt__p_Agsym_t
Definition gv_ruby.cpp:6218
SWIGINTERN VALUE getObjectPreviouslyDeletedError(void)
Definition gv_ruby.cpp:1100
bool ok(Agraph_t *g)
Definition gv.cpp:362
static swig_cast_info _swigc__p_Agraph_t[]
Definition gv_ruby.cpp:6233
SWIGINTERN VALUE _wrap_rm__SWIG_2(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:5617
SWIGRUNTIME VALUE getExceptionClass(void)
Definition gv_ruby.cpp:1519
SWIGINTERN VALUE _wrap_firstnode__SWIG_1(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:5148
static swig_cast_info * swig_cast_initial[]
Definition gv_ruby.cpp:6238
bool tred(Agraph_t *g)
Definition gv.cpp:728
Agraph_t * firstsubg(Agraph_t *g)
Definition gv.cpp:367
SWIGINTERN VALUE _wrap_getv__SWIG_3(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:3292
Agraph_t * read(const char *filename)
Definition gv.cpp:66
Agraph_t * nextsubg(Agraph_t *g, Agraph_t *sg)
Definition gv.cpp:373
Agraph_t * readstring(char *string)
Definition gv.cpp:54
SWIGRUNTIMEINLINE int SWIG_Ruby_CheckConvert(VALUE obj, swig_type_info *ty)
Definition gv_ruby.cpp:1766
SWIGINTERN VALUE _wrap_setv__SWIG_1(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:2837
#define RSTRING_PTR(x)
Definition gv_ruby.cpp:961
SWIGINTERN VALUE _wrap_nextnode__SWIG_0(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:5116
#define SWIG2NUM(v)
Definition gv_ruby.cpp:1250
SWIGINTERN VALUE _wrap_graphof__SWIG_2(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:3976
char * getv(Agraph_t *g, char *attr)
Definition gv.cpp:130
SWIGINTERN VALUE _wrap_protoedge(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:4096
Agraph_t * findsubg(Agraph_t *g, char *name)
Definition gv.cpp:247
#define SWIG_TypeQuery(name)
Definition gv_ruby.cpp:1895
SWIGINTERN VALUE _wrap_read__SWIG_0(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:2365
#define SWIG_POINTER_OWN
Definition gv_ruby.cpp:323
SWIGINTERN VALUE _wrap_firstnode(int nargs, VALUE *args, VALUE self)
Definition gv_ruby.cpp:5171
SWIGINTERN VALUE _wrap_firstsupg(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:4330
void renderresult(Agraph_t *g, const char *format, char *outdata)
Definition gv.cpp:690
#define SWIG_SyntaxError
Definition gv_ruby.cpp:880
SWIGINTERN VALUE _wrap_nextsupg(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:4354
static VALUE _mSWIG
Definition gv_ruby.cpp:1073
static ID swig_call_id
Definition gv_ruby.cpp:1485
#define SWIG_CheckState(r)
Definition gv_ruby.cpp:453
SWIGINTERN VALUE _wrap_tailof(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:3904
SWIGINTERN VALUE _wrap_render(int nargs, VALUE *args, VALUE self)
Definition gv_ruby.cpp:5871
static swig_cast_info _swigc__p_FILE[]
Definition gv_ruby.cpp:6235
SWIGRUNTIME int SWIG_TypeEquiv(const char *nb, const char *tb)
Definition gv_ruby.cpp:555
SWIGINTERN VALUE _wrap_nexttail(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:5060
SWIGINTERN VALUE _wrap_setv__SWIG_0(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:2791
#define SWIG_RUBY_INT_ANYARGS_FUNC(f)
Definition gv_ruby.cpp:1045
#define SWIG_TypeError
Definition gv_ruby.cpp:877
RUBY_EXTERN void Init_stack(VALUE *addr)
static VALUE swig_runtime_data_type_pointer
Definition gv_ruby.cpp:1481
#define SWIGTYPE_p_Agnode_t
Definition gv_ruby.cpp:1888
SWIGINTERN VALUE _wrap_nextout__SWIG_1(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:4702
SWIGINTERN VALUE _wrap_nextattr__SWIG_1(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:5370
struct swig_cast_info swig_cast_info
SWIGINTERN VALUE _wrap_firstattr__SWIG_2(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:5402
SWIGINTERN VALUE _wrap_getv(int nargs, VALUE *args, VALUE self)
Definition gv_ruby.cpp:3387
SWIGRUNTIME void SWIG_RubyAddTracking(void *ptr, VALUE object)
Definition gv_ruby.cpp:1307
SWIGRUNTIME int SWIG_TypeNameComp(const char *f1, const char *l1, const char *f2, const char *l2)
Definition gv_ruby.cpp:521
Agraph_t * strictgraph(char *name)
Definition gv.cpp:42
SWIGINTERN VALUE _wrap_render__SWIG_1(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:5748
static VALUE swig_ruby_trackings_count(ID id, VALUE *var)
Definition gv_ruby.cpp:1264
SWIGINTERN VALUE _wrap_protonode(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:4072
SWIGINTERN VALUE _wrap_ok__SWIG_2(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:4168
char * setv(Agraph_t *g, char *attr, char *val)
Definition gv.cpp:152
#define SWIG_RuntimeError
Definition gv_ruby.cpp:875
Agedge_t * nextout(Agraph_t *g, Agedge_t *e)
Definition gv.cpp:395
SWIGINTERN VALUE _wrap_graphof__SWIG_0(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:3928
SWIGINTERN VALUE _wrap_nextnode(int nargs, VALUE *args, VALUE self)
Definition gv_ruby.cpp:5241
#define SWIG_RUBY_VOID_ANYARGS_FUNC(f)
Definition gv_ruby.cpp:1044
Agraph_t * rootof(Agraph_t *g)
Definition gv.cpp:327
static swig_cast_info _swigc__p_Agnode_t[]
Definition gv_ruby.cpp:6232
#define VALUEFUNC(f)
Definition gv_ruby.cpp:1042
SWIGINTERN VALUE _wrap_firstattr(int nargs, VALUE *args, VALUE self)
Definition gv_ruby.cpp:5425
SWIGINTERN VALUE _wrap_render__SWIG_0(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:5724
Agnode_t * headof(Agedge_t *e)
Definition gv.cpp:287
#define SWIGRUNTIME
Definition gv_ruby.cpp:303
SWIGINTERNINLINE VALUE SWIG_FromCharPtrAndSize(const char *carray, size_t size)
Definition gv_ruby.cpp:2200
SWIGINTERN VALUE _wrap_firstedge__SWIG_0(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:4386
#define SWIGTYPE_p_Agraph_t
Definition gv_ruby.cpp:1889
#define SWIG_UnknownError
Definition gv_ruby.cpp:873
Agnode_t * firsttail(Agnode_t *n)
Definition gv.cpp:494
SWIGINTERN VALUE _wrap_ok__SWIG_1(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:4144
#define SWIG_RUNTIME_VERSION
Definition gv_ruby.cpp:282
#define SWIGTYPE_p_Agsym_t
Definition gv_ruby.cpp:1890
SWIGINTERN VALUE _wrap_read__SWIG_1(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:2392
Agraph_t * strictdigraph(char *name)
Definition gv.cpp:48
#define SWIG_OLDOBJ
Definition gv_ruby.cpp:424
SWIGRUNTIME void SWIG_TypeClientData(swig_type_info *ti, void *clientdata)
Definition gv_ruby.cpp:669
SWIGRUNTIME swig_type_info * SWIG_TypeQueryModule(swig_module_info *start, swig_module_info *end, const char *name)
Definition gv_ruby.cpp:744
SWIGINTERN VALUE _wrap_edge__SWIG_0(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:2564
#define SWIG_ValueError
Definition gv_ruby.cpp:881
bool renderchannel(Agraph_t *g, const char *format, const char *channelname)
Definition gv.cpp:648
Agraph_t * nextsupg(Agraph_t *g, Agraph_t *sg)
Definition gv.cpp:382
SWIGRUNTIME char * SWIG_PackDataName(char *buff, void *ptr, size_t sz, const char *name, size_t bsz)
Definition gv_ruby.cpp:841
#define SWIG_AddCast(r)
Definition gv_ruby.cpp:452
SWIGINTERN VALUE _wrap_setv__SWIG_3(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:2929
SWIGINTERN VALUE _wrap_nameof__SWIG_2(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:3541
#define SWIG_exception_fail(code, msg)
Definition gv_ruby.cpp:1879
SWIGRUNTIME void SWIG_Ruby_SetModule(swig_module_info *pointer)
Definition gv_ruby.cpp:1828
#define StringValuePtr(s)
Definition gv_ruby.cpp:1056
SWIGINTERN VALUE _wrap_digraph(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:2257
SWIGINTERN VALUE _wrap_ok__SWIG_0(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:4120
Agedge_t * firstedge(Agraph_t *g)
Definition gv.cpp:409
SWIGEXPORT void Init_gv(void)
Definition gv_ruby.cpp:6490
SWIGINTERN VALUE _wrap_edge__SWIG_1(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:2596
#define SWIG_InitRuntime()
Definition gv_ruby.cpp:1454
#define SWIG_AttributeError
Definition gv_ruby.cpp:883
#define rb_undef_alloc_func(klass)
Definition gv_ruby.cpp:1070
Agraph_t * graphof(Agraph_t *g)
Definition gv.cpp:303
SWIGRUNTIME const char * SWIG_UnpackVoidPtr(const char *c, void **ptr, const char *name)
Definition gv_ruby.cpp:828
SWIGINTERN VALUE _wrap_nextattr(int nargs, VALUE *args, VALUE self)
Definition gv_ruby.cpp:5505
static swig_module_info swig_module
Definition gv_ruby.cpp:1894
SWIGINTERN VALUE _wrap_graph__SWIG_1(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:2453
static ID swig_arity_id
Definition gv_ruby.cpp:1484
SWIGINTERN VALUE _wrap_graphof(int nargs, VALUE *args, VALUE self)
Definition gv_ruby.cpp:3999
SWIGINTERN VALUE _wrap_nextedge__SWIG_0(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:4410
SWIGINTERN VALUE _wrap_firstattr__SWIG_1(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:5346
char * nameof(Agraph_t *g)
Definition gv.cpp:343
SWIGINTERN VALUE _wrap_firstin__SWIG_0(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:4838
#define SWIG_SetModule(clientdata, pointer)
Definition gv_ruby.cpp:1442
#define SWIG_define_class(ty)
Definition gv_ruby.cpp:1455
SWIGRUNTIME void SWIG_RubyRemoveTracking(void *ptr)
Definition gv_ruby.cpp:1328
Agnode_t * firstnode(Agraph_t *g)
Definition gv.cpp:518
#define SWIG_INIT_CLIENT_DATA_TYPE
Definition gv_ruby.cpp:6303
#define SWIGUNUSEDPARM(p)
Definition gv_ruby.cpp:65
Agedge_t * firstout(Agraph_t *g)
Definition gv.cpp:384
SWIGINTERN VALUE _wrap_nextin__SWIG_0(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:4862
SWIGINTERN VALUE _wrap_getv__SWIG_1(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:3222
#define SWIG_POINTER_RELEASE
Definition gv_ruby.cpp:320
SWIGINTERN VALUE _wrap_firstedge(int nargs, VALUE *args, VALUE self)
Definition gv_ruby.cpp:4521
SWIGRUNTIME swig_type_info * SWIG_TypeDynamicCast(swig_type_info *ty, void **ptr)
Definition gv_ruby.cpp:625
#define SWIG_as_voidptr(a)
Definition gv_ruby.cpp:1957
SWIGINTERN swig_type_info * SWIG_pchar_descriptor(void)
Definition gv_ruby.cpp:2150
SWIGINTERN VALUE _wrap_firstsubg(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:4274
SWIGRUNTIME void SWIG_TypeNewClientData(swig_type_info *ti, void *clientdata)
Definition gv_ruby.cpp:685
SWIGRUNTIME void SWIG_RubyInitializeTrackings(void)
Definition gv_ruby.cpp:1270
SWIGINTERN VALUE _wrap_firstout(int nargs, VALUE *args, VALUE self)
Definition gv_ruby.cpp:4663
#define SWIG_POINTER_CLEAR
Definition gv_ruby.cpp:319
#define SWIG_ConvertPtr(obj, pptr, type, flags)
Definition gv_ruby.cpp:1416
SWIGRUNTIME int SWIG_TypeCmp(const char *nb, const char *tb)
Definition gv_ruby.cpp:536
SWIGRUNTIME const char * SWIG_UnpackData(const char *c, void *ptr, size_t sz)
Definition gv_ruby.cpp:789
SWIGINTERN VALUE _wrap_headof(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:3880
SWIGINTERN VALUE _wrap_firstin__SWIG_1(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:4894
SWIGINTERN VALUE _wrap_nextin__SWIG_1(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:4956
SWIGINTERNINLINE VALUE SWIG_FromCharPtr(const char *cptr)
Definition gv_ruby.cpp:2217
SWIGINTERN VALUE _wrap_firstout__SWIG_1(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:4640
SWIGINTERN VALUE _wrap_firstin(int nargs, VALUE *args, VALUE self)
Definition gv_ruby.cpp:4917
SWIGRUNTIMEINLINE char * SWIG_Ruby_MangleStr(VALUE obj)
Definition gv_ruby.cpp:1642
SWIGINTERN VALUE _wrap_rootof(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:4048
SWIGINTERN VALUE _wrap_write__SWIG_0(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:6075
static swig_type_info * swig_types[7]
Definition gv_ruby.cpp:1893
SWIGINTERN VALUE _wrap_setv__SWIG_5(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:3015
SWIGINTERN VALUE _wrap_readstring(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:2338
SWIGINTERN VALUE _wrap_ok(int nargs, VALUE *args, VALUE self)
Definition gv_ruby.cpp:4215
SWIGINTERN VALUE _wrap_strictgraph(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:2284
SWIGINTERN VALUE getNullReferenceError(void)
Definition gv_ruby.cpp:1089
SWIGINTERN VALUE SWIG_Ruby_AppendOutput(VALUE target, VALUE o)
Definition gv_ruby.cpp:1376
SWIGRUNTIME void SWIG_RubyIterateTrackings(void(*meth)(void *ptr, VALUE obj))
Definition gv_ruby.cpp:1357
static swig_cast_info _swigc__p_char[]
Definition gv_ruby.cpp:6236
SWIGINTERN VALUE _wrap_strictdigraph(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:2311
SWIGINTERN int SWIG_Ruby_arity(VALUE proc, int minimal)
Definition gv_ruby.cpp:1859
#define SWIGINTERN
Definition gv_ruby.cpp:71
static st_table * swig_ruby_trackings
Definition gv_ruby.cpp:1262
bool layout(Agraph_t *g, const char *engine)
Definition gv.cpp:615
static swig_type_info _swigt__p_Agraph_t
Definition gv_ruby.cpp:6217
SWIGRUNTIME int SWIG_Ruby_ConvertPtrAndOwn(VALUE obj, void **ptr, swig_type_info *ty, int flags, swig_ruby_owntype *own)
Definition gv_ruby.cpp:1668
SWIGRUNTIME swig_type_info * SWIG_MangledTypeQueryModule(swig_module_info *start, swig_module_info *end, const char *name)
Definition gv_ruby.cpp:699
#define SWIG_ArgError(r)
Definition gv_ruby.cpp:414
SWIGINTERN VALUE _wrap_layout(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:5689
SWIGINTERN VALUE _wrap_ok__SWIG_3(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:4192
SWIGINTERN VALUE _wrap_findattr__SWIG_2(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:3785
SWIGINTERN VALUE _wrap_nextedge__SWIG_1(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:4560
SWIGRUNTIME const char * SWIG_UnpackDataName(const char *c, void *ptr, size_t sz, const char *name)
Definition gv_ruby.cpp:856
SWIGRUNTIME VALUE SWIG_RubyInstanceFor(void *ptr)
Definition gv_ruby.cpp:1313
#define SWIG_NewPointerObj(ptr, type, flags)
Definition gv_ruby.cpp:1418
#define NUM2SWIG(x)
Definition gv_ruby.cpp:1251
SWIGINTERN VALUE _wrap_renderresult(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:5951
SWIGINTERN VALUE _wrap_findsubg(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:3613
SWIGINTERN VALUE _wrap_setv__SWIG_2(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:2883
SWIGINTERN VALUE _wrap_getv__SWIG_2(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:3257
Agsym_t * nextattr(Agraph_t *g, Agsym_t *a)
Definition gv.cpp:549
#define SWIG_POINTER_NO_NULL
Definition gv_ruby.cpp:318
Agnode_t * tailof(Agedge_t *e)
Definition gv.cpp:295
bool write(Agraph_t *g, const char *filename)
Definition gv.cpp:717
char * renderdata(Agraph_t *g, const char *format)
Definition gv.cpp:699
SWIGINTERN VALUE _wrap_tred(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:6189
SWIGINTERN VALUE _wrap_nextattr__SWIG_2(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:5474
#define SWIG_IOError
Definition gv_ruby.cpp:874
#define SWIG_NullReferenceError
Definition gv_ruby.cpp:885
SWIGRUNTIMEINLINE const char * SWIG_TypeName(const swig_type_info *ty)
Definition gv_ruby.cpp:639
SWIGINTERN VALUE _wrap_firstattr__SWIG_0(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:5290
#define SWIG_POINTER_DISOWN
Definition gv_ruby.cpp:316
struct swig_type_info swig_type_info
#define VOIDFUNC(f)
Definition gv_ruby.cpp:1043
SWIGRUNTIME char * SWIG_PackVoidPtr(char *buff, void *ptr, const char *name, size_t bsz)
Definition gv_ruby.cpp:817
Agnode_t * protonode(Agraph_t *g)
Definition gv.cpp:334
static ID swig_lowerthan_id
Definition gv_ruby.cpp:1486
SWIGINTERN VALUE _wrap_getv__SWIG_0(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:3187
SWIGRUNTIME VALUE SWIG_Ruby_NewClassInstance(VALUE klass, swig_type_info *type)
Definition gv_ruby.cpp:1631
static swig_cast_info _swigc__p_Agedge_t[]
Definition gv_ruby.cpp:6231
SWIGINTERN int SWIG_AsCharPtrAndSize(VALUE obj, char **cptr, size_t *psize, int *alloc)
Definition gv_ruby.cpp:2163
SWIGINTERN VALUE _wrap_renderchannel(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:5994
SWIGRUNTIME char * SWIG_PackData(char *c, void *ptr, size_t sz)
Definition gv_ruby.cpp:773
SWIGINTERN VALUE _wrap_rm(int nargs, VALUE *args, VALUE self)
Definition gv_ruby.cpp:5640
SWIGINTERN VALUE _wrap_nameof__SWIG_0(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:3493
bool rm(Agraph_t *g)
Definition gv.cpp:584
SWIGINTERN VALUE _wrap_render__SWIG_2(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:5783
static VALUE _cSWIG_Pointer
Definition gv_ruby.cpp:1480
Agnode_t * findnode(Agraph_t *g, char *name)
Definition gv.cpp:253
#define SWIGTYPE_p_Agedge_t
Definition gv_ruby.cpp:1887
SWIGINTERN VALUE _wrap_graphof__SWIG_1(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:3952
Agnode_t * nexttail(Agnode_t *n, Agnode_t *t)
Definition gv.cpp:503
#define SWIG_MangleStr(value)
Definition gv_ruby.cpp:1457
SWIGRUNTIME void SWIG_RubyUnlinkObjects(void *ptr)
Definition gv_ruby.cpp:1336
#define SWIG_NEWOBJ
Definition gv_ruby.cpp:425
SWIGINTERN VALUE _wrap_rm__SWIG_0(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:5569
Agraph_t * firstsupg(Agraph_t *g)
Definition gv.cpp:380
SWIGRUNTIME void SWIG_Ruby_InitRuntime(void)
Definition gv_ruby.cpp:1545
#define SWIG_GetModule(clientdata)
Definition gv_ruby.cpp:1441
Agsym_t * findattr(Agraph_t *g, char *name)
Definition gv.cpp:267
#define SWIG_fail
Definition gv_ruby.cpp:1449
SWIGINTERN VALUE _wrap_nexthead(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:4806
SWIGRUNTIME swig_cast_info * SWIG_TypeCheckStruct(const swig_type_info *from, swig_type_info *ty)
Definition gv_ruby.cpp:590
SWIGRUNTIME void SWIG_PropagateClientData(void)
Definition gv_ruby.cpp:6455
SWIGINTERN VALUE _wrap_findattr__SWIG_1(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:3750
SWIGINTERN VALUE _wrap_firstout__SWIG_0(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:4442
Agraph_t * digraph(char *name)
Definition gv.cpp:36
SWIGINTERN VALUE _wrap_nameof(int nargs, VALUE *args, VALUE self)
Definition gv_ruby.cpp:3564
SWIGRUNTIME const char * SWIG_TypePrettyName(const swig_type_info *type)
Definition gv_ruby.cpp:648
Agedge_t * firstin(Agraph_t *g)
Definition gv.cpp:461
SWIGRUNTIME swig_cast_info * SWIG_TypeCheck(const char *c, swig_type_info *ty)
Definition gv_ruby.cpp:563
SWIGINTERN const char * Ruby_Format_TypeError(const char *msg, const char *type, const char *name, const int argn, VALUE input)
Definition gv_ruby.cpp:1168
SWIGINTERN VALUE _wrap_firstedge__SWIG_1(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:4498
#define SWIG_ERROR_RELEASE_NOT_OWNED
Definition gv_ruby.cpp:411
SWIGINTERN VALUE _wrap_renderdata(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:6040
Agnode_t * nextnode(Agraph_t *g, Agnode_t *n)
Definition gv.cpp:524
#define SWIG_TYPE_TABLE_NAME
Definition gv_ruby.cpp:290
SWIGINTERN VALUE _wrap_nextout(int nargs, VALUE *args, VALUE self)
Definition gv_ruby.cpp:4733
#define SWIG_CAST_NEW_MEMORY
Definition gv_ruby.cpp:317
SWIGINTERN VALUE _wrap_graph(int nargs, VALUE *args, VALUE self)
Definition gv_ruby.cpp:2487
static swig_type_info _swigt__p_FILE
Definition gv_ruby.cpp:6219
Agedge_t * nextin(Agnode_t *n, Agedge_t *e)
Definition gv.cpp:488
Agraph_t * graph(char *name)
Definition gv.cpp:30
SWIGRUNTIME VALUE SWIG_Ruby_NewPointerObj(void *ptr, swig_type_info *type, int flags)
Definition gv_ruby.cpp:1572
SWIGINTERN VALUE _wrap_getv__SWIG_5(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:3356
struct swig_module_info swig_module_info
SWIGINTERN VALUE _wrap_rm__SWIG_1(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:5593
#define RSTRING_LEN(x)
Definition gv_ruby.cpp:958
SWIGINTERN VALUE _wrap_nextout__SWIG_0(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:4466
#define SWIG_ERROR
Definition gv_ruby.cpp:407
#define SWIGTYPE_p_FILE
Definition gv_ruby.cpp:1891
Agsym_t * firstattr(Agraph_t *g)
Definition gv.cpp:542
SWIGRUNTIME VALUE SWIG_Ruby_ExceptionType(swig_type_info *desc, VALUE obj)
Definition gv_ruby.cpp:1534
SWIGINTERN VALUE _wrap_edge(int nargs, VALUE *args, VALUE self)
Definition gv_ruby.cpp:2711
#define RTYPEDDATA_P(x)
Definition gv_ruby.cpp:1000
SWIGINTERN VALUE _wrap_render__SWIG_3(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:5826
SWIGINTERN VALUE _wrap_setv(int nargs, VALUE *args, VALUE self)
Definition gv_ruby.cpp:3057
SWIGINTERN VALUE _wrap_nextattr__SWIG_0(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:5314
SWIGRUNTIME swig_module_info * SWIG_Ruby_GetModule(void *SWIGUNUSEDPARM(clientdata))
Definition gv_ruby.cpp:1807
static swig_type_info * swig_type_initial[]
Definition gv_ruby.cpp:6222
SWIGINTERN VALUE _wrap_edge__SWIG_3(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:2666
SWIGRUNTIME void SWIG_Ruby_define_class(swig_type_info *type)
Definition gv_ruby.cpp:1557
static int swig_ruby_internal_iterate_callback(st_data_t ptr, st_data_t obj, st_data_t meth)
Definition gv_ruby.cpp:1352
SWIGINTERN VALUE _wrap_findattr(int nargs, VALUE *args, VALUE self)
Definition gv_ruby.cpp:3819
SWIGINTERN int SWIG_Ruby_isCallable(VALUE proc)
Definition gv_ruby.cpp:1846
SWIGRUNTIME swig_ruby_owntype SWIG_Ruby_AcquirePtr(VALUE obj, swig_ruby_owntype own)
Definition gv_ruby.cpp:1657
static swig_cast_info _swigc__p_Agsym_t[]
Definition gv_ruby.cpp:6234
SWIGINTERN VALUE SWIG_Ruby_ErrorType(int SWIG_code)
Definition gv_ruby.cpp:1112
#define SWIG_MemoryError
Definition gv_ruby.cpp:884
Agedge_t * nextedge(Agraph_t *g, Agedge_t *e)
Definition gv.cpp:411
SWIGINTERN VALUE _wrap_findattr__SWIG_0(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:3715
Agedge_t * findedge(Agnode_t *t, Agnode_t *h)
Definition gv.cpp:259
SWIGINTERN VALUE _wrap_node(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:2529
#define SWIG_SystemError
Definition gv_ruby.cpp:882
#define SWIG_DivisionByZero
Definition gv_ruby.cpp:878
SWIGINTERN VALUE _wrap_write(int nargs, VALUE *args, VALUE self)
Definition gv_ruby.cpp:6141
SWIGINTERN VALUE _wrap_edge__SWIG_2(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:2631
static swig_type_info _swigt__p_char
Definition gv_ruby.cpp:6220
#define SWIG_OverflowError
Definition gv_ruby.cpp:879
SWIGINTERN VALUE _wrap_firsttail(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:5036
SWIGINTERN VALUE _wrap_nextedge(int nargs, VALUE *args, VALUE self)
Definition gv_ruby.cpp:4591
#define SWIGEXPORT
Definition gv_ruby.cpp:99
SWIGINTERN VALUE _wrap_nextin(int nargs, VALUE *args, VALUE self)
Definition gv_ruby.cpp:4987
#define SWIG_IsOK(r)
Definition gv_ruby.cpp:413
SWIGINTERN VALUE _wrap_findedge(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:3683
SWIGRUNTIME VALUE SWIG_Ruby_NewPackedObj(void *ptr, int sz, swig_type_info *type)
Definition gv_ruby.cpp:1774
SWIGINTERN VALUE _wrap_firstnode__SWIG_0(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:5092
SWIGRUNTIME int SWIG_Ruby_ConvertPacked(VALUE obj, void *ptr, int sz, swig_type_info *ty)
Definition gv_ruby.cpp:1786
Agnode_t * firsthead(Agnode_t *n)
Definition gv.cpp:425
static swig_type_info _swigt__p_Agnode_t
Definition gv_ruby.cpp:6216
SWIGINTERN VALUE _wrap_graph__SWIG_0(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:2230
#define SWIG_IndexError
Definition gv_ruby.cpp:876
bool render(Agraph_t *g)
Definition gv.cpp:624
static VALUE mGv
Definition gv_ruby.cpp:1903
static swig_type_info _swigt__p_Agedge_t
Definition gv_ruby.cpp:6215
SWIGINTERN VALUE _wrap_write__SWIG_1(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:6110
SWIGINTERN VALUE _wrap_firsthead(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:4782
#define SWIG_snprintf(O, S, F, A)
Definition gv_ruby.cpp:470
SWIGINTERN VALUE _wrap_nameof__SWIG_1(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:3517
#define SWIG_OK
Definition gv_ruby.cpp:405
SWIGINTERN VALUE _wrap_nextnode__SWIG_1(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:5210
Agnode_t * nexthead(Agnode_t *n, Agnode_t *h)
Definition gv.cpp:434
#define SWIG_ObjectPreviouslyDeletedError
Definition gv_ruby.cpp:1081
SWIGINTERN VALUE _wrap_nextsubg(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:4298
#define SWIGINTERNINLINE
Definition gv_ruby.cpp:76
SWIGINTERN VALUE _wrap_read(int nargs, VALUE *args, VALUE self)
Definition gv_ruby.cpp:2415
Agedge_t * protoedge(Agraph_t *g)
Definition gv.cpp:338
SWIGINTERN VALUE _wrap_findnode(int argc, VALUE *argv, VALUE self)
Definition gv_ruby.cpp:3648
#define SWIGRUNTIMEINLINE
Definition gv_ruby.cpp:307
SWIGINTERN void Ruby_Format_OverloadedError(const int argc, const int maxargs, const char *method, const char *prototypes)
Definition gv_ruby.cpp:1216
SWIGRUNTIMEINLINE void * SWIG_TypeCast(swig_cast_info *ty, void *ptr, int *newmemory)
Definition gv_ruby.cpp:617
#define SWIG_From_bool
Definition gv_tcl.cpp:2008
Graphviz context library.
GVIO_API const char * format
Definition gvio.h:51
static gvloadimage_engine_t engine
textitem scanner parser str
Definition htmlparse.y:224
static void mark(const stk_t *stk, Agnode_t *n)
set a mark on n
Definition ccomps.c:36
#define RDATA(n)
Definition patchwork.h:24
void *(* swig_converter_func)(void *, int *)
Definition runtime.h:360
struct swig_type_info *(* swig_dycast_func)(void **)
Definition runtime.h:361
void reset(sgraph *G)
Definition sgraph.c:29
graph or subgraph
Definition cgraph.h:425
string attribute descriptor symbol in Agattr_s.dict
Definition cgraph.h:637
swig_type_info * type
Definition gv_guile.cpp:372
struct swig_cast_info * prev
Definition gv_guile.cpp:375
struct swig_cast_info * next
Definition gv_guile.cpp:374
swig_converter_func converter
Definition gv_guile.cpp:373
void(* destroy)(void *)
Definition gv_ruby.cpp:1474
void(* mark)(void *)
Definition gv_ruby.cpp:1473
VALUE mImpl
Definition gv_ruby.cpp:1472
VALUE klass
Definition gv_ruby.cpp:1471
int trackObjects
Definition gv_ruby.cpp:1475
swig_type_info ** types
Definition gv_guile.cpp:382
swig_cast_info ** cast_initial
Definition gv_guile.cpp:386
swig_type_info ** type_initial
Definition gv_guile.cpp:385
struct swig_module_info * next
Definition gv_guile.cpp:384
void(* datafree)(void *)
Definition gv_ruby.cpp:1652
swig_dycast_func dcast
Definition gv_guile.cpp:364
void * clientdata
Definition gv_guile.cpp:366
const char * name
Definition gv_guile.cpp:362
const char * str
Definition gv_guile.cpp:363
struct swig_cast_info * cast
Definition gv_guile.cpp:365
static mytime_t T
Definition timing.c:41
Definition grammar.c:93
char * name
Definition grammar.c:98