paal::detail::knapsack_get_position_range Struct Reference

For knapsack dynamic algorithm for given element the table has to be traversed from the lowest to highest element. More...

#include <knapsack_unbounded.hpp>

Public Member Functions
template<typename T >
auto	operator() (T begin, T end) -> decltype(irange(begin, end))

Detailed Description

For knapsack dynamic algorithm for given element the table has to be traversed from the lowest to highest element.

Definition at line 40 of file knapsack_unbounded.hpp.

---

The documentation for this struct was generated from the following file:

• include/paal/dynamic/knapsack_unbounded.hpp