***************
*** 35
-         begin
--- 35 -----
+ 	begin
***************
*** 37,39
-           vf1 <= False;
-            f0 <= x;
-         end
--- 37,39 -----
+ 	  vf1 <= False;
+ 	   f0 <= x;
+   	end
***************
*** 44
-         end
--- 44 -----
+  	end
***************
*** 46
-                                                                                 
--- 46 -----
+ 										
***************
*** 98
-                                                                                 
--- 98 -----
+ 										
***************
*** 136
-     for (Integer x = n - 1; x > -1; x = x - 1)
--- 136 -----
+     for (Integer x = n - 1; x > 0; x = x - 1)
***************
*** 164,170
-     for (Integer x = 0; x < ( n - 1 ); x = x + 1)
-       begin
-         (registers[x]) <= registers[x + 1]._read();
-         (valids[x]) <= valids[x + 1]._read();
-       end
-     (valids[n-1]) <= False;
-         
--- 164,171 -----
+     for (Integer x = 0; x < (n-1); x = x + 1)
+     begin
+     
+       (registers[x]) <= registers[x + 1]._read();
+       (valids[x]) <= valids[x + 1]._read();
+     
+     end
+     
***************
*** 181,183
-       if ( valids[x]._read() && searchfunc(sv, registers[x]._read()) )
-         res = True;
-       
--- 182,183 -----
+       res = valids[x]._read() && searchfunc(sv, registers[x]._read());
+     
***************
*** 192,194
-       if ( valids[x]._read() && searchfunc(sv, registers[x]._read()) )
-         res = True;
-      
--- 192,193 -----
+       res = valids[x]._read() && searchfunc(sv, registers[x]._read());
+     
***************
*** 222
-                                                                                 
--- 221 -----
+