TestNloc.java

package nloc;

import java.util.List;
import java.util.ArrayList;
import java.util.ListIterator;
import java.util.Arrays;

public class TestNloc {


  public static void main(String[] args) {

    //Nloc nl = new Nloc(getNlocS5());
    List<Channel> chList = getNlocS5();
    Nloc nl = new Nloc(chList);
    //Pump pump = nl.getPump();
    //pump.setSteps(2);
    //Channel c1 = new Channel("ch1", 3, 5);
    //Sink s0 = new Sink();
    //Channel c2 = new Channel("ch2", 3, 5);
    //Module m0 = new Module("m0", 5,1);
    //c1.addChild(c2);
    //Droplet pld = new Droplet(DropletType.PAYLOAD, new Position(pump,1));
    //pld.setName("p");
    //Droplet hdr = new Droplet(DropletType.HEADER, new Position(pump,2));
    //hdr.setName("h");
    //
    //System.out.println(pld.coalesce());
    //
    //int normStep = hdr.getNormalizedSteps();

    //System.out.println("Normalized Steps: " + normStep);
    //nl.setDropletList(pump.getDropletList());

    //if (nl.simulate()) {
    //  System.out.println("Success!! Don't coalesce");
    //} else {
    //  System.out.println("Did coalesce!");
    //}

    List<List<Channel>> allPaths = nl.getAllPaths();
    List<Channel> critPath = allPaths.get(4);

    //try {
    //  String[] mtv = {"f2", "m3", "h0", "m5"};
    //  List<List<SequenceTuple>> posSeqs = nl.getPossibleSequences(mtv);
    //  //printSequences(posSeqs);
    //  System.out.println("DEBUG:");
    //  Pump p0 = nl.getShortestSequence(mtv);
    //  printPumpcontents(p0);

    //} catch (Exception e) {
    //  System.out.println(e.getMessage());
    //}
    //printPaths(allPaths);

    //int count = 0;
    //for (List<Channel> path: allPaths) {

      String[] modulesToVisit = extractModuleStringArrayFromPath(critPath);

      System.out.println("Modules to visit: ");
      for (String str: modulesToVisit) {
        System.out.print(str + " " );
      }
      try {
        List<List<SequenceTuple>> seTupList = nl.getPossibleSequences(modulesToVisit);
        printSequences(seTupList);
      } catch (Exception e) {
        System.out.println(e.getMessage());
      }

      //System.out.println("Pathnum: " + count++);
      //Pump p = nl.getShortestSequence(modulesToVisit);
      //printPumpcontents(p);
    //}

  }

  public static void printPumpcontents(Pump pump) {
    List<Droplet> drlist = pump.getDropletList();
    for (Droplet dr: drlist) {
      System.out.print("Droplet: " + dr.getName() + " Pos: " + dr.getPosition().getSteps() + " Outlet: " + dr.getPumpOutlet().getName());
      if (drlist.indexOf(dr) == drlist.size() - 1) {
        System.out.println("");
      } else {
        System.out.print(" | ");
      }
    }
    System.out.println("");

  }
  public static String[] extractModuleStringArrayFromPath(List<Channel> path) {
    List<String> strlist = new ArrayList<String>();
    for (Channel ch: path) {
      if (ch instanceof Module) {
        strlist.add(ch.getName());
      }
    }
    return strlist.toArray(new String[strlist.size()]);
  }

  public static void printSequence(List<SequenceTuple> seq) {
    for (SequenceTuple stup: seq) {
      if (seq.indexOf(stup) == (seq.size() - 1)) {
        System.out.print(stup.getDroplet().getName() + ": " + stup.getMinPos() +
            ":" + stup.getMaxPos() + " : " + stup.getPath().get(1).getName());
      } else { 
        System.out.print(stup.getDroplet().getName() + ": " + stup.getMinPos() +
            ":" + stup.getMaxPos() + " : " + stup.getPath().get(1).getName() + " -> ");
      }
    }
    System.out.println("\n");
  }

  public static void printSequences(List<List<SequenceTuple>> sequences) {
    System.out.println("##################");
    System.out.println("# " + sequences.size() + " Sequences Found");
    System.out.println("##################");
    System.out.println("");
    for (List<SequenceTuple> sl: sequences) {
      printSequence(sl);
    }
  } 

  public static void printPath(List<Channel> path) {
    System.out.println("Pathlength Payload: " + Nloc.getPayloadPathlength(path));
    System.out.println("Pathlength Header: " + Nloc.getHeaderPathlength(path));
    for (Channel ch : path) {
      if (path.indexOf(ch) == (path.size() - 1)) {
        System.out.print(ch.getName());
      } else {
        System.out.print(ch.getName() + " -> ");
      }
    }
    System.out.println("");
    System.out.println("");
  }

  public static void printPaths(List<List<Channel>> pathlist) {
    System.out.println("");
    System.out.println("#############################");
    System.out.println("# Number of paths found: " + pathlist.size());
    System.out.println("#############################");
    for (List<Channel> p : pathlist) {
      printPath(p);
    }
  }

  public static List<Channel> getNlocS1() {

    // channel(name, psteps, hsteps)
    Channel ch1 = new Channel("ch1",1,1);
    Channel ch2 = new Channel("ch2",1,1);
    Channel ch3 = new Channel("ch3",1,1);
    Channel ch4 = new Channel("ch4",1,1);
    Channel ch5 = new Channel("ch5",1,1);
    Channel ch6 = new Channel("ch6",1,1);
    Channel ch7 = new Channel("ch7",1,1);
    Channel ch8 = new Channel("ch8",1,1);
    Channel ch9 = new Channel("ch9",1,1);
    Channel ch10 = new Channel("ch10",1,1);
    Channel ch11 = new Channel("ch11",3,3);
    Channel ch12 = new Channel("ch12",1,1);
    Channel ch13 = new Channel("ch13",1,1);
    Channel ch14 = new Channel("ch14",1,1);
    Channel ch15 = new Channel("ch15",1,1);

    Module m0 = new Module("m0", 5,1);
    Module m1 = new Module("m1", 5,1);
    Module m2 = new Module("m2", 5,1);
    Module d1 = new Module("d1", 5,1);
    Module d2 = new Module("d2", 5,1);
    Module h1 = new Module("h1", 5,1);
    Module h2 = new Module("h2", 5,1);
    Module f2 = new Module("f2", 5,1);

    Pump p0 = new Pump();
    Sink s0 = new Sink();

    List<Channel> chlist = Arrays.asList(ch1, ch2, ch3, ch4, ch5, ch6, ch7, 
        ch8, ch9, ch10, ch11, ch12, ch13, ch14, ch15, m0, m1, m2, d1, d2, h1, 
        h2, f2, p0, s0);

    p0.addChild(ch1);
    p0.addChild(ch2);
    p0.addChild(ch3);

    ch1.addChild(m2);
    m2.addChild(ch4);
    ch4.addChild(d2);
    d2.addChild(ch6);

    ch2.addChild(h2);
    h2.addChild(ch5);

    ch6.addChild(ch7);
    ch5.addChild(ch7);
    ch3.addChild(ch7);