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 has_strong_directionality; | 41 bool has_strong_directionality; |
42 String value("foo"); | 42 String value("foo"); |
43 TextRun run(value); | 43 TextRun run(value); |
44 BidiResolver<TextRunIterator, BidiCharacterRun> bidi_resolver; | 44 BidiResolver<TextRunIterator, BidiCharacterRun> bidi_resolver; |
45 bidi_resolver.SetStatus( | 45 bidi_resolver.SetStatus( |
46 BidiStatus(run.Direction(), run.DirectionalOverride())); | 46 BidiStatus(run.Direction(), run.DirectionalOverride())); |
(...skipping 268 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
315 << runner.order_failures_ << " order failures."; | 315 << runner.order_failures_ << " order failures."; |
316 | 316 |
317 EXPECT_EQ(91660u, runner.tests_run_); | 317 EXPECT_EQ(91660u, runner.tests_run_); |
318 EXPECT_EQ(39u, runner.tests_skipped_); | 318 EXPECT_EQ(39u, runner.tests_skipped_); |
319 EXPECT_EQ(0u, runner.ignored_char_failures_); | 319 EXPECT_EQ(0u, runner.ignored_char_failures_); |
320 EXPECT_EQ(14533u, runner.level_failures_); | 320 EXPECT_EQ(14533u, runner.level_failures_); |
321 EXPECT_EQ(14533u, runner.order_failures_); | 321 EXPECT_EQ(14533u, runner.order_failures_); |
322 } | 322 } |
323 | 323 |
324 } // namespace blink | 324 } // namespace blink |
OLD | NEW |