光照贴图数组的大小（0～254）。
你不必特别指定数组的大小。
当我声明的数组，每个数组的大小是1。
第二是这个数组的大小。
不会返回动态分配数组或扩展数组的大小。
The sizeof operator cannot return the size of dynamically allocated arrays or external arrays.
当您建立一个数组类型时，数组的大小并不确定。
When you declare an array type, the size of the array is not specified.
如果没有初始值定义数组的大小，那么大小是默认大小。
If no initial value is given to the array size, then the size is determined by the initializers.
如果那个数组的大小为n，那会怎么样，我指明，涉及到了那个地方？
And how about if the array is size n, and I say bracket n, where am I referring?
当数组作为c样式数组传递时，封送拆收器不能确定数组的大小。
When arrays are passed as C-style arrays, the marshaler cannot determine the size of the array.
下一步是计算将要包含INTEGER结构的所有字节的数组的大小。
The next step is to calculate the size of the array that will hold all the bytes of the INTEGER structure.
为了计算数组中元素的数目，用户有时用第一个元素的大小除数组的大小；
To calculate the number of elements in an array, one sometimes divides the size of the array by the size of the first element;
此处选择的顺序阙值范围从 500K（数组的大小，表示没有并行性）到50。
The sequential thresholds chosen here range from 500K (the size of the array, meaning effectively no parallelism) down to 50.
通常，可以放心地通过将数组的大小除以每个元素的大小来计算数组中的元素数。
It is usually safe to compute the number of elements in an array by dividing the size of the array by the size of each element.
我们还定义了宏inbufsiz，它是在读取输入时用作缓冲区的字符数组的大小。
We also define a macro INBUFSIZ, which is the size of a character array used as a buffer while reading the input.
假设分配和释放需要常量时间，这个扩容动作花费O (n)时间，这里的n是当前数组的大小。
Assuming allocates and frees run in constant time, this enlargement process takes o (n) time where nis the current size of the array.
例如，可以这样实现POP() ：对最后一个元素使用FETCH() ，然后使用STORESIZE(FETCHSIZE()-1) （将数组的大小减去 1，实际除去了最后一个元素）。
POP(), for instance, could be implemented as a FETCH() of the last element, followed by STORESIZE(FETCHSIZE()-1) (setting the size of the array to be one less, effectively removing the last element).
这些是位置、文本内容和颜色、字体大小、淡入和淡出速度(以毫秒为单位)及保存显示字符串的数组的默认变量。
These are the default variables for the position, text contents, and color, font size, fade-in and fade-out speed in milliseconds, and an array to hold the display string.
在这个示例中，spinlock_t创建一个大小为lock_count的数组。
In this example, an array is created of spinlock_t with a size of LOCK_COUNT.
每一个leaf大小相同，这样简化了查找数组中特定元素的计算，并使收集器更容易查找到合适的自由空间来分配每个leaf。
Each leaf is the same size, which simplifies the calculation to find any particular element of the array and also makes it easier for the collector to find a suitable free space to allocate each leaf.
注意，这种格式意味着数组spine可能成长到无限制的大小，但是在现有的系统中还没有发现这是一个问题。
Note that this format can mean that an array spine can grow to unbounded sizes, but this hasn't yet been found to be a problem in the existing system.
知道了所需要的字节数后，我就实例化一个具有适当大小的字节数组。
When I know the required number of bytes, I instantiate an array of bytes of an appropriate size.
它通过创建可随机调整大小的长整数数组导致内存分配。
It causes memory allocation by creating randomly sized arrays of long integers.
在本节中，您将会学到如何为一个大小为[10][20][30]的三维数组定义属性。
In this section, you will learn how to make an attribute a three-dimensional array of size [10] [20] [30].
因为每个计划项增加的字符串长度总数大体相同，所以随后的稳定期比例可以作为重新设置底层数组大小的参考指标。
Because each plan item increases the total string length by roughly the same amount, the ratio of subsequent plateaus provides an indicator of the resize factor for the underlying array.
通过在该类型中包括数组大小，编译时间检测器可以象征性地分析数组的存取，确保所有存取都在数组范围内进行。
By including the size in the type, a compile-time checker can symbolically analyze the accesses to the array to ensure that no accesses are done outside the bounds of the array.
将第3步中附加了字节后的字节数组分为大小相同的块，每一块有8个字节。
Divide the padded byte array from Step 3 into equal blocks of 8 bytes each.
具体来说，请注意数组被补全为16字节；这是缓存线路的大小，dma引擎喜欢按照缓存线路大小进行操作。
In particular, note that the array is padded out to 16 bytes; this is the size of a cache line, and the DMA engine likes to work in cache lines.
OMGIDL有任意元素类型的多维固定大小的数组。
OMG IDL has multidimensional, fixed-size arrays of arbitrary element type.
OMGIDL有任意元素类型的多维固定大小的数组。
OMG IDL has multidimensional, fixed-size arrays of arbitrary element type.
应用推荐