现代化扁平UI c++20写法

# BidiTest-14.0.0.txt # Date: 2021-03-08, 19:35:40 GMT # © 2021 Unicode®, Inc. # Unicode and the Unicode Logo are registered trademarks of Unicode, Inc. in the U.S. and other countries. # For terms of use, see http://www.unicode.org/terms_of_use.html # # Unicode Character Database # For documentation, see http://www.unicode.org/reports/tr44/ # # This file provides a conformance test for UBA (Unicode Bidi Algorithm) implementations. # It is designed to be reasonably compact, and yet provide a thorough test of all cases up to # a given limit (currently 4). Additionally, it contains some longer cases useful for testing # some common pitfalls of UBA implementations. # # Note that for the test cases in this file, it is assumed that no bidi # paired brackets exist in the input that would affect the resolved levels # or reordering. For test cases with bidi paired brackets and other # character-code specific test cases, refer to BidiCharacterTest.txt. # Implementations are expected to correctly cover all test cases in both # test files. # # The test cases in this file are further limited in the following ways: # # - The Bidi_Class B (Paragraph_Separator) only appears as the last # character in a sequence. Thus, each sequence is assumed to consist of # only one paragraph. Implementations may need extra testing for rule P1 # of the UBA. # # - For the application of rules L1 and L2, it is assumed that all the # characters in the input would be rendered on a single line, with no line # breaks. # # - Implementation of rules L3 and L4 is platform- and character-specific # and test cases for it are not provided in this data file. # # # Format: # # All tokens may be separated by whitespaces (space or tab). There are three kinds of lines: # Levels, Reorder, and data. # # A Levels line indicates that all following data lines, up to the next Levels line, # have the same resulting ordering levels. It has the following format: # # @Levels: <levels> # # <levels> = An ordered space-delimited list of numbers indicating the resulting levels # for each input property value. The UBA does not assign levels to certain values; # those are indicated with an x. See the note below. # Examples: # @Levels: 1 0 # @Levels: x 1 x 2 # # A Reorder line indicates that all following data lines, up to the next Reorder line, # have the same resulting reordering. It has the following format: # # @Reorder: <ordering> # # <ordering> = An ordered space-delimited list of numbers indicating the resulting # visual ordering from left to right. The numbers are zero-based, and # are indexes into the input string. Items with a level of x are skipped. # Thus "1 0" indicates what would happen with input of "L R" and an RTL # paragraph direction. # Example: # @Reorder: 1 0 # @Reorder: 3 1 # # A data line has the following format: # <input> ; <bitset> # <input> = An ordered list of BIDI property values # <bitset> = A hex bitset for paragraph levels (P): 1 = auto-LTR, 2 = LTR, 4 = RTL # Auto-LTR (standard BIDI) uses the first L/R/AL character, and is LTR if none is found. # Example: # L LRE R R; 7 # L LRE R AL; 7 # # Any other line starting with @ is to be ignored (this allows some degree of forward compatibility). # # Usage: # # - If the implementation API allows a list of bidi property values as input: # # For each of the paragraph levels in the bitset: # Find the levels in each line, and compare that to the last @Levels values. # If they are different, the test fails. # Reorder the elements, and compare to the @Reorder values. # If they are different, the test fails. # # - If the implementation allows for a character string as input, # randomly pick characters from those with the same Bidi_Class values, # and test the reordering as above. # # Note that the UBA doesn't specify the output level or order of certain characters, # such as LRO. These are omitted from the reordered output. Thus the following two # input lines have the same result (0), since the LRE (item 1) is omitted on the second line. # # L; 7 # L LRE; 7 # @Levels: x @Reorder: LRE; 7 LRO; 7 RLE; 7 RLO; 7 PDF; 7 BN; 7 #Count: 6 @Levels: 0 @Reorder: 0 L; 3 EN; 3 ES; 3 ET; 3 CS; 3 NSM; 3 B; 3 S; 3 WS; 3 ON; 3 LRI; 3 RLI; 3 FSI; 3 PDI; 3 #Count: 14 @Levels: 1 @Reorder: 0 R; 7 AL; 7 ES; 4 ET; 4 CS; 4 NSM; 4 B; 4 S; 4 WS; 4 ON; 4 LRI; 4 RLI; 4 FSI; 4 PDI; 4 #Count: 14 @Levels: 2 @Reorder: 0 L; 4 EN; 4 AN; 7 #Count: 3 @Levels: x x @Reorder: LRE LRE; 7 LRE LRO; 7 LRE RLE; 7 LRE RLO; 7 LRE PDF; 7 LRE BN; 7 LRO LRE; 7 LRO LRO; 7 LRO RLE; 7 LRO RLO; 7 LRO PDF; 7 LRO BN; 7 RLE LRE; 7 RLE LRO; 7 RLE RLE; 7 RLE RLO; 7 RLE PDF; 7 RLE BN; 7 RLO LRE; 7 RLO LRO; 7 RLO RLE; 7 RLO RLO; 7 RLO PDF; 7 RLO BN; 7 PDF LRE; 7 PDF LRO; 7 PDF RLE; 7 PDF RLO; 7 PDF PDF; 7 PDF BN; 7 BN LRE; 7 BN LRO; 7 BN RLE; 7 BN RLO; 7 BN PDF; 7 BN BN; 7 #Count: 36 @Levels: 0 x @Reorder: 0 L LRE; 3 L LRO; 3 L RLE; 3 L RLO; 3 L PDF; 3 L BN; 3 EN LRE; 3 EN LRO; 3 EN RLE; 3 EN RLO; 3 EN PDF; 3 EN BN; 3 ES LRE; 3 ES LRO; 3 ES RLE; 3 ES RLO; 3 ES PDF; 3 ES BN; 3 ET LRE; 3 ET LRO; 3 ET RLE; 3 ET RLO; 3 ET PDF; 3 ET BN; 3 CS LRE; 3 CS LRO; 3 CS RLE; 3 CS RLO; 3 CS PDF; 3 CS BN; 3 NSM LRE; 3 NSM LRO; 3 NSM RLE; 3 NSM RLO; 3 NSM PDF; 3 NSM BN; 3 S LRE; 3 S LRO; 3 S RLE; 3 S RLO; 3 S PDF; 3 S BN; 3 WS LRE; 3 WS LRO; 3 WS RLE; 3 WS RLO; 3 WS PDF; 3 WS BN; 3 ON LRE; 3 ON LRO; 3 ON RLE; 3 ON RLO; 3 ON PDF; 3 ON BN; 3 LRI LRE; 3 LRI LRO; 3 LRI RLE; 3 LRI RLO; 3 LRI PDF; 3 LRI BN; 3 RLI LRE; 3 RLI LRO; 3 RLI RLE; 3 RLI RLO; 3 RLI PDF; 3 RLI BN; 3 FSI LRE; 3 FSI LRO; 3 FSI RLE; 3 FSI RLO; 3 FSI PDF; 3 FSI BN; 3 PDI LRE; 3 PDI LRO; 3 PDI RLE; 3 PDI RLO; 3 PDI PDF; 3 PDI BN; 3 #Count: 78 @Levels: 1 x @Reorder: 0 R LRE; 7 R LRO; 7 R RLE; 7 R RLO; 7 R PDF; 7 R BN; 7 AL LRE; 7 AL LRO; 7 AL RLE; 7 AL RLO; 7 AL PDF; 7 AL BN; 7 ES LRE; 4 ES LRO; 4 ES RLE; 4 ES RLO; 4 ES PDF; 4 ES BN; 4 ET LRE; 4 ET LRO; 4 ET RLE; 4 ET RLO; 4 ET PDF; 4 ET BN; 4 CS LRE; 4 CS LRO; 4 CS RLE; 4 CS RLO; 4 CS PDF; 4 CS BN; 4 NSM LRE; 4 NSM LRO; 4 NSM RLE; 4 NSM RLO; 4 NSM PDF; 4 NSM BN; 4 S LRE; 4 S LRO; 4 S RLE; 4 S RLO; 4 S PDF; 4 S BN; 4 WS LRE; 4 WS LRO; 4 WS RLE; 4 WS RLO; 4 WS PDF; 4 WS BN; 4 ON LRE; 4 ON LRO; 4 ON RLE; 4 ON RLO; 4 ON PDF; 4 ON BN; 4 LRI LRE; 4 LRI LRO; 4 LRI RLE; 4 LRI RLO; 4 LRI PDF; 4 LRI BN; 4 RLI LRE; 4 RLI LRO; 4 RLI RLE; 4 RLI RLO; 4 RLI PDF; 4 RLI BN; 4 FSI LRE; 4 FSI LRO; 4 FSI RLE; 4 FSI RLO; 4 FSI PDF; 4 FSI BN; 4 PDI LRE; 4 PDI LRO; 4 PDI RLE; 4 PDI RLO; 4 PDI PDF; 4 PDI BN; 4 #Count: 78 @Levels: 2 x @Reorder: 0 L LRE; 4 L LRO; 4 L RLE; 4 L RLO; 4 L PDF; 4 L BN; 4 EN LRE; 4 EN LRO; 4 EN RLE; 4 EN RLO; 4 EN PDF; 4 EN BN; 4 AN LRE; 7 AN LRO; 7 AN RLE; 7 AN RLO; 7 AN PDF; 7 AN BN; 7 #Count: 18 @Levels: x 0 @Reorder: 1 LRE B; 3 LRE S; 3 LRE WS; 3 LRE LRI; 3 LRE RLI; 3 LRE FSI; 3 LRE PDI; 3 LRO B; 3 LRO S; 3 LRO WS; 3 LRO LRI; 3 LRO RLI; 3 LRO FSI; 3 LRO PDI; 3 RLE B; 3 RLE S; 3 RLE WS; 3 RLE LRI; 3 RLE RLI; 3 RLE FSI; 3 RLE PDI; 3 RLO B; 3 RLO S; 3 RLO WS; 3 RLO LRI; 3 RLO RLI; 3 RLO FSI; 3 RLO PDI; 3 PDF L; 3 PDF EN; 3 PDF ES; 3 PDF ET; 3 PDF CS; 3 PDF NSM; 3 PDF B; 3 PDF S; 3 PDF WS; 3 PDF ON; 3 PDF LRI; 3 PDF RLI; 3 PDF FSI; 3 PDF PDI; 3 BN L; 3 BN EN; 3 BN ES; 3 BN ET; 3 BN CS; 3 BN NSM; 3 BN B; 3 BN S; 3 BN WS; 3 BN ON; 3 BN LRI; 3 BN RLI; 3 BN FSI; 3 BN PDI; 3 #Count: 56 @Levels: x 1 @Reorder: 1 LRE B; 4 LRE S; 4 LRE WS; 4 LRE LRI; 4 LRE RLI; 4 LRE FSI; 4 LRE PDI; 4 LRO B; 4 LRO S; 4 LRO WS; 4 LRO LRI; 4 LRO RLI; 4 LRO FSI; 4 LRO PDI; 4 RLE R; 2 RLE AL; 2 RLE ES; 3 RLE ET; 3 RLE CS; 3 RLE NSM; 3 RLE B; 4 RLE S; 4 RLE WS; 4 RLE ON; 3 RLE LRI; 4 RLE RLI; 4 RLE FSI; 4 RLE PDI; 4 RLO L; 3 RLO R; 2 RLO AL; 2 RLO EN; 3 RLO ES; 3 RLO ET; 3 RLO AN; 3 RLO CS; 3 RLO NSM; 3 RLO B; 4 RLO S; 4 RLO WS; 4 RLO ON; 3 RLO LRI; 4 RLO RLI; 4 RLO FSI; 4 RLO PDI; 4 PDF R; 7 PDF