summary | shortlog | log | commit | commitdiff | tree
raw | patch | inline | side by side (parent: 690da46)
raw | patch | inline | side by side (parent: 690da46)
author | mental <mental@users.sourceforge.net> | |
Sat, 29 Apr 2006 18:46:49 +0000 (18:46 +0000) | ||
committer | mental <mental@users.sourceforge.net> | |
Sat, 29 Apr 2006 18:46:49 +0000 (18:46 +0000) |
doc/refcounting.txt | patch | blob | history |
diff --git a/doc/refcounting.txt b/doc/refcounting.txt
index a27fb21fb4e4b11c2688552c0a2e185fea1518f1..e409262db7ca0f8d10d7242f2d4b924c28034cbd 100644 (file)
--- a/doc/refcounting.txt
+++ b/doc/refcounting.txt
examples are elements in a doubly-linked list with "prev" and "next"
pointers, and nodes in a tree, where a parent keeps a list of children, and
children keep a pointer to their parent. If both cases, if there is a "ref"
-in both directions, neither parent nor children can ever get freed.
+in both directions, neither object can ever get freed.
Because of this, circular data structures should be avoided when possible.
When they are necessary, try only "reffing" in one direction