diff options
| author | Eric Fiselier <eric@efcs.ca> | 2014-12-20 01:40:03 +0000 | 
|---|---|---|
| committer | Eric Fiselier <eric@efcs.ca> | 2014-12-20 01:40:03 +0000 | 
| commit | 5a83710e371fe68a06e6e3876c6a2c8b820a8976 (patch) | |
| tree | afde4c82ad6704681781c5cd49baa3fbd05c85db /libcxx/test/std/containers/associative/set/insert_cv.pass.cpp | |
| parent | f11e8eab527fba316c64112f6e05de1a79693a3e (diff) | |
| download | bcm5719-llvm-5a83710e371fe68a06e6e3876c6a2c8b820a8976.tar.gz bcm5719-llvm-5a83710e371fe68a06e6e3876c6a2c8b820a8976.zip | |
Move test into test/std subdirectory.
llvm-svn: 224658
Diffstat (limited to 'libcxx/test/std/containers/associative/set/insert_cv.pass.cpp')
| -rw-r--r-- | libcxx/test/std/containers/associative/set/insert_cv.pass.cpp | 81 | 
1 files changed, 81 insertions, 0 deletions
| diff --git a/libcxx/test/std/containers/associative/set/insert_cv.pass.cpp b/libcxx/test/std/containers/associative/set/insert_cv.pass.cpp new file mode 100644 index 00000000000..18d5c2e0339 --- /dev/null +++ b/libcxx/test/std/containers/associative/set/insert_cv.pass.cpp @@ -0,0 +1,81 @@ +//===----------------------------------------------------------------------===// +// +//                     The LLVM Compiler Infrastructure +// +// This file is dual licensed under the MIT and the University of Illinois Open +// Source Licenses. See LICENSE.TXT for details. +// +//===----------------------------------------------------------------------===// + +// <set> + +// class set + +// pair<iterator, bool> insert(const value_type& v); + +#include <set> +#include <cassert> + +#include "min_allocator.h" + +int main() +{ +    { +        typedef std::set<int> 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); +    } +#if __cplusplus >= 201103L +    { +        typedef std::set<int, std::less<int>, min_allocator<int>> 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 +} | 

