You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
This repo is archived. You can view files and clone it, but cannot push or open issues/pull-requests.
libcxx_old/test/std/utilities/utility/pairs/pairs.pair/swap.pass.cpp

54 lines
1.3 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
//
//===----------------------------------------------------------------------===//
// <utility>
// template <class T1, class T2> struct pair
// void swap(pair& p);
#include <utility>
#include <cassert>
#include "test_macros.h"
struct S {
int i;
S() : i(0) {}
S(int j) : i(j) {}
S * operator& () { assert(false); return this; }
S const * operator& () const { assert(false); return this; }
bool operator==(int x) const { return i == x; }
};
int main(int, char**)
{
{
typedef std::pair<int, short> P1;
P1 p1(3, static_cast<short>(4));
P1 p2(5, static_cast<short>(6));
p1.swap(p2);
assert(p1.first == 5);
assert(p1.second == 6);
assert(p2.first == 3);
assert(p2.second == 4);
}
{
typedef std::pair<int, S> P1;
P1 p1(3, S(4));
P1 p2(5, S(6));
p1.swap(p2);
assert(p1.first == 5);
assert(p1.second == 6);
assert(p2.first == 3);
assert(p2.second == 4);
}
return 0;
}