--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/stdcpp/tsrc/Stdcpp_test/stlport/auto/stlport_search1/src/search2.cpp	Fri Jun 04 16:20:51 2010 +0100
@@ -0,0 +1,136 @@
+/*
+* 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: 
+*
+*/
+ 
+// STLport regression testsuite component.
+// To compile as a separate example, please #define MAIN.
+
+#include <algorithm>
+#include <iostream>
+#include <cstring>
+#include <iterator>
+#include <functional>
+
+#if !defined (STLPORT) || defined(__STL_USE_NAMESPACES)
+using namespace std;
+#endif
+
+#ifdef MAIN 
+#define search2_test main
+#endif
+static bool str_equal(const char* a_, const char* b_)
+{
+  return strcmp(a_, b_) == 0 ? 1 : 0;
+}
+
+int search2_test(int, char**)
+{
+  int failures=0;
+  cout<<"Results of search2_test:"<<endl;
+
+char* grades[] = { "A", "B", "C", "D", "F" };
+char* letters[] = { "Q", "E", "D" };
+
+  const unsigned gradeCount = sizeof(grades) / sizeof(grades[0]);
+  const unsigned letterCount = sizeof(letters) / sizeof(letters[0]);
+  ostream_iterator <char*> iter(cout, " ");
+  cout << "grades: ";
+  copy(grades, grades + gradeCount, iter);
+  
+  if(strcmp("A",grades[0])!=0)
+     failures++;
+  else if(strcmp("B",grades[1])!=0)
+     failures++;   
+  else if(strcmp("C",grades[2])!=0)
+     failures++;   
+  else if(strcmp("D",grades[3])!=0)
+     failures++;   
+  else if(strcmp("F",grades[4])!=0)
+     failures++;          
+  
+  cout << "\nletters:";
+  
+  copy(letters, letters + letterCount, iter);
+  cout << endl;
+  
+   if(strcmp("Q",letters[0])!=0)
+     failures++;
+  else if(strcmp("E",letters[1])!=0)
+     failures++;   
+  else if(strcmp("D",letters[2])!=0)
+     failures++;   
+   
+  char** location =
+    search((char**)grades, (char**)grades + gradeCount,
+            (char**)letters, (char**)letters + letterCount,
+            str_equal);
+
+  if(location == grades + gradeCount)
+    cout << "letters not found in grades" << endl;
+  else
+    cout << "letters found in grades at offset: " << location - grades << endl;
+   
+   if(location != grades + gradeCount)
+     failures++;
+     
+ 
+  copy((char**)grades + 1, (char**)grades + 1 + letterCount, (char**)letters);
+
+  cout << "grades: ";
+  copy(grades, grades + gradeCount, iter);
+  
+   if(strcmp("A" ,grades[0])!=0)
+     failures++;
+  else if(strcmp("B",grades[1])!=0)
+     failures++;   
+  else if(strcmp("C",grades[2])!=0)
+     failures++;   
+  else if(strcmp("D" ,grades[3])!=0)
+     failures++;   
+  else if(strcmp("F" ,grades[4])!=0)
+     failures++;  
+  
+  cout << "\nletters:";
+  copy(letters, letters + letterCount, iter);
+  cout << endl;
+   
+    if(strcmp("B",letters[0])!=0)
+     failures++;
+  else if(strcmp("C",letters[1])!=0)
+     failures++;   
+  else if(strcmp("D",letters[2])!=0)
+     failures++; 
+     
+  location = search((char**)grades, (char**)grades + gradeCount,
+                     (char**)letters, (char**)letters + letterCount,
+                     str_equal);
+
+  if(location == grades + gradeCount)
+    cout << "letters not found in grades" << endl;
+  else
+    cout
+      << "letters found in grades at offset: " << location - grades << endl;
+  
+  if(location == grades + gradeCount)
+    failures++;
+    
+  if(failures)
+    return 1;
+  else   
+    return 0;
+}
+
+