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 830 831 832 833 834 835 836 837 838 839
// Copyright (C) 2024 Christian Mauduit <ufoot@ufoot.org>
use crate::cache::*;
use std::cmp::Eq;
use std::fmt;
use std::hash::Hash;
use std::iter::DoubleEndedIterator;
use std::iter::FusedIterator;
use std::marker::PhantomData;
/// Iterator over a LRU cache.
///
/// The order of the iterated entries is guaranteed, it starts
/// from the oldest (LRU) entry, and finishes by the most recent (MRU) entry.
///
/// # Examples
///
/// ```
/// use hashlru::Cache;
///
/// let mut cache = Cache::new(10);
/// cache.insert("x", 1);
/// cache.insert("y", 10);
/// cache.insert("z", 100);
///
/// let mut iter = cache.iter();
/// assert_eq!(Some((&"x", &1)), iter.next());
/// assert_eq!(Some((&"y", &10)), iter.next());
/// assert_eq!(Some((&"z", &100)), iter.next_back());
/// assert_eq!(None, iter.next());
/// ```
pub struct Iter<'a, K, V>
where
K: Eq + Hash,
{
pub(crate) done: usize,
pub(crate) len: usize,
pub(crate) forward: *const Node<K, V>,
pub(crate) backward: *const Node<K, V>,
pub(crate) phantom: PhantomData<&'a (K, V)>,
}
impl<K, V> fmt::Debug for Iter<'_, K, V>
where
K: Eq + Hash + fmt::Debug,
{
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
if self.done >= self.len {
write!(f, "Iter {{ done: {:?}, len: {:?} }}", self.done, self.len)
} else {
let forward = unsafe { &(*(*self.forward).key.as_ptr()) };
let backward = unsafe { &(*(*self.backward).key.as_ptr()) };
write!(
f,
"Iter {{ done: {:?}, len: {:?}, next: {:?}, next_back: {:?} }}",
self.done, self.len, backward, forward
)
}
}
}
impl<K, V> fmt::Display for Iter<'_, K, V>
where
K: Eq + Hash + fmt::Display,
V: fmt::Display,
{
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
if self.done >= self.len {
write!(f, "{}/{}", self.done, self.len)
} else {
let forward = unsafe { &(*(*self.forward).key.as_ptr()) };
let backward = unsafe { &(*(*self.backward).key.as_ptr()) };
write!(
f,
"{}/{}, next: {}, next_back: {}",
self.done, self.len, backward, forward
)
}
}
}
impl<'a, K, V> Iterator for Iter<'a, K, V>
where
K: Hash + Eq,
{
type Item = (&'a K, &'a V);
fn next(&mut self) -> Option<(&'a K, &'a V)> {
if self.done >= self.len {
return None;
}
// Iterate from the back, this may seem counter-intuitive,
// but if we were to alter the order after reading, this
// is what we should do.
//
// Eg if the content is [1,2,3] with 3 added last, the
// most recent is 3, the the oldest is 1. So iterating
// with the natural order would give [3,2,1].
//
// Here we decide to iterate on [1,2,3].
let k = unsafe { &(*(*self.backward).key.as_ptr()) as &K };
let v = unsafe { &(*(*self.backward).value.as_ptr()) as &V };
self.done += 1;
self.backward = unsafe { (*self.backward).prev };
Some((k, v))
}
fn size_hint(&self) -> (usize, Option<usize>) {
if self.done >= self.len {
let remaining = self.len - self.done;
(remaining, Some(remaining))
} else {
(0, Some(0))
}
}
}
impl<'a, K, V> DoubleEndedIterator for Iter<'a, K, V>
where
K: Hash + Eq,
{
fn next_back(&mut self) -> Option<(&'a K, &'a V)> {
if self.done >= self.len {
return None;
}
let k = unsafe { &(*(*self.forward).key.as_ptr()) as &K };
let v = unsafe { &(*(*self.forward).value.as_ptr()) as &V };
self.done += 1;
self.forward = unsafe { (*self.forward).next };
Some((k, v))
}
}
impl<'a, K, V> ExactSizeIterator for Iter<'a, K, V> where K: Eq + Hash {}
impl<'a, K, V> FusedIterator for Iter<'a, K, V> where K: Eq + Hash {}
impl<'a, K, V> Iter<'a, K, V>
where
K: Hash + Eq,
{
/// Iterate on keys only.
///
/// The order of the iterated entries is guaranteed, it starts
/// from the oldest (LRU) entry, and finishes by the most recent (MRU) entry.
///
/// # Examples
///
/// ```
/// use hashlru::Cache;
///
/// let mut cache = Cache::new(10);
/// cache.insert("x", 1);
/// cache.insert("y", 10);
/// cache.insert("z", 100);
///
/// let mut iter = cache.iter();
/// assert_eq!(Some((&"x", &1)), iter.next());
/// let mut keys = iter.keys();
/// assert_eq!(Some(&"y"), keys.next());
/// assert_eq!(Some(&"z"), keys.next_back());
/// assert_eq!(None, keys.next());
/// ```
pub fn keys(self) -> Keys<'a, K, V> {
Keys { iter: self }
}
/// Iterate on values only.
///
/// The order of the iterated entries is guaranteed, it starts
/// from the oldest (LRU) entry, and finishes by the most recent (MRU) entry.
///
/// # Examples
///
/// ```
/// use hashlru::Cache;
///
/// let mut cache = Cache::new(10);
/// cache.insert("x", 1);
/// cache.insert("y", 10);
/// cache.insert("z", 100);
///
/// let mut iter = cache.iter();
/// assert_eq!(Some((&"x", &1)), iter.next());
/// let mut values = iter.values();
/// assert_eq!(Some(&10), values.next());
/// assert_eq!(Some(&100), values.next_back());
/// assert_eq!(None, values.next());
/// ```
pub fn values(self) -> Values<'a, K, V> {
Values { iter: self }
}
}
/// Iterator over mutable entries of a LRU cache.
///
/// The order of the iterated entries is guaranteed, it starts
/// from the oldest (LRU) entry, and finishes by the most recent (MRU) entry.
///
/// # Examples
///
/// ```
/// use hashlru::Cache;
///
/// let mut cache = Cache::new(10);
/// cache.insert("x", 1);
/// cache.insert("y", 10);
/// cache.insert("z", 100);
///
/// cache.iter_mut().for_each(|(_, val)| {
/// *val *= 2;
/// });
/// assert_eq!(Some(&2), cache.peek(&"x"));
/// assert_eq!(Some(&20), cache.peek(&"y"));
/// assert_eq!(Some(&200), cache.peek(&"z"));
/// ```
pub struct IterMut<'a, K, V>
where
K: Eq + Hash,
{
pub(crate) done: usize,
pub(crate) len: usize,
pub(crate) forward: *mut Node<K, V>,
pub(crate) backward: *mut Node<K, V>,
pub(crate) phantom: PhantomData<&'a (K, V)>,
}
impl<K, V> fmt::Debug for IterMut<'_, K, V>
where
K: Eq + Hash + fmt::Debug,
{
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
if self.done >= self.len {
write!(f, "Iter {{ done: {:?}, len: {:?} }}", self.done, self.len)
} else {
let forward = unsafe { &(*(*self.forward).key.as_ptr()) };
let backward = unsafe { &(*(*self.backward).key.as_ptr()) };
write!(
f,
"Iter {{ done: {:?}, len: {:?}, next: {:?}, next_back: {:?} }}",
self.done, self.len, backward, forward
)
}
}
}
impl<K, V> fmt::Display for IterMut<'_, K, V>
where
K: Eq + Hash + fmt::Display,
V: fmt::Display,
{
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
if self.done >= self.len {
write!(f, "{}/{}", self.done, self.len)
} else {
let forward = unsafe { &(*(*self.forward).key.as_ptr()) };
let backward = unsafe { &(*(*self.backward).key.as_ptr()) };
write!(
f,
"{}/{}, next: {}, next_back: {}",
self.done, self.len, backward, forward
)
}
}
}
impl<'a, K, V> Iterator for IterMut<'a, K, V>
where
K: Hash + Eq,
{
type Item = (&'a K, &'a mut V);
fn next(&mut self) -> Option<(&'a K, &'a mut V)> {
if self.done >= self.len {
return None;
}
// Iterate from the back, this may seem counter-intuitive,
// but if we were to alter the order after reading, this
// is what we should do.
//
// Eg if the content is [1,2,3] with 3 added last, the
// most recent is 3, the the oldest is 1. So iterating
// with the natural order would give [3,2,1].
//
// Here we decide to iterate on [1,2,3].
let k = unsafe { &(*(*self.backward).key.as_ptr()) as &K };
let v = unsafe { &mut (*(*self.backward).value.as_mut_ptr()) as &mut V };
self.done += 1;
self.backward = unsafe { (*self.backward).prev };
Some((k, v))
}
fn size_hint(&self) -> (usize, Option<usize>) {
if self.done >= self.len {
let remaining = self.len - self.done;
(remaining, Some(remaining))
} else {
(0, Some(0))
}
}
}
impl<'a, K, V> DoubleEndedIterator for IterMut<'a, K, V>
where
K: Hash + Eq,
{
fn next_back(&mut self) -> Option<(&'a K, &'a mut V)> {
if self.done >= self.len {
return None;
}
let k = unsafe { &(*(*self.forward).key.as_ptr()) as &K };
let v = unsafe { &mut (*(*self.forward).value.as_mut_ptr()) as &mut V };
self.done += 1;
self.forward = unsafe { (*self.forward).next };
Some((k, v))
}
}
impl<'a, K, V> ExactSizeIterator for IterMut<'a, K, V> where K: Eq + Hash {}
impl<'a, K, V> FusedIterator for IterMut<'a, K, V> where K: Eq + Hash {}
/// Iterator over the keys of a LRU cache.
///
/// The order of the iterated entries is guaranteed, it starts
/// from the oldest (LRU) entry, and finishes by the most recent (MRU) entry.
///
/// # Examples
///
/// ```
/// use hashlru::Cache;
///
/// let mut cache = Cache::new(10);
/// cache.insert("x", 1);
/// cache.insert("y", 10);
/// cache.insert("z", 100);
///
/// let keys: Vec<&&str> = cache.keys().collect();
/// assert_eq!(vec![&"x", &"y", &"z"], keys);
/// let mut keys = cache.keys();
/// assert_eq!(Some(&"x"), keys.next());
/// assert_eq!(Some(&"y"), keys.next());
/// assert_eq!(Some(&"z"), keys.next_back());
/// assert_eq!(None, keys.next());
/// ```
#[derive(Debug)]
pub struct Keys<'a, K, V>
where
K: Eq + Hash,
{
iter: Iter<'a, K, V>,
}
impl<K, V> fmt::Display for Keys<'_, K, V>
where
K: Clone + Eq + Hash + fmt::Display,
V: fmt::Display,
{
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
write!(f, "{}", self.iter)
}
}
impl<'a, K, V> Iterator for Keys<'a, K, V>
where
K: Hash + Eq,
{
type Item = &'a K;
fn next(&mut self) -> Option<&'a K> {
match self.iter.next() {
Some(kv) => Some(kv.0),
None => None,
}
}
fn size_hint(&self) -> (usize, Option<usize>) {
self.iter.size_hint()
}
}
impl<'a, K, V> DoubleEndedIterator for Keys<'a, K, V>
where
K: Hash + Eq,
{
fn next_back(&mut self) -> Option<&'a K> {
match self.iter.next_back() {
Some(kv) => Some(kv.0),
None => None,
}
}
}
impl<'a, K, V> ExactSizeIterator for Keys<'a, K, V> where K: Eq + Hash {}
impl<'a, K, V> FusedIterator for Keys<'a, K, V> where K: Eq + Hash {}
/// Iterator over the values of a LRU cache.
///
/// The order of the iterated entries is guaranteed, it starts
/// from the oldest (LRU) entry, and finishes by the most recent (MRU) entry.
///
/// # Examples
///
/// ```
/// use hashlru::Cache;
///
/// let mut cache: Cache<&str, usize> = Cache::new(10);
/// cache.insert("x", 1);
/// cache.insert("y", 10);
/// cache.insert("z", 100);
///
/// let values: Vec<&usize> = cache.values().collect();
/// assert_eq!(vec![&1, &10, &100], values);
/// let mut values = cache.values();
/// assert_eq!(Some(&1), values.next());
/// assert_eq!(Some(&10), values.next());
/// assert_eq!(Some(&100), values.next_back());
/// assert_eq!(None, values.next());
/// ```
#[derive(Debug)]
pub struct Values<'a, K, V>
where
K: Eq + Hash,
{
iter: Iter<'a, K, V>,
}
impl<K, V> fmt::Display for Values<'_, K, V>
where
K: Clone + Eq + Hash + fmt::Display,
V: fmt::Display,
{
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
write!(f, "{}", self.iter)
}
}
impl<'a, K, V> Iterator for Values<'a, K, V>
where
K: Hash + Eq,
{
type Item = &'a V;
fn next(&mut self) -> Option<&'a V> {
match self.iter.next() {
Some(kv) => Some(kv.1),
None => None,
}
}
fn size_hint(&self) -> (usize, Option<usize>) {
self.iter.size_hint()
}
}
impl<'a, K, V> DoubleEndedIterator for Values<'a, K, V>
where
K: Hash + Eq,
{
fn next_back(&mut self) -> Option<&'a V> {
match self.iter.next_back() {
Some(kv) => Some(kv.1),
None => None,
}
}
}
impl<'a, K, V> ExactSizeIterator for Values<'a, K, V> where K: Eq + Hash {}
impl<'a, K, V> FusedIterator for Values<'a, K, V> where K: Eq + Hash {}
/// Iterator over a LRU cache, taking ownership.
///
/// The order of the iterated entries is guaranteed, it starts
/// from the oldest (LRU) entry, and finishes by the most recent (MRU) entry.
///
/// # Examples
///
/// ```
/// use hashlru::Cache;
///
/// let mut cache = Cache::new(10);
/// cache.insert("x", 1);
/// cache.insert("y", 10);
/// cache.insert("z", 100);
///
/// let mut iter=cache.into_iter();
/// assert_eq!(Some(("x", 1)), iter.next());
/// assert_eq!(Some(("y", 10)), iter.next());
/// assert_eq!(Some(("z", 100)), iter.next());
/// assert_eq!(None, iter.next());
/// ```
#[derive(Debug)]
pub struct IntoIter<K, V>
where
K: Eq + Hash,
{
pub(crate) len: usize,
pub(crate) cache: Cache<K, V>,
}
impl<K, V> fmt::Display for IntoIter<K, V>
where
K: Eq + Hash + fmt::Display,
V: fmt::Display,
{
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
write!(f, "{}/{}", self.len - self.cache.len(), self.len)
}
}
impl<K, V> Iterator for IntoIter<K, V>
where
K: Hash + Eq,
{
type Item = (K, V);
fn next(&mut self) -> Option<(K, V)> {
self.cache.pop_lru()
}
fn size_hint(&self) -> (usize, Option<usize>) {
let size = self.len - self.cache.len();
(size, Some(size))
}
}
impl<K, V> DoubleEndedIterator for IntoIter<K, V>
where
K: Hash + Eq,
{
fn next_back(&mut self) -> Option<(K, V)> {
self.cache.pop_mru()
}
}
impl<K, V> ExactSizeIterator for IntoIter<K, V> where K: Eq + Hash {}
impl<K, V> FusedIterator for IntoIter<K, V> where K: Eq + Hash {}
impl<K, V> IntoIter<K, V>
where
K: Hash + Eq,
{
/// Iterate on keys only, with ownership.
///
/// The order of the iterated entries is guaranteed, it starts
/// from the oldest (LRU) entry, and finishes by the most recent (MRU) entry.
///
/// # Examples
///
/// ```
/// use hashlru::Cache;
///
/// let mut cache = Cache::new(10);
/// cache.insert("x", 1);
/// cache.insert("y", 10);
/// cache.insert("z", 100);
///
/// let mut iter = cache.into_iter();
/// assert_eq!(Some(("x", 1)), iter.next());
/// let mut keys = iter.keys();
/// assert_eq!(Some("y"), keys.next());
/// assert_eq!(Some("z"), keys.next_back());
/// assert_eq!(None, keys.next());
/// ```
pub fn keys(self) -> IntoKeys<K, V> {
IntoKeys { into_iter: self }
}
/// Iterate on values only, with ownership.
///
/// The order of the iterated entries is guaranteed, it starts
/// from the oldest (LRU) entry, and finishes by the most recent (MRU) entry.
///
/// # Examples
///
/// ```
/// use hashlru::Cache;
///
/// let mut cache = Cache::new(10);
/// cache.insert("x", 1);
/// cache.insert("y", 10);
/// cache.insert("z", 100);
///
/// let mut iter = cache.into_iter();
/// assert_eq!(Some(("x", 1)), iter.next());
/// let mut values = iter.values();
/// assert_eq!(Some(10), values.next());
/// assert_eq!(Some(100), values.next_back());
/// assert_eq!(None, values.next());
/// ```
pub fn values(self) -> IntoValues<K, V> {
IntoValues { into_iter: self }
}
}
/// Iterator over the keys of a LRU cache, taking ownership.
///
/// The order of the iterated entries is guaranteed, it starts
/// from the oldest (LRU) entry, and finishes by the most recent (MRU) entry.
///
/// # Examples
///
/// ```
/// use hashlru::Cache;
///
/// let mut cache = Cache::new(10);
/// cache.insert("x", 1);
/// cache.insert("y", 10);
/// cache.insert("z", 100);
///
/// let values: Vec<&str> = cache.into_keys().collect();
/// assert_eq!(vec!["x", "y", "z"], values);
/// ```
#[derive(Debug)]
pub struct IntoKeys<K, V>
where
K: Eq + Hash,
{
into_iter: IntoIter<K, V>,
}
impl<K, V> fmt::Display for IntoKeys<K, V>
where
K: Clone + Eq + Hash + fmt::Display,
V: fmt::Display,
{
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
write!(f, "{}", self.into_iter)
}
}
impl<K, V> Iterator for IntoKeys<K, V>
where
K: Hash + Eq,
{
type Item = K;
fn next(&mut self) -> Option<K> {
match self.into_iter.next() {
Some(kv) => Some(kv.0),
None => None,
}
}
fn size_hint(&self) -> (usize, Option<usize>) {
self.into_iter.size_hint()
}
}
impl<K, V> DoubleEndedIterator for IntoKeys<K, V>
where
K: Hash + Eq,
{
fn next_back(&mut self) -> Option<K> {
match self.into_iter.next_back() {
Some(kv) => Some(kv.0),
None => None,
}
}
}
impl<K, V> ExactSizeIterator for IntoKeys<K, V> where K: Eq + Hash {}
impl<K, V> FusedIterator for IntoKeys<K, V> where K: Eq + Hash {}
/// Iterator over the values of a LRU cache, taking ownership.
///
/// The order of the iterated entries is guaranteed, it starts
/// from the oldest (LRU) entry, and finishes by the most recent (MRU) entry.
///
/// # Examples
///
/// ```
/// use hashlru::Cache;
///
/// let mut cache: Cache<&str, usize> = Cache::new(10);
/// cache.insert("x", 1);
/// cache.insert("y", 10);
/// cache.insert("z", 100);
///
/// let values: Vec<usize> = cache.into_values().collect();
/// assert_eq!(vec![1, 10, 100], values);
/// ```
#[derive(Debug)]
pub struct IntoValues<K, V>
where
K: Eq + Hash,
{
into_iter: IntoIter<K, V>,
}
impl<K, V> fmt::Display for IntoValues<K, V>
where
K: Clone + Eq + Hash + fmt::Display,
V: fmt::Display,
{
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
write!(f, "{}", self.into_iter)
}
}
impl<K, V> Iterator for IntoValues<K, V>
where
K: Hash + Eq,
{
type Item = V;
fn next(&mut self) -> Option<V> {
match self.into_iter.next() {
Some(kv) => Some(kv.1),
None => None,
}
}
fn size_hint(&self) -> (usize, Option<usize>) {
self.into_iter.size_hint()
}
}
impl<K, V> DoubleEndedIterator for IntoValues<K, V>
where
K: Hash + Eq,
{
fn next_back(&mut self) -> Option<V> {
match self.into_iter.next_back() {
Some(kv) => Some(kv.1),
None => None,
}
}
}
impl<K, V> ExactSizeIterator for IntoValues<K, V> where K: Eq + Hash {}
impl<K, V> FusedIterator for IntoValues<K, V> where K: Eq + Hash {}
#[cfg(test)]
mod tests {
#[test]
fn test_iter() {
let mut cache = super::Cache::<i32, &str>::new(7);
let mut iter = cache.iter();
assert_eq!(None, iter.next());
assert_eq!(None, cache.insert(1, "one"));
assert_eq!(None, cache.insert(2, "two"));
assert_eq!(None, cache.insert(3, "three"));
assert_eq!(None, cache.insert(4, "four"));
assert_eq!(None, cache.insert(5, "five"));
assert_eq!(None, cache.insert(6, "six"));
let mut iter = cache.iter();
assert_eq!(
"0/6, next: 1, next_back: 6".to_string(),
format!("{}", &iter)
);
let mut expected: (&i32, &&str) = (&1, &"one");
assert_eq!(Some(expected), iter.next());
assert_eq!(
"1/6, next: 2, next_back: 6".to_string(),
format!("{}", &iter)
);
expected = (&2, &"two");
assert_eq!(Some(expected), iter.next());
assert_eq!(
"2/6, next: 3, next_back: 6".to_string(),
format!("{}", &iter)
);
expected = (&3, &"three");
assert_eq!(Some(expected), iter.next());
assert_eq!(
"3/6, next: 4, next_back: 6".to_string(),
format!("{}", &iter)
);
expected = (&4, &"four");
assert_eq!(Some(expected), iter.next());
assert_eq!(
"4/6, next: 5, next_back: 6".to_string(),
format!("{}", &iter)
);
expected = (&6, &"six");
assert_eq!(Some(expected), iter.next_back());
assert_eq!(
"5/6, next: 5, next_back: 5".to_string(),
format!("{}", &iter)
);
expected = (&5, &"five");
assert_eq!(Some(expected), iter.next_back());
assert_eq!("6/6".to_string(), format!("{}", &iter));
assert_eq!(None, iter.next());
}
#[test]
fn test_into_iter() {
let mut cache = super::Cache::<i32, &str>::new(7);
let mut iter = cache.iter();
assert_eq!(None, iter.next());
assert_eq!(None, cache.insert(1, "one"));
assert_eq!(None, cache.insert(2, "two"));
assert_eq!(None, cache.insert(3, "three"));
assert_eq!(None, cache.insert(4, "four"));
assert_eq!(None, cache.insert(5, "five"));
assert_eq!(None, cache.insert(6, "six"));
let mut iter = cache.into_iter();
assert_eq!("0/6".to_string(), format!("{}", &iter));
let mut expected: (i32, &str) = (1, "one");
assert_eq!(Some(expected), iter.next());
assert_eq!("1/6".to_string(), format!("{}", &iter));
expected = (2, "two");
assert_eq!(Some(expected), iter.next());
assert_eq!("2/6".to_string(), format!("{}", &iter));
expected = (3, "three");
assert_eq!(Some(expected), iter.next());
assert_eq!("3/6".to_string(), format!("{}", &iter));
expected = (4, "four");
assert_eq!(Some(expected), iter.next());
assert_eq!("4/6".to_string(), format!("{}", &iter));
expected = (5, "five");
assert_eq!(Some(expected), iter.next());
assert_eq!("5/6".to_string(), format!("{}", &iter));
expected = (6, "six");
assert_eq!(Some(expected), iter.next());
assert_eq!("6/6".to_string(), format!("{}", &iter));
assert_eq!(None, iter.next());
}
}