[Openmcl-devel] Bug bounty

[Ron Garret]

Yes, I know about FSet.  FSet is cool because it’s purely functional, but that is not what I need.  I need an interval tree that is efficient, i.e. that has O(log(n)) insertion, search, and deletion.

On Oct 27, 2018, at 3:52 AM, Camille Troillard <camille.troillard at icloud.com> wrote:

> Hi Ron,
> 
> Scott Burson’s FSet library [1] has an interval-set collection which pretty good. I’m not sure if that fits your requirement though. 
> 
> Cam
> 
> [1] https://github.com/slburson/fset/blob/master/Code/interval.lisp
> 
> 
> On 26 Oct 2018, at 17:46, Ron Garret <ron at flownet.com> wrote:
> 
>> This is not a CCL bug, but all the cool kids seem to hang out here so...
>> 
>> I hereby offer a $500 bug bounty to the first person to publish a fix for this issue:
>> 
>> https://github.com/rpav/cl-interval/issues/5
>> 
>> This offer expires on Friday, Nov 9, 2018.  That’s not a hard deadline — if you need more time I can accommodate you.  I just don’t want someone trying to claim the bounty a year from now.  Also, I will need your SSN or TIN so I can send you a 1099.
>> 
>> If you want to take this on, contact me off-list for some additional info and test cases to help you get started.
>> 
>> rg
>> 
>> _______________________________________________
>> Openmcl-devel mailing list
>> Openmcl-devel at clozure.com
>> https://lists.clozure.com/mailman/listinfo/openmcl-devel

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://lists.clozure.com/pipermail/openmcl-devel/attachments/20181027/536eef04/attachment.htm>