Gecko [ 122.154.134.11 ]

Name	Size	Permission
Makefile.pl	691 B	-rw-r--r--
attribute.i	34 B	-rw-r--r--
carrays.i	33 B	-rw-r--r--
cdata.i	30 B	-rw-r--r--
cmalloc.i	32 B	-rw-r--r--
cni.i	150 B	-rw-r--r--
cpointer.i	33 B	-rw-r--r--
cstring.i	32 B	-rw-r--r--
exception.i	138 B	-rw-r--r--
factory.i	32 B	-rw-r--r--
jstring.i	1.02 KB	-rw-r--r--
noembed.h	1.38 KB	-rw-r--r--
perl5.swg	1.44 KB	-rw-r--r--
perlerrors.swg	1.01 KB	-rw-r--r--
perlfragments.swg	556 B	-rw-r--r--
perlhead.swg	2.55 KB	-rw-r--r--
perlinit.swg	1.77 KB	-rw-r--r--
perlkw.swg	3.78 KB	-rw-r--r--
perlmacros.swg	36 B	-rw-r--r--
perlmain.i	2.1 KB	-rw-r--r--
perlopers.swg	1.83 KB	-rw-r--r--
perlprimtypes.swg	6.99 KB	-rw-r--r--
perlrun.swg	14 KB	-rw-r--r--
perlruntime.swg	326 B	-rw-r--r--
perlstrings.swg	1.39 KB	-rw-r--r--
perltypemaps.swg	2.66 KB	-rw-r--r--
perluserdir.swg	36 B	-rw-r--r--
reference.i	7.22 KB	-rw-r--r--
std_common.i	779 B	-rw-r--r--
std_deque.i	28 B	-rw-r--r--
std_except.i	35 B	-rw-r--r--
std_list.i	13.98 KB	-rw-r--r--
std_map.i	5.29 KB	-rw-r--r--
std_pair.i	865 B	-rw-r--r--
std_string.i	62 B	-rw-r--r--
std_vector.i	22.12 KB	-rw-r--r--
stl.i	518 B	-rw-r--r--
typemaps.i	12.64 KB	-rw-r--r--

Code Editor : std_map.i

/* -----------------------------------------------------------------------------
 * 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:
        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, 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

}

${this.title}

Code Editor : std_map.i