summaryrefslogtreecommitdiffstats
path: root/src/ui/tool/node.h
diff options
context:
space:
mode:
authorYuri Chornoivan <yurchor@ukr.net>2019-07-01 23:35:16 +0000
committerPatrick Storz <eduard.braun2@gmx.de>2019-07-01 23:35:16 +0000
commit7f3aa2882be5547d5308870bced554502ca4421c (patch)
tree4c6b44f441fa20ac0d409c4c98c160fcaefc00c6 /src/ui/tool/node.h
parentBasque translation update (diff)
downloadinkscape-7f3aa2882be5547d5308870bced554502ca4421c.tar.gz
inkscape-7f3aa2882be5547d5308870bced554502ca4421c.zip
Fix various minor typos
Diffstat (limited to 'src/ui/tool/node.h')
-rw-r--r--src/ui/tool/node.h2
1 files changed, 1 insertions, 1 deletions
diff --git a/src/ui/tool/node.h b/src/ui/tool/node.h
index 0d43d8159..b28f70808 100644
--- a/src/ui/tool/node.h
+++ b/src/ui/tool/node.h
@@ -274,7 +274,7 @@ private:
*
* Because paths can be cyclic, node iterators have two different ways to
* increment and decrement them. When using ++/--, the end iterator will eventually
- * be returned. Whent using advance()/retreat(), the end iterator will only be returned
+ * be returned. When using advance()/retreat(), the end iterator will only be returned
* when the path is open. If it's closed, calling advance() will cycle indefinitely.
* This is particularly useful for cases where the adjacency of nodes is more important
* than their sequence order.