/dalvik/libcore/support/src/test/java/tests/support/ |
H A D | Support_MapTest2.java | 25 Map<String, String> map; field in class:Support_MapTest2 29 map = m; 30 if (!map.isEmpty()) { 38 map.put("one", "1"); 39 assertEquals("size should be one", 1, map.size()); 40 map.clear(); 41 assertEquals("size should be zero", 0, map.size()); 42 assertTrue("Should not have entries", !map.entrySet().iterator() 44 assertTrue("Should not have keys", !map.keySet().iterator() 46 assertTrue("Should not have values", !map [all...] |
H A D | Support_UnmodifiableMapTest.java | 31 Map<String, Integer> map; field in class:Support_UnmodifiableMapTest 33 // must be a map containing the string keys "0"-"99" paired with the Integer 42 map = m; 48 assertTrue("UnmodifiableMapTest - Should contain the key \"0\"", map 50 assertTrue("UnmodifiableMapTest - Should contain the key \"50\"", map 53 !map.containsKey("100")); 56 assertTrue("UnmodifiableMapTest - Should contain the value 0", map 58 assertTrue("UnmodifiableMapTest - Should contain the value 50", map 60 assertTrue("UnmodifiableMapTest - Should not contain value 100", !map 64 Set<?> entrySet = map [all...] |
/dalvik/dx/src/com/android/dx/ssa/ |
H A D | RegisterMapper.java | 41 public abstract RegisterSpec map(RegisterSpec registerSpec); method in class:RegisterMapper 48 public final RegisterSpecList map(RegisterSpecList sources) { method in class:RegisterMapper 53 newSources.set(i, map(sources.get(i)));
|
H A D | BasicRegisterMapper.java | 51 public RegisterSpec map(RegisterSpec registerSpec) { method in class:BasicRegisterMapper
|
H A D | SsaRenamer.java | 78 /** map of SSA register number to debug (local var names) or null of n/a */ 306 public RegisterSpec map(RegisterSpec registerSpec) { method in class:SsaRenamer.BlockRenamer.RenamingMapper 532 // Just map as above.
|
/dalvik/libcore/sql/src/main/java/java/sql/ |
H A D | Array.java | 63 * @param map 64 * the map defining the correspondence between SQL type names 70 public Object getArray(long index, int count, Map<String, Class<?>> map) argument 76 * @param map 77 * the map defining the correspondence between SQL type names 83 public Object getArray(Map<String, Class<?>> map) throws SQLException; argument 141 * @param map 142 * the map defining the correspondence between SQL type names 150 Map<String, Class<?>> map) throws SQLException; 156 * @param map 149 getResultSet(long index, int count, Map<String, Class<?>> map) argument 163 getResultSet(Map<String, Class<?>> map) argument [all...] |
H A D | Ref.java | 62 * @param map 69 public Object getObject(Map<String, Class<?>> map) throws SQLException; argument
|
/dalvik/libdex/ |
H A D | DexDataMap.h | 18 * Verification-time map of data section items 27 u4 count; /* number of items currently in the map */ 41 void dexDataMapFree(DexDataMap* map); 44 * Add a new element to the map. The offset must be greater than the 47 void dexDataMapAdd(DexDataMap* map, u4 offset, u2 type); 53 int dexDataMapGet(DexDataMap* map, u4 offset); 56 * Verify that there is an entry in the map, mapping the given offset to 60 bool dexDataMapVerify(DexDataMap* map, u4 offset, u2 type); 65 DEX_INLINE bool dexDataMapVerify0Ok(DexDataMap* map, u4 offset, u2 type) { argument 70 return dexDataMapVerify(map, offse [all...] |
H A D | DexDataMap.c | 18 * Verification-time map of data section items 34 DexDataMap* map = NULL; local 44 map = malloc(size); 46 if (map == NULL) { 50 map->count = 0; 51 map->max = maxCount; 52 map->offsets = (u4*) (map + 1); 53 map->types = (u2*) (map 61 dexDataMapFree(DexDataMap* map) argument 74 dexDataMapAdd(DexDataMap* map, u4 offset, u2 type) argument 94 dexDataMapGet(DexDataMap* map, u4 offset) argument 125 dexDataMapVerify(DexDataMap* map, u4 offset, u2 type) argument [all...] |
/dalvik/libcore/luni/src/main/java/org/apache/harmony/luni/util/ |
H A D | Base64.java | 125 private static final byte[] map = new byte[] field in class:Base64 138 out[index++] = map[(in[i] & 0xff) >> 2]; 139 out[index++] = map[((in[i] & 0x03) << 4) 141 out[index++] = map[((in[i+1] & 0x0f) << 2) 143 out[index++] = map[(in[i+2] & 0x3f)]; 153 out[index++] = map[(in[end] & 0xff) >> 2]; 154 out[index++] = map[(in[end] & 0x03) << 4]; 159 out[index++] = map[(in[end] & 0xff) >> 2]; 160 out[index++] = map[((in[end] & 0x03) << 4) 162 out[index++] = map[((i [all...] |
/dalvik/libcore/nio/src/main/java/org/apache/harmony/nio/internal/ |
H A D | ReadWriteFileChannel.java | 36 public final MappedByteBuffer map(MapMode mode, long position, long size) method in class:ReadWriteFileChannel
|
H A D | ReadOnlyFileChannel.java | 83 public final MappedByteBuffer map(MapMode mode, long position, long size) method in class:ReadOnlyFileChannel
|
H A D | WriteOnlyFileChannel.java | 89 public MappedByteBuffer map(MapMode mode, long position, long size) method in class:WriteOnlyFileChannel
|
/dalvik/libcore/icu/src/main/java/com/ibm/icu4jni/charset/ |
H A D | CharsetProviderICU.java | 65 * Adds an entry to the given map whose key is the charset's 67 * @param map a map to receive charset objects and names 70 public final void putCharsets(Map map) { argument 75 if (!map.containsKey(charsets[i])){ 76 map.put(charsets[i], charsetForName(charsets[i]));
|
/dalvik/libcore/luni/src/main/java/java/net/ |
H A D | AddressCache.java | 32 * This should be a power of two to avoid wasted space in our custom map. 48 private final Map<String, AddressCacheEntry> map; field in class:AddressCache 71 map = new LinkedHashMap<String, AddressCacheEntry>(0, DEFAULT_LOAD_FACTOR, true) { 74 // the map will have grown to accommodate it. Using == lets us prevent resizing. 86 synchronized (map) { 87 entry = map.get(hostname); 117 synchronized (map) { 118 map.put(hostname, new AddressCacheEntry(addresses, expiryNanos));
|
/dalvik/libcore/luni/src/main/java/java/util/ |
H A D | AbstractMap.java | 42 * Removes all elements from this map, leaving it empty. 45 * if removing from this map is not supported. 54 * Returns whether this map contains the specified key. 58 * @return {@code true} if this map contains the specified key, 80 * Returns whether this map contains the specified value. 84 * @return {@code true} if this map contains the specified value, 106 * Returns a set containing all of the mappings in this map. Each mapping is 107 * an instance of {@link Map.Entry}. As the set is backed by this map, 116 * if the specified object is a map and both maps contain the same mappings. 131 Map<?, ?> map 299 putAll(Map<? extends K, ? extends V> map) argument [all...] |
H A D | Map.java | 99 * @return {@code true} if this map contains the specified key, 109 * @return {@code true} if this map contains the specified value, 156 * Returns whether this map is empty. 158 * @return {@code true} if this map has no elements, {@code false} 198 * @param map 211 public void putAll(Map<? extends K,? extends V> map); argument 250 * @return a collection of the values contained in this map.
|
H A D | TreeSet.java | 41 private TreeSet(SortedMap<E, Object> map) { argument 42 this.backingMap = map; 377 TreeMap<E, Object> map = new TreeMap<E, Object>( 384 lastNode = map.addToLast(lastNode,elem, Boolean.TRUE); 387 backingMap = map;
|
/dalvik/libcore/luni/src/main/java/org/apache/harmony/luni/internal/net/www/protocol/http/ |
H A D | Header.java | 55 * The alternative constructor which sets the input map as its initial 58 * @param map 59 * the initial keyTable as a map 61 public Header(Map<String, List<String>> map) { argument 63 for (Entry<String, List<String>> next : map.entrySet()) { 148 * Provides an unmodifiable map with all String header names mapped to their 149 * String values. The map keys are Strings and the values are unmodifiable 152 * @return an unmodifiable map of the headers
|
/dalvik/libcore/security/src/main/java/org/apache/harmony/security/asn1/ |
H A D | ASN1Choice.java | 67 * So a custom ASN.1 Time choice type should map its notation to Date object. 238 // create map of all identifiers 239 TreeMap map = new TreeMap(); 254 addIdentifier(map, choiceToAdd[0][j], index); 261 addIdentifier(map, t.id, index); 266 addIdentifier(map, t.constrId, index); 271 int size = map.size(); 273 Iterator it = map.entrySet().iterator(); 286 private void addIdentifier(TreeMap map, int identifier, int index){ argument 287 if (map [all...] |
/dalvik/vm/analysis/ |
H A D | ReduceConstants.h | 23 #define DVM_RC_DISABLED 0 /* no reduction, 1:1 map */ 45 int origCount; /* original size; describes range of entries in map */ 47 u2* mapToNew; /* sparse map, from "orig" to "new" */ 48 u2* mapToOld; /* dense map, from "new" back to "orig" */ 52 IndexMap map[kNumIndexMaps]; member in struct:IndexMapSet 68 /* free an index map set */
|
/dalvik/libcore/nio/src/main/java/java/nio/channels/ |
H A D | FileChannel.java | 115 * @return this map mode as string. 267 * the size of the region to map into memory. 282 public abstract MappedByteBuffer map(FileChannel.MapMode mode, method in class:FileChannel
|
/dalvik/dexlist/ |
H A D | DexList.c | 200 MemMapping map; local 205 utfr = dexOpenAndMap(fileName, NULL, &map, true); 217 pDexFile = dexFileParse(map.addr, map.length, kDexParseDefault); 234 sysReleaseShmem(&map);
|
/dalvik/dx/src/com/android/dx/dex/file/ |
H A D | DexFile.java | 56 * {@code non-null;} map section. The map needs to be in a section by itself 60 private final MixedItemSection map; field in class:DexFile 121 map = new MixedItemSection("map", this, 4, SortType.NONE); 130 classData, map }; 275 * Gets the map section. 280 * @return {@code non-null;} the map section 283 return map; 413 return map; [all...] |
/dalvik/libcore/archive/src/main/java/java/util/jar/ |
H A D | Attributes.java | 41 protected Map<Object, Object> map; field in class:Attributes 271 map = new HashMap<Object, Object>(); 283 map = (Map<Object, Object>) ((HashMap) attrib.map).clone(); 294 map = new HashMap<Object, Object>(size); 301 map.clear(); 312 return map.containsKey(key); 323 return map.containsValue(value); 327 * Returns a set containing map entries for each of the key/value pair 333 return map [all...] |