Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Aleph::lis_detail Namespace Reference

Functions

template<typename T , class Compare >
size_t lower_bound_pos (const Array< T > &tails, const T &value, Compare cmp)
 
template<typename T , class Compare >
size_t upper_bound_pos (const Array< T > &tails, const T &value, Compare cmp)
 

Function Documentation

◆ lower_bound_pos()

template<typename T , class Compare >
size_t Aleph::lis_detail::lower_bound_pos ( const Array< T > &  tails,
const T value,
Compare  cmp 
)
inline

◆ upper_bound_pos()

template<typename T , class Compare >
size_t Aleph::lis_detail::upper_bound_pos ( const Array< T > &  tails,
const T value,
Compare  cmp 
)
inline

Definition at line 86 of file LIS.H.

References cmp(), and Aleph::divide_and_conquer_partition_dp().

Referenced by Aleph::longest_nondecreasing_subsequence().