ah-dry.cc

Go to the documentation of this file.

 
/*
                          Aleph_w
 
  Data structures & Algorithms
  version 2.0.0b
  https://github.com/lrleon/Aleph-w
 
  This file is part of Aleph-w library
 
  Copyright (c) 2002-2026 Leandro Rabindranath Leon
 
  Permission is hereby granted, free of charge, to any person obtaining a copy
  of this software and associated documentation files (the "Software"), to deal
  in the Software without restriction, including without limitation the rights
  to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  copies of the Software, and to permit persons to whom the Software is
  furnished to do so, subject to the following conditions:
 
  The above copyright notice and this permission notice shall be included in all
  copies or substantial portions of the Software.
 
  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  SOFTWARE.
*/
 
 
 
# include <gtest/gtest.h>
 
# include <map>
# include <vector>
# include <ah-zip.H>
# include <ahFunctional.H>
# include <ah-string-utils.H>
# include <ahSort.H>
# include <htlist.H>
# include <tpl_arrayHeap.H>
# include <tpl_dynArrayHeap.H>
# include <tpl_dynBinHeap.H>
# include <tpl_dynDlist.H>
# include <tpl_dynSetTree.H>
# include <tpl_hash.H>
# include <tpl_dynSetHash.H>
# include <tpl_dynArray.H>
# include <tpl_arrayQueue.H>
# include <tpl_dynListStack.H>
# include <tpl_dynarray_set.H>
# include <tpl_random_queue.H>
 
using namespace std;
using namespace testing;
using namespace Aleph;
 
template <class Ctype>
struct Container : public testing::Test
{
  static constexpr size_t N = 1000;
  Ctype c;
  DynList<int> item_list;
  Container()
  {
    for (size_t i = 0; i < N; ++i)
      {
  c.append(i);
  item_list.append(i);
      }
    item_list = sort(item_list);
  }
};
 
TYPED_TEST_SUITE_P(Container);
 
TYPED_TEST_P(Container, traverse)
{
  auto N = this->N;
  TypeParam c = this->c;
  EXPECT_EQ(c.size(), N);
  DynList<int> l;
  EXPECT_TRUE(c.traverse([&l] (auto & k) { l.append(k); return true; }));
  EXPECT_TRUE(zip_all([] (auto t) { return get<0>(t) == get<1>(t); },
          this->item_list, sort(l)));
}
 
TYPED_TEST_P(Container, for_each)
{
  auto N = this->N;
  TypeParam c = this->c;
  EXPECT_EQ(c.size(), N);
  DynList<int> l;
  c.for_each([&l] (auto & k) { l.append(k); });
  EXPECT_TRUE(zip_all([] (auto t) { return get<0>(t) == get<1>(t); },
          this->item_list, sort(l)));
}
 
TYPED_TEST_P(Container, find_ptr)
{
  auto N = this->N;
  TypeParam c = this->c;
  EXPECT_EQ(c.size(), N);
  auto ptr = c.find_ptr([N] (auto & k) { return k == int(N); });
  EXPECT_EQ(ptr, nullptr);
  this->item_list.for_each([&c] (auto & k)
    {
      auto ptr = c.find_ptr([k] (auto i) { return k == i; });
      ASSERT_NE(ptr, nullptr);
      ASSERT_EQ(*ptr, k);
    });
}
 
TYPED_TEST_P(Container, find_index_nth)
{
  auto N = this->N;
  TypeParam c = this->c;
  EXPECT_EQ(c.size(), N);
 
  auto idx = c.find_index([N] (auto & k) { return k == int(N); });
  ASSERT_EQ(idx, N);
 
  this->item_list.for_each([&c] (auto & k)
    {
      auto idx = c.find_index([k] (auto i) { return k == i; });
      ASSERT_EQ(c.nth(idx), k);
    });
}
 
TYPED_TEST_P(Container, find_item)
{
  auto N = this->N;
  TypeParam c = this->c;
  EXPECT_EQ(c.size(), N);
 
  auto t = c.find_item([N] (auto & k) { return k == int(N); });
  ASSERT_FALSE(get<0>(t));
 
  this->item_list.for_each([&c] (auto & k)
    {
      auto t = c.find_item([k] (auto i) { return k == i; });
      EXPECT_TRUE(get<0>(t));
      ASSERT_EQ(get<1>(t), k);
    });
}
 
TYPED_TEST_P(Container, iterator_operations)
{
  //auto N = this->N;
  auto c = this->c;
  const DynList<int> l = to_dynlist(c); // in the same order than iterator
  const std::vector<int> v = c.to_vector(); // test to_vector method
  const DynList<int> l2 = c.to_dynlist(); // test to_dynlist method
 
  ASSERT_EQ(l.size(), c.size());
  ASSERT_EQ(v.size(), c.size());
  ASSERT_EQ(l2.size(), c.size());
  
  // Verify to_vector and to_dynlist produce same content
  size_t idx = 0;
  l2.for_each([&v, &idx](int x) {
    EXPECT_EQ(x, v[idx++]);
  });
 
  auto itl = l.get_it();
  for (auto & item : c)
    {
      ASSERT_EQ(item, itl.get_curr_ne());
      itl.next_ne();
    }
  auto it = c.get_it();
  EXPECT_EQ(it.get_curr_ne(), l.get_first());
  it.reset_last();
  EXPECT_EQ(it.get_curr_ne(), l.get_last());
  it.reset_first();
  EXPECT_EQ(it.get_curr_ne(), l.get_first());
  it.reset_last();
  EXPECT_EQ(it.get_curr_ne(), l.get_last());
}
 
TYPED_TEST_P(Container, nappend)
{
  int N = this->N;
  auto c = this->c;
 
  c.nappend(N);
  auto ptr = c.find_ptr([N] (auto i) { return i == N; });
  EXPECT_EQ(c.size(), N + 1);
  ASSERT_NE(ptr, nullptr);
  EXPECT_EQ(*ptr, N);
 
  c.nappend(N + 1, N + 2, N + 3);
  EXPECT_EQ(c.size(), N + 4);
 
  ptr = c.find_ptr([N] (auto i) { return i == N + 1; });
  ASSERT_NE(ptr, nullptr);
  EXPECT_EQ(*ptr, N + 1);
 
  ptr = c.find_ptr([N] (auto i) { return i == N + 2; });
  ASSERT_NE(ptr, nullptr);
  EXPECT_EQ(*ptr, N + 2);
 
  ptr = c.find_ptr([N] (auto i) { return i == N + 3; });
  ASSERT_NE(ptr, nullptr);
  EXPECT_EQ(*ptr, N + 3);
}
 
TYPED_TEST_P(Container, ninsert)
{
  int N = this->N;
  auto c = this->c;
 
  c.ninsert(N);
  auto ptr = c.find_ptr([N] (auto i) { return i == N; });
  EXPECT_EQ(c.size(), N + 1);
  ASSERT_NE(ptr, nullptr);
  EXPECT_EQ(*ptr, N);
 
  c.ninsert(N + 1, N + 2, N + 3);
  EXPECT_EQ(c.size(), N + 4);
 
  ptr = c.find_ptr([N] (auto i) { return i == N + 1; });
  ASSERT_NE(ptr, nullptr);
  EXPECT_EQ(*ptr, N + 1);
 
  ptr = c.find_ptr([N] (auto i) { return i == N + 2; });
  ASSERT_NE(ptr, nullptr);
  EXPECT_EQ(*ptr, N + 2);
 
  ptr = c.find_ptr([N] (auto i) { return i == N + 3; });
  ASSERT_NE(ptr, nullptr);
  EXPECT_EQ(*ptr, N + 3);
}
 
TYPED_TEST_P(Container, all)
{
  int N = this->N;
  auto c = this->c;
  DynSetTree<int> tbl;
  ASSERT_TRUE(c.all([&tbl] (auto i)
        {
          const bool ret = tbl.contains(i);
          tbl.insert(i);
          return not ret;
        }));
  EXPECT_EQ(tbl.size(), N);
  EXPECT_EQ(sort(to_dynlist(c)), tbl.keys());
}
 
TYPED_TEST_P(Container, exists)
{
  int N = this->N;
  auto c = this->c;
  auto & l = this->item_list;
  EXPECT_TRUE(l.all([&c] (auto & i)
        { return c.exists([i] (auto k) { return i == k; }); }));
  EXPECT_FALSE(c.exists([N] (auto i) { return i == N; }));
}
 
TYPED_TEST_P(Container, maps)
{
  auto c = this->c;
  auto & l = this->item_list;
  auto fct = [] (int i) { return i + 1; };
  EXPECT_TRUE(zip(sort(to_dynlist(c.maps(fct))), sort(l.maps(fct))).
        all([] (auto & p) { return p.first == p.second; }));
  EXPECT_TRUE(zip(sort(to_dynlist(c.maps_if([] (auto i)
              { return i < 7; }, fct))),
      sort(l.maps_if([] (auto i)
         { return i < 7; }, fct))).
        all([] (auto & p) { return p.first == p.second; }));
}
 
TYPED_TEST_P(Container, map_synonyms)
{
  auto c = this->c;
  auto & l = this->item_list;
  auto fct = [] (int i) { return i + 1; };
  EXPECT_TRUE(zip(sort(to_dynlist(c.map(fct))), sort(l.map(fct))).
        all([] (auto & p) { return p.first == p.second; }));
  EXPECT_TRUE(zip(sort(to_dynlist(c.map_if([] (auto i)
             { return i < 7; }, fct))),
      sort(l.map_if([] (auto i)
        { return i < 7; }, fct))).
        all([] (auto & p) { return p.first == p.second; }));
}
 
TYPED_TEST_P(Container, foldl)
{
  int N = this->N;
  auto c = this->c;
  auto sum = c.foldl(0, [] (auto & a, auto & i) { return a + i; });
  EXPECT_EQ(sum, N*(N-1)/2);
}
 
TYPED_TEST_P(Container, filter_ops)
{
  auto fct = [] (int a, int i) { return a + i; };
  auto c = this->c;
  auto sum = c.filter([] (auto i) { return i < 8; }).foldl(0, fct);
  EXPECT_EQ(sum, 28);
 
  auto l = c.ptr_filter([] (auto & i) { return i < 8; });
  sum = l.foldl(0, [] (auto a, auto ptr) { return a + *ptr; });
  EXPECT_EQ(sum, 28);
 
  int N = this->N;
  auto total = N*(N-1)/2;
  auto p = c.partition([] (auto & i) { return i < 8; });
  auto S = p.first.foldl(0, fct) + p.second.foldl(0, fct);
  EXPECT_EQ(S, total);
 
  auto t = c.tpartition([] (auto & i) { return i < 8; });
  S = get<0>(t).foldl(0, fct) + get<1>(t).foldl(0, fct);
  EXPECT_EQ(S, total);
 
  auto l1 = c.take(8);
  auto l2 = c.drop(8);
  S = l1.foldl(0, fct) + l2.foldl(0, fct);
  EXPECT_EQ(S, total);
 
  EXPECT_EQ(sort(c.to_dynlist()).take(8, 12),
      build_dynlist<int>(8, 9, 10, 11, 12));
}
 
REGISTER_TYPED_TEST_SUITE_P(Container, traverse, for_each, find_ptr,
                            find_index_nth, find_item, iterator_operations,
                            nappend, ninsert, all, exists, maps, map_synonyms,
                            foldl, filter_ops);
 
typedef
Types< DynList<int>, DynDlist<int>,  DynArray<int>,
       HashSet<int, ODhashTable>, HashSet<int, OLhashTable>,
       DynHashTable<int, LhashTable>,
       DynHashTable<int, LinearHashTable>, DynSetHash<int>,
       DynSetTree<int, Treap>, DynSetTree<int, Treap_Rk>,
       DynSetTree<int, Rand_Tree>, DynSetTree<int, Splay_Tree>,
       DynSetTree<int, Avl_Tree>, DynSetTree<int, Rb_Tree>,
       Array<int>, ArrayQueue<int>, ArrayStack<int>, DynListQueue<int>,
       DynListStack<int>, DynArrayHeap<int>, DynBinHeap<int>,
       FixedQueue<int>, FixedStack<int>
      >
  Ctypes;
 
INSTANTIATE_TYPED_TEST_SUITE_P(traverses, Container, Ctypes);
 
template <class C>
struct CtorContainer : public ::testing::Test
{
  static constexpr size_t N = 10;
  C * ptr_1 = nullptr;
  C * ptr_2 = nullptr;
  C * ptr_3 = nullptr;
  CtorContainer()
  {
    ptr_1 = new C(range<int>(N));
    ptr_2 = new C({ 1, 2, 3, 4, 5, 6, 7, 8, 9, 0 });
    ptr_3 = new C(ptr_1->begin(), ptr_1->end());  // Use same container for begin/end
  }
  ~CtorContainer()
  {
    delete ptr_1;
    delete ptr_2;
    delete ptr_3;
  }
};
 
TYPED_TEST_SUITE_P(CtorContainer);
 
TYPED_TEST_P(CtorContainer, ctor)
{
  auto N = this->N;
  auto ptr_1 = this->ptr_1;
  auto ptr_2 = this->ptr_2;
  auto ptr_3 = this->ptr_3;
  EXPECT_EQ(ptr_1->size(), N);
  EXPECT_EQ(ptr_2->size(), 10);
  EXPECT_EQ(ptr_3->size(), 10);
 
  auto l1 = to_dynlist(*ptr_1);
  auto l2 = to_dynlist(*ptr_2);
  auto l3 = to_dynlist(*ptr_3);
 
  const auto r1 = range<int>(N);
  const auto r2 = build_dynlist<int>(0, 1, 2, 3, 4, 5, 6, 7, 8, 9);
  const auto & r3 = r1;
 
  ASSERT_EQ(sort(l1), r1);
  ASSERT_EQ(sort(l2), r2);
  ASSERT_EQ(sort(l3), r3);
}
 
REGISTER_TYPED_TEST_SUITE_P(CtorContainer, ctor);
 
INSTANTIATE_TYPED_TEST_SUITE_P(Ctors, CtorContainer, Ctypes);
 
TEST(EqualSequenceMethod, comparison)
{
  Array<int> a1 = {1, 2, 3, 4, 5};
  Array<int> a2 = {1, 2, 3, 4, 5};
  Array<int> a3 = {1, 2, 3, 4};
  Array<int> a4 = {5, 4, 3, 2, 1};
  Array<int> a5 = {1, 2, 2, 3, 4, 5};
 
  // 1. Size mismatch
  EXPECT_FALSE(a1.equal_to(a3));
  EXPECT_FALSE(a1 == a3);
  EXPECT_TRUE(a1 != a3);
 
  // 2. Self-comparison
  EXPECT_TRUE(a1.equal_to(a1));
  EXPECT_TRUE(a1 == a1);
  EXPECT_FALSE(a1 != a1);
 
  // 3. Same elements, same order
  EXPECT_TRUE(a1.equal_to(a2));
  EXPECT_TRUE(a1 == a2);
  EXPECT_FALSE(a1 != a2);
 
  // 4. Same elements, different order
  EXPECT_FALSE(a1.equal_to(a4));
  EXPECT_FALSE(a1 == a4);
  EXPECT_TRUE(a1 != a4);
 
  // 5. Multiplicity differences
  EXPECT_FALSE(a1.equal_to(a5));
  EXPECT_FALSE(a1 == a5);
 
  // DynArray
  DynArray<int> d1 = {1, 2, 3};
  DynArray<int> d2 = {1, 2, 3};
  DynArray<int> d3 = {3, 2, 1};
 
  EXPECT_TRUE(d1 == d2);
  EXPECT_FALSE(d1 == d3);
}
 
TEST(StdMapCoexistence, map_method_with_std_map)
{
  std::map<int, std::string> std_map;
  std_map[1] = "one";
  std_map[2] = "two";
  std_map[3] = "three";
 
  DynList<int> aleph_list = {1, 2, 3, 4, 5};
 
  auto mapped = aleph_list.map([] (int x) { return x * 2; });
  EXPECT_EQ(mapped.size(), 5);
 
  EXPECT_EQ(std_map.size(), 3);
  EXPECT_EQ(std_map[1], "one");
 
  auto filtered_mapped = aleph_list.map_if(
    [] (int x) { return x > 2; },
    [] (int x) { return x * 3; }
  );
  EXPECT_EQ(filtered_mapped.size(), 3);
 
  std::map<std::string, int> another_map;
  another_map["a"] = 10;
  another_map["b"] = 20;
 
  EXPECT_EQ(another_map.size(), 2);
  EXPECT_EQ(another_map["a"], 10);
 
  auto result = mapped.foldl(0, [] (int acc, int val) { return acc + val; });
  EXPECT_EQ(result, 30);
}