pub struct CachedTier {
pub layer: Option<Entry<LayerSummary>>,
pub workflows: Option<Entry<WorkflowCatalogue>>,
pub toolchains: Option<Entry<Vec<ToolchainState>>>,
pub rules: Option<Entry<RulesTally>>,
pub ledger_trees: Option<Entry<BTreeMap<String, bool>>>,
pub last_rendered_digest: Option<String>,
}Expand description
What a fast resolution takes from an earlier full one.
Fields§
§layer: Option<Entry<LayerSummary>>What the layer holds; expires when the layer changes.
workflows: Option<Entry<WorkflowCatalogue>>The workflows; expires when the workflow files change.
toolchains: Option<Entry<Vec<ToolchainState>>>The installed toolchain versions; expires with the markers, and with time.
rules: Option<Entry<RulesTally>>The rule tally a full preflight counted, for the entry path, which never builds the index. It carries the commit and tree it was counted at and the preflight judges it stale against any other, so it needs no fingerprint of its own.
ledger_trees: Option<Entry<BTreeMap<String, bool>>>For each commit the evidence ledger records a run at, whether the tree in front of
you is that commit’s tree (the ledger’s own row excluded). Each answer costs git two
processes, and entry would pay them on every cd; the fingerprint covers HEAD, every
path git reports changed and the ledger file itself, so any of those moving recomputes.
last_rendered_digest: Option<String>The digest of the last snapshot rendered to a person, so that a banner in auto
mode can tell a first look from a re-entry. Not a record of anything a person did:
one digest, overwritten, naming nothing about the session that saw it.
Trait Implementations§
Source§impl Clone for CachedTier
impl Clone for CachedTier
Source§fn clone(&self) -> CachedTier
fn clone(&self) -> CachedTier
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreSource§impl Debug for CachedTier
impl Debug for CachedTier
Source§impl Default for CachedTier
impl Default for CachedTier
Source§fn default() -> CachedTier
fn default() -> CachedTier
Source§impl<'de> Deserialize<'de> for CachedTier
impl<'de> Deserialize<'de> for CachedTier
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>,
impl Eq for CachedTier
Source§impl PartialEq for CachedTier
impl PartialEq for CachedTier
Source§fn eq(&self, other: &CachedTier) -> bool
fn eq(&self, other: &CachedTier) -> bool
self and other values to be equal, and is used by ==.Source§impl Serialize for CachedTier
impl Serialize for CachedTier
impl StructuralPartialEq for CachedTier
Auto Trait Implementations§
impl Freeze for CachedTier
impl RefUnwindSafe for CachedTier
impl Send for CachedTier
impl Sync for CachedTier
impl Unpin for CachedTier
impl UnsafeUnpin for CachedTier
impl UnwindSafe for CachedTier
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.