summaryrefslogtreecommitdiff
path: root/src/misc
diff options
context:
space:
mode:
authoralberth <alberth@openttd.org>2010-07-31 21:02:56 +0000
committeralberth <alberth@openttd.org>2010-07-31 21:02:56 +0000
commita825b4fa5f159604f9f61bafa21b75a22d8944f5 (patch)
tree7a9c837d047157b4e2d0d068c0c3462c7a643ef9 /src/misc
parentadf94b85297b6a11989617eaa1081c7b1da08b62 (diff)
downloadopenttd-a825b4fa5f159604f9f61bafa21b75a22d8944f5.tar.xz
(svn r20266) -Doc: Mostly typo fixes, a few doxygen-related improvements.
Diffstat (limited to 'src/misc')
-rw-r--r--src/misc/binaryheap.hpp4
1 files changed, 2 insertions, 2 deletions
diff --git a/src/misc/binaryheap.hpp b/src/misc/binaryheap.hpp
index 944032cac..9096474e8 100644
--- a/src/misc/binaryheap.hpp
+++ b/src/misc/binaryheap.hpp
@@ -23,7 +23,7 @@
/**
* Binary Heap as C++ template.
- * A carrier which keeps its items automaticaly holds the smallest item at
+ * A carrier which keeps its items automatically holds the smallest item at
* the first position. The order of items is maintained by using a binary tree.
* The implementation is used for priority queue's.
*
@@ -36,7 +36,7 @@
* are allocated elsewhere.
*
* @par Implementation notes:
- * Internaly the first item is never used, because that simplifies the
+ * Internally the first item is never used, because that simplifies the
* implementation.
*
* @par