The great merge
git-svn-id: https://swig.svn.sourceforge.net/svnroot/swig/trunk@4141 626c5289-ae23-0410-ae9c-e8d60b6d4f22
This commit is contained in:
parent
6fcc22a1f8
commit
516036631c
1508 changed files with 125983 additions and 44037 deletions
3
SWIG/Examples/mzscheme/check.list
Normal file
3
SWIG/Examples/mzscheme/check.list
Normal file
|
|
@ -0,0 +1,3 @@
|
|||
# see top-level Makefile.in
|
||||
multimap
|
||||
simple
|
||||
13
SWIG/Examples/mzscheme/multimap/Makefile
Normal file
13
SWIG/Examples/mzscheme/multimap/Makefile
Normal file
|
|
@ -0,0 +1,13 @@
|
|||
TOP = ../..
|
||||
SWIG = $(TOP)/../swig
|
||||
SRCS = example.c
|
||||
TARGET = example
|
||||
INTERFACE = example.i
|
||||
SWIGOPT =
|
||||
all::
|
||||
$(MAKE) -f $(TOP)/Makefile SRCS='$(SRCS)' SWIG='$(SWIG)' \
|
||||
SWIGOPT='$(SWIGOPT)' TARGET='$(TARGET)' INTERFACE='$(INTERFACE)' mzscheme
|
||||
clean::
|
||||
$(MAKE) -f $(TOP)/Makefile mzscheme_clean
|
||||
|
||||
check: all
|
||||
53
SWIG/Examples/mzscheme/multimap/example.c
Normal file
53
SWIG/Examples/mzscheme/multimap/example.c
Normal file
|
|
@ -0,0 +1,53 @@
|
|||
/* File : example.c */
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <ctype.h>
|
||||
|
||||
/* Compute the greatest common divisor of positive integers */
|
||||
int gcd(int x, int y) {
|
||||
int g;
|
||||
g = y;
|
||||
while (x > 0) {
|
||||
g = x;
|
||||
x = y % x;
|
||||
y = g;
|
||||
}
|
||||
return g;
|
||||
}
|
||||
|
||||
int gcdmain(int argc, char *argv[]) {
|
||||
int x,y;
|
||||
if (argc != 3) {
|
||||
printf("usage: gcd x y\n");
|
||||
return -1;
|
||||
}
|
||||
x = atoi(argv[1]);
|
||||
y = atoi(argv[2]);
|
||||
printf("gcd(%d,%d) = %d\n", x,y,gcd(x,y));
|
||||
return 0;
|
||||
}
|
||||
|
||||
int count(char *bytes, int len, char c) {
|
||||
int i;
|
||||
int count = 0;
|
||||
for (i = 0; i < len; i++) {
|
||||
if (bytes[i] == c) count++;
|
||||
}
|
||||
return count;
|
||||
}
|
||||
|
||||
void capitalize(char *str, int len) {
|
||||
int i;
|
||||
for (i = 0; i < len; i++) {
|
||||
str[i] = toupper(str[i]);
|
||||
}
|
||||
}
|
||||
|
||||
void circle(double x, double y) {
|
||||
double a = x*x + y*y;
|
||||
if (a > 1.0) {
|
||||
printf("Bad points %g, %g\n", x,y);
|
||||
} else {
|
||||
printf("Good points %g, %g\n", x,y);
|
||||
}
|
||||
}
|
||||
81
SWIG/Examples/mzscheme/multimap/example.i
Normal file
81
SWIG/Examples/mzscheme/multimap/example.i
Normal file
|
|
@ -0,0 +1,81 @@
|
|||
/* File : example.i */
|
||||
%module example
|
||||
%include exception.i
|
||||
%include typemaps.i
|
||||
|
||||
extern int gcd(int x, int y);
|
||||
|
||||
%typemap(mzscheme,in) (int argc, char *argv[]) {
|
||||
int i;
|
||||
Scheme_Object **elms;
|
||||
if (!SCHEME_VECTORP($input)) {
|
||||
scheme_wrong_type("$name","vector",$argnum,argc,argv);
|
||||
}
|
||||
$1 = SCHEME_VEC_SIZE($input);
|
||||
elms = SCHEME_VEC_ELS($input);
|
||||
if ($1 == 0) {
|
||||
scheme_wrong_type("$name","vector",$argnum,argc,argv);
|
||||
}
|
||||
$2 = (char **) malloc(($1+1)*sizeof(char *));
|
||||
for (i = 0; i < $1; i++) {
|
||||
if (!SCHEME_STRINGP(elms[i])) {
|
||||
free($2);
|
||||
scheme_wrong_type("$name","vector",$argnum,argc,argv);
|
||||
}
|
||||
$2[i] = SCHEME_STR_VAL(elms[i]);
|
||||
}
|
||||
$2[i] = 0;
|
||||
}
|
||||
|
||||
%typemap(mzscheme,freear) (int argc, char *argv[]) {
|
||||
free($2);
|
||||
}
|
||||
extern int gcdmain(int argc, char *argv[]);
|
||||
|
||||
%typemap(mzscheme,in) (char *bytes, int len) {
|
||||
if (!SCHEME_STRINGP($input)) {
|
||||
scheme_wrong_type("$name","string",1,argc,argv);
|
||||
}
|
||||
$1 = SCHEME_STR_VAL($input);
|
||||
$2 = SCHEME_STRLEN_VAL($input);
|
||||
}
|
||||
|
||||
extern int count(char *bytes, int len, char c);
|
||||
|
||||
|
||||
/* This example shows how to wrap a function that mutates a string */
|
||||
|
||||
%typemap(mzscheme,in) (char *str, int len) {
|
||||
if (!SCHEME_STRINGP($input)) {
|
||||
scheme_wrong_type("$name","string",1,argc,argv);
|
||||
}
|
||||
$2 = SCHEME_STRLEN_VAL($input);
|
||||
$1 = (char *) malloc($2+1);
|
||||
memmove($1,SCHEME_STR_VAL($input),$2);
|
||||
}
|
||||
|
||||
/* Return the mutated string as a new object. */
|
||||
|
||||
%typemap(mzscheme,argout) (char *str, int len) {
|
||||
Scheme_Object *s;
|
||||
s = scheme_make_sized_string($1,$2,1);
|
||||
SWIG_APPEND_VALUE(s);
|
||||
free($1);
|
||||
}
|
||||
|
||||
extern void capitalize(char *str, int len);
|
||||
|
||||
/* A multi-valued constraint. Force two arguments to lie
|
||||
inside the unit circle */
|
||||
|
||||
%typemap(check) (double cx, double cy) {
|
||||
double a = $1*$1 + $2*$2;
|
||||
if (a > 1.0) {
|
||||
SWIG_exception(SWIG_ValueError,"$1_name and $2_name must be in unit circle");
|
||||
return NULL;
|
||||
}
|
||||
}
|
||||
|
||||
extern void circle(double cx, double cy);
|
||||
|
||||
|
||||
27
SWIG/Examples/mzscheme/multimap/example.scm
Normal file
27
SWIG/Examples/mzscheme/multimap/example.scm
Normal file
|
|
@ -0,0 +1,27 @@
|
|||
;; run with mzscheme -r example.scm
|
||||
|
||||
(load-extension "example.so")
|
||||
|
||||
; Call the GCD function
|
||||
|
||||
(define x 42)
|
||||
(define y 105)
|
||||
(define g (gcd x y))
|
||||
|
||||
(display "The gcd of ")
|
||||
(display x)
|
||||
(display " and ")
|
||||
(display y)
|
||||
(display " is ")
|
||||
(display g)
|
||||
(newline)
|
||||
|
||||
; Call the gcdmain() function
|
||||
(gcdmain #("gcdmain" "42" "105"))
|
||||
|
||||
|
||||
(display (count "Hello World" #\l))
|
||||
(newline)
|
||||
|
||||
(display (capitalize "hello world"))
|
||||
(newline)
|
||||
1
SWIG/Examples/mzscheme/simple/.cvsignore
Normal file
1
SWIG/Examples/mzscheme/simple/.cvsignore
Normal file
|
|
@ -0,0 +1 @@
|
|||
example_wrap.c
|
||||
|
|
@ -8,6 +8,6 @@ all::
|
|||
$(MAKE) -f $(TOP)/Makefile SRCS='$(SRCS)' SWIG='$(SWIG)' \
|
||||
SWIGOPT='$(SWIGOPT)' TARGET='$(TARGET)' INTERFACE='$(INTERFACE)' mzscheme
|
||||
clean::
|
||||
rm -f *_wrap* *.o core *~ *.so
|
||||
$(MAKE) -f $(TOP)/Makefile mzscheme_clean
|
||||
|
||||
check: all
|
||||
|
|
|
|||
1
SWIG/Examples/mzscheme/std_vector/.cvsignore
Normal file
1
SWIG/Examples/mzscheme/std_vector/.cvsignore
Normal file
|
|
@ -0,0 +1 @@
|
|||
example_wrap.cxx
|
||||
19
SWIG/Examples/mzscheme/std_vector/Makefile
Normal file
19
SWIG/Examples/mzscheme/std_vector/Makefile
Normal file
|
|
@ -0,0 +1,19 @@
|
|||
TOP = ../..
|
||||
SWIG = $(TOP)/../swig
|
||||
SRCS =
|
||||
TARGET = example
|
||||
INTERFACE = example.i
|
||||
SWIGOPT =
|
||||
|
||||
GPP = `which g++`
|
||||
MZC = test -n "/usr/bin/mzc" && /usr/bin/mzc
|
||||
|
||||
all::
|
||||
$(SWIG) -mzscheme -c++ $(SWIGOPT) $(INTERFACE)
|
||||
$(MZC) --compiler $(GPP) ++ccf "-I." --cc example_wrap.cxx
|
||||
$(MZC) --linker $(GPP) --ld $(TARGET).so example_wrap.o
|
||||
|
||||
clean:
|
||||
$(MAKE) -f $(TOP)/Makefile mzscheme_clean
|
||||
|
||||
check: all
|
||||
25
SWIG/Examples/mzscheme/std_vector/example.h
Normal file
25
SWIG/Examples/mzscheme/std_vector/example.h
Normal file
|
|
@ -0,0 +1,25 @@
|
|||
/* File : example.h */
|
||||
|
||||
#include <vector>
|
||||
#include <algorithm>
|
||||
#include <functional>
|
||||
#include <numeric>
|
||||
|
||||
double average(std::vector<int> v) {
|
||||
return std::accumulate(v.begin(),v.end(),0.0)/v.size();
|
||||
}
|
||||
|
||||
std::vector<double> half(const std::vector<double>& v) {
|
||||
std::vector<double> w(v);
|
||||
for (unsigned int i=0; i<w.size(); i++)
|
||||
w[i] /= 2.0;
|
||||
return w;
|
||||
}
|
||||
|
||||
void halve_in_place(std::vector<double>& v) {
|
||||
// would you believe this is the same as the above?
|
||||
std::transform(v.begin(),v.end(),v.begin(),
|
||||
std::bind2nd(std::divides<double>(),2.0));
|
||||
}
|
||||
|
||||
|
||||
17
SWIG/Examples/mzscheme/std_vector/example.i
Normal file
17
SWIG/Examples/mzscheme/std_vector/example.i
Normal file
|
|
@ -0,0 +1,17 @@
|
|||
/* File : example.i */
|
||||
%module example
|
||||
|
||||
%{
|
||||
#include "example.h"
|
||||
%}
|
||||
|
||||
%include stl.i
|
||||
/* instantiate the required template specializations */
|
||||
namespace std {
|
||||
%template(IntVector) vector<int>;
|
||||
%template(DoubleVector) vector<double>;
|
||||
}
|
||||
|
||||
/* Let's just grab the original header file here */
|
||||
%include "example.h"
|
||||
|
||||
54
SWIG/Examples/mzscheme/std_vector/example.scm
Normal file
54
SWIG/Examples/mzscheme/std_vector/example.scm
Normal file
|
|
@ -0,0 +1,54 @@
|
|||
;; run with mzscheme -r example.scm
|
||||
|
||||
(load-extension "example.so")
|
||||
|
||||
; repeatedly invoke a procedure with v and an index as arguments
|
||||
(define (with-vector v proc size-proc)
|
||||
(let ((size (size-proc v)))
|
||||
(define (with-vector-item v i)
|
||||
(if (< i size)
|
||||
(begin
|
||||
(proc v i)
|
||||
(with-vector-item v (+ i 1)))))
|
||||
(with-vector-item v 0)))
|
||||
|
||||
(define (with-intvector v proc)
|
||||
(with-vector v proc intvector-length))
|
||||
(define (with-doublevector v proc)
|
||||
(with-vector v proc doublevector-length))
|
||||
|
||||
(define (print-doublevector v)
|
||||
(with-doublevector v (lambda (v i) (display (doublevector-ref v i))
|
||||
(display " ")))
|
||||
(newline))
|
||||
|
||||
|
||||
; Call average with a Scheme list...
|
||||
|
||||
(display (average '(1 2 3 4)))
|
||||
(newline)
|
||||
|
||||
; ... or a wrapped std::vector<int>
|
||||
(define v (new-intvector 4))
|
||||
(with-intvector v (lambda (v i) (intvector-set! v i (+ i 1))))
|
||||
(display (average v))
|
||||
(newline)
|
||||
(delete-intvector v)
|
||||
|
||||
; half will return a Scheme vector.
|
||||
; Call it with a Scheme vector...
|
||||
|
||||
(display (half #(1 1.5 2 2.5 3)))
|
||||
(newline)
|
||||
|
||||
; ... or a wrapped std::vector<double>
|
||||
(define v (new-doublevector))
|
||||
(map (lambda (i) (doublevector-push! v i)) '(1 2 3 4))
|
||||
(display (half v))
|
||||
(newline)
|
||||
|
||||
; now halve a wrapped std::vector<double> in place
|
||||
(halve-in-place v)
|
||||
(print-doublevector v)
|
||||
(delete-doublevector v)
|
||||
|
||||
Loading…
Add table
Add a link
Reference in a new issue