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_tuple.py

from test import support, seq_tests
import unittest

import gc
import pickle

# For tuple hashes, we normally only run a test to ensure that we get
# the same results across platforms in a handful of cases.  If that's
# so, there's no real point to running more.  Set RUN_ALL_HASH_TESTS to
# run more anyway.  That's usually of real interest only when analyzing,
# or changing, the hash algorithm.  In which case it's usually also
# most useful to set JUST_SHOW_HASH_RESULTS, to see all the results
# instead of wrestling with test "failures".  See the bottom of the
# file for extensive notes on what we're testing here and why.
RUN_ALL_HASH_TESTS = False
JUST_SHOW_HASH_RESULTS = False # if RUN_ALL_HASH_TESTS, just display

class TupleTest(seq_tests.CommonTest):
    type2test = tuple

def test_getitem_error(self):
        t = ()
        msg = "tuple indices must be integers or slices"
        with self.assertRaisesRegex(TypeError, msg):
            t['a']

def test_constructors(self):
        super().test_constructors()
        # calling built-in types without argument must return empty
        self.assertEqual(tuple(), ())
        t0_3 = (0, 1, 2, 3)
        t0_3_bis = tuple(t0_3)
        self.assertTrue(t0_3 is t0_3_bis)
        self.assertEqual(tuple([]), ())
        self.assertEqual(tuple([0, 1, 2, 3]), (0, 1, 2, 3))
        self.assertEqual(tuple(''), ())
        self.assertEqual(tuple('spam'), ('s', 'p', 'a', 'm'))
        self.assertEqual(tuple(x for x in range(10) if x % 2),
                         (1, 3, 5, 7, 9))

def test_keyword_args(self):
        with self.assertRaisesRegex(TypeError, 'keyword argument'):
            tuple(sequence=())

def test_truth(self):
        super().test_truth()
        self.assertTrue(not ())
        self.assertTrue((42, ))

def test_len(self):
        super().test_len()
        self.assertEqual(len(()), 0)
        self.assertEqual(len((0,)), 1)
        self.assertEqual(len((0, 1, 2)), 3)

def test_iadd(self):
        super().test_iadd()
        u = (0, 1)
        u2 = u
        u += (2, 3)
        self.assertTrue(u is not u2)

def test_imul(self):
        super().test_imul()
        u = (0, 1)
        u2 = u
        u *= 3
        self.assertTrue(u is not u2)

def test_tupleresizebug(self):
        # Check that a specific bug in _PyTuple_Resize() is squashed.
        def f():
            for i in range(1000):
                yield i
        self.assertEqual(list(tuple(f())), list(range(1000)))

# We expect tuples whose base components have deterministic hashes to
    # have deterministic hashes too - and, indeed, the same hashes across
    # platforms with hash codes of the same bit width.
    def test_hash_exact(self):
        def check_one_exact(t, e32, e64):
            got = hash(t)
            expected = e32 if support.NHASHBITS == 32 else e64
            if got != expected:
                msg = f"FAIL hash({t!r}) == {got} != {expected}"
                self.fail(msg)

check_one_exact((), 750394483, 5740354900026072187)
        check_one_exact((0,), 1214856301, -8753497827991233192)
        check_one_exact((0, 0), -168982784, -8458139203682520985)
        check_one_exact((0.5,), 2077348973, -408149959306781352)
        check_one_exact((0.5, (), (-2, 3, (4, 6))), 714642271,
                        -1845940830829704396)

# Various tests for hashing of tuples to check that we get few collisions.
    # Does something only if RUN_ALL_HASH_TESTS is true.
    #
    # Earlier versions of the tuple hash algorithm had massive collisions
    # reported at:
    # - https://bugs.python.org/issue942952
    # - https://bugs.python.org/issue34751
    def test_hash_optional(self):
        from itertools import product

if not RUN_ALL_HASH_TESTS:
            return

# If specified, `expected` is a 2-tuple of expected
        # (number_of_collisions, pileup) values, and the test fails if
        # those aren't the values we get.  Also if specified, the test
        # fails if z > `zlimit`.
        def tryone_inner(tag, nbins, hashes, expected=None, zlimit=None):
            from collections import Counter

nballs = len(hashes)
            mean, sdev = support.collision_stats(nbins, nballs)
            c = Counter(hashes)
            collisions = nballs - len(c)
            z = (collisions - mean) / sdev
            pileup = max(c.values()) - 1
            del c
            got = (collisions, pileup)
            failed = False
            prefix = ""
            if zlimit is not None and z > zlimit:
                failed = True
                prefix = f"FAIL z > {zlimit}; "
            if expected is not None and got != expected:
                failed = True
                prefix += f"FAIL {got} != {expected}; "
            if failed or JUST_SHOW_HASH_RESULTS:
                msg = f"{prefix}{tag}; pileup {pileup:,} mean {mean:.1f} "
                msg += f"coll {collisions:,} z {z:+.1f}"
                if JUST_SHOW_HASH_RESULTS:
                    import sys
                    print(msg, file=sys.__stdout__)
                else:
                    self.fail(msg)

def tryone(tag, xs,
                   native32=None, native64=None, hi32=None, lo32=None,
                   zlimit=None):
            NHASHBITS = support.NHASHBITS
            hashes = list(map(hash, xs))
            tryone_inner(tag + f"; {NHASHBITS}-bit hash codes",
                         1 << NHASHBITS,
                         hashes,
                         native32 if NHASHBITS == 32 else native64,
                         zlimit)

if NHASHBITS > 32:
                shift = NHASHBITS - 32
                tryone_inner(tag + "; 32-bit upper hash codes",
                             1 << 32,
                             [h >> shift for h in hashes],
                             hi32,
                             zlimit)

mask = (1 << 32) - 1
                tryone_inner(tag + "; 32-bit lower hash codes",
                             1 << 32,
                             [h & mask for h in hashes],
                             lo32,
                             zlimit)

# Tuples of smallish positive integers are common - nice if we
        # get "better than random" for these.
        tryone("range(100) by 3", list(product(range(100), repeat=3)),
               (0, 0), (0, 0), (4, 1), (0, 0))

# A previous hash had systematic problems when mixing integers of
        # similar magnitude but opposite sign, obscurely related to that
        # j ^ -2 == -j when j is odd.
        cands = list(range(-10, -1)) + list(range(9))

# Note:  -1 is omitted because hash(-1) == hash(-2) == -2, and
        # there's nothing the tuple hash can do to avoid collisions
        # inherited from collisions in the tuple components' hashes.
        tryone("-10 .. 8 by 4", list(product(cands, repeat=4)),
               (0, 0), (0, 0), (0, 0), (0, 0))
        del cands

# The hashes here are a weird mix of values where all the
        # variation is in the lowest bits and across a single high-order
        # bit - the middle bits are all zeroes. A decent hash has to
        # both propagate low bits to the left and high bits to the
        # right.  This is also complicated a bit in that there are
        # collisions among the hashes of the integers in L alone.
        L = [n << 60 for n in range(100)]
        tryone("0..99 << 60 by 3", list(product(L, repeat=3)),
               (0, 0), (0, 0), (0, 0), (324, 1))
        del L

# Used to suffer a massive number of collisions.
        tryone("[-3, 3] by 18", list(product([-3, 3], repeat=18)),
               (7, 1), (0, 0), (7, 1), (6, 1))

# And even worse.  hash(0.5) has only a single bit set, at the
        # high end. A decent hash needs to propagate high bits right.
        tryone("[0, 0.5] by 18", list(product([0, 0.5], repeat=18)),
               (5, 1), (0, 0), (9, 1), (12, 1))

# Hashes of ints and floats are the same across platforms.
        # String hashes vary even on a single platform across runs, due
        # to hash randomization for strings.  So we can't say exactly
        # what this should do.  Instead we insist that the # of
        # collisions is no more than 4 sdevs above the theoretically
        # random mean.  Even if the tuple hash can't achieve that on its
        # own, the string hash is trying to be decently pseudo-random
        # (in all bit positions) on _its_ own.  We can at least test
        # that the tuple hash doesn't systematically ruin that.
        tryone("4-char tuples",
               list(product("abcdefghijklmnopqrstuvwxyz", repeat=4)),
               zlimit=4.0)

# The "old tuple test".  See https://bugs.python.org/issue942952.
        # Ensures, for example, that the hash:
        #   is non-commutative
        #   spreads closely spaced values
        #   doesn't exhibit cancellation in tuples like (x,(x,y))
        N = 50
        base = list(range(N))
        xp = list(product(base, repeat=2))
        inps = base + list(product(base, xp)) + \
                     list(product(xp, base)) + xp + list(zip(base))
        tryone("old tuple test", inps,
               (2, 1), (0, 0), (52, 49), (7, 1))
        del base, xp, inps

# The "new tuple test".  See https://bugs.python.org/issue34751.
        # Even more tortured nesting, and a mix of signed ints of very
        # small magnitude.
        n = 5
        A = [x for x in range(-n, n+1) if x != -1]
        B = A + [(a,) for a in A]
        L2 = list(product(A, repeat=2))
        L3 = L2 + list(product(A, repeat=3))
        L4 = L3 + list(product(A, repeat=4))
        # T = list of testcases. These consist of all (possibly nested
        # at most 2 levels deep) tuples containing at most 4 items from
        # the set A.
        T = A
        T += [(a,) for a in B + L4]
        T += product(L3, B)
        T += product(L2, repeat=2)
        T += product(B, L3)
        T += product(B, B, L2)
        T += product(B, L2, B)
        T += product(L2, B, B)
        T += product(B, repeat=4)
        assert len(T) == 345130
        tryone("new tuple test", T,
               (9, 1), (0, 0), (21, 5), (6, 1))

def test_repr(self):
        l0 = tuple()
        l2 = (0, 1, 2)
        a0 = self.type2test(l0)
        a2 = self.type2test(l2)

self.assertEqual(str(a0), repr(l0))
        self.assertEqual(str(a2), repr(l2))
        self.assertEqual(repr(a0), "()")
        self.assertEqual(repr(a2), "(0, 1, 2)")

def _not_tracked(self, t):
        # Nested tuples can take several collections to untrack
        gc.collect()
        gc.collect()
        self.assertFalse(gc.is_tracked(t), t)

def _tracked(self, t):
        self.assertTrue(gc.is_tracked(t), t)
        gc.collect()
        gc.collect()
        self.assertTrue(gc.is_tracked(t), t)

@support.cpython_only
    def test_track_literals(self):
        # Test GC-optimization of tuple literals
        x, y, z = 1.5, "a", []

self._not_tracked(())
        self._not_tracked((1,))
        self._not_tracked((1, 2))
        self._not_tracked((1, 2, "a"))
        self._not_tracked((1, 2, (None, True, False, ()), int))
        self._not_tracked((object(),))
        self._not_tracked(((1, x), y, (2, 3)))

# Tuples with mutable elements are always tracked, even if those
        # elements are not tracked right now.
        self._tracked(([],))
        self._tracked(([1],))
        self._tracked(({},))
        self._tracked((set(),))
        self._tracked((x, y, z))

def check_track_dynamic(self, tp, always_track):
        x, y, z = 1.5, "a", []

check = self._tracked if always_track else self._not_tracked
        check(tp())
        check(tp([]))
        check(tp(set()))
        check(tp([1, x, y]))
        check(tp(obj for obj in [1, x, y]))
        check(tp(set([1, x, y])))
        check(tp(tuple([obj]) for obj in [1, x, y]))
        check(tuple(tp([obj]) for obj in [1, x, y]))

self._tracked(tp([z]))
        self._tracked(tp([[x, y]]))
        self._tracked(tp([{x: y}]))
        self._tracked(tp(obj for obj in [x, y, z]))
        self._tracked(tp(tuple([obj]) for obj in [x, y, z]))
        self._tracked(tuple(tp([obj]) for obj in [x, y, z]))

@support.cpython_only
    def test_track_dynamic(self):
        # Test GC-optimization of dynamically constructed tuples.
        self.check_track_dynamic(tuple, False)

@support.cpython_only
    def test_track_subtypes(self):
        # Tuple subtypes must always be tracked
        class MyTuple(tuple):
            pass
        self.check_track_dynamic(MyTuple, True)

@support.cpython_only
    def test_bug7466(self):
        # Trying to untrack an unfinished tuple could crash Python
        self._not_tracked(tuple(gc.collect() for i in range(101)))

def test_repr_large(self):
        # Check the repr of large list objects
        def check(n):
            l = (0,) * n
            s = repr(l)
            self.assertEqual(s,
                '(' + ', '.join(['0'] * n) + ')')
        check(10)       # check our checking code
        check(1000000)

def test_iterator_pickle(self):
        # Userlist iterators don't support pickling yet since
        # they are based on generators.
        data = self.type2test([4, 5, 6, 7])
        for proto in range(pickle.HIGHEST_PROTOCOL + 1):
            itorg = iter(data)
            d = pickle.dumps(itorg, proto)
            it = pickle.loads(d)
            self.assertEqual(type(itorg), type(it))
            self.assertEqual(self.type2test(it), self.type2test(data))

it = pickle.loads(d)
            next(it)
            d = pickle.dumps(it, proto)
            self.assertEqual(self.type2test(it), self.type2test(data)[1:])

def test_reversed_pickle(self):
        data = self.type2test([4, 5, 6, 7])
        for proto in range(pickle.HIGHEST_PROTOCOL + 1):
            itorg = reversed(data)
            d = pickle.dumps(itorg, proto)
            it = pickle.loads(d)
            self.assertEqual(type(itorg), type(it))
            self.assertEqual(self.type2test(it), self.type2test(reversed(data)))

it = pickle.loads(d)
            next(it)
            d = pickle.dumps(it, proto)
            self.assertEqual(self.type2test(it), self.type2test(reversed(data))[1:])

def test_no_comdat_folding(self):
        # Issue 8847: In the PGO build, the MSVC linker's COMDAT folding
        # optimization causes failures in code that relies on distinct
        # function addresses.
        class T(tuple): pass
        with self.assertRaises(TypeError):
            [3,] + T((1,2))

def test_lexicographic_ordering(self):
        # Issue 21100
        a = self.type2test([1, 2])
        b = self.type2test([1, 2, 0])
        c = self.type2test([1, 3])
        self.assertLess(a, b)
        self.assertLess(b, c)

# Notes on testing hash codes.  The primary thing is that Python doesn't
# care about "random" hash codes.  To the contrary, we like them to be
# very regular when possible, so that the low-order bits are as evenly
# distributed as possible.  For integers this is easy: hash(i) == i for
# all not-huge i except i==-1.
#
# For tuples of mixed type there's really no hope of that, so we want
# "randomish" here instead.  But getting close to pseudo-random in all
# bit positions is more expensive than we've been willing to pay for.
#
# We can tolerate large deviations from random - what we don't want is
# catastrophic pileups on a relative handful of hash codes.  The dict
# and set lookup routines remain effective provided that full-width hash
# codes for not-equal objects are distinct.
#
# So we compute various statistics here based on what a "truly random"
# hash would do, but don't automate "pass or fail" based on those
# results.  Instead those are viewed as inputs to human judgment, and the
# automated tests merely ensure we get the _same_ results across
# platforms.  In fact, we normally don't bother to run them at all -
# set RUN_ALL_HASH_TESTS to force it.
#
# When global JUST_SHOW_HASH_RESULTS is True, the tuple hash statistics
# are just displayed to stdout.  A typical output line looks like:
#
# old tuple test; 32-bit upper hash codes; \
#             pileup 49 mean 7.4 coll 52 z +16.4
#
# "old tuple test" is just a string name for the test being run.
#
# "32-bit upper hash codes" means this was run under a 64-bit build and
# we've shifted away the lower 32 bits of the hash codes.
#
# "pileup" is 0 if there were no collisions across those hash codes.
# It's 1 less than the maximum number of times any single hash code was
# seen.  So in this case, there was (at least) one hash code that was
# seen 50 times:  that hash code "piled up" 49 more times than ideal.
#
# "mean" is the number of collisions a perfectly random hash function
# would have yielded, on average.
#
# "coll" is the number of collisions actually seen.
#
# "z" is "coll - mean" divided by the standard deviation of the number
# of collisions a perfectly random hash function would suffer.  A
# positive value is "worse than random", and negative value "better than
# random".  Anything of magnitude greater than 3 would be highly suspect
# for a hash function that claimed to be random.  It's essentially
# impossible that a truly random function would deliver a result 16.4
# sdevs "worse than random".
#
# But we don't care here!  That's why the test isn't coded to fail.
# Knowing something about how the high-order hash code bits behave
# provides insight, but is irrelevant to how the dict and set lookup
# code performs.  The low-order bits are much more important to that,
# and on the same test those did "just like random":
#
# old tuple test; 32-bit lower hash codes; \
#            pileup 1 mean 7.4 coll 7 z -0.2
#
# So there are always tradeoffs to consider.  For another:
#
# 0..99 << 60 by 3; 32-bit hash codes; \
#            pileup 0 mean 116.4 coll 0 z -10.8
#
# That was run under a 32-bit build, and is spectacularly "better than
# random".  On a 64-bit build the wider hash codes are fine too:
#
# 0..99 << 60 by 3; 64-bit hash codes; \
#             pileup 0 mean 0.0 coll 0 z -0.0
#
# but their lower 32 bits are poor:
#
# 0..99 << 60 by 3; 32-bit lower hash codes; \
#             pileup 1 mean 116.4 coll 324 z +19.2
#
# In a statistical sense that's waaaaay too many collisions, but (a) 324
# collisions out of a million hash codes isn't anywhere near being a
# real problem; and, (b) the worst pileup on a single hash code is a measly
# 1 extra.  It's a relatively poor case for the tuple hash, but still
# fine for practical use.
#
# This isn't, which is what Python 3.7.1 produced for the hashes of
# itertools.product([0, 0.5], repeat=18).  Even with a fat 64-bit
# hashcode, the highest pileup was over 16,000 - making a dict/set
# lookup on one of the colliding values thousands of times slower (on
# average) than we expect.
#
# [0, 0.5] by 18; 64-bit hash codes; \
#            pileup 16,383 mean 0.0 coll 262,128 z +6073641856.9
# [0, 0.5] by 18; 32-bit lower hash codes; \
#            pileup 262,143 mean 8.0 coll 262,143 z +92683.6

if __name__ == "__main__":
    unittest.main()

003 File Manager

Editing: test_tuple.py

Upload File

Create Folder