Struct InProgressSet 

pub struct InProgressSet { /* private fields */ }

Compact in-progress set. Stored as a sorted Vec<u64> so the contains check is a binary search — O(log n) and zero allocation per lookup. We expect n to be tens at most (the active transaction count); for that range bsearch beats a hashset by a wide margin on both wall-clock and cache.

When n blows past ~1k (which would mean a runaway leak — every real OLTP workload caps at a few dozen concurrent writers) we would consider a roaring-bitmap-style sparse representation; not needed at v7.37.15.0 scale.

Implementations

impl InProgressSet

pub fn from_sorted(sorted: Vec<u64>) -> InProgressSet

Construct from a pre-sorted slice. The caller must verify monotonic order; debug builds assert.

pub const fn empty() -> InProgressSet

Empty set — no transactions in flight. The default for a snapshot taken in a quiescent moment.

pub fn ids(&self) -> &[u64]

v7.39 (round 518) — the ids, in order. txid_current_snapshot() renders them as PG’s xip_list.

pub fn contains(&self, xid: u64) -> bool

True iff xid is one of the in-flight transactions. Binary search; O(log n).

pub fn len(&self) -> usize

Number of in-flight transactions captured.

pub fn is_empty(&self) -> bool

True iff no transactions were in flight at capture time.

Trait Implementations

impl Clone for InProgressSet

fn clone(&self) -> InProgressSet

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for InProgressSet

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

Formats the value using the given formatter.

impl Default for InProgressSet

fn default() -> InProgressSet

Returns the “default value” for a type.

impl Eq for InProgressSet

impl PartialEq for InProgressSet

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for InProgressSet