片语

hash clustered table散列聚簇表

Hash function tableHash函数关键词

hash table bucket散列表元

Hash Cluster Table散列聚簇表

sorted hash clustered table有序散列聚簇表

Distribute Hash Table分布式哈希表

hash page table哈希页表

logical hash-table逻辑散列表

英汉例句

• it works by calling the test object「s getproperties method, which returns a hash table with all of the control」s properties and all of the values of those properties.

  它调用了测试对象的getproperties方法，并返回一个包含了控件所有属性及其对应值的哈希表。

• the getcreateconnection() method uses a static hash table to determine if either an existing connection can be returned, or needs to be created.

  getcreateconnection()方法使用静态哈希表来确定是否可以返回现有连接，或需要进行创建。

• a key-value store is basically a hash table on disk, so the location of a piece of data can be guessed without having to consult an index.

  键值存储从基本上说就是磁盘上的哈希表，因此在无需借助索引的情况下可以猜测一块数据的位置。

• it is an impediment to scalability, because only one thread can access the hash table at a time.

  首先，这种方法对于可伸缩性是一种障碍，因为一次只能有一个线程可以访问hash表。

• instead, use an in memory hash table to cache the data and just keep a key to the data in the session.

  相反地，应该使用内存中的哈希表来缓存数据，并且在会话中保存一个对此数据进行引用的键。

• key-values stores. the main idea here is using a hash table where there is a unique key and a pointer to a particular item of data.

  kv存储的主要思想是一个哈希表，每个item有一个主键和特定的数据值。

• switch is costly for large sets, consider a hash table wrapped in a try/catch

  switch处理大集合时代价过高，考虑用放在try/catch中的哈希表来代替；

• instead it is based on a hash table like model.

  它是建立在一种类似于散列表的模型上的。

• however, while exchanging a hash table is easy and supported out of the box, it is only appropriate to use in the most simple of interoperability scenarios.

  然而，尽管基于哈希表的数据交换很简单并且切实可行，但它只适合应用于最简单的互操作场景中。

• in this method, one of the tables, usually the smaller one, is scanned and used to create a hash table in memory.

  在该方法中，需要扫描其中的一个表，通常扫描较小的那个表，用它在内存中创建一个哈希表。

• reduction in false lock contentions for row and table locks in the lock manager「s hash table

  减少锁管理器的hash表中对行和表锁的虚假锁竞争。

• note that the variable_map class resembles a hash table in many respects.

  请注意，variable_map类在许多方面与哈希表非常相似。

• the second table, processing_args, contains the arguments to send to the function as a hash table using key/value pairs.

  第二个表 processing_args包含要发送给函数的参数，采用的形式是由键/值对组成的hash表。

• internally, the class maintains a hash table of all pooled objects.

  在内部，类负责维护所汇聚的全部对象的哈希表。

• this class builds a hash table of key-value pairs at the class instantiation.

  此类在类实例化时构建一个键值对哈希表。

• the next-fastest data structure is hashmap, followed by threadlocal (essentially, a specialized hash table in which the current thread is the key).

  更慢一点儿的数据结构是hashmap，然后是threadlocal（这基本上是一个以当前线程作为键的特殊散列表）。

• changing these values would change the hash code, which would in turn break any hash table or dictionary that the object happened to be stored in.

  而改变那些值的同时也改变了哈希码，然后会破坏一些哈希表或者恰好储存了对象的字典。

• it then appends all of that data as a hash table to the episodes array, which is a member variable.

  然后将所有数据作为一个哈希表附加到剧集数组，该数组是一个成员变量。

• in theory the hash table is a rather simple construct, just collection of arrays or linked lists divided into a finite number of buckets.

  理论上，哈希表是一个非常简单的构造，就是数组或链表的集合被划分到有限数量的存储体中。

• so let」s look at the second example, all right, i keep doing that -- this piece of code from here to here gives me a way of now creating a hash table of size 256.

  所以让我们来看一下第二个例子，好的，我继续做那件事,这段代码中从这里到这里,是创建一个大小为256的哈希表。

• update—the update method takes an integer id to specify the row to update, as well as a hash table of fields to update with the specified values.

  update —update方法接受一个整数id，以指定要更新的行；或者接受一个字段哈希表，使用指定的值更新字段。