Struct PerCoreWalEntry 

pub struct PerCoreWalEntry {
    pub epoch: u64,
    pub sequence: u64,
    pub core_id: u16,
    pub timestamp_ns: i64,
    pub operation: WalOperation,
}

Per-core WAL entry with epoch for cross-core ordering.

Entries are ordered by (epoch, timestamp_ns) for deterministic recovery. The 32-byte compact layout is designed for cache efficiency.

Fields

epoch: u64

Global epoch (for ordering during recovery).

sequence: u64

Core-local sequence number (monotonically increasing per core).

core_id: u16

Core ID that wrote this entry.

timestamp_ns: i64

Timestamp in nanoseconds since Unix epoch.

operation: WalOperation

The actual operation.

Implementations

impl PerCoreWalEntry

pub fn put( core_id: u16, epoch: u64, sequence: u64, key: Vec<u8>, value: Vec<u8>, timestamp_ns: i64, ) -> Self

Creates a new Put entry.

Arguments

• timestamp_ns - Pre-cached timestamp from now_ns()

pub fn delete( core_id: u16, epoch: u64, sequence: u64, key: Vec<u8>, timestamp_ns: i64, ) -> Self

Creates a new Delete entry.

Arguments

• timestamp_ns - Pre-cached timestamp from now_ns()

pub fn checkpoint( core_id: u16, epoch: u64, sequence: u64, checkpoint_id: u64, timestamp_ns: i64, ) -> Self

Creates a new Checkpoint entry.

Arguments

• timestamp_ns - Pre-cached timestamp from now_ns()

pub fn commit( core_id: u16, epoch: u64, sequence: u64, offsets: HashMap<String, u64>, watermark: Option<i64>, timestamp_ns: i64, ) -> Self

Creates a new Commit entry.

Arguments

• timestamp_ns - Pre-cached timestamp from now_ns()

pub fn epoch_barrier( core_id: u16, epoch: u64, sequence: u64, timestamp_ns: i64, ) -> Self

Creates a new EpochBarrier entry.

Arguments

• timestamp_ns - Pre-cached timestamp from now_ns()

pub fn is_put(&self) -> bool

Returns true if this is a Put operation.

pub fn is_delete(&self) -> bool

Returns true if this is a Delete operation.

pub fn is_checkpoint(&self) -> bool

Returns true if this is a Checkpoint operation.

pub fn is_state_operation(&self) -> bool

Returns true if this is a state-modifying operation (Put or Delete).

pub fn key(&self) -> Option<&[u8]>

Gets the key if this is a Put or Delete operation.

pub fn value(&self) -> Option<&[u8]>

Gets the value if this is a Put operation.

pub fn now_ns() -> i64

Returns current timestamp in nanoseconds.

Call once and pass the result to entry constructors to avoid repeated SystemTime::now() syscalls in tight loops.

Trait Implementations

impl Archive for PerCoreWalEntry

where u64: Archive, u16: Archive, i64: Archive, WalOperation: Archive,

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.

type Archived = ArchivedPerCoreWalEntry

The archived representation of this type.

type Resolver = PerCoreWalEntryResolver

The resolver for this type. It must contain all the additional information from serializing needed to make the archived type from the normal type.

fn resolve(&self, resolver: Self::Resolver, out: Place<Self::Archived>)

Creates the archived version of this value at the given position and writes it to the given output.

impl Clone for PerCoreWalEntry

fn clone(&self) -> PerCoreWalEntry

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for PerCoreWalEntry

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<__D: Fallible + ?Sized> Deserialize<PerCoreWalEntry, __D> for Archived<PerCoreWalEntry>

where u64: Archive, <u64 as Archive>::Archived: Deserialize<u64, __D>, u16: Archive, <u16 as Archive>::Archived: Deserialize<u16, __D>, i64: Archive, <i64 as Archive>::Archived: Deserialize<i64, __D>, WalOperation: Archive, <WalOperation as Archive>::Archived: Deserialize<WalOperation, __D>,

fn deserialize( &self, deserializer: &mut __D, ) -> Result<PerCoreWalEntry, <__D as Fallible>::Error>

Deserializes using the given deserializer

impl Ord for PerCoreWalEntry

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for PerCoreWalEntry

fn eq(&self, other: &PerCoreWalEntry) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd for PerCoreWalEntry

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<__S: Fallible + ?Sized> Serialize<__S> for PerCoreWalEntry

where u64: Serialize<__S>, u16: Serialize<__S>, i64: Serialize<__S>, WalOperation: Serialize<__S>,

fn serialize( &self, serializer: &mut __S, ) -> Result<<Self as Archive>::Resolver, <__S as Fallible>::Error>

Writes the dependencies for the object and returns a resolver that can create the archived type.

impl Eq for PerCoreWalEntry

impl StructuralPartialEq for PerCoreWalEntry