23 #include "../include/elm/equiv.h"
25 namespace elm {
namespace concept {
260 template <
template <
class _>
class C>
588 const T&
get(
int index)
const;
639 void set(
int index,
const T& item);
854 static bool equals(
const T& object1,
const T& object2);
870 bool isEqual(
const T& object1,
const T& object2);
904 static int compare(
const T& object1,
const T& object2);
941 static bool equals(
const T& val1,
const T& val2);
950 static bool isEqual(
const T& val1,
const T& val2);
989 static bool equals(
const T& v1,
const T& v2);
1026 template <
class K,
class T>
1043 const T&
get(
const K& key,
const T& def)
const;
1120 template <
class K,
class T>
1361 template <
class K,
class T>
Definition: concepts.h:574
const T & get(int index) const
int lastIndexOf(const T &value, int start=-1) const
const T & operator[](int index) const
int indexOf(const T &value, int start=0) const
Definition: concepts.h:1340
BackIterator & operator=(const BackIterator< T > &iter)
BackIterator(const BackIterator< T > &iter)
BackIterator(const BiDiList< T > &list)
BackIterator & operator=(const Iterator< T > &iter)
BackIterator(const Iterator< T > &iter)
Definition: concepts.h:1329
Iterator(const Iterator< T > &iter)
Iterator(const BiDiList< T > &list)
Iterator(const BackIterator< T > &iter)
Iterator & operator=(const BackIterator< T > &iter)
Definition: concepts.h:1323
Definition: concepts.h:278
Iter(const Collection< T > &collection)
Definition: concepts.h:228
T t
Definition: concepts.h:234
bool operator==(const Collection &coll)
bool containsAll(const C< T > &collection)
bool equals(const Collection &coll)
bool operator!=(const Collection &coll)
Collection< T > self_t
Definition: concepts.h:239
bool contains(const T &item)
Definition: concepts.h:893
static int compare(const T &object1, const T &object2)
int doCompare(const T &object1, const T &object2)
Definition: concepts.h:1389
Definition: concepts.h:931
static bool equals(const T &val1, const T &val2)
static bool isEqual(const T &val1, const T &val2)
Definition: concepts.h:675
void removeAt(const Iterator &iter)
void insert(int index, const T &item)
void insert(const Iterator &iter, const T &item)
Definition: concepts.h:836
t::uint32 computeHash(const T &object)
static t::uint32 hash(const T &object)
bool isEqual(const T &object1, const T &object2)
static bool equals(const T &object1, const T &object2)
Definition: concepts.h:75
bool equals(const Iter &iterator) const
bool operator!=(const Iter &iterator) const
Iter & operator=(const Iter &iterator)
bool operator==(const Iter &iterator) const
Definition: concepts.h:1362
K key_t
Definition: concepts.h:1368
static const K & key(const T &value)
Definition: concepts.h:1170
const T & operator[](int i) const
const T & last(void) const
Iter< T > find(const T &item)
Iter< T > find(const T &item, const Iterator &start)
const T & first(void) const
Definition: concepts.h:1055
KeyIter(const KeyIter &iter)
KeyIter(const Map< K, T > &map)
Definition: concepts.h:1079
PairIterator(const ValueIterator &iter)
PairIterator(const Map< K, T > &map)
Definition: concepts.h:1027
Option< const T & > get(const K &key) const
const T & get(const K &key, const T &def) const
Iterable< PairIter > pairs() const
Iterable< KeyIter > keys() const
const T & operator[](const K &k) const
bool hasKey(const K &key) const
Definition: concepts.h:625
T & operator[](int index)
void set(const Iterator &iter, const T &item)
void set(int index, const T &item)
Definition: concepts.h:348
MutableCollection< T > & operator-=(const T &item)
void copy(const Collection< T > &items)
void removeAll(const Collection< T > &items)
void remove(const T &item)
MutableCollection & operator=(const Collection< T > &c)
void remove(const Iterator< T > &iter)
void addAll(const Collection< T > &items)
MutableCollection< T > & operator+=(const T &item)
Definition: concepts.h:152
MutableIter & operator=(const MutableIter &iterator)
MutableIter & operator++(int)
bool equals(const MutableIter &iterator) const
bool operator!=(const MutableIter &iterator) const
bool operator==(const MutableIter &iterator) const
Definition: concepts.h:1230
void addBefore(const Iter< T > &pos, const T &item)
void addFirst(const T &item)
void removeAfter(const Iter< T > &pos)
void set(const Iterator< T > &pos, const T &item)
void addLast(const T &item)
void removeBefore(const Iter< T > &pos)
void addAfter(const Iter< T > &pos, const T &item)
Definition: concepts.h:1121
void remove(const Collection< T >::Iter &iter)
void put(const K &key, const T &value)
void removeByKey(const K &key)
T & operator[](const K &k)
Definition: concepts.h:960
static const int LESS
Definition: concepts.h:971
static const int GREATER
Definition: concepts.h:976
static int compare(const T &v1, const T &v2)
static bool greaterThan(const T &v1, const T &v2)
static const int UNCOMP
Definition: concepts.h:981
static bool equals(const T &v1, const T &v2)
static bool lessThan(const T &v1, const T &v2)
static const int EQUAL
Definition: concepts.h:966
Definition: concepts.h:1403
Definition: concepts.h:784
const T & head(void) const
Definition: concepts.h:443
Set< T > operator*(const Set &set)
bool operator>(const Set &coll)
Set< T > operator|=(const Set< T > set)
bool subsetOf(const Set &coll)
bool operator>=(const Set &coll)
Set< T > operator*=(const Set< T > set)
Set< T > operator&=(const Set< T > set)
Set< T > operator+(const Set &set)
Set< T > operator-=(const Set< T > set)
Set< T > operator-(const Set &set)
void diff(const Set< T > &set)
Set< T > operator|(const Set &set)
bool operator<=(const T &item)
bool operator<(const Collection &coll)
Set< T > operator&(const Set &set)
void join(const Set< T > &set)
Set< T > operator+=(const Set< T > set)
bool operator<=(const Set &coll)
void meet(const Set< T > &set)
void insert(const T &item)
Definition: concepts.h:729
const T & top(void) const
Definition: util_WAHVector.cpp:157
void map(const C &c, const F &f, D &d)
Definition: util.h:89
unsigned int uint32
Definition: arch.h:31