/frameworks/base/core/java/android/util/ |
H A D | LongSparseArray.java | 38 * as deleted. The entry can then be re-used for the same key, or compacted later in 98 * Gets the Object mapped from the specified key, or <code>null</code> 101 public E get(long key) { argument 102 return get(key, null); 106 * Gets the Object mapped from the specified key, or the specified Object 110 public E get(long key, E valueIfKeyNotFound) { argument 111 int i = ContainerHelpers.binarySearch(mKeys, mSize, key); 121 * Removes the mapping from the specified key, if there was any. 123 public void delete(long key) { argument 124 int i = ContainerHelpers.binarySearch(mKeys, mSize, key); 137 remove(long key) argument 184 put(long key, E value) argument 299 indexOfKey(long key) argument 346 append(long key, E value) argument [all...] |
H A D | SparseArray.java | 38 * as deleted. The entry can then be re-used for the same key, or compacted later in 98 * Gets the Object mapped from the specified key, or <code>null</code> 101 public E get(int key) { argument 102 return get(key, null); 106 * Gets the Object mapped from the specified key, or the specified Object 110 public E get(int key, E valueIfKeyNotFound) { argument 111 int i = ContainerHelpers.binarySearch(mKeys, mSize, key); 121 * Removes the mapping from the specified key, if there was any. 123 public void delete(int key) { argument 124 int i = ContainerHelpers.binarySearch(mKeys, mSize, key); 137 remove(int key) argument 197 put(int key, E value) argument 312 indexOfKey(int key) argument 361 append(int key, E value) argument [all...] |
/frameworks/support/v4/java/android/support/v4/util/ |
H A D | LongSparseArray.java | 38 * as deleted. The entry can then be re-used for the same key, or compacted later in 92 * Gets the Object mapped from the specified key, or <code>null</code> 95 public E get(long key) { argument 96 return get(key, null); 100 * Gets the Object mapped from the specified key, or the specified Object 104 public E get(long key, E valueIfKeyNotFound) { argument 105 int i = ContainerHelpers.binarySearch(mKeys, mSize, key); 115 * Removes the mapping from the specified key, if there was any. 117 public void delete(long key) { argument 118 int i = ContainerHelpers.binarySearch(mKeys, mSize, key); 131 remove(long key) argument 178 put(long key, E value) argument 282 indexOfKey(long key) argument 329 append(long key, E value) argument [all...] |
H A D | SparseArrayCompat.java | 72 * Gets the Object mapped from the specified key, or <code>null</code> 75 public E get(int key) { argument 76 return get(key, null); 80 * Gets the Object mapped from the specified key, or the specified Object 84 public E get(int key, E valueIfKeyNotFound) { argument 85 int i = ContainerHelpers.binarySearch(mKeys, mSize, key); 95 * Removes the mapping from the specified key, if there was any. 97 public void delete(int key) { argument 98 int i = ContainerHelpers.binarySearch(mKeys, mSize, key); 111 public void remove(int key) { argument 171 put(int key, E value) argument 275 indexOfKey(int key) argument 324 append(int key, E value) argument [all...] |
H A D | ArrayMap.java | 24 * ArrayMap is a generic key->value mapping data structure that is 29 * codes for each item, and an Object array of the key/value pairs. This allows it to 85 protected int colIndexOfKey(Object key) { 86 return key == null ? indexOfNull() : indexOf(key, key.hashCode()); 100 protected void colPut(K key, V value) { 101 put(key, value); 126 * @return Returns true if this array map contains a key for every entry 134 * Perform a {@link #put(Object, Object)} of all key/valu [all...] |
/frameworks/base/core/jni/ |
H A D | android_os_SystemProperties.cpp | 34 const char* key; local 39 jniThrowNullPointerException(env, "key must not be null."); 43 key = env->GetStringUTFChars(keyJ, NULL); 45 len = property_get(key, buf, ""); 54 env->ReleaseStringUTFChars(keyJ, key); 70 const char* key; local 76 jniThrowNullPointerException(env, "key must not be null."); 80 key = env->GetStringUTFChars(keyJ, NULL); 82 len = property_get(key, buf, ""); 90 env->ReleaseStringUTFChars(keyJ, key); 100 const char* key; local 130 const char* key; local 166 const char* key; local [all...] |
/frameworks/base/core/java/android/app/backup/ |
H A D | AbsoluteFileBackupHelper.java | 68 String key = data.getKey(); 69 if (isKeyInList(key, mFiles)) { 70 File f = new File(key);
|
H A D | SharedPreferencesBackupHelper.java | 122 String key = data.getKey(); 123 if (DEBUG) Log.d(TAG, "got entity '" + key + "' size=" + data.size()); 125 if (isKeyInList(key, mPrefGroups)) { 126 File f = context.getSharedPrefsFile(key).getAbsoluteFile();
|
/frameworks/base/packages/SystemUI/src/com/android/systemui/statusbar/ |
H A D | NotificationData.java | 34 public IBinder key; field in class:NotificationData.Entry 44 public Entry(IBinder key, StatusBarNotification n, StatusBarIconView ic) { argument 45 this.key = key; 92 public Entry findByKey(IBinder key) { argument 94 if (e.key == key) { 113 public int add(IBinder key, StatusBarNotification notification, ExpandableNotificationRow row, argument 116 entry.key = key; 126 remove(IBinder key) argument [all...] |
/frameworks/base/services/java/com/android/server/net/ |
H A D | NetworkStatsCollection.java | 57 * Collection of {@link NetworkStatsHistory}, stored based on combined key of 149 final Key key = entry.getKey(); 150 final boolean setMatches = set == SET_ALL || key.set == set; 151 if (key.uid == uid && setMatches && key.tag == tag 152 && templateMatches(template, key.ident)) { 174 final Key key = mapEntry.getKey(); 175 if (templateMatches(template, key.ident)) { 180 entry.uid = key.uid; 181 entry.set = key 211 recordHistory(Key key, NetworkStatsHistory history) argument [all...] |
/frameworks/ml/bordeaux/service/src/android/bordeaux/services/ |
H A D | StringString.java | 7 public String key; field in class:StringString 33 out.writeString(key); 38 key = in.readString();
|
H A D | IPredictor.aidl | 22 boolean setPredictorParameter(in String key, in String value);
|
/frameworks/av/include/drm/ |
H A D | DrmConstraints.h | 68 * Iterator for key 119 String8 key = keyIt.next(); local 120 const char* value = this->getAsByteArray(&key); 137 * Adds constraint information as <key, value> pair to this instance 139 * @param[in] key Key to add 143 status_t put(const String8* key, const char* value); 146 * Retrieves the value of given key 148 * @param key Key whose value to be retrieved 151 String8 get(const String8& key) const; 154 * Retrieves the value as byte array of given key [all...] |
/frameworks/webview/chromium/tools/ |
H A D | memreport.py | 89 for key in mem_usage: 91 if (key+'=') in token: 93 if key != 'shared_app': 94 mem_usage[key] += int(field) 98 mem_usage[key] += float(array[i]) / (i + 2) 131 _DumpCSV(_CollectMemoryStats(sys.stdin, [value for (key, value) in _ENTRIES]))
|
/frameworks/base/core/java/android/text/ |
H A D | Annotation.java | 22 * Annotations are simple key-value pairs that are preserved across 30 public Annotation(String key, String value) { argument 31 mKey = key;
|
/frameworks/base/core/tests/coretests/src/android/util/ |
H A D | LongSparseLongArrayTest.java | 82 final long key = r.nextLong(); 84 map.put(key, value); 85 array.put(key, value); 89 final long key = getKeyAtIndex(map, index); 90 map.remove(key); 91 array.delete(key); 98 final long key = e.getKey(); 100 assertEquals(value, array.get(key));
|
/frameworks/base/media/mca/filterfw/native/base/ |
H A D | utilities.h | 58 // Given an STL container consisting of (key, value) pairs, STLDeleteValues 71 // If the key is present a const pointer to the associated value is returned, 76 const typename Collection::value_type::first_type& key) { 77 typename Collection::const_iterator it = collection.find(key); 123 // If the key is present a const pointer to the associated value is returned, 125 // This function does not distinguish between a missing key and a key mapped 130 const typename Collection::value_type::first_type& key) { 131 typename Collection::const_iterator it = collection.find(key); 138 // Test to see if a set, map, hash_set or hash_map contains a particular key 75 FindOrNull(const Collection& collection, const typename Collection::value_type::first_type& key) argument 129 FindPtrOrNull(const Collection& collection, const typename Collection::value_type::first_type& key) argument 141 ContainsKey(const Collection& collection, const Key& key) argument 150 InsertIfNotPresent(Collection * const collection, const Key& key, const Value& value) argument [all...] |
/frameworks/base/media/mca/filterpacks/native/base/ |
H A D | utilities.h | 58 // Given an STL container consisting of (key, value) pairs, STLDeleteValues 71 // If the key is present a const pointer to the associated value is returned, 76 const typename Collection::value_type::first_type& key) { 77 typename Collection::const_iterator it = collection.find(key); 123 // If the key is present a const pointer to the associated value is returned, 125 // This function does not distinguish between a missing key and a key mapped 130 const typename Collection::value_type::first_type& key) { 131 typename Collection::const_iterator it = collection.find(key); 138 // Test to see if a set, map, hash_set or hash_map contains a particular key 75 FindOrNull(const Collection& collection, const typename Collection::value_type::first_type& key) argument 129 FindPtrOrNull(const Collection& collection, const typename Collection::value_type::first_type& key) argument 141 ContainsKey(const Collection& collection, const Key& key) argument 150 InsertIfNotPresent(Collection * const collection, const Key& key, const Value& value) argument [all...] |
/frameworks/base/services/tests/servicestests/src/com/android/server/content/ |
H A D | SyncOperationTest.java | 106 assertEquals(op1.key, op2.key); 107 assertNotSame(op1.key, op3.key); 108 assertNotSame(op1.key, op4.key); 109 assertNotSame(op1.key, op5.key);
|
/frameworks/compile/mclinker/include/mcld/ADT/ |
H A D | StringEntry.h | 36 key_type key() function in class:mcld::StringEntry 39 const key_type key() const function in class:mcld::StringEntry 58 { return (0 == key().compare(pX)); } 61 { return (0 == key().compare(pX)); } 86 key_type key() function in class:mcld::StringEntry 89 const key_type key() const function in class:mcld::StringEntry 112 { return (0 == key().compare(pX)); } 115 { return (0 == key().compare(pX)); }
|
/frameworks/base/cmds/requestsync/src/com/android/commands/requestsync/ |
H A D | RequestSync.java | 78 for (String key : mExtras.keySet()) { 79 System.out.printf(" %s: %s\n", key, mExtras.get(key)); 118 final String key = nextArgRequired(); 120 mExtras.putString(key, value); 122 final String key = nextArgRequired(); 123 mExtras.putString(key, null); 125 final String key = nextArgRequired(); 127 mExtras.putInt(key, Integer.valueOf(value)); 129 final String key [all...] |
/frameworks/base/core/java/android/content/ |
H A D | RestrictionEntry.java | 81 /** The unique key that identifies the restriction. */ 82 private String key; field in class:RestrictionEntry 107 * @param key the unique key for this restriction 110 public RestrictionEntry(String key, String selectedString) { argument 111 this.key = key; 118 * @param key the unique key for this restriction 121 public RestrictionEntry(String key, boolea argument 132 RestrictionEntry(String key, String[] selectedStrings) argument [all...] |
/frameworks/opt/mms/src/java/com/google/android/mms/util/ |
H A D | PduCache.java | 163 private PduCacheEntry purgeSingleEntry(Uri key) { argument 164 mUpdating.remove(key); 165 PduCacheEntry entry = super.purge(key); 167 removeFromThreads(key, entry); 168 removeFromMessageBoxes(key, entry); 185 * @return Uri The normalized key of cached entry. 220 for (Uri key : msgBox) { 221 mUpdating.remove(key); 222 PduCacheEntry entry = super.purge(key); 224 removeFromThreads(key, entr 231 removeFromThreads(Uri key, PduCacheEntry entry) argument 255 removeFromMessageBoxes(Uri key, PduCacheEntry entry) argument [all...] |
/frameworks/base/core/java/android/app/ |
H A D | SharedPreferencesImpl.java | 221 public String getString(String key, String defValue) { argument 224 String v = (String)mMap.get(key); 229 public Set<String> getStringSet(String key, Set<String> defValues) { argument 232 Set<String> v = (Set<String>) mMap.get(key); 237 public int getInt(String key, int defValue) { argument 240 Integer v = (Integer)mMap.get(key); 244 public long getLong(String key, long defValue) { argument 247 Long v = (Long)mMap.get(key); 251 public float getFloat(String key, float defValue) { argument 254 Float v = (Float)mMap.get(key); 258 getBoolean(String key, boolean defValue) argument 266 contains(String key) argument 307 putString(String key, String value) argument 313 putStringSet(String key, Set<String> values) argument 320 putInt(String key, int value) argument 326 putLong(String key, long value) argument 332 putFloat(String key, float value) argument 338 putBoolean(String key, boolean value) argument 345 remove(String key) argument [all...] |
/frameworks/base/media/java/android/media/ |
H A D | TimedText.java | 422 Log.w(TAG, "Invalid timed text key found: " + type); 427 int key = parcel.readInt(); 428 if (!isValidKey(key)) { 429 Log.w(TAG, "Invalid timed text key found: " + key); 435 switch (key) { 517 if (mKeyObjectMap.containsKey(key)) { 518 mKeyObjectMap.remove(key); 521 mKeyObjectMap.put(key, object); 542 int key 690 isValidKey(final int key) argument 704 containsKey(final int key) argument 727 getObject(final int key) argument [all...] |