FM / lua

/usr/share/swig/3.0.12/lua/

/usr/share/swig/3.0.12/lua

Name	Size	Mode	Actions
carrays.i	256	0644	edit dl rm
factory.i	519	0644	edit dl rm
lua.swg	8922	0644	edit dl rm
luakw.swg	1220	0644	edit dl rm
luarun.swg	66762	0644	edit dl rm
luaruntime.swg	3026	0644	edit dl rm
luatypemaps.swg	14249	0644	edit dl rm
lua_fnptr.i	4228	0644	edit dl rm
std_common.i	102	0644	edit dl rm
std_deque.i	28	0644	edit dl rm
std_except.i	1984	0644	edit dl rm
std_map.i	1754	0644	edit dl rm
std_pair.i	769	0644	edit dl rm
std_string.i	3287	0644	edit dl rm
std_vector.i	3082	0644	edit dl rm
stl.i	291	0644	edit dl rm
typemaps.i	19435	0644	edit dl rm
wchar.i	1094	0644	edit dl rm
_std_common.i	2554	0644	edit dl rm

Edit: /usr/share/swig/3.0.12/lua/std_map.i (1754B)

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