| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
| TreeMapTest.java | 358 assertTrue("submap should be empty", sub.isEmpty());
386 assertTrue("submap should be empty", sub.isEmpty());
427 assertEquals(objArray[objArray.length - 2].toString(), tm.subMap("99",
445 sm = sm.subMap(firstKey, lastKey);
504 assertEquals("Returned incorrect size", 111, tm.subMap("500", "600")
507 tm.subMap("null", "600");
512 assertEquals("Returned incorrect size", 1000, tm.subMap("", "null")
517 * java.util.TreeMap#subMap(java.lang.Object, java.lang.Object)
521 // java.util.TreeMap.subMap(java.lang.Object, java.lang.Object)
522 SortedMap subMap = tm.subMap(objArray[100].toString(), objArray[109
1909 Map<String, String> submap = test_map.subMap("a", "z"); local
[all...] |
| RefSortedMap.java | 90 class SubMap extends java.util.AbstractMap<K, V>
96 SubMap(boolean hasFirst, K first, boolean hasLast, K last) {
114 int offset = SubMap.this.size() > 0 ?
115 bsearch(SubMap.this.firstKey()) - 1 :
153 int lastIdx = bsearch(SubMap.this.lastKey());
154 int firstIdx = bsearch(SubMap.this.firstKey());
192 return new SubMap(hasStart, start, true, key);
211 public SortedMap<K, V> subMap(K startKey, K endKey) {
218 return new SubMap(true, startKey, true, endKey);
225 return new SubMap(true, key, hasEnd, end)
[all...] |
| TreeMapExtendTest.java | 188 assertTrue("SubMap contains incorrect elements", subMap_default
190 assertTrue("SubMap contains incorrect elements",
192 assertTrue("SubMap contains incorrect elements",
194 assertTrue("SubMap contains incorrect elements",
196 assertTrue("SubMap contains incorrect elements",
202 assertTrue("SubMap contains incorrect elements", subMap_default
204 assertFalse("SubMap contains incorrect elements",
206 assertFalse("SubMap contains incorrect elements",
208 assertTrue("SubMap contains incorrect elements",
210 assertTrue("SubMap contains incorrect elements"
[all...] |
| SortedMapTestBase.java | 215 checkSubMap(ref.subMap(key0, key1), map.subMap(key0, key1));
220 map.subMap(0, 100);
222 map.subMap(100, 0);
|
| /external/valgrind/main/include/vki/ |
| vki-xen-version.h | 33 unsigned int submap_idx; /* IN: which 32-bit submap to return */
34 vki_uint32_t submap; /* OUT: 32-bit submap */ member in struct:vki_xen_feature_info
|
| /libcore/luni/src/test/java/libcore/java/util/ |
| TreeMapTest.java | 67 NavigableMap<String, String> subMap = map.subMap("A", true, "C", true);
69 Iterator<Entry<String, String>> iterator = subMap.entrySet().iterator();
73 assertEquals("x", subMap.get("A"));
80 assertEquals("y", subMap.get("B"));
83 assertEquals("z", subMap.get("C"));
109 assertAllEntryMethodsReturnImmutableEntries(map.subMap("A", true, "C", true));
208 map.subMap("a", "z").put(null, "b");
235 Map<Object, Object> map = new TreeMap<Object, Object>().subMap("a", "z");
314 SortedMap<String, String> subMap = map.subMap("a", "c")
[all...] |
| OldTreeMapTest.java | 395 // java.util.TreeMap.subMap(java.lang.Object, java.lang.Object)
396 SortedMap subMap = tm.subMap(objArray[100].toString(), objArray[109]
398 assertEquals("subMap is of incorrect size", 9, subMap.size());
400 assertTrue("SubMap contains incorrect elements", subMap.get(
405 tm.subMap(objArray[9].toString(), objArray[1].toString());
416 SortedMap<String, String> subMapWithNull = treeMapWithNull.subMap(null,
418 assertEquals("Size of subMap should be 1:", 1, subMapWithNull.size())
[all...] |
| /external/guava/guava-testlib/src/com/google/common/collect/testing/ |
| SortedMapInterfaceTest.java | 231 SortedMap<K, V> subMap
232 = map.subMap(list.get(i).getKey(), list.get(j).getKey());
233 assertEquals(expected, toList(subMap.entrySet()));
252 map.subMap(second, first);
316 SortedMap<K, V> subMap = map.tailMap(key);
318 subMap.put(key, value);
322 subMap.put(firstEntry.getKey(), value);
343 SortedMap<K, V> subMap = map.tailMap(key);
344 subMap.remove(key);
345 assertNull(subMap.remove(firstEntry.getKey()))
[all...] |
| NavigableMapTestSuiteBuilder.java | 60 if (!parentBuilder.getFeatures().contains(NoRecurse.SUBMAP)) {
84 SUBMAP,
94 * Two bounds (from and to) define how to build a subMap.
116 features.add(NoRecurse.SUBMAP);
160 // call the smallest subMap overload that filters out the extreme values
168 return map.subMap(firstExclusive, false, lastExclusive, false);
170 return map.subMap(firstExclusive, false, lastInclusive, true);
174 return map.subMap(firstInclusive, lastExclusive);
176 return map.subMap(firstInclusive, true, lastInclusive, true);
182 .named(parentBuilder.getName() + " subMap " + from + "-" + to
[all...] |
| SafeTreeMap.java | 211 @Override public NavigableMap<K, V> subMap(
213 return new SafeTreeMap<K, V>(delegate.subMap(
217 @Override public SortedMap<K, V> subMap(K fromKey, K toKey) {
218 return subMap(fromKey, true, toKey, false);
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| SubMapMultimapAsMapImplementsMapTest.java | 27 * Test {@code TreeMultimap.asMap().subMap()} with {@link MapInterfaceTest}.
50 return createMultimap().asMap().subMap("e", "p");
59 return multimap.asMap().subMap("e", "p");
|
| ForwardingSortedMapTest.java | 109 @Override public SortedMap<K, V> subMap(K fromKey, K toKey) {
232 forward().subMap("first", "last");
233 assertEquals("[subMap(Object,Object)]", getCalls());
|
| /external/guava/guava/src/com/google/common/collect/ |
| AbstractMultimap.java | 881 final Map<K, Collection<V>> subMap;
883 KeySet(final Map<K, Collection<V>> subMap) {
884 this.subMap = subMap;
889 return subMap;
895 = subMap.entrySet().iterator();
922 Collection<V> collection = subMap.remove(key);
937 return subMap.keySet().containsAll(c);
941 return this == object || this.subMap.keySet().equals(object);
945 return subMap.keySet().hashCode()
[all...] |
| ForwardingSortedMap.java | 85 public SortedMap<K, V> subMap(K fromKey, K toKey) {
86 return delegate().subMap(fromKey, toKey);
161 * A sensible default implementation of {@link #subMap(Object, Object)} in
163 * situations, you may wish to override {@link #subMap(Object, Object)} to
|
| StandardRowSortedTable.java | 107 sortedBackingMap().subMap(fromElement, toElement), factory)
156 public SortedMap<R, Map<C, V>> subMap(R fromKey, R toKey) {
160 sortedBackingMap().subMap(fromKey, toKey), factory).rowMap();
|
| ImmutableSortedMap.java | 643 * <p>The {@link SortedMap#headMap} documentation states that a submap of a
644 * submap throws an {@link IllegalArgumentException} if passed a {@code toKey}
669 * <p>The {@link SortedMap#subMap} documentation states that a submap of a
670 * submap throws an {@link IllegalArgumentException} if passed a {@code
678 public ImmutableSortedMap<K, V> subMap(K fromKey, K toKey) {
679 return subMap(fromKey, true, toKey, false);
682 ImmutableSortedMap<K, V> subMap(K fromKey, boolean fromInclusive, K toKey,
694 * <p>The {@link SortedMap#tailMap} documentation states that a submap of a
695 * submap throws an {@link IllegalArgumentException} if passed a {@cod
[all...] |
| /external/tremolo/Tremolo/ |
| mapping0.c | 143 int submap=0; local
147 submap=info->chmuxlist[i];
148 floorno=info->submaplist[submap].floor;
232 int submap=0; local
236 submap=info->chmuxlist[i];
237 floorno=info->submaplist[submap].floor;
|
| codec_internal.h | 165 typedef struct submap{ struct
168 } submap; typedef in typeref:struct:submap
174 submap *submaplist;
|
| /external/libvorbis/lib/ |
| mapping0.c | 95 oggpack_write(opb,0,8); /* time submap unused */
143 oggpack_read(opb,8); /* time submap unused */
378 int submap=info->chmuxlist[i]; local
506 if(ci->floor_type[info->floorsubmap[submap]]!=1)return(-1);
509 floor1_fit(vb,b->flr[info->floorsubmap[submap]],
538 floor1_fit(vb,b->flr[info->floorsubmap[submap]],
563 floor1_fit(vb,b->flr[info->floorsubmap[submap]],
571 floor1_interpolate_fit(vb,b->flr[info->floorsubmap[submap]],
577 floor1_interpolate_fit(vb,b->flr[info->floorsubmap[submap]],
622 int submap=info->chmuxlist[i] local
724 int submap=info->chmuxlist[i]; local
792 int submap=info->chmuxlist[i]; local
[all...] |
| backends.h | 135 int floorsubmap[16]; /* [mux] submap to floors */
136 int residuesubmap[16]; /* [mux] submap to residue */
|
| /external/libvorbis/doc/ |
| 01-introduction.tex | 176 components; the submap list is internal and specific to a mapping.
178 A 'submap' is a configuration/grouping that applies to a subset of
179 floor and residue vectors within a mapping. The submap functions as a
182 but also specific vectors in a specific mode. Each submap specifies
184 submap's spectral floor and spectral residue vectors.
194 In this example, channels 0-4 belong to submap 0 (which indicates use
195 of a full-range floor) and channel 5 belongs to submap 1, which uses a
391 belongs to a 'submap' that specifies which floor configuration to
404 Vorbis codes residue vectors in groups by submap; the coding is done
405 in submap order from submap 0 through n-1. This differs from floor
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| TreeMap.java | 697 public NavigableMap<K, V> subMap(K from, boolean fromInclusive, K to, boolean toInclusive) {
703 public SortedMap<K, V> subMap(K fromInclusive, K toExclusive) {
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentSkipListMap.java | 652 * fence are null. Needed mainly in submap operations.
663 * or equal to fence. Needed mainly in submap operations.
[all...] |
| ConcurrentNavigableMap.java | 31 ConcurrentNavigableMap<K,V> subMap(K fromKey, boolean fromInclusive,
53 ConcurrentNavigableMap<K,V> subMap(K fromKey, K toKey);
|
| /system/core/libbacktrace/ |
| BacktraceMap.cpp | 103 char cmd[sizeof(pid_t)*3 + sizeof("vmmap -w -resident -submap -allSplitLibs -interleaved ") + 1];
111 snprintf(cmd, sizeof(cmd), "vmmap -w -resident -submap -allSplitLibs -interleaved %d", pid_);
|
