597 lines
13 KiB
C++
597 lines
13 KiB
C++
#include <iostream>
|
|
#include <string>
|
|
#include "colors.h"
|
|
#include "tests.h"
|
|
|
|
#include <vector>
|
|
|
|
int main() {
|
|
|
|
TEST(vector::vector (constructor))
|
|
{
|
|
// constructors used in the same order as described above:
|
|
std::vector<int> first; // empty vector of ints
|
|
std::vector<int> second (4,100); // four ints with value 100
|
|
std::vector<int> third (second.begin(),second.end()); // iterating through second
|
|
std::vector<int> fourth (third); // a copy of third
|
|
|
|
// the iterator constructor can also be used to construct from arrays:
|
|
int myints[] = {16,2,77,29};
|
|
std::vector<int> fifth (myints, myints + sizeof(myints) / sizeof(int) );
|
|
|
|
std::cout << "The contents of fifth are:";
|
|
for (std::vector<int>::iterator it = fifth.begin(); it != fifth.end(); ++it)
|
|
std::cout << ' ' << *it;
|
|
std::cout << '\n';
|
|
}
|
|
TESTEND
|
|
|
|
TEST(vector::=operator)
|
|
{
|
|
std::vector<int> foo (3,0);
|
|
std::vector<int> bar (5,0);
|
|
|
|
bar = foo;
|
|
foo = std::vector<int>();
|
|
|
|
std::cout << "Size of foo: " << int(foo.size()) << '\n';
|
|
std::cout << "Size of bar: " << int(bar.size()) << '\n';
|
|
}
|
|
TESTEND
|
|
|
|
TEST(vector::begin)
|
|
{
|
|
std::vector<int> myvector;
|
|
for (int i=1; i<=5; i++) myvector.push_back(i);
|
|
|
|
std::cout << "myvector contains:";
|
|
for (std::vector<int>::iterator it = myvector.begin() ; it != myvector.end(); ++it)
|
|
std::cout << ' ' << *it;
|
|
std::cout << '\n';
|
|
}
|
|
TESTEND
|
|
|
|
TEST(vector::end)
|
|
{
|
|
std::vector<int> myvector;
|
|
for (int i=1; i<=5; i++) myvector.push_back(i);
|
|
|
|
std::cout << "myvector contains:";
|
|
for (std::vector<int>::iterator it = myvector.begin() ; it != myvector.end(); ++it)
|
|
std::cout << ' ' << *it;
|
|
std::cout << '\n';
|
|
}
|
|
TESTEND
|
|
|
|
TEST(vector::rbegin)
|
|
{
|
|
std::vector<int> myvector (5); // 5 default-constructed ints
|
|
|
|
int i=0;
|
|
|
|
std::vector<int>::reverse_iterator rit = myvector.rbegin();
|
|
for (; rit!= myvector.rend(); ++rit)
|
|
*rit = ++i;
|
|
|
|
std::cout << "myvector contains:";
|
|
for (std::vector<int>::iterator it = myvector.begin(); it != myvector.end(); ++it)
|
|
std::cout << ' ' << *it;
|
|
std::cout << '\n';
|
|
}
|
|
TESTEND
|
|
|
|
TEST(vector::rend)
|
|
{
|
|
std::vector<int> myvector (5); // 5 default-constructed ints
|
|
|
|
std::vector<int>::reverse_iterator rit = myvector.rbegin();
|
|
|
|
int i=0;
|
|
for (rit = myvector.rbegin(); rit!= myvector.rend(); ++rit)
|
|
*rit = ++i;
|
|
|
|
std::cout << "myvector contains:";
|
|
for (std::vector<int>::iterator it = myvector.begin(); it != myvector.end(); ++it)
|
|
std::cout << ' ' << *it;
|
|
std::cout << '\n';
|
|
}
|
|
TESTEND
|
|
|
|
TEST(vector::size)
|
|
{
|
|
std::vector<int> myints;
|
|
std::cout << "0. size: " << myints.size() << '\n';
|
|
|
|
for (int i=0; i<10; i++) myints.push_back(i);
|
|
std::cout << "1. size: " << myints.size() << '\n';
|
|
|
|
myints.insert (myints.end(),10,100);
|
|
std::cout << "2. size: " << myints.size() << '\n';
|
|
|
|
myints.pop_back();
|
|
std::cout << "3. size: " << myints.size() << '\n';
|
|
}
|
|
TESTEND
|
|
|
|
TEST(vector::max_size)
|
|
{
|
|
std::vector<int> myvector;
|
|
|
|
// set some content in the vector:
|
|
for (int i=0; i<100; i++) myvector.push_back(i);
|
|
|
|
std::cout << "size: " << myvector.size() << "\n";
|
|
std::cout << "capacity: " << myvector.capacity() << "\n";
|
|
std::cout << "max_size: " << myvector.max_size() << "\n";
|
|
}
|
|
TESTEND
|
|
|
|
TEST(vector::resize)
|
|
{
|
|
std::vector<int> myvector;
|
|
|
|
// set some initial content:
|
|
for (int i = 1; i < 10; i++) myvector.push_back(i);
|
|
|
|
myvector.resize(5);
|
|
myvector.resize(8,100);
|
|
myvector.resize(12);
|
|
|
|
std::cout << "myvector contains:";
|
|
for (unsigned int i = 0; i < myvector.size(); i++)
|
|
std::cout << ' ' << myvector[i];
|
|
std::cout << '\n';
|
|
}
|
|
TESTEND
|
|
|
|
TEST(vector::capacity)
|
|
{
|
|
std::vector<int> myvector;
|
|
|
|
// set some content in the vector:
|
|
for (int i=0; i<100; i++) myvector.push_back(i);
|
|
|
|
std::cout << "size: " << (int) myvector.size() << '\n';
|
|
std::cout << "capacity: " << (int) myvector.capacity() << '\n';
|
|
std::cout << "max_size: " << (int) myvector.max_size() << '\n';
|
|
}
|
|
TESTEND
|
|
|
|
TEST(vector::empty)
|
|
{
|
|
std::vector<int> myvector;
|
|
int sum (0);
|
|
|
|
for (int i=1;i<=10;i++) myvector.push_back(i);
|
|
|
|
while (!myvector.empty())
|
|
{
|
|
sum += myvector.back();
|
|
myvector.pop_back();
|
|
}
|
|
|
|
std::cout << "total: " << sum << '\n';
|
|
}
|
|
TESTEND
|
|
|
|
TEST(vector::reserve)
|
|
{
|
|
std::vector<int>::size_type sz;
|
|
|
|
std::vector<int> foo;
|
|
sz = foo.capacity();
|
|
std::cout << "making foo grow:\n";
|
|
for (int i=0; i<100; ++i) {
|
|
foo.push_back(i);
|
|
if (sz!=foo.capacity()) {
|
|
sz = foo.capacity();
|
|
std::cout << "capacity changed: " << sz << '\n';
|
|
}
|
|
}
|
|
|
|
std::vector<int> bar;
|
|
sz = bar.capacity();
|
|
bar.reserve(100); // this is the only difference with foo above
|
|
std::cout << "making bar grow:\n";
|
|
for (int i=0; i<100; ++i) {
|
|
bar.push_back(i);
|
|
if (sz!=bar.capacity()) {
|
|
sz = bar.capacity();
|
|
std::cout << "capacity changed: " << sz << '\n';
|
|
}
|
|
}
|
|
}
|
|
TESTEND
|
|
|
|
TEST(vector::operator[])
|
|
{
|
|
std::vector<int> myvector (10); // 10 zero-initialized elements
|
|
|
|
std::vector<int>::size_type sz = myvector.size();
|
|
|
|
// assign some values:
|
|
for (unsigned i=0; i<sz; i++) myvector[i]=i;
|
|
|
|
// reverse vector using operator[]:
|
|
for (unsigned i=0; i<sz/2; i++)
|
|
{
|
|
int temp;
|
|
temp = myvector[sz-1-i];
|
|
myvector[sz-1-i]=myvector[i];
|
|
myvector[i]=temp;
|
|
}
|
|
|
|
std::cout << "myvector contains:";
|
|
for (unsigned i=0; i<sz; i++)
|
|
std::cout << ' ' << myvector[i];
|
|
std::cout << '\n';
|
|
}
|
|
TESTEND
|
|
|
|
TEST(vector::at)
|
|
{
|
|
std::vector<int> myvector (10); // 10 zero-initialized ints
|
|
|
|
// assign some values:
|
|
for (unsigned i=0; i<myvector.size(); i++)
|
|
myvector.at(i)=i;
|
|
|
|
std::cout << "myvector contains:";
|
|
for (unsigned i=0; i<myvector.size(); i++)
|
|
std::cout << ' ' << myvector.at(i);
|
|
std::cout << '\n';
|
|
}
|
|
TESTEND
|
|
|
|
TEST(vector::front)
|
|
{
|
|
std::vector<int> myvector;
|
|
|
|
myvector.push_back(78);
|
|
myvector.push_back(16);
|
|
|
|
// now front equals 78, and back 16
|
|
|
|
myvector.front() -= myvector.back();
|
|
|
|
std::cout << "myvector.front() is now " << myvector.front() << '\n';
|
|
}
|
|
TESTEND
|
|
|
|
TEST(vector::back)
|
|
{
|
|
std::vector<int> myvector;
|
|
|
|
myvector.push_back(78);
|
|
myvector.push_back(16);
|
|
|
|
// now front equals 78, and back 16
|
|
|
|
myvector.front() -= myvector.back();
|
|
|
|
std::cout << "myvector.front() is now " << myvector.front() << '\n';
|
|
}
|
|
TESTEND
|
|
|
|
TEST(vector::assign)
|
|
{
|
|
std::vector<int> first;
|
|
std::vector<int> second;
|
|
std::vector<int> third;
|
|
|
|
first.assign (7,100); // 7 ints with a value of 100
|
|
|
|
std::vector<int>::iterator it;
|
|
it=first.begin()+1;
|
|
|
|
second.assign (it,first.end()-1); // the 5 central values of first
|
|
|
|
int myints[] = {1776,7,4};
|
|
third.assign (myints,myints+3); // assigning from array.
|
|
|
|
std::cout << "Size of first: " << int (first.size()) << '\n';
|
|
std::cout << "Size of second: " << int (second.size()) << '\n';
|
|
std::cout << "Size of third: " << int (third.size()) << '\n';
|
|
}
|
|
TESTEND
|
|
|
|
TEST(vector::push_back)
|
|
{
|
|
std::vector<int> myvector;
|
|
|
|
// original :
|
|
//
|
|
// int myint;
|
|
// std::cout << "Please enter some integers (enter 0 to end):\n";
|
|
// do {
|
|
// std::cin >> myint;
|
|
// myvector.push_back (myint);
|
|
// } while (myint);
|
|
//
|
|
// replaced by :
|
|
int myint[] = {12434, -2432, 12, 5345, 23, 0, -4, 387, 8432, -934723, 1};
|
|
int size = sizeof(myint) / sizeof(myint[0]);
|
|
for (int i = 0; i < size; i++)
|
|
myvector.push_back (myint[i]);
|
|
|
|
std::cout << "myvector stores " << int(myvector.size()) << " numbers.\n";
|
|
}
|
|
TESTEND
|
|
|
|
TEST(vector::pop_back)
|
|
{
|
|
std::vector<int> myvector;
|
|
int sum (0);
|
|
myvector.push_back (100);
|
|
myvector.push_back (200);
|
|
myvector.push_back (300);
|
|
|
|
while (!myvector.empty())
|
|
{
|
|
sum+=myvector.back();
|
|
myvector.pop_back();
|
|
}
|
|
|
|
std::cout << "The elements of myvector add up to " << sum << '\n';
|
|
}
|
|
TESTEND
|
|
|
|
TEST(vector::insert)
|
|
{
|
|
std::vector<int> myvector (3,100);
|
|
std::vector<int>::iterator it;
|
|
|
|
it = myvector.begin();
|
|
it = myvector.insert ( it , 200 );
|
|
|
|
myvector.insert (it,2,300);
|
|
|
|
// "it" no longer valid, get a new one:
|
|
it = myvector.begin();
|
|
|
|
std::vector<int> anothervector (2,400);
|
|
myvector.insert (it+2,anothervector.begin(),anothervector.end());
|
|
|
|
int myarray [] = { 501,502,503 };
|
|
myvector.insert (myvector.begin(), myarray, myarray+3);
|
|
|
|
std::cout << "myvector contains:";
|
|
for (it=myvector.begin(); it<myvector.end(); it++)
|
|
std::cout << ' ' << *it;
|
|
std::cout << '\n';
|
|
}
|
|
TESTEND
|
|
|
|
TEST(vector::erase)
|
|
{
|
|
std::vector<int> myvector;
|
|
|
|
// set some values (from 1 to 10)
|
|
for (int i=1; i<=10; i++) myvector.push_back(i);
|
|
|
|
// erase the 6th element
|
|
myvector.erase (myvector.begin()+5);
|
|
|
|
// erase the first 3 elements:
|
|
myvector.erase (myvector.begin(),myvector.begin()+3);
|
|
|
|
std::cout << "myvector contains:";
|
|
for (unsigned i=0; i<myvector.size(); ++i)
|
|
std::cout << ' ' << myvector[i];
|
|
std::cout << '\n';
|
|
}
|
|
TESTEND
|
|
|
|
TEST(vector::swap)
|
|
{
|
|
std::vector<int> foo (3,100); // three ints with a value of 100
|
|
std::vector<int> bar (5,200); // five ints with a value of 200
|
|
|
|
foo.swap(bar);
|
|
|
|
std::cout << "foo contains:";
|
|
for (unsigned i=0; i<foo.size(); i++)
|
|
std::cout << ' ' << foo[i];
|
|
std::cout << '\n';
|
|
|
|
std::cout << "bar contains:";
|
|
for (unsigned i=0; i<bar.size(); i++)
|
|
std::cout << ' ' << bar[i];
|
|
std::cout << '\n';
|
|
}
|
|
TESTEND
|
|
|
|
TEST(vector::clear)
|
|
{
|
|
std::vector<int> myvector;
|
|
myvector.push_back (100);
|
|
myvector.push_back (200);
|
|
myvector.push_back (300);
|
|
|
|
std::cout << "myvector contains:";
|
|
for (unsigned i=0; i<myvector.size(); i++)
|
|
std::cout << ' ' << myvector[i];
|
|
std::cout << '\n';
|
|
|
|
myvector.clear();
|
|
myvector.push_back (1101);
|
|
myvector.push_back (2202);
|
|
|
|
std::cout << "myvector contains:";
|
|
for (unsigned i=0; i<myvector.size(); i++)
|
|
std::cout << ' ' << myvector[i];
|
|
std::cout << '\n';
|
|
}
|
|
TESTEND
|
|
|
|
TEST(vector::get_allocator)
|
|
{
|
|
std::vector<int> myvector;
|
|
int * p;
|
|
unsigned int i;
|
|
|
|
// allocate an array with space for 5 elements using vector's allocator:
|
|
p = myvector.get_allocator().allocate(5);
|
|
|
|
// construct values in-place on the array:
|
|
for (i=0; i<5; i++) myvector.get_allocator().construct(&p[i],i);
|
|
|
|
std::cout << "The allocated array contains:";
|
|
for (i=0; i<5; i++) std::cout << ' ' << p[i];
|
|
std::cout << '\n';
|
|
|
|
// destroy and deallocate:
|
|
for (i=0; i<5; i++) myvector.get_allocator().destroy(&p[i]);
|
|
myvector.get_allocator().deallocate(p,5);
|
|
}
|
|
TESTEND
|
|
|
|
|
|
// execute tests and print them :
|
|
|
|
int size = test_list.size();
|
|
for(int i = 0; i < size; i++)
|
|
{
|
|
std::cout
|
|
<< "\n" B_YELLOW "[" << i + 1 << "/" << size << "] "
|
|
<< test_list[i]->title << " :" RESET "\n";
|
|
test_list[i]->func();
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
//
|
|
// original main
|
|
//
|
|
// #include <iostream>
|
|
// #include <string>
|
|
// #include <deque>
|
|
// #if 1 //CREATE A REAL STL EXAMPLE
|
|
// #include <map>
|
|
// #include <stack>
|
|
// #include <vector>
|
|
// namespace ft = std;
|
|
// #else
|
|
// #include <map.hpp>
|
|
// #include <stack.hpp>
|
|
// #include <vector.hpp>
|
|
// #endif
|
|
//
|
|
// #include <stdlib.h>
|
|
//
|
|
// #define MAX_RAM 4294967296
|
|
// #define BUFFER_SIZE 4096
|
|
// struct Buffer
|
|
// {
|
|
// int idx;
|
|
// char buff[BUFFER_SIZE];
|
|
// };
|
|
//
|
|
//
|
|
// #define COUNT (MAX_RAM / (int)sizeof(Buffer))
|
|
//
|
|
// template<typename T>
|
|
// class MutantStack : public ft::stack<T>
|
|
// {
|
|
// public:
|
|
// MutantStack() {}
|
|
// MutantStack(const MutantStack<T>& src) { *this = src; }
|
|
// MutantStack<T>& operator=(const MutantStack<T>& rhs)
|
|
// {
|
|
// this->c = rhs.c;
|
|
// return *this;
|
|
// }
|
|
// ~MutantStack() {}
|
|
//
|
|
// typedef typename ft::stack<T>::container_type::iterator iterator;
|
|
//
|
|
// iterator begin() { return this->c.begin(); }
|
|
// iterator end() { return this->c.end(); }
|
|
// };
|
|
//
|
|
// int main(int argc, char** argv) {
|
|
// if (argc != 2)
|
|
// {
|
|
// std::cerr << "Usage: ./test seed" << std::endl;
|
|
// std::cerr << "Provide a seed please" << std::endl;
|
|
// std::cerr << "Count value:" << COUNT << std::endl;
|
|
// return 1;
|
|
// }
|
|
// const int seed = atoi(argv[1]);
|
|
// srand(seed);
|
|
//
|
|
// ft::vector<std::string> vector_str;
|
|
// ft::vector<int> vector_int;
|
|
// ft::stack<int> stack_int;
|
|
// ft::vector<Buffer> vector_buffer;
|
|
// ft::stack<Buffer, std::deque<Buffer> > stack_deq_buffer;
|
|
// ft::map<int, int> map_int;
|
|
//
|
|
// for (int i = 0; i < COUNT; i++)
|
|
// {
|
|
// vector_buffer.push_back(Buffer());
|
|
// }
|
|
//
|
|
// for (int i = 0; i < COUNT; i++)
|
|
// {
|
|
// const int idx = rand() % COUNT;
|
|
// vector_buffer[idx].idx = 5;
|
|
// }
|
|
// ft::vector<Buffer>().swap(vector_buffer);
|
|
//
|
|
// try
|
|
// {
|
|
// for (int i = 0; i < COUNT; i++)
|
|
// {
|
|
// const int idx = rand() % COUNT;
|
|
// vector_buffer.at(idx);
|
|
// std::cerr << "Error: THIS VECTOR SHOULD BE EMPTY!!" <<std::endl;
|
|
// }
|
|
// }
|
|
// catch(const std::exception& e)
|
|
// {
|
|
// //NORMAL ! :P
|
|
// }
|
|
//
|
|
// for (int i = 0; i < COUNT; ++i)
|
|
// {
|
|
// map_int.insert(ft::make_pair(rand(), rand()));
|
|
// }
|
|
//
|
|
// int sum = 0;
|
|
// for (int i = 0; i < 10000; i++)
|
|
// {
|
|
// int access = rand();
|
|
// sum += map_int[access];
|
|
// }
|
|
// std::cout << "should be constant with the same seed: " << sum << std::endl;
|
|
//
|
|
// {
|
|
// ft::map<int, int> copy = map_int;
|
|
// }
|
|
// MutantStack<char> iterable_stack;
|
|
// for (char letter = 'a'; letter <= 'z'; letter++)
|
|
// iterable_stack.push(letter);
|
|
// for (MutantStack<char>::iterator it = iterable_stack.begin(); it != iterable_stack.end(); it++)
|
|
// {
|
|
// std::cout << *it;
|
|
// }
|
|
// std::cout << std::endl;
|
|
// return (0);
|
|
// }
|
|
//
|
|
//////////////////////////////////////////////////////////////////////////////
|