--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/genericopenlibs/cppstdlib/stl/test/unit/search_test.cpp	Fri Jun 04 16:20:51 2010 +0100
@@ -0,0 +1,105 @@
+/*
+* Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
+* All rights reserved.
+* This component and the accompanying materials are made available
+* under the terms of "Eclipse Public License v1.0"
+* which accompanies this distribution, and is available
+* at the URL "http://www.eclipse.org/legal/epl-v10.html".
+*
+* Initial Contributors:
+* Nokia Corporation - initial contribution.
+*
+* Contributors:
+*
+* Description: 
+*
+*/
+#include <vector>
+#include <numeric>
+#include <algorithm>
+
+#include "iota.h"
+#include "cppunit/cppunit_proxy.h"
+
+#if !defined (STLPORT) || defined(_STLP_USE_NAMESPACES)
+using namespace std;
+#endif
+
+//
+// TestCase class
+//
+class SearchTest : public CPPUNIT_NS::TestCase
+{
+  CPPUNIT_TEST_SUITE(SearchTest);
+  CPPUNIT_TEST(search0);
+  CPPUNIT_TEST(search1);
+  CPPUNIT_TEST(search2);
+  CPPUNIT_TEST_SUITE_END();
+
+protected:
+  void search0();
+  void search1();
+  void search2();
+
+  static bool str_equal(const char* a_, const char* b_)
+  {
+    return strcmp(a_, b_) == 0 ? 1 : 0;
+  }
+};
+
+CPPUNIT_TEST_SUITE_REGISTRATION(SearchTest);
+
+//
+// tests implementation
+//
+void SearchTest::search0()
+{
+  int v1[6] = { 1, 1, 2, 3, 5, 8 };
+  int v2[6] = { 0, 1, 2, 3, 4, 5 };
+  int v3[2] = { 3, 4 };
+
+  int* location;
+  location = search((int*)v1, (int*)v1 + 6, (int*)v3, (int*)v3 + 2);
+  CPPUNIT_ASSERT(location == v1 + 6);
+
+  location = search((int*)v2, (int*)v2 + 6, (int*)v3, (int*)v3 + 2);
+  CPPUNIT_ASSERT(location != v2 + 6);
+  CPPUNIT_ASSERT(location - v2 == 3);
+}
+void SearchTest::search1()
+{
+  typedef vector <int> IntVec;
+  IntVec v1(10);
+  __iota(v1.begin(), v1.end(), 0);
+  IntVec v2(3);
+  __iota(v2.begin(), v2.end(), 50);
+
+  IntVec::iterator location;
+  location = search(v1.begin(), v1.end(), v2.begin(), v2.end());
+
+  CPPUNIT_ASSERT(location == v1.end());
+
+  __iota(v2.begin(), v2.end(), 4);
+
+  location = search(v1.begin(), v1.end(), v2.begin(), v2.end());
+
+  CPPUNIT_ASSERT(location != v1.end());
+  CPPUNIT_ASSERT(location - v1.begin() == 4);
+}
+void SearchTest::search2()
+{
+  char const* grades[] = { "A", "B", "C", "D", "F" };
+  char const* letters[] = { "Q", "E", "D" };
+  const unsigned gradeCount = sizeof(grades) / sizeof(grades[0]);
+  const unsigned letterCount = sizeof(letters) / sizeof(letters[0]);
+  char const** location = search((char const**)grades, (char const**)grades + gradeCount, (char const**)letters, (char const**)letters + letterCount, str_equal);
+
+  CPPUNIT_ASSERT(location == grades + gradeCount);
+
+  copy((char const**)grades + 1, (char const**)grades + 1 + letterCount, (char const**)letters);
+  location = search((char const**)grades, (char const**)grades + gradeCount, (char const**)letters, (char const**)letters + letterCount, str_equal);
+
+  CPPUNIT_ASSERT(location != grades + gradeCount);
+  CPPUNIT_ASSERT(location - grades == 1);
+
+}