FM / d

/usr/share/swig/3.0.12/d/

/usr/share/swig/3.0.12/d

Name	Size	Mode	Actions
boost_shared_ptr.i	8224	0644	edit dl rm
carrays.i	2579	0644	edit dl rm
cpointer.i	3482	0644	edit dl rm
d.swg	1349	0644	edit dl rm
dclassgen.swg	3619	0644	edit dl rm
ddirectives.swg	523	0644	edit dl rm
denums.swg	1937	0644	edit dl rm
dexception.swg	1174	0644	edit dl rm
dhead.swg	8608	0644	edit dl rm
director.swg	1178	0644	edit dl rm
dkw.swg	2421	0644	edit dl rm
dmemberfunctionpointers.swg	2675	0644	edit dl rm
doperators.swg	8120	0644	edit dl rm
dprimitives.swg	4606	0644	edit dl rm
dstrings.swg	2569	0644	edit dl rm
dswigtype.swg	5242	0644	edit dl rm
dvoid.swg	559	0644	edit dl rm
std_common.i	102	0644	edit dl rm
std_deque.i	28	0644	edit dl rm
std_except.i	2046	0644	edit dl rm
std_map.i	1745	0644	edit dl rm
std_pair.i	703	0644	edit dl rm
std_shared_ptr.i	68	0644	edit dl rm
std_string.i	3109	0644	edit dl rm
std_vector.i	16399	0644	edit dl rm
stl.i	357	0644	edit dl rm
typemaps.i	11071	0644	edit dl rm
wrapperloader.swg	7895	0644	edit dl rm

Edit: /usr/share/swig/3.0.12/d/std_map.i (1745B)

%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();
            }
        }
    };
}

/* ----------------------------------------------------------------------------- * std_map.i * * SWIG typemaps for std::map * ----------------------------------------------------------------------------- */ %include // ------------------------------------------------------------------------ // std::map // ------------------------------------------------------------------------ %{ #include #include #include %} // exported class namespace std { template 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 &); unsigned int size() const; bool empty() const; void clear(); %extend { const T& get(const K& key) throw (std::out_of_range) { std::map::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::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::iterator i = self->find(key); return i != self->end(); } } }; }