You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
180 lines
5.4 KiB
180 lines
5.4 KiB
![]()
4 years ago
|
/* -----------------------------------------------------------------------------
|
||
|
* See the LICENSE file for information on copyright, usage and redistribution
|
||
|
* of SWIG, and the README file for authors - http://www.swig.org/release.html.
|
||
|
*
|
||
|
* std_map.i
|
||
|
*
|
||
|
* SWIG typemaps for std::map
|
||
|
* ----------------------------------------------------------------------------- */
|
||
|
|
||
|
%include <std_common.i>
|
||
|
|
||
|
// ------------------------------------------------------------------------
|
||
|
// std::map
|
||
|
// ------------------------------------------------------------------------
|
||
|
|
||
|
%{
|
||
|
#include <map>
|
||
|
#include <algorithm>
|
||
|
#include <stdexcept>
|
||
|
%}
|
||
|
|
||
|
// exported class
|
||
|
|
||
|
namespace std {
|
||
|
|
||
|
template<class K, class T> class map {
|
||
|
// add typemaps here
|
||
|
public:
|
||
|
typedef size_t size_type;
|
||
|
typedef ptrdiff_t difference_type;
|
||
|
typedef K key_type;
|
||
|
typedef T mapped_type;
|
||
|
map();
|
||
|
map(const map<K,T> &);
|
||
|
|
||
|
unsigned int size() const;
|
||
|
bool empty() const;
|
||
|
void clear();
|
||
|
%extend {
|
||
|
const T& get(const K& key) throw (std::out_of_range) {
|
||
|
std::map<K,T >::iterator i = self->find(key);
|
||
|
if (i != self->end())
|
||
|
return i->second;
|
||
|
else
|
||
|
throw std::out_of_range("key not found");
|
||
|
}
|
||
|
void set(const K& key, const T& x) {
|
||
|
(*self)[key] = x;
|
||
|
}
|
||
|
void del(const K& key) throw (std::out_of_range) {
|
||
|
std::map<K,T >::iterator i = self->find(key);
|
||
|
if (i != self->end())
|
||
|
self->erase(i);
|
||
|
else
|
||
|
throw std::out_of_range("key not found");
|
||
|
}
|
||
|
bool has_key(const K& key) {
|
||
|
std::map<K,T >::iterator i = self->find(key);
|
||
|
return i != self->end();
|
||
|
}
|
||
|
}
|
||
|
};
|
||
|
|
||
|
|
||
|
// specializations for built-ins
|
||
|
|
||
|
%define specialize_std_map_on_key(K,CHECK,CONVERT_FROM,CONVERT_TO)
|
||
|
|
||
|
template<class T> class map<K,T> {
|
||
|
// add typemaps here
|
||
|
public:
|
||
|
map();
|
||
|
map(const map<K,T> &);
|
||
|
|
||
|
unsigned int size() const;
|
||
|
bool empty() const;
|
||
|
void clear();
|
||
|
%extend {
|
||
|
T& get(K key) throw (std::out_of_range) {
|
||
|
std::map<K,T >::iterator i = self->find(key);
|
||
|
if (i != self->end())
|
||
|
return i->second;
|
||
|
else
|
||
|
throw std::out_of_range("key not found");
|
||
|
}
|
||
|
void set(K key, const T& x) {
|
||
|
(*self)[key] = x;
|
||
|
}
|
||
|
void del(K key) throw (std::out_of_range) {
|
||
|
std::map<K,T >::iterator i = self->find(key);
|
||
|
if (i != self->end())
|
||
|
self->erase(i);
|
||
|
else
|
||
|
throw std::out_of_range("key not found");
|
||
|
}
|
||
|
bool has_key(K key) {
|
||
|
std::map<K,T >::iterator i = self->find(key);
|
||
|
return i != self->end();
|
||
|
}
|
||
|
}
|
||
|
};
|
||
|
%enddef
|
||
|
|
||
|
%define specialize_std_map_on_value(T,CHECK,CONVERT_FROM,CONVERT_TO)
|
||
|
template<class K> class map<K,T> {
|
||
|
// add typemaps here
|
||
|
public:
|
||
|
map();
|
||
|
map(const map<K,T> &);
|
||
|
|
||
|
unsigned int size() const;
|
||
|
bool empty() const;
|
||
|
void clear();
|
||
|
%extend {
|
||
|
T get(const K& key) throw (std::out_of_range) {
|
||
|
std::map<K,T >::iterator i = self->find(key);
|
||
|
if (i != self->end())
|
||
|
return i->second;
|
||
|
else
|
||
|
throw std::out_of_range("key not found");
|
||
|
}
|
||
|
void set(const K& key, T x) {
|
||
|
(*self)[key] = x;
|
||
|
}
|
||
|
void del(const K& key) throw (std::out_of_range) {
|
||
|
std::map<K,T >::iterator i = self->find(key);
|
||
|
if (i != self->end())
|
||
|
self->erase(i);
|
||
|
else
|
||
|
throw std::out_of_range("key not found");
|
||
|
}
|
||
|
bool has_key(const K& key) {
|
||
|
std::map<K,T >::iterator i = self->find(key);
|
||
|
return i != self->end();
|
||
|
}
|
||
|
}
|
||
|
};
|
||
|
%enddef
|
||
|
|
||
|
%define specialize_std_map_on_both(K,CHECK_K,CONVERT_K_FROM,CONVERT_K_TO,
|
||
|
T,CHECK_T,CONVERT_T_FROM,CONVERT_T_TO)
|
||
|
template<> class map<K,T> {
|
||
|
// add typemaps here
|
||
|
public:
|
||
|
map();
|
||
|
map(const map<K,T> &);
|
||
|
|
||
|
unsigned int size() const;
|
||
|
bool empty() const;
|
||
|
void clear();
|
||
|
%extend {
|
||
|
T get(K key) throw (std::out_of_range) {
|
||
|
std::map<K,T >::iterator i = self->find(key);
|
||
|
if (i != self->end())
|
||
|
return i->second;
|
||
|
else
|
||
|
throw std::out_of_range("key not found");
|
||
|
}
|
||
|
void set(K key, T x) {
|
||
|
(*self)[key] = x;
|
||
|
}
|
||
|
void del(K key) throw (std::out_of_range) {
|
||
|
std::map<K,T >::iterator i = self->find(key);
|
||
|
if (i != self->end())
|
||
|
self->erase(i);
|
||
|
else
|
||
|
throw std::out_of_range("key not found");
|
||
|
}
|
||
|
bool has_key(K key) {
|
||
|
std::map<K,T >::iterator i = self->find(key);
|
||
|
return i != self->end();
|
||
|
}
|
||
|
}
|
||
|
};
|
||
|
%enddef
|
||
|
|
||
|
// add specializations here
|
||
|
|
||
|
}
|