On Sun, Oct 9, 2011 at 6:18 AM, Ryan Newton wrote:
>
> Yep, it is simple. But I prefer to only use well-tested data structure
> libraries where I can! Here's an example simple implementation (partial --
> missing some common functions):
>
>
> module Data.BitList
> ( BitList
> , cons, head,
On Sun, Oct 9, 2011 at 12:11 PM, Roman Beslik wrote:
> Yes, if you do not use high-level concepts and optimize everything by hand,
> it requires a lot of testing. :)
>
There are probably more constructive, jibe-free ways to frame this
suggestion...
Regarding testing: my preference for using a
> data *(Bits b) =>* BitList b
Is deprecated and soon to be removed from the language.
I fail to understand. Why not just:
> data BitList b = Nil | BitList Int b (BitList b)
??
2011/10/9 Roman Beslik
> I am not aware of such a library, but IMHO this code will be very simple.
> > data Bits b =>
Must it be a list?
What about a Bloom Filter?
On Sun, Oct 9, 2011 at 9:11 AM, Roman Beslik wrote:
> Yes, if you do not use high-level concepts and optimize everything by hand,
> it requires a lot of testing. :)
>
> ___
> Haskell-Cafe mailing list
> Has
Yes, if you do not use high-level concepts and optimize everything by
hand, it requires a lot of testing. :)
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 9 October 2011 14:54, Joachim Breitner wrote:
> Hi,
>
> Am Freitag, den 07.10.2011, 10:52 -0400 schrieb Ryan Newton:
>> What about just using the Data.Bits instance of Integer? Well,
>> presently, the setBit instance for very large integers creates a whole
>> new integer, shifts, and xors:
>>
On Sunday 09 October 2011, 15:54:14, Joachim Breitner wrote:
> Hi,
>
> Am Freitag, den 07.10.2011, 10:52 -0400 schrieb Ryan Newton:
> > What about just using the Data.Bits instance of Integer? Well,
> > presently, the setBit instance for very large integers creates a whole
> > new integer, shifts
Hi,
Am Freitag, den 07.10.2011, 10:52 -0400 schrieb Ryan Newton:
> What about just using the Data.Bits instance of Integer? Well,
> presently, the setBit instance for very large integers creates a whole
> new integer, shifts, and xors:
>
> http://haskell.org/ghc/docs/latest/html/libraries/base/s
Yep, it is simple. But I prefer to only use well-tested data structure
libraries where I can! Here's an example simple implementation (partial --
missing some common functions):
module Data.BitList
( BitList
, cons, head, tail, empty
, pack, unpack, length, drop
)
where
import Data.Int
I am not aware of such a library, but IMHO this code will be very simple.
> data Bits b => BitList b = BitList Int {- number of used bits in the
next component -} b [b]
Write an isomorphism between @BitList b@ and @ListStep (BitList b)@
where
> data ListStep e rc = Nil | Cons e rc
On 07.10.11 1
Hi Cafe,
We are lucky to have a plethora of data structures out there. But it does
make choosing one off hackage difficult at times. In this case I'm *not*
looking for a O(1) access bit vector (Data.Vector.Unboxed seems to be the
choice there), but an efficient representation for a list of bits
11 matches
Mail list logo