Skip to main content

RaftIndexNode

Struct RaftIndexNode 

Source
pub struct RaftIndexNode { /* private fields */ }
Expand description

Raft node implementation for distributed vector index

This implements the core Raft protocol. In a production deployment, RPCs would be sent over the network (e.g., gRPC or HTTP/2). Here we provide the state machine logic and expose methods for injecting simulated or actual network messages.

Implementations§

Source§

impl RaftIndexNode

Source

pub fn new(config: RaftConfig) -> Self

Create a new Raft index node

Source

pub fn start_election(&self) -> RequestVoteRequest

Start an election (become candidate)

Source

pub fn handle_request_vote( &self, request: RequestVoteRequest, ) -> RequestVoteResponse

Handle a RequestVote RPC from a candidate

Source

pub fn process_vote_response(&self, response: RequestVoteResponse) -> bool

Process a vote response from a peer

Returns true if this node just won the election.

Source

pub fn handle_append_entries( &self, request: AppendEntriesRequest, ) -> AppendEntriesResponse

Handle AppendEntries RPC (from leader)

Source

pub fn process_append_entries_response( &self, peer_id: NodeId, response: AppendEntriesResponse, entries_sent_count: usize, )

Process AppendEntries response from a follower (leader only)

Source

pub fn propose( &self, command: IndexCommand, client_id: Option<String>, ) -> Result<LogIndex>

Propose a new command (leader only)

Returns the log index of the proposed entry, or an error if not leader.

Source

pub fn create_append_entries_request( &self, peer_id: NodeId, ) -> Result<AppendEntriesRequest>

Create an AppendEntries request for a specific follower

Source

pub fn force_commit_single_node(&self)

Force commit a single-node cluster (for testing)

In a single-node cluster, entries are immediately committed.

Source

pub fn role(&self) -> NodeRole

Get the current role

Source

pub fn current_term(&self) -> Term

Get the current term

Source

pub fn current_leader(&self) -> Option<NodeId>

Get the current leader ID (if known)

Source

pub fn is_leader(&self) -> bool

Check if this node is the leader

Source

pub fn log_length(&self) -> usize

Get the number of entries in the log

Source

pub fn commit_index(&self) -> LogIndex

Get the commit index

Source

pub fn last_applied(&self) -> LogIndex

Get the last applied index

Source

pub fn vector_count(&self) -> usize

Get the number of vectors in the state machine

Source

pub fn get_vector(&self, vector_id: &str) -> Option<VectorEntry>

Get a vector from the state machine (read only)

Source

pub fn search_similar(&self, query: &[f32], k: usize) -> Vec<(String, f32)>

Search for similar vectors in the state machine

Source

pub fn get_stats(&self) -> RaftStats

Get current statistics

Source

pub fn election_timeout_elapsed(&self) -> bool

Check if election timeout has elapsed

Source

pub fn reset_heartbeat(&self)

Reset the heartbeat timer (call when receiving valid messages from leader)

Trait Implementations§

Source§

impl Debug for RaftIndexNode

Source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

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> 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> 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> 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> PolicyExt for T
where T: ?Sized,

Source§

fn and<P, B, E>(self, other: P) -> And<T, P>
where T: Policy<B, E>, P: Policy<B, E>,

Create a new Policy that returns Action::Follow only if self and other return Action::Follow. Read more
Source§

fn or<P, B, E>(self, other: P) -> Or<T, P>
where T: Policy<B, E>, P: Policy<B, E>,

Create a new Policy that returns Action::Follow if either self or other returns Action::Follow. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
Source§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
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
Source§

impl<T> ErasedDestructor for T
where T: 'static,

Source§

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