Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Commitc2e04c8

Browse files
committed
fix: resolve fuzzy entries
1 parentc4264f1 commitc2e04c8

15 files changed

+154
-234
lines changed

‎c-api/structures.po

Lines changed: 15 additions & 15 deletions
Original file line numberDiff line numberDiff line change
@@ -83,7 +83,7 @@ msgstr ""
8383

8484
#:../../c-api/structures.rst:63
8585
msgid"See documentation of :c:type:`PyVarObject` above."
86-
msgstr""
86+
msgstr"請見上面 :c:type:`PyVarObject` 的文件。"
8787

8888
#:../../c-api/structures.rst:68
8989
msgid""
@@ -134,11 +134,11 @@ msgstr ""
134134

135135
#:../../c-api/structures.rst:120
136136
msgid"Set the object *o* type to *type*."
137-
msgstr""
137+
msgstr"將物件 *o* 的型別設為 *type*。"
138138

139139
#:../../c-api/structures.rst:127
140140
msgid"Get the size of the Python object *o*."
141-
msgstr""
141+
msgstr"取得 Python 物件 *o* 的大小。"
142142

143143
#:../../c-api/structures.rst:129
144144
msgid"Use the :c:func:`Py_SET_SIZE` function to set an object size."
@@ -152,7 +152,7 @@ msgstr ""
152152

153153
#:../../c-api/structures.rst:138
154154
msgid"Set the object *o* size to *size*."
155-
msgstr""
155+
msgstr"將物件 *o* 的大小設為 *size*。"
156156

157157
#:../../c-api/structures.rst:145
158158
msgid""
@@ -169,7 +169,7 @@ msgstr ""
169169

170170
#:../../c-api/structures.rst:163
171171
msgid"Implementing functions and methods"
172-
msgstr""
172+
msgstr"實作函式與方法"
173173

174174
#:../../c-api/structures.rst:167
175175
msgid""
@@ -302,7 +302,7 @@ msgstr ""
302302

303303
#:../../c-api/structures.rst:319
304304
msgid":c:expr:`METH_FASTCALL | METH_KEYWORDS`"
305-
msgstr""
305+
msgstr":c:expr:`METH_FASTCALL | METH_KEYWORDS`"
306306

307307
#:../../c-api/structures.rst:308
308308
msgid""
@@ -324,7 +324,7 @@ msgstr ""
324324

325325
#:../../c-api/structures.rst:340
326326
msgid":c:expr:`METH_METHOD | METH_FASTCALL | METH_KEYWORDS`"
327-
msgstr""
327+
msgstr":c:expr:`METH_METHOD | METH_FASTCALL | METH_KEYWORDS`"
328328

329329
#:../../c-api/structures.rst:330
330330
msgid""
@@ -429,7 +429,7 @@ msgstr ""
429429

430430
#:../../c-api/structures.rst:418
431431
msgid":attr:`function.__module__`"
432-
msgstr""
432+
msgstr":attr:`function.__module__`"
433433

434434
#:../../c-api/structures.rst:420
435435
msgid""
@@ -439,11 +439,11 @@ msgstr ""
439439

440440
#:../../c-api/structures.rst:429
441441
msgid"Equivalent to ``PyCMethod_New(ml, self, module, NULL)``."
442-
msgstr""
442+
msgstr"等價於 ``PyCMethod_New(ml, self, module, NULL)``。"
443443

444444
#:../../c-api/structures.rst:434
445445
msgid"Equivalent to ``PyCMethod_New(ml, self, NULL, NULL)``."
446-
msgstr""
446+
msgstr"等價於 ``PyCMethod_New(ml, self, NULL, NULL)``。"
447447

448448
#:../../c-api/structures.rst:438
449449
msgid"Accessing attributes of extension types"
@@ -563,7 +563,7 @@ msgstr ""
563563

564564
#:../../c-api/structures.rst:540
565565
msgid"Not writable."
566-
msgstr""
566+
msgstr"不可寫入。"
567567

568568
#:../../c-api/structures.rst:544
569569
msgid""
@@ -631,7 +631,7 @@ msgstr ""
631631

632632
#:../../c-api/structures.rst:604
633633
msgid"Macro name"
634-
msgstr""
634+
msgstr"巨集名稱"
635635

636636
#:../../c-api/structures.rst:604
637637
msgid"C type"
@@ -643,7 +643,7 @@ msgstr ""
643643

644644
#:../../c-api/structures.rst:606
645645
msgid":c:expr:`char`"
646-
msgstr""
646+
msgstr":c:expr:`char`"
647647

648648
#:../../c-api/structures.rst:606../../c-api/structures.rst:607
649649
#:../../c-api/structures.rst:608../../c-api/structures.rst:609
@@ -794,7 +794,7 @@ msgstr ""
794794

795795
#:../../c-api/structures.rst:688
796796
msgid"attribute name"
797-
msgstr""
797+
msgstr"屬性名稱"
798798

799799
#:../../c-api/structures.rst:692
800800
msgid"C function to get the attribute."
@@ -808,7 +808,7 @@ msgstr ""
808808

809809
#:../../c-api/structures.rst:700
810810
msgid"optional docstring"
811-
msgstr""
811+
msgstr"可選的文件字串"
812812

813813
#:../../c-api/structures.rst:704
814814
msgid""

‎faq/design.po

Lines changed: 1 addition & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -785,7 +785,6 @@ msgstr ""
785785
"tree)，在搜尋（目前為止最常見的操作）方面有更好的表現，實作上也較為簡單。"
786786

787787
#:../../faq/design.rst:447
788-
#,fuzzy
789788
msgid""
790789
"Dictionaries work by computing a hash code for each key stored in the "
791790
"dictionary using the :func:`hash` built-in function. The hash code varies "
@@ -801,7 +800,7 @@ msgstr ""
801800
"執行緒 (processes) 的種子而有相當大的差距。例如，``'Python'`` 的雜湊是 "
802801
"``-539294296``，而只差一個字的 ``'python'`` 則是 ``1142331976``。雜湊結果接著"
803802
"被用來計算值在內部陣列儲存的位置。假設你存的鍵都有不同的雜湊值，那字典只需要"
804-
"常數時間 — 用大 O 表示法 (Big-O notation) 就是O(1) — 來找任意一個鍵。"
803+
"常數時間 — 用大 O 表示法 (Big-O notation) 就是*O*\\(1) — 來找任意一個鍵。"
805804

806805
#:../../faq/design.rst:458
807806
msgid"Why must dictionary keys be immutable?"

‎glossary.po

Lines changed: 1 addition & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1634,15 +1634,14 @@ msgid "list"
16341634
msgstr"list（串列）"
16351635

16361636
#:../../glossary.rst:742
1637-
#,fuzzy
16381637
msgid""
16391638
"A built-in Python :term:`sequence`. Despite its name it is more akin to an "
16401639
"array in other languages than to a linked list since access to elements is "
16411640
"*O*\\ (1)."
16421641
msgstr""
16431642
"一個 Python 內建的 :term:`sequence` （序列）。儘管它的名字是 list，它其實更類"
16441643
"似其他語言中的一個陣列 (array) 而較不像一個鏈結串列 (linked list)，因為存取元"
1645-
"素的時間複雜度是O(1)。"
1644+
"素的時間複雜度是*O*\\(1)。"
16461645

16471646
#:../../glossary.rst:745
16481647
msgid"list comprehension"

‎library/bisect.po

Lines changed: 4 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -146,12 +146,12 @@ msgid ""
146146
msgstr"此函式只有在搜索時會使用 *key* 函式，插入時不會。"
147147

148148
#:../../library/bisect.rst:82../../library/bisect.rst:102
149-
#,fuzzy
150149
msgid""
151150
"Keep in mind that the *O*\\ (log *n*) search is dominated by the slow *O*\\ "
152151
"(*n*) insertion step."
153152
msgstr""
154-
"注意雖然搜索是 ``O(log n)``，但插入是 O(n)，因此此函式整體時間複雜度是 O(n)。"
153+
"注意雖然搜索是 *O*\\ (log *n*)，但插入是 *O*\\ (*n*)，因此此函式整體時間複雜"
154+
"度是 *O*\\ (*n*)。"
155155

156156
#:../../library/bisect.rst:92
157157
msgid""
@@ -191,13 +191,12 @@ msgstr ""
191191
"現還是比較好。"
192192

193193
#:../../library/bisect.rst:118
194-
#,fuzzy
195194
msgid""
196195
"The *insort()* functions are *O*\\ (*n*) because the logarithmic search step "
197196
"is dominated by the linear time insertion step."
198197
msgstr""
199-
"*insort()* 函式的複雜度為``O(n)``，因為對數搜尋是以線性時間的插入步驟所主導"
200-
"(dominate)。"
198+
"*insort()* 函式的複雜度為*O*\\ (*n*)，因為對數搜尋是以線性時間的插入步驟所主"
199+
"導(dominate)。"
201200

202201
#:../../library/bisect.rst:121
203202
msgid""

‎library/collections.po

Lines changed: 5 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -633,7 +633,6 @@ msgstr ""
633633
"的 deque。"
634634

635635
#:../../library/collections.rst:458
636-
#,fuzzy
637636
msgid""
638637
"Deques are a generalization of stacks and queues (the name is pronounced "
639638
"\"deck\" and is short for\"double-ended queue\"). Deques support thread-"
@@ -642,10 +641,9 @@ msgid ""
642641
msgstr""
643642
"Deque（發音為\"deck\"，為\"double-ended queue\" 的簡稱）為 stack 和 queue "
644643
"的一般化。deque 支援執行緒安全 (thread-safe)，且能夠有效率地節省記憶體在頭和"
645-
"尾加入和移除元素，兩個方向的表現都大致為O(1) 複雜度。"
644+
"尾加入和移除元素，兩個方向的表現都大致為*O*\\(1) 複雜度。"
646645

647646
#:../../library/collections.rst:463
648-
#,fuzzy
649647
msgid""
650648
"Though :class:`list` objects support similar operations, they are optimized "
651649
"for fast fixed-length operations and incur *O*\\ (*n*) memory movement costs "
@@ -654,7 +652,7 @@ msgid ""
654652
msgstr""
655653
"雖然 :class:`list` 物件也支援類似操作，但 list 優化了長度固定時的操作，而會改"
656654
"變底層資料的長度及位置的 ``pop(0)`` 和 ``insert(0, v)`` 操作，記憶體移動則為 "
657-
"O(n) 複雜度。"
655+
"*O*\\ (*n*) 複雜度。"
658656

659657
#:../../library/collections.rst:469
660658
msgid""
@@ -783,7 +781,6 @@ msgid "Maximum size of a deque or ``None`` if unbounded."
783781
msgstr"Deque 的最大長度，如果不限制長度的話則為 ``None``\\ 。"
784782

785783
#:../../library/collections.rst:585
786-
#,fuzzy
787784
msgid""
788785
"In addition to the above, deques support iteration, pickling, ``len(d)``, "
789786
"``reversed(d)``, ``copy.copy(d)``, ``copy.deepcopy(d)``, membership testing "
@@ -794,8 +791,9 @@ msgid ""
794791
msgstr""
795792
"除了以上使用方式，deque 亦支援了疊代、pickle、``len(d)``、``reversed(d)``、"
796793
"``copy.copy(d)``、``copy.deepcopy(d)``、用 :keyword:`in` 運算子來作成員檢測以"
797-
"及像是 ``d[0]`` 的標號引用來取得第一個元素。在兩端做索引存取的複雜度為 O(1) "
798-
"但越靠近中間則減慢至 O(n)。若想要隨機而快速的存取，使用 list 會較為合適。"
794+
"及像是 ``d[0]`` 的標號引用來取得第一個元素。在兩端做索引存取的複雜度為 *O*\\ "
795+
"(1) 但越靠近中間則減慢至 *O*\\ (*n*)。若想要隨機而快速的存取，使用 list 會較"
796+
"為合適。"
799797

800798
#:../../library/collections.rst:591
801799
msgid""

‎library/concurrent.futures.po

Lines changed: 3 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -87,20 +87,18 @@ msgstr ""
8787
"::"
8888

8989
#:../../library/concurrent.futures.rst:44
90-
#,fuzzy
9190
msgid"Similar to :func:`map(fn, *iterables) <map>` except:"
92-
msgstr"類似於 :func:`map(func, *iterables) <map>`，除了："
91+
msgstr"類似於 :func:`map(fn, *iterables) <map>`，除了："
9392

9493
#:../../library/concurrent.futures.rst:46
9594
msgid"the *iterables* are collected immediately rather than lazily;"
9695
msgstr"*iterables* 立即被收集而不是延遲 (lazily) 收集；"
9796

9897
#:../../library/concurrent.futures.rst:48
99-
#,fuzzy
10098
msgid""
10199
"*fn* is executed asynchronously and several calls to *fn* may be made "
102100
"concurrently."
103-
msgstr"*func* 是非同步執行的，並且對 *func* 的多次呼叫可以並行處理。"
101+
msgstr"*fn* 是非同步執行的，並且對 *fn* 的多次呼叫可以並行處理。"
104102

105103
#:../../library/concurrent.futures.rst:51
106104
msgid""
@@ -116,11 +114,10 @@ msgstr ""
116114
"就不會有限制。"
117115

118116
#:../../library/concurrent.futures.rst:57
119-
#,fuzzy
120117
msgid""
121118
"If a *fn* call raises an exception, then that exception will be raised when "
122119
"its value is retrieved from the iterator."
123-
msgstr"如果 *func* 呼叫引發例外，則當從疊代器中檢索到它的值時將引發該例外。"
120+
msgstr"如果 *fn* 呼叫引發例外，則當從疊代器中檢索到它的值時將引發該例外。"
124121

125122
#:../../library/concurrent.futures.rst:60
126123
msgid""

‎library/heapq.po

Lines changed: 1 addition & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -390,7 +390,6 @@ msgstr ""
390390
"含三個不同項目，但是最上方的單元「勝過」下方兩個單元。"
391391

392392
#:../../library/heapq.rst:268
393-
#,fuzzy
394393
msgid""
395394
"If this heap invariant is protected at all time, index 0 is clearly the "
396395
"overall winner. The simplest algorithmic way to remove it and find the "
@@ -404,7 +403,7 @@ msgstr ""
404403
"一個」贏家最簡單的演算法為：將一個輸家（例如上圖中的單元 30）移動到位置 0，然"
405404
"後從新的位置 0 不斷與下方的位置交換值來向下傳遞，直到滿足不變式為止。這個過程"
406405
"的複雜度顯然是樹的節點數目的對數級別。透過對所有項目疊代，可以得到一個複雜度"
407-
"為O(n logn) 的排序。"
406+
"為*O*\\ (*n* log*n*) 的排序。"
408407

409408
#:../../library/heapq.rst:275
410409
msgid""

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp