| //===----------------------------------------------------------------------===// |
| // |
| // ÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊThe LLVM Compiler Infrastructure |
| // |
| // This file is distributed under the University of Illinois Open Source |
| // License. See LICENSE.TXT for details. |
| // |
| //===----------------------------------------------------------------------===// |
| |
| // <set> |
| |
| // class set |
| |
| // pair<iterator, bool> insert(value_type&& v); |
| |
| #include <set> |
| #include <cassert> |
| |
| #include "../../MoveOnly.h" |
| |
| int main() |
| { |
| #ifdef _LIBCPP_MOVE |
| { |
| typedef std::set<MoveOnly> M; |
| typedef std::pair<M::iterator, bool> R; |
| M m; |
| R r = m.insert(M::value_type(2)); |
| assert(r.second); |
| assert(r.first == m.begin()); |
| assert(m.size() == 1); |
| assert(*r.first == 2); |
| |
| r = m.insert(M::value_type(1)); |
| assert(r.second); |
| assert(r.first == m.begin()); |
| assert(m.size() == 2); |
| assert(*r.first == 1); |
| |
| r = m.insert(M::value_type(3)); |
| assert(r.second); |
| assert(r.first == prev(m.end())); |
| assert(m.size() == 3); |
| assert(*r.first == 3); |
| |
| r = m.insert(M::value_type(3)); |
| assert(!r.second); |
| assert(r.first == prev(m.end())); |
| assert(m.size() == 3); |
| assert(*r.first == 3); |
| } |
| #endif |
| } |