iter-zip.hpp

Go to the documentation of this file.

/*
  ITER-ZIP.hpp  -  join several iterators into a iterator-of-tuples
 
   Copyright (C)
     2024,            Hermann Vosseler <Ichthyostega@web.de>
 
 **Lumiera** 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 2 of the License, or (at your
 option) any later version. See the file COPYING for further details.
 
*/
 
#ifndef LIB_ITER_ZIP_H
#define LIB_ITER_ZIP_H
 
 
#include "lib/iter-adapter.hpp"
#include "lib/iter-explorer.hpp"
#include "lib/meta/tuple-helper.hpp"
 
#include <utility>
 
 
namespace lib {
  namespace iter {
    
    template<typename...ITS>
    auto
    buildIterTuple (ITS&& ...iters)
      {
        return std::make_tuple (lib::explore (std::forward<ITS> (iters)) ...);
      }
    
    template<meta::tuple_like ITUP>
    class ProductCore
      {
        ITUP iters_;
        
      public:
        ProductCore(ITUP&& iterTup)
          : iters_{move (iterTup)}
          { }
        
        ProductCore()  = default;
        // default copy acceptable
        
        friend bool
        operator== (ProductCore const& cor1, ProductCore const& cor2)
        {
          return cor1.iters_ == cor2.iters_;
        }
        
        
        /* === »state core« protocol API === */
        
        bool
        checkPoint()  const
          {                                        //note: short-circuit
            return meta::apply ([](auto&... its) { return (bool(its) and ...); }
                               , iters_);
          }
        
        ITUP&
        yield()  const      
          {
            return util::unConst(iters_);
          }
        
        void
        iterNext()
          {
            meta::forEach (iters_
                          ,[](auto& it){ ++it; });
          }
        
        
        /* === connector for IterAdapter internal protocol === */
 
        using TAG_IterExplorer_BaseAdapter = ITUP;
        
        void
        expandChildren()
          {
            meta::forEach (iters_
                          ,[](auto& it){ it.expandChildren(); });
          }
        
        size_t
        depth()  const
          {
            size_t maxDepth{0};
            meta::forEach (iters_
                          ,[&](auto& it){ maxDepth = std::max (maxDepth, it.depth()); });
            return maxDepth;
          }
      };
  } // namespace lib::iter
  
  
  
  
  template<class...ITS>
  inline auto
  zip (ITS&& ...iters)
  {
    auto access_result = [ ](auto& it)->decltype(auto){ return *it; };               // Note: pass-through result type (maybe reference)
    auto tuple_results = [&](auto& it){ return meta::mapEach (*it, access_result); };
    //
    auto core = iter::ProductCore{iter::buildIterTuple (std::forward<ITS> (iters)...)};
    //
    return explore (std::move(core))
              .transform (tuple_results);
  }
  
  template<class...ITS>
  inline auto
  izip (ITS&& ...iters)
  {
    return zip (eachNum<size_t>(), std::forward<ITS>(iters)...);
  }
  
  
  
} // namespace lib
#endif /*LIB_ITER_ZIP_H*/