blocks|key|790290|text|为此，有一个名为split的包。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|790291|cabal+install+split|code-block|syntax|javascript|790292|像这样使用它：|790293|ghci>+import+Data.List.Split
ghci>+splitOn+","+"my,comma,separated,list"
["my","comma","separated","list"]|790294|它附带了许多其他函数，用于在匹配分隔符或具有多个分隔符时进行拆分。|790295|entityMap|0|LINK|mutability|MUTABLE|url|https://hackage.haskell.org/package/split/docs/Data-List-Split.html^0|8|5|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@$A|X|B|Y|1|Z]]|C|$]]|$1|D|3|E|5|F|7|10|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|6|7|11|8|@]|9|@]|C|$]]|$1|K|3|L|5|F|7|12|8|@]|9|@]|C|$G|H]]|$1|M|3|N|5|6|7|13|8|@]|9|@]|C|$]]|$1|O|3|-4|5|6|7|14|8|@]|9|@]|C|$]]]|P|$Q|$5|R|S|T|C|$U|V]]]]

There is a package for this called <a href="https://hackage.haskell.org/package/split/docs/Data-List-Split.html" rel="noreferrer">split</a>.

<pre><code>cabal install split
</code></pre>

Use it like this:

<pre><code>ghci&gt; import Data.List.Split
ghci&gt; splitOn "," "my,comma,separated,list"
["my","comma","separated","list"]
</code></pre>

It comes with a lot of other functions for splitting on matching delimiters or having several delimiters.

blocks|key|790475|text|请记住，您可以查看前置函数的定义！|type|unstyled|depth|inlineStyleRanges|entityRanges|data|790476|http://www.haskell.org/onlinereport/standard-prelude.html|offset|length|790477|看这里，words的定义是，|style|CODE|790478|words+++::+String+->+[String]
words+s+=++case+dropWhile+Char.isSpace+s+of
++++++++++++++++++++++""+->+[]
++++++++++++++++++++++s'+->+w+:+words+s''
++++++++++++++++++++++++++++where+(w,+s'')+=+break+Char.isSpace+s'|code-block|syntax|javascript|790479|因此，将其更改为接受谓词的函数：|790480|wordsWhen+++++::+(Char+->+Bool)+->+String+->+[String]
wordsWhen+p+s+=++case+dropWhile+p+s+of
++++++++++++++++++++++""+->+[]
++++++++++++++++++++++s'+->+w+:+wordsWhen+p+s''
++++++++++++++++++++++++++++where+(w,+s'')+=+break+p+s'|790481|然后用你想要的任何谓词来调用它！|790482|main+=+print+$+wordsWhen+(==',')+"break,this,string,at,commas"|790483|entityMap|0|LINK|mutability|MUTABLE|url^0|0|0|1L|0|0|4|5|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|13|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|14|8|@]|9|@$D|15|E|16|1|17]]|A|$]]|$1|F|3|G|5|6|7|18|8|@$D|19|E|1A|H|I]]|9|@]|A|$]]|$1|J|3|K|5|L|7|1B|8|@]|9|@]|A|$M|N]]|$1|O|3|P|5|6|7|1C|8|@]|9|@]|A|$]]|$1|Q|3|R|5|L|7|1D|8|@]|9|@]|A|$M|N]]|$1|S|3|T|5|6|7|1E|8|@]|9|@]|A|$]]|$1|U|3|V|5|L|7|1F|8|@]|9|@]|A|$M|N]]|$1|W|3|-4|5|6|7|1G|8|@]|9|@]|A|$]]]|X|$Y|$5|Z|10|11|A|$12|C]]]]

Remember that you can look up the definition of Prelude functions!

<a href="http://www.haskell.org/onlinereport/standard-prelude.html" rel="noreferrer">http://www.haskell.org/onlinereport/standard-prelude.html</a>

Looking there, the definition of <code>words</code> is,

<pre><code>words :: String -&gt; [String]
words s = case dropWhile Char.isSpace s of
 "" -&gt; []
 s' -&gt; w : words s''
 where (w, s'') = break Char.isSpace s'
</code></pre>

So, change it for a function that takes a predicate:

<pre><code>wordsWhen :: (Char -&gt; Bool) -&gt; String -&gt; [String]
wordsWhen p s = case dropWhile p s of
 "" -&gt; []
 s' -&gt; w : wordsWhen p s''
 where (w, s'') = break p s'
</code></pre>

Then call it with whatever predicate you want!

<pre><code>main = print $ wordsWhen (==',') "break,this,string,at,commas"
</code></pre>

blocks|key|790753|text|如果您使用Data.Text，则会有splitOn：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|790754|http://hackage.haskell.org/packages/archive/text/0.11.2.0/doc/html/Data-Text.html#v:splitOn|offset|length|790755|这是在Haskell平台中构建的。|790756|举个例子：|790757|import+qualified+Data.Text+as+T
main+=+print+$+T.splitOn+(T.pack+"+")+(T.pack+"this+is+a+test")|code-block|syntax|javascript|790758|或者：|790759|{-#+LANGUAGE+OverloadedStrings+#-}

import+qualified+Data.Text+as+T
main+=+print+$+T.splitOn+"+"+"this+is+a+test"|790760|entityMap|0|LINK|mutability|MUTABLE|url^0|0|0|2J|0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|Z|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|10|8|@]|9|@$D|11|E|12|1|13]]|A|$]]|$1|F|3|G|5|6|7|14|8|@]|9|@]|A|$]]|$1|H|3|I|5|6|7|15|8|@]|9|@]|A|$]]|$1|J|3|K|5|L|7|16|8|@]|9|@]|A|$M|N]]|$1|O|3|P|5|6|7|17|8|@]|9|@]|A|$]]|$1|Q|3|R|5|L|7|18|8|@]|9|@]|A|$M|N]]|$1|S|3|-4|5|6|7|19|8|@]|9|@]|A|$]]]|T|$U|$5|V|W|X|A|$Y|C]]]]

If you use Data.Text, there is splitOn:

<a href="http://hackage.haskell.org/packages/archive/text/0.11.2.0/doc/html/Data-Text.html#v:splitOn">http://hackage.haskell.org/packages/archive/text/0.11.2.0/doc/html/Data-Text.html#v:splitOn</a>

This is built in the Haskell Platform.

So for instance:

<pre><code>import qualified Data.Text as T
main = print $ T.splitOn (T.pack " ") (T.pack "this is a test")
</code></pre>

or:

<pre><code>{-# LANGUAGE OverloadedStrings #-}

import qualified Data.Text as T
main = print $ T.splitOn " " "this is a test"
</code></pre>

blocks|key|1004505|text|在模块Text.Regex+(+Haskell平台的一部分)中，有一个函数：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1004506|splitRegex+::+Regex+->+String+->+[String]|code-block|syntax|javascript|1004507|它根据正则表达式拆分字符串。该接口可在Hackage上找到。|offset|length|1004508|entityMap|0|LINK|mutability|MUTABLE|url|http://hackage.haskell.org/packages/archive/regex-compat/0.92/doc/html/Text-Regex.html^0|0|0|J|7|0|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|T|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|U|8|@]|9|@$I|V|J|W|1|X]]|A|$]]|$1|K|3|-4|5|6|7|Y|8|@]|9|@]|A|$]]]|L|$M|$5|N|O|P|A|$Q|R]]]]

In the module Text.Regex (part of the Haskell Platform), there is a function:

<pre><code>splitRegex :: Regex -&gt; String -&gt; [String]
</code></pre>

which splits a string based on a regular expression. The API can be found at <a href="http://hackage.haskell.org/packages/archive/regex-compat/0.92/doc/html/Text-Regex.html">Hackage</a>.

blocks|key|1004796|text|使用使用split的Data.List.Split|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1004797|[me@localhost]$+ghci
Prelude>+import+Data.List.Split
Prelude+Data.List.Split>+let+l+=+splitOn+","+"1,2,3,4"
Prelude+Data.List.Split>+:t+l
l+::+[[Char]]
Prelude+Data.List.Split>+l
["1","2","3","4"]
Prelude+Data.List.Split>+let+{+convert+::+[String]+->+[Integer];+convert+=+map+read+}
Prelude+Data.List.Split>+let+l2+=+convert+l
Prelude+Data.List.Split>+:t+l2
l2+::+[Integer]
Prelude+Data.List.Split>+l2
[1,2,3,4]|code-block|syntax|javascript|1004798|entityMap^0|4|5|A|F|0|0^^$0|@$1|2|3|4|5|6|7|M|8|@$9|N|A|O|B|C]|$9|P|A|Q|B|C]]|D|@]|E|$]]|$1|F|3|G|5|H|7|R|8|@]|D|@]|E|$I|J]]|$1|K|3|-4|5|6|7|S|8|@]|D|@]|E|$]]]|L|$]]

Use <code>Data.List.Split</code>, which uses <code>split</code>:

<pre><code>[me@localhost]$ ghci
Prelude&gt; import Data.List.Split
Prelude Data.List.Split&gt; let l = splitOn "," "1,2,3,4"
Prelude Data.List.Split&gt; :t l
l :: [[Char]]
Prelude Data.List.Split&gt; l
["1","2","3","4"]
Prelude Data.List.Split&gt; let { convert :: [String] -&gt; [Integer]; convert = map read }
Prelude Data.List.Split&gt; let l2 = convert l
Prelude Data.List.Split&gt; :t l2
l2 :: [Integer]
Prelude Data.List.Split&gt; l2
[1,2,3,4]
</code></pre>

blocks|key|1004339|text|试试这个：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1004340|import+Data.List+(unfoldr)

separateBy+::+Eq+a+=>+a+->+[a]+->+[[a]]
separateBy+chr+=+unfoldr+sep+where
++sep+[]+=+Nothing
++sep+l++=+Just+.+fmap+(drop+1)+.+break+(==+chr)+$+l|code-block|syntax|javascript|1004341|只适用于单个字符，但应该很容易扩展。|1004342|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|L|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|M|8|@]|9|@]|A|$]]|$1|I|3|-4|5|6|7|N|8|@]|9|@]|A|$]]]|J|$]]

Try this one:

<pre><code>import Data.List (unfoldr)

separateBy :: Eq a =&gt; a -&gt; [a] -&gt; [[a]]
separateBy chr = unfoldr sep where
 sep [] = Nothing
 sep l = Just . fmap (drop 1) . break (== chr) $ l
</code></pre>

Only works for a single char, but should be easily extendable.

blocks|key|1004836|text|split+::+Eq+a+=>+a+->+[a]+->+[[a]]
split+d+[]+=+[]
split+d+s+=+x+:+split+d+(drop+1+y)+where+(x,y)+=+span+(/=+d)+s|type|code-block|depth|inlineStyleRanges|entityRanges|data|syntax|javascript|1004837|例如。|unstyled|1004838|split+';'+"a;bb;ccc;;d"
>+["a","bb","ccc","","d"]|1004839|将删除单个尾部分隔符：|1004840|split+';'+"a;bb;ccc;;d;"
>+["a","bb","ccc","","d"]|1004841|entityMap^0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|O|8|@]|9|@]|A|$B|C]]|$1|D|3|E|5|F|7|P|8|@]|9|@]|A|$]]|$1|G|3|H|5|6|7|Q|8|@]|9|@]|A|$B|C]]|$1|I|3|J|5|F|7|R|8|@]|9|@]|A|$]]|$1|K|3|L|5|6|7|S|8|@]|9|@]|A|$B|C]]|$1|M|3|-4|5|F|7|T|8|@]|9|@]|A|$]]]|N|$]]

<pre><code>split :: Eq a =&gt; a -&gt; [a] -&gt; [[a]]
split d [] = []
split d s = x : split d (drop 1 y) where (x,y) = span (/= d) s
</code></pre>

E.g.

<pre><code>split ';' "a;bb;ccc;;d"
&gt; ["a","bb","ccc","","d"]
</code></pre>

A single trailing delimiter will be dropped:

<pre><code>split ';' "a;bb;ccc;;d;"
&gt; ["a","bb","ccc","","d"]
</code></pre>

blocks|key|790584|text|我昨天开始学习Haskell，如果我错了，请纠正我，但是：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|790585|split+::+Eq+a+=>+a+->+[a]+->+[[a]]
split+x+y+=+func+x+y+[[]]
++++where
++++++++func+x+[]+z+=+reverse+$+map+(reverse)+z
++++++++func+x+(y:ys)+(z:zs)+=+if+y==x+then+
++++++++++++func+x+ys+([]:(z:zs))+
++++++++else+
++++++++++++func+x+ys+((y:z):zs)|code-block|syntax|javascript|790586|提供：|790587|*Main>+split+'+'+"this+is+a+test"
["this","is","a","test"]|790588|或者你想要|790589|*Main>+splitWithStr++"+and+"+"this+and+is+and+a+and+test"
["this","is","a","test"]|790590|这将是：|790591|splitWithStr+::+Eq+a+=>+[a]+->+[a]+->+[[a]]
splitWithStr+x+y+=+func+x+y+[[]]
++++where
++++++++func+x+[]+z+=+reverse+$+map+(reverse)+z
++++++++func+x+(y:ys)+(z:zs)+=+if+(take+(length+x)+(y:ys))+==+x+then
++++++++++++func+x+(drop+(length+x)+(y:ys))+([]:(z:zs))
++++++++else
++++++++++++func+x+ys+((y:z):zs)|790592|entityMap^0|0|0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|V|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|W|8|@]|9|@]|A|$]]|$1|I|3|J|5|D|7|X|8|@]|9|@]|A|$E|F]]|$1|K|3|L|5|6|7|Y|8|@]|9|@]|A|$]]|$1|M|3|N|5|D|7|Z|8|@]|9|@]|A|$E|F]]|$1|O|3|P|5|6|7|10|8|@]|9|@]|A|$]]|$1|Q|3|R|5|D|7|11|8|@]|9|@]|A|$E|F]]|$1|S|3|-4|5|6|7|12|8|@]|9|@]|A|$]]]|T|$]]

I started learning Haskell yesterday, so correct me if I'm wrong but:

<pre><code>split :: Eq a =&gt; a -&gt; [a] -&gt; [[a]]
split x y = func x y [[]]
 where
 func x [] z = reverse $ map (reverse) z
 func x (y:ys) (z:zs) = if y==x then 
 func x ys ([]:(z:zs)) 
 else 
 func x ys ((y:z):zs)
</code></pre>

gives:

<pre><code>*Main&gt; split ' ' "this is a test"
["this","is","a","test"]
</code></pre>

or maybe you wanted

<pre><code>*Main&gt; splitWithStr " and " "this and is and a and test"
["this","is","a","test"]
</code></pre>

which would be:

<pre><code>splitWithStr :: Eq a =&gt; [a] -&gt; [a] -&gt; [[a]]
splitWithStr x y = func x y [[]]
 where
 func x [] z = reverse $ map (reverse) z
 func x (y:ys) (z:zs) = if (take (length x) (y:ys)) == x then
 func x (drop (length x) (y:ys)) ([]:(z:zs))
 else
 func x ys ((y:z):zs)
</code></pre>

blocks|key|790960|text|我发现这更容易理解：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|790961|split+::+Char+->+String+->+[String]
split+c+xs+=+case+break+(==c)+xs+of+
++(ls,+"")+->+[ls]
++(ls,+x:rs)+->+ls+:+split+c+rs|code-block|syntax|javascript|790962|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

I find this simpler to understand:

<pre><code>split :: Char -&gt; String -&gt; [String]
split c xs = case break (==c) xs of 
 (ls, "") -&gt; [ls]
 (ls, x:rs) -&gt; ls : split c rs
</code></pre>

blocks|key|1004627|text|我不知道如何在Steve的回答中添加评论，但我想推荐|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1004628|GHC+libraries+documentation，|offset|length|1004629|在那里，特别是|1004630|Sublist+functions+in+Data.List|1004631|这比仅仅阅读简单的Haskell报告作为参考要好得多。|1004632|一般而言，具有何时创建新的子列表以馈送的规则的折叠应该也能解决这个问题。|1004633|entityMap|0|LINK|mutability|MUTABLE|url|http://www.haskell.org/ghc/docs/latest/html/libraries/index.html|1|http://www.haskell.org/ghc/docs/latest/html/libraries/base/Data-List.html#g:10^0|0|0|R|0|0|0|0|U|1|0|0|0^^$0|@$1|2|3|4|5|6|7|X|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|Y|8|@]|9|@$D|Z|E|10|1|11]]|A|$]]|$1|F|3|G|5|6|7|12|8|@]|9|@]|A|$]]|$1|H|3|I|5|6|7|13|8|@]|9|@$D|14|E|15|1|16]]|A|$]]|$1|J|3|K|5|6|7|17|8|@]|9|@]|A|$]]|$1|L|3|M|5|6|7|18|8|@]|9|@]|A|$]]|$1|N|3|-4|5|6|7|19|8|@]|9|@]|A|$]]]|O|$P|$5|Q|R|S|A|$T|U]]|V|$5|Q|R|S|A|$T|W]]]]

I don’t know how to add a comment onto Steve’s answer, but I would like to recommend the 
&nbsp;&nbsp;<a href="http://www.haskell.org/ghc/docs/latest/html/libraries/index.html" rel="nofollow">GHC libraries documentation</a>, 
and in there specifically the 
&nbsp;&nbsp;<a href="http://www.haskell.org/ghc/docs/latest/html/libraries/base/Data-List.html#g:10" rel="nofollow">Sublist functions in Data.List</a>

Which is much better as a reference, than just reading the plain Haskell report.

Generically, a fold with a rule on when to create a new sublist to feed, should solve it too.

blocks|key|790933|text|ghci中的示例：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|790934|>++import+qualified+Text.Regex+as+R
>++R.splitRegex+(R.mkRegex+"x")+"2x3x777"
>++["2","3","777"]|code-block|syntax|javascript|790935|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

Example in the ghci:

<pre><code>&gt; import qualified Text.Regex as R
&gt; R.splitRegex (R.mkRegex "x") "2x3x777"
&gt; ["2","3","777"]
</code></pre>

blocks|key|1004913|text|除了答案中给出的高效和预先构建的函数之外，我还将添加我自己的函数，这些函数只是我编写的Haskell函数库中的一部分，我正在利用自己的时间学习这门语言：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1004914|--+Correct+but+inefficient+implementation
wordsBy+::+String+->+Char+->+[String]
wordsBy+s+c+=+reverse+(go+s+[])+where
++++go+s'+ws+=+case+(dropWhile+(\c'+->+c'+==+c)+s')+of
++++++++""+->+ws
++++++++rem+->+go+((dropWhile+(\c'+->+c'+/=+c)+rem))+((takeWhile+(\c'+->+c'+/=+c)+rem)+:+ws)

--+Breaks+up+by+predicate+function+to+allow+for+more+complex+conditions+(\c+->+c+==+','+%7C%7C+c+==+';')
wordsByF+::+String+->+(Char+->+Bool)+->+[String]
wordsByF+s+f+=+reverse+(go+s+[])+where
++++go+s'+ws+=+case+((dropWhile+(\c'+->+f+c'))+s')+of
++++++++""+->+ws
++++++++rem+->+go+((dropWhile+(\c'+->+(f+c')+==+False))+rem)+(((takeWhile+(\c'+->+(f+c')+==+False))+rem)+:+ws)|code-block|syntax|javascript|1004915|解决方案至少是尾递归的，所以它们不会引起堆栈溢出。|1004916|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|L|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|M|8|@]|9|@]|A|$]]|$1|I|3|-4|5|6|7|N|8|@]|9|@]|A|$]]]|J|$]]

In addition to the efficient and pre-built functions given in answers I'll add my own which are simply part of my repertory of Haskell functions I was writing to learn the language on my own time:

<pre><code>-- Correct but inefficient implementation
wordsBy :: String -&gt; Char -&gt; [String]
wordsBy s c = reverse (go s []) where
 go s' ws = case (dropWhile (\c' -&gt; c' == c) s') of
 "" -&gt; ws
 rem -&gt; go ((dropWhile (\c' -&gt; c' /= c) rem)) ((takeWhile (\c' -&gt; c' /= c) rem) : ws)

-- Breaks up by predicate function to allow for more complex conditions (\c -&gt; c == ',' || c == ';')
wordsByF :: String -&gt; (Char -&gt; Bool) -&gt; [String]
wordsByF s f = reverse (go s []) where
 go s' ws = case ((dropWhile (\c' -&gt; f c')) s') of
 "" -&gt; ws
 rem -&gt; go ((dropWhile (\c' -&gt; (f c') == False)) rem) (((takeWhile (\c' -&gt; (f c') == False)) rem) : ws)
</code></pre>

The solutions are at least tail-recursive so they won't incur a stack overflow.

blocks|key|1005074|text|我来得太晚了，但我想在这里为那些感兴趣的人补充一下，如果你正在寻找一个简单的解决方案，而不是依赖于任何臃肿的软件包：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1005075|split+::+String+->+String+->+[String]
split+_+""+=+[]
split+delim+str+=
++split'+""+str+[]
++where
++++dl+=+length+delim

++++split'+::+String+->+String+->+[String]+->+[String]
++++split'+h+t+f
++++++%7C+dl+>+length+t+=+f+%2B%2B+[h+%2B%2B+t]
++++++%7C+delim+==+take+dl+t+=+split'+""+(drop+dl+t)+(f+%2B%2B+[h])
++++++%7C+otherwise+=+split'+(h+%2B%2B+take+1+t)+(drop+1+t)+f|code-block|syntax|javascript|1005076|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

I am far late but would like to add it here for those interested, if you're looking for a simple solution without relying on any bloated packages:
<pre class="lang-hs prettyprint-override"><code>split :: String -&gt; String -&gt; [String]
split _ &quot;&quot; = []
split delim str =
 split' &quot;&quot; str []
 where
 dl = length delim

 split' :: String -&gt; String -&gt; [String] -&gt; [String]
 split' h t f
 | dl &gt; length t = f ++ [h ++ t]
 | delim == take dl t = split' &quot;&quot; (drop dl t) (f ++ [h])
 | otherwise = split' (h ++ take 1 t) (drop 1 t) f
</code></pre>

Is there a standard way to split a string in Haskell?

<code>lines</code> and <code>words</code> work great from splitting on a space or newline, but surely there is a standard way to split on a comma? 

I couldn't find it on Hoogle.

To be specific, I'm looking for something where <code>split "," "my,comma,separated,list"</code> returns <code>["my","comma","separated","list"]</code>.

How to split a string in Haskell?

在Haskell中有拆分字符串的标准方法吗？lines和words在空格或换行符上的拆分效果很好，但肯定有一种标准的逗号拆分方式？我在胡格尔上找不到它。具体地说，我正在寻找split "," "my,comma,separated,list"返回["my","comma","separated","list"]的内容。

问如何在Haskell中拆分字符串？
EN

回答 13

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问如何在Haskell中拆分字符串？EN

回答 13

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问如何在Haskell中拆分字符串？
EN