178 lines
		
	
	
		
			3.7 KiB
		
	
	
	
		
			C++
		
	
	
	
			
		
		
	
	
			178 lines
		
	
	
		
			3.7 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
 | 
						|
//
 | 
						|
//===----------------------------------------------------------------------===//
 | 
						|
 | 
						|
// <map>
 | 
						|
 | 
						|
// class multimap
 | 
						|
 | 
						|
// void swap(multimap& m);
 | 
						|
 | 
						|
#include <map>
 | 
						|
#include <cassert>
 | 
						|
 | 
						|
#include "min_allocator.h"
 | 
						|
 | 
						|
int main(int, char**)
 | 
						|
{
 | 
						|
    typedef std::pair<const int, double> V;
 | 
						|
    {
 | 
						|
    typedef std::multimap<int, double> M;
 | 
						|
    {
 | 
						|
        M m1;
 | 
						|
        M m2;
 | 
						|
        M m1_save = m1;
 | 
						|
        M m2_save = m2;
 | 
						|
        m1.swap(m2);
 | 
						|
        assert(m1 == m2_save);
 | 
						|
        assert(m2 == m1_save);
 | 
						|
    }
 | 
						|
    {
 | 
						|
        V ar2[] =
 | 
						|
        {
 | 
						|
            V(5, 5),
 | 
						|
            V(6, 6),
 | 
						|
            V(7, 7),
 | 
						|
            V(8, 8),
 | 
						|
            V(9, 9),
 | 
						|
            V(10, 10),
 | 
						|
            V(11, 11),
 | 
						|
            V(12, 12)
 | 
						|
        };
 | 
						|
        M m1;
 | 
						|
        M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0]));
 | 
						|
        M m1_save = m1;
 | 
						|
        M m2_save = m2;
 | 
						|
        m1.swap(m2);
 | 
						|
        assert(m1 == m2_save);
 | 
						|
        assert(m2 == m1_save);
 | 
						|
    }
 | 
						|
    {
 | 
						|
        V ar1[] =
 | 
						|
        {
 | 
						|
            V(1, 1),
 | 
						|
            V(2, 2),
 | 
						|
            V(3, 3),
 | 
						|
            V(4, 4)
 | 
						|
        };
 | 
						|
        M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]));
 | 
						|
        M m2;
 | 
						|
        M m1_save = m1;
 | 
						|
        M m2_save = m2;
 | 
						|
        m1.swap(m2);
 | 
						|
        assert(m1 == m2_save);
 | 
						|
        assert(m2 == m1_save);
 | 
						|
    }
 | 
						|
    {
 | 
						|
        V ar1[] =
 | 
						|
        {
 | 
						|
            V(1, 1),
 | 
						|
            V(2, 2),
 | 
						|
            V(3, 3),
 | 
						|
            V(4, 4)
 | 
						|
        };
 | 
						|
        V ar2[] =
 | 
						|
        {
 | 
						|
            V(5, 5),
 | 
						|
            V(6, 6),
 | 
						|
            V(7, 7),
 | 
						|
            V(8, 8),
 | 
						|
            V(9, 9),
 | 
						|
            V(10, 10),
 | 
						|
            V(11, 11),
 | 
						|
            V(12, 12)
 | 
						|
        };
 | 
						|
        M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]));
 | 
						|
        M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0]));
 | 
						|
        M m1_save = m1;
 | 
						|
        M m2_save = m2;
 | 
						|
        m1.swap(m2);
 | 
						|
        assert(m1 == m2_save);
 | 
						|
        assert(m2 == m1_save);
 | 
						|
    }
 | 
						|
    }
 | 
						|
#if TEST_STD_VER >= 11
 | 
						|
    {
 | 
						|
    typedef std::multimap<int, double, std::less<int>, min_allocator<std::pair<const int, double>>> M;
 | 
						|
    {
 | 
						|
        M m1;
 | 
						|
        M m2;
 | 
						|
        M m1_save = m1;
 | 
						|
        M m2_save = m2;
 | 
						|
        m1.swap(m2);
 | 
						|
        assert(m1 == m2_save);
 | 
						|
        assert(m2 == m1_save);
 | 
						|
    }
 | 
						|
    {
 | 
						|
        V ar2[] =
 | 
						|
        {
 | 
						|
            V(5, 5),
 | 
						|
            V(6, 6),
 | 
						|
            V(7, 7),
 | 
						|
            V(8, 8),
 | 
						|
            V(9, 9),
 | 
						|
            V(10, 10),
 | 
						|
            V(11, 11),
 | 
						|
            V(12, 12)
 | 
						|
        };
 | 
						|
        M m1;
 | 
						|
        M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0]));
 | 
						|
        M m1_save = m1;
 | 
						|
        M m2_save = m2;
 | 
						|
        m1.swap(m2);
 | 
						|
        assert(m1 == m2_save);
 | 
						|
        assert(m2 == m1_save);
 | 
						|
    }
 | 
						|
    {
 | 
						|
        V ar1[] =
 | 
						|
        {
 | 
						|
            V(1, 1),
 | 
						|
            V(2, 2),
 | 
						|
            V(3, 3),
 | 
						|
            V(4, 4)
 | 
						|
        };
 | 
						|
        M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]));
 | 
						|
        M m2;
 | 
						|
        M m1_save = m1;
 | 
						|
        M m2_save = m2;
 | 
						|
        m1.swap(m2);
 | 
						|
        assert(m1 == m2_save);
 | 
						|
        assert(m2 == m1_save);
 | 
						|
    }
 | 
						|
    {
 | 
						|
        V ar1[] =
 | 
						|
        {
 | 
						|
            V(1, 1),
 | 
						|
            V(2, 2),
 | 
						|
            V(3, 3),
 | 
						|
            V(4, 4)
 | 
						|
        };
 | 
						|
        V ar2[] =
 | 
						|
        {
 | 
						|
            V(5, 5),
 | 
						|
            V(6, 6),
 | 
						|
            V(7, 7),
 | 
						|
            V(8, 8),
 | 
						|
            V(9, 9),
 | 
						|
            V(10, 10),
 | 
						|
            V(11, 11),
 | 
						|
            V(12, 12)
 | 
						|
        };
 | 
						|
        M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]));
 | 
						|
        M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0]));
 | 
						|
        M m1_save = m1;
 | 
						|
        M m2_save = m2;
 | 
						|
        m1.swap(m2);
 | 
						|
        assert(m1 == m2_save);
 | 
						|
        assert(m2 == m1_save);
 | 
						|
    }
 | 
						|
    }
 | 
						|
#endif
 | 
						|
 | 
						|
  return 0;
 | 
						|
}
 |