Struct PagingCoordinator

Source

pub struct PagingCoordinator { /* private fields */ }

Expand description

Paging coordinator for managing graph tiles

Splits large graphs into tiles and manages their lifecycle in GPU memory.

Implementations§

Source §

impl PagingCoordinator

Source

pub fn new(device: &GpuDevice, graph: &CsrGraph) -> Result<Self>

Create paging coordinator for a graph

§Errors

Returns error if memory limits cannot be detected

Source

pub fn get_tile_for_node(&self, node: NodeId) -> Option<&GraphTile>

Get tile containing a specific node

Source

pub fn get_tile(&self, tile_id: usize) -> Option<&GraphTile>

Get tile by ID

Source

pub fn num_tiles(&self) -> usize

Get total number of tiles

Source

pub fn fits_in_vram(&self) -> bool

Check if graph fits entirely in VRAM (no paging needed)

Source

pub fn tile_size(&self) -> usize

Get tile size in nodes

Source

pub const fn limits(&self) -> &GpuMemoryLimits

Get memory limits

Source

pub fn tiles(&self) -> impl Iterator<Item = &GraphTile>

Get iterator over all tiles

Auto Trait Implementations§

§

impl UnwindSafe for PagingCoordinator

Blanket Implementations§

Source §

impl<T> Allocation for T
where T: RefUnwindSafe + Send + Sync,

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<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

Source §

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

Source §

impl<T> Downcast<T> for T

Source §

fn downcast(&self) -> &T

Source §

impl<T> From<T> for T

Source §

fn from(t: T) -> T

Returns the argument unchanged.

Source §

impl<T, U> Into 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 §