Language

Collaboration diagram for Language:

Classes
struct	Common
struct	Virtual_A
	ref More...
struct	Virtual_B
struct	Diamond

Functions
void	init_03 ()
void	associative_containers_03 ()
template<class C >
void	test_generic_container (C &c)
template<class V >
void	test_vector_container (V &v)
void	container_03 ()
	container More...
void	sort_03 ()
int &	a_ref (int &a)
	https://en.cppreference.com/w/cpp/language/reference More...
void	types_03 ()

Detailed Description

Function Documentation

a_ref()

int & a_ref

(

int &

a

)

https://en.cppreference.com/w/cpp/language/reference

Definition at line 209 of file 03.cpp.

{ return a; }

Here is the caller graph for this function:

associative_containers_03()

void associative_containers_03

(

)

set

map

multimap

Definition at line 64 of file 03.cpp.

{
    set<int> s;
    s.insert(1);
    s.insert(2);
    assert(*s.find(1) == 1);
    assert(s.find(3) == s.end());
 
    map <char, int> m;
    m['a'] = 1;
    m.insert(make_pair('b', 2));
    ++ m['a'];
    assert(m['a'] == 2);
 
    multimap <char, int> mm;
    mm.insert(make_pair('c', 1));
    mm.insert(make_pair('b', 2));
    mm.insert(make_pair('a', 3));
    mm.insert(make_pair('a', 4));
    multimap<char,int>::iterator i = mm.find('a');
    assert(i->second == 3);
    i++;
    assert(i->second == 4);
    i++;
    assert(i->first == 'b');
    assert(i->second == 2);
}

Here is the caller graph for this function:

container_03()

void container_03

(

)

container

Definition at line 130 of file 03.cpp.

{
    list<int> l;
    test_generic_container(l);
 
    vector<int> v;
    test_generic_container(v);
    test_vector_container(v);
 
    v.reserve(10);
    assert(v.capacity() == 10);
 
    deque<int> d;
    test_generic_container(d);
    test_vector_container(d);
 
    stack<int> s;
    s.push(1);
    assert(s.top() == 1);
    s.push(2);
    assert(s.top() == 2);
    s.pop();
    assert(s.top() == 1);
    s.pop();
    assert(s.empty());
 
    queue<int> q;
    q.push(1);
    q.push(2);
    assert(q.front() == 1);
    assert(q.back() == 2);
    q.pop();
    assert(q.front() == 2);
    q.pop();
    assert(q.empty());
 
    associative_containers_03();
}

Here is the call graph for this function:

Here is the caller graph for this function:

init_03()

void init_03

(

)

Definition at line 23 of file 03.cpp.

{
 
    // https://en.cppreference.com/w/cpp/language/copy_initialization
    int x3 = {3};
    double x4 = {3.0};
 
    struct point { int x, y; };
 
    point p1 = {1, 2};
    (void) p1.x;
    (void) p1.y;
 
#if gcc_extension
    // designated initializers
    // https://gcc.gnu.org/onlinedocs/gcc/Designated-Inits.html
    __extension__
    point gpp_ext = { .x = 1 }; // C99-like gcc extension
    __extension__
    point gcc_ext = { x: 1 }; // C-like gcc extension
#endif
 
    // Mutable
    struct struct_with_mutable {
        struct_with_mutable(){};
        mutable int m;
    } const const_struct_with_mutable;
    const_struct_with_mutable.m = 2;
    assert(const_struct_with_mutable.m == 2);
    int y = 0;
    int& reference = y;
}

Here is the caller graph for this function:

sort_03()

void sort_03

(

)

http://www.cplusplus.com/reference/algorithm/sort/?kw=sort

Compare with lambda::sort_11 and sort_libc

Definition at line 184 of file 03.cpp.

{
    int a[] = {5, 7, 4, 2, 8, 6, 1, 9, 0, 3};
    vector<int> v (a, a + sizeof a / sizeof a[0]);
 
    // using default comparison (operator <):
    sort(v.begin(), v.begin()+4);
 
    // using function as comp
    sort(v.begin() + 4, v.end(), func);
 
    // sort using a standard library compare function object
    sort(v.begin(), v.end(), greater<int>());
 
    // using object as comp
    sort (v.begin(), v.end(), functor);
 
    int prev = -1;
    for (vector<int>::iterator i=v.begin(); i != v.end(); ++i) {
        assert(*i >= prev);
        prev = *i;
    }
}

Here is the caller graph for this function:

test_generic_container()

template<class C >

void test_generic_container

(

C &

c

)

Definition at line 93 of file 03.cpp.

{
    assert(c.empty());
    assert(c.max_size() > 1000);
    c.push_back(0);
    assert(c.front() == 0);
    assert(c.back() == 0);
    assert(c.size() == 1);
    c.erase(c.begin());
    c.push_back(1);
    c.erase(c.begin());
    c.assign(4, 1);
    assert(c.size() == 4);
    c.clear();
}

Here is the caller graph for this function:

test_vector_container()

template<class V >

void test_vector_container

(

V &

v

)

Definition at line 110 of file 03.cpp.

{
    string err;
    try {
        v.at(666) = 0;
    } catch (out_of_range const& exc) {
        err = exc.what();
    }
    assert(err.length());
    assert(v[0] == 1);
    v.resize(4);
 
    int arr[] = {1, 2, 3};
    v.insert(v.begin(), arr, arr+3);
    assert(v[1] == 2);
 
}

Here is the caller graph for this function:

types_03()

void types_03

(

)

Definition at line 224 of file 03.cpp.

{
    int a = 0;
    assert(typeid(int) == typeid(a));
    assert(typeid(int).name() == string("i"));
 
    a_ref(a) = 2;
    assert(a == 2);
 
    Diamond d;
    assert(d.Virtual_A::n == 3);
    assert(d.Virtual_B::n == 3);
}

Here is the call graph for this function:

Here is the caller graph for this function: