diff options
| author | MenTaLguY <mental@rydia.net> | 2006-04-29 18:46:49 +0000 |
|---|---|---|
| committer | mental <mental@users.sourceforge.net> | 2006-04-29 18:46:49 +0000 |
| commit | b67d9bc62cb14c4d22451e49441ec8689db9488d (patch) | |
| tree | a6eade9fad408126afd605433268149460a2403b | |
| parent | fix over-qualified name (diff) | |
| download | inkscape-b67d9bc62cb14c4d22451e49441ec8689db9488d.tar.gz inkscape-b67d9bc62cb14c4d22451e49441ec8689db9488d.zip | |
clarify wording
(bzr r627)
| -rw-r--r-- | doc/refcounting.txt | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/refcounting.txt b/doc/refcounting.txt index a27fb21fb..e409262db 100644 --- a/doc/refcounting.txt +++ b/doc/refcounting.txt @@ -69,7 +69,7 @@ breaks down in the presence of objects that reference each other. Common 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 |