-
-
Notifications
You must be signed in to change notification settings - Fork 222
Removes fuzzy translations of library/bisect #516
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Merged
Merged
Changes from 1 commit
Commits
Show all changes
2 commits
Select commit
Hold shift + click to select a range
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or 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 @@ msgstr "" | |
| "Project-Id-Version: Python 3.12\n" | ||
| "Report-Msgid-Bugs-To: \n" | ||
| "POT-Creation-Date: 2023-07-17 17:39+0800\n" | ||
| "PO-Revision-Date: 2023-06-22 15:12+0800\n" | ||
| "PO-Revision-Date: 2023-08-01 12:53+0800\n" | ||
| "Last-Translator: Matt Wang <[email protected]>\n" | ||
| "Language-Team: Chinese - TAIWAN (https://github.com/python/python-docs-zh-" | ||
| "tw)\n" | ||
|
|
@@ -21,7 +21,7 @@ msgstr "" | |
| "Content-Type: text/plain; charset=UTF-8\n" | ||
| "Content-Transfer-Encoding: 8bit\n" | ||
| "Plural-Forms: nplurals=1; plural=0;\n" | ||
| "X-Generator: Poedit 3.3.1\n" | ||
| "X-Generator: Poedit 3.3.2\n" | ||
|
|
||
| #: ../../library/bisect.rst:2 | ||
| msgid ":mod:`bisect` --- Array bisection algorithm" | ||
|
|
@@ -39,7 +39,8 @@ msgid "" | |
| "searches or frequent resorting." | ||
| msgstr "" | ||
| "這個模組維護一個已經排序過的 list ,當我們每次做完插入後不需要再次排序整個 " | ||
| "list 。一個很長的 list 的比較操作很花費時間,可以透過線性搜索或頻繁地詢問來改善。" | ||
| "list 。一個很長的 list 的比較操作很花費時間,可以透過線性搜索或頻繁地詢問來改" | ||
| "善。" | ||
|
|
||
| #: ../../library/bisect.rst:19 | ||
| msgid "" | ||
|
|
@@ -51,6 +52,10 @@ msgid "" | |
| "only call the :meth:`__lt__` method and will return an insertion point " | ||
| "between values in an array." | ||
| msgstr "" | ||
| "這個模組被稱為 :mod:`bisect` 是因為它使用基本二分法來完成其工作。不像其它搜尋" | ||
| "特定值的二分法工具,本模組中的函式旨在定位插入點。因此,這些函式永遠不會呼" | ||
| "叫 :meth:`__eq__` 方法來確認是否找到一個值。相反地,這些函式只呼叫 :meth:" | ||
| "`__lt__` 方法,並在陣列中的值回傳一個插入點。" | ||
|
|
||
| #: ../../library/bisect.rst:29 | ||
| msgid "The following functions are provided:" | ||
|
|
@@ -71,15 +76,15 @@ msgstr "" | |
| "insert()`` 的第一個參數,但列表 *a* 必須先排序過。" | ||
|
|
||
| #: ../../library/bisect.rst:41 | ||
| #, fuzzy | ||
| msgid "" | ||
| "The returned insertion point *ip* partitions the array *a* into two slices " | ||
| "such that ``all(elem < x for elem in a[lo : ip])`` is true for the left " | ||
| "slice and ``all(elem >= x for elem in a[ip : hi])`` is true for the right " | ||
| "slice." | ||
| msgstr "" | ||
| "回傳的插入位置 *i* 將陣列 *a* 分為兩半,使得 ``all(val < x for val in a[lo : " | ||
| "i])`` 都在左側且 ``all(val >= x for val in a[i : hi])`` 都在右側。" | ||
| "回傳的插入點 *ip* 將陣列 *a* 劃分為左右兩個切片,使得對於左切片而言 " | ||
| "``all(elem < x for elem in a[lo : ip])`` 為真,對於右切片而言 ``all(elem >= " | ||
| "x for elem in a[ip : hi])`` 為真。" | ||
|
|
||
| #: ../../library/bisect.rst:46 | ||
| msgid "" | ||
|
|
@@ -92,11 +97,10 @@ msgstr "" | |
| "套用在 *x*。" | ||
|
|
||
| #: ../../library/bisect.rst:50 | ||
| #, fuzzy | ||
| msgid "" | ||
| "If *key* is ``None``, the elements are compared directly and no key function " | ||
| "is called." | ||
| msgstr "若 *key* 為 ``None``,則排序順位將直接以陣列中元素值決定。" | ||
| msgstr "若 *key* 為 ``None``,元素將直接進行比較,不會呼叫任何鍵函式。" | ||
|
|
||
| #: ../../library/bisect.rst:53 ../../library/bisect.rst:67 | ||
| #: ../../library/bisect.rst:85 ../../library/bisect.rst:105 | ||
|
|
@@ -112,15 +116,15 @@ msgstr "" | |
| "的後面(右邊)。" | ||
|
|
||
| #: ../../library/bisect.rst:63 | ||
| #, fuzzy | ||
| msgid "" | ||
| "The returned insertion point *ip* partitions the array *a* into two slices " | ||
| "such that ``all(elem <= x for elem in a[lo : ip])`` is true for the left " | ||
| "slice and ``all(elem > x for elem in a[ip : hi])`` is true for the right " | ||
| "slice." | ||
| msgstr "" | ||
| "回傳的插入位置 *i* 將陣列 *a* 分為兩半,使得 ``all(val <= x for val in " | ||
| "a[lo : i])`` 都在左側且 ``all(val > x for val in a[i : hi])`` 都在右側。" | ||
| "回傳的插入點 *ip* 將陣列 *a* 劃分為左右兩個切片,使得對於左切片而言 " | ||
| "``all(elem <= x for elem in a[lo : ip])`` 為真,對於右切片而言 ``all(elem > " | ||
| "x for elem in a[ip : hi])`` 為真。" | ||
|
|
||
| #: ../../library/bisect.rst:73 | ||
| msgid "Insert *x* in *a* in sorted order." | ||
|
|
||
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Uh oh!
There was an error while loading. Please reload this page.