Thanks to visit codestin.com
Credit goes to github.com

Skip to content

Commit 9e46d35

Browse files
committed
[po] auto sync bot
1 parent d97886d commit 9e46d35

1 file changed

Lines changed: 7 additions & 2 deletions

File tree

tutorial/stdlib2.po

Lines changed: 7 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -262,7 +262,7 @@ msgid ""
262262
"Many data structure needs can be met with the built-in list type. However, "
263263
"sometimes there is a need for alternative implementations with different "
264264
"performance trade-offs."
265-
msgstr ""
265+
msgstr "许多对于数据结构的需求可以通过内置列表类型来满足。 但是,有时也会需要具有不同效费比的替代实现。"
266266

267267
#: ../../tutorial/stdlib2.rst:295
268268
msgid ""
@@ -272,6 +272,9 @@ msgid ""
272272
"unsigned binary numbers (typecode ``\"H\"``) rather than the usual 16 bytes "
273273
"per entry for regular lists of Python int objects::"
274274
msgstr ""
275+
":mod:`array` 模块提供了一种 :class:`~array.array()` 对象,它类似于列表,但只能存储类型一致的数据且存储密集更高。 "
276+
"下面的例子演示了一个以两个字节为存储单元的无符号二进制数值的数组 (类型码为 ``\"H\"``),而对于普通列表来说,每个条目存储为标准 Python"
277+
" 的 int 对象通常要占用16 个字节::"
275278

276279
#: ../../tutorial/stdlib2.rst:308
277280
msgid ""
@@ -280,13 +283,15 @@ msgid ""
280283
"but slower lookups in the middle. These objects are well suited for "
281284
"implementing queues and breadth first tree searches::"
282285
msgstr ""
286+
":mod:`collections` 模块提供了一种 :class:`~collections.deque()` "
287+
"对象,它类似于列表,但从左端添加和弹出的速度较快,而在中间查找的速度较慢。 此种对象适用于实现队列和广度优先树搜索::"
283288

284289
#: ../../tutorial/stdlib2.rst:329
285290
msgid ""
286291
"In addition to alternative list implementations, the library also offers "
287292
"other tools such as the :mod:`bisect` module with functions for manipulating"
288293
" sorted lists::"
289-
msgstr ""
294+
msgstr "在替代的列表实现以外,标准库也提供了其他工具,例如 :mod:`bisect` 模块具有用于操作排序列表的函数::"
290295

291296
#: ../../tutorial/stdlib2.rst:339
292297
msgid ""

0 commit comments

Comments
 (0)