redgpu/ezEngine: An open source C++ game engine.

Projects/FoundationTest/Containers/DequeTest.cpp
652 строки13 KB
jankrassnigg
Milestone 4
27 мар 2014, 19:08
27 мар 2014, 19:08bfef15a
#include <PCH.h>
#include <Foundation/Configuration/Startup.h>

typedef ezConstructionCounter st;

EZ_CREATE_SIMPLE_TEST(Containers, Deque)
{
  EZ_TEST_BLOCK(ezTestBlock::Enabled, "Fill / Empty (Sawtooth)")
  {
    ezDeque<ezInt32> d;

    ezUInt32 uiVal = 0;

    for (ezInt32 i = 0; i < 10000; ++i)
      d.PushBack(uiVal++);

    // this is kind of the worst case scenario, as it will deallocate and reallocate chunks in every loop
    // the smaller the chunk size, the more allocations will happen
    for (ezUInt32 s2 = 0; s2 < 10; ++s2)
    {
      for (ezInt32 i = 0; i < 1000; ++i)
        d.PopBack();
      for (ezInt32 i = 0; i < 1000; ++i)
        d.PushBack(uiVal++);
    }
  }

  EZ_TEST_BLOCK(ezTestBlock::Enabled, "Fill / Empty")
  {
    ezDeque<ezInt32> d;

    for (ezInt32 i = 0; i < 10000; ++i)
      d.PushBack(i);

    for (ezInt32 i = 0; i < 10000; ++i)
      d.PopFront();
  }

  EZ_TEST_BLOCK(ezTestBlock::Enabled, "Queue Back")
  {
    ezDeque<ezInt32> d;

    d.PushBack(0);

    for (ezInt32 i = 0; i < 10000; ++i)
    {
      d.PushBack(i);
      d.PopFront();
    }

    d.Compact();

    for (ezInt32 i = 0; i < 10000; ++i)
    {
      d.PushBack(i);
      d.PopFront();
    }
  }

  EZ_TEST_BLOCK(ezTestBlock::Enabled, "Queue Front")
  {
    ezDeque<ezInt32> d;

    d.PushBack(0);

    for (ezInt32 i = 0; i < 10000; ++i)
    {
      d.PushFront(i);
      d.PopBack();
    }

    d.Compact();

    for (ezInt32 i = 0; i < 10000; ++i)
    {
      d.PushFront(i);
      d.PopBack();
    }
  }

  EZ_TEST_BLOCK(ezTestBlock::Enabled, "POD Types")
  {
    ezDeque<ezInt32> d1;
    d1.SetCount(5120);

    d1.Compact();

    EZ_TEST_BOOL(d1.GetCount() == 5120);


    d1.SetCount(1);
    d1.Compact();

    d1.Clear();

    d1.Compact();
  }

  ezStartup::ShutdownCore();

  ezStartup::StartupCore();

  EZ_TEST_BLOCK(ezTestBlock::Enabled, "POD Types")
  {
    ezDeque<ezInt32> d1;
    d1.SetCount(1000);

    EZ_TEST_BOOL(d1.GetCount() == 1000);
    d1.Clear();
    EZ_TEST_BOOL(d1.IsEmpty());

    for (ezInt32 i = 1; i < 1000; ++i)
    {
      d1.PushBack(i);

      EZ_TEST_BOOL(d1.PeekBack() == i);
      EZ_TEST_BOOL(d1.GetCount() == i);
      EZ_TEST_BOOL(!d1.IsEmpty());
    }

    d1.Clear();
    EZ_TEST_BOOL(d1.IsEmpty());

    for (ezInt32 i = 1; i < 1000; ++i)
    {
      d1.PushFront(i);

      EZ_TEST_BOOL(d1.PeekFront() == i);
      EZ_TEST_BOOL(d1.GetCount() == i);
      EZ_TEST_BOOL(!d1.IsEmpty());
    }

    d1.Clear();
    EZ_TEST_BOOL(d1.IsEmpty());

    for (ezInt32 i = 1; i <= 1000; ++i)
    {
      d1.PushFront(i);
      d1.PushBack(i);

      EZ_TEST_BOOL(d1.PeekFront() == i);
      EZ_TEST_BOOL(d1.PeekBack() == i);
      EZ_TEST_BOOL(d1.GetCount() == i * 2);
      EZ_TEST_BOOL(!d1.IsEmpty());
    }

    ezDeque<ezInt32> d2;
    d2 = d1;

    for (ezInt32 i = 1000; i >= 1; --i)
    {
      EZ_TEST_BOOL(d1.PeekFront() == i);
      EZ_TEST_BOOL(d1.PeekBack() == i);
      EZ_TEST_BOOL(d1.GetCount() == i * 2);
      EZ_TEST_BOOL(!d1.IsEmpty());

      d1.PopFront();
      d1.PopBack ();


      EZ_TEST_BOOL(d2.PeekFront() == i);
      EZ_TEST_BOOL(d2.PeekBack() == i);
      EZ_TEST_BOOL(d2.GetCount() == i * 2);
      EZ_TEST_BOOL(!d2.IsEmpty());

      d2.PopFront();
      d2.PopBack ();
    }
    
  }

  ezStartup::ShutdownCore();

  ezStartup::StartupCore();

  EZ_TEST_BLOCK(ezTestBlock::Enabled, "Non-POD Types")
  {
    EZ_TEST_BOOL(st::HasAllDestructed());

    {
      ezDeque<st> v1;
      EZ_TEST_BOOL(st::HasDone(0, 0));

      {
        v1.PushBack(st (3));
        EZ_TEST_BOOL(st::HasDone(2, 1));

        v1.PushBack();
        EZ_TEST_BOOL(st::HasDone(1, 0));

        v1.PopBack ();
        EZ_TEST_BOOL(st::HasDone(0, 1));
      }
      {
        v1.PushFront(st (3));
        EZ_TEST_BOOL(st::HasDone(2, 1));

        v1.PushFront();
        EZ_TEST_BOOL(st::HasDone(1, 0));

        v1.PopFront();
        EZ_TEST_BOOL(st::HasDone(0, 1));
      }

      EZ_TEST_BOOL(v1.GetCount() == 2);

      v1.SetCount(12);
      EZ_TEST_BOOL(st::HasDone(10, 0));

      {
        ezDeque<st> v2;
        EZ_TEST_BOOL(st::HasDone(0, 0));

        v2 = v1;
        EZ_TEST_BOOL(st::HasDone(12, 0));

        v2.Clear();
        EZ_TEST_BOOL(st::HasDone(0, 12));

        ezDeque<st> v3 (v1);
        EZ_TEST_BOOL(st::HasDone(12, 0));

        ezDeque<st> v4 (v1);
        EZ_TEST_BOOL(st::HasDone(12, 0));

        v4.SetCount(0);
        EZ_TEST_BOOL(st::HasDone(0, 12));
      }

      EZ_TEST_BOOL(st::HasDone(0, 12));
    }

    EZ_TEST_BOOL(st::HasAllDestructed());
  }

   EZ_TEST_BLOCK(ezTestBlock::Enabled, "SortingPrimitives")
  {
    ezDeque<ezUInt32> list;

    list.Sort();

    for (ezUInt32 i = 0; i < 245; i++)
    {
      list.PushBack(std::rand());
    }
    list.Sort();

    ezUInt32 last = 0;
    for (ezUInt32 i = 0; i < list.GetCount(); i++)
    {
      EZ_TEST_BOOL(last <= list[i]);
      last = list[i];
    }
  }



  EZ_TEST_BLOCK(ezTestBlock::Enabled, "Constructor")
  {
    ezDeque<ezInt32> a1;
    ezDeque<st> a2;

    EZ_TEST_BOOL(a1.GetCount() == 0);
    EZ_TEST_BOOL(a2.GetCount() == 0);
    EZ_TEST_BOOL(a1.IsEmpty());
    EZ_TEST_BOOL(a2.IsEmpty());
  }

  EZ_TEST_BLOCK(ezTestBlock::Enabled, "Copy Constructor")
  {
    ezDeque<ezInt32> a1;

    for (ezInt32 i = 0; i < 32; ++i)
      a1.PushBack(rand() % 100000);

    ezDeque<ezInt32> a2 = a1;
    ezDeque<ezInt32> a3 (a1);

    EZ_TEST_BOOL(a1.GetCount() == a2.GetCount());
    EZ_TEST_BOOL(a1.GetCount() == a3.GetCount());

    for (ezUInt32 i = 0; i < a1.GetCount(); ++i)
    {
      EZ_TEST_BOOL(a1[i] == a2[i]);
      EZ_TEST_BOOL(a1[i] == a3[i]);
      EZ_TEST_BOOL(a2[i] == a3[i]);
    }
  }


  EZ_TEST_BLOCK(ezTestBlock::Enabled, "operator =")
  {
    ezDeque<ezInt32> a1;
    ezDeque<ezInt32> a2;

    for (ezInt32 i = 0; i < 100; ++i)
      a1.PushBack(i);

    a2 = a1;

    EZ_TEST_BOOL(a1.GetCount() == a2.GetCount());

    for (ezUInt32 i = 0; i < a1.GetCount(); ++i)
      EZ_TEST_BOOL(a1[i] == a2[i]);
  }

  EZ_TEST_BLOCK(ezTestBlock::Enabled, "Index operator")
  {
    ezDeque<ezInt32> a1;
    a1.SetCount(100);

    for (ezInt32 i = 0; i < 100; ++i)
      a1[i] = i;

    for (ezInt32 i = 0; i < 100; ++i)
      EZ_TEST_INT(a1[i], i);

    ezDeque<ezInt32> ca1;
    ca1 = a1;

    for (ezInt32 i = 0; i < 100; ++i)
      EZ_TEST_INT(ca1[i], i);
  }

  EZ_TEST_BLOCK(ezTestBlock::Enabled, "SetCount / GetCount / IsEmpty")
  {
    ezDeque<ezInt32> a1;

    EZ_TEST_BOOL(a1.IsEmpty());

    for (ezInt32 i = 0; i < 128; ++i)
    {
      a1.SetCount(i + 1);
      a1[i] = i;

      EZ_TEST_INT(a1.GetCount(), i + 1);
      EZ_TEST_BOOL(!a1.IsEmpty());
    }

    for (ezInt32 i = 0; i < 128; ++i)
      EZ_TEST_INT(a1[i], i);

    for (ezInt32 i = 128; i >= 0; --i)
    {
      a1.SetCount(i);

      EZ_TEST_INT(a1.GetCount(), i);

      for (ezInt32 i2 = 0; i2 < i; ++i2)
        EZ_TEST_INT(a1[i2], i2);
    }

    EZ_TEST_BOOL(a1.IsEmpty());
  }

  EZ_TEST_BLOCK(ezTestBlock::Enabled, "Clear")
  {
    ezDeque<ezInt32> a1;
    a1.Clear();

    a1.PushBack(3);
    a1.Clear();

    EZ_TEST_BOOL(a1.IsEmpty());
  }

  EZ_TEST_BLOCK(ezTestBlock::Enabled, "Contains / IndexOf / LastIndexOf")
  {
    ezDeque<ezInt32> a1;

    for (ezInt32 i = -100; i < 100; ++i)
      EZ_TEST_BOOL(!a1.Contains(i));

    for (ezInt32 i = 0; i < 100; ++i)
      a1.PushBack(i);

    for (ezInt32 i = 0; i < 100; ++i)
    {
      EZ_TEST_BOOL(a1.Contains(i));
      EZ_TEST_INT(a1.IndexOf(i), i);
      EZ_TEST_INT(a1.LastIndexOf(i), i);
    }
  }
  
  EZ_TEST_BLOCK(ezTestBlock::Enabled, "Insert")
  {
    ezDeque<ezInt32> a1;

    // always inserts at the front
    for (ezInt32 i = 0; i < 100; ++i)
      a1.Insert(i, 0);

    for (ezInt32 i = 0; i < 100; ++i)
      EZ_TEST_INT(a1[i], 99 - i);
  }

  EZ_TEST_BLOCK(ezTestBlock::Enabled, "Remove")
  {
    ezDeque<ezInt32> a1;

    for (ezInt32 i = 0; i < 100; ++i)
      a1.PushBack(i % 2);

    while (a1.Remove(1));

    EZ_TEST_BOOL(a1.GetCount() == 50);

    for (ezUInt32 i = 0; i < a1.GetCount(); ++i)
      EZ_TEST_INT(a1[i], 0);
  }

  EZ_TEST_BLOCK(ezTestBlock::Enabled, "RemoveSwap")
  {
    ezDeque<ezInt32> a1;

    for (ezInt32 i = 0; i < 10; ++i)
      a1.Insert(i, i); // inserts at the end

    a1.RemoveSwap(9);
    a1.RemoveSwap(7);
    a1.RemoveSwap(5);
    a1.RemoveSwap(3);
    a1.RemoveSwap(1);

    EZ_TEST_INT(a1.GetCount(), 5);

    for (ezInt32 i = 0; i < 5; ++i)
      EZ_TEST_BOOL(ezMath::IsEven(a1[i]));
  }

  EZ_TEST_BLOCK(ezTestBlock::Enabled, "RemoveAt")
  {
    ezDeque<ezInt32> a1;

    for (ezInt32 i = 0; i < 10; ++i)
      a1.Insert(i, i); // inserts at the end

    a1.RemoveAt(9);
    a1.RemoveAt(7);
    a1.RemoveAt(5);
    a1.RemoveAt(3);
    a1.RemoveAt(1);

    EZ_TEST_INT(a1.GetCount(), 5);

    for (ezInt32 i = 0; i < 5; ++i)
      EZ_TEST_INT(a1[i], i * 2);
  }

  EZ_TEST_BLOCK(ezTestBlock::Enabled, "RemoveAtSwap")
  {
    ezDeque<ezInt32> a1;

    for (ezInt32 i = 0; i < 10; ++i)
      a1.Insert(i, i); // inserts at the end

    a1.RemoveAtSwap(9);
    a1.RemoveAtSwap(7);
    a1.RemoveAtSwap(5);
    a1.RemoveAtSwap(3);
    a1.RemoveAtSwap(1);

    EZ_TEST_INT(a1.GetCount(), 5);

    for (ezInt32 i = 0; i < 5; ++i)
      EZ_TEST_BOOL(ezMath::IsEven(a1[i]));
  }

  EZ_TEST_BLOCK(ezTestBlock::Enabled, "PushBack / PopBack / PeekBack")
  {
    ezDeque<ezInt32> a1;

    for (ezInt32 i = 0; i < 10; ++i)
    {
      a1.PushBack(i);
      EZ_TEST_INT(a1.PeekBack(), i);
    }

    for (ezInt32 i = 9; i >= 0; --i)
    {
      EZ_TEST_INT(a1.PeekBack(), i);
      a1.PopBack();
    }

    a1.PushBack(23);
    a1.PushBack(2);
    a1.PushBack(3);

    a1.PopBack(2);
    EZ_TEST_INT(a1.PeekBack(), 23);
  }

  EZ_TEST_BLOCK(ezTestBlock::Enabled, "PushFront / PopFront / PeekFront")
  {
    ezDeque<ezInt32> a1;

    for (ezInt32 i = 0; i < 10; ++i)
    {
      a1.PushFront(i);
      EZ_TEST_INT(a1.PeekFront(), i);
    }

    for (ezInt32 i = 9; i >= 0; --i)
    {
      EZ_TEST_INT(a1.PeekFront(), i);
      a1.PopFront();
    }

    a1.PushFront(23);
    a1.PushFront(2);
    a1.PushFront(3);

    a1.PopFront(2);
    EZ_TEST_INT(a1.PeekFront(), 23);
  }

  EZ_TEST_BLOCK(ezTestBlock::Enabled, "Construction / Destruction")
  {
    {
      EZ_TEST_BOOL(st::HasAllDestructed());

      ezDeque<st> a1;
      ezDeque<st> a2;

      EZ_TEST_BOOL(st::HasDone(0, 0)); // nothing has been constructed / destructed in between
      EZ_TEST_BOOL(st::HasAllDestructed());

      a1.PushBack(st(1));
      EZ_TEST_BOOL(st::HasDone(2, 1)); // one temporary, one final (copy constructed)

      a1.Insert(st(2), 0);
      EZ_TEST_BOOL(st::HasDone(2, 1)); // one temporary, one final (copy constructed)

      a2 = a1;
      EZ_TEST_BOOL(st::HasDone(2, 0)); // two copies

      a1.Clear();
      EZ_TEST_BOOL(st::HasDone(0, 2));

      a1.PushBack(st(3));
      a1.PushBack(st(4));
      a1.PushBack(st(5));
      a1.PushBack(st(6));

      EZ_TEST_BOOL(st::HasDone(8, 4)); // four temporaries

      a1.Remove(st(3));
      EZ_TEST_BOOL(st::HasDone(1, 2)); // one temporary, one destroyed

      a1.Remove(st(3));
      EZ_TEST_BOOL(st::HasDone(1, 1)); // one temporary, none destroyed

      a1.RemoveAt(0);
      EZ_TEST_BOOL(st::HasDone(0, 1)); // one destroyed

      a1.RemoveAtSwap(0);
      EZ_TEST_BOOL(st::HasDone(0, 1)); // one destroyed
    }

    // tests the destructor of a2 and a1
    EZ_TEST_BOOL(st::HasAllDestructed());
  }

  EZ_TEST_BLOCK(ezTestBlock::Enabled, "Reserve")
  {
    EZ_TEST_BOOL(st::HasAllDestructed());

    ezDeque<st> a;

    EZ_TEST_BOOL(st::HasDone(0, 0)); // nothing has been constructed / destructed in between
    EZ_TEST_BOOL(st::HasAllDestructed());

    a.Reserve(100);

    EZ_TEST_BOOL(st::HasDone(0, 0)); // nothing has been constructed / destructed in between
    EZ_TEST_BOOL(st::HasAllDestructed());

    a.SetCount(10);
    EZ_TEST_BOOL(st::HasDone(10, 0));

    a.Reserve(100);
    EZ_TEST_BOOL(st::HasDone(0, 0));

    a.SetCount(100);
    EZ_TEST_BOOL(st::HasDone(90, 0));

    a.Reserve(200);
    EZ_TEST_BOOL(st::HasDone(0, 0)); // nothing had to be copied over

    a.SetCount(200);
    EZ_TEST_BOOL(st::HasDone(100, 0));
  }

  EZ_TEST_BLOCK(ezTestBlock::Enabled, "Compact")
  {
    EZ_TEST_BOOL(st::HasAllDestructed());

    ezDeque<st> a;

    EZ_TEST_BOOL(st::HasDone(0, 0)); // nothing has been constructed / destructed in between
    EZ_TEST_BOOL(st::HasAllDestructed());

    a.SetCount(100);
    EZ_TEST_BOOL(st::HasDone(100, 0));

    a.SetCount(200);
    EZ_TEST_BOOL(st::HasDone(100, 0));

    a.SetCount(10);
    EZ_TEST_BOOL(st::HasDone(0, 190));

    // no reallocations and copying, if the memory is already available
    a.SetCount(200);
    EZ_TEST_BOOL(st::HasDone(190, 0));

    a.SetCount(10);
    EZ_TEST_BOOL(st::HasDone(0, 190));

    // now we remove the spare memory
    a.Compact();
    EZ_TEST_BOOL(st::HasDone(0, 0));

    // this time the array needs to be relocated, and thus the already present elements need to be copied
    a.SetCount(200);
    EZ_TEST_BOOL(st::HasDone(190, 0));

    // this does not deallocate memory
    a.Clear();
    EZ_TEST_BOOL(st::HasDone(0, 200));

    a.SetCount(100);
    EZ_TEST_BOOL(st::HasDone(100, 0));

    // therefore no object relocation
    a.SetCount(200);
    EZ_TEST_BOOL(st::HasDone(100, 0));

    a.Clear();
    EZ_TEST_BOOL(st::HasDone(0, 200));

    // this will deallocate ALL memory
    a.Compact();

    a.SetCount(100);
    EZ_TEST_BOOL(st::HasDone(100, 0));

    // this time objects need to be relocated
    a.SetCount(200);
    EZ_TEST_BOOL(st::HasDone(100, 0));
  }

}