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
// Copyright 2022 Axiom-Team
//
// This file is part of Duniter-v2S.
//
// Duniter-v2S is free software: you can redistribute it and/or modify
// it under the terms of the GNU Affero General Public License as published by
// the Free Software Foundation, version 3 of the License.
//
// Duniter-v2S 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 Affero General Public License for more details.
//
// You should have received a copy of the GNU Affero General Public License
// along with Duniter-v2S. If not, see <https://www.gnu.org/licenses/>.
use frame_support::pallet_prelude::*;
use sp_std::cmp::Ordering;
#[derive(Clone, Debug, Decode, Default, Encode, TypeInfo)]
pub struct MedianAcc<
T: Clone + Decode + Encode + Ord + TypeInfo,
const S: u32, /*Get<u32> + TypeInfo*/
> {
samples: BoundedVec<(T, u32), ConstU32<S>>,
median_index: Option<u32>,
median_subindex: u32,
}
/*impl<T: 'static + Clone + Decode + Encode + Ord + TypeInfo, S: 'static + Get<u32>> TypeInfo
for MedianAcc<T, S>
{
type Identity = Self;
fn type_info() -> scale_info::Type<scale_info::form::MetaForm> {}
}*/
#[derive(Clone, Debug, Eq, PartialEq)]
pub enum MedianResult<T: Clone + Ord> {
One(T),
Two(T, T),
}
impl<T: Clone + Decode + Encode + Ord + TypeInfo, const S: u32 /*Get<u32> + TypeInfo*/>
MedianAcc<T, S>
{
pub fn new() -> Self {
Self {
samples: BoundedVec::default(),
median_index: None,
median_subindex: 0,
}
}
pub fn push(&mut self, sample: T) {
if let Some(median_index) = &mut self.median_index {
match self
.samples
.binary_search_by_key(&sample, |(s, _n)| s.clone())
{
Ok(sample_index) => {
self.samples.get_mut(sample_index).expect("unreachable").1 += 1;
match (sample_index as u32).cmp(median_index) {
Ordering::Greater => {
if self.median_subindex
== self
.samples
.get(*median_index as usize)
.expect("unreachable")
.1
* 2
- 1
{
self.median_subindex = 0;
*median_index += 1;
} else {
self.median_subindex += 1;
}
}
Ordering::Equal => {
self.median_subindex += 1;
}
Ordering::Less => {
if self.median_subindex == 0 {
*median_index -= 1;
self.median_subindex = self
.samples
.get(*median_index as usize)
.expect("unreachable")
.1
* 2
- 1;
} else {
self.median_subindex -= 1;
}
}
}
}
Err(sample_index) => {
self.samples.try_insert(sample_index, (sample, 1)).ok();
if *median_index as usize >= sample_index {
if self.median_subindex == 0 {
self.median_subindex = self
.samples
.get(*median_index as usize)
.expect("unreachable")
.1
* 2
- 1;
} else {
self.median_subindex -= 1;
*median_index += 1;
}
} else if self.median_subindex
== self
.samples
.get(*median_index as usize)
.expect("unreachable")
.1
* 2
- 1
{
self.median_subindex = 0;
*median_index += 1;
} else {
self.median_subindex += 1;
}
}
}
} else {
self.samples.try_push((sample, 1)).ok();
self.median_index = Some(0);
}
}
pub fn get_median(&self) -> Option<MedianResult<T>> {
self.median_index.map(|median_index| {
let (median_sample, median_n) = self
.samples
.get(median_index as usize)
.expect("unreachable");
if self.median_subindex == median_n * 2 - 1 {
MedianResult::Two(
median_sample.clone(),
self.samples
.get(median_index as usize + 1)
.expect("unreachable")
.0
.clone(),
)
} else {
MedianResult::One(median_sample.clone())
}
})
}
}