@@ -109,6 +109,7 @@ private void FindBranchingPoint()
109109 Node activeEdge ;
110110 if ( _activeEdgeIndex != InvalidNodeIndex )
111111 {
112+ Debug . Assert ( children != null , nameof ( children ) + " != null" ) ;
112113 childNodeIndex = children [ _activeEdgeIndex ] ;
113114 activeEdge = GetNode ( childNodeIndex ) ;
114115 }
@@ -132,6 +133,7 @@ private void FindBranchingPoint()
132133 return ;
133134 }
134135 var c = InternalData [ _currentOffset ] ;
136+ Debug . Assert ( children != null , nameof ( children ) + " != null" ) ;
135137 var childIndex = children . LowerBound ( c , EdgeComparer ) ;
136138 if ( childIndex == children . Count )
137139 {
@@ -223,6 +225,7 @@ private void UpdateActiveEdgeAndCurrentPosition()
223225 DebugCode . AssertState ( ! branchNode . IsLeaf , "Invalid active state" ) ;
224226 var index = _currentOffset - _activeLength ;
225227 var children = branchNode . Children ;
228+ Debug . Assert ( children != null , nameof ( children ) + " != null" ) ;
226229 var childIndex = children . LowerBound ( InternalData [ index ] , EdgeComparer ) ;
227230 DebugCode . AssertState ( childIndex != children . Count , "Invalid active state" ) ;
228231 var edgeIndex = children [ childIndex ] ;
@@ -256,6 +259,7 @@ private void InsertSuffix()
256259 if ( _activeEdgeIndex != InvalidNodeIndex )
257260 {
258261 var branchChildren = branchNode . Children ;
262+ Debug . Assert ( branchChildren != null , nameof ( branchChildren ) + " != null" ) ;
259263 var edgeNodeIndex = branchChildren [ _activeEdgeIndex ] ;
260264 // need to create a new internal node
261265 var edgeNode = GetNode ( edgeNodeIndex ) ;
0 commit comments