326 lines
14 KiB
C++
326 lines
14 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <algorithm>
|
|
|
|
// template<class ForwardIterator1, class ForwardIterator2>
|
|
// bool
|
|
// is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
|
|
// ForwardIterator2 first2);
|
|
|
|
#include <algorithm>
|
|
#include <cassert>
|
|
|
|
#include "../../iterators.h"
|
|
|
|
int main()
|
|
{
|
|
{
|
|
const int ia[] = {0};
|
|
const int ib[] = {0};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + 0),
|
|
forward_iterator<const int*>(ib)) == true);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == true);
|
|
}
|
|
{
|
|
const int ia[] = {0};
|
|
const int ib[] = {1};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == false);
|
|
}
|
|
|
|
{
|
|
const int ia[] = {0, 0};
|
|
const int ib[] = {0, 0};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == true);
|
|
}
|
|
{
|
|
const int ia[] = {0, 0};
|
|
const int ib[] = {0, 1};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == false);
|
|
}
|
|
{
|
|
const int ia[] = {0, 0};
|
|
const int ib[] = {1, 0};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == false);
|
|
}
|
|
{
|
|
const int ia[] = {0, 0};
|
|
const int ib[] = {1, 1};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == false);
|
|
}
|
|
{
|
|
const int ia[] = {0, 1};
|
|
const int ib[] = {0, 0};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == false);
|
|
}
|
|
{
|
|
const int ia[] = {0, 1};
|
|
const int ib[] = {0, 1};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == true);
|
|
}
|
|
{
|
|
const int ia[] = {0, 1};
|
|
const int ib[] = {1, 0};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == true);
|
|
}
|
|
{
|
|
const int ia[] = {0, 1};
|
|
const int ib[] = {1, 1};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == false);
|
|
}
|
|
{
|
|
const int ia[] = {1, 0};
|
|
const int ib[] = {0, 0};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == false);
|
|
}
|
|
{
|
|
const int ia[] = {1, 0};
|
|
const int ib[] = {0, 1};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == true);
|
|
}
|
|
{
|
|
const int ia[] = {1, 0};
|
|
const int ib[] = {1, 0};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == true);
|
|
}
|
|
{
|
|
const int ia[] = {1, 0};
|
|
const int ib[] = {1, 1};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == false);
|
|
}
|
|
{
|
|
const int ia[] = {1, 1};
|
|
const int ib[] = {0, 0};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == false);
|
|
}
|
|
{
|
|
const int ia[] = {1, 1};
|
|
const int ib[] = {0, 1};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == false);
|
|
}
|
|
{
|
|
const int ia[] = {1, 1};
|
|
const int ib[] = {1, 0};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == false);
|
|
}
|
|
{
|
|
const int ia[] = {1, 1};
|
|
const int ib[] = {1, 1};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == true);
|
|
}
|
|
|
|
{
|
|
const int ia[] = {0, 0, 0};
|
|
const int ib[] = {1, 0, 0};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == false);
|
|
}
|
|
{
|
|
const int ia[] = {0, 0, 0};
|
|
const int ib[] = {1, 0, 1};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == false);
|
|
}
|
|
{
|
|
const int ia[] = {0, 0, 0};
|
|
const int ib[] = {1, 0, 2};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == false);
|
|
}
|
|
{
|
|
const int ia[] = {0, 0, 0};
|
|
const int ib[] = {1, 1, 0};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == false);
|
|
}
|
|
{
|
|
const int ia[] = {0, 0, 0};
|
|
const int ib[] = {1, 1, 1};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == false);
|
|
}
|
|
{
|
|
const int ia[] = {0, 0, 0};
|
|
const int ib[] = {1, 1, 2};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == false);
|
|
}
|
|
{
|
|
const int ia[] = {0, 0, 0};
|
|
const int ib[] = {1, 2, 0};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == false);
|
|
}
|
|
{
|
|
const int ia[] = {0, 0, 0};
|
|
const int ib[] = {1, 2, 1};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == false);
|
|
}
|
|
{
|
|
const int ia[] = {0, 0, 0};
|
|
const int ib[] = {1, 2, 2};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == false);
|
|
}
|
|
{
|
|
const int ia[] = {0, 0, 1};
|
|
const int ib[] = {1, 0, 0};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == true);
|
|
}
|
|
{
|
|
const int ia[] = {0, 0, 1};
|
|
const int ib[] = {1, 0, 1};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == false);
|
|
}
|
|
{
|
|
const int ia[] = {0, 1, 2};
|
|
const int ib[] = {1, 0, 2};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == true);
|
|
}
|
|
{
|
|
const int ia[] = {0, 1, 2};
|
|
const int ib[] = {1, 2, 0};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == true);
|
|
}
|
|
{
|
|
const int ia[] = {0, 1, 2};
|
|
const int ib[] = {2, 1, 0};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == true);
|
|
}
|
|
{
|
|
const int ia[] = {0, 1, 2};
|
|
const int ib[] = {2, 0, 1};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == true);
|
|
}
|
|
{
|
|
const int ia[] = {0, 0, 1};
|
|
const int ib[] = {1, 0, 1};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == false);
|
|
}
|
|
{
|
|
const int ia[] = {0, 0, 1};
|
|
const int ib[] = {1, 0, 0};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == true);
|
|
}
|
|
{
|
|
const int ia[] = {0, 1, 2, 3, 0, 5, 6, 2, 4, 4};
|
|
const int ib[] = {4, 2, 3, 0, 1, 4, 0, 5, 6, 2};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == true);
|
|
}
|
|
{
|
|
const int ia[] = {0, 1, 2, 3, 0, 5, 6, 2, 4, 4};
|
|
const int ib[] = {4, 2, 3, 0, 1, 4, 0, 5, 6, 0};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::is_permutation(forward_iterator<const int*>(ia),
|
|
forward_iterator<const int*>(ia + sa),
|
|
forward_iterator<const int*>(ib)) == false);
|
|
}
|
|
}
|