python
diff --git a/‎library/functools.po‎
Lines changed: 18 additions & 219 deletions b/‎library/functools.po‎
Lines changed: 18 additions & 219 deletions
diff --git a/‎library/symbol.po‎
Lines changed: 9 additions & 3 deletions b/‎library/symbol.po‎
Lines changed: 9 additions & 3 deletions
@@ -4,23 +4,23 @@
 # FIRST AUTHOR <EMAIL@ADDRESS>, YEAR.
 # 
 # Translators:
+# ww song <[email protected]>, 2018
 # zc Jin <[email protected]>, 2018
 # akira asura <[email protected]>, 2019
 # zkonge <[email protected]>, 2019
 # MustAndy <[email protected]>, 2019
 # Makdon <[email protected]>, 2019
 # MuSheng Chen <[email protected]>, 2019
 # Freesand Leo <[email protected]>, 2020
-# ww song <[email protected]>, 2020
 # 
 #, fuzzy
 msgid ""
 msgstr ""
 "Project-Id-Version: Python 3.9\n"
 "Report-Msgid-Bugs-To: \n"
-"POT-Creation-Date: 2020-05-31 09:25+0000\n"
+"POT-Creation-Date: 2020-06-01 03:13+0000\n"
 "PO-Revision-Date: 2017-02-16 23:12+0000\n"
-"Last-Translator: ww song <sww4718168@gmail.com>, 2020\n"
+"Last-Translator: Freesand Leo <yuqinju@163.com>, 2020\n"
 "Language-Team: Chinese (China) (https://www.transifex.com/python-doc/teams/5390/zh_CN/)\n"
 "MIME-Version: 1.0\n"
 "Content-Type: text/plain; charset=UTF-8\n"
@@ -486,183 +486,6 @@ msgstr "同样的模式也被用于其他类似的装饰器: ``staticmethod``, `
 
 #: ../../library/functools.rst:548
 msgid ""
-"Provides functionality to topologically sort a graph of hashable nodes."
-msgstr ""
-
-#: ../../library/functools.rst:550
-msgid ""
-"A topological order is a linear ordering of the vertices in a graph such "
-"that for every directed edge u -> v from vertex u to vertex v, vertex u "
-"comes before vertex v in the ordering. For instance, the vertices of the "
-"graph may represent tasks to be performed, and the edges may represent "
-"constraints that one task must be performed before another; in this example,"
-" a topological ordering is just a valid sequence for the tasks. A complete "
-"topological ordering is possible if and only if the graph has no directed "
-"cycles, that is, if it is a directed acyclic graph."
-msgstr ""
-
-#: ../../library/functools.rst:559
-msgid ""
-"If the optional *graph* argument is provided it must be a dictionary "
-"representing a directed acyclic graph where the keys are nodes and the "
-"values are iterables of all predecessors of that node in the graph (the "
-"nodes that have edges that point to the value in the key). Additional nodes "
-"can be added to the graph using the :meth:`~TopologicalSorter.add` method."
-msgstr ""
-
-#: ../../library/functools.rst:565
-msgid ""
-"In the general case, the steps required to perform the sorting of a given "
-"graph are as follows:"
-msgstr ""
-
-#: ../../library/functools.rst:568
-msgid ""
-"Create an instance of the :class:`TopologicalSorter` with an optional "
-"initial graph."
-msgstr ""
-
-#: ../../library/functools.rst:570
-msgid "Add additional nodes to the graph."
-msgstr ""
-
-#: ../../library/functools.rst:571
-msgid "Call :meth:`~TopologicalSorter.prepare` on the graph."
-msgstr ""
-
-#: ../../library/functools.rst:572
-msgid ""
-"While :meth:`~TopologicalSorter.is_active` is ``True``, iterate over the "
-"nodes returned by :meth:`~TopologicalSorter.get_ready` and process them. "
-"Call :meth:`~TopologicalSorter.done` on each node as it finishes processing."
-msgstr ""
-
-#: ../../library/functools.rst:577
-msgid ""
-"In case just an immediate sorting of the nodes in the graph is required and "
-"no parallelism is involved, the convenience method "
-":meth:`TopologicalSorter.static_order` can be used directly:"
-msgstr ""
-
-#: ../../library/functools.rst:588
-msgid ""
-"The class is designed to easily support parallel processing of the nodes as "
-"they become ready. For instance::"
-msgstr ""
-
-#: ../../library/functools.rst:615
-msgid ""
-"Add a new node and its predecessors to the graph. Both the *node* and all "
-"elements in *predecessors* must be hashable."
-msgstr ""
-
-#: ../../library/functools.rst:618
-msgid ""
-"If called multiple times with the same node argument, the set of "
-"dependencies will be the union of all dependencies passed in."
-msgstr ""
-
-#: ../../library/functools.rst:621
-msgid ""
-"It is possible to add a node with no dependencies (*predecessors* is not "
-"provided) or to provide a dependency twice. If a node that has not been "
-"provided before is included among *predecessors* it will be automatically "
-"added to the graph with no predecessors of its own."
-msgstr ""
-
-#: ../../library/functools.rst:626
-msgid ""
-"Raises :exc:`ValueError` if called after :meth:`~TopologicalSorter.prepare`."
-msgstr ""
-
-#: ../../library/functools.rst:630
-msgid ""
-"Mark the graph as finished and check for cycles in the graph. If any cycle "
-"is detected, :exc:`CycleError` will be raised, but "
-":meth:`~TopologicalSorter.get_ready` can still be used to obtain as many "
-"nodes as possible until cycles block more progress. After a call to this "
-"function, the graph cannot be modified, and therefore no more nodes can be "
-"added using :meth:`~TopologicalSorter.add`."
-msgstr ""
-
-#: ../../library/functools.rst:639
-msgid ""
-"Returns ``True`` if more progress can be made and ``False`` otherwise. "
-"Progress can be made if cycles do not block the resolution and either there "
-"are still nodes ready that haven't yet been returned by "
-":meth:`TopologicalSorter.get_ready` or the number of nodes marked "
-":meth:`TopologicalSorter.done` is less than the number that have been "
-"returned by :meth:`TopologicalSorter.get_ready`."
-msgstr ""
-
-#: ../../library/functools.rst:646
-msgid ""
-"The :meth:`~TopologicalSorter.__bool__` method of this class defers to this "
-"function, so instead of::"
-msgstr ""
-
-#: ../../library/functools.rst:652
-msgid "if possible to simply do::"
-msgstr ""
-
-#: ../../library/functools.rst:657 ../../library/functools.rst:680
-msgid ""
-"Raises :exc:`ValueError` if called without calling "
-":meth:`~TopologicalSorter.prepare` previously."
-msgstr ""
-
-#: ../../library/functools.rst:662
-msgid ""
-"Marks a set of nodes returned by :meth:`TopologicalSorter.get_ready` as "
-"processed, unblocking any successor of each node in *nodes* for being "
-"returned in the future by a call to :meth:`TopologicalSorter.get_ready`."
-msgstr ""
-
-#: ../../library/functools.rst:666
-msgid ""
-"Raises :exc:`ValueError` if any node in *nodes* has already been marked as "
-"processed by a previous call to this method or if a node was not added to "
-"the graph by using :meth:`TopologicalSorter.add`, if called without calling "
-":meth:`~TopologicalSorter.prepare` or if node has not yet been returned by "
-":meth:`~TopologicalSorter.get_ready`."
-msgstr ""
-
-#: ../../library/functools.rst:674
-msgid ""
-"Returns a ``tuple`` with all the nodes that are ready. Initially it returns "
-"all nodes with no predecessors, and once those are marked as processed by "
-"calling :meth:`TopologicalSorter.done`, further calls will return all new "
-"nodes that have all their predecessors already processed. Once no more "
-"progress can be made, empty tuples are returned."
-msgstr ""
-
-#: ../../library/functools.rst:685
-msgid ""
-"Returns an iterable of nodes in a topological order. Using this method does "
-"not require to call :meth:`TopologicalSorter.prepare` or "
-":meth:`TopologicalSorter.done`. This method is equivalent to::"
-msgstr ""
-
-#: ../../library/functools.rst:696
-msgid ""
-"The particular order that is returned may depend on the specific order in "
-"which the items were inserted in the graph. For example:"
-msgstr ""
-
-#: ../../library/functools.rst:713
-msgid ""
-"This is due to the fact that \"0\" and \"2\" are in the same level in the "
-"graph (they would have been returned in the same call to "
-":meth:`~TopologicalSorter.get_ready`) and the order between them is "
-"determined by the order of insertion."
-msgstr ""
-
-#: ../../library/functools.rst:719
-msgid "If any cycle is detected, :exc:`CycleError` will be raised."
-msgstr ""
-
-#: ../../library/functools.rst:726
-msgid ""
 "Update a *wrapper* function to look like the *wrapped* function. The "
 "optional arguments are tuples to specify which attributes of the original "
 "function are assigned directly to the matching attributes on the wrapper "
@@ -680,7 +503,7 @@ msgstr ""
 "``__qualname__``, ``__annotations__`` 和 ``__doc__`` 即文档字符串) 以及 "
 "``WRAPPER_UPDATES`` (它将更新 wrapper 函数的 ``__dict__`` 即实例字典)。"
 
-#: ../../library/functools.rst:736
+#: ../../library/functools.rst:558
 msgid ""
 "To allow access to the original function for introspection and other "
 "purposes (e.g. bypassing a caching decorator such as :func:`lru_cache`), "
@@ -690,7 +513,7 @@ msgstr ""
 "为了允许出于内省和其他目的访问原始函数（例如绕过 :func:`lru_cache` 之类的缓存装饰器），此函数会自动为 wrapper "
 "添加一个指向被包装函数的 ``__wrapped__`` 属性。"
 
-#: ../../library/functools.rst:741
+#: ../../library/functools.rst:563
 msgid ""
 "The main intended use for this function is in :term:`decorator` functions "
 "which wrap the decorated function and return the wrapper. If the wrapper "
@@ -701,7 +524,7 @@ msgstr ""
 "此函数的主要目的是在 :term:`decorator` 函数中用来包装被装饰的函数并返回包装器。 "
 "如果包装器函数未被更新，则被返回函数的元数据将反映包装器定义而不是原始函数定义，这通常没有什么用处。"
 
-#: ../../library/functools.rst:747
+#: ../../library/functools.rst:569
 msgid ""
 ":func:`update_wrapper` may be used with callables other than functions. Any "
 "attributes named in *assigned* or *updated* that are missing from the object"
@@ -713,19 +536,19 @@ msgstr ""
 "中命名的任何属性如果不存在于被包装对象则会被忽略（即该函数将不会尝试在包装器函数上设置它们）。 如果包装器函数自身缺少在 *updated* "
 "中命名的任何属性则仍将引发 :exc:`AttributeError`。"
 
-#: ../../library/functools.rst:753
+#: ../../library/functools.rst:575
 msgid "Automatic addition of the ``__wrapped__`` attribute."
 msgstr "自动添加 ``__wrapped__`` 属性。"
 
-#: ../../library/functools.rst:756
+#: ../../library/functools.rst:578
 msgid "Copying of the ``__annotations__`` attribute by default."
 msgstr "默认拷贝 ``__annotations__`` 属性。"
 
-#: ../../library/functools.rst:759
+#: ../../library/functools.rst:581
 msgid "Missing attributes no longer trigger an :exc:`AttributeError`."
 msgstr "不存在的属性将不再触发 :exc:`AttributeError`。"
 
-#: ../../library/functools.rst:762
+#: ../../library/functools.rst:584
 msgid ""
 "The ``__wrapped__`` attribute now always refers to the wrapped function, "
 "even if that function defined a ``__wrapped__`` attribute. (see "
@@ -734,7 +557,7 @@ msgstr ""
 "``__wrapped__`` 属性现在总是指向被包装的函数，即使该函数定义了 ``__wrapped__`` 属性。 (参见 "
 ":issue:`17482`)"
 
-#: ../../library/functools.rst:770
+#: ../../library/functools.rst:592
 msgid ""
 "This is a convenience function for invoking :func:`update_wrapper` as a "
 "function decorator when defining a wrapper function.  It is equivalent to "
@@ -745,7 +568,7 @@ msgstr ""
 "``partial(update_wrapper, wrapped=wrapped, assigned=assigned, "
 "updated=updated)``。 例如::"
 
-#: ../../library/functools.rst:796
+#: ../../library/functools.rst:618
 msgid ""
 "Without the use of this decorator factory, the name of the example function "
 "would have been ``'wrapper'``, and the docstring of the original "
@@ -754,35 +577,35 @@ msgstr ""
 "如果不使用这个装饰器工厂函数，则 example 函数的名称将变为 ``'wrapper'``，并且 :func:`example` "
 "原本的文档字符串将会丢失。"
 
-#: ../../library/functools.rst:804
+#: ../../library/functools.rst:626
 msgid ":class:`partial` Objects"
 msgstr ":class:`partial` 对象"
 
-#: ../../library/functools.rst:806
+#: ../../library/functools.rst:628
 msgid ""
 ":class:`partial` objects are callable objects created by :func:`partial`. "
 "They have three read-only attributes:"
 msgstr ":class:`partial` 对象是由 :func:`partial` 创建的可调用对象。 它们具有三个只读属性："
 
-#: ../../library/functools.rst:812
+#: ../../library/functools.rst:634
 msgid ""
 "A callable object or function.  Calls to the :class:`partial` object will be"
 " forwarded to :attr:`func` with new arguments and keywords."
 msgstr "一个可调用对象或函数。 对 :class:`partial` 对象的调用将被转发给 :attr:`func` 并附带新的参数和关键字。"
 
-#: ../../library/functools.rst:818
+#: ../../library/functools.rst:640
 msgid ""
 "The leftmost positional arguments that will be prepended to the positional "
 "arguments provided to a :class:`partial` object call."
 msgstr "最左边的位置参数将放置在提供给 :class:`partial` 对象调用的位置参数之前。"
 
-#: ../../library/functools.rst:824
+#: ../../library/functools.rst:646
 msgid ""
 "The keyword arguments that will be supplied when the :class:`partial` object"
 " is called."
 msgstr "当调用 :class:`partial` 对象时将要提供的关键字参数。"
 
-#: ../../library/functools.rst:827
+#: ../../library/functools.rst:649
 msgid ""
 ":class:`partial` objects are like :class:`function` objects in that they are"
 " callable, weak referencable, and can have attributes.  There are some "
@@ -794,27 +617,3 @@ msgstr ""
 ":class:`partial` 对象与 :class:`function` 对象的类似之处在于它们都是可调用、可弱引用的对象并可拥有属性。 "
 "但两者也存在一些重要的区别。 例如前者不会自动创建 :attr:`~definition.__name__` 和 :attr:`__doc__` 属性。"
 " 而且，在类中定义的 :class:`partial` 对象的行为类似于静态方法，并且不会在实例属性查找期间转换为绑定方法。"
-
-#: ../../library/functools.rst:836
-msgid "Exceptions"
-msgstr "异常"
-
-#: ../../library/functools.rst:837
-msgid "The :mod:`functools` module defines the following exception classes:"
-msgstr ""
-
-#: ../../library/functools.rst:841
-msgid ""
-"Subclass of :exc:`ValueError` raised by :meth:`TopologicalSorter.prepare` if"
-" cycles exist in the working graph. If multiple cycles exist, only one "
-"undefined choice among them will be reported and included in the exception."
-msgstr ""
-
-#: ../../library/functools.rst:845
-msgid ""
-"The detected cycle can be accessed via the second element in the "
-":attr:`~CycleError.args` attribute of the exception instance and consists in"
-" a list of nodes, such that each node is, in the graph, an immediate "
-"predecessor of the next node in the list. In the reported list, the first "
-"and the last node will be the same, to make it clear that it is cyclic."
-msgstr ""
@@ -12,7 +12,7 @@ msgid ""
 msgstr ""
 "Project-Id-Version: Python 3.9\n"
 "Report-Msgid-Bugs-To: \n"
-"POT-Creation-Date: 2020-05-31 09:25+0000\n"
+"POT-Creation-Date: 2020-06-01 03:13+0000\n"
 "PO-Revision-Date: 2017-02-16 23:28+0000\n"
 "Last-Translator: Freesand Leo <[email protected]>, 2019\n"
 "Language-Team: Chinese (China) (https://www.transifex.com/python-doc/teams/5390/zh_CN/)\n"
@@ -43,11 +43,17 @@ msgstr ""
 ":file:`Grammar/Grammar` 文件来获取该语言语法上下文中对这些名称的定义。 这些名称所映射的特定数字值可能会在 Python "
 "版本之间更改。"
 
-#: ../../library/symbol.rst:20
+#: ../../library/symbol.rst:22
+msgid ""
+"The symbol module is deprecated and will be removed in future versions of "
+"Python."
+msgstr ""
+
+#: ../../library/symbol.rst:25
 msgid "This module also provides one additional data object:"
 msgstr "此模块还提供了一个额外的数据对象:"
 
-#: ../../library/symbol.rst:25
+#: ../../library/symbol.rst:30
 msgid ""
 "Dictionary mapping the numeric values of the constants defined in this "
 "module back to name strings, allowing more human-readable representation of "