[po] auto sync bot

zhsj · zhsj · commit 7da1177c3810 · 2019-07-23T12:39:36.000+08:00
diff --git a/library/bisect.po b/library/bisect.po
@@ -81,6 +81,8 @@ msgid ""
 " that ``all(val <= x for val in a[lo:i])`` for the left side and ``all(val >"
 " x for val in a[i:hi])`` for the right side."
 msgstr ""
+"返回的插入点 *i* 可以将数组 *a* 分成两部分。左侧是 ``all(val <= x for val in a[lo:i])``，右侧是 "
+"``all(val > x for val in a[i:hi])`` for the right side。"
 
 #: ../../library/bisect.rst:49
 msgid ""
@@ -89,12 +91,15 @@ msgid ""
 "already sorted.  Keep in mind that the O(log n) search is dominated by the "
 "slow O(n) insertion step."
 msgstr ""
+"将 *x* 插入到一个有序序列 *a* 里，并维持其有序。如果 *a* 有序的话，这相当于 "
+"``a.insert(bisect.bisect_left(a, x, lo, hi), x)``。要注意搜索是 O(log n) 的，插入却是 "
+"O(n) 的。"
 
 #: ../../library/bisect.rst:57
 msgid ""
 "Similar to :func:`insort_left`, but inserting *x* in *a* after any existing "
 "entries of *x*."
-msgstr ""
+msgstr "类似于 :func:`insort_left`，但是把 *x* 插入到 *a* 中已存在元素 *x* 的右侧。"
 
 #: ../../library/bisect.rst:62
 msgid ""
@@ -104,10 +109,14 @@ msgid ""
 "search methods and support for a key-function.  The keys are precomputed to "
 "save unnecessary calls to the key function during searches."
 msgstr ""
+"`SortedCollection recipe "
+"<https://code.activestate.com/recipes/577197-sortedcollection/>`_ 使用 bisect "
+"构造了一个功能完整的集合类，提供了直接的搜索方法和对用于搜索的 key 方法的支持。所有用于搜索的键都是预先计算的，以避免在搜索时对 key "
+"方法的不必要调用。"
 
 #: ../../library/bisect.rst:70
 msgid "Searching Sorted Lists"
-msgstr ""
+msgstr "搜索有序列表"
 
 #: ../../library/bisect.rst:72
 msgid ""
