How to match “as much as possible until the group is matched”?
Consider the string
hello world something 12345 somethingelse
I know that I will have hello
, then some characters except numbers (I could list them if it helps), and then a set of digits. I would like to match this group of digits.
If I knew what is between hello
and the digits, I would use .*hellosworlds(d*)s
as the match string.
Is there a way to say "match the group of digits after hello
(that hello
is followed only by non-digits characters up until the sought group)"? (something between a greedy and a lazy match)
regex regex-group
add a comment |
Consider the string
hello world something 12345 somethingelse
I know that I will have hello
, then some characters except numbers (I could list them if it helps), and then a set of digits. I would like to match this group of digits.
If I knew what is between hello
and the digits, I would use .*hellosworlds(d*)s
as the match string.
Is there a way to say "match the group of digits after hello
(that hello
is followed only by non-digits characters up until the sought group)"? (something between a greedy and a lazy match)
regex regex-group
1
use:helloD+(d+)
– anubhava
Jan 18 at 16:27
1
@anubhava ah it is so simple! Thanks you very much. If you would not mind turning this into an answer I would gladly accept it.
– WoJ
Jan 18 at 16:30
add a comment |
Consider the string
hello world something 12345 somethingelse
I know that I will have hello
, then some characters except numbers (I could list them if it helps), and then a set of digits. I would like to match this group of digits.
If I knew what is between hello
and the digits, I would use .*hellosworlds(d*)s
as the match string.
Is there a way to say "match the group of digits after hello
(that hello
is followed only by non-digits characters up until the sought group)"? (something between a greedy and a lazy match)
regex regex-group
Consider the string
hello world something 12345 somethingelse
I know that I will have hello
, then some characters except numbers (I could list them if it helps), and then a set of digits. I would like to match this group of digits.
If I knew what is between hello
and the digits, I would use .*hellosworlds(d*)s
as the match string.
Is there a way to say "match the group of digits after hello
(that hello
is followed only by non-digits characters up until the sought group)"? (something between a greedy and a lazy match)
regex regex-group
regex regex-group
asked Jan 18 at 16:24
WoJWoJ
6,5041059132
6,5041059132
1
use:helloD+(d+)
– anubhava
Jan 18 at 16:27
1
@anubhava ah it is so simple! Thanks you very much. If you would not mind turning this into an answer I would gladly accept it.
– WoJ
Jan 18 at 16:30
add a comment |
1
use:helloD+(d+)
– anubhava
Jan 18 at 16:27
1
@anubhava ah it is so simple! Thanks you very much. If you would not mind turning this into an answer I would gladly accept it.
– WoJ
Jan 18 at 16:30
1
1
use:
helloD+(d+)
– anubhava
Jan 18 at 16:27
use:
helloD+(d+)
– anubhava
Jan 18 at 16:27
1
1
@anubhava ah it is so simple! Thanks you very much. If you would not mind turning this into an answer I would gladly accept it.
– WoJ
Jan 18 at 16:30
@anubhava ah it is so simple! Thanks you very much. If you would not mind turning this into an answer I would gladly accept it.
– WoJ
Jan 18 at 16:30
add a comment |
1 Answer
1
active
oldest
votes
You may use this regex:
helloD+(d+)
Where:
D+
matches 1+ non-digits after matchinghello
(d+)
matches 1+ digits and captures it in group #1
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f54257857%2fhow-to-match-as-much-as-possible-until-the-group-is-matched%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
You may use this regex:
helloD+(d+)
Where:
D+
matches 1+ non-digits after matchinghello
(d+)
matches 1+ digits and captures it in group #1
add a comment |
You may use this regex:
helloD+(d+)
Where:
D+
matches 1+ non-digits after matchinghello
(d+)
matches 1+ digits and captures it in group #1
add a comment |
You may use this regex:
helloD+(d+)
Where:
D+
matches 1+ non-digits after matchinghello
(d+)
matches 1+ digits and captures it in group #1
You may use this regex:
helloD+(d+)
Where:
D+
matches 1+ non-digits after matchinghello
(d+)
matches 1+ digits and captures it in group #1
answered Jan 18 at 16:33
anubhavaanubhava
523k46320393
523k46320393
add a comment |
add a comment |
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f54257857%2fhow-to-match-as-much-as-possible-until-the-group-is-matched%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
1
use:
helloD+(d+)
– anubhava
Jan 18 at 16:27
1
@anubhava ah it is so simple! Thanks you very much. If you would not mind turning this into an answer I would gladly accept it.
– WoJ
Jan 18 at 16:30