rubyfox-server 2.3.0.pre2

data/lib/rubyfox/server/data/lib/Lib/test/test_linuxaudiodev.py

@@ -0,0 +1,89 @@
+from test_support import verbose, findfile, TestFailed, TestSkipped
+
+import errno
+import fcntl
+import linuxaudiodev
+import os
+import sys
+import select
+import sunaudio
+import time
+import audioop
+
+SND_FORMAT_MULAW_8 = 1
+
+def play_sound_file(path):
+    fp = open(path, 'r')
+    size, enc, rate, nchannels, extra = sunaudio.gethdr(fp)
+    data = fp.read()
+    fp.close()
+
+    if enc != SND_FORMAT_MULAW_8:
+        print "Expect .au file with 8-bit mu-law samples"
+        return
+
+    try:
+        a = linuxaudiodev.open('w')
+    except linuxaudiodev.error, msg:
+        if msg[0] in (errno.EACCES, errno.ENODEV, errno.EBUSY):
+            raise TestSkipped, msg
+        raise TestFailed, msg
+
+    # convert the data to 16-bit signed
+    data = audioop.ulaw2lin(data, 2)
+
+    # set the data format
+    if sys.byteorder == 'little':
+        fmt = linuxaudiodev.AFMT_S16_LE
+    else:
+        fmt = linuxaudiodev.AFMT_S16_BE
+
+    # at least check that these methods can be invoked
+    a.bufsize()
+    a.obufcount()
+    a.obuffree()
+    a.getptr()
+    a.fileno()
+
+    # set parameters based on .au file headers
+    a.setparameters(rate, 16, nchannels, fmt)
+    a.write(data)
+    a.flush()
+    a.close()
+
+def test_errors():
+    a = linuxaudiodev.open("w")
+    size = 8
+    fmt = linuxaudiodev.AFMT_U8
+    rate = 8000
+    nchannels = 1
+    try:
+        a.setparameters(-1, size, nchannels, fmt)
+    except ValueError, msg:
+        print msg
+    try:
+        a.setparameters(rate, -2, nchannels, fmt)
+    except ValueError, msg:
+        print msg
+    try:
+        a.setparameters(rate, size, 3, fmt)
+    except ValueError, msg:
+        print msg
+    try:
+        a.setparameters(rate, size, nchannels, 177)
+    except ValueError, msg:
+        print msg
+    try:
+        a.setparameters(rate, size, nchannels, linuxaudiodev.AFMT_U16_LE)
+    except ValueError, msg:
+        print msg
+    try:
+        a.setparameters(rate, 16, nchannels, fmt)
+    except ValueError, msg:
+        print msg
+
+def test():
+    play_sound_file(findfile('audiotest.au'))
+    test_errors()
+
+test()

data/lib/rubyfox/server/data/lib/Lib/test/test_locale.py

@@ -0,0 +1,44 @@
+from test_support import verbose, TestSkipped
+import locale
+import sys
+
+if sys.platform == 'darwin':
+    raise TestSkipped("Locale support on MacOSX is minimal and cannot be tested")
+oldlocale = locale.setlocale(locale.LC_NUMERIC)
+
+tloc = "en_US"
+if sys.platform[:3] == "win":
+    tloc = "en"
+
+try:
+    locale.setlocale(locale.LC_NUMERIC, tloc)
+except locale.Error:
+    raise ImportError, "test locale %s not supported" % tloc
+
+def testformat(formatstr, value, grouping = 0, output=None):
+    if verbose:
+        if output:
+            print "%s %% %s =? %s ..." %\
+                (repr(formatstr), repr(value), repr(output)),
+        else:
+            print "%s %% %s works? ..." % (repr(formatstr), repr(value)),
+    result = locale.format(formatstr, value, grouping = grouping)
+    if output and result != output:
+        if verbose:
+            print 'no'
+        print "%s %% %s == %s != %s" %\
+              (repr(formatstr), repr(value), repr(result), repr(output))
+    else:
+        if verbose:
+            print "yes"
+
+try:
+    testformat("%f", 1024, grouping=1, output='1,024.000000')
+    testformat("%f", 102, grouping=1, output='102.000000')
+    testformat("%f", -42, grouping=1, output='-42.000000')
+    testformat("%+f", -42, grouping=1, output='-42.000000')
+    testformat("%20.f", -42, grouping=1, output='                 -42')
+    testformat("%+10.f", -4200, grouping=1, output='    -4,200')
+    testformat("%-10.f", 4200, grouping=1, output='4,200     ')
+finally:
+    locale.setlocale(locale.LC_NUMERIC, oldlocale)

data/lib/rubyfox/server/data/lib/Lib/test/test_long.py

@@ -0,0 +1,445 @@
+from test.test_support import verify, verbose, TestFailed, fcmp
+from string import join
+from random import random, randint
+
+# SHIFT should match the value in longintrepr.h for best testing.
+SHIFT = 15
+BASE = 2 ** SHIFT
+MASK = BASE - 1
+KARATSUBA_CUTOFF = 35   # from longobject.c
+
+# Max number of base BASE digits to use in test cases.  Doubling
+# this will more than double the runtime.
+MAXDIGITS = 15
+
+# build some special values
+special = map(long, [0, 1, 2, BASE, BASE >> 1])
+special.append(0x5555555555555555L)
+special.append(0xaaaaaaaaaaaaaaaaL)
+#  some solid strings of one bits
+p2 = 4L  # 0 and 1 already added
+for i in range(2*SHIFT):
+    special.append(p2 - 1)
+    p2 = p2 << 1
+del p2
+# add complements & negations
+special = special + map(lambda x: ~x, special) + \
+                    map(lambda x: -x, special)
+
+# ------------------------------------------------------------ utilities
+
+# Use check instead of assert so the test still does something
+# under -O.
+
+def check(ok, *args):
+    if not ok:
+        raise TestFailed, join(map(str, args), " ")
+
+# Get quasi-random long consisting of ndigits digits (in base BASE).
+# quasi == the most-significant digit will not be 0, and the number
+# is constructed to contain long strings of 0 and 1 bits.  These are
+# more likely than random bits to provoke digit-boundary errors.
+# The sign of the number is also random.
+
+def getran(ndigits):
+    verify(ndigits > 0)
+    nbits_hi = ndigits * SHIFT
+    nbits_lo = nbits_hi - SHIFT + 1
+    answer = 0L
+    nbits = 0
+    r = int(random() * (SHIFT * 2)) | 1  # force 1 bits to start
+    while nbits < nbits_lo:
+        bits = (r >> 1) + 1
+        bits = min(bits, nbits_hi - nbits)
+        verify(1 <= bits <= SHIFT)
+        nbits = nbits + bits
+        answer = answer << bits
+        if r & 1:
+            answer = answer | ((1 << bits) - 1)
+        r = int(random() * (SHIFT * 2))
+    verify(nbits_lo <= nbits <= nbits_hi)
+    if random() < 0.5:
+        answer = -answer
+    return answer
+
+# Get random long consisting of ndigits random digits (relative to base
+# BASE).  The sign bit is also random.
+
+def getran2(ndigits):
+    answer = 0L
+    for i in range(ndigits):
+        answer = (answer << SHIFT) | randint(0, MASK)
+    if random() < 0.5:
+        answer = -answer
+    return answer
+
+# --------------------------------------------------------------- divmod
+
+def test_division_2(x, y):
+    q, r = divmod(x, y)
+    q2, r2 = x//y, x%y
+    pab, pba = x*y, y*x
+    check(pab == pba, "multiplication does not commute for", x, y)
+    check(q == q2, "divmod returns different quotient than / for", x, y)
+    check(r == r2, "divmod returns different mod than % for", x, y)
+    check(x == q*y + r, "x != q*y + r after divmod on", x, y)
+    if y > 0:
+        check(0 <= r < y, "bad mod from divmod on", x, y)
+    else:
+        check(y < r <= 0, "bad mod from divmod on", x, y)
+
+def test_division(maxdigits=MAXDIGITS):
+    if verbose:
+        print "long / * % divmod"
+    digits = range(1, maxdigits+1) + range(KARATSUBA_CUTOFF,
+                                           KARATSUBA_CUTOFF + 14)
+    digits.append(KARATSUBA_CUTOFF * 3)
+    for lenx in digits:
+        x = getran(lenx)
+        for leny in digits:
+            y = getran(leny) or 1L
+            test_division_2(x, y)
+# ------------------------------------------------------------ karatsuba
+
+def test_karatsuba():
+
+    if verbose:
+        print "Karatsuba"
+
+    digits = range(1, 5) + range(KARATSUBA_CUTOFF, KARATSUBA_CUTOFF + 10)
+    digits.extend([KARATSUBA_CUTOFF * 10, KARATSUBA_CUTOFF * 100])
+
+    bits = [digit * SHIFT for digit in digits]
+
+    # Test products of long strings of 1 bits -- (2**x-1)*(2**y-1) ==
+    # 2**(x+y) - 2**x - 2**y + 1, so the proper result is easy to check.
+    for abits in bits:
+        a = (1L << abits) - 1
+        for bbits in bits:
+            if bbits < abits:
+                continue
+            b = (1L << bbits) - 1
+            x = a * b
+            y = ((1L << (abits + bbits)) -
+                 (1L << abits) -
+                 (1L << bbits) +
+                 1)
+            check(x == y, "bad result for", a, "*", b, x, y)
+# -------------------------------------------------------------- ~ & | ^
+
+def test_bitop_identities_1(x):
+    check(x & 0 == 0, "x & 0 != 0 for", x)
+    check(x | 0 == x, "x | 0 != x for", x)
+    check(x ^ 0 == x, "x ^ 0 != x for", x)
+    check(x & -1 == x, "x & -1 != x for", x)
+    check(x | -1 == -1, "x | -1 != -1 for", x)
+    check(x ^ -1 == ~x, "x ^ -1 != ~x for", x)
+    check(x == ~~x, "x != ~~x for", x)
+    check(x & x == x, "x & x != x for", x)
+    check(x | x == x, "x | x != x for", x)
+    check(x ^ x == 0, "x ^ x != 0 for", x)
+    check(x & ~x == 0, "x & ~x != 0 for", x)
+    check(x | ~x == -1, "x | ~x != -1 for", x)
+    check(x ^ ~x == -1, "x ^ ~x != -1 for", x)
+    check(-x == 1 + ~x == ~(x-1), "not -x == 1 + ~x == ~(x-1) for", x)
+    for n in range(2*SHIFT):
+        p2 = 2L ** n
+        check(x << n >> n == x, "x << n >> n != x for", x, n)
+        check(x // p2 == x >> n, "x // p2 != x >> n for x n p2", x, n, p2)
+        check(x * p2 == x << n, "x * p2 != x << n for x n p2", x, n, p2)
+        check(x & -p2 == x >> n << n == x & ~(p2 - 1),
+            "not x & -p2 == x >> n << n == x & ~(p2 - 1) for x n p2",
+            x, n, p2)
+
+def test_bitop_identities_2(x, y):
+    check(x & y == y & x, "x & y != y & x for", x, y)
+    check(x | y == y | x, "x | y != y | x for", x, y)
+    check(x ^ y == y ^ x, "x ^ y != y ^ x for", x, y)
+    check(x ^ y ^ x == y, "x ^ y ^ x != y for", x, y)
+    check(x & y == ~(~x | ~y), "x & y != ~(~x | ~y) for", x, y)
+    check(x | y == ~(~x & ~y), "x | y != ~(~x & ~y) for", x, y)
+    check(x ^ y == (x | y) & ~(x & y),
+         "x ^ y != (x | y) & ~(x & y) for", x, y)
+    check(x ^ y == (x & ~y) | (~x & y),
+         "x ^ y == (x & ~y) | (~x & y) for", x, y)
+    check(x ^ y == (x | y) & (~x | ~y),
+         "x ^ y == (x | y) & (~x | ~y) for", x, y)
+
+def test_bitop_identities_3(x, y, z):
+    check((x & y) & z == x & (y & z),
+         "(x & y) & z != x & (y & z) for", x, y, z)
+    check((x | y) | z == x | (y | z),
+         "(x | y) | z != x | (y | z) for", x, y, z)
+    check((x ^ y) ^ z == x ^ (y ^ z),
+         "(x ^ y) ^ z != x ^ (y ^ z) for", x, y, z)
+    check(x & (y | z) == (x & y) | (x & z),
+         "x & (y | z) != (x & y) | (x & z) for", x, y, z)
+    check(x | (y & z) == (x | y) & (x | z),
+         "x | (y & z) != (x | y) & (x | z) for", x, y, z)
+
+def test_bitop_identities(maxdigits=MAXDIGITS):
+    if verbose:
+        print "long bit-operation identities"
+    for x in special:
+        test_bitop_identities_1(x)
+    digits = range(1, maxdigits+1)
+    for lenx in digits:
+        x = getran(lenx)
+        test_bitop_identities_1(x)
+        for leny in digits:
+            y = getran(leny)
+            test_bitop_identities_2(x, y)
+            test_bitop_identities_3(x, y, getran((lenx + leny)//2))
+
+# ------------------------------------------------- hex oct repr str atol
+
+def slow_format(x, base):
+    if (x, base) == (0, 8):
+        # this is an oddball!
+        return "0L"
+    digits = []
+    sign = 0
+    if x < 0:
+        sign, x = 1, -x
+    while x:
+        x, r = divmod(x, base)
+        digits.append(int(r))
+    digits.reverse()
+    digits = digits or [0]
+    return '-'[:sign] + \
+           {8: '0', 10: '', 16: '0x'}[base] + \
+           join(map(lambda i: "0123456789ABCDEF"[i], digits), '') + \
+           "L"
+
+def test_format_1(x):
+    from string import atol
+    for base, mapper in (8, oct), (10, repr), (16, hex):
+        got = mapper(x)
+        expected = slow_format(x, base)
+        check(got == expected, mapper.__name__, "returned",
+              got, "but expected", expected, "for", x)
+        check(atol(got, 0) == x, 'atol("%s", 0) !=' % got, x)
+    # str() has to be checked a little differently since there's no
+    # trailing "L"
+    got = str(x)
+    expected = slow_format(x, 10)[:-1]
+    check(got == expected, mapper.__name__, "returned",
+          got, "but expected", expected, "for", x)
+
+def test_format(maxdigits=MAXDIGITS):
+    if verbose:
+        print "long str/hex/oct/atol"
+    for x in special:
+        test_format_1(x)
+    for i in range(10):
+        for lenx in range(1, maxdigits+1):
+            x = getran(lenx)
+            test_format_1(x)
+
+# ----------------------------------------------------------------- misc
+
+def test_misc(maxdigits=MAXDIGITS):
+    if verbose:
+        print "long miscellaneous operations"
+    import sys
+
+    # check the extremes in int<->long conversion
+    hugepos = sys.maxint
+    hugeneg = -hugepos - 1
+    hugepos_aslong = long(hugepos)
+    hugeneg_aslong = long(hugeneg)
+    check(hugepos == hugepos_aslong, "long(sys.maxint) != sys.maxint")
+    check(hugeneg == hugeneg_aslong,
+        "long(-sys.maxint-1) != -sys.maxint-1")
+
+    # long -> int should not fail for hugepos_aslong or hugeneg_aslong
+    try:
+        check(int(hugepos_aslong) == hugepos,
+              "converting sys.maxint to long and back to int fails")
+    except OverflowError:
+        raise TestFailed, "int(long(sys.maxint)) overflowed!"
+    try:
+        check(int(hugeneg_aslong) == hugeneg,
+              "converting -sys.maxint-1 to long and back to int fails")
+    except OverflowError:
+        raise TestFailed, "int(long(-sys.maxint-1)) overflowed!"
+
+    # but long -> int should overflow for hugepos+1 and hugeneg-1
+    x = hugepos_aslong + 1
+    try:
+        y = int(x)
+    except OverflowError:
+        raise TestFailed, "int(long(sys.maxint) + 1) mustn't overflow"
+    if not isinstance(y, long):
+        raise TestFailed("int(long(sys.maxint) + 1) should have returned long")
+
+    x = hugeneg_aslong - 1
+    try:
+        y = int(x)
+    except OverflowError:
+        raise TestFailed, "int(long(-sys.maxint-1) - 1) mustn't overflow"
+    if not isinstance(y, long):
+        raise TestFailed("int(long(-sys.maxint-1) - 1) should have returned long")
+
+    #XXX: this needs looking into
+    #class long2(long):
+    #    pass
+    #x = long2(1L<<100)
+    #y = int(x)
+    #if type(y) is not long:
+    #    raise TestFailed("overflowing int conversion must return long not long subtype")
+# ----------------------------------- tests of auto int->long conversion
+
+def test_auto_overflow():
+    import math, sys
+
+    if verbose:
+        print "auto-convert int->long on overflow"
+
+    special = [0, 1, 2, 3, sys.maxint-1, sys.maxint, sys.maxint+1]
+    sqrt = int(math.sqrt(sys.maxint))
+    special.extend([sqrt-1, sqrt, sqrt+1])
+    special.extend([-i for i in special])
+
+    def checkit(*args):
+        # Heavy use of nested scopes here!
+        verify(got == expected, "for %r expected %r got %r" %
+                                (args, expected, got))
+
+    for x in special:
+        longx = long(x)
+
+        expected = -longx
+        got = -x
+        checkit('-', x)
+
+        for y in special:
+            longy = long(y)
+
+            expected = longx + longy
+            got = x + y
+            checkit(x, '+', y)
+
+            expected = longx - longy
+            got = x - y
+            checkit(x, '-', y)
+
+            expected = longx * longy
+            got = x * y
+            checkit(x, '*', y)
+
+            if y:
+                expected = longx / longy
+                got = x / y
+                checkit(x, '/', y)
+
+                expected = longx // longy
+                got = x // y
+                checkit(x, '//', y)
+
+                expected = divmod(longx, longy)
+                got = divmod(longx, longy)
+                checkit(x, 'divmod', y)
+
+            if abs(y) < 5 and not (x == 0 and y < 0):
+                expected = longx ** longy
+                got = x ** y
+                checkit(x, '**', y)
+
+                for z in special:
+                    if z != 0 :
+                        if y >= 0:
+                            expected = pow(longx, longy, long(z))
+                            got = pow(x, y, z)
+                            checkit('pow', x, y, '%', z)
+                        else:
+                            try:
+                                pow(longx, longy, long(z))
+                            except TypeError:
+                                pass
+                            else:
+                                raise TestFailed("pow%r should have raised "
+                                "TypeError" % ((longx, longy, long(z)),))
+
+# ---------------------------------------- tests of long->float overflow
+
+def test_float_overflow():
+    import math
+
+    if verbose:
+        print "long->float overflow"
+
+    for x in -2.0, -1.0, 0.0, 1.0, 2.0:
+        verify(float(long(x)) == x)
+
+    shuge = '12345' * 120
+    huge = 1L << 30000
+    mhuge = -huge
+    namespace = {'huge': huge, 'mhuge': mhuge, 'shuge': shuge, 'math': math}
+    for test in ["float(huge)", "float(mhuge)",
+                 "complex(huge)", "complex(mhuge)",
+                 "complex(huge, 1)", "complex(mhuge, 1)",
+                 "complex(1, huge)", "complex(1, mhuge)",
+                 "1. + huge", "huge + 1.", "1. + mhuge", "mhuge + 1.",
+                 "1. - huge", "huge - 1.", "1. - mhuge", "mhuge - 1.",
+                 "1. * huge", "huge * 1.", "1. * mhuge", "mhuge * 1.",
+                 "1. // huge", "huge // 1.", "1. // mhuge", "mhuge // 1.",
+                 "1. / huge", "huge / 1.", "1. / mhuge", "mhuge / 1.",
+                 "1. ** huge", "huge ** 1.", "1. ** mhuge", "mhuge ** 1.",
+                 "math.sin(huge)", "math.sin(mhuge)",
+                 "math.sqrt(huge)", "math.sqrt(mhuge)", # should do better
+                 "math.floor(huge)", "math.floor(mhuge)",]:
+                 #XXX: not working
+                 #"float(shuge) == int(shuge)"]:
+
+        try:
+            eval(test, namespace)
+        except OverflowError:
+            pass
+        else:
+            raise TestFailed("expected OverflowError from %s" % test)
+
+# ---------------------------------------------- test huge log and log10
+
+def test_logs():
+    import math
+
+    if verbose:
+        print "log and log10"
+
+    LOG10E = math.log10(math.e)
+
+    for exp in range(10) + [100, 1000, 10000]:
+        value = 10 ** exp
+        log10 = math.log10(value)
+        verify(fcmp(log10, exp) == 0)
+
+        # log10(value) == exp, so log(value) == log10(value)/log10(e) ==
+        # exp/LOG10E
+        expected = exp / LOG10E
+        log = math.log(value)
+        verify(fcmp(log, expected) == 0)
+
+    for bad in -(1L << 10000), -2L, 0L:
+        try:
+            math.log(bad)
+            raise TestFailed("expected ValueError from log(<= 0)")
+        except ValueError:
+            pass
+
+        try:
+            math.log10(bad)
+            raise TestFailed("expected ValueError from log10(<= 0)")
+        except ValueError:
+            pass
+
+# ---------------------------------------------------------------- do it
+
+test_division()
+test_karatsuba()
+test_bitop_identities()
+test_format()
+test_misc()
+test_auto_overflow()
+test_float_overflow()
+test_logs()

data/lib/rubyfox/server/data/lib/Lib/test/test_long_future.py

@@ -0,0 +1,55 @@
+from __future__ import division
+# When true division is the default, get rid of this and add it to
+# test_long.py instead.  In the meantime, it's too obscure to try to
+# trick just part of test_long into using future division.
+
+from test_support import TestFailed, verify, verbose
+
+def test_true_division():
+    if verbose:
+        print "long true division"
+    huge = 1L << 40000
+    mhuge = -huge
+    verify(huge / huge == 1.0)
+    verify(mhuge / mhuge == 1.0)
+    verify(huge / mhuge == -1.0)
+    verify(mhuge / huge == -1.0)
+    verify(1 / huge == 0.0)
+    verify(1L / huge == 0.0)
+    verify(1 / mhuge == 0.0)
+    verify(1L / mhuge == 0.0)
+    verify((666 * huge + (huge >> 1)) / huge == 666.5)
+    verify((666 * mhuge + (mhuge >> 1)) / mhuge == 666.5)
+    verify((666 * huge + (huge >> 1)) / mhuge == -666.5)
+    verify((666 * mhuge + (mhuge >> 1)) / huge == -666.5)
+    verify(huge / (huge << 1) == 0.5)
+    verify((1000000 * huge) / huge == 1000000)
+
+    namespace = {'huge': huge, 'mhuge': mhuge}
+
+    for overflow in ["float(huge)", "float(mhuge)",
+                     "huge / 1", "huge / 2L", "huge / -1", "huge / -2L",
+                     "mhuge / 100", "mhuge / 100L"]:
+        try:
+            eval(overflow, namespace)
+        except OverflowError:
+            pass
+        else:
+            raise TestFailed("expected OverflowError from %r" % overflow)
+
+    for underflow in ["1 / huge", "2L / huge", "-1 / huge", "-2L / huge",
+                     "100 / mhuge", "100L / mhuge"]:
+        result = eval(underflow, namespace)
+        if result != 0.0:
+            raise TestFailed("expected underflow to 0 from %r" % underflow)
+
+    for zero in ["huge / 0", "huge / 0L",
+                 "mhuge / 0", "mhuge / 0L"]:
+        try:
+            eval(zero, namespace)
+        except ZeroDivisionError:
+            pass
+        else:
+            raise TestFailed("expected ZeroDivisionError from %r" % zero)
+
+test_true_division()

data/lib/rubyfox/server/data/lib/Lib/test/test_long_int_args.py

@@ -0,0 +1,61 @@
+"""Ensure longs passed to int arguments are handled correctly
+
+Made for Jython.
+"""
+import array
+import cStringIO
+import tempfile
+import test_support
+import unittest
+import StringIO
+
+class LongIntArgsTestCase(unittest.TestCase):
+
+    def test_array(self):
+        a = array.array('c', 'jython')
+        assert a.pop(0L) == 'j'
+
+    def test_file(self):
+        test_file = tempfile.TemporaryFile()
+        try:
+            self._test_file(test_file)
+        finally:
+            test_file.close()
+
+    def test_StringIO(self):
+        self._test_file(StringIO.StringIO())
+
+    def test_cStringIO(self):
+        self._test_file(cStringIO.StringIO())
+
+    def test_str(self):
+        self._test_basestring(str)
+
+    def test_unicode(self):
+        self._test_basestring(unicode)
+
+    def _test_basestring(self, class_):
+        s = class_('hello from jython')
+        l = long(len(s))
+        assert s.count('o', 0L, l) == 3
+        assert s.endswith('n', 0L, l) == True
+        assert s.expandtabs(1L) == s
+        assert s.find('h', 0L, l) == 0
+        assert s.index('h', 0L, l) == 0
+        assert s.rfind('h', 0L, l) == 14
+        assert s.rindex('h', 0L, l) == 14
+        assert s.split(' ', 1L) == ['hello', 'from jython']
+        assert s.startswith('jython', 11L)
+
+    def _test_file(self, test_file):
+        test_file.write('jython')
+        test_file.seek(0L)
+        assert test_file.read(1L) == 'j'
+        assert test_file.readline(2L) == 'yt'
+        assert test_file.readlines(3L) == ['hon']
+
+def test_main():
+    test_support.run_unittest(LongIntArgsTestCase)
+
+if __name__ == '__main__':
+    test_main()