| 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 13 matching lines...) Expand all Loading... |
| 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 #ifndef BidiTestHarness_h | 31 #ifndef BidiTestHarness_h |
| 32 #define BidiTestHarness_h | 32 #define BidiTestHarness_h |
| 33 | 33 |
| 34 #include <stdio.h> |
| 34 #include <istream> | 35 #include <istream> |
| 35 #include <map> | 36 #include <map> |
| 36 #include <stdio.h> | |
| 37 #include <string> | 37 #include <string> |
| 38 #include <vector> | 38 #include <vector> |
| 39 | 39 |
| 40 // FIXME: We don't have any business owning this code. We should try to | 40 // FIXME: We don't have any business owning this code. We should try to |
| 41 // upstream this to unicode.org if possible (for other implementations to use). | 41 // upstream this to unicode.org if possible (for other implementations to use). |
| 42 // Unicode.org provides a reference implmentation, including parser: | 42 // Unicode.org provides a reference implmentation, including parser: |
| 43 // http://www.unicode.org/Public/PROGRAMS/BidiReferenceC/6.3.0/source/brtest.c | 43 // http://www.unicode.org/Public/PROGRAMS/BidiReferenceC/6.3.0/source/brtest.c |
| 44 // But it, like the other implementations I've found, is rather tied to | 44 // But it, like the other implementations I've found, is rather tied to |
| 45 // the algorithms it is testing. This file seeks to only implement the parser | 45 // the algorithms it is testing. This file seeks to only implement the parser |
| 46 // bits. | 46 // bits. |
| (...skipping 212 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 259 if (paragraphDirectionMask & DirectionRTL) | 259 if (paragraphDirectionMask & DirectionRTL) |
| 260 m_runner.runTest(testString, reorder, levels, DirectionRTL, | 260 m_runner.runTest(testString, reorder, levels, DirectionRTL, |
| 261 originalLine, lineNumber); | 261 originalLine, lineNumber); |
| 262 } | 262 } |
| 263 } | 263 } |
| 264 } | 264 } |
| 265 | 265 |
| 266 } // namespace bidi_test | 266 } // namespace bidi_test |
| 267 | 267 |
| 268 #endif // BidiTestHarness_h | 268 #endif // BidiTestHarness_h |
| OLD | NEW |