{"@context":"https://w3id.org/codemeta/3.0","@type":"SoftwareSourceCode","identifier":"pkg:hackage/bit-stream","name":"bit-stream","description":"\n\n[Index] [Quick Jump]\n\nPackage maintainers\n\nFor package maintainers and hackage trustees\n\nCandidates\n\n\n\nLazy, infinite, compact stream of Bool with O(1) indexing.\nMost useful for memoization of predicates.\n\nConsider following predicate:\n\nIts computation is expensive, so we'd like to memoize its values into\nBitStream using tabulate and access this stream via index\ninstead of recalculation of isOdd:\n\nWe can do even better by replacing part of recursive calls to isOdd\nby indexing memoized values. Write isOddF\nsuch that isOdd = fix isOddF:\n\nand use tabulateFix:\n\nDefine a predicate, which checks whether its argument is\na prime number by trial division.\n\nConvert it to unfixed form:\n\nCreate its memoized version for faster evaluation:","version":"0.1.0.2","softwareVersion":"0.1.0.2","license":"https://spdx.org/licenses/BSD-3-Clause","codeRepository":"https://github.com/Bodigrim/bit-stream","issueTracker":"https://github.com/Bodigrim/chimera/issues","url":"https://github.com/Bodigrim/bit-stream#readme","keywords":["bsd3","deprecated","library","unclassified","Propose Tags"],"programmingLanguage":{"@type":"ComputerLanguage","name":"Haskell"},"maintainer":[{"@type":"Person","name":"Bodigrim"}],"author":[{"@type":"Person","name":"Bodigrim"}],"copyrightHolder":[{"@type":"Person","name":"Bodigrim"}],"dateCreated":"2017-07-15","dateModified":"2017-08-08","datePublished":"2017-08-08","copyrightYear":2017,"downloadUrl":"https://hackage.haskell.org/package/bit-stream-0.1.0.2/bit-stream-0.1.0.2.tar.gz","applicationCategory":"hackage","runtimePlatform":"hackage","developmentStatus":"active","sameAs":["https://hackage.haskell.org/package/bit-stream"],"https://www.w3.org/ns/activitystreams#likes":60,"https://forgefed.org/ns#forks":6}