summaryrefslogtreecommitdiff
path: root/src/util/dense_map.h
diff options
context:
space:
mode:
Diffstat (limited to 'src/util/dense_map.h')
-rw-r--r--src/util/dense_map.h2
1 files changed, 1 insertions, 1 deletions
diff --git a/src/util/dense_map.h b/src/util/dense_map.h
index a687985f9..6e590ae6b 100644
--- a/src/util/dense_map.h
+++ b/src/util/dense_map.h
@@ -16,7 +16,7 @@
** This is an abstraction of a Map from an unsigned integer to elements of type T.
** This class is designed to provide constant time insertion, deletion, element_of,
** and fast iteration. This is done by storing backing vectors of size greater than
- ** the maximum key. This datastructure is appropraite for heavy use datastructures
+ ** the maximum key. This datastructure is appropriate for heavy use datastructures
** where the Keys are a dense set of integers.
**
** T must support T(), and operator=().
generated by cgit on debian on lair
contact matthew@masot.net with questions or feedback