Merge pull request #792 from fesch/bugfix

Version 3.30-03 candidate (Bugfixes)

buildapp.xml

@@ -15,8 +15,8 @@
 	        name="Structorizer"
 	        displayname="Structorizer"
 	        identifier="lu.fisch.Structorizer"
-	        shortversion="3.30-02"
-	        version="3.30-02"
+	        shortversion="3.30-03"
+	        version="3.30-03"
 	        icon="icons/Structorizer.icns"
 	        mainclassname="Structorizer"
 	        copyright="Bob Fisch"

samples/export/BASIC0/SORTING_TEST_MAIN.bas

@@ -2,7 +2,7 @@
 20 REM to allow performance comparison via execution counting ("Collect Runtime Data" should 
 30 REM sensibly be switched on). 
 40 REM Requested input data are: Number of elements (size) and filing mode. 
-50 REM Generated by Structorizer 3.30-02 
+50 REM Generated by Structorizer 3.30-03 
 60 REM  
 70 REM Copyright (C) 2019-10-02 Kay Gürtzig 
 80 REM License: GPLv3-link 
@@ -29,7 +29,7 @@
 290       LET values1(i) = -i
 300   END SELECT
 310 NEXT i
-320 REM Kopiere das Array für exakte Vergleichbarkeit 
+320 REM Copy the array for exact comparability 
 330 FOR i = 0 TO elementCount-1
 340   LET values2(i) = values1(i)
 350   LET values3(i) = values1(i)
@@ -58,9 +58,9 @@
 580 REM ================== END PARALLEL SECTION ================== 
 590 REM ========================================================== 
 600 
-610 LET CALL ok1 = testSorted(values1)
-620 LET CALL ok2 = testSorted(values2)
-630 LET CALL ok3 = testSorted(values3)
+610 LET ok1 = testSorted(values1)
+620 LET ok2 = testSorted(values2)
+630 LET ok3 = testSorted(values3)
 640 IF NOT ok1 OR NOT ok2 OR NOT ok3 THEN
 650   FOR i = 0 TO elementCount-1
 660     IF values1(i) <> values2(i) OR values1(i) <> values3(i) THEN
@@ -212,7 +212,7 @@
 2120     LET p = random(stop-start) + start
 2130     REM Partition the array into smaller and greater elements 
 2140     REM Get the resulting (and final) position of the pivot element 
-2150     LET CALL p = partition(values, start, stop, p)
+2150     LET p = partition(values, start, stop, p)
 2160     REM Sort subsequances separately and independently ... 
 2170 
 2180     REM ==========================================================