easy_node 0.5.2

Smart pointer for graph nodes.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36

//! Smart pointer for graph nodes.
//!
//! _The author of this crate is not good at English._  
//! _Forgive me if the document is hard to read._
//!
//! This crate provides some smart pointers optimized for
//! managing graph data structures.
//!
//! - [`Nr`] - like [`Rc`]
//! - [`Nw`] - like [`Weak`].
//!
//! These smart pointers behavior is similar to [`Rc`] and [`Weak`].<br/>
//! However, These smart pointer comparison is based on location.
//!
//! # Comparison of smart pointers
//!
//! This crate smart pointer comparison is based on location.<br/>
//! This allows smart pointers to be used as [`HashSet`] values, etc.
//!
//! For example, comparison of [`Nr::eq`] is based on identity of node address.<br/>
//! On the other hand comparison of [`Rc::eq`] is based on inner value.
//!
//! [`Rc`]: std::rc::Rc
//! [`Rc::eq`]: std::rc::Rc::eq
//! [`Weak`]: std::rc::Weak
//! [`HashSet`]: std::collections::HashSet

#![warn(missing_docs)]

pub mod prelude;
pub use nr::*;
pub use nw::*;

mod nr;
mod nw;
mod util;