8
8
msgstr ""
9
9
"Project-Id-Version : Python 3.7\n "
10
10
"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 "
12
12
"PO-Revision-Date : 2018-05-23 14:35+0000\n "
13
13
"
Last-Translator :
Adrian Liaw <[email protected] >\n "
14
14
"Language-Team : Chinese - TAIWAN (https://github.com/python/python-docs-zh- "
@@ -433,8 +433,8 @@ msgstr ""
433
433
434
434
#: ../../faq/design.rst:351
435
435
msgid ""
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 "
438
438
"interpreter loop that avoids the C stack."
439
439
msgstr ""
440
440
@@ -596,12 +596,13 @@ msgid ""
596
596
msgstr ""
597
597
598
598
#: ../../faq/design.rst:474
599
- msgid "How are lists implemented?"
599
+ #, fuzzy
600
+ msgid "How are lists implemented in CPython?"
600
601
msgstr "串列如何被繼承?"
601
602
602
603
#: ../../faq/design.rst:476
603
604
msgid ""
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 "
605
606
"lists. The implementation uses a contiguous array of references to other "
606
607
"objects, and keeps a pointer to this array and the array's length in a list "
607
608
"head structure."
@@ -622,14 +623,16 @@ msgid ""
622
623
msgstr ""
623
624
624
625
#: ../../faq/design.rst:490
625
- msgid "How are dictionaries implemented?"
626
- msgstr ""
626
+ #, fuzzy
627
+ msgid "How are dictionaries implemented in CPython?"
628
+ msgstr "串列如何被繼承?"
627
629
628
630
#: ../../faq/design.rst:492
629
631
msgid ""
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."
633
636
msgstr ""
634
637
635
638
#: ../../faq/design.rst:496
0 commit comments