Refactor concurrency tests for basic Tree.Edit

[justiceHui]

What this PR does / why we need it:

Refactored the concurrency test for Tree.Edit method for insert, delete, and replace operations.

Insert/Delete/Replace by 2 users (9 * 9 * 9 = 729 cases):

• Ranges(9)
  • intersecting, element
  • intersecting, text
  • A contains B, element
  • A contains B, text
  • A contains B, A is element, B is text
  • side by side, element
  • side by side, text
  • A = B, element
  • A = B, text
• Operations for both A and B(9)
  • Insert text front of range
  • Insert text middle of range
  • Insert text back of range
  • Replace to text node
  • Insert element front of range
  • Insert element middle of range
  • Insert element back of range
  • Replace to element node
  • Delete

Checklist:

• Added relevant tests or not required
• Didn't break anything

[codecov]

Codecov Report

All modified and coverable lines are covered by tests ✅

Comparison is base (6651d42) 50.72% compared to head (deb1128) 50.73%.
Report is 1 commits behind head on main.

Additional details and impacted files

@@           Coverage Diff           @@
##             main     #772   +/-   ##
=======================================
  Coverage   50.72%   50.73%           
=======================================
  Files          70       70           
  Lines       10210    10234   +24     
=======================================
+ Hits         5179     5192   +13     
- Misses       4509     4517    +8     
- Partials      522      525    +3     

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.

[hackerwins]

Thanks for your contribution.