var searchIndex = {};
searchIndex["unicode_bidi"] = {"doc":"This crate implements the [Unicode Bidirectional Algorithm][tr9] for display of mixed\nright-to-left and left-to-right text.  It is written in safe Rust, compatible with Rust 1.0 and\nlater.","items":[[3,"ParagraphInfo","unicode_bidi","Output of `process_paragraph`",null,null],[12,"classes","","The BidiClass of the character at each byte in the paragraph.",0,null],[12,"levels","","The directional embedding level of each byte in the paragraph.",0,null],[12,"para_level","","The paragraph embedding level.",0,null],[12,"max_level","","The highest embedding level in the paragraph. (Can be used for optimizations.)",0,null],[3,"InitialProperties","","Output of `initial_scan`",null,null],[12,"para_level","","The paragraph embedding level.",1,null],[12,"initial_classes","","The BidiClass of the character at each byte in the paragraph.\nIf a character is multiple bytes, its class will appear multiple times in the vector.",1,null],[5,"process_paragraph","","Determine the bidirectional embedding levels for a single paragraph.",null,{"inputs":[{"name":"str"},{"name":"option"}],"output":{"name":"paragraphinfo"}}],[5,"is_ltr","","Even embedding levels are left-to-right.",null,{"inputs":[{"name":"u8"}],"output":{"name":"bool"}}],[5,"is_rtl","","Odd levels are right-to-left.",null,{"inputs":[{"name":"u8"}],"output":{"name":"bool"}}],[5,"reorder_line","","Re-order a line based on resolved levels.",null,{"inputs":[{"name":"str"},{"name":"range"},{"name":"paragraphinfo"}],"output":{"name":"cow"}}],[5,"visual_runs","","Find the level runs within a line and return them in visual order.",null,null],[5,"initial_scan","","Find the paragraph embedding level, and the BidiClass for each character.",null,{"inputs":[{"name":"str"},{"name":"option"}],"output":{"name":"initialproperties"}}],[0,"tables","","",null,null],[4,"BidiClass","unicode_bidi::tables","Represents the Unicode character property **Bidi_Class**, also known as\nthe *bidirectional character type*.",null,null],[13,"AL","","",2,null],[13,"AN","","",2,null],[13,"B","","",2,null],[13,"BN","","",2,null],[13,"CS","","",2,null],[13,"EN","","",2,null],[13,"ES","","",2,null],[13,"ET","","",2,null],[13,"FSI","","",2,null],[13,"L","","",2,null],[13,"LRE","","",2,null],[13,"LRI","","",2,null],[13,"LRO","","",2,null],[13,"NSM","","",2,null],[13,"ON","","",2,null],[13,"PDF","","",2,null],[13,"PDI","","",2,null],[13,"R","","",2,null],[13,"RLE","","",2,null],[13,"RLI","","",2,null],[13,"RLO","","",2,null],[13,"S","","",2,null],[13,"WS","","",2,null],[5,"bidi_class","","Find the BidiClass of a single char.",null,{"inputs":[{"name":"char"}],"output":{"name":"bidiclass"}}],[17,"UNICODE_VERSION","","The version of [Unicode](http://www.unicode.org/)\nthat the `bidi_class` function is based on.",null,null],[11,"eq","","",2,null],[11,"fmt","","",2,null],[11,"clone","","",2,null],[6,"LevelRun","unicode_bidi","A maximal substring of characters with the same embedding level.",null,null],[11,"eq","","",0,null],[11,"ne","","",0,null],[11,"fmt","","",0,null],[11,"fmt","","",1,null],[11,"eq","","",1,null],[11,"ne","","",1,null]],"paths":[[3,"ParagraphInfo"],[3,"InitialProperties"],[4,"BidiClass"]]};
initSearch(searchIndex);