在栈 in English translation

值类型总是存储在栈上吗？?

Is it true that the value type is always stored in a stack?

Push将一个新的元素放在栈的最上层。

Push- put a new element at the top of the stack.

前一个Activity会保留在栈中，但是会stop。

The previous activity remains in the stack, but is stopped.

若是局部数据，将在栈区分配空间，然后引用该数据地址.

If it is local data, it will allocate space in the stack area, and then reference the data address;

然后，新调用的函数在栈上分配空间，用于自动和临时变量。

The newly called function then allocates room on the stack for its automatic and temporary variables.

这意味着所有操作所需要的值都在操作执行之前排列在栈上。

This means that all of the values an operation needs are queued up on the stack before the operation is performed.

活动记录存储在栈中，使得多个子程序调用同时活跃成为可能。

Activation records are stored on a stack, which makes it possible for several subroutine calls to be active at the same time.

第一行在栈上为vector对象v分配了内存，就像上面的x一样。

The first line allocates memory for the vector object v on the stack like it does for x above.

一个函数只能以两种方式创建新的对象：在栈上或在堆上。

A function can create a new object in only two ways: on the stack or on the heap.

然后，新被调用的函数在栈上为其自动和临时变量分配存储空间。

The newly called function then allocates room on the stack for its automatic and temporary variables.

一些比较传统的OOP语言允许程序员在栈、堆和静态存储区中创建对象。

Some traditional OOP languages allow programmers to create objects on the stack, the heap and the static storage.

该提案允许编译器要求只能有特定的类型出现在栈上，比如Span<T>。

The proposal is to allow the compiler to require that certain types such as Span<T> only appear on the stack.

Line1：当这一行被执行后，编译器会在栈上分配一小块内存。

Line 1: When this line is executed, the compiler allocates a small amount of memory in the stack.

如果参数限制个数为4，那么第五个和之后的字就会存储在栈上。

If the argument limitation is 4, then the fifth and subsequent words are passed on the stack.

这里分两步进行：首先，在栈上声明一个buffer来存放读取到的数据。

We do this in two steps: first, we declare a buffer on the stack to hold the data that is read in.

相反，你可以编写以下代码――等价循环体，并且在栈上仅“浪费”一个int值，开销低.

Instead, you can write the following, equivalent loop and“waste” only a singleint value on the stack, which is dirt cheap.

我们发现，这个键被存储为一个字符集合，在栈中从位置4080C8到40811F紧挨着存放。

We found that this key was stored as a collection of characters located next to each other on the stack in locations 4080C8 to 40811F.

这实际上不比存储在栈上慢，因为一旦引入了垃圾回收器，内存分配就成为了一个O(1)的操作。

This is actually no slower than storing on the stack because once you introduce a garbage collector, memory allocation becomes an O(1) operation.

其实并没有为Class1的实例分配内存，它只是在栈上为变量cls1创建了一个引用指针（并且将其默认职位null）。

Does not allocate memory for an instance of Class1, it only allocates a stack variable cls1(and sets it to null.

每一次进入这个方法的时候，就在栈上分配一个新的int，而每一次离开这个方法，就会释放一个int。

Each time the method is entered, a new int is allocated on the stack, and each time the method exits, the int is deallocated.

Low quality sentence examples