anchor.diff:                  newArr.Add(e.Level)
                   newDict2.Add(e.Label, newArr)
                   newDict1.Add(ast, newDict2)
  +                edgesWriteCount := !edgesWriteCount + 1
                   edges.[labelN, b.Level] <- newDict1
                   false                    
           
  
positive.code:              while not !stop do
                  if !condition then dispatcher() else processing()
          control()
                   
          match !resultAST with
              | None -> Error ("String was not parsed")
              | Some res -> 
                      let r1 = new Tree<_> (tokens, res, parser.rules)
                      Success (r1)   
                          
negative.code:             let j = getRightExtension leftExtension
              let k = getRightExtension rightExtension
              let rule = getRule label
              let d =
                  let cur = packedNodes.[i, j, k] 
                  packedNodesReadCount := !packedNodesReadCount + 1
                  if cur <> null then
                      cur
                  else 
                      let t = new Dictionary<int<labelMeasure>, int<nodeMeasure>>()
                      packedNodes.[i, j, k] <- t
                      packedNodesWriteCount := !packedNodesWriteCount + 1
                      packedNodesX.[i] <- packedNodesX.[i] + 1
                      packedNodesY.[j] <- packedNodesY.[j] + 1
                      packedNodesZ.[k] <- packedNodesZ.[k] + 1
                      t
              if d.ContainsKey label
              then
  