Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
11 changes: 6 additions & 5 deletions library/collections.po
Original file line number Diff line number Diff line change
Expand Up @@ -11,7 +11,7 @@ msgstr ""
"Project-Id-Version: Python 3.12\n"
"Report-Msgid-Bugs-To: \n"
"POT-Creation-Date: 2023-10-20 00:03+0000\n"
"PO-Revision-Date: 2023-02-18 14:48+0800\n"
"PO-Revision-Date: 2024-01-22 21:42+0800\n"
"Last-Translator: Matt Wang <mattwang44@gmail.com>\n"
"Language-Team: Chinese - TAIWAN (https://github.com/python/python-docs-zh-"
"tw)\n"
Expand All @@ -20,7 +20,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.2.2\n"
"X-Generator: Poedit 3.4.1\n"

#: ../../library/collections.rst:2
msgid ":mod:`collections` --- Container datatypes"
Expand Down Expand Up @@ -789,9 +789,10 @@ msgid ""
"to O(n) in the middle. For fast random access, use lists instead."
msgstr ""
"除了以上使用方式,deque 亦支援了疊代、pickle、``len(d)``、``reversed(d)``、"
"``copy.copy(d)``、``copy.deepcopy(d)``、用 :keyword:`in` 運算子來作成員檢測以"
"及像是 ``d[0]`` 的標號引用來取得第一個元素。在兩端做索引存取的複雜度為 O(1) "
"但越靠近中間則減慢至 O(n)。若想要隨機而快速的存取,使用 list 會較為合適。"
"``copy.copy(d)``、``copy.deepcopy(d)``、用 :keyword:`in` 運算子來作隸屬資格檢"
"測以及像是 ``d[0]`` 的標號引用來取得第一個元素。在兩端做索引存取的複雜度為 "
"O(1) 但越靠近中間則減慢至 O(n)。若想要隨機而快速的存取,使用 list 會較為合"
"適。"

#: ../../library/collections.rst:591
msgid ""
Expand Down
Loading