Array gaps not handled efficently

[flakey-bit]

Consider the following two sorted arrays:

Left: [1,2,3,4,5,6,7,8,9]
Right: [1,3,4,6,8]

Under the reference (JS) implementation we get an efficent output:

{
  "_t": "a",
  "_1": [
    2,
    0,
    0
  ],
  "_4": [
    5,
    0,
    0
  ],
  "_6": [
    7,
    0,
    0
  ],
  "_8": [
    9,
    0,
    0
  ]
}

telling us clearly that items at indexes 1, 4, 6 & 8 (i.e. values 2, 5, 7 & 9) have been removed.

Under jsondiffpatch.net

void Main()
{
	var leftArray = new int[] {
		1,
		2,
		3,
		4,
		5,
		6,
		7,
		8,
		9,
	};

	var rightArray = new int[] {
		1,
		3,
		4,
		6,
		8
	};

	var jdp = new JsonDiffPatch();
	var output = jdp.Diff(JToken.FromObject(leftArray), JToken.FromObject(rightArray));
	
	Console.Out.WriteLine(output.ToString());
}

We get the following output:

{
  "_t": "a",
  "_1": [
    2,
    0,
    0
  ],
  "_2": [
    3,
    0,
    0
  ],
  "_3": [
    4,
    0,
    0
  ],
  "_4": [
    5,
    0,
    0
  ],
  "_5": [
    6,
    0,
    0
  ],
  "_6": [
    7,
    0,
    0
  ],
  "_7": [
    8,
    0,
    0
  ],
  "_8": [
    9,
    0,
    0
  ],
  "1": [
    3
  ],
  "2": [
    4
  ],
  "3": [
    6
  ],
  "4": [
    8
  ]
}