| <!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="Source of the Rust file `/root/.cargo/registry/src/github.com-1ecc6299db9ec823/unicode-normalization-0.1.22/src/decompose.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>decompose.rs - source</title><link rel="preload" as="font" type="font/woff2" crossorigin href="../../SourceSerif4-Regular.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../FiraSans-Regular.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../FiraSans-Medium.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../SourceCodePro-Regular.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../SourceSerif4-Bold.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../SourceCodePro-Semibold.ttf.woff2"><link rel="stylesheet" href="../../normalize.css"><link rel="stylesheet" href="../../rustdoc.css" id="mainThemeStyle"><link rel="stylesheet" href="../../ayu.css" disabled><link rel="stylesheet" href="../../dark.css" disabled><link rel="stylesheet" href="../../light.css" id="themeStyle"><script id="default-settings" ></script><script src="../../storage.js"></script><script defer src="../../source-script.js"></script><script defer src="../../source-files.js"></script><script defer src="../../main.js"></script><noscript><link rel="stylesheet" href="../../noscript.css"></noscript><link rel="icon" href="https://unicode-rs.github.io/unicode-rs_sm.png"></head><body class="rustdoc source"><!--[if lte IE 11]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><nav class="sidebar"><a class="sidebar-logo" href="../../unicode_normalization/index.html"><div class="logo-container"> |
| <img src="https://unicode-rs.github.io/unicode-rs_sm.png" alt="logo"></div></a></nav><main><div class="width-limiter"><nav class="sub"><a class="sub-logo-container" href="../../unicode_normalization/index.html"> |
| <img src="https://unicode-rs.github.io/unicode-rs_sm.png" alt="logo"></a><form class="search-form"><div class="search-container"><span></span><input class="search-input" name="search" autocomplete="off" spellcheck="false" placeholder="Click or press ‘S’ to search, ‘?’ for more options…" type="search"><div id="help-button" title="help" tabindex="-1"><a href="../../help.html">?</a></div><div id="settings-menu" tabindex="-1"><a href="../../settings.html" title="settings"><img width="22" height="22" alt="Change settings" src="../../wheel.svg"></a></div></div></form></nav><section id="main-content" class="content"><div class="example-wrap"><pre class="src-line-numbers"><span id="1">1</span> |
| <span id="2">2</span> |
| <span id="3">3</span> |
| <span id="4">4</span> |
| <span id="5">5</span> |
| <span id="6">6</span> |
| <span id="7">7</span> |
| <span id="8">8</span> |
| <span id="9">9</span> |
| <span id="10">10</span> |
| <span id="11">11</span> |
| <span id="12">12</span> |
| <span id="13">13</span> |
| <span id="14">14</span> |
| <span id="15">15</span> |
| <span id="16">16</span> |
| <span id="17">17</span> |
| <span id="18">18</span> |
| <span id="19">19</span> |
| <span id="20">20</span> |
| <span id="21">21</span> |
| <span id="22">22</span> |
| <span id="23">23</span> |
| <span id="24">24</span> |
| <span id="25">25</span> |
| <span id="26">26</span> |
| <span id="27">27</span> |
| <span id="28">28</span> |
| <span id="29">29</span> |
| <span id="30">30</span> |
| <span id="31">31</span> |
| <span id="32">32</span> |
| <span id="33">33</span> |
| <span id="34">34</span> |
| <span id="35">35</span> |
| <span id="36">36</span> |
| <span id="37">37</span> |
| <span id="38">38</span> |
| <span id="39">39</span> |
| <span id="40">40</span> |
| <span id="41">41</span> |
| <span id="42">42</span> |
| <span id="43">43</span> |
| <span id="44">44</span> |
| <span id="45">45</span> |
| <span id="46">46</span> |
| <span id="47">47</span> |
| <span id="48">48</span> |
| <span id="49">49</span> |
| <span id="50">50</span> |
| <span id="51">51</span> |
| <span id="52">52</span> |
| <span id="53">53</span> |
| <span id="54">54</span> |
| <span id="55">55</span> |
| <span id="56">56</span> |
| <span id="57">57</span> |
| <span id="58">58</span> |
| <span id="59">59</span> |
| <span id="60">60</span> |
| <span id="61">61</span> |
| <span id="62">62</span> |
| <span id="63">63</span> |
| <span id="64">64</span> |
| <span id="65">65</span> |
| <span id="66">66</span> |
| <span id="67">67</span> |
| <span id="68">68</span> |
| <span id="69">69</span> |
| <span id="70">70</span> |
| <span id="71">71</span> |
| <span id="72">72</span> |
| <span id="73">73</span> |
| <span id="74">74</span> |
| <span id="75">75</span> |
| <span id="76">76</span> |
| <span id="77">77</span> |
| <span id="78">78</span> |
| <span id="79">79</span> |
| <span id="80">80</span> |
| <span id="81">81</span> |
| <span id="82">82</span> |
| <span id="83">83</span> |
| <span id="84">84</span> |
| <span id="85">85</span> |
| <span id="86">86</span> |
| <span id="87">87</span> |
| <span id="88">88</span> |
| <span id="89">89</span> |
| <span id="90">90</span> |
| <span id="91">91</span> |
| <span id="92">92</span> |
| <span id="93">93</span> |
| <span id="94">94</span> |
| <span id="95">95</span> |
| <span id="96">96</span> |
| <span id="97">97</span> |
| <span id="98">98</span> |
| <span id="99">99</span> |
| <span id="100">100</span> |
| <span id="101">101</span> |
| <span id="102">102</span> |
| <span id="103">103</span> |
| <span id="104">104</span> |
| <span id="105">105</span> |
| <span id="106">106</span> |
| <span id="107">107</span> |
| <span id="108">108</span> |
| <span id="109">109</span> |
| <span id="110">110</span> |
| <span id="111">111</span> |
| <span id="112">112</span> |
| <span id="113">113</span> |
| <span id="114">114</span> |
| <span id="115">115</span> |
| <span id="116">116</span> |
| <span id="117">117</span> |
| <span id="118">118</span> |
| <span id="119">119</span> |
| <span id="120">120</span> |
| <span id="121">121</span> |
| <span id="122">122</span> |
| <span id="123">123</span> |
| <span id="124">124</span> |
| <span id="125">125</span> |
| <span id="126">126</span> |
| <span id="127">127</span> |
| <span id="128">128</span> |
| <span id="129">129</span> |
| <span id="130">130</span> |
| <span id="131">131</span> |
| <span id="132">132</span> |
| <span id="133">133</span> |
| <span id="134">134</span> |
| <span id="135">135</span> |
| <span id="136">136</span> |
| <span id="137">137</span> |
| <span id="138">138</span> |
| <span id="139">139</span> |
| <span id="140">140</span> |
| <span id="141">141</span> |
| <span id="142">142</span> |
| <span id="143">143</span> |
| <span id="144">144</span> |
| <span id="145">145</span> |
| <span id="146">146</span> |
| <span id="147">147</span> |
| <span id="148">148</span> |
| <span id="149">149</span> |
| <span id="150">150</span> |
| <span id="151">151</span> |
| <span id="152">152</span> |
| <span id="153">153</span> |
| <span id="154">154</span> |
| <span id="155">155</span> |
| <span id="156">156</span> |
| <span id="157">157</span> |
| <span id="158">158</span> |
| <span id="159">159</span> |
| <span id="160">160</span> |
| <span id="161">161</span> |
| </pre><pre class="rust"><code><span class="comment">// Copyright 2012-2015 The Rust Project Developers. See the COPYRIGHT |
| // file at the top-level directory of this distribution and at |
| // http://rust-lang.org/COPYRIGHT. |
| // |
| // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or |
| // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license |
| // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your |
| // option. This file may not be copied, modified, or distributed |
| // except according to those terms. |
| </span><span class="kw">use </span>core::fmt::{<span class="self">self</span>, Write}; |
| <span class="kw">use </span>core::iter::Fuse; |
| <span class="kw">use </span>core::ops::Range; |
| <span class="kw">use </span>tinyvec::TinyVec; |
| |
| <span class="attribute">#[derive(Clone)] |
| </span><span class="kw">enum </span>DecompositionType { |
| Canonical, |
| Compatible, |
| } |
| |
| <span class="doccomment">/// External iterator for a string decomposition's characters. |
| </span><span class="attribute">#[derive(Clone)] |
| </span><span class="kw">pub struct </span>Decompositions<I> { |
| kind: DecompositionType, |
| iter: Fuse<I>, |
| |
| <span class="comment">// This buffer stores pairs of (canonical combining class, character), |
| // pushed onto the end in text order. |
| // |
| // It's divided into up to three sections: |
| // 1) A prefix that is free space; |
| // 2) "Ready" characters which are sorted and ready to emit on demand; |
| // 3) A "pending" block which stills needs more characters for us to be able |
| // to sort in canonical order and is not safe to emit. |
| </span>buffer: TinyVec<[(u8, char); <span class="number">4</span>]>, |
| ready: Range<usize>, |
| } |
| |
| <span class="attribute">#[inline] |
| </span><span class="kw">pub fn </span>new_canonical<I: Iterator<Item = char>>(iter: I) -> Decompositions<I> { |
| Decompositions { |
| kind: <span class="self">self</span>::DecompositionType::Canonical, |
| iter: iter.fuse(), |
| buffer: TinyVec::new(), |
| ready: <span class="number">0</span>..<span class="number">0</span>, |
| } |
| } |
| |
| <span class="attribute">#[inline] |
| </span><span class="kw">pub fn </span>new_compatible<I: Iterator<Item = char>>(iter: I) -> Decompositions<I> { |
| Decompositions { |
| kind: <span class="self">self</span>::DecompositionType::Compatible, |
| iter: iter.fuse(), |
| buffer: TinyVec::new(), |
| ready: <span class="number">0</span>..<span class="number">0</span>, |
| } |
| } |
| |
| <span class="kw">impl</span><I> Decompositions<I> { |
| <span class="attribute">#[inline] |
| </span><span class="kw">fn </span>push_back(<span class="kw-2">&mut </span><span class="self">self</span>, ch: char) { |
| <span class="kw">let </span>class = <span class="kw">super</span>::char::canonical_combining_class(ch); |
| |
| <span class="kw">if </span>class == <span class="number">0 </span>{ |
| <span class="self">self</span>.sort_pending(); |
| <span class="self">self</span>.buffer.push((class, ch)); |
| <span class="self">self</span>.ready.end = <span class="self">self</span>.buffer.len(); |
| } <span class="kw">else </span>{ |
| <span class="self">self</span>.buffer.push((class, ch)); |
| } |
| } |
| |
| <span class="attribute">#[inline] |
| </span><span class="kw">fn </span>sort_pending(<span class="kw-2">&mut </span><span class="self">self</span>) { |
| <span class="comment">// NB: `sort_by_key` is stable, so it will preserve the original text's |
| // order within a combining class. |
| </span><span class="self">self</span>.buffer[<span class="self">self</span>.ready.end..].sort_by_key(|k| k.<span class="number">0</span>); |
| } |
| |
| <span class="attribute">#[inline] |
| </span><span class="kw">fn </span>reset_buffer(<span class="kw-2">&mut </span><span class="self">self</span>) { |
| <span class="comment">// Equivalent to `self.buffer.drain(0..self.ready.end)` |
| // but faster than drain() if the buffer is a SmallVec or TinyVec |
| </span><span class="kw">let </span>pending = <span class="self">self</span>.buffer.len() - <span class="self">self</span>.ready.end; |
| <span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..pending { |
| <span class="self">self</span>.buffer[i] = <span class="self">self</span>.buffer[i + <span class="self">self</span>.ready.end]; |
| } |
| <span class="self">self</span>.buffer.truncate(pending); |
| <span class="self">self</span>.ready = <span class="number">0</span>..<span class="number">0</span>; |
| } |
| |
| <span class="attribute">#[inline] |
| </span><span class="kw">fn </span>increment_next_ready(<span class="kw-2">&mut </span><span class="self">self</span>) { |
| <span class="kw">let </span>next = <span class="self">self</span>.ready.start + <span class="number">1</span>; |
| <span class="kw">if </span>next == <span class="self">self</span>.ready.end { |
| <span class="self">self</span>.reset_buffer(); |
| } <span class="kw">else </span>{ |
| <span class="self">self</span>.ready.start = next; |
| } |
| } |
| } |
| |
| <span class="kw">impl</span><I: Iterator<Item = char>> Iterator <span class="kw">for </span>Decompositions<I> { |
| <span class="kw">type </span>Item = char; |
| |
| <span class="attribute">#[inline] |
| </span><span class="kw">fn </span>next(<span class="kw-2">&mut </span><span class="self">self</span>) -> <span class="prelude-ty">Option</span><char> { |
| <span class="kw">while </span><span class="self">self</span>.ready.end == <span class="number">0 </span>{ |
| <span class="kw">match </span>(<span class="self">self</span>.iter.next(), <span class="kw-2">&</span><span class="self">self</span>.kind) { |
| (<span class="prelude-val">Some</span>(ch), <span class="kw-2">&</span>DecompositionType::Canonical) => { |
| <span class="kw">super</span>::char::decompose_canonical(ch, |d| <span class="self">self</span>.push_back(d)); |
| } |
| (<span class="prelude-val">Some</span>(ch), <span class="kw-2">&</span>DecompositionType::Compatible) => { |
| <span class="kw">super</span>::char::decompose_compatible(ch, |d| <span class="self">self</span>.push_back(d)); |
| } |
| (<span class="prelude-val">None</span>, <span class="kw">_</span>) => { |
| <span class="kw">if </span><span class="self">self</span>.buffer.is_empty() { |
| <span class="kw">return </span><span class="prelude-val">None</span>; |
| } <span class="kw">else </span>{ |
| <span class="self">self</span>.sort_pending(); |
| <span class="self">self</span>.ready.end = <span class="self">self</span>.buffer.len(); |
| |
| <span class="comment">// This implementation means that we can call `next` |
| // on an exhausted iterator; the last outer `next` call |
| // will result in an inner `next` call. To make this |
| // safe, we use `fuse`. |
| </span><span class="kw">break</span>; |
| } |
| } |
| } |
| } |
| |
| <span class="comment">// We can assume here that, if `self.ready.end` is greater than zero, |
| // it's also greater than `self.ready.start`. That's because we only |
| // increment `self.ready.start` inside `increment_next_ready`, and |
| // whenever it reaches equality with `self.ready.end`, we reset both |
| // to zero, maintaining the invariant that: |
| // self.ready.start < self.ready.end || self.ready.end == self.ready.start == 0 |
| // |
| // This less-than-obviously-safe implementation is chosen for performance, |
| // minimizing the number & complexity of branches in `next` in the common |
| // case of buffering then unbuffering a single character with each call. |
| </span><span class="kw">let </span>(<span class="kw">_</span>, ch) = <span class="self">self</span>.buffer[<span class="self">self</span>.ready.start]; |
| <span class="self">self</span>.increment_next_ready(); |
| <span class="prelude-val">Some</span>(ch) |
| } |
| |
| <span class="kw">fn </span>size_hint(<span class="kw-2">&</span><span class="self">self</span>) -> (usize, <span class="prelude-ty">Option</span><usize>) { |
| <span class="kw">let </span>(lower, <span class="kw">_</span>) = <span class="self">self</span>.iter.size_hint(); |
| (lower, <span class="prelude-val">None</span>) |
| } |
| } |
| |
| <span class="kw">impl</span><I: Iterator<Item = char> + Clone> fmt::Display <span class="kw">for </span>Decompositions<I> { |
| <span class="kw">fn </span>fmt(<span class="kw-2">&</span><span class="self">self</span>, f: <span class="kw-2">&mut </span>fmt::Formatter) -> fmt::Result { |
| <span class="kw">for </span>c <span class="kw">in </span><span class="self">self</span>.clone() { |
| f.write_char(c)<span class="question-mark">?</span>; |
| } |
| <span class="prelude-val">Ok</span>(()) |
| } |
| } |
| </code></pre></div> |
| </section></div></main><div id="rustdoc-vars" data-root-path="../../" data-current-crate="unicode_normalization" data-themes="ayu,dark,light" data-resource-suffix="" data-rustdoc-version="1.66.0-nightly (5c8bff74b 2022-10-21)" ></div></body></html> |
