HomeSort by relevance Sort by last modified time
    Searched refs:map (Results 276 - 300 of 3027) sorted by null

<<11121314151617181920>>

  /external/libphonenumber/java/src/com/android/i18n/phonenumbers/
RegexCache.java 20 import java.util.Map;
51 private LinkedHashMap<K, V> map; field in class:RegexCache.LRUCache
57 map = new LinkedHashMap<K, V>(size * 4 / 3 + 1, 0.75f, true) {
59 protected boolean removeEldestEntry(Map.Entry<K, V> eldest) {
66 return map.get(key);
70 map.put(key, value);
74 return map.containsKey(key);
  /external/llvm/include/llvm/Analysis/
PathProfileInfo.h 32 typedef std::map<unsigned int,ProfilePath*> ProfilePathMap;
33 typedef std::map<unsigned int,ProfilePath*>::iterator ProfilePathIterator;
35 typedef std::map<Function*,unsigned int> FunctionPathCountMap;
36 typedef std::map<Function*,ProfilePathMap> FunctionPathMap;
37 typedef std::map<Function*,ProfilePathMap>::iterator FunctionPathIterator;
  /external/qemu/memcheck/
memcheck_malloc_map.c 28 /* Allocation descriptor stored in the map. */
42 * the map.
44 * adesc - Entry in the allocation descriptors map.
47 * map.
56 * the map.
58 * adesc - Entry in the allocation descriptors map.
60 * Address of the end of an allocation block for the given entry in the map.
72 /* Compare routine for the allocation descriptors map.
74 * d1 - First map entry to compare.
75 * d2 - Second map entry to compare
    [all...]
  /system/core/toolbox/
load_policy.c 15 void *map; local
35 map = mmap(NULL, sb.st_size, PROT_READ, MAP_PRIVATE, fd, 0);
36 if (map == MAP_FAILED) {
41 rc = security_load_policy(map, sb.st_size);
46 munmap(map, sb.st_size);
  /external/oprofile/daemon/liblegacy/
opd_proc.c 110 * @param map map to print
113 verb_show_sample(unsigned long offset, struct opd_map * map)
116 "map start 0x%.8lx, end 0x%.8lx, offset 0x%.8lx, name \"%s\"\n",
117 offset, map->start, map->end, map->offset,
118 map->image->name);
173 struct opd_map * map = list_entry(pos, struct opd_map, next); local
174 if (opd_is_in_map(map, sample->eip))
268 struct opd_map * map = list_entry(pos, struct opd_map, next); local
419 struct opd_map * map = list_entry(pos, struct opd_map, next); local
    [all...]
  /external/qemu/distrib/sdl-1.2.15/src/video/svga/
SDL_svgaevents.c 65 int map, i; local
68 for ( map=0; map<NUM_VGAKEYMAPS; ++map ) {
69 SDL_memset(vga_keymap[map], 0, NR_KEYS*sizeof(Uint16));
71 entry.kb_table = map;
91 vga_keymap[map][i]=entry.kb_value;
92 vga_keymap[map][i]+= '0';
95 vga_keymap[map][i]=K(KT_ASCII,'+');
98 vga_keymap[map][i]=K(KT_ASCII,'-')
346 int map; local
389 int map; local
    [all...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/
stl_map.h 0 // Map implementation -*- C++ -*-
54 * Do not attempt to use it directly. @headername{map}
77 * For a @c map<Key,T> the key_type is Key, the mapped_type is T, and the
82 * The private tree data is declared exactly the same way for map and
88 class map class
109 friend class map<_Key, _Tp, _Compare, _Alloc>;
122 /// This turns a red-black tree into a [multi]map.
152 map() function in class:map
156 * @brief Creates a %map with no elements.
161 map(const _Compare& __comp function in class:map
172 map(const map& __x) function in class:map
183 map(map&& __x) function in class:map
197 map(initializer_list<value_type> __l, function in class:map
214 map(_InputIterator __first, _InputIterator __last) function in class:map
230 map(_InputIterator __first, _InputIterator __last, function in class:map
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/
stl_map.h 0 // Map implementation -*- C++ -*-
54 * Do not attempt to use it directly. @headername{map}
77 * For a @c map<Key,T> the key_type is Key, the mapped_type is T, and the
82 * The private tree data is declared exactly the same way for map and
88 class map class
109 friend class map<_Key, _Tp, _Compare, _Alloc>;
122 /// This turns a red-black tree into a [multi]map.
152 map() function in class:map
156 * @brief Creates a %map with no elements.
161 map(const _Compare& __comp function in class:map
172 map(const map& __x) function in class:map
183 map(map&& __x) function in class:map
197 map(initializer_list<value_type> __l, function in class:map
214 map(_InputIterator __first, _InputIterator __last) function in class:map
230 map(_InputIterator __first, _InputIterator __last, function in class:map
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/
stl_map.h 0 // Map implementation -*- C++ -*-
54 * Do not attempt to use it directly. @headername{map}
77 * For a @c map<Key,T> the key_type is Key, the mapped_type is T, and the
82 * The private tree data is declared exactly the same way for map and
88 class map class
109 friend class map<_Key, _Tp, _Compare, _Alloc>;
122 /// This turns a red-black tree into a [multi]map.
152 map() function in class:map
156 * @brief Creates a %map with no elements.
161 map(const _Compare& __comp function in class:map
172 map(const map& __x) function in class:map
183 map(map&& __x) function in class:map
197 map(initializer_list<value_type> __l, function in class:map
214 map(_InputIterator __first, _InputIterator __last) function in class:map
230 map(_InputIterator __first, _InputIterator __last, function in class:map
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/
stl_map.h 0 // Map implementation -*- C++ -*-
54 * Do not attempt to use it directly. @headername{map}
79 * For a @c map<Key,T> the key_type is Key, the mapped_type is T, and the
84 * The private tree data is declared exactly the same way for map and
90 class map class
111 friend class map<_Key, _Tp, _Compare, _Alloc>;
124 /// This turns a red-black tree into a [multi]map.
154 map() function in class:map
158 * @brief Creates a %map with no elements.
163 map(const _Compare& __comp function in class:map
174 map(const map& __x) function in class:map
200 map(initializer_list<value_type> __l, function in class:map
218 map(_InputIterator __first, _InputIterator __last) function in class:map
235 map(_InputIterator __first, _InputIterator __last, function in class:map
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/debug/
map.h 1 // Debugging map implementation -*- C++ -*-
26 /** @file debug/map.h
41 /// Class std::map with safety/checking/debug instrumentation.
44 class map class in namespace:__debug
45 : public _GLIBCXX_STD_C::map<_Key, _Tp, _Compare, _Allocator>,
46 public __gnu_debug::_Safe_sequence<map<_Key, _Tp, _Compare, _Allocator> >
48 typedef _GLIBCXX_STD_C::map<_Key, _Tp, _Compare, _Allocator> _Base;
63 typedef __gnu_debug::_Safe_iterator<_Base_iterator, map>
65 typedef __gnu_debug::_Safe_iterator<_Base_const_iterator, map>
76 explicit map(const _Compare& __comp = _Compare() function in class:__debug::map
81 map(_InputIterator __first, _InputIterator __last, function in class:__debug::map
89 map(const map& __x) function in class:__debug::map
92 map(const _Base& __x) function in class:__debug::map
101 map(initializer_list<value_type> __l, function in class:__debug::map
    [all...]
  /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/net/
CookieManagerTest.java 28 import java.util.Map;
36 Map<String, List<String>> map) throws IOException {
39 manager.get(uri, map);
48 Map<String, List<String>> map) throws IOException {
51 manager.put(uri, map);
60 * @tests {@link java.net.CookieManager#get(java.net.URI, java.util.Map)} &
61 * @tests {@link java.net.CookieManager#put(java.net.URI, java.util.Map)}
80 private static Map<String, List<String>> addCookie(String[][] cookies)
146 Map<String, List<String>> map = manager.get(new URI("http:\/\/a.b.c\/"), local
275 Map<String, List<String>> map = manager.get(uri, local
    [all...]
  /external/oprofile/module/ia64/
op_syscalls.c 112 struct vm_area_struct * map; local
128 for (map = mm->mmap; map; map = map->vm_next) {
129 if (!(map->vm_flags & VM_EXEC) || !map->vm_file)
131 if (!(map->vm_flags & VM_EXECUTABLE))
134 oprof_output_map(map->vm_start, map->vm_end-map->vm_start
    [all...]
  /external/oprofile/module/x86/
op_syscalls.c 73 struct vm_area_struct * map; local
89 for (map = mm->mmap; map; map = map->vm_next) {
90 if (!(map->vm_flags & VM_EXEC) || !map->vm_file)
92 if (!(map->vm_flags & VM_EXECUTABLE))
95 oprof_output_map(map->vm_start, map->vm_end-map->vm_start
    [all...]
  /external/chromium/chrome/browser/extensions/
extension_special_storage_policy.h 9 #include <map>
49 typedef std::map<GURL, bool> CachedResults;
50 typedef std::map<std::string, scoped_refptr<const Extension> > Extensions;
  /external/chromium/chrome/browser/geolocation/
geolocation_settings_state.h 9 #include <map>
24 typedef std::map<GURL, ContentSetting> StateMap;
51 typedef std::map<ContentSetting, std::set<std::string> >
  /external/chromium/chrome/browser/sync/glue/
data_type_controller.h 10 #include <map>
59 typedef std::map<syncable::ModelType,
61 typedef std::map<syncable::ModelType, DataTypeController::State> StateMap;
  /external/chromium/chrome/browser/ui/gtk/
global_menu_bar.h 8 #include <map>
39 typedef std::map<int, GtkWidget*> IDMenuItemMap;
43 std::map<int, GtkWidget*>* id_to_menu_item,
  /external/chromium/chrome/browser/ui/webui/
chrome_url_data_manager_backend.h 14 #include <map>
53 typedef std::map<std::string,
55 typedef std::map<RequestID, URLRequestChromeJob*> PendingRequestMap;
74 // destructed to ensure that the pointers in this map remain valid.
  /external/clang/test/SemaCXX/
PR11358.cpp 30 void MapTest(hash_map<KeyType, ValueType> map) {
31 for (hash_map<KeyType, ValueType>::const_iterator it = map.begin(); // expected-error{{missing 'typename'}}
32 it != map.end(); it++) {
  /external/guava/guava-tests/test/com/google/common/collect/
MapMakerTest.java 28 import java.util.Map;
55 final ConcurrentMap<String, String> map = new MapMaker() local
60 // seed the map, so its segment's count > 0
61 map.put("a", "a");
68 map.get("b");
75 map.clear();
78 // don't check map.size() until we know the get("b") call is complete
81 // At this point, the listener should be holding the seed value (a -> a), and the map should
88 assertEquals(1, map.size());
89 assertEquals("b", map.get("b"))
111 final Map<String, String> map = new MapMaker() local
    [all...]
  /external/llvm/include/llvm/ADT/
UniqueVector.h 14 #include <map>
26 // Map - Used to handle the correspondence of entry to ID.
27 std::map<T, unsigned> Map;
37 // Check if the entry is already in the map.
38 unsigned &Val = Map[Entry];
54 // Search for entry in the map.
55 typename std::map<T, unsigned>::const_iterator MI = Map.find(Entry);
58 if (MI != Map.end()) return MI->second
    [all...]
  /external/webkit/Source/WebKit2/UIProcess/
WebFormClient.cpp 41 ImmutableDictionary::MapType map;
43 map.set(textFieldValues[i].first, WebString::create(textFieldValues[i].second));
44 RefPtr<ImmutableDictionary> textFieldsMap = ImmutableDictionary::adopt(map);
  /frameworks/support/v4/java/android/support/v4/util/
LruCache.java 20 import java.util.Map;
30 private final LinkedHashMap<K, V> map; field in class:LruCache
52 this.map = new LinkedHashMap<K, V>(0, 0.75f, true);
68 mapValue = map.get(key);
77 * Attempt to create a value. This may take a long time, and the map
79 * added to the map while create() was working, we leave that value in
80 * the map and release the created value.
90 mapValue = map.put(key, createdValue);
94 map.put(key, mapValue);
124 previous = map.put(key, value)
    [all...]
  /external/guava/guava/src/com/google/common/base/
Functions.java 26 import java.util.Map;
93 * Returns a function which performs a map lookup. The returned function throws an {@link
94 * IllegalArgumentException} if given a key that does not exist in the map.
96 public static <K, V> Function<K, V> forMap(Map<K, V> map) {
97 return new FunctionForMapNoDefault<K, V>(map);
101 final Map<K, V> map; field in class:Functions.FunctionForMapNoDefault
103 FunctionForMapNoDefault(Map<K, V> map) {
148 final Map<K, ? extends V> map; field in class:Functions.ForMapWithDefault
    [all...]

Completed in 1047 milliseconds

<<11121314151617181920>>