pub struct InduceExactNaryRequest<'a> {
pub head_rel_idx: RelId,
pub candidates: &'a [(RelId, &'a CudaBuffer)],
pub positives: &'a CudaBuffer,
pub negatives: Option<&'a CudaBuffer>,
pub config: NaryInductionConfig,
}Expand description
Inputs to one induce_exact_nary call.
Each candidate is a (RelId, &CudaBuffer) pair exactly as in the binary
engine: the RelId is a label that flows through to the scored output,
and the buffer carries the relation’s facts as all-U64 columns. The
head arity is the arity of positives; negatives, when present, must
match it. Name resolution and relation-store lookup happen at the
pyxlog boundary — the engine only sees indices + handles.
Fields§
§head_rel_idx: RelId§candidates: &'a [(RelId, &'a CudaBuffer)]§positives: &'a CudaBuffer§negatives: Option<&'a CudaBuffer>§config: NaryInductionConfigAuto Trait Implementations§
impl<'a> Freeze for InduceExactNaryRequest<'a>
impl<'a> RefUnwindSafe for InduceExactNaryRequest<'a>
impl<'a> Send for InduceExactNaryRequest<'a>
impl<'a> Sync for InduceExactNaryRequest<'a>
impl<'a> Unpin for InduceExactNaryRequest<'a>
impl<'a> UnsafeUnpin for InduceExactNaryRequest<'a>
impl<'a> UnwindSafe for InduceExactNaryRequest<'a>
Blanket Implementations§
impl<T> Allocation for T
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more