{"@context":"https://w3id.org/codemeta/3.0","@type":"SoftwareSourceCode","identifier":"pkg:hackage/LinearSplit","name":"LinearSplit","description":"The LinearSplit module implements partitioning the sequence of items to the\nsubsequences in the order given. The items can be splitted using greedy\nheuristic or using the linear partition algorithm to minimize the maximum cost\nover all ranges (see the 'The Algorithm Design Manual' by Steven S. Skiena..).\n\nThe library can be used to balance the work across processors to minimize the run time.\nFor the library usage take a look in examples/Splitter.hs.","version":"0.2.1","softwareVersion":"0.2.1","license":"https://spdx.org/licenses/BSD-3-Clause","codeRepository":"https://github.com/rukav/LinearSplit","issueTracker":"https://github.com/rukav/LinearSplit/issues","url":"http://github.com/rukav/LinearSplit","keywords":["algorithms","bsd3","library","Propose Tags"],"programmingLanguage":{"@type":"ComputerLanguage","name":"Haskell"},"maintainer":[{"@type":"Person","name":"VitaliyRukavishnikov"}],"author":[{"@type":"Person","name":"VitaliyRukavishnikov"}],"copyrightHolder":[{"@type":"Person","name":"VitaliyRukavishnikov"}],"dateCreated":"2011-02-17","dateModified":"2011-03-05","datePublished":"2011-03-05","copyrightYear":2011,"downloadUrl":"https://hackage.haskell.org/package/LinearSplit-0.2.1/LinearSplit-0.2.1.tar.gz","applicationCategory":"hackage","runtimePlatform":"hackage","developmentStatus":"active","sameAs":["https://hackage.haskell.org/package/LinearSplit"],"https://www.w3.org/ns/activitystreams#likes":1}