Gecko [ www.jdcpatala.org ]

Name	Size	Permission
_std_deque.i	4.33 KB	-rw-r--r--
std_alloc.i	1.98 KB	-rw-r--r--
std_array.i	2.54 KB	-rw-r--r--
std_basic_string.i	6.35 KB	-rw-r--r--
std_carray.swg	1.39 KB	-rw-r--r--
std_char_traits.i	3.12 KB	-rw-r--r--
std_common.i	5.27 KB	-rw-r--r--
std_container.i	4.2 KB	-rw-r--r--
std_deque.i	3.41 KB	-rw-r--r--
std_except.i	1.16 KB	-rw-r--r--
std_ios.i	5.12 KB	-rw-r--r--
std_iostream.i	8.66 KB	-rw-r--r--
std_list.i	3.79 KB	-rw-r--r--
std_map.i	3.6 KB	-rw-r--r--
std_multimap.i	3.18 KB	-rw-r--r--
std_multiset.i	2.48 KB	-rw-r--r--
std_pair.i	3.65 KB	-rw-r--r--
std_queue.i	3.42 KB	-rw-r--r--
std_set.i	3.29 KB	-rw-r--r--
std_sstream.i	5.2 KB	-rw-r--r--
std_stack.i	3.4 KB	-rw-r--r--
std_streambuf.i	1.71 KB	-rw-r--r--
std_string.i	219 B	-rw-r--r--
std_unordered_map.i	3.98 KB	-rw-r--r--
std_unordered_multimap.i	3.15 KB	-rw-r--r--
std_unordered_multiset.i	2.95 KB	-rw-r--r--
std_unordered_set.i	3.68 KB	-rw-r--r--
std_vector.i	6.04 KB	-rw-r--r--
std_vectora.i	147 B	-rw-r--r--
std_wios.i	90 B	-rw-r--r--
std_wiostream.i	100 B	-rw-r--r--
std_wsstream.i	98 B	-rw-r--r--
std_wstreambuf.i	102 B	-rw-r--r--
std_wstring.i	249 B	-rw-r--r--

Code Editor : _std_deque.i

/* -----------------------------------------------------------------------------
 * _std_deque.i
 *
 * This file contains a generic definition of std::deque along with
 * some helper functions.  Specific language modules should include
 * this file to generate wrappers. 
 * ----------------------------------------------------------------------------- */

%include <std_except.i>

%{
#include <deque>
#include <stdexcept>
%}

/* This macro defines all of the standard methods for a deque.  This
   is defined as a macro to simplify the task of specialization.  For
   example,

template<> class deque<int> {
         public:
             %std_deque_methods(int);
         };
*/

%define %std_deque_methods_noempty(T...)
       typedef size_t size_type;
       typedef ptrdiff_t difference_type;
       typedef T value_type;
       typedef value_type* pointer;
       typedef const value_type* const_pointer;
       typedef value_type& reference;
       typedef const value_type& const_reference;

deque();
       deque(unsigned int size, const T& value=T());
       deque(const deque< T > &);
      ~deque();

void assign(unsigned int n, const T& value);
       void swap(deque< T > &x);
       unsigned int size() const;
       unsigned int max_size() const;
       void resize(unsigned int n, T c = T());
       const_reference front();
       const_reference back();
       void push_front(const T& x);
       void push_back(const T& x);
       void pop_front();
       void pop_back();
       void clear();

/* Some useful extensions */
       %extend {
           const_reference getitem(int i) throw (std::out_of_range) {
                int size = int(self->size());
                if (i<0) i += size;
                if (i>=0 && i<size)
                    return (*self)[i];
                else
                    throw std::out_of_range("deque index out of range");
           }
           void setitem(int i, const T& x) throw (std::out_of_range) {
                int size = int(self->size());
                if (i<0) i+= size;
                if (i>=0 && i<size)
                    (*self)[i] = x;
                else
                    throw std::out_of_range("deque index out of range");
           }
           void delitem(int i) throw (std::out_of_range) {
                int size = int(self->size());
                if (i<0) i+= size;
                if (i>=0 && i<size) {
                    self->erase(self->begin()+i);
                } else {
                    throw std::out_of_range("deque index out of range");
                }
           }
           std::deque< T > getslice(int i, int j) {
                int size = int(self->size());
                if (i<0) i = size+i;
                if (j<0) j = size+j;
                if (i<0) i = 0;
                if (j>size) j = size;
                std::deque< T > tmp(j-i);
                std::copy(self->begin()+i,self->begin()+j,tmp.begin());
                return tmp;
            }
            void setslice(int i, int j, const std::deque< T >& v) {
                int size = int(self->size());
                if (i<0) i = size+i;
                if (j<0) j = size+j;
                if (i<0) i = 0;
                if (j>size) j = size;
                if (int(v.size()) == j-i) {
                    std::copy(v.begin(),v.end(),self->begin()+i);
                } else {
                    self->erase(self->begin()+i,self->begin()+j);
                    if (i+1 <= size)
                        self->insert(self->begin()+i+1,v.begin(),v.end());
                    else
                        self->insert(self->end(),v.begin(),v.end());
                }
            }
            void delslice(int i, int j) {
                int size = int(self->size());
                if (i<0) i = size+i;
                if (j<0) j = size+j;
                if (i<0) i = 0;
                if (j>size) j = size;
                self->erase(self->begin()+i,self->begin()+j);
            }
       };
%enddef

#ifdef SWIGPHP
%define %std_deque_methods(T...)
    %extend {
        bool is_empty() const {
            return self->empty();
        }
    };
    %std_deque_methods_noempty(T)
%enddef
#else
%define %std_deque_methods(T...)
    bool empty() const;
    %std_deque_methods_noempty(T)
%enddef
#endif

namespace std {
    template<class T> class deque {
    public:
       %std_deque_methods(T);
    };
}

${this.title}

Code Editor : _std_deque.i