use serde::Deserialize;
use crate::AxiamError;
#[derive(Debug, Clone, Default, PartialEq, Eq)]
pub struct PageRequest {
pub offset: u64,
pub limit: Option<u64>,
pub search: Option<String>,
}
impl PageRequest {
pub fn first(limit: u64) -> Self {
Self {
offset: 0,
limit: Some(limit),
search: None,
}
}
pub fn new(offset: u64, limit: u64) -> Self {
Self {
offset,
limit: Some(limit),
search: None,
}
}
pub fn search(mut self, term: impl Into<String>) -> Self {
let term = term.into();
self.search = normalize_search(&term).map(str::to_owned);
self
}
pub(crate) fn query(&self) -> Vec<(&'static str, String)> {
let mut q = vec![("offset", self.offset.to_string())];
if let Some(limit) = self.limit {
q.push(("limit", limit.to_string()));
}
if let Some(term) = self.search.as_deref().and_then(normalize_search) {
q.push(("search", term.to_string()));
}
q
}
fn after<T>(&self, page: &Page<T>) -> Option<Self> {
let next = page.offset.saturating_add(page.items.len() as u64);
if page.items.is_empty() || next >= page.total {
return None;
}
Some(Self {
offset: next,
limit: self.limit,
search: self.search.clone(),
})
}
}
fn normalize_search(term: &str) -> Option<&str> {
let trimmed = term.trim();
(!trimmed.is_empty()).then_some(trimmed)
}
#[derive(Debug, Clone, Deserialize, PartialEq, Eq)]
pub struct Page<T> {
pub items: Vec<T>,
pub total: u64,
pub offset: u64,
pub limit: u64,
}
impl<T> Page<T> {
pub fn has_more(&self) -> bool {
!self.items.is_empty() && self.offset.saturating_add(self.items.len() as u64) < self.total
}
}
pub(crate) async fn collect_pages<T, F, Fut>(
start: PageRequest,
mut fetch: F,
) -> Result<Vec<T>, AxiamError>
where
F: FnMut(PageRequest) -> Fut,
Fut: std::future::Future<Output = Result<Page<T>, AxiamError>>,
{
let mut request = start;
let mut out = Vec::new();
loop {
let page = fetch(request.clone()).await?;
let next = request.after(&page);
out.extend(page.items);
match next {
Some(n) => request = n,
None => return Ok(out),
}
}
}