Struct CacheKey 

pub struct CacheKey {
    pub goal_hash: u64,
    pub kb_id: String,
    pub kb_version: u64,
}

Composite key for a single cached inference result.

Two keys are equal iff goal_hash, kb_id, and kb_version all match. This means the same goal cached against version 1 and version 2 of the same KB are stored as completely independent entries.

Fields

goal_hash: u64

FNV-1a hash of the goal string.

kb_id: String

Identifier of the knowledge base that was queried.

kb_version: u64

Version of the knowledge base at the time of inference.

Implementations

impl CacheKey

pub fn new(goal: &str, kb_id: &str, kb_version: u64) -> Self

Construct a new CacheKey, hashing goal with FNV-1a.

Trait Implementations

impl Clone for CacheKey

fn clone(&self) -> CacheKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CacheKey

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

Formats the value using the given formatter.

impl Eq for CacheKey

impl Hash for CacheKey

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for CacheKey

fn eq(&self, other: &CacheKey) -> 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 StructuralPartialEq for CacheKey