aboutsummaryrefslogtreecommitdiff
path: root/test/common
diff options
context:
space:
mode:
authorJohannes Schickel2009-12-27 11:12:05 +0000
committerJohannes Schickel2009-12-27 11:12:05 +0000
commit11a835b6ce3a0bfe4b985c94361247f8916ea7e6 (patch)
treec8676ff0e704407266c924f06ef4355d39577d71 /test/common
parentcbeb0011897c85d19d76602cfa8f9cc49ee7315a (diff)
downloadscummvm-rg350-11a835b6ce3a0bfe4b985c94361247f8916ea7e6.tar.gz
scummvm-rg350-11a835b6ce3a0bfe4b985c94361247f8916ea7e6.tar.bz2
scummvm-rg350-11a835b6ce3a0bfe4b985c94361247f8916ea7e6.zip
Typo.
svn-id: r46621
Diffstat (limited to 'test/common')
-rw-r--r--test/common/algorithm.h4
1 files changed, 2 insertions, 2 deletions
diff --git a/test/common/algorithm.h b/test/common/algorithm.h
index 79845b835f..bc10841fae 100644
--- a/test/common/algorithm.h
+++ b/test/common/algorithm.h
@@ -12,11 +12,11 @@ class AlgorithmTestSuite : public CxxTest::TestSuite {
return true;
// Check whether the container is sorted by the given binary predicate, which
- // decides whether the first value passed preceeds the second value passed.
+ // decides whether the first value passed precedes the second value passed.
//
// To do that it checks an item and its follower in the container with the
// given predicate in reverse order, when it returns false everything is
- // fine, when it returns false, the follower preceeds the item and thus
+ // fine, when it returns false, the follower precedes the item and thus
// the order is violated.
for (T prev = first++; first != last; ++prev, ++first) {
if (comp(*first, *prev))