11# SOME DESCRIPTIVE TITLE.
2- # Copyright (C) 2001-2023 , Python Software Foundation
2+ # Copyright (C) 2001-2024 , Python Software Foundation
33# This file is distributed under the same license as the Python package.
44# FIRST AUTHOR <EMAIL@ADDRESS>, YEAR.
55#
@@ -11,7 +11,7 @@ msgid ""
1111msgstr ""
1212"Project-Id-Version : Python 3.11\n "
1313"Report-Msgid-Bugs-To : \n "
14- "POT-Creation-Date : 2023-09-01 14:43 +0000\n "
14+ "POT-Creation-Date : 2024-01-12 16:53 +0000\n "
1515"PO-Revision-Date : 2023-05-24 02:10+0000\n "
1616"
Last-Translator :
Rafael Fontenelle <[email protected] >, 2023\n "
1717"Language-Team : Chinese (China) (https://app.transifex.com/python-doc/teams/5390/zh_CN/)\n "
@@ -678,13 +678,9 @@ msgid ""
678678" bit, could hash to 1142331976. The hash code is then used to calculate a "
679679"location in an internal array where the value will be stored. Assuming that"
680680" you're storing keys that all have different hash values, this means that "
681- "dictionaries take constant time -- O (1), in Big-O notation -- to retrieve a "
682- "key."
681+ "dictionaries take constant time -- *O* \\ (1), in Big-O notation -- to "
682+ "retrieve a key."
683683msgstr ""
684- "字典的工作方式是使用 :func:`hash` "
685- "内置函数计算字典中存储的每个键的hash代码。hash代码根据键和每个进程的种子而变化很大;例如,\" Python\" "
686- "的hash值为-539294296,而\" python\" (一个按位不同的字符串)的hash值为1142331976。然后,hash代码用于计算内部数组中将存储该值的位置。假设您存储的键都具有不同的hash值,这意味着字典需要恒定的时间"
687- " -- O(1),用Big-O表示法 -- 来检索一个键。"
688684
689685#: ../../faq/design.rst:456
690686msgid "Why must dictionary keys be immutable?"
0 commit comments