当您需要根据输入数据标准将输入数组划分成两个或更多更小的数组时，可以使用这个技术。
You can use this technique when you need to separate an input array into two or more smaller arrays based on criteria in the input data.
本文介绍了一项技术，它可以基于每个对象的内容将对象数组划分成几个更小的输出数组。
This article described a technique to separate an array of objects into several smaller output arrays based on each object's content.
理论上，哈希表是一个非常简单的构造，就是数组或链表的集合被划分到有限数量的存储体中。
In theory the hash table is a rather simple construct, just collection of arrays or linked lists divided into a finite number of buckets.
它需要划分文本，分解为一个数组，并计算每个单词的出现次数。
It needs to strip the text, break it into an array, and count the occurrences of each word.
输入数组首先被大致均等地划分为N个分区，这里N是逻辑CPU的数目。
The input array is first divided into N partitions of roughly equal size, where N is the number of logical CPUs.
传统数据划分模式不适合指向数组的指针数组的数据划分，论文提出了解决该类指针数组数据划分的划分模式，文中称为数组向量的数据划分。
Traditional data partition ways are not suitable to pointer array whose member points to an array, so this paper presents a new mode to solve this problem, named array-vector data partition mode.
为了等同的对待每个维，适应稀疏数据，必须对多维数组进行划分。
To treat every dimension equally and adapt to sparse data, it is necessary to partition multidimensional array.
为了等同的对待每个维，适应稀疏数据，必须对多维数组进行划分。
To treat every dimension equally and adapt to sparse data, it is necessary to partition multidimensional array.
应用推荐