summaryrefslogtreecommitdiff
path: root/numpy/f2py
diff options
context:
space:
mode:
authorJarrod Millman <millman@berkeley.edu>2007-10-29 09:09:59 +0000
committerJarrod Millman <millman@berkeley.edu>2007-10-29 09:09:59 +0000
commit3cb37bbdb4bdf773b7bc0098b8d0cf940288a883 (patch)
tree6baee7110d71e96ea928ea44c1fe7bc1a49a4439 /numpy/f2py
parentdea664f86f0f24f0f999945e20f9b2042d6b159c (diff)
downloadnumpy-3cb37bbdb4bdf773b7bc0098b8d0cf940288a883.tar.gz
Using the in operator to find substrings. It is shorter and easier to understand.
Diffstat (limited to 'numpy/f2py')
-rwxr-xr-xnumpy/f2py/crackfortran.py4
-rwxr-xr-xnumpy/f2py/f2py2e.py2
2 files changed, 3 insertions, 3 deletions
diff --git a/numpy/f2py/crackfortran.py b/numpy/f2py/crackfortran.py
index 7026cd01a..fd479203b 100755
--- a/numpy/f2py/crackfortran.py
+++ b/numpy/f2py/crackfortran.py
@@ -1494,7 +1494,7 @@ def postcrack(block,args=None,tab=''):
for g in block:
setmesstext(g)
g=postcrack(g,tab=tab+'\t')
- if g.has_key('name') and string.find(g['name'],'__user__')>=0: # sort user routines to appear first
+ if g.has_key('name') and '__user__' in g['name']: # sort user routines to appear first
uret.append(g)
else:
gret.append(g)
@@ -1518,7 +1518,7 @@ def postcrack(block,args=None,tab=''):
if block.has_key('use'):
useblock=block['use']
for k in useblock.keys():
- if string.find(k,'__user__')>=0:
+ if '__user__' in k:
userisdefined.append(k)
## if useblock[k].has_key('map'):
## for n in useblock[k]['map'].values():
diff --git a/numpy/f2py/f2py2e.py b/numpy/f2py/f2py2e.py
index d86327faa..b4aa7bf32 100755
--- a/numpy/f2py/f2py2e.py
+++ b/numpy/f2py/f2py2e.py
@@ -289,7 +289,7 @@ def buildmodules(list):
outmess('Building modules...\n')
modules,mnames,isusedby=[],[],{}
for i in range(len(list)):
- if string.find(list[i]['name'],'__user__')>=0:
+ if '__user__' in list[i]['name']:
cb_rules.buildcallbacks(list[i])
else:
if list[i].has_key('use'):