blocks|key|449532|text|我不知道有任何现有的函数创建了这个功能，但我想我最终会使用AllMatches+[]+(MatchOffset,+MatchLength)+instance+of+RegexContent之类的东西来模拟它：|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|449533|replaceAll+::+RegexLike+r+String+=>+r+->+(String+->+String)+->+String+->+String
replaceAll+re+f+s+=+start+end
++where+(_,+end,+start)+=+foldl'+go+(0,+s,+id)+$+getAllMatches+$+match+re+s
++++++++go+(ind,read,write)+(off,len)+=
++++++++++let+(skip,+start)+=+splitAt+(off+-+ind)+read+
++++++++++++++(matched,+remaining)+=+splitAt+len+matched+
++++++++++in+(off+%2B+len,+remaining,+write+.+(skip%2B%2B)+.+(f+matched+%2B%2B))

replaceAllM+::+(Monad+m,+RegexLike+r+String)+=>+r+->+(String+->+m+String)+->+String+->+m+String
replaceAllM+re+f+s+=+do
++let+go+(ind,read,write)+(off,len)+=+do
++++++let+(skip,+start)+=+splitAt+(off+-+ind)+read+
++++++let+(matched,+remaining)+=+splitAt+len+matched+
++++++replacement+<-+f+matched
++++++return+(off+%2B+len,+remaining,+write+.+(skip%2B%2B)+.+(replacement%2B%2B))
++(_,+end,+start)+<-+foldM+go+(0,+s,+return)+$+getAllMatches+$+match+re+s
++start+end|code-block|syntax|javascript|449534|entityMap|0|LINK|mutability|MUTABLE|url|http://hackage.haskell.org/packages/archive/regex-base/0.93.2/doc/html/Text-Regex-Base-RegexLike.html^0|T|14|2A|C|T|1T|0|0|0^^$0|@$1|2|3|4|5|6|7|S|8|@$9|T|A|U|B|C]|$9|V|A|W|B|C]]|D|@$9|X|A|Y|1|Z]]|E|$]]|$1|F|3|G|5|H|7|10|8|@]|D|@]|E|$I|J]]|$1|K|3|-4|5|6|7|11|8|@]|D|@]|E|$]]]|L|$M|$5|N|O|P|E|$Q|R]]]]

I don't know of any existing function that creates this functionality, but I think that I'd end up using something like the <a href="http://hackage.haskell.org/packages/archive/regex-base/0.93.2/doc/html/Text-Regex-Base-RegexLike.html" rel="noreferrer"><code>AllMatches [] (MatchOffset, MatchLength)</code> instance of <code>RegexContent</code></a> to simulate it:

<pre><code>replaceAll :: RegexLike r String =&gt; r -&gt; (String -&gt; String) -&gt; String -&gt; String
replaceAll re f s = start end
 where (_, end, start) = foldl' go (0, s, id) $ getAllMatches $ match re s
 go (ind,read,write) (off,len) =
 let (skip, start) = splitAt (off - ind) read 
 (matched, remaining) = splitAt len matched 
 in (off + len, remaining, write . (skip++) . (f matched ++))

replaceAllM :: (Monad m, RegexLike r String) =&gt; r -&gt; (String -&gt; m String) -&gt; String -&gt; m String
replaceAllM re f s = do
 let go (ind,read,write) (off,len) = do
 let (skip, start) = splitAt (off - ind) read 
 let (matched, remaining) = splitAt len matched 
 replacement &lt;- f matched
 return (off + len, remaining, write . (skip++) . (replacement++))
 (_, end, start) &lt;- foldM go (0, s, return) $ getAllMatches $ match re s
 start end
</code></pre>

blocks|key|663877|text|package+regex-compat中的Text.Regex.subRegex怎么样？|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|663878|Prelude>+import+Text.Regex+(mkRegex,+subRegex)

Prelude>+:t+mkRegex
mkRegex+::+String+->+Regex

Prelude>+:t+subRegex
subRegex+::+Regex+->+String+->+String+->+String

Prelude>+subRegex+(mkRegex+"foo")+"foobar"+"123"
"123bar"|code-block|syntax|javascript|663879|entityMap|0|LINK|mutability|MUTABLE|url|https://hackage.haskell.org/package/regex-compat-0.92/docs/Text-Regex.html^0|8|C|M|J|M|J|0|0|0^^$0|@$1|2|3|4|5|6|7|S|8|@$9|T|A|U|B|C]|$9|V|A|W|B|C]]|D|@$9|X|A|Y|1|Z]]|E|$]]|$1|F|3|G|5|H|7|10|8|@]|D|@]|E|$I|J]]|$1|K|3|-4|5|6|7|11|8|@]|D|@]|E|$]]]|L|$M|$5|N|O|P|E|$Q|R]]]]

How about the <a href="https://hackage.haskell.org/package/regex-compat-0.92/docs/Text-Regex.html" rel="nofollow noreferrer"><code>Text.Regex.subRegex</code></a> in package <code>regex-compat</code>?
<pre><code>Prelude&gt; import Text.Regex (mkRegex, subRegex)

Prelude&gt; :t mkRegex
mkRegex :: String -&gt; Regex

Prelude&gt; :t subRegex
subRegex :: Regex -&gt; String -&gt; String -&gt; String

Prelude&gt; subRegex (mkRegex &quot;foo&quot;) &quot;foobar&quot; &quot;123&quot;
&quot;123bar&quot;
</code></pre>

blocks|key|663898|text|也许这个方法适合你。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|663899|import+Data.Array+(elems)
import+Text.Regex.TDFA+((=~),+MatchArray)

replaceAll+::+String+->+String+->+String+->+String++++++++
replaceAll+regex+new_str+str++=+
++++let+parts+=+concat+$+map+elems+$+(str++=~++regex+::+[MatchArray])
++++in+foldl+(replace'+new_str)+str+(reverse+parts)+

++where
+++++replace'+::+[a]+->+[a]+->+(Int,+Int)+->+[a]
+++++replace'+new+list+(shift,+l)+++=+
++++++++let+(pre,+post)+=+splitAt+shift+list
++++++++in+pre+%2B%2B+new+%2B%2B+(drop+l+post)|code-block|syntax|javascript|663900|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|$]]

maybe this approach fit you.

<pre><code>import Data.Array (elems)
import Text.Regex.TDFA ((=~), MatchArray)

replaceAll :: String -&gt; String -&gt; String -&gt; String 
replaceAll regex new_str str = 
 let parts = concat $ map elems $ (str =~ regex :: [MatchArray])
 in foldl (replace' new_str) str (reverse parts) 

 where
 replace' :: [a] -&gt; [a] -&gt; (Int, Int) -&gt; [a]
 replace' new list (shift, l) = 
 let (pre, post) = splitAt shift list
 in pre ++ new ++ (drop l post)
</code></pre>

blocks|key|663951|text|基于@rampion的答案，但修复了拼写错误，因此它不只是<<loop>>|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|663952|replaceAll+::+Regex+->+(String+->+String)+->+String+->+String
replaceAll+re+f+s+=+start+end
++where+(_,+end,+start)+=+foldl'+go+(0,+s,+id)+$+getAllMatches+$+match+re+s
++++++++go+(ind,read,write)+(off,len)+=
++++++++++++let+(skip,+start)+=+splitAt+(off+-+ind)+read+
++++++++++++++++(matched,+remaining)+=+splitAt+len+start+
++++++++++++in+(off+%2B+len,+remaining,+write+.+(skip%2B%2B)+.+(f+matched+%2B%2B))|code-block|syntax|javascript|663953|entityMap^0|T|8|0|0^^$0|@$1|2|3|4|5|6|7|M|8|@$9|N|A|O|B|C]]|D|@]|E|$]]|$1|F|3|G|5|H|7|P|8|@]|D|@]|E|$I|J]]|$1|K|3|-4|5|6|7|Q|8|@]|D|@]|E|$]]]|L|$]]

Based on @rampion's answer, but with the typo fixed so it doesn't just <code>&lt;&lt;loop&gt;&gt;</code>:

<pre><code>replaceAll :: Regex -&gt; (String -&gt; String) -&gt; String -&gt; String
replaceAll re f s = start end
 where (_, end, start) = foldl' go (0, s, id) $ getAllMatches $ match re s
 go (ind,read,write) (off,len) =
 let (skip, start) = splitAt (off - ind) read 
 (matched, remaining) = splitAt len start 
 in (off + len, remaining, write . (skip++) . (f matched ++))
</code></pre>

blocks|key|449717|text|您可以从Data.Text.ICU.Replace+module使用replaceAll。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|449718|Prelude>+:set+-XOverloadedStrings
Prelude>+import+Data.Text.ICU.Replace
Prelude+Data.Text.ICU.Replace>+replaceAll+"cat"+"dog"+"Bailey+is+a+cat,+and+Max+is+a+cat+too."
"Bailey+is+a+dog,+and+Max+is+a+dog+too."|code-block|syntax|javascript|449719|entityMap|0|LINK|mutability|MUTABLE|url|https://hackage.haskell.org/package/text-regex-replace-0.1.1.1/docs/Data-Text-ICU-Replace.html^0|Y|A|4|S|0|0|0^^$0|@$1|2|3|4|5|6|7|S|8|@$9|T|A|U|B|C]]|D|@$9|V|A|W|1|X]]|E|$]]|$1|F|3|G|5|H|7|Y|8|@]|D|@]|E|$I|J]]|$1|K|3|-4|5|6|7|Z|8|@]|D|@]|E|$]]]|L|$M|$5|N|O|P|E|$Q|R]]]]

You can use <code>replaceAll</code> from the <a href="https://hackage.haskell.org/package/text-regex-replace-0.1.1.1/docs/Data-Text-ICU-Replace.html" rel="nofollow">Data.Text.ICU.Replace module</a>.

<pre><code>Prelude&gt; :set -XOverloadedStrings
Prelude&gt; import Data.Text.ICU.Replace
Prelude Data.Text.ICU.Replace&gt; replaceAll "cat" "dog" "Bailey is a cat, and Max is a cat too."
"Bailey is a dog, and Max is a dog too."
</code></pre>

blocks|key|449761|text|对于用“monad做更高级的事情，比如计算出现次数等”来做“搜索和替换”，我推荐Replace.Megaparsec.streamEditT。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|449762|有关如何计算出现次数的特定示例，请参阅程序包自述文件。|449763|entityMap|0|LINK|mutability|MUTABLE|url|https://hackage.haskell.org/package/replace-megaparsec/docs/Replace-Megaparsec.html#v:streamEditT^0|14|U|14|U|0|0|0^^$0|@$1|2|3|4|5|6|7|P|8|@$9|Q|A|R|B|C]]|D|@$9|S|A|T|1|U]]|E|$]]|$1|F|3|G|5|6|7|V|8|@]|D|@]|E|$]]|$1|H|3|-4|5|6|7|W|8|@]|D|@]|E|$]]]|I|$J|$5|K|L|M|E|$N|O]]]]

For doing “search-and-replace” with “more advanced things with the monad, like counting occurrences, etc,” I recommend <a href="https://hackage.haskell.org/package/replace-megaparsec/docs/Replace-Megaparsec.html#v:streamEditT" rel="nofollow noreferrer"><code>Replace.Megaparsec.streamEditT</code></a>.
See the package README for specific examples of how to count occurrences.

Is there a high-level API for doing search-and-replace with regexes in Haskell? In particular, I'm looking at the <code>Text.Regex.TDFA</code> or <code>Text.Regex.Posix</code> packages. I'd really like something of type:

<pre><code>f :: Regex -&gt; (ResultInfo -&gt; m String) -&gt; String -&gt; m String
</code></pre>

so, for example, to replace "dog" with "cat" you could write

<pre><code>runIdentity . f "dog" (return . const "cat") -- :: String -&gt; String
</code></pre>

or do more advanced things with the monad, like counting occurrences, etc.

Haskell documentation for this is pretty lacking. Some low-level API notes are <a href="http://www.serpentine.com/blog/2007/02/27/a-haskell-regular-expression-tutorial/" rel="noreferrer">here</a>.

replacement / substition with Haskell regex libraries

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

在Haskell中有没有用正则表达式进行搜索和替换的高级API？特别是，我正在研究Text.Regex.TDFA或Text.Regex.Posix包。我真的很喜欢这种类型的东西：f :: Regex -> (ResultInfo -> m String) -> String -> m String例如，要将"dog“替...

问使用Haskell regex库替换/替换
EN

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问使用Haskell regex库替换/替换EN

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问使用Haskell regex库替换/替换
EN