Package net.storm.api.rs

Interface IterableNodeDeque

All Superinterfaces:

Collection<net.runelite.api.Node>, Iterable<net.runelite.api.Node>

public interface IterableNodeDeque
extends Iterable<net.runelite.api.Node>, Collection<net.runelite.api.Node>

Represents an iterable double-ended queue (deque) of nodes.

This data structure is used throughout the game client to store collections of linked nodes. It combines the functionality of both Iterable and Collection interfaces, allowing for iteration and standard collection operations.

Common uses include storing health bars for actors and other linked data structures within the game engine.

See Also:

• Node
• HealthBar

Method Summary

Modifier and Type	Method	Description
net.runelite.api.Node	getCurrent()	Gets the current node in the deque.
net.runelite.api.Node	getLast()	Gets the last node in the deque.

Methods inherited from interface java.util.Collection

add, addAll, clear, contains, containsAll, equals, hashCode, isEmpty, iterator, parallelStream, remove, removeAll, removeIf, retainAll, size, spliterator, stream, toArray, toArray, toArray

Methods inherited from interface java.lang.Iterable

forEach

Method Details

getCurrent

net.runelite.api.Node getCurrent()

Gets the current node in the deque.

This returns the node at the current position within the deque's internal iteration state. The meaning of "current" depends on the implementation and the state of any ongoing iteration.

Returns:

the current Node in the deque, or null if the deque is empty

getLast

net.runelite.api.Node getLast()

Gets the last node in the deque.

Returns the node at the tail end of the deque. This is the most recently added node if the deque operates in FIFO order.

Returns:

the last Node in the deque, or null if the deque is empty