summaryrefslogtreecommitdiffstats
path: root/src/geom.cpp
diff options
context:
space:
mode:
authorDiederik van Lierop <mail@diedenrezi.nl>2007-11-03 14:48:50 +0000
committerdvlierop2 <dvlierop2@users.sourceforge.net>2007-11-03 14:48:50 +0000
commit84504bd815a6ef3c5b7b5958ce46429cbab56a66 (patch)
treed74ae924d96f98b07658dcb67d46b64c486d1beb /src/geom.cpp
parentAdded an icons file with a cleaned up current icon set (prefix "ink_" in thei... (diff)
downloadinkscape-84504bd815a6ef3c5b7b5958ce46429cbab56a66.tar.gz
inkscape-84504bd815a6ef3c5b7b5958ce46429cbab56a66.zip
Groundwork to snap to intersections, e.g. intersections of gridlines with guidelines, and of objects with other objects. The snappers used to return only SnappedPoints, but now also SnappedLines and SnappedInfiniteLines can be returned. SnappedPaths will be implemented later.
(bzr r4016)
Diffstat (limited to 'src/geom.cpp')
-rw-r--r--src/geom.cpp2
1 files changed, 1 insertions, 1 deletions
diff --git a/src/geom.cpp b/src/geom.cpp
index e59b0f302..5072b0c0e 100644
--- a/src/geom.cpp
+++ b/src/geom.cpp
@@ -17,7 +17,7 @@
* intersection; otherwise, \a result remains unchanged.
*
* This function finds the intersection of the two lines (infinite)
- * defined by n0.X = d0 and x1.X = d1. The algorithm is as follows:
+ * defined by n0.X = d0 and n1.X = d1. The algorithm is as follows:
* To compute the intersection point use Cramer's rule:
* (see http://en.wikipedia.org/wiki/Cramer%27s_rule)
* \verbatim