count_adjacent_vertices.hh 4.76 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
// Copyright (C) 2007, 2008 EPITA Research and Development Laboratory (LRDE)
//
// This file is part of the Olena Library.  This library is free
// software; you can redistribute it and/or modify it under the terms
// of the GNU General Public License version 2 as published by the
// Free Software Foundation.
//
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
// General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this library; see the file COPYING.  If not, write to
// the Free Software Foundation, 51 Franklin Street, Fifth Floor,
// Boston, MA 02111-1307, USA.
//
// As a special exception, you may use this file as part of a free
// software library without restriction.  Specifically, if other files
// instantiate templates or use macros or inline functions from this
// file, or you compile this file and link it with other files to
// produce an executable, this file does not by itself cause the
// resulting executable to be covered by the GNU General Public
// License.  This exception does not however invalidate any other
// reasons why the executable file might be covered by the GNU General
// Public License.

#ifndef MLN_ACCU_COUNT_ADJACENT_VERTICES_HH
# define MLN_ACCU_COUNT_ADJACENT_VERTICES_HH

/// \file mln/accu/count_adjacent_vertices.hh
/// \brief Define an accumulator that counts the vertices adjacent to a
/// set of line graph psite.

# include <mln/accu/internal/base.hh>
# include <mln/core/concept/meta_accumulator.hh>
37
# include <mln/core/image/line_graph_image.hh>
38
39
40
41
42
43
44
45
46
47
48
49
50
51
# include <mln/util/pix.hh>

namespace mln
{

  namespace accu
  {

    /// \brief Accumulator class counting the number of vertices
    /// adjacent to a set of mln::line_graph_psite (i.e., a set of
    /// edges).
    ///
    /// The type to be count is mln::util::pix< mln::line_graph_image<P, V> >
    /// where \p P and \p V are the parameters of this class.
52
53
54
    ///
    /// This accumulator is used by mln::closing_area_on_vertices and
    /// mln::opening_area_on_vertices.
55
    template <typename P, typename V>
56
    struct count_adjacent_vertices
Ugo Jardonnet's avatar
Ugo Jardonnet committed
57
      : public mln::accu::internal::base< unsigned,
58
					  count_adjacent_vertices<P, V> >
59
60
61
    {
      typedef mln::util::pix< mln::line_graph_image<P, V> > argument;

62
      count_adjacent_vertices();
63
64
65
66
67

      /// Manipulators.
      /// \{
      void init();
      void take(const argument& arg);
68
      void take(const count_adjacent_vertices<P, V>& other);
69

70
      /// Force the value of the counter to \a c.
Ugo Jardonnet's avatar
Ugo Jardonnet committed
71
      void set_value(unsigned c);
72
73
74
      /// \}

      /// Get the value of the accumulator.
Ugo Jardonnet's avatar
Ugo Jardonnet committed
75
      unsigned to_result() const;
76
77
78
79
80
81
82

    protected:
      /// Update the value of the counter.
      void update_ ();

    protected:
      /// The value of the counter.
Ugo Jardonnet's avatar
Ugo Jardonnet committed
83
      unsigned count__;
84
      /// The set of adjacent vertices.
85
      std::set<util::vertex_id> vertices_;
86
87
88
    };


89
    namespace meta
90
    {
91
92
93
94

      /// \brief Meta accumulator for count_adjacent_vertices.
      struct count_adjacent_vertices
	: public Meta_Accumulator< count_adjacent_vertices >
95
      {
96
97
98
99
100
	template <typename P, typename V>
	  struct with
	  {
	    typedef accu::count_adjacent_vertices<P, V> ret;
	  };
101
      };
102
103

    } // end of namespace mln::accu::meta
104
105
106
107
108
109


# ifndef MLN_INCLUDE_ONLY

    template <typename P, typename V>
    inline
110
    count_adjacent_vertices<P, V>::count_adjacent_vertices()
111
112
113
114
115
116
117
    {
      init();
    }

    template <typename P, typename V>
    inline
    void
118
    count_adjacent_vertices<P, V>::init()
119
120
121
122
123
124
125
126
    {
      vertices_.clear();
      update_();
    }

    template <typename P, typename V>
    inline
    void
127
    count_adjacent_vertices<P, V>::take(const argument& arg)
128
129
130
131
132
133
134
135
136
    {
      vertices_.insert(arg.p().first_id());
      vertices_.insert(arg.p().second_id());
      update_();
    }

    template <typename P, typename V>
    inline
    void
137
    count_adjacent_vertices<P, V>::take(const count_adjacent_vertices<P, V>& other)
138
139
140
141
142
143
144
    {
      vertices_.insert (other.vertices_.begin(), other.vertices_.end());
      update_();
    }

    template <typename P, typename V>
    inline
Ugo Jardonnet's avatar
Ugo Jardonnet committed
145
    unsigned
146
    count_adjacent_vertices<P, V>::to_result() const
147
148
149
150
151
152
153
    {
      return count__;
    }

    template <typename P, typename V>
    inline
    void
Ugo Jardonnet's avatar
Ugo Jardonnet committed
154
    count_adjacent_vertices<P, V>::set_value(unsigned c)
155
156
    {
      count__ = c;
157
158
      /// Reset the other member.
      vertices_.clear();
159
160
161
162
163
    }

    template <typename P, typename V>
    inline
    void
164
    count_adjacent_vertices<P, V>::update_()
165
166
167
168
169
170
171
172
173
174
175
176
    {
      count__ = vertices_.size();
    }

# endif // ! MLN_INCLUDE_ONLY

  } // end of namespace mln::accu

} // end of namespace mln


#endif // ! MLN_ACCU_COUNT_ADJACENT_VERTICES_HH