Parcourir la source

translate pseudocode to english

Eren Yilmaz il y a 6 ans
Parent
commit
abf4893d9b

+ 2 - 2
src/bk/BlockCalc.java

@@ -241,8 +241,8 @@ public class BlockCalc implements AlgorithmStage {
 
 
     @Override
     @Override
     public PseudoCodeNode createPseudocodeTree() {
     public PseudoCodeNode createPseudocodeTree() {
-        PseudoCodeNode root = new PseudoCodeNode( "Berechne den Block Graph" );
-        loopNode = new PseudoCodeNode( "Loop durch alle Knoten..." );
+        PseudoCodeNode root = new PseudoCodeNode( "Vertical alignment" );
+        loopNode = new PseudoCodeNode( "Loop through all nodes..." );
         root.add( loopNode );
         root.add( loopNode );
         return root;
         return root;
     }
     }

+ 3 - 3
src/bk/Combine.java

@@ -143,10 +143,10 @@ public class Combine implements AlgorithmStage {
 
 
     @Override
     @Override
     public PseudoCodeNode createPseudocodeTree() {
     public PseudoCodeNode createPseudocodeTree() {
-        PseudoCodeNode root = new PseudoCodeNode( "Berechne das durchschnittliche Layout" );
+        PseudoCodeNode root = new PseudoCodeNode( "Balancing" );
         alignNode = new PseudoCodeNode( "Align Layouts" );
         alignNode = new PseudoCodeNode( "Align Layouts" );
-        setNode = new PseudoCodeNode( "Setze Koordinaten auf Mittelwert" );
-        loopNode = new PseudoCodeNode( "Loop durch alle Knoten");
+        setNode = new PseudoCodeNode( "Align to assignment of smallest width" );
+        loopNode = new PseudoCodeNode( "Set coordinates to average median of aligned candidates" );
         setNode.add( loopNode );
         setNode.add( loopNode );
         root.add( alignNode );
         root.add( alignNode );
         root.add( setNode );
         root.add( setNode );

+ 5 - 5
src/bk/Compaction.java

@@ -311,12 +311,12 @@ public class Compaction implements AlgorithmStage{
 
 
     @Override
     @Override
     public PseudoCodeNode createPseudocodeTree() {
     public PseudoCodeNode createPseudocodeTree() {
-        PseudoCodeNode root = new PseudoCodeNode( "Plaziere die Knoten" );
-        placeNode = new PseudoCodeNode( "Berechne die Klasen und Plaziere sie" );
-        placeLoopNode = new PseudoCodeNode( "Loop durch alle Wurzelknoten..." );
+        PseudoCodeNode root = new PseudoCodeNode( "Horizontal compaction" );
+        placeNode = new PseudoCodeNode( "Root coordinates relative to sink" );
+        placeLoopNode = new PseudoCodeNode( "Loop through root nodes..." );
         placeNode.add( placeLoopNode );
         placeNode.add( placeLoopNode );
-        applyNode = new PseudoCodeNode( "Shift anwenden" );
-        applyLoopNode = new PseudoCodeNode( "Loop durch alle Knoten..." );
+        applyNode = new PseudoCodeNode( "Absolute coordinates" );
+        applyLoopNode = new PseudoCodeNode( "Loop through all nodes..." );
         applyNode.add( applyLoopNode );
         applyNode.add( applyLoopNode );
         root.add( placeNode );
         root.add( placeNode );
         root.add( applyNode );
         root.add( applyNode );

+ 3 - 3
src/bk/ConflictDetection.java

@@ -116,9 +116,9 @@ public class ConflictDetection implements AlgorithmStage {
 
 
     @Override
     @Override
     public PseudoCodeNode createPseudocodeTree() {
     public PseudoCodeNode createPseudocodeTree() {
-        PseudoCodeNode root = new PseudoCodeNode( "Markiere alle Konflikte mit inneren Kantensegmenten" );
-        PseudoCodeNode loopNode = new PseudoCodeNode( "Loop durch alle Knoten" );
-        markNode = new PseudoCodeNode( "Wenn eine eingehende Kante aus einem Inneren segmen existiert, markiere alle anderen Kanten die diese Kreuzen als Conflicted" );
+        PseudoCodeNode root = new PseudoCodeNode( "Preprocessing (mark type 1 conflicts)" );
+        PseudoCodeNode loopNode = new PseudoCodeNode( "Loop through all nodes..." );
+        markNode = new PseudoCodeNode( "If non-inner segment crosses an inner segment whose target is this node, mark the non-inner segment as conflicted" );
         loopNode.add( markNode );
         loopNode.add( markNode );
         root.add( loopNode );
         root.add( loopNode );
         return root;
         return root;

+ 4 - 4
src/bk/ExtremalLayoutCalc.java

@@ -92,13 +92,13 @@ public class ExtremalLayoutCalc implements AlgorithmStage {
     @Override
     @Override
     public PseudoCodeNode createPseudocodeTree() {
     public PseudoCodeNode createPseudocodeTree() {
         if( type == LayoutType.TOP_BOTTOM_LEFT )
         if( type == LayoutType.TOP_BOTTOM_LEFT )
-            pseudoCode = new PseudoCodeNode( "Berechne extremes Layout 'Top Left'" );
+            pseudoCode = new PseudoCodeNode( "Extremal layout: leftmost upper" );
         if( type == LayoutType.TOP_BOTTOM_RIGHT )
         if( type == LayoutType.TOP_BOTTOM_RIGHT )
-            pseudoCode = new PseudoCodeNode( "Berechne extremes Layout 'Top Right'" );
+            pseudoCode = new PseudoCodeNode( "Extremal layout: rightmost upper'" );
         if( type == LayoutType.BOTTOM_TOP_LEFT )
         if( type == LayoutType.BOTTOM_TOP_LEFT )
-            pseudoCode = new PseudoCodeNode( "Berechne extremes Layout 'Bottom Left'" );
+            pseudoCode = new PseudoCodeNode( "Extremal layout: leftmost lower'" );;
         if( type == LayoutType.BOTTOM_TOP_RIGHT )
         if( type == LayoutType.BOTTOM_TOP_RIGHT )
-            pseudoCode = new PseudoCodeNode( "Berechne extremes Layout 'Bottom Right'" );
+            pseudoCode = new PseudoCodeNode( "Extremal layout: rightmost lower'" );
         bcNode = bc.createPseudocodeTree();
         bcNode = bc.createPseudocodeTree();
         cpNode = cp.createPseudocodeTree();
         cpNode = cp.createPseudocodeTree();
         pseudoCode.add( bcNode );
         pseudoCode.add( bcNode );