python
diff --git a/‎library/functools.po
+18-219 b/‎library/functools.po
+18-219
@@ -9,16 +9,16 @@
 # Shun Sakurai, 2017
 # Arihiro TAKASE, 2017
 # E. Kawashima, 2017
-# tomo, 2020
+# tomo, 2018
 # 
 #, 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: tomo, 2020\n"
+"Last-Translator: tomo, 2018\n"
 "Language-Team: Japanese (https://www.transifex.com/python-doc/teams/5390/ja/)\n"
 "MIME-Version: 1.0\n"
 "Content-Type: text/plain; charset=UTF-8\n"
@@ -490,183 +490,6 @@ msgstr ""
 
 #: ../../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 "
@@ -684,7 +507,7 @@ msgstr ""
 "``__qualname__``, ``__annotations__`` そしてドキュメンテーション文字列 ``__doc__`` に代入する) と "
 "``WRAPPER_UPDATES`` (これはラッパー関数の ``__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`), "
@@ -694,7 +517,7 @@ msgstr ""
 "内観や別の目的 (例えば、 :func:`lru_cache` のようなキャッシュするデコレータの回避) "
 "のために元の関数にアクセスできるように、この関数はラップされている関数を参照するラッパーに自動的に ``__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 "
@@ -705,7 +528,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"
@@ -718,19 +541,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 "
@@ -739,7 +562,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 "
@@ -750,7 +573,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 "
@@ -759,39 +582,39 @@ msgstr ""
 "このデコレータ・ファクトリを使用しないと、上の例中の関数の名前は ``'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 "
@@ -804,27 +627,3 @@ msgstr ""
 "オブジェクトのように呼び出し可能で、弱参照可能で、属性を持つことができます。重要な相違点もあります。例えば、 "
 ":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 ""