graphs_tools 0.2.0

Graphs tools. 
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
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84

/// Internal namespace.
mod private
{
  use crate::prelude::*;

  // macro_rules! NODE_ID
  // {
  //   () => { < Node as HasId >::Id };
  // }

  ///
  /// Canonical implementation of edge.
  ///

  #[ derive( Debug, Copy, Clone ) ]
  pub struct Edge< EdgeId = crate::IdentityWithInt, NodeId = crate::IdentityWithInt >
  where
    EdgeId : IdentityInterface,
    NodeId : IdentityInterface,
  {
    /// Input node.
    pub in_node : NodeId,
    /// Output node.
    pub out_node : NodeId,
    // /// Kind of the edge.
    // pub kind : Kind,
    /// Identifier.
    pub id : EdgeId,
  }

  //

  impl< EdgeId, NodeId > HasId
  for Edge< EdgeId, NodeId >
  where
    EdgeId : IdentityInterface,
    NodeId : IdentityInterface,

  {
    type Id = EdgeId;
    fn id( &self ) -> Self::Id
    {
      self.id
    }
  }

  //

  impl< EdgeId, NodeId > EdgeBasicInterface
  for Edge< EdgeId, NodeId >
  where
    EdgeId : IdentityInterface,
    NodeId : IdentityInterface,
  {
  }

  //

  impl< EdgeId, NodeId > PartialEq
  for Edge< EdgeId, NodeId >
  where
    EdgeId : IdentityInterface,
    NodeId : IdentityInterface,
  {
    fn eq( &self, other : &Self ) -> bool
    {
      self.id() == other.id()
    }
  }

  impl< EdgeId, NodeId > Eq
  for Edge< EdgeId, NodeId >
  where
    EdgeId : IdentityInterface,
    NodeId : IdentityInterface,
  {}
}

//

crate::mod_interface!
{
  orphan use super::private::Edge;
}