Logo fantomas

TypeDefnUnionNode Type

Example: `type Result<'T> = Ok of 'T | Error of string` — a discriminated union type definition.

Constructors

Constructor Description

TypeDefnUnionNode(typeNameNode, accessibility, unionCases, members, range)

Full Usage: TypeDefnUnionNode(typeNameNode, accessibility, unionCases, members, range)

Parameters:
Returns: TypeDefnUnionNode
typeNameNode : TypeNameNode
accessibility : SingleTextNode option
unionCases : UnionCaseNode list
members : MemberDefn list
range : range
Returns: TypeDefnUnionNode

Instance members

Instance member Description

this.Accessibility

Full Usage: this.Accessibility

Returns: SingleTextNode option
Returns: SingleTextNode option

this.UnionCases

Full Usage: this.UnionCases

Returns: UnionCaseNode list
Returns: UnionCaseNode list

Inherited members

Inherited from NodeBase

Instance members

Instance member Description

this.AddAfter

Full Usage: this.AddAfter

Parameters:
triviaNode : TriviaNode

this.AddBefore

Full Usage: this.AddBefore

Parameters:
triviaNode : TriviaNode

this.AddCursor

Full Usage: this.AddCursor

Parameters:
cursor : pos

this.AppendToStringWithIndent

Full Usage: this.AppendToStringWithIndent

Parameters:
sb : StringBuilder
depth : int

this.ToStringWithIndent

Full Usage: this.ToStringWithIndent

Parameters:
    depth : int

Returns: string
depth : int
Returns: string

this.Children

Full Usage: this.Children

Returns: Node array
Modifiers: abstract
Returns: Node array

this.HasContentAfter

Full Usage: this.HasContentAfter

Returns: bool
Returns: bool

this.Range

Full Usage: this.Range

Returns: range
Returns: range

this.TryGetCursor

Full Usage: this.TryGetCursor

Returns: pos option
Returns: pos option

this.ContentBefore

Full Usage: this.ContentBefore

Returns: TriviaNode seq
Returns: TriviaNode seq

this.ContentAfter

Full Usage: this.ContentAfter

Returns: TriviaNode seq
Returns: TriviaNode seq

this.HasContentBefore

Full Usage: this.HasContentBefore

Returns: bool
Returns: bool

Type something to start searching.