anchor.diff:                      Transitions =
                           // Add the unvisited transition targets to the transition graph.
                           (compilationState.Transitions, transitionsFromCurrentDfaState)
  -                        ||> Map.fold (fun transitions derivativeClass target ->
  +                        ||> HashMap.fold (fun transitions derivativeClass target ->
                               LexerDfaGraph.addEdges currentState target derivativeClass transitions); }
   
               // Continue processing recursively.
  
positive.code: 
      //
      let inline getRegularVector dfaState (compilationState : CompilationState) =
          Map.find dfaState compilationState.DfaStateToRegularVector
  
      //
      let createDfaState regVec (compilationState : CompilationState) =
  
negative.code:                 RegularVectorToDfaState =
                      HashMap.add regVec dfaState compilationState.RegularVectorToDfaState;
                  DfaStateToRegularVector =
                      TagMap.add dfaState regVec compilationState.DfaStateToRegularVector;
                   }
  
          // Return the new DFA state and the updated compilation state.
  