Differences

This shows you the differences between two versions of the page.

--- at:tutorial:basic [2007/07/18 11:29] – elisag
+++ at:tutorial:basic [2007/12/28 12:29] – fixed tvcutsem
@@ Line 341: / Line 341: @@
 >>true
 </code>
 ==== Tables ====
-We have already introduce how to define tables. Let us now focus on how to manipulate them with the native methods provided by the table object.
+We have already introduced how to define tables. Let us now focus on how to manipulate them with the native methods provided by the table object.
 <code>
 >[1,2,3].filter: {|e| e != 2 }
@@ Line 427: / Line 428: @@
 <code>
 >def sort(table, cmp := { |e1,e2| e1 < e2 }) {
-	def quickSort(table, low, high) {
+  def quickSort(table, low, high) {
-	   	def left := low;
+    def left := low;
-	   	def right := high;
+    def right := high;
-	   	def pivot := table[(left+right) /- 2];
+    def pivot := table[(left+right) /- 2];
-	   	def save := nil;
+    def save := nil;
-        while: { left <= right } do: {
+    while: { left <= right } do: {
-		    while: { cmp(table[left], pivot) } do: {
+      while: { cmp(table[left], pivot) } do: {
-                left := left + 1
+        left := left + 1
-            };
+      };
-		    while: { cmp(pivot, table[right]) } do: {
+      while: { cmp(pivot, table[right]) } do: {
-                right := right - 1
+        right := right - 1
-            };
+      };
-		    if: (left <= right) then: {
+      if: (left <= right) then: {
-			    // swap elements
+        // swap elements
-			    save := table[left];
+        save := table[left];
-					table[left] := table[right];
+        table[left] := table[right];
-					table[right] := save;
+        table[right] := save;
-					left := left + 1;
+        left := left + 1;
-					right := right - 1;
+        right := right - 1;
-		    };
+      };
-	   };
+    };
-	   if: (low<right) then: { quickSort(table,low,right) };
+    if: (low<right) then: { quickSort(table,low,right) };
-	   if: (high>left) then: { quickSort(table,left,high) };
+    if: (high>left) then: { quickSort(table,left,high) };
-	   table;
+    table;
-	  };
+  };
-	  quickSort(table, 1, table.getLength());
+  quickSort(table, 1, table.getLength());
-	};
+};
 >><closure:sort>
 >sort([2,37,6,4,5,8])