File Manager

003 File Manager

Current Path: /usr/local/lib/python3.8/test

📁 ..
📄 Sine-1000Hz-300ms.aif(60.25 KB)
📄 __init__.py(47 B)
📄 __main__.py(41 B)
📁 __pycache__
📄 _test_multiprocessing.py(183.09 KB)
📄 allsans.pem(9.87 KB)
📄 ann_module.py(1.08 KB)
📄 ann_module2.py(519 B)
📄 ann_module3.py(448 B)
📁 audiodata
📄 audiotest.au(27.48 KB)
📄 audiotests.py(12.46 KB)
📄 audit-tests.py(8.9 KB)
📄 autotest.py(209 B)
📄 bad_coding.py(24 B)
📄 bad_coding2.py(30 B)
📄 bad_getattr.py(61 B)
📄 bad_getattr2.py(77 B)
📄 bad_getattr3.py(139 B)
📄 badcert.pem(1.88 KB)
📄 badkey.pem(2.11 KB)
📄 badsyntax_3131.py(32 B)
📄 badsyntax_future10.py(95 B)
📄 badsyntax_future3.py(172 B)
📄 badsyntax_future4.py(153 B)
📄 badsyntax_future5.py(184 B)
📄 badsyntax_future6.py(161 B)
📄 badsyntax_future7.py(196 B)
📄 badsyntax_future8.py(122 B)
📄 badsyntax_future9.py(142 B)
📄 badsyntax_pep3120.py(14 B)
📄 bisect_cmd.py(4.85 KB)
📄 bytecode_helper.py(1.56 KB)
📁 capath
📄 cfgparser.1(67 B)
📄 cfgparser.2(19.02 KB)
📄 cfgparser.3(1.55 KB)
📁 cjkencodings
📄 clinic.test(94.65 KB)
📄 cmath_testcases.txt(141.05 KB)
📄 coding20731.py(22 B)
📄 curses_tests.py(1.22 KB)
📁 data
📄 dataclass_module_1.py(837 B)
📄 dataclass_module_1_str.py(835 B)
📄 dataclass_module_2.py(756 B)
📄 dataclass_module_2_str.py(754 B)
📄 dataclass_textanno.py(126 B)
📄 datetimetester.py(239.84 KB)
📁 decimaltestdata
📄 dis_module.py(76 B)
📄 doctest_aliases.py(240 B)
📄 double_const.py(1.18 KB)
📁 dtracedata
📁 eintrdata
📄 empty.vbs(70 B)
📁 encoded_modules
📄 exception_hierarchy.txt(1.78 KB)
📄 ffdh3072.pem(2.16 KB)
📄 final_a.py(411 B)
📄 final_b.py(411 B)
📄 floating_points.txt(15.92 KB)
📄 fork_wait.py(2.53 KB)
📄 formatfloat_testcases.txt(7.45 KB)
📄 future_test1.py(229 B)
📄 future_test2.py(149 B)
📄 gdb_sample.py(153 B)
📄 good_getattr.py(198 B)
📄 idnsans.pem(9.71 KB)
📄 ieee754.txt(3.21 KB)
📁 imghdrdata
📄 imp_dummy.py(63 B)
📄 inspect_fodder.py(1.88 KB)
📄 inspect_fodder2.py(2.06 KB)
📄 keycert.passwd.pem(4.13 KB)
📄 keycert.pem(3.96 KB)
📄 keycert2.pem(3.98 KB)
📄 keycert3.pem(9.23 KB)
📄 keycert4.pem(9.24 KB)
📄 keycertecc.pem(5.5 KB)
📁 libregrtest
📄 list_tests.py(16.54 KB)
📄 lock_tests.py(28.26 KB)
📄 mailcap.txt(1.24 KB)
📄 make_ssl_certs.py(9.25 KB)
📄 mapping_tests.py(21.75 KB)
📄 math_testcases.txt(23.19 KB)
📄 memory_watchdog.py(859 B)
📄 mime.types(47.37 KB)
📄 mock_socket.py(3.53 KB)
📄 mod_generics_cache.py(1.13 KB)
📄 mp_fork_bomb.py(448 B)
📄 mp_preload.py(351 B)
📄 multibytecodec_support.py(14.17 KB)
📄 nokia.pem(1.88 KB)
📄 nosan.pem(7.54 KB)
📄 nullbytecert.pem(5.31 KB)
📄 nullcert.pem(0 B)
📄 outstanding_bugs.py(370 B)
📄 pickletester.py(135.99 KB)
📄 profilee.py(2.97 KB)
📄 pstats.pck(65.05 KB)
📄 pycacert.pem(5.53 KB)
📄 pycakey.pem(2.43 KB)
📄 pyclbr_input.py(648 B)
📄 pydoc_mod.py(713 B)
📄 pydocfodder.py(6.18 KB)
📄 pythoninfo.py(20.34 KB)
📄 randv2_32.pck(7.34 KB)
📄 randv2_64.pck(7.19 KB)
📄 randv3.pck(7.82 KB)
📄 re_tests.py(25.93 KB)
📄 recursion.tar(516 B)
📄 regrtest.py(1.34 KB)
📄 relimport.py(27 B)
📄 reperf.py(538 B)
📄 revocation.crl(800 B)
📄 sample_doctest.py(1.02 KB)
📄 sample_doctest_no_docstrings.py(227 B)
📄 sample_doctest_no_doctests.py(269 B)
📄 secp384r1.pem(256 B)
📄 selfsigned_pythontestdotnet.pem(2.08 KB)
📄 seq_tests.py(14.18 KB)
📄 sgml_input.html(8.1 KB)
📄 signalinterproctester.py(2.7 KB)
📁 sndhdrdata
📄 sortperf.py(4.69 KB)
📄 ssl_cert.pem(1.53 KB)
📄 ssl_key.passwd.pem(2.59 KB)
📄 ssl_key.pem(2.43 KB)
📄 ssl_servers.py(7.04 KB)
📄 ssltests.py(1.03 KB)
📄 string_tests.py(64.65 KB)
📁 subprocessdata
📁 support
📄 talos-2019-0758.pem(1.3 KB)
📄 test___all__.py(4.12 KB)
📄 test___future__.py(2.36 KB)
📄 test__locale.py(7.83 KB)
📄 test__opcode.py(3.03 KB)
📄 test__osx_support.py(13.66 KB)
📄 test__xxsubinterpreters.py(68.7 KB)
📄 test_abc.py(18 KB)
📄 test_abstract_numbers.py(1.49 KB)
📄 test_aifc.py(17.68 KB)
📄 test_argparse.py(172.67 KB)
📄 test_array.py(52.57 KB)
📄 test_asdl_parser.py(4.15 KB)
📄 test_ast.py(88.53 KB)
📄 test_asyncgen.py(31.44 KB)
📄 test_asynchat.py(9.28 KB)
📁 test_asyncio
📄 test_asyncore.py(25.81 KB)
📄 test_atexit.py(5.81 KB)
📄 test_audioop.py(28.24 KB)
📄 test_audit.py(4.05 KB)
📄 test_augassign.py(7.68 KB)
📄 test_base64.py(30.17 KB)
📄 test_baseexception.py(6.86 KB)
📄 test_bdb.py(41.55 KB)
📄 test_bigaddrspace.py(2.92 KB)
📄 test_bigmem.py(44.88 KB)
📄 test_binascii.py(18 KB)
📄 test_binhex.py(1.79 KB)
📄 test_binop.py(14.14 KB)
📄 test_bisect.py(13.63 KB)
📄 test_bool.py(12.48 KB)
📄 test_buffer.py(160.04 KB)
📄 test_bufio.py(2.54 KB)
📄 test_builtin.py(78.38 KB)
📄 test_bytes.py(72.23 KB)
📄 test_bz2.py(36.76 KB)
📄 test_c_locale_coercion.py(18.82 KB)
📄 test_calendar.py(48.71 KB)
📄 test_call.py(20.88 KB)
📄 test_capi.py(30.46 KB)
📄 test_cgi.py(22.15 KB)
📄 test_cgitb.py(2.5 KB)
📄 test_charmapcodec.py(1.68 KB)
📄 test_class.py(17.42 KB)
📄 test_clinic.py(21.71 KB)
📄 test_cmath.py(24.07 KB)
📄 test_cmd.py(6.1 KB)
📄 test_cmd_line.py(33.72 KB)
📄 test_cmd_line_script.py(31.46 KB)
📄 test_code.py(13.66 KB)
📄 test_code_module.py(5.51 KB)
📄 test_codeccallbacks.py(40.97 KB)
📄 test_codecencodings_cn.py(3.86 KB)
📄 test_codecencodings_hk.py(701 B)
📄 test_codecencodings_iso2022.py(1.36 KB)
📄 test_codecencodings_jp.py(4.79 KB)
📄 test_codecencodings_kr.py(2.96 KB)
📄 test_codecencodings_tw.py(681 B)
📄 test_codecmaps_cn.py(746 B)
📄 test_codecmaps_hk.py(386 B)
📄 test_codecmaps_jp.py(1.7 KB)
📄 test_codecmaps_kr.py(1.16 KB)
📄 test_codecmaps_tw.py(705 B)
📄 test_codecs.py(129.38 KB)
📄 test_codeop.py(7.97 KB)
📄 test_collections.py(83.93 KB)
📄 test_colorsys.py(3.83 KB)
📄 test_compare.py(3.82 KB)
📄 test_compile.py(36.48 KB)
📄 test_compileall.py(26.7 KB)
📄 test_complex.py(30.24 KB)
📄 test_concurrent_futures.py(44.93 KB)
📄 test_configparser.py(84.93 KB)
📄 test_contains.py(3.49 KB)
📄 test_context.py(29.33 KB)
📄 test_contextlib.py(32.54 KB)
📄 test_contextlib_async.py(14.82 KB)
📄 test_copy.py(25.81 KB)
📄 test_copyreg.py(4.39 KB)
📄 test_coroutines.py(62.52 KB)
📄 test_cprofile.py(6.33 KB)
📄 test_crashers.py(1.17 KB)
📄 test_crypt.py(3.97 KB)
📄 test_csv.py(47.77 KB)
📄 test_ctypes.py(184 B)
📄 test_curses.py(45.47 KB)
📄 test_dataclasses.py(108.8 KB)
📄 test_datetime.py(2.15 KB)
📄 test_dbm.py(6.45 KB)
📄 test_dbm_dumb.py(10.61 KB)
📄 test_dbm_gnu.py(6.22 KB)
📄 test_dbm_ndbm.py(5.05 KB)
📄 test_decimal.py(206.63 KB)
📄 test_decorators.py(9.48 KB)
📄 test_defaultdict.py(5.88 KB)
📄 test_deque.py(34.46 KB)
📄 test_descr.py(190.58 KB)
📄 test_descrtut.py(11.53 KB)
📄 test_devpoll.py(4.5 KB)
📄 test_dict.py(45 KB)
📄 test_dict_version.py(5.88 KB)
📄 test_dictcomps.py(4.42 KB)
📄 test_dictviews.py(11.68 KB)
📄 test_difflib.py(19.64 KB)
📄 test_difflib_expect.html(100.85 KB)
📄 test_dis.py(48.4 KB)
📄 test_distutils.py(375 B)
📄 test_doctest.py(98.67 KB)
📄 test_doctest.txt(300 B)
📄 test_doctest2.py(2.3 KB)
📄 test_doctest2.txt(392 B)
📄 test_doctest3.txt(82 B)
📄 test_doctest4.txt(244 B)
📄 test_docxmlrpc.py(8.67 KB)
📄 test_dtrace.py(5.23 KB)
📄 test_dummy_thread.py(9.69 KB)
📄 test_dummy_threading.py(1.7 KB)
📄 test_dynamic.py(4.29 KB)
📄 test_dynamicclassattribute.py(9.57 KB)
📄 test_eintr.py(1.32 KB)
📁 test_email
📄 test_embed.py(49.23 KB)
📄 test_ensurepip.py(9.83 KB)
📄 test_enum.py(113.68 KB)
📄 test_enumerate.py(8.46 KB)
📄 test_eof.py(1.94 KB)
📄 test_epoll.py(9.03 KB)
📄 test_errno.py(1.04 KB)
📄 test_exception_hierarchy.py(7.43 KB)
📄 test_exception_variations.py(3.86 KB)
📄 test_exceptions.py(49.81 KB)
📄 test_extcall.py(13.49 KB)
📄 test_faulthandler.py(28.13 KB)
📄 test_fcntl.py(6.21 KB)
📄 test_file.py(11.02 KB)
📄 test_file_eintr.py(10.6 KB)
📄 test_filecmp.py(8.69 KB)
📄 test_fileinput.py(37.33 KB)
📄 test_fileio.py(19.96 KB)
📄 test_finalization.py(14.66 KB)
📄 test_float.py(63.41 KB)
📄 test_flufl.py(1.32 KB)
📄 test_fnmatch.py(5.07 KB)
📄 test_fork1.py(3.67 KB)
📄 test_format.py(22.58 KB)
📄 test_fractions.py(29.83 KB)
📄 test_frame.py(5.67 KB)
📄 test_frozen.py(943 B)
📄 test_fstring.py(46.16 KB)
📄 test_ftplib.py(39.71 KB)
📄 test_funcattrs.py(13.54 KB)
📄 test_functools.py(90.59 KB)
📄 test_future.py(11.9 KB)
📄 test_future3.py(490 B)
📄 test_future4.py(222 B)
📄 test_future5.py(510 B)
📄 test_gc.py(40.49 KB)
📄 test_gdb.py(40.88 KB)
📄 test_generator_stop.py(943 B)
📄 test_generators.py(58.51 KB)
📄 test_genericclass.py(9.28 KB)
📄 test_genericpath.py(21.7 KB)
📄 test_genexps.py(7.12 KB)
📄 test_getargs2.py(50 KB)
📄 test_getopt.py(6.75 KB)
📄 test_getpass.py(6.29 KB)
📄 test_gettext.py(41.38 KB)
📄 test_glob.py(13.03 KB)
📄 test_global.py(1.31 KB)
📄 test_grammar.py(57.5 KB)
📄 test_grp.py(3.54 KB)
📄 test_gzip.py(29.9 KB)
📄 test_hash.py(11.45 KB)
📄 test_hashlib.py(39.43 KB)
📄 test_heapq.py(16.4 KB)
📄 test_hmac.py(22.24 KB)
📄 test_html.py(4.23 KB)
📄 test_htmlparser.py(33.19 KB)
📄 test_http_cookiejar.py(78.36 KB)
📄 test_http_cookies.py(18.71 KB)
📄 test_httplib.py(76.98 KB)
📄 test_httpservers.py(45.24 KB)
📄 test_idle.py(825 B)
📄 test_imaplib.py(38.95 KB)
📄 test_imghdr.py(4.66 KB)
📄 test_imp.py(17.73 KB)
📁 test_import
📁 test_importlib
📄 test_index.py(8.37 KB)
📄 test_inspect.py(151.79 KB)
📄 test_int.py(20.8 KB)
📄 test_int_literal.py(6.89 KB)
📄 test_io.py(163.94 KB)
📄 test_ioctl.py(3.2 KB)
📄 test_ipaddress.py(90.98 KB)
📄 test_isinstance.py(10.25 KB)
📄 test_iter.py(31.81 KB)
📄 test_iterlen.py(7.1 KB)
📄 test_itertools.py(101.41 KB)
📁 test_json
📄 test_keyword.py(1.23 KB)
📄 test_keywordonlyarg.py(6.85 KB)
📄 test_kqueue.py(8.76 KB)
📄 test_largefile.py(6.83 KB)
📄 test_lib2to3.py(101 B)
📄 test_linecache.py(7.79 KB)
📄 test_list.py(7.4 KB)
📄 test_listcomps.py(3.76 KB)
📄 test_lltrace.py(1012 B)
📄 test_locale.py(23.87 KB)
📄 test_logging.py(182.43 KB)
📄 test_long.py(53.21 KB)
📄 test_longexp.py(233 B)
📄 test_lzma.py(87.92 KB)
📄 test_mailbox.py(91.92 KB)
📄 test_mailcap.py(9.88 KB)
📄 test_marshal.py(20.57 KB)
📄 test_math.py(82.18 KB)
📄 test_memoryio.py(31.48 KB)
📄 test_memoryview.py(17.78 KB)
📄 test_metaclass.py(6.2 KB)
📄 test_mimetypes.py(12.14 KB)
📄 test_minidom.py(66.95 KB)
📄 test_mmap.py(29.04 KB)
📄 test_module.py(10.3 KB)
📄 test_modulefinder.py(12.2 KB)
📄 test_msilib.py(5.06 KB)
📄 test_multibytecodec.py(15.04 KB)
📄 test_multiprocessing_fork.py(477 B)
📄 test_multiprocessing_forkserver.py(392 B)
📄 test_multiprocessing_main_handling.py(11.45 KB)
📄 test_multiprocessing_spawn.py(277 B)
📄 test_named_expressions.py(16.51 KB)
📄 test_netrc.py(5.96 KB)
📄 test_nis.py(1.13 KB)
📄 test_nntplib.py(61.7 KB)
📄 test_normalization.py(3.66 KB)
📄 test_ntpath.py(35.08 KB)
📄 test_numeric_tower.py(7.18 KB)
📄 test_opcodes.py(3.61 KB)
📄 test_openpty.py(600 B)
📄 test_operator.py(23.54 KB)
📄 test_optparse.py(60.99 KB)
📄 test_ordered_dict.py(30.22 KB)
📄 test_os.py(150.53 KB)
📄 test_ossaudiodev.py(7.06 KB)
📄 test_osx_env.py(1.3 KB)
📄 test_parser.py(35.72 KB)
📄 test_pathlib.py(97.12 KB)
📄 test_pdb.py(55.36 KB)
📄 test_peepholer.py(19.41 KB)
📄 test_pickle.py(19.16 KB)
📄 test_picklebuffer.py(4.96 KB)
📄 test_pickletools.py(4.33 KB)
📄 test_pipes.py(6.59 KB)
📄 test_pkg.py(9.59 KB)
📄 test_pkgimport.py(2.67 KB)
📄 test_pkgutil.py(19.25 KB)
📄 test_platform.py(14.31 KB)
📄 test_plistlib.py(41.43 KB)
📄 test_poll.py(7.23 KB)
📄 test_popen.py(1.98 KB)
📄 test_poplib.py(16.97 KB)
📄 test_positional_only_arg.py(17.5 KB)
📄 test_posix.py(75.76 KB)
📄 test_posixpath.py(29.19 KB)
📄 test_pow.py(5.44 KB)
📄 test_pprint.py(43.85 KB)
📄 test_print.py(7.37 KB)
📄 test_profile.py(8.72 KB)
📄 test_property.py(8.77 KB)
📄 test_pstats.py(3.04 KB)
📄 test_pty.py(11.97 KB)
📄 test_pulldom.py(12.66 KB)
📄 test_pwd.py(4.17 KB)
📄 test_py_compile.py(10.78 KB)
📄 test_pyclbr.py(10 KB)
📄 test_pydoc.py(56.98 KB)
📄 test_pyexpat.py(26.54 KB)
📄 test_queue.py(20.36 KB)
📄 test_quopri.py(7.78 KB)
📄 test_raise.py(12.86 KB)
📄 test_random.py(45.59 KB)
📄 test_range.py(23.35 KB)
📄 test_re.py(106.41 KB)
📄 test_readline.py(12.95 KB)
📄 test_regrtest.py(46.36 KB)
📄 test_repl.py(3.96 KB)
📄 test_reprlib.py(15.12 KB)
📄 test_resource.py(7.02 KB)
📄 test_richcmp.py(11.91 KB)
📄 test_rlcompleter.py(6.3 KB)
📄 test_robotparser.py(10.69 KB)
📄 test_runpy.py(33.86 KB)
📄 test_sax.py(46.9 KB)
📄 test_sched.py(6.41 KB)
📄 test_scope.py(19.7 KB)
📄 test_script_helper.py(5.78 KB)
📄 test_secrets.py(4.28 KB)
📄 test_select.py(2.69 KB)
📄 test_selectors.py(17.79 KB)
📄 test_set.py(64.41 KB)
📄 test_setcomps.py(3.7 KB)
📄 test_shelve.py(6.24 KB)
📄 test_shlex.py(13.29 KB)
📄 test_shutil.py(101.55 KB)
📄 test_signal.py(46.62 KB)
📄 test_site.py(24.71 KB)
📄 test_slice.py(8.25 KB)
📄 test_smtpd.py(40.14 KB)
📄 test_smtplib.py(56.51 KB)
📄 test_smtpnet.py(2.87 KB)
📄 test_sndhdr.py(1.43 KB)
📄 test_socket.py(232.71 KB)
📄 test_socketserver.py(17.7 KB)
📄 test_sort.py(13.42 KB)
📄 test_source_encoding.py(7.89 KB)
📄 test_spwd.py(2.71 KB)
📄 test_sqlite.py(948 B)
📄 test_ssl.py(203.3 KB)
📄 test_startfile.py(1.29 KB)
📄 test_stat.py(8.3 KB)
📄 test_statistics.py(106.5 KB)
📄 test_strftime.py(7.54 KB)
📄 test_string.py(19.8 KB)
📄 test_string_literals.py(9.88 KB)
📄 test_stringprep.py(3.04 KB)
📄 test_strptime.py(34.42 KB)
📄 test_strtod.py(20.06 KB)
📄 test_struct.py(34.41 KB)
📄 test_structmembers.py(4.7 KB)
📄 test_structseq.py(3.87 KB)
📄 test_subclassinit.py(8.12 KB)
📄 test_subprocess.py(142.64 KB)
📄 test_sunau.py(6.07 KB)
📄 test_sundry.py(2.07 KB)
📄 test_super.py(9.6 KB)
📄 test_support.py(24.12 KB)
📄 test_symbol.py(2.06 KB)
📄 test_symtable.py(9.13 KB)
📄 test_syntax.py(25.75 KB)
📄 test_sys.py(55.24 KB)
📄 test_sys_setprofile.py(12.31 KB)
📄 test_sys_settrace.py(43.08 KB)
📄 test_sysconfig.py(17.01 KB)
📄 test_syslog.py(1.15 KB)
📄 test_tabnanny.py(13.44 KB)
📄 test_tarfile.py(98.31 KB)
📄 test_tcl.py(30.74 KB)
📄 test_telnetlib.py(12.7 KB)
📄 test_tempfile.py(52.57 KB)
📄 test_textwrap.py(38.84 KB)
📄 test_thread.py(8.41 KB)
📄 test_threaded_import.py(8.9 KB)
📄 test_threadedtempfile.py(1.85 KB)
📄 test_threading.py(47.52 KB)
📄 test_threading_local.py(6.09 KB)
📄 test_threadsignals.py(10.09 KB)
📄 test_time.py(38.43 KB)
📄 test_timeit.py(14.8 KB)
📄 test_timeout.py(11.19 KB)
📄 test_tix.py(756 B)
📄 test_tk.py(362 B)
📄 test_tokenize.py(63.18 KB)
📁 test_tools
📄 test_trace.py(19.89 KB)
📄 test_traceback.py(46.97 KB)
📄 test_tracemalloc.py(37.41 KB)
📄 test_ttk_guionly.py(746 B)
📄 test_ttk_textonly.py(299 B)
📄 test_tuple.py(18.85 KB)
📄 test_turtle.py(12.79 KB)
📄 test_type_comments.py(10.13 KB)
📄 test_typechecks.py(2.55 KB)
📄 test_types.py(58 KB)
📄 test_typing.py(122.05 KB)
📄 test_ucn.py(9.35 KB)
📄 test_unary.py(1.63 KB)
📄 test_unicode.py(129.94 KB)
📄 test_unicode_file.py(5.74 KB)
📄 test_unicode_file_functions.py(6.84 KB)
📄 test_unicode_identifiers.py(891 B)
📄 test_unicodedata.py(12.7 KB)
📄 test_unittest.py(286 B)
📄 test_univnewlines.py(3.83 KB)
📄 test_unpack.py(3.01 KB)
📄 test_unpack_ex.py(8.73 KB)
📄 test_urllib.py(71.24 KB)
📄 test_urllib2.py(76.95 KB)
📄 test_urllib2_localnet.py(24.24 KB)
📄 test_urllib2net.py(12.39 KB)
📄 test_urllib_response.py(1.69 KB)
📄 test_urllibnet.py(8.9 KB)
📄 test_urlparse.py(64.87 KB)
📄 test_userdict.py(7.64 KB)
📄 test_userlist.py(1.97 KB)
📄 test_userstring.py(2.4 KB)
📄 test_utf8_mode.py(9.22 KB)
📄 test_utf8source.py(1.15 KB)
📄 test_uu.py(8.02 KB)
📄 test_uuid.py(35.74 KB)
📄 test_venv.py(20.46 KB)
📄 test_wait3.py(1.16 KB)
📄 test_wait4.py(1.15 KB)
📁 test_warnings
📄 test_wave.py(6.57 KB)
📄 test_weakref.py(69.47 KB)
📄 test_weakset.py(15.03 KB)
📄 test_webbrowser.py(10.47 KB)
📄 test_winconsoleio.py(6.14 KB)
📄 test_winreg.py(21.38 KB)
📄 test_winsound.py(4.57 KB)
📄 test_with.py(25.78 KB)
📄 test_wsgiref.py(30.1 KB)
📄 test_xdrlib.py(2.17 KB)
📄 test_xml_dom_minicompat.py(4.18 KB)
📄 test_xml_etree.py(147.87 KB)
📄 test_xml_etree_c.py(8.06 KB)
📄 test_xmlrpc.py(55.96 KB)
📄 test_xmlrpc_net.py(1015 B)
📄 test_xxtestfuzz.py(670 B)
📄 test_yield_from.py(30.01 KB)
📄 test_zipapp.py(15.92 KB)
📄 test_zipfile.py(115.45 KB)
📄 test_zipfile64.py(5.8 KB)
📄 test_zipimport.py(29.28 KB)
📄 test_zipimport_support.py(10.44 KB)
📄 test_zlib.py(34.48 KB)
📄 testcodec.py(1.02 KB)
📄 testtar.tar(425 KB)
📄 tf_inherit_check.py(714 B)
📄 threaded_import_hangers.py(1.45 KB)
📄 time_hashlib.py(2.87 KB)
📄 tokenize_tests-latin1-coding-cookie-and-utf8-bom-sig.txt(443 B)
📄 tokenize_tests-no-coding-cookie-and-utf8-bom-sig-only.txt(302 B)
📄 tokenize_tests-utf8-coding-cookie-and-no-utf8-bom-sig.txt(421 B)
📄 tokenize_tests-utf8-coding-cookie-and-utf8-bom-sig.txt(326 B)
📄 tokenize_tests.txt(2.65 KB)
📁 tracedmodules
📄 win_console_handler.py(1.38 KB)
📁 xmltestdata
📄 xmltests.py(499 B)
📄 zip_cp437_header.zip(270 B)
📄 zipdir.zip(374 B)
📁 ziptestdata

Editing: test_deque.py

from collections import deque
import unittest
from test import support, seq_tests
import gc
import weakref
import copy
import pickle
import random
import struct

BIG = 100000

def fail():
    raise SyntaxError
    yield 1

class BadCmp:
    def __eq__(self, other):
        raise RuntimeError

class MutateCmp:
    def __init__(self, deque, result):
        self.deque = deque
        self.result = result
    def __eq__(self, other):
        self.deque.clear()
        return self.result

class TestBasic(unittest.TestCase):

def test_basics(self):
        d = deque(range(-5125, -5000))
        d.__init__(range(200))
        for i in range(200, 400):
            d.append(i)
        for i in reversed(range(-200, 0)):
            d.appendleft(i)
        self.assertEqual(list(d), list(range(-200, 400)))
        self.assertEqual(len(d), 600)

left = [d.popleft() for i in range(250)]
        self.assertEqual(left, list(range(-200, 50)))
        self.assertEqual(list(d), list(range(50, 400)))

right = [d.pop() for i in range(250)]
        right.reverse()
        self.assertEqual(right, list(range(150, 400)))
        self.assertEqual(list(d), list(range(50, 150)))

def test_maxlen(self):
        self.assertRaises(ValueError, deque, 'abc', -1)
        self.assertRaises(ValueError, deque, 'abc', -2)
        it = iter(range(10))
        d = deque(it, maxlen=3)
        self.assertEqual(list(it), [])
        self.assertEqual(repr(d), 'deque([7, 8, 9], maxlen=3)')
        self.assertEqual(list(d), [7, 8, 9])
        self.assertEqual(d, deque(range(10), 3))
        d.append(10)
        self.assertEqual(list(d), [8, 9, 10])
        d.appendleft(7)
        self.assertEqual(list(d), [7, 8, 9])
        d.extend([10, 11])
        self.assertEqual(list(d), [9, 10, 11])
        d.extendleft([8, 7])
        self.assertEqual(list(d), [7, 8, 9])
        d = deque(range(200), maxlen=10)
        d.append(d)
        support.unlink(support.TESTFN)
        fo = open(support.TESTFN, "w")
        try:
            fo.write(str(d))
            fo.close()
            fo = open(support.TESTFN, "r")
            self.assertEqual(fo.read(), repr(d))
        finally:
            fo.close()
            support.unlink(support.TESTFN)

d = deque(range(10), maxlen=None)
        self.assertEqual(repr(d), 'deque([0, 1, 2, 3, 4, 5, 6, 7, 8, 9])')
        fo = open(support.TESTFN, "w")
        try:
            fo.write(str(d))
            fo.close()
            fo = open(support.TESTFN, "r")
            self.assertEqual(fo.read(), repr(d))
        finally:
            fo.close()
            support.unlink(support.TESTFN)

def test_maxlen_zero(self):
        it = iter(range(100))
        deque(it, maxlen=0)
        self.assertEqual(list(it), [])

it = iter(range(100))
        d = deque(maxlen=0)
        d.extend(it)
        self.assertEqual(list(it), [])

it = iter(range(100))
        d = deque(maxlen=0)
        d.extendleft(it)
        self.assertEqual(list(it), [])

def test_maxlen_attribute(self):
        self.assertEqual(deque().maxlen, None)
        self.assertEqual(deque('abc').maxlen, None)
        self.assertEqual(deque('abc', maxlen=4).maxlen, 4)
        self.assertEqual(deque('abc', maxlen=2).maxlen, 2)
        self.assertEqual(deque('abc', maxlen=0).maxlen, 0)
        with self.assertRaises(AttributeError):
            d = deque('abc')
            d.maxlen = 10

def test_count(self):
        for s in ('', 'abracadabra', 'simsalabim'*500+'abc'):
            s = list(s)
            d = deque(s)
            for letter in 'abcdefghijklmnopqrstuvwxyz':
                self.assertEqual(s.count(letter), d.count(letter), (s, d, letter))
        self.assertRaises(TypeError, d.count)       # too few args
        self.assertRaises(TypeError, d.count, 1, 2) # too many args
        class BadCompare:
            def __eq__(self, other):
                raise ArithmeticError
        d = deque([1, 2, BadCompare(), 3])
        self.assertRaises(ArithmeticError, d.count, 2)
        d = deque([1, 2, 3])
        self.assertRaises(ArithmeticError, d.count, BadCompare())
        class MutatingCompare:
            def __eq__(self, other):
                self.d.pop()
                return True
        m = MutatingCompare()
        d = deque([1, 2, 3, m, 4, 5])
        m.d = d
        self.assertRaises(RuntimeError, d.count, 3)

# test issue11004
        # block advance failed after rotation aligned elements on right side of block
        d = deque([None]*16)
        for i in range(len(d)):
            d.rotate(-1)
        d.rotate(1)
        self.assertEqual(d.count(1), 0)
        self.assertEqual(d.count(None), 16)

def test_comparisons(self):
        d = deque('xabc'); d.popleft()
        for e in [d, deque('abc'), deque('ab'), deque(), list(d)]:
            self.assertEqual(d==e, type(d)==type(e) and list(d)==list(e))
            self.assertEqual(d!=e, not(type(d)==type(e) and list(d)==list(e)))

args = map(deque, ('', 'a', 'b', 'ab', 'ba', 'abc', 'xba', 'xabc', 'cba'))
        for x in args:
            for y in args:
                self.assertEqual(x == y, list(x) == list(y), (x,y))
                self.assertEqual(x != y, list(x) != list(y), (x,y))
                self.assertEqual(x <  y, list(x) <  list(y), (x,y))
                self.assertEqual(x <= y, list(x) <= list(y), (x,y))
                self.assertEqual(x >  y, list(x) >  list(y), (x,y))
                self.assertEqual(x >= y, list(x) >= list(y), (x,y))

def test_contains(self):
        n = 200

d = deque(range(n))
        for i in range(n):
            self.assertTrue(i in d)
        self.assertTrue((n+1) not in d)

# Test detection of mutation during iteration
        d = deque(range(n))
        d[n//2] = MutateCmp(d, False)
        with self.assertRaises(RuntimeError):
            n in d

# Test detection of comparison exceptions
        d = deque(range(n))
        d[n//2] = BadCmp()
        with self.assertRaises(RuntimeError):
            n in d

def test_contains_count_stop_crashes(self):
        class A:
            def __eq__(self, other):
                d.clear()
                return NotImplemented
        d = deque([A(), A()])
        with self.assertRaises(RuntimeError):
            _ = 3 in d
        d = deque([A(), A()])
        with self.assertRaises(RuntimeError):
            _ = d.count(3)

def test_extend(self):
        d = deque('a')
        self.assertRaises(TypeError, d.extend, 1)
        d.extend('bcd')
        self.assertEqual(list(d), list('abcd'))
        d.extend(d)
        self.assertEqual(list(d), list('abcdabcd'))

def test_add(self):
        d = deque()
        e = deque('abc')
        f = deque('def')
        self.assertEqual(d + d, deque())
        self.assertEqual(e + f, deque('abcdef'))
        self.assertEqual(e + e, deque('abcabc'))
        self.assertEqual(e + d, deque('abc'))
        self.assertEqual(d + e, deque('abc'))
        self.assertIsNot(d + d, deque())
        self.assertIsNot(e + d, deque('abc'))
        self.assertIsNot(d + e, deque('abc'))

g = deque('abcdef', maxlen=4)
        h = deque('gh')
        self.assertEqual(g + h, deque('efgh'))

with self.assertRaises(TypeError):
            deque('abc') + 'def'

def test_iadd(self):
        d = deque('a')
        d += 'bcd'
        self.assertEqual(list(d), list('abcd'))
        d += d
        self.assertEqual(list(d), list('abcdabcd'))

def test_extendleft(self):
        d = deque('a')
        self.assertRaises(TypeError, d.extendleft, 1)
        d.extendleft('bcd')
        self.assertEqual(list(d), list(reversed('abcd')))
        d.extendleft(d)
        self.assertEqual(list(d), list('abcddcba'))
        d = deque()
        d.extendleft(range(1000))
        self.assertEqual(list(d), list(reversed(range(1000))))
        self.assertRaises(SyntaxError, d.extendleft, fail())

def test_getitem(self):
        n = 200
        d = deque(range(n))
        l = list(range(n))
        for i in range(n):
            d.popleft()
            l.pop(0)
            if random.random() < 0.5:
                d.append(i)
                l.append(i)
            for j in range(1-len(l), len(l)):
                assert d[j] == l[j]

d = deque('superman')
        self.assertEqual(d[0], 's')
        self.assertEqual(d[-1], 'n')
        d = deque()
        self.assertRaises(IndexError, d.__getitem__, 0)
        self.assertRaises(IndexError, d.__getitem__, -1)

def test_index(self):
        for n in 1, 2, 30, 40, 200:

d = deque(range(n))
            for i in range(n):
                self.assertEqual(d.index(i), i)

with self.assertRaises(ValueError):
                d.index(n+1)

# Test detection of mutation during iteration
            d = deque(range(n))
            d[n//2] = MutateCmp(d, False)
            with self.assertRaises(RuntimeError):
                d.index(n)

# Test detection of comparison exceptions
            d = deque(range(n))
            d[n//2] = BadCmp()
            with self.assertRaises(RuntimeError):
                d.index(n)

# Test start and stop arguments behavior matches list.index()
        elements = 'ABCDEFGHI'
        nonelement = 'Z'
        d = deque(elements * 2)
        s = list(elements * 2)
        for start in range(-5 - len(s)*2, 5 + len(s) * 2):
            for stop in range(-5 - len(s)*2, 5 + len(s) * 2):
                for element in elements + 'Z':
                    try:
                        target = s.index(element, start, stop)
                    except ValueError:
                        with self.assertRaises(ValueError):
                            d.index(element, start, stop)
                    else:
                        self.assertEqual(d.index(element, start, stop), target)

# Test large start argument
        d = deque(range(0, 10000, 10))
        for step in range(100):
            i = d.index(8500, 700)
            self.assertEqual(d[i], 8500)
            # Repeat test with a different internal offset
            d.rotate()

def test_index_bug_24913(self):
        d = deque('A' * 3)
        with self.assertRaises(ValueError):
            i = d.index("Hello world", 0, 4)

def test_insert(self):
        # Test to make sure insert behaves like lists
        elements = 'ABCDEFGHI'
        for i in range(-5 - len(elements)*2, 5 + len(elements) * 2):
            d = deque('ABCDEFGHI')
            s = list('ABCDEFGHI')
            d.insert(i, 'Z')
            s.insert(i, 'Z')
            self.assertEqual(list(d), s)

def test_insert_bug_26194(self):
        data = 'ABC'
        d = deque(data, maxlen=len(data))
        with self.assertRaises(IndexError):
            d.insert(2, None)

elements = 'ABCDEFGHI'
        for i in range(-len(elements), len(elements)):
            d = deque(elements, maxlen=len(elements)+1)
            d.insert(i, 'Z')
            if i >= 0:
                self.assertEqual(d[i], 'Z')
            else:
                self.assertEqual(d[i-1], 'Z')

def test_imul(self):
        for n in (-10, -1, 0, 1, 2, 10, 1000):
            d = deque()
            d *= n
            self.assertEqual(d, deque())
            self.assertIsNone(d.maxlen)

for n in (-10, -1, 0, 1, 2, 10, 1000):
            d = deque('a')
            d *= n
            self.assertEqual(d, deque('a' * n))
            self.assertIsNone(d.maxlen)

for n in (-10, -1, 0, 1, 2, 10, 499, 500, 501, 1000):
            d = deque('a', 500)
            d *= n
            self.assertEqual(d, deque('a' * min(n, 500)))
            self.assertEqual(d.maxlen, 500)

for n in (-10, -1, 0, 1, 2, 10, 1000):
            d = deque('abcdef')
            d *= n
            self.assertEqual(d, deque('abcdef' * n))
            self.assertIsNone(d.maxlen)

for n in (-10, -1, 0, 1, 2, 10, 499, 500, 501, 1000):
            d = deque('abcdef', 500)
            d *= n
            self.assertEqual(d, deque(('abcdef' * n)[-500:]))
            self.assertEqual(d.maxlen, 500)

def test_mul(self):
        d = deque('abc')
        self.assertEqual(d * -5, deque())
        self.assertEqual(d * 0, deque())
        self.assertEqual(d * 1, deque('abc'))
        self.assertEqual(d * 2, deque('abcabc'))
        self.assertEqual(d * 3, deque('abcabcabc'))
        self.assertIsNot(d * 1, d)

self.assertEqual(deque() * 0, deque())
        self.assertEqual(deque() * 1, deque())
        self.assertEqual(deque() * 5, deque())

self.assertEqual(-5 * d, deque())
        self.assertEqual(0 * d, deque())
        self.assertEqual(1 * d, deque('abc'))
        self.assertEqual(2 * d, deque('abcabc'))
        self.assertEqual(3 * d, deque('abcabcabc'))

d = deque('abc', maxlen=5)
        self.assertEqual(d * -5, deque())
        self.assertEqual(d * 0, deque())
        self.assertEqual(d * 1, deque('abc'))
        self.assertEqual(d * 2, deque('bcabc'))
        self.assertEqual(d * 30, deque('bcabc'))

def test_setitem(self):
        n = 200
        d = deque(range(n))
        for i in range(n):
            d[i] = 10 * i
        self.assertEqual(list(d), [10*i for i in range(n)])
        l = list(d)
        for i in range(1-n, 0, -1):
            d[i] = 7*i
            l[i] = 7*i
        self.assertEqual(list(d), l)

def test_delitem(self):
        n = 500         # O(n**2) test, don't make this too big
        d = deque(range(n))
        self.assertRaises(IndexError, d.__delitem__, -n-1)
        self.assertRaises(IndexError, d.__delitem__, n)
        for i in range(n):
            self.assertEqual(len(d), n-i)
            j = random.randrange(-len(d), len(d))
            val = d[j]
            self.assertIn(val, d)
            del d[j]
            self.assertNotIn(val, d)
        self.assertEqual(len(d), 0)

def test_reverse(self):
        n = 500         # O(n**2) test, don't make this too big
        data = [random.random() for i in range(n)]
        for i in range(n):
            d = deque(data[:i])
            r = d.reverse()
            self.assertEqual(list(d), list(reversed(data[:i])))
            self.assertIs(r, None)
            d.reverse()
            self.assertEqual(list(d), data[:i])
        self.assertRaises(TypeError, d.reverse, 1)          # Arity is zero

def test_rotate(self):
        s = tuple('abcde')
        n = len(s)

d = deque(s)
        d.rotate(1)             # verify rot(1)
        self.assertEqual(''.join(d), 'eabcd')

d = deque(s)
        d.rotate(-1)            # verify rot(-1)
        self.assertEqual(''.join(d), 'bcdea')
        d.rotate()              # check default to 1
        self.assertEqual(tuple(d), s)

for i in range(n*3):
            d = deque(s)
            e = deque(d)
            d.rotate(i)         # check vs. rot(1) n times
            for j in range(i):
                e.rotate(1)
            self.assertEqual(tuple(d), tuple(e))
            d.rotate(-i)        # check that it works in reverse
            self.assertEqual(tuple(d), s)
            e.rotate(n-i)       # check that it wraps forward
            self.assertEqual(tuple(e), s)

for i in range(n*3):
            d = deque(s)
            e = deque(d)
            d.rotate(-i)
            for j in range(i):
                e.rotate(-1)    # check vs. rot(-1) n times
            self.assertEqual(tuple(d), tuple(e))
            d.rotate(i)         # check that it works in reverse
            self.assertEqual(tuple(d), s)
            e.rotate(i-n)       # check that it wraps backaround
            self.assertEqual(tuple(e), s)

d = deque(s)
        e = deque(s)
        e.rotate(BIG+17)        # verify on long series of rotates
        dr = d.rotate
        for i in range(BIG+17):
            dr()
        self.assertEqual(tuple(d), tuple(e))

self.assertRaises(TypeError, d.rotate, 'x')   # Wrong arg type
        self.assertRaises(TypeError, d.rotate, 1, 10) # Too many args

d = deque()
        d.rotate()              # rotate an empty deque
        self.assertEqual(d, deque())

def test_len(self):
        d = deque('ab')
        self.assertEqual(len(d), 2)
        d.popleft()
        self.assertEqual(len(d), 1)
        d.pop()
        self.assertEqual(len(d), 0)
        self.assertRaises(IndexError, d.pop)
        self.assertEqual(len(d), 0)
        d.append('c')
        self.assertEqual(len(d), 1)
        d.appendleft('d')
        self.assertEqual(len(d), 2)
        d.clear()
        self.assertEqual(len(d), 0)

def test_underflow(self):
        d = deque()
        self.assertRaises(IndexError, d.pop)
        self.assertRaises(IndexError, d.popleft)

def test_clear(self):
        d = deque(range(100))
        self.assertEqual(len(d), 100)
        d.clear()
        self.assertEqual(len(d), 0)
        self.assertEqual(list(d), [])
        d.clear()               # clear an empty deque
        self.assertEqual(list(d), [])

def test_remove(self):
        d = deque('abcdefghcij')
        d.remove('c')
        self.assertEqual(d, deque('abdefghcij'))
        d.remove('c')
        self.assertEqual(d, deque('abdefghij'))
        self.assertRaises(ValueError, d.remove, 'c')
        self.assertEqual(d, deque('abdefghij'))

# Handle comparison errors
        d = deque(['a', 'b', BadCmp(), 'c'])
        e = deque(d)
        self.assertRaises(RuntimeError, d.remove, 'c')
        for x, y in zip(d, e):
            # verify that original order and values are retained.
            self.assertTrue(x is y)

# Handle evil mutator
        for match in (True, False):
            d = deque(['ab'])
            d.extend([MutateCmp(d, match), 'c'])
            self.assertRaises(IndexError, d.remove, 'c')
            self.assertEqual(d, deque())

def test_repr(self):
        d = deque(range(200))
        e = eval(repr(d))
        self.assertEqual(list(d), list(e))
        d.append(d)
        self.assertIn('...', repr(d))

def test_print(self):
        d = deque(range(200))
        d.append(d)
        try:
            support.unlink(support.TESTFN)
            fo = open(support.TESTFN, "w")
            print(d, file=fo, end='')
            fo.close()
            fo = open(support.TESTFN, "r")
            self.assertEqual(fo.read(), repr(d))
        finally:
            fo.close()
            support.unlink(support.TESTFN)

def test_init(self):
        self.assertRaises(TypeError, deque, 'abc', 2, 3);
        self.assertRaises(TypeError, deque, 1);

def test_hash(self):
        self.assertRaises(TypeError, hash, deque('abc'))

def test_long_steadystate_queue_popleft(self):
        for size in (0, 1, 2, 100, 1000):
            d = deque(range(size))
            append, pop = d.append, d.popleft
            for i in range(size, BIG):
                append(i)
                x = pop()
                if x != i - size:
                    self.assertEqual(x, i-size)
            self.assertEqual(list(d), list(range(BIG-size, BIG)))

def test_long_steadystate_queue_popright(self):
        for size in (0, 1, 2, 100, 1000):
            d = deque(reversed(range(size)))
            append, pop = d.appendleft, d.pop
            for i in range(size, BIG):
                append(i)
                x = pop()
                if x != i - size:
                    self.assertEqual(x, i-size)
            self.assertEqual(list(reversed(list(d))),
                             list(range(BIG-size, BIG)))

def test_big_queue_popleft(self):
        pass
        d = deque()
        append, pop = d.append, d.popleft
        for i in range(BIG):
            append(i)
        for i in range(BIG):
            x = pop()
            if x != i:
                self.assertEqual(x, i)

def test_big_queue_popright(self):
        d = deque()
        append, pop = d.appendleft, d.pop
        for i in range(BIG):
            append(i)
        for i in range(BIG):
            x = pop()
            if x != i:
                self.assertEqual(x, i)

def test_big_stack_right(self):
        d = deque()
        append, pop = d.append, d.pop
        for i in range(BIG):
            append(i)
        for i in reversed(range(BIG)):
            x = pop()
            if x != i:
                self.assertEqual(x, i)
        self.assertEqual(len(d), 0)

def test_big_stack_left(self):
        d = deque()
        append, pop = d.appendleft, d.popleft
        for i in range(BIG):
            append(i)
        for i in reversed(range(BIG)):
            x = pop()
            if x != i:
                self.assertEqual(x, i)
        self.assertEqual(len(d), 0)

def test_roundtrip_iter_init(self):
        d = deque(range(200))
        e = deque(d)
        self.assertNotEqual(id(d), id(e))
        self.assertEqual(list(d), list(e))

def test_pickle(self):
        for d in deque(range(200)), deque(range(200), 100):
            for i in range(pickle.HIGHEST_PROTOCOL + 1):
                s = pickle.dumps(d, i)
                e = pickle.loads(s)
                self.assertNotEqual(id(e), id(d))
                self.assertEqual(list(e), list(d))
                self.assertEqual(e.maxlen, d.maxlen)

def test_pickle_recursive(self):
        for d in deque('abc'), deque('abc', 3):
            d.append(d)
            for i in range(pickle.HIGHEST_PROTOCOL + 1):
                e = pickle.loads(pickle.dumps(d, i))
                self.assertNotEqual(id(e), id(d))
                self.assertEqual(id(e[-1]), id(e))
                self.assertEqual(e.maxlen, d.maxlen)

def test_iterator_pickle(self):
        orig = deque(range(200))
        data = [i*1.01 for i in orig]
        for proto in range(pickle.HIGHEST_PROTOCOL + 1):
            # initial iterator
            itorg = iter(orig)
            dump = pickle.dumps((itorg, orig), proto)
            it, d = pickle.loads(dump)
            for i, x in enumerate(data):
                d[i] = x
            self.assertEqual(type(it), type(itorg))
            self.assertEqual(list(it), data)

# running iterator
            next(itorg)
            dump = pickle.dumps((itorg, orig), proto)
            it, d = pickle.loads(dump)
            for i, x in enumerate(data):
                d[i] = x
            self.assertEqual(type(it), type(itorg))
            self.assertEqual(list(it), data[1:])

# empty iterator
            for i in range(1, len(data)):
                next(itorg)
            dump = pickle.dumps((itorg, orig), proto)
            it, d = pickle.loads(dump)
            for i, x in enumerate(data):
                d[i] = x
            self.assertEqual(type(it), type(itorg))
            self.assertEqual(list(it), [])

# exhausted iterator
            self.assertRaises(StopIteration, next, itorg)
            dump = pickle.dumps((itorg, orig), proto)
            it, d = pickle.loads(dump)
            for i, x in enumerate(data):
                d[i] = x
            self.assertEqual(type(it), type(itorg))
            self.assertEqual(list(it), [])

def test_deepcopy(self):
        mut = [10]
        d = deque([mut])
        e = copy.deepcopy(d)
        self.assertEqual(list(d), list(e))
        mut[0] = 11
        self.assertNotEqual(id(d), id(e))
        self.assertNotEqual(list(d), list(e))

def test_copy(self):
        mut = [10]
        d = deque([mut])
        e = copy.copy(d)
        self.assertEqual(list(d), list(e))
        mut[0] = 11
        self.assertNotEqual(id(d), id(e))
        self.assertEqual(list(d), list(e))

for i in range(5):
            for maxlen in range(-1, 6):
                s = [random.random() for j in range(i)]
                d = deque(s) if maxlen == -1 else deque(s, maxlen)
                e = d.copy()
                self.assertEqual(d, e)
                self.assertEqual(d.maxlen, e.maxlen)
                self.assertTrue(all(x is y for x, y in zip(d, e)))

def test_copy_method(self):
        mut = [10]
        d = deque([mut])
        e = d.copy()
        self.assertEqual(list(d), list(e))
        mut[0] = 11
        self.assertNotEqual(id(d), id(e))
        self.assertEqual(list(d), list(e))

def test_reversed(self):
        for s in ('abcd', range(2000)):
            self.assertEqual(list(reversed(deque(s))), list(reversed(s)))

def test_reversed_new(self):
        klass = type(reversed(deque()))
        for s in ('abcd', range(2000)):
            self.assertEqual(list(klass(deque(s))), list(reversed(s)))

def test_gc_doesnt_blowup(self):
        import gc
        # This used to assert-fail in deque_traverse() under a debug
        # build, or run wild with a NULL pointer in a release build.
        d = deque()
        for i in range(100):
            d.append(1)
            gc.collect()

def test_container_iterator(self):
        # Bug #3680: tp_traverse was not implemented for deque iterator objects
        class C(object):
            pass
        for i in range(2):
            obj = C()
            ref = weakref.ref(obj)
            if i == 0:
                container = deque([obj, 1])
            else:
                container = reversed(deque([obj, 1]))
            obj.x = iter(container)
            del obj, container
            gc.collect()
            self.assertTrue(ref() is None, "Cycle was not collected")

check_sizeof = support.check_sizeof

@support.cpython_only
    def test_sizeof(self):
        BLOCKLEN = 64
        basesize = support.calcvobjsize('2P4nP')
        blocksize = struct.calcsize('P%dPP' % BLOCKLEN)
        self.assertEqual(object.__sizeof__(deque()), basesize)
        check = self.check_sizeof
        check(deque(), basesize + blocksize)
        check(deque('a'), basesize + blocksize)
        check(deque('a' * (BLOCKLEN - 1)), basesize + blocksize)
        check(deque('a' * BLOCKLEN), basesize + 2 * blocksize)
        check(deque('a' * (42 * BLOCKLEN)), basesize + 43 * blocksize)

class TestVariousIteratorArgs(unittest.TestCase):

def test_constructor(self):
        for s in ("123", "", range(1000), ('do', 1.2), range(2000,2200,5)):
            for g in (seq_tests.Sequence, seq_tests.IterFunc,
                      seq_tests.IterGen, seq_tests.IterFuncStop,
                      seq_tests.itermulti, seq_tests.iterfunc):
                self.assertEqual(list(deque(g(s))), list(g(s)))
            self.assertRaises(TypeError, deque, seq_tests.IterNextOnly(s))
            self.assertRaises(TypeError, deque, seq_tests.IterNoNext(s))
            self.assertRaises(ZeroDivisionError, deque, seq_tests.IterGenExc(s))

def test_iter_with_altered_data(self):
        d = deque('abcdefg')
        it = iter(d)
        d.pop()
        self.assertRaises(RuntimeError, next, it)

def test_runtime_error_on_empty_deque(self):
        d = deque()
        it = iter(d)
        d.append(10)
        self.assertRaises(RuntimeError, next, it)

class Deque(deque):
    pass

class DequeWithBadIter(deque):
    def __iter__(self):
        raise TypeError

class TestSubclass(unittest.TestCase):

def test_basics(self):
        d = Deque(range(25))
        d.__init__(range(200))
        for i in range(200, 400):
            d.append(i)
        for i in reversed(range(-200, 0)):
            d.appendleft(i)
        self.assertEqual(list(d), list(range(-200, 400)))
        self.assertEqual(len(d), 600)

left = [d.popleft() for i in range(250)]
        self.assertEqual(left, list(range(-200, 50)))
        self.assertEqual(list(d), list(range(50, 400)))

right = [d.pop() for i in range(250)]
        right.reverse()
        self.assertEqual(right, list(range(150, 400)))
        self.assertEqual(list(d), list(range(50, 150)))

d.clear()
        self.assertEqual(len(d), 0)

def test_copy_pickle(self):

d = Deque('abc')

e = d.__copy__()
        self.assertEqual(type(d), type(e))
        self.assertEqual(list(d), list(e))

e = Deque(d)
        self.assertEqual(type(d), type(e))
        self.assertEqual(list(d), list(e))

for proto in range(pickle.HIGHEST_PROTOCOL + 1):
            s = pickle.dumps(d, proto)
            e = pickle.loads(s)
            self.assertNotEqual(id(d), id(e))
            self.assertEqual(type(d), type(e))
            self.assertEqual(list(d), list(e))

d = Deque('abcde', maxlen=4)

e = d.__copy__()
        self.assertEqual(type(d), type(e))
        self.assertEqual(list(d), list(e))

e = Deque(d)
        self.assertEqual(type(d), type(e))
        self.assertEqual(list(d), list(e))

def test_pickle_recursive(self):
        for proto in range(pickle.HIGHEST_PROTOCOL + 1):
            for d in Deque('abc'), Deque('abc', 3):
                d.append(d)

e = pickle.loads(pickle.dumps(d, proto))
                self.assertNotEqual(id(e), id(d))
                self.assertEqual(type(e), type(d))
                self.assertEqual(e.maxlen, d.maxlen)
                dd = d.pop()
                ee = e.pop()
                self.assertEqual(id(ee), id(e))
                self.assertEqual(e, d)

d.x = d
                e = pickle.loads(pickle.dumps(d, proto))
                self.assertEqual(id(e.x), id(e))

for d in DequeWithBadIter('abc'), DequeWithBadIter('abc', 2):
                self.assertRaises(TypeError, pickle.dumps, d, proto)

def test_weakref(self):
        d = deque('gallahad')
        p = weakref.proxy(d)
        self.assertEqual(str(p), str(d))
        d = None
        self.assertRaises(ReferenceError, str, p)

def test_strange_subclass(self):
        class X(deque):
            def __iter__(self):
                return iter([])
        d1 = X([1,2,3])
        d2 = X([4,5,6])
        d1 == d2   # not clear if this is supposed to be True or False,
                   # but it used to give a SystemError

@support.cpython_only
    def test_bug_31608(self):
        # The interpreter used to crash in specific cases where a deque
        # subclass returned a non-deque.
        class X(deque):
            pass
        d = X()
        def bad___new__(cls, *args, **kwargs):
            return [42]
        X.__new__ = bad___new__
        with self.assertRaises(TypeError):
            d * 42  # shouldn't crash
        with self.assertRaises(TypeError):
            d + deque([1, 2, 3])  # shouldn't crash

class SubclassWithKwargs(deque):
    def __init__(self, newarg=1):
        deque.__init__(self)

class TestSubclassWithKwargs(unittest.TestCase):
    def test_subclass_with_kwargs(self):
        # SF bug #1486663 -- this used to erroneously raise a TypeError
        SubclassWithKwargs(newarg=1)

class TestSequence(seq_tests.CommonTest):
    type2test = deque

def test_getitem(self):
        # For now, bypass tests that require slicing
        pass

def test_getslice(self):
        # For now, bypass tests that require slicing
        pass

def test_subscript(self):
        # For now, bypass tests that require slicing
        pass

def test_free_after_iterating(self):
        # For now, bypass tests that require slicing
        self.skipTest("Exhausted deque iterator doesn't free a deque")

#==============================================================================

libreftest = """
Example from the Library Reference:  Doc/lib/libcollections.tex

>>> from collections import deque
>>> d = deque('ghi')                 # make a new deque with three items
>>> for elem in d:                   # iterate over the deque's elements
...     print(elem.upper())
G
H
I
>>> d.append('j')                    # add a new entry to the right side
>>> d.appendleft('f')                # add a new entry to the left side
>>> d                                # show the representation of the deque
deque(['f', 'g', 'h', 'i', 'j'])
>>> d.pop()                          # return and remove the rightmost item
'j'
>>> d.popleft()                      # return and remove the leftmost item
'f'
>>> list(d)                          # list the contents of the deque
['g', 'h', 'i']
>>> d[0]                             # peek at leftmost item
'g'
>>> d[-1]                            # peek at rightmost item
'i'
>>> list(reversed(d))                # list the contents of a deque in reverse
['i', 'h', 'g']
>>> 'h' in d                         # search the deque
True
>>> d.extend('jkl')                  # add multiple elements at once
>>> d
deque(['g', 'h', 'i', 'j', 'k', 'l'])
>>> d.rotate(1)                      # right rotation
>>> d
deque(['l', 'g', 'h', 'i', 'j', 'k'])
>>> d.rotate(-1)                     # left rotation
>>> d
deque(['g', 'h', 'i', 'j', 'k', 'l'])
>>> deque(reversed(d))               # make a new deque in reverse order
deque(['l', 'k', 'j', 'i', 'h', 'g'])
>>> d.clear()                        # empty the deque
>>> d.pop()                          # cannot pop from an empty deque
Traceback (most recent call last):
  File "<pyshell#6>", line 1, in -toplevel-
    d.pop()
IndexError: pop from an empty deque

>>> d.extendleft('abc')              # extendleft() reverses the input order
>>> d
deque(['c', 'b', 'a'])

>>> def delete_nth(d, n):
...     d.rotate(-n)
...     d.popleft()
...     d.rotate(n)
...
>>> d = deque('abcdef')
>>> delete_nth(d, 2)   # remove the entry at d[2]
>>> d
deque(['a', 'b', 'd', 'e', 'f'])

>>> def roundrobin(*iterables):
...     pending = deque(iter(i) for i in iterables)
...     while pending:
...         task = pending.popleft()
...         try:
...             yield next(task)
...         except StopIteration:
...             continue
...         pending.append(task)
...

>>> for value in roundrobin('abc', 'd', 'efgh'):
...     print(value)
...
a
d
e
b
f
c
g
h

>>> def maketree(iterable):
...     d = deque(iterable)
...     while len(d) > 1:
...         pair = [d.popleft(), d.popleft()]
...         d.append(pair)
...     return list(d)
...
>>> print(maketree('abcdefgh'))
[[[['a', 'b'], ['c', 'd']], [['e', 'f'], ['g', 'h']]]]

"""

#==============================================================================

__test__ = {'libreftest' : libreftest}

def test_main(verbose=None):
    import sys
    test_classes = (
        TestBasic,
        TestVariousIteratorArgs,
        TestSubclass,
        TestSubclassWithKwargs,
        TestSequence,
    )

support.run_unittest(*test_classes)

# verify reference counting
    if verbose and hasattr(sys, "gettotalrefcount"):
        import gc
        counts = [None] * 5
        for i in range(len(counts)):
            support.run_unittest(*test_classes)
            gc.collect()
            counts[i] = sys.gettotalrefcount()
        print(counts)

# doctests
    from test import test_deque
    support.run_doctest(test_deque, verbose)

if __name__ == "__main__":
    test_main(verbose=True)

003 File Manager

Editing: test_deque.py

Upload File

Create Folder