/*

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

#include <string>

#include <iterator>

#include <vector>

#include <algorithm>

#include <functional>

#include "iota.h"

#include "cppunit/cppunit_proxy.h"

#if !defined (STLPORT) || defined(_STLP_USE_NAMESPACES)

using namespace std;

#endif

//

// TestCase class

//

class SetUnionTest : public CPPUNIT_NS::TestCase

{

  CPPUNIT_TEST_SUITE(SetUnionTest);

  CPPUNIT_TEST(setunon0);

  CPPUNIT_TEST(setunon1);

  CPPUNIT_TEST(setunon2);

  CPPUNIT_TEST_SUITE_END();

protected:

  void setunon0();

  void setunon1();

  void setunon2();

};

CPPUNIT_TEST_SUITE_REGISTRATION(SetUnionTest);

//

// tests implementation

//

void SetUnionTest::setunon0()

{

  int v1[3] = { 13, 18, 23 };

  int v2[4] = { 10, 13, 17, 23 };

  int result[7] = { 0, 0, 0, 0, 0, 0, 0 };

  set_union((int*)v1, (int*)v1 + 3, (int*)v2, (int*)v2 + 4, (int*)result);

  CPPUNIT_ASSERT(result[0]==10);

  CPPUNIT_ASSERT(result[1]==13);

  CPPUNIT_ASSERT(result[2]==17);

  CPPUNIT_ASSERT(result[3]==18);

  CPPUNIT_ASSERT(result[4]==23);

  CPPUNIT_ASSERT(result[5]==0);

  CPPUNIT_ASSERT(result[6]==0);

}

void SetUnionTest::setunon1()

{

  vector <int> v1(10);

  __iota(v1.begin(), v1.end(), 0);

  vector <int> v2(10);

  __iota(v2.begin(), v2.end(), 7);

  vector<int> diff;

  set_union(v1.begin(), v1.end(), v2.begin(), v2.end(), back_inserter(diff));

  CPPUNIT_ASSERT( diff.size() == 17 );

  for (int i = 0; i < 17; ++i) {

    CPPUNIT_ASSERT( diff[i] == i );

  }

}

void SetUnionTest::setunon2()

{

  char* word1 = "ABCDEFGHIJKLMNO";

  char* word2 = "LMNOPQRSTUVWXYZ";

  string diff;

  set_union(word1, word1 + ::strlen(word1), word2, word2 + ::strlen(word2),

            back_inserter(diff), less<char>());

  CPPUNIT_ASSERT( diff.size() == 26 );

  for (int i = 0; i < 26; ++i) {

    CPPUNIT_ASSERT( diff[i] == ('A' + i) );

  }

}