pub enum GraphDir {
Horizontal,
Vertical,
}Expand description
Direction to lay out the graph nodes.
Variants§
Horizontal
The graph is laid out from left to right.
Vertical
The graph is laid out from top to bottom.
Trait Implementations§
impl Copy for GraphDir
Source§impl<'de> Deserialize<'de> for GraphDir
impl<'de> Deserialize<'de> for GraphDir
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
impl Eq for GraphDir
impl StructuralPartialEq for GraphDir
Auto Trait Implementations§
impl Freeze for GraphDir
impl RefUnwindSafe for GraphDir
impl Send for GraphDir
impl Sync for GraphDir
impl Unpin for GraphDir
impl UnsafeUnpin for GraphDir
impl UnwindSafe for GraphDir
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.