OLD | NEW |
1 // Copyright 2015 The Chromium Authors. All rights reserved. | 1 // Copyright 2015 The Chromium Authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #include "config.h" | 5 #include "config.h" |
6 #include "core/editing/VisiblePosition.h" | 6 #include "core/editing/VisiblePosition.h" |
7 | 7 |
8 #include "core/editing/EditingTestBase.h" | 8 #include "core/editing/EditingTestBase.h" |
9 #include "core/editing/VisibleUnits.h" | 9 #include "core/editing/VisibleUnits.h" |
10 | 10 |
(...skipping 14 matching lines...) Expand all Loading... |
25 RefPtrWillBeRawPtr<Element> two = body->querySelector("#two", ASSERT_NO_EXCE
PTION); | 25 RefPtrWillBeRawPtr<Element> two = body->querySelector("#two", ASSERT_NO_EXCE
PTION); |
26 RefPtrWillBeRawPtr<Element> four = shadowRoot->querySelector("#s4", ASSERT_N
O_EXCEPTION); | 26 RefPtrWillBeRawPtr<Element> four = shadowRoot->querySelector("#s4", ASSERT_N
O_EXCEPTION); |
27 RefPtrWillBeRawPtr<Element> five = shadowRoot->querySelector("#s5", ASSERT_N
O_EXCEPTION); | 27 RefPtrWillBeRawPtr<Element> five = shadowRoot->querySelector("#s5", ASSERT_N
O_EXCEPTION); |
28 | 28 |
29 EXPECT_EQ(Position(one->firstChild(), 0), canonicalPositionOf(Position(one,
0))); | 29 EXPECT_EQ(Position(one->firstChild(), 0), canonicalPositionOf(Position(one,
0))); |
30 EXPECT_EQ(Position(one->firstChild(), 0), createVisiblePosition(Position(one
, 0)).deepEquivalent()); | 30 EXPECT_EQ(Position(one->firstChild(), 0), createVisiblePosition(Position(one
, 0)).deepEquivalent()); |
31 EXPECT_EQ(Position(one->firstChild(), 2), canonicalPositionOf(Position(two.g
et(), 0))); | 31 EXPECT_EQ(Position(one->firstChild(), 2), canonicalPositionOf(Position(two.g
et(), 0))); |
32 EXPECT_EQ(Position(one->firstChild(), 2), createVisiblePosition(Position(two
.get(), 0)).deepEquivalent()); | 32 EXPECT_EQ(Position(one->firstChild(), 2), createVisiblePosition(Position(two
.get(), 0)).deepEquivalent()); |
33 | 33 |
34 EXPECT_EQ(PositionInComposedTree(five->firstChild(), 2), canonicalPositionOf
(PositionInComposedTree(one.get(), 0))); | 34 EXPECT_EQ(PositionInComposedTree(five->firstChild(), 2), canonicalPositionOf
(PositionInComposedTree(one.get(), 0))); |
35 EXPECT_EQ(Position(five->firstChild(), 2), createVisiblePosition(PositionInC
omposedTree(one.get(), 0)).deepEquivalent()); | 35 EXPECT_EQ(PositionInComposedTree(five->firstChild(), 2), createVisiblePositi
on(PositionInComposedTree(one.get(), 0)).deepEquivalent()); |
36 EXPECT_EQ(PositionInComposedTree(four->firstChild(), 2), canonicalPositionOf
(PositionInComposedTree(two.get(), 0))); | 36 EXPECT_EQ(PositionInComposedTree(four->firstChild(), 2), canonicalPositionOf
(PositionInComposedTree(two.get(), 0))); |
37 EXPECT_EQ(Position(four->firstChild(), 2), createVisiblePosition(PositionInC
omposedTree(two.get(), 0)).deepEquivalent()); | 37 EXPECT_EQ(PositionInComposedTree(four->firstChild(), 2), createVisiblePositi
on(PositionInComposedTree(two.get(), 0)).deepEquivalent()); |
38 } | 38 } |
39 | 39 |
40 } // namespace blink | 40 } // namespace blink |
OLD | NEW |