about summary refs log tree commit diff
diff options
context:
space:
mode:
authorBChip <bachippi@svsu.edu>2016-01-05 15:32:54 -0500
committerBChip <bachippi@svsu.edu>2016-01-05 15:32:54 -0500
commit7d6d39bcd948d219f6c26ffb0c2a1ea1f498b65c (patch)
treee061864055b31f2023ed968d934e384bbd08674b
parent5253294d222fe725fbbae1052d110f7eaa4ae10e (diff)
downloadrust-7d6d39bcd948d219f6c26ffb0c2a1ea1f498b65c.tar.gz
rust-7d6d39bcd948d219f6c26ffb0c2a1ea1f498b65c.zip
Clarify What LIFO Is
Declare what LIFO stands for
-rw-r--r--src/doc/book/the-stack-and-the-heap.md2
1 files changed, 1 insertions, 1 deletions
diff --git a/src/doc/book/the-stack-and-the-heap.md b/src/doc/book/the-stack-and-the-heap.md
index 63b73a7fc31..bc40eeb8dcc 100644
--- a/src/doc/book/the-stack-and-the-heap.md
+++ b/src/doc/book/the-stack-and-the-heap.md
@@ -539,7 +539,7 @@ instead.
 # Which to use?
 
 So if the stack is faster and easier to manage, why do we need the heap? A big
-reason is that Stack-allocation alone means you only have LIFO semantics for
+reason is that Stack-allocation alone means you only have 'Last In First Out (LIFO)' semantics for
 reclaiming storage. Heap-allocation is strictly more general, allowing storage
 to be taken from and returned to the pool in arbitrary order, but at a
 complexity cost.