| … | |
… | |
| 8 | - faster and vastly simpler vector memory management (execution speed |
8 | - faster and vastly simpler vector memory management (execution speed |
| 9 | is roughly twice faster than tinyscheme when optimised for size, and 2.5 |
9 | is roughly twice faster than tinyscheme when optimised for size, and 2.5 |
| 10 | times faster when optimised for speed). |
10 | times faster when optimised for speed). |
| 11 | - no need for consecutive cells |
11 | - no need for consecutive cells |
| 12 | - more compact and faster vectors. |
12 | - more compact and faster vectors. |
| 13 | - resizable vectors (TODO) |
13 | - resizable vectors (not exposed yet) |
|
|
14 | - faster environment implementation, not hashed by name but by symbol address. |
| 14 | - simpler cell memory management, only one block |
15 | - simpler cell memory management, only one block |
| 15 | - much faster call stack implementation, fully supporting continuations, |
16 | - much faster call stack implementation, fully supporting continuations, |
| 16 | while greatly reducing cell thrashing, thus fewer gc's and overall |
17 | while greatly reducing cell thrashing, thus fewer gc's and overall |
| 17 | much faster execution. |
18 | much faster execution. |
| 18 | - allow full 32 bit size range for strings and vectors. |
19 | - allow full 32 bit size range for strings and vectors. |
