refactor: move benchmark directory under test and update all references

The benchmark directory is relocated from the project root into the test directory, and all scripts, documentation links, and gitignore paths are updated accordingly. The test runner is also refactored to explicitly walk subdirectories (core, io, language, limit) instead of using a single test root, and a new test/README.md is added to document the test suite structure. Additionally, the constructor test for the Foo class is updated to add a zero-arity constructor and adjust expected output strings.
2015-03-14 19:45:56 +00:00
parent af58528e88
commit c4ef964f92
562 changed files with 32 additions and 8 deletions
@@ -0,0 +1,56 @@
+# The Computer Language Benchmarks Game
+# http://benchmarksgame.alioth.debian.org/
+
+#    contributed by Isaac Gouy
+#    converted to Java by Oleg Mazurov
+#    converted to Python by Buck Golemon
+#    modified by Justin Peel
+
+def fannkuch(n):
+    maxFlipsCount = 0
+    permSign = True
+    checksum = 0
+
+    perm1 = list(range(n))
+    count = perm1[:]
+    rxrange = range(2, n - 1)
+    nm = n - 1
+    while 1:
+        k = perm1[0]
+        if k:
+            perm = perm1[:]
+            flipsCount = 1
+            kk = perm[k]
+            while kk:
+                perm[:k+1] = perm[k::-1]
+                flipsCount += 1
+                k = kk
+                kk = perm[kk]
+            if maxFlipsCount < flipsCount:
+                maxFlipsCount = flipsCount
+            checksum += flipsCount if permSign else -flipsCount
+
+        # Use incremental change to generate another permutation
+        if permSign:
+            perm1[0],perm1[1] = perm1[1],perm1[0]
+            permSign = False
+        else:
+            perm1[1],perm1[2] = perm1[2],perm1[1]
+            permSign = True
+            for r in rxrange:
+                if count[r]:
+                    break
+                count[r] = r
+                perm0 = perm1[0]
+                perm1[:r+1] = perm1[1:r+2]
+                perm1[r+1] = perm0
+            else:
+                r = nm
+                if not count[r]:
+                    print( checksum )
+                    return maxFlipsCount
+            count[r] -= 1
+
+n = 9
+
+print(( "Pfannkuchen(%i) = %i" % (n, fannkuch(n)) ))