1// Copyright 2012-2015 The Rust Project Developers. See the COPYRIGHT
2// file at the top-level directory of this distribution and at
3// http://rust-lang.org/COPYRIGHT.
4//
5// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8// option. This file may not be copied, modified, or distributed
9// except according to those terms.
10use core::{
11 fmt::{self, Write},
12 iter::FusedIterator,
13};
14use tinyvec::ArrayVec;
1516/// External iterator for replacements for a string's characters.
17#[derive(Clone)]
18pub struct Replacements<I> {
19 iter: I,
20// At this time, the longest replacement sequence has length 2, so we just
21 // need buffer space for 1 codepoint.
22buffer: Option<char>,
23}
2425#[inline]
26pub fn new_cjk_compat_variants<I: Iterator<Item = char>>(iter: I) -> Replacements<I> {
27 Replacements { iter, buffer: None }
28}
2930impl<I: Iterator<Item = char>> Iterator for Replacements<I> {
31type Item = char;
3233#[inline]
34fn next(&mut self) -> Option<char> {
35if let Some(c) = self.buffer.take() {
36return Some(c);
37 }
3839match self.iter.next() {
40Some(ch) => {
41// At this time, the longest replacement sequence has length 2.
42let mut buffer = ArrayVec::<[char; 2]>::new();
43super::char::decompose_cjk_compat_variants(ch, |d| buffer.push(d));
44self.buffer = buffer.get(1).copied();
45Some(buffer[0])
46 }
47None => None,
48 }
49 }
5051fn size_hint(&self) -> (usize, Option<usize>) {
52let (lower, _) = self.iter.size_hint();
53 (lower, None)
54 }
55}
5657impl<I: Iterator<Item = char> + FusedIterator> FusedIterator for Replacements<I> {}
5859impl<I: Iterator<Item = char> + Clone> fmt::Display for Replacements<I> {
60fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
61for c in self.clone() {
62 f.write_char(c)?;
63 }
64Ok(())
65 }
66}