-
These products have names like Red Bull, Monster,Ripped Force, Speed Stack and 5-Hour Energy.
VOA: special.2009.07.22
-
It gets popped off the stack as one says and so you know what the values actually as we've hinted at with our brief discussions of forensics they're actually still there.
它从堆中释放了,那些值是什么，就像我们讨论的辩论练习,所暗示的,我们还在那里。
-
it's like finding a needle in a hay stack.
这简直是大海捞针。
-
It turns out that slightly before the stack, slightly before this conceptual chunk of memory, there's other things called environment variables that we may see over time but elsewhere in memory are other things.
结果是稍微在堆之前，稍微在这个内存块概念之前，另外还一个东西叫做环境变量,我们之后可能看到，内存中的其他地方,是其他的东西。
-
Moving a stack of size 3, again, if I want to go over there, I need to make sure I can put the spare one over here before I move the bottom one, I can't cover up any of the smaller ones with the larger one, but I can get it there.
移动上面的三个圆盘的话，我在移动最底下的圆盘之前，同样要确保剩下的,是在另外一个柱子上，因为我不能把大的圆盘,放在小的上面。
-
There should be the rest of a stack over here.
那里还有几叠。
-
Goes up the stack as CO2.
形成了二氧化碳。
-
Now, as an aside, there's another couple of layers at the very top above the stack and above the heap, but below the tech segment and those are called initialized data and uninitialized data.
题外话，在堆和栈的顶端,还有好几层，但是在技术段之下,他们被叫做初始化数据和未初始化数据。
-
All right. The rules, though, are, they can only move one disk at a time, and they can never cover up a smaller disk with a larger disk. OK. Otherwise you'd just move the whole darn stack, OK?
好，规则是，他们只能一次挪动一个盘子,并且不能把大盘子放在小盘子上,不这样的话你就直接,把这一堆盘子都挪过来了对不对？
-
OK, that's not so bad. Moving a stack of size 2 if I want to go there, I need to put this one temporarily over here so I can move the bottom one before I move it over.
好，并不那么难，移动上面两个圆盘的话2,我需要把最小的盘子，临时先放到多余的柱子上来,这样才能在把它移过来之前,把最底下的盘子放到目标柱子上。
-
I intentionally used this very common analogy of a stack of trays in a cafeteria.
我故意使用这个普遍的类比，就像,自助餐厅的一堆托盘。
-
Right. Those things are going to stack up, and eventually it's going to run out of space.
不用占用其他空间的算法，对，这些东西在运行的过程中会累积起来。
-
So you may take this course ultimately via pass-fail or letter grade and I am more than happy to chat with you about the implications and to sign any paper work such as the stack here that you might need.
你可能希望这门课采用及格-不及格分制或者分数制,我很乐意跟你聊下,两个打分制各自的含义,也可以帮你在这里签到。
-
Well, because the memory we've been using for local variables, and for functions, storage space is what computer scientists generally call the stack.
好的，因为我们看到的内存是用于局部变量的，用于函数的，存储空间就是计算机科学家,通常说的堆。
-
Eventually, stack and heap will collide.
最终，堆和栈会冲突。
-
Well, what's nice about this program is that there's just one function, main, so we don't need to draw the stack and get things all complicated.
这个程序的优点是,这里只有一个函数main，这样我们就不需要,画出堆，也不用那么复杂。
-
You can stack these things in C. So if you want to do if - and then rather -- let me tweak this just so simplify -- if you want to stack these things and do this in one case or that in the other, can you stack them like this?
你们才可以在C语言中使用这些东西，所以如果你想做,-让我把这个弄得更简单点-,如果你想把这些代码堆集在一起，在一个情况中,或在另一个情况中处理，你能够像这样把他们集在一起吗？
-
You just forget where the memory is that you asked for on the heap and it's not going to get cleaned up on the stack because malloc puts it somewhere else.
你忘了你在堆中申请的内存在哪里,它将会被栈清除,因为malloc把它放在别的地方。
-
So, certainly the CS50 Library designed to be dynamic and, in fact, any time you call get string, we are, in fact, ; allocating a chunk of RAM but it's not coming from the stack; it's actually coming from this portion of memory called the heap.
所以，Cs50库是动态设计的，实际上，每次你调用GetSting时，我们分配一块内存，但它不是来自栈;,而是来自于叫做堆的,内存的一部分。
-
Stack of size 4, again I'm going there, so I'm going to do this initially, no I'm not, I'm going to start again.
同样的，移动上面四个圆盘，同样也是。
-
Well, if you want to call a function, it's like putting another tray on that stack of trays and that tray represents a chunk of memory that, that function can use.
嗯，如果你想调用一个函数，这就像把一个托盘放到另一个托盘上,托盘代表一块，函数可以使用的内存。
-
This is main string here on the stack.
这个是在堆栈中的主字符串。
-
Stack. Stack.
堆栈，堆栈。
-
But as soon as the most recently called function finishes executing, you have to take that tray off the stack in order to get at the previous function's memory, and once he's done executing, you have to take that one off and then what's left well then main.
但是，一旦新的调用函数结束了执行,你必须从堆中把托盘拿掉,用来获得先前函数的内存，一旦他完成执行，你必须把那一块拿下来,然后剩下的是main函数。
-
If I want to move this stack here, I'm going to take a stack of size n minus 1 move it to the spare spot, now I can move the base disk over, and then I'm going to move that stack of size n minus 1 to there. That's literally what I did, OK?
如果我想移动这些圆盘，我先把从n-1个圆盘1,移动到多余的柱子上去，这样我就能把最底下的圆盘放到这儿了，然后再把从n-1个圆盘放到这儿来,这就是确切的我怎么做的对不对？
-
And, again, the rectangle represents your computer's RAM, the bottom represents the part of RAM that we generally call the stack, main conceptually ends up on the bottom of the stack followed foo by its local variables then the function say foo that it calls and on and on and on and up, but there is, in fact, something above all of this and we've seen this picture briefly and that's this thing called the heap.
再次，矩形表示的是计算机内存，底端表示内存的一部分,通常我们把它叫做堆栈，main函数在,堆栈的底端，之后是,它的局部变量，然后是它调用的函数,等等等等，但是那里有，实际上，在这个上面，我们粗略看看这个图画,这个东西叫做堆。
应用推荐