John Van Enk wrote:
> Hi List,
>
> I recently needed a ring structure (circular list with bi-directional
> access) and didn't see anything obvious on Hackage. I threw something
> together fairly quickly and would like some feedback before tossing it on
> Hackage.
>
> I'd really appreciate if some
On Thu, 2009-12-31 at 04:59 -0500, John Van Enk wrote:
> Hi List,
>
> I recently needed a ring structure (circular list with bi-directional
> access) and didn't see anything obvious on Hackage. I threw something
> together fairly quickly and would like some feedback before tossing it
> on Hackage.
On Thu, Dec 31, 2009 at 5:27 AM, Heinrich Apfelmus
wrote:
> Since the name Ring is already taken by an ubiquitous mathematical
> structure, and thus already in hackage for example as Algebra.Ring in
> the numeric-prelude , I suggest to call the data structure Necklace
> instead.
Is Necklace
Hi Heinrich,
Some comments:
On Thu, Dec 31, 2009 at 6:27 AM, Heinrich Apfelmus <
apfel...@quantentunnel.de> wrote:
> Since the name Ring is already taken by an ubiquitous mathematical
> structure, and thus already in hackage for example as Algebra.Ring in
> the numeric-prelude , I suggest t
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 the data structure. The package will be named data-ring, so that
should hopefully be enough to clue in the user th
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.
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
On Thu, Dec 31, 2009 at 1:13 PM, John Van Enk wrote:
> I've decided to
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 estim
Am Donnerstag 31 Dezember 2009 23:41:13 schrieb David Leimbach:
> I recently needed a ring buffer in haskell, so I did it in C
http://en.wikipedia.org/wiki/Non_sequitur_(logic)
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.or
Hi,
Iavor Diatchki schrieb:
I usually refer to this structure as a RingBuffer.
Really?
According to my understanding, and to wikipedia [1], a ring buffer is a
data structure used to implement O(1) bounded FIFO queues with mutable
arrays.
So in a ring buffer, you have distinct reading and
On Mon, Jan 4, 2010 at 6:51 AM, Maciej Piechotka wrote:
> About comonad - not exactly as every comonad is copointed and the only
> possible way is extract Empty = _|_
I think this module could be cleaned up by disallowing empty lists.
You have this nice semantic property that "every clist has a f
I've heard this a few times and am slowly becoming convinced of it. I'll try
my current use without the Empty and see how it goes.
Given that I've heard this from several places, I'll probably drop Empty.
On Mon, Jan 4, 2010 at 9:17 AM, Luke Palmer wrote:
> On Mon, Jan 4, 2010 at 6:51 AM, Macie
Tom Tobin wrote:
- Heinrich Apfelmus wrote:
Since the name Ring is already taken by an ubiquitous mathematical
structure, and thus already in hackage for example as Algebra.Ring in
the numeric-prelude , I suggest to call the data structure Necklace
instead.
Is Necklace a known name
wren ng thornton schrieb:
Tom Tobin wrote:
- Heinrich Apfelmus wrote:
Since the name Ring is already taken by an ubiquitous mathematical
structure, and thus already in hackage for example as Algebra.Ring in
the numeric-prelude , I suggest to call the data structure Necklace
instead.
One other name I've heard used, pretty much ever since the dos days when the
16 character fixed sized keyboard buffer was the first instance of such a
structure I'd seen, was a 'ring buffer'. Data.RingBuffer perhaps? I agree
that Data.Ring is a terrible name, partially because I already have a
Data
15 matches
Mail list logo
