add wstring/wchar_t support
git-svn-id: https://swig.svn.sourceforge.net/svnroot/swig/trunk/SWIG@5829 626c5289-ae23-0410-ae9c-e8d60b6d4f22
This commit is contained in:
Marcelo Matus
parent
39e2071d68
commit
459e527647
6 changed files with 720 additions and 262 deletions
|
|
@ -12,264 +12,15 @@
|
|||
// However, I think I'll wait until someone asks for it...
|
||||
// ------------------------------------------------------------------------
|
||||
|
||||
// Use the following macro with modern STL implementations
|
||||
//#define SWIG_STD_STRING_MODERN
|
||||
%include pystrings.swg
|
||||
%include std_basic_string.i
|
||||
|
||||
/* plain strings */
|
||||
|
||||
%include exception.i
|
||||
%include std_container.i
|
||||
|
||||
%{
|
||||
#include <string>
|
||||
%}
|
||||
|
||||
namespace std {
|
||||
template <class _CharT>
|
||||
class basic_string
|
||||
{
|
||||
#ifndef SWIG_STD_STRING_MODERN
|
||||
%ignore push_back;
|
||||
%ignore clear;
|
||||
%ignore compare;
|
||||
%ignore append;
|
||||
#endif
|
||||
|
||||
public:
|
||||
typedef size_t size_type;
|
||||
typedef ptrdiff_t difference_type;
|
||||
typedef _CharT value_type;
|
||||
typedef value_type reference;
|
||||
typedef value_type const_reference;
|
||||
|
||||
static const size_type npos;
|
||||
|
||||
basic_string(const _CharT* __s, size_type __n);
|
||||
|
||||
// Capacity:
|
||||
|
||||
size_type length() const;
|
||||
|
||||
size_type max_size() const;
|
||||
|
||||
size_type capacity() const;
|
||||
|
||||
void reserve(size_type __res_arg = 0);
|
||||
|
||||
|
||||
// Modifiers:
|
||||
|
||||
basic_string&
|
||||
append(const basic_string& __str);
|
||||
|
||||
basic_string&
|
||||
append(const basic_string& __str, size_type __pos, size_type __n);
|
||||
|
||||
basic_string&
|
||||
append(const _CharT* __s, size_type __n);
|
||||
|
||||
basic_string&
|
||||
append(size_type __n, _CharT __c);
|
||||
|
||||
basic_string&
|
||||
assign(const basic_string& __str);
|
||||
|
||||
basic_string&
|
||||
assign(const basic_string& __str, size_type __pos, size_type __n);
|
||||
|
||||
basic_string&
|
||||
assign(const _CharT* __s, size_type __n);
|
||||
|
||||
basic_string&
|
||||
insert(size_type __pos1, const basic_string& __str);
|
||||
|
||||
basic_string&
|
||||
insert(size_type __pos1, const basic_string& __str,
|
||||
size_type __pos2, size_type __n);
|
||||
|
||||
basic_string&
|
||||
insert(size_type __pos, const _CharT* __s, size_type __n);
|
||||
|
||||
basic_string&
|
||||
insert(size_type __pos, size_type __n, _CharT __c);
|
||||
|
||||
basic_string&
|
||||
erase(size_type __pos = 0, size_type __n = npos);
|
||||
|
||||
basic_string&
|
||||
replace(size_type __pos, size_type __n, const basic_string& __str);
|
||||
|
||||
basic_string&
|
||||
replace(size_type __pos1, size_type __n1, const basic_string& __str,
|
||||
size_type __pos2, size_type __n2);
|
||||
|
||||
basic_string&
|
||||
replace(size_type __pos, size_type __n1, const _CharT* __s,
|
||||
size_type __n2);
|
||||
|
||||
basic_string&
|
||||
replace(size_type __pos, size_type __n1, size_type __n2, _CharT __c);
|
||||
|
||||
|
||||
size_type
|
||||
copy(_CharT* __s, size_type __n, size_type __pos = 0) const;
|
||||
|
||||
// String operations:
|
||||
const _CharT* c_str() const;
|
||||
|
||||
size_type
|
||||
find(const _CharT* __s, size_type __pos, size_type __n) const;
|
||||
|
||||
size_type
|
||||
find(const basic_string& __str, size_type __pos = 0) const;
|
||||
|
||||
size_type
|
||||
find(_CharT __c, size_type __pos = 0) const;
|
||||
|
||||
size_type
|
||||
rfind(const basic_string& __str, size_type __pos = npos) const;
|
||||
|
||||
size_type
|
||||
rfind(const _CharT* __s, size_type __pos, size_type __n) const;
|
||||
|
||||
size_type
|
||||
rfind(_CharT __c, size_type __pos = npos) const;
|
||||
|
||||
size_type
|
||||
find_first_of(const basic_string& __str, size_type __pos = 0) const;
|
||||
|
||||
size_type
|
||||
find_first_of(const _CharT* __s, size_type __pos, size_type __n) const;
|
||||
|
||||
size_type
|
||||
find_first_of(_CharT __c, size_type __pos = 0) const;
|
||||
|
||||
size_type
|
||||
find_last_of(const basic_string& __str, size_type __pos = npos) const;
|
||||
|
||||
size_type
|
||||
find_last_of(const _CharT* __s, size_type __pos, size_type __n) const;
|
||||
|
||||
size_type
|
||||
find_last_of(_CharT __c, size_type __pos = npos) const;
|
||||
|
||||
size_type
|
||||
find_first_not_of(const basic_string& __str, size_type __pos = 0) const;
|
||||
|
||||
size_type
|
||||
find_first_not_of(const _CharT* __s, size_type __pos,
|
||||
size_type __n) const;
|
||||
|
||||
size_type
|
||||
find_first_not_of(_CharT __c, size_type __pos = 0) const;
|
||||
|
||||
size_type
|
||||
find_last_not_of(const basic_string& __str, size_type __pos = npos) const;
|
||||
|
||||
size_type
|
||||
find_last_not_of(const _CharT* __s, size_type __pos,
|
||||
size_type __n) const;
|
||||
|
||||
size_type
|
||||
find_last_not_of(_CharT __c, size_type __pos = npos) const;
|
||||
|
||||
basic_string
|
||||
substr(size_type __pos = 0, size_type __n = npos) const;
|
||||
|
||||
int
|
||||
compare(const basic_string& __str) const;
|
||||
|
||||
int
|
||||
compare(size_type __pos, size_type __n, const basic_string& __str) const;
|
||||
|
||||
int
|
||||
compare(size_type __pos1, size_type __n1, const basic_string& __str,
|
||||
size_type __pos2, size_type __n2) const;
|
||||
|
||||
|
||||
%ignore pop_back();
|
||||
%ignore front() const;
|
||||
%ignore back() const;
|
||||
%ignore basic_string(size_type n);
|
||||
%std_sequence_methods_val(basic_string);
|
||||
|
||||
|
||||
%ignore pop();
|
||||
%pysequence_methods_val(std::basic_string<_CharT>);
|
||||
|
||||
#ifdef SWIG_EXPORT_ITERATOR_METHODS
|
||||
iterator
|
||||
insert(iterator __p, _CharT __c = _CharT());
|
||||
|
||||
iterator
|
||||
erase(iterator __position);
|
||||
|
||||
iterator
|
||||
erase(iterator __first, iterator __last);
|
||||
|
||||
void
|
||||
insert(iterator __p, size_type __n, _CharT __c);
|
||||
|
||||
basic_string&
|
||||
replace(iterator __i1, iterator __i2, const basic_string& __str);
|
||||
|
||||
basic_string&
|
||||
replace(iterator __i1, iterator __i2,
|
||||
const _CharT* __s, size_type __n);
|
||||
|
||||
basic_string&
|
||||
replace(iterator __i1, iterator __i2, const _CharT* __s);
|
||||
|
||||
basic_string&
|
||||
replace(iterator __i1, iterator __i2, size_type __n, _CharT __c);
|
||||
|
||||
basic_string&
|
||||
replace(iterator __i1, iterator __i2, _CharT* __k1, _CharT* __k2);
|
||||
|
||||
basic_string&
|
||||
replace(iterator __i1, iterator __i2, const _CharT* __k1, const _CharT* __k2);
|
||||
|
||||
basic_string&
|
||||
replace(iterator __i1, iterator __i2, iterator __k1, iterator __k2);
|
||||
|
||||
basic_string&
|
||||
replace(iterator __i1, iterator __i2, const_iterator __k1, const_iterator __k2);
|
||||
#endif
|
||||
};
|
||||
|
||||
%newobject basic_string<char>::__iadd__;
|
||||
%newobject basic_string<char>::__add__;
|
||||
%newobject basic_string<char>::__radd__;
|
||||
%extend basic_string<char> {
|
||||
/*
|
||||
swig workaround. if used as expected, __iadd__ deletes 'self'.
|
||||
*/
|
||||
std::string* __iadd__(const std::string& v) {
|
||||
*self += v;
|
||||
return new std::string(*self);
|
||||
}
|
||||
|
||||
std::string* __add__(const std::string& v) {
|
||||
std::string* res = new std::string(*self);
|
||||
*res += v;
|
||||
return res;
|
||||
}
|
||||
|
||||
std::string* __radd__(const std::string& v) {
|
||||
std::string* res = new std::string(v);
|
||||
*res += *self;
|
||||
return res;
|
||||
}
|
||||
|
||||
const std::string& __str__() {
|
||||
return *self;
|
||||
}
|
||||
}
|
||||
|
||||
%std_equal_methods(basic_string<char>);
|
||||
%std_order_methods(basic_string<char>);
|
||||
|
||||
namespace std
|
||||
{
|
||||
%std_comp_methods(basic_string<char>);
|
||||
typedef basic_string<char> string;
|
||||
|
||||
}
|
||||
|
||||
/* defining the std::string asptr/from methods */
|
||||
|
|
@ -346,4 +97,3 @@ SWIGSTATICINLINE(int)
|
|||
|
||||
%typemap_asptrfromn(SWIG_CCode(STRING), std::basic_string<char>);
|
||||
%typemap_asptrfromn(SWIG_CCode(STRING), std::string);
|
||||
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue