{"@context":"https://w3id.org/codemeta/3.0","@type":"SoftwareSourceCode","identifier":"pkg:hackage/split","name":"split","description":"A collection of various methods for splitting\nlists into parts, akin to the \"split\" function\nfound in several mainstream languages. Here is\nits tale:\n\nOnce upon a time the standard Data.List module\nheld no function for splitting a list into parts\naccording to a delimiter.  Many a brave\nlambda-knight strove to add such a function, but\ntheir striving was in vain, for Lo, the Supreme\nCouncil fell to bickering amongst themselves what\nwas to be the essential nature of the One True\nFunction which could cleave a list in twain (or\nthrain, or any required number of parts).\n\nAnd thus came to pass the split package,\ncomprising divers functions for splitting a list\nasunder, each according to its nature.  And the\nSupreme Council had no longer any grounds for\nargument, for the favored method of each was\ncontained therein.\n\nTo get started, see the Data.List.Split module.","version":"0.2.5","softwareVersion":"0.2.5","license":"https://spdx.org/licenses/BSD-3-Clause","keywords":["bsd3","library","list","Propose Tags"],"maintainer":[{"@type":"Person","name":"BrentYorgey"}],"author":[{"@type":"Person","name":"BrentYorgey"}],"copyrightHolder":[{"@type":"Person","name":"BrentYorgey"}],"dateCreated":"2008-12-21","dateModified":"2024-01-11","datePublished":"2024-01-11","copyrightYear":2008,"downloadUrl":"https://hackage.haskell.org/package/split-0.2.5/split-0.2.5.tar.gz","applicationCategory":"hackage","runtimePlatform":"hackage","sameAs":["https://hackage.haskell.org/package/split"]}