DualRing

Struct DualRing 

Source
pub struct DualRing<T> { /* private fields */ }
Expand description

Dual Ring Structure for IRCP/RCP

Represents the same episodes in two different orderings:

  • Temporal Ring (RCP): Ordered by causal/temporal flow
  • Influence Ring (IRCP): Ordered by influence/attention weight

This enables efficient traversal in both directions:

  • Forward (RCP): “What context led to this response?”
  • Inverse (IRCP): “What did this response influence?”

§Example

use rag_plusplus_core::trajectory::{DualRing, DualRingNode};

// Create nodes with temporal order and influence weights
let nodes = vec![
    DualRingNode::new(0, "episode_a", 0.8),  // temporal_idx=0, influence=0.8
    DualRingNode::new(1, "episode_b", 0.3),  // temporal_idx=1, influence=0.3
    DualRingNode::new(2, "episode_c", 0.9),  // temporal_idx=2, influence=0.9
    DualRingNode::new(3, "episode_d", 0.5),  // temporal_idx=3, influence=0.5
];

let dual = DualRing::new(nodes);

// Traverse temporally (RCP direction)
let temporal_order: Vec<_> = dual.iter_temporal().map(|n| n.value).collect();
// ["episode_a", "episode_b", "episode_c", "episode_d"]

// Traverse by influence (IRCP direction)
let influence_order: Vec<_> = dual.iter_by_influence().map(|n| n.value).collect();
// ["episode_c", "episode_a", "episode_d", "episode_b"] (by descending influence)

Implementations§

Source§

impl<T> DualRing<T>

Source

pub fn new(nodes: Vec<DualRingNode<T>>) -> Self

Create a dual ring from nodes.

Nodes should be provided in temporal order.

Source

pub fn len(&self) -> usize

Number of nodes.

Source

pub fn is_empty(&self) -> bool

Check if empty.

Source

pub fn get_temporal(&self, idx: usize) -> &DualRingNode<T>

Get node by temporal index (wrapping).

Source

pub fn temporal_next(&self, idx: usize) -> usize

Next in temporal order.

Source

pub fn temporal_prev(&self, idx: usize) -> usize

Previous in temporal order.

Source

pub fn temporal_distance(&self, a: usize, b: usize) -> usize

Temporal ring distance.

Source

pub fn iter_temporal(&self) -> impl Iterator<Item = &DualRingNode<T>>

Iterate in temporal order (RCP direction).

Source

pub fn iter_temporal_from( &self, start: usize, ) -> impl Iterator<Item = &DualRingNode<T>>

Iterate temporally from a starting point.

Source

pub fn temporal_neighbors( &self, idx: usize, radius: usize, ) -> impl Iterator<Item = &DualRingNode<T>>

Get temporal neighbors within radius.

Source

pub fn get_by_influence_rank(&self, rank: usize) -> &DualRingNode<T>

Get node by influence rank (0 = highest influence).

Source

pub fn influence_rank_of(&self, temporal_idx: usize) -> usize

Get influence rank of a temporal index.

Source

pub fn iter_by_influence(&self) -> impl Iterator<Item = &DualRingNode<T>>

Iterate by influence (IRCP direction, highest first).

Source

pub fn top_influential( &self, k: usize, ) -> impl Iterator<Item = &DualRingNode<T>>

Get top-k most influential nodes.

Source

pub fn influence_distance(&self, a_temporal: usize, b_temporal: usize) -> usize

Influence ring distance (distance in influence-sorted order).

Source

pub fn influence_neighbors( &self, temporal_idx: usize, radius: usize, ) -> impl Iterator<Item = &DualRingNode<T>>

Get influence neighbors (nodes with similar influence).

Source

pub fn influence_temporal_spread(&self) -> f32

Find the temporal distance from high-influence to low-influence nodes.

This measures how “spread out” influence is temporally. Low values mean influence clusters in time; high values mean it’s distributed.

Source

pub fn forward_attention_flow(&self) -> f32

Compute attention flow from earlier to later nodes (RCP forward flow).

Returns total influence flowing from past to future.

Source

pub fn inverse_attention_flow(&self) -> f32

Compute attention flow from later to earlier nodes (IRCP inverse flow).

Returns total influence flowing from future to past (attribution).

Source

pub fn update_influence(&mut self, temporal_idx: usize, new_influence: f32)

Update influence weight for a node.

Source

pub fn as_slice(&self) -> &[DualRingNode<T>]

Get underlying nodes.

Trait Implementations§

Source§

impl<T: Clone> Clone for DualRing<T>

Source§

fn clone(&self) -> DualRing<T>

Returns a duplicate of the value. Read more
1.0.0 · Source§

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

Performs copy-assignment from source. Read more
Source§

impl<T: Debug> Debug for DualRing<T>

Source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<T> Freeze for DualRing<T>

§

impl<T> RefUnwindSafe for DualRing<T>
where T: RefUnwindSafe,

§

impl<T> Send for DualRing<T>
where T: Send,

§

impl<T> Sync for DualRing<T>
where T: Sync,

§

impl<T> Unpin for DualRing<T>
where T: Unpin,

§

impl<T> UnwindSafe for DualRing<T>
where T: UnwindSafe,

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> ArchivePointee for T

Source§

type ArchivedMetadata = ()

The archived version of the pointer metadata for this type.
Source§

fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata

Converts some archived metadata to the pointer metadata for itself.
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<F, W, T, D> Deserialize<With<T, W>, D> for F
where W: DeserializeWith<F, T, D>, D: Fallible + ?Sized, F: ?Sized,

Source§

fn deserialize( &self, deserializer: &mut D, ) -> Result<With<T, W>, <D as Fallible>::Error>

Deserializes using the given deserializer
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T> Instrument for T

Source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
Source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T> LayoutRaw for T

Source§

fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>

Gets the layout of the type.
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Pointee for T

Source§

type Metadata = ()

The type for metadata in pointers and references to Self.
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V

Source§

impl<T> WithSubscriber for T

Source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more