From d4339435f92b9978770a4af28bee474d75f9280a Mon Sep 17 00:00:00 2001 From: fennecdjay Date: Sun, 10 Nov 2019 23:52:54 +0100 Subject: [PATCH] :book: Update --- Makefile | 3 +- docs.mk | 61 -- .../00_First_Steps/01_InstallingGwion.mdr | 39 - docs/01_Overview/00_First_Steps/Configure.mdr | 18 - docs/01_Overview/BUILDING.mdr | 38 - docs/01_Overview/Keywords.mdr | 31 - docs/01_Overview/Make.mdr | 7 - docs/01_Overview/SpecialWords.mdr | 6 - docs/01_Overview/Testing.mdr | 28 - docs/01_Overview/declaration.mdr | 34 - docs/01_Overview/globalvalues.mdr | 16 - docs/02_Reference/00_Types/00_Primitives.mdr | 1 - docs/02_Reference/00_Types/01_Enums.mdr | 21 - docs/02_Reference/00_Types/02_Unions.mdr | 1 - docs/02_Reference/00_Types/03_Typedefs.mdr | 1 - .../00_Types/04_Function_Pointers.mdr | 1 - docs/02_Reference/01_Functions/Lambdas.mdr | 37 - docs/02_Reference/01_Functions/Variadic.mdr | 18 - docs/02_Reference/01_Functions/function.mdr | 19 - docs/02_Reference/ControlFlow/ControlFlow.mdr | 4 - docs/02_Reference/ControlFlow/Loops.mdr | 1 - docs/02_Reference/ControlFlow/Repeat.mdr | 21 - docs/02_Reference/ControlFlow/forloop.mdr | 63 -- docs/02_Reference/ControlFlow/whileuntil.mdr | 23 - docs/02_Reference/Extending/WIP_Driver.mdr | 9 - docs/02_Reference/Extending/WIP_Plugins.mdr | 68 -- docs/02_Reference/Preprocessor.mdr | 1 - .../03_ContributingTranslation.mdr | 51 -- docs/09_Benchmarks.mdr | 89 --- docs/10_BuildindTheDocs.mdr | 7 - docs/BenchmarkScript.mdr_skip | 52 -- docs/LICENSE | 674 ------------------ docs/assets/benchmark/binary-trees.dat | 3 - docs/assets/benchmark/binary-trees.png | Bin 11825 -> 0 bytes docs/assets/benchmark/fib-recurs.dat | 4 - docs/assets/benchmark/fib-recurs.png | Bin 9342 -> 0 bytes docs/assets/benchmark/fib.dat | 3 - docs/assets/benchmark/fib.png | Bin 8445 -> 0 bytes docs/assets/benchmark/for.dat | 3 - docs/assets/benchmark/for.png | Bin 11923 -> 0 bytes docs/assets/benchmark/method-call.dat | 3 - docs/assets/benchmark/method-call.png | Bin 10483 -> 0 bytes docs/assets/benchmark/string-equals.dat | 2 - docs/assets/benchmark/string-equals.png | Bin 9184 -> 0 bytes docs/assets/doc.css | 7 - docs/config.mk.orig | 32 - docs/index.mdr | 23 - tests/benchmark/binary-trees-gc.wren | 55 -- tests/benchmark/binary-trees.dart | 56 -- tests/benchmark/binary-trees.gw | 51 -- tests/benchmark/binary-trees.lua | 50 -- tests/benchmark/binary-trees.py | 44 -- tests/benchmark/binary-trees.rb | 49 -- tests/benchmark/binary-trees.wren | 51 -- tests/benchmark/fib-recurs.ck | 10 - tests/benchmark/fib-recurs.gw | 8 - tests/benchmark/fib-recurs.hs | 6 - tests/benchmark/fib-recurs.lua | 6 - tests/benchmark/fib-recurs.pl | 9 - tests/benchmark/fib-recurs.py | 7 - tests/benchmark/fib-recurs.rb | 5 - tests/benchmark/fib-recurs.wren | 8 - tests/benchmark/fib.dart | 10 - tests/benchmark/fib.gw | 8 - tests/benchmark/fib.lua | 8 - tests/benchmark/fib.py | 8 - tests/benchmark/fib.rb | 11 - tests/benchmark/fib.wren | 10 - tests/benchmark/for.dart | 10 - tests/benchmark/for.gw | 10 - tests/benchmark/for.lua | 10 - tests/benchmark/for.py | 16 - tests/benchmark/for.rb | 6 - tests/benchmark/for.wren | 8 - tests/benchmark/method-call.ck | 58 -- tests/benchmark/method-call.dart | 78 -- tests/benchmark/method-call.gw | 58 -- tests/benchmark/method-call.lua | 92 --- tests/benchmark/method-call.py | 72 -- tests/benchmark/method-call.rb | 79 -- tests/benchmark/method-call.wren | 68 -- tests/benchmark/string-equals.gw | 21 - tests/benchmark/string-equals.py | 35 - tests/benchmark/string-equals.wren | 24 - 84 files changed, 1 insertion(+), 2637 deletions(-) delete mode 100644 docs.mk delete mode 100644 docs/01_Overview/00_First_Steps/01_InstallingGwion.mdr delete mode 100644 docs/01_Overview/00_First_Steps/Configure.mdr delete mode 100644 docs/01_Overview/BUILDING.mdr delete mode 100644 docs/01_Overview/Keywords.mdr delete mode 100644 docs/01_Overview/Make.mdr delete mode 100644 docs/01_Overview/SpecialWords.mdr delete mode 100644 docs/01_Overview/Testing.mdr delete mode 100644 docs/01_Overview/declaration.mdr delete mode 100644 docs/01_Overview/globalvalues.mdr delete mode 100644 docs/02_Reference/00_Types/00_Primitives.mdr delete mode 100644 docs/02_Reference/00_Types/01_Enums.mdr delete mode 100644 docs/02_Reference/00_Types/02_Unions.mdr delete mode 100644 docs/02_Reference/00_Types/03_Typedefs.mdr delete mode 100644 docs/02_Reference/00_Types/04_Function_Pointers.mdr delete mode 100644 docs/02_Reference/01_Functions/Lambdas.mdr delete mode 100644 docs/02_Reference/01_Functions/Variadic.mdr delete mode 100644 docs/02_Reference/01_Functions/function.mdr delete mode 100644 docs/02_Reference/ControlFlow/ControlFlow.mdr delete mode 100644 docs/02_Reference/ControlFlow/Loops.mdr delete mode 100644 docs/02_Reference/ControlFlow/Repeat.mdr delete mode 100644 docs/02_Reference/ControlFlow/forloop.mdr delete mode 100644 docs/02_Reference/ControlFlow/whileuntil.mdr delete mode 100644 docs/02_Reference/Extending/WIP_Driver.mdr delete mode 100644 docs/02_Reference/Extending/WIP_Plugins.mdr delete mode 100644 docs/02_Reference/Preprocessor.mdr delete mode 100644 docs/08_Contributing/03_ContributingTranslation.mdr delete mode 100644 docs/09_Benchmarks.mdr delete mode 100644 docs/10_BuildindTheDocs.mdr delete mode 100644 docs/BenchmarkScript.mdr_skip delete mode 100644 docs/LICENSE delete mode 100644 docs/assets/benchmark/binary-trees.dat delete mode 100644 docs/assets/benchmark/binary-trees.png delete mode 100644 docs/assets/benchmark/fib-recurs.dat delete mode 100644 docs/assets/benchmark/fib-recurs.png delete mode 100644 docs/assets/benchmark/fib.dat delete mode 100644 docs/assets/benchmark/fib.png delete mode 100644 docs/assets/benchmark/for.dat delete mode 100644 docs/assets/benchmark/for.png delete mode 100644 docs/assets/benchmark/method-call.dat delete mode 100644 docs/assets/benchmark/method-call.png delete mode 100644 docs/assets/benchmark/string-equals.dat delete mode 100644 docs/assets/benchmark/string-equals.png delete mode 100644 docs/assets/doc.css delete mode 100644 docs/config.mk.orig delete mode 100644 docs/index.mdr delete mode 100644 tests/benchmark/binary-trees-gc.wren delete mode 100644 tests/benchmark/binary-trees.dart delete mode 100644 tests/benchmark/binary-trees.gw delete mode 100644 tests/benchmark/binary-trees.lua delete mode 100644 tests/benchmark/binary-trees.py delete mode 100644 tests/benchmark/binary-trees.rb delete mode 100644 tests/benchmark/binary-trees.wren delete mode 100644 tests/benchmark/fib-recurs.ck delete mode 100644 tests/benchmark/fib-recurs.gw delete mode 100644 tests/benchmark/fib-recurs.hs delete mode 100644 tests/benchmark/fib-recurs.lua delete mode 100644 tests/benchmark/fib-recurs.pl delete mode 100644 tests/benchmark/fib-recurs.py delete mode 100644 tests/benchmark/fib-recurs.rb delete mode 100644 tests/benchmark/fib-recurs.wren delete mode 100644 tests/benchmark/fib.dart delete mode 100644 tests/benchmark/fib.gw delete mode 100644 tests/benchmark/fib.lua delete mode 100644 tests/benchmark/fib.py delete mode 100644 tests/benchmark/fib.rb delete mode 100644 tests/benchmark/fib.wren delete mode 100644 tests/benchmark/for.dart delete mode 100644 tests/benchmark/for.gw delete mode 100644 tests/benchmark/for.lua delete mode 100644 tests/benchmark/for.py delete mode 100644 tests/benchmark/for.rb delete mode 100644 tests/benchmark/for.wren delete mode 100644 tests/benchmark/method-call.ck delete mode 100644 tests/benchmark/method-call.dart delete mode 100644 tests/benchmark/method-call.gw delete mode 100644 tests/benchmark/method-call.lua delete mode 100644 tests/benchmark/method-call.py delete mode 100644 tests/benchmark/method-call.rb delete mode 100644 tests/benchmark/method-call.wren delete mode 100644 tests/benchmark/string-equals.gw delete mode 100644 tests/benchmark/string-equals.py delete mode 100644 tests/benchmark/string-equals.wren diff --git a/Makefile b/Makefile index 3a591018..41cf32fa 100644 --- a/Makefile +++ b/Makefile @@ -16,7 +16,7 @@ src := $(wildcard src/*.c) src += $(wildcard src/*/*.c) test_dir_all := $(wildcard tests/*) -test_ignore = tests/benchmark tests/import +test_ignore = tests/import test_dir := $(filter-out $(test_ignore), $(test_dir_all)) test_dir += examples @@ -106,4 +106,3 @@ coverity: include $(wildcard .d/*.d) include util/intl.mk -include docs.mk diff --git a/docs.mk b/docs.mk deleted file mode 100644 index 0bd17945..00000000 --- a/docs.mk +++ /dev/null @@ -1,61 +0,0 @@ -ifeq (,$(wildcard docs/config.mk)) -$(shell cp docs/config.mk.orig docs/config.mk) -endif -include docs/config.mk - -mdr_list = $(filter-out docs/09_Benchmarks.mdr, $(shell find docs -type f -name "*.mdr")) -md_list = $(mdr_list:.mdr=.md) - -_docserver_config = bash scripts/doc-config.sh > mkdocs.yml -_docserver_serve = $(call _docserver_config); $(DOCTOOL) -q serve -_docserver_launch = $(call _docserver_serve)& echo $$! > .server_pid -_docserver_kill = [ -f .server_pid ] && (kill $$(cat .server_pid); rm .server_pid) || true -_mdr_wait=$$(inotifywait -q -r docs --format "%w%f" | tail -n1) - -doc-run: - @bash -c "trap 'trap - SIGINT SIGTERM ERR; $(MAKE) -s doc-clean; exit 1' SIGINT SIGTERM ERR; $(MAKE) -s doc-watch" - -doc-watch: ${md_list} - @$(call _docserver_launch) - @while true; do file=$(call _mdr_wait); echo $$file | grep '\.mdr$$' && mdr $$file; done - -doc-serve: $(md_list) - @$(call _docserver_serve) - -doc-clean: - -@$(call _docserver_kill) - @rm -rf *.gw vlog log $(md_list) .tmp_list .mdr_list site - -doc-build: $(md_list) - $(DOCTOOL) build - -doc-deploy: $(md_list) - -@$(call _docserver_config) - @$(DOCTOOL) gh-deploy - @$(MAKE) -s doc-clean - -.PHONY: mdr_loop watch serve clean run - -.SUFFIXES: .mdr .md -.mdr.md: - $(info compiling $<) - @mdr $< ||: - -.SUFFIXES: .gw .test -.gw.test: - @${VALGRIND} ${VALGRIND_OPT} gwion $< 2>&1 > log - @[ -t 1 ] && $(call _interm) || $(call _noterm) - -define _test_check - for a in $(CONTAINS); do grep "$$a" log >/dev/null; done && valgrind_parse vlog -endef - -_interm_status=printf "$(INTERM_OK)\n" || printf "$(INTERM_NOT_OK)\n" -_interm=(cat log; $(call _test_check) && $(call _interm_status)) - -_noterm_log=sed 's/$$/\/' log -_noterm_status=printf "$(NOTERM_OK)\n" || printf "$(NOTERM_NOT_OK)\n" -_noterm_test=$(call _test_check) && $(call _noterm_status) -_noterm_header=echo '

' -_noterm_footer=echo '

' -_noterm=($(call _noterm_header); $(call _noterm_log); $(call _noterm_test); $(call _noterm_footer)) diff --git a/docs/01_Overview/00_First_Steps/01_InstallingGwion.mdr b/docs/01_Overview/00_First_Steps/01_InstallingGwion.mdr deleted file mode 100644 index b64f4273..00000000 --- a/docs/01_Overview/00_First_Steps/01_InstallingGwion.mdr +++ /dev/null @@ -1,39 +0,0 @@ -# Installing gwion - -## Get the sources - -The source is accessible on [github](https:#!github.com). - -Provided you have git installed, you can get it with: - -``` sh -git clone https:#!github.com/fennecdjay/gwion -``` - -then change to the source directory -``` sh -cd gwion -``` - -### Don't forget submodules - -You'll need the sources for all base module -``` sh -git submodule update --init util ast -``` - -> At this point, you might want to configure the build. - In this case, have a look at the [configuration page](Configure.md) - - -## Build the libraries and program -``` sh -make -``` - -## Install the package - -``` sh -make install -``` -> You may need root privilege to do this. diff --git a/docs/01_Overview/00_First_Steps/Configure.mdr b/docs/01_Overview/00_First_Steps/Configure.mdr deleted file mode 100644 index b05d398b..00000000 --- a/docs/01_Overview/00_First_Steps/Configure.mdr +++ /dev/null @@ -1,18 +0,0 @@ -# Configuring Gwion - -## util/config.mk - -double - -gettext - -memcheck - -lto - -coverage - -## ast/config.mk - -## config.mk -Here are a few choices left diff --git a/docs/01_Overview/BUILDING.mdr b/docs/01_Overview/BUILDING.mdr deleted file mode 100644 index 1babfe52..00000000 --- a/docs/01_Overview/BUILDING.mdr +++ /dev/null @@ -1,38 +0,0 @@ -# Build / Configure Gwion - -## Configure -### gwion-util - - * `USE_MEMCHECK`: compile with debug flags (`-g`) and enable asserts - * `USE_COVERAGE`: add coverage instrumentation - - -## Make -Basically, all that is left to do is -```sh -make -``` -The only environment variable affecting the operation is `PREFIX` - -Except `--(no-)double`, everything can be set when running make, -using environment variables. - -Drivers can be set on using, e.g. for *alsa* : `ALSA_D=1` or `ALSA_D=on`. -In the same way, then can be disabled with `ALSA_D=0` or `ALSA_D=off` - -### Running tests -```bash -make tests -``` -to run all tests, or -```bash -bash util/test.sh my_file_or_directory (.. other files/dirs ...) -``` -to run specific ones. -look [here](#testing.md) for more. -## Install -*maybe as root* -```sh -make install -``` -The only environment variable affecting the operation is `PREFIX` diff --git a/docs/01_Overview/Keywords.mdr b/docs/01_Overview/Keywords.mdr deleted file mode 100644 index 0f8af7ce..00000000 --- a/docs/01_Overview/Keywords.mdr +++ /dev/null @@ -1,31 +0,0 @@ -# Keywords - - * fun/function - * operator - * return - * goto - * switch/case/default - * if/else - * break/continue - * until/do/while/for/repeat - - - - - * global/static - * private/protect - * const - - * new - * spork - * fork - * typeof - - * typedef - * class - * dtor - * extends - * enum - * union - - * auto diff --git a/docs/01_Overview/Make.mdr b/docs/01_Overview/Make.mdr deleted file mode 100644 index 45a5452d..00000000 --- a/docs/01_Overview/Make.mdr +++ /dev/null @@ -1,7 +0,0 @@ -# Makefile - -## Basic operations - -## translations - -## Docs diff --git a/docs/01_Overview/SpecialWords.mdr b/docs/01_Overview/SpecialWords.mdr deleted file mode 100644 index 3b4286a9..00000000 --- a/docs/01_Overview/SpecialWords.mdr +++ /dev/null @@ -1,6 +0,0 @@ -# Special Values - - * me - * this - * vararg - * maybe diff --git a/docs/01_Overview/Testing.mdr b/docs/01_Overview/Testing.mdr deleted file mode 100644 index 5dde62b4..00000000 --- a/docs/01_Overview/Testing.mdr +++ /dev/null @@ -1,28 +0,0 @@ -# Tests -[test.sh](https:#!github.com/fennecdjay/Gwion/blob/dev/util/test.sh) -requires [valgrind](http:#!valgrind.org/) -there are two kinds of tests: - * [gwion](#gwion-tests) - * [bash](#bash-tests) - -## Gwion tests -those tests are just gwion (.gw) files, handling special comments: - * `#! [skip]` (*optionally* followed by reason to skip) - * `#! [todo]` (*optionally* followed by reason to delay testing) - * `#! [contains]` followed by string to match - * `#! [excludes]` followed by string not to match - -## Shell test -those tests are just bash (.sh) files. -they should start with this snippet -```bash -#!/bin/bash -# [test] #5 -n=0 -[ "$1" ] && n="$1" -[ "$n" -eq 0 ] && n=1 -source tests/sh/common.sh -``` - -## TODO - [ ] `bailout` system for early exit on failure diff --git a/docs/01_Overview/declaration.mdr b/docs/01_Overview/declaration.mdr deleted file mode 100644 index 79754b31..00000000 --- a/docs/01_Overview/declaration.mdr +++ /dev/null @@ -1,34 +0,0 @@ -# Declarations - -## Basics - -Declaring a primitive or an object is quite straight forward: -@``` decl0.gw -int i; -Object o; -<<< i, " ", o >>>; -@``` -@exec gwion decl0.gw 2>&1 - -## Declaring a reference -However ... -@``` decl1.gw -Object @ref; -<<< "Reference points to no object yet: ", ref >>>; -#!Object o @=> ref; -new Object @=> ref; -<<< "But now it does: ", ref >>>; -@``` -@exec make decl1.test - -## Arrays - -### array as refs - -@``` decl2.gw -int ref[]; -<<< ref >>>; -new int[2] @=> ref; -<<< ref >>>; -@``` -@exec make decl2.test diff --git a/docs/01_Overview/globalvalues.mdr b/docs/01_Overview/globalvalues.mdr deleted file mode 100644 index 81566954..00000000 --- a/docs/01_Overview/globalvalues.mdr +++ /dev/null @@ -1,16 +0,0 @@ -# Global Values - - * adc - * blackhole - * dac - * pi - * null - * samp - * ms - * second - * hour - * me - * this - * \__func__ - * \__file__ - * \__line__ diff --git a/docs/02_Reference/00_Types/00_Primitives.mdr b/docs/02_Reference/00_Types/00_Primitives.mdr deleted file mode 100644 index 7d279218..00000000 --- a/docs/02_Reference/00_Types/00_Primitives.mdr +++ /dev/null @@ -1 +0,0 @@ -# Primitive types diff --git a/docs/02_Reference/00_Types/01_Enums.mdr b/docs/02_Reference/00_Types/01_Enums.mdr deleted file mode 100644 index 8759ae31..00000000 --- a/docs/02_Reference/00_Types/01_Enums.mdr +++ /dev/null @@ -1,21 +0,0 @@ -# Enums - -For those who don't know about enumerated types, -you can read about those -[here](https://www.geeksforgeeks.org/enumeration-enum-c) and -[here](https://en.wikipedia.org/wiki/Enumerated_type) - -## Enums in gwion -You simply use an enum like this -``` enum0.gw -enum Optionnal_name { - zero, one, two -}; -<<< zero, one, two >>>; -``` - -When inside a class, -Enums are automatically declared **static**, -but they accept **private** or **protect** specifiers. - -When not in a class, they can be made `global` diff --git a/docs/02_Reference/00_Types/02_Unions.mdr b/docs/02_Reference/00_Types/02_Unions.mdr deleted file mode 100644 index 3ca0d197..00000000 --- a/docs/02_Reference/00_Types/02_Unions.mdr +++ /dev/null @@ -1 +0,0 @@ -# Union types diff --git a/docs/02_Reference/00_Types/03_Typedefs.mdr b/docs/02_Reference/00_Types/03_Typedefs.mdr deleted file mode 100644 index a64999b2..00000000 --- a/docs/02_Reference/00_Types/03_Typedefs.mdr +++ /dev/null @@ -1 +0,0 @@ -# Typedefs diff --git a/docs/02_Reference/00_Types/04_Function_Pointers.mdr b/docs/02_Reference/00_Types/04_Function_Pointers.mdr deleted file mode 100644 index 9f45ff3a..00000000 --- a/docs/02_Reference/00_Types/04_Function_Pointers.mdr +++ /dev/null @@ -1 +0,0 @@ -# Function Pointers diff --git a/docs/02_Reference/01_Functions/Lambdas.mdr b/docs/02_Reference/01_Functions/Lambdas.mdr deleted file mode 100644 index ce03cd8a..00000000 --- a/docs/02_Reference/01_Functions/Lambdas.mdr +++ /dev/null @@ -1,37 +0,0 @@ -# Lambda - -## Overview - -Simply put, *lambda*s are anonymous functions. - -The syntax to create them is simple: -``` -\ variable0 variable1 ... { your code here } -``` -You can even use it to -### Call a function just once -@``` lambda_call0.gw -\ i { <<< "passed '", i, "'" >>>; }(3); -@``` -@exec make -s CONTAINS="passed '3'" lambda_call0.test - - -## Use case - -### Passing to a function pointer -@``` lambda_fptr0.gw -typedef void fptr_t(int); -\ i { <<< "passed '", i, "'" >>>; } @=> fptr_t fptr; -fptr(4); -@``` -@exec make -s CONTAINS="passed '4'" lambda_fptr0.test - -### As Argument to Functions -@``` lambda_args0.gw -typedef void fptr_t(int); -fun void test(fptr_t fptr) { - fptr(5); -} -test(\ i { <<< "passed '", i, "'" >>>; }); -@``` -@exec make -s CONTAINS="passed '5'" lambda_args0.test diff --git a/docs/02_Reference/01_Functions/Variadic.mdr b/docs/02_Reference/01_Functions/Variadic.mdr deleted file mode 100644 index bd0a0442..00000000 --- a/docs/02_Reference/01_Functions/Variadic.mdr +++ /dev/null @@ -1,18 +0,0 @@ -# Variadic functions - -> A function whoses arity is not fixed. - -Well, a function that takes a fixed number of arguments, and additionnal ones. - -## a simple example -@``` variadic.gw -fun void variadic_test(int i, ...) { - <<< "first argument is ", i >>>; - vararg.start; - <<< "\tadditionnal argument", vararg.i >>>; - vararg.end; -} -variadic_test(1); -variadic_test(1, 2); -variadic_test(1, 2, 3); -@``` diff --git a/docs/02_Reference/01_Functions/function.mdr b/docs/02_Reference/01_Functions/function.mdr deleted file mode 100644 index 2fab4d37..00000000 --- a/docs/02_Reference/01_Functions/function.mdr +++ /dev/null @@ -1,19 +0,0 @@ -# Functions - -## a simple (commented example) - -@``` function0.gw -#! declare function 'test_function' -#! with return type int -#! taking an int as argument -fun int test_function(int arg) { - #! return the argument + 2 - return arg + 2; -} - -#! now call the function (and debug print the result) -<<< test_function(0) >>>; -#! or use alternate syntax -<<< 1 => test_function >>>; -@``` -@exec make -s function0.test diff --git a/docs/02_Reference/ControlFlow/ControlFlow.mdr b/docs/02_Reference/ControlFlow/ControlFlow.mdr deleted file mode 100644 index 2e9c1854..00000000 --- a/docs/02_Reference/ControlFlow/ControlFlow.mdr +++ /dev/null @@ -1,4 +0,0 @@ -# Control Flow - -## Repeats -let start simple ;-) diff --git a/docs/02_Reference/ControlFlow/Loops.mdr b/docs/02_Reference/ControlFlow/Loops.mdr deleted file mode 100644 index 4b787b4b..00000000 --- a/docs/02_Reference/ControlFlow/Loops.mdr +++ /dev/null @@ -1 +0,0 @@ -# Loops diff --git a/docs/02_Reference/ControlFlow/Repeat.mdr b/docs/02_Reference/ControlFlow/Repeat.mdr deleted file mode 100644 index 37124bb6..00000000 --- a/docs/02_Reference/ControlFlow/Repeat.mdr +++ /dev/null @@ -1,21 +0,0 @@ -# the Repeat keyword -let start simple ;-) -The easiest way to do an action repeatidly in Gwion is, ... the **repeat** keyword! - -## Very basic example -@``` repeat.gw -repeat(3) - <<< "Hello, world!" >>>; -@``` -@exec make -s CONTAINS="Hello" repeat.test - -## Block example -of course this also works with a block code. - -@``` repeat2.gw -repeat(3) { - maybe ? "You" : "Me" => string s; - <<< "Hello, ", s, "!" >>>; -} -@``` -@exec make -s CONTAINS="Hello" repeat2.test diff --git a/docs/02_Reference/ControlFlow/forloop.mdr b/docs/02_Reference/ControlFlow/forloop.mdr deleted file mode 100644 index 52597f18..00000000 --- a/docs/02_Reference/ControlFlow/forloop.mdr +++ /dev/null @@ -1,63 +0,0 @@ -# For Loops -**For** loops in Gwion is pretty similar to classic **C** syntax - -## basic loops -@``` forloop0.gw -for(int i; i < 3; ++i) - <<< i >>>; -@``` -@exec make -s forloop0.test - -Of course, it also works with a block of code. - -@``` forloop2.gw -for(int i; i < 3; ++i) { - i/2 => float f1; - i/2. => float f2; - <<< i, " " , f1, " ", f2 >>>; -} -@``` -@exec make -s forloop2.test - -## Nested Loops -@``` forloop3.gw -int array[3][4]; - -for(int i; i < 3; ++i) { - for(int j; j < 4; ++j) { - <<< array[i][j] >>>; - } -} -@``` -@exec make -s forloop3.test - -### Auto Loops - -#### Simple auto loop -@``` forloop4.gw -int array[2][3]; -for(auto a: array) { - <<< a >>>; - for(auto b: a) - <<< b >>>; -} -@``` -@exec make -s forloop4.test - -### Auto Pointer loop -With the simple auto loop, you only get the value in the array. -If you want to change it, you need a pointer - -@``` forloop5.gw -int array[2][3]; -int i; -for(auto a: array) { - for(auto @b: a) - <<< ++i => *b >>>; -} -for(auto a: array) { - for(auto @b: a) - <<< *b >>>; -} -@``` -@exec make -s forloop5.test diff --git a/docs/02_Reference/ControlFlow/whileuntil.mdr b/docs/02_Reference/ControlFlow/whileuntil.mdr deleted file mode 100644 index 04bf9c36..00000000 --- a/docs/02_Reference/ControlFlow/whileuntil.mdr +++ /dev/null @@ -1,23 +0,0 @@ -# Loops - -@``` while0.gw -while(true) { - if(maybe) - break; - <<< "running..." >>>; -} -@``` -@exec make -s while0.test - -well this may output nothing... -lets try - -@``` while1.gw -<<< maybe >>>; -do{ - if(maybe) - break; - <<< "running..." >>>; -} while(true); -@``` -@exec make -s while1.test diff --git a/docs/02_Reference/Extending/WIP_Driver.mdr b/docs/02_Reference/Extending/WIP_Driver.mdr deleted file mode 100644 index 20478632..00000000 --- a/docs/02_Reference/Extending/WIP_Driver.mdr +++ /dev/null @@ -1,9 +0,0 @@ -# Giving gwion a new driver - -## basics - -> in order to use GWION_CTL ... - -# concept - -# upd driver diff --git a/docs/02_Reference/Extending/WIP_Plugins.mdr b/docs/02_Reference/Extending/WIP_Plugins.mdr deleted file mode 100644 index cd1822fd..00000000 --- a/docs/02_Reference/Extending/WIP_Plugins.mdr +++ /dev/null @@ -1,68 +0,0 @@ -# Writing a Gwion plugin - -> THIS IS OUTDATED. please look at the source code in src/lib/ instead - - * [getting started] - -## Getting started -use the script - -### headers -``` -#include "vm.h" -#include "instr.h" -#include "import.h -``` - - -### Class -Define the type: -``` -struct Type_ t_mytype = { "MyType", SZ_INT, &t_object}; -``` -> every type extending t_object should have SZ_INT - -### Handling Constructors and Destructors -#### CTOR -``` -CTOR(mytype_ctor) { - /* constructor code here */ -} -``` -#### DTOR -``` -DTOR(mytype_dtor) { - /* destructor code here */ -} -``` - -those macros provide two variables: - * `o`: the *M_Object* for the (con/des)tructor - * `shred`: the *VM_Shred* for the (con/des)tructor - -``` -CHECK_BB(import_class_begin(env, &t_mytpe, env->global_nspc, mytype_ctor, mytype_dtor)) -``` -#### variable -declare a `m_int`. coding convention require - * a leading *_o* - * a following *_type_* -```c -m_int o_mytype_myvaroffset; -``` -#### function -```c -/* declare a member function */ -MFUN(mytype_memberfunction) { - /* code here */ -} - -SFUN(mtype_staticfunction) { - /* code here */ -} -``` - -#### operator - -### Import function - diff --git a/docs/02_Reference/Preprocessor.mdr b/docs/02_Reference/Preprocessor.mdr deleted file mode 100644 index e4e9d832..00000000 --- a/docs/02_Reference/Preprocessor.mdr +++ /dev/null @@ -1 +0,0 @@ -# Gwion Preprocessor diff --git a/docs/08_Contributing/03_ContributingTranslation.mdr b/docs/08_Contributing/03_ContributingTranslation.mdr deleted file mode 100644 index 2cd13df4..00000000 --- a/docs/08_Contributing/03_ContributingTranslation.mdr +++ /dev/null @@ -1,51 +0,0 @@ -# Contributing translations - -First off, thank you for considering translating gwion. - -Thanks to the build system, you're gonna get on tracks fast. - - -> You might want to export TRANSLATION_TARGET, -so you don't have to set it on the command line for commands requiring it -`export TRANSLATION_TARGET="xxx"` - -## 1) Init the translation language - -You have to make sure there is a directory for your target language (e.g.: fr, en, es_ES ...). - -``` sh -make translation-init TRANSLATION_TARGET= -``` - -Where `` is your language of choice. -It will fail if your language already exists, but this is not a problem. - -## 2) Edit - -Next, you should adjust the translations. -What about using your favorite editor? - -``` sh -make translation-edit TRANSLATION_TARGET= -``` - -## 3) Update - -Maybe the sources changed, and there is more message to translate? - -``` sh -make translation-update -``` - -This will update all languages. -You can now get back to [step 2](#2-Edit). - -## Add to VCS - -It's now time to add your changes to the package - -``` sh -make translation-commit TRANSLATION_TARGET= -``` - -Now please submit a pull request. diff --git a/docs/09_Benchmarks.mdr b/docs/09_Benchmarks.mdr deleted file mode 100644 index 34a60725..00000000 --- a/docs/09_Benchmarks.mdr +++ /dev/null @@ -1,89 +0,0 @@ -# Benchmarks - -We'll need a bash script - - - -### and a gnuplot script - - - -## Show the results -Then just run it -@exec bash benchmark.sh; rm bench.plot benchmark.sh diff --git a/docs/10_BuildindTheDocs.mdr b/docs/10_BuildindTheDocs.mdr deleted file mode 100644 index 99190c1c..00000000 --- a/docs/10_BuildindTheDocs.mdr +++ /dev/null @@ -1,7 +0,0 @@ -# How this doc is build - -## mdr - -## makefile - -## mkdocs diff --git a/docs/BenchmarkScript.mdr_skip b/docs/BenchmarkScript.mdr_skip deleted file mode 100644 index 8747ce9a..00000000 --- a/docs/BenchmarkScript.mdr_skip +++ /dev/null @@ -1,52 +0,0 @@ -# Benchmarks - -@``` benchmark.sh -@[[shebang]] -@[[languages]] -@[[options]] -@[[functions]] -@``` - -@``` shebang -#!/bin/sh - -@``` - - -@``` languages -#those must match! -language=("gwion" "wren" "lua") -extension=("gw" "wren" "lua") - -@``` - -@``` options -test_dir="tests/benchmark" -plot_script=bench.plot - -# runtime options -@[[runtime]] -@``` - -@``` runtime -# allow this to be set by environment -: "${repeats:=10}" - -@``` - -@``` functions -# bunch of stuff here -@[[run]] -@@[[get_list]] -@@[[get_test]] -@@[[plot]] -@@[[print]] -@``` - -@``` run -run() { - perf stat -r"$repeats" "$1" "$test_dir/$3.$2" 2>&1 | - grep "time elapsed" | - sed 's/ *\([0-9]*\),\([0-9]*\) .* seconds time elapsed *( +- *\([0-9]*\),\([0-9]*\)% )/\1.\2 \3.\4/' -} -@``` diff --git a/docs/LICENSE b/docs/LICENSE deleted file mode 100644 index f288702d..00000000 --- a/docs/LICENSE +++ /dev/null @@ -1,674 +0,0 @@ - GNU GENERAL PUBLIC LICENSE - Version 3, 29 June 2007 - - Copyright (C) 2007 Free Software Foundation, Inc. - Everyone is permitted to copy and distribute verbatim copies - of this license document, but changing it is not allowed. - - Preamble - - The GNU General Public License is a free, copyleft license for -software and other kinds of works. - - The licenses for most software and other practical works are designed -to take away your freedom to share and change the works. By contrast, -the GNU General Public License is intended to guarantee your freedom to -share and change all versions of a program--to make sure it remains free -software for all its users. We, the Free Software Foundation, use the -GNU General Public License for most of our software; it applies also to -any other work released this way by its authors. You can apply it to -your programs, too. - - When we speak of free software, we are referring to freedom, not -price. Our General Public Licenses are designed to make sure that you -have the freedom to distribute copies of free software (and charge for -them if you wish), that you receive source code or can get it if you -want it, that you can change the software or use pieces of it in new -free programs, and that you know you can do these things. - - To protect your rights, we need to prevent others from denying you -these rights or asking you to surrender the rights. Therefore, you have -certain responsibilities if you distribute copies of the software, or if -you modify it: responsibilities to respect the freedom of others. - - For example, if you distribute copies of such a program, whether -gratis or for a fee, you must pass on to the recipients the same -freedoms that you received. You must make sure that they, too, receive -or can get the source code. And you must show them these terms so they -know their rights. - - Developers that use the GNU GPL protect your rights with two steps: -(1) assert copyright on the software, and (2) offer you this License -giving you legal permission to copy, distribute and/or modify it. - - For the developers' and authors' protection, the GPL clearly explains -that there is no warranty for this free software. For both users' and -authors' sake, the GPL requires that modified versions be marked as -changed, so that their problems will not be attributed erroneously to -authors of previous versions. - - Some devices are designed to deny users access to install or run -modified versions of the software inside them, although the manufacturer -can do so. This is fundamentally incompatible with the aim of -protecting users' freedom to change the software. The systematic -pattern of such abuse occurs in the area of products for individuals to -use, which is precisely where it is most unacceptable. Therefore, we -have designed this version of the GPL to prohibit the practice for those -products. If such problems arise substantially in other domains, we -stand ready to extend this provision to those domains in future versions -of the GPL, as needed to protect the freedom of users. - - Finally, every program is threatened constantly by software patents. -States should not allow patents to restrict development and use of -software on general-purpose computers, but in those that do, we wish to -avoid the special danger that patents applied to a free program could -make it effectively proprietary. To prevent this, the GPL assures that -patents cannot be used to render the program non-free. - - The precise terms and conditions for copying, distribution and -modification follow. - - TERMS AND CONDITIONS - - 0. Definitions. - - "This License" refers to version 3 of the GNU General Public License. - - "Copyright" also means copyright-like laws that apply to other kinds of -works, such as semiconductor masks. - - "The Program" refers to any copyrightable work licensed under this -License. Each licensee is addressed as "you". "Licensees" and -"recipients" may be individuals or organizations. - - To "modify" a work means to copy from or adapt all or part of the work -in a fashion requiring copyright permission, other than the making of an -exact copy. The resulting work is called a "modified version" of the -earlier work or a work "based on" the earlier work. - - A "covered work" means either the unmodified Program or a work based -on the Program. - - To "propagate" a work means to do anything with it that, without -permission, would make you directly or secondarily liable for -infringement under applicable copyright law, except executing it on a -computer or modifying a private copy. Propagation includes copying, -distribution (with or without modification), making available to the -public, and in some countries other activities as well. - - To "convey" a work means any kind of propagation that enables other -parties to make or receive copies. Mere interaction with a user through -a computer network, with no transfer of a copy, is not conveying. - - An interactive user interface displays "Appropriate Legal Notices" -to the extent that it includes a convenient and prominently visible -feature that (1) displays an appropriate copyright notice, and (2) -tells the user that there is no warranty for the work (except to the -extent that warranties are provided), that licensees may convey the -work under this License, and how to view a copy of this License. If -the interface presents a list of user commands or options, such as a -menu, a prominent item in the list meets this criterion. - - 1. Source Code. - - The "source code" for a work means the preferred form of the work -for making modifications to it. "Object code" means any non-source -form of a work. - - A "Standard Interface" means an interface that either is an official -standard defined by a recognized standards body, or, in the case of -interfaces specified for a particular programming language, one that -is widely used among developers working in that language. - - The "System Libraries" of an executable work include anything, other -than the work as a whole, that (a) is included in the normal form of -packaging a Major Component, but which is not part of that Major -Component, and (b) serves only to enable use of the work with that -Major Component, or to implement a Standard Interface for which an -implementation is available to the public in source code form. A -"Major Component", in this context, means a major essential component -(kernel, window system, and so on) of the specific operating system -(if any) on which the executable work runs, or a compiler used to -produce the work, or an object code interpreter used to run it. - - The "Corresponding Source" for a work in object code form means all -the source code needed to generate, install, and (for an executable -work) run the object code and to modify the work, including scripts to -control those activities. However, it does not include the work's -System Libraries, or general-purpose tools or generally available free -programs which are used unmodified in performing those activities but -which are not part of the work. For example, Corresponding Source -includes interface definition files associated with source files for -the work, and the source code for shared libraries and dynamically -linked subprograms that the work is specifically designed to require, -such as by intimate data communication or control flow between those -subprograms and other parts of the work. - - The Corresponding Source need not include anything that users -can regenerate automatically from other parts of the Corresponding -Source. - - The Corresponding Source for a work in source code form is that -same work. - - 2. Basic Permissions. - - All rights granted under this License are granted for the term of -copyright on the Program, and are irrevocable provided the stated -conditions are met. This License explicitly affirms your unlimited -permission to run the unmodified Program. The output from running a -covered work is covered by this License only if the output, given its -content, constitutes a covered work. This License acknowledges your -rights of fair use or other equivalent, as provided by copyright law. - - You may make, run and propagate covered works that you do not -convey, without conditions so long as your license otherwise remains -in force. You may convey covered works to others for the sole purpose -of having them make modifications exclusively for you, or provide you -with facilities for running those works, provided that you comply with -the terms of this License in conveying all material for which you do -not control copyright. Those thus making or running the covered works -for you must do so exclusively on your behalf, under your direction -and control, on terms that prohibit them from making any copies of -your copyrighted material outside their relationship with you. - - Conveying under any other circumstances is permitted solely under -the conditions stated below. Sublicensing is not allowed; section 10 -makes it unnecessary. - - 3. Protecting Users' Legal Rights From Anti-Circumvention Law. - - No covered work shall be deemed part of an effective technological -measure under any applicable law fulfilling obligations under article -11 of the WIPO copyright treaty adopted on 20 December 1996, or -similar laws prohibiting or restricting circumvention of such -measures. - - When you convey a covered work, you waive any legal power to forbid -circumvention of technological measures to the extent such circumvention -is effected by exercising rights under this License with respect to -the covered work, and you disclaim any intention to limit operation or -modification of the work as a means of enforcing, against the work's -users, your or third parties' legal rights to forbid circumvention of -technological measures. - - 4. Conveying Verbatim Copies. - - You may convey verbatim copies of the Program's source code as you -receive it, in any medium, provided that you conspicuously and -appropriately publish on each copy an appropriate copyright notice; -keep intact all notices stating that this License and any -non-permissive terms added in accord with section 7 apply to the code; -keep intact all notices of the absence of any warranty; and give all -recipients a copy of this License along with the Program. - - You may charge any price or no price for each copy that you convey, -and you may offer support or warranty protection for a fee. - - 5. Conveying Modified Source Versions. - - You may convey a work based on the Program, or the modifications to -produce it from the Program, in the form of source code under the -terms of section 4, provided that you also meet all of these conditions: - - a) The work must carry prominent notices stating that you modified - it, and giving a relevant date. - - b) The work must carry prominent notices stating that it is - released under this License and any conditions added under section - 7. This requirement modifies the requirement in section 4 to - "keep intact all notices". - - c) You must license the entire work, as a whole, under this - License to anyone who comes into possession of a copy. This - License will therefore apply, along with any applicable section 7 - additional terms, to the whole of the work, and all its parts, - regardless of how they are packaged. This License gives no - permission to license the work in any other way, but it does not - invalidate such permission if you have separately received it. - - d) If the work has interactive user interfaces, each must display - Appropriate Legal Notices; however, if the Program has interactive - interfaces that do not display Appropriate Legal Notices, your - work need not make them do so. - - A compilation of a covered work with other separate and independent -works, which are not by their nature extensions of the covered work, -and which are not combined with it such as to form a larger program, -in or on a volume of a storage or distribution medium, is called an -"aggregate" if the compilation and its resulting copyright are not -used to limit the access or legal rights of the compilation's users -beyond what the individual works permit. Inclusion of a covered work -in an aggregate does not cause this License to apply to the other -parts of the aggregate. - - 6. Conveying Non-Source Forms. - - You may convey a covered work in object code form under the terms -of sections 4 and 5, provided that you also convey the -machine-readable Corresponding Source under the terms of this License, -in one of these ways: - - a) Convey the object code in, or embodied in, a physical product - (including a physical distribution medium), accompanied by the - Corresponding Source fixed on a durable physical medium - customarily used for software interchange. - - b) Convey the object code in, or embodied in, a physical product - (including a physical distribution medium), accompanied by a - written offer, valid for at least three years and valid for as - long as you offer spare parts or customer support for that product - model, to give anyone who possesses the object code either (1) a - copy of the Corresponding Source for all the software in the - product that is covered by this License, on a durable physical - medium customarily used for software interchange, for a price no - more than your reasonable cost of physically performing this - conveying of source, or (2) access to copy the - Corresponding Source from a network server at no charge. - - c) Convey individual copies of the object code with a copy of the - written offer to provide the Corresponding Source. This - alternative is allowed only occasionally and noncommercially, and - only if you received the object code with such an offer, in accord - with subsection 6b. - - d) Convey the object code by offering access from a designated - place (gratis or for a charge), and offer equivalent access to the - Corresponding Source in the same way through the same place at no - further charge. You need not require recipients to copy the - Corresponding Source along with the object code. If the place to - copy the object code is a network server, the Corresponding Source - may be on a different server (operated by you or a third party) - that supports equivalent copying facilities, provided you maintain - clear directions next to the object code saying where to find the - Corresponding Source. Regardless of what server hosts the - Corresponding Source, you remain obligated to ensure that it is - available for as long as needed to satisfy these requirements. - - e) Convey the object code using peer-to-peer transmission, provided - you inform other peers where the object code and Corresponding - Source of the work are being offered to the general public at no - charge under subsection 6d. - - A separable portion of the object code, whose source code is excluded -from the Corresponding Source as a System Library, need not be -included in conveying the object code work. - - A "User Product" is either (1) a "consumer product", which means any -tangible personal property which is normally used for personal, family, -or household purposes, or (2) anything designed or sold for incorporation -into a dwelling. In determining whether a product is a consumer product, -doubtful cases shall be resolved in favor of coverage. For a particular -product received by a particular user, "normally used" refers to a -typical or common use of that class of product, regardless of the status -of the particular user or of the way in which the particular user -actually uses, or expects or is expected to use, the product. A product -is a consumer product regardless of whether the product has substantial -commercial, industrial or non-consumer uses, unless such uses represent -the only significant mode of use of the product. - - "Installation Information" for a User Product means any methods, -procedures, authorization keys, or other information required to install -and execute modified versions of a covered work in that User Product from -a modified version of its Corresponding Source. The information must -suffice to ensure that the continued functioning of the modified object -code is in no case prevented or interfered with solely because -modification has been made. - - If you convey an object code work under this section in, or with, or -specifically for use in, a User Product, and the conveying occurs as -part of a transaction in which the right of possession and use of the -User Product is transferred to the recipient in perpetuity or for a -fixed term (regardless of how the transaction is characterized), the -Corresponding Source conveyed under this section must be accompanied -by the Installation Information. But this requirement does not apply -if neither you nor any third party retains the ability to install -modified object code on the User Product (for example, the work has -been installed in ROM). - - The requirement to provide Installation Information does not include a -requirement to continue to provide support service, warranty, or updates -for a work that has been modified or installed by the recipient, or for -the User Product in which it has been modified or installed. Access to a -network may be denied when the modification itself materially and -adversely affects the operation of the network or violates the rules and -protocols for communication across the network. - - Corresponding Source conveyed, and Installation Information provided, -in accord with this section must be in a format that is publicly -documented (and with an implementation available to the public in -source code form), and must require no special password or key for -unpacking, reading or copying. - - 7. Additional Terms. - - "Additional permissions" are terms that supplement the terms of this -License by making exceptions from one or more of its conditions. -Additional permissions that are applicable to the entire Program shall -be treated as though they were included in this License, to the extent -that they are valid under applicable law. If additional permissions -apply only to part of the Program, that part may be used separately -under those permissions, but the entire Program remains governed by -this License without regard to the additional permissions. - - When you convey a copy of a covered work, you may at your option -remove any additional permissions from that copy, or from any part of -it. (Additional permissions may be written to require their own -removal in certain cases when you modify the work.) You may place -additional permissions on material, added by you to a covered work, -for which you have or can give appropriate copyright permission. - - Notwithstanding any other provision of this License, for material you -add to a covered work, you may (if authorized by the copyright holders of -that material) supplement the terms of this License with terms: - - a) Disclaiming warranty or limiting liability differently from the - terms of sections 15 and 16 of this License; or - - b) Requiring preservation of specified reasonable legal notices or - author attributions in that material or in the Appropriate Legal - Notices displayed by works containing it; or - - c) Prohibiting misrepresentation of the origin of that material, or - requiring that modified versions of such material be marked in - reasonable ways as different from the original version; or - - d) Limiting the use for publicity purposes of names of licensors or - authors of the material; or - - e) Declining to grant rights under trademark law for use of some - trade names, trademarks, or service marks; or - - f) Requiring indemnification of licensors and authors of that - material by anyone who conveys the material (or modified versions of - it) with contractual assumptions of liability to the recipient, for - any liability that these contractual assumptions directly impose on - those licensors and authors. - - All other non-permissive additional terms are considered "further -restrictions" within the meaning of section 10. If the Program as you -received it, or any part of it, contains a notice stating that it is -governed by this License along with a term that is a further -restriction, you may remove that term. If a license document contains -a further restriction but permits relicensing or conveying under this -License, you may add to a covered work material governed by the terms -of that license document, provided that the further restriction does -not survive such relicensing or conveying. - - If you add terms to a covered work in accord with this section, you -must place, in the relevant source files, a statement of the -additional terms that apply to those files, or a notice indicating -where to find the applicable terms. - - Additional terms, permissive or non-permissive, may be stated in the -form of a separately written license, or stated as exceptions; -the above requirements apply either way. - - 8. Termination. - - You may not propagate or modify a covered work except as expressly -provided under this License. Any attempt otherwise to propagate or -modify it is void, and will automatically terminate your rights under -this License (including any patent licenses granted under the third -paragraph of section 11). - - However, if you cease all violation of this License, then your -license from a particular copyright holder is reinstated (a) -provisionally, unless and until the copyright holder explicitly and -finally terminates your license, and (b) permanently, if the copyright -holder fails to notify you of the violation by some reasonable means -prior to 60 days after the cessation. - - Moreover, your license from a particular copyright holder is -reinstated permanently if the copyright holder notifies you of the -violation by some reasonable means, this is the first time you have -received notice of violation of this License (for any work) from that -copyright holder, and you cure the violation prior to 30 days after -your receipt of the notice. - - Termination of your rights under this section does not terminate the -licenses of parties who have received copies or rights from you under -this License. If your rights have been terminated and not permanently -reinstated, you do not qualify to receive new licenses for the same -material under section 10. - - 9. Acceptance Not Required for Having Copies. - - You are not required to accept this License in order to receive or -run a copy of the Program. Ancillary propagation of a covered work -occurring solely as a consequence of using peer-to-peer transmission -to receive a copy likewise does not require acceptance. However, -nothing other than this License grants you permission to propagate or -modify any covered work. These actions infringe copyright if you do -not accept this License. Therefore, by modifying or propagating a -covered work, you indicate your acceptance of this License to do so. - - 10. Automatic Licensing of Downstream Recipients. - - Each time you convey a covered work, the recipient automatically -receives a license from the original licensors, to run, modify and -propagate that work, subject to this License. You are not responsible -for enforcing compliance by third parties with this License. - - An "entity transaction" is a transaction transferring control of an -organization, or substantially all assets of one, or subdividing an -organization, or merging organizations. If propagation of a covered -work results from an entity transaction, each party to that -transaction who receives a copy of the work also receives whatever -licenses to the work the party's predecessor in interest had or could -give under the previous paragraph, plus a right to possession of the -Corresponding Source of the work from the predecessor in interest, if -the predecessor has it or can get it with reasonable efforts. - - You may not impose any further restrictions on the exercise of the -rights granted or affirmed under this License. For example, you may -not impose a license fee, royalty, or other charge for exercise of -rights granted under this License, and you may not initiate litigation -(including a cross-claim or counterclaim in a lawsuit) alleging that -any patent claim is infringed by making, using, selling, offering for -sale, or importing the Program or any portion of it. - - 11. Patents. - - A "contributor" is a copyright holder who authorizes use under this -License of the Program or a work on which the Program is based. The -work thus licensed is called the contributor's "contributor version". - - A contributor's "essential patent claims" are all patent claims -owned or controlled by the contributor, whether already acquired or -hereafter acquired, that would be infringed by some manner, permitted -by this License, of making, using, or selling its contributor version, -but do not include claims that would be infringed only as a -consequence of further modification of the contributor version. For -purposes of this definition, "control" includes the right to grant -patent sublicenses in a manner consistent with the requirements of -this License. - - Each contributor grants you a non-exclusive, worldwide, royalty-free -patent license under the contributor's essential patent claims, to -make, use, sell, offer for sale, import and otherwise run, modify and -propagate the contents of its contributor version. - - In the following three paragraphs, a "patent license" is any express -agreement or commitment, however denominated, not to enforce a patent -(such as an express permission to practice a patent or covenant not to -sue for patent infringement). To "grant" such a patent license to a -party means to make such an agreement or commitment not to enforce a -patent against the party. - - If you convey a covered work, knowingly relying on a patent license, -and the Corresponding Source of the work is not available for anyone -to copy, free of charge and under the terms of this License, through a -publicly available network server or other readily accessible means, -then you must either (1) cause the Corresponding Source to be so -available, or (2) arrange to deprive yourself of the benefit of the -patent license for this particular work, or (3) arrange, in a manner -consistent with the requirements of this License, to extend the patent -license to downstream recipients. "Knowingly relying" means you have -actual knowledge that, but for the patent license, your conveying the -covered work in a country, or your recipient's use of the covered work -in a country, would infringe one or more identifiable patents in that -country that you have reason to believe are valid. - - If, pursuant to or in connection with a single transaction or -arrangement, you convey, or propagate by procuring conveyance of, a -covered work, and grant a patent license to some of the parties -receiving the covered work authorizing them to use, propagate, modify -or convey a specific copy of the covered work, then the patent license -you grant is automatically extended to all recipients of the covered -work and works based on it. - - A patent license is "discriminatory" if it does not include within -the scope of its coverage, prohibits the exercise of, or is -conditioned on the non-exercise of one or more of the rights that are -specifically granted under this License. You may not convey a covered -work if you are a party to an arrangement with a third party that is -in the business of distributing software, under which you make payment -to the third party based on the extent of your activity of conveying -the work, and under which the third party grants, to any of the -parties who would receive the covered work from you, a discriminatory -patent license (a) in connection with copies of the covered work -conveyed by you (or copies made from those copies), or (b) primarily -for and in connection with specific products or compilations that -contain the covered work, unless you entered into that arrangement, -or that patent license was granted, prior to 28 March 2007. - - Nothing in this License shall be construed as excluding or limiting -any implied license or other defenses to infringement that may -otherwise be available to you under applicable patent law. - - 12. No Surrender of Others' Freedom. - - If conditions are imposed on you (whether by court order, agreement or -otherwise) that contradict the conditions of this License, they do not -excuse you from the conditions of this License. If you cannot convey a -covered work so as to satisfy simultaneously your obligations under this -License and any other pertinent obligations, then as a consequence you may -not convey it at all. For example, if you agree to terms that obligate you -to collect a royalty for further conveying from those to whom you convey -the Program, the only way you could satisfy both those terms and this -License would be to refrain entirely from conveying the Program. - - 13. Use with the GNU Affero General Public License. - - Notwithstanding any other provision of this License, you have -permission to link or combine any covered work with a work licensed -under version 3 of the GNU Affero General Public License into a single -combined work, and to convey the resulting work. The terms of this -License will continue to apply to the part which is the covered work, -but the special requirements of the GNU Affero General Public License, -section 13, concerning interaction through a network will apply to the -combination as such. - - 14. Revised Versions of this License. - - The Free Software Foundation may publish revised and/or new versions of -the GNU General Public License from time to time. Such new versions will -be similar in spirit to the present version, but may differ in detail to -address new problems or concerns. - - Each version is given a distinguishing version number. If the -Program specifies that a certain numbered version of the GNU General -Public License "or any later version" applies to it, you have the -option of following the terms and conditions either of that numbered -version or of any later version published by the Free Software -Foundation. If the Program does not specify a version number of the -GNU General Public License, you may choose any version ever published -by the Free Software Foundation. - - If the Program specifies that a proxy can decide which future -versions of the GNU General Public License can be used, that proxy's -public statement of acceptance of a version permanently authorizes you -to choose that version for the Program. - - Later license versions may give you additional or different -permissions. However, no additional obligations are imposed on any -author or copyright holder as a result of your choosing to follow a -later version. - - 15. Disclaimer of Warranty. - - THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY -APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT -HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY -OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, -THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM -IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF -ALL NECESSARY SERVICING, REPAIR OR CORRECTION. - - 16. Limitation of Liability. - - IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING -WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS -THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY -GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE -USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF -DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD -PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), -EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF -SUCH DAMAGES. - - 17. Interpretation of Sections 15 and 16. - - If the disclaimer of warranty and limitation of liability provided -above cannot be given local legal effect according to their terms, -reviewing courts shall apply local law that most closely approximates -an absolute waiver of all civil liability in connection with the -Program, unless a warranty or assumption of liability accompanies a -copy of the Program in return for a fee. - - END OF TERMS AND CONDITIONS - - How to Apply These Terms to Your New Programs - - If you develop a new program, and you want it to be of the greatest -possible use to the public, the best way to achieve this is to make it -free software which everyone can redistribute and change under these terms. - - To do so, attach the following notices to the program. It is safest -to attach them to the start of each source file to most effectively -state the exclusion of warranty; and each file should have at least -the "copyright" line and a pointer to where the full notice is found. - - - Copyright (C) - - This program is free software: you can redistribute it and/or modify - it under the terms of the GNU General Public License as published by - the Free Software Foundation, either version 3 of the License, or - (at your option) any later version. - - This program is distributed in the hope that it will be useful, - but WITHOUT ANY WARRANTY; without even the implied warranty of - MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - GNU General Public License for more details. - - You should have received a copy of the GNU General Public License - along with this program. If not, see . - -Also add information on how to contact you by electronic and paper mail. - - If the program does terminal interaction, make it output a short -notice like this when it starts in an interactive mode: - - Copyright (C) - This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. - This is free software, and you are welcome to redistribute it - under certain conditions; type `show c' for details. - -The hypothetical commands `show w' and `show c' should show the appropriate -parts of the General Public License. Of course, your program's commands -might be different; for a GUI interface, you would use an "about box". - - You should also get your employer (if you work as a programmer) or school, -if any, to sign a "copyright disclaimer" for the program, if necessary. -For more information on this, and how to apply and follow the GNU GPL, see -. - - The GNU General Public License does not permit incorporating your program -into proprietary programs. If your program is a subroutine library, you -may consider it more useful to permit linking proprietary applications with -the library. If this is what you want to do, use the GNU Lesser General -Public License instead of this License. But first, please read -. diff --git a/docs/assets/benchmark/binary-trees.dat b/docs/assets/benchmark/binary-trees.dat deleted file mode 100644 index 5fbff080..00000000 --- a/docs/assets/benchmark/binary-trees.dat +++ /dev/null @@ -1,3 +0,0 @@ -gwion 0.19427 0.91 -wren 0.234493 0.25 -lua 0.3426 6.66 diff --git a/docs/assets/benchmark/binary-trees.png b/docs/assets/benchmark/binary-trees.png deleted file mode 100644 index 56d241a542e43e1bbf660e17453865792a9cde3e..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 11825 zcmc(F1z6PU*6)7^F;G;LMz#W?Fq9x2Vi3Xxq@+QKL0ah?EKm{Mf^=;~1*Aa+=|KfV z8l+>ChM{AK0p>0|=eytC=eX}V-+j(Gcb*+Q#6RBmUB6oEp|+;V{=IB_5d_(7yeY|O*mmIy-gOArb<7=-LX&LLDR@FM^6Z@S_v zwx+HwjW=^S&Jc4dvkfv5jTn&Qa35;&N)C1lPtEWkn<@sk+tTt@T|+~e2Qg}bAJLGa zVmUb6Tj-!Aw{Y+B>%H{!n?+c%q)F+PpdGPs3Wvjmu}i+~n4;asRJPP4i%Xg-Urj>S z=c7yCzo*%?OJS)&EG#SxSJ>%Pxkc(*A$DbSOfj2#f7ilpM4;;}0@q&$ur4ets7IkE zEe6$v%im!s+fSYxAPO;|4Mn|J@B;A0HnTmD;Mibi8UZek8|al%JnpMn;B}l@&KPH+(%)6fl*Z`lY_U zw6rv9z&{|M$c5nC*J3Bmf8^1}5C#Ur@g#Xaakj>w>OKa)?ag(#Fb^M}Me(iI<>di$ zgXNcBFNO+Nnw*@ZK44;DA*`ljV>4>$m**dy?lm`9C{(dA zmEktlAR4PdeL%_(S!Ihn3+ z*!b1jA_cBaujbn}vXNVH&I9&mVih(fxQRp0xK+Z#!<9E)IFPUT`TBnO@})D|j5suO zo%nnEBtJiYuqknDjERkHBc8B1wzE@>@scWf)FS&2;)9T+q$Fo&XIyo$+xX@1ukfi% zHOMH`64uhvim0;=NO<;aVJzOo*2d=S*|SDyCgNCmc{#3$EzGtv(}_?7>zf_v-FCLzqbvBWMhjGOjmwL{W`79kcCTFOpXI;L@*)ZKx04J66 zsf0r(I#Khgp`l&<*Y7!n3-j}a<-RK+T!9m_v*t!d(g`WZ8x)kbC0r0{0J}xBa2YIH zAM~3W9UU!)6GbYD3$bd9I~&5lwLO)Q<2+dAGtu&5Y;5eip5O4dlPR0y+?*rx z-#^wz3wKSrLn(B0boBJ}eC&6Hi-hyYZ!NcX`gPsyd4JQ&*tl0$OWuYe|7|;PF(TQ2 zp_)0IXVP6J%b@hy$KW?_P7*_2bLN=kS}OVa`ofkO8pc#sQsC^uAx_cHFxbCzDkxp^ z*y7ePq`e_sH+9)}3(n-RfaNQ#g@_n4ioOBufZd+_p7IZW@J~_=Cauc?YnEjYnoSk7M8BRHJvz4)@=(GJ3zxHO-k@I3M=z+a zH&q>-r;m({^&xf&w(2AJhD(T+8du=jHE-|tfZF*s^%a|o^&L=|CPkXzuPV1@T=LNr zV4XrwzwtybYol%W+R1D)nX=Ah6s5SmW|dB8OanXtuz9P;FD#q`%wbXC--DaFTDj4& zxxUob+biMRpJtH3j5eHalAV*9(-xKcsJPO}xG_^i$hN37&oZc-|FG{*2&C_`M$nDZ zyu3Db;k+cl41=uR_cv2k7X0SQ`GC9Xg@lA|-@e@}x1?cZmGa_H`O%_o+tPCDKfv z*qJlEeSHL<@x+{p4SOgizd2!)hc07g#>0o*WfE8N3^D@N zN2ATm%v=Z+PI-o~@-I_TvNA|>1Vu~}2XS~}V&d~>)xMyttgHe|^I%0lsfQ>x_l59R z!?jQQWN7HRY}I+_^eCKwhjDhP5~M89fTHzPNZxEgbk}**74$b#|cis*zE#=ZvvQXi?EB>;nA6 zQ7}6@`{vD?xa!(=D@O!2@sL@U`^VJZQ)58-06{h-%63(>*4EaN40E~&<$kLG z!20_7&z?O~T&rTpyuo(xpzGF#N1|pI1`oQXpr;>$2ShP{?^=aR>#(1(NR*eC_t{Fk z7mS@c%hs4_RFL_!udfd{DJ z+??RQ6joV@b#ckTFTUaBGeZ@BFP~^7 zu5?~{t`pi$lLngTHj`-5{ zT0Jy0)G5>gyH&Wt$;J*_YHDf2PUVGke1e!h#p$I_Z!1jjE*GgSbM9^sY{yR5C<0thB6E1MOHrH~0Tb0UOdw^|@D zocHp?6-<|;m=t%=zP)>!k`#cdQHv)=^m3Qvk z0SIc2mvkYMW;z*E`#O&)_NY#U^o zp02-j?i?P}_O0n|(Y}rto%H?!j20{=$Wtf;_`=9;!0j#9w-tVF2}U^7NH^_lu1x0 zV~24SJf{ua+?F&-<%dQ`k1{ewL`97a4;T2aFT(3aMMVjjzSnj)LxK*u*65R7UJ5;b z{=D+dea7LhK=+0O2k)YxNs#fd#~%PfeDUJNj=+_F89p*cNzc0BCd-D@JTPf#b1$Lg zJanja-0w`ZklEh7d)dwe@T%Rqd2`SH{fQ4;w)(K6H~Z=65WFac#`XO9J5`ox85spa zo}Qj?|C2mC^q4-s)meS0V#?Q-<$zdk-n@CO9{t253qhpri&05QOG|^F6BNvXC&T;gh_)g*e=fH|i{GmR~gu3=9Mk z!C)|IYHHW7zXW{=+nnfn1VJ8iV`y^Y<4u4dR8>{=^z_c1JLllwU}V%|N#N`)_w(}c zDPAEzc=+&Pr{XhGx7AaluG!wgjIuJ*oGypLUT`ZhF)>hOu_TA*NYD+-4S!D0i*MRj zgHVs_?~;wdG?Xts1oi9{73x%AJpHDTttG@ zlyWG8ciVJs7dGss5kby{tD2?`Gl@f#auAOoyU+c2ViY|RguqY#;WzQGc7KEYeE$51 zi;GL4F(((7g|4ocVKeN_CY}asVk-Oq~|7G=0GE4b0#B_fmJO zwDt9E#MuJ;{oQ2-K%DHF-mIeIVhOA9A_T00Q$Bk1=}Ozz=1DIoXz%Ls0*a$-9ODUH7Fx42MD1VbdVDGv_ytx?Z_*MOF2|Sva{m>3Y896}h>tQhg;QCE)aXpiZrC z!%yT;!tP|W|(mOOze@p_mxv_=0=8w)_=IaZ)tH60Asb+At&s5 zWq#rn#{&r75Z3jOetHQL~dkCpEKhe3~x^>Ii+8SsU3JLUquWyM? zdc)_>x!LkQi?7i2>+9>C)fm`X2JG4e2vC4)0Kp={!;MW$ECN>aZ;nzUB5Xs{-HnY| zu;DyBJP-@~^2_gqg@u`!4FIh8CO{-1;T@A_oFySDdb24(8no0?c~Z<@_S<%X;rxQS zA#(C~;GX(N79SuzW4!-wjLiN}GXJDu`hQ6A_-I|#)j^3p0@g6jdh+yXPI@|PCI*(! z)^=>DI#i#(;{t>H@=&NSuCTDD6DsU8VfEWx2AR>_2*RS(wENFX2$*~9!-o%$~pin#-dGXLjeb<9$Fvz@`J1lLR3=P)^Bf4jV-!O5HraAr$Ncek4A=51ymQ zv1hSSlJMB25Ln+ur-t#I8gj4& z|4e}rDBG($zUA}h&kYUJieKHD<)f362`w!xJv~OC9%EuAh{RI2aZNrBS_B#X%!-;G z8#6F9FD6l2P_NP>-zPfi%h!_{F>WQ zvmoogsaioHA@FW7F>Sy}r-rBvGdkilPLi1->RxG|0;0W}rK77`|K-admaG#)6GplNa(4&0U@Abd%87IYlIBsZMN(Q`;!%1)Z~2)N59Xi^%DOow8E1>fmoZ z`k=--_pkzELd2mVMOt~QUxP8d)@e#>V*8PM2Y14|Al3&0-(pq&O8_Ex`b$XjMIIq! zcdek^f1)4tk1OP#XI#7*s=uub9NW;$OqM~$@bIvMy*-D!(CO0&%Xn1Hgp-f~jc&*paty&#;9lC@9Dzg0y#__S{}>*J9w1ItX^@*)!4ZAV{2} z=H9(~r(yUVu=WW2sghC^be`PY+^DIkp&Q|L>sCo=Da7Bqrpp|A&Jd60!ue*jr$)~0 z{wX(}=bMH-sHv-xi9~$k1sr|*mq>xtnZ6>s))R%s z&;^*Xs(o@+QWCt-(_&==N%+#ShumUccrv1{qT2e*=_7l?l*MYE?Swyba~9Amc;sYb zgp-G+rBx;k_{5tvM_n&oyciHr9#9W14IH?foLoZgYL(&iZZt?dF=_6fD#~f@uCHIk z&z==DD{-H`fI_}$fN~ib8387Ol?@IKhD2?7+5NT74RT^w1fSNI{DkCW#e^40ezV1! zo15?pK!>o$pFUl*uplJLdTCm(|79P4>fU03)q)b|2$e2dVQLPUyJ%_a^2?kDWQe^0 zmyyxY#1-ExgZQ{OHbzEWBcr;UD-e`(_}ErZ^VbhCY<@kRM@~kAJ21O#*FeL5k~*U5 z@|uRLrt*B(Z~xz^Fhx~hxpob@a_$zY1R;Qh~Z9#EL$^|_& zs7&#Nzvw(b@3@;lAFn#>e?1uy5L#!gbLt563(v0#{7`43I(qkEaG+~v7T|hpO8^RK z30V{Pd&{IT0Y2%Zy9)SsaCATMNlK3TaNAQ0D0o2*R@T_4s7{blot;rhN!fb*PL%~W z|0|=YX4(Us21E*-&g$yw>i6G&F^cNS zG8yj=hh-92;Q9cqEINplA-BRFc+an(Ft{zhlUfhv(;^zwLpd-(5Oe!qJ~!~M#OXgj zj{nEdgR2hm_ZfDp2Y~sr$~lMx64n-BJurW6dz1%?OGR(WCc4X@`WEFhg_CJVzLf=J3NH$eU9D;K1hKn*-FLU)X9l4NY=0Orqxa z*q8)%dlSmVf2mQDQBMNwC>RaMbU~!uAiVtFC@m`x`2})Oh?d?J6^)OM>g(xUR8d)y z5J4=z+*C&58^?~D1o!xieu;z-)8w7qGvh3C!09}z+PL_5aOAal#sJg!pTTq!L|vrS zRmg`qF6rl^`;M8Qqpmzg5PX{S@Ls7CCtg-m3|5RnBo2b`*s)_)({fBqvcs}x5aa^9 zGanBR3wa|8d9NQGF^yfOdTAwOc$q4%mQ z=dc;o$$clOVNo^3;7UJ5-Dh#We|Ne=(!wExNKa?RLr3#76M~$SzS>IrIL093Y^(-J z@MMJA3vD~`xIyz9QU2VDYU%uA#%#gNOt$~%_Ufb`^Zs@l zyB31Ab9Cfz{SEqRU-HXr>Y2zj@M&mhfOITF?`_C2--&8w3-CY00yQoOS6FA1hAH%v zX;}p&=-7lD;55cL#u{fOfgCLHAVSVvfU0GkpJwQ(s`|>doh_>TF=x9kxRC;FcdBhsOgG<^q|@;#|QAH^7b$3~WIr#MQpgAYzKrQvTaUnaV09JTfv8 z=Fwonpz{)dC3MI@jrXkf6uV)d!Pt!5UfPcTo75~1yOW{AuT_8ggf@Nedc@;{?L`cB zjZZb4=jzp~_s@&M$=QU1k)+=${AO3KzzETq*i7asme9O} z06M<3ygX5P`GMM6Odrk(S9831`@tKP{pZ1&$y@2?4W=Fv>OF z#2H!*X*U%WRT6gFhuB-?eBKxi z&(tD8?g^t9ot+9JJzo7)3qQ6h`btC8m1eql6vh~MJR`%w&dv^`mx@Zr%IGNp0SAo` z$$^`+a;&jG`1l4OD?lu(6g(r|lE`e1n!r{h7 zM_OJ<}yElP=IFE_}pBj z`(#^MTH4pIdRYdt4xO1WF*QCiVr^psBVPNZH6f6Lt`2H?y(t~GfS|@DlPmSGev=sX_qvLY8 zb!iz+!P&)y0u4|VZw;}B6Y8$?5XFk}@O-MU`53$(_VP&)+dPvy7LNR$J$sl!M`42F zZsVh!xi*)4NEy|_2Lo0Is%re9Ckz`MEX7aXe5z^tH@?p>H**$>H|ko#)^{xi_P!rm zn9^Eq&`pn3FqDqD0b`PpJayX2K7$sj+r6yAm1+$jWAFVT zn1`Xx=A1Xfu zz*F#6Y|92JyOTJRe+Od>{u;WtgD^A#FT*b32!jtW{=kyEq)Oer@RhAKThyLAZifIq z`kaO~FsLsJ|Ak8s4)nQH!o+7FxsULq{kEnS%{-3>4ATA@FL6UW4jNju)zv#4SA!KF zofQ&^RO#>zW?=eyr>Cb|TC`!T2IhTgn?tsRtAL@m=%Axq8juWVbyUFMar3p0kf@F9 zFx0NQ*8m4#pTXUMrHPkt$~WU*k!(XeRdXX=! diff --git a/docs/assets/benchmark/fib-recurs.dat b/docs/assets/benchmark/fib-recurs.dat deleted file mode 100644 index 772f9241..00000000 --- a/docs/assets/benchmark/fib-recurs.dat +++ /dev/null @@ -1,4 +0,0 @@ -gwion 5.5088 0.55 -wren 13.830 0.81 -lua 7.4549 0.33 - diff --git a/docs/assets/benchmark/fib-recurs.png b/docs/assets/benchmark/fib-recurs.png deleted file mode 100644 index 3c05462133f741345ef99bbb7ca4c2cbb3f9385a..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 9342 zcmdUVc{o*l-|yO#p+en~lA%&jNEypm36(oSGEXJ*lzFC$+N9SbMGY`>oIS`x(9h?kdXD?PJ-8APC*9 zn>SPtgu(|wP(w5n@Dp6FLN5GAYkO1E9zp28kpH1x^UxnhkQ2zQ8`ti+#Le`3-c@tl zsa&w14?MAWFgfFvzg%jG>HDzTfy_5fM$H>)cOAIZ_~M)phriViQt-oP;`FKoBH_jF zjccMsoNBes$b|~GrJiQ|aUzH3k9`zRlemYl^ z-jiL}#F7$s7nk(_MlN3Bcw;Q{(W9m%CO2<>`~F5y`%3Hc{mcoTt36LBsc|^mOE&S< zkr3(flwI+wqOhD9%fWIZwG zVP)W7F`!~idq&!9fP*y<>i&)F1O}HhlUP~jO5ynD>m%x zuGdP_vx!ASN3Tz&C7uubgM(vkW~R)fnZ2R24i=RlQB0!Dl~k6Ik#TZb?Zjwvc+6ju zRc7~GZVi#zoOoGopA`FZ-_dM-dV2cy_jhtHD8`ClQd7T}3Kisd!?MPl;FHG2#zsb| zR+tqxPgp=Qx2Vm4gx%=3OwC*`?3fk(cQ;s_+v@b>+}v)n_s$aRa8_1Uc`zkKKP!rA zIw&?)yE#D;69fxZKm4w!XnlQQB%O{(&(6+X=C+d4mz9~BiNy|P8~V;95IZp$nVI(v zze`U~|Mcl`CA=fnfI6cb-8{*#=T!#tYil6^0Sn8^tkPZ*%_vH?>prM0yOpU9KR+ts z15M30$=m}20}pFo3gfe9hbAUW%VvK5eA_+=3pd%pXct;*7V6;~K7L)o6&H7OcJ^kO z<)qC7@UnZY|7@1p%1lo`FD%@F$GbPhUD@4e_O@QaQ{gx$4s&0zVF!p+UiBTP)XB~Fbw>+MR?@#4-|l3b2X zP6+~!>Icf)JuAy=m$c?Q+qWUTyCgm1-6?YA zN^w%s2{EzF>7HCiN5_qg4VwzmYW-^-jCN2^kV$hwd}5-$s%m&b!p`UY{2C&S@#2NB zX&vcm9UUFT#l_gN)!q-vDO$g(;Js2}LPCO`va+(O>e7JwTt`(?`9&#q3kr@dyBoUfz| zV&+#=RAd*ij4mu(gPN4u7!3~%4aJknpIFQ1dkWAZh^a4+0fOu~_}_Y%NTs$Fzo+(^ zodOxsGZu-RTRn#}@?pBO(*+#CWp!c6g@y%4W6#ll=TOw(J`yadqpSN)9#zTyc-Nqr z<|42Ujcrt++saf-49lc4f{6Jc`|%~tbMrr|75VhQ&qmyuZW^iL_L;sCt2qFJ8(Mmytnybw=T^Y+Yj` ze7otn);~Tyz5Rtz$zx+Is*_WY2Nwb@YcCa5Zx$^r?VBt1@5ffR<|?pIrsJ8P|fk;QQ_hCq|Fs50Q}&o@VY$9o*X8g`_NVSb#V@p zZSQJdvXyKNa?jpF6MXB80-+#6La>>ceR*c>YlGe#hY$Y%+K7vbd-dv-zrTNWb~YoI zq6R}#rcW|=v-EChkEKX#k8I5)Wm>b3e0X(jh-T-#FJ5dIf+#*YftCe@?fjg^aBhJsy#J z$!aEP;Ogo+H&8Y*Jj@%ku&@xA%zD|j5?9^wR)(2h&!ezh(jncciMm0l$Kawyh3(Xj zkKWrO9LJ9z$5=e|^)>k(ZCE0mJFNG}efJ<68>#zYNRM>~ai#N3%Z+Q-o+NYk^z=A; z`a9ixXVW04tjfg6CaqGPIT#edoB?g=gPNWT>jr`4IL_w&h=h;25Tfl2x__rt>0gN|Pp)p!=t%Yt05V z#fx)EX1TvnbVK^pWo5qtH*T)Y*_5<3G&H!03kfaP1Rsa%G}hG}yJ9!Wu`^GtaL3cb z)0X=xk>CvM{ zo}MH>y5l02-3IPL)ac#aTG8BOyuh13JMpmfP+0@T_9l1lhL)6U@mFjQ&&>39cXMAZ zb!S(vd;n`Fj*i~Df8V$yr?j-s&Hao2Aw4}kfG8QI#MqXWyA8=HDG!&pd?Y0#U>__) zlDKaJ*;xIsnsaK+&-0eLEGDL911e;~0q02U6n33%SS^+`mKFU;Al%p1wkRRAy;JBU z7dW{)CU`8~a&~r>RSpac%wyMItL9Hgt>y5R;Nxq=tuHl8YbQ8=0-%|hnQ3Zjc8d4K z#j*NUU9|4IY+^EgR-V|A(FF{6e%0jVdM5~) zyi`n6xOuZ>$o&bGm>37|tMKss`}V=60r6|At4Ad!?yll(usX#mDc7p4zyH@fm8s2n z>XeAhz&0?fy1IJB)@;d{GiRR4%$%jkP6d7dr4 zzDIFd+W3oOg3vwq_`T!`1x#C#;2xCJ^aqY!JaOSd(;|f#u@lOKdhg!JmCd&@Xu{Z- zRbP>^?T7wn=B{OqT(^~!24R28J-4#-%FKmWyyphI3E$sP`5NwQZ{Q1U<|fYF%U?oU zF=XkM5JpBAk00NvIc{?^WG{l_w>sZmr(OwtOyTzJef0F!q`@xtwOL8KQU4hQSzOxG z)D-Nkl&EN7R@N*ifY#PlQR_a9BHOpiMF`@o%SG+7y}mFxIl2D`udTiPR+;Dd^XH-2 zLc^oU22E^hJOBCl{<6~2r%#_+_Z5YOg)I#EGTaW?kJxt6N>GId}C~v9a z-;O7^&&Jx67dy@LzUEP{R-xH+=Ek)31w1volB<)MFObr#v7*V8~Rx0ohAm;dO)_EWs2i&godn^{4 z%nb`q^jy^(PoSCjgPtRjy$U;Ra{A=SHcn((hKsrgurcGUQtF8iHWvlzU!fr zaDYn2&dv^+(e2x}<>ch<-o2}{? zm6erHIn0L-do0#*#fwt`91;~9!ZCVfy-trOTHXdG9}Sk{t3?nW$xx3&_sz}I7cKly z$i)3G6gtYvpNtz>I5-kDbB%8W!;Q|xNbRxeXlc3VzB;|QxR{qGWMX0xb_opn&9jwD zuEQe_37sndF&JDPZ$D1U$5(*fuJD?EVn9gPt zR=>gvxH}*q07xOHCXEUKtg#Hu;0v)@`RApi%Imhm5M;voN0TS-8h8jX-F9?7@TK(D zw4kiA+>4`OQBhq+7CJh8;0nbYj;PIy8d5sf{j6@|%$EKIvEJl6kHj{v46#ePVQ)GRx&Nk;{I_K1-+OXA#}JV5-u*|4N=h=)-JsW<)#lePm#`Tqg;oeo z+YgOS1X9(97Q<9op{fkJ9qi=W!Tk?PS778Rnv|fIYJm61r+e}^Oxy)FARTe zVuQSc3_=O7ZI=e7Y_N_?82B6**}eiR{7{we*6K{jqlQRuS>U~YpRUwC?z1*GI5$2n z>alLykQ@}GU~2lI%Am#W0D^Q=-l6m$d_M-N2rpdiM<>V<3|2~u9`5rvhN>thC#O!P z9R%sw@Q>-~w;K!rQHt$I?4R#NK=ik;P2@?u0gmX%P`B#RDRb)prme0{NkOZqb-3Xz zMVvnm!C9g2)hkgb)ZV>&3oO7%QtRvM1699dueVHDqM|{3#K@7;rlppp}Sp2a<*^_BtYhJFpEDAb26tjEy(3RD+n$xMLtBY+@qNM$Q@2$ z8HU|_Sw68N`;M;84U|$`;O2(Bq)?af;K93~XLWV^-;P9EIZPoaq~&QRY8BAJ&7G|q z9u+lCAP|5d761?jQyqPxF6e4$XcQUMy@EyYsArX~bZT#{&FMpO@_Pq6Z7NAb{oNS& z0!0Rw*Vl*YD+FB#ibZdPTtpcP<%#IRlW#MIWHlNWPVshExG%|S!1kZ4L=gXf$ufuL z5Q?j7D|m)gH5c!INHEC$hrCm?Z0X`{BO@afl~;dZ0kyikeDCn1&(CN(g&EKO`5`lN8@!3Q18avI z7sDaMr$mW}Q196zr1?*#%)#+*(r#LxzczF2u zpCyReB&?Fl{BG3t&2v(;`*rsw+W&}?^k@nr8TbjAFbIwgY@gOh)+M z8r1(Amk&KK4*?9s?b!xThCmJ+Jb7fO%zcghirtsiR%LSpF7=AmR#sM4M@L6RB)2~po5p!P9&eU({%UG*;z02KX`NSXDje#H1MXHn%dd$b7#-W zk<_fLW*`i_r$&O6$25{4|3xIc!9w%F*crsM4>J9R^h_fUqZa;I0$jAP}+YH;;S#O z{u1Jq_Lamg>|oJjuo}Y+{1us`9u$&ItwrquVlU%9CNLz#X3^_3WUx#a%56fd&H2Dr zadDZw8aYM*fAyed6i}GChaBMW;Qw4{O@S)+*jOxeT_Pt^Q&TML>|UG8W;5hh&WoY! z1NY-N_2cvB&kzWuv`&nTLC(XkSNh?%IB@iV8dZdO4+sn>*tHqFGl)ePNmIICw=(_B4RKz%RRviS65dnB}!S9tbj0usoU)DsU*}L3`l;Au3OC_ zhyDs`oSoIxRzTzz#6qT-`LlpnuKocDuoobpQA209sx;m(35PNQAJHuat zA~7&Z2=VuyUs-8vXnyQhXE!@TI`r{?;5g8AtNRgIRbAx5j^ydNvta|hAmyfQ^%4j88 zS}7vN-{J*iv?B+P;0Mw80asA8fyr@K>}zt!LYqJ+c<^;!!*C!I52UDB`W4pw-rd=T z@aXv$3W_O>$jO@W;gr_ydZ|e1vjvdyA1QR2knh{Ri&47R9RS^hCs0L0qkFj1Y2atx z<(}R+e+b#$)F$k0*wK2lC=zj9fKv@zu%hR0*(kS&vq zldH4+C9g4!>IF-`F6s+j)pKhVHb5E%;PGDbB3y{zDE%RWV{T>T;H@AE)X6po;Xb$x zna^qR-vU%YRAA>Wo(PK?92|6N29 zP=o&BMmB?Suy@%m3lG390COI3Hr)*=`bvJw1`MEKz+v(+S79bv*j}o|GWr~|L(^n; zva+#tWom}Q$XHXe*nYeT2BnWjYDfd^m6$mlP0dLH!MLOXlCU}>u!bs!AAJiwN#%P| zSlAKfrciQ_Yv2p4Vuj3JIgZ22?vJ_rI5|CCN=gb%&(>RLGYEECyALBNJ$#?OV{?zM zWOu%WIt(lly*4KY@o#0EFW1>w0% zn)CkW+ZO?r)84(4BrUhY0HLB#2|a5YV`@)vQD!z`IlSfK*7`b3+52mnc6N5iqw4<6 zUJICBo;=*TY}|*G-@g?MPrY6c!PI$@o2NS7A}UjPx)8ZSMK>THGT) zRxyVUGWs3EY>GkQm`2*l1I02rC}+d}&A^+;D(~C3FGfQ0KmC)Hrlmb~cLiiQ>swpL zgKPc?o&NZIi>Q#0=Fz(FxwZxTFJRvAc}^a!!N7Z=mZKs#J|#JM-~Rp3hAcEooo2Kk zNdt5|YOSqJtDBR9ZWJ3E3$d-Zvk$4nb;%ftIJ{oV@gMO2R^QxA&d`A)#g^6BaMfmi z?aUdM!d%nVWEeOD410Tfp)5DHw%py_qh7z(B*&WP19L38vR0>c^!24-Y7YQ{6Cpzb zK)JcPGBGo27tHqL$}2~JiB*WY0DqlOzCnl$Oos7(jo2%|P392}CLPct;8kFn01g+1 zF~SdP4sda$WoGg=be>>j6+2L<GN#`o86ffPk*)l+~7SL7VzF7)nJFs zPf1CEx$kfDlc^oMy_i>?+hbYoFsb6;kcURg0|e6)<9kPERzH6H2!RXigtfIbSlt1f zqeXaCUNL1}7gW$TM?FNlkr=q}r%#_?*^YL0i%UyEFJBgT9e7&Yvwf*>lhc}X_Xso( zn#Gls_=|?umsZ$t3}&7=Z}6AMz`iaV+vxlg2SeRFzw!Sk)^WZ9YuuK7)uA8*WGHe= MR`EvGb%Uq>0d*i_NdN!< diff --git a/docs/assets/benchmark/fib.dat b/docs/assets/benchmark/fib.dat deleted file mode 100644 index 29fb524b..00000000 --- a/docs/assets/benchmark/fib.dat +++ /dev/null @@ -1,3 +0,0 @@ -gwion 0.08750 1.21 -wren 0.22008 1.21 -lua 0.22026 0.70 diff --git a/docs/assets/benchmark/fib.png b/docs/assets/benchmark/fib.png deleted file mode 100644 index c9c3ad06651f5a2e427df8db0a8fe99260bc8d0e..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 8445 zcmdT~2{hDu-~SI4g|vwXB~n-R5E^uoluD&2%S=&ZU$dK0N>Os9l08dFWU}u@WJ~sC zvQGA~?~Gw)-miP#`<`dH_j#Uk-sha>ednAwX8ZsC-{1H9*?t9Fyl|Rp3;z}bLAcIn zYhFeW7GDHG{a|N-X9_ZPGU3-|2kq<52(tCd`ajf5iLC+%vJW|a4RVd)Vu3q1Azn+bsFx1g=#E`t35)-k9n)D;K@>cIn0ssV#4}*o~=_xvB)J416-# zZIQdR>vF9|<)~{EXG`4c!}|x!+iJ32=-Xvn=L$sCyxs3~>3+?0a3-3#>(Kt(`MRM+ z+W7GXkNSDUvFp%MBYj2OuwrVT5J3cl(PWouHJQ%9WsKT$Ej%Ry#Q_J^Wbxo+auqP#s zfLly4t9s@$7;^fRq|uU}@Y;|026b*UFXwF*PR-}fpHJnF#8CUu%iVfdEY`q)*G`0w zwt??)Vp38tpR7p9F}vg zjwgSx?tM?88`-f+FgZCHcD#7HWVP34xrcfc8h5!eSeV?}x=_l>o%r^xPag-?ee`YE z4mX2*6$55#RZL^BI)hrWI;EqdvkDi7tM+<~M6XU2P8W=)37|a}42ZNgCXK)hobK2x zBPwZ9;4=IzJeu?^T6Oszo6utuMvX3RM-VKNqChg1w`@)%(z}TCnR4!vPnExHp81h! z(GYX$$!TfGnu}6) zmg?-A>M4Z#m@=}Il4?_(kD7H3B^mD#a_$pBoZ0wzq9s7#L_8CND3)zM{dw!ImUlHy4*9hFN#oQ?I9|v=gxS$!t=kR6~SSEbaSFLkvcU*tfPaPh1<4 z#^yQfFM0Rr(+p#Edb+51=M8qs8Ua`HTr9WO(|W}ENnl{VF74E_y~;ZRG_9R8&d$m@4n3Km734V(q$Coe zef8>9N5|PyUaRm1_^RDf#(db&moF6nyFPsQK#hQVT$vxK;!Qdie%Zi)RJ9z4DWoN- z9X@;*w*^1~J}zmTHxpr<7GQtz%9Sf7CW2TO7EYyDpQR2C>7p4Do=&o~v~0R_bctse zHkSiUx){3G6DdeaP9AO1RTosUGah-_(a|wmTTxLFi=&MKEa$sT_l~wCG25{8tEuml zm6gRWL>>C+r-D0=V9F*ZCwV6wy7L_I)NnvN8UiP4$NXjPQI-_p_&bqMyt0PAyiy!|6|t&png#A#ulqkwaO z=^OUiYtLZSAGSnR=`+Qf{l&MQ*4Z)t)Z){>+N436Q^_?9UX0C#l(i1xqap3 zruXj%h&t|(;oPc8Yi@4tdZu}h5SkWW9JE(?E~m?Gbx0b&2RmP-&X}!JA|E+&WTHX! z1Q8}iSRU#VA0IzA=R`J@PaPZ{#?5?YgZ&PW1oUCpkGQ>Vh(W7bwZ5nJrw~daC@cPK zC?Rj$jGr*TwmLM*`Sa&tUhOO`Mxc$@gQq{jQy*>MI?w)uSGvTZuMGOdXRI~Z4PYxdDJDYJOlz%k9XW==unhV%9uKbx z(A3-Dl5!g=rGB49`{6f0h8AEQKEcCZdefnWnryNwC(- z9RU^$dE9?63Mv0Ie2V*lNU2QfVW|iGk)J?g{u4(1=bZZ&@8H{pvb%HVT7iot5R0K< z=lzWwTlXHD3CjW9#tl+M)wVOMwY62+XH*CH&s|SXPvrDQU$yOOrM9-VfDnX_AAwTs zO-xK+v@cz10)Zx7ID3*CeFcLlxmoTHNd4;N%d7hO^)cwx?tJIXF?$ft!`{BNU%xI* zcIDo#eRU@EARvNmZ_x_Cw}7He-b5wvjluczb+DGpdU`NgD|5Bd!pcsAyhQ4$`xcvg zFDx##M1Tg4^2@MHp>h0}qZgv_HP*hL= z4JIWnKJuAOc%lJ?dNVBs+NT*_ABxZc{Pux%25d`x|DF%+>B4-v389O5`vSii85yY( zENyMi!x&Uo=aqc~VX1%hYPM}xj_Pz#rbQL#fZ1BmZ0N4d$ig{l?i-FRTY!<8J?i?( zA2~Za6J`or>mn4OGLee5wD#PRwt)dxm*#> z`0$EO7jdSHLjX8|h@+F4bh5aW7D6%WV=Z!@?FU96Tubk#G$jE3NEoD@J9Fl+q-2oE zDs7x_I-v>nqG~su))K2mUub#z_AQi#OGyq{(5E7xabW^Qq^0dEpY8!V2?`1V-r9Na z9PE_(S|9g;kZOM}f%s@|AjtC*)kvdJQ{T$wJ4aQ{O&?=zj6uhV^T`a?bD>Y%x#0i$ zhsDpP{M#8kG6?6%e~%sc1A+R#_c;HtFBLsh%EiT{6DC#n_3K$39ivY-KHp5cPP1^QE!N%BBju1t1yrmw`&v6gl1%9 zDBAaWGuBqP1Qd;32fFNu=%p>k&}cL&6Q!{&fPLnfpem5&y9?3$M(56-mz0u{l9tvj zjYHkIaaPlpTj==f*jTbh-HXF|V`F20zNAdS-8?)&e6pr%)Y;lFX(r$`%~T7~ey_P9 zFF$`JemN8*KxbE%k)dHhVakgaFMw*U8W_M(+V>P>7ZiAcK2+PZ=|lq){@!eWUTkiw#es6t3^ddszRwZ?4?VOQbd37 zA)LAa?0-0Vqx2Z=y~iBD0e0CHeq1hO@zsPn@JeHj`_LA^uAW+f+E4t;$I%5RpO zIr~3DhpkH!@)!((@e>9M@hw~)FFOnSd~549M(gHoeicxtGT8RxB>2B-4Ycp0mZLt)W9cC0FJ@{ePHkP^agS- zvB*#~AB~8=X`;v!4{&ODEj@_2QTkd{X<}Bk zkBqos(c zhN!%JCJ^0xM0h@g5r=+Ij)Wh z(t0#1Xn}NQiZ5(nt?bT^6KAih*|u}-oc6f`a2K0=Z)*Rp?*2hw@fYGrdn+12X(r%v zC=Hhp(HMkn=S)M)6@73Y+K#hK6ZTcMYxkKQJAL;RZRA2w?i-Kq<>6&^Jp4X>1KDxL z_tAlhjqLSCjsMng?ms@Z8uwYc8yi2lj5epHreqFw{3NfS{tbsubZ=0b=-dY|@+tRDqc~EMkjSh9g@bSE-9! z?zASfkx2I4dFk9q8+|uuUnrH8`&*4j8LDh~cRuo%qbcY!?stK|>%;G?$ig)d42pNx zuD!}miSrTVkGMyMho1?d3&I4JwN8us6j~sZ%OWhsmoHy7GV%hS^SwV@-r^?-2^c$1 z;w;DqU~AVd+uX&f??@va>QwQBS2tG8ry`IC(llEuD?`Xq&YnFBNy9`Z35!Sb2icKJ z=vIn2NJMk&$vBW3@)q?Iy~V4bgMpX?3<#KLUoRBmb7(tCNY+#nga!uF`*e@Ilamv_ zfI!NJ4+qb^ZuAR^^&Cr9>UB@Z%R447@7$4b`{Bcfz`HmBF~skJi#v{mKggdr02G8~ zXvn(RQ8xeVeDI6%o+wV)&kYa094*71gxvjKo5g=MZ~Tk#{eS!sz88OF+qQX%Ae5NT zynjwOaU(3gc6{FdfME777$c2be$u57>QvX(MylMkvXNC#$j-~lD=IoZamDYF<7{{1 z0hx=(_B?i$6aDss<8Pf6L=Zm*Z9sYys4U&x-BB?yy&mWPiem~lVSf{GtO%>I69rWu z`FA8^H!02^v@~k$ciAzW?H+UB*1r0hU-)2E8#iuTPp(u5%HC85JG&|HGX$JC7%3mH z^e*K;yf_MgrgCzY8sko;S3uWZ(bs?V;>CmLEl7cw3I)TFlbzk;IsVbC@~OvSo56a{ zStaC^8Xs>;F7W|R!;a=hj6Z%}-s1k{@pc{_9uE%>dGl}8H8qxC^FDmIj72tu!K-|T zzwd9q{=|*D`&#|It!^9$TAt{b&nEaxf&dhT3WMMSo);pHttZ47QwWS_xj?`BG-bma z`UH<8TBI>fF#g1fw_L?|DX@*rhHGK>>=Qp3rWC9x0vR-6s%X9*kXPEfkAq1KW>Ra! zV;3q|WwKmkW}?*bIB;>9=5-%ZQmk!kjEmeI!MOYQ_;4$NtjN{7d|5yB8U%R(fOsRZ zc(ok?Ha!K48HKb(0$wmcvxG^X#%7r_8T8`V(3sJ7KjSM`79c9~0N)KPo|c?^_|T#1 zh6Z)WQre8WhVId3&LvoEs;_YviiD)MXl&)l$?T^MbFcj+FV)r3{`2Z*m{gUs^Ra<{)iL?B(50;$0%kr3bwYJ>z^o{@92 ze2?cZBnXcoGp3q?_ZiuOS?QGGZhd6IkCu11;4eWgN=vhAeSfJd$98;(E;v`T5xs5l zk5rS8O%yy{xXfloMR|u4@86y3&L?5KK0=zj9tz>VooR3xKY=N91=zImc7y|-5beaY zv?;5!$vF+5yYHIJSVwN<&DG`FbjU#l2zmY@HD>EhmgCz5kGspLs}tuV4(q*ZZEJ%_ zDy>jJokmFjqn4uokwzT|){RzKEaQ;&2K}$Awles3^)RS9Tic*w_7ZK#RvvFZ0B00L z@0B??QG0Izw_WV5^MMd7QmrC6ZC$+RHX^Z17zlq;psIFuy>M!E_wHiq^-SPvPZ@D^%K%$G*qxq&yAT&Z5c}h|Rv0^% zQ1x3YkVqsVeW?rf{A&ZAF%KaT91$i!e(T0qiDj;gO^?d#FJ-;-JEMX`9#1QrDqu2J z$H&JbBO_t2iMMK=$I>S(czY7#;^N}t``6b6rzIncZrzSmnGI@Q^L0u|Z{OBMDotmT zFewBAInU9IdpOa;b7>!V<^PUuy5V$i9YcoK+eO@hzgQO9Maq8tK;wL*VjY~YfT>$Q z`6+wIVMY!+Z2>!Z`|nI;PY@iNOp_hTxtL4#Ohu3ruwFaJZy=M@g`oG8>R}0qLdakt z7;_o=3_Pz0GX|-z5cJc+#0gA}&GoBS+aw4@P93B-VZ}MMtcx|_TK1e#p>eg5r$s{6 z&r(PL7D-^1A;g}hUDzrPE8+QTQGlTlNm5E`5Ky0r9on^P*HJ~q7?ryp=D)($4Gj)@ zPg-NgiOQqlLdUDE+f!jlU0Iebxh0DqQ;2_kMXbxd=^zsf#lC!4PHI&iNiiTyeXevK z{#H|4J6_}i>fO`R^H;h5Oj88 z5Z!Sd&T<2Gikqr$#amjhpLJBnGO706<=pB;aDQNJ;5>jyBN6Kx8e)$*_CsV$7;an$ zu#4t|v$OzB5lFSddfHyXoODdk!?mQjqC)$=Dos-;hoq$7Gt4@B9O$(S%a(V*Ab937 ze!8zms9=M;uL|tdb1@w`IXQq%c~GqN#4Q8ycyoi^V>v!IZ{7p|_4K4cm_Iil%%sMf zMK|?wAqbMN{(k}BAf-NBek8-JwY@#fINu2X14d`3_yuoj-y>;SwyJ^JQJ?-XU4I=i z?a8TGtF+>|duir=QVmBv?R}#-O?r#6v+u(3*ZM$$L_2Zf9@g*f^(Huc(-A%m25RNt jk$>%+^$&E9FO$viNX1sxA-1cqT;$BD3z}&^-?;x@iONs~ diff --git a/docs/assets/benchmark/for.dat b/docs/assets/benchmark/for.dat deleted file mode 100644 index d4c00eac..00000000 --- a/docs/assets/benchmark/for.dat +++ /dev/null @@ -1,3 +0,0 @@ -gwion 0.037861 1.04 -wren 0.085946 0.68 -lua 0.055855 0.75 diff --git a/docs/assets/benchmark/for.png b/docs/assets/benchmark/for.png deleted file mode 100644 index 88f4190599dd9f157d6aa39570227beefa8a22c8..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 11923 zcmdUV2{_b!`|l4)Wi44ERJ2-CA!|h>TO|9IJ!D_9&S)dT6In{Ogh~k6mr;x*Ns=vQ z#*!_|*vC3^ZavR=uIs$jd;aJBzwf!und_>UX8HZT-|zjoKg)gZlBNpd4z3*tf-tIH zP|`sVYBYjS^>3qwXUYrJ3gMsat``hF5QM32^AA<5AQLx&>_b$Q&g$NHGKE9wUiL|* z%=+^yvCte>&0(k4E@b$i6W6Zi$WxbK^g1^}LDMJ12CLm`)1B+}rdi5#VrjvkD|t$c zCri3$*mKXszFsSm)LzXf1*xzv1)bu;wMQ`4g{Pj=#{OZsTRXLh6!l>wF)fyFe;MB& zqeFRpTKFJpNQLpjhP|q+o>4(hH}lSR{K0!hlhu8TkiInziC)zCp*;>CdM=x9F#rlw5^fSk<+&v6i2~Ul3^eROy zWDlT&-K+=e?s<%U+!#xb3g9Cc9V9*^WY^+40y)U!*64{k+F(J%+xw*L#ToEr`yl^O5g%zEhoqf7SUC+}qG#ffi zg}}A&TOi1meP}9#1&wS)&LGsBP!HSw^G~A1+89IkHy4btBS?CD!_f9c)BEj6-0qbj zYNY;v4b$fv+qwRgD`|LvS}Q@d+n;<|fu!zDUQB2FQ5HLBUH$$2H8ms6^1AF#K6>6caF1&)8;))GTKxA*7`xTWjlX zr{c$txhinZVw@jrJ&cWw5o}7pT+<*nJSHY)%G+NZ4z!;0<>Mz6QDari zV;$N0@uKFrZT4n22542IKPJhP1gy**y_~6}tW55wQ&|2MqZQz2OWhaa?(RPF;n9#n zfqmQ4SV4V1QAz`9Jw&LvKu9Y=Y`?rbSw&%WXNYuKsuB|a@Zp!vPIfjnY(vAu;_AD1 z?~;>~Z{EC#gq64u#dX3(F-oskSAKq_1Hp^IB zyKQNzS4KvrN?&fSk>4n%`03Mk6$ViG*FFnSu&-age)Hx{kf5yFU|sYh|%zDt{6mWw~KxepD-2wk$IXCYs{OXvi zv5sx6q5!;GSh%HRc{twurS3}r244=S?jENlv(9l((duPOD9x5cNjY9EJ-yCK-}y@Y zsqTEMxo=JQW~g8_Rn^&?PXn&%k568!y~~KluCE8EMl?#Ncp<|< z<0q#*GAZUCEc4-q5jaC|dikVfWJ;WRcJ18h_WjFI)#zh_g2L=-m?B)6M^<^cUr&Ke z_0B4@l(;xOL&I_I?ez4`jg2$HetZx1xv(iajWJhU%$UTSz2k zzkC@Gu8yAF{FXcndDWaeZ0>N9%P_9WKLK`M$J3m|b&$Gy+*4UaWi86S$f%@u%74If z3=4?X(a}+@f3AAXTZdvrs}`bh&V*7oD}VpBJMs zj}*$r0ABA^na5~ceEb@_s7YzRoZ^s`L}GJu^X9ht4?KSS`19w_(C5!9D=!)M*4<-; z*16WE!ndMaO^NGDgBAjsF@Rm}`lU$-^mE9d3!={@+ zX-?5kaKV+c?c6zFybdk;;pQbDKm+Qo9aOq}Ii}5i{iEEwR4lAI1*#jawH=Qq&!TTf3^J! zCdJ2dgcYmgoDXM@eYpA9+?|%kr+~~{&h8*na{Wlf08Y<|G1Yk7YzZNFco9IKS3aP$ zy!@;ENkGDv9p7Q?8yXry0@PTXY6Hir$lvqG-{)HuNO+U1_8f!!!MWjPyrjaA85=jZ zv5t=W^31@s_RQg&PR9sZA~iEpOI$5mBT zA4$3-#;xSN51P($AZwu6)F8%U)hyGcz-1@kctBFAoh4?qyQ3v9WP-aze11 zAWXw7``U9{Cr2+aB?SY}0*y#NScCIQt~rK0S=gE^>L0`TRRcr}g`6zs&&9>{#bFT;+AMIfqk-37-SaZy8g=Oqf4w&otVxobs%Yjr*YEI6s%6o#%N}{PJ&2DZIt4K7}Tg~L% zxL^U*^z?}H;YvQpk3Dh`jIIH&!iKH$or@TUYnt(TUNTV4D5YJP5k~@&PnZrxW7h zP7=nzaB$9&oD8;wWjQ&*=t1b9PS91A)AOOwfCptm%dGNSbV02d(-u=B=zTf|&}tVi zIygFphlLFe4K4ZwUcGu%OH1qQ*|P|ij+u9IVxkv#_Xdf;$I3b{N|_VAckdn+i{0Tw ziy&v80r`lHeWafG?3n=3QdjpO*7B&ZFk`BekdS)DcY=q3fq^|29kNgN;kKW9Ti;-1 zrR=S@udmkL%?6r`3EEifGRNGQ9R!+u?yCZPe3lX-lk{te8Rf|xJihytjEX) zfUR_uD9uC(jqHx;?)>!U&+P}^-Pu3IhoDnoIdIOTRDMMvGSE2=fGJCCSZAkRR(qLM zLnII|I7@41CxO<|9@$wVo%C_oeI=^YL?rfNMu$U)@%nqgJoQA0sV)q85eRvf`lA9s zNYE)GqoZ`6VkZxy6KN2!T^F~w0z>ogD5PBYfp7Qk-{0%(=HcOiIZ@Zt)Wj4rw7NJ^ zJN16ZuC#;}vAF$kn?-hqLtzgWH+NOIsi`S64!!JC=)uy`(x6!reSHoW17lnm|;lIkt${dQmlFDcEts1Nimjcr|YOvgr&To30L@Q_BZQc|B zwmEq&9x4x>*R>D?)p-CuM^?77va-)wJR>u+9*aG_Hxl}LcXu}uMj3G-kBqgY+qEWZ zXljB6flVb=k?@XrRhcz<2*RQ?w=7F@ta-?@_V|t@*`wvRw5{3>wDBO(0!L$au5*FV z{m*OLpUe1{A{u>;st=D(j)_U{nmEO!VQXs(h;D&}j`|Q|^YO{)Gy>QMH&yQ;(^FF| zjg7B+oIrtkSKutf5?V%zi;Iyk6sdyXyS`T;$Rzq1?DetNY*5$_c2SuCB>^3wtGk=a^PVbZ<~2EbbS#ylx-A9~rsC z*XB^8QW!ouQW#J4H^0--e#AVTOa8UVkCQq-E7n!sh3 z_^vrPh;v0ec<_LV10D@ntlVrJE0xbM#Vr%9PmP?h`1MilAB4t=BCm`FtZqZZyrD-z zZ#jDO=tNhZ%e8Aj`x;wXu4H$ttgPT2qj+QvHO~dp(B0LUEJ9I&RHJWDP9PSO07kX7 zwZKm_4qbL|a4<1>QakYc)vNmv5sam!05QVC5m6M7pCY~i$yBk!Zsh}!09jmIT$GjXw%BIBc#+>b1r6FsqNJ#ZR&RZ}f@o`FBS-4< z04f3pDoNtH(Y0$YsEw(RGb~NKQHQ^fX31;BJTOM!gdGJP@C*zFI^G-oWuwV!Ska*4 zeS>jvadmZdB)mV7NFftdK1T})<`2|ddh(AYesM3=j}v{!CG}$TZZJ0j|OQIdt&g z6s|(@Sqr>n$1l!yDR%RYK0fII3h?$89ozx1R?_->D{54&2h22Ecu(&XuP1PHD2BW| zVonME@d-Okb@dNgL31&{E2jF&PK4s9kyPX$wE=*=i3nw9d~=4*i#JA7uHjzNNdl_Z zu3f8kZ2$cEiRLJ9`@6ldlYgUg|F>`7Mn-HY4>B_krMGeJ*>k#Y5S|KJq}i*^{9)+u z>r()UVjy(@hMkJ*>y?R?`uh6k&)?~AU`)M%4PyhVOg`|dJ_S>kX(sJHb=8)jO90SlN}CtG73YxV(FJ#El5Q zBFGqcUH@%UY11k~5M^3Ja^d-)f>U3>o#GU(BTIRnzayX;jh)M)r%v2+7{kz__6fRD z%}z1oOte6gT7Q=TlW^|4{G-ik)uan0B<^W zEG#OjYhv-vojc$i(9+WKi*7|M?gKnEzkjcO=(3JZw9oNl$KG4!Ka7iutmH({$1mPP zobBx|T(~g9r>d_0rgsX5!v(V?wv5co%m9nXGcK9V&a2*`-HRZ%BSCL^N`qIiq4LHk zr*~?4a&oV8zEKXo_`30xE3sgXU{I(lS2}>`N-;7ZoF0IYS;NOJ@?ONonol0Qi*9=3$)|x<)zPx3SD}3!m=qIRX9w z&Dg~_8-h(#18WV~ciR$nsnh^nX=!O8^J{2m0MQp0cfXD0ADCtBI|V%F$S+SkkFQ%` z;0D-UpclErilL|R{D!hfD<}~Br+$zYdDs4$OJS4&KJoxiSD-b(g21pgD01l7lnB?_ z5B<$Zf7b+3mowtcq`kfa&1@U@1g)!~rInYPJJNfE3bBfmm2XAApOeD5-amI(D{R{0 zi@}=HqGFE*(Ml_V#+XyD#`vDW^Am`0y$(kI#4Z zeXO93p;?KuslCxwWFOGR-<)1<)!7ifpc~-z6dCcX{>2)hM?M2O^ZfY{d3o?rIoR2k z78Z8z-o3@7udOW~cy^ME&#sz3PpgQa;E6}-pat<*czrll$H<7wbv9EY@xJm<6l#6w zk77pT%os3aMn=Z%+qaYXf%kh?R8>^Spa=O?B0<+yZY=etIl|$;1e7~T)6UcL4JA}B z+p7YXl$2B}T%bnmT>@v|p83dYiSaEtqz6dVM%t6*Mj|)lJgd)Kla)#LK+qeC%3Nt-G-f6$qWYHBKGd)e7DbzU6Oc)a_60@*Lf z`SRxsHIQIiZ|xTq6&;fU4x{rkhdJ?j5TdBYg1sCZKI_Y~iXlwk$A>(JsPdfBJp|;& ztw@IKWr!KZCngGeoS@gw4q_pEaJ#g+1vzsZK2S5uqs)ZNFA@)N)wQCp=(C`yyc{jM7^^kyoK=;%VQa-o5y?+F#)9qbUPDMu7 zC5)}C(tYx?v$Mh0cPNUiTn10q%gbv6|ArQ+83V0t2UhE|XRpjL)fpKX>FNBElKMG% zqobq#d2-&92|~?uOnW&m&K82FkOEOiyol-d>1lbNX%nD=wF5VXWA%4;LvVZZ!aanE znHd&J@{u}Nl5TEpOd;t71>zDC66itj@E~@3?<6tdS$-v3PveL8KLWu=@Lwc$XrAG@ zP&i>G<}emdvH!vAm8=dei|t8ZFnecrQ+&_cy!}-Fu`u=jh=BZva(`V00pp)D;?09r zz$Ok03tJ7xEQhD8e>)6HKFtM8ihcjgvpMD13ABQJ_imF4?;Jq%r%x>b2Z2xg%>sWP z_<-GE0v6<>M|;@VP63_v!TV;Fm91dN6PUj@=U2#oW)=dqy=-j5g2|^G;{;T_E95-? zqU!%EyQh4Nj|{mIurQ`QPO;o1KAT5dI;pL#jSPuV=ajdPw|C^T()4sI@H=7a!EoB) z*9xRZ7l_G#cLg2K9%nZf7b1Z?MUdVbIX5>45!?gG?Fc#=Sk6y!byLX{6cm(}-T;3m z*y~_(0kHtGNT-7!&z0}Rr-H+rn3%Ys0#-Kkt>y1p%P$;nA*dBDm`-n{Yj^aQN{E-fTM#G-~so*0`Ipfrj{$t^BHg+9>V z`G&!Nsr}!ZFc3*-s78aIV66Z?&dvW%OMs;Ym}KfDq@<)|^xLWwJjelAMzcF)2cg`so}1A18&00O+^(ennU$TNpC9Ce)JXuf2S8y0Pq}{mIzW0r zK&4rpsE`l@Jx7lm*_OII+rUTSrGh+2@Y8AVVV?flhw(j*AXX1|QT2WL^v556^eaRs zB-oeqg72(iz<|_nLV^rNV^AKa<7R?|>*+cD&JscDH`(tdU)g1_`S#5d{4=%Yhm8Ek znVfzP?fqZn(|=vw6JSo!(FG7hfJ%>yjO^<(DKeT`I}`y7rl}yHza}_sHx1(I0@=#% zIdY;)^#dEjxM7H5Ril9y*%$_`j%Ts`iOswzc4ur1*YBpt9$g}>HBkF7gL3}-d6=v4tEz_V z4HB)?)H9yu2*Oa?P2Ue~DW(Yu`FVr+>?_O}^mQ7Sze>%(zyPE=z=gmD6%qM3;Hs;q7hR2@^KB-1sNj4t zbHa-dq>tvG&6%i#{~S{YLcWHFiHD&m1(x z*aLnw*s)l#0x7YjrKPo@^R;Vx+RUx@(sx?_Au#@}DMm|nwl0u_10aFC^9j)Hg^HC2 z{3`4sCePdKc>`wNrff{wNjmp&TE4BhY}4->ng(y>TzD~62yD_Yt}DlwH1#%UbD~0! z^G2)KOwkZKmF%&F-;Is@o{UmXed*}%C2K)GTtXalrv2rBNwwTuR!UGgj0i0(EI>Et zUpKAK*r$2-pTseQ7KnCmuU@?xP4>?%Dq5WEDQwTw5EK?(G^eD}`XnAxd=$c|%X0Wu zS8D49v%>leMCcAh<%DHo5J@H~WvC%aE&2`QY{ViO;-0P5-X`-FySqzVQUp{%z~Ql= zg&?BGz-R`)=n`4?3ruEIh2yg#C^4^7g6Y{s&74kht*x$BhQs6r69lLL!I%Qm3U5G= zl3t>>DCZfL!?od})z5WaIOEEPv$eo@g9!q&;@+v9J9mOF?K5HBfAj2UG$v@CMR9js zli0(CW*C}Cl3q;m!9SAqo%>qkNcVh`(g>(ZB(_vY%_Lt9U5juF3 zFGu>*rx5mH6eDWFYTv!nJ=XC|HRk4LJ4k=Q4LPKq&~FNE@F}i{5GI}-@81uw)iw18 zF0A1MgeJ8x!Fu4+@7(zyHrA^|bE`0CdH=`SS$s;!_M<8w|1;1Uqv@ez>Lu*Z^3LVrJBaZ#g&_g5YNuw7%J^7 zFazh2s2%@+Iv;Doz!}=t>~3PxH#^k8%p(nX1(8QTy8~Dlg#GT)Noyox-piMdA^4@d zNDZcks1}p}W@Ut%IH+$P=mk;)BJjY`X(V|2pmhQSz+l?9rK@CVBxZIv_)K*~IN zK{gi~N5_drC+r{?_L=E_3seb^M2@mPk6Ffw24r)UT6`)KzyRs>YR45s2B zEiU#r6$A59jX88hPcLY612SN}44vz^@@k^Hrd55m*EUcgF6n!9E{f_K7I@XBSuM@ zl5jB6t{>UTQP(u{yDV}QpPt)3E}#kub{;1I!%gF!W~HuILutv=67hG%ncXDQx=-9# zQ80rc3Lr~DM~;NvySL{}Ms##^b#*lejAdq~&9metxn<`0AOGm0s2IpzeRmrMkt%S! zuk-*A$S@Jt2m4Z0wK1wd@dbfFVdCP43xvUnKH@VAclUzYfzqIja*{iy2!_CdurwSD zrk_R!q;{6e-NHauEa|PXZQ&x&1-RfV%U~$YFb*=H&OAszr9?!g?;TDala&8ah&~6< zDzrZ*rC#5#KGS_Kva=^jIF?@I7`l$?(# z3Y3-66q3yPMsYBSVN#N;urtp;9Rq`Pz!o47?wRrqseO=?bX|;7#Jqa4Y6+s$Xn_^^ z$kVQ~Q1;+dR1)2!K)Z*r2_86b;N{Dgm0j|X+W=B}S8R;5BsN6xXa z?%zKEvmwOE$$*KR5`fHJ7t9pl142uq6&pOd|L&2{n5&;gt1%TxG%$sg{f#tho&xuz z*ynOzam$Ro+wl8X2#{ek3ChgI+IksfR!wMk>bFd60qP(Lb9JGi+hUsD_$@jR=)mwA z85#Nb_>@|XUTebf+BHTM@^uE2PhDLlP#bV&LPJAgfr4Zv;GDToLIC#)_K{=j?^$SU zbqVzID}QSd8W{5OBqD*37elpUYw|IgRz(I=77_!E z0%-#$jE+#YGBWyF(m;nh!QeV|gw?R zvi%nXL3q!cK6wd2*a-;2*2m2b-xTMb%Y~N>Zl_H=5rpsK+CR3(GJK*4vI9AD^7v(J z{CIEB#YgmnifNh&o3@#;$(;4>cf?!AI36iI*phawSNaLh_o#Yojegkc{`ij~#Bc7q z$li~J&PUcaU6c2Yj~P_I8qazj-je(I*5mEEEeW@teCB_Jv(^8IlHGdmF8c%p)p*@C zI8^on{um{jw7}48)NJ$(l<->~`}K`Wfhik;uwF$c!WaiOv#m#tA^$rM5+~5C=_tD| zPY#&jObgxmzgLHaIJ!P7pyExl+o_J5MfkZD74uhqNTHvqdZ*3FB8%Y&2eN~JaIohU z+|4#CdXJs9F0)wu5v_-3PS=JeGuwk!jI6D#-Q1=;8#R2VziT%xr0OMEyuViW?X5v@ za4>0gWztbpCiMOF`j}sT{WUU@4+DRJV>z{@QO#{_`A(e&;d&i5QDv*FWlH*f85tTm zPI$|fEkZ*1*XkbT+BN!Tuk=phg;6M!m>BbmQeyy%L8AvAg}bmqf)+y@T3+A2efzqt zEq=D>BSTh3M$O~LX=i6=PtVz!2vMROY4LklUS8flgV*1_eSuBTwPo! z`Oe*xGMu2cALC~%(PVyZPE0eP@YSn5GBTqJ(*g@7F`Gcv)FJ zKe9zsbkw7$Aqh?G?l#3>9zT8zYsJ~T648|cWDPX2#M4%b$55;{QW6@ zH1XE@hJ>|`fn7oN_V#vmsmapf;^OkL^~=Vg$>)3_ro=4xf_1b+|oj)pF|IXUk0Bdxr=yuH1>FxM-cjrfHW)XHg7 zQDI@*hV*9`L0h)vDkL0*;aNd{ z@7DjJDuln==}2_lqxg8Sty{gmf4ny|WbZuAWX$rztd3f)svbP(0rzn&n~$lq60vd( zTBQdC!OzOe%b_H^dGiJq*vK*vqyMN3M}Ph5)l>4INv>^cTbq!epvKoE_NlM>M1Bth zA)wv4cn|`@{(tg7K!!Jbx`@H}|AG*j>c@Se=62RN5Cloges-j0*J{tpX`w@alH7{_ z&S6SrexciSbl!j11erpy+MN087w0mrYPBp^JOQ9L}@)z4lEDWY~4V^xVyPksL z*$}6!uzUAzSy`vLhkGE%<};S2qk`0JYQppL^8rkT=a*_FaBJ6~Q_ofR@vy!*O3i(K zEORbKwrO-eo5U(kmi`M81p#O!YIw4#KWfV`QL<|gn|#2Sr74)^pT{xlEm@b=uu1Ct zlTG5{E5QIBA8v2l(h~4#b6*avBgaO@D9fzKv{d7Z)p14JJK`j=1zZiH&WiP*|+x$)M?KVJN@`ug|}I`xf4q zgpTkwn13lF`v#QOU$ z!I(6{0E=3Ny-Z9@x~zSC@;jZ{Btk+$U?7Kg?C4vXA9X3f{rvnGZqtx|)}2LbQ|~rO-VkABF~Svj!WYU!EP7QC9YSX(4gv#{Eu!$nu zn&#O*u$wleE*UyGW!N=Y=RnDqf+D{Ju>{i&uy_Q@;y`VbOen0`^&I1+@$t4y(<5>~VT^072`3kynR zFc*E2niLZwBqZcB{k>f$de6qYXn)sDthu|D{CYK!0Gas5YtE&e*a%Z>+5WmYCFJ%7HV(I&WZ)22=D zJZTMh*GRvhzS?zDQyX}B%kV43^iS|e8c}OC@=wS^q0Wk;7IB9cUcP*J`SN9~5Q#Z+ zZd_nHe{QFlzP`S>`8Z?08N`x>MdGt(+r`9sTwMjEbkCnT!>B^B`nEB;sVpCufw{T4 z2LYQ!HftvMlK~!J_Wb;gQmvJ;o}7O@OKbG?_I3zcokgz>tnkf3I_&(5D3oQ`HX&|6_(*Yav1m}a37c`7km4mi3v@BDFD1&)XI?F+P6Gq{O}{8PEX_`P-glzRYM0qBJ+}QfUnl zVUxfOHYQnKS^L|*ZCeqX$7C{L@+X6`Zdf`e;g=j5^_Ff}Mou#MWXVv5_)(fpxt-_t z8hChkT)g-dVl6o(MThy=s&H+9)RhTeNGgNzVPIOoX`NkM+R7Q*_|u;%*~P@fNN5Hu zKG2cqgxp==ZB8WO=o1&tol}Y<1L;f4%#_=|e@py`*7??Qs(-0|YY6Q&OtZGOwsXh3 z{_z58OyWjForl@NJwd2VbZpNm10;vSIx#T;(_viZKM$p>J=;=2LjfW1b5C^$2nod` zCYIw@mhRrY3)~qB-IdI?HOA3A%Z@De_4`S+N%6OsenklV)o?`A^A?ldAqZf6+ERoz zWsjHx0Lyb}OJO6-ne3#gzk{m9y|RdiT%>q(;>~2~6szsCw2gWd=t7Qv(ocjW_MWb; zVq5a|l%_ZBqe@Cjqaz~|#Gkh}3j2(8Jb3a%WXqNrppc~L8d1pUL?UpF5oIXGWQA-1 z?*1Q92z_AzYFWql0>o@c)#lBcuO5kmYUb4*0SjtsVPRoxj0Gmt+}?(o#o<@#KTTLY0uJrpbt( zC8{1j?#_7M(fDHPX=T+HzD)^=Cy2M|{scJ$!S_WW1qB5mckcK{iSVqCt#55=Ixr>B z-PJWSJDZZ69HU^F6~Vb~-A@|L$jAtOIY}jvii=ebAATHllMS(nM6-{16iujkq*5pp zK^a4pgoc%6Iu{q0V=%DhZlYtmfS&q`_E8`O#)gJ%FnO0RA7VzYN33=;29)}MyfrlF zPCkG`g07vS$a<`yuC6YW;hP*>iGd59IOk|sx^3GWay#!R%CwI9>Xk6YV-aL^rdHhT z#EBC&HYxN^5cuc!M$^g{bRo0%$;kyymeDQzhhJ@e_PD#ATbvys;HGs5xw*OHJ~%C{ z;QWr(*6YM8@OhHBlBj_T4GsO}mtQP!JMQP}=erhMH2+(qbMxvJWFIwPsTSX33?crFeAIOTV9wjo_qb z&z=<*7lX`=Rj_0Yr9`<imPoA5YRetLIQ}RG6kEGnMqDEfFLmb#8p^Ope!j_<;$1*_wOI|931N{Dags0E+DOBCee713XX^TQ!lhaz;XFLFhH!ne}7Y0 z^(6}ne0zlNSjXlqTfUpbA9jpMmgWnw`H{K-sc?J9?-m#s2rP_ll`UCbD%KG zkv(q<3Vf?W1$9$%laqI;s9>+XUXN6qe!%aB#bQA((@(=eH&sc5heKUPN-8xiZKUER zMLfqTl}ZxRg=H8M2JGA)po zl|7GXef|11KK+~Pvm?%3+>PRZ!LCivTczGeV8Ujlav!Z(AXPnXoxd1wkaM zQEc*ZavI(vm)+gny}a_8?0X7aE%o&Du3qgoSH=%MwaZiM0|t)%!iylAS=@h@R}&#x z9EhSSl>GVm`J9{_iX>c%FC?X;1ZS@XzSzy1HP8<|RHF z(;o%=%kcdlZi6%divx%lzq$^BF!xvR*K+goPmYbvNeqvTeH->#AKcGIkN4tmu?8&qwm4h|}#;B~UEG_+McGXGj zk92xiIX3dx$YS5VeGWHnjEsz=Wn`F@2QX5iG>btRJ&4ytkg7%$8y^o(#+x^H@7+72 zs~Z^_>Y1Yj*<~CN;8M*Ym(PuENFrAK$@D-SP?qStiBqS1}qoWfOU2;1Y zsnTm4Lsb*ahG}(Q`oI=$TN`<%(aP%y+7inS3X;SN1%vH(Z{jzD;{VM9TeASN;|zwB zGvu?8%pnrQt+)fqPhE;>CJM!Nfg# z#yoNcLGC;VAmDH~rGp2@d~g>oL{#+y=~s*+$I6=*kJf+@-cyG2_4oG&Zj?j=JW>Qa zf&%~6AT=~BEF~o+;?zKS;4=IGs_JC%v{IvbN-rBQ&m}+Ti10`<5R|Hy^xnPTCRv#B zY}k-vEDHw1`&@R!>SP^PAt>J?N7`_^<>edt-MoB#&t2Gn5FYGB^?{7WPfCgYL0)$r z-h&{go&^xh<=X=xm9U>aty+Essg#hAK#_z4_yJam;Y042Y-;exVC-{tgn5qj*X+Tb zj2c}yn9RkF^y$v9H8eEjcaMV!+GTBI6x(`(+|Uq{AP9x$tmfYn#QU_>P8I*TH)&~* zOYfrrs<3rjDvFBl07&5xj~+d`fB)xUFEAy@@keK~L_sEihk?O>*^nU}T6gUd#v3R) zE8!r5@Shb=N+P6B&vtB8RXw9RESzdENyDf|O>4AG@fckjfa z+0Cw8@gMp2_WSqm;3}sy6}nQ(!PNmm$VG)!Iq(_9rs*|w@%;Jo0Rg4?phB&4jDeh> z0&JixOM_ngb6oQ~+vIivF;M~c(|fedycFwx>oqS@@d-4{pZVLA_rUY#&%sTADhz1= z$_qpqbaiG9C?Zy0;Dq0jV13basoyLR)%lMCdPDO|powE1KPKkoZ50&c9dKeprh*Z) zn54RTX>M){?qzPSL2Ao3o;zGUDhCc6IC!wxHkbFRVOpBM1h|en$Jh|U&e=b!F9YZa za=0*e^jO^SZA6eBn3wp31m}Wo(e2ywsK{6*Ktn`Vtx3(TuR!)8SGW=s6%=J-# z;xtS;7-?YIQ^9O+Ym14C6WzM?5!jBI8viwcf;$)gCE(biOQ9Ql=K-4iU$MEPw<7+B z=z?Jg)oa4!aq4ToS)$F?BQZ$ZiDT++_8ihkwjLcpXxZpPyxt zTVsD{WPS-m47dWr+t`r4xE$d=AVuNfJSDvr1_lFeD!X>=`eHi^U7DA)b>JJ-SP;&g zJExbRiZL@26Blx`J4h^=X+aV#oK0f|YUOqk}UaG+9TJV=K;%$BrXM{EeaWA6Hc&7TSr=s8iZ{4~@ zV*XU1NZK{TA9#Acva&LmdJp8zgdfa6a1LDvE|K5s;%aaIRj8!6IK$8pK96M}$kaX6 z!HIPMqu~1uL)R6hj&=L|XdiS1(%!sL@gDgG^zBtD$SkXfGPS;niVCnNU?P6}`0?hA zbZUzU2BRGaoT$E|1O!LlPQ`@@0vm$m{>Q@n`CVUAGLh&_es=g&ihg#xovm$KYb&qc z0D5Iu4;-3}8#X}qe+11MKwH2bfh;wXe5a>rX`^kKC7$n+K$P;-Hyk*mX)X$W8GN~M z<3MBKIkX<8D zXo;;`zqvB$q}8(S`nB%3^k?WBE6S?XZd&wmj#u~dpilG;4-fnK`ITptP2OBzeneem zS+X`Y>?*YWfM|e4XOwLLB%F996B;iocvpWg_h`4E1La=>9Z0momAp^a4no&25qhtT znV%r|S&h)s#D^5Nw{Vp=Pp$TdtkYypX=&?^jE)kkL6HKv0TSiSEvjJruHxE3&=n40 zWHOnJjSae+3zXoN;k7OSbp2D$KYbV-tyJ+5EZ?o#pqnLgJbCWuwcpXv*MIPv!k=;s z)VN4;)T-)4>1!sWfCz@`TH&ded5lU3v=px7`a1t6%Gf z@G-rjZf0w_ajEYY`x}O()zM*_`|9;;-6x92P2-PxzOK6lmenk!YLFavVQ&k1r3KBa zo(>l9`}glbeyy3iRpp*M4`FmvJ}(;aMgLfobW%eT7%1S#sfU5ld}(WSzZ=isF?di_ z^Ho(&&hRp7qVng>eflr{3GU`_BztbyF!J4_2&POUEQmRPg3^Fq>MPzMa<-lbaXtI<-hN!ZOeULV3X(XLj^oSEU zsN}L2dC<53$9;lQwp?y-1ETfK8!Yr6=KWXR!GzITi2X?%z4KjtW6PCa3r<9A-e&0uN)wSahoX5MOT5HrLs>5swP{B`L_rEW@6mU6PUp zmo7n6dwO_$sH&3EjmN_N7_h$tg@o?hzTNA4_SLIbU{^txVO~NkE5T+ep!f*W^SN3! zZ$o(y&$#ucy1KV%X-iX8{AI3Jm(QF(A08f_2b)j6n?j@hlVlVV8q3RIXTR1>D25)f zum$!i!PQ}c?!~i(O+pZM75#U1llrRJyu-krb1?z1aR?MVOx8+l5F-{EN3dN4c6l^4 z^?MYxWtopMn#v%tf)@Kj($c^`%A@MTa&Hn8obT~$oEJsK{CS-H)*b)sW3i4w|7bK5QR{ zU(aaQP)II%OF*#*NIgOAy88N((JcI86-q+It)kz}jD%kSdmt2MCOo{VzJ6u!-8# zP4x+H=Q*gLJA+BU#J5bS_rd_awRMdz^z`(=mJY~3?Ng^%Qz2+42Zw3RuMZ@3VA~9I zRZnPXtu02FCG!Jryh4vO`FMTAh)+p~#{dt4NFYgUzi*uTUsF?kL2PavdgHy0*^{tC P5ILi*dot^U)vx~rL)5kv diff --git a/docs/assets/benchmark/string-equals.dat b/docs/assets/benchmark/string-equals.dat deleted file mode 100644 index 6f6fbc59..00000000 --- a/docs/assets/benchmark/string-equals.dat +++ /dev/null @@ -1,2 +0,0 @@ -gwion 0.165975 0.47 -wren 0.184180 0.38 diff --git a/docs/assets/benchmark/string-equals.png b/docs/assets/benchmark/string-equals.png deleted file mode 100644 index 9782d6dd28a532ffdb48e56c78a832d22c4d08f3..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 9184 zcmeHtcT`jRy6vJFQ32h8C{;>Kdz!A@xS(6>al8BU#!WR5AFA20ua}+NzF;1A z#c9(6zkQwec$RZR6W#pAL*3V-^T}>;_g6wWA5G6bq@Ly$Ncz6(+z!9d_4-hJ3+Dr@ zyj;!La6uWJLQAFZOmwF6#^lxyn;?jeqidEVf>cjGKsb;C*nj0ItU6iA-A^rb@p!Oh zRj7&1*e*w%_Q`@Ot-x8w2`gl$4)&IoV_lShpq%{^0vDEW7JEzQl<(+gukZ!@U~S~2 zUwNcx@OUOp>sS68-{0QIvnarn+2+Eb=JVtHITQQv)e(4Fns!9^hnRh8sWbNk?JtFg zlfJ4~4|;!2R=Swe5xZa2XZS-bk$|p`6XE9Oe*XMx!WtpC{-D z`xKmZh-#ctR9qa46l2Uc%59Pu!(zbMA&w$(S3mlG(!;R7=a?+M5MWdsmb`==vmoHg4ISv&VV!T6|k=FKBiy&n2 z?dYgetZsZ-T0bT}0!#Ms@!>!B#+t~GwkWXIbZI@nWUIhT&wGj}I2m9tC0-{~Rf9e~ zIZCO6MRik5UR+$9G?Y_PTIvg-k%O0VnY)~tQzpVZPCk45_;D!y*s)_9IOTwu9+YTc zHPb~RzJcT=Eg&EemGR`slcHb~kUYU;%zdPoy96|}h6Sn}Y-*|oWPu}-25z0ra3Yfi_@+@Gl*8sa5wcqV^# zqQ=Fx%J1B2o~I-$i)L)BZn<-1{zrpIRsGA(Nz{(Ltu@GS6F65EyyVtRE?-yh7$1^Qgd^2iE<8o6#-s+TD^ELij}Qx zr5p7ato_jYhbbv3+`A?G8cG_a1g=k$9D*l~^tUb3`k9g1 z8#RO8PZASJYF#O+zWMg#wJ!GpyHfALkB`I)C~H4g=7z&;at!e$fG8SeedgW0?KCpo z91A95gh=-edb*iu>_=iiiXEXq< zs?2-vU5BxD7;s>AcJ}=IJXD5#na>ev>5IYkNceq(W7F{L*|Wd{=H>})E(RAal>3ZC zH91vG=2v8maSb?^a`7NoBp=JhV)Osz$@?N_X?{MsuQCX#S}j#pMuzz6)l{%}ONwgY z)w-xR*Xr-zyVn~=@0FvhWYi9B{b9<6jPIIfL%X`_8ydoMkITpucTekPwp~A&su@z! zTeC3MLb4_X1qA^>_C(h?6&^WqL`g}BE3g?sdJeB5HpdgrMDmV|jp2lpj-5Q|voP8O z2Rwh8H+$`XFL_=q54Drflrlz6u4U%jG1q4yi*Q!x+S&@8TV|TL;VKKavn10?duN36 zUGrYN7-2P=f&w`ysjWOb(?8>LbGxW^2twk+)pv9o9~5)EQ`6eoI#8AU{Q2q3Hedwa zW$V|Dr%g=SBE`a2fLZ%C_Os94+kz|#+$uXCU&WQ0lw@gQGFUYVFgS7IgotgYtWC-1 zt8Xe7n$?XpmrO}%ox?fZC^jTLKW@eI}D5vUzVsVIYYFR4gG9dr2b;k)dUuQ^$ZSPF%Zhl(P_?(f>$X&k0@|I6DB_ z$=bR`xvE8xXNBp^gVp14$prkx`;y3zvUq3?XCi_jak2EG)SXjte zy}b@{1jW05d{c0npJ5_}*^8zR)kXXI_@o$(eTWsVTA!)N%E~%@XUo%sgs)$|7~qws z-_(n)!`g(R#*UABX^>uYFW;j-`SIh&(aYH@dyEMhFWX$8L6f7QUO)q^e{+;S?m*Fy zk{WM+aZwZ}si5H7o~7Ss2y#zU(d9S#T$X-3ywjMvV_4WGd=6*~Q+A7t;r%Qr!n5}e zDT47LYYa&E&9C>b+j$mShp7Xbu|x>SmL;OTkr6@FH=7yQe7kz9fp{sqZU6`lxYH)m zso=$NfMkEhcMlMy12}EQ$~39J+&16BKIq8d!`J&MVNn_U0s_yPM$PrsK`~qeO6cea zb3Y_5o@4OrS5wm;HoN)xpCl*$w28stNZr$#8@X6Q>nbfGR(Dt(_m6S}`A<1w^W*rq zGXNP&sUP&VE%UiC-uj#&9jlv3d-L6c;xqDzvAGVLQXeZ!k9OF2XVWo0KJGi#{LCQR z9OYMLizZc2*&=yGf>&m*^k>vK&N6HGMMax&qCLrK&|d$LC<9?rernJ@~9^-H>--_m;jBxsBEwaEfiyCD&)`!?G>*KS=3{l&cH zAG&we7(1d8ZT#*XaS{ZHvG(R7Py)#QPmPUZ&8Z=vKB4(d1hMI)orV?KwQE;HLjzE= zZsv)jM<+f#l~%@2=U2=;CI}*n`$!Y1mgv(QNPeVED}pTAaP9@;`d6n7-@C{GW3z~o zk7@dSyj$h5;a6$)6Z;lZC=Bagf6a1k72N5F{N`M!--58!hy0mW|B7q>^^a|ROhC|= zbJq&b;q+WYkpp*;GxtfQxfg=jdb0m6Rn}jVLtZ$y?p~|UJFowUz=oyVmv%%DPWUtk zr}uWDlb=V^G+%$`gf(a1Du4ZwEkaUdE!e-tD<9Bd%g@Wht9aR8zn*231Gtx#mY#I< zzH(&{wp#qqAyYGAZmwIg{$|<1Gxrzgd!U~N-P-C6Pjqv0yK&=&tLw{NH24mQ_=&0S zh10xR-UHPj6yxLLfu!>Ts-g6Q!+*7~=yczWLefc`hpP8PkF-8Nv%0#PsT&&=6Vp=} z1ft&8-rm0Aj-)YRip)81&^?aPTANN3;W2!7~i_*?sefQnw(#Js%7 zcDG`XH+6M&MmfHdUy1NbyoBM9rz4`1w)+86!BROBS$d*D*QvQ?^d4WFQ4St@Z%$gc z_2tWjAa?NtaVT8@e(ae1-W@zVJPdasAt6PfSo?yi263E-y7IAOxqw>X_1xT_AyadK zXdej#@zXz$kKMg{w=|g1&i&fq8WIu`ii(OzOSq<}_U#VPg#`9p12Hi%pFVw>pZB4G z?8t0#YW(=IbX7d@=~FWc3*(eibEAA*h|U47L)DO0>{CJ8nwy)OnLVu?{Mg+5)vcJ) z^8MT2Rn6q*=Y+83@1ETyW@cte%F288>}e)wt~aaGY|H&zy^O>VEJ5%AfjWmUi>e0D0VakK0S`IWH!ww7s`U`faKAm?FxwVdtz2W+OAu!oJ^r#Ag$Ue|L@cP zcWZ!th;&k^O?VZ#lP4jQc=6)J)2C1US*00)Zqm0g9hs;a7_q-6C1Cz6h8Kz+OVX1|)Bl(u%nm)}jm zVFBl$(P%KS?g6tu8sfhRRjUd5KL$QFZJ%WN`RT5fSeP|N2 zOMOFb1luPe_Ky(1=ym~aRC)D3p$w)Wjr%bHdsTifz;vS%Ko~0X%z9p+s>}HGH3xbyuX?qNOX`&^euvW z_T*}-T>to6Uz!#`;P}penk#hQ!HH`AT-CR;vqS75@Yj^y$yQ={93=UtmKK)EyMFx# zC;%+I64foa1`53pB)g#Y&K+uggIw5yhuN#8w6tcfbxdl9VGv7KyMpulZyQ<%vs zD}fcgeP6zOA=gO6A3b#{aAkIIyP)g_eT>vM74(GQCKS=V{3)&`^(4_7WAAkSX z;H8_IAaus4rP`3t@C!lF^%pM=4rDC_o)0mpx1l6Td;X(%o;k66j1U5z^UKT2pd&j# zMS@*l9PnU6wqnx}jmR2D7Z;aVhmO|P^fs5p;7vnbQFV-msi~>HzP^gni~j-D54!+v zB|5fjk`fZ;rluO09n`6u99PX@d0cOHxJLnSbO4ZV`clA@mC^h_*gU z9i9?L9|_xx0pGaN`5Q>0|8~mt?+g5k7O_>5!`8w=#jCIKa%y-@XmZ zH8)(Zr>EE1*(oR>VB&!2^taPlx$ih?txo_rZWCdHm;CkVgFp3uuWO1$W+5@uUK`I; zOGQH<%^G9L*;kHtoBUyYY-v_bP025Ee}XOAOd~B+aM-oq$*G13S;SJF1JAybhYuYZ zszHhMK#TY4U|H%{mM1V%-(J6dT>)8pouC86sf=}uM*2dIPIm|D?N<4&&i3}l$;mAK zx3+d8bwdQxa9u5A*`wkP-~LmtG1Fa;TET1qgQ{dQ)}K9l)}pasU})F`L&r!SVW(p2 zP1JtP;4cgD<>loVzPH!v!YYsAJFRbiw ziN6j_S}!Q-o`x9^#DZ5UDnjS#1V6PzgcjvdDB+MR;gvmwU`z;1S6;5(Y6iCiS(|NU z8!IOvfqv6cQlhR0F8!nefzEp#la)2+zX4v1q9npM{`sgk8P*B%vUSW%&pu&c{BOSv z*zMT9T>;-jl(kVms;#XJ(WrvLg41XrWQIveN&TBM0V=*b(-(qg`C(Ak?qbb+&9iNd z$=ur;B_It+dg$ceV{tmMY!E9vv{|?aj5DH*YfBhlYozF(G-v4yh*450jEg z!#CI3GWGcO${#p*aF9&zb65Is{Upo>`NXtBK@@9m%$~_3rbRHy>aGUSdjksS{30}7 zzcYLU_UJt_Cxv2RTA~GU&Ash{Ux_vWV4fh^d(m4{5kNB!&-EBX`FU^anO(fa&mOa^ z`lkRsUodG+A-Q8VK#(I%8Gn+7um`79p%D>J>?4E>x6yDq#CNG=x z{{H0wl^&6Cf~W?UE>0A}$pBg%Uv?9MaNK8o7obnm=f=i{o>*AX^!doz zM|ixjh=^v$@)U-TiqWahfq#5=_4_&MWj?tmLfX4lUi9}X8@`^2W5O~bDhp7q&QwSM#y{l z@}^p<7kSD2(xuh}85`^A?w%e91B1Uny{P zacOl?3?@^ABVj_%8U!m{&NhH6LCEH&9th(Ocr~P8eRaDfjXe4)RpsR54jsx+Xra0V zq<2G!z*t)4K9BHnV%5eC5IT2IeD)_P=ZH^P@677L*gE6G93;xHdElA>c6O=Utw8_)kTONV z>Z&JByrEDSKqeHW#srx{%i}bda$Gjnq|Tg1pGuc8O0$8~Z~f$d<UZdN|Quj5iR8zyA_M{N!jp&BaT3cx6h6i>s?Es{l%%05UQ&ZHhO>+cLpv zQMPyZPk!};fgYf*MVlE~p;tPHh%qmx=fN_|$On|SjVY?A;DlAs5QoFO2msxjqNzQ`5mdU$gRlLUCPVK$bJXv$ukv`K4xg~^_ z8XBSR?sAKT&ffC6+)a0>ES~wndUwv1gp6Pf!i>EJ2ZBWpY5vd9?vLc||MIk<{dD_a Ucb4Ux7XpX=Iis`re{;P3A4|xnr2qf` diff --git a/docs/assets/doc.css b/docs/assets/doc.css deleted file mode 100644 index 692967e8..00000000 --- a/docs/assets/doc.css +++ /dev/null @@ -1,7 +0,0 @@ -li + .lev2 { - display: none; -} - -li:focus-within + .lev2 { - display: block; -} diff --git a/docs/config.mk.orig b/docs/config.mk.orig deleted file mode 100644 index 9cecde9e..00000000 --- a/docs/config.mk.orig +++ /dev/null @@ -1,32 +0,0 @@ -# tool to build the doc -DOCTOOL = mkdocs -q -DOCBUILD = build -DOCSERVE = serve - -# output box css -BACKGROUND = background-color:\#f2f2f2; -BORDER = border: 5px solid \#546e7a; -PADDING = padding: 10px; -MARGIN = margin-right: 20%; margin-left: 20%; -BORDER_RADIUS = -moz-border-radius: 15px; -webkit-border-radius: 15px; -CSS = "$(BACKGROUND) $(BORDER) $(PADDING) $(MARGIN) $(BORDER_RADIUS)" - -# output box status -NOTERM_OK= &\#10004; -NOTERM_NOT_OK= &\#10008; - -# terminal status -INTERM_OK = \033[32mOK\033[0m -INTERM_NOT_OK = \033[31mNOT OK\033[0m - -# valgrind -VALGRIND ?= valgrind -VALGRIND_LOG ?= vlog -VALGRIND_OPT += --leak-check=yes --log-file=${VALGRIND_LOG} - -## ensure no valgrind if requested -ifeq ($(VALGRIND), NO_VALGRIND) -VALGRIND = -VALGRIND_OPT = -endif - diff --git a/docs/index.mdr b/docs/index.mdr deleted file mode 100644 index a95522ae..00000000 --- a/docs/index.mdr +++ /dev/null @@ -1,23 +0,0 @@ -# Welcome to Gwion - -gwion is a easy yet powerful, strongly-timed programming language, - -## And now for the hello world - -So, as it is mandatory, here is the piece of code you're waiting -for: - -@``` helloworld.gw -<<< "Hello, World!", "" >>>; -@``` -@exec make -s CONTAINS="Hello, World!" helloworld.test - -## (Bag of) Features - * [single inheritance](https://en.wikipedia.org/wiki/Inheritance_(object-oriented_programming)#Design_constraints) - * typedef (function pointers and type aliases) - * enums and unions - * templates (both class and functions) - * easy concurrency/async - * [lambdas](Functions/Lambdas) - * memoization - * [variadic](Functions/Variadic) functions diff --git a/tests/benchmark/binary-trees-gc.wren b/tests/benchmark/binary-trees-gc.wren deleted file mode 100644 index 803202ec..00000000 --- a/tests/benchmark/binary-trees-gc.wren +++ /dev/null @@ -1,55 +0,0 @@ -// Ported from the Python version. - -class Tree { - construct new(item, depth) { - _item = item - if (depth > 0) { - var item2 = item + item - depth = depth - 1 - _left = Tree.new(item2 - 1, depth) - _right = Tree.new(item2, depth) - } - } - - check { - if (_left == null) { - return _item - } - - return _item + _left.check - _right.check - } -} - -var minDepth = 4 -var maxDepth = 12 -var stretchDepth = maxDepth + 1 - -System.print("stretch tree of depth %(stretchDepth) check: " + - "%(Tree.new(0, stretchDepth).check)") -for (i in 1...1000) System.gc() - -var longLivedTree = Tree.new(0, maxDepth) - -// iterations = 2 ** maxDepth -var iterations = 1 -for (d in 0...maxDepth) { - iterations = iterations * 2 -} - -var depth = minDepth -while (depth < stretchDepth) { - var check = 0 - for (i in 1..iterations) { - check = check + Tree.new(i, depth).check + Tree.new(-i, depth).check - } - - System.print("%(iterations * 2) trees of depth %(depth) check: %(check)") - for (i in 1...1000) System.gc() - - iterations = iterations / 4 - depth = depth + 2 -} - -System.print( - "long lived tree of depth %(maxDepth) check: %(longLivedTree.check)") -for (i in 1...1000) System.gc() diff --git a/tests/benchmark/binary-trees.dart b/tests/benchmark/binary-trees.dart deleted file mode 100644 index f7d52d5f..00000000 --- a/tests/benchmark/binary-trees.dart +++ /dev/null @@ -1,56 +0,0 @@ -// Ported from the Wren version. - -class Tree { - var _item; - var _left; - var _right; - - Tree(item, depth) { - _item = item; - if (depth > 0) { - var item2 = item + item; - depth--; - _left = new Tree(item2 - 1, depth); - _right = new Tree(item2, depth); - } - } - - get check { - if (_left == null) { - return _item; - } - - return _item + _left.check - _right.check; - } -} - -main() { - var minDepth = 4; - var maxDepth = 12; - var stretchDepth = maxDepth + 1; - - print("stretch tree of depth ${stretchDepth} check: " - "${new Tree(0, stretchDepth).check}"); - - var longLivedTree = new Tree(0, maxDepth); - - // iterations = 2 ** maxDepth - var iterations = 1; - for (var d = 0; d < maxDepth; d++) { - iterations = iterations * 2; - } - - var depth = minDepth; - while (depth < stretchDepth) { - var check = 0; - for (var i = 1; i <= iterations; i++) { - check += new Tree(i, depth).check + new Tree(-i, depth).check; - } - - print("${iterations * 2} trees of depth ${depth} check: ${check}"); - iterations ~/= 4; - depth += 2; - } - - print("long lived tree of depth ${maxDepth} check: ${longLivedTree.check}"); -} diff --git a/tests/benchmark/binary-trees.gw b/tests/benchmark/binary-trees.gw deleted file mode 100644 index af3486c1..00000000 --- a/tests/benchmark/binary-trees.gw +++ /dev/null @@ -1,51 +0,0 @@ -#! Ported from the Wren version. - -class Tree { - int item; - Tree @left, right; - - fun static Tree new_Tree(int it, int depth) { - Tree t; - it => t.item; - if (depth > 0) { - it + it => int item2; - --depth; - Tree.new_Tree(item2 - 1, depth) @=> t.left; - Tree.new_Tree(item2, depth) @=> t.right; - } - return t; - } - - fun int check() { - if (!left) - return item; - return item + left.check() - right.check(); - } -} - -4 => int minDepth; -12 => int maxDepth; -maxDepth + 1 => int stretchDepth; - -<<< "stretch tree of depth ", stretchDepth, " check: ", - Tree.new_Tree(0, stretchDepth).check() >>>; - -Tree.new_Tree(0, maxDepth) @=> Tree@ longLivedTree; - -#! iterations = 2 ** maxDepth -1 => int iterations; -for (int d; d < maxDepth; ++d) - 2 *=> iterations; - -minDepth => int depth; -while (depth < stretchDepth) { - int check; - for (int i; i < iterations; ++i) - Tree.new_Tree(i, depth).check() + Tree.new_Tree(-i, depth).check() +=> check; - - <<< iterations * 2, " trees of depth ", depth, " check: ", check >>>; - 4 /=> iterations; - 2 +=> depth; -} - -<<< "long lived tree of depth ", maxDepth, " check: ", longLivedTree.check() >>>; diff --git a/tests/benchmark/binary-trees.lua b/tests/benchmark/binary-trees.lua deleted file mode 100644 index e690c270..00000000 --- a/tests/benchmark/binary-trees.lua +++ /dev/null @@ -1,50 +0,0 @@ --- The Computer Language Benchmarks Game --- http://shootout.alioth.debian.org/ --- contributed by Mike Pall - -local function BottomUpTree(item, depth) - if depth > 0 then - local i = item + item - depth = depth - 1 - local left, right = BottomUpTree(i-1, depth), BottomUpTree(i, depth) - return { item, left, right } - else - return { item } - end -end - -local function ItemCheck(tree) - if tree[2] then - return tree[1] + ItemCheck(tree[2]) - ItemCheck(tree[3]) - else - return tree[1] - end -end - -local N = 12 -local mindepth = 4 -local maxdepth = mindepth + 2 -if maxdepth < N then maxdepth = N end - -do - local stretchdepth = maxdepth + 1 - local stretchtree = BottomUpTree(0, stretchdepth) - io.write(string.format("stretch tree of depth %d check: %d\n", - stretchdepth, ItemCheck(stretchtree))) -end - -local longlivedtree = BottomUpTree(0, maxdepth) - -for depth=mindepth,maxdepth,2 do - local iterations = 2 ^ (maxdepth - depth + mindepth) - local check = 0 - for i=1,iterations do - check = check + ItemCheck(BottomUpTree(1, depth)) + - ItemCheck(BottomUpTree(-1, depth)) - end - io.write(string.format("%d trees of depth %d check: %d\n", - iterations*2, depth, check)) -end - -io.write(string.format("long lived tree of depth %d check: %d\n", - maxdepth, ItemCheck(longlivedtree))) diff --git a/tests/benchmark/binary-trees.py b/tests/benchmark/binary-trees.py deleted file mode 100644 index b08adf3b..00000000 --- a/tests/benchmark/binary-trees.py +++ /dev/null @@ -1,44 +0,0 @@ -# The Computer Language Benchmarks Game -# http://shootout.alioth.debian.org/ -# -# contributed by Antoine Pitrou -# modified by Dominique Wahli -# modified by Heinrich Acker -from __future__ import print_function - -# Map "range" to an efficient range in both Python 2 and 3. -try: - range = xrange -except NameError: - pass - -def make_tree(item, depth): - if not depth: return item, None, None - item2 = item + item - depth -= 1 - return item, make_tree(item2 - 1, depth), make_tree(item2, depth) - -def check_tree(node): - item, left, right = node - if not left: return item - return item + check_tree(left) - check_tree(right) - -min_depth = 4 -max_depth = 12 -stretch_depth = max_depth + 1 - -print("stretch tree of depth %d check:" % stretch_depth, check_tree(make_tree(0, stretch_depth))) - -long_lived_tree = make_tree(0, max_depth) - -iterations = 2 ** max_depth -for depth in range(min_depth, stretch_depth, 2): - - check = 0 - for i in range(1, iterations + 1): - check += check_tree(make_tree(i, depth)) + check_tree(make_tree(-i, depth)) - - print("%d trees of depth %d check:" % (iterations * 2, depth), check) - iterations //= 4 - -print("long lived tree of depth %d check:" % max_depth, check_tree(long_lived_tree)) diff --git a/tests/benchmark/binary-trees.rb b/tests/benchmark/binary-trees.rb deleted file mode 100644 index 2118083c..00000000 --- a/tests/benchmark/binary-trees.rb +++ /dev/null @@ -1,49 +0,0 @@ -# The Computer Language Shootout Benchmarks -# http://shootout.alioth.debian.org -# -# contributed by Jesse Millikan -# Modified by Wesley Moxam - - -def item_check(left, item, right) - return item if left.nil? - item + item_check(*left) - item_check(*right) -end - -def bottom_up_tree(item, depth) - return [nil, item, nil] unless depth > 0 - item_item = 2 * item - depth -= 1 - [bottom_up_tree(item_item - 1, depth), item, bottom_up_tree(item_item, depth)] -end - -max_depth = 12 -min_depth = 4 - -max_depth = min_depth + 2 if min_depth + 2 > max_depth - -stretch_depth = max_depth + 1 -stretch_tree = bottom_up_tree(0, stretch_depth) - -puts "stretch tree of depth #{stretch_depth} check: #{item_check(*stretch_tree)}" -stretch_tree = nil - -long_lived_tree = bottom_up_tree(0, max_depth) - -min_depth.step(max_depth + 1, 2) do |depth| - iterations = 2**(max_depth - depth + min_depth) - - check = 0 - - for i in 1..iterations - temp_tree = bottom_up_tree(i, depth) - check += item_check(*temp_tree) - - temp_tree = bottom_up_tree(-i, depth) - check += item_check(*temp_tree) - end - - puts "#{iterations * 2} trees of depth #{depth} check: #{check}" -end - -puts "long lived tree of depth #{max_depth} check: #{item_check(*long_lived_tree)}" diff --git a/tests/benchmark/binary-trees.wren b/tests/benchmark/binary-trees.wren deleted file mode 100644 index 2393462b..00000000 --- a/tests/benchmark/binary-trees.wren +++ /dev/null @@ -1,51 +0,0 @@ -// Ported from the Python version. - -class Tree { - construct new(item, depth) { - _item = item - if (depth > 0) { - var item2 = item + item - depth = depth - 1 - _left = Tree.new(item2 - 1, depth) - _right = Tree.new(item2, depth) - } - } - - check { - if (_left == null) { - return _item - } - - return _item + _left.check - _right.check - } -} - -var minDepth = 4 -var maxDepth = 12 -var stretchDepth = maxDepth + 1 - -System.print("stretch tree of depth %(stretchDepth) check: " + - "%(Tree.new(0, stretchDepth).check)") - -var longLivedTree = Tree.new(0, maxDepth) - -// iterations = 2 ** maxDepth -var iterations = 1 -for (d in 0...maxDepth) { - iterations = iterations * 2 -} - -var depth = minDepth -while (depth < stretchDepth) { - var check = 0 - for (i in 1..iterations) { - check = check + Tree.new(i, depth).check + Tree.new(-i, depth).check - } - - System.print("%(iterations * 2) trees of depth %(depth) check: %(check)") - iterations = iterations / 4 - depth = depth + 2 -} - -System.print( - "long lived tree of depth %(maxDepth) check: %(longLivedTree.check)") diff --git a/tests/benchmark/fib-recurs.ck b/tests/benchmark/fib-recurs.ck deleted file mode 100644 index c0026c47..00000000 --- a/tests/benchmark/fib-recurs.ck +++ /dev/null @@ -1,10 +0,0 @@ -//int count = 0; -fun int recursive_fib(int n) -{ -// ++count; - if (n < 2) - return n; - else - return recursive_fib(n - 2) + recursive_fib(n - 1); -} -<<>>; diff --git a/tests/benchmark/fib-recurs.gw b/tests/benchmark/fib-recurs.gw deleted file mode 100644 index be2c4ab7..00000000 --- a/tests/benchmark/fib-recurs.gw +++ /dev/null @@ -1,8 +0,0 @@ -fun int recursive_fib(int n) { - if (n < 2) - return n; - else - return recursive_fib(n - 2) + recursive_fib(n - 1); -} -#!<<< 5 => recursive_fib >>>; -<<< 40 => recursive_fib >>>; diff --git a/tests/benchmark/fib-recurs.hs b/tests/benchmark/fib-recurs.hs deleted file mode 100644 index 6929769e..00000000 --- a/tests/benchmark/fib-recurs.hs +++ /dev/null @@ -1,6 +0,0 @@ -fib :: Int -> Int -fib n - | n < 2 = n - | otherwise = (fib (n-2)) + (fib (n-1)) - -main = print $ fib 40 diff --git a/tests/benchmark/fib-recurs.lua b/tests/benchmark/fib-recurs.lua deleted file mode 100644 index 3b84ea32..00000000 --- a/tests/benchmark/fib-recurs.lua +++ /dev/null @@ -1,6 +0,0 @@ -local function fib(n) - if n <= 2 then return 1 end - return fib(n - 1) + fib(n - 2) -end - -print(fib(40)) diff --git a/tests/benchmark/fib-recurs.pl b/tests/benchmark/fib-recurs.pl deleted file mode 100644 index 55092d23..00000000 --- a/tests/benchmark/fib-recurs.pl +++ /dev/null @@ -1,9 +0,0 @@ -sub fibonacci_recurs { - my ($number) = @_; - if ($number < 2) { # base case - return $number; - } - return fibonacci_recurs($number-1) + fibonacci_recurs($number-2); -} - -print fibonacci_recurs(40) , "\n"; diff --git a/tests/benchmark/fib-recurs.py b/tests/benchmark/fib-recurs.py deleted file mode 100644 index 672317f8..00000000 --- a/tests/benchmark/fib-recurs.py +++ /dev/null @@ -1,7 +0,0 @@ -def fibonacci_recurs(n): - if n < 2: - return n; - else: - return (fibonacci_recurs(n-1) + fibonacci_recurs(n-2)) - -print(fibonacci_recurs(40)) diff --git a/tests/benchmark/fib-recurs.rb b/tests/benchmark/fib-recurs.rb deleted file mode 100644 index 00f33f13..00000000 --- a/tests/benchmark/fib-recurs.rb +++ /dev/null @@ -1,5 +0,0 @@ -def fibonacci_recurs( n ) - if n < 2 then return n end - return ( fibonacci_recurs( n - 1 ) + fibonacci_recurs( n - 2 ) ) -end -puts fibonacci_recurs(40) diff --git a/tests/benchmark/fib-recurs.wren b/tests/benchmark/fib-recurs.wren deleted file mode 100644 index db980c49..00000000 --- a/tests/benchmark/fib-recurs.wren +++ /dev/null @@ -1,8 +0,0 @@ -class Fib { - static get(n) { - if (n < 2) return n - return get(n - 1) + get(n - 2) - } -} - -System.print(Fib.get(40)) diff --git a/tests/benchmark/fib.dart b/tests/benchmark/fib.dart deleted file mode 100644 index 3ffa670b..00000000 --- a/tests/benchmark/fib.dart +++ /dev/null @@ -1,10 +0,0 @@ -fib(n) { - if (n < 2) return n; - return fib(n - 1) + fib(n - 2); -} - -main() { - for (var i = 0; i < 5; i++) { - print(fib(28)); - } -} diff --git a/tests/benchmark/fib.gw b/tests/benchmark/fib.gw deleted file mode 100644 index 19f56b93..00000000 --- a/tests/benchmark/fib.gw +++ /dev/null @@ -1,8 +0,0 @@ -class Fib { - fun static int get(int n) { - if (n < 2) return n; - return get(n - 1) + get(n - 2); - } -} -repeat(5) - <<< Fib.get(28) >>>; diff --git a/tests/benchmark/fib.lua b/tests/benchmark/fib.lua deleted file mode 100644 index a4f06e7c..00000000 --- a/tests/benchmark/fib.lua +++ /dev/null @@ -1,8 +0,0 @@ -function fib(n) - if n < 2 then return n end - return fib(n - 2) + fib(n - 1) -end - -for i = 1, 5 do - io.write(fib(28) .. "\n") -end diff --git a/tests/benchmark/fib.py b/tests/benchmark/fib.py deleted file mode 100644 index c2f3ba4d..00000000 --- a/tests/benchmark/fib.py +++ /dev/null @@ -1,8 +0,0 @@ -from __future__ import print_function - -def fib(n): - if n < 2: return n - return fib(n - 1) + fib(n - 2) - -for i in range(0, 5): - print(fib(28)) diff --git a/tests/benchmark/fib.rb b/tests/benchmark/fib.rb deleted file mode 100644 index c496913b..00000000 --- a/tests/benchmark/fib.rb +++ /dev/null @@ -1,11 +0,0 @@ -def fib(n) - if n < 2 then - n - else - fib(n - 1) + fib(n - 2) - end -end - -for i in 0...5 - puts fib(28) -end diff --git a/tests/benchmark/fib.wren b/tests/benchmark/fib.wren deleted file mode 100644 index 441a7e69..00000000 --- a/tests/benchmark/fib.wren +++ /dev/null @@ -1,10 +0,0 @@ -class Fib { - static get(n) { - if (n < 2) return n - return get(n - 1) + get(n - 2) - } -} - -for (i in 1..5) { - System.print(Fib.get(28)) -} diff --git a/tests/benchmark/for.dart b/tests/benchmark/for.dart deleted file mode 100644 index 14aadbd4..00000000 --- a/tests/benchmark/for.dart +++ /dev/null @@ -1,10 +0,0 @@ -main() { - var list = []; - - for (var i = 0; i < 1000000; i++) list.add(i); - - var sum = 0; - for (i in list) sum += i; - - print(sum); -} diff --git a/tests/benchmark/for.gw b/tests/benchmark/for.gw deleted file mode 100644 index 6ec6aaa6..00000000 --- a/tests/benchmark/for.gw +++ /dev/null @@ -1,10 +0,0 @@ -int list[0]; - -for (int i; i < 1000000; ++i) - list << i; - -int sum; -for(auto i : list) - i +=> sum; - -<<< sum >>>; diff --git a/tests/benchmark/for.lua b/tests/benchmark/for.lua deleted file mode 100644 index b03654b3..00000000 --- a/tests/benchmark/for.lua +++ /dev/null @@ -1,10 +0,0 @@ -local list = {} -for i = 0, 999999 do - list[i] = i -end - -local sum = 0 -for k, i in pairs(list) do - sum = sum + i -end -io.write(sum .. "\n") diff --git a/tests/benchmark/for.py b/tests/benchmark/for.py deleted file mode 100644 index cf31ddab..00000000 --- a/tests/benchmark/for.py +++ /dev/null @@ -1,16 +0,0 @@ -from __future__ import print_function - -# Map "range" to an efficient range in both Python 2 and 3. -try: - range = xrange -except NameError: - pass - -list = [] -for i in range(0, 1000000): - list.append(i) - -sum = 0 -for i in list: - sum += i -print(sum) diff --git a/tests/benchmark/for.rb b/tests/benchmark/for.rb deleted file mode 100644 index 87b9d79d..00000000 --- a/tests/benchmark/for.rb +++ /dev/null @@ -1,6 +0,0 @@ -list = [] -1000000.times {|i| list << i} - -sum = 0 -list.each {|i| sum += i} -puts sum diff --git a/tests/benchmark/for.wren b/tests/benchmark/for.wren deleted file mode 100644 index ef259783..00000000 --- a/tests/benchmark/for.wren +++ /dev/null @@ -1,8 +0,0 @@ -var list = [] - -for (i in 0...1000000) list.add(i) - -var sum = 0 -for (i in list) sum = sum + i - -System.print(sum) diff --git a/tests/benchmark/method-call.ck b/tests/benchmark/method-call.ck deleted file mode 100644 index 5e09599e..00000000 --- a/tests/benchmark/method-call.ck +++ /dev/null @@ -1,58 +0,0 @@ -class Toggle { - int state; - fun int value() { return state; } - fun Toggle activate() { - !state => state; - return this; - } -} - -class NthToggle extends Toggle { - int count, countMax; - fun Toggle activate() { - if(++count >= countMax) { - (this $ Toggle).activate(); - 0 => count; - } - return this; - } -} - -100000 => int n; - -Toggle toggle; -true => int val => toggle.state; - -repeat(n) { - toggle.activate().value() => val; - toggle.activate().value() => val; - toggle.activate().value() => val; - toggle.activate().value() => val; - toggle.activate().value() => val; - toggle.activate().value() => val; - toggle.activate().value() => val; - toggle.activate().value() => val; - toggle.activate().value() => val; - toggle.activate().value() => val; -} - -<<< toggle.value() >>>; - -NthToggle ntoggle; -true => val => ntoggle.state; -3 => ntoggle.countMax; - -repeat(n) { - ntoggle.activate().value() => val; - ntoggle.activate().value() => val; - ntoggle.activate().value() => val; - ntoggle.activate().value() => val; - ntoggle.activate().value() => val; - ntoggle.activate().value() => val; - ntoggle.activate().value() => val; - ntoggle.activate().value() => val; - ntoggle.activate().value() => val; - ntoggle.activate().value() => val; -} - -<<< ntoggle.value() >>>; diff --git a/tests/benchmark/method-call.dart b/tests/benchmark/method-call.dart deleted file mode 100644 index 540a8266..00000000 --- a/tests/benchmark/method-call.dart +++ /dev/null @@ -1,78 +0,0 @@ -class Toggle { - var _state; - - Toggle(startState) { - _state = startState; - } - - get value => _state; - - activate() { - _state = !_state; - return this; - } -} - -class NthToggle extends Toggle { - var _count; - var _countMax; - - NthToggle(startState, maxCounter) - : super(startState) { - _countMax = maxCounter; - _count = 0; - } - - activate() { - _count = _count + 1; - if (_count >= _countMax) { - super.activate(); - _count = 0; - } - - return this; - } -} - -main() { - Stopwatch watch = new Stopwatch(); - watch.start(); - - var n = 100000; - var val = true; - var toggle = new Toggle(val); - - for (var i = 0; i < n; i++) { - val = toggle.activate().value; - val = toggle.activate().value; - val = toggle.activate().value; - val = toggle.activate().value; - val = toggle.activate().value; - val = toggle.activate().value; - val = toggle.activate().value; - val = toggle.activate().value; - val = toggle.activate().value; - val = toggle.activate().value; - } - - print(toggle.value); - - val = true; - var ntoggle = new NthToggle(val, 3); - - for (var i = 0; i < n; i++) { - val = ntoggle.activate().value; - val = ntoggle.activate().value; - val = ntoggle.activate().value; - val = ntoggle.activate().value; - val = ntoggle.activate().value; - val = ntoggle.activate().value; - val = ntoggle.activate().value; - val = ntoggle.activate().value; - val = ntoggle.activate().value; - val = ntoggle.activate().value; - } - - print(ntoggle.value); - print("elapsed: ${watch.elapsedMilliseconds / 1000}"); -} diff --git a/tests/benchmark/method-call.gw b/tests/benchmark/method-call.gw deleted file mode 100644 index 5a17f900..00000000 --- a/tests/benchmark/method-call.gw +++ /dev/null @@ -1,58 +0,0 @@ -class Toggle { - bool state; - fun bool value() { return state; } - fun Toggle activate() { - !state => state; - return this; - } -} - -class NthToggle extends Toggle { - int count, countMax; - fun Toggle activate() { - if(++count >= countMax) { - (this $ Toggle).activate(); - 0 => count; - } - return this; - } -} - -100000 => int n; - -Toggle toggle; -true => bool val => toggle.state; - -repeat(n) { - toggle.activate().value() => val; - toggle.activate().value() => val; - toggle.activate().value() => val; - toggle.activate().value() => val; - toggle.activate().value() => val; - toggle.activate().value() => val; - toggle.activate().value() => val; - toggle.activate().value() => val; - toggle.activate().value() => val; - toggle.activate().value() => val; -} - -<<< toggle.value() >>>; - -NthToggle ntoggle; -true => val => ntoggle.state; -3 => ntoggle.countMax; - -repeat(n) { - ntoggle.activate().value() => val; - ntoggle.activate().value() => val; - ntoggle.activate().value() => val; - ntoggle.activate().value() => val; - ntoggle.activate().value() => val; - ntoggle.activate().value() => val; - ntoggle.activate().value() => val; - ntoggle.activate().value() => val; - ntoggle.activate().value() => val; - ntoggle.activate().value() => val; -} - -<<< ntoggle.value() >>>; diff --git a/tests/benchmark/method-call.lua b/tests/benchmark/method-call.lua deleted file mode 100644 index 20a6d6ac..00000000 --- a/tests/benchmark/method-call.lua +++ /dev/null @@ -1,92 +0,0 @@ --- $Id: methcall.lua,v 1.2 2004-06-12 16:19:43 bfulgham Exp $ --- http://shootout.alioth.debian.org --- contributed by Roberto Ierusalimschy - --------------------------------------------------------------- --- Toggle class --------------------------------------------------------------- - -Toggle = {} - -function Toggle:value () - return self.state -end - -function Toggle:activate () - self.state = not self.state - return self -end - -function Toggle:new (start_state) - local o = {state = start_state} - self.__index =self - setmetatable(o, self) - return o -end - - --------------------------------------------------------------- --- NthToggle class --------------------------------------------------------------- - -NthToggle = Toggle:new() - -function NthToggle:activate () - self.counter = self.counter + 1 - if self.counter >= self.count_max then - Toggle.activate(self) - self.counter = 0 - end - return self -end - -function NthToggle:new (start_state, max_counter) - local o = Toggle.new(self, start_state) - o.count_max = max_counter - o.counter = 0 - return o -end - - ------------------------------------------------------------ --- main ------------------------------------------------------------ - -function main () - local N = 100000 - - local val = 1 - local toggle = Toggle:new(val) - for i=1,N do - val = toggle:activate():value() - val = toggle:activate():value() - val = toggle:activate():value() - val = toggle:activate():value() - val = toggle:activate():value() - val = toggle:activate():value() - val = toggle:activate():value() - val = toggle:activate():value() - val = toggle:activate():value() - val = toggle:activate():value() - end - print(val and "true" or "false") - - val = 1 - local ntoggle = NthToggle:new(val, 3) - for i=1,N do - val = ntoggle:activate():value() - val = ntoggle:activate():value() - val = ntoggle:activate():value() - val = ntoggle:activate():value() - val = ntoggle:activate():value() - val = ntoggle:activate():value() - val = ntoggle:activate():value() - val = ntoggle:activate():value() - val = ntoggle:activate():value() - val = ntoggle:activate():value() - end - print(val and "true" or "false") -end - -main() - diff --git a/tests/benchmark/method-call.py b/tests/benchmark/method-call.py deleted file mode 100644 index c307a899..00000000 --- a/tests/benchmark/method-call.py +++ /dev/null @@ -1,72 +0,0 @@ -#!/usr/bin/python -# http://www.bagley.org/~doug/shootout/ -from __future__ import print_function - -# Map "range" to an efficient range in both Python 2 and 3. -try: - range = xrange -except NameError: - pass - -class Toggle(object): - def __init__(self, start_state): - self.bool = start_state - def value(self): - return(self.bool) - def activate(self): - self.bool = not self.bool - return(self) - -class NthToggle(Toggle): - def __init__(self, start_state, max_counter): - Toggle.__init__(self, start_state) - self.count_max = max_counter - self.counter = 0 - def activate(self): - self.counter += 1 - if (self.counter >= self.count_max): - super(NthToggle, self).activate() - self.counter = 0 - return(self) - - -def main(): - NUM = 100000 - - val = 1 - toggle = Toggle(val) - for i in range(0,NUM): - val = toggle.activate().value() - val = toggle.activate().value() - val = toggle.activate().value() - val = toggle.activate().value() - val = toggle.activate().value() - val = toggle.activate().value() - val = toggle.activate().value() - val = toggle.activate().value() - val = toggle.activate().value() - val = toggle.activate().value() - if val: - print("true") - else: - print("false") - - val = 1 - ntoggle = NthToggle(val, 3) - for i in range(0,NUM): - val = ntoggle.activate().value() - val = ntoggle.activate().value() - val = ntoggle.activate().value() - val = ntoggle.activate().value() - val = ntoggle.activate().value() - val = ntoggle.activate().value() - val = ntoggle.activate().value() - val = ntoggle.activate().value() - val = ntoggle.activate().value() - val = ntoggle.activate().value() - if val: - print("true") - else: - print("false") - -main() diff --git a/tests/benchmark/method-call.rb b/tests/benchmark/method-call.rb deleted file mode 100644 index 40611589..00000000 --- a/tests/benchmark/method-call.rb +++ /dev/null @@ -1,79 +0,0 @@ -#!/usr/bin/ruby -# -*- mode: ruby -*- -# $Id: methcall.ruby,v 1.1 2004-05-19 18:10:41 bfulgham Exp $ -# http://www.bagley.org/~doug/shootout/ -# with help from Aristarkh Zagorodnikov - -class Toggle - def initialize(start_state) - @bool = start_state - end - - def value - @bool - end - - def activate - @bool = !@bool - self - end -end - -class NthToggle < Toggle - def initialize(start_state, max_counter) - super start_state - @count_max = max_counter - @counter = 0 - end - - def activate - @counter += 1 - if @counter >= @count_max - super - @counter = 0 - end - self - end -end - -def main() - start = Time.now - - n = 100000 - - val = 1 - toggle = Toggle.new(val) - n.times do - val = toggle.activate().value() - val = toggle.activate().value() - val = toggle.activate().value() - val = toggle.activate().value() - val = toggle.activate().value() - val = toggle.activate().value() - val = toggle.activate().value() - val = toggle.activate().value() - val = toggle.activate().value() - val = toggle.activate().value() - end - if val then puts "true" else puts "false" end - - val = 1 - ntoggle = NthToggle.new(val, 3) - n.times do - val = ntoggle.activate().value() - val = ntoggle.activate().value() - val = ntoggle.activate().value() - val = ntoggle.activate().value() - val = ntoggle.activate().value() - val = ntoggle.activate().value() - val = ntoggle.activate().value() - val = ntoggle.activate().value() - val = ntoggle.activate().value() - val = ntoggle.activate().value() - end - if val then puts "true" else puts "false" end - - puts "elapsed: " + (Time.now - start).to_s -end - -main() diff --git a/tests/benchmark/method-call.wren b/tests/benchmark/method-call.wren deleted file mode 100644 index 93367cb7..00000000 --- a/tests/benchmark/method-call.wren +++ /dev/null @@ -1,68 +0,0 @@ -class Toggle { - construct new(startState) { - _state = startState - } - - value { _state } - activate { - _state = !_state - return this - } -} - -class NthToggle is Toggle { - construct new(startState, maxCounter) { - super(startState) - _countMax = maxCounter - _count = 0 - } - - activate { - _count = _count + 1 - if (_count >= _countMax) { - super.activate - _count = 0 - } - - return this - } -} - -var start = System.clock -var n = 100000 -var val = true -var toggle = Toggle.new(val) - -for (i in 0...n) { - val = toggle.activate.value - val = toggle.activate.value - val = toggle.activate.value - val = toggle.activate.value - val = toggle.activate.value - val = toggle.activate.value - val = toggle.activate.value - val = toggle.activate.value - val = toggle.activate.value - val = toggle.activate.value -} - -System.print(toggle.value) - -val = true -var ntoggle = NthToggle.new(val, 3) - -for (i in 0...n) { - val = ntoggle.activate.value - val = ntoggle.activate.value - val = ntoggle.activate.value - val = ntoggle.activate.value - val = ntoggle.activate.value - val = ntoggle.activate.value - val = ntoggle.activate.value - val = ntoggle.activate.value - val = ntoggle.activate.value - val = ntoggle.activate.value -} - -System.print(ntoggle.value) -System.print("elapsed: %(System.clock - start)") diff --git a/tests/benchmark/string-equals.gw b/tests/benchmark/string-equals.gw deleted file mode 100644 index 6dfa7e62..00000000 --- a/tests/benchmark/string-equals.gw +++ /dev/null @@ -1,21 +0,0 @@ -int count; -for (int i; i < 1000000; ++i) { - if ("abc" == "abc") ++count; - if ("a slightly longer string" == - "a slightly longer string") ++count; - if ("a significantly longer string but still not overwhelmingly long string" == - "a significantly longer string but still not overwhelmingly long string") ++count; - - if ("" == "abc") ++count; - if ("abc" == "abcd") ++count; - if ("changed one character" == "changed !ne character") ++count; -#! if ("123" == 123) ++count - if ("a slightly longer string" == - "a slightly longer string!") ++count; - if ("a slightly longer string" == - "a slightly longer strinh") ++count; - if ("a significantly longer string but still not overwhelmingly long string" == - "another") ++count; -} - -<<< count >>>; diff --git a/tests/benchmark/string-equals.py b/tests/benchmark/string-equals.py deleted file mode 100644 index 8829b5c2..00000000 --- a/tests/benchmark/string-equals.py +++ /dev/null @@ -1,35 +0,0 @@ -from __future__ import print_function - -import time -start = time.clock() - -count = 0 -for i in range(0, 1000000): - if "abc" == "abc": - count = count + 1 - if "a slightly longer string" == \ - "a slightly longer string": - count = count + 1 - if "a significantly longer string but still not overwhelmingly long string" == \ - "a significantly longer string but still not overwhelmingly long string": - count = count + 1 - - if "" == "abc": - count = count + 1 - if "abc" == "abcd": - count = count + 1 - if "changed one character" == "changed !ne character": - count = count + 1 - if "123" == 123: count = count + 1 - if "a slightly longer string" == \ - "a slightly longer string!": - count = count + 1 - if "a slightly longer string" == \ - "a slightly longer strinh": - count = count + 1 - if "a significantly longer string but still not overwhelmingly long string" == \ - "another": - count = count + 1 - -print(count) -print("elapsed: " + str(time.clock() - start)) diff --git a/tests/benchmark/string-equals.wren b/tests/benchmark/string-equals.wren deleted file mode 100644 index 0c87bcc2..00000000 --- a/tests/benchmark/string-equals.wren +++ /dev/null @@ -1,24 +0,0 @@ -var start = System.clock - -var count = 0 -for (i in 1..1000000) { - if ("abc" == "abc") count = count + 1 - if ("a slightly longer string" == - "a slightly longer string") count = count + 1 - if ("a significantly longer string but still not overwhelmingly long string" == - "a significantly longer string but still not overwhelmingly long string") count = count + 1 - - if ("" == "abc") count = count + 1 - if ("abc" == "abcd") count = count + 1 - if ("changed one character" == "changed !ne character") count = count + 1 - if ("123" == 123) count = count + 1 - if ("a slightly longer string" == - "a slightly longer string!") count = count + 1 - if ("a slightly longer string" == - "a slightly longer strinh") count = count + 1 - if ("a significantly longer string but still not overwhelmingly long string" == - "another") count = count + 1 -} - -System.print(count) -System.print("elapsed: %(System.clock - start)") -- 2.43.0