count_adjacent_vertices.hh 4.55 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
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
// 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>
# include <mln/core/line_graph_image.hh>
# 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.
    template <typename P, typename V>
    struct count_adjacent_vertices_ 
      : public mln::accu::internal::base_< std::size_t,
					   count_adjacent_vertices_<P, V> >
    {
      typedef mln::util::pix< mln::line_graph_image<P, V> > argument;

      count_adjacent_vertices_();

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

      /// Force the value of the counter to \a c. 
      void set_value(std::size_t c);
      /// \}

      /// Get the value of the accumulator.
      std::size_t to_result() const;

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

    protected:
      /// The value of the counter.
      std::size_t count__;
      /// The set of adjacent vertices.
      std::set<util::node_id> vertices_;
    };


    /// \brief Meta accumulator for count_adjacent_vertices.
    struct count_adjacent_vertices
      : public Meta_Accumulator< count_adjacent_vertices >
    {
      template <typename P, typename V>
      struct with
      {
	typedef count_adjacent_vertices_<P, V> ret;
      };
    };


# ifndef MLN_INCLUDE_ONLY

    template <typename P, typename V>
    inline
    count_adjacent_vertices_<P, V>::count_adjacent_vertices_()
    {
      init();
    }

    template <typename P, typename V>
    inline
    void
    count_adjacent_vertices_<P, V>::init()
    {
      vertices_.clear();
      update_();
    }

    template <typename P, typename V>
    inline
    void
    count_adjacent_vertices_<P, V>::take(const argument& arg)
    {
      vertices_.insert(arg.p().first_id());
      vertices_.insert(arg.p().second_id());
      update_();
    }

    template <typename P, typename V>
    inline
    void
    count_adjacent_vertices_<P, V>::take(const count_adjacent_vertices_<P, V>& other)
    {
      vertices_.insert (other.vertices_.begin(), other.vertices_.end());
      update_();
    }

    template <typename P, typename V>
    inline
    std::size_t
    count_adjacent_vertices_<P, V>::to_result() const
    {
      return count__;
    }

    template <typename P, typename V>
    inline
    void
    count_adjacent_vertices_<P, V>::set_value(std::size_t c)
    {
      count__ = c;
    }

    template <typename P, typename V>
    inline
    void
    count_adjacent_vertices_<P, V>::update_()
    {
      count__ = vertices_.size();
    }

# endif // ! MLN_INCLUDE_ONLY

  } // end of namespace mln::accu

} // end of namespace mln


#endif // ! MLN_ACCU_COUNT_ADJACENT_VERTICES_HH