/**
  * Copyright (c): Uwe Schmidt, FH Wedel
  *
  * You may study, modify and distribute this source code
  * FOR NON-COMMERCIAL PURPOSES ONLY.
  * This copyright message has to remain unchanged.
  *
  * Note that this document is provided 'as is',
  * WITHOUT WARRANTY of any kind either expressed or implied.
  */

/**
  *
  * tests
  */

//--------------------

public
class Hamilton {
  public
  static
  void main(String[] argv) {
    printSequence("Hamilton",
		  20,
		  hamilton());
    printSequence("sum of Fibonacci",
		  20,
		  new Sum(new Fibonacci()));
    printSequence("sum of n^2",
		  20,
		  new Sum(new Power(new Count(),2)));
    printSequence("diff of sum of Fibonacci",
		  20,
		  new Diff(new Sum(new Fibonacci())));

  }

  public
  static
  void
  printSequence(String title,
		int limit,
		Sequence s) {

    System.out.println(title);

    for (int i = 0;
	 i < limit;
	 ++i) {
      System.out.println("\t" + i + ":\t" + s.next());
    }

    System.out.println("");
  }

  public
  static
  Sequence hamilton() {
    Sequence s2 = new Scale(2, new Count());
    Sequence s3 = new Scale(3, new Count());
    Sequence s5 = new Scale(5, new Count());

    Sequence m23  = new Merge(s2,  s3);
    Sequence m235 = new Merge(m23, s5);

    return
      new Unique(m235);
  }

}

//--------------------