Struct Node 

pub struct Node<T: Ord> { /* private fields */ }

Implementations

impl<T> Node<T>

where T: Ord + Clone,

pub fn new(data: T) -> Box<Self>

use crate::bst::bst;

let one = bst::Node::new(1);

assert_eq!(*one.get_data(), 1);

pub fn get_data(&self) -> &T

pub fn set_data(&mut self, data: T)

pub fn get_left(&self) -> &Option<Box<Node<T>>>

use crate::bst::bst;
use crate::bst::bst::Node;

let two = bst::Node::new(2);
let mut one = bst::Node::new(1);
one.set_left(Some(two));
let one = one;


assert_eq!(
    one
        .get_left()
        .as_ref()
        .map(|node| node.get_data().clone())
        .unwrap(),
    2
);

pub fn set_left(&mut self, left: Option<Box<Node<T>>>)

pub fn get_right(&self) -> &Option<Box<Node<T>>>

use crate::bst::bst;
use crate::bst::bst::Node;

let two = bst::Node::new(2);
let mut one = bst::Node::new(1);
one.set_right(Some(two));
let one = one;


assert_eq!(
    one
        .get_right()
        .as_ref()
        .map(|node| node.get_data().clone())
        .unwrap(),
    2
);

pub fn set_right(&mut self, right: Option<Box<Node<T>>>)

Trait Implementations

impl<T: Clone + Ord> Clone for Node<T>

fn clone(&self) -> Node<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug + Ord> Debug for Node<T>

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

Formats the value using the given formatter.

impl<T> Ord for Node<T>

where T: Ord,

fn cmp(&self, other: &Self) -> Ordering

use crate::bst::bst;

let one = bst::Node::new(1);
let two = bst::Node::new(2);
let thr = bst::Node::new(3);

assert!(one < two);
assert!(thr > one);
assert!(one == one);

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<T> PartialEq for Node<T>

where T: Ord,

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

use crate::bst::bst;

let one = bst::Node::new(1);
let two = bst::Node::new(1);

assert!(one == two);

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<T> PartialOrd for Node<T>

where T: Ord,

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

use crate::bst::bst;

let one = bst::Node::new(1);
let two = bst::Node::new(2);

assert!(one < two);

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<T> Eq for Node<T>

where T: Ord,