---

yaml
---
r: 24126
b: refs/heads/master
c: a8406e3
h: refs/heads/master
v: v3

Author: brson

[refs]

@@ -1,5 +1,5 @@
 ---
-refs/heads/master: 91fe3fcbef43c68943b57b0cfaf637c84d39926c
+refs/heads/master: a8406e3d00ca791317f85d369e6157e4b5a2cf90
 refs/heads/snap-stage1: e33de59e47c5076a89eadeb38f4934f58a3618a6
 refs/heads/snap-stage3: cd6f24f9d14ac90d167386a56e7a6ac1f0318195
 refs/heads/try: ffbe0e0e00374358b789b0037bcb3a577cd218be

trunk/doc/tutorial.md

@@ -1052,6 +1052,34 @@ let y = x; // Copy of a pointer to the same box
 // then the allocation will be freed.
 ~~~~
 
+Any type that contains managed boxes or other managed types is
+considered _managed_. Managed types are the only types that can
+construct cyclic data structures in Rust, such as doubly-linked lists.
+
+~~~
+// A linked list node
+struct Node {
+    mut next: MaybeNode,
+    mut prev: MaybeNode,
+    payload: int
+}
+
+enum MaybeNode {
+    SomeNode(@Node),
+    NoNode
+}
+
+let node1 = @Node { next: NoNode, prev: NoNode, payload: 1 };
+let node2 = @Node { next: NoNode, prev: NoNode, payload: 2 };
+let node3 = @Node { next: NoNode, prev: NoNode, payload: 3 };
+
+// Link the three list nodes together
+node1.next = SomeNode(node2);
+node2.prev = SomeNode(node1);
+node2.next = SomeNode(node3);
+node3.prev = SomeNode(node2);
+~~~
+
 Managed boxes never cross task boundaries.
 
 > ***Note:*** managed boxes are currently reclaimed through reference
@@ -1060,7 +1088,7 @@ Managed boxes never cross task boundaries.
 
 ## Owned boxes
 
-In contrast to maneged boxes, owned boxes have a single owning memory
+In contrast to managed boxes, owned boxes have a single owning memory
 slot and thus two owned boxes may not refer to the same memory. All
 owned boxes across all tasks are allocated on a single _exchange
 heap_, where their uniquely owned nature allows them to be passed