public WhenThenNode(RdlSyntaxNode when, RdlSyntaxNode then) : base(when, then)
{
Descendants = base.Descendants.ToArray();
When.SetParent(this);
Then.SetParent(this);
}
public GreaterNode(RdlSyntaxNode left, RdlSyntaxNode right)
: base(left, right)
{
}
public NotInNode(RdlSyntaxNode left, RdlSyntaxNode right)
: base(left, right)
{
}
protected UnaryNode(RdlSyntaxNode node)
{
_node = node;
}
public AndNode(RdlSyntaxNode left, RdlSyntaxNode right)
: base(left, right)
{
}
public WhenNode(Token token, RdlSyntaxNode when)
: base(when)
{
Token = token;
}
public EqualityNode(RdlSyntaxNode left, RdlSyntaxNode right)
: base(left, right)
{
}
public BetweenNode(Token betweenToken, RdlSyntaxNode exp, RdlSyntaxNode minNode, RdlSyntaxNode maxNode)
{
Descendants = new[] { exp, minNode, maxNode };
Token = betweenToken;
}
public HyphenNode(RdlSyntaxNode left, RdlSyntaxNode right)
: base(left, right)
{
}
public ElseNode(Token token, RdlSyntaxNode node)
: base(node)
{
Token = token;
}
public WhereConditionsNode(RdlSyntaxNode node)
: base(node)
{
}
public ThenNode(Token token, RdlSyntaxNode then)
: base(then)
{
Token = token;
}
public DiffNode(RdlSyntaxNode left, RdlSyntaxNode right)
: base(left, right)
{
}
public LessNode(RdlSyntaxNode left, RdlSyntaxNode right)
: base(left, right)
{
}
protected BinaryNode(RdlSyntaxNode left, RdlSyntaxNode right)
{
Descendants = new[] { left, right };
}