At the Northeastern PLT lunch today, I proposed adding a top-level
`data' collection, for all manner of data structures. People here
thought it was a good idea, so I'm proposing it to the whole group.
Definitely candidates:
Hari Prashanth's functional data structure library (which he's been
work
+1
I assume some kind of unifying API will be created. Bonus points if it
is done/available in Typed Scheme.
N.
_
For list-related administrative tasks:
http://lists.racket-lang.org/listinfo/dev
On Jun 23, 2010, at 2:29 PM, Sam Tobin-Hochstadt wrote:
Thoughts?
The idea is great. Make sure to watch 'distribution' constraints. --
Matthias
_
For list-related administrative tasks:
http://lists.racket-lang.org/listinfo/dev
On Jun 23, Sam Tobin-Hochstadt wrote:
> At the Northeastern PLT lunch today, I proposed adding a top-level
> `data' collection, for all manner of data structures. People here
> thought it was a good idea, so I'm proposing it to the whole group.
(The name sounds iffy to me.)
> Definitely candida
On Wed, Jun 23, 2010 at 5:31 PM, Eli Barzilay wrote:
> On Jun 23, Sam Tobin-Hochstadt wrote:
>> At the Northeastern PLT lunch today, I proposed adding a top-level
>> `data' collection, for all manner of data structures. People here
>> thought it was a good idea, so I'm proposing it to the whole g
On Wed, Jun 23, 2010 at 4:14 PM, wrote:
> 3f36d05 Eli Barzilay 2010-06-23 16:10
> :
> | Turn contracts on `enqueue!' and `dequeue!' into the usual error checks.
> |
> | On a simple benchmark of:
> |
> | (let ([N 10]
> | [M 20]
> | [q (make-queue)])
> | (time (for ([i (i
6 matches
Mail list logo
