Enum GraphKind 

pub enum GraphKind {
    All,
    CodeOnly,
    TypesOnly,
}

The kind of module graph.

Variants

All

All types of dependencies should be analyzed and included in the graph.

CodeOnly

Only code dependencies should be analyzed and included in the graph. This is useful when transpiling and running code, but not caring about type only dependnecies.

TypesOnly

Only type dependencies should be analyzed and included in the graph. This is useful when assessing types, like documentation or type checking, when the code will not be executed.

Note that code which is overloaded with types upon access (like the X-TypeScript-Types header or types defined in the code itself) will still be loaded into the graph, but further code only dependencies will not be followed.

Implementations

impl GraphKind

pub fn include_types(&self) -> bool

pub fn include_code(&self) -> bool

Trait Implementations

impl Clone for GraphKind

fn clone(&self) -> GraphKind

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphKind

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

Formats the value using the given formatter.

impl Default for GraphKind

fn default() -> Self

Returns the “default value” for a type.

impl PartialEq for GraphKind

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for GraphKind

impl Eq for GraphKind

impl StructuralPartialEq for GraphKind