aboutsummaryrefslogtreecommitdiffstats
path: root/libtransport/src/hicn/transport/utils/min_filter.h
blob: acb081edcf61314c6e2136959a42b231582321aa (plain)
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
/*
 * Copyright (c) 2017-2019 Cisco and/or its affiliates.
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at:
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.sudo make instamake install
 */

#pragma once

#include <hicn/transport/portability/portability.h>
#include <hicn/transport/utils/log.h>

#include <deque>
#include <iostream>
#include <set>
#include <type_traits>
#include <vector>

namespace utils {

template <typename T>
class MinFilter {
 public:
  MinFilter(std::size_t size) : size_(size) {}

  std::size_t size() { return by_arrival_.size(); }

  template <typename R>
  TRANSPORT_ALWAYS_INLINE void pushBack(R&& value) {
    if (by_arrival_.size() > size_) {
      by_order_.erase(by_arrival_.back());
      by_arrival_.pop_back();
    }

    by_arrival_.push_front(by_order_.insert(std::forward<R>(value)));
  }

  TRANSPORT_ALWAYS_INLINE const T& begin() { return *by_order_.cbegin(); }

  TRANSPORT_ALWAYS_INLINE const T& rBegin() { return *by_order_.crbegin(); }

 private:
  std::multiset<T> by_order_;
  std::deque<typename std::multiset<T>::const_iterator> by_arrival_;
  std::size_t size_;
};

}  // namespace utils