1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
|
/*=========================================================================
Program: GDCM (Grassroots DICOM). A DICOM library
Copyright (c) 2006-2011 Mathieu Malaterre
All rights reserved.
See Copyright.txt or http://gdcm.sourceforge.net/Copyright.html for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notice for more information.
=========================================================================*/
/* -----------------------------------------------------------------------------
* std_set.i
*
* SWIG typemaps for std::set
* ----------------------------------------------------------------------------- */
%include <std_common.i>
// ------------------------------------------------------------------------
// std::set
// ------------------------------------------------------------------------
%{
#include <set>
#include <algorithm>
#include <stdexcept>
%}
// exported class
namespace std {
template<class V> class set {
// add typemaps here
public:
typedef size_t size_type;
typedef ptrdiff_t difference_type;
typedef V value_type;
set();
set(const set<V> &);
unsigned int size() const;
bool empty() const;
void clear();
%extend {
const V& get(const V& key) throw (std::out_of_range) {
std::set<V>::iterator i = self->find(key);
if (i != self->end())
return *i;
else
throw std::out_of_range("key not found");
}
void insert(const V& key) { // Do NOT call this function 'set' !
self->insert(key);
}
void del(const V& key) throw (std::out_of_range) {
std::set<V>::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 V& key) {
std::set<V>::iterator i = self->find(key);
return i != self->end();
}
}
};
}
|
