File: RollingKthAverageVisitor.hpp

package info (click to toggle)
bedops 2.4.41%2Bdfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 21,148 kB
  • sloc: ansic: 28,562; cpp: 15,359; sh: 2,704; makefile: 2,687; xml: 1,669; python: 1,582; csh: 823; perl: 365; java: 172
file content (111 lines) | stat: -rw-r--r-- 4,155 bytes parent folder | download | duplicates (2)
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
/*
  Author: Shane Neph & Scott Kuehn
  Date:   Mon Aug 20 14:22:38 PDT 2007
*/
//
//    BEDOPS
//    Copyright (C) 2011-2022 Shane Neph, Scott Kuehn and Alex Reynolds
//
//    This program is free software; you can redistribute it and/or modify
//    it under the terms of the GNU General Public License as published by
//    the Free Software Foundation; either version 2 of the License, or
//    (at your option) any later version.
//
//    This program 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 program; if not, write to the Free Software Foundation, Inc.,
//    51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
//

#ifndef ROLLING_KTH_VISITOR_AVERAGE_HPP
#define ROLLING_KTH_VISITOR_AVERAGE_HPP

#include <cmath>
#include <cstdlib>
#include <set>
#include <string>

#include "algorithm/visitors/helpers/ProcessVisitorRow.hpp"
#include "algorithm/visitors/numerical/RollingKthVisitor.hpp"
#include "data/measurement/NaN.hpp"
#include "data/measurement/SelectMeasureType.hpp"

namespace Visitors {

  template <
            typename Process,
            typename BaseVisitor,
            typename ExceptionType = Ext::ArgumentError
           >
  struct RollingKthAverage : RollingKth<Visitors::Helpers::DoNothing, BaseVisitor, ExceptionType> {

    typedef RollingKth<Visitors::Helpers::DoNothing, BaseVisitor, ExceptionType> BaseClass;
    typedef Process ProcessType;
    typedef typename BaseClass::RefType RefType;
    typedef typename BaseClass::MapType MapType;
    typedef MapType* PtrType;

    //==============
    // Construction
    //==============
    explicit RollingKthAverage(double kth = 0.8, const ProcessType& pt = ProcessType())
        : BaseClass(kth, Visitors::Helpers::DoNothing()), pt_(pt) { /* */ }

    //====================================
    // Repositioning and Reporting Phases
    //====================================
    inline void DoneReference() {
      BaseClass::DoneReference();

      // The calculations below are based upon suggestions from wikipedia.
      //   They are different from the base class' implementation
      typedef typename Signal::SelectMeasure<MapType>::MeasureType MT;
      std::size_t size = BaseClass::scoresBuf_.size();
      std::size_t kthPosUp = static_cast<std::size_t>(std::ceil(static_cast<double>(BaseClass::kthValue_ * size)));
      std::size_t kthPosDown = static_cast<std::size_t>(std::floor(static_cast<double>(BaseClass::kthValue_ * size)));
      if ( kthPosUp > 0 ) // make zero-based
        --kthPosUp;
      if ( kthPosDown > 0 ) // make zero-based
        --kthPosDown;

      if ( size > 1 ) {
        if ( kthPosUp == kthPosDown ) { // a true integer; take average of two adjacent integers
          MT one = **BaseClass::currentMarker_;
          typename BaseClass::ScoreTypeContainer::iterator next = BaseClass::currentMarker_;
          MT two = **++next;
          pt_.operator()((one + two)/2.0);
        } else if ( BaseClass::currentAtPos_ == kthPosUp ) {
          pt_.operator()(static_cast<MT>(**BaseClass::currentMarker_));
        } else { // BaseClass::currentAtPos_ == kthPosDown; round up to kthPosUp per wikipedia
          typename BaseClass::ScoreTypeContainer::iterator next = BaseClass::currentMarker_;
          pt_.operator()(static_cast<MT>(**++next));
        }
      } else if ( 1 == size ) {
        pt_.operator()(static_cast<MT>(**BaseClass::currentMarker_));
      } else {
        static const Signal::NaN nan = Signal::NaN();
        pt_.operator()(nan);
      }
    }

    //===========
    // Cleanup()
    //===========
    virtual ~RollingKthAverage()
      { /* */ }

  protected:
    typedef Ordering::CompValueThenAddressLesser<MapType, MapType> Comp;
    typedef std::set<PtrType, Comp> ScoreTypeContainer;

  protected:
    ProcessType pt_;
  };

} // namespace Visitors

#endif // ROLLING_KTH_VISITOR_AVERAGE_HPP