2f31c3e94e
- std::unordered_map compilation fix when just using std_unordered_map.i standalone - std::unordered_multimap compilation fix when just using std_unordered_multimap.i standalone - Add in the standalone unordered STL test cases Closes #1319
100 lines
3.6 KiB
OpenEdge ABL
100 lines
3.6 KiB
OpenEdge ABL
/*
|
|
Unordered Multimaps
|
|
*/
|
|
%include <std_unordered_map.i>
|
|
|
|
%fragment("StdUnorderedMultimapTraits","header",fragment="StdMapCommonTraits",fragment="StdUnorderedMapForwardIteratorTraits")
|
|
{
|
|
namespace swig {
|
|
template <class SwigPySeq, class K, class T >
|
|
inline void
|
|
assign(const SwigPySeq& swigpyseq, std::unordered_multimap<K,T > *unordered_multimap) {
|
|
typedef typename std::unordered_multimap<K,T>::value_type value_type;
|
|
typename SwigPySeq::const_iterator it = swigpyseq.begin();
|
|
for (;it != swigpyseq.end(); ++it) {
|
|
unordered_multimap->insert(value_type(it->first, it->second));
|
|
}
|
|
}
|
|
|
|
template <class K, class T>
|
|
struct traits_reserve<std::unordered_multimap<K,T> > {
|
|
static void reserve(std::unordered_multimap<K,T> &seq, typename std::unordered_multimap<K,T>::size_type n) {
|
|
seq.reserve(n);
|
|
}
|
|
};
|
|
|
|
template <class K, class T>
|
|
struct traits_asptr<std::unordered_multimap<K,T> > {
|
|
typedef std::unordered_multimap<K,T> unordered_multimap_type;
|
|
static int asptr(PyObject *obj, std::unordered_multimap<K,T> **val) {
|
|
int res = SWIG_ERROR;
|
|
if (PyDict_Check(obj)) {
|
|
SwigVar_PyObject items = PyObject_CallMethod(obj,(char *)"items",NULL);
|
|
%#if PY_VERSION_HEX >= 0x03000000
|
|
/* In Python 3.x the ".items()" method returns a dict_items object */
|
|
items = PySequence_Fast(items, ".items() didn't return a sequence!");
|
|
%#endif
|
|
res = traits_asptr_stdseq<std::unordered_multimap<K,T>, std::pair<K, T> >::asptr(items, val);
|
|
} else {
|
|
unordered_multimap_type *p;
|
|
swig_type_info *descriptor = swig::type_info<unordered_multimap_type>();
|
|
res = descriptor ? SWIG_ConvertPtr(obj, (void **)&p, descriptor, 0) : SWIG_ERROR;
|
|
if (SWIG_IsOK(res) && val) *val = p;
|
|
}
|
|
return res;
|
|
}
|
|
};
|
|
|
|
template <class K, class T >
|
|
struct traits_from<std::unordered_multimap<K,T> > {
|
|
typedef std::unordered_multimap<K,T> unordered_multimap_type;
|
|
typedef typename unordered_multimap_type::const_iterator const_iterator;
|
|
typedef typename unordered_multimap_type::size_type size_type;
|
|
|
|
static PyObject *from(const unordered_multimap_type& unordered_multimap) {
|
|
swig_type_info *desc = swig::type_info<unordered_multimap_type>();
|
|
if (desc && desc->clientdata) {
|
|
return SWIG_InternalNewPointerObj(new unordered_multimap_type(unordered_multimap), desc, SWIG_POINTER_OWN);
|
|
} else {
|
|
size_type size = unordered_multimap.size();
|
|
Py_ssize_t pysize = (size <= (size_type) INT_MAX) ? (Py_ssize_t) size : -1;
|
|
if (pysize < 0) {
|
|
SWIG_PYTHON_THREAD_BEGIN_BLOCK;
|
|
PyErr_SetString(PyExc_OverflowError, "unordered_multimap size not valid in python");
|
|
SWIG_PYTHON_THREAD_END_BLOCK;
|
|
return NULL;
|
|
}
|
|
PyObject *obj = PyDict_New();
|
|
for (const_iterator i= unordered_multimap.begin(); i!= unordered_multimap.end(); ++i) {
|
|
swig::SwigVar_PyObject key = swig::from(i->first);
|
|
swig::SwigVar_PyObject val = swig::from(i->second);
|
|
PyDict_SetItem(obj, key, val);
|
|
}
|
|
return obj;
|
|
}
|
|
}
|
|
};
|
|
}
|
|
}
|
|
|
|
%define %swig_unordered_multimap_methods(Type...)
|
|
%swig_unordered_map_common(Type);
|
|
|
|
#if defined(SWIGPYTHON_BUILTIN)
|
|
%feature("python:slot", "mp_ass_subscript", functype="objobjargproc") __setitem__;
|
|
#endif
|
|
|
|
%extend {
|
|
// This will be called through the mp_ass_subscript slot to delete an entry.
|
|
void __setitem__(const key_type& key) {
|
|
self->erase(key);
|
|
}
|
|
|
|
void __setitem__(const key_type& key, const mapped_type& x) throw (std::out_of_range) {
|
|
self->insert(Type::value_type(key,x));
|
|
}
|
|
}
|
|
%enddef
|
|
|
|
%include <std/std_unordered_multimap.i>
|
|
|