@@ -38,7 +38,7 @@ public T Value
3838 set
3939 {
4040 AssertNotRecycled ( ) ;
41- UnMapped = false ;
41+ Unmapped = false ;
4242 _value = value ;
4343 }
4444 }
@@ -50,23 +50,23 @@ public T Value
5050 /// Will be false if not created by calling Factory.Map or if the value has been mapped.
5151 /// Since querying the chidren of this node will cause the value to be mapped, it can be useful to query this value before attempting traversal.
5252 /// </summary>
53- public bool UnMapped { get ; private set ; }
53+ public bool Unmapped { get ; private set ; }
5454
5555 IReadOnlyList < Node < T > > EnsureChildrenMapped ( )
5656 {
57- if ( ! UnMapped )
57+ if ( ! Unmapped )
5858 return _childrenReadOnly ;
5959
6060 // Need to avoid double mapping and this method is primarily called when 'reading' from the node and contention will only occur if mapping is needed.
6161 lock ( _children )
6262 {
63- if ( ! UnMapped ) return _childrenReadOnly ;
63+ if ( ! Unmapped ) return _childrenReadOnly ;
6464 if ( _value is IParent < T > p )
6565 {
6666 foreach ( var child in p . Children )
6767 _children . Add ( _factory . Map ( child ) ) ;
6868 }
69- UnMapped = false ;
69+ Unmapped = false ;
7070 }
7171
7272 return _childrenReadOnly ;
@@ -103,7 +103,7 @@ public bool Remove(Node<T> node)
103103 if ( ! _children . Remove ( node ) ) return false ;
104104
105105 AssertNotRecycled ( ) ;
106- UnMapped = false ;
106+ Unmapped = false ;
107107 node . Parent = null ; // Need to be very careful about retaining parent references as it may cause a 'leak' per-se.
108108 return true ;
109109 }
@@ -133,7 +133,7 @@ public void Clear()
133133 if ( _children . Count == 0 ) return ;
134134
135135 AssertNotRecycled ( ) ;
136- UnMapped = false ;
136+ Unmapped = false ;
137137 foreach ( var c in _children )
138138 c . Parent = null ;
139139 _children . Clear ( ) ;
@@ -177,7 +177,7 @@ public void Replace(Node<T> node, Node<T> replacement)
177177 throw new InvalidOperationException ( "Node being replaced does not belong to this parent." ) ;
178178
179179 AssertNotRecycled ( ) ;
180- UnMapped = false ;
180+ Unmapped = false ;
181181 _children [ i ] = replacement ;
182182 node . Parent = null ;
183183 replacement . Parent = this ;
@@ -215,7 +215,7 @@ public Node<T> Root
215215 /// </summary>
216216 public void Teardown ( )
217217 {
218- UnMapped = false ;
218+ Unmapped = false ;
219219 Value = default ;
220220 Detatch ( ) ; // If no parent then this does nothing...
221221 TeardownChildren ( ) ;
@@ -229,7 +229,7 @@ public void TeardownChildren()
229229 if ( _children . Count == 0 ) return ;
230230
231231 AssertNotRecycled ( ) ;
232- UnMapped = false ;
232+ Unmapped = false ;
233233 foreach ( var c in _children )
234234 {
235235 c . Parent = null ; // Don't initiate a 'Detach' (which does a lookup) since we are clearing here;
@@ -245,7 +245,7 @@ public void TeardownChildren()
245245 public T Recycle ( )
246246 {
247247 AssertNotRecycled ( ) ; // Avoid double entry in the pool.
248- UnMapped = false ;
248+ Unmapped = false ;
249249 var value = Value ;
250250 Value = default ;
251251 Detatch ( ) ; // If no parent then this does nothing...
@@ -260,7 +260,7 @@ public void RecycleChildren()
260260 {
261261 if ( _children . Count == 0 ) return ;
262262
263- UnMapped = false ;
263+ Unmapped = false ;
264264 foreach ( var c in _children )
265265 {
266266 c . Parent = null ; // Don't initiate a 'Detach' (which does a lookup) since we are clearing here;
0 commit comments