kitty_algorithm.hpp

Go to the documentation of this file.

#ifndef _KITTY_ALGORITHM_H_
#define _KITTY_ALGORITHM_H_
#pragma once
 
#include <algorithm>
#include <cassert>
 
#include "kitty_constants.hpp"
#include "kitty_dynamic_tt.hpp"
#include "kitty_static_tt.hpp"
 
ABC_NAMESPACE_CXX_HEADER_START
 
namespace kitty
{

template<typename TT, typename Fn>
TT unary_operation( const TT& tt, Fn&& op )
{
  TT result = tt.construct();
  std::transform( tt.cbegin(), tt.cend(), result.begin(), op );
  result.mask_bits();
  return result;
}

template<typename TT, typename Fn>
TT binary_operation( const TT& first, const TT& second, Fn&& op )
{
  assert( first.num_vars() == second.num_vars() );
 
  TT result = first.construct();
  std::transform( first.cbegin(), first.cend(), second.cbegin(), result.begin(), op );
  result.mask_bits();
  return result;
}

template<typename TT, typename Fn>
bool binary_predicate( const TT& first, const TT& second, Fn&& op )
{
  assert( first.num_vars() == second.num_vars() );
 
  return std::equal( first.begin(), first.end(), second.begin(), op );
}

template<typename TT, typename Fn>
void assign_operation( TT& tt, Fn&& op )
{
  std::generate( tt.begin(), tt.end(), op );
  tt.mask_bits();
}

template<typename TT, typename Fn>
void for_each_block( const TT& tt, Fn&& op )
{
  std::for_each( tt.cbegin(), tt.cend(), op );
}

template<typename TT, typename Fn>
void for_each_block_reversed( const TT& tt, Fn&& op )
{
  std::for_each( tt.crbegin(), tt.crend(), op );
}
 
} // namespace kitty
 
ABC_NAMESPACE_CXX_HEADER_END
 
#endif // _KITTY_ALGORITHM_H_