X-Git-Url: https://oss.titaniummirror.com/gitweb?a=blobdiff_plain;f=libstdc%2B%2B-v3%2Ftestsuite%2Ftr1%2F6_containers%2Funordered_map%2Ffind%2Fmap1.cc;fp=libstdc%2B%2B-v3%2Ftestsuite%2Ftr1%2F6_containers%2Funordered_map%2Ffind%2Fmap1.cc;h=906c326289775bed0de89ed2aab7c301ddc76f1d;hb=6fed43773c9b0ce596dca5686f37ac3fc0fa11c0;hp=0000000000000000000000000000000000000000;hpb=27b11d56b743098deb193d510b337ba22dc52e5c;p=msp430-gcc.git

diff --git a/libstdc++-v3/testsuite/tr1/6_containers/unordered_map/find/map1.cc b/libstdc++-v3/testsuite/tr1/6_containers/unordered_map/find/map1.cc
new file mode 100644
index 00000000..906c3262
--- /dev/null
+++ b/libstdc++-v3/testsuite/tr1/6_containers/unordered_map/find/map1.cc
@@ -0,0 +1,70 @@
+// { 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.4 unordered_map
+// find, equal_range, count
+
+#include <string>
+#include <iterator>
+#include <algorithm>
+#include <utility>
+#include <tr1/unordered_map>
+#include "testsuite_hooks.h"
+
+bool test __attribute__((unused)) = true;
+
+void test01()
+{
+  typedef std::tr1::unordered_map<std::string, int> Map;
+  typedef std::pair<const std::string, int> Pair;
+
+  Map m;
+  VERIFY(m.empty());
+
+  std::pair<Map::iterator, bool> tmp = m.insert(Pair("grape", 3));
+  Map::iterator i = tmp.first;
+  VERIFY(tmp.second);
+
+  Map::iterator i2 = m.find("grape");
+  VERIFY(i2 != m.end());
+  VERIFY(i2 == i);
+  VERIFY(i2->first == "grape");
+  VERIFY(i2->second == 3);
+
+  Map::iterator i3 = m.find("lime");
+  VERIFY(i3 == m.end());
+
+  std::pair<Map::iterator, Map::iterator> p = m.equal_range("grape");
+  VERIFY(std::distance(p.first, p.second) == 1);
+  VERIFY(p.first == i2);
+
+  std::pair<Map::iterator, Map::iterator> p2 = m.equal_range("lime");
+  VERIFY(p2.first == p2.second);
+
+  VERIFY(m.count("grape") == 1);
+  VERIFY(m.count("lime") == 0);
+}
+
+int main()
+{
+  test01();
+  return 0;
+}