reflect_tools 0.9.0

Collection of mechanisms for reflection.
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
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

//!
//! Implementation of Entity for a HashMap.
//!

use super :: *;

/// Define a private namespace for all its items.
pub mod private
{
  use super :: *;
  // qqq: xxx: implement for HashMap
  // aaa: added implementation of Instance trait for HashMap
  use std ::collections ::HashMap;
  impl< K, V > Instance for HashMap< K, V >
  where
  KeyedCollectionDescriptor< HashMap< K, V > > : Entity,
  primitive ::Primitive: From< K >,
  K: Clone,
  {
  type Entity = KeyedCollectionDescriptor :: < HashMap< K, V > >;
  fn _reflect( &self ) -> Self ::Entity
  {
   KeyedCollectionDescriptor :: < Self > ::new
   (
  self.len(),
  self.keys().into_iter().map( | k | primitive ::Primitive ::from( k.clone() ) ).collect :: < Vec< _ > >(),
 )
 }
  #[ inline( always ) ]
  fn Reflect() -> Self ::Entity
  {
   KeyedCollectionDescriptor :: < Self > ::new( 0, Vec ::new() )
 }
 }

  impl< K, V > Entity for KeyedCollectionDescriptor< HashMap< K, V > >
  where
  K: 'static + Instance + IsScalar + Clone,
  primitive ::Primitive: From< K >,
  V: 'static + Instance,
  {
  #[ inline( always ) ]
  fn is_container( &self ) -> bool
  {
   true
 }

  #[ inline( always ) ]
  fn is_ordered( &self ) -> bool
  {
   false // HashMaps do not guarantee element order
 }

  #[ inline( always ) ]
  fn len( &self ) -> usize
  {
   self.len
 }

  #[ inline( always ) ]
  fn type_name( &self ) -> &'static str
  {
   core ::any ::type_name :: < HashMap< K, V > >()
 }

  #[ inline( always ) ]
  fn type_id( &self ) -> core ::any ::TypeId
  {
   core ::any ::TypeId ::of :: < HashMap< K, V > >()
 }

  #[ inline( always ) ]
  fn elements( &self ) -> Box< dyn Iterator< Item = KeyVal > >
  {
   let mut result: Vec< KeyVal > = ( 0 .. self.len() )
   .map( | k | KeyVal { key: Primitive ::usize( k ), val: Box ::new( < V as Instance > ::Reflect() ) } )
   .collect();

   for i in 0..self.len()
   {
   result[ i ] = KeyVal { key: self.keys[ i ].clone(), val: Box ::new( < V as Instance > ::Reflect() ) }
 }

   Box ::new( result.into_iter() )
 }
 }
}

#[ doc( inline ) ]
#[ allow( unused_imports ) ]
pub use own :: *;

/// Own namespace of the module.
#[ allow( unused_imports ) ]
pub mod own
{
  use super :: *;
  #[ doc( inline ) ]
  pub use orphan :: *;
}

/// Orphan namespace of the module.
#[ allow( unused_imports ) ]
pub mod orphan
{
  use super :: *;
  #[ doc( inline ) ]
  pub use exposed :: *;
  // pub use private ::
  // {
  // };
}

/// Exposed namespace of the module.
#[ allow( unused_imports ) ]
pub mod exposed
{
  use super :: *;
  #[ doc( inline ) ]
  pub use prelude :: *;
}

#[ doc( inline ) ]
#[ allow( unused_imports ) ]
pub use exposed :: *;

/// Prelude to use essentials: `use my_module ::prelude :: *`.
#[ allow( unused_imports ) ]
pub mod prelude
{
  use super :: *;
}