K 181 base/sha1_portable.cc uint32 TEMP = S(5, A) + f(t, B, C, D) + E + W[t] + K(t); K 775 chrome/browser/search_engines/template_url_prepopulate_data.cc DECLARE_COUNTRY(D, K) // Denmark K 788 chrome/browser/search_engines/template_url_prepopulate_data.cc DECLARE_COUNTRY(H, K) // Hong Kong K 803 chrome/browser/search_engines/template_url_prepopulate_data.cc DECLARE_COUNTRY(K, E) // Kenya K 804 chrome/browser/search_engines/template_url_prepopulate_data.cc DECLARE_COUNTRY(K, R) // South Korea K 805 chrome/browser/search_engines/template_url_prepopulate_data.cc DECLARE_COUNTRY(K, W) // Kuwait K 806 chrome/browser/search_engines/template_url_prepopulate_data.cc DECLARE_COUNTRY(K, Z) // Kazakhstan K 817 chrome/browser/search_engines/template_url_prepopulate_data.cc DECLARE_COUNTRY(M, K) // Macedonia K 828 chrome/browser/search_engines/template_url_prepopulate_data.cc DECLARE_COUNTRY(P, K) // Pakistan K 842 chrome/browser/search_engines/template_url_prepopulate_data.cc DECLARE_COUNTRY(S, K) // Slovakia K 873 chrome/browser/search_engines/template_url_prepopulate_data.cc END_UNHANDLED_COUNTRIES(D, K) K 940 chrome/browser/search_engines/template_url_prepopulate_data.cc UNHANDLED_COUNTRY(C, K) // Cook Islands K 942 chrome/browser/search_engines/template_url_prepopulate_data.cc UNHANDLED_COUNTRY(T, K) // Tokelau K 956 chrome/browser/search_engines/template_url_prepopulate_data.cc UNHANDLED_COUNTRY(K, G) // Kyrgyzstan K 970 chrome/browser/search_engines/template_url_prepopulate_data.cc UNHANDLED_COUNTRY(F, K) // Falkland Islands K 978 chrome/browser/search_engines/template_url_prepopulate_data.cc UNHANDLED_COUNTRY(K, Y) // Cayman Islands K 1019 chrome/browser/search_engines/template_url_prepopulate_data.cc UNHANDLED_COUNTRY(K, H) // Cambodia K 1020 chrome/browser/search_engines/template_url_prepopulate_data.cc UNHANDLED_COUNTRY(K, I) // Kiribati K 1021 chrome/browser/search_engines/template_url_prepopulate_data.cc UNHANDLED_COUNTRY(K, M) // Comoros K 1022 chrome/browser/search_engines/template_url_prepopulate_data.cc UNHANDLED_COUNTRY(K, N) // Saint Kitts and Nevis K 1023 chrome/browser/search_engines/template_url_prepopulate_data.cc UNHANDLED_COUNTRY(K, P) // North Korea K 1026 chrome/browser/search_engines/template_url_prepopulate_data.cc UNHANDLED_COUNTRY(L, K) // Sri Lanka K 44 components/autofill/content/renderer/form_cache.cc template <class K, class V> K 45 components/autofill/content/renderer/form_cache.cc void RemoveOldElements(const WebFrame& frame, std::map<const K, V>* states) { K 46 components/autofill/content/renderer/form_cache.cc std::vector<K> to_remove; K 47 components/autofill/content/renderer/form_cache.cc for (typename std::map<const K, V>::const_iterator it = states->begin(); K 59 components/autofill/content/renderer/form_cache.cc for (typename std::vector<K>::const_iterator it = to_remove.begin(); K 366 ipc/ipc_message_utils.h template <class K, class V> K 367 ipc/ipc_message_utils.h struct ParamTraits<std::map<K, V> > { K 383 ipc/ipc_message_utils.h K k; K 695 ipc/ipc_message_utils.h K key; K 310 third_party/libwebp/dsp/dec.c const int K = dst[-1 + 2 * BPS]; K 317 third_party/libwebp/dsp/dec.c DST(0, 3) = AVG3(J, K, L); K 318 third_party/libwebp/dsp/dec.c DST(0, 2) = DST(1, 3) = AVG3(I, J, K); K 347 third_party/libwebp/dsp/dec.c const int K = dst[-1 + 2 * BPS]; K 358 third_party/libwebp/dsp/dec.c DST(0, 3) = AVG3(K, J, I); K 391 third_party/libwebp/dsp/dec.c const int K = dst[-1 + 2 * BPS]; K 394 third_party/libwebp/dsp/dec.c DST(2, 0) = DST(0, 1) = AVG2(J, K); K 395 third_party/libwebp/dsp/dec.c DST(2, 1) = DST(0, 2) = AVG2(K, L); K 396 third_party/libwebp/dsp/dec.c DST(1, 0) = AVG3(I, J, K); K 397 third_party/libwebp/dsp/dec.c DST(3, 0) = DST(1, 1) = AVG3(J, K, L); K 398 third_party/libwebp/dsp/dec.c DST(3, 1) = DST(1, 2) = AVG3(K, L, L); K 406 third_party/libwebp/dsp/dec.c const int K = dst[-1 + 2 * BPS]; K 415 third_party/libwebp/dsp/dec.c DST(0, 2) = DST(2, 3) = AVG2(K, J); K 416 third_party/libwebp/dsp/dec.c DST(0, 3) = AVG2(L, K); K 422 third_party/libwebp/dsp/dec.c DST(1, 2) = DST(3, 3) = AVG3(K, J, I); K 423 third_party/libwebp/dsp/dec.c DST(1, 3) = AVG3(L, K, J); K 363 third_party/libwebp/dsp/enc.c const int K = top[-4]; K 366 third_party/libwebp/dsp/enc.c *(uint32_t*)(dst + 1 * BPS) = 0x01010101U * AVG3(I, J, K); K 367 third_party/libwebp/dsp/enc.c *(uint32_t*)(dst + 2 * BPS) = 0x01010101U * AVG3(J, K, L); K 368 third_party/libwebp/dsp/enc.c *(uint32_t*)(dst + 3 * BPS) = 0x01010101U * AVG3(K, L, L); K 382 third_party/libwebp/dsp/enc.c const int K = top[-4]; K 388 third_party/libwebp/dsp/enc.c DST(0, 3) = AVG3(J, K, L); K 389 third_party/libwebp/dsp/enc.c DST(0, 2) = DST(1, 3) = AVG3(I, J, K); K 419 third_party/libwebp/dsp/enc.c const int K = top[-4]; K 429 third_party/libwebp/dsp/enc.c DST(0, 3) = AVG3(K, J, I); K 462 third_party/libwebp/dsp/enc.c const int K = top[-4]; K 465 third_party/libwebp/dsp/enc.c DST(2, 0) = DST(0, 1) = AVG2(J, K); K 466 third_party/libwebp/dsp/enc.c DST(2, 1) = DST(0, 2) = AVG2(K, L); K 467 third_party/libwebp/dsp/enc.c DST(1, 0) = AVG3(I, J, K); K 468 third_party/libwebp/dsp/enc.c DST(3, 0) = DST(1, 1) = AVG3(J, K, L); K 469 third_party/libwebp/dsp/enc.c DST(3, 1) = DST(1, 2) = AVG3(K, L, L); K 478 third_party/libwebp/dsp/enc.c const int K = top[-4]; K 486 third_party/libwebp/dsp/enc.c DST(0, 2) = DST(2, 3) = AVG2(K, J); K 487 third_party/libwebp/dsp/enc.c DST(0, 3) = AVG2(L, K); K 493 third_party/libwebp/dsp/enc.c DST(1, 2) = DST(3, 3) = AVG3(K, J, I); K 494 third_party/libwebp/dsp/enc.c DST(1, 3) = AVG3(L, K, J); K 153 third_party/protobuf/java/src/main/java/com/google/protobuf/LazyField.java static class LazyEntry<K> implements Entry<K, Object> { K 154 third_party/protobuf/java/src/main/java/com/google/protobuf/LazyField.java private Entry<K, LazyField> entry; K 156 third_party/protobuf/java/src/main/java/com/google/protobuf/LazyField.java private LazyEntry(Entry<K, LazyField> entry) { K 160 third_party/protobuf/java/src/main/java/com/google/protobuf/LazyField.java public K getKey() { K 186 third_party/protobuf/java/src/main/java/com/google/protobuf/LazyField.java static class LazyIterator<K> implements Iterator<Entry<K, Object>> { K 187 third_party/protobuf/java/src/main/java/com/google/protobuf/LazyField.java private Iterator<Entry<K, Object>> iterator; K 189 third_party/protobuf/java/src/main/java/com/google/protobuf/LazyField.java public LazyIterator(Iterator<Entry<K, Object>> iterator) { K 198 third_party/protobuf/java/src/main/java/com/google/protobuf/LazyField.java public Entry<K, Object> next() { K 199 third_party/protobuf/java/src/main/java/com/google/protobuf/LazyField.java Entry<K, ?> entry = iterator.next(); K 201 third_party/protobuf/java/src/main/java/com/google/protobuf/LazyField.java return new LazyEntry<K>((Entry<K, LazyField>) entry); K 203 third_party/protobuf/java/src/main/java/com/google/protobuf/LazyField.java return (Entry<K, Object>) entry; K 87 third_party/protobuf/java/src/main/java/com/google/protobuf/SmallSortedMap.java class SmallSortedMap<K extends Comparable<K>, V> extends AbstractMap<K, V> { K 132 third_party/protobuf/java/src/main/java/com/google/protobuf/SmallSortedMap.java static <K extends Comparable<K>, V> SmallSortedMap<K, V> newInstanceForTest( K 134 third_party/protobuf/java/src/main/java/com/google/protobuf/SmallSortedMap.java return new SmallSortedMap<K, V>(arraySize); K 142 third_party/protobuf/java/src/main/java/com/google/protobuf/SmallSortedMap.java private Map<K, V> overflowEntries; K 167 third_party/protobuf/java/src/main/java/com/google/protobuf/SmallSortedMap.java Collections.<K, V>emptyMap() : K 184 third_party/protobuf/java/src/main/java/com/google/protobuf/SmallSortedMap.java public Map.Entry<K, V> getArrayEntryAt(int index) { K 194 third_party/protobuf/java/src/main/java/com/google/protobuf/SmallSortedMap.java public Iterable<Map.Entry<K, V>> getOverflowEntries() { K 196 third_party/protobuf/java/src/main/java/com/google/protobuf/SmallSortedMap.java EmptySet.<Map.Entry<K, V>>iterable() : K 214 third_party/protobuf/java/src/main/java/com/google/protobuf/SmallSortedMap.java final K key = (K) o; K 227 third_party/protobuf/java/src/main/java/com/google/protobuf/SmallSortedMap.java final K key = (K) o; K 236 third_party/protobuf/java/src/main/java/com/google/protobuf/SmallSortedMap.java public V put(K key, V value) { K 281 third_party/protobuf/java/src/main/java/com/google/protobuf/SmallSortedMap.java final K key = (K) o; K 301 third_party/protobuf/java/src/main/java/com/google/protobuf/SmallSortedMap.java final Iterator<Map.Entry<K, V>> iterator = K 314 third_party/protobuf/java/src/main/java/com/google/protobuf/SmallSortedMap.java private int binarySearchInArray(K key) { K 352 third_party/protobuf/java/src/main/java/com/google/protobuf/SmallSortedMap.java public Set<Map.Entry<K, V>> entrySet() { K 376 third_party/protobuf/java/src/main/java/com/google/protobuf/SmallSortedMap.java private SortedMap<K, V> getOverflowEntriesMutable() { K 379 third_party/protobuf/java/src/main/java/com/google/protobuf/SmallSortedMap.java overflowEntries = new TreeMap<K, V>(); K 381 third_party/protobuf/java/src/main/java/com/google/protobuf/SmallSortedMap.java return (SortedMap<K, V>) overflowEntries; K 400 third_party/protobuf/java/src/main/java/com/google/protobuf/SmallSortedMap.java private class Entry implements Map.Entry<K, V>, Comparable<Entry> { K 402 third_party/protobuf/java/src/main/java/com/google/protobuf/SmallSortedMap.java private final K key; K 405 third_party/protobuf/java/src/main/java/com/google/protobuf/SmallSortedMap.java Entry(Map.Entry<K, V> copy) { K 409 third_party/protobuf/java/src/main/java/com/google/protobuf/SmallSortedMap.java Entry(K key, V value) { K 415 third_party/protobuf/java/src/main/java/com/google/protobuf/SmallSortedMap.java public K getKey() { K 470 third_party/protobuf/java/src/main/java/com/google/protobuf/SmallSortedMap.java private class EntrySet extends AbstractSet<Map.Entry<K, V>> { K 473 third_party/protobuf/java/src/main/java/com/google/protobuf/SmallSortedMap.java public Iterator<Map.Entry<K, V>> iterator() { K 490 third_party/protobuf/java/src/main/java/com/google/protobuf/SmallSortedMap.java final Map.Entry<K, V> entry = (Map.Entry<K, V>) o; K 498 third_party/protobuf/java/src/main/java/com/google/protobuf/SmallSortedMap.java public boolean add(Map.Entry<K, V> entry) { K 514 third_party/protobuf/java/src/main/java/com/google/protobuf/SmallSortedMap.java final Map.Entry<K, V> entry = (Map.Entry<K, V>) o; K 532 third_party/protobuf/java/src/main/java/com/google/protobuf/SmallSortedMap.java private class EntryIterator implements Iterator<Map.Entry<K, V>> { K 536 third_party/protobuf/java/src/main/java/com/google/protobuf/SmallSortedMap.java private Iterator<Map.Entry<K, V>> lazyOverflowIterator; K 545 third_party/protobuf/java/src/main/java/com/google/protobuf/SmallSortedMap.java public Map.Entry<K, V> next() { K 576 third_party/protobuf/java/src/main/java/com/google/protobuf/SmallSortedMap.java private Iterator<Map.Entry<K, V>> getOverflowIterator() { K 50 third_party/protobuf/java/src/test/java/com/google/protobuf/SmallSortedMapTest.java private static class SimpleEntry<K, V> implements Map.Entry<K, V> { K 51 third_party/protobuf/java/src/test/java/com/google/protobuf/SmallSortedMapTest.java private final K key; K 54 third_party/protobuf/java/src/test/java/com/google/protobuf/SmallSortedMapTest.java SimpleEntry(K key, V value) { K 59 third_party/protobuf/java/src/test/java/com/google/protobuf/SmallSortedMapTest.java public K getKey() { K 7548 third_party/sqlite/amalgamation/sqlite3.c SQLITE_API void *sqlite3_wsd_find(void *K, int L); K 1310 third_party/sqlite/src/src/parse.y cmd ::= ATTACH database_kw_opt expr(F) AS expr(D) key_opt(K). { K 1311 third_party/sqlite/src/src/parse.y sqlite3Attach(pParse, F.pExpr, D.pExpr, K); K 568 third_party/sqlite/src/src/sqliteInt.h void *sqlite3_wsd_find(void *K, int L); K 54 third_party/sqlite/src/src/test_wsd.c void *sqlite3_wsd_find(void *K, int L){ K 61 third_party/sqlite/src/src/test_wsd.c iHash = (iHash<<3) + ((unsigned char *)&K)[i]; K 66 third_party/sqlite/src/src/test_wsd.c for(pVar=pGlobal->aData[iHash]; pVar && pVar->pKey!=K; pVar=pVar->pNext); K 73 third_party/sqlite/src/src/test_wsd.c pVar->pKey = K; K 78 third_party/sqlite/src/src/test_wsd.c memcpy(&pVar[1], K, L); K 150 third_party/tcmalloc/chromium/src/packed-cache-inl.h COMPILE_ASSERT(kKeybits <= sizeof(K) * 8, key_size); K 158 third_party/tcmalloc/chromium/src/packed-cache-inl.h void Put(K key, V value) { K 164 third_party/tcmalloc/chromium/src/packed-cache-inl.h bool Has(K key) const { K 169 third_party/tcmalloc/chromium/src/packed-cache-inl.h V GetOrDefault(K key, V default_value) const { K 200 third_party/tcmalloc/chromium/src/packed-cache-inl.h static UPPER KeyToUpper(K k) { K 210 third_party/tcmalloc/chromium/src/packed-cache-inl.h static size_t Hash(K key) { K 215 third_party/tcmalloc/chromium/src/packed-cache-inl.h static bool KeyMatch(T entry, K key) { K 225 third_party/tcmalloc/chromium/src/packed-cache-inl.h static const K kKeyMask = N_ONES_(K, kKeybits); K 148 third_party/tcmalloc/vendor/src/packed-cache-inl.h COMPILE_ASSERT(kKeybits <= sizeof(K) * 8, key_size); K 156 third_party/tcmalloc/vendor/src/packed-cache-inl.h void Put(K key, V value) { K 162 third_party/tcmalloc/vendor/src/packed-cache-inl.h bool Has(K key) const { K 167 third_party/tcmalloc/vendor/src/packed-cache-inl.h V GetOrDefault(K key, V default_value) const { K 198 third_party/tcmalloc/vendor/src/packed-cache-inl.h static UPPER KeyToUpper(K k) { K 208 third_party/tcmalloc/vendor/src/packed-cache-inl.h static size_t Hash(K key) { K 213 third_party/tcmalloc/vendor/src/packed-cache-inl.h static bool KeyMatch(T entry, K key) { K 223 third_party/tcmalloc/vendor/src/packed-cache-inl.h static const K kKeyMask = N_ONES_(K, kKeybits); K 17 tools/android/forwarder2/util.h template <typename Map, typename K> K 18 tools/android/forwarder2/util.h bool DeleteRefCountedValueInMap(const K& key, Map* map) {