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

Skip to content

Commit 7a78635

Browse files
[po] auto sync
1 parent 2991b30 commit 7a78635

1 file changed

Lines changed: 7 additions & 3 deletions

File tree

library/audioop.po

Lines changed: 7 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -100,19 +100,19 @@ msgstr "返回片段中所有样本的平均值。"
100100
msgid ""
101101
"Return the average peak-peak value over all samples in the fragment. No "
102102
"filtering is done, so the usefulness of this routine is questionable."
103-
msgstr ""
103+
msgstr "返回片段中所有样本的平均峰峰值。由于没有进行过滤,因此该例程的实用性尚存疑。"
104104

105105
#: ../../library/audioop.rst:75
106106
msgid ""
107107
"Return a fragment that is the original fragment with a bias added to each "
108108
"sample. Samples wrap around in case of overflow."
109-
msgstr ""
109+
msgstr "返回一个片段,该片段由原始片段中的每个样本加上偏差组成。在溢出时样本会回卷 (wrap around)。"
110110

111111
#: ../../library/audioop.rst:81
112112
msgid ""
113113
"\"Byteswap\" all samples in a fragment and returns the modified fragment. "
114114
"Converts big-endian samples to little-endian and vice versa."
115-
msgstr ""
115+
msgstr "“按字节交换”片段中的所有样本,返回修改后的片段。将大端序样本转换为小端序样本,反之亦然。"
116116

117117
#: ../../library/audioop.rst:89
118118
msgid ""
@@ -141,6 +141,10 @@ msgid ""
141141
"(integer) offset into *fragment* where the optimal match started and "
142142
"*factor* is the (floating-point) factor as per :func:`findfactor`."
143143
msgstr ""
144+
"尽可能尝试让 *reference* 匹配 *fragment* 的一部分(*fragment* 应较长)。从概念上讲,完成这些靠从 "
145+
"*fragment* 中取出切片,使用 :func:`findfactor` 计算最佳匹配,并最小化结果。两个片段都应包含 2 "
146+
"字节宽的样本。返回一个元组 ``(offset, factor)``,其中 *offset* 是在 *fragment* "
147+
"中的偏移量(整数),表示从此处开始最佳匹配,而 *factor* 是由 :func:`findfactor` 定义的因数(浮点数)。"
144148

145149
#: ../../library/audioop.rst:115
146150
msgid ""

0 commit comments

Comments
 (0)