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
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187

/// Internal namespace.
mod private
{
  use crate::prelude::*;
  // use wtools::prelude::*;
  use indexmap::IndexSet;
  use core::fmt;

  ///
  /// Canonical implementation of node.
  ///

  pub struct Node< NodeId = crate::IdentityWithInt, EdgeId = crate::IdentityWithInt >
  where
    NodeId : IdentityInterface,
    EdgeId : IdentityInterface,
  {
    /// Input node.
    pub out_nodes : IndexSet< NodeId >,
    /// Input node.
    pub out_edges : IndexSet< EdgeId >,
    // /// Kind of the node.
    // pub kind : Kind,
    /// Identifier.
    pub id : NodeId,
  }

  //

//   impl< NodeId, EdgeId > Node< NodeId, EdgeId >
//   where
//     NodeId : IdentityInterface,
//     EdgeId : IdentityInterface,
//     //
//   {
//
//     /// Construct an instance of the node with id.
//     pub fn make_with_id< Name >( id : Name ) ->Self
//     where
//       Name : Into< < Self as HasId >::Id >,
//     {
//       let out_nodes = IndexSet::new();
//       let out_edges = IndexSet::new();
//       Self
//       {
//         out_nodes,
//         out_edges,
//         id : id.into(),
//       }
//     }
//
//   }

  //

  impl< NodeId, EdgeId > Node< NodeId, EdgeId >
  where
    NodeId : IdentityInterface,
    EdgeId : IdentityInterface,
  {
    /// Construct canonical node using id.
    pub fn _make_with_id< IntoId >( id : IntoId ) -> Self
    where
      IntoId : Into< < Self as HasId >::Id >,
    {
      let out_nodes = Default::default();
      let out_edges = Default::default();
      Node { out_nodes, out_edges, id : id.into() }
      // Self::make_with_id( id )
    }
  }

//   impl< NodeId, EdgeId, IntoId > From_1< IntoId >
//   for Node< NodeId, EdgeId >
//   where
//     NodeId : IdentityInterface,
//     EdgeId : IdentityInterface,
//
//     IntoId : Into< < Self as HasId >::Id >,
//   {
//     fn from_1( id : IntoId ) -> Self
//     {
//       let out_nodes = Default::default();
//       let in_nodes = Default::default();
//       Node { out_nodes, in_nodes, id }
//       // Self::make_with_id( id )
//     }
//   }

  //

  impl< NodeId, EdgeId > HasId
  for Node< NodeId, EdgeId >
  where
    NodeId : IdentityInterface,
    EdgeId : IdentityInterface,
  {
    type Id = NodeId;
    fn id( &self ) -> Self::Id
    {
      self.id
    }
  }

  //

  impl< NodeId, EdgeId > NodeBasicInterface
  for Node< NodeId, EdgeId >
  where
    NodeId : IdentityInterface,
    EdgeId : IdentityInterface,

  {
  }

  //

  // impl< NodeId, EdgeId > Extend< < Self as HasId >::Id >
  // for Node< NodeId, EdgeId >
  // where
  //   NodeId : IdentityInterface,
  //   EdgeId : IdentityInterface,
  //
  // {
  //   fn extend< Iter >( &mut self, iter : Iter )
  //   where
  //     Iter : IntoIterator< Item = < Self as HasId >::Id >
  //   {
  //     for node_id in iter
  //     {
  //       self.out_nodes.insert( node_id );
  //     }
  //   }
  // }

  //

  impl< NodeId, EdgeId > fmt::Debug
  for Node< NodeId, EdgeId >
  where
    NodeId : IdentityInterface,
    EdgeId : IdentityInterface,

  {
    fn fmt( &self, f : &mut fmt::Formatter<'_> ) -> fmt::Result
    {
      f.write_fmt( format_args!( "node::{:?}", self.id() ) )?;
      for e in &self.out_nodes
      {
        f.write_fmt( format_args!( "\n - {:?}", e ) )?;
      }
      f.write_fmt( format_args!( "" ) )
    }
  }

  //

  impl< NodeId, EdgeId > PartialEq
  for Node< NodeId, EdgeId >
  where
    NodeId : IdentityInterface,
    EdgeId : IdentityInterface,

  {
    fn eq( &self, other : &Self ) -> bool
    {
      self.id() == other.id()
    }
  }

  impl< NodeId, EdgeId > Eq
  for Node< NodeId, EdgeId >
  where
    NodeId : IdentityInterface,
    EdgeId : IdentityInterface,

  {}

}

//

crate::mod_interface!
{
  orphan use Node;
}