这并不意味底层数据以数组结构储存。
This does not mean that the underlying pieces of data are stored in an array structure;
之所以出现此标记，是因为目标映射中有数组结构。
我们使用这些方法返回的数组结构构建我们的数据模型。
Array structures returned from these methods are used to build our data model.
很多对象，或它们使用的结构，都基于某种散列或数组结构。
Many objects, or the structures they use, are based on some kind of hash or array structure.
现在已经解析了数组结构，接下来需要实现内联映射的映射。
Now that you've resolved the array structure, you need to implement the mapping of the inline map.
就水坝分割算法中的队列的结构设计提出了一种多级可变长度的数组结构。
A queue structure with automated length adjustment is proposed to optimize the watershed algorithm.
为绕过这个限制，我使用一个数据结构来为每个数组元素定义一个已命名指示符变量。
To get around this I use a data structure to define a named indicator variable for each array element.
这种变体还指定了数组和表等标准结构以改进复合对象的管理。
This variant also specifies standard structures such as arrays and tables for improved compound object management.
这些结果可能符合您的预期：不同步的数组访问是最快的数据结构。
These results are probably what you'd expect: an unsynchronized array access is the fastest data structure.
稍后我们将看到如何传送更复杂的变量，如数组和结构。
We will see later how to pass around more complex variables like arrays and structures.
相反，它们使用表之间的关系来创建对象之间的一到多结构，这与数组具有相同的效果。
Instead, they use relations among tables to create a one-to-many structure between objects, which has the same effect as an array.
数组是一种数据结构，而不是类。
这个字节数组包含INTEGER数据类型结构的所有字节。
This byte array will hold all the bytes of the INTEGER data type structure.
记录、结构和联合数组用标签表示。
Records, structures, and associative arrays are represented with the tag.
它们还有一些内嵌的数据结构，像数组、哈希表和对像记录一样的结构的某种支持。
They also have some built-in data structures like arrays, hashes, and some sort of support for record-like structures.
下一步是计算将要包含INTEGER结构的所有字节的数组的大小。
The next step is to calculate the size of the array that will hold all the bytes of the INTEGER structure.
以xml数组模式为基础的基本类型和复杂类型(结构中包含基本类型或复杂类型)数组。
Arrays of primitive types and complex types (structures containing primitive or complex types) based on the schema of the XML array.
您必须自己编写解析器的可能性，因为您可能需要多种不同数据结构(例如，布尔型、标量、数组和散列)。
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).
recvmsg和recvit函数初始化各种数组和结构，将接收的数据从内核发送到进程。
The recvmsg and recvit functions initialize various arrays and structures to send the received data to the process from the kernel.
必须出现typedef关键字，除非指定的数组是结构的一部分。
The typedef keyword must be present, unless you are specifying the arrays as part of a structure.
由于tmc2字段的长度固定，unpack命令用于将消息结构解析为一个数组。
Since the TMC2 fields are all of fixed length, the unpack command is used to parse the structure into an array.
该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.
我们可以认为userdata就是一个字节数组——字节可以表示指针、结构或宿主应用程序中的文件。
You can think of userdata as an array of bytes — bytes that might represent a pointer, a structure, or a file in the host application.
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).
list除可以用于模拟数组外，还可以用于模拟其他数据结构。
A list can also be used to emulate other data structures in addition to an array.
节点内容现在存储在一个结构化数组中，存储方式与在FormAPI结构化数组中存储表单元素的方式相同，可以使用drupal_render函数显示节点内容。
Node content is now stored in a structured array in the same way the form elements are stored in the form API structured array and is rendered using the drupal_render function.
相反，Vimscript中的列表的序列是可变的，并且在很多情况下类似于匿名数组数据结构。
In contrast, lists in Vimscript are mutable and in many ways far more like (references to) anonymous-array data structures.
编写自己的解析器，因为您需要不同的数据结构(布尔型、标量、数组)和散列：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.
每一个服务都必须列于专门的分派表中(为此该程序定义了一个ServiceTable结构数组)。
Each of them must be listed in the special dispatch table (this program defines ServiceTable array for this purpose).
应用推荐