Gecko [ www.jdcpatala.org ]

Name	Size	Permission
cdata.i	2.28 KB	-rw-r--r--
director.swg	1.48 KB	-rw-r--r--
exception.i	173 B	-rw-r--r--
go.swg	15.67 KB	-rw-r--r--
gokw.swg	555 B	-rw-r--r--
goruntime.swg	8.6 KB	-rw-r--r--
gostring.swg	851 B	-rw-r--r--
std_common.i	101 B	-rw-r--r--
std_deque.i	28 B	-rw-r--r--
std_except.i	1.26 KB	-rw-r--r--
std_list.i	928 B	-rw-r--r--
std_map.i	1.98 KB	-rw-r--r--
std_pair.i	773 B	-rw-r--r--
std_string.i	2.21 KB	-rw-r--r--
std_vector.i	2.83 KB	-rw-r--r--
stl.i	291 B	-rw-r--r--
typemaps.i	9.72 KB	-rw-r--r--

Code Editor : std_map.i

/* -----------------------------------------------------------------------------
 * 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 C = std::less<K> > class map {
        // add typemaps here
      public:
        typedef size_t size_type;
        typedef ptrdiff_t difference_type;
        typedef K key_type;
        typedef T mapped_type;
        typedef std::pair< const K, T > value_type;
        typedef value_type* pointer;
        typedef const value_type* const_pointer;
        typedef value_type& reference;
        typedef const value_type& const_reference;

map();
        map(const map& other);
        
        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, C >::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, C >::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, C >::iterator i = self->find(key);
                return i != self->end();
            }
        }
    };
}

${this.title}

Code Editor : std_map.i