summaryrefslogtreecommitdiff
path: root/include/o3tl
diff options
context:
space:
mode:
authorAndrea Gelmini <andrea.gelmini@gelma.net>2016-01-09 22:55:28 +0100
committerAshod Nakashian <ashnakash@gmail.com>2016-01-10 14:17:20 +0000
commit64d624b65124ac02d8ee59b135593fd9d8eb9067 (patch)
tree772fc0f308549b9416fbcb06bce2bf0e0f5809cc /include/o3tl
parentd61c16966b017abdbebf5ec0c2131de5a91c67f8 (diff)
Fix typos
Change-Id: I9a5940027423ff0791fa7da0b79b617412ce6b86 Reviewed-on: https://gerrit.libreoffice.org/21209 Tested-by: Jenkins <ci@libreoffice.org> Reviewed-by: Ashod Nakashian <ashnakash@gmail.com>
Diffstat (limited to 'include/o3tl')
-rw-r--r--include/o3tl/enumarray.hxx2
-rw-r--r--include/o3tl/enumrange.hxx2
-rw-r--r--include/o3tl/lru_map.hxx2
3 files changed, 3 insertions, 3 deletions
diff --git a/include/o3tl/enumarray.hxx b/include/o3tl/enumarray.hxx
index d4a370548355..a6861c1b8202 100644
--- a/include/o3tl/enumarray.hxx
+++ b/include/o3tl/enumarray.hxx
@@ -33,7 +33,7 @@ class enumarray_iterator;
///
/// This assumes that the 'enum class' definition
/// - starts at zero
-/// - has no holes in it's sequence of values
+/// - has no holes in its sequence of values
/// - defines a value called LAST which refers to the greatest constant.
///
/// \param E the 'enum class' type.
diff --git a/include/o3tl/enumrange.hxx b/include/o3tl/enumrange.hxx
index 395b870db21a..be0e223a1500 100644
--- a/include/o3tl/enumrange.hxx
+++ b/include/o3tl/enumrange.hxx
@@ -29,7 +29,7 @@ namespace o3tl {
///
/// This assumes that the 'enum class' definition
/// - starts at zero
-/// - has no holes in it's sequence of values
+/// - has no holes in its sequence of values
/// - defines a value called LAST which refers to the greatest constant.
///
/// Use like this:
diff --git a/include/o3tl/lru_map.hxx b/include/o3tl/lru_map.hxx
index 2f24d5bb7acc..bc35ba77d588 100644
--- a/include/o3tl/lru_map.hxx
+++ b/include/o3tl/lru_map.hxx
@@ -19,7 +19,7 @@ namespace o3tl
/** LRU map
*
- * Similar to unordered_map (it actually uses it) with additionaly functionality
+ * Similar to unordered_map (it actually uses it) with additionally functionality
* which removes the entries that have been "least recently used" when the size
* hits the specified capacity.
*