summaryrefslogtreecommitdiff
path: root/gtk/gtktreemodelfilter.c
diff options
context:
space:
mode:
authorWilliam Jon McCann <william.jon.mccann@gmail.com>2014-02-07 13:01:26 -0500
committerWilliam Jon McCann <william.jon.mccann@gmail.com>2014-02-07 13:06:10 -0500
commit7a208fbbf3d28c8b5bfeb1c612d60305ab3a235e (patch)
tree7b75aa3eebb772a7cf28f4b639f84b273fbbca62 /gtk/gtktreemodelfilter.c
parentf116f0071e3a0f03c973532bceee30b3221e5b3f (diff)
downloadgtk+-7a208fbbf3d28c8b5bfeb1c612d60305ab3a235e.tar.gz
docs: use proper apostrophe
https://wiki.gnome.org/Design/OS/Typography
Diffstat (limited to 'gtk/gtktreemodelfilter.c')
-rw-r--r--gtk/gtktreemodelfilter.c10
1 files changed, 5 insertions, 5 deletions
diff --git a/gtk/gtktreemodelfilter.c b/gtk/gtktreemodelfilter.c
index 04012356e8..ec966f81dc 100644
--- a/gtk/gtktreemodelfilter.c
+++ b/gtk/gtktreemodelfilter.c
@@ -75,8 +75,8 @@
* of its child nodes is a frequently occurring use case. Therefore,
* #GtkTreeModelFilter explicitly supports this. For example, when a node
* does not have any children, you might not want the node to be visible.
- * As soon as the first row is added to the node's child level (or the
- * last row removed), the node's visibility should be updated.
+ * As soon as the first row is added to the node’s child level (or the
+ * last row removed), the node’s visibility should be updated.
*
* This introduces a dependency from the node on its child nodes. In order
* to accommodate this, #GtkTreeModelFilter must make sure the necessary
@@ -90,7 +90,7 @@
*
* Beware, however, that this explicit support is limited to these two
* cases. For example, if you want a node to be visible only if two nodes
- * in a child's child level (2 levels deeper) are visible, you are on your
+ * in a child’s child level (2 levels deeper) are visible, you are on your
* own. In this case, either rely on #GtkTreeStore to emit all signals
* because it does not implement reference counting, or for models that
* do implement reference counting, obtain references on these child levels
@@ -116,7 +116,7 @@
* similar data structures, many assumptions made in the GtkTreeModelSort
* code do *not* apply in the GtkTreeModelFilter case. Reference counting
* in particular is more complicated in GtkTreeModelFilter, because
- * we explicitly support reliance on the state of a node's children as
+ * we explicitly support reliance on the state of a node’s children as
* outlined in the public API documentation. Because of these differences,
* you are strongly recommended to first read through these notes before
* making any modification to the code.
@@ -192,7 +192,7 @@
* rule 1 in the GtkTreeModel documentation.
*
* A second case is required to support visible functions which depend on
- * the state of a node's children (see the public API documentation for
+ * the state of a node’s children (see the public API documentation for
* GtkTreeModelFilter above). We build the child level of each node that
* could be visible in the client (i.e. the level has an ext_ref_count > 0;
* not the elt, because the elt might be invisible and thus unreferenced