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_array.i

//
// std::array
//

%include <std_container.i>

%define %std_array_methods(array...)
  %std_sequence_methods_non_resizable(array)
  void fill(const value_type& u);
%enddef

%define %std_array_methods_val(array...)
  %std_sequence_methods_non_resizable_val(array)
  void fill(const value_type& u);
%enddef

// ------------------------------------------------------------------------
// std::array
// 
// The aim of all that follows would be to integrate std::array with 
// as much as possible, namely, to allow the user to pass and 
// be returned tuples or lists.
// const declarations are used to guess the intent of the function being
// exported; therefore, the following rationale is applied:
// 
//   -- f(std::array<T, N>), f(const std::array<T, N>&):
//      the parameter being read-only, either a sequence or a
//      previously wrapped std::array<T, N> can be passed.
//   -- f(std::array<T, N>&), f(std::array<T, N>*):
//      the parameter may be modified; therefore, only a wrapped std::array
//      can be passed.
//   -- std::array<T, N> f(), const std::array<T, N>& f():
//      the array is returned by copy; therefore, a sequence of T:s 
//      is returned which is most easily used in other functions
//   -- std::array<T, N>& f(), std::array<T, N>* f():
//      the array is returned by reference; therefore, a wrapped std::array
//      is returned
//   -- const std::array<T, N>* f(), f(const std::array<T, N>*):
//      for consistency, they expect and return a plain array pointer.
// ------------------------------------------------------------------------

// exported classes

namespace std {

template<class _Tp, size_t _Nm >
  class array {
  public:
    typedef size_t size_type;
    typedef ptrdiff_t difference_type;
    typedef _Tp value_type;
    typedef value_type* pointer;
    typedef const value_type* const_pointer;
    typedef value_type& reference;
    typedef const value_type& const_reference;

%traits_swigtype(_Tp);
    %traits_enum(_Tp);

%fragment(SWIG_Traits_frag(std::array< _Tp, _Nm >), "header",
	      fragment=SWIG_Traits_frag(_Tp),
	      fragment="StdArrayTraits") {
      namespace swig {
	template <>  struct traits<std::array< _Tp, _Nm > > {
	  typedef pointer_category category;
	  static const char* type_name() {
	    return "std::array<" #_Tp "," #_Nm " >";
	  }
	};
      }
    }

%typemap_traits_ptr(SWIG_TYPECHECK_STDARRAY, std::array< _Tp, _Nm >);

#ifdef %swig_array_methods
    // Add swig/language extra methods
    %swig_array_methods(std::array< _Tp, _Nm >);
#endif

%std_array_methods(array);
  };
}

${this.title}

Code Editor : std_array.i