This is a tangent on your conversation, but... Alex, that graph looks so cool. Did you do it by hand or did you use some juicy picolisp program that I can get my hands on?
On Wed, Dec 28, 2016 at 5:45 AM, Alexander Burger <a...@software-lab.de> wrote: > On Wed, Dec 28, 2016 at 10:26:22AM +0100, Alexander Burger wrote: > > (let Today (date) > > (collect 'sDate '+Proj (list Today Today) (list NIL T)) ) > > The 'list' is of course not necessary: > > (collect 'sDate '+Proj (list Today Today) '(NIL T)) > > > But probably it is better anyway to scan both index parts in the same > direction > (upwards). > > Also, if I remember correctly, 'T' cannot be used for "infinite" here, the > value > for +UB trees must be a number or NIL (same as 0). So you can just use a > number > greater than any possible date, like (date 999999) -> (2738 1 25) > > (collect 'sDate '+Proj (list NIL Today) (list Today 99999)) > > Sorry, nothing tested ;) > > - Alex > -- > UNSUBSCRIBE: mailto:firstname.lastname@example.org?subject=Unsubscribe >