Add initial implementation of std::map

Author: sethrj

Examples/test-suite/fortran/Makefile.in

@@ -52,7 +52,6 @@ FAILING_CPP_TESTS += \
 	smart_pointer_member \
 	smart_pointer_template_defaults_overload \
 	typedef_classforward_same_name \
-	li_std_map \
 	cpp11_result_of \
 	cpp11_rvalue_reference2 \
 	cpp11_rvalue_reference3 \

Examples/test-suite/fortran/li_std_map_runme.F90

@@ -0,0 +1,73 @@
+! File : li_std_map_runme.f90
+
+#include "fassert.h"
+
+program li_std_map_runme
+  use ISO_C_BINDING
+  implicit none
+
+  call test_map_int_int
+  call test_map_string_int
+contains
+
+subroutine test_map_int_int
+  use ISO_C_BINDING
+  ! Note that the test instantiates *multiset* as a set_int
+  use li_std_map, only : MapIntInt => IntIntMap
+  implicit none
+  type(MapIntInt) :: m
+  integer :: num_erased
+  logical :: inserted = .false.
+
+  m = MapIntInt()
+  ASSERT(m%empty())
+
+  call m%insert(10, 4)
+  call m%insert(3, 5, inserted)
+  ASSERT(inserted .eqv. .true.)
+  ASSERT(m%size() == 2)
+  ASSERT(m%count(3) == 1)
+  ASSERT(m%count(5) == 0)
+
+  ! Insertion of existing element will *not* replace value
+  call m%insert(3, 6, inserted)
+  ASSERT(inserted .eqv. .false.)
+  ASSERT(m%count(3) == 1)
+  ASSERT(m%size() == 2)
+  ASSERT(m%get(3) == 5)
+
+  ! Use "set" method to unconditionally assign
+  call m%set(3, 6)
+  ASSERT(m%get(3) == 6)
+
+  call m%erase(10)
+  ASSERT(m%size() == 1)
+  ASSERT(m%count(10) == 0)
+
+  call m%erase(3, num_erased)
+  ASSERT(num_erased == 1)
+  ASSERT(m%count(3) == 0)
+
+  call m%release()
+end subroutine
+
+subroutine test_map_string_int
+  use ISO_C_BINDING
+  use li_std_map, only : MapStringInt => StringIntMap
+  implicit none
+  type(MapStringInt) :: m
+
+  m = MapStringInt()
+  ASSERT(m%empty())
+
+  call m%insert("yoohoo", 10)
+  call m%insert("howdy", 5)
+  ASSERT(m%size() == 2)
+  ASSERT(m%count("yoohoo") == 1)
+  ASSERT(m%count("hiya") == 0)
+  ASSERT(m%get("yoohoo") == 10)
+  call m%release()
+end subroutine
+
+end program
+

Lib/fortran/std_map.i

@@ -2,8 +2,60 @@
  * std_map.i
  * ------------------------------------------------------------------------- */
 
+%include "std_common.i"
+
 %{
 #include <map>
 %}
-#error "std::map support is not yet implemented"
 
+%define %swig_std_map(_Key, _Value, _Compare)
+
+public:
+  typedef size_t size_type;
+  typedef ptrdiff_t difference_type;
+  typedef _Key key_type;
+  typedef _Value mapped_type;
+  typedef std::pair<const _Key, _Value> value_type;
+  typedef value_type *pointer;
+  typedef const value_type *const_pointer;
+  typedef value_type &reference;
+  typedef const value_type &const_reference;
+
+  map();
+
+  // - Use native Fortran integers in proxy code
+  %apply int FORTRAN_INT {size_type};
+
+  bool empty() const;
+  size_type size() const;
+  void clear();
+
+  %fortransubroutine erase;
+
+  size_type erase(const key_type &x);
+  size_type count(const key_type &x) const;
+
+  %fortransubroutine insert;
+
+  %extend {
+    bool insert(const _Key& k, const _Value& v) {
+      std::pair<std::map<_Key, _Value, _Compare >::iterator, bool> result = $self->insert(std::pair<_Key, _Value>(k, v));
+      return result.second;
+    }
+
+    const _Value& get(const _Key& k) {
+      return (*$self)[k];
+    }
+    void set(const _Key& k, const _Value& v) {
+      (*$self)[k] = v;
+    }
+  }
+
+%enddef
+
+namespace std {
+template<class _Key, class _Value, class _Compare = std::less<_Key > >
+class map {
+  %swig_std_map(_Key, _Value, _Compare);
+};
+} // namespace std