Anonymous user
Talk:Count occurrences of a substring: Difference between revisions
Talk:Count occurrences of a substring (view source)
Revision as of 17:20, 16 June 2011
, 12 years ago→More specific?: Possible suggestion
(Created page with "== More specific? == What happens when there are more than one way to match? Say you have string "aBaBaBa" and want to find <i>non-overlapping</i> "aBa"s, you could say both (aB...") |
(→More specific?: Possible suggestion) |
||
Line 1:
== More specific? ==
What happens when there are more than one way to match? Say you have string "aBaBaBa" and want to find <i>non-overlapping</i> "aBa"s, you could say both (aBa)B(aBa) and aB(aBa)Ba, where brackets denote the found matches, are valid. --[[User:Ledrug|Ledrug]] 17:07, 16 June 2011 (UTC)
:My guess would be to specify to match left-to-right, but that might be too restrictive of possible methods. Maybe say "give the highest possible number of non-overlapping matches"? Can you think of any situations where that isn't the same as the count when matching from left-to-right (or even right-to-left)? --[[User:Mwn3d|Mwn3d]] 17:20, 16 June 2011 (UTC)
| |||