Maps both working as java.util impls
This commit is contained in:
parent
e6d8675513
commit
573ddb061e
6 changed files with 514 additions and 285 deletions
|
|
@ -2,6 +2,8 @@
|
|||
* std_unordered_map.i
|
||||
*
|
||||
* SWIG typemaps for std::unordered_map
|
||||
* The Java proxy class extends java.util.AbstractMap. The std::unordered_map
|
||||
* container looks and feels much like a java.util.HashMap from Java.
|
||||
* ----------------------------------------------------------------------------- */
|
||||
|
||||
%include <std_common.i>
|
||||
|
|
@ -15,51 +17,185 @@
|
|||
#include <stdexcept>
|
||||
%}
|
||||
|
||||
%fragment("SWIG_MapSize", "header", fragment="SWIG_JavaIntFromSize_t") {
|
||||
SWIGINTERN jint SWIG_MapSize(size_t size) {
|
||||
jint sz = SWIG_JavaIntFromSize_t(size);
|
||||
if (sz == -1) {
|
||||
throw std::out_of_range("map size is too large to fit into a Java int");
|
||||
}
|
||||
|
||||
return sz;
|
||||
}
|
||||
}
|
||||
|
||||
%javamethodmodifiers std::unordered_map::sizeImpl "private";
|
||||
%javamethodmodifiers std::unordered_map::containsImpl "private";
|
||||
%javamethodmodifiers std::unordered_map::putUnchecked "private";
|
||||
%javamethodmodifiers std::unordered_map::removeUnchecked "private";
|
||||
%javamethodmodifiers std::unordered_map::find "private";
|
||||
%javamethodmodifiers std::unordered_map::begin "private";
|
||||
%javamethodmodifiers std::unordered_map::end "private";
|
||||
|
||||
%rename(Iterator) std::unordered_map::iterator;
|
||||
%nodefaultctor std::unordered_map::iterator;
|
||||
%javamethodmodifiers std::unordered_map::iterator::getNextUnchecked "private";
|
||||
%javamethodmodifiers std::unordered_map::iterator::isNot "private";
|
||||
%javamethodmodifiers std::unordered_map::iterator::getKey "private";
|
||||
%javamethodmodifiers std::unordered_map::iterator::getValue "private";
|
||||
%javamethodmodifiers std::unordered_map::iterator::setValue "private";
|
||||
|
||||
namespace std {
|
||||
|
||||
template<class KeyType, class MappedType> class unordered_map {
|
||||
public:
|
||||
typedef size_t size_type;
|
||||
typedef ptrdiff_t difference_type;
|
||||
typedef KeyType key_type;
|
||||
typedef MappedType mapped_type;
|
||||
unordered_map();
|
||||
unordered_map(const unordered_map<KeyType, MappedType>&);
|
||||
template<class KeyType, class ValueType > class unordered_map {
|
||||
|
||||
unsigned int size() const;
|
||||
%typemap(javabase) std::unordered_map<KeyType, ValueType>
|
||||
"java.util.AbstractMap<$typemap(jboxtype, KeyType), $typemap(jboxtype, ValueType)>"
|
||||
|
||||
%proxycode %{
|
||||
|
||||
public int size() {
|
||||
return sizeImpl();
|
||||
}
|
||||
|
||||
public boolean containsKey(Object key) {
|
||||
if (!(key instanceof $typemap(jboxtype, KeyType))) {
|
||||
return false;
|
||||
}
|
||||
|
||||
return containsImpl(($typemap(jboxtype, KeyType))key);
|
||||
}
|
||||
|
||||
public $typemap(jboxtype, ValueType) get(Object key) {
|
||||
if (!(key instanceof $typemap(jboxtype, KeyType))) {
|
||||
return null;
|
||||
}
|
||||
|
||||
Iterator itr = find(($typemap(jboxtype, KeyType)) key);
|
||||
if (itr.isNot(end())) {
|
||||
return itr.getValue();
|
||||
}
|
||||
|
||||
return null;
|
||||
}
|
||||
|
||||
public $typemap(jboxtype, ValueType) put($typemap(jboxtype, KeyType) key,
|
||||
$typemap(jboxtype, ValueType) value) {
|
||||
Iterator itr = find(($typemap(jboxtype, KeyType)) key);
|
||||
if (itr.isNot(end())) {
|
||||
$typemap(jboxtype, ValueType) oldValue = itr.getValue();
|
||||
itr.setValue(value);
|
||||
return oldValue;
|
||||
} else {
|
||||
putUnchecked(key, value);
|
||||
return null;
|
||||
}
|
||||
}
|
||||
|
||||
public $typemap(jboxtype, ValueType) remove(Object key) {
|
||||
if (!(key instanceof $typemap(jboxtype, KeyType))) {
|
||||
return null;
|
||||
}
|
||||
|
||||
Iterator itr = find(($typemap(jboxtype, KeyType)) key);
|
||||
if (itr.isNot(end())) {
|
||||
$typemap(jboxtype, ValueType) oldValue = itr.getValue();
|
||||
removeUnchecked(itr);
|
||||
return oldValue;
|
||||
} else {
|
||||
return null;
|
||||
}
|
||||
}
|
||||
|
||||
public java.util.Set<Entry<$typemap(jboxtype, KeyType), $typemap(jboxtype, ValueType)>> entrySet() {
|
||||
java.util.Set<Entry<$typemap(jboxtype, KeyType), $typemap(jboxtype, ValueType)>> setToReturn =
|
||||
new java.util.HashSet<Entry<$typemap(jboxtype, KeyType), $typemap(jboxtype, ValueType)>>();
|
||||
|
||||
Iterator itr = begin();
|
||||
final Iterator end = end();
|
||||
while(itr.isNot(end)) {
|
||||
setToReturn.add(new Entry<$typemap(jboxtype, KeyType), $typemap(jboxtype, ValueType)>() {
|
||||
private Iterator iterator;
|
||||
|
||||
private Entry<$typemap(jboxtype, KeyType), $typemap(jboxtype, ValueType)> init(Iterator iterator) {
|
||||
this.iterator = iterator;
|
||||
return this;
|
||||
}
|
||||
|
||||
public $typemap(jboxtype, KeyType) getKey() {
|
||||
return iterator.getKey();
|
||||
}
|
||||
|
||||
public $typemap(jboxtype, ValueType) getValue() {
|
||||
return iterator.getValue();
|
||||
}
|
||||
|
||||
public $typemap(jboxtype, ValueType) setValue($typemap(jboxtype, ValueType) newValue) {
|
||||
$typemap(jboxtype, ValueType) oldValue = iterator.getValue();
|
||||
iterator.setValue(newValue);
|
||||
return oldValue;
|
||||
}
|
||||
}.init(itr));
|
||||
itr = itr.getNextUnchecked();
|
||||
}
|
||||
|
||||
return setToReturn;
|
||||
}
|
||||
%}
|
||||
|
||||
public:
|
||||
unordered_map();
|
||||
unordered_map(const unordered_map<KeyType, ValueType >&);
|
||||
|
||||
struct iterator {
|
||||
%extend {
|
||||
std::unordered_map<KeyType, ValueType >::iterator getNextUnchecked() {
|
||||
std::unordered_map<KeyType, ValueType >::iterator copy = (*$self);
|
||||
return ++copy;
|
||||
}
|
||||
|
||||
bool isNot(const iterator other) const {
|
||||
return (*$self != other);
|
||||
}
|
||||
|
||||
KeyType getKey() const {
|
||||
return (*$self)->first;
|
||||
}
|
||||
|
||||
ValueType getValue() const {
|
||||
return (*$self)->second;
|
||||
}
|
||||
|
||||
void setValue(const ValueType& newValue) {
|
||||
(*$self)->second = newValue;
|
||||
}
|
||||
}
|
||||
};
|
||||
|
||||
%rename(isEmpty) empty;
|
||||
bool empty() const;
|
||||
void clear();
|
||||
|
||||
iterator find(const KeyType&);
|
||||
iterator begin();
|
||||
iterator end();
|
||||
%extend {
|
||||
const MappedType& get(const KeyType& key) throw (std::out_of_range) {
|
||||
std::unordered_map<KeyType, MappedType>::iterator i = self->find(key);
|
||||
%fragment("SWIG_MapSize");
|
||||
|
||||
if (i != self->end()) {
|
||||
return i->second;
|
||||
} else {
|
||||
throw std::out_of_range("key not found");
|
||||
}
|
||||
jint sizeImpl() const throw (std::out_of_range) {
|
||||
return SWIG_MapSize(self->size());
|
||||
}
|
||||
|
||||
void set(const KeyType& key, const MappedType& x) {
|
||||
(*self)[key] = x;
|
||||
bool containsImpl(const KeyType& key) {
|
||||
return (self->count(key) > 0);
|
||||
}
|
||||
|
||||
void del(const KeyType& key) throw (std::out_of_range) {
|
||||
std::unordered_map<KeyType, MappedType>::iterator i = self->find(key);
|
||||
|
||||
if (i != self->end()) {
|
||||
self->erase(i);
|
||||
} else {
|
||||
throw std::out_of_range("key not found");
|
||||
}
|
||||
void putUnchecked(const KeyType& key, const ValueType& value) {
|
||||
(*self)[key] = value;
|
||||
}
|
||||
|
||||
bool has_key(const KeyType& key) {
|
||||
std::unordered_map<KeyType, MappedType>::iterator i = self->find(key);
|
||||
return i != self->end();
|
||||
void removeUnchecked(const std::unordered_map<KeyType, ValueType >::iterator itr) {
|
||||
self->erase(itr);
|
||||
}
|
||||
}
|
||||
};
|
||||
|
||||
} // namespace std
|
||||
}
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue