Aleph::Gen_Link_Cut_Tree_WithEdges< VT, ET, EdgeMonoid, LazyTag >::EdgeKeyHash Struct Reference

Public Member Functions
size_t	operator() (const EdgeKey &key) const noexcept

Detailed Description

template<typename VT = int, typename ET = int, class EdgeMonoid = DefaultMonoid<ET>, class LazyTag = NoLazyTag<ET>>
struct Aleph::Gen_Link_Cut_Tree_WithEdges< VT, ET, EdgeMonoid, LazyTag >::EdgeKeyHash

Definition at line 99 of file tpl_link_cut_tree_with_edges.H.

Member Function Documentation

operator()()

template<typename VT = int, typename ET = int, class EdgeMonoid = DefaultMonoid<ET>, class LazyTag = NoLazyTag<ET>>

size_t Aleph::Gen_Link_Cut_Tree_WithEdges< VT, ET, EdgeMonoid, LazyTag >::EdgeKeyHash::operator() ( const EdgeKey &  key ) const

inlinenoexcept

Definition at line 101 of file tpl_link_cut_tree_with_edges.H.

References Aleph::divide_and_conquer_partition_dp().

---

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

• tpl_link_cut_tree_with_edges.H