About 11,700,000 results
Open links in new tab
  1. What and where are the stack and heap?

    Sep 17, 2008 · The Heap. The heap is a region of your computer's memory that is not managed automatically for you, and is not as tightly managed by the CPU. It is a more free-floating …

  2. When would I want to use a heap? - Stack Overflow

    Apr 14, 2009 · "A heap is a tree where a parent node's value is larger than that of any of its descendant nodes." This is not correct. This is a max heap (and min heap also exists). And in …

  3. How to interpret the result of !heap -l from Windbg

    May 21, 2018 · Entry is the address of the HEAP_ENTRY for that heap allocation. It's undocumented, but looks something like this. You can see how it looks on your system using …

  4. Is there a Heap in java? - Stack Overflow

    Jan 4, 2013 · From Java docs PriorityQueue which is available since 1.5 is the class to use.. This code for Min Heap creates a PriorityQueue with the default initial capacity (11) that orders its …

  5. malloc - What is a Memory Heap? - Stack Overflow

    Feb 22, 2010 · A memory heap is a location in memory where memory may be allocated at random access. Unlike the stack where memory is allocated and released in a very defined …

  6. O que são e onde estão a "stack" e "heap"? - Stack Overflow em …

    Custo do heap. A alocação no heap "custa" caro. Muitas tarefas devem ser realizados pelo sistema operacional para garantir a perfeita alocação de uma área para um trecho dele, …

  7. Why are two different concepts both called "heap"? [duplicate]

    Heap the data structure dates back to the mid-60s; heap the memory pool, the early-70s. The term heap (meaning memory pool) was used at least as early as 1971 by Wijngaarden in …

  8. Examining C/C++ Heap memory statistics in gdb - Stack Overflow

    Apr 7, 2010 · I see the <heap nr="0"> in the output, and in my test malloc_stats() shows stats for a number of arenas (aside: mallinfo() also seems to be limited in that it only shows information …

  9. How can building a heap be O (n) time complexity? - Stack Overflow

    Mar 18, 2012 · A min heap is also useful; for example, when retrieving items with integer keys in ascending order or strings in alphabetical order. The principles are exactly the same; simply …

  10. Understanding how to create a heap in Python - Stack Overflow

    Oct 5, 2012 · The heap is represented internally in an array where if a node is at k, it's children are at 2*k and 2*k + 1. The first element of the array is not used, to make the math more …

Refresh