replaced wxControl with wxWindow in 2 methods

[wxWidgets.git] / docs / latex / wx / hashmap.tex

diff --git a/docs/latex/wx/hashmap.tex b/docs/latex/wx/hashmap.tex
index 5649d907eb25e68ecfd59e28d3d30b2117e3ba31..2faf063e6319e21dd01013b93ea02b7b15bbdfa9 100644 (file)
--- a/docs/latex/wx/hashmap.tex
+++ b/docs/latex/wx/hashmap.tex
@@ -3,7 +3,7 @@
 This is a simple, type-safe, and reasonably efficient hash map class,
 whose interface is a subset of the interface of STL containers. In
 particular, the interface is modelled after std::map, and the various,
-non standard, std::hash_map.
+non standard, std::hash\_map.
 
 \wxheading{Example}
 
@@ -68,7 +68,7 @@ and VALUE\_T values.
 \end{verbatim}
 
 The HASH\_T and KEY\_EQ\_T are the types
-used for the hashing function and key comparison. wxWindows provides
+used for the hashing function and key comparison. wxWidgets provides
 three predefined hashing functions: {\tt wxIntegerHash}
 for integer types ( {\tt int}, {\tt long}, {\tt short},
 and their unsigned counterparts ), {\tt wxStringHash} for strings
@@ -156,7 +156,7 @@ means that you can't use {\tt --it}, {\tt it + 3}, {\tt it1 - it2}.
 
 \func{}{wxHashMap}{\param{size\_type}{ size = 10}}
 
-The size parameter is just an hint, the table will resize automatically
+The size parameter is just a hint, the table will resize automatically
 to preserve performance.
 
 \func{}{wxHashMap}{\param{const wxHashMap\&}{ map}}
@@ -204,7 +204,7 @@ Please remember that hash maps do not guarantee ordering.
 
 \func{size\_type}{erase}{\param{const key\_type\&}{ key}}
 
-Erases the element with the given key, and returns the number of element
+Erases the element with the given key, and returns the number of elements
 erased (either 0 or 1).
 
 \func{void}{erase}{\param{iterator}{ it}}
@@ -242,5 +242,5 @@ default {\tt value\_type()} is inserted in the table.
 
 \constfunc{size\_type}{size}{}
 
-Returns the numbers of elements in the map.
+Returns the number of elements in the map.