39# ifndef TPL_SNODE_NC_H
40# define TPL_SNODE_NC_H
Slink_Nc * get_curr() const
Singly linked list node (non-circular).
Slink_Nc * remove_next()
Removes the link following this.
Slink_Nc *& get_next()
Returns the next link.
Snode_Nc * get_curr() const
Returns pointer to the current node.
Iterator(Snode_Nc< T > *head_ptr, Snode_Nc< T > *curr_ptr)
Iterator(Snode_Nc< T > *head_ptr)
Instantiates iterator in list whose head node is head_ptr.
Iterator(Snode_Nc< T > &head)
Instantiates iterator in list whose head node is head.
Snode_Nc()
Empty constructor.
const Snode_Nc * get_next() const
Returns the node following this (constant version).
const T & get_data() const
Returns a reference to the data contained in the node (constant version).
Snode_Nc * remove_next()
Removes the node following this.
Snode_Nc *& get_next()
Returns the node following this.
T & get_data()
Returns a reference to the data contained in the node.
Snode_Nc(const T &_data)
Constructor that copies data.
Main namespace for Aleph-w library functions.
Divide_Conquer_DP_Result< Cost > divide_and_conquer_partition_dp(const size_t groups, const size_t n, Transition_Cost_Fn transition_cost, const Cost inf=dp_optimization_detail::default_inf< Cost >())
Optimize partition DP using divide-and-conquer optimization.
std::decay_t< typename HeadC::Item_Type > T
Singly linked node (no check variant).