Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with heap
Search options answers only
not deleted
user 37552
2
votes
Accepted
At a higher level description, how is DLMALLOC supposed work?
If you ever don't understand an implementation you should check the source, if available. Here's a fairly extensive explanation which was mentioned in the source.
Can anyone explain the workings o …
- 3,390
37
votes
Accepted
Why do we need a Heap if everything can be done much more efficiently on the Stack?
This works, but will require 5000000 copies in this case - something that will be much slower than a heap.
This is why we have a heap. …
- 3,390
13
votes
Accepted
Heaps: Why is there a tradeoff between amount of space occupied (fragmentation), and speed a...
One of the simplest ways to implement dynamic allocation is buddy memory allocation - implemented as a binary tree that satisfies the heap property. …
- 3,390