Struct RemainingAccounts 

pub struct RemainingAccounts<'a> { /* private fields */ }

Zero-allocation remaining-accounts view.

Construct via RemainingAccounts::strict or RemainingAccounts::passthrough from the declared slice and the full accounts slice. #[hopper::context] emits ctx.remaining_accounts() and ctx.remaining_accounts_passthrough() accessors that wire these up for you.

Implementations

impl<'a> RemainingAccounts<'a>

pub fn strict( declared: &'a [AccountView<'a>], remaining: &'a [AccountView<'a>], ) -> Self

Build a strict accessor. Iteration rejects duplicates.

pub fn passthrough( declared: &'a [AccountView<'a>], remaining: &'a [AccountView<'a>], ) -> Self

Build a passthrough accessor. Iteration preserves duplicates.

pub fn len(&self) -> usize

Length of the remaining slice, irrespective of mode.

pub fn is_empty(&self) -> bool

True when there are no remaining accounts.

pub fn mode(&self) -> RemainingMode

The active duplicate-handling policy for this view.

pub fn as_slice(&self) -> &'a [AccountView<'a>]

The raw remaining-account slice backing this view.

pub fn get( &self, index: usize, ) -> Result<Option<&'a AccountView<'a>>, ProgramError>

Random access by index. Passthrough returns the slot as is; strict returns an error when the resolved slot aliases a previously-seen account (declared or yielded before index).

pub fn account_views<const N: usize>( &self, ) -> Result<RemainingAccountViews<'a, N>, ProgramError>

Validate the remaining tail as at most N account views.

In strict mode this also rejects aliases to declared accounts and duplicate remaining slots before returning the typed set.

pub fn signers<const N: usize>( &self, ) -> Result<RemainingSigners<'a, N>, ProgramError>

Validate the remaining tail as at most N signer accounts.

This is the common multisig case: the handler gets a bounded, duplicate-safe signer set instead of raw account iteration.

pub fn iter(&self) -> RemainingIter<'a>

Sequential iterator. Yields each account in declaration order, errors on duplicates in strict mode, preserves them in passthrough mode.

pub fn typed(&self) -> RemainingTyped<'a>

Sequential typed parser over the remaining-account tail.

This preserves the current duplicate policy while letting handlers bind each slot as a signer, raw account, or known external account in the order protocol instructions naturally expect.

pub fn lazy(&self) -> RemainingLazy<'a>

Random-access lazy parser over the remaining-account tail.

This is useful when an instruction receives many optional accounts but validates only the branch it actually touches. The selected slot still inherits this view’s duplicate policy.