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

Public Member Functions
bool	operator() (Node *lhs, Node *rhs) 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 >::NodePtrEq

Definition at line 118 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>>

bool Aleph::Gen_Link_Cut_Tree_WithEdges< VT, ET, EdgeMonoid, LazyTag >::NodePtrEq::operator() ( Node *  lhs, Node *  rhs  ) const

inlinenoexcept

Definition at line 120 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