/*
* 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>

#ifdef MAIN 
#define mismtch2_test main
#endif

#if !defined (STLPORT) || defined(__STL_USE_NAMESPACES)
using namespace std;
#endif

bool str_equal(const char* a_, const char* b_)
{
  return strcmp(a_, b_) == 0 ? 1 : 0;
}

int mismtch2_test(int, char**)
{
  cout<<"Results of mismtch2_test:"<<endl;

const unsigned size = 5;
char* n1[size] = { "Brett", "Graham", "Jack", "Mike", "Todd" };
int failures = 0;
  char* n2[size];
  copy(n1, n1 + 5, (char**)n2);
  pair <char**, char**> result = mismatch((char**)n1, (char**)n1 + size, (char**)n2, str_equal);
  if(result.first == n1 + size && result.second == n2 + size)
    cout << "n1 and n2 are the same" << endl;
  else
  {
  		failures++;
      cout << "mismatch at index: " <<(result.first - n1) << endl;
  }
  n2[2] = "QED";
  result = mismatch((char**)n1, (char**)n1 + size, (char**)n2, str_equal);
  if(result.first == n2 + size && result.second == n2 + size)
  {
  			failures++;
      cout << "n1 and n2 are the same" << endl;
  }
  else
    cout << "mismatch at index: " <<(result.first - n1) << endl;
  return failures;
}
