fabtest.java

移动Agent编程工具Naplet

/*
 * @<#>FabTest.java version 0.0.1, 1/1/2000
 *
 * THIS PROGRAM IS FREE SOFTWARE; YOU CAN DISTRIBUTE IT AND/OR
 * MODIFY IT UNDER THE TERMS OF THE GNU GENERAL PUBLIC LICENSE
 * AS PUBLISHED BY THE FREE SOFTWARE FOUNDATION.
 *
 * THIS PROGRAM 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 GENERAL PUBLIC LICENSE FOR MORE DETAILS.
 *
 * Copyright (c) 2000 Wayne State University. All Rights Reserved.
 *
 */
package fabonacci;

import java.io.*;

import naplet.*;

/**
 * The <code>FabTest</code> class declares a simplest calculation
 * naplet and then launches it via a naplet channel.
 * The naplet calculates the largest Fabonacci number within a limit
 * of FABMAX.  The naplet contains an listener interface for the
 * naplet to call back.
 *
 * @version 0.1, 12/1/2001
 * @author C. Xu
 */

public class FabTest
{

  /*
   * Usage: java [option] FabTest server-list
   */
  public static void main( String args[] )
  {

    int FABMAX = 100;

    // create a naplet and its associated listener
    try
    {
      FabListener nal = new FabListener();
      FabNaplet na = new FabNaplet( "FabNaplet", args, nal, FABMAX );
      NapletID nid = na.getNapletID();

      NapletChannel.launch( na, 2099 );

      // Thread.sleep(3000);
      // NapletChannel.terminate(nid);

    }
    catch ( InvalidNapletException ine )
    {
      System.out.println( "Invalid Naplet Exception " + ine.getMessage() );
    }
    catch ( InvalidItineraryException iie )
    {
      System.out.println( "Invalid Itinerary Exception " + iie.getMessage() );
    }
    catch ( UnableDispatchException ude )
    {
      System.out.println( "Unable Dispatch Exception " + ude.getMessage() );
    }
    catch ( Exception e )
    {
      e.printStackTrace();
    }

  }
}