Changeset 1585 for branches/ralph/src/main/java/de/ugoe/cs/autoquest/tasktrees/alignment/pal/tree/FengDoolittleNode.java
- Timestamp:
- 06/29/14 11:11:30 (10 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/ralph/src/main/java/de/ugoe/cs/autoquest/tasktrees/alignment/pal/tree/FengDoolittleNode.java
r1583 r1585 344 344 * @param n2 number of second child 345 345 */ 346 public voidjoinChildren( int n1, int n2) {346 public Node joinChildren( int n1, int n2) { 347 347 348 348 if (n1 == n2) { … … 376 376 //System.out.println("Merging " + child1.getIdentifier() + " with " + child2.getIdentifier()); 377 377 378 if(newNode instanceof FengDoolittleNode) { 379 newNode.setSequences(((FengDoolittleNode) newNode).alignSequences()); 380 } 381 378 return newNode; 382 379 } 383 380 … … 397 394 398 395 399 private ArrayList<NumberSequence> alignSequences() {400 ArrayList<NumberSequence> alignment = new ArrayList<NumberSequence>();401 if(this.getChildCount()<3) {402 403 Node node1 = getChild(0);404 Node node2 = getChild(1);405 406 int seqCount1 = node1.getSequences().size();407 int seqCount2 = node2.getSequences().size();408 409 //Align 2 sequences410 if(seqCount1 == 1 && seqCount2 == 1) {411 }412 //Align a sequence to a group413 else if( seqCount1 > 1 && seqCount2 == 1) {414 415 }416 //Align a sequence to a group417 else if(seqCount1 == 1 && seqCount2 > 1) {418 419 }420 //Align 2 groups421 else if((seqCount1 > 1) && (seqCount2 > 1)){422 423 }424 else {425 Console.traceln(Level.INFO,"No sequences to align while merging two nodes.");426 }427 }428 else {429 Console.traceln(Level.WARNING,"More than 2 children! This should never happen, it's a binary tree.");430 }431 return alignment;432 }433 434 396 public void setSequences(ArrayList<NumberSequence> alignSequences) { 435 397 this.sequences = alignSequences; 436 398 } 437 399 400 401 438 402 }
Note: See TracChangeset
for help on using the changeset viewer.