/*
 * [The "BSD license"]
 *  Copyright (c) 2012 Terence Parr
 *  Copyright (c) 2012 Sam Harwell
 *  All rights reserved.
 *
 *  Redistribution and use in source and binary forms, with or without
 *  modification, are permitted provided that the following conditions
 *  are met:
 *
 *  1. Redistributions of source code must retain the above copyright
 *     notice, this list of conditions and the following disclaimer.
 *  2. Redistributions in binary form must reproduce the above copyright
 *     notice, this list of conditions and the following disclaimer in the
 *     documentation and/or other materials provided with the distribution.
 *  3. The name of the author may not be used to endorse or promote products
 *     derived from this software without specific prior written permission.
 *
 *  THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 *  IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 *  OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 *  IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 *  INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 *  NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 *  DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 *  THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 *  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 *  THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

module antlr.v4.runtime.tree.AbstractParseTreeVisitor;

import antlr.v4.runtime.tree.ParseTreeVisitor;

// Class Template AbstractParseTreeVisitor
/**
 * TODO add class description
 */
abstract class AbstractParseTreeVisitor(T) : ParseTreeVisitor!T
{

    /**
     * @uml
     * {@inheritDoc}
     *
     *  <p>The default implementation calls {@link ParseTree#accept} on the
     *  specified tree.</p>
     */
    public T visit(ParseTree tree)
    {
        return tree.accept(this);
    }

    /**
     * @uml
     * {@inheritDoc}
     *
     * <p>The default implementation initializes the aggregate result to
     * {@link #defaultResult defaultResult()}. Before visiting each child, it
     * calls {@link #shouldVisitNextChild shouldVisitNextChild}; if the result
     * is {@code false} no more children are visited and the current aggregate
     * result is returned. After visiting a child, the aggregate result is
     * updated by calling {@link #aggregateResult aggregateResult} with the
     * previous aggregate result and the result of visiting the child.</p>
     *
     * <p>The default implementation is not safe for use in visitors that modify
     * the tree structure. Visitors that modify the tree should override this
     * method to behave properly in respect to the specific algorithm in use.</p>
     * @override
     */
    public override T visitChildren(RuleNode node)
    {
        T result = defaultResult();
        int n = node.getChildCount();
        for (int i=0; i<n; i++) {
            if (!shouldVisitNextChild(node, result)) {
                break;
            }

            ParseTree c = node.getChild(i);
            T childResult = c.accept(this);
            result = aggregateResult(result, childResult);
        }

        return result;
    }

    /**
     * @uml
     * {@inheritDoc}
     *
     * <p>The default implementation returns the result of
     * {@link #defaultResult defaultResult}.</p>
     * @override
     */
    public override T visitTerminal(TerminalNode node)
    {
        return defaultResult();
    }

    /**
     * @uml
     * {@inheritDoc}
     *
     * <p>The default implementation returns the result of
     * {@link #defaultResult defaultResult}.</p>
     * @override
     */
    public override T visitErrorNode(ErrorNode node)
    {
        return defaultResult();
    }

    /**
     * @uml
     * Gets the default value returned by visitor methods. This value is
     * returned by the default implementations of
     * {@link #visitTerminal visitTerminal}, {@link #visitErrorNode visitErrorNode}.
     * The default implementation of {@link #visitChildren visitChildren}
     * initializes its aggregate result to this value.
     *
     * <p>The base implementation returns {@code null}.</p>
     *
     *  @return The default value returned by visitor methods.
     */
    private T defaultResult()
    {
        return null;
    }

    /**
     * @uml
     * Aggregates the results of visiting multiple children of a node. After
     * either all children are visited or {@link #shouldVisitNextChild} returns
     * {@code false}, the aggregate value is returned as the result of
     * {@link #visitChildren}.
     *
     * <p>The default implementation returns {@code nextResult}, meaning
     * {@link #visitChildren} will return the result of the last child visited
     * (or return the initial value if the node has no children).</p>
     *
     *  @param aggregate The previous aggregate value. In the default
     * implementation, the aggregate value is initialized to
     *  {@link #defaultResult}, which is passed as the {@code aggregate} argument
     * to this method after the first child node is visited.
     *  @param nextResult The result of the immediately preceeding call to visit
     * a child node.
     *
     *  @return The updated aggregate result.
     */
    private T aggregateResult(T aggregate, T nextResult)
    {
    }

    /**
     * @uml
     * This method is called after visiting each child in
     * {@link #visitChildren}. This method is first called before the first
     * child is visited; at that point {@code currentResult} will be the initial
     * value (in the default implementation, the initial value is returned by a
     * call to {@link #defaultResult}. This method is not called after the last
     * child is visited.
     *
     * <p>The default implementation always returns {@code true}, indicating that
     * {@code visitChildren} should only return after all children are visited.
     * One reason to override this method is to provide a "short circuit"
     * evaluation option for situations where the result of visiting a single
     * child has the potential to determine the result of the visit operation as
     * a whole.</p>
     *
     *  @param node The {@link RuleNode} whose children are currently being
     * visited.
     *  @param currentResult The current aggregate result of the children visited
     * to the current point.
     *
     *  @return {@code true} to continue visiting children. Otherwise return
     *  {@code false} to stop visiting children and immediately return the
     *  current aggregate result from {@link #visitChildren}.
     */
    private bool shouldVisitNextChild(RuleNode node, T currentResult)
    {
    }

}