erste version von dem teil dass dem letzeten tupel der liste der sequenztupel...

erste version von dem teil dass dem letzeten tupel der liste der sequenztupel eines hinzufuegt falls notwendig

src/Nloc.java

@@ -248,15 +248,41 @@ public class Nloc {
         // we need header droplet 
         
         // cirst check all possible paths of heder droplets
+        Channel defaultChan = currentBifurcation.getChildrenList().get(0);
         List<List<Channel>> pathList = 
-          this.getAllPathsFromTo(dropletPath.get(0), 
-              currentBifurcation.getChildrenList().get(0));
+          this.getAllPathsFromTo(dropletPath.get(0), defaultChan);
         
         for (List<Channel> path: pathList) {
           List<SequenceTuple> tmp = new ArrayList<SequenceTuple>(seqTupList);
-          tmp.add(new SequenceTuple(new Droplet(DropletType.HEADER),path));
+          SequenceTuple tmpTuple = 
+            new SequenceTuple(new Droplet(DropletType.HEADER),path);
+          tmp.add(tmpTuple);
 
           // TODO: berechnen und setzen von den pump offsets
+          int minPos = currentSeqTup.getMinPos();
+          int maxPos = currentSeqTup.getMaxPos();
+
+          List<Channel> pathToCurrentBifurcation =
+            dropletPath.sublist(0,indexOf(currentBifurcation);
+
+          int pathLenCurrDroplet = 0;
+          if (currentSeqTup.getDroplet().getType() == DropletType.HEADER) {
+            pathLenCurrDroplet = getHeaderPathlength(pathToCurrentBifurcation);
+          } else {
+            pathLenCurrDroplet = getPayloadPathlength(pathToCurrentBifurcation);
+          }
+
+          int maxPathLenNewDroplet = getHeaderPathlength(path);
+          int minPathLenNewDroplet = 
+            maxPathLenNewDroplet - defaultChan.getHSteps() + 1;
+
+          int newTupleMinPos = 
+            minPos - (pathLenCurrDroplet - minPathLenNewDroplet);
+          int newTupleMaxPos = 
+            maxPos - (pathLenCurrDroplet - maxPathLenNewDroplet);
+
+          tmpTuple.setMinPos(newTupleMinPos);
+          tmpTuple.setMaxPos(newTupleMaxPos);
 
           possibleSequences.add(tmp);
         }