ahDry.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 AHDRY_H
# define AHDRY_H
 
# include <cstddef>
# include <tuple>
# include <functional>
# include <sstream>
# include <initializer_list>
 
# include <ahFunctional.H>
# include <ah-errors.H>
 
namespace Aleph
{
 
template<typename T> class DynList;
 
# define Special_Ctors(Set_Type, Type)                                      \
  template <template <typename> class List>                                 \
  Set_Type(const List<Type> & l) : Set_Type()                               \
  {                                                                         \
    l.for_each([this] (const Type & item) { (void)this->append(item); });   \
  }                                                                         \
                                                                            \
  template <class It>                                                       \
  Set_Type(It b, It e) : Set_Type()                                         \
  {                                                                         \
    for (It it = b; it != e; ++it)                                          \
      (void)this->append(*it);                                              \
  }                                                                         \
                                                                            \
  Set_Type(std::initializer_list<Type> l) : Set_Type()                      \
  {                                                                         \
    for (const auto & item : l)                                             \
      (void)this->append(item);                                             \
  }
 
# define Generic_Items(Type)                                            \
  template <template <typename> class Container = DynList>              \
  Container<Type> items() const                                         \
  {                                                                     \
    return this->template maps<Type, Container> ([] (const Type & key)  \
                                                 { return key; });      \
  }
 
# define Generate_Proxy_Operator(Class_Name)        \
  const Data & operator [] (const Key & key) const  \
  {                                                 \
    return find(key);                               \
  }                                                 \
                                                    \
  Data & operator [] (const Key & key)              \
  {                                                 \
    return find(key);                               \
  }
 
 
// ============================================================================
// Utility functions and classes
// ============================================================================
 
template<typename Type> inline
std::string to_str(const Type &d)
{
  std::ostringstream os;
  os << d;
  return os.str();
}
 
template<typename Key, typename Data, class Cmp = std::equal_to<Key>>
struct Dft_Pair_Cmp
{
  Cmp cmp;
  Dft_Pair_Cmp(Cmp __cmp = Cmp()) : cmp(__cmp) {}
 
  bool operator()(const std::pair<Key, Data> &p1,
                  const std::pair<Key, Data> &p2) const noexcept
  {
    return cmp(p1.first, p2.first);
  }
 
  bool operator()(const std::pair<Key, Data> &p,
                  const Key &k) const noexcept
  {
    return cmp(p.first, k);
  }
 
  bool operator()(const Key &k,
                  const std::pair<Key, Data> &p) const noexcept
  {
    return cmp(k, p.first);
  }
};
 
template<typename Key, typename Data>
std::pair<Key, Data> *key_to_pair(Key *ptr)
{
  using PairType = std::pair<Key, Data>;
  return reinterpret_cast<PairType *>(
      reinterpret_cast<char *>(ptr) - offsetof(PairType, first));
}
 
template<typename Key, typename Data>
const std::pair<Key, Data> *key_to_pair(const Key *ptr)
{
  using PairType = std::pair<Key, Data>;
  return reinterpret_cast<const PairType *>(
      reinterpret_cast<const char *>(ptr) - offsetof(PairType, first));
}
 
template<typename Key, typename Data>
std::pair<Key, Data> *data_to_pair(Data *ptr)
{
  using PairType = std::pair<Key, Data>;
  return reinterpret_cast<PairType *>(
      reinterpret_cast<char *>(ptr) - offsetof(PairType, second));
}
 
template<typename Key, typename Data>
const std::pair<Key, Data> *data_to_pair(const Data *ptr)
{
  using PairType = std::pair<Key, Data>;
  return reinterpret_cast<const PairType *>(
      reinterpret_cast<const char *>(ptr) - offsetof(PairType, second));
}
 
} // end namespace Aleph
 
# endif // AHDRY_H