dirstate.rs
90 lines
| 2.5 KiB
| application/rls-services+xml
|
RustLexer
Raphaël Gomès
|
r42993 | // dirstate module | ||
// | ||||
// Copyright 2019 Raphaël Gomès <rgomes@octobus.net> | ||||
// | ||||
// This software may be used and distributed according to the terms of the | ||||
// GNU General Public License version 2 or any later version. | ||||
Raphaël Gomès
|
r44278 | use crate::{utils::hg_path::HgPathBuf, DirstateParseError, FastHashMap}; | ||
Yuya Nishihara
|
r43156 | use std::collections::hash_map; | ||
Raphaël Gomès
|
r42994 | use std::convert::TryFrom; | ||
Raphaël Gomès
|
r42993 | |||
Raphaël Gomès
|
r42828 | pub mod dirs_multiset; | ||
Raphaël Gomès
|
r42998 | pub mod dirstate_map; | ||
Raphaël Gomès
|
r46184 | #[cfg(feature = "dirstate-tree")] | ||
Raphaël Gomès
|
r46136 | pub mod dirstate_tree; | ||
Raphaël Gomès
|
r42828 | pub mod parsers; | ||
Raphaël Gomès
|
r43565 | pub mod status; | ||
Raphaël Gomès
|
r42828 | |||
Raphaël Gomès
|
r42993 | #[derive(Debug, PartialEq, Clone)] | ||
pub struct DirstateParents { | ||||
pub p1: [u8; 20], | ||||
pub p2: [u8; 20], | ||||
Raphaël Gomès
|
r42828 | } | ||
/// The C implementation uses all signed types. This will be an issue | ||||
/// either when 4GB+ source files are commonplace or in 2038, whichever | ||||
/// comes first. | ||||
Raphaël Gomès
|
r42993 | #[derive(Debug, PartialEq, Copy, Clone)] | ||
Raphaël Gomès
|
r42828 | pub struct DirstateEntry { | ||
Raphaël Gomès
|
r42994 | pub state: EntryState, | ||
Raphaël Gomès
|
r42828 | pub mode: i32, | ||
pub mtime: i32, | ||||
pub size: i32, | ||||
} | ||||
Raphaël Gomès
|
r44003 | /// A `DirstateEntry` with a size of `-2` means that it was merged from the | ||
/// other parent. This allows revert to pick the right status back during a | ||||
/// merge. | ||||
pub const SIZE_FROM_OTHER_PARENT: i32 = -2; | ||||
Raphaël Gomès
|
r46185 | #[cfg(not(feature = "dirstate-tree"))] | ||
Raphaël Gomès
|
r44278 | pub type StateMap = FastHashMap<HgPathBuf, DirstateEntry>; | ||
Raphaël Gomès
|
r46185 | #[cfg(not(feature = "dirstate-tree"))] | ||
Raphaël Gomès
|
r43227 | pub type StateMapIter<'a> = hash_map::Iter<'a, HgPathBuf, DirstateEntry>; | ||
Raphaël Gomès
|
r46185 | |||
#[cfg(feature = "dirstate-tree")] | ||||
pub type StateMap = dirstate_tree::tree::Tree; | ||||
#[cfg(feature = "dirstate-tree")] | ||||
pub type StateMapIter<'a> = dirstate_tree::iter::Iter<'a>; | ||||
Raphaël Gomès
|
r44278 | pub type CopyMap = FastHashMap<HgPathBuf, HgPathBuf>; | ||
Raphaël Gomès
|
r43227 | pub type CopyMapIter<'a> = hash_map::Iter<'a, HgPathBuf, HgPathBuf>; | ||
Raphaël Gomès
|
r42828 | |||
Raphaël Gomès
|
r42994 | #[derive(Copy, Clone, Debug, Eq, PartialEq)] | ||
pub enum EntryState { | ||||
Normal, | ||||
Added, | ||||
Removed, | ||||
Merged, | ||||
Unknown, | ||||
} | ||||
impl TryFrom<u8> for EntryState { | ||||
type Error = DirstateParseError; | ||||
fn try_from(value: u8) -> Result<Self, Self::Error> { | ||||
match value { | ||||
b'n' => Ok(EntryState::Normal), | ||||
b'a' => Ok(EntryState::Added), | ||||
b'r' => Ok(EntryState::Removed), | ||||
b'm' => Ok(EntryState::Merged), | ||||
b'?' => Ok(EntryState::Unknown), | ||||
_ => Err(DirstateParseError::CorruptedEntry(format!( | ||||
"Incorrect entry state {}", | ||||
value | ||||
))), | ||||
} | ||||
} | ||||
} | ||||
impl Into<u8> for EntryState { | ||||
fn into(self) -> u8 { | ||||
match self { | ||||
EntryState::Normal => b'n', | ||||
EntryState::Added => b'a', | ||||
EntryState::Removed => b'r', | ||||
EntryState::Merged => b'm', | ||||
EntryState::Unknown => b'?', | ||||
} | ||||
} | ||||
} | ||||