/external/oprofile/libpp/ |
sample_container.h | 64 typedef std::multiset<sample_entry const *, less_by_file_loc>
|
/external/stlport/test/eh/ |
bug.cpp | 28 std::multiset<int*,compare> m;
|
test_set.cpp | 22 # include <multiset.h>
|
/external/stlport/test/unit/ |
mvctor_declaration_test.cpp | 152 struct __move_traits<multiset<specially_allocated_struct> > { 291 //associative containers, set multiset, map, multimap: 310 //multiset 311 CPPUNIT_ASSERT( is_movable(multiset<char>()) ); 312 CPPUNIT_ASSERT( is_movable(multiset<specially_allocated_struct>()) ); 314 CPPUNIT_ASSERT( is_move_complete(multiset<char>()) ); 315 CPPUNIT_ASSERT( !is_move_complete(multiset<specially_allocated_struct>()) ); 317 CPPUNIT_ASSERT( !is_move_complete(multiset<char>()) );
|
multiset_test.cpp | 15 typedef multiset<int, less<int> > mset; 76 //Check const_iterator on a mutable multiset 89 //Check const_iterator on a const multiset 105 typedef multiset<int, fn_type, allocator<int> > fn_mset;
|
set_test.cpp | 443 typedef multiset<Key, KeyCmp> KeySet; 467 typedef multiset<Key const volatile*, KeyCmpPtr> KeySet; 503 multiset<IncompleteClass> minstances; 504 typedef multiset<IncompleteClass>::iterator mit;
|
/ndk/tests/device/test-gnustl-full/unit/ |
mvctor_declaration_test.cpp | 152 struct __move_traits<multiset<specially_allocated_struct> > { 291 //associative containers, set multiset, map, multimap: 310 //multiset 311 CPPUNIT_ASSERT( is_movable(multiset<char>()) ); 312 CPPUNIT_ASSERT( is_movable(multiset<specially_allocated_struct>()) ); 314 CPPUNIT_ASSERT( is_move_complete(multiset<char>()) ); 315 CPPUNIT_ASSERT( !is_move_complete(multiset<specially_allocated_struct>()) ); 317 CPPUNIT_ASSERT( !is_move_complete(multiset<char>()) );
|
multiset_test.cpp | 15 typedef multiset<int, less<int> > mset; 76 //Check const_iterator on a mutable multiset 89 //Check const_iterator on a const multiset 105 typedef multiset<int, fn_type, allocator<int> > fn_mset;
|
set_test.cpp | 443 typedef multiset<Key, KeyCmp> KeySet; 467 typedef multiset<Key const volatile*, KeyCmpPtr> KeySet; 503 multiset<IncompleteClass> minstances; 504 typedef multiset<IncompleteClass>::iterator mit;
|
/ndk/tests/device/test-stlport/unit/ |
mvctor_declaration_test.cpp | 152 struct __move_traits<multiset<specially_allocated_struct> > { 291 //associative containers, set multiset, map, multimap: 310 //multiset 311 CPPUNIT_ASSERT( is_movable(multiset<char>()) ); 312 CPPUNIT_ASSERT( is_movable(multiset<specially_allocated_struct>()) ); 314 CPPUNIT_ASSERT( is_move_complete(multiset<char>()) ); 315 CPPUNIT_ASSERT( !is_move_complete(multiset<specially_allocated_struct>()) ); 317 CPPUNIT_ASSERT( !is_move_complete(multiset<char>()) );
|
multiset_test.cpp | 15 typedef multiset<int, less<int> > mset; 76 //Check const_iterator on a mutable multiset 89 //Check const_iterator on a const multiset 105 typedef multiset<int, fn_type, allocator<int> > fn_mset;
|
/external/guava/guava/src/com/google/common/collect/ |
ConcurrentHashMultiset.java | 44 * A multiset that supports concurrent modifications and that provides atomic versions of most 45 * {@code Multiset} operations (exceptions where noted). Null elements are not supported. 88 * <p>This implementation is highly efficient when {@code elements} is itself a {@link Multiset}. 90 * @param elements the elements that the multiset should contain 93 ConcurrentHashMultiset<E> multiset = ConcurrentHashMultiset.create(); local 94 Iterables.addAll(multiset, elements); 95 return multiset; 104 * multiset do not count as map updates at all, since we're usually just mutating the value 109 * <p>The returned multiset is serializable but any serialization caveats 130 * @param countMap backing map for storing the elements in the multiset an [all...] |
ImmutableSortedMultiset.java | 42 * {@link #subMultiset} methods share the same array as the original multiset, preventing that 65 * correctly if an element is modified after being placed in the multiset. For this reason, and to 85 * Returns the empty immutable sorted multiset. 93 * Returns an immutable sorted multiset containing a single element. 101 * Returns an immutable sorted multiset containing the given elements sorted by their natural 112 * Returns an immutable sorted multiset containing the given elements sorted by their natural 123 * Returns an immutable sorted multiset containing the given elements sorted by their natural 135 * Returns an immutable sorted multiset containing the given elements sorted by their natural 147 * Returns an immutable sorted multiset containing the given elements sorted by their natural 169 * Returns an immutable sorted multiset containing the given elements sorted by their natura 282 ImmutableSortedMultiset<E> multiset = (ImmutableSortedMultiset<E>) iterable; local [all...] |
AbstractMultiset.java | 32 * This class provides a skeletal implementation of the {@link Multiset} 33 * interface. A new multiset implementation can be created easily by extending 34 * this class and implementing the {@link Multiset#entrySet()} method, plus 36 * {@link #remove(Object, int)} to enable modifications to the multiset. 39 * the set returned by {@link Multiset#entrySet()}, as do many methods acting on 48 implements Multiset<E> { 114 * is itself a {@link Multiset}. 146 * Creates a new instance of this multiset's element set, which will be 155 Multiset<E> multiset() { method in class:AbstractMultiset.ElementSet 172 @Override Multiset<E> multiset() { method in class:AbstractMultiset.EntrySet [all...] |
AbstractSortedMultiset.java | 29 * {@link Multiset#entrySet()}, as do many methods acting on the set returned by 57 SortedMultiset<E> multiset() {
|
Synchronized.java | 405 static <E> Multiset<E> multiset( method in class:Synchronized 406 Multiset<E> multiset, @Nullable Object mutex) { 407 if (multiset instanceof SynchronizedMultiset || 408 multiset instanceof ImmutableMultiset) { 409 return multiset; 411 return new SynchronizedMultiset<E>(multiset, mutex); 415 implements Multiset<E> { 419 SynchronizedMultiset(Multiset<E> delegate, @Nullable Object mutex) [all...] |
ForwardingMultiset.java | 30 * A multiset which forwards all its method calls to another multiset. 32 * backing multiset as desired per the <a 53 implements Multiset<E> { 58 @Override protected abstract Multiset<E> delegate(); 235 * A sensible implementation of {@link Multiset#elementSet} in terms of the 252 Multiset<E> multiset() { method in class:ForwardingMultiset.StandardElementSet
|
/external/guava/guava-tests/test/com/google/common/collect/ |
AbstractMultimapTest.java | 642 Multiset<String> multiset = multimap.keys(); local 643 assertEquals(3, multiset.count("foo")); 644 assertEquals(1, multiset.count(nullKey())); 645 ASSERT.that(multiset.elementSet()).hasContentsAnyOrder("foo", nullKey()); 646 assertEquals(2, multiset.entrySet().size()); 647 assertEquals(4, multiset.size()); 649 Set<Multiset.Entry<String>> entries = multimap.keys().entrySet(); 654 Multiset<String> foo3null1 = 656 assertEquals(foo3null1, multiset); 681 Multiset<String> multiset = multimap.keys(); local 699 Multiset<String> multiset = multimap.keys(); local 710 Multiset<String> multiset = multimap.keys(); local [all...] |
/external/stlport/stlport/stl/pointers/ |
_set.h | 304 class multiset class in inherits:__stlport_class 306 : public __stlport_class<multiset<_Key, _Compare, _Alloc> > 320 typedef multiset<_Key, _Compare, _Alloc> _Self; 360 _Rep_type _M_t; // red-black tree representing multiset 376 multiset() : _M_t(_Compare(), _StorageTypeAlloc()) {} function in class:multiset 377 explicit multiset(const _Compare& __comp, function in class:multiset 383 multiset(_InputIterator __first, _InputIterator __last) function in class:multiset 395 multiset(_InputIterator __first, _InputIterator __last, function in class:multiset 407 multiset(_InputIterator __first, _InputIterator __last, function in class:multiset 420 multiset(const value_type* __first, const value_type* __last function in class:multiset 426 multiset(const value_type* __first, const value_type* __last, function in class:multiset 434 multiset(const_iterator __first, const_iterator __last) function in class:multiset 438 multiset(const_iterator __first, const_iterator __last, function in class:multiset 445 multiset(const _Self& __x) function in class:multiset 454 multiset(__move_source<_Self> src) function in class:multiset [all...] |
/ndk/sources/cxx-stl/stlport/stlport/stl/pointers/ |
_set.h | 304 class multiset class in inherits:__stlport_class 306 : public __stlport_class<multiset<_Key, _Compare, _Alloc> > 320 typedef multiset<_Key, _Compare, _Alloc> _Self; 360 _Rep_type _M_t; // red-black tree representing multiset 376 multiset() : _M_t(_Compare(), _StorageTypeAlloc()) {} function in class:multiset 377 explicit multiset(const _Compare& __comp, function in class:multiset 383 multiset(_InputIterator __first, _InputIterator __last) function in class:multiset 395 multiset(_InputIterator __first, _InputIterator __last, function in class:multiset 407 multiset(_InputIterator __first, _InputIterator __last, function in class:multiset 420 multiset(const value_type* __first, const value_type* __last function in class:multiset 426 multiset(const value_type* __first, const value_type* __last, function in class:multiset 434 multiset(const_iterator __first, const_iterator __last) function in class:multiset 438 multiset(const_iterator __first, const_iterator __last, function in class:multiset 445 multiset(const _Self& __x) function in class:multiset 454 multiset(__move_source<_Self> src) function in class:multiset [all...] |
/prebuilts/ndk/android-ndk-r5/sources/cxx-stl/stlport/stlport/stl/pointers/ |
_set.h | 304 class multiset class in inherits:__stlport_class 306 : public __stlport_class<multiset<_Key, _Compare, _Alloc> > 320 typedef multiset<_Key, _Compare, _Alloc> _Self; 360 _Rep_type _M_t; // red-black tree representing multiset 376 multiset() : _M_t(_Compare(), _StorageTypeAlloc()) {} function in class:multiset 377 explicit multiset(const _Compare& __comp, function in class:multiset 383 multiset(_InputIterator __first, _InputIterator __last) function in class:multiset 395 multiset(_InputIterator __first, _InputIterator __last, function in class:multiset 407 multiset(_InputIterator __first, _InputIterator __last, function in class:multiset 420 multiset(const value_type* __first, const value_type* __last function in class:multiset 426 multiset(const value_type* __first, const value_type* __last, function in class:multiset 434 multiset(const_iterator __first, const_iterator __last) function in class:multiset 438 multiset(const_iterator __first, const_iterator __last, function in class:multiset 445 multiset(const _Self& __x) function in class:multiset 454 multiset(__move_source<_Self> src) function in class:multiset [all...] |
/prebuilts/ndk/android-ndk-r6/sources/cxx-stl/stlport/stlport/stl/pointers/ |
_set.h | 304 class multiset class in inherits:__stlport_class 306 : public __stlport_class<multiset<_Key, _Compare, _Alloc> > 320 typedef multiset<_Key, _Compare, _Alloc> _Self; 360 _Rep_type _M_t; // red-black tree representing multiset 376 multiset() : _M_t(_Compare(), _StorageTypeAlloc()) {} function in class:multiset 377 explicit multiset(const _Compare& __comp, function in class:multiset 383 multiset(_InputIterator __first, _InputIterator __last) function in class:multiset 395 multiset(_InputIterator __first, _InputIterator __last, function in class:multiset 407 multiset(_InputIterator __first, _InputIterator __last, function in class:multiset 420 multiset(const value_type* __first, const value_type* __last function in class:multiset 426 multiset(const value_type* __first, const value_type* __last, function in class:multiset 434 multiset(const_iterator __first, const_iterator __last) function in class:multiset 438 multiset(const_iterator __first, const_iterator __last, function in class:multiset 445 multiset(const _Self& __x) function in class:multiset 454 multiset(__move_source<_Self> src) function in class:multiset [all...] |
/prebuilts/ndk/android-ndk-r7/sources/cxx-stl/stlport/stlport/stl/pointers/ |
_set.h | 304 class multiset class in inherits:__stlport_class 306 : public __stlport_class<multiset<_Key, _Compare, _Alloc> > 320 typedef multiset<_Key, _Compare, _Alloc> _Self; 360 _Rep_type _M_t; // red-black tree representing multiset 376 multiset() : _M_t(_Compare(), _StorageTypeAlloc()) {} function in class:multiset 377 explicit multiset(const _Compare& __comp, function in class:multiset 383 multiset(_InputIterator __first, _InputIterator __last) function in class:multiset 395 multiset(_InputIterator __first, _InputIterator __last, function in class:multiset 407 multiset(_InputIterator __first, _InputIterator __last, function in class:multiset 420 multiset(const value_type* __first, const value_type* __last function in class:multiset 426 multiset(const value_type* __first, const value_type* __last, function in class:multiset 434 multiset(const_iterator __first, const_iterator __last) function in class:multiset 438 multiset(const_iterator __first, const_iterator __last, function in class:multiset 445 multiset(const _Self& __x) function in class:multiset 454 multiset(__move_source<_Self> src) function in class:multiset [all...] |
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
Synchronized.java | 392 static <E> Multiset<E> multiset( method in class:Synchronized 393 Multiset<E> multiset, @Nullable Object mutex) { 394 if (multiset instanceof SynchronizedMultiset || 395 multiset instanceof ImmutableMultiset) { 396 return multiset; 398 return new SynchronizedMultiset<E>(multiset, mutex); 402 implements Multiset<E> { 406 SynchronizedMultiset(Multiset<E> delegate, @Nullable Object mutex) [all...] |
TreeMultiset.java | 36 * A multiset which maintains the ordering of its elements, according to either 44 * resulting multiset will violate the {@link java.util.Collection} contract, 56 * Creates a new, empty multiset, sorted according to the elements' natural 57 * order. All elements inserted into the multiset must implement the 61 * the multiset. If the user attempts to add an element to the multiset that 75 * Creates a new, empty multiset, sorted according to the specified 76 * comparator. All elements inserted into the multiset must be <i>mutually 79 * e1} and {@code e2} in the multiset. If the user attempts to add an element 80 * to the multiset that violates this constraint, the {@code add(Object)} cal 108 TreeMultiset<E> multiset = create(); local [all...] |