pub struct DiskState {
pub last_update: BTreeMap<String, Timestamp>,
pub once: BTreeMap<String, Timestamp>,
pub hashes: BTreeMap<String, Hashed>,
}
Expand description
The way the state is serialized.
Fields§
§last_update: BTreeMap<String, Timestamp>
Last time git was updated.
once: BTreeMap<String, Timestamp>
Things that should only happen once.
hashes: BTreeMap<String, Hashed>
Implementations§
Trait Implementations§
source§impl<'de> Deserialize<'de> for DiskState
impl<'de> Deserialize<'de> for DiskState
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl PartialEq<DiskState> for DiskState
impl PartialEq<DiskState> for DiskState
impl Eq for DiskState
impl StructuralEq for DiskState
impl StructuralPartialEq for DiskState
Auto Trait Implementations§
impl RefUnwindSafe for DiskState
impl Send for DiskState
impl Sync for DiskState
impl Unpin for DiskState
impl UnwindSafe for DiskState
Blanket Implementations§
source§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.