Datasets:
shibing624
/
source_code

Dataset card Data Studio Files Community
2
text
stringlengths
0
2.2M
reverse_iterator itData (testData + numElements);
ASSERT( 3 == *itcOrigin);
ASSERT( 3 == *itData );
ASSERT(itcDefault != itcOrigin );
ASSERT(itDefault != itData );
// Confirm that an incremented iterator does not have the same value
// as the initial iterator.
++itData;
ASSERT(itcOrigin != itData);
ASSERT(2 == *itData);
// Confirm that incrementing a second copy of the initial iterator
// has the same value as the first incremented iterator.
#if !defined(BSLS_ITERATOR_NO_MIXED_OPS_IN_CPP03)
const_reverse_iterator itData2(testData + numElements);
#else
reverse_iterator itData2(testData + numElements);
#endif
ASSERT(itcOrigin == itData2);
++itData2;
ASSERT(itcOrigin != itData2);
ASSERT(2 == *itData2);
} break;
case 1: {
// --------------------------------------------------------------------
// BREATHING TEST
//
// Concerns:
//: 1 That basic functionality appears to work as advertised before
//: before beginning testing in earnest:
//: - default and copy constructors
//: - assignment operator
//: - primary manipulators, basic accessors
//: - 'operator==', 'operator!='
//
// Plan:
//: 1 Test all public methods mentioned in concerns. (C-1)
//
// Testing:
// BREATHING TEST
// --------------------------------------------------------------------
if (verbose) printf("\nBREATHING TEST"
"\n==============\n");
int testData[] = { 0, 1, 2, 3 };
typedef int *iterator;
typedef int const *const_iterator;
typedef bsl::reverse_iterator<iterator> reverse_iterator;
typedef bsl::reverse_iterator<const_iterator> const_reverse_iterator;
if (verbose) printf("\nConstruct a basic reverse iterator value\n");
reverse_iterator it1(testData + 3);
LOOP_ASSERT( *it1, 2 == *it1);
if (verbose) printf("\nMake a copy of that iterator\n");
reverse_iterator it2(it1);
LOOP_ASSERT( *it2, 2 == *it2);
LOOP2_ASSERT(&*it1, &*it2, it1 == it2);
LOOP2_ASSERT(&*it1, &*it2, &*it1 == &*it2);
if (verbose) printf("\nIncrement an iterator\n");
++it2;
LOOP_ASSERT( *it2, 1 == *it2);
LOOP2_ASSERT(&*it1, &*it2, it1 != it2);
LOOP2_ASSERT(&*it1, &*it2, &*it1 != &*it2);
// Increment the other iterator iterator, verify both iterators have
// the same value again.
if (verbose) printf(
"\nVerify multipass property of reverse iterator\n");
++it1;
LOOP_ASSERT( *it1, 1 == *it1);
LOOP2_ASSERT(&*it1, &*it2, it1 == it2);
LOOP2_ASSERT(&*it1, &*it2, &*it1 == &*it2);
if (verbose) printf("\nConstruct a 'const_reverse_iterator'\n");
const_reverse_iterator itEnd(testData + 4);
if (verbose) printf("\nMake a copy of 'const_reverse_iterator'\n");
const_reverse_iterator itBegin(it1);
bsl::iterator_traits<
const_reverse_iterator>::difference_type distance =
bsl::distance(itEnd, itBegin);
LOOP_ASSERT(distance, 2 == distance);
if (verbose) printf(
"\nVerify writing through a dereferenced iterator\n");
*it1 = 42;
LOOP_ASSERT( *it1, 42 == *it1);
if (verbose) printf(
"\nVerify that writes through one iterator are visible through another\n");