| /external/guava/src/com/google/common/collect/ |
| LinkedListMultimap.java | 50 * across non-distinct key values. For example, for the following multimap
53 * Multimap<K, V> multimap = LinkedListMultimap.create();
54 * multimap.put(key1, foo);
55 * multimap.put(key2, bar);
56 * multimap.put(key1, baz);}</pre>
71 * through the keys in the order they were first added to the multimap.
76 * added to the multimap.
78 * <p>Keys and values may be null. All optional multimap methods are supported,
83 * multimap. If the multimap is modified while an iteration over any of thos
[all...] |
| AbstractMultimap.java | 45 * Basic implementation of the {@link Multimap} interface. This class represents
46 * a multimap as a map that associates each key with a collection of values. All
47 * methods of {@link Multimap} are supported, including those specified as
50 * <p>To implement a multimap, a subclass must define the method {@link
53 * <p>The multimap constructor takes a map that has a single entry for each
55 * in the multimap, {@code AbstractMultimap} calls {@link #createCollection()}
62 * java.util.TreeSet}, in which case the multimap's iterators would propagate
76 * multimap, even if the underlying map and {@link #createCollection()} method
78 * allow concurrent update operations, wrap your multimap with a call to {@link
87 abstract class AbstractMultimap<K, V> implements Multimap<K, V>, Serializable
[all...] |
| /external/llvm/lib/CodeGen/ |
| CriticalAntiDepBreaker.cpp | 608 std::pair<std::multimap<unsigned, MachineOperand *>::iterator,
609 std::multimap<unsigned, MachineOperand *>::iterator>
622 for (std::multimap<unsigned, MachineOperand *>::iterator
|
| VirtRegRewriter.cpp | 172 std::multimap<unsigned, int> PhysRegsAvailable;
237 std::multimap<unsigned, int>::const_iterator I =
724 std::multimap<unsigned, int>::iterator I =
749 std::multimap<unsigned, int>::iterator I =
783 for (std::multimap<unsigned, int>::iterator
801 std::multimap<unsigned, int>::iterator NI = llvm::next(I);
829 std::multimap<unsigned, int>::iterator I = PhysRegsAvailable.lower_bound(Reg);
[all...] |
| VirtRegMap.h | 49 typedef std::multimap<MachineInstr*,
|
| /external/chromium/chrome/browser/extensions/ |
| extension_updater.h | 153 std::multimap<GURL, ManifestFetchData*> fetches_;
|
| extension_updater.cc | 275 for (std::multimap<GURL, ManifestFetchData*>::iterator it =
342 std::multimap<GURL, ManifestFetchData*>::iterator existing_iter =
[all...] |
| /external/valgrind/tsan/ |
| ts_util.h | 172 using std::multimap;
|
| thread_sanitizer.cc | [all...] |
| /external/chromium/chrome/browser/chromeos/input_method/ |
| input_method_util.cc | 33 typedef std::multimap<std::string, std::string> LanguageCodeToIdsMap;
564 const std::multimap<std::string, std::string>& language_code_to_ids,
|
| input_method_util_unittest.cc | 173 std::multimap<std::string, std::string> language_code_to_ids_map;
|
| /external/chromium/net/base/ |
| cookie_monster.h | 90 // I benchmarked hash_multimap vs multimap. We're going to be query-heavy
92 // close, with multimap being a tiny bit faster. I think this is because
95 // a multimap. Also, multimap is standard, another reason to use it.
98 typedef std::multimap<std::string, CanonicalCookie*> CookieMap;
[all...] |
| /external/chromium/net/tools/flip_server/ |
| epoll_server.h | 126 typedef std::multimap<int64, AlarmCB*> TimeToAlarmCBMap;
[all...] |
| /external/chromium/third_party/libjingle/source/talk/base/ |
| httpcommon.h | 296 typedef std::multimap<std::string, std::string, iless> HeaderMap;
|
| /external/llvm/lib/Transforms/Scalar/ |
| SCCP.cpp | 206 std::multimap<PHINode*, Instruction*> UsersOfOverdefinedPHIs;
474 std::multimap<PHINode*, Instruction*>::iterator It, E;
489 std::multimap<PHINode*, Instruction*>::iterator J, E;
695 std::multimap<PHINode*, Instruction*>::iterator I, E;
[all...] |
| /external/stlport/test/unit/ |
| hash_test.cpp | 65 typedef multimap<int, int> mapType;
189 // number of elements in the set must equal the number of entries in the hash_multimap and in the multimap
190 // (c) We check if we have seen as many data elements in collection as we have seen in the multimap.
270 // keep hash_multi_map and multimap in sync
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| hash_test.cpp | 65 typedef multimap<int, int> mapType;
189 // number of elements in the set must equal the number of entries in the hash_multimap and in the multimap
190 // (c) We check if we have seen as many data elements in collection as we have seen in the multimap.
270 // keep hash_multi_map and multimap in sync
|
| /ndk/tests/device/test-stlport/unit/ |
| hash_test.cpp | 65 typedef multimap<int, int> mapType;
189 // number of elements in the set must equal the number of entries in the hash_multimap and in the multimap
190 // (c) We check if we have seen as many data elements in collection as we have seen in the multimap.
270 // keep hash_multi_map and multimap in sync
|
| /external/chromium/testing/gtest/test/ |
| gtest-printers_test.cc | 194 using ::std::multimap;
876 TEST(PrintStlContainerTest, MultiMap) {
877 multimap<bool, int> map1;
[all...] |
| /external/llvm/lib/Transforms/IPO/ |
| DeadArgumentElimination.cpp | 70 /// Make RetOrArg comparable, so we can easily iterate the multimap.
97 typedef std::multimap<RetOrArg, RetOrArg> UseMap;
[all...] |
| /external/chromium/testing/gmock/test/ |
| gmock-matchers_test.cc | 63 using std::multimap;
[all...] |
| /external/clang/lib/CodeGen/ |
| CGVTables.cpp | [all...] |
| /external/chromium/chrome/browser/sync/engine/ |
| syncer_unittest.cc | 43 using std::multimap;
[all...] |
| /external/clang/lib/AST/ |
| ASTContext.cpp | [all...] |
| /prebuilt/common/tradefed/ |
| tradefed-prebuilt.jar | |
