• He stands above a heap of shattered concrete and twisted metal on a windswept hillside in Arab East Jerusalem.

    VOA: standard.2009.04.09

  • 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.

    题外话,在堆和栈的顶端,还有好几层,但是在技术段之下,他们被叫做初始化数据和未初始化数据。

    哈佛公开课 - 计算机科学课程节选

  • I have no idea where that is other than to know that it's up so let's just go ahead and assume that everything over here is the heap so what has just happened?

    我不知道它在哪里,只知道它在上面,我们假设这里所有的东西是堆,那么会发生什么呢?

    哈佛公开课 - 计算机科学课程节选

  • 006 when I pointed that sad heap and talk about I've had that car for 16 years.

    006年当我指着这些刮痕,我说的是用了16年的车。

    耶鲁公开课 - 死亡课程节选

  • That is the address in memory in the heap of the first byte that the user typed in.

    那是用户输入的字符串第一个字节,内存中堆的地址。

    哈佛公开课 - 计算机科学课程节选

  • Conceptually, it's put at the top of my chunk of RAM, -- below it, goes initialized and uninitialized data -- - this is a fancy way of saying global variables come next -- and below that, comes what's called the heap.

    概念上,它放置在内存块的顶端,在下面,已初始化的和未初始化的数据-,这是一种指明紧随其后的全局变量的设想方式-,在后来,引入了一个叫做堆的东西。

    哈佛公开课 - 计算机科学课程节选

  • You're calling functions, functions, functions, but you're allocating heap, heap, heap, heap memory for your words.

    我们一直调用函数,函数,函数,你一直为单词分配堆,堆,堆,堆。

    哈佛公开课 - 计算机科学课程节选

  • So the heap is a chunk of memory in a computer's RAM that's conceptually allocated to what's called dynamic memory allocation.

    堆是在计算机RAM中的一块内存,它可以进行,动态内存分配。

    哈佛公开课 - 计算机科学课程节选

  • Well, there's a chunk of memory called the heap that you can grab as much memory as you want so long as it exists for your program.

    好的,这里有一块叫做堆的内存,这样你就可以获得你想要那么多的内存,因为它为你的程序而存在。

    哈佛公开课 - 计算机科学课程节选

  • This is the heap somewhere else in memory, but they are, in fact, in distinct locations.

    这是内存中的堆,但实际上,它们在不同的地方。

    哈佛公开课 - 计算机科学课程节选

  • It's pointing at a different place in the heap.

    它在堆中指向不同的地方。

    哈佛公开课 - 计算机科学课程节选

  • The heap offers us a solution to that problem.

    堆就为那个问题提供了一个解决方案。

    哈佛公开课 - 计算机科学课程节选

  • Eventually, stack and heap will collide.

    最终,堆和栈会冲突。

    哈佛公开课 - 计算机科学课程节选

  • Turn it into a heap of metal.

    把车子拆成一堆废铁。

    耶鲁公开课 - 死亡课程节选

  • So, conceptually if you've ever wondered why you get access in all of your functions to global variables that's because they're not down here, they're at the very top of RAM and any function can access that RAM way up there, but for now the interesting player in the story is this thing called the heap.

    所以,如果你想知道为什么全局变量能在,所有的函数中使用,那是因为它们不在这下面,而是在内存的顶端,那样任意函数都可以在内存中使用它们,现在,这里面一个有用的角色是,叫做堆的东西。

    哈佛公开课 - 计算机科学课程节选

  • I store in s1 the address of the first byte that the user typed in and by the way that first bite happens to live in this new place called the heap and that's the only update to the story thus far.

    我在s1中存储的是用户输入的字符串的首地址,这样第一个字节存储在这块,新的堆的地方,这个是唯一的修正。

    哈佛公开课 - 计算机科学课程节选

  • This is now on the heap it's four bytes so what gets stored in X?

    在堆上,它是4个字节,那么在x中存储的是什么?

    哈佛公开课 - 计算机科学课程节选

  • 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时,我们分配一块内存,但它不是来自栈;,而是来自于叫做堆的,内存的一部分。

    哈佛公开课 - 计算机科学课程节选

  • 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函数在,堆栈的底端,之后是,它的局部变量,然后是它调用的函数,等等等等,但是那里有,实际上,在这个上面,我们粗略看看这个图画,这个东西叫做堆。

    哈佛公开课 - 计算机科学课程节选

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定