Struct TickList 

pub struct TickList<T: TickKey> {
    pending_ticks: Option<Vec<SavedTick<T>>>,
    ticks: BinaryHeap<QueuedTick<T>>,
    scheduled: FxHashSet<ScheduledTickKey>,
    next_insertion_order: u64,
}

Per-chunk storage for scheduled ticks of one type (block or fluid).

Saved and proto-chunk entries remain in pending_ticks until the chunk first reaches block-ticking readiness. Live entries use absolute game-time deadlines. A priority queue keeps live work ordered without scanning every tick.

Fields

pending_ticks: Option<Vec<SavedTick<T>>>

ticks: BinaryHeap<QueuedTick<T>>

scheduled: FxHashSet<ScheduledTickKey>

next_insertion_order: u64

Implementations

impl<T: TickKey> TickList<T>

pub fn new() -> Self

Creates an empty tick list.

pub(crate) fn new_pending() -> Self

Creates an empty proto-chunk list whose entries remain relative until the promoted Full chunk first becomes block-ticking.

pub(crate) fn from_saved_ticks(saved_ticks: Vec<SavedTick<T>>) -> Self

Creates a tick list from relative-delay ticks loaded from chunk storage.

Vanilla assigns loaded entries the range -len..-1 in saved list order, ensuring they execute before newly scheduled entries with equal timing once the list is unpacked.

pub(crate) fn from_proto_saved_ticks(saved_ticks: Vec<SavedTick<T>>) -> Self

Creates a proto-chunk tick list from relative-delay storage entries.

ProtoChunkTicks.load schedules saved entries individually, so duplicate (pos, type) keys are discarded while preserving the first entry. Full chunk loading intentionally uses Self::from_saved_ticks instead because LevelChunkTicks retains its saved list exactly as stored.

pub(crate) fn schedule( &mut self, tick_type: T, pos: BlockPos, trigger_tick: i64, priority: TickPriority, sub_tick_order: i64, ) -> bool

Schedules a live tick with an absolute world game-time deadline.

Returns true if the tick was added, or false when the same (pos, type) is already scheduled.

pub(crate) fn schedule_pending( &mut self, tick_type: T, pos: BlockPos, priority: TickPriority, ) -> bool

Stores a proto-chunk tick with Vanilla’s fixed zero delay.

fn schedule_saved_pending(&mut self, saved_tick: SavedTick<T>) -> bool

pub(crate) fn has_tick(&self, pos: BlockPos, tick_type: T) -> bool

Returns true if a tick is scheduled for the given (pos, type).

pub(crate) fn pending_entries(&self) -> &[SavedTick<T>]

Returns the saved entries that have not yet been anchored to game time.

pub(crate) fn remove_pending_matching( &mut self, predicate: impl FnMut(&SavedTick<T>) -> bool, ) -> usize

Removes pending entries matching predicate while keeping deduplication in sync.

pub(super) fn packing_snapshot(&self) -> TickListPackingSnapshot<T>

pub(crate) fn unpack(&mut self, current_tick: i64)

Converts pending saved/proto ticks into live absolute-time ordering.

This mirrors LevelChunkTicks.unpack: delays are anchored to current_tick and entries receive negative sub-tick orders in saved-list order. Repeated calls are no-ops, so later readiness changes cannot re-anchor deadlines.

pub(crate) fn len(&self) -> usize

Returns the number of scheduled ticks.

fn push_unchecked(&mut self, tick: ScheduledTick<T>)

pub(super) fn peek(&self) -> Option<ScheduledTick<T>>

pub(super) fn peek_ready(&self, current_tick: i64) -> Option<ScheduledTick<T>>

pub(super) fn pop_ready( &mut self, current_tick: i64, ) -> Option<ScheduledTick<T>>

Trait Implementations

impl<T: Debug + TickKey> Debug for TickList<T>

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

Formats the value using the given formatter.

impl<T: TickKey> Default for TickList<T>

fn default() -> Self

Returns the “default value” for a type.