Azolex wrote:
> Python 2.5a1 (r25a1:43589, Apr 5 2006, 10:36:43) [MSC v.1310 32 bit
> (Intel)] on win32
> ...
> >>> cnt_ss = lambda s,ss,p=-1,n=-1 : n if n>p else
> >>> cnt_ss(s,ss,s.find(ss,p+1),n+1)
Ah, the pleasure of having a ternary operator in the language!
Michele Simionato
--
I wrote:
> [counting all (possibly overlapping) occurences of a substring in a string]
>
> def count_subs(s,subs,pos=0) :
> pos = 1+s.find(subs,pos)
> return pos and 1+count_subs(s,subs,pos)
> .
now to push lisp-style to the extr
Great suggestions, guys! Thanks so much!
And yes, I stand corrected. A better suited subject title would have
been "Counting all overlapping substrings".
Thanks again,
Chris
--
http://mail.python.org/mailman/listinfo/python-list
[counting all (possibly overlapping) occurences of a substring in a string]
def count_subs(s,subs,pos=0) :
pos = 1+s.find(subs,pos)
return pos and 1+count_subs(s,subs,pos)
or equivalently
def count_subs(s,subs)
pos,cnt = 0,0
while True :
pos = 1+s.find(subs,pos)
On Apr 5, 2006, at 5:07 PM, Chris Lasher wrote:
> Hi all,
> How can one count all the permutations of a substring in a string? For
> a more concrete example, let's say
> targetstr = 'AAA'
> and
> probestr = 'AA'
>
> I want to consider how many times one can count probestr ('AA') in
> targetstr ('
[EMAIL PROTECTED] wrote:
> Chris Lasher wrote:
> > Hi all,
> > How can one count all the permutations of a substring in a string? For
> > a more concrete example, let's say
> > targetstr = 'AAA'
> > and
> > probestr = 'AA'
> >
> > I want to consider how many times one can count probestr ('AA') in
Chris Lasher wrote:
> Hi all,
> How can one count all the permutations of a substring in a string? For
> a more concrete example, let's say
> targetstr = 'AAA'
> and
> probestr = 'AA'
>
> I want to consider how many times one can count probestr ('AA') in
> targetstr ('AAA'). The value in this exam
Hi all,
How can one count all the permutations of a substring in a string? For
a more concrete example, let's say
targetstr = 'AAA'
and
probestr = 'AA'
I want to consider how many times one can count probestr ('AA') in
targetstr ('AAA'). The value in this example is, obviously, 2: you can
match th
