itextomml 1.5.1 → 1.5.2
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.
- checksums.yaml +7 -0
- data/ext/itex2MML.h +3 -3
- data/ext/itex2MML_ruby.c +102 -103
- metadata +25 -44
checksums.yaml
ADDED
@@ -0,0 +1,7 @@
|
|
1
|
+
---
|
2
|
+
SHA1:
|
3
|
+
metadata.gz: f52f4b4c76ab944e65193020f59e2b099e6f5c2d
|
4
|
+
data.tar.gz: dd3134aac7bd23cc6f83c1f65529c61f35358e09
|
5
|
+
SHA512:
|
6
|
+
metadata.gz: 1766a10989d67cfec9b950c6b53225bb75b646031f35df5f9c4ac021556c19bd3dc7b0c77763c525e98faf595d0c777b8e1c44e3dc2d4e0922c7b769df9f7da8
|
7
|
+
data.tar.gz: 3a2465034a618d3c749f307dc96ed7091aa30f91d227526783dce4af7bf34fee24e0da12b258e2bea889fcfd6de452e504ea6fac0fa658d430eb0799d8bed1f7
|
data/ext/itex2MML.h
CHANGED
@@ -1,11 +1,11 @@
|
|
1
|
-
/* itex2MML 1.5.
|
2
|
-
* itex2MML.h last modified
|
1
|
+
/* itex2MML 1.5.2
|
2
|
+
* itex2MML.h last modified 6/13/2014
|
3
3
|
*/
|
4
4
|
|
5
5
|
#ifndef ITEX2MML_H
|
6
6
|
#define ITEX2MML_H
|
7
7
|
|
8
|
-
#define ITEX2MML_VERSION "1.5.
|
8
|
+
#define ITEX2MML_VERSION "1.5.2"
|
9
9
|
|
10
10
|
#ifdef __cplusplus
|
11
11
|
extern "C" {
|
data/ext/itex2MML_ruby.c
CHANGED
@@ -1,11 +1,11 @@
|
|
1
1
|
/* ----------------------------------------------------------------------------
|
2
2
|
* This file was automatically generated by SWIG (http://www.swig.org).
|
3
|
-
* Version
|
4
|
-
*
|
5
|
-
* This file is not intended to be easily readable and contains a number of
|
3
|
+
* Version 3.0.0
|
4
|
+
*
|
5
|
+
* This file is not intended to be easily readable and contains a number of
|
6
6
|
* coding conventions designed to improve portability and efficiency. Do not make
|
7
|
-
* changes to this file unless you know what you are doing--modify the SWIG
|
8
|
-
* interface file instead.
|
7
|
+
* changes to this file unless you know what you are doing--modify the SWIG
|
8
|
+
* interface file instead.
|
9
9
|
* ----------------------------------------------------------------------------- */
|
10
10
|
|
11
11
|
#define SWIGRUBY
|
@@ -41,28 +41,28 @@
|
|
41
41
|
#ifndef SWIGUNUSED
|
42
42
|
# if defined(__GNUC__)
|
43
43
|
# if !(defined(__cplusplus)) || (__GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4))
|
44
|
-
# define SWIGUNUSED __attribute__ ((__unused__))
|
44
|
+
# define SWIGUNUSED __attribute__ ((__unused__))
|
45
45
|
# else
|
46
46
|
# define SWIGUNUSED
|
47
47
|
# endif
|
48
48
|
# elif defined(__ICC)
|
49
|
-
# define SWIGUNUSED __attribute__ ((__unused__))
|
49
|
+
# define SWIGUNUSED __attribute__ ((__unused__))
|
50
50
|
# else
|
51
|
-
# define SWIGUNUSED
|
51
|
+
# define SWIGUNUSED
|
52
52
|
# endif
|
53
53
|
#endif
|
54
54
|
|
55
55
|
#ifndef SWIG_MSC_UNSUPPRESS_4505
|
56
56
|
# if defined(_MSC_VER)
|
57
57
|
# pragma warning(disable : 4505) /* unreferenced local function has been removed */
|
58
|
-
# endif
|
58
|
+
# endif
|
59
59
|
#endif
|
60
60
|
|
61
61
|
#ifndef SWIGUNUSEDPARM
|
62
62
|
# ifdef __cplusplus
|
63
63
|
# define SWIGUNUSEDPARM(p)
|
64
64
|
# else
|
65
|
-
# define SWIGUNUSEDPARM(p) p SWIGUNUSED
|
65
|
+
# define SWIGUNUSEDPARM(p) p SWIGUNUSED
|
66
66
|
# endif
|
67
67
|
#endif
|
68
68
|
|
@@ -105,7 +105,7 @@
|
|
105
105
|
# define SWIGSTDCALL __stdcall
|
106
106
|
# else
|
107
107
|
# define SWIGSTDCALL
|
108
|
-
# endif
|
108
|
+
# endif
|
109
109
|
#endif
|
110
110
|
|
111
111
|
/* Deal with Microsoft's attempt at deprecating C standard runtime functions */
|
@@ -150,28 +150,28 @@
|
|
150
150
|
#ifndef SWIGUNUSED
|
151
151
|
# if defined(__GNUC__)
|
152
152
|
# if !(defined(__cplusplus)) || (__GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4))
|
153
|
-
# define SWIGUNUSED __attribute__ ((__unused__))
|
153
|
+
# define SWIGUNUSED __attribute__ ((__unused__))
|
154
154
|
# else
|
155
155
|
# define SWIGUNUSED
|
156
156
|
# endif
|
157
157
|
# elif defined(__ICC)
|
158
|
-
# define SWIGUNUSED __attribute__ ((__unused__))
|
158
|
+
# define SWIGUNUSED __attribute__ ((__unused__))
|
159
159
|
# else
|
160
|
-
# define SWIGUNUSED
|
160
|
+
# define SWIGUNUSED
|
161
161
|
# endif
|
162
162
|
#endif
|
163
163
|
|
164
164
|
#ifndef SWIG_MSC_UNSUPPRESS_4505
|
165
165
|
# if defined(_MSC_VER)
|
166
166
|
# pragma warning(disable : 4505) /* unreferenced local function has been removed */
|
167
|
-
# endif
|
167
|
+
# endif
|
168
168
|
#endif
|
169
169
|
|
170
170
|
#ifndef SWIGUNUSEDPARM
|
171
171
|
# ifdef __cplusplus
|
172
172
|
# define SWIGUNUSEDPARM(p)
|
173
173
|
# else
|
174
|
-
# define SWIGUNUSEDPARM(p) p SWIGUNUSED
|
174
|
+
# define SWIGUNUSEDPARM(p) p SWIGUNUSED
|
175
175
|
# endif
|
176
176
|
#endif
|
177
177
|
|
@@ -214,7 +214,7 @@
|
|
214
214
|
# define SWIGSTDCALL __stdcall
|
215
215
|
# else
|
216
216
|
# define SWIGSTDCALL
|
217
|
-
# endif
|
217
|
+
# endif
|
218
218
|
#endif
|
219
219
|
|
220
220
|
/* Deal with Microsoft's attempt at deprecating C standard runtime functions */
|
@@ -252,7 +252,7 @@
|
|
252
252
|
You can use the SWIGRUNTIME and SWIGRUNTIMEINLINE macros for
|
253
253
|
creating a static or dynamic library from the SWIG runtime code.
|
254
254
|
In 99.9% of the cases, SWIG just needs to declare them as 'static'.
|
255
|
-
|
255
|
+
|
256
256
|
But only do this if strictly necessary, ie, if you have problems
|
257
257
|
with your compiler or suchlike.
|
258
258
|
*/
|
@@ -278,16 +278,16 @@
|
|
278
278
|
#define SWIG_POINTER_OWN 0x1
|
279
279
|
|
280
280
|
|
281
|
-
/*
|
281
|
+
/*
|
282
282
|
Flags/methods for returning states.
|
283
|
-
|
284
|
-
The SWIG conversion methods, as ConvertPtr, return an integer
|
283
|
+
|
284
|
+
The SWIG conversion methods, as ConvertPtr, return an integer
|
285
285
|
that tells if the conversion was successful or not. And if not,
|
286
286
|
an error code can be returned (see swigerrors.swg for the codes).
|
287
|
-
|
287
|
+
|
288
288
|
Use the following macros/flags to set or process the returning
|
289
289
|
states.
|
290
|
-
|
290
|
+
|
291
291
|
In old versions of SWIG, code such as the following was usually written:
|
292
292
|
|
293
293
|
if (SWIG_ConvertPtr(obj,vptr,ty.flags) != -1) {
|
@@ -320,23 +320,23 @@
|
|
320
320
|
} else {
|
321
321
|
// fail code
|
322
322
|
}
|
323
|
-
|
323
|
+
|
324
324
|
I.e., now SWIG_ConvertPtr can return new objects and you can
|
325
325
|
identify the case and take care of the deallocation. Of course that
|
326
326
|
also requires SWIG_ConvertPtr to return new result values, such as
|
327
327
|
|
328
|
-
int SWIG_ConvertPtr(obj, ptr,...) {
|
329
|
-
if (<obj is ok>) {
|
330
|
-
if (<need new object>) {
|
331
|
-
*ptr = <ptr to new allocated object>;
|
332
|
-
return SWIG_NEWOBJ;
|
333
|
-
} else {
|
334
|
-
*ptr = <ptr to old object>;
|
335
|
-
return SWIG_OLDOBJ;
|
336
|
-
}
|
337
|
-
} else {
|
338
|
-
return SWIG_BADOBJ;
|
339
|
-
}
|
328
|
+
int SWIG_ConvertPtr(obj, ptr,...) {
|
329
|
+
if (<obj is ok>) {
|
330
|
+
if (<need new object>) {
|
331
|
+
*ptr = <ptr to new allocated object>;
|
332
|
+
return SWIG_NEWOBJ;
|
333
|
+
} else {
|
334
|
+
*ptr = <ptr to old object>;
|
335
|
+
return SWIG_OLDOBJ;
|
336
|
+
}
|
337
|
+
} else {
|
338
|
+
return SWIG_BADOBJ;
|
339
|
+
}
|
340
340
|
}
|
341
341
|
|
342
342
|
Of course, returning the plain '0(success)/-1(fail)' still works, but you can be
|
@@ -350,17 +350,17 @@
|
|
350
350
|
int fooi(int);
|
351
351
|
|
352
352
|
and you call
|
353
|
-
|
353
|
+
|
354
354
|
food(1) // cast rank '1' (1 -> 1.0)
|
355
355
|
fooi(1) // cast rank '0'
|
356
356
|
|
357
357
|
just use the SWIG_AddCast()/SWIG_CheckState()
|
358
358
|
*/
|
359
359
|
|
360
|
-
#define SWIG_OK (0)
|
360
|
+
#define SWIG_OK (0)
|
361
361
|
#define SWIG_ERROR (-1)
|
362
362
|
#define SWIG_IsOK(r) (r >= 0)
|
363
|
-
#define SWIG_ArgError(r) ((r != SWIG_ERROR) ? r : SWIG_TypeError)
|
363
|
+
#define SWIG_ArgError(r) ((r != SWIG_ERROR) ? r : SWIG_TypeError)
|
364
364
|
|
365
365
|
/* The CastRankLimit says how many bits are used for the cast rank */
|
366
366
|
#define SWIG_CASTRANKLIMIT (1 << 8)
|
@@ -391,11 +391,11 @@
|
|
391
391
|
# endif
|
392
392
|
# define SWIG_CASTRANKMASK ((SWIG_CASTRANKLIMIT) -1)
|
393
393
|
# define SWIG_CastRank(r) (r & SWIG_CASTRANKMASK)
|
394
|
-
SWIGINTERNINLINE int SWIG_AddCast(int r) {
|
394
|
+
SWIGINTERNINLINE int SWIG_AddCast(int r) {
|
395
395
|
return SWIG_IsOK(r) ? ((SWIG_CastRank(r) < SWIG_MAXCASTRANK) ? (r + 1) : SWIG_ERROR) : r;
|
396
396
|
}
|
397
|
-
SWIGINTERNINLINE int SWIG_CheckState(int r) {
|
398
|
-
return SWIG_IsOK(r) ? SWIG_CastRank(r) + 1 : 0;
|
397
|
+
SWIGINTERNINLINE int SWIG_CheckState(int r) {
|
398
|
+
return SWIG_IsOK(r) ? SWIG_CastRank(r) + 1 : 0;
|
399
399
|
}
|
400
400
|
#else /* no cast-rank mode */
|
401
401
|
# define SWIG_AddCast(r) (r)
|
@@ -442,7 +442,7 @@ typedef struct swig_module_info {
|
|
442
442
|
void *clientdata; /* Language specific module data */
|
443
443
|
} swig_module_info;
|
444
444
|
|
445
|
-
/*
|
445
|
+
/*
|
446
446
|
Compare two type names skipping the space characters, therefore
|
447
447
|
"char*" == "char *" and "Class<int>" == "Class<int >", etc.
|
448
448
|
|
@@ -515,7 +515,7 @@ SWIG_TypeCheck(const char *c, swig_type_info *ty) {
|
|
515
515
|
return 0;
|
516
516
|
}
|
517
517
|
|
518
|
-
/*
|
518
|
+
/*
|
519
519
|
Identical to SWIG_TypeCheck, except strcmp is replaced with a pointer comparison
|
520
520
|
*/
|
521
521
|
SWIGRUNTIME swig_cast_info *
|
@@ -550,7 +550,7 @@ SWIG_TypeCast(swig_cast_info *ty, void *ptr, int *newmemory) {
|
|
550
550
|
return ((!ty) || (!ty->converter)) ? ptr : (*ty->converter)(ptr, newmemory);
|
551
551
|
}
|
552
552
|
|
553
|
-
/*
|
553
|
+
/*
|
554
554
|
Dynamic pointer casting. Down an inheritance hierarchy
|
555
555
|
*/
|
556
556
|
SWIGRUNTIME swig_type_info *
|
@@ -594,7 +594,7 @@ SWIG_TypePrettyName(const swig_type_info *type) {
|
|
594
594
|
return type->name;
|
595
595
|
}
|
596
596
|
|
597
|
-
/*
|
597
|
+
/*
|
598
598
|
Set the clientdata field for a type
|
599
599
|
*/
|
600
600
|
SWIGRUNTIME void
|
@@ -602,14 +602,14 @@ SWIG_TypeClientData(swig_type_info *ti, void *clientdata) {
|
|
602
602
|
swig_cast_info *cast = ti->cast;
|
603
603
|
/* if (ti->clientdata == clientdata) return; */
|
604
604
|
ti->clientdata = clientdata;
|
605
|
-
|
605
|
+
|
606
606
|
while (cast) {
|
607
607
|
if (!cast->converter) {
|
608
608
|
swig_type_info *tc = cast->type;
|
609
609
|
if (!tc->clientdata) {
|
610
610
|
SWIG_TypeClientData(tc, clientdata);
|
611
611
|
}
|
612
|
-
}
|
612
|
+
}
|
613
613
|
cast = cast->next;
|
614
614
|
}
|
615
615
|
}
|
@@ -618,31 +618,31 @@ SWIG_TypeNewClientData(swig_type_info *ti, void *clientdata) {
|
|
618
618
|
SWIG_TypeClientData(ti, clientdata);
|
619
619
|
ti->owndata = 1;
|
620
620
|
}
|
621
|
-
|
621
|
+
|
622
622
|
/*
|
623
623
|
Search for a swig_type_info structure only by mangled name
|
624
624
|
Search is a O(log #types)
|
625
|
-
|
626
|
-
We start searching at module start, and finish searching when start == end.
|
625
|
+
|
626
|
+
We start searching at module start, and finish searching when start == end.
|
627
627
|
Note: if start == end at the beginning of the function, we go all the way around
|
628
628
|
the circular list.
|
629
629
|
*/
|
630
630
|
SWIGRUNTIME swig_type_info *
|
631
|
-
SWIG_MangledTypeQueryModule(swig_module_info *start,
|
632
|
-
swig_module_info *end,
|
631
|
+
SWIG_MangledTypeQueryModule(swig_module_info *start,
|
632
|
+
swig_module_info *end,
|
633
633
|
const char *name) {
|
634
634
|
swig_module_info *iter = start;
|
635
635
|
do {
|
636
636
|
if (iter->size) {
|
637
|
-
|
638
|
-
|
637
|
+
size_t l = 0;
|
638
|
+
size_t r = iter->size - 1;
|
639
639
|
do {
|
640
640
|
/* since l+r >= 0, we can (>> 1) instead (/ 2) */
|
641
|
-
|
641
|
+
size_t i = (l + r) >> 1;
|
642
642
|
const char *iname = iter->types[i]->name;
|
643
643
|
if (iname) {
|
644
|
-
|
645
|
-
if (compare == 0) {
|
644
|
+
int compare = strcmp(name, iname);
|
645
|
+
if (compare == 0) {
|
646
646
|
return iter->types[i];
|
647
647
|
} else if (compare < 0) {
|
648
648
|
if (i) {
|
@@ -667,14 +667,14 @@ SWIG_MangledTypeQueryModule(swig_module_info *start,
|
|
667
667
|
Search for a swig_type_info structure for either a mangled name or a human readable name.
|
668
668
|
It first searches the mangled names of the types, which is a O(log #types)
|
669
669
|
If a type is not found it then searches the human readable names, which is O(#types).
|
670
|
-
|
671
|
-
We start searching at module start, and finish searching when start == end.
|
670
|
+
|
671
|
+
We start searching at module start, and finish searching when start == end.
|
672
672
|
Note: if start == end at the beginning of the function, we go all the way around
|
673
673
|
the circular list.
|
674
674
|
*/
|
675
675
|
SWIGRUNTIME swig_type_info *
|
676
|
-
SWIG_TypeQueryModule(swig_module_info *start,
|
677
|
-
swig_module_info *end,
|
676
|
+
SWIG_TypeQueryModule(swig_module_info *start,
|
677
|
+
swig_module_info *end,
|
678
678
|
const char *name) {
|
679
679
|
/* STEP 1: Search the name field using binary search */
|
680
680
|
swig_type_info *ret = SWIG_MangledTypeQueryModule(start, end, name);
|
@@ -685,7 +685,7 @@ SWIG_TypeQueryModule(swig_module_info *start,
|
|
685
685
|
of the str field (the human readable name) */
|
686
686
|
swig_module_info *iter = start;
|
687
687
|
do {
|
688
|
-
|
688
|
+
size_t i = 0;
|
689
689
|
for (; i < iter->size; ++i) {
|
690
690
|
if (iter->types[i]->str && (SWIG_TypeEquiv(iter->types[i]->str, name)))
|
691
691
|
return iter->types[i];
|
@@ -693,56 +693,56 @@ SWIG_TypeQueryModule(swig_module_info *start,
|
|
693
693
|
iter = iter->next;
|
694
694
|
} while (iter != end);
|
695
695
|
}
|
696
|
-
|
696
|
+
|
697
697
|
/* neither found a match */
|
698
698
|
return 0;
|
699
699
|
}
|
700
700
|
|
701
|
-
/*
|
701
|
+
/*
|
702
702
|
Pack binary data into a string
|
703
703
|
*/
|
704
704
|
SWIGRUNTIME char *
|
705
705
|
SWIG_PackData(char *c, void *ptr, size_t sz) {
|
706
706
|
static const char hex[17] = "0123456789abcdef";
|
707
|
-
|
708
|
-
|
707
|
+
const unsigned char *u = (unsigned char *) ptr;
|
708
|
+
const unsigned char *eu = u + sz;
|
709
709
|
for (; u != eu; ++u) {
|
710
|
-
|
710
|
+
unsigned char uu = *u;
|
711
711
|
*(c++) = hex[(uu & 0xf0) >> 4];
|
712
712
|
*(c++) = hex[uu & 0xf];
|
713
713
|
}
|
714
714
|
return c;
|
715
715
|
}
|
716
716
|
|
717
|
-
/*
|
717
|
+
/*
|
718
718
|
Unpack binary data from a string
|
719
719
|
*/
|
720
720
|
SWIGRUNTIME const char *
|
721
721
|
SWIG_UnpackData(const char *c, void *ptr, size_t sz) {
|
722
|
-
|
723
|
-
|
722
|
+
unsigned char *u = (unsigned char *) ptr;
|
723
|
+
const unsigned char *eu = u + sz;
|
724
724
|
for (; u != eu; ++u) {
|
725
|
-
|
726
|
-
|
725
|
+
char d = *(c++);
|
726
|
+
unsigned char uu;
|
727
727
|
if ((d >= '0') && (d <= '9'))
|
728
728
|
uu = ((d - '0') << 4);
|
729
729
|
else if ((d >= 'a') && (d <= 'f'))
|
730
730
|
uu = ((d - ('a'-10)) << 4);
|
731
|
-
else
|
731
|
+
else
|
732
732
|
return (char *) 0;
|
733
733
|
d = *(c++);
|
734
734
|
if ((d >= '0') && (d <= '9'))
|
735
735
|
uu |= (d - '0');
|
736
736
|
else if ((d >= 'a') && (d <= 'f'))
|
737
737
|
uu |= (d - ('a'-10));
|
738
|
-
else
|
738
|
+
else
|
739
739
|
return (char *) 0;
|
740
740
|
*u = uu;
|
741
741
|
}
|
742
742
|
return c;
|
743
743
|
}
|
744
744
|
|
745
|
-
/*
|
745
|
+
/*
|
746
746
|
Pack 'void *' into a string buffer.
|
747
747
|
*/
|
748
748
|
SWIGRUNTIME char *
|
@@ -802,18 +802,18 @@ SWIG_UnpackDataName(const char *c, void *ptr, size_t sz, const char *name) {
|
|
802
802
|
#endif
|
803
803
|
|
804
804
|
/* Errors in SWIG */
|
805
|
-
#define SWIG_UnknownError -1
|
806
|
-
#define SWIG_IOError -2
|
807
|
-
#define SWIG_RuntimeError -3
|
808
|
-
#define SWIG_IndexError -4
|
809
|
-
#define SWIG_TypeError -5
|
810
|
-
#define SWIG_DivisionByZero -6
|
811
|
-
#define SWIG_OverflowError -7
|
812
|
-
#define SWIG_SyntaxError -8
|
813
|
-
#define SWIG_ValueError -9
|
805
|
+
#define SWIG_UnknownError -1
|
806
|
+
#define SWIG_IOError -2
|
807
|
+
#define SWIG_RuntimeError -3
|
808
|
+
#define SWIG_IndexError -4
|
809
|
+
#define SWIG_TypeError -5
|
810
|
+
#define SWIG_DivisionByZero -6
|
811
|
+
#define SWIG_OverflowError -7
|
812
|
+
#define SWIG_SyntaxError -8
|
813
|
+
#define SWIG_ValueError -9
|
814
814
|
#define SWIG_SystemError -10
|
815
815
|
#define SWIG_AttributeError -11
|
816
|
-
#define SWIG_MemoryError -12
|
816
|
+
#define SWIG_MemoryError -12
|
817
817
|
#define SWIG_NullReferenceError -13
|
818
818
|
|
819
819
|
|
@@ -1479,14 +1479,13 @@ SWIG_Ruby_InitRuntime(void)
|
|
1479
1479
|
SWIGRUNTIME void
|
1480
1480
|
SWIG_Ruby_define_class(swig_type_info *type)
|
1481
1481
|
{
|
1482
|
-
VALUE klass;
|
1483
1482
|
char *klass_name = (char *) malloc(4 + strlen(type->name) + 1);
|
1484
1483
|
sprintf(klass_name, "TYPE%s", type->name);
|
1485
1484
|
if (NIL_P(_cSWIG_Pointer)) {
|
1486
1485
|
_cSWIG_Pointer = rb_define_class_under(_mSWIG, "Pointer", rb_cObject);
|
1487
1486
|
rb_undef_method(CLASS_OF(_cSWIG_Pointer), "new");
|
1488
1487
|
}
|
1489
|
-
|
1488
|
+
rb_define_class_under(_mSWIG, klass_name, _cSWIG_Pointer);
|
1490
1489
|
free((void *) klass_name);
|
1491
1490
|
}
|
1492
1491
|
|
@@ -1795,7 +1794,7 @@ static VALUE mItex2MML;
|
|
1795
1794
|
#define SWIG_RUBY_THREAD_END_BLOCK
|
1796
1795
|
|
1797
1796
|
|
1798
|
-
#define SWIGVERSION
|
1797
|
+
#define SWIGVERSION 0x030000
|
1799
1798
|
#define SWIG_VERSION SWIGVERSION
|
1800
1799
|
|
1801
1800
|
|
@@ -1864,7 +1863,7 @@ SWIG_ruby_failed(void)
|
|
1864
1863
|
}
|
1865
1864
|
|
1866
1865
|
|
1867
|
-
/*@SWIG:/sw/share/swig/
|
1866
|
+
/*@SWIG:/sw/share/swig/3.0.0/ruby/rubyprimtypes.swg,19,%ruby_aux_method@*/
|
1868
1867
|
SWIGINTERN VALUE SWIG_AUX_NUM2ULONG(VALUE *args)
|
1869
1868
|
{
|
1870
1869
|
VALUE obj = args[0];
|
@@ -2042,18 +2041,18 @@ static swig_cast_info *swig_cast_initial[] = {
|
|
2042
2041
|
|
2043
2042
|
/* -----------------------------------------------------------------------------
|
2044
2043
|
* Type initialization:
|
2045
|
-
* This problem is tough by the requirement that no dynamic
|
2046
|
-
* memory is used. Also, since swig_type_info structures store pointers to
|
2044
|
+
* This problem is tough by the requirement that no dynamic
|
2045
|
+
* memory is used. Also, since swig_type_info structures store pointers to
|
2047
2046
|
* swig_cast_info structures and swig_cast_info structures store pointers back
|
2048
|
-
* to swig_type_info structures, we need some lookup code at initialization.
|
2049
|
-
* The idea is that swig generates all the structures that are needed.
|
2050
|
-
* The runtime then collects these partially filled structures.
|
2051
|
-
* The SWIG_InitializeModule function takes these initial arrays out of
|
2047
|
+
* to swig_type_info structures, we need some lookup code at initialization.
|
2048
|
+
* The idea is that swig generates all the structures that are needed.
|
2049
|
+
* The runtime then collects these partially filled structures.
|
2050
|
+
* The SWIG_InitializeModule function takes these initial arrays out of
|
2052
2051
|
* swig_module, and does all the lookup, filling in the swig_module.types
|
2053
2052
|
* array with the correct data and linking the correct swig_cast_info
|
2054
2053
|
* structures together.
|
2055
2054
|
*
|
2056
|
-
* The generated swig_type_info structures are assigned
|
2055
|
+
* The generated swig_type_info structures are assigned statically to an initial
|
2057
2056
|
* array. We just loop through that array, and handle each type individually.
|
2058
2057
|
* First we lookup if this type has been already loaded, and if so, use the
|
2059
2058
|
* loaded structure instead of the generated one. Then we have to fill in the
|
@@ -2063,17 +2062,17 @@ static swig_cast_info *swig_cast_initial[] = {
|
|
2063
2062
|
* a column is one of the swig_cast_info structures for that type.
|
2064
2063
|
* The cast_initial array is actually an array of arrays, because each row has
|
2065
2064
|
* a variable number of columns. So to actually build the cast linked list,
|
2066
|
-
* we find the array of casts associated with the type, and loop through it
|
2065
|
+
* we find the array of casts associated with the type, and loop through it
|
2067
2066
|
* adding the casts to the list. The one last trick we need to do is making
|
2068
2067
|
* sure the type pointer in the swig_cast_info struct is correct.
|
2069
2068
|
*
|
2070
|
-
* First off, we lookup the cast->type name to see if it is already loaded.
|
2069
|
+
* First off, we lookup the cast->type name to see if it is already loaded.
|
2071
2070
|
* There are three cases to handle:
|
2072
2071
|
* 1) If the cast->type has already been loaded AND the type we are adding
|
2073
2072
|
* casting info to has not been loaded (it is in this module), THEN we
|
2074
2073
|
* replace the cast->type pointer with the type pointer that has already
|
2075
2074
|
* been loaded.
|
2076
|
-
* 2) If BOTH types (the one we are adding casting info to, and the
|
2075
|
+
* 2) If BOTH types (the one we are adding casting info to, and the
|
2077
2076
|
* cast->type) are loaded, THEN the cast info has already been loaded by
|
2078
2077
|
* the previous module so we just ignore it.
|
2079
2078
|
* 3) Finally, if cast->type has not already been loaded, then we add that
|
@@ -2136,7 +2135,7 @@ SWIG_InitializeModule(void *clientdata) {
|
|
2136
2135
|
module_head->next = &swig_module;
|
2137
2136
|
}
|
2138
2137
|
|
2139
|
-
/* When multiple
|
2138
|
+
/* When multiple interpreters are used, a module could have already been initialized in
|
2140
2139
|
a different interpreter, but not yet have a pointer in this interpreter.
|
2141
2140
|
In this case, we do not want to continue adding types... everything should be
|
2142
2141
|
set up already */
|
@@ -2150,7 +2149,7 @@ SWIG_InitializeModule(void *clientdata) {
|
|
2150
2149
|
swig_type_info *type = 0;
|
2151
2150
|
swig_type_info *ret;
|
2152
2151
|
swig_cast_info *cast;
|
2153
|
-
|
2152
|
+
|
2154
2153
|
#ifdef SWIGRUNTIME_DEBUG
|
2155
2154
|
printf("SWIG_InitializeModule: type %d %s\n", i, swig_module.type_initial[i]->name);
|
2156
2155
|
#endif
|
@@ -2177,7 +2176,7 @@ SWIG_InitializeModule(void *clientdata) {
|
|
2177
2176
|
/* Insert casting types */
|
2178
2177
|
cast = swig_module.cast_initial[i];
|
2179
2178
|
while (cast->type) {
|
2180
|
-
|
2179
|
+
|
2181
2180
|
/* Don't need to add information already in the list */
|
2182
2181
|
ret = 0;
|
2183
2182
|
#ifdef SWIGRUNTIME_DEBUG
|
metadata
CHANGED
@@ -1,75 +1,56 @@
|
|
1
|
-
--- !ruby/object:Gem::Specification
|
1
|
+
--- !ruby/object:Gem::Specification
|
2
2
|
name: itextomml
|
3
|
-
version: !ruby/object:Gem::Version
|
4
|
-
|
5
|
-
prerelease:
|
6
|
-
segments:
|
7
|
-
- 1
|
8
|
-
- 5
|
9
|
-
- 1
|
10
|
-
version: 1.5.1
|
3
|
+
version: !ruby/object:Gem::Version
|
4
|
+
version: 1.5.2
|
11
5
|
platform: ruby
|
12
|
-
authors:
|
6
|
+
authors:
|
13
7
|
- Jacques Distler
|
14
8
|
autorequire:
|
15
9
|
bindir: bin
|
16
10
|
cert_chain: []
|
17
|
-
|
18
|
-
date: 2014-01-05 00:00:00 Z
|
11
|
+
date: 2014-06-13 00:00:00.000000000 Z
|
19
12
|
dependencies: []
|
20
|
-
|
21
|
-
|
13
|
+
description: itextomml provides native Ruby bindings to itex2MML, which converts itex
|
14
|
+
equations to MathML.
|
22
15
|
email: jdistler-gemcutter@golem.ph.utexas.edu
|
23
16
|
executables: []
|
24
|
-
|
25
|
-
extensions:
|
17
|
+
extensions:
|
26
18
|
- ext/extconf.rb
|
27
19
|
extra_rdoc_files: []
|
28
|
-
|
29
|
-
|
20
|
+
files:
|
21
|
+
- README
|
22
|
+
- ext/extconf.rb
|
23
|
+
- ext/itex2MML.h
|
30
24
|
- ext/itex2MML_ruby.c
|
31
25
|
- ext/lex.yy.c
|
32
26
|
- ext/y.tab.c
|
33
|
-
- ext/itex2MML.h
|
34
27
|
- ext/y.tab.h
|
35
28
|
- lib/itex_stringsupport.rb
|
36
29
|
- lib/itextomml.rb
|
37
30
|
- test/test_itextomml.rb
|
38
|
-
- README
|
39
|
-
- ext/extconf.rb
|
40
31
|
homepage: http://golem.ph.utexas.edu/~distler/blog/itex2MML.html
|
41
32
|
licenses: []
|
42
|
-
|
33
|
+
metadata: {}
|
43
34
|
post_install_message:
|
44
35
|
rdoc_options: []
|
45
|
-
|
46
|
-
require_paths:
|
36
|
+
require_paths:
|
47
37
|
- lib
|
48
38
|
- ext
|
49
|
-
required_ruby_version: !ruby/object:Gem::Requirement
|
50
|
-
|
51
|
-
requirements:
|
39
|
+
required_ruby_version: !ruby/object:Gem::Requirement
|
40
|
+
requirements:
|
52
41
|
- - ">="
|
53
|
-
- !ruby/object:Gem::Version
|
54
|
-
|
55
|
-
|
56
|
-
|
57
|
-
version: "0"
|
58
|
-
required_rubygems_version: !ruby/object:Gem::Requirement
|
59
|
-
none: false
|
60
|
-
requirements:
|
42
|
+
- !ruby/object:Gem::Version
|
43
|
+
version: '0'
|
44
|
+
required_rubygems_version: !ruby/object:Gem::Requirement
|
45
|
+
requirements:
|
61
46
|
- - ">="
|
62
|
-
- !ruby/object:Gem::Version
|
63
|
-
|
64
|
-
segments:
|
65
|
-
- 0
|
66
|
-
version: "0"
|
47
|
+
- !ruby/object:Gem::Version
|
48
|
+
version: '0'
|
67
49
|
requirements: []
|
68
|
-
|
69
50
|
rubyforge_project:
|
70
|
-
rubygems_version:
|
51
|
+
rubygems_version: 2.2.2
|
71
52
|
signing_key:
|
72
|
-
specification_version:
|
53
|
+
specification_version: 4
|
73
54
|
summary: Native Ruby bindings to itex2MML.
|
74
|
-
test_files:
|
55
|
+
test_files:
|
75
56
|
- test/test_itextomml.rb
|