mirrors/cosmopolitan
1
0
Fork 0
mirror of https://github.com/jart/cosmopolitan.git synced 2025-02-13 09:47:57 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 1
cosmopolitan/test/ctl/vector_test.cc
Justine Tunney c4c812c154
Introduce ctl::set and ctl::map 
We now have a C++ red-black tree implementation that implements standard
template library compatible APIs while compiling 10x faster than libcxx.
It's not as beautiful as the red-black tree implementation in Plinko but
this will get the job done and the test proves it upholds all invariants

This change also restores CheckForMemoryLeaks() support and fixes a real
actual bug I discovered with Doug Lea's dlmalloc_inspect_all() function.
2024-06-23 22:27:11 -07:00

320 lines
7.1 KiB
C++
Raw Blame History

// -*- mode:c++; indent-tabs-mode:nil; c-basic-offset:4; coding:utf-8 -*-
// vi: set et ft=cpp ts=4 sts=4 sw=4 fenc=utf-8 :vi
//
// Copyright 2024 Justine Alexandra Roberts Tunney
//
// Permission to use, copy, modify, and/or distribute this software for
// any purpose with or without fee is hereby granted, provided that the
// above copyright notice and this permission notice appear in all copies.
//
// THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL
// WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED
// WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE
// AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
// DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
// PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
// TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
// PERFORMANCE OF THIS SOFTWARE.
#include "ctl/vector.h"
#include "libc/mem/leaks.h"
#include <cosmo.h>
#include "ctl/string.h"
// #include <string>
// #include <vector>
// #define ctl std
int
main()
{
{
int x = 3;
ctl::vector<int> A;
A.push_back(1);
A.push_back(2);
A.push_back(x);
if (A[0] != 1)
return 1;
if (A[1] != 2)
return 2;
if (A[2] != 3)
return 3;
if (A.size() != 3)
return 4;
}
{
ctl::string yo = "foo";
ctl::vector<ctl::string> A;
A.push_back("fun");
A.push_back(ctl::move(yo));
if (yo != "")
return 5;
A.emplace_back("bar");
if (A[0] != "fun")
return 7;
if (A[1] != "foo")
return 8;
if (A[2] != "bar")
return 9;
if (A.size() != 3)
return 10;
}
{
ctl::vector<int> A;
if (!A.empty())
return 11;
A.push_back(5);
if (A.empty())
return 12;
if (A.front() != 5)
return 13;
if (A.back() != 5)
return 14;
}
{
ctl::vector<int> A;
A.push_back(1);
A.push_back(2);
A.push_back(3);
ctl::vector<int> B(A);
if (B.size() != 3)
return 15;
if (B[0] != 1 || B[1] != 2 || B[2] != 3)
return 16;
}
{
ctl::vector<int> A;
A.push_back(1);
A.push_back(2);
A.push_back(3);
ctl::vector<int> B(ctl::move(A));
if (A.size() != 0)
return 17;
if (B.size() != 3)
return 18;
if (B[0] != 1 || B[1] != 2 || B[2] != 3)
return 19;
}
{
ctl::vector<int> A;
A.push_back(1);
A.push_back(2);
A.push_back(3);
ctl::vector<int> B;
B = A;
if (B.size() != 3)
return 20;
if (B[0] != 1 || B[1] != 2 || B[2] != 3)
return 21;
}
{
ctl::vector<int> A;
A.push_back(1);
A.push_back(2);
A.push_back(3);
ctl::vector<int> B;
B = ctl::move(A);
if (A.size() != 0)
return 22;
if (B.size() != 3)
return 23;
if (B[0] != 1 || B[1] != 2 || B[2] != 3)
return 24;
}
{
ctl::vector<int> A;
A.push_back(1);
A.push_back(2);
A.push_back(3);
A.pop_back();
if (A.size() != 2)
return 25;
if (A[0] != 1 || A[1] != 2)
return 26;
}
{
ctl::vector<int> A;
A.resize(5);
if (A.size() != 5)
return 27;
A.resize(3);
if (A.size() != 3)
return 28;
}
{
ctl::vector<int> A;
A.push_back(1);
A.push_back(2);
A.push_back(3);
ctl::vector<int> B;
B.push_back(4);
B.push_back(5);
A.swap(B);
if (A.size() != 2)
return 29;
if (B.size() != 3)
return 30;
if (A[0] != 4 || A[1] != 5)
return 31;
if (B[0] != 1 || B[1] != 2 || B[2] != 3)
return 32;
}
{
ctl::vector<int> A;
A.push_back(1);
A.push_back(2);
A.push_back(3);
A.clear();
if (A.size() != 0)
return 33;
if (!A.empty())
return 34;
}
{
ctl::vector<int> A;
A.push_back(1);
A.push_back(2);
A.push_back(3);
ctl::vector<int>::iterator it = A.begin();
if (*it != 1)
return 35;
++it;
if (*it != 2)
return 36;
++it;
if (*it != 3)
return 37;
++it;
if (it != A.end())
return 38;
}
{
ctl::vector<int> A;
A.push_back(1);
A.push_back(2);
A.push_back(3);
ctl::vector<int>::const_iterator cit = A.cbegin();
if (*cit != 1)
return 39;
++cit;
if (*cit != 2)
return 40;
++cit;
if (*cit != 3)
return 41;
++cit;
if (cit != A.cend())
return 42;
}
{
ctl::vector<int> A;
for (int i = 0; i < 100; ++i) {
A.push_back(i);
}
if (A.size() != 100)
return 51;
for (int i = 0; i < 100; ++i) {
if (A[i] != i)
return 52;
}
}
{
ctl::vector<int> A;
A.push_back(1);
A.push_back(2);
A.push_back(3);
ctl::vector<int> B(A);
if (B.size() != 3)
return 53;
B.push_back(4);
if (A.size() != 3)
return 54;
if (B.size() != 4)
return 55;
}
{
ctl::vector<int> A;
A.reserve(100);
if (A.size() != 0)
return 56;
if (A.capacity() != 100)
return 57;
A.push_back(1);
if (A.size() != 1)
return 58;
if (A.capacity() != 100)
return 59;
}
{
ctl::vector<int> A;
A.push_back(1);
A.push_back(2);
A.push_back(3);
ctl::vector<int> B;
B = A;
if (B.size() != 3)
return 60;
B.push_back(4);
if (A.size() != 3)
return 61;
if (B.size() != 4)
return 62;
}
{
ctl::vector<int> A;
A.push_back(1);
A.push_back(2);
A.push_back(3);
ctl::vector<int> B;
B = ctl::move(A);
if (A.size() != 0)
return 63;
if (B.size() != 3)
return 64;
if (B[0] != 1 || B[1] != 2 || B[2] != 3)
return 65;
}
{
ctl::vector<int> A;
A.push_back(1);
A.push_back(2);
A.push_back(3);
ctl::vector<int> B;
B.push_back(4);
B.push_back(5);
A.swap(B);
if (A.size() != 2)
return 66;
if (B.size() != 3)
return 67;
if (A[0] != 4 || A[1] != 5)
return 68;
if (B[0] != 1 || B[1] != 2 || B[2] != 3)
return 69;
}
CheckForMemoryLeaks();
return 0;
}
Reference in a new issue View git blame Copy permalink