| 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 24 matching lines...) Expand all Loading... |
| 35 #include <map> | 35 #include <map> |
| 36 #include <stdio.h> | 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 bi
ts. | 45 // the algorithms it is testing. This file seeks to only implement the parser |
| 46 // bits. |
| 46 | 47 |
| 47 // Other C/C++ implementations of this parser: | 48 // Other C/C++ implementations of this parser: |
| 48 // https://github.com/googlei18n/fribidi-vs-unicode/blob/master/test.c | 49 // https://github.com/googlei18n/fribidi-vs-unicode/blob/master/test.c |
| 49 // http://source.icu-project.org/repos/icu/icu/trunk/source/test/intltest/bidico
nf.cpp | 50 // http://source.icu-project.org/repos/icu/icu/trunk/source/test/intltest/bidico
nf.cpp |
| 50 // Both of those are too tied to their respective projects to be use to Blink. | 51 // Both of those are too tied to their respective projects to be use to Blink. |
| 51 | 52 |
| 52 // There are non-C implmentations to parse BidiTest.txt as well, including: | 53 // There are non-C implmentations to parse BidiTest.txt as well, including: |
| 53 // https://github.com/twitter/twitter-cldr-rb/blob/master/spec/bidi/bidi_spec.rb | 54 // https://github.com/twitter/twitter-cldr-rb/blob/master/spec/bidi/bidi_spec.rb |
| 54 | 55 |
| 55 // NOTE: None of this file is currently written to be thread-safe. | 56 // NOTE: None of this file is currently written to be thread-safe. |
| (...skipping 202 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 258 if (paragraphDirectionMask & DirectionRTL) | 259 if (paragraphDirectionMask & DirectionRTL) |
| 259 m_runner.runTest(testString, reorder, levels, DirectionRTL, | 260 m_runner.runTest(testString, reorder, levels, DirectionRTL, |
| 260 originalLine, lineNumber); | 261 originalLine, lineNumber); |
| 261 } | 262 } |
| 262 } | 263 } |
| 263 } | 264 } |
| 264 | 265 |
| 265 } // namespace bidi_test | 266 } // namespace bidi_test |
| 266 | 267 |
| 267 #endif // BidiTestHarness_h | 268 #endif // BidiTestHarness_h |
| OLD | NEW |