| /external/kernel-headers/original/uapi/linux/ |
| D | keyboard.h | 44 #define K(t,v) (((t)<<8)|(v)) macro
48 #define K_F1 K(KT_FN,0)
49 #define K_F2 K(KT_FN,1)
50 #define K_F3 K(KT_FN,2)
51 #define K_F4 K(KT_FN,3)
52 #define K_F5 K(KT_FN,4)
53 #define K_F6 K(KT_FN,5)
54 #define K_F7 K(KT_FN,6)
55 #define K_F8 K(KT_FN,7)
56 #define K_F9 K(KT_FN,8)
[all …]
|
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| D | ImmutableSortedMap.java | 36 public class ImmutableSortedMap<K, V>
37 extends ImmutableMap<K, V> implements SortedMap<K, V> {
54 private Comparator<K> unusedComparatorForSerialization;
55 private K unusedKeyForSerialization;
58 private transient final SortedMap<K, V> sortedDelegate;
63 private transient final Comparator<K> comparator;
68 ImmutableSortedMap(SortedMap<K, ? extends V> delegate) { in ImmutableSortedMap() argument
75 private static <K, V> ImmutableSortedMap<K, V> create( in create()
76 Comparator<? super K> comparator, in create()
77 Entry<? extends K, ? extends V>... entries) { in create() argument
[all …]
|
| D | ImmutableBiMap.java | 27 public abstract class ImmutableBiMap<K, V> extends ImmutableMap<K,V>
28 implements BiMap<K, V> {
35 public static <K, V> ImmutableBiMap<K, V> of() { in of()
36 return (ImmutableBiMap<K, V>) EMPTY_IMMUTABLE_BIMAP; in of()
39 public static <K, V> ImmutableBiMap<K, V> of(K k1, V v1) { in of()
40 return new RegularImmutableBiMap<K, V>(ImmutableMap.of(k1, v1)); in of()
43 public static <K, V> ImmutableBiMap<K, V> of(K k1, V v1, K k2, V v2) { in of()
44 return new RegularImmutableBiMap<K, V>(ImmutableMap.of(k1, v1, k2, v2)); in of()
47 public static <K, V> ImmutableBiMap<K, V> of( in of()
48 K k1, V v1, K k2, V v2, K k3, V v3) { in of()
[all …]
|
| D | Maps.java | 81 public static <K, V> HashMap<K, V> newHashMap() { in newHashMap()
82 return new HashMap<K, V>(); in newHashMap()
98 public static <K, V> HashMap<K, V> newHashMapWithExpectedSize( in newHashMapWithExpectedSize()
100 return new HashMap<K, V>(capacity(expectedSize)); in newHashMapWithExpectedSize()
133 public static <K, V> HashMap<K, V> newHashMap( in newHashMap()
134 Map<? extends K, ? extends V> map) { in newHashMap() argument
135 return new HashMap<K, V>(map); in newHashMap()
147 public static <K, V> LinkedHashMap<K, V> newLinkedHashMap() { in newLinkedHashMap()
148 return new LinkedHashMap<K, V>(); in newLinkedHashMap()
162 public static <K, V> LinkedHashMap<K, V> newLinkedHashMap( in newLinkedHashMap()
[all …]
|
| D | ImmutableMap.java | 41 public abstract class ImmutableMap<K, V> implements Map<K, V>, Serializable {
43 private transient final Map<K, V> delegate;
49 ImmutableMap(Map<? extends K, ? extends V> delegate) { in ImmutableMap() argument
54 ImmutableMap(Entry<? extends K, ? extends V>... entries) { in ImmutableMap() argument
55 Map<K, V> delegate = Maps.newLinkedHashMap(); in ImmutableMap()
56 for (Entry<? extends K, ? extends V> entry : entries) { in ImmutableMap()
57 K key = checkNotNull(entry.getKey()); in ImmutableMap()
68 public static <K, V> ImmutableMap<K, V> of() { in of()
69 return (ImmutableMap<K, V>) EmptyImmutableMap.INSTANCE; in of()
72 public static <K, V> ImmutableMap<K, V> of(K k1, V v1) { in of()
[all …]
|
| D | ImmutableSetMultimap.java | 53 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()
61 return (ImmutableSetMultimap<K, V>) EmptyImmutableSetMultimap.INSTANCE; in of()
67 public static <K, V> ImmutableSetMultimap<K, V> of(K k1, V v1) { in of()
68 ImmutableSetMultimap.Builder<K, V> builder = ImmutableSetMultimap.builder(); in of()
78 public static <K, V> ImmutableSetMultimap<K, V> of(K k1, V v1, K k2, V v2) { in of()
79 ImmutableSetMultimap.Builder<K, V> builder = ImmutableSetMultimap.builder(); in of()
90 public static <K, V> ImmutableSetMultimap<K, V> of( in of()
[all …]
|
| D | ImmutableListMultimap.java | 48 public class ImmutableListMultimap<K, V>
49 extends ImmutableMultimap<K, V>
50 implements ListMultimap<K, V> {
55 public static <K, V> ImmutableListMultimap<K, V> of() { in of()
56 return (ImmutableListMultimap<K, V>) EmptyImmutableListMultimap.INSTANCE; in of()
62 public static <K, V> ImmutableListMultimap<K, V> of(K k1, V v1) { in of()
63 ImmutableListMultimap.Builder<K, V> builder in of()
72 public static <K, V> ImmutableListMultimap<K, V> of(K k1, V v1, K k2, V v2) { in of()
73 ImmutableListMultimap.Builder<K, V> builder in of()
83 public static <K, V> ImmutableListMultimap<K, V> of( in of()
[all …]
|
| /external/eigen/lapack/ |
| D | dlarfb.f | 195 SUBROUTINE DLARFB( SIDE, TRANS, DIRECT, STOREV, M, N, K, V, LDV, argument
205 INTEGER K, LDC, LDT, LDV, LDWORK, M, N local
256 LASTV = MAX( K, ILADLR( M, K, V, LDV ) )
263 DO 10 J = 1, K
270 $ LASTC, K, ONE, V, LDV, WORK, LDWORK )
271 IF( LASTV.GT.K ) THEN
276 $ LASTC, K, LASTV-K,
277 $ ONE, C( K+1, 1 ), LDC, V( K+1, 1 ), LDV,
284 $ LASTC, K, ONE, T, LDT, WORK, LDWORK )
288 IF( LASTV.GT.K ) THEN
[all …]
|
| D | slarfb.f | 195 SUBROUTINE SLARFB( SIDE, TRANS, DIRECT, STOREV, M, N, K, V, LDV, argument
205 INTEGER K, LDC, LDT, LDV, LDWORK, M, N local
256 LASTV = MAX( K, ILASLR( M, K, V, LDV ) )
263 DO 10 J = 1, K
270 $ LASTC, K, ONE, V, LDV, WORK, LDWORK )
271 IF( LASTV.GT.K ) THEN
276 $ LASTC, K, LASTV-K,
277 $ ONE, C( K+1, 1 ), LDC, V( K+1, 1 ), LDV,
284 $ LASTC, K, ONE, T, LDT, WORK, LDWORK )
288 IF( LASTV.GT.K ) THEN
[all …]
|
| D | zlarfb.f | 195 SUBROUTINE ZLARFB( SIDE, TRANS, DIRECT, STOREV, M, N, K, V, LDV, argument
205 INTEGER K, LDC, LDT, LDV, LDWORK, M, N local
259 LASTV = MAX( K, ILAZLR( M, K, V, LDV ) )
266 DO 10 J = 1, K
274 $ LASTC, K, ONE, V, LDV, WORK, LDWORK )
275 IF( LASTV.GT.K ) THEN
280 $ LASTC, K, LASTV-K, ONE, C( K+1, 1 ), LDC,
281 $ V( K+1, 1 ), LDV, ONE, WORK, LDWORK )
287 $ LASTC, K, ONE, T, LDT, WORK, LDWORK )
291 IF( M.GT.K ) THEN
[all …]
|
| D | clarfb.f | 195 SUBROUTINE CLARFB( SIDE, TRANS, DIRECT, STOREV, M, N, K, V, LDV, argument
205 INTEGER K, LDC, LDT, LDV, LDWORK, M, N local
259 LASTV = MAX( K, ILACLR( M, K, V, LDV ) )
266 DO 10 J = 1, K
274 $ LASTC, K, ONE, V, LDV, WORK, LDWORK )
275 IF( LASTV.GT.K ) THEN
280 $ LASTC, K, LASTV-K, ONE, C( K+1, 1 ), LDC,
281 $ V( K+1, 1 ), LDV, ONE, WORK, LDWORK )
287 $ LASTC, K, ONE, T, LDT, WORK, LDWORK )
291 IF( M.GT.K ) THEN
[all …]
|
| /external/icu/icu4c/source/data/lang/ |
| D | ebu.txt | 14 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 …]
|
| D | mer.txt | 14 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 …]
|
| D | lag.txt | 14 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/chromium_org/third_party/icu/source/data/lang/ |
| D | ebu.txt | 14 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 …]
|
| D | mer.txt | 14 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 …]
|
| D | lag.txt | 14 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/guava/guava/src/com/google/common/collect/ |
| D | Maps.java | 84 public static <K, V> HashMap<K, V> newHashMap() { in newHashMap()
85 return new HashMap<K, V>(); in newHashMap()
101 public static <K, V> HashMap<K, V> newHashMapWithExpectedSize( in newHashMapWithExpectedSize()
103 return new HashMap<K, V>(capacity(expectedSize)); in newHashMapWithExpectedSize()
136 public static <K, V> HashMap<K, V> newHashMap( in newHashMap()
137 Map<? extends K, ? extends V> map) { in newHashMap() argument
138 return new HashMap<K, V>(map); in newHashMap()
150 public static <K, V> LinkedHashMap<K, V> newLinkedHashMap() { in newLinkedHashMap()
151 return new LinkedHashMap<K, V>(); in newLinkedHashMap()
165 public static <K, V> LinkedHashMap<K, V> newLinkedHashMap( in newLinkedHashMap()
[all …]
|
| D | ImmutableSortedMap.java | 61 public class ImmutableSortedMap<K, V>
62 extends ImmutableSortedMapFauxverideShim<K, V> implements SortedMap<K, V> {
85 public static <K, V> ImmutableSortedMap<K, V> of() { in of()
86 return (ImmutableSortedMap<K, V>) NATURAL_EMPTY_MAP; in of()
90 private static <K, V> ImmutableSortedMap<K, V> emptyMap( in emptyMap()
91 Comparator<? super K> comparator) { in emptyMap()
93 return (ImmutableSortedMap<K, V>) NATURAL_EMPTY_MAP; in emptyMap()
95 return new ImmutableSortedMap<K, V>( in emptyMap()
96 ImmutableList.<Entry<K, V>>of(), comparator); in emptyMap()
103 public static <K extends Comparable<? super K>, V>
[all …]
|
| D | MapConstraints.java | 83 public static <K, V> Map<K, V> constrainedMap( in constrainedMap() argument
84 Map<K, V> map, MapConstraint<? super K, ? super V> constraint) { in constrainedMap() argument
85 return new ConstrainedMap<K, V>(map, constraint); in constrainedMap()
104 public static <K, V> Multimap<K, V> constrainedMultimap( in constrainedMultimap() argument
105 Multimap<K, V> multimap, MapConstraint<? super K, ? super V> constraint) { in constrainedMultimap() argument
106 return new ConstrainedMultimap<K, V>(multimap, constraint); in constrainedMultimap()
125 public static <K, V> ListMultimap<K, V> constrainedListMultimap( in constrainedListMultimap() argument
126 ListMultimap<K, V> multimap, in constrainedListMultimap()
127 MapConstraint<? super K, ? super V> constraint) { in constrainedListMultimap() argument
128 return new ConstrainedListMultimap<K, V>(multimap, constraint); in constrainedListMultimap()
[all …]
|
| D | MapMakerInternalMap.java | 72 class MapMakerInternalMap<K, V>
73 extends AbstractMap<K, V> implements ConcurrentMap<K, V>, Serializable {
151 final transient Segment<K, V>[] segments;
179 final Queue<RemovalNotification<K, V>> removalNotificationQueue;
185 final RemovalListener<K, V> removalListener;
214 ? MapMakerInternalMap.<RemovalNotification<K, V>>discardingQueue() in MapMakerInternalMap()
215 : new ConcurrentLinkedQueue<RemovalNotification<K, V>>(); in MapMakerInternalMap()
298 <K, V> ValueReference<K, V> referenceValue( in referenceValue()
299 Segment<K, V> segment, ReferenceEntry<K, V> entry, V value) { in referenceValue() argument
300 return new StrongValueReference<K, V>(value); in referenceValue()
[all …]
|
| D | SortedMaps.java | 89 @Deprecated public static <K, V1, V2> SortedMap<K, V2> transformValues( in transformValues() argument
90 SortedMap<K, V1> fromMap, final Function<? super V1, V2> function) { in transformValues()
146 @Deprecated public static <K, V1, V2> SortedMap<K, V2> transformEntries( in transformEntries()
147 final SortedMap<K, V1> fromMap, in transformEntries() argument
148 EntryTransformer<? super K, ? super V1, V2> transformer) { in transformEntries() argument
171 @Deprecated public static <K, V> SortedMapDifference<K, V> difference( in difference()
172 SortedMap<K, ? extends V> left, Map<? extends K, ? extends V> right) { in difference() argument
219 public static <K, V> SortedMap<K, V> filterKeys( in filterKeys() argument
220 SortedMap<K, V> unfiltered, final Predicate<? super K> keyPredicate) { in filterKeys()
224 Predicate<Entry<K, V>> entryPredicate = new Predicate<Entry<K, V>>() { in filterKeys()
[all …]
|
| D | ImmutableBiMap.java | 43 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 …]
|
| /external/openfst/src/include/fst/ |
| D | sparse-power-weight.h | 36 template<class W, class K>
38 W Map(const K& k, const W& v1, const W& v2) const { in Map()
43 template<class W, class K>
45 W Map(const K& k, const W& v1, const W& v2) const { in Map()
50 template<class W, class K>
55 W Map(const K& k, const W& v1, const W& v2) const { in Map()
61 template<class W, class K>
64 W Map(const K& k, const W& v1, const W& v2) const { in Map()
79 template <class W, class K = int>
80 class SparsePowerWeight : public SparseTupleWeight<W, K> {
[all …]
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/ |
| D | SafeTreeMap.java | 36 public final class SafeTreeMap<K, V>
37 implements Serializable, NavigableMap<K, V> {
44 private final NavigableMap<K, V> delegate;
47 this(new TreeMap<K, V>()); in SafeTreeMap()
50 public SafeTreeMap(Comparator<? super K> comparator) { in SafeTreeMap()
51 this(new TreeMap<K, V>(comparator)); in SafeTreeMap()
54 public SafeTreeMap(Map<? extends K, ? extends V> map) { in SafeTreeMap() argument
55 this(new TreeMap<K, V>(map)); in SafeTreeMap()
58 public SafeTreeMap(SortedMap<K, ? extends V> map) { in SafeTreeMap() argument
59 this(new TreeMap<K, V>(map)); in SafeTreeMap()
[all …]
|