424e8a9129 | ||
---|---|---|

enumeration.lua | ||

enumerations.lua | ||

main.lua | ||

readme.md | ||

sequence.lua | ||

twintree.lua |

####
**readme.md**

**readme.md**

This is a little LOVE script for plotting correspondences between dense countable ordered sets. To use: download LOVE2D, then run LOVE in the directory where this repo is saved.

Any two countable dense total orders are order isomorphic. Using only this structure it is possible to explicitly construct an increasing bijection between these two orders.

This implements the standard procedure for doing this in general, the "back-and-forth" method. Pass a function that generates an infinite sequence to the enumerator wrapper ( require 'enumeration' ), then pass the resulting enumerators to twintree.build ( require 'twintree' ).

twintree.build takes a number as its first argument, and the pair of enumerators as its following two arguments. This number is the number of pairs of points in the support of the function (i.e., it's a partial function, only some large but finite number of points will be computed and plotted. The rest will be displayed by linear interpolation.).

twintree.build returns two values, each is a binary tree. twintree.flat does a simultaneous inorder traversal of both trees, then interlaces the entries in a large, reused, 1-indexed Lua table that can be passed to love.graphics.line. Supposing the trees are traversed like { x_1, x_2, x_3, ... x_n } and { y_1, y_2, y_3, ..., y_n }, then the resulting table will be { x_1, y_1, x_2, y_2, x_3, y_3, ..., y_n }.