"hf mf sniff" low level logics works.

[proxmark3-svn] / tools / findbits.py

diff --git a/tools/findbits.py b/tools/findbits.py
index 84f4670f6cdb858197557852bace5a46b3718841..d5516e598e156acad522eada2149d9a8847a6843 100755 (executable)
--- a/tools/findbits.py
+++ b/tools/findbits.py
@@ -22,7 +22,6 @@
 
 import sys
 import os
-import string
 
 # invert binary string
 def invert(data):
@@ -30,7 +29,7 @@ def invert(data):
 
 # do the actual search
 def search(target,data):
-       location= string.find(data,target)
+       location = data.find(target)
        if location >= 0:
                print '*** Match at bit %d:' % location,
                print '%s<%s>%s' % (data[:location],target,data[location+len(target):])
@@ -85,11 +84,11 @@ def main():
                16:'HEX',
                        }
 
-       for base in 2,8,10,16:
+       for base, base_name in sorted(bases.iteritems()):
                try:
                        number= int(sys.argv[1],base)
                        print
-                       print 'Trying', bases[base]
+                       print 'Trying', base_name
                        # do BINARY as specified to preserve leading zeros
                        if base == 2:
                                domatch(sys.argv[1],sys.argv[2])