Further coverage improvements

Author: rogerbinns

doc/faq.rst

@@ -65,10 +65,10 @@ There is a comprehensive test suite.  Since Python already exists it
 provides something to verify answers against.  The test harness is
 written in Python.
 
-There is over 99% line coverage **and** branch coverage in the code.
-While this doesn't guarantee the absence of bugs, it at least assures
-that the vast majority of code is tested.  (The remaining uncovered
-5 lines are some defensive coding around reflection in Java.)
+There is over 99% line coverage and similar branch coverage in the
+code.  While this doesn't guarantee the absence of bugs, it at least
+assures that the vast majority of code is tested.  (The remaining
+lines/branches are generally defensive coding.)
 
 The scope being limited (note "Mini" in the name!) there is also less
 functionality and less to go wrong.

test/errors.py

@@ -29,6 +29,14 @@
 3/{}
 #> TypeError:.*bool.*
 True/3
+#> TypeError
+3+"3"
+#> TypeError
+"3"+3
+#> TypeError
+3+[]
+#> TypeError
+[]+3
 #> ArithmeticException
 1/0
 #> TypeError:
@@ -102,6 +110,10 @@
 #> TypeError
 # see above
 del [1,2,3][2:]
+#> TypeError
+{}.update("fdsfds")
+#> TypeError
+"dsfdsf".startswith([])
 
 #> NameError
 name=3
@@ -244,6 +256,9 @@ def meth():
 #> TypeError.*callable.*
 [].sort(True)
 
+#> .*(ClassCastException|TypeError: Got str expected int).*
+[1,2,3].sort(lambda l,r: "not an int")
+
 #> AssertionError
 def meth(a,b):
     assert False
@@ -266,6 +281,11 @@ def meth(a,b):
 x=test1.call
 apply(test1.call, ["x"]*65536)
 
+#> RuntimeError.*stack.*
+def recursive(x,y,z):
+    return x+recursive(3,4,5)
+recursive(1,2,3)
+
 #> TypeError
 test1.vacall(3)
 #> TypeError

test/general.py

@@ -303,3 +303,10 @@ def foo(opop):
 assert test1.toPyReprString(True)=='True'
 assert test1.toPyReprString("a\n\t\"")==r'"a\n\t\""'
 assert test1.toPyReprString("\\")==r'"\\"'
+
+assert globals()["globals"]==globals
+
+def foo():
+    return len(locals())
+
+assert foo()==0

test/list.py

@@ -113,3 +113,12 @@
 l2.sort(cmp)
 
 assert l1==l2
+
+l1=[4,5,"4","04", {}, []]
+l1.append(l1)
+l2=l1[:]
+
+l1.sort()
+l2.sort(lambda l,r: -cmp(l,r), None, True)
+
+assert l1==l2