CONSTANT TIME in Chinese translation

• 常数时间
• 恒定时间
• 固定时间
• 常量时间

Examples of using Constant time in English and their translations into Chinese

It is true that we can count code units and code points in constant time in UTF-32.
我们确实可以在常数时间内对UTF-32中的编码单元和码位计数。

Finding the Nth code point in a sequence of code points is a constant time operation.
在编码序列中查找第N个编码是一个常数时间操作。

However, if you know at which byte that desired code point or grapheme cluster begins, then you can access it in constant time.
但是，如果你知道所需的codepoint或graphemecluster开始的字节的位置，那么你可以在常数时间时访问它。

Apple's sort-of-unique contribution to space efficiency is constant time cloning of files and directories.
苹果在空间效率方面较为独特的贡献是文件和目录的恒定时间复制。

Amazon recognizes that their most profitable customers are facing constant time constraints due to work and travel plans.
亚马逊认识到，由于工作和旅行计划的要求，他们的最赚钱客户正面临着持续的时间短缺困扰。

I thought empty() may be helpful in case of list as size() doesn't guarantees the constant time in list.
我认为empty()可能在列表的情况下有用，因为size()不保证列表中的常量时间。

It persists messages with O(1) disk structures that provide constant time performance even with many TB of stored messages.
持久的消息传递与O（1）磁盘结构，提供稳定的时间性能，即使有数TB的存储消息；.

We have now produced a solution that requires O(V+E) preprocessing(no worse than the earlier solutions) but also supports a constant time lookup.
就这样，我们得到了另一个解决方案，它需要O(V+E)的预处理时间（并不比之前的解决方案差），同时还支持常量时间查找。

It is recommended that these operations have nearly constant time complexity, or technically Õ(1) complexity, as otherwise some array functions may be unexpectedly slow.
建议这些操作具有几乎恒定的时间复杂度，或严格说来Õ(1)复杂性，否则某些数组函数可能出乎意料的慢。

For a general reaction, the reaction rate equals the rate constant times the concentrations of the reactants, each raised to a reaction order.
一般的反应，反应速率等于速率常数时间反应物的浓度，每个增至反应级数。

What is constant Time?
什么是时间复杂度.

O(1) is constant time.
O(1)被称为常量时间。

O(1) is referred to as being constant time.
O(1)被称为常量时间。

Unsatisfied with constant time, Jeff Dean created the world's first O(1/n) algorithm.
Jeff对常量的时间复杂度并不满足，于是他创造了世界上第一个O(1/n)的算法。

Finding an element in a HashMap is usually a constant time, which is O(1).
示例1：在HashMap里查找一个元素的的时间复杂度是常量的，也即是O(1)。

In fact, the actual length of each day on the earth is different, and there is a constant time error.
其实，地球上每一天的实际长短各自有异，不断产生时间误差。

If we started out with a dynamic array of size 4, it would take constant time to push four elements onto it.
如果我们的数组大小从4开始，那么来向其中增加四个元素的时间就是一个常数。

Another strong advantage, as you will see in a moment, is that Redis Lists can be taken at constant length in constant time.
另一个重要因素是，正如你将要看到的：Redislists能在常数时间取得常数长度。

Insertions, at constant time, are very efficient, but accessing a value is slow and often requires scanning through much of the list.
插入在不变的时间是非常有效的，但是访问一个值很慢，并且通常需要扫描大部分列表。

Despite the name"constant time", the running time does not have to be independent of the problem size, but an upper bound for the running time has to be bounded independently of the problem size.
虽然被称为「常数时间」，运行时间本身并不必须与问题规模无关，但它的上界必须是与问题规模无关的确定值。