Class QuantifierNode

Namespace

Utils.Parser.Runtime

Assembly

Utils.Parser.dll

A synthetic wrapper node produced by a quantifier (?, *, +) that appears as one element inside a sequence. Contains one child per repetition of the quantifier's body. The Rule is the owning parser rule (same as the enclosing sequence).

public record QuantifierNode : ParserNode, IEquatable<ParseNode>, IEquatable<ParserNode>, IEquatable<QuantifierNode>

Inheritance

object

ParseNode

ParserNode

QuantifierNode

Implements

IEquatable<ParseNode>

IEquatable<ParserNode>

IEquatable<QuantifierNode>

Inherited Members

ParserNode.Children

ParserNode.Equals(ParserNode)

ParserNode.GetHashCode()

ParseNode.Span

ParseNode.ModeName

ParseNode.Rule

object.Equals(object)

object.Equals(object, object)

object.GetType()

object.MemberwiseClone()

object.ReferenceEquals(object, object)

object.ToString()

Extension Methods

DataUtils.ToDbValue(object?)

MathEx.Clamp<T>(T, T, T, IComparer<T>)

FluentExtensions.Failure<T>(T)

FluentExtensions.IsEqualTo<T, CT>(T, CT)

FluentExtensions.IsGreaterOrEqualsThan<T, CT>(T, CT)

FluentExtensions.IsGreaterThan<T, CT>(T, CT)

FluentExtensions.IsIn<T>(T, params T[])

FluentExtensions.IsLowerOrEqualsThan<T, CT>(T, CT)

FluentExtensions.IsLowerThan<T, CT>(T, CT)

FluentExtensions.IsNotIn<T>(T, params T[])

FluentExtensions.IsNotNull<T>(T)

FluentExtensions.IsNull<T>(T)

FluentExtensions.Success<T>(T)

FluentExtensions.Test<T>(T, Func<T, bool>)

ObjectUtils.Between<T>(T, IComparer<T>, T, T)

ObjectUtils.Between<T>(T, IComparer<T>, T, T, bool, bool)

ObjectUtils.DoAsync<T, Result>(T, Func<T, Task<Result>>, Func<Task<Result>>)

ObjectUtils.DoAsync<T, Result>(T, Func<T, Task<Result>>, Result)

ObjectUtils.DoAsync<T, Result>(T, Func<T, Result>, Func<Result>)

ObjectUtils.DoAsync<T, Result>(T, Func<T, Result>, Result)

ObjectUtils.Do<T, Result>(T, Func<T, Result>, Func<Result>)

ObjectUtils.Do<T, Result>(T, Func<T, Result>, Result)

ObjectUtils.In<T>(T, params T[])

ObjectUtils.NotIn<T>(T, params T[])

Validations.ArgMustBe<T>(T, Func<T, bool>, string, string)

Validations.ArgMustNotBe<T>(T, Func<T, bool>, string, string)

Validations.Arg<T>(T, string)

Validations.ValueMustNotBeNull<T>(T, string)

Validations.Variable<T>(T, string)

Remarks

This type is a subtype of ParserNode so that it integrates transparently with existing rule-name handlers and integer-index navigation. Name-based navigation (TryChild(string), Children(string)) looks through these wrappers to expose the inner named rule nodes directly.

Constructors

QuantifierNode(SourceSpan, string, Rule, IReadOnlyList<ParseNode>)

A synthetic wrapper node produced by a quantifier (?, *, +) that appears as one element inside a sequence. Contains one child per repetition of the quantifier's body. The Rule is the owning parser rule (same as the enclosing sequence).

public QuantifierNode(SourceSpan Span, string ModeName, Rule Rule, IReadOnlyList<ParseNode> Children)

Parameters

Span SourceSpan

ModeName string

Rule Rule

Children IReadOnlyList<ParseNode>

Remarks

This type is a subtype of ParserNode so that it integrates transparently with existing rule-name handlers and integer-index navigation. Name-based navigation (TryChild(string), Children(string)) looks through these wrappers to expose the inner named rule nodes directly.