From a8226e874345ad5cdc52a2cddd0e21c4a5d7ad67 Mon Sep 17 00:00:00 2001 From: Guillaume Damiand Date: Mon, 22 Jun 2015 15:45:07 +0200 Subject: [PATCH] Add sentence about handle that are LessThanComparable and Hashable --- .../doc/Combinatorial_map/Combinatorial_map.txt | 7 ++++++- 1 file changed, 6 insertions(+), 1 deletion(-) diff --git a/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt b/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt index 0439839b63b..0b7bd690326 100644 --- a/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt +++ b/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt @@ -579,10 +579,15 @@ Section \ref ssecattributes "Cell Attributes"). Users can customize a combinatorial map thanks to an items class (see Section \ref ssecitem "Combinatorial Map Items"), which defines the dart type and the attribute types. These types may be different for different -dimensions, and they may also be void. The darts and attributes are +dimensions, and they may also be void. + +The darts and attributes are accessed through handles. A handle is a model of the `Handle` concept, thus supporting the two dereference operators `operator*` and `operator->`. +All handles are model of `LessThanComparable` and `Hashable`, +that is they can be used as keys in containers such as `std::map` +and `boost::unordered_map`. \cgalFigureBegin{figdiagram_class,Diagramme_class.png} UML diagram of the main classes of the package. k is the number of non void attributes.