diff options
Diffstat (limited to 'libstdc++-v3/testsuite/tr1/6_containers/unordered_set/find')
-rw-r--r-- | libstdc++-v3/testsuite/tr1/6_containers/unordered_set/find/set1.cc | 65 |
1 files changed, 65 insertions, 0 deletions
diff --git a/libstdc++-v3/testsuite/tr1/6_containers/unordered_set/find/set1.cc b/libstdc++-v3/testsuite/tr1/6_containers/unordered_set/find/set1.cc new file mode 100644 index 000000000..67dd20546 --- /dev/null +++ b/libstdc++-v3/testsuite/tr1/6_containers/unordered_set/find/set1.cc @@ -0,0 +1,65 @@ +// { dg-do run } + +// 2005-2-18 Matt Austern <austern@apple.com> +// +// Copyright (C) 2005, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. +// +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. +// +// You should have received a copy of the GNU General Public License along +// with this library; see the file COPYING3. If not see +// <http://www.gnu.org/licenses/>. + +// 6.3.4.3 unordered_set +// find, equal_range, count + +#include <string> +#include <iterator> +#include <algorithm> +#include <tr1/unordered_set> +#include "testsuite_hooks.h" + +bool test __attribute__((unused)) = true; + +void test01() +{ + typedef std::tr1::unordered_set<std::string> Set; + Set s; + VERIFY(s.empty()); + + std::pair<Set::iterator, bool> tmp = s.insert("grape"); + Set::iterator i = tmp.first; + + Set::iterator i2 = s.find("grape"); + VERIFY(i2 != s.end()); + VERIFY(i2 == i); + VERIFY(*i2 == "grape"); + + std::pair<Set::iterator, Set::iterator> p = s.equal_range("grape"); + VERIFY(p.first == i2); + VERIFY(std::distance(p.first, p.second) == 1); + + Set::iterator i3 = s.find("lime"); + VERIFY(i3 == s.end()); + + std::pair<Set::iterator, Set::iterator> p2 = s.equal_range("lime"); + VERIFY(p2.first == p2.second); + + VERIFY(s.count("grape") == 1); + VERIFY(s.count("lime") == 0); +} + +int main() +{ + test01(); + return 0; +} |