Complex diff result

[iowxy]

Versioun

5.0.4

Original dom

<p>1</p><p>2</p><p>3</p>

Next dom

<p>1</p><b>2</b><p>3</p>

Expected result

[
  {
    "action": "replaceElement",
    "route": [1]
  }
]

Actual diff result

{
    "action": "removeElement",
    "route": [  0  ],
    "element": {
      "nodeName": "P",
      "childNodes": [
        {
          "nodeName": "#text",
          "data": "1"
        }
      ]
    }
  },
  {
    "action": "addElement",
    "route": [ 1 ],
    "element": {
      "nodeName": "B",
      "childNodes": [
        {
          "nodeName": "#text",
          "data": "2",
          "outerDone": true
        }
      ],
      "outerDone": true,
      "subsets": [
        {
          "oldValue": 0,
          "newValue": 0,
          "length": 1
        }
      ],
      "subsetsAge": 100,
      "innerDone": true,
      "valueDone": true
    }
  },
  {
    "action": "modifyTextElement",
    "route": [  0, 0  ],
    "oldValue": "2",
    "newValue": "1"
  }

[johanneswilm]

@iowxy True. However, this is more difficult than one would assume as optimizing the algorithm for this usecase will probably make it worse for other use cases. I have started some work here, but will probably not finish it. I will accept a PR though.
https://github.com/fiduswriter/diffDOM/tree/similarity