| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/profile/ |
| map.h | 1 // Profiling map implementation -*- C++ -*-
24 /** @file profile/map.h
38 /// Class std::map wrapper with performance instrumentation.
41 class map class in namespace:__profile
42 : public _GLIBCXX_STD_C::map<_Key, _Tp, _Compare, _Allocator>
44 typedef _GLIBCXX_STD_C::map<_Key, _Tp, _Compare, _Allocator> _Base;
67 map(const _Compare& __comp = _Compare(), function in class:__profile::map
73 map(_InputIterator __first, _InputIterator __last, function in class:__profile::map
79 map(const map& __x function in class:__profile::map
83 map(const _Base& __x) function in class:__profile::map
93 map(initializer_list<value_type> __l, function in class:__profile::map
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/profile/ |
| map.h | 1 // Profiling map implementation -*- C++ -*-
30 /** @file profile/map.h
44 /// Class std::map wrapper with performance instrumentation.
47 class map class in namespace:__profile
48 : public _GLIBCXX_STD_C::map<_Key, _Tp, _Compare, _Allocator>
50 typedef _GLIBCXX_STD_C::map<_Key, _Tp, _Compare, _Allocator> _Base;
73 map(const _Compare& __comp = _Compare(), function in class:__profile::map
79 map(_InputIterator __first, _InputIterator __last, function in class:__profile::map
85 map(const map& __x function in class:__profile::map
89 map(const _Base& __x) function in class:__profile::map
94 map(map&& __x) function in class:__profile::map
98 map(initializer_list<value_type> __l, function in class:__profile::map
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/profile/ |
| map.h | 1 // Profiling map implementation -*- C++ -*-
24 /** @file profile/map.h
38 /// Class std::map wrapper with performance instrumentation.
41 class map class in namespace:__profile
42 : public _GLIBCXX_STD_C::map<_Key, _Tp, _Compare, _Allocator>
44 typedef _GLIBCXX_STD_C::map<_Key, _Tp, _Compare, _Allocator> _Base;
67 map(const _Compare& __comp = _Compare(), function in class:__profile::map
73 map(_InputIterator __first, _InputIterator __last, function in class:__profile::map
79 map(const map& __x function in class:__profile::map
83 map(const _Base& __x) function in class:__profile::map
93 map(initializer_list<value_type> __l, function in class:__profile::map
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| asyncore.py | 125 def poll(timeout=0.0, map=None):
126 if map is None:
127 map = socket_map
128 if map:
130 for fd, obj in map.items():
153 obj = map.get(fd)
159 obj = map.get(fd)
165 obj = map.get(fd)
170 def poll2(timeout=0.0, map=None):
172 if map is None
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| asyncore.py | 125 def poll(timeout=0.0, map=None):
126 if map is None:
127 map = socket_map
128 if map:
130 for fd, obj in map.items():
153 obj = map.get(fd)
159 obj = map.get(fd)
165 obj = map.get(fd)
170 def poll2(timeout=0.0, map=None):
172 if map is None
[all...] |
| /external/smack/src/com/kenai/jbosh/ |
| ComposableBody.java | 21 import java.util.Map;
65 * Map of all attributes to their values.
67 private final Map<BodyQName, String> attrs;
88 private Map<BodyQName, String> map; field in class:ComposableBody.Builder
110 result.map = source.getAttributes();
141 if (map == null) {
142 map = new HashMap<BodyQName, String>();
144 map = new HashMap<BodyQName, String>(map);
[all...] |
| /frameworks/base/core/java/android/util/ |
| LruCache.java | 20 import java.util.Map;
63 private final LinkedHashMap<K, V> map; field in class:LruCache
85 this.map = new LinkedHashMap<K, V>(0, 0.75f, true);
118 mapValue = map.get(key);
127 * Attempt to create a value. This may take a long time, and the map
129 * added to the map while create() was working, we leave that value in
130 * the map and release the created value.
140 mapValue = map.put(key, createdValue);
144 map.put(key, mapValue);
174 previous = map.put(key, value)
[all...] |
| /frameworks/base/tools/layoutlib/bridge/src/android/util/ |
| LruCache.java | 20 import java.util.Map;
67 private final LinkedHashMap<K, V> map; field in class:LruCache
89 this.map = new LinkedHashMap<K, V>(0, 0.75f, true);
122 mapValue = map.get(key);
131 * Attempt to create a value. This may take a long time, and the map
133 * added to the map while create() was working, we leave that value in
134 * the map and release the created value.
144 mapValue = map.put(key, createdValue);
148 map.put(key, mapValue);
178 previous = map.put(key, value)
[all...] |
| /system/core/libutils/ |
| PropertyMap.cpp | 112 void PropertyMap::addAll(const PropertyMap* map) {
113 for (size_t i = 0; i < map->mProperties.size(); i++) {
114 mProperties.add(map->mProperties.keyAt(i), map->mProperties.valueAt(i));
126 PropertyMap* map = new PropertyMap(); local
127 if (!map) {
128 ALOGE("Error allocating property map.");
134 Parser parser(map, tokenizer);
143 delete map;
145 *outMap = map;
[all...] |
| /system/core/toolbox/ |
| readtty.c | 13 } map[] = { variable in typeref:struct:__anon62822
30 for(i = 0; i < sizeof(map) / sizeof(map[0]); i++) {
31 if(key == map[i].key) {
32 next = strchr(map[i].chars, current);
35 return map[i].chars[1];
45 for(i = 0; i < sizeof(map) / sizeof(map[0]); i++) {
46 if(key == map[i].key) {
47 next = strchr(map[i].chars+1, current)
[all...] |
| /external/chromium_org/third_party/harfbuzz-ng/src/ |
| hb-ot-map-private.hh | 81 const feature_map_t *map = features.bsearch (&feature_tag); local
82 if (shift) *shift = map ? map->shift : 0;
83 return map ? map->mask : 0;
87 const feature_map_t *map = features.bsearch (&feature_tag); local
88 return map ? map->needs_fallback : false;
92 const feature_map_t *map = features.bsearch (&feature_tag); local
93 return map ? map->_1_mask : 0
97 const feature_map_t *map = features.bsearch (&feature_tag); local
102 const feature_map_t *map = features.bsearch (&feature_tag); local
[all...] |
| /external/harfbuzz_ng/src/ |
| hb-ot-map-private.hh | 81 const feature_map_t *map = features.bsearch (&feature_tag); local
82 if (shift) *shift = map ? map->shift : 0;
83 return map ? map->mask : 0;
87 const feature_map_t *map = features.bsearch (&feature_tag); local
88 return map ? map->needs_fallback : false;
92 const feature_map_t *map = features.bsearch (&feature_tag); local
93 return map ? map->_1_mask : 0
97 const feature_map_t *map = features.bsearch (&feature_tag); local
102 const feature_map_t *map = features.bsearch (&feature_tag); local
[all...] |
| /external/jmonkeyengine/engine/src/core/com/jme3/util/ |
| ListMap.java | 38 import java.util.Map;
39 import java.util.Map.Entry;
43 * Implementation of a Map that favors iteration speed rather than
48 public final class ListMap<K, V> implements Map<K, V>, Cloneable, Serializable {
51 Map<String, String> map = new ListMap<String, String>(); local
52 map.put( "bob", "hello");
53 System.out.println(map.get("bob"));
54 map.remove("bob");
55 System.out.println(map.size())
[all...] |
| /external/chromium_org/v8/src/ |
| property.h | 154 return field_index() < holder->map()->inobject_properties();
159 int index = field_index() - holder->map()->inobject_properties();
161 return index + holder->map()->instance_size() / kPointerSize;
375 Map* GetTransitionTarget(Map* map) {
377 TransitionArray* transitions = map->transitions();
381 Map* GetTransitionTarget() {
382 return GetTransitionTarget(holder()->map());
385 PropertyDetails GetTransitionDetails(Map* map)
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| ImmutableSortedMap.java | 35 import java.util.Map;
46 * of a separate map which can still change, an instance of {@code
49 * ("constant maps") and also lets you easily make a "defensive copy" of a map
80 * Returns the empty sorted map.
101 * Returns an immutable map containing a single entry.
110 * Returns an immutable sorted map containing the given entries, sorted by the
123 * Returns an immutable sorted map containing the given entries, sorted by the
136 * Returns an immutable sorted map containing the given entries, sorted by the
149 * Returns an immutable sorted map containing the given entries, sorted by the
162 * Returns an immutable map containing the same entries as {@code map}, sorte
477 final transient ImmutableSortedMap<K, V> map; field in class:ImmutableSortedMap.EntrySet
511 final ImmutableSortedMap<K, V> map; field in class:ImmutableSortedMap.EntrySetSerializedForm
[all...] |
| RegularImmutableMap.java | 199 final transient RegularImmutableMap<K, V> map; field in class:RegularImmutableMap.EntrySet
201 EntrySet(RegularImmutableMap<K, V> map) {
202 super(map.entries);
203 this.map = map;
209 V mappedValue = map.get(entry.getKey());
226 final RegularImmutableMap<K, V> map; field in class:RegularImmutableMap.KeySet
228 KeySet(RegularImmutableMap<K, V> map) {
229 super(map.entries, map.keySetHashCode)
255 final RegularImmutableMap<?, V> map; field in class:RegularImmutableMap.Values
[all...] |
| /external/chromium_org/cc/trees/ |
| layer_tree_host_unittest_delegated.cc | 507 const ResourceProvider::ResourceIdMap& map = variable
512 EXPECT_EQ(2u, map.size());
513 EXPECT_EQ(1u, map.count(999));
514 EXPECT_EQ(1u, map.count(555));
517 EXPECT_EQ(1u, delegated_impl->Resources().count(map.find(999)->second));
518 EXPECT_EQ(1u, delegated_impl->Resources().count(map.find(555)->second));
549 const ResourceProvider::ResourceIdMap& map = variable
554 EXPECT_EQ(2u, map.size());
555 EXPECT_EQ(1u, map.count(999));
556 EXPECT_EQ(1u, map.count(555))
824 const ResourceProvider::ResourceIdMap& map = variable
941 const ResourceProvider::ResourceIdMap& map = variable
1070 const ResourceProvider::ResourceIdMap& map = variable
1188 const ResourceProvider::ResourceIdMap& map = variable
1251 const ResourceProvider::ResourceIdMap& map = variable
1324 const ResourceProvider::ResourceIdMap& map = variable
1435 const ResourceProvider::ResourceIdMap& map = variable
[all...] |
| /bionic/libc/kernel/arch-x86/asm/ |
| e820.h | 40 struct e820entry map[E820MAX]; member in struct:e820map
|
| /development/ndk/platforms/android-9/arch-x86/include/asm/ |
| e820.h | 40 struct e820entry map[E820MAX]; member in struct:e820map
|
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
| TreeMapRndTest.java | 26 map = new TreeMap<Integer, Integer>(ref);
|
| /external/apache-http/src/org/apache/http/impl/client/ |
| BasicCredentialsProvider.java | 87 * @param map the credentials hash map
93 final HashMap<AuthScope, Credentials> map,
96 Credentials creds = map.get(authscope);
102 for (AuthScope current: map.keySet()) {
110 creds = map.get(bestMatch);
|
| /external/chromium/chrome/browser/accessibility/ |
| browser_accessibility_mac.h | 9 #include <map>
|
| /external/chromium/chrome/browser/ |
| mock_plugin_exceptions_table_model.h | 15 MockPluginExceptionsTableModel(HostContentSettingsMap* map,
|
| /external/chromium/chrome/browser/policy/ |
| mock_configuration_policy_store.h | 9 #include <map>
|
| /external/chromium/chrome/browser/prefs/ |
| pref_value_map.h | 9 #include <map>
17 // A generic string to value map used by the PrefStore implementations.
20 typedef std::map<std::string, Value*>::iterator iterator;
21 typedef std::map<std::string, Value*>::const_iterator const_iterator;
27 // the map. Returns true if a value is present. If not, |value| is not
36 // Removes the value for |key| from the map. Returns true if a value was
40 // Clears the map.
59 // Compares this value map against |other| and stores all key names that have
66 typedef std::map<std::string, Value*> Map;
[all...] |
