Struct conllx::graph::DepGraph

source ·

pub struct DepGraph<'a> { /* private fields */ }

Expand description

A graph view.

This data structure provides a view of a CoNLL-X dependency graph. The view can be used to retrieve the dependents of a head or the head of a dependent.

Implementations

source

impl<'a> DepGraph<'a>

source

pub fn dependents(&self, head: usize) -> impl Iterator<Item = DepTriple<&'a str>>

Return an iterator over the dependents of head.

source

pub fn head(&self, dependent: usize) -> Option<DepTriple<&'a str>>

Return the head relation of dependent, if any.

source

pub fn len(&self) -> usize

Get the number of nodes in the dependency graph.

This is equal to the number of tokens, plus one root node.

Trait Implementations

source

impl<'a> Index<usize> for DepGraph<'a>

type Output = Node

The returned type after indexing.

source

fn index(&self, idx: usize) -> &Self::Output

Performs the indexing (container[index]) operation. Read more

source

impl<'a, 'b> PartialEq<DepGraph<'b>> for DepGraph<'a>

source

fn eq(&self, other: &DepGraph<'b>) -> bool

This method tests for self and other values to be equal, and is used by ==. Read more

1.0.0 · source

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason. Read more

source

impl<'a> Eq for DepGraph<'a>

Auto Trait Implementations

impl<'a> !RefUnwindSafe for DepGraph<'a>

impl<'a> Send for DepGraph<'a>

impl<'a> Sync for DepGraph<'a>

impl<'a> Unpin for DepGraph<'a>

impl<'a> !UnwindSafe for DepGraph<'a>

Blanket Implementations

source

impl<T> Any for Twhere
T: 'static + ?Sized,

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

impl<T> Borrow<T> for Twhere
T: ?Sized,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for Twhere
T: ?Sized,

const: unstable · source

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

source

impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,

source

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

impl<T, U> Into for Twhere
U: From<T>,

const: unstable · source

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source

impl<T, U> TryFrom for Twhere
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

source

impl<T, U> TryInto for Twhere
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

Struct conllx::graph::DepGraph

Implementations

impl<'a> DepGraph<'a>

pub fn dependents(&self, head: usize) -> impl Iterator<Item = DepTriple<&'a str>>

pub fn head(&self, dependent: usize) -> Option<DepTriple<&'a str>>

pub fn len(&self) -> usize

Trait Implementations

impl<'a> Index<usize> for DepGraph<'a>

type Output = Node

fn index(&self, idx: usize) -> &Self::Output

impl<'a, 'b> PartialEq<DepGraph<'b>> for DepGraph<'a>

fn eq(&self, other: &DepGraph<'b>) -> bool

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

impl<'a> Eq for DepGraph<'a>

Auto Trait Implementations

impl<'a> !RefUnwindSafe for DepGraph<'a>

impl<'a> Send for DepGraph<'a>

impl<'a> Sync for DepGraph<'a>

impl<'a> Unpin for DepGraph<'a>

impl<'a> !UnwindSafe for DepGraph<'a>

Blanket Implementations

impl<T> Any for Twhere
T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for Twhere
T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for Twhere
T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,

fn equivalent(&self, key: &K) -> bool

impl<T> From<T> for T

fn from(t: T) -> T

impl<T, U> Into<U> for Twhere
U: From<T>,

fn into(self) -> U

impl<T, U> TryFrom<U> for Twhere
U: Into<T>,

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for Twhere
U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Struct conllx::graph::DepGraph

Implementations

impl<'a> DepGraph<'a>

pub fn dependents(&self, head: usize) -> impl Iterator<Item = DepTriple<&'a str>>

pub fn head(&self, dependent: usize) -> Option<DepTriple<&'a str>>

pub fn len(&self) -> usize

Trait Implementations

impl<'a> Index<usize> for DepGraph<'a>

type Output = Node

fn index(&self, idx: usize) -> &Self::Output

impl<'a, 'b> PartialEq<DepGraph<'b>> for DepGraph<'a>

fn eq(&self, other: &DepGraph<'b>) -> bool

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

impl<'a> Eq for DepGraph<'a>

Auto Trait Implementations

impl<'a> !RefUnwindSafe for DepGraph<'a>

impl<'a> Send for DepGraph<'a>

impl<'a> Sync for DepGraph<'a>

impl<'a> Unpin for DepGraph<'a>

impl<'a> !UnwindSafe for DepGraph<'a>

Blanket Implementations

impl<T> Any for Twhere T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for Twhere T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for Twhere T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

fn equivalent(&self, key: &K) -> bool

impl<T> From<T> for T

fn from(t: T) -> T

impl<T, U> Into<U> for Twhere U: From<T>,

fn into(self) -> U

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

impl<T> Any for Twhere
T: 'static + ?Sized,

impl<T> Borrow<T> for Twhere
T: ?Sized,

impl<T> BorrowMut<T> for Twhere
T: ?Sized,

impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,

impl<T, U> Into<U> for Twhere
U: From<T>,

impl<T, U> TryFrom<U> for Twhere
U: Into<T>,

impl<T, U> TryInto<U> for Twhere
U: TryFrom<T>,