def counter(mystring, expression):
    index = mystring.find(expression)
    if index == -1:
        return 0
    else:
        return 1 + counter(mystring[index+1:], expression)

x = 'sss'
print(counter(x, 'ss'))

def evalmystraight(): #mysevenlist is your 2 cards + community cards
    found = 0
    mystraightcount = []
    for x in range(0,7): #this changes pairs so algo can check for consecutive numbers
        if mysevenlist.count(mysevenlist[x]) != 1:
            mysevenlist[x] = mysevenlist[x] + 30 
    mysevenlist.sort()
    mysevenlist.reverse() #list in order to check for straight
    Ace = 0 #if ace in deck have to add 1 to check for wheel, list count becomes 8
    if 14 in mysevenlist:
        Ace = 1
        mysevenlist.append(1) 
    for z in range(0,3 + Ace): #this code cycles through 7 cards for A=0, 8 for A=1 
        if found == 1:
            break
        for x in range(z,z+4): #only need z+4 because 5th card added with x+1 below
            mystraightcount.append(mysevenlist[x]-mysevenlist[x+1])
            if mystraightcount == [1, 1, 1, 1]: #straight when 5 cards seperated by 1
                mystraightvalue = mysevenlist[x-3] #this is the high card of straight
                print ('straight with high card', mystraightvalue) 
                found = 1
        mystraightcount = []#clears count

#Whatever code makes aces count as both high and low
for card in hand:
     for i in range(4):
          if card+i+1 not in hand:
               break
     else:
          #If the for loop actually completes without breaking you have a straight

def count(x):
    for i in range(len(x)):
        if i >len(x)-2:
            return
        if x[i]==x[i+1]:
            yield 1
        else:
            yield 0

print sum(count('xxxakdd'))

counter = 0
init = 'sss'
check = 'ss'

for i in range(len(init)):
    if check in init:
        init = init[:-1]
        counter += 1

print(counter)

def count_substr(needle,haystack):
    return len([1 for i in range(len(haystack)) if haystack[i:i+len(needle)] ==needle])

to_test = (
    (2,'ss','sss'),
    (0,'ss','sxs'),
    (1,'ss','ssoooo'),
    (2,'ss','sssooo'),
    (1,'ss','ooooss'),
    (2,'ss','ssoooss'),
    (6,'ss','ssssossss'),
    (4,'sss','ssssossss'),
)
    

for expected,needle,haystack in to_test:
    print needle,haystack,expected,expected==find_substr(needle,haystack)

ss sss 2 True
ss sxs 0 True
ss ssoooo 1 True
ss sssooo 2 True
ss ooooss 1 True
ss ssoooss 2 True
ss ssssossss 6 True
sss ssssossss 4 True

a = [1, 2, 3]
#I could have sworn this would give an index error but it doesn't
print(a[1:5])

print object

print(object)

myhay = 'sssxxss'
myneedle = 'ss'

def counter(hay,needle):
    lowerInd = hay.find(needle)

    if lowerInd == -1:
        return 0
    else:
        return counter(hay[(lowerInd+1):],needle) + 1

print counter(myhay,myneedle)

myString = 'ss'
theirString = 'sss000'

counter = 0

while len(myString) <= len(theirString):
    if myString == theirString[-len(myString):]:
        counter += 1
    theirString = theirString[:-1]

print(counter)

myString = 'ss'
theirString = 'sss000'

counter = 0

for b in xrange( len(theirString) - len(myString) + 1 ):
    if myString == theirString[ b : b + len(myString) ]:
        counter += 1

print(counter)

x = "ss"
y = "sss000"
myTuple = (x,len(x))
theirTuple = (y, len(y))

count = 0

for b in xrange( theirTuple[1] - myTuple[1] + 1 ):
	if myTuple[0] == theirTuple[0][ b : b + myTuple[1] ]:
		count += 1
print (count)