@@ -10,7 +10,7 @@ msgid ""
1010msgstr ""
1111"Project-Id-Version : Python 3.12\n "
1212"Report-Msgid-Bugs-To : \n "
13- "POT-Creation-Date : 2022-07-23 00:17 +0000\n "
13+ "POT-Creation-Date : 2024-06-13 00:03 +0000\n "
1414"PO-Revision-Date : 2021-06-19 14:24+0800\n "
1515"Last-Translator : Adrian Liaw <adrianliaw2000@gmail.com>\n "
1616"Language-Team : Chinese - TAIWAN (https://github.com/python/python-docs-zh- "
@@ -293,8 +293,9 @@ msgstr ""
293293"根據效能的各種取捨,需要一些替代的實作。"
294294
295295#: ../../tutorial/stdlib2.rst:296
296+ #, fuzzy
296297msgid ""
297- "The :mod:`array` module provides an :class:`~array.array() ` object that is "
298+ "The :mod:`array` module provides an :class:`~array.array` object that is "
298299"like a list that stores only homogeneous data and stores it more compactly. "
299300"The following example shows an array of numbers stored as two byte unsigned "
300301"binary numbers (typecode ``\" H\" ``) rather than the usual 16 bytes per entry "
@@ -306,11 +307,12 @@ msgstr ""
306307"而在 Python 整數物件的正規 list 中,每個項目通常使用 16 個位元組: ::"
307308
308309#: ../../tutorial/stdlib2.rst:309
310+ #, fuzzy
309311msgid ""
310- "The :mod:`collections` module provides a :class:`~collections.deque()` "
311- "object that is like a list with faster appends and pops from the left side "
312- "but slower lookups in the middle. These objects are well suited for "
313- "implementing queues and breadth first tree searches::"
312+ "The :mod:`collections` module provides a :class:`~collections.deque` object "
313+ "that is like a list with faster appends and pops from the left side but "
314+ "slower lookups in the middle. These objects are well suited for implementing "
315+ "queues and breadth first tree searches::"
314316msgstr ""
315317":mod:`collections` 模組提供了一個 :class:`~collections.deque()` 物件,它像是 "
316318"list,但從左側加入 (append) 和彈出 (pop) 的速度較快,而在中間查找的速度則較"
0 commit comments