#include <memory>
#include <vector>
#include <cstddef>
#include <rw_printf.h>
#include <rw_alg_test.h>
#include <rw_value.h>
#include <rw_driver.h>
#include <rw_new.h>
Go to the source code of this file.
|
| #define | TEST(seq, seqcap, off, ins, res) |
| |
| #define | TEST(seq, seqcap, off, n, ins, res) |
| |
| #define | TEST(seq, seqcap, off, ins, res) |
| |
| #define | UPPER "ABCDEFGHIJKLMNOPQRSTUVWXYZ" |
| |
| #define | LOWER "abcdefghijklmnopqrstuvwxyz" |
| |
|
| _RWSTD_SPECIALIZED_FUNCTION Vector::size_type | __rw::__rw_new_capacity< Vector > (Vector::size_type n, const Vector *) |
| |
| bool | is_forward_category (std::input_iterator_tag) |
| |
| bool | is_forward_category (std::forward_iterator_tag) |
| |
| template<class Iterator > |
| bool | is_forward (const Iterator &it) |
| |
| template<class Iterator > |
| void | exception_loop (int line, const char *fcall, bool capchg, Vector &vec, const Vector::iterator &it, int n, const UserClass *x, const Iterator &first, const Iterator &last, std::size_t *n_copy, std::size_t *n_asgn) |
| |
| template<class Iterator > |
| void | test_insert (int line, const Iterator &dummy, int n, const char *seq, std::size_t seqlen, std::size_t seqcap, int off, const char *ins, std::size_t inslen, const char *res, std::size_t reslen) |
| |
| void | test_insert () |
| |
| template<class Iterator > |
| void | test_insert_range (const Iterator &dummy) |
| |
| void | test_insert_at_end () |
| |
| void | test_complexity () |
| |
| template<class T , class Allocator > |
| void | test_push_back (const std::vector< T, Allocator > *) |
| |
| int | main (int argc, char **argv) |
| |
◆ LOWER
| #define LOWER "abcdefghijklmnopqrstuvwxyz" |
◆ TEST [1/3]
| #define TEST |
( |
|
seq, |
|
|
|
seqcap, |
|
|
|
off, |
|
|
|
ins, |
|
|
|
res |
|
) |
| |
Value: do { \
const char insseq [] = { ins, '\0' }; \
seq, sizeof seq - 1, \
std::size_t (seqcap),
off, \
insseq, 1, \
} while (0)
◆ TEST [2/3]
| #define TEST |
( |
|
seq, |
|
|
|
seqcap, |
|
|
|
off, |
|
|
|
ins, |
|
|
|
res |
|
) |
| |
Value:
seq, sizeof seq - 1, \
std::size_t (seqcap),
off, \
ins, sizeof ins - 1, \
◆ TEST [3/3]
| #define TEST |
( |
|
seq, |
|
|
|
seqcap, |
|
|
|
off, |
|
|
|
n, |
|
|
|
ins, |
|
|
|
res |
|
) |
| |
Value: do { \
const char insseq [] = { ins, '\0' }; \
seq, sizeof seq - 1, \
std::size_t (seqcap),
off, \
insseq, 1, \
} while (0)
◆ UPPER
| #define UPPER "ABCDEFGHIJKLMNOPQRSTUVWXYZ" |
◆ Vector
◆ exception_loop()
| void exception_loop |
( |
int |
line, |
|
|
const char * |
fcall, |
|
|
bool |
capchg, |
|
|
Vector & |
vec, |
|
|
const Vector::iterator & |
it, |
|
|
int |
n, |
|
|
const UserClass * |
x, |
|
|
const Iterator & |
first, |
|
|
const Iterator & |
last, |
|
|
std::size_t * |
n_copy, |
|
|
std::size_t * |
n_asgn |
|
) |
| |
◆ is_forward()
◆ is_forward_category() [1/2]
| bool is_forward_category |
( |
std::forward_iterator_tag |
| ) |
|
◆ is_forward_category() [2/2]
| bool is_forward_category |
( |
std::input_iterator_tag |
| ) |
|
◆ main()
| int main |
( |
int |
argc, |
|
|
char ** |
argv |
|
) |
| |
◆ test_complexity()
◆ test_insert() [1/2]
◆ test_insert() [2/2]
| void test_insert |
( |
int |
line, |
|
|
const Iterator & |
dummy, |
|
|
int |
n, |
|
|
const char * |
seq, |
|
|
std::size_t |
seqlen, |
|
|
std::size_t |
seqcap, |
|
|
int |
off, |
|
|
const char * |
ins, |
|
|
std::size_t |
inslen, |
|
|
const char * |
res, |
|
|
std::size_t |
reslen |
|
) |
| |
◆ test_insert_at_end()
| void test_insert_at_end |
( |
| ) |
|
◆ test_insert_range()
| void test_insert_range |
( |
const Iterator & |
dummy | ) |
|
◆ test_push_back()
| void test_push_back |
( |
const std::vector< T, Allocator > * |
| ) |
|
◆ new_capacity
| Vector::size_type new_capacity |