summaryrefslogtreecommitdiff
path: root/src/util/dense_map.h
diff options
context:
space:
mode:
authorAina Niemetz <aina.niemetz@gmail.com>2021-03-08 23:27:03 -0800
committerGitHub <noreply@github.com>2021-03-09 07:27:03 +0000
commitb302cb1f92aae1c0954c86065469e5c2b7206e74 (patch)
treef2b4cad1effdfe8041f00f23b6fe255b0c4004bb /src/util/dense_map.h
parent86ce1c18f8ea7a397a8b12405a196b126e82b648 (diff)
Update copyright headers to 2021. (#6081)
Diffstat (limited to 'src/util/dense_map.h')
-rw-r--r--src/util/dense_map.h17
1 files changed, 10 insertions, 7 deletions
diff --git a/src/util/dense_map.h b/src/util/dense_map.h
index e4dfaf4a7..7a3421281 100644
--- a/src/util/dense_map.h
+++ b/src/util/dense_map.h
@@ -4,18 +4,21 @@
** Top contributors (to current version):
** Tim King, Dejan Jovanovic, Mathias Preiner
** This file is part of the CVC4 project.
- ** Copyright (c) 2009-2020 by the authors listed in the file AUTHORS
+ ** Copyright (c) 2009-2021 by the authors listed in the file AUTHORS
** in the top-level source directory and their institutional affiliations.
** All rights reserved. See the file COPYING in the top-level source
** directory for licensing information.\endverbatim
**
- ** \brief This is an abstraction of a Map from unsigned integers to elements of type T.
+ ** \brief This is an abstraction of a Map from unsigned integers to elements
+ ** of type T.
**
- ** 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 appropriate for heavy use datastructures
- ** where the Keys are a dense set of integers.
+ ** 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 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