Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Workaround for broken swig, which allows old swig versions to work too. These files should be removed when fixed swig is released. Thanks to Juvenal for suggestion.
- Loading branch information
1 parent
6b550f2
commit cc52a7d
Showing
10 changed files
with
3,190 additions
and
16 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,135 @@ | ||
| /* ----------------------------------------------------------------------------- | ||
| * _std_deque.i | ||
| * | ||
| * This file contains a generic definition of std::deque along with | ||
| * some helper functions. Specific language modules should include | ||
| * this file to generate wrappers. | ||
| * ----------------------------------------------------------------------------- */ | ||
|
|
||
| %include <std_except.i> | ||
|
|
||
| %{ | ||
| #include <deque> | ||
| #include <stdexcept> | ||
| %} | ||
|
|
||
|
|
||
| /* This macro defines all of the standard methods for a deque. This | ||
| is defined as a macro to simplify the task of specialization. For | ||
| example, | ||
| template<> class deque<int> { | ||
| public: | ||
| %std_deque_methods(int); | ||
| }; | ||
| */ | ||
|
|
||
| %define %std_deque_methods_noempty(T) | ||
| typedef T &reference; | ||
| typedef const T& const_reference; | ||
| typedef size_t size_type; | ||
|
|
||
| deque(); | ||
| deque(unsigned int size, const T& value=T()); | ||
| deque(const deque<T> &); | ||
| ~deque(); | ||
|
|
||
| void assign(unsigned int n, const T& value); | ||
| void swap(deque<T> &x); | ||
| unsigned int size() const; | ||
| unsigned int max_size() const; | ||
| void resize(unsigned int n, T c = T()); | ||
| const_reference front(); | ||
| const_reference back(); | ||
| void push_front(const T& x); | ||
| void push_back(const T& x); | ||
| void pop_front(); | ||
| void pop_back(); | ||
| void clear(); | ||
|
|
||
| /* Some useful extensions */ | ||
| %extend { | ||
| const_reference getitem(int i) throw (std::out_of_range) { | ||
| int size = int(self->size()); | ||
| if (i<0) i += size; | ||
| if (i>=0 && i<size) | ||
| return (*self)[i]; | ||
| else | ||
| throw std::out_of_range("deque index out of range"); | ||
| } | ||
| void setitem(int i, const T& x) throw (std::out_of_range) { | ||
| int size = int(self->size()); | ||
| if (i<0) i+= size; | ||
| if (i>=0 && i<size) | ||
| (*self)[i] = x; | ||
| else | ||
| throw std::out_of_range("deque index out of range"); | ||
| } | ||
| void delitem(int i) throw (std::out_of_range) { | ||
| int size = int(self->size()); | ||
| if (i<0) i+= size; | ||
| if (i>=0 && i<size) { | ||
| self->erase(self->begin()+i); | ||
| } else { | ||
| throw std::out_of_range("deque index out of range"); | ||
| } | ||
| } | ||
| std::deque<T> getslice(int i, int j) { | ||
| int size = int(self->size()); | ||
| if (i<0) i = size+i; | ||
| if (j<0) j = size+j; | ||
| if (i<0) i = 0; | ||
| if (j>size) j = size; | ||
| std::deque<T > tmp(j-i); | ||
| std::copy(self->begin()+i,self->begin()+j,tmp.begin()); | ||
| return tmp; | ||
| } | ||
| void setslice(int i, int j, const std::deque<T>& v) { | ||
| int size = int(self->size()); | ||
| if (i<0) i = size+i; | ||
| if (j<0) j = size+j; | ||
| if (i<0) i = 0; | ||
| if (j>size) j = size; | ||
| if (int(v.size()) == j-i) { | ||
| std::copy(v.begin(),v.end(),self->begin()+i); | ||
| } else { | ||
| self->erase(self->begin()+i,self->begin()+j); | ||
| if (i+1 <= size) | ||
| self->insert(self->begin()+i+1,v.begin(),v.end()); | ||
| else | ||
| self->insert(self->end(),v.begin(),v.end()); | ||
| } | ||
| } | ||
| void delslice(int i, int j) { | ||
| int size = int(self->size()); | ||
| if (i<0) i = size+i; | ||
| if (j<0) j = size+j; | ||
| if (i<0) i = 0; | ||
| if (j>size) j = size; | ||
| self->erase(self->begin()+i,self->begin()+j); | ||
| } | ||
| }; | ||
| %enddef | ||
|
|
||
| #ifdef SWIGPHP | ||
| %define %std_deque_methods(T) | ||
| %extend { | ||
| bool is_empty() const { | ||
| return self->empty(); | ||
| } | ||
| }; | ||
| %std_deque_methods_noempty(T) | ||
| %enddef | ||
| #else | ||
| %define %std_deque_methods(T) | ||
| bool empty() const; | ||
| %std_deque_methods_noempty(T) | ||
| %enddef | ||
| #endif | ||
|
|
||
| namespace std { | ||
| template<class T> class deque { | ||
| public: | ||
| %std_deque_methods(T); | ||
| }; | ||
| } |
Oops, something went wrong.