aboutsummaryrefslogtreecommitdiff
path: root/tests/performance/05_brainfuck-pi-nerf.in
diff options
context:
space:
mode:
Diffstat (limited to 'tests/performance/05_brainfuck-pi-nerf.in')
-rw-r--r--tests/performance/05_brainfuck-pi-nerf.in27
1 files changed, 27 insertions, 0 deletions
diff --git a/tests/performance/05_brainfuck-pi-nerf.in b/tests/performance/05_brainfuck-pi-nerf.in
new file mode 100644
index 0000000..42bfc06
--- /dev/null
+++ b/tests/performance/05_brainfuck-pi-nerf.in
@@ -0,0 +1,27 @@
+[ yet another pi calculation program in bf
+
+ Just like for pi16.b the accuracy of the result depends on the cellsize:
+
+ - using 8 bit cells causes an overflow after 4 digits
+ - using 16 bit cells causes an overflow after 537 digits
+ - using 32 bit cells causes an overflow after several millions of digits
+
+ It's about ~38 times shorter than pi16.b, ~364 times faster and works with
+ not-wrapping (bignum) implementations.
+
+ by Felix Nawothnig (felix.nawothnig@t-online.de) ]
+
+>
++++++ +++++ +++++ +++++
++++++ +++++ +++++ +++++
+(40 digits)
+
+[<+>>>>>>>>++++++++++<<<<<<<-]>+++++[<+++++++++>-]+>>>>>>+[<<+++[>>[-<]<[>]<-]>>
+[>+>]<[<]>]>[[->>>>+<<<<]>>>+++>-]<[<<<<]<<<<<<<<+[->>>>>>>>>>>>[<+[->>>>+<<<<]>
+>>>>]<<<<[>>>>>[<<<<+>>>>-]<<<<<-[<<++++++++++>>-]>>>[<<[<+<<+>>>-]<[>+<-]<++<<+
+>>>>>>-]<<[-]<<-<[->>+<-[>>>]>[[<+>-]>+>>]<<<<<]>[-]>+<<<-[>>+<<-]<]<<<<+>>>>>>>
+>[-]>[<<<+>>>-]<<++++++++++<[->>+<-[>>>]>[[<+>-]>+>>]<<<<<]>[-]>+>[<<+<+>>>-]<<<
+<+<+>>[-[-[-[-[-[-[-[-[-<->[-<+<->>]]]]]]]]]]<[+++++[<<<++++++++<++++++++>>>>-]<
+<<<+<->>>>[>+<<<+++++++++<->>>-]<<<<<[>>+<<-]+<[->-<]>[>>.<<<<[+.[-]]>>-]>[>>.<<
+-]>[-]>[-]>>>[>>[<<<<<<<<+>>>>>>>>-]<<-]]>>[-]<<<[-]<<<<<<<<]++++++++++.
+#