test-zip-it.cc

Go to the documentation of this file.

 
/* Aleph-w
 
     / \  | | ___ _ __ | |__      __      __
    / _ \ | |/ _ \ '_ \| '_ \ ____\ \ /\ / / Data structures & Algorithms
   / ___ \| |  __/ |_) | | | |_____\ V  V /  version 1.9c
  /_/   \_\_|\___| .__/|_| |_|      \_/\_/   https://github.com/lrleon/Aleph-w
                 |_|         
 
  This file is part of Aleph-w library
 
  Copyright (c) 2002-2018 Leandro Rabindranath Leon 
 
  This program is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
  the Free Software Foundation, either version 3 of the License, or
  (at your option) any later version.
 
  This program is distributed in the hope that it will be useful, but
  WITHOUT ANY WARRANTY; without even the implied warranty of
  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  General Public License for more details.
 
  You should have received a copy of the GNU General Public License
  along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
 
# include <iostream>
 
# include <ah-zip.H>
# include <tpl_dynSetTree.H>
 
using namespace std;
using namespace Aleph;
 
DynList<int> l1 = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 0 };
DynList<int> l2 = { 0, 9, 8, 7, 6, 5, 4, 3, 2, 1 };
DynList<char> l3 = { 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k' };
DynSetTree<char> l5 = { 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K' };
 
int main()
{
  auto it = get_zip_it(l1, l2, l3, l5);
  for (; it.has_curr(); it.next())
    {
      auto curr = it.get_curr();
      cout << "curr = (" << get<0>(curr) << ", " << get<1>(curr) << ", "
     << get<2>(curr) << ")" << endl;
    }
 
  zip_for_each([] (auto t) {}, l1, l2);
 
  assert(not it.completed());
 
  auto l = t_enum_zip(l1, l2, l3);
 
  auto lu = t_unzip(l);
 
  for (auto it = get<3>(lu).get_it(); it.has_curr(); it.next())
    cout << it.get_curr() << " ";
  cout << endl;
 
  auto l4 = l1.maps([] (auto i) { return 10*i; });
 
  for (auto it = get_zip_it(l1, l2, l4); it.has_curr(); it.next())
    {
      auto l = it.get_curr_list();
      l.for_each([] (auto i) { cout << i << " "; });
      cout << endl;
    }
 
  zip_lists(l1, l2, l4).for_each([] (auto & l)
         {
           l.for_each([] (auto i) { cout << i << " "; });
           cout << endl;
         });
 
  zip_maps<int>
    ([] (tuple<int, int, int> t) { return get<0>(t) + get<1>(t) + get<2>(t); },
     l1, l2, l4).for_each([] (auto i) { cout << i << endl; });
 
  auto filter = zip_filter([] (auto t) { return get<0>(t) < 5; }, l1, l2, l3, l5);
 
  for (auto it = filter.get_it(); it.has_curr(); it.next())
    {
      auto & t = it.get_curr();
      cout << get<0>(t) << " " << get<1>(t) << " " << get<2>(t) << " " << get<3>(t)
     << endl;
    }
}