use std::path::PathBuf;use crate::{ alternate, store_impls::{compound, linked},};/// The error returned by [`linked::Store::at()`]#[derive(Debug, thiserror::Error)]#[allow(missing_docs)]pub enum Error { #[error(transparent)] CompoundDbInit(#[from] compound::init::Error), #[error(transparent)] AlternateResolve(#[from] alternate::Error),}impl linked::Store { /// Instantiate an instance at the given `objects_directory`, commonly `.git/objects`. /// /// _git alternate_ files will be traversed to build a chain of [`compound::Store`] instances. pub fn at(objects_directory: impl Into<PathBuf>) -> Result<Self, Error> { let mut dbs = vec![compound::Store::at(objects_directory.into(), 0)?]; let compute_ofs = |db: &compound::Store| db.bundles.iter().map(|p| p.pack.id).max().map(|ofs| ofs + 1); let mut ofs = compute_ofs(&dbs[0]).unwrap_or(0); for object_path in alternate::resolve(dbs[0].loose.path.clone())?.into_iter() { let store = compound::Store::at(object_path, ofs)?; ofs = compute_ofs(&store).unwrap_or(ofs); dbs.push(store); } assert!( !dbs.is_empty(), "we can rely on at least one compound database to be present" ); Ok(linked::Store { dbs }) } /// Efficiently refresh the stable data like memory maps of packs or linked repositories to reflect the changed state on disk. pub fn refresh(&mut self) -> Result<&mut Self, Error> { // TODO: actually do this efficiently by only loading or discarding what changed. Probably redirect the non-alternates impl // to the compound db to deal with pack refreshing. let first_db = self.dbs.remove(0); let base_path = first_db.loose.path; *self = Self::at(base_path)?; Ok(self) }}impl std::convert::TryFrom<PathBuf> for linked::Store { type Error = Error; fn try_from(value: PathBuf) -> Result<Self, Self::Error> { linked::Store::at(value) }}
use std::path::PathBuf;
use crate::{
alternate,
store_impls::{compound, linked},
};
/// The error returned by [`linked::Store::at()`]
#[derive(Debug, thiserror::Error)]
#[allow(missing_docs)]
pub enum Error {
#[error(transparent)]
CompoundDbInit(#[from] compound::init::Error),
#[error(transparent)]
AlternateResolve(#[from] alternate::Error),
}
impl linked::Store {
/// Instantiate an instance at the given `objects_directory`, commonly `.git/objects`.
///
/// _git alternate_ files will be traversed to build a chain of [`compound::Store`] instances.
pub fn at(objects_directory: impl Into<PathBuf>) -> Result<Self, Error> {
let mut dbs = vec![compound::Store::at(objects_directory.into(), 0)?];
let compute_ofs = |db: &compound::Store| db.bundles.iter().map(|p| p.pack.id).max().map(|ofs| ofs + 1);
let mut ofs = compute_ofs(&dbs[0]).unwrap_or(0);
for object_path in alternate::resolve(dbs[0].loose.path.clone())?.into_iter() {
let store = compound::Store::at(object_path, ofs)?;
ofs = compute_ofs(&store).unwrap_or(ofs);
dbs.push(store);
}
assert!(
!dbs.is_empty(),
"we can rely on at least one compound database to be present"
);
Ok(linked::Store { dbs })
}
/// Efficiently refresh the stable data like memory maps of packs or linked repositories to reflect the changed state on disk.
pub fn refresh(&mut self) -> Result<&mut Self, Error> {
// TODO: actually do this efficiently by only loading or discarding what changed. Probably redirect the non-alternates impl
// to the compound db to deal with pack refreshing.
let first_db = self.dbs.remove(0);
let base_path = first_db.loose.path;
*self = Self::at(base_path)?;
Ok(self)
}
}
impl std::convert::TryFrom<PathBuf> for linked::Store {
type Error = Error;
fn try_from(value: PathBuf) -> Result<Self, Self::Error> {
linked::Store::at(value)
}
}