diff options
author | dennisroczek <dennisroczek@libreoffice.org> | 2017-03-13 12:07:28 +0000 |
---|---|---|
committer | Noel Grandin <noel.grandin@collabora.co.uk> | 2017-03-14 06:36:18 +0000 |
commit | f6678c297b3eb119a928344792951886d1d6ca53 (patch) | |
tree | 4be5c709bef03d99a50a4e73c0f43919ee3f304f /o3tl/qa/test-lru_map.cxx | |
parent | cf21b6b19d918cdf3b6dc1c07c0b91e604370ede (diff) |
fix typo: alreay --> already
Change-Id: Iabb8588a2547c925c2c959f3b4831c89935a9529
Reviewed-on: https://gerrit.libreoffice.org/35133
Reviewed-by: Noel Grandin <noel.grandin@collabora.co.uk>
Tested-by: Noel Grandin <noel.grandin@collabora.co.uk>
Diffstat (limited to 'o3tl/qa/test-lru_map.cxx')
-rw-r--r-- | o3tl/qa/test-lru_map.cxx | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/o3tl/qa/test-lru_map.cxx b/o3tl/qa/test-lru_map.cxx index abd9cb237bb9..b985966f43d2 100644 --- a/o3tl/qa/test-lru_map.cxx +++ b/o3tl/qa/test-lru_map.cxx @@ -78,7 +78,7 @@ void lru_map_test::testReplaceValue() CPPUNIT_ASSERT_EQUAL(size_t(1), lru.size()); CPPUNIT_ASSERT_EQUAL(2, lru.find(1)->second); - // inserting new entry with key that alreay exists + // inserting new entry with key that already exists lru.insert(std::make_pair<int, int>(1, 4)); CPPUNIT_ASSERT_EQUAL(size_t(1), lru.size()); CPPUNIT_ASSERT_EQUAL(4, lru.find(1)->second); @@ -91,7 +91,7 @@ void lru_map_test::testReplaceValue() // check if insert with same key, moves the entry back of the lru queu - // inserting new entry with key that alreay exists + // inserting new entry with key that already exists lru.insert(std::make_pair<int, int>(1, 6)); // inserting new entry, lru removed lru.insert(std::make_pair<int, int>(3, 300)); |