anchor.diff:                  newDict2.Add(e.Label, newArr)
                   newDict1.Add(ast, newDict2)
                   edgesWriteCount := !edgesWriteCount + 1
  -                edges.Add((packVertex labelN b.Level), newDict1)
  +                edges.[labelN, b.Level] <- newDict1
                   false                    
           
           let getTreeExtension (node : int<nodeMeasure>) =
  
positive.code:                     let d3 = new Dictionary<int<labelMeasure>, int<nodeMeasure>>()
                      d2.Add(k, d3)
                      d1.Add(j, d2)
                      packedNodes.Add(i, d1)
                      d3
              let contains, d1 = d.TryGetValue label
              if contains
  
negative.code:         let containsEdge (b : Vertex) (e : Vertex) ast =
              let labelN = slots.[int b.Label]
              edgesReadCount := !edgesReadCount + 1
              let dict1 = edges.[labelN, b.Level]
              if dict1 <> Unchecked.defaultof<Dictionary<int<nodeMeasure>, Dictionary<int<labelMeasure>, ResizeArray<int>>>>
              then
                  if dict1.ContainsKey(ast)
                  then
                      let dict2 = dict1.[ast]
  