Struct FilterGraph 

pub struct FilterGraph {
    pub primitives: SmallVec<[FilterPrimitive; 1]>,
    pub output: FilterId,
    /* private fields */
}

A directed acyclic graph (DAG) of filter operations.

The graph represents a pipeline of filter primitives where outputs of some primitives can be used as inputs to others. Each primitive has a unique FilterId.

Fields

primitives: SmallVec<[FilterPrimitive; 1]>

All filter primitives in the graph, stored in insertion order.

output: FilterId

The final output filter ID whose result is the output of this graph.

Implementations

impl FilterGraph

pub fn new() -> Self

Create a new empty filter graph.

pub fn add( &mut self, primitive: FilterPrimitive, _inputs: Option<FilterInputs>, ) -> FilterId

Add a filter primitive with optional inputs.

Returns a FilterId that can be referenced by other primitives. Automatically updates the accumulated source and filter expansion requirements.

pub fn set_output(&mut self, output: FilterId)

Set the output filter for the graph.

pub fn filter_expansion(&self, transform: &Affine) -> Rect

The filter expansion of all filters in the graph, see Filter::filter_expansion.

pub fn source_expansion(&self, transform: &Affine) -> Rect

The source expansion of all filters in the graph, see Filter::source_expansion.

Trait Implementations

impl Clone for FilterGraph

fn clone(&self) -> FilterGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for FilterGraph

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

Formats the value using the given formatter.

impl Default for FilterGraph

fn default() -> Self

Returns the “default value” for a type.

impl PartialEq for FilterGraph

fn eq(&self, other: &FilterGraph) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for FilterGraph