text
stringlengths 0
2.2M
|
---|
if (verbose) printf("\nTest 'operator+'\n");
|
reverse_iterator it(testData + numElements);
|
for (int i = 1;i < numElements; ++i) {
|
LOOP2_ASSERT(i, *(it + i), it + i != it);
|
LOOP2_ASSERT(i, *(it + i),
|
testData[numElements - i - 1] == *(it + i));
|
}
|
if (verbose) printf("\nTest 'operator-'\n");
|
it += numElements - 1;
|
for (int i = 1;i < numElements; ++i) {
|
LOOP2_ASSERT(i, *(it - 1), it - i != it);
|
LOOP2_ASSERT(i, *(it - 1), testData[i] == *(it - i));
|
}
|
} break;
|
case 11: {
|
// --------------------------------------------------------------------
|
// TESTING OTHER MANIPULATORS
|
//
|
// Concerns:
|
//: 1 All other manipulators of 'bsl::reverse_iterator' work correctly.
|
//
|
// Plan:
|
//: 1 Create reverse iterators 'it1' and 'it2'. Use 'it1' as a
|
//: reference and call different manipulators of 'it2'. Verify 'it2'
|
//: has expected values after each manipulation. (C-1)
|
//
|
// Testing:
|
// bsl::reverse_iterator operator++(int);
|
// bsl::reverse_iterator& operator+=(typename difference_type n);
|
// bsl::reverse_iterator& operator--();
|
// bsl::reverse_iterator operator--(int);
|
// bsl::reverse_iterator& operator-=(typename difference_type n);
|
// --------------------------------------------------------------------
|
if (verbose) printf("\nTESTING OTHER MANIPULATORS"
|
"\n==========================\n");
|
// Declare test data and types.
|
int testData[] = { 42, 13, 56, 72, };
|
int numElements = sizeof(testData) / sizeof(int);
|
typedef int *iterator;
|
typedef int const *const_iterator;
|
typedef bsl::reverse_iterator<iterator> reverse_iterator;
|
typedef bsl::reverse_iterator<const_iterator> const_reverse_iterator;
|
reverse_iterator it1(testData + numElements);
|
#if !defined(BSLS_ITERATOR_NO_MIXED_OPS_IN_CPP03)
|
const_reverse_iterator it2 = it1;
|
#else
|
reverse_iterator it2 = it1;
|
#endif
|
if (verbose) printf("\nTest post-increment\n");
|
it2++;
|
it2++;
|
ASSERT(it2 != it1);
|
ASSERT(*it2 == testData[numElements - 3]);
|
ASSERT(*it1 == testData[numElements - 1]);
|
if (verbose) printf("\nTest pre-decrement\n");
|
--it2;
|
ASSERT(it2 != it1);
|
ASSERT(*it2 == testData[numElements - 2]);
|
ASSERT(*it1 == testData[numElements - 1]);
|
if (verbose) printf("\nTest post-decrement\n");
|
it2--;
|
ASSERT(it2 == it1);
|
ASSERT(*it2 == testData[numElements - 1]);
|
ASSERT(*it1 == testData[numElements - 1]);
|
if (verbose) printf("\nTest 'operator+='\n");
|
it2 += numElements - 1;
|
ASSERT(it2 != it1);
|
ASSERT(*it2 == testData[0]);
|
ASSERT(*it1 == testData[numElements - 1]);
|
if (verbose) printf("\nTest 'operator-='\n");
|
it2 -= numElements - 1;
|
ASSERT(it2 == it1);
|
ASSERT(*it2 == testData[numElements - 1]);
|
ASSERT(*it1 == testData[numElements - 1]);
|
} break;
|
case 10: {
|
// --------------------------------------------------------------------
|
// STREAMING FUNCTIONALITY: Not Applicable
|
// --------------------------------------------------------------------
|
} break;
|
case 9: {
|
// --------------------------------------------------------------------
|
// TESTING ASSIGNMENT OPERATOR: Not Applicable
|
// The 'operator=' method of 'bsl::reverse_iterator' is directly
|
// inherited from 'std::reverse_iterator'.
|
// --------------------------------------------------------------------
|
} break;
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.