fxruby 1.2.2 → 1.2.3
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- data/ChangeLog +199 -0
- data/doc/apes02.html +2 -2
- data/doc/apes03.html +1 -1
- data/doc/book.html +1 -1
- data/doc/changes.html +48 -3
- data/doc/cvs.html +2 -2
- data/doc/differences.html +3 -3
- data/doc/gems.html +43 -43
- data/doc/implementation.html +1 -1
- data/doc/library.html +5 -5
- data/doc/opengl.html +5 -5
- data/doc/pt02.html +1 -1
- data/doc/scintilla.html +4 -4
- data/examples/browser.rb +1 -1
- data/examples/button.rb +59 -48
- data/examples/groupbox.rb +5 -4
- data/examples/ratio.rb +70 -0
- data/examples/table.rb +1 -1
- data/ext/fox12/FXRuby.cpp +2 -1
- data/ext/fox12/core_wrap.cpp +16 -6
- data/ext/fox12/dc_wrap.cpp +16 -6
- data/ext/fox12/dialogs_wrap.cpp +16 -6
- data/ext/fox12/frames_wrap.cpp +16 -6
- data/ext/fox12/fx3d_wrap.cpp +16 -6
- data/ext/fox12/iconlist_wrap.cpp +16 -6
- data/ext/fox12/icons_wrap.cpp +18 -7
- data/ext/fox12/image_wrap.cpp +16 -6
- data/ext/fox12/label_wrap.cpp +16 -6
- data/ext/fox12/layout_wrap.cpp +16 -6
- data/ext/fox12/librb.c +18 -7
- data/ext/fox12/list_wrap.cpp +16 -6
- data/ext/fox12/mdi_wrap.cpp +16 -6
- data/ext/fox12/menu_wrap.cpp +16 -6
- data/ext/fox12/scintilla_wrap.cpp +19 -12
- data/ext/fox12/table_wrap.cpp +16 -6
- data/ext/fox12/text_wrap.cpp +16 -6
- data/ext/fox12/treelist_wrap.cpp +16 -6
- data/ext/fox12/ui_wrap.cpp +16 -6
- data/lib/fox12/aliases.rb +32 -11
- data/lib/fox12/dialogs.rb +72 -0
- data/lib/fox12/execute_nonmodal.rb +70 -0
- data/lib/fox12/iterators.rb +3 -3
- data/lib/fox12/splashscreen.rb +83 -0
- data/lib/fox12/version.rb +1 -1
- data/rdoc-sources/FXDC.rb +14 -13
- data/rdoc-sources/FXDataTarget.rb +30 -5
- data/rdoc-sources/FXFileDialog.rb +50 -5
- data/rdoc-sources/FXList.rb +13 -13
- data/rdoc-sources/FXMemoryBuffer.rb +15 -10
- data/rdoc-sources/FXTable.rb +193 -107
- data/rdoc-sources/FXText.rb +2 -2
- data/rdoc-sources/FXToolBarTab.rb +69 -0
- data/rdoc-sources/FXToolTip.rb +1 -1
- data/tests/TC_FXMaterial.rb +14 -0
- metadata +10 -4
data/ext/fox12/FXRuby.cpp
CHANGED
|
@@ -21,7 +21,7 @@
|
|
|
21
21
|
***********************************************************************/
|
|
22
22
|
|
|
23
23
|
/***********************************************************************
|
|
24
|
-
* $Id: FXRuby.cpp,v 1.
|
|
24
|
+
* $Id: FXRuby.cpp,v 1.3 2005/01/15 20:02:42 lyle Exp $
|
|
25
25
|
***********************************************************************/
|
|
26
26
|
|
|
27
27
|
#ifdef _MSC_VER
|
|
@@ -1803,6 +1803,7 @@ extern "C" void Init_fox12(void) {
|
|
|
1803
1803
|
REQUIRE("fox12/aliases");
|
|
1804
1804
|
REQUIRE("fox12/responder2");
|
|
1805
1805
|
REQUIRE("fox12/glgroup");
|
|
1806
|
+
REQUIRE("fox12/execute_nonmodal");
|
|
1806
1807
|
REQUIRE("fox12/version");
|
|
1807
1808
|
|
|
1808
1809
|
id_assocs=rb_intern("@assocs");
|
data/ext/fox12/core_wrap.cpp
CHANGED
|
@@ -86,13 +86,16 @@ private:
|
|
|
86
86
|
|
|
87
87
|
#ifdef __cplusplus
|
|
88
88
|
# ifndef RUBY_METHOD_FUNC /* These definitions should work for Ruby 1.4.6 */
|
|
89
|
+
# define PROTECTFUNC(f) ((VALUE (*)()) f)
|
|
89
90
|
# define VALUEFUNC(f) ((VALUE (*)()) f)
|
|
90
91
|
# define VOIDFUNC(f) ((void (*)()) f)
|
|
91
92
|
# else
|
|
92
93
|
# ifndef ANYARGS /* These definitions should work for Ruby 1.6 */
|
|
94
|
+
# define PROTECTFUNC(f) ((VALUE (*)()) f)
|
|
93
95
|
# define VALUEFUNC(f) ((VALUE (*)()) f)
|
|
94
96
|
# define VOIDFUNC(f) ((RUBY_DATA_FUNC) f)
|
|
95
|
-
# else /* These definitions should work for Ruby 1.7 */
|
|
97
|
+
# else /* These definitions should work for Ruby 1.7+ */
|
|
98
|
+
# define PROTECTFUNC(f) ((VALUE (*)(VALUE)) f)
|
|
96
99
|
# define VALUEFUNC(f) ((VALUE (*)(ANYARGS)) f)
|
|
97
100
|
# define VOIDFUNC(f) ((RUBY_DATA_FUNC) f)
|
|
98
101
|
# endif
|
|
@@ -265,13 +268,14 @@ SWIGIMPORT(char *) SWIG_UnpackData(char *, void *, int);
|
|
|
265
268
|
#else
|
|
266
269
|
|
|
267
270
|
static swig_type_info *swig_type_list = 0;
|
|
271
|
+
static swig_type_info **swig_type_list_handle = &swig_type_list;
|
|
268
272
|
|
|
269
273
|
/* Register a type mapping with the type-checking */
|
|
270
274
|
SWIGRUNTIME(swig_type_info *)
|
|
271
275
|
SWIG_TypeRegister(swig_type_info *ti) {
|
|
272
276
|
swig_type_info *tc, *head, *ret, *next;
|
|
273
277
|
/* Check to see if this type has already been registered */
|
|
274
|
-
tc =
|
|
278
|
+
tc = *swig_type_list_handle;
|
|
275
279
|
while (tc) {
|
|
276
280
|
if (strcmp(tc->name, ti->name) == 0) {
|
|
277
281
|
/* Already exists in the table. Just add additional types to the list */
|
|
@@ -286,8 +290,8 @@ SWIG_TypeRegister(swig_type_info *ti) {
|
|
|
286
290
|
next = 0;
|
|
287
291
|
|
|
288
292
|
/* Place in list */
|
|
289
|
-
ti->prev =
|
|
290
|
-
|
|
293
|
+
ti->prev = *swig_type_list_handle;
|
|
294
|
+
*swig_type_list_handle = ti;
|
|
291
295
|
|
|
292
296
|
/* Build linked lists */
|
|
293
297
|
l1:
|
|
@@ -416,7 +420,7 @@ SWIG_TypeEquiv(const char *nb, const char *tb) {
|
|
|
416
420
|
/* Search for a swig_type_info structure */
|
|
417
421
|
SWIGRUNTIME(swig_type_info *)
|
|
418
422
|
SWIG_TypeQuery(const char *name) {
|
|
419
|
-
swig_type_info *ty =
|
|
423
|
+
swig_type_info *ty = *swig_type_list_handle;
|
|
420
424
|
while (ty) {
|
|
421
425
|
if (ty->str && (SWIG_TypeEquiv(ty->str,name))) return ty;
|
|
422
426
|
if (ty->name && (strcmp(name,ty->name) == 0)) return ty;
|
|
@@ -434,7 +438,7 @@ SWIG_TypeClientData(swig_type_info *ti, void *clientdata) {
|
|
|
434
438
|
equiv = ti->next;
|
|
435
439
|
while (equiv) {
|
|
436
440
|
if (!equiv->converter) {
|
|
437
|
-
tc =
|
|
441
|
+
tc = *swig_type_list_handle;
|
|
438
442
|
while (tc) {
|
|
439
443
|
if ((strcmp(tc->name, equiv->name) == 0))
|
|
440
444
|
SWIG_TypeClientData(tc,clientdata);
|
|
@@ -571,6 +575,12 @@ static swig_type_info *swig_types[51];
|
|
|
571
575
|
|
|
572
576
|
VALUE mFox;
|
|
573
577
|
|
|
578
|
+
static void SWIG_AsVal(VALUE obj, int *val)
|
|
579
|
+
{
|
|
580
|
+
*val = (int) NUM2INT(obj);
|
|
581
|
+
}
|
|
582
|
+
|
|
583
|
+
|
|
574
584
|
#include "FXRbCommon.h"
|
|
575
585
|
|
|
576
586
|
|
data/ext/fox12/dc_wrap.cpp
CHANGED
|
@@ -86,13 +86,16 @@ private:
|
|
|
86
86
|
|
|
87
87
|
#ifdef __cplusplus
|
|
88
88
|
# ifndef RUBY_METHOD_FUNC /* These definitions should work for Ruby 1.4.6 */
|
|
89
|
+
# define PROTECTFUNC(f) ((VALUE (*)()) f)
|
|
89
90
|
# define VALUEFUNC(f) ((VALUE (*)()) f)
|
|
90
91
|
# define VOIDFUNC(f) ((void (*)()) f)
|
|
91
92
|
# else
|
|
92
93
|
# ifndef ANYARGS /* These definitions should work for Ruby 1.6 */
|
|
94
|
+
# define PROTECTFUNC(f) ((VALUE (*)()) f)
|
|
93
95
|
# define VALUEFUNC(f) ((VALUE (*)()) f)
|
|
94
96
|
# define VOIDFUNC(f) ((RUBY_DATA_FUNC) f)
|
|
95
|
-
# else /* These definitions should work for Ruby 1.7 */
|
|
97
|
+
# else /* These definitions should work for Ruby 1.7+ */
|
|
98
|
+
# define PROTECTFUNC(f) ((VALUE (*)(VALUE)) f)
|
|
96
99
|
# define VALUEFUNC(f) ((VALUE (*)(ANYARGS)) f)
|
|
97
100
|
# define VOIDFUNC(f) ((RUBY_DATA_FUNC) f)
|
|
98
101
|
# endif
|
|
@@ -265,13 +268,14 @@ SWIGIMPORT(char *) SWIG_UnpackData(char *, void *, int);
|
|
|
265
268
|
#else
|
|
266
269
|
|
|
267
270
|
static swig_type_info *swig_type_list = 0;
|
|
271
|
+
static swig_type_info **swig_type_list_handle = &swig_type_list;
|
|
268
272
|
|
|
269
273
|
/* Register a type mapping with the type-checking */
|
|
270
274
|
SWIGRUNTIME(swig_type_info *)
|
|
271
275
|
SWIG_TypeRegister(swig_type_info *ti) {
|
|
272
276
|
swig_type_info *tc, *head, *ret, *next;
|
|
273
277
|
/* Check to see if this type has already been registered */
|
|
274
|
-
tc =
|
|
278
|
+
tc = *swig_type_list_handle;
|
|
275
279
|
while (tc) {
|
|
276
280
|
if (strcmp(tc->name, ti->name) == 0) {
|
|
277
281
|
/* Already exists in the table. Just add additional types to the list */
|
|
@@ -286,8 +290,8 @@ SWIG_TypeRegister(swig_type_info *ti) {
|
|
|
286
290
|
next = 0;
|
|
287
291
|
|
|
288
292
|
/* Place in list */
|
|
289
|
-
ti->prev =
|
|
290
|
-
|
|
293
|
+
ti->prev = *swig_type_list_handle;
|
|
294
|
+
*swig_type_list_handle = ti;
|
|
291
295
|
|
|
292
296
|
/* Build linked lists */
|
|
293
297
|
l1:
|
|
@@ -416,7 +420,7 @@ SWIG_TypeEquiv(const char *nb, const char *tb) {
|
|
|
416
420
|
/* Search for a swig_type_info structure */
|
|
417
421
|
SWIGRUNTIME(swig_type_info *)
|
|
418
422
|
SWIG_TypeQuery(const char *name) {
|
|
419
|
-
swig_type_info *ty =
|
|
423
|
+
swig_type_info *ty = *swig_type_list_handle;
|
|
420
424
|
while (ty) {
|
|
421
425
|
if (ty->str && (SWIG_TypeEquiv(ty->str,name))) return ty;
|
|
422
426
|
if (ty->name && (strcmp(name,ty->name) == 0)) return ty;
|
|
@@ -434,7 +438,7 @@ SWIG_TypeClientData(swig_type_info *ti, void *clientdata) {
|
|
|
434
438
|
equiv = ti->next;
|
|
435
439
|
while (equiv) {
|
|
436
440
|
if (!equiv->converter) {
|
|
437
|
-
tc =
|
|
441
|
+
tc = *swig_type_list_handle;
|
|
438
442
|
while (tc) {
|
|
439
443
|
if ((strcmp(tc->name, equiv->name) == 0))
|
|
440
444
|
SWIG_TypeClientData(tc,clientdata);
|
|
@@ -537,6 +541,12 @@ static swig_type_info *swig_types[18];
|
|
|
537
541
|
#define SWIG_name "Dc"
|
|
538
542
|
|
|
539
543
|
|
|
544
|
+
static void SWIG_AsVal(VALUE obj, int *val)
|
|
545
|
+
{
|
|
546
|
+
*val = (int) NUM2INT(obj);
|
|
547
|
+
}
|
|
548
|
+
|
|
549
|
+
|
|
540
550
|
#include "FXRbCommon.h"
|
|
541
551
|
|
|
542
552
|
|
data/ext/fox12/dialogs_wrap.cpp
CHANGED
|
@@ -86,13 +86,16 @@ private:
|
|
|
86
86
|
|
|
87
87
|
#ifdef __cplusplus
|
|
88
88
|
# ifndef RUBY_METHOD_FUNC /* These definitions should work for Ruby 1.4.6 */
|
|
89
|
+
# define PROTECTFUNC(f) ((VALUE (*)()) f)
|
|
89
90
|
# define VALUEFUNC(f) ((VALUE (*)()) f)
|
|
90
91
|
# define VOIDFUNC(f) ((void (*)()) f)
|
|
91
92
|
# else
|
|
92
93
|
# ifndef ANYARGS /* These definitions should work for Ruby 1.6 */
|
|
94
|
+
# define PROTECTFUNC(f) ((VALUE (*)()) f)
|
|
93
95
|
# define VALUEFUNC(f) ((VALUE (*)()) f)
|
|
94
96
|
# define VOIDFUNC(f) ((RUBY_DATA_FUNC) f)
|
|
95
|
-
# else /* These definitions should work for Ruby 1.7 */
|
|
97
|
+
# else /* These definitions should work for Ruby 1.7+ */
|
|
98
|
+
# define PROTECTFUNC(f) ((VALUE (*)(VALUE)) f)
|
|
96
99
|
# define VALUEFUNC(f) ((VALUE (*)(ANYARGS)) f)
|
|
97
100
|
# define VOIDFUNC(f) ((RUBY_DATA_FUNC) f)
|
|
98
101
|
# endif
|
|
@@ -265,13 +268,14 @@ SWIGIMPORT(char *) SWIG_UnpackData(char *, void *, int);
|
|
|
265
268
|
#else
|
|
266
269
|
|
|
267
270
|
static swig_type_info *swig_type_list = 0;
|
|
271
|
+
static swig_type_info **swig_type_list_handle = &swig_type_list;
|
|
268
272
|
|
|
269
273
|
/* Register a type mapping with the type-checking */
|
|
270
274
|
SWIGRUNTIME(swig_type_info *)
|
|
271
275
|
SWIG_TypeRegister(swig_type_info *ti) {
|
|
272
276
|
swig_type_info *tc, *head, *ret, *next;
|
|
273
277
|
/* Check to see if this type has already been registered */
|
|
274
|
-
tc =
|
|
278
|
+
tc = *swig_type_list_handle;
|
|
275
279
|
while (tc) {
|
|
276
280
|
if (strcmp(tc->name, ti->name) == 0) {
|
|
277
281
|
/* Already exists in the table. Just add additional types to the list */
|
|
@@ -286,8 +290,8 @@ SWIG_TypeRegister(swig_type_info *ti) {
|
|
|
286
290
|
next = 0;
|
|
287
291
|
|
|
288
292
|
/* Place in list */
|
|
289
|
-
ti->prev =
|
|
290
|
-
|
|
293
|
+
ti->prev = *swig_type_list_handle;
|
|
294
|
+
*swig_type_list_handle = ti;
|
|
291
295
|
|
|
292
296
|
/* Build linked lists */
|
|
293
297
|
l1:
|
|
@@ -416,7 +420,7 @@ SWIG_TypeEquiv(const char *nb, const char *tb) {
|
|
|
416
420
|
/* Search for a swig_type_info structure */
|
|
417
421
|
SWIGRUNTIME(swig_type_info *)
|
|
418
422
|
SWIG_TypeQuery(const char *name) {
|
|
419
|
-
swig_type_info *ty =
|
|
423
|
+
swig_type_info *ty = *swig_type_list_handle;
|
|
420
424
|
while (ty) {
|
|
421
425
|
if (ty->str && (SWIG_TypeEquiv(ty->str,name))) return ty;
|
|
422
426
|
if (ty->name && (strcmp(name,ty->name) == 0)) return ty;
|
|
@@ -434,7 +438,7 @@ SWIG_TypeClientData(swig_type_info *ti, void *clientdata) {
|
|
|
434
438
|
equiv = ti->next;
|
|
435
439
|
while (equiv) {
|
|
436
440
|
if (!equiv->converter) {
|
|
437
|
-
tc =
|
|
441
|
+
tc = *swig_type_list_handle;
|
|
438
442
|
while (tc) {
|
|
439
443
|
if ((strcmp(tc->name, equiv->name) == 0))
|
|
440
444
|
SWIG_TypeClientData(tc,clientdata);
|
|
@@ -548,6 +552,12 @@ static swig_type_info *swig_types[29];
|
|
|
548
552
|
#define SWIG_name "Dialogs"
|
|
549
553
|
|
|
550
554
|
|
|
555
|
+
static void SWIG_AsVal(VALUE obj, int *val)
|
|
556
|
+
{
|
|
557
|
+
*val = (int) NUM2INT(obj);
|
|
558
|
+
}
|
|
559
|
+
|
|
560
|
+
|
|
551
561
|
#include "FXRbCommon.h"
|
|
552
562
|
|
|
553
563
|
|
data/ext/fox12/frames_wrap.cpp
CHANGED
|
@@ -86,13 +86,16 @@ private:
|
|
|
86
86
|
|
|
87
87
|
#ifdef __cplusplus
|
|
88
88
|
# ifndef RUBY_METHOD_FUNC /* These definitions should work for Ruby 1.4.6 */
|
|
89
|
+
# define PROTECTFUNC(f) ((VALUE (*)()) f)
|
|
89
90
|
# define VALUEFUNC(f) ((VALUE (*)()) f)
|
|
90
91
|
# define VOIDFUNC(f) ((void (*)()) f)
|
|
91
92
|
# else
|
|
92
93
|
# ifndef ANYARGS /* These definitions should work for Ruby 1.6 */
|
|
94
|
+
# define PROTECTFUNC(f) ((VALUE (*)()) f)
|
|
93
95
|
# define VALUEFUNC(f) ((VALUE (*)()) f)
|
|
94
96
|
# define VOIDFUNC(f) ((RUBY_DATA_FUNC) f)
|
|
95
|
-
# else /* These definitions should work for Ruby 1.7 */
|
|
97
|
+
# else /* These definitions should work for Ruby 1.7+ */
|
|
98
|
+
# define PROTECTFUNC(f) ((VALUE (*)(VALUE)) f)
|
|
96
99
|
# define VALUEFUNC(f) ((VALUE (*)(ANYARGS)) f)
|
|
97
100
|
# define VOIDFUNC(f) ((RUBY_DATA_FUNC) f)
|
|
98
101
|
# endif
|
|
@@ -265,13 +268,14 @@ SWIGIMPORT(char *) SWIG_UnpackData(char *, void *, int);
|
|
|
265
268
|
#else
|
|
266
269
|
|
|
267
270
|
static swig_type_info *swig_type_list = 0;
|
|
271
|
+
static swig_type_info **swig_type_list_handle = &swig_type_list;
|
|
268
272
|
|
|
269
273
|
/* Register a type mapping with the type-checking */
|
|
270
274
|
SWIGRUNTIME(swig_type_info *)
|
|
271
275
|
SWIG_TypeRegister(swig_type_info *ti) {
|
|
272
276
|
swig_type_info *tc, *head, *ret, *next;
|
|
273
277
|
/* Check to see if this type has already been registered */
|
|
274
|
-
tc =
|
|
278
|
+
tc = *swig_type_list_handle;
|
|
275
279
|
while (tc) {
|
|
276
280
|
if (strcmp(tc->name, ti->name) == 0) {
|
|
277
281
|
/* Already exists in the table. Just add additional types to the list */
|
|
@@ -286,8 +290,8 @@ SWIG_TypeRegister(swig_type_info *ti) {
|
|
|
286
290
|
next = 0;
|
|
287
291
|
|
|
288
292
|
/* Place in list */
|
|
289
|
-
ti->prev =
|
|
290
|
-
|
|
293
|
+
ti->prev = *swig_type_list_handle;
|
|
294
|
+
*swig_type_list_handle = ti;
|
|
291
295
|
|
|
292
296
|
/* Build linked lists */
|
|
293
297
|
l1:
|
|
@@ -416,7 +420,7 @@ SWIG_TypeEquiv(const char *nb, const char *tb) {
|
|
|
416
420
|
/* Search for a swig_type_info structure */
|
|
417
421
|
SWIGRUNTIME(swig_type_info *)
|
|
418
422
|
SWIG_TypeQuery(const char *name) {
|
|
419
|
-
swig_type_info *ty =
|
|
423
|
+
swig_type_info *ty = *swig_type_list_handle;
|
|
420
424
|
while (ty) {
|
|
421
425
|
if (ty->str && (SWIG_TypeEquiv(ty->str,name))) return ty;
|
|
422
426
|
if (ty->name && (strcmp(name,ty->name) == 0)) return ty;
|
|
@@ -434,7 +438,7 @@ SWIG_TypeClientData(swig_type_info *ti, void *clientdata) {
|
|
|
434
438
|
equiv = ti->next;
|
|
435
439
|
while (equiv) {
|
|
436
440
|
if (!equiv->converter) {
|
|
437
|
-
tc =
|
|
441
|
+
tc = *swig_type_list_handle;
|
|
438
442
|
while (tc) {
|
|
439
443
|
if ((strcmp(tc->name, equiv->name) == 0))
|
|
440
444
|
SWIG_TypeClientData(tc,clientdata);
|
|
@@ -550,6 +554,12 @@ static swig_type_info *swig_types[31];
|
|
|
550
554
|
#define SWIG_name "Frames"
|
|
551
555
|
|
|
552
556
|
|
|
557
|
+
static void SWIG_AsVal(VALUE obj, int *val)
|
|
558
|
+
{
|
|
559
|
+
*val = (int) NUM2INT(obj);
|
|
560
|
+
}
|
|
561
|
+
|
|
562
|
+
|
|
553
563
|
#include "FXRbCommon.h"
|
|
554
564
|
|
|
555
565
|
|
data/ext/fox12/fx3d_wrap.cpp
CHANGED
|
@@ -86,13 +86,16 @@ private:
|
|
|
86
86
|
|
|
87
87
|
#ifdef __cplusplus
|
|
88
88
|
# ifndef RUBY_METHOD_FUNC /* These definitions should work for Ruby 1.4.6 */
|
|
89
|
+
# define PROTECTFUNC(f) ((VALUE (*)()) f)
|
|
89
90
|
# define VALUEFUNC(f) ((VALUE (*)()) f)
|
|
90
91
|
# define VOIDFUNC(f) ((void (*)()) f)
|
|
91
92
|
# else
|
|
92
93
|
# ifndef ANYARGS /* These definitions should work for Ruby 1.6 */
|
|
94
|
+
# define PROTECTFUNC(f) ((VALUE (*)()) f)
|
|
93
95
|
# define VALUEFUNC(f) ((VALUE (*)()) f)
|
|
94
96
|
# define VOIDFUNC(f) ((RUBY_DATA_FUNC) f)
|
|
95
|
-
# else /* These definitions should work for Ruby 1.7 */
|
|
97
|
+
# else /* These definitions should work for Ruby 1.7+ */
|
|
98
|
+
# define PROTECTFUNC(f) ((VALUE (*)(VALUE)) f)
|
|
96
99
|
# define VALUEFUNC(f) ((VALUE (*)(ANYARGS)) f)
|
|
97
100
|
# define VOIDFUNC(f) ((RUBY_DATA_FUNC) f)
|
|
98
101
|
# endif
|
|
@@ -265,13 +268,14 @@ SWIGIMPORT(char *) SWIG_UnpackData(char *, void *, int);
|
|
|
265
268
|
#else
|
|
266
269
|
|
|
267
270
|
static swig_type_info *swig_type_list = 0;
|
|
271
|
+
static swig_type_info **swig_type_list_handle = &swig_type_list;
|
|
268
272
|
|
|
269
273
|
/* Register a type mapping with the type-checking */
|
|
270
274
|
SWIGRUNTIME(swig_type_info *)
|
|
271
275
|
SWIG_TypeRegister(swig_type_info *ti) {
|
|
272
276
|
swig_type_info *tc, *head, *ret, *next;
|
|
273
277
|
/* Check to see if this type has already been registered */
|
|
274
|
-
tc =
|
|
278
|
+
tc = *swig_type_list_handle;
|
|
275
279
|
while (tc) {
|
|
276
280
|
if (strcmp(tc->name, ti->name) == 0) {
|
|
277
281
|
/* Already exists in the table. Just add additional types to the list */
|
|
@@ -286,8 +290,8 @@ SWIG_TypeRegister(swig_type_info *ti) {
|
|
|
286
290
|
next = 0;
|
|
287
291
|
|
|
288
292
|
/* Place in list */
|
|
289
|
-
ti->prev =
|
|
290
|
-
|
|
293
|
+
ti->prev = *swig_type_list_handle;
|
|
294
|
+
*swig_type_list_handle = ti;
|
|
291
295
|
|
|
292
296
|
/* Build linked lists */
|
|
293
297
|
l1:
|
|
@@ -416,7 +420,7 @@ SWIG_TypeEquiv(const char *nb, const char *tb) {
|
|
|
416
420
|
/* Search for a swig_type_info structure */
|
|
417
421
|
SWIGRUNTIME(swig_type_info *)
|
|
418
422
|
SWIG_TypeQuery(const char *name) {
|
|
419
|
-
swig_type_info *ty =
|
|
423
|
+
swig_type_info *ty = *swig_type_list_handle;
|
|
420
424
|
while (ty) {
|
|
421
425
|
if (ty->str && (SWIG_TypeEquiv(ty->str,name))) return ty;
|
|
422
426
|
if (ty->name && (strcmp(name,ty->name) == 0)) return ty;
|
|
@@ -434,7 +438,7 @@ SWIG_TypeClientData(swig_type_info *ti, void *clientdata) {
|
|
|
434
438
|
equiv = ti->next;
|
|
435
439
|
while (equiv) {
|
|
436
440
|
if (!equiv->converter) {
|
|
437
|
-
tc =
|
|
441
|
+
tc = *swig_type_list_handle;
|
|
438
442
|
while (tc) {
|
|
439
443
|
if ((strcmp(tc->name, equiv->name) == 0))
|
|
440
444
|
SWIG_TypeClientData(tc,clientdata);
|
|
@@ -557,6 +561,12 @@ static swig_type_info *swig_types[38];
|
|
|
557
561
|
#define SWIG_name "Fx3d"
|
|
558
562
|
|
|
559
563
|
|
|
564
|
+
static void SWIG_AsVal(VALUE obj, int *val)
|
|
565
|
+
{
|
|
566
|
+
*val = (int) NUM2INT(obj);
|
|
567
|
+
}
|
|
568
|
+
|
|
569
|
+
|
|
560
570
|
#include "FXRbCommon.h"
|
|
561
571
|
|
|
562
572
|
|
data/ext/fox12/iconlist_wrap.cpp
CHANGED
|
@@ -86,13 +86,16 @@ private:
|
|
|
86
86
|
|
|
87
87
|
#ifdef __cplusplus
|
|
88
88
|
# ifndef RUBY_METHOD_FUNC /* These definitions should work for Ruby 1.4.6 */
|
|
89
|
+
# define PROTECTFUNC(f) ((VALUE (*)()) f)
|
|
89
90
|
# define VALUEFUNC(f) ((VALUE (*)()) f)
|
|
90
91
|
# define VOIDFUNC(f) ((void (*)()) f)
|
|
91
92
|
# else
|
|
92
93
|
# ifndef ANYARGS /* These definitions should work for Ruby 1.6 */
|
|
94
|
+
# define PROTECTFUNC(f) ((VALUE (*)()) f)
|
|
93
95
|
# define VALUEFUNC(f) ((VALUE (*)()) f)
|
|
94
96
|
# define VOIDFUNC(f) ((RUBY_DATA_FUNC) f)
|
|
95
|
-
# else /* These definitions should work for Ruby 1.7 */
|
|
97
|
+
# else /* These definitions should work for Ruby 1.7+ */
|
|
98
|
+
# define PROTECTFUNC(f) ((VALUE (*)(VALUE)) f)
|
|
96
99
|
# define VALUEFUNC(f) ((VALUE (*)(ANYARGS)) f)
|
|
97
100
|
# define VOIDFUNC(f) ((RUBY_DATA_FUNC) f)
|
|
98
101
|
# endif
|
|
@@ -265,13 +268,14 @@ SWIGIMPORT(char *) SWIG_UnpackData(char *, void *, int);
|
|
|
265
268
|
#else
|
|
266
269
|
|
|
267
270
|
static swig_type_info *swig_type_list = 0;
|
|
271
|
+
static swig_type_info **swig_type_list_handle = &swig_type_list;
|
|
268
272
|
|
|
269
273
|
/* Register a type mapping with the type-checking */
|
|
270
274
|
SWIGRUNTIME(swig_type_info *)
|
|
271
275
|
SWIG_TypeRegister(swig_type_info *ti) {
|
|
272
276
|
swig_type_info *tc, *head, *ret, *next;
|
|
273
277
|
/* Check to see if this type has already been registered */
|
|
274
|
-
tc =
|
|
278
|
+
tc = *swig_type_list_handle;
|
|
275
279
|
while (tc) {
|
|
276
280
|
if (strcmp(tc->name, ti->name) == 0) {
|
|
277
281
|
/* Already exists in the table. Just add additional types to the list */
|
|
@@ -286,8 +290,8 @@ SWIG_TypeRegister(swig_type_info *ti) {
|
|
|
286
290
|
next = 0;
|
|
287
291
|
|
|
288
292
|
/* Place in list */
|
|
289
|
-
ti->prev =
|
|
290
|
-
|
|
293
|
+
ti->prev = *swig_type_list_handle;
|
|
294
|
+
*swig_type_list_handle = ti;
|
|
291
295
|
|
|
292
296
|
/* Build linked lists */
|
|
293
297
|
l1:
|
|
@@ -416,7 +420,7 @@ SWIG_TypeEquiv(const char *nb, const char *tb) {
|
|
|
416
420
|
/* Search for a swig_type_info structure */
|
|
417
421
|
SWIGRUNTIME(swig_type_info *)
|
|
418
422
|
SWIG_TypeQuery(const char *name) {
|
|
419
|
-
swig_type_info *ty =
|
|
423
|
+
swig_type_info *ty = *swig_type_list_handle;
|
|
420
424
|
while (ty) {
|
|
421
425
|
if (ty->str && (SWIG_TypeEquiv(ty->str,name))) return ty;
|
|
422
426
|
if (ty->name && (strcmp(name,ty->name) == 0)) return ty;
|
|
@@ -434,7 +438,7 @@ SWIG_TypeClientData(swig_type_info *ti, void *clientdata) {
|
|
|
434
438
|
equiv = ti->next;
|
|
435
439
|
while (equiv) {
|
|
436
440
|
if (!equiv->converter) {
|
|
437
|
-
tc =
|
|
441
|
+
tc = *swig_type_list_handle;
|
|
438
442
|
while (tc) {
|
|
439
443
|
if ((strcmp(tc->name, equiv->name) == 0))
|
|
440
444
|
SWIG_TypeClientData(tc,clientdata);
|
|
@@ -536,6 +540,12 @@ static swig_type_info *swig_types[17];
|
|
|
536
540
|
#define SWIG_name "Iconlist"
|
|
537
541
|
|
|
538
542
|
|
|
543
|
+
static void SWIG_AsVal(VALUE obj, int *val)
|
|
544
|
+
{
|
|
545
|
+
*val = (int) NUM2INT(obj);
|
|
546
|
+
}
|
|
547
|
+
|
|
548
|
+
|
|
539
549
|
#include "FXRbCommon.h"
|
|
540
550
|
|
|
541
551
|
|
data/ext/fox12/icons_wrap.cpp
CHANGED
|
@@ -86,13 +86,16 @@ private:
|
|
|
86
86
|
|
|
87
87
|
#ifdef __cplusplus
|
|
88
88
|
# ifndef RUBY_METHOD_FUNC /* These definitions should work for Ruby 1.4.6 */
|
|
89
|
+
# define PROTECTFUNC(f) ((VALUE (*)()) f)
|
|
89
90
|
# define VALUEFUNC(f) ((VALUE (*)()) f)
|
|
90
91
|
# define VOIDFUNC(f) ((void (*)()) f)
|
|
91
92
|
# else
|
|
92
93
|
# ifndef ANYARGS /* These definitions should work for Ruby 1.6 */
|
|
94
|
+
# define PROTECTFUNC(f) ((VALUE (*)()) f)
|
|
93
95
|
# define VALUEFUNC(f) ((VALUE (*)()) f)
|
|
94
96
|
# define VOIDFUNC(f) ((RUBY_DATA_FUNC) f)
|
|
95
|
-
# else /* These definitions should work for Ruby 1.7 */
|
|
97
|
+
# else /* These definitions should work for Ruby 1.7+ */
|
|
98
|
+
# define PROTECTFUNC(f) ((VALUE (*)(VALUE)) f)
|
|
96
99
|
# define VALUEFUNC(f) ((VALUE (*)(ANYARGS)) f)
|
|
97
100
|
# define VOIDFUNC(f) ((RUBY_DATA_FUNC) f)
|
|
98
101
|
# endif
|
|
@@ -265,13 +268,14 @@ SWIGIMPORT(char *) SWIG_UnpackData(char *, void *, int);
|
|
|
265
268
|
#else
|
|
266
269
|
|
|
267
270
|
static swig_type_info *swig_type_list = 0;
|
|
271
|
+
static swig_type_info **swig_type_list_handle = &swig_type_list;
|
|
268
272
|
|
|
269
273
|
/* Register a type mapping with the type-checking */
|
|
270
274
|
SWIGRUNTIME(swig_type_info *)
|
|
271
275
|
SWIG_TypeRegister(swig_type_info *ti) {
|
|
272
276
|
swig_type_info *tc, *head, *ret, *next;
|
|
273
277
|
/* Check to see if this type has already been registered */
|
|
274
|
-
tc =
|
|
278
|
+
tc = *swig_type_list_handle;
|
|
275
279
|
while (tc) {
|
|
276
280
|
if (strcmp(tc->name, ti->name) == 0) {
|
|
277
281
|
/* Already exists in the table. Just add additional types to the list */
|
|
@@ -286,8 +290,8 @@ SWIG_TypeRegister(swig_type_info *ti) {
|
|
|
286
290
|
next = 0;
|
|
287
291
|
|
|
288
292
|
/* Place in list */
|
|
289
|
-
ti->prev =
|
|
290
|
-
|
|
293
|
+
ti->prev = *swig_type_list_handle;
|
|
294
|
+
*swig_type_list_handle = ti;
|
|
291
295
|
|
|
292
296
|
/* Build linked lists */
|
|
293
297
|
l1:
|
|
@@ -416,7 +420,7 @@ SWIG_TypeEquiv(const char *nb, const char *tb) {
|
|
|
416
420
|
/* Search for a swig_type_info structure */
|
|
417
421
|
SWIGRUNTIME(swig_type_info *)
|
|
418
422
|
SWIG_TypeQuery(const char *name) {
|
|
419
|
-
swig_type_info *ty =
|
|
423
|
+
swig_type_info *ty = *swig_type_list_handle;
|
|
420
424
|
while (ty) {
|
|
421
425
|
if (ty->str && (SWIG_TypeEquiv(ty->str,name))) return ty;
|
|
422
426
|
if (ty->name && (strcmp(name,ty->name) == 0)) return ty;
|
|
@@ -434,7 +438,7 @@ SWIG_TypeClientData(swig_type_info *ti, void *clientdata) {
|
|
|
434
438
|
equiv = ti->next;
|
|
435
439
|
while (equiv) {
|
|
436
440
|
if (!equiv->converter) {
|
|
437
|
-
tc =
|
|
441
|
+
tc = *swig_type_list_handle;
|
|
438
442
|
while (tc) {
|
|
439
443
|
if ((strcmp(tc->name, equiv->name) == 0))
|
|
440
444
|
SWIG_TypeClientData(tc,clientdata);
|
|
@@ -542,6 +546,12 @@ static swig_type_info *swig_types[23];
|
|
|
542
546
|
#define SWIG_name "Icons"
|
|
543
547
|
|
|
544
548
|
|
|
549
|
+
static void SWIG_AsVal(VALUE obj, int *val)
|
|
550
|
+
{
|
|
551
|
+
*val = (int) NUM2INT(obj);
|
|
552
|
+
}
|
|
553
|
+
|
|
554
|
+
|
|
545
555
|
#include "FXRbCommon.h"
|
|
546
556
|
|
|
547
557
|
|
|
@@ -2545,7 +2555,8 @@ static VALUE _wrap_fxloadXPM__SWIG_1(int argc, VALUE *argv, VALUE self) { VALUE
|
|
|
2545
2555
|
static VALUE _wrap_fxloadXPM(int nargs, VALUE *args, VALUE self) { int argc; VALUE argv[1]; int ii; argc = nargs;
|
|
2546
2556
|
for (ii = 0; (ii < argc) && (ii < 1); ii++) { argv[ii] = args[ii]; } if (argc == 1) { int _v; { void *ptr;
|
|
2547
2557
|
_v = (NIL_P(argv[0]) || (TYPE(argv[0]) == T_DATA && SWIG_ConvertPtr(argv[0], &ptr, SWIGTYPE_p_FXStream, 0) != -1)) ? 1 : 0; }
|
|
2548
|
-
if (_v) { return _wrap_fxloadXPM__SWIG_0(nargs, args, self);} } if (argc == 1) { int _v;
|
|
2558
|
+
if (_v) { return _wrap_fxloadXPM__SWIG_0(nargs, args, self);} } if (argc == 1) { int _v; {
|
|
2559
|
+
_v = ((TYPE(argv[0]) == T_FIXNUM) || (TYPE(argv[0]) == T_BIGNUM)) ? 1 : 0; } if (_v) {
|
|
2549
2560
|
return _wrap_fxloadXPM__SWIG_1(nargs, args, self);} }
|
|
2550
2561
|
rb_raise(rb_eArgError, "No matching function for overloaded 'fxloadXPM'"); return Qnil; }
|
|
2551
2562
|
static VALUE _wrap_fxsaveXPM(int argc, VALUE *argv, VALUE self) { FXStream *arg1 = 0 ; FXColor *arg2 = (FXColor *) 0 ;
|
data/ext/fox12/image_wrap.cpp
CHANGED
|
@@ -86,13 +86,16 @@ private:
|
|
|
86
86
|
|
|
87
87
|
#ifdef __cplusplus
|
|
88
88
|
# ifndef RUBY_METHOD_FUNC /* These definitions should work for Ruby 1.4.6 */
|
|
89
|
+
# define PROTECTFUNC(f) ((VALUE (*)()) f)
|
|
89
90
|
# define VALUEFUNC(f) ((VALUE (*)()) f)
|
|
90
91
|
# define VOIDFUNC(f) ((void (*)()) f)
|
|
91
92
|
# else
|
|
92
93
|
# ifndef ANYARGS /* These definitions should work for Ruby 1.6 */
|
|
94
|
+
# define PROTECTFUNC(f) ((VALUE (*)()) f)
|
|
93
95
|
# define VALUEFUNC(f) ((VALUE (*)()) f)
|
|
94
96
|
# define VOIDFUNC(f) ((RUBY_DATA_FUNC) f)
|
|
95
|
-
# else /* These definitions should work for Ruby 1.7 */
|
|
97
|
+
# else /* These definitions should work for Ruby 1.7+ */
|
|
98
|
+
# define PROTECTFUNC(f) ((VALUE (*)(VALUE)) f)
|
|
96
99
|
# define VALUEFUNC(f) ((VALUE (*)(ANYARGS)) f)
|
|
97
100
|
# define VOIDFUNC(f) ((RUBY_DATA_FUNC) f)
|
|
98
101
|
# endif
|
|
@@ -265,13 +268,14 @@ SWIGIMPORT(char *) SWIG_UnpackData(char *, void *, int);
|
|
|
265
268
|
#else
|
|
266
269
|
|
|
267
270
|
static swig_type_info *swig_type_list = 0;
|
|
271
|
+
static swig_type_info **swig_type_list_handle = &swig_type_list;
|
|
268
272
|
|
|
269
273
|
/* Register a type mapping with the type-checking */
|
|
270
274
|
SWIGRUNTIME(swig_type_info *)
|
|
271
275
|
SWIG_TypeRegister(swig_type_info *ti) {
|
|
272
276
|
swig_type_info *tc, *head, *ret, *next;
|
|
273
277
|
/* Check to see if this type has already been registered */
|
|
274
|
-
tc =
|
|
278
|
+
tc = *swig_type_list_handle;
|
|
275
279
|
while (tc) {
|
|
276
280
|
if (strcmp(tc->name, ti->name) == 0) {
|
|
277
281
|
/* Already exists in the table. Just add additional types to the list */
|
|
@@ -286,8 +290,8 @@ SWIG_TypeRegister(swig_type_info *ti) {
|
|
|
286
290
|
next = 0;
|
|
287
291
|
|
|
288
292
|
/* Place in list */
|
|
289
|
-
ti->prev =
|
|
290
|
-
|
|
293
|
+
ti->prev = *swig_type_list_handle;
|
|
294
|
+
*swig_type_list_handle = ti;
|
|
291
295
|
|
|
292
296
|
/* Build linked lists */
|
|
293
297
|
l1:
|
|
@@ -416,7 +420,7 @@ SWIG_TypeEquiv(const char *nb, const char *tb) {
|
|
|
416
420
|
/* Search for a swig_type_info structure */
|
|
417
421
|
SWIGRUNTIME(swig_type_info *)
|
|
418
422
|
SWIG_TypeQuery(const char *name) {
|
|
419
|
-
swig_type_info *ty =
|
|
423
|
+
swig_type_info *ty = *swig_type_list_handle;
|
|
420
424
|
while (ty) {
|
|
421
425
|
if (ty->str && (SWIG_TypeEquiv(ty->str,name))) return ty;
|
|
422
426
|
if (ty->name && (strcmp(name,ty->name) == 0)) return ty;
|
|
@@ -434,7 +438,7 @@ SWIG_TypeClientData(swig_type_info *ti, void *clientdata) {
|
|
|
434
438
|
equiv = ti->next;
|
|
435
439
|
while (equiv) {
|
|
436
440
|
if (!equiv->converter) {
|
|
437
|
-
tc =
|
|
441
|
+
tc = *swig_type_list_handle;
|
|
438
442
|
while (tc) {
|
|
439
443
|
if ((strcmp(tc->name, equiv->name) == 0))
|
|
440
444
|
SWIG_TypeClientData(tc,clientdata);
|
|
@@ -543,6 +547,12 @@ static swig_type_info *swig_types[24];
|
|
|
543
547
|
#define SWIG_name "Image"
|
|
544
548
|
|
|
545
549
|
|
|
550
|
+
static void SWIG_AsVal(VALUE obj, int *val)
|
|
551
|
+
{
|
|
552
|
+
*val = (int) NUM2INT(obj);
|
|
553
|
+
}
|
|
554
|
+
|
|
555
|
+
|
|
546
556
|
#include "FXRbCommon.h"
|
|
547
557
|
|
|
548
558
|
|