1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829
// Copyright 2020 Google LLC
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
//! # ICU text boundary analysis support for Rust
//!
//! This crate provides a Rust implementation of the ICU text boundary analysis APIs
//! in `ubrk.h`. Character (grapheme cluster), word, line-break, and sentence iterators
//! are available.
//!
//! ## Examples
//!
//! Sample code use is given below.
//!
//! ```rust
//! use rust_icu_sys as sys;
//! use rust_icu_ubrk as ubrk;
//!
//! let text = "The lazy dog jumped over the fox.";
//! let mut iter =
//! ubrk::UBreakIterator::try_new(sys::UBreakIteratorType::UBRK_WORD, "en", text)
//! .unwrap();
//!
//! assert!(iter.is_boundary(0));
//! assert_eq!(0, iter.first());
//! assert_eq!(None, iter.previous());
//! assert_eq!(0, iter.current());
//!
//! let text_len = text.len() as i32;
//! assert!(iter.is_boundary(text_len));
//! assert_eq!(iter.last_boundary(), text_len);
//! assert_eq!(None, iter.next());
//! assert_eq!(iter.current(), text_len);
//!
//! let word_start = text.find("jumped").unwrap() as i32;
//! let word_end = word_start + 6;
//! assert!(iter.is_boundary(word_start));
//! assert!(iter.is_boundary(word_end));
//! assert!(!iter.is_boundary(word_start + 3));
//! assert_eq!(word_end, iter.following(word_start + 3));
//! assert_eq!(word_end, iter.current());
//! assert_eq!(Some(word_start), iter.previous());
//! assert_eq!(word_start, iter.current());
//! assert_eq!(Some(word_end), iter.next());
//! assert_eq!(word_end, iter.current());
//! assert_eq!(word_start, iter.preceding(word_start + 3));
//! assert_eq!(word_start, iter.current());
//!
//! // Reset to first boundary and consume `iter`.
//! iter.first();
//! let boundaries: Vec<i32> = iter.collect();
//! assert_eq!(vec![3, 4, 8, 9, 12, 13, 19, 20, 24, 25, 28, 29, 32, 33], boundaries);
//! ```
//!
//! See the [ICU user guide](https://unicode-org.github.io/icu/userguide/boundaryanalysis/)
//! and the C API documentation in the
//! [`ubrk.h` header](https://unicode-org.github.io/icu-docs/apidoc/released/icu4c/ubrk_8h.html)
//! for details.
use {
rust_icu_common::{self as common, simple_drop_impl},
rust_icu_sys::{self as sys, *},
rust_icu_uloc as uloc, rust_icu_ustring as ustring,
std::{convert::TryFrom, ffi, os::raw, ptr, rc::Rc},
};
/// Returned by break iterator to indicate that all text boundaries have been returned.
// UBRK_DONE is defined as a macro in ICU and macros are not currently supported
// by bindgen, so we define it ourselves here.
pub const UBRK_DONE: i32 = -1;
/// Rust wrapper for the ICU `UBreakIterator` type.
pub struct UBreakIterator {
// Pointer to the underlying ICU representation.
rep: ptr::NonNull<sys::UBreakIterator>,
// The underlying C representation holds pointers to `text` and exactly one of
// {`locale`, `rules`, `binary_rules`} throughout its lifetime. We are
// responsible for ensuring that the pointers remain valid during that time,
// and for dropping the referenced values once the underlying C representation
// is released.
//
// A break iterator may be cloned, in which case the underlying C representation
// of the cloned iterator will hold pointers to the values pointed to by the
// original iterator, while maintaining its own internal iteration state.
//
// For these reasons, these fields are wrapped in `Rc`, ensuring that the
// referenced values (`text`, `locale`, etc.) are not released prematurely
// if the original break iterator is dropped before its clone. As break
// iterators are inherently not thread-safe [1], `Rc` was chosen over `Arc`.
//
// [1] https://unicode-org.github.io/icu/userguide/boundaryanalysis/#thread-safety
text: Rc<ustring::UChar>,
locale: Option<Rc<ffi::CString>>,
rules: Option<Rc<ustring::UChar>>,
binary_rules: Option<Rc<Vec<u8>>>,
}
// Implements `ubrk_close`.
simple_drop_impl!(UBreakIterator, ubrk_close);
impl Iterator for UBreakIterator {
type Item = i32;
/// Advances the break iterator's position to the next boundary after its
/// current position.
///
/// Note that `ubrk_next` will _never_ return the first boundary. For example,
/// given a newly-initialized break iterator whose internal position is `0`,
/// the first invocation of `next` will return the _next_ boundary, not `0`.
/// If the caller requires the first boundary, it should utilize [`first`].
///
/// Also note that interleaving calls to [`first`], [`last_boundary`], [`previous`],
/// [`preceding`], or [`following`] may change the break iterator's internal
/// position, thereby affecting the next value returned by `next`.
///
/// Implements `ubrk_next`.
///
/// [`first`]: #method.first
/// [`following`]: #method.following
/// [`last_boundary`]: #method.last_boundary
/// [`preceding`]: #method.preceding
/// [`previous`]: #method.previous
fn next(&mut self) -> Option<Self::Item> {
let index = unsafe { versioned_function!(ubrk_next)(self.rep.as_ptr()) };
if index == UBRK_DONE {
None
} else {
Some(index)
}
}
}
impl UBreakIterator {
/// Returns an iterator over the locales for which text breaking information
/// is available.
///
/// Implements `ubrk_countAvailable`.
pub fn available_locales() -> Locales {
Locales {
index: 0,
upper: unsafe { versioned_function!(ubrk_countAvailable)() },
}
}
/// Creates a new break iterator with the specified type (character, word,
/// line, or sentence) in the specified locale over `text`.
///
/// Implements `ubrk_open`.
pub fn try_new(
type_: sys::UBreakIteratorType,
locale: &str,
text: &str,
) -> Result<Self, common::Error> {
let text = ustring::UChar::try_from(text)?;
let locale = uloc::ULoc::try_from(locale)?;
Self::try_new_ustring(type_, &locale, &text)
}
/// Implements `ubrk_open`.
pub fn try_new_ustring(
type_: sys::UBreakIteratorType,
locale: &uloc::ULoc,
text: &ustring::UChar,
) -> Result<Self, common::Error> {
let mut status = common::Error::OK_CODE;
// Clone text and get locale as a CString for break iterator to own.
let locale = locale.as_c_str();
let text = text.clone();
let rep = unsafe {
assert!(common::Error::is_ok(status));
versioned_function!(ubrk_open)(
type_,
locale.as_ptr(),
text.as_c_ptr(),
text.len() as i32,
&mut status,
)
};
common::Error::ok_or_warning(status)?;
assert_ne!(rep, 0 as *mut sys::UBreakIterator);
Ok(Self {
locale: Some(Rc::new(locale)),
rules: None,
binary_rules: None,
text: Rc::new(text),
rep: ptr::NonNull::new(rep).unwrap(),
})
}
/// Creates a new break iterator using the specified breaking rules.
///
/// See the [ICU user guide](https://unicode-org.github.io/icu/userguide/boundaryanalysis/break-rules.html)
/// for rules syntax.
///
/// Implements `ubrk_openRules`.
pub fn try_new_rules(rules: &str, text: &str) -> Result<Self, common::Error> {
let rules = ustring::UChar::try_from(rules)?;
let text = ustring::UChar::try_from(text)?;
Self::try_new_rules_ustring(&rules, &text)
}
/// Implements `ubrk_openRules`.
pub fn try_new_rules_ustring(
rules: &ustring::UChar,
text: &ustring::UChar,
) -> Result<Self, common::Error> {
let mut status = common::Error::OK_CODE;
let mut parse_status = common::NO_PARSE_ERROR;
// Clone text and rules for break iterator to own.
let rules = rules.clone();
let text = text.clone();
let rep = unsafe {
assert!(common::Error::is_ok(status));
versioned_function!(ubrk_openRules)(
rules.as_c_ptr(),
rules.len() as i32,
text.as_c_ptr(),
text.len() as i32,
&mut parse_status,
&mut status,
)
};
common::Error::ok_or_warning(status)?;
common::parse_ok(parse_status)?;
assert_ne!(rep, 0 as *mut sys::UBreakIterator);
Ok(Self {
locale: None,
rules: Some(Rc::new(rules)),
binary_rules: None,
text: Rc::new(text),
rep: ptr::NonNull::new(rep).unwrap(),
})
}
/// Creates a new break iterator using pre-compiled binary rules.
///
/// Binary rules can be obtained with [`get_binary_rules`].
///
/// [`get_binary_rules`]: #method.get_binary_rules
///
/// Implements `ubrk_openBinaryRules`.
pub fn try_new_binary_rules(rules: &Vec<u8>, text: &str) -> Result<Self, common::Error> {
let text = ustring::UChar::try_from(text)?;
Self::try_new_binary_rules_ustring(rules, &text)
}
/// Implements `ubrk_openBinaryRules`.
pub fn try_new_binary_rules_ustring(
rules: &Vec<u8>,
text: &ustring::UChar,
) -> Result<Self, common::Error> {
let mut status = common::Error::OK_CODE;
// Clone text and binary rules for break iterator to own.
let rules = rules.clone();
let text = text.clone();
let rep = unsafe {
assert!(common::Error::is_ok(status));
versioned_function!(ubrk_openBinaryRules)(
rules.as_ptr() as *const raw::c_uchar,
rules.len() as i32,
text.as_c_ptr(),
text.len() as i32,
&mut status,
)
};
common::Error::ok_or_warning(status)?;
assert_ne!(rep, 0 as *mut sys::UBreakIterator);
Ok(Self {
locale: None,
rules: None,
binary_rules: Some(Rc::new(rules)),
text: Rc::new(text),
rep: ptr::NonNull::new(rep).unwrap(),
})
}
/// Returns a `Vec<u8>` containing the compiled binary version of the rules
/// specifying the behavior of this break iterator.
///
/// Implements `ubrk_getBinaryRules`.
pub fn get_binary_rules(&self) -> Result<Vec<u8>, common::Error> {
let mut status = common::Error::OK_CODE;
// Preflight to determine length of buffer for binary rules.
let rules_len = unsafe {
assert!(common::Error::is_ok(status));
versioned_function!(ubrk_getBinaryRules)(
self.rep.as_ptr(),
0 as *mut raw::c_uchar,
0,
&mut status,
)
};
common::Error::ok_preflight(status)?;
// Use determined length to get the actual binary rules.
let mut status = common::Error::OK_CODE;
let mut rules = vec![0; rules_len as usize];
unsafe {
assert!(common::Error::is_ok(status));
versioned_function!(ubrk_getBinaryRules)(
self.rep.as_ptr(),
rules.as_mut_ptr() as *mut raw::c_uchar,
rules_len,
&mut status,
);
}
common::Error::ok_or_warning(status)?;
Ok(rules)
}
/// Performs a clone of the underlying representation.
///
/// The cloned break iterator will hold pointers to the same text, and rules,
/// binary rules, or locale, as the original break iterator. The clone's
/// underlying C representation will maintain its own independent iteration
/// state, but it will be initialized to that of the original (so, for example,
/// if `self.current() == 11`, then `self.safe_clone().current() == 11`).
///
/// Note that the `Clone` trait was not implemented as the underlying operation
/// may fail.
///
/// Implements `ubrk_safeClone`.
pub fn safe_clone(&self) -> Result<Self, common::Error> {
let mut status = common::Error::OK_CODE;
let rep = unsafe {
versioned_function!(ubrk_safeClone)(
self.rep.as_ptr(),
// The following two parameters, stackBuffer and pBufferSize,
// are deprecated, so we pass NULL pointers.
0 as *mut raw::c_void,
0 as *mut i32,
&mut status,
)
};
common::Error::ok_or_warning(status)?;
assert_ne!(rep, 0 as *mut sys::UBreakIterator);
Ok(Self {
locale: self.locale.as_ref().map(|x| x.clone()),
rules: self.rules.as_ref().map(|x| x.clone()),
binary_rules: self.binary_rules.as_ref().map(|x| x.clone()),
text: self.text.clone(),
rep: ptr::NonNull::new(rep).unwrap(),
})
}
/// Instructs this break iterator to point to a new piece of text.
///
/// Implements `ubrk_setText`.
pub fn set_text(&mut self, text: &str) -> Result<(), common::Error> {
let text = ustring::UChar::try_from(text)?;
self.set_text_ustring(&text)
}
/// Implements `ubrk_setText`.
pub fn set_text_ustring(&mut self, text: &ustring::UChar) -> Result<(), common::Error> {
let mut status = common::Error::OK_CODE;
// Clone text and take ownership.
let text = text.clone();
unsafe {
assert!(common::Error::is_ok(status));
versioned_function!(ubrk_setText)(
self.rep.as_ptr(),
text.as_c_ptr(),
text.len() as i32,
&mut status,
);
}
common::Error::ok_or_warning(status)?;
self.text = Rc::new(text);
Ok(())
}
/// Reports the most recently-returned text boundary.
///
/// Implements `ubrk_current`.
pub fn current(&self) -> i32 {
unsafe { versioned_function!(ubrk_current)(self.rep.as_ptr()) }
}
/// Sets the break iterator's position to the boundary preceeding its current
/// position.
///
/// Implements `ubrk_previous`.
pub fn previous(&self) -> Option<i32> {
let result = unsafe { versioned_function!(ubrk_previous)(self.rep.as_ptr()) };
if result == UBRK_DONE {
None
} else {
Some(result)
}
}
/// Moves the iterator to the beginning of its text and returns the new
/// position (zero).
///
/// Implements `ubrk_first`.
pub fn first(&self) -> i32 {
unsafe { versioned_function!(ubrk_first)(self.rep.as_ptr()) }
}
/// Moves the iterator to the position immediately _beyond_ the last character
/// in its text and returns the new position.
///
/// Named as such so as to avoid conflict with the `last` method provided by
/// `Iterator`.
///
/// Implements `ubrk_last`.
pub fn last_boundary(&self) -> i32 {
unsafe { versioned_function!(ubrk_last)(self.rep.as_ptr()) }
}
/// Moves the iterator to the boundary immediately preceding the specified offset
/// and returns the new position.
///
/// Implements `ubrk_preceding`.
pub fn preceding(&self, offset: i32) -> i32 {
unsafe { versioned_function!(ubrk_preceding)(self.rep.as_ptr(), offset) }
}
/// Moves the iterator to the boundary immediately following the specified offset
/// and returns the new position.
///
/// Implements `ubrk_following`.
pub fn following(&self, offset: i32) -> i32 {
unsafe { versioned_function!(ubrk_following)(self.rep.as_ptr(), offset) }
}
/// Reports whether the specified offset is a boundary.
///
/// Implements `ubrk_isBoundary`.
pub fn is_boundary(&self, offset: i32) -> bool {
let result: sys::UBool =
unsafe { versioned_function!(ubrk_isBoundary)(self.rep.as_ptr(), offset) };
result != 0
}
/// Returns the locale, valid or actual, of this break iterator.
///
/// Implements `ubrk_getLocaleByType`.
pub fn get_locale_by_type(
&self,
type_: sys::ULocDataLocaleType,
) -> Result<String, common::Error> {
let mut status = common::Error::OK_CODE;
let char_ptr = unsafe {
assert!(common::Error::is_ok(status));
versioned_function!(ubrk_getLocaleByType)(self.rep.as_ptr(), type_, &mut status)
};
common::Error::ok_or_warning(status)?;
let c_str = unsafe { ffi::CStr::from_ptr(char_ptr) };
let s = c_str.to_str().map(|s| s.to_owned())?;
Ok(s)
}
/// Returns the status of the break rule that determined the most-recently
/// returned boundary. The default status for rules that do not explicitly
/// provide one is zero.
///
/// See the [ICU user guide](https://unicode-org.github.io/icu/userguide/boundaryanalysis/break-rules.html)
/// for details on rule syntax and rule status values.
///
/// Implements `ubrk_getRuleStatus`.
pub fn get_rule_status(&self) -> i32 {
unsafe { versioned_function!(ubrk_getRuleStatus)(self.rep.as_ptr()) }
}
/// Returns the statuses of the break rules that determined the most-recently
/// returned boundary. The default status for rules that do not explicitly
/// provide one is zero.
///
/// See the [ICU user guide](https://unicode-org.github.io/icu/userguide/boundaryanalysis/break-rules.html)
/// for details on rule syntax and rule status values.
///
/// Implements `ubrk_getRuleStatusVec`.
pub fn get_rule_status_vec(&self) -> Result<Vec<i32>, common::Error> {
let mut status = common::Error::OK_CODE;
// Preflight to determine buffer size.
let rules_len = unsafe {
assert!(common::Error::is_ok(status));
versioned_function!(ubrk_getRuleStatusVec)(
self.rep.as_ptr(),
0 as *mut i32,
0,
&mut status,
)
};
common::Error::ok_preflight(status)?;
let mut status = common::Error::OK_CODE;
let mut rules: Vec<i32> = vec![0; rules_len as usize];
unsafe {
assert!(common::Error::is_ok(status));
versioned_function!(ubrk_getRuleStatusVec)(
self.rep.as_ptr(),
rules.as_mut_ptr(),
rules_len,
&mut status,
);
}
common::Error::ok_or_warning(status)?;
Ok(rules)
}
}
/// Iterator over the locales for which text breaking information is available.
pub struct Locales {
// The index to be passed to `ubrk_getAvailable` on the next call to `next`.
index: i32,
// The number of available locales; the result of `ubrk_countAvailable`.
upper: i32,
}
impl Iterator for Locales {
type Item = uloc::ULoc;
/// Returns the next locale for which text breaking information is available.
///
/// Implements `ubrk_getAvailable`.
fn next(&mut self) -> Option<Self::Item> {
if self.index >= self.upper {
return None;
}
let loc_ptr = unsafe { versioned_function!(ubrk_getAvailable)(self.index) };
assert_ne!(loc_ptr, 0 as *const raw::c_char);
let c_str = unsafe { ffi::CStr::from_ptr(loc_ptr) };
let loc = uloc::ULoc::try_from(c_str);
match loc {
Ok(loc) => {
self.index += 1;
Some(loc)
}
_ => None,
}
}
}
impl ExactSizeIterator for Locales {
/// Reports the number of locales for which text breaking information is available.
///
/// Implements `ubrk_countAvailable`.
fn len(&self) -> usize {
self.upper as usize
}
}
#[cfg(test)]
mod tests {
use super::UBreakIterator;
use log::trace;
use rust_icu_sys::{self as sys, UBreakIteratorType::*, ULocDataLocaleType::*};
use std::{convert::TryFrom, rc::Rc};
// Wraps a `UBreakIterator` to emit Strings formed by pairs of word boundaries.
struct Words<'a> {
iter: &'a mut UBreakIterator,
chars: Vec<sys::UChar>,
}
impl<'a> Words<'a> {
fn new(iter: &'a mut UBreakIterator) -> Self {
let text = String::try_from(&*iter.text).unwrap();
Self {
iter,
chars: text.as_str().encode_utf16().collect::<Vec<_>>(),
}
}
}
impl<'a> Iterator for Words<'a> {
type Item = String;
fn next(&mut self) -> Option<Self::Item> {
let start = self.iter.current();
self.iter.next().and_then(|end| {
String::from_utf16(&self.chars[(start as usize)..(end as usize)]).ok()
})
}
}
const TEXT: &str = r#""It wasn't the wine," murmured Mr. Snodgrass. "It was the salmon.""#;
#[test]
fn test_iteration() {
let mut break_iter = UBreakIterator::try_new(UBRK_WORD, "en", TEXT).unwrap();
assert!(break_iter.is_boundary(0));
assert_eq!(0, break_iter.first());
assert_eq!(None, break_iter.previous());
assert_eq!(0, break_iter.current());
let word_start = TEXT.find("murmured").unwrap() as i32;
let word_end = word_start + 8;
assert!(break_iter.is_boundary(word_start));
assert!(break_iter.is_boundary(word_end));
assert!(!break_iter.is_boundary(word_start + 3));
assert_eq!(word_end, break_iter.following(word_start + 3));
assert_eq!(word_end, break_iter.current());
assert_eq!(Some(word_start), break_iter.previous());
assert_eq!(word_start, break_iter.current());
assert_eq!(Some(word_end), break_iter.next());
assert_eq!(word_end, break_iter.current());
assert_eq!(word_start, break_iter.preceding(word_start + 3));
assert_eq!(word_start, break_iter.current());
let text_len = TEXT.len() as i32;
assert!(break_iter.is_boundary(text_len));
assert_eq!(text_len, break_iter.last_boundary());
assert_eq!(None, break_iter.next());
assert_eq!(text_len, break_iter.current());
break_iter.first();
let word_iter = Words::new(&mut break_iter);
assert_eq!(
vec![
"\"",
"It",
" ",
"wasn't",
" ",
"the",
" ",
"wine",
",",
"\"",
" ",
"murmured",
" ",
"Mr",
".",
" ",
"Snodgrass",
".",
" ",
"\"",
"It",
" ",
"was",
" ",
"the",
" ",
"salmon",
".",
"\"",
]
.into_iter()
.map(String::from)
.collect::<Vec<_>>(),
word_iter.collect::<Vec<_>>()
);
}
#[test]
fn test_binary_rules() {
let iter1 = UBreakIterator::try_new(UBRK_WORD, "en", TEXT).unwrap();
let iter1_binary_rules = iter1.get_binary_rules().unwrap();
let iter1_boundaries: Vec<i32> = iter1.collect();
let iter2 = UBreakIterator::try_new_binary_rules(&iter1_binary_rules, TEXT).unwrap();
let iter2_boundaries: Vec<i32> = iter2.collect();
assert!(!iter2_boundaries.is_empty());
assert_eq!(iter1_boundaries, iter2_boundaries);
}
#[test]
fn test_rules() {
let rules = r#"
# Our custom break rules: break on `w`s.
!!chain;
!!quoted_literals_only;
$w = [w];
$not_w = [^w];
$not_w+; # No breaks between code points other than `w`.
$w+ {99}; # Break on `w`s with custom rule status of `99`.
"#;
let mut break_iter = UBreakIterator::try_new_rules(rules, TEXT).unwrap();
#[derive(Debug)]
struct TestCase {
boundary: Option<i32>,
rule_status: i32,
}
let tests = vec![
TestCase {
boundary: Some(4),
rule_status: 0,
},
TestCase {
boundary: Some(5),
rule_status: 99,
},
TestCase {
boundary: Some(15),
rule_status: 0,
},
TestCase {
boundary: Some(16),
rule_status: 99,
},
TestCase {
boundary: Some(50),
rule_status: 0,
},
TestCase {
boundary: Some(51),
rule_status: 99,
},
TestCase {
boundary: Some(66),
rule_status: 0,
},
TestCase {
boundary: None,
rule_status: 0,
},
];
for test in tests {
assert_eq!(test.boundary, break_iter.next());
assert_eq!(test.rule_status, break_iter.get_rule_status());
assert_eq!(
vec![test.rule_status],
break_iter.get_rule_status_vec().unwrap()
);
}
break_iter.first();
let word_iter = Words::new(&mut break_iter);
assert_eq!(
vec![
"\"It ",
"w",
"asn't the ",
"w",
"ine,\" murmured Mr. Snodgrass. \"It ",
"w",
"as the salmon.\"",
]
.into_iter()
.map(String::from)
.collect::<Vec<_>>(),
word_iter.collect::<Vec<_>>(),
);
}
#[test]
fn test_clone() {
let mut iter1 = UBreakIterator::try_new(UBRK_WORD, "en", TEXT).unwrap();
iter1.first();
assert_eq!(1, Rc::strong_count(&iter1.text));
assert_eq!(1, Rc::strong_count(iter1.locale.as_ref().unwrap()));
assert_eq!(Some(1), iter1.next());
assert_eq!(Some(3), iter1.next());
assert_eq!(3, iter1.current());
// Clone in a new scope.
{
let mut iter2 = iter1.safe_clone().unwrap();
assert_eq!(2, Rc::strong_count(&iter1.text));
assert_eq!(2, Rc::strong_count(iter1.locale.as_ref().unwrap()));
assert_eq!(3, iter2.current());
assert_eq!(0, iter2.first());
assert_eq!(Some(1), iter2.next());
assert_eq!(Some(4), iter1.next());
}
assert_eq!(1, Rc::strong_count(&iter1.text));
assert_eq!(1, Rc::strong_count(iter1.locale.as_ref().unwrap()));
assert_eq!(4, iter1.current());
assert_eq!(Some(10), iter1.next());
}
#[test]
fn test_set_text() {
let mut iter = UBreakIterator::try_new(UBRK_WORD, "en", TEXT).unwrap();
let iter_text_rc = iter.text.clone();
assert_eq!(2, Rc::strong_count(&iter_text_rc));
let pos = TEXT.find("murmured").unwrap() as i32;
assert_eq!(pos, iter.preceding(pos + 3));
assert_eq!(pos, iter.current());
let new_str = "The lazy dog.";
iter.set_text(new_str).unwrap();
assert_eq!(1, Rc::strong_count(&iter_text_rc));
assert_eq!(new_str, String::try_from(&*iter.text).unwrap());
assert_eq!(0, iter.current());
assert_eq!(new_str.len() as i32, iter.last_boundary());
}
#[test]
fn test_get_locale_by_type() {
let iter = UBreakIterator::try_new(UBRK_WORD, "en_US_CA@lb=strict", TEXT).unwrap();
// The "valid locale" is the most specific locale supported by ICU, given
// what was requested.
assert_eq!("en_US", iter.get_locale_by_type(ULOC_VALID_LOCALE).unwrap(),);
// The "actual locale" is the locale that breaking information actually comes from.
// In most cases this will be "root".
assert_eq!("root", iter.get_locale_by_type(ULOC_ACTUAL_LOCALE).unwrap(),);
}
#[test]
fn test_available_locales() {
trace!("Available locales");
for loc in UBreakIterator::available_locales() {
trace!(" {}", loc);
}
}
}