K                  72 core/SortedMap.h   template <class K, class T, ListElementType valType>
K                 101 core/SortedMap.h 		T put(K k, T v)
K                 129 core/SortedMap.h 		T get(K k) const
K                 134 core/SortedMap.h 		bool get(K k, T& v) const
K                 144 core/SortedMap.h 		bool containsKey(K k) const
K                 149 core/SortedMap.h 		T remove(K k)
K                 166 core/SortedMap.h 		K firstKey() const	{ return isEmpty() ? 0 : keys[0]; }
K                 167 core/SortedMap.h 		K lastKey() const	{ return isEmpty() ? 0 : keys[keys.size()-1]; }
K                 171 core/SortedMap.h 		K   keyAt(int i) const { return keys[i]; }
K                 173 core/SortedMap.h 		int findNear(K k) const {
K                 178 core/SortedMap.h 		List<K, LIST_NonGCObjects> keys;
K                 181 core/SortedMap.h 		int find(K k) const
K                 189 core/SortedMap.h 				K m = keys[i];
K                 204 core/SortedMap.h 	template <class K, class T, ListElementType valType>
K                 219 core/SortedMap.h 		inline T put(K k, T v) { return map.put(k, v); }
K                 220 core/SortedMap.h 		inline T get(K k) const { return map.get(k); }
K                 221 core/SortedMap.h 		inline bool get(K k, T& v) const { return map.get(k, v); }
K                 222 core/SortedMap.h 		inline bool containsKey(K k) const { return map.containsKey(k); }
K                 223 core/SortedMap.h 		inline T remove(K k) { return map.remove(k); }
K                 229 core/SortedMap.h 		inline K firstKey() const	{ return map.firstKey(); }
K                 230 core/SortedMap.h 		inline K lastKey() const	{ return map.lastKey(); }
K                 232 core/SortedMap.h 		inline K   keyAt(int i) const { return map.keyAt(i); }
K                 233 core/SortedMap.h 		inline int findNear(K k) const { return map.findNear(k); }
K                 238 nanojit/Containers.h     template<class K> struct DefaultHash {
K                 239 nanojit/Containers.h         static size_t hash(const K &k) {
K                 240 nanojit/Containers.h             return murmurhash(&k, sizeof(K));
K                 244 nanojit/Containers.h     template<class K> struct DefaultHash<K*> {
K                 245 nanojit/Containers.h         static size_t hash(K* k) {
K                 256 nanojit/Containers.h     template<class K, class T, class H=DefaultHash<K> > class HashMap {
K                 261 nanojit/Containers.h             K key;
K                 263 nanojit/Containers.h             Node(K k, T v) : key(k), value(v) { }
K                 268 nanojit/Containers.h         Node* find(K k, size_t &i) {
K                 293 nanojit/Containers.h         void put(const K& k, const T& v) {
K                 304 nanojit/Containers.h         T get(const K& k) {
K                 311 nanojit/Containers.h         bool containsKey(const K& k) {
K                 318 nanojit/Containers.h         void remove(const K& k) {
K                 344 nanojit/Containers.h             const HashMap<K,T,H> &map;
K                 349 nanojit/Containers.h             Iter(HashMap<K,T,H>& map) : map(map), bucket((int)map.nbuckets-1), current(NULL)
K                 362 nanojit/Containers.h             const K& key() const {
K                 385 nanojit/Containers.h     template<class K, class T> class TreeMap {
K                 391 nanojit/Containers.h             K key;
K                 393 nanojit/Containers.h             Node(K k, T v) : left(NULL), right(NULL), key(k), value(v)
K                 402 nanojit/Containers.h         void insert(Node* &n, K k, T v) {
K                 417 nanojit/Containers.h         Node* find(Node* n, K k) {
K                 434 nanojit/Containers.h         void put(K k, T v) {
K                 440 nanojit/Containers.h         K findNear(K k) {
K                 446 nanojit/Containers.h         T get(K k) {
K                 452 nanojit/Containers.h         bool containsKey(K k) {