Home
last modified time | relevance | path

Searched refs:K (Results 1 – 25 of 798) sorted by relevance

12345678910>>...32

/external/kernel-headers/original/linux/
Dkeyboard.h49 #define K(t,v) (((t)<<8)|(v)) macro
53 #define K_F1 K(KT_FN,0)
54 #define K_F2 K(KT_FN,1)
55 #define K_F3 K(KT_FN,2)
56 #define K_F4 K(KT_FN,3)
57 #define K_F5 K(KT_FN,4)
58 #define K_F6 K(KT_FN,5)
59 #define K_F7 K(KT_FN,6)
60 #define K_F8 K(KT_FN,7)
61 #define K_F9 K(KT_FN,8)
[all …]
/external/guava/src/com/google/common/collect/
DMapMaker.java287 public <K, V> ConcurrentMap<K, V> makeMap() { in makeMap()
289 ? new StrategyImpl<K, V>(this).map in makeMap()
290 : new ConcurrentHashMap<K, V>(builder.getInitialCapacity(), in makeMap()
334 public <K, V> ConcurrentMap<K, V> makeComputingMap( in makeComputingMap()
335 Function<? super K, ? extends V> computingFunction) { in makeComputingMap() argument
336 return new StrategyImpl<K, V>(this, computingFunction).map; in makeComputingMap()
349 @Override <K, V> ValueReference<K, V> referenceValue( in referenceValue()
350 ReferenceEntry<K, V> entry, V value) { in referenceValue() argument
351 return new WeakValueReference<K, V>(value, entry); in referenceValue()
353 @Override <K, V> ReferenceEntry<K, V> newEntry( in newEntry() argument
[all …]
DMaps.java75 public static <K, V> HashMap<K, V> newHashMap() { in newHashMap()
76 return new HashMap<K, V>(); in newHashMap()
88 public static <K, V> HashMap<K, V> newHashMapWithExpectedSize( in newHashMapWithExpectedSize()
95 return new HashMap<K, V>(capacity(expectedSize)); in newHashMapWithExpectedSize()
125 public static <K, V> HashMap<K, V> newHashMap( in newHashMap()
126 Map<? extends K, ? extends V> map) { in newHashMap() argument
127 return new HashMap<K, V>(map); in newHashMap()
139 public static <K, V> LinkedHashMap<K, V> newLinkedHashMap() { in newLinkedHashMap()
140 return new LinkedHashMap<K, V>(); in newLinkedHashMap()
154 public static <K, V> LinkedHashMap<K, V>
[all …]
DImmutableSortedMap.java54 public class ImmutableSortedMap<K, V>
55 extends ImmutableSortedMapFauxverideShim<K, V> implements SortedMap<K, V> {
76 public static <K, V> ImmutableSortedMap<K, V> of() { in of()
80 private static <K, V> ImmutableSortedMap<K, V> emptyMap( in emptyMap()
81 Comparator<? super K> comparator) { in emptyMap()
85 return new ImmutableSortedMap<K, V>(EMPTY_ARRAY, comparator); in emptyMap()
92 public static <K extends Comparable<? super K>, V> ImmutableSortedMap<K, V>
93 of(K k1, V v1) { in of()
95 return new ImmutableSortedMap<K, V>(entries, Ordering.natural()); in of()
105 public static <K extends Comparable<? super K>, V> ImmutableSortedMap<K, V>
[all …]
DImmutableMultimap.java50 public abstract class ImmutableMultimap<K, V>
51 implements Multimap<K, V>, Serializable {
54 public static <K, V> ImmutableMultimap<K, V> of() { in of()
61 public static <K, V> ImmutableMultimap<K, V> of(K k1, V v1) { in of()
68 public static <K, V> ImmutableMultimap<K, V> of(K k1, V v1, K k2, V v2) { in of()
75 public static <K, V> ImmutableMultimap<K, V> of( in of()
76 K k1, V v1, K k2, V v2, K k3, V v3) { in of()
83 public static <K, V> ImmutableMultimap<K, V> of( in of()
84 K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4) { in of()
91 public static <K, V> ImmutableMultimap<K, V> of( in of()
[all …]
DMultimaps.java97 public static <K, V> Multimap<K, V> newMultimap(Map<K, Collection<V>> map, in newMultimap() argument
99 return new CustomMultimap<K, V>(map, factory); in newMultimap()
102 private static class CustomMultimap<K, V> extends AbstractMultimap<K, V> {
105 CustomMultimap(Map<K, Collection<V>> map, in CustomMultimap() argument
130 Map<K, Collection<V>> map = (Map<K, Collection<V>>) stream.readObject(); in readObject()
174 public static <K, V> ListMultimap<K, V> newListMultimap( in newListMultimap()
175 Map<K, Collection<V>> map, final Supplier<? extends List<V>> factory) { in newListMultimap() argument
176 return new CustomListMultimap<K, V>(map, factory); in newListMultimap()
179 private static class CustomListMultimap<K, V>
180 extends AbstractListMultimap<K, V> {
[all …]
DImmutableBiMap.java43 public abstract class ImmutableBiMap<K, V> extends ImmutableMap<K, V>
44 implements BiMap<K, V> {
54 public static <K, V> ImmutableBiMap<K, V> of() { in of()
55 return (ImmutableBiMap<K, V>) EMPTY_IMMUTABLE_BIMAP; in of()
61 public static <K, V> ImmutableBiMap<K, V> of(K k1, V v1) { in of()
62 return new RegularImmutableBiMap<K, V>(ImmutableMap.of(k1, v1)); in of()
70 public static <K, V> ImmutableBiMap<K, V> of(K k1, V v1, K k2, V v2) { in of()
71 return new RegularImmutableBiMap<K, V>(ImmutableMap.of(k1, v1, k2, v2)); in of()
79 public static <K, V> ImmutableBiMap<K, V> of( in of()
80 K k1, V v1, K k2, V v2, K k3, V v3) { in of()
[all …]
DImmutableMap.java53 public abstract class ImmutableMap<K, V> implements Map<K, V>, Serializable {
61 public static <K, V> ImmutableMap<K, V> of() { in of()
73 public static <K, V> ImmutableMap<K, V> of(K k1, V v1) { in of()
74 return new SingletonImmutableMap<K, V>( in of()
83 public static <K, V> ImmutableMap<K, V> of(K k1, V v1, K k2, V v2) { in of()
84 return new RegularImmutableMap<K, V>(entryOf(k1, v1), entryOf(k2, v2)); in of()
92 public static <K, V> ImmutableMap<K, V> of( in of()
93 K k1, V v1, K k2, V v2, K k3, V v3) { in of()
94 return new RegularImmutableMap<K, V>( in of()
103 public static <K, V> ImmutableMap<K, V> of( in of()
[all …]
DImmutableSetMultimap.java53 public class ImmutableSetMultimap<K, V>
54 extends ImmutableMultimap<K, V>
55 implements SetMultimap<K, V> {
60 public static <K, V> ImmutableSetMultimap<K, V> of() { in of()
69 public static <K, V> ImmutableSetMultimap<K, V> of(K k1, V v1) { in of()
70 ImmutableSetMultimap.Builder<K, V> builder = ImmutableSetMultimap.builder(); in of()
80 public static <K, V> ImmutableSetMultimap<K, V> of(K k1, V v1, K k2, V v2) { in of()
81 ImmutableSetMultimap.Builder<K, V> builder = ImmutableSetMultimap.builder(); in of()
92 public static <K, V> ImmutableSetMultimap<K, V> of( in of()
93 K k1, V v1, K k2, V v2, K k3, V v3) { in of()
[all …]
DImmutableListMultimap.java50 public class ImmutableListMultimap<K, V>
51 extends ImmutableMultimap<K, V>
52 implements ListMultimap<K, V> {
57 public static <K, V> ImmutableListMultimap<K, V> of() { in of()
66 public static <K, V> ImmutableListMultimap<K, V> of(K k1, V v1) { in of()
67 ImmutableListMultimap.Builder<K, V> builder in of()
76 public static <K, V> ImmutableListMultimap<K, V> of(K k1, V v1, K k2, V v2) { in of()
77 ImmutableListMultimap.Builder<K, V> builder in of()
87 public static <K, V> ImmutableListMultimap<K, V> of( in of()
88 K k1, V v1, K k2, V v2, K k3, V v3) { in of()
[all …]
DImmutableSortedMapFauxverideShim.java29 abstract class ImmutableSortedMapFauxverideShim<K, V>
30 extends ImmutableMap<K, V> {
40 @Deprecated public static <K, V> ImmutableSortedMap.Builder<K, V> builder() { in builder()
53 @Deprecated public static <K, V> ImmutableSortedMap<K, V> of(K k1, V v1) { in of()
66 @Deprecated public static <K, V> ImmutableSortedMap<K, V> of( in of()
67 K k1, V v1, K k2, V v2) { in of()
81 @Deprecated public static <K, V> ImmutableSortedMap<K, V> of( in of()
82 K k1, V v1, K k2, V v2, K k3, V v3) { in of()
96 @Deprecated public static <K, V> ImmutableSortedMap<K, V> of( in of()
97 K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4) { in of()
[all …]
DLinkedListMultimap.java96 public final class LinkedListMultimap<K, V>
97 implements ListMultimap<K, V>, Serializable {
105 private static final class Node<K, V> {
106 final K key;
108 Node<K, V> next; // the next node (with any key)
109 Node<K, V> previous; // the previous node (with any key)
110 Node<K, V> nextSibling; // the next node with the same key
111 Node<K, V> previousSibling; // the previous node with the same key
113 Node(@Nullable K key, @Nullable V value) { in Node()
123 private transient Node<K, V> head; // the head for all keys
[all …]
DConstrainedMap.java35 class ConstrainedMap<K, V> extends ForwardingMap<K, V> {
36 final Map<K, V> delegate;
37 final MapConstraint<? super K, ? super V> constraint;
38 private volatile Set<Entry<K, V>> entrySet;
41 Map<K, V> delegate, MapConstraint<? super K, ? super V> constraint) { in ConstrainedMap() argument
46 @Override protected Map<K, V> delegate() { in delegate()
49 @Override public Set<Entry<K, V>> entrySet() { in entrySet()
55 @Override public V put(K key, V value) { in put()
59 @Override public void putAll(Map<? extends K, ? extends V> map) { in putAll() argument
60 for (Entry<? extends K, ? extends V> entry : map.entrySet()) { in putAll()
[all …]
DSynchronized.java611 public static <K, V> Multimap<K, V> multimap( in multimap() argument
612 Multimap<K, V> multimap, @Nullable Object mutex) { in multimap()
613 return new SynchronizedMultimap<K, V>(multimap, mutex); in multimap()
617 private static class SynchronizedMultimap<K, V> extends SynchronizedObject
618 implements Multimap<K, V> {
619 transient Set<K> keySet;
621 transient Collection<Map.Entry<K, V>> entries;
622 transient Map<K, Collection<V>> asMap;
623 transient Multiset<K> keys;
626 @Override protected Multimap<K, V> delegate() { in delegate()
[all …]
DEnumBiMap.java35 public final class EnumBiMap<K extends Enum<K>, V extends Enum<V>>
36 extends AbstractBiMap<K, V> {
37 private transient Class<K> keyType;
47 public static <K extends Enum<K>, V extends Enum<V>> EnumBiMap<K, V>
48 create(Class<K> keyType, Class<V> valueType) { in create()
49 return new EnumBiMap<K, V>(keyType, valueType); in create()
62 public static <K extends Enum<K>, V extends Enum<V>> EnumBiMap<K, V>
63 create(Map<K, V> map) { in create() argument
64 EnumBiMap<K, V> bimap = create(inferKeyType(map), inferValueType(map)); in create()
69 private EnumBiMap(Class<K> keyType, Class<V> valueType) { in EnumBiMap()
[all …]
DAbstractMultimap.java87 abstract class AbstractMultimap<K, V> implements Multimap<K, V>, Serializable {
107 private transient Map<K, Collection<V>> map;
117 protected AbstractMultimap(Map<K, Collection<V>> map) { in AbstractMultimap() argument
123 final void setMap(Map<K, Collection<V>> map) { in setMap() argument
154 Collection<V> createCollection(@Nullable K key) { in createCollection()
158 Map<K, Collection<V>> backingMap() { in backingMap()
193 public boolean put(@Nullable K key, @Nullable V value) { in put()
204 private Collection<V> getOrCreateCollection(@Nullable K key) { in getOrCreateCollection()
231 public boolean putAll(@Nullable K key, Iterable<? extends V> values) { in putAll()
253 public boolean putAll(Multimap<? extends K, ? extends V> multimap) { in putAll() argument
[all …]
DAbstractBiMap.java46 abstract class AbstractBiMap<K, V> extends ForwardingMap<K, V>
47 implements BiMap<K, V>, Serializable {
49 private transient Map<K, V> delegate;
50 private transient AbstractBiMap<V, K> inverse;
53 AbstractBiMap(Map<K, V> forward, Map<V, K> backward) { in AbstractBiMap() argument
58 private AbstractBiMap(Map<K, V> backward, AbstractBiMap<V, K> forward) { in AbstractBiMap() argument
63 @Override protected Map<K, V> delegate() { in delegate()
71 void setDelegates(Map<K, V> forward, Map<V, K> backward) { in setDelegates() argument
78 inverse = new Inverse<V, K>(backward, this); in setDelegates()
81 void setInverse(AbstractBiMap<V, K> inverse) { in setInverse()
[all …]
DEnumHashBiMap.java37 public final class EnumHashBiMap<K extends Enum<K>, V>
38 extends AbstractBiMap<K, V> {
39 private transient Class<K> keyType;
46 public static <K extends Enum<K>, V> EnumHashBiMap<K, V>
47 create(Class<K> keyType) { in create()
48 return new EnumHashBiMap<K, V>(keyType); in create()
61 public static <K extends Enum<K>, V> EnumHashBiMap<K, V>
62 create(Map<K, ? extends V> map) { in create() argument
63 EnumHashBiMap<K, V> bimap = create(EnumBiMap.inferKeyType(map)); in create()
68 private EnumHashBiMap(Class<K> keyType) { in EnumHashBiMap()
[all …]
DTreeMultimap.java72 public class TreeMultimap<K, V> extends AbstractSortedSetMultimap<K, V> {
73 private transient Comparator<? super K> keyComparator;
81 public static <K extends Comparable, V extends Comparable>
82 TreeMultimap<K, V> create() { in create()
83 return new TreeMultimap<K, V>(Ordering.natural(), Ordering.natural()); in create()
94 public static <K, V> TreeMultimap<K, V> create( in create()
95 Comparator<? super K> keyComparator, in create()
97 return new TreeMultimap<K, V>(checkNotNull(keyComparator), in create()
108 public static <K extends Comparable, V extends Comparable>
109 TreeMultimap<K, V> create(Multimap<? extends K, ? extends V> multimap) { in create() argument
[all …]
/external/icu4c/data/lang/
Debu.txt14 ak{"Kĩakan"}
15 am{"Kĩamhari"}
16 ar{"Kĩarabu"}
17 be{"Kĩmbelarusi"}
18 bg{"Kĩbulgaria"}
19 bn{"Kĩbangla"}
20 cs{"Kĩcheki"}
21 de{"Kĩnjeremani"}
22 ebu{"Kĩembu"}
23 el{"Kĩngriki"}
[all …]
Dmer.txt14 ak{"Kĩakani"}
15 am{"Kĩamarĩki"}
16 ar{"Kĩarabu"}
17 be{"Kĩbelarusi"}
18 bg{"Kĩbulugĩria"}
19 bn{"Kĩbangira"}
20 cs{"Kĩcheki"}
21 de{"Kĩnjamanĩ"}
22 el{"Kĩngiriki"}
23 en{"Kĩngeretha"}
[all …]
Dlag.txt14 ak{"Kɨakáani"}
15 am{"Kɨmʉháari"}
16 ar{"Kɨaráabu"}
17 be{"Kɨberalúusi"}
18 bg{"Kɨbulugária"}
19 bn{"Kɨbangála"}
20 cs{"Kɨchéeki"}
21 de{"Kɨjerʉmáani"}
22 el{"Kɨgiríki"}
23 en{"Kɨɨngeréesa"}
[all …]
/external/dropbear/libtomcrypt/src/ciphers/safer/
Dsaferp.c48 b[0] = (safer_ebox[(b[0] ^ skey->saferp.K[i][0]) & 255] + skey->saferp.K[i+1][0]) & 255; \
49 b[1] = safer_lbox[(b[1] + skey->saferp.K[i][1]) & 255] ^ skey->saferp.K[i+1][1]; \
50 b[2] = safer_lbox[(b[2] + skey->saferp.K[i][2]) & 255] ^ skey->saferp.K[i+1][2]; \
51 b[3] = (safer_ebox[(b[3] ^ skey->saferp.K[i][3]) & 255] + skey->saferp.K[i+1][3]) & 255; \
52 b[4] = (safer_ebox[(b[4] ^ skey->saferp.K[i][4]) & 255] + skey->saferp.K[i+1][4]) & 255; \
53 b[5] = safer_lbox[(b[5] + skey->saferp.K[i][5]) & 255] ^ skey->saferp.K[i+1][5]; \
54 b[6] = safer_lbox[(b[6] + skey->saferp.K[i][6]) & 255] ^ skey->saferp.K[i+1][6]; \
55 b[7] = (safer_ebox[(b[7] ^ skey->saferp.K[i][7]) & 255] + skey->saferp.K[i+1][7]) & 255; \
56 b[8] = (safer_ebox[(b[8] ^ skey->saferp.K[i][8]) & 255] + skey->saferp.K[i+1][8]) & 255; \
57 b[9] = safer_lbox[(b[9] + skey->saferp.K[i][9]) & 255] ^ skey->saferp.K[i+1][9]; \
[all …]
/external/dropbear/libtomcrypt/src/ciphers/
Dcast5.c447 …skey->cast5.K[i++] = S5[GB(z, 0x8)] ^ S6[GB(z, 0x9)] ^ S7[GB(z, 0x7)] ^ S8[GB(z, 0x6)] ^ S5[GB(z, … in _cast5_setup()
448 …skey->cast5.K[i++] = S5[GB(z, 0xA)] ^ S6[GB(z, 0xB)] ^ S7[GB(z, 0x5)] ^ S8[GB(z, 0x4)] ^ S6[GB(z, … in _cast5_setup()
449 …skey->cast5.K[i++] = S5[GB(z, 0xC)] ^ S6[GB(z, 0xd)] ^ S7[GB(z, 0x3)] ^ S8[GB(z, 0x2)] ^ S7[GB(z, … in _cast5_setup()
450 …skey->cast5.K[i++] = S5[GB(z, 0xE)] ^ S6[GB(z, 0xF)] ^ S7[GB(z, 0x1)] ^ S8[GB(z, 0x0)] ^ S8[GB(z, … in _cast5_setup()
456 …skey->cast5.K[i++] = S5[GB(x, 0x3)] ^ S6[GB(x, 0x2)] ^ S7[GB(x, 0xc)] ^ S8[GB(x, 0xd)] ^ S5[GB(x, … in _cast5_setup()
457 …skey->cast5.K[i++] = S5[GB(x, 0x1)] ^ S6[GB(x, 0x0)] ^ S7[GB(x, 0xe)] ^ S8[GB(x, 0xf)] ^ S6[GB(x, … in _cast5_setup()
458 …skey->cast5.K[i++] = S5[GB(x, 0x7)] ^ S6[GB(x, 0x6)] ^ S7[GB(x, 0x8)] ^ S8[GB(x, 0x9)] ^ S7[GB(x, … in _cast5_setup()
459 …skey->cast5.K[i++] = S5[GB(x, 0x5)] ^ S6[GB(x, 0x4)] ^ S7[GB(x, 0xa)] ^ S8[GB(x, 0xb)] ^ S8[GB(x, … in _cast5_setup()
466 …skey->cast5.K[i++] = S5[GB(z, 0x3)] ^ S6[GB(z, 0x2)] ^ S7[GB(z, 0xc)] ^ S8[GB(z, 0xd)] ^ S5[GB(z, … in _cast5_setup()
467 …skey->cast5.K[i++] = S5[GB(z, 0x1)] ^ S6[GB(z, 0x0)] ^ S7[GB(z, 0xe)] ^ S8[GB(z, 0xf)] ^ S6[GB(z, … in _cast5_setup()
[all …]
/external/v8/src/
Dtoken.h50 #define TOKEN_LIST(T, K, F) \ argument
116 K(INSTANCEOF, "instanceof", 10) \
117 K(IN, "in", 10) \
124 K(DELETE, "delete", 0) \
125 K(TYPEOF, "typeof", 0) \
126 K(VOID, "void", 0) \
129 K(BREAK, "break", 0) \
130 K(CASE, "case", 0) \
131 K(CATCH, "catch", 0) \
132 K(CONTINUE, "continue", 0) \
[all …]

12345678910>>...32