HomeSort by relevance Sort by last modified time
    Searched defs:Map (Results 51 - 75 of 409) sorted by null

1 23 4 5 6 7 8 91011>>

  /prebuilts/go/darwin-x86/test/stress/
maps.go 14 // TODO(bradfitz): bunch more map types of all different key and value types.
21 NewMap() Map
24 type Map interface {
36 Println("map at ", m.Len())
65 func (intMapType) NewMap() Map {
71 type intMap map[int][]byte
  /prebuilts/go/linux-x86/test/stress/
maps.go 14 // TODO(bradfitz): bunch more map types of all different key and value types.
21 NewMap() Map
24 type Map interface {
36 Println("map at ", m.Len())
65 func (intMapType) NewMap() Map {
71 type intMap map[int][]byte
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.map/
incomplete_type.pass.cpp 25 typedef std::unordered_map<A, A, MyHash<A> > Map;
26 Map m;
27 Map::iterator it;
28 Map::const_iterator cit;
29 Map::local_iterator lit;
30 Map::const_local_iterator clit;
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.multimap/
incomplete.pass.cpp 25 typedef std::unordered_multimap<A, A, MyHash<A> > Map;
26 Map m;
27 Map::iterator it;
28 Map::const_iterator cit;
29 Map::local_iterator lit;
30 Map::const_local_iterator clit;
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.multiset/
incomplete.pass.cpp 26 typedef std::unordered_multiset<A, MyHash<A> > Map;
27 Map m;
28 Map::iterator it;
29 Map::const_iterator cit;
30 Map::local_iterator lit;
31 Map::const_local_iterator clit;
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.set/
incomplete.pass.cpp 26 typedef std::unordered_set<A, MyHash<A> > Map;
27 Map m;
28 Map::iterator it;
29 Map::const_iterator cit;
30 Map::local_iterator lit;
31 Map::const_local_iterator clit;
  /frameworks/rs/
rsMap.h 29 class Map {
39 Map() : endIterator(MAP_NUM_BUCKET, nullptr, this) {
43 ~Map() {
80 friend class Map;
92 next = map->bucket[bucket_index];
105 map == other.map;
110 map != other.map;
118 iterator(size_t index, LinkNode* n, const Map* m) : bucket_index(index), node(n), map(m) {
123 const Map* map; member in class:android::renderscript::Map::iterator
    [all...]
  /hardware/qcom/media/msm8974/mm-video-legacy/vidc/vdec/inc/
Map.h 35 class Map
50 static Map<T,T2> *m_self;
52 Map() : head( NULL ), tail ( NULL ),tmp(head),size_of_list(0) {}
64 ~Map()
77 T2 Map<T,T2>::find(T d1)
92 T Map<T,T2>::find_ele(T d1)
107 T2 Map<T,T2>::begin()
118 void Map<T,T2>::show()
129 int Map<T,T2>::size()
142 void Map<T,T2>::insert(T data, T2 data2
    [all...]
  /hardware/qcom/media/msm8974/mm-video-v4l2/vidc/vdec/inc/
Map.h 35 class Map
49 static Map<T,T2> *m_self;
51 Map() : head( NULL ), tail ( NULL ),tmp(head),size_of_list(0) {}
67 ~Map() {
78 T2 Map<T,T2>::find(T d1)
94 T Map<T,T2>::find_ele(T d1)
110 T2 Map<T,T2>::begin()
122 void Map<T,T2>::show()
133 int Map<T,T2>::size()
147 void Map<T,T2>::insert(T data, T2 data2
    [all...]
  /hardware/qcom/media/msm8996/mm-video-v4l2/vidc/vdec/inc/
Map.h 34 class Map
48 static Map<T,T2> *m_self;
50 Map() : head( NULL ), tail ( NULL ),tmp(head),size_of_list(0) {}
66 ~Map() {
77 T2 Map<T,T2>::find(T d1)
93 T Map<T,T2>::find_ele(T d1)
109 T2 Map<T,T2>::begin()
121 void Map<T,T2>::show()
132 int Map<T,T2>::size()
146 void Map<T,T2>::insert(T data, T2 data2
    [all...]
  /hardware/qcom/media/msm8998/mm-video-v4l2/vidc/vdec/inc/
Map.h 34 class Map
48 static Map<T,T2> *m_self;
50 Map() : head( NULL ), tail ( NULL ),tmp(head),size_of_list(0) {}
66 ~Map() {
77 T2 Map<T,T2>::find(T d1)
93 T Map<T,T2>::find_ele(T d1)
109 T2 Map<T,T2>::begin()
121 void Map<T,T2>::show()
132 int Map<T,T2>::size()
146 void Map<T,T2>::insert(T data, T2 data2
    [all...]
  /device/linaro/bootloader/edk2/ArmPkg/Library/ArmDmaLib/
ArmDmaLib.c 55 @param HostAddress The system memory address to map to the DMA controller.
56 @param NumberOfBytes On input the number of bytes to map. On output the number of bytes
58 @param DeviceAddress The resulting map address for the bus master controller to use to
66 @retval EFI_DEVICE_ERROR The system hardware could not map the requested address.
80 MAP_INFO_INSTANCE *Map;
102 Map = AllocatePool (sizeof (MAP_INFO_INSTANCE));
103 if (Map == NULL) {
135 Map->DoubleBuffer = TRUE;
146 Map->BufferAddress = Buffer;
148 Map->DoubleBuffer = FALSE;
    [all...]
  /external/eigen/Eigen/src/Core/
Map.h 18 struct traits<Map<PlainObjectType, MapOptions, StrideType> >
38 /** \class Map
46 * \tparam StrideType optionally specifies strides. By default, Map assumes the memory layout
60 * If you need to map non-contiguous arrays, you can do so by specifying strides:
78 * \b Tip: to change the array of data mapped by a Map object, you can use the C++
84 * This class is the return type of PlainObjectBase::Map() but can also be used directly.
86 * \sa PlainObjectBase::Map(), \ref TopicStorageOrders
88 template<typename PlainObjectType, int MapOptions, typename StrideType> class Map
89 : public MapBase<Map<PlainObjectType, MapOptions, StrideType> >
93 typedef MapBase<Map> Base
    [all...]
  /external/google-breakpad/src/processor/
map_serializers.h 30 // map_serializers.h: defines templates for serializing std::map and its
39 #include <map>
50 // StdMapSerializer allocates memory and serializes an std::map instance into a
56 size_t SizeOf(const std::map<Key, Value> &m) const;
62 char* Write(const std::map<Key, Value> &m, char* dest) const;
64 // Serializes a std::map object into a chunk of memory data with format
69 char* Serialize(const std::map<Key, Value> &m, unsigned int *size) const;
103 // AddressMap is a simple wrapper of std::map.
158 // Convenient type name for the underlying map type.
159 typedef std::map<AddrType, ContainedRangeMap<AddrType, EntryType>*> Map
    [all...]
  /external/llvm/include/llvm/ADT/
UniqueVector.h 15 #include <map>
32 // Map - Used to handle the correspondence of entry to ID.
33 std::map<T, unsigned> Map;
43 // Check if the entry is already in the map.
44 unsigned &Val = Map[Entry];
60 // Search for entry in the map.
61 typename std::map<T, unsigned>::const_iterator MI = Map.find(Entry);
64 if (MI != Map.end()) return MI->second
    [all...]
  /external/swiftshader/src/OpenGL/common/
NameSpace.hpp 24 #include <map>
44 return map.empty();
49 return map.begin()->first;
54 return map.rbegin()->first;
66 map.insert({name, object});
74 return map.find(name) != map.end();
79 map[name] = object;
89 auto element = map.find(name);
91 if(element != map.end()
121 Map map; member in class:gl::NameSpace
    [all...]
  /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/
MachineLoopRanges.h 34 typedef IntervalMap<SlotIndex, unsigned, 4> Map;
35 typedef Map::Allocator Allocator;
41 /// Map intervals to a bit mask.
43 Map Intervals;
68 const Map &getMap() { return Intervals; }
  /frameworks/base/native/webview/plat_support/
graphic_buffer_impl.cpp 56 return buffer->Map(mode, vaddr);
77 status_t GraphicBufferImpl::Map(AwMapMode mode, void** vaddr) {
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/
UniqueVector.h 15 #include <map>
32 // Map - Used to handle the correspondence of entry to ID.
33 std::map<T, unsigned> Map;
43 // Check if the entry is already in the map.
44 unsigned &Val = Map[Entry];
60 // Search for entry in the map.
61 typename std::map<T, unsigned>::const_iterator MI = Map.find(Entry);
64 if (MI != Map.end()) return MI->second
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/DebugInfo/PDB/Native/
HashTable.h 84 HashTableIterator(const HashTable &Map, uint32_t Index, bool IsEnd);
87 HashTableIterator(const HashTable &Map);
98 const HashTable *Map;
  /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/DebugInfo/PDB/Native/
HashTable.h 84 HashTableIterator(const HashTable &Map, uint32_t Index, bool IsEnd);
87 HashTableIterator(const HashTable &Map);
98 const HashTable *Map;
  /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/DebugInfo/PDB/Native/
HashTable.h 84 HashTableIterator(const HashTable &Map, uint32_t Index, bool IsEnd);
87 HashTableIterator(const HashTable &Map);
98 const HashTable *Map;
  /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/DebugInfo/PDB/Native/
HashTable.h 86 HashTableIterator(const HashTable &Map, uint32_t Index, bool IsEnd);
89 HashTableIterator(const HashTable &Map);
100 const HashTable *Map;
  /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/DebugInfo/PDB/Native/
HashTable.h 86 HashTableIterator(const HashTable &Map, uint32_t Index, bool IsEnd);
89 HashTableIterator(const HashTable &Map);
100 const HashTable *Map;
  /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/DebugInfo/PDB/Native/
HashTable.h 86 HashTableIterator(const HashTable &Map, uint32_t Index, bool IsEnd);
89 HashTableIterator(const HashTable &Map);
100 const HashTable *Map;

Completed in 1496 milliseconds

1 23 4 5 6 7 8 91011>>