anchor.diff:                  else
                       let newList = new ResizableUsualOne<_>(z)
                       setP.Add(vertexKey, newList)
  -                let outEdges = edges.[slots.[int u.NontermLabel], u.Level]
  +                let outEdges = edges.[slots.[int u.NontermLabel]].[u.Level]
                   for edge in outEdges do
                       let sppfNodeOnEdge = edge.Key
                       for slotLevels in edge.Value do
  
positive.code:             let labelN = slots.[int b.NontermLabel]
              let beginLevel = int b.Level
              let endLevel = int e.Level
              let dict1 = edges.[labelN, beginLevel]
              let cond, dict = structures.ContainsEdge dict1 ast e
              if dict.IsSome then edges.[labelN, beginLevel] <- dict.Value
              cond
          
          
  
negative.code:         let o = treeProc.printerAgent
  
          let nonTerminalNodes = new SysDict<int64,int<nodeMeasure>>()        
          let intermidiateNodes = Array.init input.VertexCount (fun _ -> Array.zeroCreate<SysDict<int<labelMeasure>, int<nodeMeasure>>> input.VertexCount)
          let edges = Array.init input.VertexCount (fun _ -> Array.zeroCreate<SysDict<int<nodeMeasure>, SysDict<int, ResizeArray<int>>>> slots.Count)
          let terminalNodes = 
              Array.init input.VertexCount (fun i -> Array.init input.VertexCount (fun i -> Array.zeroCreate<int<nodeMeasure>> parser.TermCount))
          let currentGSSNode = ref <| dummyGSSNode
          let currentContext = ref <| new Context(!currentVertexInInput, !structures.CurrentLabel, !currentGSSNode, structures.Dummy) //without *1<labelMeasure>
          
  