Lines Matching defs:KeyedVector
35 class KeyedVector
41 inline KeyedVector();
63 inline bool isIdenticalTo(const KeyedVector& rhs) const;
100 // KeyedVector<KEY, VALUE> can be trivially moved using memcpy() because its
102 template<typename KEY, typename VALUE> struct trait_trivial_move<KeyedVector<KEY, VALUE> > {
110 * Variation of KeyedVector that holds a default value to return when
114 class DefaultKeyedVector : public KeyedVector<KEY, VALUE>
127 KeyedVector<KEY,VALUE>::KeyedVector()
132 bool KeyedVector<KEY,VALUE>::isIdenticalTo(const KeyedVector<KEY,VALUE>& rhs) const {
137 ssize_t KeyedVector<KEY,VALUE>::indexOfKey(const KEY& key) const {
142 const VALUE& KeyedVector<KEY,VALUE>::valueFor(const KEY& key) const {
149 const VALUE& KeyedVector<KEY,VALUE>::valueAt(size_t index) const {
154 const VALUE& KeyedVector<KEY,VALUE>::operator[] (size_t index) const {
159 const KEY& KeyedVector<KEY,VALUE>::keyAt(size_t index) const {
164 VALUE& KeyedVector<KEY,VALUE>::editValueFor(const KEY& key) {
171 VALUE& KeyedVector<KEY,VALUE>::editValueAt(size_t index) {
176 ssize_t KeyedVector<KEY,VALUE>::add(const KEY& key, const VALUE& value) {
181 ssize_t KeyedVector<KEY,VALUE>::replaceValueFor(const KEY& key, const VALUE& value) {
188 ssize_t KeyedVector<KEY,VALUE>::replaceValueAt(size_t index, const VALUE& item) {
197 ssize_t KeyedVector<KEY,VALUE>::removeItem(const KEY& key) {
202 ssize_t KeyedVector<KEY, VALUE>::removeItemsAt(size_t index, size_t count) {
217 return i >= 0 ? KeyedVector<KEY,VALUE>::valueAt(i) : mDefault;
