Translate faq/design.html#how-are-lists-implemented-in-cpython

SiriusKoan · SiriusKoan · commit 04dde0aeb579 · 2022-08-23T14:44:34.000+08:00
diff --git a/faq/design.po b/faq/design.po
@@ -9,7 +9,7 @@ msgstr ""
 "Project-Id-Version: Python 3.10\n"
 "Report-Msgid-Bugs-To: \n"
 "POT-Creation-Date: 2022-07-06 00:17+0000\n"
-"PO-Revision-Date: 2022-08-19 21:55+0800\n"
+"PO-Revision-Date: 2022-08-22 22:22+0800\n"
 "Last-Translator: Adrian Liaw <adrianliaw2000@gmail.com>\n"
 "Language-Team: Chinese - TAIWAN (https://github.com/python/python-docs-zh-"
 "tw)\n"
@@ -745,12 +745,15 @@ msgid ""
 "objects, and keeps a pointer to this array and the array's length in a list "
 "head structure."
 msgstr ""
+"CPython 的串列 (lists) 事實上是可變長度的陣列 (array)，而不是像 Lisp 語言的鏈"
+"接串列 (linked lists)。實作上，他是一個連續的物件參照 (references) 陣列，並把"
+"指向此陣列的指標 (pointer) 和陣列長度存在串列的標頭結構內。"
 
 #: ../../faq/design.rst:429
 msgid ""
 "This makes indexing a list ``a[i]`` an operation whose cost is independent "
 "of the size of the list or the value of the index."
-msgstr ""
+msgstr "因此，用索引來找串列特定項 ``a[i]`` 的代價和串列大小或是索引值無關。"
 
 #: ../../faq/design.rst:432
 msgid ""
@@ -759,6 +762,9 @@ msgid ""
 "repeatedly; when the array must be grown, some extra space is allocated so "
 "the next few times don't require an actual resize."
 msgstr ""
+"當新物件被新增或插入時，陣列會被調整大小。為了改善多次加入物件的效率，我們有"
+"用一些巧妙的方法，當陣列必須變大時，會多收集一些額外的空間，接下來幾次新增時"
+"就不需要再調整大小了。"
 
 #: ../../faq/design.rst:439
 msgid "How are dictionaries implemented in CPython?"
