mirrors/cpython
1
0
Fork 0
mirror of https://github.com/python/cpython.git synced 2025-07-29 06:05:00 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 9

Python 3.10.6

Browse source
This commit is contained in:
Pablo Galindo 2022-08-01 21:23:10 +01:00
parent 4eab100e0d
commit 9c7b4bd164
No known key found for this signature in database
GPG key ID: FFE87404168BD847
86 changed files with 832 additions and 151 deletions
Download patch file Download diff file Expand all files Collapse all files

10
Lib/pydoc_data/topics.py
View file

@ -1,5 +1,5 @@
# -*- coding: utf-8 -*-
# Autogenerated by Sphinx on Mon Jun 6 12:53:10 2022
# Autogenerated by Sphinx on Mon Aug 1 21:23:42 2022
topics = {'assert': 'The "assert" statement\n'
'**********************\n'
'\n'
@ -4091,7 +4091,7 @@ topics = {'assert': 'The "assert" statement\n'
' invoking the superclass’s "__new__()" method using\n'
' "super().__new__(cls[, ...])" with appropriate arguments '
'and then\n'
' modifying the newly-created instance as necessary before '
' modifying the newly created instance as necessary before '
'returning\n'
' it.\n'
'\n'
@ -4494,7 +4494,7 @@ topics = {'assert': 'The "assert" statement\n'
'Python.This is\n'
' intended to provide protection against a '
'denial-of-service caused\n'
' by carefully-chosen inputs that exploit the worst '
' by carefully chosen inputs that exploit the worst '
'case\n'
' performance of a dict insertion, O(n^2) complexity. '
'See\n'
@ -9000,7 +9000,7 @@ topics = {'assert': 'The "assert" statement\n'
' invoking the superclass’s "__new__()" method using\n'
' "super().__new__(cls[, ...])" with appropriate arguments '
'and then\n'
' modifying the newly-created instance as necessary before '
' modifying the newly created instance as necessary before '
'returning\n'
' it.\n'
'\n'
@ -9401,7 +9401,7 @@ topics = {'assert': 'The "assert" statement\n'
'is\n'
' intended to provide protection against a '
'denial-of-service caused\n'
' by carefully-chosen inputs that exploit the worst case\n'
' by carefully chosen inputs that exploit the worst case\n'
' performance of a dict insertion, O(n^2) complexity. '
'See\n'
' http://www.ocert.org/advisories/ocert-2011-003.html '