Subversion Repositories openrisc

// Copyright (C) 2005, 2009 Free Software Foundation, Inc.

//

// This file is part of the GNU ISO C++ Library.  This library is free

// software; you can redistribute it and/or modify it under the

// terms of the GNU General Public License as published by the

// Free Software Foundation; either version 3, or (at your option)

// any later version.

// This library is distributed in the hope that it will be useful,

// but WITHOUT ANY WARRANTY; without even the implied warranty of

// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License along

// with this library; see the file COPYING3.  If not see

// <http://www.gnu.org/licenses/>.

// 25.3.5.3 [lib.set.intersection]

#include <algorithm>

#include <testsuite_hooks.h>

#include <testsuite_iterators.h>

using __gnu_test::test_container;

using __gnu_test::input_iterator_wrapper;

using __gnu_test::output_iterator_wrapper;

using std::set_intersection;

typedef test_container<int, input_iterator_wrapper> Icontainer;

typedef test_container<int, output_iterator_wrapper> Ocontainer;

void

test1()

{

  int array1[1], array2[1];

  Icontainer con1(array1, array1);

  Icontainer con2(array1, array1);

  Ocontainer con3(array2, array2);

  VERIFY(set_intersection(con1.begin(), con1.end(), con2.begin(), con2.end(),

                   con3.begin()).ptr == array2);

}

void

test2()

{

  int array1[] = {1};

  int array2[] = {0};

  Icontainer con1(array1, array1);

  Icontainer con2(array1, array1 + 1);

  Ocontainer con3(array2, array2);

  VERIFY(set_intersection(con1.begin(), con1.end(), con2.begin(), con2.end(),

                          con3.begin()).ptr == array2);

}

void

test3()

{

  int array1[] = {1};

  int array2[] = {0};

  Icontainer con1(array1, array1 + 1);

  Icontainer con2(array1, array1);

  Ocontainer con3(array2, array2);

  VERIFY(set_intersection(con1.begin(), con1.end(), con2.begin(), con2.end(),

                          con3.begin()).ptr == array2);

}

void

test4()

{

  int array1[]={0,1,1,2,4};

  int array2[]={1,2,3};

  int array3[6];

  Icontainer con1(array1, array1 + 5);

  Icontainer con2(array2, array2 + 3);

  Ocontainer con3(array3, array3 + 2);

  VERIFY(set_intersection(con1.begin(), con1.end(), con2.begin(), con2.end(),

                          con3.begin()).ptr == array3 + 2);

  VERIFY(array3[0] == 1 && array3[1] == 2);

}

struct S

{

  int i;

  int j;

  S() {}

  S(int in)

  {

    if(in > 0)

    {

      i = in;

      j = 1;

    }

    else

    {

      i = -in;

      j = 0;

    }

  }

};

bool

operator<(const S& s1, const S& s2)

{ return s1.i < s2.i; }

typedef test_container<S, input_iterator_wrapper> SIcontainer;

typedef test_container<S, output_iterator_wrapper> SOcontainer;

void

test5()

{

  S array1[] = { -1, -1, -1, -2, -2, -4};

  S array2[] = { 1, 1, 1, 1, 2, 3, 4, 4};

  S array3[5];

  SIcontainer con1(array1, array1 + 6);

  SIcontainer con2(array2, array2 + 8);

  SOcontainer con3(array3, array3 + 5);

  VERIFY(set_intersection(con1.begin(), con1.end(), con2.begin(), con2.end(),

                   con3.begin()).ptr == array3 + 5);

  for(int i = 0; i < 5; ++i)

    VERIFY(array3[i].j == 0);

}

int main()

{

  test1();

  test2();

  test3();

  test4();

  test5();

}