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 stack
Search options answers only
not deleted
user 131624
A LIFO (Last In, First Out) data structure.
7
votes
Proper usage of up / down the stack
A stack that grows must change its address in a particular way. … If you want to sidestep all this confusion you can say exceptions unwind the stack. …
- 115k
1
vote
Could a language allow for persistent allocations without heap?
Could a language allow for persistent allocations without heap?
Sure. Just allocate them in static memory. But, unless you really need those allocations to stay allocated until termination, you now …
- 115k
14
votes
In C++; How big should an object [that will be transferred between functions] be before I co...
Since most implementations take the heap and the stack from the same block of memory (growing from either end) it doesn't matter. Size is not a reason to prefer the heap over the stack. …
- 115k