Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Commit358dd08

Browse files
Improves translations of library/heapq.po (#440)
* Translate `c-api/refcounting.po` (#437)* Improves translations of library/heapq.po* Translate `c-api/refcounting.po` (#437)* feat: translate `library/quopri.po` (#439)* Adds and refines the translations of library/statistics.po (#438)* Adds and refines the translations of library/statistics.po* small fixes: Adds and refines the translations of library/statistics.po* Small fix: library/heapq.po---------Co-authored-by: Wei-Hsiang (Matt) Wang <mattwang44@gmail.com>
1 parent4d377d4 commit358dd08

File tree

1 file changed

+7
-8
lines changed

1 file changed

+7
-8
lines changed

‎library/heapq.po‎

Lines changed: 7 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -10,7 +10,7 @@ msgstr ""
1010
"Project-Id-Version:Python 3.11\n"
1111
"Report-Msgid-Bugs-To:\n"
1212
"POT-Creation-Date:2018-10-19 17:24+0800\n"
13-
"PO-Revision-Date:2023-06-30 23:05+0800\n"
13+
"PO-Revision-Date:2023-07-01 18:20+0800\n"
1414
"Last-Translator:Liang-Bo Wang <me@liang2.tw>\n"
1515
"Language-Team:Chinese - TAIWAN (https://github.com/python/python-docs-zh-"
1616
"tw)\n"
@@ -281,8 +281,8 @@ msgid ""
281281
"Sort stability: how do you get two tasks with equal priorities to be "
282282
"returned in the order they were originally added?"
283283
msgstr""
284-
"排序的穩定性：你如何將兩個擁有相同priority 的 task按照他們被加入的順序回"
285-
"傳。"
284+
"排序的穩定性：如何將兩個擁有相同優先次序 (priority) 的 task按照他們被加入的"
285+
"順序回傳?"
286286

287287
#:../../library/heapq.rst:175
288288
msgid""
@@ -297,15 +297,14 @@ msgid ""
297297
"If the priority of a task changes, how do you move it to a new position in "
298298
"the heap?"
299299
msgstr""
300-
"當一個 heap 中 task 的 priority 改變時，你如何將它移到 heap 正確的位置上。"
300+
"當一個 heap 中 task 的 priority 改變時，如何將它移到 heap 正確的位置上?"
301301

302302
#:../../library/heapq.rst:181
303303
msgid""
304304
"Or if a pending task needs to be deleted, how do you find it and remove it "
305305
"from the queue?"
306306
msgstr""
307-
"或者一個還沒被解決的 task 需要被刪除時，你要如何從佇列中找到並刪除指定的 "
308-
"task。"
307+
"或者一個還沒被解決的 task 需要被刪除時，要如何從佇列中找到並刪除指定的 task?"
309308

310309
#:../../library/heapq.rst:184
311310
msgid""
@@ -360,8 +359,8 @@ msgid ""
360359
"is that ``a[0]`` is always its smallest element."
361360
msgstr""
362361
"Heap 是一個陣列對於所有從0開始的 index *k* 都存在性質 ``a[k] <= a[2*k+1]`` "
363-
"和 ``a[k] <= a[2*k+2]`` 。為了方便比較，不存在的元素被視為無限大。一個有趣的"
364-
"heap 性質是``a[0]`` 永遠是最小的元素。"
362+
"和 ``a[k] <= a[2*k+2]`` 。為了方便比較，不存在的元素被視為無限大。Heap 的一個"
363+
"有趣的性質是：``a[0]`` 永遠是最小的元素。"
365364

366365
#:../../library/heapq.rst:246
367366
msgid""

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp