Port test_bufio to unittest.
This commit is contained in:
parent
2756278304
commit
3a3d8ea497
|
@ -1,60 +1,66 @@
|
||||||
from test.test_support import verify, TestFailed, TESTFN
|
import unittest
|
||||||
|
from test import test_support
|
||||||
|
|
||||||
# Simple test to ensure that optimizations in fileobject.c deliver
|
# Simple test to ensure that optimizations in fileobject.c deliver
|
||||||
# the expected results. For best testing, run this under a debug-build
|
# the expected results. For best testing, run this under a debug-build
|
||||||
# Python too (to exercise asserts in the C code).
|
# Python too (to exercise asserts in the C code).
|
||||||
|
|
||||||
# Repeat string 'pattern' as often as needed to reach total length
|
lengths = range(1, 257) + [512, 1000, 1024, 2048, 4096, 8192, 10000,
|
||||||
# 'length'. Then call try_one with that string, a string one larger
|
16384, 32768, 65536, 1000000]
|
||||||
# than that, and a string one smaller than that. The main driver
|
|
||||||
# feeds this all small sizes and various powers of 2, so we exercise
|
|
||||||
# all likely stdio buffer sizes, and "off by one" errors on both
|
|
||||||
# sides.
|
|
||||||
def drive_one(pattern, length):
|
|
||||||
q, r = divmod(length, len(pattern))
|
|
||||||
teststring = pattern * q + pattern[:r]
|
|
||||||
verify(len(teststring) == length)
|
|
||||||
try_one(teststring)
|
|
||||||
try_one(teststring + "x")
|
|
||||||
try_one(teststring[:-1])
|
|
||||||
|
|
||||||
# Write s + "\n" + s to file, then open it and ensure that successive
|
class BufferSizeTest(unittest.TestCase):
|
||||||
# .readline()s deliver what we wrote.
|
def try_one(self, s):
|
||||||
def try_one(s):
|
# Write s + "\n" + s to file, then open it and ensure that successive
|
||||||
# Since C doesn't guarantee we can write/read arbitrary bytes in text
|
# .readline()s deliver what we wrote.
|
||||||
# files, use binary mode.
|
|
||||||
f = open(TESTFN, "wb")
|
|
||||||
# write once with \n and once without
|
|
||||||
f.write(s)
|
|
||||||
f.write("\n")
|
|
||||||
f.write(s)
|
|
||||||
f.close()
|
|
||||||
f = open(TESTFN, "rb")
|
|
||||||
line = f.readline()
|
|
||||||
if line != s + "\n":
|
|
||||||
raise TestFailed("Expected %r got %r" % (s + "\n", line))
|
|
||||||
line = f.readline()
|
|
||||||
if line != s:
|
|
||||||
raise TestFailed("Expected %r got %r" % (s, line))
|
|
||||||
line = f.readline()
|
|
||||||
if line:
|
|
||||||
raise TestFailed("Expected EOF but got %r" % line)
|
|
||||||
f.close()
|
|
||||||
|
|
||||||
# A pattern with prime length, to avoid simple relationships with
|
# Since C doesn't guarantee we can write/read arbitrary bytes in text
|
||||||
# stdio buffer sizes.
|
# files, use binary mode.
|
||||||
primepat = "1234567890\00\01\02\03\04\05\06"
|
f = open(test_support.TESTFN, "wb")
|
||||||
|
try:
|
||||||
|
# write once with \n and once without
|
||||||
|
f.write(s)
|
||||||
|
f.write("\n")
|
||||||
|
f.write(s)
|
||||||
|
f.close()
|
||||||
|
f = open(test_support.TESTFN, "rb")
|
||||||
|
line = f.readline()
|
||||||
|
self.assertEqual(line, s + "\n")
|
||||||
|
line = f.readline()
|
||||||
|
self.assertEqual(line, s)
|
||||||
|
line = f.readline()
|
||||||
|
self.assert_(not line) # Must be at EOF
|
||||||
|
f.close()
|
||||||
|
finally:
|
||||||
|
try:
|
||||||
|
import os
|
||||||
|
os.unlink(test_support.TESTFN)
|
||||||
|
except:
|
||||||
|
pass
|
||||||
|
|
||||||
|
def drive_one(self, pattern):
|
||||||
|
for length in lengths:
|
||||||
|
# Repeat string 'pattern' as often as needed to reach total length
|
||||||
|
# 'length'. Then call try_one with that string, a string one larger
|
||||||
|
# than that, and a string one smaller than that. Try this with all
|
||||||
|
# small sizes and various powers of 2, so we exercise all likely
|
||||||
|
# stdio buffer sizes, and "off by one" errors on both sides.
|
||||||
|
q, r = divmod(length, len(pattern))
|
||||||
|
teststring = pattern * q + pattern[:r]
|
||||||
|
self.assertEqual(len(teststring), length)
|
||||||
|
self.try_one(teststring)
|
||||||
|
self.try_one(teststring + "x")
|
||||||
|
self.try_one(teststring[:-1])
|
||||||
|
|
||||||
nullpat = "\0" * 1000
|
def test_primepat(self):
|
||||||
|
# A pattern with prime length, to avoid simple relationships with
|
||||||
|
# stdio buffer sizes.
|
||||||
|
self.drive_one("1234567890\00\01\02\03\04\05\06")
|
||||||
|
|
||||||
try:
|
def test_nullpat(self):
|
||||||
for size in range(1, 257) + [512, 1000, 1024, 2048, 4096, 8192, 10000,
|
self.drive_one("\0" * 1000)
|
||||||
16384, 32768, 65536, 1000000]:
|
|
||||||
drive_one(primepat, size)
|
def test_main():
|
||||||
drive_one(nullpat, size)
|
test_support.run_unittest(BufferSizeTest)
|
||||||
finally:
|
|
||||||
try:
|
if __name__ == "__main__":
|
||||||
import os
|
test_main()
|
||||||
os.unlink(TESTFN)
|
|
||||||
except:
|
|
||||||
pass
|
|
||||||
|
|
Loading…
Reference in New Issue