/external/guava/guava-tests/test/com/google/common/collect/ |
HashMultisetTest.java | 34 @Override protected <E> Multiset<E> create() { 39 Multiset<String> multiset = HashMultiset.create(); local 40 multiset.add("foo", 2); 41 multiset.add("bar"); 42 assertEquals(3, multiset.size()); 43 assertEquals(2, multiset.count("foo")); 47 Multiset<String> multiset = HashMultiset.create(50); local 48 multiset.add("foo", 2) 55 Multiset<String> multiset local 63 Multiset<Multiset<?>> multiset = HashMultiset.create(); local 81 Multiset<MultisetHolder> multiset = HashMultiset.create(); local [all...] |
ConcurrentHashMultisetTest.java | 32 import com.google.common.collect.Multiset.Entry; 55 ConcurrentHashMultiset<String> multiset; field in class:ConcurrentHashMultisetTest 63 multiset = new ConcurrentHashMultiset<String>(backingMap); 73 assertEquals(COUNT, multiset.count(KEY)); 81 assertEquals(0, multiset.count(KEY)); 90 assertEquals(INITIAL_COUNT, multiset.add(KEY, 0)); 101 assertEquals(0, multiset.add(KEY, COUNT)); 113 assertEquals(INITIAL_COUNT, multiset.add(KEY, COUNT_TO_ADD)); 126 multiset.add(KEY, COUNT_TO_ADD); 167 assertEquals(multiset.add(KEY, 3), 12) 249 ConcurrentHashMultiset<String> multiset; local 260 assertEquals(ImmutableMultiset.copyOf(elements), multiset); local 276 ConcurrentHashMultiset<String> multiset; local 330 ConcurrentHashMultiset<Integer> multiset = ConcurrentHashMultiset.create(); local 337 ConcurrentHashMultiset<Integer> multiset local 362 ConcurrentHashMultiset<String> multiset = local 405 ConcurrentHashMultiset<String> multiset = local 451 ConcurrentHashMultiset<String> multiset = local 536 ConcurrentHashMultiset<String> multiset = ConcurrentHashMultiset.create(mapMaker); local [all...] |
LinkedHashMultisetTest.java | 38 @Override protected <E> Multiset<E> create() { 43 Multiset<String> multiset = LinkedHashMultiset.create(); local 44 multiset.add("foo", 2); 45 multiset.add("bar"); 46 assertEquals(3, multiset.size()); 47 assertEquals(2, multiset.count("foo")); 48 assertEquals("[foo x 2, bar]", multiset.toString()); 52 Multiset<String> multiset = LinkedHashMultiset.create(50) local 61 Multiset<String> multiset local [all...] |
MultisetsTest.java | 51 Multiset<String> multiset = HashMultiset.create(); local 52 multiset.addAll(set); 53 Multiset<String> multisetView = Multisets.forSet(set); 54 assertTrue(multiset.equals(multisetView)); 55 assertTrue(multisetView.equals(multiset)); 56 assertEquals(multiset.toString(), multisetView.toString()); 57 assertEquals(multiset.hashCode(), multisetView.hashCode()); 58 assertEquals(multiset.size(), multisetView.size()); 62 assertEquals(multiset.elementSet(), multisetView.elementSet()) 104 Multiset<String> multiset = HashMultiset.create(); local 132 TreeMultiset<String> multiset local 140 Multiset<String> multiset = HashMultiset.create(); local 148 Multiset<String> multiset = HashMultiset.create(); local 185 Multiset<String> multiset = local 193 Multiset<String> multiset = local 202 Multiset<String> multiset = local 210 Multiset<String> multiset = local 230 Multiset<String> multiset = HashMultiset.create( local [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/ |
types.pass.cpp | 14 // class multiset 40 static_assert((std::is_same<std::multiset<int>::key_type, int>::value), ""); 41 static_assert((std::is_same<std::multiset<int>::value_type, int>::value), ""); 42 static_assert((std::is_same<std::multiset<int>::key_compare, std::less<int> >::value), ""); 43 static_assert((std::is_same<std::multiset<int>::value_compare, std::less<int> >::value), ""); 44 static_assert((std::is_same<std::multiset<int>::allocator_type, std::allocator<int> >::value), ""); 45 static_assert((std::is_same<std::multiset<int>::reference, int&>::value), ""); 46 static_assert((std::is_same<std::multiset<int>::const_reference, const int&>::value), ""); 47 static_assert((std::is_same<std::multiset<int>::pointer, int*>::value), ""); 48 static_assert((std::is_same<std::multiset<int>::const_pointer, const int*>::value), "") [all...] |
max_size.pass.cpp | 12 // class multiset 24 typedef std::multiset<int> M; 30 typedef std::multiset<int, std::less<int>, min_allocator<int>> M;
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/multiset.cons/ |
default.pass.cpp | 12 // class multiset 14 // multiset(); 24 std::multiset<int> m; 30 std::multiset<int, std::less<int>, min_allocator<int>> m;
|
default_noexcept.pass.cpp | 12 // multiset() 37 typedef std::multiset<MoveOnly> C; 41 typedef std::multiset<MoveOnly, std::less<MoveOnly>, test_allocator<MoveOnly>> C; 45 typedef std::multiset<MoveOnly, std::less<MoveOnly>, other_allocator<MoveOnly>> C; 49 typedef std::multiset<MoveOnly, some_comp<MoveOnly>> C;
|
dtor_noexcept.pass.cpp | 12 // ~multiset() // implied noexcept; 35 typedef std::multiset<MoveOnly> C; 39 typedef std::multiset<MoveOnly, std::less<MoveOnly>, test_allocator<MoveOnly>> C; 43 typedef std::multiset<MoveOnly, std::less<MoveOnly>, other_allocator<MoveOnly>> C; 47 typedef std::multiset<MoveOnly, some_comp<MoveOnly>> C;
|
move_assign_noexcept.pass.cpp | 12 // multiset& operator=(multiset&& c) 37 typedef std::multiset<MoveOnly> C; 41 typedef std::multiset<MoveOnly, std::less<MoveOnly>, test_allocator<MoveOnly>> C; 45 typedef std::multiset<MoveOnly, std::less<MoveOnly>, other_allocator<MoveOnly>> C; 49 typedef std::multiset<MoveOnly, some_comp<MoveOnly>> C;
|
move_noexcept.pass.cpp | 12 // multiset(multiset&&) 35 typedef std::multiset<MoveOnly> C; 39 typedef std::multiset<MoveOnly, std::less<MoveOnly>, test_allocator<MoveOnly>> C; 43 typedef std::multiset<MoveOnly, std::less<MoveOnly>, other_allocator<MoveOnly>> C; 47 typedef std::multiset<MoveOnly, some_comp<MoveOnly>> C;
|
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
stl_multiset.h | 0 // Multiset implementation -*- C++ -*- 74 * keys). For a @c multiset<Key> the key_type and value_type are Key. 79 * multiset; the distinction is made entirely in how the tree functions are 84 class multiset class 129 multiset() function in class:multiset 133 * @brief Creates a %multiset with no elements. 138 multiset(const _Compare& __comp, function in class:multiset 143 * @brief Builds a %multiset from a range. 147 * Create a %multiset consisting of copies of the elements from 152 multiset(_InputIterator __first, _InputIterator __last function in class:multiset 168 multiset(_InputIterator __first, _InputIterator __last, function in class:multiset 181 multiset(const multiset& __x) function in class:multiset 192 multiset(multiset&& __x) function in class:multiset 205 multiset(initializer_list<value_type> __l, function in class:multiset [all...] |
/prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
stl_multiset.h | 0 // Multiset implementation -*- C++ -*- 74 * keys). For a @c multiset<Key> the key_type and value_type are Key. 79 * multiset; the distinction is made entirely in how the tree functions are 84 class multiset class 129 multiset() function in class:multiset 133 * @brief Creates a %multiset with no elements. 138 multiset(const _Compare& __comp, function in class:multiset 143 * @brief Builds a %multiset from a range. 147 * Create a %multiset consisting of copies of the elements from 152 multiset(_InputIterator __first, _InputIterator __last function in class:multiset 168 multiset(_InputIterator __first, _InputIterator __last, function in class:multiset 181 multiset(const multiset& __x) function in class:multiset 192 multiset(multiset&& __x) function in class:multiset 205 multiset(initializer_list<value_type> __l, function in class:multiset [all...] |
/prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
stl_multiset.h | 0 // Multiset implementation -*- C++ -*- 74 * keys). For a @c multiset<Key> the key_type and value_type are Key. 79 * multiset; the distinction is made entirely in how the tree functions are 84 class multiset class 129 multiset() function in class:multiset 133 * @brief Creates a %multiset with no elements. 138 multiset(const _Compare& __comp, function in class:multiset 143 * @brief Builds a %multiset from a range. 147 * Create a %multiset consisting of copies of the elements from 152 multiset(_InputIterator __first, _InputIterator __last function in class:multiset 168 multiset(_InputIterator __first, _InputIterator __last, function in class:multiset 181 multiset(const multiset& __x) function in class:multiset 192 multiset(multiset&& __x) function in class:multiset 205 multiset(initializer_list<value_type> __l, function in class:multiset [all...] |
/prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/ |
stl_multiset.h | 0 // Multiset implementation -*- C++ -*- 74 * keys). For a @c multiset<Key> the key_type and value_type are Key. 79 * multiset; the distinction is made entirely in how the tree functions are 84 class multiset class 129 multiset() function in class:multiset 133 * @brief Creates a %multiset with no elements. 138 multiset(const _Compare& __comp, function in class:multiset 143 * @brief Builds a %multiset from a range. 147 * Create a %multiset consisting of copies of the elements from 152 multiset(_InputIterator __first, _InputIterator __last function in class:multiset 168 multiset(_InputIterator __first, _InputIterator __last, function in class:multiset 181 multiset(const multiset& __x) function in class:multiset 192 multiset(multiset&& __x) function in class:multiset 205 multiset(initializer_list<value_type> __l, function in class:multiset [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/bits/ |
stl_multiset.h | 0 // Multiset implementation -*- C++ -*- 74 * keys). For a @c multiset<Key> the key_type and value_type are Key. 79 * multiset; the distinction is made entirely in how the tree functions are 84 class multiset class 129 multiset() function in class:multiset 133 * @brief Creates a %multiset with no elements. 138 multiset(const _Compare& __comp, function in class:multiset 143 * @brief Builds a %multiset from a range. 147 * Create a %multiset consisting of copies of the elements from 152 multiset(_InputIterator __first, _InputIterator __last function in class:multiset 168 multiset(_InputIterator __first, _InputIterator __last, function in class:multiset 181 multiset(const multiset& __x) function in class:multiset 192 multiset(multiset&& __x) function in class:multiset 205 multiset(initializer_list<value_type> __l, function in class:multiset [all...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
stl_multiset.h | 0 // Multiset implementation -*- C++ -*- 76 * keys). For a @c multiset<Key> the key_type and value_type are Key. 81 * multiset; the distinction is made entirely in how the tree functions are 86 class multiset class 131 multiset() function in class:multiset 135 * @brief Creates a %multiset with no elements. 140 multiset(const _Compare& __comp, function in class:multiset 145 * @brief Builds a %multiset from a range. 149 * Create a %multiset consisting of copies of the elements from 154 multiset(_InputIterator __first, _InputIterator __last function in class:multiset 170 multiset(_InputIterator __first, _InputIterator __last, function in class:multiset 183 multiset(const multiset& __x) function in class:multiset 194 multiset(multiset&& __x) function in class:multiset 207 multiset(initializer_list<value_type> __l, function in class:multiset [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
stl_multiset.h | 0 // Multiset implementation -*- C++ -*- 76 * keys). For a @c multiset<Key> the key_type and value_type are Key. 81 * multiset; the distinction is made entirely in how the tree functions are 86 class multiset class 131 multiset() function in class:multiset 135 * @brief Creates a %multiset with no elements. 140 multiset(const _Compare& __comp, function in class:multiset 145 * @brief Builds a %multiset from a range. 149 * Create a %multiset consisting of copies of the elements from 154 multiset(_InputIterator __first, _InputIterator __last function in class:multiset 170 multiset(_InputIterator __first, _InputIterator __last, function in class:multiset 183 multiset(const multiset& __x) function in class:multiset 194 multiset(multiset&& __x) function in class:multiset 207 multiset(initializer_list<value_type> __l, function in class:multiset [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
stl_multiset.h | 0 // Multiset implementation -*- C++ -*- 76 * keys). For a @c multiset<Key> the key_type and value_type are Key. 81 * multiset; the distinction is made entirely in how the tree functions are 86 class multiset class 131 multiset() function in class:multiset 135 * @brief Creates a %multiset with no elements. 140 multiset(const _Compare& __comp, function in class:multiset 145 * @brief Builds a %multiset from a range. 149 * Create a %multiset consisting of copies of the elements from 154 multiset(_InputIterator __first, _InputIterator __last function in class:multiset 170 multiset(_InputIterator __first, _InputIterator __last, function in class:multiset 183 multiset(const multiset& __x) function in class:multiset 194 multiset(multiset&& __x) function in class:multiset 207 multiset(initializer_list<value_type> __l, function in class:multiset [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
stl_multiset.h | 0 // Multiset implementation -*- C++ -*- 78 * keys). For a @c multiset<Key> the key_type and value_type are Key. 83 * multiset; the distinction is made entirely in how the tree functions are 88 class multiset class 133 multiset() function in class:multiset 137 * @brief Creates a %multiset with no elements. 142 multiset(const _Compare& __comp, function in class:multiset 147 * @brief Builds a %multiset from a range. 151 * Create a %multiset consisting of copies of the elements from 156 multiset(_InputIterator __first, _InputIterator __last function in class:multiset 172 multiset(_InputIterator __first, _InputIterator __last, function in class:multiset 185 multiset(const multiset& __x) function in class:multiset 210 multiset(initializer_list<value_type> __l, function in class:multiset [all...] |
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
stl_multiset.h | 0 // Multiset implementation -*- C++ -*- 76 * keys). For a @c multiset<Key> the key_type and value_type are Key. 81 * multiset; the distinction is made entirely in how the tree functions are 86 class multiset class 131 multiset() function in class:multiset 135 * @brief Creates a %multiset with no elements. 140 multiset(const _Compare& __comp, function in class:multiset 145 * @brief Builds a %multiset from a range. 149 * Create a %multiset consisting of copies of the elements from 154 multiset(_InputIterator __first, _InputIterator __last function in class:multiset 170 multiset(_InputIterator __first, _InputIterator __last, function in class:multiset 183 multiset(const multiset& __x) function in class:multiset 194 multiset(multiset&& __x) function in class:multiset 207 multiset(initializer_list<value_type> __l, function in class:multiset [all...] |
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
stl_multiset.h | 0 // Multiset implementation -*- C++ -*- 78 * keys). For a @c multiset<Key> the key_type and value_type are Key. 83 * multiset; the distinction is made entirely in how the tree functions are 88 class multiset class 133 multiset() function in class:multiset 137 * @brief Creates a %multiset with no elements. 142 multiset(const _Compare& __comp, function in class:multiset 147 * @brief Builds a %multiset from a range. 151 * Create a %multiset consisting of copies of the elements from 156 multiset(_InputIterator __first, _InputIterator __last function in class:multiset 172 multiset(_InputIterator __first, _InputIterator __last, function in class:multiset 185 multiset(const multiset& __x) function in class:multiset 210 multiset(initializer_list<value_type> __l, function in class:multiset [all...] |
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/ |
stl_multiset.h | 0 // Multiset implementation -*- C++ -*- 82 * keys). For a @c multiset<Key> the key_type and value_type are Key. 87 * multiset; the distinction is made entirely in how the tree functions are 92 class multiset class 137 multiset() function in class:multiset 141 * @brief Creates a %multiset with no elements. 146 multiset(const _Compare& __comp, function in class:multiset 151 * @brief Builds a %multiset from a range. 155 * Create a %multiset consisting of copies of the elements from 160 multiset(_InputIterator __first, _InputIterator __last function in class:multiset 176 multiset(_InputIterator __first, _InputIterator __last, function in class:multiset 189 multiset(const multiset& __x) function in class:multiset 214 multiset(initializer_list<value_type> __l, function in class:multiset [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/multiset.special/ |
swap_noexcept.pass.cpp | 12 // void swap(multiset& c) 40 typedef std::multiset<MoveOnly> C; 45 typedef std::multiset<MoveOnly, std::less<MoveOnly>, test_allocator<MoveOnly>> C; 50 typedef std::multiset<MoveOnly, std::less<MoveOnly>, other_allocator<MoveOnly>> C; 55 typedef std::multiset<MoveOnly, some_comp<MoveOnly>> C;
|
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/profile/ |
multiset.h | 1 // Profiling multiset implementation -*- C++ -*- 25 /** @file profile/multiset.h 38 /// Class std::multiset wrapper with performance instrumentation. 41 class multiset class in namespace:__profile 42 : public _GLIBCXX_STD_C::multiset<_Key, _Compare, _Allocator> 44 typedef _GLIBCXX_STD_C::multiset<_Key, _Compare, _Allocator> _Base; 67 explicit multiset(const _Compare& __comp = _Compare(), function in class:__profile::multiset 72 multiset(_InputIterator __first, _InputIterator __last, function in class:__profile::multiset 77 multiset(const multiset& __x function in class:__profile::multiset 80 multiset(const _Base& __x) function in class:__profile::multiset 84 multiset(multiset&& __x) function in class:__profile::multiset 88 multiset(initializer_list<value_type> __l, function in class:__profile::multiset [all...] |