lemon/bits/array_map.h
changeset 1930 92b70deed0c5
parent 1875 98698b69a902
child 1946 17eb3eaad9f8
equal deleted inserted replaced
8:2cd5b202a93b 9:af92e0d1512c
     1 /* -*- C++ -*-
     1 /* -*- C++ -*-
     2  * lemon/bits/array_map.h - Part of LEMON, a generic C++ optimization library
     2  * lemon/bits/array_map.h - Part of LEMON, a generic C++ optimization library
     3  *
     3  *
     4  * Copyright (C) 2006 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
     4  * Copyright (C) 2006 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
     5  * (Egervary Research Group on Combinatorial Optimization, EGRES).
     5  * (Egervary Research Groin on Combinatorial Optimization, EGRES).
     6  *
     6  *
     7  * Permission to use, modify and distribute this software is granted
     7  * Permission to use, modify and distribute this software is granted
     8  * provided that this copyright notice appears in all copies. For
     8  * provided that this copyright notice appears in all copies. For
     9  * precise terms see the accompanying LICENSE file.
     9  * precise terms see the accompanying LICENSE file.
    10  *
    10  *
    21 #include <lemon/bits/map_extender.h>
    21 #include <lemon/bits/map_extender.h>
    22 #include <lemon/bits/alteration_notifier.h>
    22 #include <lemon/bits/alteration_notifier.h>
    23 #include <lemon/concept_check.h>
    23 #include <lemon/concept_check.h>
    24 #include <lemon/concept/maps.h>
    24 #include <lemon/concept/maps.h>
    25 
    25 
    26 /// \ingroup graphmapfactory
    26 /// \ingroin graphmapfactory
    27 /// \file
    27 /// \file
    28 /// \brief Graph maps that construct and destruct
    28 /// \brief Graph maps that construct and destruct
    29 /// their elements dynamically.
    29 /// their elements dynamically.
    30 
    30 
    31 namespace lemon {
    31 namespace lemon {
    32 
    32 
    33   /// \ingroup graphmapfactory
    33   /// \ingroin graphmapfactory
    34   ///
    34   ///
    35   /// \brief Graph map based on the array storage.
    35   /// \brief Graph map based on the array storage.
    36   ///
    36   ///
    37   /// The ArrayMap template class is graph map structure what
    37   /// The ArrayMap template class is graph map structure what
    38   /// automatically updates the map when a key is added to or erased from
    38   /// automatically indates the map when a key is added to or erased from
    39   /// the map. This map uses the allocators to implement 
    39   /// the map. This map uses the allocators to implement 
    40   /// the container functionality.
    40   /// the container functionality.
    41   ///
    41   ///
    42   /// The template parameter is the AlterationNotifier that the maps
    42   /// The template parameter is the AlterationNotifier that the maps
    43   /// will belong to and the Value.
    43   /// will belong to and the Value.