com.googlecode.sarasvati.visitor.DepthFirstTokenTraversal Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of sarasvati-core Show documentation
The newest version!
/*
    This file is part of Sarasvati.

    Sarasvati is free software: you can redistribute it and/or modify
    it under the terms of the GNU Lesser General Public License as
    published by the Free Software Foundation, either version 3 of the
    License, or (at your option) any later version.

    Sarasvati is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU Lesser General Public License for more details.

    You should have received a copy of the GNU Lesser General Public
    License along with Sarasvati.  If not, see .

    Copyright 2008 Paul Lorenz
*/

package com.googlecode.sarasvati.visitor;

import java.util.HashSet;
import java.util.LinkedList;
import java.util.Set;

import com.googlecode.sarasvati.ArcToken;
import com.googlecode.sarasvati.NodeToken;

public class DepthFirstTokenTraversal implements TokenTraversal
{
  private final LinkedList nodeTokenQueue = new LinkedList();
  private final LinkedList arcTokenQueue = new LinkedList();

  private final Set nodeTokens = new HashSet();

  private final boolean forward;

  public DepthFirstTokenTraversal ()
  {
    this.forward = true;
  }

  public DepthFirstTokenTraversal (final boolean forward)
  {
    this.forward = forward;
  }

  @Override
  public void traverse (final NodeToken token, final TokenVisitor visitor)
  {
    enqueueNodeToken( token );
    traverse( visitor );
  }

  @Override
  public void traverse (final ArcToken token, final TokenVisitor visitor)
  {
    arcTokenQueue.add( token );
    traverse( visitor );
  }

  protected void traverse (final TokenVisitor visitor)
  {
    while ( !nodeTokenQueue.isEmpty() || !arcTokenQueue.isEmpty() )
    {
      if ( !nodeTokenQueue.isEmpty() )
      {
        NodeToken token = nodeTokenQueue.removeFirst();
        token.accept( visitor );
        arcTokenQueue.addAll( 0, forward ? token.getChildTokens() : token.getParentTokens() );
      }

      if ( !arcTokenQueue.isEmpty() )
      {
        ArcToken token = arcTokenQueue.removeFirst();

        if ( visitor.follow( token ) )
        {
          token.accept( visitor );
          enqueueNodeToken( forward ? token.getChildToken() : token.getParentToken() );
        }
      }
    }
  }

  protected void enqueueNodeToken (final NodeToken token)
  {
    if ( token != null && !nodeTokens.contains( token.getId() ) )
    {
      nodeTokenQueue.add( 0, token );
      nodeTokens.add( token.getId() );
    }
  }
}