在Scala中计算正则表达式匹配？
[英]Counting regex matches in Scala?
问题描述
In Scala I am trying to detemine the number of types a particular match is found (and it can occur several times in the same string). 
在Scala中，我试图确定找到特定匹配的类型数量（并且它可以在同一个字符串中多次出现）。 Namely, something that is of form "##/nnn-#" where # is a number 0-9 and n is a letter A-Za-z and - is a hiphen and / is a forward slash. 即，形式为“## / nnn-＃”的东西，其中＃是数字0-9 ，n是字母A-Za-z并且 - 是hiphen和/是正斜杠。
1 个解决方案
解决方案1
4 已采纳 2015-06-26 04:08:27
You mean something like this? 你的意思是这样的？
scala> val reg = "[0-9]{2}/[a-zA-Z]{3}-[0-9]".r
scala> val str = "12/abc-2 abcd 55/bar-2 foo bar"
scala> reg.findAllIn(str).length
声明:本站的技术帖子网页，遵循CC BY-SA 4.0协议，如果您需要转载，请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.
相关问题
计算正则表达式匹配 - Counting regex matches
正则表达式中的重叠匹配-Scala - Overlapping matches in Regex - Scala
Scala-字符串匹配RegEx - Scala - String matches RegEx
计算 Python 中正则表达式匹配的出现次数 - Counting occurrences of Regex Matches in Python
Scala是否等同于“匹配”正则表达式方法？ - Scala equivalent for 'matches' regex method?
Java正则表达式 - 用于计算匹配的一个班轮 - Java regex - one liner for counting matches
正则表达式找到匹配但不计算只匹配一次 - Regex is finding match but not counting if only matches once
regex.matches 方法匹配和计数错误 - The regex.matches method is matching and counting wrongly
在C＃中计算与Regex的重叠匹配 - Counting overlapping matches with Regex in C#
Scala：正则表达式，可将所有内容匹配到一个特定字符 - Scala: Regex that matches everything up to a certain character
相关标签