[GH parrot#175] Renamed sort.pir benchmark to sort_fia.pir

This makes it more obvious that this benchmark is for sorting FixedIntegerArrays in much the same way that sort_ffa.pir benchmarks sorting FixedFloatarrays
paultcochrane · Mar 24, 2013 · 63affbc · 63affbc
1 parent ae87849
commit 63affbc
Show file tree

Hide file tree

Showing 2 changed files with 3 additions and 3 deletions.
diff --git a/examples/benchmarks/sort.pir → examples/benchmarks/sort_fia.pir b/examples/benchmarks/sort.pir → examples/benchmarks/sort_fia.pir
@@ -6,11 +6,11 @@ examples/benchmarks/sort.pir - Sort an FixedIntegerArray of N integers
 
 =head1 SYNOPSIS
 
-    % time ./parrot examples/benchmarks/sort.pir 100000
+    % time ./parrot examples/benchmarks/sort_fia.pir 100000
 
 Or use the default number of iterations:
 
-    % time ./parrot examples/benchmarks/sort.pir
+    % time ./parrot examples/benchmarks/sort_fia.pir
 
 =head1 DESCRIPTION
 

diff --git a/t/benchmark/benchmarks.t b/t/benchmark/benchmarks.t
@@ -164,8 +164,8 @@ FixedPMCArray:\s\d+\.\d+s\n
         is\s1230\nlast\sis:\s9973\n$/x,
     q{primes_i.pasm} => qr/^N\sprimes\sup\sto\s10000\sis:\s1229\n
         last\sis:\s9973\nElapsed\stime:\s\d+\.\d+\n$/x,
-    q{sort.pir} => qr/Sorted 1000000 integers/,
     q{sort_ffa.pir} => qr/Sorted 1000000 floats/,
+    q{sort_fia.pir} => qr/Sorted 1000000 integers/,
     q{stress.pasm}     => qr/^A\stotal\sof\s\d+\sGC\sruns\s
         were\smade\n$/x,
     q{stress1.pasm} => qr/^\d+\.\d+\n