forked from OSchip/llvm-project
				
			
		
			
				
	
	
		
			74 lines
		
	
	
		
			1.9 KiB
		
	
	
	
		
			C++
		
	
	
	
			
		
		
	
	
			74 lines
		
	
	
		
			1.9 KiB
		
	
	
	
		
			C++
		
	
	
	
//===----------------------------------------------------------------------===//
 | 
						|
//
 | 
						|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
 | 
						|
// See https://llvm.org/LICENSE.txt for license information.
 | 
						|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
 | 
						|
//
 | 
						|
//===----------------------------------------------------------------------===//
 | 
						|
 | 
						|
// UNSUPPORTED: c++03, c++11, c++14
 | 
						|
 | 
						|
// <set>
 | 
						|
 | 
						|
// class multiset
 | 
						|
 | 
						|
// node_type extract(key_type const&);
 | 
						|
 | 
						|
#include <set>
 | 
						|
#include "test_macros.h"
 | 
						|
#include "min_allocator.h"
 | 
						|
#include "Counter.h"
 | 
						|
 | 
						|
template <class Container, class KeyTypeIter>
 | 
						|
void test(Container& c, KeyTypeIter first, KeyTypeIter last)
 | 
						|
{
 | 
						|
    size_t sz = c.size();
 | 
						|
    assert((size_t)std::distance(first, last) == sz);
 | 
						|
 | 
						|
    for (KeyTypeIter copy = first; copy != last; ++copy)
 | 
						|
    {
 | 
						|
        typename Container::node_type t = c.extract(*copy);
 | 
						|
        assert(!t.empty());
 | 
						|
        --sz;
 | 
						|
        assert(t.value() == *copy);
 | 
						|
        assert(t.get_allocator() == c.get_allocator());
 | 
						|
        assert(sz == c.size());
 | 
						|
    }
 | 
						|
 | 
						|
    assert(c.size() == 0);
 | 
						|
 | 
						|
    for (KeyTypeIter copy = first; copy != last; ++copy)
 | 
						|
    {
 | 
						|
        typename Container::node_type t = c.extract(*copy);
 | 
						|
        assert(t.empty());
 | 
						|
    }
 | 
						|
}
 | 
						|
 | 
						|
int main(int, char**)
 | 
						|
{
 | 
						|
    {
 | 
						|
        std::multiset<int> m = {1, 2, 3, 4, 5, 6};
 | 
						|
        int keys[] = {1, 2, 3, 4, 5, 6};
 | 
						|
        test(m, std::begin(keys), std::end(keys));
 | 
						|
    }
 | 
						|
 | 
						|
    {
 | 
						|
        std::multiset<Counter<int>> m = {1, 2, 3, 4, 5, 6};
 | 
						|
        {
 | 
						|
            Counter<int> keys[] = {1, 2, 3, 4, 5, 6};
 | 
						|
            assert(Counter_base::gConstructed == 6+6);
 | 
						|
            test(m, std::begin(keys), std::end(keys));
 | 
						|
        }
 | 
						|
        assert(Counter_base::gConstructed == 0);
 | 
						|
    }
 | 
						|
 | 
						|
    {
 | 
						|
        using min_alloc_set = std::multiset<int, std::less<int>, min_allocator<int>>;
 | 
						|
        min_alloc_set m = {1, 2, 3, 4, 5, 6};
 | 
						|
        int keys[] = {1, 2, 3, 4, 5, 6};
 | 
						|
        test(m, std::begin(keys), std::end(keys));
 | 
						|
    }
 | 
						|
 | 
						|
  return 0;
 | 
						|
}
 |