@@ -125,10 +125,12 @@ msgid ""
125125"following five functions show how to transform them into the standard "
126126"lookups for sorted lists::"
127127msgstr ""
128+ "上面的 :func:`bisect` 函数对于找到插入点是有用的,但在一般的搜索任务中可能会有点尴尬。下面 5 "
129+ "个函数展示了如何将其转变成有序列表中的标准查找函数 ::"
128130
129131#: ../../library/bisect.rst:114
130132msgid "Other Examples"
131- msgstr ""
133+ msgstr "其他示例 "
132134
133135#: ../../library/bisect.rst:118
134136msgid ""
@@ -137,6 +139,8 @@ msgid ""
137139"(say) based on a set of ordered numeric breakpoints: 90 and up is an 'A', 80"
138140" to 89 is a 'B', and so on::"
139141msgstr ""
142+ "函数 :func:`bisect` 还可以用于数字表查询。这个例子是使用 :func:`bisect` "
143+ "从一个给定的考试成绩集合里,通过一个有序数字表,查出其对应的字母等级:90 分及以上是 'A',80 到 89 是 'B',以此类推 ::"
140144
141145#: ../../library/bisect.rst:130
142146msgid ""
@@ -145,9 +149,11 @@ msgid ""
145149"would lead to an inefficient design (successive calls to bisect functions "
146150"would not \" remember\" all of the previous key lookups)."
147151msgstr ""
152+ "与 :func:`sorted` 函数不同,对于 :func:`bisect` 函数来说,*key* 或者 *reversed* "
153+ "参数并没有什么意义。因为这会导致设计效率低下(连续调用 bisect 函数时,是不会 \" 记住\" 过去查找过的键的)。"
148154
149155#: ../../library/bisect.rst:135
150156msgid ""
151157"Instead, it is better to search a list of precomputed keys to find the index"
152158" of the record in question::"
153- msgstr ""
159+ msgstr "正相反,最好去搜索预先计算好的键列表,来查找相关记录的索引。 "
0 commit comments