{"@context":"https://w3id.org/codemeta/3.0","@type":"SoftwareSourceCode","identifier":"pkg:hackage/skip-list","name":"skip-list","description":"Skip lists provide efficient amortized indexing deep into lists by building an index that, essentially, converts the list into a balance binary tree. See the wikipedia entry on skip lists for more information.","version":"0.1.0.1","softwareVersion":"0.1.0.1","license":"https://spdx.org/licenses/MIT","codeRepository":"https://github.com/gmalecha/skip-list","issueTracker":"https://github.com/gmalecha/skip-list/issues","url":"https://github.com/gmalecha/skip-list#readme","keywords":["data","library","mit","Propose Tags"],"programmingLanguage":{"@type":"ComputerLanguage","name":"Haskell"},"maintainer":[{"@type":"Person","name":"gmalecha"}],"author":[{"@type":"Person","name":"gmalecha"}],"copyrightHolder":[{"@type":"Person","name":"gmalecha"}],"dateCreated":"2017-07-22","dateModified":"2017-07-22","datePublished":"2017-07-22","copyrightYear":2017,"downloadUrl":"https://hackage.haskell.org/package/skip-list-0.1.0.1/skip-list-0.1.0.1.tar.gz","applicationCategory":"hackage","runtimePlatform":"hackage","developmentStatus":"active","sameAs":["https://hackage.haskell.org/package/skip-list"],"https://www.w3.org/ns/activitystreams#likes":9}