Aleph::RankedBinNodeLike Concept Reference

A binary tree node that also keeps subtree sizes (rank). More...

#include <ah-concepts.H>

Concept definition

template<class Node>
concept Aleph::RankedBinNodeLike = 
      BinNodeLike<Node> and
      requires(std::remove_cv_t<Node> * p)
        {
          { p->getCount() } -> std::convertible_to<std::size_t>;
        }

Detailed Description

A binary tree node that also keeps subtree sizes (rank).

Adds getCount(), which COUNT(p) wraps. It checks the member rather than COUNT(p): COUNT returns auto &, and a deduced return type is not SFINAE-friendly, so testing it would hard-error instead of yielding false on a node without ranks.

Template Parameters

Node	candidate node type.

Definition at line 529 of file ah-concepts.H.