Gecko [ dataharbor.africa ]

Name	Size	Permission
arrays_java.i	13.37 KB	-rw-r--r--
boost_intrusive_ptr.i	19.68 KB	-rw-r--r--
boost_shared_ptr.i	8.57 KB	-rw-r--r--
director.swg	6.29 KB	-rw-r--r--
enums.swg	4.46 KB	-rw-r--r--
enumsimple.swg	2.51 KB	-rw-r--r--
enumtypesafe.swg	4.57 KB	-rw-r--r--
enumtypeunsafe.swg	2.66 KB	-rw-r--r--
java.swg	45.61 KB	-rw-r--r--
javahead.swg	4.08 KB	-rw-r--r--
javakw.swg	1.24 KB	-rw-r--r--
std_common.i	102 B	-rw-r--r--
std_deque.i	28 B	-rw-r--r--
std_except.i	1.88 KB	-rw-r--r--
std_map.i	2.28 KB	-rw-r--r--
std_pair.i	712 B	-rw-r--r--
std_shared_ptr.i	68 B	-rw-r--r--
std_string.i	3.32 KB	-rw-r--r--
std_vector.i	2.58 KB	-rw-r--r--
std_wstring.i	4.82 KB	-rw-r--r--
stl.i	291 B	-rw-r--r--
typemaps.i	16.64 KB	-rw-r--r--
various.i	4.31 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 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();
            }
        }
    };

// Legacy macros (deprecated)
%define specialize_std_map_on_key(K,CHECK,CONVERT_FROM,CONVERT_TO)
#warning "specialize_std_map_on_key ignored - macro is deprecated and no longer necessary"
%enddef

%define specialize_std_map_on_value(T,CHECK,CONVERT_FROM,CONVERT_TO)
#warning "specialize_std_map_on_value ignored - macro is deprecated and no longer necessary"
%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)
#warning "specialize_std_map_on_both ignored - macro is deprecated and no longer necessary"
%enddef

}

${this.title}

Code Editor : std_map.i