nephele
/
haikuwebkit
1
0
Fork 0
Code Issues Releases Activity
haikuwebkit/LayoutTests/fast/dom/treeOrderBoundaryPoint-expe...

113 lines
8.3 KiB
Plaintext
Raw Permalink Normal View History

Remove another function that implicitly uses the composed tree (documentOrder on nodes and boundary points) https://bugs.webkit.org/show_bug.cgi?id=218673 Reviewed by Ryosuke Niwa. Source/WebCore: Test: fast/dom/treeOrderBoundaryPoint.html * accessibility/AXObjectCache.cpp: (WebCore::characterOffsetsInOrder): Use treeOrder<ComposedTree>. * accessibility/AccessibilityObject.cpp: (WebCore::AccessibilityObject::misspellingRange const): Ditto. (WebCore::AccessibilityObject::rangeOfStringClosestToRangeInDirection const): Ditto. * dom/BoundaryPoint.h: Removed documentOrder, added treeOrderForTesting. * dom/Node.cpp: Updated comment referring to documentOrder. * dom/Position.cpp: (WebCore::documentOrder): Use treeOrder<ComposedTree>. * dom/SimpleRange.cpp: (WebCore::treeOrderForTesting): Added. (WebCore::documentOrder): Deleted. (WebCore::compareByComposedTreeOrder): Renamed from compareByDocumentOrder and use treeOrder<ComposedTree>. (WebCore::unionRange): Use compareByComposedTreeOrder. (WebCore::intersection): Ditto. * dom/SimpleRange.h: Removed documentOrder. Also removed some repeated function and function template declarations that were left in here by accident. * editing/TextIterator.cpp: (WebCore::characterCount): Use treeOrder<ComposedTree>. * testing/Internals.cpp: (WebCore::Internals::treeOrderBoundaryPoints): Added. * testing/Internals.h: Ditto. * testing/Internals.idl: Ditto. Tools: * TestWebKitAPI/Tests/WebCore/DocumentOrder.cpp: Removed BoundaryPointOffsetZero and BoundaryPointOffsets tests, both replaced by a internals-based test. LayoutTests: * fast/dom/treeOrderBoundaryPoint-expected.txt: Added. * fast/dom/treeOrderBoundaryPoint.html: Added. Canonical link: https://commits.webkit.org/231359@main git-svn-id: https://svn.webkit.org/repository/webkit/trunk@269568 268f45cc-cd09-0410-ab3c-d52691b4dbfc
2020-11-08 19:41:11 +00:00
Test tree ordering algorithm for boundary points.
On success, you will see a series of "PASS" messages, followed by "TEST COMPLETE".
PASS internals.treeOrderBoundaryPoints(document, 0, document, 0, 'ComposedTree') is "equivalent"
PASS internals.treeOrderBoundaryPoints(document, 0, document, 1, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(document, 1, document, 0, 'ComposedTree') is "greater"
PASS body.childNodes.length is 4
PASS internals.treeOrderBoundaryPoints(body, 0, body, 0, 'ComposedTree') is "equivalent"
PASS internals.treeOrderBoundaryPoints(document, 0, body, 0, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(body, 0, document, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(body, 0, document, 1, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(document, 1, body, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(body, 4, document, 1, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(document, 1, body, 4, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(a, 0, a, 0, 'ComposedTree') is "equivalent"
PASS internals.treeOrderBoundaryPoints(body, 0, a, 0, 'ComposedTree') is "unordered"
PASS internals.treeOrderBoundaryPoints(a, 0, body, 0, 'ComposedTree') is "unordered"
PASS internals.treeOrderBoundaryPoints(body, 0, a, 0, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(a, 0, body, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(a, 0, a, 0, 'ComposedTree') is "equivalent"
PASS internals.treeOrderBoundaryPoints(a, 0, body, 5, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(body, 5, a, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(body, 0, b, 0, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(b, 0, body, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(a, 0, b, 0, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(b, 0, a, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(body, 5, b, 0, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(b, 0, body, 5, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(b, 0, body, 6, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(body, 6, b, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(body, 0, c, 0, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(c, 0, body, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(a, 0, c, 0, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(c, 0, a, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(b, 0, c, 0, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(c, 0, b, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(body, 4, c, 0, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(c, 0, body, 4, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(c, 0, body, 6, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(body, 6, c, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(a, 1, c, 0, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(c, 0, a, 1, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(c, 0, b, 1, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(b, 1, c, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(body, 0, d, 0, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(d, 0, body, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(body, 0, d, 0, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(d, 0, body, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(a, 0, d, 0, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(d, 0, a, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(d, 0, b, 0, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(b, 0, d, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(d, 0, c, 0, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(c, 0, d, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(a, 0, d, 0, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(d, 0, a, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(d, 0, b, 0, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(b, 0, d, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(d, 0, c, 0, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(c, 0, d, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(d, 0, body, 5, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(body, 5, d, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(d, 0, a, 1, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(a, 1, d, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(d, 0, b, 1, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(b, 1, d, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(d, 0, c, 1, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(c, 1, d, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(body, 0, f, 0, 'ComposedTree') is "unordered"
PASS internals.treeOrderBoundaryPoints(f, 0, body, 0, 'ComposedTree') is "unordered"
PASS internals.treeOrderBoundaryPoints(f, 0, body, 0, 'ComposedTree') is "unordered"
PASS internals.treeOrderBoundaryPoints(body, 0, f, 0, 'ComposedTree') is "unordered"
PASS internals.treeOrderBoundaryPoints(body, 4, f, 0, 'ComposedTree') is "unordered"
PASS internals.treeOrderBoundaryPoints(f, 0, body, 4, 'ComposedTree') is "unordered"
PASS internals.treeOrderBoundaryPoints(body, 0, g, 0, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(g, 0, body, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(body, 4, g, 0, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(g, 0, body, 4, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(c, 0, c, 1, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(c, 1, c, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(c, 1, c, 2, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(c, 2, c, 1, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(c, 0, c, 2, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(c, 2, c, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(c, 0, g, 0, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(g, 0, c, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(g, 0, c, 1, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(c, 1, g, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(g, 0, c, 2, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(c, 2, g, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(body, 0, h, 0, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(h, 0, body, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(body, 4, h, 0, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(h, 0, body, 4, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(c, 0, h, 0, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(h, 0, c, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(h, 0, c, 1, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(c, 1, h, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(h, 0, c, 2, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(c, 2, h, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(body, 0, i, 0, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(i, 0, body, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(i, 0, d, 0, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(d, 0, i, 0, 'ComposedTree') is "greater"
PASS internals.treeOrderBoundaryPoints(i, 0, b, 0, 'ComposedTree') is "less"
PASS internals.treeOrderBoundaryPoints(b, 0, i, 0, 'ComposedTree') is "greater"
PASS successfullyParsed is true
TEST COMPLETE