diff options
| author | alberth <alberth@openttd.org> | 2010-05-30 13:05:36 +0000 |
|---|---|---|
| committer | alberth <alberth@openttd.org> | 2010-05-30 13:05:36 +0000 |
| commit | 51e67a40e09b6fba154704e89c5ea5462c7552cb (patch) | |
| tree | 64e8ab2f0dfe83bfbc639db21452d17bfb1ffce4 /src/core | |
| parent | ef353f69cac6eeef1ce0fc6c7de118479536105d (diff) | |
| download | openttd-51e67a40e09b6fba154704e89c5ea5462c7552cb.tar.xz | |
(svn r19909) -Doc: Typo fixes, small doxygen improvements.
Diffstat (limited to 'src/core')
| -rw-r--r-- | src/core/smallvec_type.hpp | 12 | ||||
| -rw-r--r-- | src/core/sort_func.hpp | 2 |
2 files changed, 7 insertions, 7 deletions
diff --git a/src/core/smallvec_type.hpp b/src/core/smallvec_type.hpp index 0a5c982cd..b7d984670 100644 --- a/src/core/smallvec_type.hpp +++ b/src/core/smallvec_type.hpp @@ -30,7 +30,7 @@ class SmallVector { protected: T *data; ///< The pointer to the first item uint items; ///< The number of items stored - uint capacity; ///< The avalible space for storing items + uint capacity; ///< The available space for storing items public: SmallVector() : data(NULL), items(0), capacity(0) { } @@ -93,7 +93,7 @@ public: } /** - * Search for the first occurence of an item. + * Search for the first occurrence of an item. * The '!=' operator of T is used for comparison. * @param item Item to search for * @return The position of the item, or End() when not present @@ -107,7 +107,7 @@ public: } /** - * Search for the first occurence of an item. + * Search for the first occurrence of an item. * The '!=' operator of T is used for comparison. * @param item Item to search for * @return The position of the item, or End() when not present @@ -121,7 +121,7 @@ public: } /** - * Search for the first occurence of an item. + * Search for the first occurrence of an item. * The '!=' operator of T is used for comparison. * @param item Item to search for * @return The position of the item, or -1 when not present @@ -250,7 +250,7 @@ public: /** * Get item "number" (const) * - * @param index the positon of the item + * @param index the position of the item * @return the item */ FORCEINLINE const T &operator[](uint index) const @@ -262,7 +262,7 @@ public: /** * Get item "number" * - * @param index the positon of the item + * @param index the position of the item * @return the item */ FORCEINLINE T &operator[](uint index) diff --git a/src/core/sort_func.hpp b/src/core/sort_func.hpp index 180191f4d..94aef195f 100644 --- a/src/core/sort_func.hpp +++ b/src/core/sort_func.hpp @@ -38,7 +38,7 @@ static FORCEINLINE void QSortT(T *base, uint num, int (CDECL *comparator)(const * Type safe Gnome Sort. * * This is a slightly modifyied Gnome search. The basic - * Gnome search trys to sort already sorted list parts. + * Gnome search tries to sort already sorted list parts. * The modification skips these. * * @note Use this sort for presorted / regular sorted data. |