-
-
Notifications
You must be signed in to change notification settings - Fork 32
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
github-actions
committed
Dec 29, 2023
1 parent
0c5ca14
commit 9196f80
Showing
14 changed files
with
1,173 additions
and
1,171 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -12,7 +12,7 @@ msgid "" | |
msgstr "" | ||
"Project-Id-Version: Python 3.12\n" | ||
"Report-Msgid-Bugs-To: \n" | ||
"POT-Creation-Date: 2023-12-15 14:14+0000\n" | ||
"POT-Creation-Date: 2023-12-29 14:13+0000\n" | ||
"PO-Revision-Date: 2021-06-28 00:56+0000\n" | ||
"Last-Translator: Takanori Suzuki <[email protected]>, 2021\n" | ||
"Language-Team: Japanese (https://app.transifex.com/python-doc/teams/5390/" | ||
|
@@ -44,10 +44,10 @@ msgid "" | |
"The module is called :mod:`bisect` because it uses a basic bisection " | ||
"algorithm to do its work. Unlike other bisection tools that search for a " | ||
"specific value, the functions in this module are designed to locate an " | ||
"insertion point. Accordingly, the functions never call an :meth:`__eq__` " | ||
"method to determine whether a value has been found. Instead, the functions " | ||
"only call the :meth:`__lt__` method and will return an insertion point " | ||
"between values in an array." | ||
"insertion point. Accordingly, the functions never call an :meth:`~object." | ||
"__eq__` method to determine whether a value has been found. Instead, the " | ||
"functions only call the :meth:`~object.__lt__` method and will return an " | ||
"insertion point between values in an array." | ||
msgstr "" | ||
|
||
#: ../../library/bisect.rst:29 | ||
|
@@ -117,7 +117,7 @@ msgstr "*x* を *a* にソート順で挿入します。" | |
#: ../../library/bisect.rst:75 | ||
msgid "" | ||
"This function first runs :py:func:`~bisect.bisect_left` to locate an " | ||
"insertion point. Next, it runs the :meth:`insert` method on *a* to insert " | ||
"insertion point. Next, it runs the :meth:`!insert` method on *a* to insert " | ||
"*x* at the appropriate position to maintain sort order." | ||
msgstr "" | ||
|
||
|
@@ -142,7 +142,7 @@ msgstr "" | |
#: ../../library/bisect.rst:95 | ||
msgid "" | ||
"This function first runs :py:func:`~bisect.bisect_right` to locate an " | ||
"insertion point. Next, it runs the :meth:`insert` method on *a* to insert " | ||
"insertion point. Next, it runs the :meth:`!insert` method on *a* to insert " | ||
"*x* at the appropriate position to maintain sort order." | ||
msgstr "" | ||
|
||
|
Oops, something went wrong.