NoneeA delimiter is a list of predicates on elements, matched by some contiguous subsequence of a list. Try to match a delimiter at the start of a list, either failing or decomposing the list into the portion which matched the delimiter and the remainder.VSplit on the given sublist. Equivalent to split . dropDelims . onSublist. For example::splitOn (BV.fromList "..") (BV.fromList "a..b...c....d..")["a","b",".c","","d",""]BIn some parsing combinator frameworks this is also known as sepBy.XNote that this is the right inverse of the intercalate function from Data.List, that is, -> \xs -> (intercalate xs . splitOn xs) === idsplitOn x . intercalate x is the identity on certain lists, but it is tricky to state the precise conditions under which this holds. (For example, it is not enough to say that x does not occur in any elements of the input list. Working out why is left as an exercise for the reader.)ZSplit on any of the given elements. Equivalent to split . dropDelims . oneOf. For example:@splitOneOf (BV.fromList ";.,") (BV.fromList "foo,bar;baz.glurk")["foo","bar","baz","glurk"]jSplit on elements satisfying the given predicate. Equivalent to split . dropDelims . whenElt. For example:0splitWhen (<0) (BV.fromList [1,3,-4,5,7,-9,0,2])[[1,3],[5,7],[0,2]]Split into chunks terminated by the given subsequence. Equivalent to split . dropFinalBlank . dropDelims . onSublist. For example:4endBy (BV.fromList ";") (BV.fromList "foo;bar;baz;")["foo","bar","baz"]LNote also that the lines function from Data.List is equivalent to endBy "n".A splitting strategy that splits on any one of the given elements. For example: >>> split (oneOf (BV.fromList "xyz")) (BV.fromList "aazbxyzcxd") ["aa","z","b","x","","y","","z","c","x","d"]Split into chunks terminated by one of the given elements. Equivalent to split . dropFinalBlank . dropDelims . oneOf. For example::endByOneOf (BV.fromList ";,") (BV.fromList "foo;bar,baz;")["foo","bar","baz"]Split into "words", with word boundaries indicated by the given predicate. Satisfies words === wordsBy isSpace; equivalent to split . dropBlanks . dropDelims . whenElt. For example:0wordsBy (=='x') (BV.fromList "dogxxxcatxbirdxx")["dog","cat","bird"] jSplit into "lines", with line boundaries indicated by the given predicate. Satisfies lines === linesBy (=='\n'L); equivalent to split . dropFinalBlank . dropDelims . whenElt. For example:0linesBy (=='x') (BV.fromList "dogxxxcatxbirdxx")["dog","","","cat","bird",""] qA splitting strategy that splits on the given list, when it is encountered as an exact subsequence. For example:@split (onSublist (BV.fromList "xyz")) (BV.fromList "aazbxyzcxd")["aazb","xyz","cxd"]8Note that splitting on the empty list is not allowed in `vector-split`&. This is a major difference between  and `vector-split`!. In any case nobody should use `vector-split` to do this anyway. _A splitting strategy that splits on any elements that satisfy the given predicate. For example:2split (whenElt (<0)) (BV.fromList [2,4,-3,6,-9,1])[[2,4],[-3],[6],[-9],[1]] KDrop delimiters from the output (the default is to keep them). For example,5split (oneOf (BV.fromList ":")) (BV.fromList "a:b:c")["a",":","b",":","c"]Bsplit (dropDelims . oneOf (BV.fromList ":")) (BV.fromList "a:b:c") ["a","b","c"] QKeep delimiters in the output by prepending them to adjacent chunks. For example:Jsplit (keepDelimsL . oneOf (BV.fromList "xyz")) (BV.fromList "aazbxyzcxd")["aa","zb","x","y","zc","xd"]PKeep delimiters in the output by appending them to adjacent chunks. For example:Jsplit (keepDelimsR . oneOf (BV.fromList "xyz")) (BV.fromList "aazbxyzcxd")["aaz","bx","y","z","cx","d"]?Condense multiple consecutive delimiters into one. For example:Gsplit (condense . oneOf (BV.fromList "xyz")) (BV.fromList "aazbxyzcxd") ["aa","z","b","xyz","c","x","d"]Isplit (dropDelims . oneOf (BV.fromList "xyz")) (BV.fromList "aazbxyzcxd")["aa","b","","","c","d"]Tsplit (condense . dropDelims . oneOf (BV.fromList "xyz")) (BV.fromList "aazbxyzcxd")["aa","b","c","d"]MFIXME this function is not fully compatible with the Data.List.Split version.SDon't generate a blank chunk if there is a delimiter at the beginning. For example:4split (oneOf (BV.fromList ":")) (BV.fromList ":a:b")["",":","a",":","b"]Dsplit (dropInitBlank . oneOf (BV.fromList ":")) (BV.fromList ":a:b")[":","a",":","b"]MDon't generate a blank chunk if there is a delimiter at the end. For example:split (oneOf (BV.fromList ":")) (BV.fromList "a:b:") ["a",":","b",":",""] split (dropFinalBlank . oneOf (BV.fromList ":")) (BV.fromList "a:b:") ["a",":","b",":"]HDon't generate blank chunks between consecutive delimiters. For example:7split (oneOf (BV.fromList ":")) (BV.fromList "::b:::a"))["",":","",":","b",":","",":","",":","a"]Isplit (dropInnerBlanks . oneOf (BV.fromList ":")) (BV.fromList "::b:::a") ["",":",":","b",":",":",":","a"]Drop all blank chunks from the output, and condense consecutive delimiters into one. Equivalent to dropInitBlank . dropFinalBlank . condense. For example:7split (oneOf (BV.fromList ":")) (BV.fromList "::b:::a"))["",":","",":","b",":","",":","",":","a"]Dsplit (dropBlanks . oneOf (BV.fromList ":")) (BV.fromList "::b:::a")["::","b",":::","a"]Make a strategy that splits a list into chunks that all start with the given subsequence (except possibly the first). Equivalent to dropInitBlank . keepDelimsL . onSublist. For example:[split (startsWith (BV.fromList "app")) (BV.fromList "applyapplicativeapplaudapproachapple")4["apply","applicative","applaud","approach","apple"]Make a strategy that splits a list into chunks that all start with one of the given elements (except possibly the first). Equivalent to dropInitBlank . keepDelimsL . oneOf. For example:Usplit (startsWithOneOf (BV.fromList ['A'..'Z'])) (BV.fromList "ACamelCaseIdentifier")!["A","Camel","Case","Identifier"]Make a strategy that splits a list into chunks that all end with the given subsequence, except possibly the last. Equivalent to dropFinalBlank . keepDelimsR . onSublist. For example:Ksplit (endsWith (BV.fromList "ly")) (BV.fromList "happilyslowlygnarlylily")$["happily","slowly","gnarly","lily"]Make a strategy that splits a list into chunks that all end with one of the given elements, except possibly the last. Equivalent to dropFinalBlank . keepDelimsR . oneOf. For example:_split (condense . endsWithOneOf (BV.fromList ".,?! ")) (BV.fromList "Hi, there! How are you?")(["Hi, ","there! ","How ","are ","you?"]!!"#$% & '  !"#$% & 'None nM splits a vector into length-n pieces. The last piece will be shorter if n9 does not evenly divide the length of the vector. If n <= 0,  n l< returns an infinite list of empty vectors. For example: Note that  n [] is [], not [[]]O. This is intentional, and is consistent with a recursive definition of  ; it satisfies the property that 7chunksOf n xs ++ chunksOf n ys == chunksOf n (xs ++ ys) whenever n evenly divides the length of xs.=Split a vector into chunks of the given lengths. For example: splitPlaces [2,3,4] [1..20] == [[1,2],[3,4,5],[6,7,8,9]] splitPlaces [4,9] [1..10] == [[1,2,3,4],[5,6,7,8,9,10]] splitPlaces [4,9,3] [1..10] == [[1,2,3,4],[5,6,7,8,9,10]] If the input vector is longer than the total of the given lengths, then the remaining elements are dropped. If the vector is shorter than the total of the given lengths, then the result may contain fewer chunks than requested, and the last chunk may be shorter than requested.;Split a vector into chunks of the given lengths. Unlike Y, the output list will always be the same length as the first input argument. If the input vector is longer than the total of the given lengths, then the remaining elements are dropped. If the vector is shorter than the total of the given lengths, then the last several chunks will be shorter than requested or empty. For example: splitPlacesBlanks [2,3,4] [1..20] == [[1,2],[3,4,5],[6,7,8,9]] splitPlacesBlanks [4,9] [1..10] == [[1,2,3,4],[5,6,7,8,9,10]] splitPlacesBlanks [4,9,3] [1..10] == [[1,2,3,4],[5,6,7,8,9,10],[]]`Notice the empty list in the output of the third example, which differs from the behavior of .A useful recursion pattern for processing a list to produce a new list, often used for "chopping" up the input list. Typically chop is called with some function that will consume an initial prefix of the list and produce a value and the rest of the list.MFor example, many common Prelude functions can be implemented in terms of chop: group :: (Eq a) => [a] -> [[a]] group = chop (\ xs@(x:_) -> span (==x) xs) words :: String -> [String] words = filter (not . null) . chop (span (not . isSpace) . dropWhile isSpace)BDivides up an input vector into a set of subvectors, according to n and m? input specifications you provide. Each subvector will have n= items, and the start of each subvector will be offset by m items from the previous one. Qdivvy 5 5 [1..20] == [[1,2,3,4,5],[6,7,8,9,10],[11,12,13,14,15],[16,17,18,19,20]]In the case where a source vector's trailing elements do no fill an entire subvector, those trailing elements will be dropped. :divvy 5 2 [1..10] == [[1,2,3,4,5],[3,4,5,6,7],[5,6,7,8,9]]IAs an example, you can generate a moving average over a vector of prices: type Prices = [Float] type AveragePrices = [Float] average :: [Float] -> Float average xs = sum xs / (fromIntegral $ length xs) simpleMovingAverage :: Prices -> AveragePrices simpleMovingAverage priceList = map average divvyedPrices where divvyedPrices = divvy 20 1 priceList (      !"#$%&'"()*+vector-split-1.0.0.2-HIaPYIFdDwVHLX09v1QQheData.Vector.Split.InternalData.Vector.SplitSplittersplitsplitOn splitOneOf splitWhenendByoneOf endByOneOfwordsBylinesBy onSublistwhenElt dropDelims keepDelimsL keepDelimsRcondense dropInitBlankdropFinalBlankdropInnerBlanks dropBlanks startsWithstartsWithOneOfendsWith endsWithOneOf $fShowChunk $fEqChunkchunksOf splitPlacessplitPlacesBlankschopdivvy Delimiter matchDelim SplitListChunkDelimText toSplitListdropInnerBlanksGo