tiny.preserves.SemanticOps

1/// One table of equality, hash and order functions over untyped payload pointers. Code that embeds2/// its own objects fills one table per object kind, so equality, order and hash agree. Two embedded3/// values use the table only when both point to the same table. The table's order must be total,4/// its equality must hold exactly when the order returns `.eq`, and equal payloads must hash5/// equally. Tables are compared by address, so one table serves every payload of one kind.6pub const SemanticOps = struct {7    /// Returns whether two payloads are equal. The function must return `true` exactly when `order`8    /// returns `.eq`.9    eql: *const fn (*anyopaque, *anyopaque) bool,10    /// Returns the 64-bit hash of one payload. Equal payloads must hash equally.11    hash: *const fn (*anyopaque) u64,12    /// Returns the order of one payload against another. The order must be total.13    order: *const fn (*anyopaque, *anyopaque) std.math.Order,14};

1pub const SemanticOps = embedded_mod.SemanticOps;