FM / jsc

/usr/share/swig/3.0.12/javascript/jsc/

/usr/share/swig/3.0.12/javascript/jsc

Name	Size	Mode	Actions
arrays_javascript.i	3353	0644	edit dl rm
ccomplex.i	771	0644	edit dl rm
cdata.i	30	0644	edit dl rm
complex.i	80	0644	edit dl rm
exception.i	34	0644	edit dl rm
javascript.swg	439	0644	edit dl rm
javascriptcode.swg	15812	0644	edit dl rm
javascriptcomplex.swg	3726	0644	edit dl rm
javascriptfragments.swg	559	0644	edit dl rm
javascripthelpers.swg	2377	0644	edit dl rm
javascriptinit.swg	2064	0644	edit dl rm
javascriptkw.swg	1015	0644	edit dl rm
javascriptprimtypes.swg	4308	0644	edit dl rm
javascriptrun.swg	10234	0644	edit dl rm
javascriptruntime.swg	557	0644	edit dl rm
javascriptstrings.swg	5952	0644	edit dl rm
javascripttypemaps.swg	1980	0644	edit dl rm
std_common.i	102	0644	edit dl rm
std_complex.i	474	0644	edit dl rm
std_deque.i	28	0644	edit dl rm
std_except.i	35	0644	edit dl rm
std_map.i	2337	0644	edit dl rm
std_pair.i	712	0644	edit dl rm
std_string.i	35	0644	edit dl rm
std_vector.i	2633	0644	edit dl rm
stl.i	291	0644	edit dl rm
typemaps.i	4414	0644	edit dl rm

Edit: /usr/share/swig/3.0.12/javascript/jsc/std_map.i (2337B)

%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

}

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