chimera

Lazy, infinite streams with O(1) indexing. https://github.com/Bodigrim/chimera#readme

 LTS Haskell 14.10: 0.2.0.0@rev:1 Stackage Nightly 2019-10-15: 0.2.0.0@rev:1 Latest on Hackage: 0.2.0.0@rev:1

See all snapshots chimera appears in

Module documentation for 0.2.0.0

This version can be pinned in stack with:chimera-0.2.0.0@sha256:cd7fdf4a0167389432d1e3753f907f641922487d7e8180b51c5b873e34bb3009,1677

chimera

Lazy, infinite streams with O(1) indexing. Most useful to memoize functions.

Example 1

Consider following predicate:

isOdd :: Word -> Bool
isOdd 0 = False
isOdd n = not (isOdd (n - 1))

Its computation is expensive, so we’d like to memoize its values into Chimera using tabulate and access this stream via index instead of recalculation of isOdd:

isOddBS :: Chimera
isOddBS = tabulate isOdd

isOdd' :: Word -> Bool
isOdd' = index isOddBS

We can do even better by replacing part of recursive calls to isOdd by indexing memoized values. Write isOddF such that isOdd = fix isOddF:

isOddF :: (Word -> Bool) -> Word -> Bool
isOddF _ 0 = False
isOddF f n = not (f (n - 1))

and use tabulateFix:

isOddBS :: Chimera
isOddBS = tabulateFix isOddF

isOdd' :: Word -> Bool
isOdd' = index isOddBS

Example 2

Define a predicate, which checks whether its argument is a prime number by trial division.

isPrime :: Word -> Bool
isPrime n
| n < 2     = False
| n < 4     = True
| even n    = False
| otherwise = and [ n `rem` d /= 0 | d <- [3, 5 .. ceiling (sqrt (fromIntegral n))], isPrime d]

Convert it to unfixed form:

isPrimeF :: (Word -> Bool) -> Word -> Bool
isPrimeF f n
| n < 2     = False
| n < 4     = True
| even n    = False
| otherwise = and [ n `rem` d /= 0 | d <- [3, 5 .. ceiling (sqrt (fromIntegral n))], f d]

Create its memoized version for faster evaluation:

isPrimeBS :: Chimera
isPrimeBS = tabulateFix isPrimeF

isPrime' :: Word -> Bool
isPrime' = index isPrimeBS
Depends on 4 packages(full list with versions):
Used by 1 package in lts-14.8(full list with versions):