ah-convert.H

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.
*/
 
 
#ifndef AH_CONVERT_H
#define AH_CONVERT_H
 
#include <deque>
#include <initializer_list>
#include <set>
#include <map>
#include <utility>
#include <tpl_array.H>
#include <tpl_dynArray.H>
#include <tpl_dynDlist.H>
#include <tpl_dynSetTree.H>
#include <tpl_dynSetHash.H>
#include <tpl_dynMapTree.H>
#include <tpl_dynMapOhash.H>
 
namespace Aleph
{
 
template <class T>
[[nodiscard]] DynList<T> to_DynList(const Array<T> & a)
{
  return a.template maps<T>([] (const auto & item) { return item; });
}
 
template <class C>
[[nodiscard]] Array<typename C::Item_Type> to_Array(const C & c)
{
  Array<typename C::Item_Type> ret;
  for (auto it = c.get_it(); it.has_curr(); it.next_ne())
    ret.append(it.get_curr());
  return ret;
}
 
template <class T>
[[nodiscard]] DynList<T> dynarray_to_DynList(const DynArray<T> & a)
{
  DynList<T> ret;
  for (size_t i = 0; i < a.size(); ++i)
    ret.append(a(i));
  return ret;
}
 
template <class T>
[[nodiscard]] DynArray<T> dynlist_to_DynArray(const DynList<T> & l)
{
  DynArray<T> ret;
  for (auto it = l.get_it(); it.has_curr(); it.next_ne())
    ret.append(it.get_curr());
  return ret;
}
 
template <class C>
[[nodiscard]] std::vector<typename C::Item_Type> to_vector(const C & c)
{
  std::vector<typename C::Item_Type> ret;
  if constexpr (requires { c.size(); })
    ret.reserve(c.size());
  for (auto it = c.get_it(); it.has_curr(); it.next_ne())
    ret.push_back(it.get_curr());
  return ret;
}
 
template <class T>
[[nodiscard]] DynList<T> vector_to_DynList(const std::vector<T> & v)
{
  DynList<T> ret;
  for (const auto & item : v)
    ret.append(item);
  return ret;
}
 
template <class T>
[[nodiscard]] Array<T> vector_to_Array(const std::vector<T> & v)
{
  Array<T> ret;
  ret.reserve(v.size());
  for (const auto & item : v)
    ret.append(item);
  return ret;
}
 
template <class T>
[[nodiscard]] DynArray<T> vector_to_DynArray(const std::vector<T> & v)
{
  DynArray<T> ret;
  for (const auto & item : v)
    ret.append(item);
  return ret;
}
 
template <class C>
[[nodiscard]] DynArray<typename C::Item_Type> to_DynArray(const C & c)
{
  DynArray<typename C::Item_Type> ret;
  for (auto it = c.get_it(); it.has_curr(); it.next_ne())
    ret.append(it.get_curr());
  return ret;
}
 
template <class T>
[[nodiscard]] DynArray<T> array_to_DynArray(const Array<T> & a)
{
  DynArray<T> ret;
  for (size_t i = 0; i < a.size(); ++i)
    ret.append(a(i));
  return ret;
}
 
template <class T>
[[nodiscard]] Array<T> dynarray_to_Array(const DynArray<T> & a)
{
  Array<T> ret;
  for (size_t i = 0; i < a.size(); ++i)
    ret.append(a(i));
  return ret;
}
 
template <class C>
[[nodiscard]] std::deque<typename C::Item_Type> to_deque(const C & c)
{
  std::deque<typename C::Item_Type> ret;
  for (auto it = c.get_it(); it.has_curr(); it.next_ne())
    ret.push_back(it.get_curr());
  return ret;
}
 
template <class T>
[[nodiscard]] DynList<T> deque_to_DynList(const std::deque<T> & d)
{
  DynList<T> ret;
  for (const auto & item : d)
    ret.append(item);
  return ret;
}
 
template <class T>
[[nodiscard]] Array<T> deque_to_Array(const std::deque<T> & d)
{
  Array<T> ret;
  ret.reserve(d.size());
  for (const auto & item : d)
    ret.append(item);
  return ret;
}
 
template <class T>
[[nodiscard]] DynArray<T> deque_to_DynArray(const std::deque<T> & d)
{
  DynArray<T> ret;
  for (const auto & item : d)
    ret.append(item);
  return ret;
}
 
// ==================== DynDlist Conversions ====================
 
template <class T>
[[nodiscard]] DynList<T> dyndlist_to_DynList(const DynDlist<T> & l)
{
  DynList<T> ret;
  l.for_each([&ret](const T & item) { ret.append(item); });
  return ret;
}
 
template <class T>
[[nodiscard]] DynDlist<T> dynlist_to_DynDlist(const DynList<T> & l)
{
  DynDlist<T> ret;
  l.for_each([&ret](const T & item) { ret.append(item); });
  return ret;
}
 
template <class T>
[[nodiscard]] DynArray<T> dyndlist_to_DynArray(const DynDlist<T> & l)
{
  DynArray<T> ret;
  l.for_each([&ret](const T & item) { ret.append(item); });
  return ret;
}
 
template <class T>
[[nodiscard]] DynDlist<T> dynarray_to_DynDlist(const DynArray<T> & a)
{
  DynDlist<T> ret;
  for (size_t i = 0; i < a.size(); ++i)
    ret.append(a(i));
  return ret;
}
 
template <class T>
[[nodiscard]] DynDlist<T> vector_to_DynDlist(const std::vector<T> & v)
{
  DynDlist<T> ret;
  for (const auto & item : v)
    ret.append(item);
  return ret;
}
 
// ==================== Move Semantics Conversions ====================
 
template <class T>
[[nodiscard]] DynList<T> vector_to_DynList(std::vector<T> && v)
{
  DynList<T> ret;
  for (auto & item : v)
    ret.append(std::move(item));
  return ret;
}
 
template <class T>
[[nodiscard]] Array<T> vector_to_Array(std::vector<T> && v)
{
  Array<T> ret;
  for (auto & item : v)
    ret.append(std::move(item));
  return ret;
}
 
template <class T>
[[nodiscard]] DynArray<T> vector_to_DynArray(std::vector<T> && v)
{
  DynArray<T> ret;
  for (auto & item : v)
    ret.append(std::move(item));
  return ret;
}
 
template <class T>
[[nodiscard]] DynDlist<T> vector_to_DynDlist(std::vector<T> && v)
{
  DynDlist<T> ret;
  for (auto & item : v)
    ret.append(std::move(item));
  return ret;
}
 
// ==================== std::set Conversions ====================
 
template <class T, class Compare, class Alloc>
[[nodiscard]] DynList<T> set_to_DynList(const std::set<T, Compare, Alloc> & s)
{
  DynList<T> ret;
  for (const auto & item : s)
    ret.append(item);
  return ret;
}
 
template <class T, class Compare, class Alloc>
[[nodiscard]] Array<T> set_to_Array(const std::set<T, Compare, Alloc> & s)
{
  Array<T> ret;
  ret.reserve(s.size());
  for (const auto & item : s)
    ret.append(item);
  return ret;
}
 
template <class T, class Compare, class Alloc>
[[nodiscard]] DynArray<T> set_to_DynArray(const std::set<T, Compare, Alloc> & s)
{
  DynArray<T> ret;
  for (const auto & item : s)
    ret.append(item);
  return ret;
}
 
template <class C>
[[nodiscard]] std::set<typename C::Item_Type> to_set(const C & c)
{
  std::set<typename C::Item_Type> ret;
  for (auto it = c.get_it(); it.has_curr(); it.next_ne())
    ret.insert(it.get_curr());
  return ret;
}
 
// ==================== std::map Conversions ====================
 
template <class K, class V, class Compare, class Alloc>
[[nodiscard]] DynList<std::pair<K, V>>
map_to_DynList(const std::map<K, V, Compare, Alloc> & m)
{
  DynList<std::pair<K, V>> ret;
  for (const auto & [key, value] : m)
    ret.append(std::make_pair(key, value));
  return ret;
}
 
template <class K, class V, class Compare, class Alloc>
[[nodiscard]] Array<std::pair<K, V>>
map_to_Array(const std::map<K, V, Compare, Alloc> & m)
{
  Array<std::pair<K, V>> ret;
  ret.reserve(m.size());
  for (const auto & [key, value] : m)
    ret.append(std::make_pair(key, value));
  return ret;
}
 
template <class K, class V, class Compare, class Alloc>
[[nodiscard]] DynList<K> map_keys_to_DynList(const std::map<K, V, Compare, Alloc> & m)
{
  DynList<K> ret;
  for (const auto & [key, value] : m)
    ret.append(key);
  return ret;
}
 
template <class K, class V, class Compare, class Alloc>
[[nodiscard]] DynList<V> map_values_to_DynList(const std::map<K, V, Compare, Alloc> & m)
{
  DynList<V> ret;
  for (const auto & [key, value] : m)
    ret.append(value);
  return ret;
}
 
// ==================== initializer_list Conversions ====================
 
template <class T>
[[nodiscard]] DynList<T> init_to_DynList(std::initializer_list<T> il)
{
  DynList<T> ret;
  for (const auto & item : il)
    ret.append(item);
  return ret;
}
 
template <class T>
[[nodiscard]] Array<T> init_to_Array(std::initializer_list<T> il)
{
  Array<T> ret;
  for (const auto & item : il)
    ret.append(item);
  return ret;
}
 
template <class T>
[[nodiscard]] DynArray<T> init_to_DynArray(std::initializer_list<T> il)
{
  DynArray<T> ret;
  for (const auto & item : il)
    ret.append(item);
  return ret;
}
 
template <class T>
[[nodiscard]] DynDlist<T> init_to_DynDlist(std::initializer_list<T> il)
{
  DynDlist<T> ret;
  for (const auto & item : il)
    ret.append(item);
  return ret;
}
 
// ==================== DynSetTree Conversions ====================
 
template <typename Key, template <typename, class> class Tree, class Compare>
[[nodiscard]] DynList<Key> settree_to_DynList(const DynSetTree<Key, Tree, Compare> & s)
{
  DynList<Key> ret;
  s.for_each([&ret](const Key & item) { ret.append(item); });
  return ret;
}
 
template <typename Key, template <typename, class> class Tree, class Compare>
[[nodiscard]] Array<Key> settree_to_Array(const DynSetTree<Key, Tree, Compare> & s)
{
  Array<Key> ret;
  ret.reserve(s.size());
  s.for_each([&ret](const Key & item) { ret.append(item); });
  return ret;
}
 
template <typename Key, template <typename, class> class Tree, class Compare>
[[nodiscard]] DynArray<Key> settree_to_DynArray(const DynSetTree<Key, Tree, Compare> & s)
{
  DynArray<Key> ret;
  s.for_each([&ret](const Key & item) { ret.append(item); });
  return ret;
}
 
template <typename Key, template <typename, class> class Tree, class Compare>
[[nodiscard]] std::vector<Key> settree_to_vector(const DynSetTree<Key, Tree, Compare> & s)
{
  std::vector<Key> ret;
  ret.reserve(s.size());
  s.for_each([&ret](const Key & item) { ret.push_back(item); });
  return ret;
}
 
template <typename Key, template <typename, class> class Tree, class Compare>
[[nodiscard]] std::set<Key> settree_to_stdset(const DynSetTree<Key, Tree, Compare> & s)
{
  std::set<Key> ret;
  s.for_each([&ret](const Key & item) { ret.insert(item); });
  return ret;
}
 
template <class C>
[[nodiscard]] DynSetTree<typename C::Item_Type> to_DynSetTree(const C & c)
{
  DynSetTree<typename C::Item_Type> ret;
  for (auto it = c.get_it(); it.has_curr(); it.next_ne())
    ret.insert(it.get_curr());
  return ret;
}
 
template <class T>
[[nodiscard]] DynSetTree<T> vector_to_DynSetTree(const std::vector<T> & v)
{
  DynSetTree<T> ret;
  for (const auto & item : v)
    ret.insert(item);
  return ret;
}
 
// ==================== DynSetHash Conversions ====================
 
template <typename Key, template <typename, class> class HashTable, class Cmp>
[[nodiscard]] DynList<Key> sethash_to_DynList(const DynHashTable<Key, HashTable, Cmp> & s)
{
  DynList<Key> ret;
  s.for_each([&ret](const Key & item) { ret.append(item); });
  return ret;
}
 
template <typename Key, template <typename, class> class HashTable, class Cmp>
[[nodiscard]] Array<Key> sethash_to_Array(const DynHashTable<Key, HashTable, Cmp> & s)
{
  Array<Key> ret;
  ret.reserve(s.size());
  s.for_each([&ret](const Key & item) { ret.append(item); });
  return ret;
}
 
template <typename Key, template <typename, class> class HashTable, class Cmp>
[[nodiscard]] DynArray<Key> sethash_to_DynArray(const DynHashTable<Key, HashTable, Cmp> & s)
{
  DynArray<Key> ret;
  s.for_each([&ret](const Key & item) { ret.append(item); });
  return ret;
}
 
template <typename Key, template <typename, class> class HashTable, class Cmp>
[[nodiscard]] std::vector<Key> sethash_to_vector(const DynHashTable<Key, HashTable, Cmp> & s)
{
  std::vector<Key> ret;
  ret.reserve(s.size());
  s.for_each([&ret](const Key & item) { ret.push_back(item); });
  return ret;
}
 
// ==================== DynMapTree Conversions ====================
 
template <typename Key, typename Data,
          template <typename, class> class Tree, class Compare>
[[nodiscard]] DynList<std::pair<Key, Data>>
maptree_to_DynList(const DynMapTree<Key, Data, Tree, Compare> & m)
{
  DynList<std::pair<Key, Data>> ret;
  m.for_each([&ret](const std::pair<Key, Data> & p) { ret.append(p); });
  return ret;
}
 
template <typename Key, typename Data,
          template <typename, class> class Tree, class Compare>
[[nodiscard]] Array<std::pair<Key, Data>>
maptree_to_Array(const DynMapTree<Key, Data, Tree, Compare> & m)
{
  Array<std::pair<Key, Data>> ret;
  ret.reserve(m.size());
  m.for_each([&ret](const std::pair<Key, Data> & p) { ret.append(p); });
  return ret;
}
 
template <typename Key, typename Data,
          template <typename, class> class Tree, class Compare>
[[nodiscard]] std::map<Key, Data>
maptree_to_stdmap(const DynMapTree<Key, Data, Tree, Compare> & m)
{
  std::map<Key, Data> ret;
  m.for_each([&ret](const std::pair<Key, Data> & p) {
    ret.emplace(p.first, p.second);
  });
  return ret;
}
 
template <typename Key, typename Data,
          template <typename, class> class Tree, class Compare>
[[nodiscard]] DynList<Key>
maptree_keys_to_DynList(const DynMapTree<Key, Data, Tree, Compare> & m)
{
  DynList<Key> ret;
  m.for_each([&ret](const std::pair<Key, Data> & p) { ret.append(p.first); });
  return ret;
}
 
template <typename Key, typename Data,
          template <typename, class> class Tree, class Compare>
[[nodiscard]] DynList<Data>
maptree_values_to_DynList(const DynMapTree<Key, Data, Tree, Compare> & m)
{
  DynList<Data> ret;
  m.for_each([&ret](const std::pair<Key, Data> & p) { ret.append(p.second); });
  return ret;
}
 
template <class K, class V, class Compare, class Alloc>
[[nodiscard]] DynMapTree<K, V>
stdmap_to_DynMapTree(const std::map<K, V, Compare, Alloc> & m)
{
  DynMapTree<K, V> ret;
  for (const auto & [key, value] : m)
    ret.insert(key, value);
  return ret;
}
 
// ==================== MapOpenHash Conversions ====================
 
template <typename Key, typename Data, class Cmp,
          template <typename, class> class HashTable>
[[nodiscard]] DynList<std::pair<Key, Data>>
maphash_to_DynList(const MapOpenHash<Key, Data, Cmp, HashTable> & m)
{
  DynList<std::pair<Key, Data>> ret;
  m.for_each([&ret](const std::pair<Key, Data> & p) { ret.append(p); });
  return ret;
}
 
template <typename Key, typename Data, class Cmp,
          template <typename, class> class HashTable>
[[nodiscard]] Array<std::pair<Key, Data>>
maphash_to_Array(const MapOpenHash<Key, Data, Cmp, HashTable> & m)
{
  Array<std::pair<Key, Data>> ret;
  ret.reserve(m.size());
  m.for_each([&ret](const std::pair<Key, Data> & p) { ret.append(p); });
  return ret;
}
 
template <typename Key, typename Data, class Cmp,
          template <typename, class> class HashTable>
[[nodiscard]] std::map<Key, Data>
maphash_to_stdmap(const MapOpenHash<Key, Data, Cmp, HashTable> & m)
{
  std::map<Key, Data> ret;
  m.for_each([&ret](const std::pair<Key, Data> & p) {
    ret.emplace(p.first, p.second);
  });
  return ret;
}
 
template <typename Key, typename Data, class Cmp,
          template <typename, class> class HashTable>
[[nodiscard]] DynList<Key>
maphash_keys_to_DynList(const MapOpenHash<Key, Data, Cmp, HashTable> & m)
{
  DynList<Key> ret;
  m.for_each([&ret](const std::pair<Key, Data> & p) { ret.append(p.first); });
  return ret;
}
 
template <typename Key, typename Data, class Cmp,
          template <typename, class> class HashTable>
[[nodiscard]] DynList<Data>
maphash_values_to_DynList(const MapOpenHash<Key, Data, Cmp, HashTable> & m)
{
  DynList<Data> ret;
  m.for_each([&ret](const std::pair<Key, Data> & p) { ret.append(p.second); });
  return ret;
}
 
} // end namespace Aleph
 
#endif // AH_CONVERT_H