{"@context":"https://w3id.org/codemeta/3.0","@type":"SoftwareSourceCode","identifier":"pkg:hackage/compact-list","name":"compact-list","description":"If you hold on to a large data structure in garbage collected (GC) memory\nfor relatively longer times it puts undue pressure on GC, unnecessarily\nincreasing the work done by GC and also increasing the duration of GC\npauses. A CompactList allows you to keep a large list in a Compact Region\nnot touched by GC, thus avoiding any GC overhead.  This is essentially like\na convenient in-memory append only file where you can write a list of\nHaskell values without having to marshall or serialize them.","version":"0.1.0","softwareVersion":"0.1.0","license":"https://spdx.org/licenses/BSD-3-Clause","codeRepository":"https://github.com/composewell/compact-list","issueTracker":"https://github.com/composewell/compact-list/issues","url":"https://github.com/composewell/compact-list","keywords":["bsd3","data","library","Propose Tags"],"programmingLanguage":{"@type":"ComputerLanguage","name":"Haskell"},"maintainer":[{"@type":"Person","name":"harendra"}],"author":[{"@type":"Person","name":"harendra"}],"copyrightHolder":[{"@type":"Person","name":"harendra"}],"dateCreated":"2018-09-06","dateModified":"2018-09-06","datePublished":"2018-09-06","copyrightYear":2018,"downloadUrl":"https://hackage.haskell.org/package/compact-list-0.1.0/compact-list-0.1.0.tar.gz","applicationCategory":"hackage","runtimePlatform":"hackage","developmentStatus":"active","sameAs":["https://hackage.haskell.org/package/compact-list"],"https://www.w3.org/ns/activitystreams#likes":25,"https://forgefed.org/ns#forks":1}