Struct EdgeList 

pub struct EdgeList { /* private fields */ }

The edge orchestra: many lines working in harmony

Managing one edge is simple, but glyphs have hundreds. This collection keeps them sorted by X position, making scanline traversal efficient. Whether we’re building the global edge table or managing active edges, this structure ensures every edge finds its place.

Implementations

impl EdgeList

pub fn new() -> Self

Start fresh: a clean slate for new edges

pub fn with_capacity(capacity: usize) -> Self

Room for everyone: pre-allocate space for efficiency

pub fn insert_sorted(&mut self, edge: Edge)

Find the perfect spot: insert while maintaining order

We use binary search to locate exactly where each edge belongs. No messy linear searches—just surgical precision.

pub fn sort_by_x(&mut self)

Restore order: sort everyone by their X position

pub fn remove_inactive(&mut self, y: i32)

Spring cleaning: remove edges that have finished their journey

pub fn step_all(&mut self)

March together: advance every edge one scanline down

pub fn clear(&mut self)

Clear all edges.

pub fn len(&self) -> usize

Get number of edges.

pub fn is_empty(&self) -> bool

Check if empty.

pub fn as_slice(&self) -> &[Edge]

Get edges as slice.

pub fn as_mut_slice(&mut self) -> &mut [Edge]

Get edges as mutable slice.

pub fn push(&mut self, edge: Edge)

Add an edge without sorting (append).

pub fn extend(&mut self, other: &EdgeList)

Extend with edges from another list.

pub fn iter(&self) -> Iter<'_, Edge>

Get iterator over edges.

pub fn iter_mut(&mut self) -> IterMut<'_, Edge>

Get mutable iterator over edges.

Trait Implementations

impl Clone for EdgeList

fn clone(&self) -> EdgeList

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for EdgeList

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

Formats the value using the given formatter.

impl Default for EdgeList

fn default() -> EdgeList

Returns the “default value” for a type.