OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2013 Google Inc. All rights reserved. | 2 * Copyright (C) 2013 Google Inc. All rights reserved. |
3 * | 3 * |
4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
6 * met: | 6 * met: |
7 * | 7 * |
8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
(...skipping 12 matching lines...) Expand all Loading... |
23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
29 */ | 29 */ |
30 | 30 |
31 #include "platform/text/BidiResolver.h" | 31 #include "platform/text/BidiResolver.h" |
32 | 32 |
| 33 #include <fstream> |
33 #include "platform/text/BidiTestHarness.h" | 34 #include "platform/text/BidiTestHarness.h" |
34 #include "platform/text/TextRunIterator.h" | 35 #include "platform/text/TextRunIterator.h" |
35 #include "testing/gtest/include/gtest/gtest.h" | 36 #include "testing/gtest/include/gtest/gtest.h" |
36 #include <fstream> | |
37 | 37 |
38 namespace blink { | 38 namespace blink { |
39 | 39 |
40 TEST(BidiResolver, Basic) { | 40 TEST(BidiResolver, Basic) { |
41 bool hasStrongDirectionality; | 41 bool hasStrongDirectionality; |
42 String value("foo"); | 42 String value("foo"); |
43 TextRun run(value); | 43 TextRun run(value); |
44 BidiResolver<TextRunIterator, BidiCharacterRun> bidiResolver; | 44 BidiResolver<TextRunIterator, BidiCharacterRun> bidiResolver; |
45 bidiResolver.setStatus( | 45 bidiResolver.setStatus( |
46 BidiStatus(run.direction(), run.directionalOverride())); | 46 BidiStatus(run.direction(), run.directionalOverride())); |
(...skipping 245 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
292 // The unittest harness only pays attention to GTest output, so we verify | 292 // The unittest harness only pays attention to GTest output, so we verify |
293 // that the tests behaved as expected: | 293 // that the tests behaved as expected: |
294 EXPECT_EQ(352098u, runner.m_testsRun); | 294 EXPECT_EQ(352098u, runner.m_testsRun); |
295 EXPECT_EQ(418143u, runner.m_testsSkipped); | 295 EXPECT_EQ(418143u, runner.m_testsSkipped); |
296 EXPECT_EQ(0u, runner.m_ignoredCharFailures); | 296 EXPECT_EQ(0u, runner.m_ignoredCharFailures); |
297 EXPECT_EQ(44882u, runner.m_levelFailures); | 297 EXPECT_EQ(44882u, runner.m_levelFailures); |
298 EXPECT_EQ(19151u, runner.m_orderFailures); | 298 EXPECT_EQ(19151u, runner.m_orderFailures); |
299 } | 299 } |
300 | 300 |
301 } // namespace blink | 301 } // namespace blink |
OLD | NEW |