Enum RegAlgorithm 

pub enum RegAlgorithm {
    DaleReiter,
    GraphBased,
}

Selects the REG (Referring Expression Generation) algorithm used by the {name|refer} pipe when rendering the Full form of a reference.

The default is DaleReiter, which matches the historical behaviour of the engine.

Variants

DaleReiter

Dale & Reiter 1995 Incremental Algorithm.

Disambiguates same-type entities using unary attributes only — e.g. “the domain class UserService” vs “the infra class AuthService”. Fast, well-understood, and the default.

GraphBased

Krahmer et al. 2003 graph-based greedy algorithm.

Handles both unary attributes AND binary relations between entities. When attributes alone do not disambiguate, the algorithm appends one relation clause — e.g. “the api function LoginHandler that calls AuthService”. Falls back silently to D&R behaviour when no relations are registered.

Trait Implementations

impl Clone for RegAlgorithm

fn clone(&self) -> RegAlgorithm

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for RegAlgorithm

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for RegAlgorithm

fn default() -> RegAlgorithm

Returns the “default value” for a type.

impl PartialEq for RegAlgorithm

fn eq(&self, other: &RegAlgorithm) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for RegAlgorithm

impl Eq for RegAlgorithm

impl StructuralPartialEq for RegAlgorithm