pub enum NodeHistoryTransitionKind {
LinkClick,
UrlTyped,
Back,
Forward,
Reload,
Redirect,
TabSpawn,
Restore,
Imported,
Unknown,
}Expand description
How an owner moved to a visit: navigation vocabulary.
Generalizing this is the module doc’s declared open decision. Two findings from 2026-07-26, weighing woodshed’s practice history against this crate:
- If it is generalized, make it a type parameter, the first option the
module doc lists — not an open
Open { kind: String }tail. A parameter keepsCopy,Hash, and the rkyv derives per instantiation, whichAggregatedEntryEdgeView’sHashMap<TransitionKind, u64>key and thevisit.inbound.map(|r| r.kind)reads all rely on; aStringvariant costs every one of them. Mere’s consumers would instantiate the browser vocabulary and read exactly as they do now. - An app’s engagement kinds are not a reason to do it. These variants
answer “how did you get here”, and
eidetic-coremaps them one-to-one onto a browsingTraceTransition. Woodshed’s previewed / staged / rehearsed / completed answer “what did you do with it”, which is a different question — and the slot for it already exists: the generic per-visitcontext: XonVisitRecord, typed, aggregated overStemma::edge_viewswhen the built-in per-kind counts do not fit. So that consumer pull does not reach this enum.
Variants§
Trait Implementations§
Source§impl Archive for TransitionKind
impl Archive for TransitionKind
Source§type Archived = ArchivedTransitionKind
type Archived = ArchivedTransitionKind
The archived representation of this type. Read more
Source§type Resolver = TransitionKindResolver
type Resolver = TransitionKindResolver
The resolver for this type. It must contain all the additional
information from serializing needed to make the archived type from
the normal type.
Source§fn resolve(
&self,
resolver: <TransitionKind as Archive>::Resolver,
out: Place<<TransitionKind as Archive>::Archived>,
)
fn resolve( &self, resolver: <TransitionKind as Archive>::Resolver, out: Place<<TransitionKind as Archive>::Archived>, )
Creates the archived version of this value at the given position and
writes it to the given output. Read more
Source§const COPY_OPTIMIZATION: CopyOptimization<Self> = _
const COPY_OPTIMIZATION: CopyOptimization<Self> = _
An optimization flag that allows the bytes of this type to be copied
directly to a writer instead of calling
serialize. Read moreSource§impl Clone for TransitionKind
impl Clone for TransitionKind
Source§fn clone(&self) -> TransitionKind
fn clone(&self) -> TransitionKind
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreimpl Copy for TransitionKind
Source§impl Debug for TransitionKind
impl Debug for TransitionKind
Source§impl<'de> Deserialize<'de> for TransitionKind
impl<'de> Deserialize<'de> for TransitionKind
Source§fn deserialize<__D>(
__deserializer: __D,
) -> Result<TransitionKind, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(
__deserializer: __D,
) -> Result<TransitionKind, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Source§impl<__D> Deserialize<TransitionKind, __D> for <TransitionKind as Archive>::Archived
impl<__D> Deserialize<TransitionKind, __D> for <TransitionKind as Archive>::Archived
Source§fn deserialize(
&self,
deserializer: &mut __D,
) -> Result<TransitionKind, <__D as Fallible>::Error>
fn deserialize( &self, deserializer: &mut __D, ) -> Result<TransitionKind, <__D as Fallible>::Error>
Deserializes using the given deserializer
impl Eq for TransitionKind
Source§impl Hash for TransitionKind
impl Hash for TransitionKind
Source§impl PartialEq for TransitionKind
impl PartialEq for TransitionKind
Source§impl Serialize for TransitionKind
impl Serialize for TransitionKind
Source§fn serialize<__S>(
&self,
__serializer: __S,
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
fn serialize<__S>(
&self,
__serializer: __S,
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
Serialize this value into the given Serde serializer. Read more
Source§impl<__S> Serialize<__S> for TransitionKind
impl<__S> Serialize<__S> for TransitionKind
impl StructuralPartialEq for TransitionKind
Auto Trait Implementations§
impl Freeze for TransitionKind
impl RefUnwindSafe for TransitionKind
impl Send for TransitionKind
impl Sync for TransitionKind
impl Unpin for TransitionKind
impl UnsafeUnpin for TransitionKind
impl UnwindSafe for TransitionKind
Blanket Implementations§
Source§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
Source§type ArchivedMetadata = ()
type ArchivedMetadata = ()
The archived version of the pointer metadata for this type.
Source§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
Converts some archived metadata to the pointer metadata for itself.
Source§impl<T> ArchiveUnsized for Twhere
T: Archive,
impl<T> ArchiveUnsized for Twhere
T: Archive,
Source§type Archived = <T as Archive>::Archived
type Archived = <T as Archive>::Archived
The archived counterpart of this type. Unlike
Archive, it may be
unsized. Read moreSource§fn archived_metadata(
&self,
) -> <<T as ArchiveUnsized>::Archived as ArchivePointee>::ArchivedMetadata
fn archived_metadata( &self, ) -> <<T as ArchiveUnsized>::Archived as ArchivePointee>::ArchivedMetadata
Creates the archived version of the metadata for this value.
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
Mutably borrows from an owned value. Read more
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<T> EntryIdentityKey for T
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<T> LayoutRaw for T
impl<T> LayoutRaw for T
Source§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
Returns the layout of the type.
impl<T> MemoryPayload for T
Source§impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
Source§unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
Returns whether the given value has been niched. Read more
Source§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
Writes data to
out indicating that a T is niched.