Enum deno_graph::GraphKind
source · pub enum GraphKind {
All,
CodeOnly,
TypesOnly,
}
Expand description
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§
Trait Implementations§
source§impl PartialEq for GraphKind
impl PartialEq for GraphKind
impl Copy for GraphKind
impl Eq for GraphKind
impl StructuralPartialEq for GraphKind
Auto Trait Implementations§
impl RefUnwindSafe for GraphKind
impl Send for GraphKind
impl Sync for GraphKind
impl Unpin for GraphKind
impl UnwindSafe for GraphKind
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.