88msgstr ""
99"Project-Id-Version :Python 3.7\n "
1010"Report-Msgid-Bugs-To :\n "
11- "POT-Creation-Date :2018-06-26 18:54 +0800\n "
11+ "POT-Creation-Date :2018-07-15 19:13 +0800\n "
1212"PO-Revision-Date :2018-05-23 14:35+0000\n "
1313"Last-Translator :Adrian Liaw <adrianliaw2000@gmail.com>\n "
1414"Language-Team :Chinese - TAIWAN (https://github.com/python/python-docs-zh- "
@@ -433,8 +433,8 @@ msgstr ""
433433
434434#: ../../faq/design.rst:351
435435msgid ""
436- "Answer 2: Fortunately, there is `Stackless Python <https://bitbucket.org /"
437- "stackless-dev/stackless/wiki/Home >`_, which has a completely redesigned "
436+ "Answer 2: Fortunately, there is `Stackless Python <https://github.com /"
437+ "stackless-dev/stackless/wiki>`_, which has a completely redesigned "
438438"interpreter loop that avoids the C stack."
439439msgstr ""
440440
@@ -596,12 +596,13 @@ msgid ""
596596msgstr ""
597597
598598#: ../../faq/design.rst:474
599- msgid "How are lists implemented?"
599+ #, fuzzy
600+ msgid "How are lists implemented in CPython?"
600601msgstr "串列如何被繼承?"
601602
602603#: ../../faq/design.rst:476
603604msgid ""
604- "Python 's lists are really variable-length arrays, not Lisp-style linked "
605+ "CPython 's lists are really variable-length arrays, not Lisp-style linked "
605606"lists. The implementation uses a contiguous array of references to other "
606607"objects, and keeps a pointer to this array and the array's length in a list "
607608"head structure."
@@ -622,14 +623,16 @@ msgid ""
622623msgstr ""
623624
624625#: ../../faq/design.rst:490
625- msgid "How are dictionaries implemented?"
626- msgstr ""
626+ #, fuzzy
627+ msgid "How are dictionaries implemented in CPython?"
628+ msgstr "串列如何被繼承?"
627629
628630#: ../../faq/design.rst:492
629631msgid ""
630- "Python's dictionaries are implemented as resizable hash tables. Compared to "
631- "B-trees, this gives better performance for lookup (the most common operation "
632- "by far) under most circumstances, and the implementation is simpler."
632+ "CPython's dictionaries are implemented as resizable hash tables. Compared "
633+ "to B-trees, this gives better performance for lookup (the most common "
634+ "operation by far) under most circumstances, and the implementation is "
635+ "simpler."
633636msgstr ""
634637
635638#: ../../faq/design.rst:496