mirror of
https://github.com/reactos/reactos.git
synced 2025-08-05 02:05:50 +00:00
Git conversion: Make reactos the root directory, move rosapps, rostests, wallpapers into modules, and delete rossubsys.
This commit is contained in:
parent
b94e2d8ca0
commit
c2c66aff7d
24198 changed files with 0 additions and 37285 deletions
82
sdk/lib/3rdparty/stlport/test/unit/mismatch_test.cpp
vendored
Normal file
82
sdk/lib/3rdparty/stlport/test/unit/mismatch_test.cpp
vendored
Normal file
|
@ -0,0 +1,82 @@
|
|||
#include <numeric>
|
||||
#include <vector>
|
||||
#include <algorithm>
|
||||
|
||||
#include "iota.h"
|
||||
#include "cppunit/cppunit_proxy.h"
|
||||
|
||||
#if !defined (STLPORT) || defined(_STLP_USE_NAMESPACES)
|
||||
using namespace std;
|
||||
#endif
|
||||
|
||||
//
|
||||
// TestCase class
|
||||
//
|
||||
class MismatchTest : public CPPUNIT_NS::TestCase
|
||||
{
|
||||
CPPUNIT_TEST_SUITE(MismatchTest);
|
||||
CPPUNIT_TEST(mismatch0);
|
||||
CPPUNIT_TEST(mismatch1);
|
||||
CPPUNIT_TEST(mismatch2);
|
||||
CPPUNIT_TEST_SUITE_END();
|
||||
|
||||
protected:
|
||||
void mismatch0();
|
||||
void mismatch1();
|
||||
void mismatch2();
|
||||
};
|
||||
|
||||
CPPUNIT_TEST_SUITE_REGISTRATION(MismatchTest);
|
||||
|
||||
//
|
||||
// tests implementation
|
||||
//
|
||||
bool str_equal(const char* a_, const char* b_)
|
||||
{
|
||||
return strcmp(a_, b_) == 0 ? 1 : 0;
|
||||
}
|
||||
void MismatchTest::mismatch0()
|
||||
{
|
||||
int n1[5] = { 1, 2, 3, 4, 5 };
|
||||
int n2[5] = { 1, 2, 3, 4, 5 };
|
||||
int n3[5] = { 1, 2, 3, 2, 1 };
|
||||
|
||||
pair <int*, int*> result = mismatch((int*)n1, (int*)n1 + 5, (int*)n2);
|
||||
CPPUNIT_ASSERT(result.first ==(n1 + 5) && result.second ==(n2 + 5));
|
||||
|
||||
result = mismatch((int*)n1, (int*)n1 + 5, (int*)n3);
|
||||
CPPUNIT_ASSERT(!(result.first ==(n1 + 5) && result.second ==(n3 + 5)));
|
||||
CPPUNIT_ASSERT((result.first - n1)==3);
|
||||
}
|
||||
void MismatchTest::mismatch1()
|
||||
{
|
||||
typedef vector<int> IntVec;
|
||||
IntVec v1(10);
|
||||
__iota(v1.begin(), v1.end(), 0);
|
||||
IntVec v2(v1);
|
||||
|
||||
pair <IntVec::iterator, IntVec::iterator> result = mismatch(v1.begin(), v1.end(), v2.begin());
|
||||
|
||||
CPPUNIT_ASSERT(result.first == v1.end() && result.second == v2.end());
|
||||
|
||||
v2[v2.size()/2] = 42;
|
||||
result = mismatch(v1.begin(), v1.end(), v2.begin());
|
||||
CPPUNIT_ASSERT(!(result.first == v1.end() && result.second == v2.end()));
|
||||
CPPUNIT_ASSERT((result.first - v1.begin())==5);
|
||||
}
|
||||
void MismatchTest::mismatch2()
|
||||
{
|
||||
const unsigned size = 5;
|
||||
char const* n1[size] = { "Brett", "Graham", "Jack", "Mike", "Todd" };
|
||||
|
||||
char const* n2[size];
|
||||
copy(n1, n1 + 5, (char const**)n2);
|
||||
pair <char const**, char const**> result = mismatch((char const**)n1, (char const**)n1 + size, (char const**)n2, str_equal);
|
||||
|
||||
CPPUNIT_ASSERT(result.first == n1 + size && result.second == n2 + size);
|
||||
|
||||
n2[2] = "QED";
|
||||
result = mismatch((char const**)n1, (char const**)n1 + size, (char const**)n2, str_equal);
|
||||
CPPUNIT_ASSERT(!(result.first == n2 + size && result.second == n2 + size));
|
||||
CPPUNIT_ASSERT((result.first - n1)==2);
|
||||
}
|
Loading…
Add table
Add a link
Reference in a new issue