|
I have a string which has several html comments in it. I need to count the unique matches of an expression.
For example, the string might be:
var teststring = "<!--X1-->Hi<!--X1-->there<!--X2-->";
I currently use this to get the matches...
Started by Sailing Judo on
, 6 posts
by 6 people.
Answer Snippets (Read the full thread at stackoverflow):
.*) // // Options: dot matches newline // // Match the regular expression below and capture its match-->Hi<!--X1-->there<!--X2-->"; var regex = new Regex(@"<!--X\d-->"); var matches = regex.Matches(subjectString....
|
|
I would like to list the matches, when I hit:
/example
so that I see where all matches are at once.
Started by Masi on
, 6 posts
by 6 people.
Answer Snippets (Read the full thread at stackoverflow):
That may not be what you want though, after searching, :g//p will give you the listed matches
:g//p
In it's longer form:
....
Setting hlsearch will highlight all the matches in yellow allowing you to scan the file easily for matches.
|
|
I'm confused about the array returned by a regex match when using both /g (to get multiple matches) and parentheses (to get backreferences). It's not clear to me how to get the backreferences because the subscript of the match array seems to refer to ...
Started by brad on
, 3 posts
by 3 people.
Answer Snippets (Read the full thread at stackoverflow):
Alert(match[1]); }
You should use non.
Var str = "@abc @bcd @cde", re = /@([a-z]+)/g, match; while (match = re.exec(str)) { // match[1] contains text matched by first group, match[2] - second, etc.
|
Ask your Facebook Friends
|
Basically I want to retrieve all possible substring matches with n characters from a string, Here's my initial code but it only returns 2 matches.
String input = "abc12345abcd"; Regex regex = new Regex(@"[A-Za-z]{3}"); //this will only return 2 matches...
Started by jerjer on
, 4 posts
by 4 people.
Answer Snippets (Read the full thread at stackoverflow):
To get overlapping matches, you can program a loop calling the Match Regex(@"[A-Za-z]{3}"); int i=....
Non-overlapping matches -- so the second match for abc means there's nothing returned for bcd , as it would be overlapping.
|
|
Hi Ive been contemplating a few new guns and ive pretty much got it singled out to either a(at around $1000)
1. M1 garand in 30-06 OR .308
2. A long range rifle like the Savage 110/10 series
Trying to keep prices of the rifles at $1000 or under so I could...
Started by CBennett on
, 12 posts
by 9 people.
Answer Snippets (Read the full thread at glocktalk):
Some at Camp Perry during the national, some with the ORPA .
Our Garand matches in Highpower matches.
Of the match that separates the men from the boys is the 200 yard offhand.
|
|
I can't see a reason why the Matcher would return a match on the pattern, but split will return a zero length array on the same regex pattern. It should return something -- in this example I'm looking for a return of 2 separate strings containing "param...
Started by hal10001 on
, 4 posts
by 4 people.
Answer Snippets (Read the full thread at stackoverflow):
Also, you don't even....
I think you match.
Since the pattern matches the whole string that only leaves an empty string to return.
Split() doesn't return the match, only what's in between.
The pattern can match the entire string.
|
|
How can I find the index in a string that matches a boost regex?
Started by Brian R. Bondy on
, 3 posts
by 3 people.
Answer Snippets (Read the full thread at stackoverflow):
Use the position member function of the match_results :
int find_match_offset(std::string const& string_to_search, boost::regex const& expression) { boost::smatch results; if(boost::regex_match_match it's the whole string that....
|
|
How can you count the number of matches in Vim?
For instance, for the text
<?
Started by Masi on
, 3 posts
by 3 people.
Answer Snippets (Read the full thread at stackoverflow):
:%s/<?/whatever/ng
This is the substitution command, but the n flag avoids the actual substitution. .
Count-items describes what you are after.
S/<?//ng
See :h count-items.
|
|
I have a table that represents a series of matches between ids from another table as follows:
CREATE TABLE #matches ( asid1 int, asid2 int ) insert into #matches values (1,2) insert into #matches values (1,3) insert into #matches values (3,1) insert into...
Started by spender on
, 4 posts
by 4 people.
Answer Snippets (Read the full thread at stackoverflow):
You should analyze that table in whatever programming language....
If this can be done at all within SQL, it's going to be insanely difficult .
Here is a listing of a C# and C++ implementation .
It appears that a Disjoint-set is what you need to solve this .
|
|
Hi
Consider the following example:
$target = 'Xa,a,aX'; $pattern = '/X((a),?)*X/'; $matches = array(); preg_match_all($pattern,$target,$matches,PREG_OFFSET_CAPTURE|PREG_PATTERN_ORDER); var_dump($matches);
What it does is returning only the last 'a' in...
Started by Flavius on
, 3 posts
by 3 people.
Answer Snippets (Read the full thread at stackoverflow):
What you want to match want is many matches, each....
The last ((a),?) will be grouped.
What you((a),?)*X matches the entire string.
It finds one large match with groups in it.
When your regex includes X, it matches once.
|
