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/strings/basic.string/string.cons/substr.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/strings/basic.string/string.cons/substr.pass.cpp')
-rw-r--r-- | libcxx/test/std/strings/basic.string/string.cons/substr.pass.cpp | 173 |
1 files changed, 173 insertions, 0 deletions
diff --git a/libcxx/test/std/strings/basic.string/string.cons/substr.pass.cpp b/libcxx/test/std/strings/basic.string/string.cons/substr.pass.cpp new file mode 100644 index 00000000000..2a9bf2ac88b --- /dev/null +++ b/libcxx/test/std/strings/basic.string/string.cons/substr.pass.cpp @@ -0,0 +1,173 @@ +//===----------------------------------------------------------------------===// +// +// 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. +// +//===----------------------------------------------------------------------===// + +// <string> + +// basic_string(const basic_string<charT,traits,Allocator>& str, +// size_type pos, size_type n = npos, +// const Allocator& a = Allocator()); + +#include <string> +#include <stdexcept> +#include <algorithm> +#include <cassert> + +#include "test_allocator.h" +#include "min_allocator.h" + +template <class S> +void +test(S str, unsigned pos) +{ + typedef typename S::traits_type T; + typedef typename S::allocator_type A; + try + { + S s2(str, pos); + assert(s2.__invariants()); + assert(pos <= str.size()); + unsigned rlen = str.size() - pos; + assert(s2.size() == rlen); + assert(T::compare(s2.data(), str.data() + pos, rlen) == 0); + assert(s2.get_allocator() == A()); + assert(s2.capacity() >= s2.size()); + } + catch (std::out_of_range&) + { + assert(pos > str.size()); + } +} + +template <class S> +void +test(S str, unsigned pos, unsigned n) +{ + typedef typename S::traits_type T; + typedef typename S::allocator_type A; + try + { + S s2(str, pos, n); + assert(s2.__invariants()); + assert(pos <= str.size()); + unsigned rlen = std::min<unsigned>(str.size() - pos, n); + assert(s2.size() == rlen); + assert(T::compare(s2.data(), str.data() + pos, rlen) == 0); + assert(s2.get_allocator() == A()); + assert(s2.capacity() >= s2.size()); + } + catch (std::out_of_range&) + { + assert(pos > str.size()); + } +} + +template <class S> +void +test(S str, unsigned pos, unsigned n, const typename S::allocator_type& a) +{ + typedef typename S::traits_type T; + typedef typename S::allocator_type A; + try + { + S s2(str, pos, n, a); + assert(s2.__invariants()); + assert(pos <= str.size()); + unsigned rlen = std::min<unsigned>(str.size() - pos, n); + assert(s2.size() == rlen); + assert(T::compare(s2.data(), str.data() + pos, rlen) == 0); + assert(s2.get_allocator() == a); + assert(s2.capacity() >= s2.size()); + } + catch (std::out_of_range&) + { + assert(pos > str.size()); + } +} + +int main() +{ + { + typedef test_allocator<char> A; + typedef std::basic_string<char, std::char_traits<char>, A> S; + + test(S(A(3)), 0); + test(S(A(3)), 1); + test(S("1", A(5)), 0); + test(S("1", A(5)), 1); + test(S("1", A(5)), 2); + test(S("1234567890123456789012345678901234567890123456789012345678901234567890", A(7)), 0); + test(S("1234567890123456789012345678901234567890123456789012345678901234567890", A(7)), 5); + test(S("1234567890123456789012345678901234567890123456789012345678901234567890", A(7)), 50); + test(S("1234567890123456789012345678901234567890123456789012345678901234567890", A(7)), 500); + + test(S(A(3)), 0, 0); + test(S(A(3)), 0, 1); + test(S(A(3)), 1, 0); + test(S(A(3)), 1, 1); + test(S(A(3)), 1, 2); + test(S("1", A(5)), 0, 0); + test(S("1", A(5)), 0, 1); + test(S("1234567890123456789012345678901234567890123456789012345678901234567890", A(7)), 50, 0); + test(S("1234567890123456789012345678901234567890123456789012345678901234567890", A(7)), 50, 1); + test(S("1234567890123456789012345678901234567890123456789012345678901234567890", A(7)), 50, 10); + test(S("1234567890123456789012345678901234567890123456789012345678901234567890", A(7)), 50, 100); + + test(S(A(3)), 0, 0, A(4)); + test(S(A(3)), 0, 1, A(4)); + test(S(A(3)), 1, 0, A(4)); + test(S(A(3)), 1, 1, A(4)); + test(S(A(3)), 1, 2, A(4)); + test(S("1", A(5)), 0, 0, A(6)); + test(S("1", A(5)), 0, 1, A(6)); + test(S("1234567890123456789012345678901234567890123456789012345678901234567890", A(7)), 50, 0, A(8)); + test(S("1234567890123456789012345678901234567890123456789012345678901234567890", A(7)), 50, 1, A(8)); + test(S("1234567890123456789012345678901234567890123456789012345678901234567890", A(7)), 50, 10, A(8)); + test(S("1234567890123456789012345678901234567890123456789012345678901234567890", A(7)), 50, 100, A(8)); + } +#if __cplusplus >= 201103L + { + typedef min_allocator<char> A; + typedef std::basic_string<char, std::char_traits<char>, A> S; + + test(S(A()), 0); + test(S(A()), 1); + test(S("1", A()), 0); + test(S("1", A()), 1); + test(S("1", A()), 2); + test(S("1234567890123456789012345678901234567890123456789012345678901234567890", A()), 0); + test(S("1234567890123456789012345678901234567890123456789012345678901234567890", A()), 5); + test(S("1234567890123456789012345678901234567890123456789012345678901234567890", A()), 50); + test(S("1234567890123456789012345678901234567890123456789012345678901234567890", A()), 500); + + test(S(A()), 0, 0); + test(S(A()), 0, 1); + test(S(A()), 1, 0); + test(S(A()), 1, 1); + test(S(A()), 1, 2); + test(S("1", A()), 0, 0); + test(S("1", A()), 0, 1); + test(S("1234567890123456789012345678901234567890123456789012345678901234567890", A()), 50, 0); + test(S("1234567890123456789012345678901234567890123456789012345678901234567890", A()), 50, 1); + test(S("1234567890123456789012345678901234567890123456789012345678901234567890", A()), 50, 10); + test(S("1234567890123456789012345678901234567890123456789012345678901234567890", A()), 50, 100); + + test(S(A()), 0, 0, A()); + test(S(A()), 0, 1, A()); + test(S(A()), 1, 0, A()); + test(S(A()), 1, 1, A()); + test(S(A()), 1, 2, A()); + test(S("1", A()), 0, 0, A()); + test(S("1", A()), 0, 1, A()); + test(S("1234567890123456789012345678901234567890123456789012345678901234567890", A()), 50, 0, A()); + test(S("1234567890123456789012345678901234567890123456789012345678901234567890", A()), 50, 1, A()); + test(S("1234567890123456789012345678901234567890123456789012345678901234567890", A()), 50, 10, A()); + test(S("1234567890123456789012345678901234567890123456789012345678901234567890", A()), 50, 100, A()); + } +#endif +} |