--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/stdcpp/tsrc/Stdcpp_test/stlport/auto/stlport_adjfind/src/adjfind2.cpp	Fri Jun 04 16:20:51 2010 +0100
@@ -0,0 +1,75 @@
+/*
+* 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 <string>
+#include <vector>
+#include <algorithm>
+#include <iostream>
+
+#ifdef MAIN
+#define adjfind2_test main
+#endif
+
+#if !defined (STLPORT) || defined(__STL_USE_NAMESPACES)
+using namespace std;
+#endif
+static int equal_length(const char* v1_, const char* v2_)
+{
+  return ::strlen(v1_) == ::strlen(v2_);
+}
+int adjfind2_test(int, char**)
+{
+	
+	cout<<"Results of adjfind2_test:"<<endl;
+	typedef vector <char*> CStrVector;
+
+	char* names[] = { "Brett", "Graham", "Jack", "Mike", "Todd" };
+
+	int failures =0;
+	const int nameCount = sizeof(names)/sizeof(names[0]);
+	CStrVector v(nameCount);
+	for(int i = 0; i < nameCount; i++)
+	v[i] = names[i];
+	CStrVector::iterator location;
+	location = adjacent_find(v.begin(), v.end(), equal_length);
+	if(location != v.end())
+	{
+		cout
+		  << "Found two adjacent strings of equal length: "
+		  << *location
+		  << " -and- "
+		  << *(location + 1)
+		  << endl;
+		//first matching pair should be found at location 2
+	    if (*location != names[2])
+	    	failures++;
+    }
+	else
+	{
+		cout << "Didn't find two adjacent strings of equal length.";
+		failures++;
+	}
+
+	if (!failures)
+		return 0;
+	else
+	return 1;
+}