有这个集合的排序数组数据结构名称？
Is there a name for this collection of sorted arrays data structure?
相反，Vimscript中的列表的序列是可变的，并且在很多情况下类似于匿名数组数据结构。
In contrast, lists in Vimscript are mutable and in many ways far more like (references to) anonymous-array data structures.
为绕过这个限制，我使用一个数据结构来为每个数组元素定义一个已命名指示符变量。
To get around this I use a data structure to define a named indicator variable for each array element.
清单8包含将输入指示符数组重新定义到一个数据结构的rpg源代码示例。
Listing 8 contains the RPG source code example for redefining the input indicator array to a data structure.
这些结果可能符合您的预期：不同步的数组访问是最快的数据结构。
These results are probably what you'd expect: an unsynchronized array access is the fastest data structure.
数组是一种数据结构，而不是类。
当数组用于实现诸如堆栈或环形缓冲区之类的数据结构时，会出现另一种形式的对象游离。
Another form of object loitering arises when arrays are used to implement data structures such as stacks or circular buffers.
数组是基础php语言的一部分，并可简化对集合数据结构的处理。
Arrays are part of the base PHP language and they make the collection data structures a breeze to work with.
您必须自己编写解析器的可能性，因为您可能需要多种不同数据结构(例如，布尔型、标量、数组和散列)。
The probability that you may have to write your own parser, because you are likely to need a variety of different data structures (booleans, scalars, arrays, and hashes, for example).
注意subproblem方法没有复制这些元素；它只是将数组引用和偏移复制到一个现有的数据结构中。
Note that the subproblem method does not copy the elements; it merely copies the array reference and offsets into an existing data structure.
Gperf的内部实现以两个内部数据结构为核心：关键字签名（keyword signatures）列表（Key_List）和关联值（associated values）数组（asso_values）。
Gperf's internal implementation centers on two internal data structures: the keyword signatures list (Key_List) and the associated values array (asso_values).
arrays类提供了一系列处理数组的静态工具方法，这些索引的数据结构的大小是固定的。
The arrays class provides a series of static utility methods for working with arrays, those indexed data structures that are of a fixed size.
list除可以用于模拟数组外，还可以用于模拟其他数据结构。
A list can also be used to emulate other data structures in addition to an array.
Ruby散列表(或关联数组)是一种数据结构，允许您定义用于存储的键(而不是简单的数值索引)。
A Ruby hash (or associative array) is a data structure that allows you to define the key for storage (instead of a simple numerical index).
为了实现该目的，JSON定义了以下主要数据结构：数字、字符串、布尔值(真或假)、数组(值的有序排列)、对象(键值对集合)和null。
For that effect, JSON defines the following main data structures: number, string, Boolean (true and false), array (an ordered sequence of values), object (collection of key value pairs), and null.
倒排映射和压缩数组等其他一些数据结构也具有类似的优点；参考资料一节中Gillam的书中有关于这些数据结构更详细的资料。
There are other structures such as inversion maps and compact arrays that also merit a closer look; see the Gillam book in the Resources section for more information on those.
该DTD把数据序列化为通常在面向对象编程语言中才会见到的(嵌套的)数据结构集：词典、数组、字符串、数字、boolean值、日期和二进制数据。
This DTD serializes data into a (nested) set of data structures that are common in object-oriented programming languages: dictionaries, arrays, strings, Numbers, booleans, dates, and binary data.
请考虑清单2中的代码，这段代码对数组访问时间进行基准测试(针对其他数据结构的代码是相似的)。
Consider the code in Listing 2, which benchmarks array access times (code for the other data structures looks similar).
它们还有一些内嵌的数据结构，像数组、哈希表和对像记录一样的结构的某种支持。
They also have some built-in data structures like arrays, hashes, and some sort of support for record-like structures.
这些小型数据数组是现代处理器中最有效的数据结构，solidDB经常使用它们来最大化性能。
Small data arrays like these are the most efficient data structure in modern processors, and solidDB uses them frequently to maximize performance.
通过该模板，可将获得的所有数据（数组格式的、多行的、单值的或JSON 数据结构中的任何内容）转换成原生PHP 格式，放在 $value变量中。
With that, you've got all the data -- array format, multiple rows, single values, whatever you stuffed into your JSON data structure -- into a native PHP format, in the $value variable.
然而，很多操作系统仍然使用不透明的指针，“私有”的数据结构或内部数组的索引来在进程和他的客户之间传递。
However, many operating systems still apply the term to Pointers to opaque, "private" data structures, or indexes into internal arrays passed from one process to its client.
用这种方法使用参数，可以很容易地在数据结构（如数组）中构建迭代。
Using arguments in this way, you can easily build iteration into data structures such as arrays. Listing 3 shows an example of iterating over an array in Ruby
编写自己的解析器，因为您需要不同的数据结构(布尔型、标量、数组)和散列：AppConfig处理所有这些数据结构，但它这样做时不用嵌套。
Writing your own parser because you need different data structures (booleans, scalars, arrays) and hashes: AppConfig handles all these data structures, but it does so without nesting.
参数是强类型的，类型的范围是从基本的非派生类型(布尔(booleans)、字节(bytes)、整型(integers))到高层次数据结构(字符串(strings)、数组(arrays)和字典(dictionaries))。
Arguments are strongly-typed, and the types range from fundamental primitives (booleans, bytes, integers) to high-level structures (strings, arrays, and dictionaries).
第3章涉及一个特殊的数据结构，即：数组，介绍了如何使用数组。
Chapter 3 deals with a special data structure, i. e., arrays, and how to manipulate them.
数组是最好的数据结构问题。
并非要用类实现所有的数据结构，数组也很有用。
Do not implement every data structure as a class, arrays are useful, too.
最后比较了用不同数据结构的数组，对显示速度的影响。
At last this article compare the display speed in different data structure.
在定义了数据结构和变量数组的基础上，给出了参数自学习过程算法，改善了模型样机对不同规格样本工件的适应性。
A parameter self-learning algorithm is presented after defining data structure and variable array to improve the prototype's adaptability to different size of workpieces.
应用推荐