anchor.diff:   NamedGroupStringIntegerPairHashMap.Free;
   
    ThreadLocalStorageInstanceManagerCriticalSection.Free;
  +
  + RangeLow:='';
  + RangeHigh:='';
   
    inherited Destroy;
   end;
  
positive.code:        end else begin
          // Infinity without minimum connt
          i0:=NewInstruction(opSPLIT);
          if Node^.Value<>0 then begin
           // Non-greedy
           Instructions[i0].OtherNext:=pointer(ptrint(CountInstructions));
  
negative.code:        // nothing
        end else if (Node^.MinCount=0) and (Node^.MaxCount=1) then begin
         i0:=NewInstruction(opSPLIT);
         Instructions[i0].Value:=skQUEST;
         if Node^.Value<>0 then begin
          // Non-greedy
          Instructions[i0].OtherNext:=pointer(ptrint(CountInstructions));
  