use crate::core::util::error::lucene_error::{LuceneError, Result};
pub struct FloatHeap {
max_size: usize,
heap: Box<[f32]>,
size: usize,
}
impl FloatHeap {
pub fn new(max_size: usize) -> Result<Self> {
if max_size < 1 {
return Err(LuceneError::illegal_argument(format!(
"max_size must be > 0; got: {max_size}"
)));
}
Ok(Self {
max_size,
heap: vec![0.0; max_size + 1].into_boxed_slice(),
size: 0,
})
}
pub fn offer(&mut self, value: f32) -> bool {
if self.size >= self.max_size {
if value < self.heap[1] {
return false;
}
self.update_top(value);
return true;
}
self.push(value);
true
}
pub fn get_heap(&self) -> Vec<f32> {
self.heap[1..=self.size].to_vec()
}
pub fn poll(&mut self) -> Result<f32> {
if self.size == 0 {
return Err(LuceneError::illegal_state("The heap is empty"));
}
let result = self.heap[1];
self.heap[1] = self.heap[self.size];
self.size -= 1;
self.down_heap(1);
Ok(result)
}
pub fn peek(&self) -> f32 {
self.heap[1]
}
pub fn size(&self) -> usize {
self.size
}
pub fn clear(&mut self) {
self.size = 0;
}
fn push(&mut self, element: f32) {
self.size += 1;
self.heap[self.size] = element;
self.up_heap(self.size);
}
fn update_top(&mut self, value: f32) -> f32 {
self.heap[1] = value;
self.down_heap(1);
self.heap[1]
}
fn down_heap(&mut self, mut i: usize) {
let value = self.heap[i]; let mut j = i << 1; let mut k = j + 1;
if k <= self.size && self.heap[k] < self.heap[j] {
j = k;
}
while j <= self.size && self.heap[j] < value {
self.heap[i] = self.heap[j]; i = j;
j = i << 1;
k = j + 1;
if k <= self.size && self.heap[k] < self.heap[j] {
j = k;
}
}
self.heap[i] = value; }
fn up_heap(&mut self, mut i: usize) {
let value = self.heap[i]; let mut j = i >> 1;
while j > 0 && value < self.heap[j] {
self.heap[i] = self.heap[j]; i = j;
j >>= 1;
}
self.heap[i] = value; }
}