This is what you want: ([source][1])

&gt;     re.finditer(pattern, string[, flags]) 
&gt; 
&gt; Return an iterator yielding MatchObject instances over all
&gt; non-overlapping matches for the RE pattern in string. The string is
&gt; scanned left-to-right, and matches are returned in the order found. Empty
&gt; matches are included in the result unless they touch the beginning of
&gt; another match.

You can then get the start and end positions from the MatchObjects.

e.g.

    [(m.start(0), m.end(0)) for m in re.finditer(pattern, string)]


  [1]: http://docs.python.org/2/library/re.html#re.finditer

  #To get indice of all occurence   

    S = input() # Source String 
    k = input() # String to be searched
    import re
    pattern = re.compile(k)
    r = pattern.search(S)
    if not r: print(&quot;(-1, -1)&quot;)
    while r:
        print(&quot;({0}, {1})&quot;.format(r.start(), r.end() - 1))
        r = pattern.search(S,r.start() + 1)

This should solve your issue
pattern=r&quot;(?=(\&quot;[^\&quot;]+\&quot;|&#39;[^&#39;]+&#39;))&quot;

Then use the following to get all overlapping indices,

indicesTuple=[(mObj.start(1),mObj.end(1)-1)  for mObj in re.finditer(pattern,input)]


I have a string `&quot;foo_bar&quot;` and `&quot;foo_foo_bar&quot;`. How do I remove the last `&quot;_bar&quot;` from the string? So I&#39;m left with &quot;foo&quot; and `&quot;foo_foo&quot;`.

Javascript: How to remove characters from end of string?

I&#39;m trying to draw a smooth curve in `R`. I have the following simple toy data:

    &gt; x
     [1]  1  2  3  4  5  6  7  8  9 10
    &gt; y
     [1]  2  4  6  8  7 12 14 16 18 20

Now when I plot it with a standard command it looks bumpy and edgy, of course:

    &gt; plot(x,y, type=&#39;l&#39;, lwd=2, col=&#39;red&#39;)

How can I make the curve smooth so that the 3 edges are rounded using estimated values? I know there are many methods to fit a smooth curve but I&#39;m not sure which one would be most appropriate for this type of curve and how you would write it in `R`. 

How to fit a smooth curve to my data in R?

I&#39;m parsing strings that could have any number of quoted strings inside them (I&#39;m parsing code, and trying to avoid PLY).  I want to find out if a substring is quoted, and I have the substrings index.  My initial thought was to use re to find all the matches and then figure out the range of indexes they represent.

It seems like I should use re with a regex like `\&quot;[^\&quot;]+\&quot;|&#39;[^&#39;]+&#39;` (I&#39;m avoiding dealing with triple quoted and such strings at the moment).  When I use findall() I get a list of the matching strings, which is somewhat nice, but I need indexes.

My substring might be as simple as `c`, and I need to figure out if this particular `c` is actually quoted or not.


Find the indexes of all regex matches?

I'm parsing strings that could have any number of quoted strings inside them (I'm parsing code, and trying to avoid PLY). I want to find out if a substring is quoted, and I have the substrings index. My initial thought was to use re to find all the matches and then figure out the range of indexes they represent.
It seems like I should use re with a regex like <code>\"[^\"]+\"|'[^']+'</code> (I'm avoiding dealing with triple quoted and such strings at the moment). When I use findall() I get a list of the matching strings, which is somewhat nice, but I need indexes.
My substring might be as simple as <code>c</code>, and I need to figure out if this particular <code>c</code> is actually quoted or not.

If I have an object and a method name in a string, how can I call the method?

    class Foo:
        def bar1(self):
            print 1
        def bar2(self):
            print 2
    
    def callMethod(o, name):
        ???
    
    f = Foo()
    callMethod(f, &quot;bar1&quot;)


Call a Python method by name

How to config nltk data directory from code?

I have the following tuple of tuples:

    my_choices=(
             (&#39;1&#39;,&#39;first choice&#39;),
             (&#39;2&#39;,&#39;second choice&#39;),
             (&#39;3&#39;,&#39;third choice&#39;)
    )

and I want to add another tuple to the start of it

    another_choice = (&#39;0&#39;, &#39;zero choice&#39;)

How can I do this?

the result would be:

    final_choices=(
                 (&#39;0&#39;, &#39;zero choice&#39;)
                 (&#39;1&#39;,&#39;first choice&#39;),
                 (&#39;2&#39;,&#39;second choice&#39;),
                 (&#39;3&#39;,&#39;third choice&#39;)
        )

Add another tuple to a tuple of tuples

Python has a built in function `sum`, which is effectively equivalent to:

    def sum2(iterable, start=0):
        return start + reduce(operator.add, iterable)

for all types of parameters except strings. It works for numbers and lists, for example:

     sum([1,2,3], 0) = sum2([1,2,3],0) = 6    #Note: 0 is the default value for start, but I include it for clarity
     sum({888:1}, 0) = sum2({888:1},0) = 888

Why were strings specially left out?

     sum( [&#39;foo&#39;,&#39;bar&#39;], &#39;&#39;) # TypeError: sum() can&#39;t sum strings [use &#39;&#39;.join(seq) instead]
     sum2([&#39;foo&#39;,&#39;bar&#39;], &#39;&#39;) = &#39;foobar&#39;


I seem to remember discussions in the Python list for the reason, so an explanation or a link to a thread explaining it would be fine.

**Edit**: I am aware that the standard way is to do `&quot;&quot;.join`. My question is why the option of using sum for strings was banned, and no banning was there for, say, lists.

**Edit 2**: Although I believe this is not needed given all the good answers I got, the question is: *Why does sum work on an iterable containing numbers or an iterable containing lists but not an iterable containing strings?*

Python sum, why not strings?

Is there a good, succinct/built-in way to see if all the values in an iterable are zeros?  Right now I am using `all()` with a little list comprehension, but (to me) it seems like there should be a more expressive method.  I&#39;d view this as somewhat equivalent to a `memcmp()` in C.

    values = (0, 0, 0, 0, 0)
    # Test if all items in values tuple are zero
    if all([ v == 0 for v in values ]) :
        print &#39;indeed they are&#39;

I would expect a built-in function that does something like:

    def allcmp(iter, value) :
        for item in iter :
            if item != value :
                return False
        return True

Does that function exist in python and I&#39;m just blind, or should I just stick with my original version?

# Update

I&#39;m not suggesting that `allcmp()` is the solution. It is an example of what I *think* might be more meaningful.  This isn&#39;t the place where I would suggest new built-ins for Python.

In my opinion, `all()` isn&#39;t that meaningful.  It doesn&#39;t express what &quot;all&quot; is checking for.  You could assume that `all()` takes an iterable, but it doesn&#39;t express what the function is looking for (an iterable of `bool`s that tests all of them for `True`).  What I&#39;m asking for is *some function like* my `allcmp()` that takes two parameters: an iterable and a comparison value.  I&#39;m asking if there is a built-in function that does something similar to my made up `allcmp()`.

I called mine `allcmp()` because of my C background and `memcmp()`, **the name of my made up function is irrelevant** here.

Check if all values of iterable are zero

&lt;h3&gt;The goal&lt;/h3&gt;

Today&#39;s Code Golf challenge is to create a regex parser in as few characters as possible.

&lt;h3&gt;The syntax&lt;/h3&gt;

No, I&#39;m not asking you to match Perl-style regular expressions. There&#39;s already a very reliable interpreter for those, after all! :-)

Here&#39;s all you need to know about regex syntax for this challenge:

 * A _term_ is defined as a single literal character, or a regular expression within grouping parentheses `()`.
 * The `*` (asterisk) character represents a _Kleene star operation_ on the previous TERM. This means zero or more of the previous term, concatenated together.
 * The `+` (plus) character represents a convenient shortcut: `a+` is equivalent to `aa*`, meaning one or more of the previous term.
 * The `?` (question mark) character represents zero or one of the previous term.
 * The `|` (pipe) character represents an alternation, meaning that the REGULAR EXPRESSIONS on either side can be used in the match.
 * All other characters are assumed to be literal. You may assume that all other characters are within `[0-9A-Za-z]` (i.e., all English alphanumerics).

Or, put another way: `*`/`+`/`?` have highest precedence, then concatenation, then alternation. Since alternation has lower precedence than concatenation, its use within a regex without parentheses causes it to be bound to the full regex on each side. `*` and `+` and `?`, on the other hand, would just apply to the immediately preceding term.

&lt;h3&gt;The challenge&lt;/h3&gt;

Your challenge is to write a program that will compile or interpret a regular expression (as defined above) and then test a number of strings against it.

I&#39;m leaving input up to you. My recommendation would be that the regex should probably come first, and then any number of strings to be tested against it; but if you want to make it last, that&#39;s fine. If you want to put everything in command-line arguments or into stdin, or the regex in command-line and the strings in stdin, or whatever, that&#39;s fine. Just show a usage example or two.

Output should be `true` or `false`, one per line, to reflect whether or not the regex matches.

&lt;b&gt;Notes:&lt;/b&gt;

 * I shouldn&#39;t need to say this... but don&#39;t use any regex libraries in your language! You need to compile or interpret the pattern yourself. (&lt;b&gt;Edit:&lt;/b&gt; You may use regex if it&#39;s required for splitting or joining strings. You just can&#39;t use it to directly solve the problem, e.g., converting the input regex into a language regex and using that.)
 * The regular expression must COMPLETELY match the input string for this challenge. (Equivalently, if you&#39;re familiar with Perl-like regex, assume that start- and end-of-string anchoring is in place for all matches)
 * For this challenge, all of the special characters `()*+?|` are not expected to occur literally. If one comes up in the input, it is safe to assume that no pattern can match the string in question.
 * Input strings to test should be evaluated in a case-sensitive manner.

&lt;h3&gt;The examples&lt;/h3&gt;

For the examples, I&#39;m assuming everything is done in command-line arguments, regex first. (As I said above, input is up to you.) `myregex` here represents your invocation of the program.

    &gt; myregex easy easy Easy hard
    true
    false
    false

    &gt; myregex ab*a aa abba abab b
    true
    true
    false
    false

    &gt; myregex 0*1|10 1 10 0110 00001
    true
    true
    false
    true

    &gt; myregex 0*(1|1+0) 1 10 0110 00001
    true
    true
    true
    true

    &gt; myregex a?b+|(a+b|b+a?)+ abb babab aaa aabba a b
    true
    true
    false
    true
    false
    true

&lt;b&gt;NOTE:&lt;/b&gt; Sorry, forgot to make community wiki! :-(

Code Golf: Regex parser

I have a **string** like `first url, second url, third url` and would like to extract only the `url` after the word `second` in the OS X Terminal (only the first occurrence). How can I do it?

In _my favorite editor_ I used the regex `/second (url)/` and used `$1` to extract it, I just don&#39;t know how to do it in the Terminal.

Keep in mind that `url` is an actual url, I&#39;ll be using one of these expressions to match it: &lt;https://stackoverflow.com/questions/1141848/regex-to-match-url&gt;

Extract string from string using RegEx in the Terminal

I&#39;m not even sure if this is possible or not, but here&#39;s what I&#39;d like.

    String: &quot;NS306 FEBRUARY 20078/9/201013B1-9-1Low31 AUGUST 19870&quot;

I have a text box where I type in the search parameters and they are space delimited.  Because of this, I want to return a match is string1 is in the string and then string2 is in the string, OR string2 is in the string and then string1 is in the string.  I don&#39;t care what order the strings are in, but they ALL (will somethings me more than 2) have to be in the string.

So for instance, in the provided string I would want:

    &quot;FEB Low&quot;

or

    &quot;Low FEB&quot;

...to return as a match.

I&#39;m REALLY new to regex, only read some tutorials on &lt;a href=&quot;http://perldoc.perl.org/perlretut.html&quot;&gt;here&lt;/a&gt; but that was a while ago and I need to get this done today.  Monday I start a new project which is much more important and can&#39;t be distracted with this issue.  Is there anyway to do this with regular expressions, or do I have to iterate through each part of the search filter and permutate the order?  Any and all help is extremely appreciated.  Thanks.

UPDATE:
The reason I don&#39;t want to iterate through a loop and am looking for the best performance wise is because unfortunately, the dataTable I&#39;m using calls this function on every key press, and I don&#39;t want it to bog down.

UPDATE:
Thank you everyone for your help, it was much appreciated.

CODE UPDATE:

Ultimately, this is what I went with.

    string sSearch = nvc[&quot;sSearch&quot;].ToString().Replace(&quot; &quot;, &quot;)(?=.*&quot;);
    if (sSearch != null &amp;&amp; sSearch != &quot;&quot;)
    {
      Regex r = new Regex(&quot;^(?=.*&quot; + sSearch + &quot;).*$&quot;, RegexOptions.IgnoreCase);
      _AdminList = _AdminList.Where&lt;IPB&gt;(
                                           delegate(IPB ipb)
                                           {
                                              //Concatenated all elements of IPB into a string
                                              bool returnValue = r.IsMatch(strTest); //strTest is the concatenated string
                                              return returnValue;
                                        }).ToList&lt;IPB&gt;();
                                           }
    }

The IPB class has X number of elements and in no one table throughout the site I&#39;m working on are the columns in the same order.  Therefore, I needed to any order search and I didn&#39;t want to have to write a lot of code to do it.  There were other good ideas in here, but I know my boss really likes Regex (preaches them) and therefore I thought it&#39;d be best if I went with that for now.  If for whatever reason the site&#39;s performance slips (intranet site) then I&#39;ll try another way.  Thanks everyone.

Regex: I want this AND that AND that... in any order

I would expect this line of JavaScript:

    &quot;foo bar baz&quot;.match(/^(\s*\w+)+$/)

to return something like:

    [&quot;foo bar baz&quot;, &quot;foo&quot;, &quot; bar&quot;, &quot; baz&quot;]

but instead it returns only the last captured match:

    [&quot;foo bar baz&quot;, &quot; baz&quot;]

Is there a way to get all the captured matches?


 


How to capture an arbitrary number of groups in JavaScript Regexp?

I have been trying to work out the syntax for this command:

    grep ! error_log | find /home/foo/public_html/ -mmin -60
OR: 

    grep &#39;[^error_log]&#39; | find /home/baumerf/public_html/ -mmin -60

I need to see all files that have been modified except for those named `error_log`.

[I&#39;ve read about it here](http://www.robelle.com/smugbook/regexpr.html), but only found one `not`-regex pattern.

Negative matching using grep (match lines that do not contain foo)

I am really interested in how MySQL indexes work, more specifically, how can they return the data requested without scanning the entire table?

It&#39;s off-topic, I know, but if there is someone who could explain this to me in detail, I would be very, very thankful.

How do MySQL indexes work?

How can I get get the position (indices) of the largest value in a multi-dimensional NumPy array?

Get the position of the largest value in a multi-dimensional NumPy array

For example, if I want to read the middle value from `magic(5)`, I can do so like this:

    M = magic(5);
    value = M(3,3);

to get `value == 13`. I&#39;d like to be able to do something like one of these:

    value = magic(5)(3,3);
    value = (magic(5))(3,3);

to dispense with the intermediate variable. However, MATLAB complains about `Unbalanced or unexpected parenthesis or bracket` on the first parenthesis before the `3`.

Is it possible to read values from an array/matrix without first assigning it to a variable?

How can I index a MATLAB array returned by a function without first assigning it to a local variable?

I have a table of about 100M rows that I am going to copy to alter, adding an index.  I&#39;m not so concerned with the time it takes to create the new table, but will the created index be more efficient if I alter the table before inserting any data or insert the data first and then add the index?

Is it better to create an index before filling a table with data, or after the data is in place?

Suppose I have a Javascript array, like so: 

    var test = [&#39;b&#39;, &#39;c&#39;, &#39;d&#39;, &#39;a&#39;];

I want to sort the array. Obviously, I can just do this to sort the array:

    test.sort(); //Now test is [&#39;a&#39;, &#39;b&#39;, &#39;c&#39;, &#39;d&#39;]

But what I really want is an array of indices that indicates the position of the sorted elements with respect to the original elements. I&#39;m not quite sure how to phrase this, so maybe that is why I am having trouble figuring out how to do it. 

If such a method was called sortIndices(), then what I would want is:

    var indices = test.sortIndices();
    //At this point, I want indices to be [3, 0, 1, 2].

&#39;a&#39; was at position 3, &#39;b&#39; was at 0, &#39;c&#39; was at 1 and &#39;d&#39; was a 2 in the original array. Hence, [3, 0, 1, 2].

One solution would be to sort a copy of the array, and then cycle through the sorted array and find the position of each element in the original array. But, that feels clunky. 

Is there an existing method that does what I want? If not, how would you go about writing a method that does this?





Content Type	Original Author	Original Content on Stackoverflow
Question	xitrium	View Question on Stackoverflow
Solution 1 - Python	Dave Kirby	View Answer on Stackoverflow
Solution 2 - Python	Be Champzz	View Answer on Stackoverflow
Solution 3 - Python	Omkar Rahane	View Answer on Stackoverflow

Find the indexes of all regex matches?

Python Problem Overview

Python Solutions

Solution 1 - Python

Solution 2 - Python

Solution 3 - Python

How to fit a smooth curve to my data in R?

Javascript: How to remove characters from end of string?

Attributions