This warning indicates that an integer offset into the specified stack array exceeds the maximum bounds of that array.
此警告意味着指定堆栈数组的整数偏移量超出了该数组的最大界限。
Without a reference, you copy the entire array or hash onto the function call stack, and then copy it again in the function.
如果不使用引用，就需要将整个数组或hash 表复制到该函数的调用栈中，然后在函数中再次对其进行复制。
We've already discussed the stack (an array), and the pointer.
前面已经讨论了堆栈(数组)和指针。
The LeakyStack class in Listing 3 shows an implementation of a stack backed by an array.
清单3 中的LeakyStack类展示了用数组实现的堆栈的实现。
Like the local variables, the operand stack is organized as an array of words.
和局部变量区一样，操作数栈也是被组织成一个以字长为单位的数组。
Builds the channel factory stack on the client that creates a specified type of channel and that satisfies the features specified by an object array.
在客户端上生成通道工厂堆栈，该通道工厂堆栈创建具有指定类型的通道并满足对象数组所指定的功能。
The number of elements in the array is pushed onto the stack.
将数组中元素的数目推送到堆栈上。
Returns a value that indicates whether the current binding can build a channel listener stack on the service that satisfies the criteria specified in an array of objects.
返回一个值，该值指示当前绑定是否可以在服务上生成满足对象数组所指定的条件的通道侦听器堆栈。
The number of elements is popped from the stack and the array is created.
从堆栈中弹出元素的数目并创建数组。
An object reference to the new array is pushed onto the stack.
将对新数组的对象引用推送到堆栈上。
The contents are included as follows: Array, Linked List, Stack and Queue, Recursion, Tree and Forest, Graph, Sorting, Indexing and Hashing Structure, etc.
内容包括：数组、链接表、栈和队列、递归、树与森林、图、排序、检索和散列结构等。
The contents are included as follows: Array, Linked List, Stack and Queue, Recursion, Tree and Forest, Graph, Sorting, Indexing and Hashing Structure, etc.
内容包括：数组、链接表、栈和队列、递归、树与森林、图、排序、检索和散列结构等。
应用推荐