update

Makefile

@@ -4,6 +4,8 @@ test:
 	@mkdir -p .cov
 	env  PYTHONDONTWRITEBYTECODE=1 PYTHONPATH=.:src:examples python3 ./src/xmutant.py -a $(tries) $(module)
 
+file=examples/heapsort.py
+file=examples/binarysearch.py
 file=examples/fact.py
 doctest:
 	env PYTHONPATH=.:src:examples python3 -m doctest -v $(file)

examples/binarysearch.py

@@ -2,6 +2,10 @@
 
 @typ.typ(items=[int], x=int)
 def binary_search(items, x):
+  """
+  >>> binary_search([3,2,4,6,1,9], 6)
+  4
+  """
   lo = 0
   hi = len(items)
   items.sort()

examples/heapsort.py

@@ -16,7 +16,7 @@ def heap_sort(items):
   [1, 2, 2]
   """
   # in pseudo-code, heapify only called once, so inline it here
-  for start in range((len(items)-2)/2, -1, -1):
+  for start in range((len(items)-2)//2, -1, -1):
     siftdown(items, start, len(items)-1)
 
   for end in range(len(items)-1, 0, -1):

src/mutants.py

@@ -317,7 +317,7 @@ def allm():
                                         "jms, %s : swap %s")
     binaryMutationRelational = SwapOpsTemplate({'BINARY_AND': '&&', 'BINARY_OR': '||'}, "bmr, %s : swap %s")
     binaryMutationNum = SwapOpsTemplate(
-        {'BINARY_FLOOR_DIVIDE': '//', 'BINARY_TRUE_DIVIDE': './.', 'BINARY_DIVIDE': '/', 'BINARY_MULTIPLY': '*',
+        {'BINARY_FLOOR_DIVIDE': '//', 'BINARY_TRUE_DIVIDE': './.', 'BINARY_TRUE_DIVIDE': '/', 'BINARY_MULTIPLY': '*',
          'BINARY_POWER': '**', 'BINARY_MODULO': '%', 'BINARY_ADD': '+', 'BINARY_SUBTRACT': '-', 'BINARY_LSHIFT': '<<',
          'BINARY_RSHIFT': '>>', 'BINARY_XOR': '^'}, "bmn, %s : swap %s")