HomeSort by relevance Sort by last modified time
    Searched full:unordered_map (Results 301 - 325 of 686) sorted by null

<<11121314151617181920>>

  /external/eigen/unsupported/Eigen/src/SparseExtra/
RandomSetter.h 31 /** Represents a std::unordered_map
33 * To use it you need to both define EIGEN_UNORDERED_MAP_SUPPORT and include the unordered_map header file
34 * yourself making sure that unordered_map is defined in the std namespace.
38 * #include <tr1/unordered_map>
41 * using std::tr1::unordered_map;
50 typedef std::unordered_map<KeyType,Scalar> Type;
  /external/google-breakpad/src/common/windows/
pdb_source_line_writer.h 38 #include <unordered_map>
50 using std::unordered_map;
195 unordered_map<wstring, DWORD>::iterator iter = unique_files_.find(file);
207 unordered_map<DWORD, DWORD>::iterator iter = file_ids_.find(id);
243 unordered_map<DWORD, DWORD> file_ids_;
245 unordered_map<wstring, DWORD> unique_files_;
  /external/llvm/include/llvm/CodeGen/
LexicalScopes.h 28 #include <unordered_map>
232 // Use an unordered_map to ensure value pointer validity over insertion.
233 std::unordered_map<const DILocalScope *, LexicalScope> LexicalScopeMap;
237 std::unordered_map<std::pair<const DILocalScope *, const DILocation *>,
243 // Use an unordered_map to ensure value pointer validity over insertion.
244 std::unordered_map<const DILocalScope *, LexicalScope> AbstractScopeMap;
LiveStackAnalysis.h 24 #include <unordered_map>
37 typedef std::unordered_map<int, LiveInterval> SS2IntervalMap;
  /build/kati/
exec.cc 23 #include <unordered_map>
136 unordered_map<Symbol, double> done_;
symtab.cc 26 #include <unordered_map>
145 unordered_map<StringPiece, Symbol> symtab_;
var.h 19 #include <unordered_map>
174 class Vars : public unordered_map<Symbol, Var*> {
  /external/libcxx/test/std/containers/unord/unord.multimap/
bucket.pass.cpp 10 // <unordered_map>
22 #include <unordered_map>
bucket_size.pass.cpp 10 // <unordered_map>
22 #include <unordered_map>
iterators.fail.cpp 10 // <unordered_map>
23 #include <unordered_map>
load_factor.pass.cpp 10 // <unordered_map>
18 #include <unordered_map>
max_load_factor.pass.cpp 10 // <unordered_map>
23 #include <unordered_map>
reserve.pass.cpp 10 // <unordered_map>
18 #include <unordered_map>
  /external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.cnstr/
default.pass.cpp 10 // <unordered_map>
18 #include <unordered_map>
size.fail.cpp 10 // <unordered_map>
18 #include <unordered_map>
size.pass.cpp 10 // <unordered_map>
18 #include <unordered_map>
size_hash.pass.cpp 10 // <unordered_map>
18 #include <unordered_map>
size_hash_equal.pass.cpp 10 // <unordered_map>
18 #include <unordered_map>
size_hash_equal_allocator.pass.cpp 10 // <unordered_map>
18 #include <unordered_map>
  /external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/
emplace.pass.cpp 10 // <unordered_map>
19 #include <unordered_map>
insert_const_lvalue.pass.cpp 10 // <unordered_map>
18 #include <unordered_map>
insert_hint_const_lvalue.pass.cpp 10 // <unordered_map>
22 #include <unordered_map>
  /frameworks/base/libs/hwui/
AssetAtlas.h 29 #include <unordered_map>
168 std::unordered_map<const SkPixelRef*, std::unique_ptr<Entry>> mEntries;
LayerBuilder.h 24 #include <unordered_map>
128 std::unordered_map<mergeid_t, MergingOpBatch*> mMergingBatchLookup[OpBatchType::Count];
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/
bucket.pass.cpp 10 // <unordered_map>
22 #include <unordered_map>

Completed in 719 milliseconds

<<11121314151617181920>>