summaryrefslogtreecommitdiff
path: root/filter/source/config/cache/cacheitem.hxx
diff options
context:
space:
mode:
authorKorrawit Pruegsanusak <detective.conan.1412@gmail.com>2011-06-12 16:40:20 +0700
committerNorbert Thiebaud <nthiebaud@gmail.com>2011-06-12 16:44:43 -0500
commit655d930476045a2de7f3ead4768bb75df8cf7c82 (patch)
tree9f240c0f4ef720b1899d5797ac1fcdffe5be2f40 /filter/source/config/cache/cacheitem.hxx
parent0fa6dbcdab49b79852c451c173867fac0d8f213a (diff)
Code cleanup
* Remove dead code * Fix comment typos Released under LGPLv3+/MPL
Diffstat (limited to 'filter/source/config/cache/cacheitem.hxx')
-rw-r--r--filter/source/config/cache/cacheitem.hxx8
1 files changed, 4 insertions, 4 deletions
diff --git a/filter/source/config/cache/cacheitem.hxx b/filter/source/config/cache/cacheitem.hxx
index 2260e076c4bc..d76aa92dd1ee 100644
--- a/filter/source/config/cache/cacheitem.hxx
+++ b/filter/source/config/cache/cacheitem.hxx
@@ -202,12 +202,12 @@ typedef ::boost::unordered_map< ::rtl::OUString ,
@descr E.g. a list of internal type names can be registered
to an extension. Organization as an hash makes it
- faster then searching inside vectors.
+ faster than searching inside vectors.
- On the other side e.g. URLPattern cant be realy adressed
+ On the other side e.g. URLPattern cant be really addressed
by a hash value ... because the use wildcards. But
there we need key-value pairs too, which cant be provided
- by a pur vector!
+ by a pure vector!
*/
typedef ::boost::unordered_map< ::rtl::OUString ,
OUStringList ,
@@ -222,7 +222,7 @@ typedef ::boost::unordered_map< ::rtl::OUString ,
@descr Every type in this list is combined with an information,
which property matched to the given URL. The user of this
structure can decide then, if a deep detection should be
- supressed e.g. if an URLPattern was used.
+ suppressed e.g. if an URLPattern was used.
*/
struct FlatDetectionInfo
{