mirror of
https://github.com/python/cpython.git
synced 2025-11-04 11:49:12 +00:00
805365ee39
svn+ssh://pythondev@svn.python.org/python/branches/p3yk ........ r55077 | guido.van.rossum | 2007-05-02 11:54:37 -0700 (Wed, 02 May 2007) | 2 lines Use the new print syntax, at least. ........ r55142 | fred.drake | 2007-05-04 21:27:30 -0700 (Fri, 04 May 2007) | 1 line remove old cruftiness ........ r55143 | fred.drake | 2007-05-04 21:52:16 -0700 (Fri, 04 May 2007) | 1 line make this work with the new Python ........ r55162 | neal.norwitz | 2007-05-06 22:29:18 -0700 (Sun, 06 May 2007) | 1 line Get asdl code gen working with Python 2.3. Should continue to work with 3.0 ........ r55164 | neal.norwitz | 2007-05-07 00:00:38 -0700 (Mon, 07 May 2007) | 1 line Verify checkins to p3yk (sic) branch go to 3000 list. ........ r55166 | neal.norwitz | 2007-05-07 00:12:35 -0700 (Mon, 07 May 2007) | 1 line Fix this test so it runs again by importing warnings_test properly. ........ r55167 | neal.norwitz | 2007-05-07 01:03:22 -0700 (Mon, 07 May 2007) | 8 lines So long xrange. range() now supports values that are outside -sys.maxint to sys.maxint. floats raise a TypeError. This has been sitting for a long time. It probably has some problems and needs cleanup. Objects/rangeobject.c now uses 4-space indents since it is almost completely new. ........ r55171 | guido.van.rossum | 2007-05-07 10:21:26 -0700 (Mon, 07 May 2007) | 4 lines Fix two tests that were previously depending on significant spaces at the end of a line (and before that on Python 2.x print behavior that has no exact equivalent in 3.0). ........
66 lines
2.4 KiB
Python
66 lines
2.4 KiB
Python
import unittest
|
|
from test import test_support
|
|
|
|
# Simple test to ensure that optimizations in fileobject.c deliver
|
|
# the expected results. For best testing, run this under a debug-build
|
|
# Python too (to exercise asserts in the C code).
|
|
|
|
lengths = list(range(1, 257)) + [512, 1000, 1024, 2048, 4096, 8192, 10000,
|
|
16384, 32768, 65536, 1000000]
|
|
|
|
class BufferSizeTest(unittest.TestCase):
|
|
def try_one(self, s):
|
|
# Write s + "\n" + s to file, then open it and ensure that successive
|
|
# .readline()s deliver what we wrote.
|
|
|
|
# Since C doesn't guarantee we can write/read arbitrary bytes in text
|
|
# files, use binary mode.
|
|
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])
|
|
|
|
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")
|
|
|
|
def test_nullpat(self):
|
|
self.drive_one("\0" * 1000)
|
|
|
|
def test_main():
|
|
test_support.run_unittest(BufferSizeTest)
|
|
|
|
if __name__ == "__main__":
|
|
test_main()
|