text
stringlengths 0
2.2M
|
---|
// bslstl_iterator.t.cpp -*-C++-*-
|
#include <bslstl_iterator.h>
|
#include <bsls_bsltestutil.h>
|
#include <bsls_libraryfeatures.h>
|
#include <bsls_objectbuffer.h>
|
#include <bslstl_set.h>
|
#include <new>
|
#include <stdio.h>
|
#include <stdlib.h>
|
using namespace BloombergLP;
|
//=============================================================================
|
// TEST PLAN
|
//-----------------------------------------------------------------------------
|
// Overview
|
// --------
|
// 'bsl::reverse_iterator' is an iterator adaptor (in-core value-semantic type)
|
// that adapts a more limited type, which offers a basic set of operations, so
|
// that the resulting 'bsl::reverse_iterator' object meets all the requirements
|
// of a standard reverse iterator. These requirements are spelled out in
|
// [reverse.iter.requirements] (24.5.1.2), reverse_iterator requirements. The
|
// primary manipulator of a reverse iterator is the pre-increment operator
|
// which, together with a function that returns an iterator to the start of a
|
// sequence, and a second function to return an iterator to the end of the same
|
// sequence, is sufficient to attain any achievable state. The primary
|
// accessor is the dereference method from which the state can be reasonably
|
// inferred by inspecting the result.
|
//
|
// In order to test this iterator adaptor, a simple container supporting
|
// reverse iterators will be implemented, to provide the basic type to be
|
// adapted. This container will use the 'bsl::reverse_iterator' template to
|
// declare its iterators, as suggested in the usage example.
|
//-----------------------------------------------------------------------------
|
// CLASS 'bsl::reverse_iterator'
|
//
|
// CREATORS
|
// [ 2] bsl::reverse_iterator();
|
// [ 2] bsl::reverse_iterator(ITER x);
|
// [ 7] bsl::reverse_iterator(const bsl::reverse_iterator&);
|
//
|
// MANIPULATORS
|
// [ 2] bsl::reverse_iterator& operator++();
|
// [11] bsl::reverse_iterator operator++(int);
|
// [11] bsl::reverse_iterator& operator+=(typename difference_type n);
|
// [11] bsl::reverse_iterator& operator--();
|
// [11] bsl::reverse_iterator operator--(int);
|
// [11] bsl::reverse_iterator& operator-=(typename difference_type n);
|
//
|
// ACCESSORS
|
// [12] operator+(typename difference_type n) const;
|
// [12] operator-(typename difference_type n) const;
|
//
|
// FREE FUNCTIONS
|
// [ 6] bool operator==(const bsl::reverse_iterator&, bsl::reverse_iterator&);
|
// [ 6] bool operator!=(const bsl::reverse_iterator&, bsl::reverse_iterator&);
|
// [13] bool operator< (const bsl::reverse_iterator&, bsl::reverse_iterator&);
|
// [13] bool operator> (const bsl::reverse_iterator&, bsl::reverse_iterator&);
|
// [13] bool operator<=(const bsl::reverse_iterator&, bsl::reverse_iterator&);
|
// [13] bool operator>=(const bsl::reverse_iterator&, bsl::reverse_iterator&);
|
// [13] bool operator- (const bsl::reverse_iterator&, bsl::reverse_iterator&);
|
// [13] bool operator+ (typename difference_type, bsl::reverse_iterator&);
|
//
|
// other functions
|
// [13] distance(ITER, ITER);
|
// [14] T::iterator begin(T& container);
|
// [14] T::const_iterator begin(const T& container);
|
// [14] T *begin(T (&array)[N]);
|
// [14] T::iterator end(T& container);
|
// [14] T::const_iterator end(const T& container);
|
// [14] T *end(T (&array)[N]);
|
// [14] T::const_iterator cbegin(const T& container);
|
// [14] T::reverse_iterator rbegin(T& container);
|
// [14] T::const_reverse_iterator rbegin(const T& container);
|
// [14] reverse_iterator<T *> rbegin(T (&array)[N]);
|
// [14] reverse_iterator<const T *> rbegin(std::initializer_list<T> il);
|
// [14] T::const_reverse_iterator crbegin(const T& container);
|
// [14] T::const_iterator cend(const T& container);
|
// [14] T::reverse_iterator rend(T& container);
|
// [14] T::const_reverse_iterator rend(const T& container);
|
// [14] reverse_iterator<T *> rend(T (&array)[N]);
|
// [14] reverse_iterator<const T *> rend(std::initializer_list<T> il);
|
// [14] T::const_reverse_iterator crend(const T& container);
|
// [16] size_t size(const CONTAINER&);
|
// [16] ptrdiff_t ssize(const CONTAINER&);
|
//-----------------------------------------------------------------------------
|
// [ 1] BREATHING TEST
|
// [ 3] TESTING (PRIMITIVE) GENERATORS
|
// [ 4] TESTING BASIC ACCESSORS: Not Applicable
|
// [ 5] TESTING OUTPUT: Not Applicable
|
// [ 8] TESTING SWAP: Not Applicable
|
// [ 9] TESTING ASSIGNMENT OPERATOR: Not Applicable
|
// [10] STREAMING FUNCTIONALITY: Not Applicable
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.