Re: [Haskell-cafe] Re: Data.Ring -- Pre-announce

I recently needed a ring buffer in haskell, so I did it in C and used the FFI :-) This is much nicer. Dave On Thu, Dec 31, 2009 at 2:37 PM, Iavor Diatchki wrote:

Hi, I usually refer to this structure as a RingBuffer, just an idea. If you have the time, I would add rough complexity estimates to the documentation for the different functions. Thanks for your work! Happy new year, Iavor

...

I've decided to settle on Data.CircularList. The renamed git repository is here:

http://github.com/sw17ch/data-clist

On Thu, Dec 31, 2009 at 3:29 PM, Twan van Laarhoven wrote:

...

John Van Enk wrote:

...

Hi Heinrich,

I think I like Ring more than Necklace or Tom's suggestion of Circular.

I

...

...

chose Ring simply because that's what I was searching for when I wanted

On Thu, Dec 31, 2009 at 1:13 PM, John Van Enk wrote: the

...

...

...

data structure. The package will be named data-ring, so that should hopefully be enough to clue in the user that it's not dealing with the mathematical concept.

The mathematical concept would likely also go in Data, unfortunately. See for example Data.Monoid. If someone does at a Ring class sometime, it is very likely to go into Data.Ring, which would lead to conflicts. In fact it already exists, see the "monoids" package [1]

I would prefer the name RingList or CircularList. As long as you put the word "ring" in the package description users will still find it when searching on hackage.

[1]

http://hackage.haskell.org/packages/archive/monoids/0.1.25/doc/html/Data-Rin...

...

Twan

_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe