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 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050
use super::*; use std::convert::AsRef; /// A Set that is a non-contiguous subset of some larger collection. /// `B` can be any borrowed collection type that implements the [`Set`], and [`RemovePrefix`] /// traits. /// For iteration of subsets, the underlying type must also implement [`SplitFirst`] and /// [`SplitAt`] traits. /// /// # Example /// /// The following example shows how to create a `Subset` from a standard `Vec`. /// /// ```rust /// use flatk::*; /// let v = vec![1,2,3,4,5]; /// let subset = Subset::from_indices(vec![0,2,4], v.as_slice()); /// let mut subset_iter = subset.iter(); /// assert_eq!(Some(&1), subset_iter.next()); /// assert_eq!(Some(&3), subset_iter.next()); /// assert_eq!(Some(&5), subset_iter.next()); /// assert_eq!(None, subset_iter.next()); /// ``` /// /// The next example shows how to create a `Subset` from a [`UniChunked`] collection. /// /// ```rust /// use flatk::*; /// let mut v = Chunked3::from_flat(vec![1,2,3,4,5,6,7,8,9,10,11,12,13,14,15]); /// let mut subset = Subset::from_indices(vec![0,2,4], v.view_mut()); /// { /// let subset_view = subset.view(); /// let mut subset_iter = subset_view.iter(); /// assert_eq!(Some(&[1,2,3]), subset_iter.next()); /// assert_eq!(Some(&[7,8,9]), subset_iter.next()); /// assert_eq!(Some(&[13,14,15]), subset_iter.next()); /// assert_eq!(None, subset_iter.next()); /// } /// *subset.view_mut().isolate(1) = [0; 3]; /// assert_eq!(&[0,0,0], subset.view().at(1)); /// ``` // A note about translation independence: // ====================================== // This struct is very similar to `Chunked`, with the main difference being that // each index corresponds to a single element instead of a chunk starting point. // To be able to split subsets, we need to make indices translation independent // so that we don't have to modify their values when we split the collection. // When the indices are owned, we simply modify the indices when we split the // subset, but when the indices are a borrowed slice, we always chop the part of // data below the first index to ensure that the first index serves as an offset // to the rest of the indices, making the entire index array translation // independent. #[derive(Copy, Clone, Debug, PartialEq)] pub struct Subset<S, I = Box<[usize]>> { /// An optional set of indices. When this is `None`, the subset is /// considered to be entire. Empty subsets are represented by a zero length /// array of indices: either `Some(&[])` or `Some(Vec::new())`. pub indices: Option<I>, /// Because `Subset`s modify the underlying data, it is not useful to query what the data is at /// any given time. For a more transparent data structure that preserves the original data set, /// use `Select`. To expose any characteristics of the contained `data` type, use a trait. See /// `ChunkSize` for an example. pub data: S, } /// A borrowed subset. pub type SubsetView<'a, S> = Subset<S, &'a [usize]>; impl<S: Set + RemovePrefix> Subset<S, Vec<usize>> { /// Create a subset of elements from the original set given at the specified indices. /// /// # Example /// /// ```rust /// use flatk::*; /// let v = vec![1,2,3]; /// let subset = Subset::from_indices(vec![0,2], v.as_slice()); /// assert_eq!(1, subset[0]); /// assert_eq!(3, subset[1]); /// ``` pub fn from_indices(mut indices: Vec<usize>, mut data: S) -> Self { // Ensure that indices are sorted and there are no duplicates. // Failure to enforce this invariant can cause race conditions. indices.sort_unstable(); indices.dedup(); if let Some(first) = indices.first() { data.remove_prefix(*first); } Self::validate(Subset { indices: Some(indices), data, }) } } impl<S: Set + RemovePrefix, I: AsRef<[usize]>> Subset<S, I> { /// Create a subset of elements from the original scollection corresponding to the given indices. /// In contrast to `Subset::from_indices`, this function expects the indices /// to be unique and in sorted order, instead of manully making it so. /// /// # Panics /// /// This function panics when given a collection of unsorted indices. /// It also panics when indices are repeated. /// /// # Example /// /// ```rust /// use flatk::*; /// let v = vec![0,1,2,3]; /// let indices = vec![1,3]; /// /// let subset_view = Subset::from_unique_ordered_indices(indices.as_slice(), v.as_slice()); /// assert_eq!(1, subset_view[0]); /// assert_eq!(3, subset_view[1]); /// /// let subset = Subset::from_unique_ordered_indices(indices, v.as_slice()); /// assert_eq!(1, subset[0]); /// assert_eq!(3, subset[1]); /// ``` pub fn from_unique_ordered_indices(indices: I, mut data: S) -> Self { // Ensure that indices are sorted and there are no duplicates. assert!(Self::is_sorted(&indices)); assert!(!Self::has_duplicates(&indices)); if let Some(first) = indices.as_ref().first() { data.remove_prefix(*first); } Self::validate(Subset { indices: Some(indices), data, }) } } impl<S, I> Subset<S, I> { /// Create a subset with all elements from the original set. /// /// # Example /// /// ```rust /// use flatk::*; /// let subset = Subset::<_, Vec<_>>::all(vec![1,2,3]); /// let subset_view = subset.view(); /// let mut subset_iter = subset_view.iter(); /// assert_eq!(Some(&1), subset_iter.next()); /// assert_eq!(Some(&2), subset_iter.next()); /// assert_eq!(Some(&3), subset_iter.next()); /// assert_eq!(None, subset_iter.next()); /// ``` pub fn all(data: S) -> Self { Subset { indices: None, data, } } } impl<S: Set, I: AsRef<[usize]>> Subset<S, I> { /// Find an element in the subset by its index in the superset. Return the index of the element /// in the subset if found. /// Since subset indices are always in sorted order, this function performs a binary search. /// /// # Examples /// /// In the following simple example the element `3` is found at superset index `2` which is /// located at index `1` in the subset. /// /// ``` /// use flatk::*; /// let superset = vec![1,2,3,4,5,6]; /// let subset = Subset::from_unique_ordered_indices(vec![1,2,5], superset); /// assert_eq!(Some(1), subset.find_by_index(2)); /// assert_eq!(None, subset.find_by_index(3)); /// ``` /// /// Note that the superset index refers to the indices with which the subset was created. This /// means that even after we have split the subset, the input indices are expected to refer to /// the original subset. The following example demonstrates this by splitting the original /// subset in the pervious example. /// /// ``` /// use flatk::*; /// let superset = vec![1,2,3,4,5,6]; /// let subset = Subset::from_unique_ordered_indices(vec![1,2,5], superset); /// let (_, r) = subset.view().split_at(1); /// assert_eq!(Some(0), r.find_by_index(2)); /// assert_eq!(None, r.find_by_index(3)); /// ``` pub fn find_by_index(&self, index: usize) -> Option<usize> { match &self.indices { Some(indices) => indices.as_ref().binary_search(&index).ok(), None => { // If the subset is entire, then we know the element is contained. Some(index) } } } } impl<'a, S, I: AsRef<[usize]>> Subset<S, I> { /// A helper function that checks if a given collection of indices has duplicates. /// It is assumed that the given indices are already in sorted order. fn has_duplicates(indices: &I) -> bool { let mut index_iter = indices.as_ref().iter().cloned(); if let Some(mut prev) = index_iter.next() { for cur in index_iter { if cur == prev { return true; } else { prev = cur; } } } false } /// Checks that the given set of indices are sorted. // TODO: replace this with std version when RFC 2351 lands // (https://github.com/rust-lang/rust/issues/53485) fn is_sorted(indices: &I) -> bool { Self::is_sorted_by(indices, |a, b| a.partial_cmp(b)) } /// Checks that the given set of indices are sorted by the given compare function. #[allow(clippy::while_let_on_iterator)] fn is_sorted_by<F>(indices: &I, mut compare: F) -> bool where F: FnMut(&usize, &usize) -> Option<std::cmp::Ordering>, { let mut iter = indices.as_ref().iter(); let mut last = match iter.next() { Some(e) => e, None => return true, }; while let Some(curr) = iter.next() { if compare(&last, &curr) .map(|o| o == std::cmp::Ordering::Greater) .unwrap_or(true) { return false; } last = curr; } true } } impl<'a, S: Set, I> Subset<S, I> { /// Get a references to the underlying indices. If `None` is returned, then /// this subset spans the entire domain `data`. pub fn indices(&self) -> Option<&I> { self.indices.as_ref() } /// Return the superset of this `Subset`. This is just the set it was created with. pub fn into_super(self) -> S { self.data } } impl<'a, S: Set, I: AsRef<[usize]>> Subset<S, I> { /// Panics if this subset is invald. #[inline] fn validate(self) -> Self { if let Some(ref indices) = self.indices { let indices = indices.as_ref(); if let Some(first) = indices.first() { for &i in indices.iter() { assert!(i - *first < self.data.len(), "Subset index out of bounds."); } } } self } } // Note to self: // To enable a collection to be chunked, we need to implement: // Set, View, SplitAt // For mutability we also need ViewMut, // For UniChunked we need: // Set, Vew, IntoStaticChunkIterator /// Required for `Chunked` and `UniChunked` subsets. impl<S: Set, I: AsRef<[usize]>> Set for Subset<S, I> { type Elem = S::Elem; type Atom = S::Atom; /// Get the length of this subset. /// /// # Example /// /// ```rust /// use flatk::*; /// let v = vec![1,2,3,4,5]; /// let subset = Subset::from_indices(vec![0,2,4], v.as_slice()); /// assert_eq!(3, subset.len()); /// ``` fn len(&self) -> usize { self.indices .as_ref() .map_or(self.data.len(), |indices| indices.as_ref().len()) } } /// Required for `Chunked` and `UniChunked` subsets. impl<'a, S, I> View<'a> for Subset<S, I> where S: View<'a>, I: AsRef<[usize]>, { type Type = Subset<S::Type, &'a [usize]>; fn view(&'a self) -> Self::Type { // Note: it is assumed that the first index corresponds to the first // element in data, regardless of what the value of the index is. Subset { indices: self.indices.as_ref().map(|indices| indices.as_ref()), data: self.data.view(), } } } impl<'a, S, I> ViewMut<'a> for Subset<S, I> where S: Set + ViewMut<'a>, I: AsRef<[usize]>, { type Type = Subset<S::Type, &'a [usize]>; /// Create a mutable view into this subset. /// /// # Example /// /// ```rust /// use flatk::*; /// let mut v = vec![1,2,3,4,5]; /// let mut subset = Subset::from_indices(vec![0,2,4], v.as_mut_slice()); /// let mut view = subset.view_mut(); /// for i in view.iter_mut() { /// *i += 1; /// } /// assert_eq!(v, vec![2,2,4,4,6]); /// ``` fn view_mut(&'a mut self) -> Self::Type { // Note: it is assumed that the first index corresponds to the first // element in data, regardless of what the value of the index is. Subset { indices: self.indices.as_ref().map(|indices| indices.as_ref()), data: self.data.view_mut(), } } } /// This impl enables `Chunked` `Subset`s impl<V> SplitAt for SubsetView<'_, V> where V: Set + SplitAt, { /// Split this subset into two at the given index `mid`. /// /// # Example /// /// ```rust /// use flatk::*; /// let v = vec![1,2,3,4,5]; /// let indices = vec![0,2,4]; /// let subset = Subset::from_unique_ordered_indices(indices.as_slice(), v.as_slice()); /// let (l, r) = subset.split_at(1); /// let mut iter_l = l.iter(); /// assert_eq!(Some(&1), iter_l.next()); /// assert_eq!(None, iter_l.next()); /// let mut iter_r = r.iter(); /// assert_eq!(Some(&3), iter_r.next()); /// assert_eq!(Some(&5), iter_r.next()); /// assert_eq!(None, iter_r.next()); /// ``` fn split_at(self, mid: usize) -> (Self, Self) { if let Some(ref indices) = self.indices { let (indices_l, indices_r) = indices.split_at(mid); let n = self.data.len(); let offset = indices_r .first() .map(|first| *first - *indices_l.first().unwrap_or(first)) .unwrap_or(n); let (data_l, data_r) = self.data.split_at(offset); ( Subset { indices: Some(indices_l), data: data_l, }, Subset { indices: Some(indices_r), data: data_r, }, ) } else { let (data_l, data_r) = self.data.split_at(mid); ( Subset { indices: None, data: data_l, }, Subset { indices: None, data: data_r, }, ) } } } /// This impl enables `Subset`s of `Subset`s impl<S, I> SplitFirst for Subset<S, I> where I: SplitFirst + AsRef<[usize]>, <I as SplitFirst>::First: std::borrow::Borrow<usize>, S: Set + SplitAt + SplitFirst, { type First = S::First; /// Split the first element of this subset. fn split_first(self) -> Option<(Self::First, Self)> { use std::borrow::Borrow; let Subset { data, indices } = self; if let Some(indices) = indices { indices.split_first().map(|(first_index, rest_indices)| { let n = data.len(); let offset = rest_indices .as_ref() .first() .map(|next| *next - *first_index.borrow()) .unwrap_or(n); let (data_l, data_r) = data.split_at(offset); ( data_l.split_first().unwrap().0, Subset { indices: Some(rest_indices), data: data_r, }, ) }) } else { data.split_first().map(|(first, rest)| { ( first, Subset { indices: None, data: rest, }, ) }) } } } impl<S: Set + RemovePrefix, I: RemovePrefix + AsRef<[usize]>> RemovePrefix for Subset<S, I> { /// This function will panic if `n` is larger than `self.len()`. fn remove_prefix(&mut self, n: usize) { if n == 0 { return; } match self.indices { Some(ref mut indices) => { let first = indices.as_ref()[0]; // Will panic if out of bounds. indices.remove_prefix(n); let data_len = self.data.len(); let next = indices.as_ref().get(0).unwrap_or(&data_len); self.data.remove_prefix(*next - first); } None => { self.data.remove_prefix(n); } } } } impl<'a, S, I> Subset<S, I> where Self: Set + ViewIterator<'a>, { /// The typical way to use this function is to clone from a `SubsetView` /// into an owned `S` type. /// /// # Panics /// /// This function panics if `other` has a length unequal to `self.len()`. /// /// # Example /// /// ```rust /// use flatk::*; /// let v = vec![1,2,3,4,5]; /// let indices = vec![0,2,4]; /// let subset = Subset::from_unique_ordered_indices(indices.as_slice(), v.as_slice()); /// let mut owned = vec![0; 4]; /// subset.clone_into_other(&mut owned[..3]); // Need 3 elements to avoid panics. /// let mut iter_owned = owned.iter(); /// assert_eq!(owned, vec![1,3,5,0]); /// ``` pub fn clone_into_other<V>(&'a self, other: &'a mut V) where V: Set + ViewMutIterator<'a> + ?Sized, <Self as ViewIterator<'a>>::Item: CloneIntoOther<<V as ViewMutIterator<'a>>::Item>, { assert_eq!(other.len(), self.len()); for (mut theirs, mine) in other.view_mut_iter().zip(self.view_iter()) { mine.clone_into_other(&mut theirs); } } } /* * Indexing operators for convenience. Users familiar with indexing by `usize` * may find these implementations convenient. */ impl<'a, S, O> GetIndex<'a, Subset<S, O>> for usize where O: AsRef<[usize]>, S: Get<'a, usize>, { type Output = <S as Get<'a, usize>>::Output; fn get(self, subset: &Subset<S, O>) -> Option<Self::Output> { // TODO: too much bounds checking here, add a get_unchecked call to GetIndex. if let Some(ref indices) = subset.indices { indices.as_ref().get(0).and_then(|&first| { indices .as_ref() .get(self) .and_then(|&cur| Get::get(&subset.data, cur - first)) }) } else { Get::get(&subset.data, self) } } } impl<S, O> IsolateIndex<Subset<S, O>> for usize where O: AsRef<[usize]>, S: Isolate<usize>, { type Output = <S as Isolate<usize>>::Output; fn try_isolate(self, subset: Subset<S, O>) -> Option<Self::Output> { // TODO: too much bounds checking here, add a get_unchecked call to GetIndex. let Subset { indices, data } = subset; if let Some(ref indices) = indices { indices.as_ref().get(0).and_then(move |&first| { indices .as_ref() .get(self) .and_then(move |&cur| Isolate::try_isolate(data, cur - first)) }) } else { Isolate::try_isolate(data, self) } } } impl_isolate_index_for_static_range!(impl<S, O> for Subset<S, O>); //impl<S, I, O> Isolate<I> for Subset<S, O> //where // I: IsolateIndex<Self>, //{ // type Output = I::Output; // // fn try_isolate(self, range: I) -> Option<Self::Output> { // range.try_isolate(self) // } //} macro_rules! impl_index_fn { ($self:ident, $idx:ident, $index_fn:ident) => { $self .data .$index_fn($self.indices.as_ref().map_or($idx, |indices| { let indices = indices.as_ref(); indices[$idx] - *indices.first().unwrap() })) }; } impl<'a, S, I> std::ops::Index<usize> for Subset<S, I> where S: std::ops::Index<usize> + Set + ValueType, I: AsRef<[usize]>, { type Output = S::Output; /// Immutably index the subset. /// /// # Panics /// /// This function panics if the index is out of bounds or if the subset is empty. /// /// # Example /// /// ```rust /// use flatk::*; /// let c = Chunked2::from_flat((1..=12).collect::<Vec<_>>()); /// let subset = Subset::from_indices(vec![0,2,4], c.view()); /// assert_eq!([1,2], subset[0]); /// assert_eq!([5,6], subset[1]); /// assert_eq!([9,10], subset[2]); /// ``` fn index(&self, idx: usize) -> &Self::Output { impl_index_fn!(self, idx, index) } } impl<'a, S, I> std::ops::IndexMut<usize> for Subset<S, I> where S: std::ops::IndexMut<usize> + Set + ValueType, I: AsRef<[usize]>, { /// Mutably index the subset. /// /// # Panics /// /// This function panics if the index is out of bounds or if the subset is empty. /// /// # Example /// /// ```rust /// use flatk::*; /// let mut v = vec![1,2,3,4,5]; /// let mut subset = Subset::from_indices(vec![0,2,4], v.as_mut_slice()); /// assert_eq!(subset[1], 3); /// subset[1] = 100; /// assert_eq!(subset[0], 1); /// assert_eq!(subset[1], 100); /// assert_eq!(subset[2], 5); /// ``` fn index_mut(&mut self, idx: usize) -> &mut Self::Output { impl_index_fn!(self, idx, index_mut) } } impl<'a, T, I> std::ops::Index<usize> for Subset<&'a [T], I> where I: AsRef<[usize]>, { type Output = T; /// Immutably index the subset. /// /// # Panics /// /// This function panics if the index is out of bounds or if the subset is empty. /// /// # Example /// /// ```rust /// use flatk::*; /// let v = vec![1,2,3,4,5]; /// let subset = Subset::from_indices(vec![0,2,4], v.as_slice()); /// assert_eq!(3, subset[1]); /// ``` fn index(&self, idx: usize) -> &Self::Output { impl_index_fn!(self, idx, index) } } impl<'a, T, I> std::ops::Index<usize> for Subset<&'a mut [T], I> where I: AsRef<[usize]>, { type Output = T; /// Immutably index the subset. /// /// # Panics /// /// This function panics if the index is out of bounds or if the subset is empty. /// /// # Example /// /// ```rust /// use flatk::*; /// let mut v = vec![1,2,3,4,5]; /// let mut subset = Subset::from_indices(vec![0,2,4], v.as_mut_slice()); /// assert_eq!(3, subset[1]); /// ``` fn index(&self, idx: usize) -> &Self::Output { impl_index_fn!(self, idx, index) } } impl<'a, T, I> std::ops::IndexMut<usize> for Subset<&'a mut [T], I> where I: AsRef<[usize]>, { /// Mutably index the subset. /// /// # Panics /// /// This function panics if the index is out of bounds or if the subset is empty. /// /// # Example /// /// ```rust /// use flatk::*; /// let mut v = vec![1,2,3,4,5]; /// let mut subset = Subset::from_indices(vec![0,2,4], v.as_mut_slice()); /// assert_eq!(subset[1], 3); /// subset[1] = 100; /// assert_eq!(subset[0], 1); /// assert_eq!(subset[1], 100); /// assert_eq!(subset[2], 5); /// ``` fn index_mut(&mut self, idx: usize) -> &mut Self::Output { impl_index_fn!(self, idx, index_mut) } } /* * Iteration */ impl<S, I> IntoIterator for Subset<S, I> where S: SplitAt + SplitFirst + Set + Dummy, I: SplitFirst + Clone, <I as SplitFirst>::First: std::borrow::Borrow<usize>, { type Item = S::First; type IntoIter = SubsetIter<S, I>; /// Convert a `Subset` into an iterator. /// /// # Example /// /// ```rust /// use flatk::*; /// let mut s = Subset::from_unique_ordered_indices(vec![1,3,5], vec![1,2,3,4,5,6]); /// let mut iter = s.view().into_iter(); /// assert_eq!(Some(&2), iter.next()); /// assert_eq!(Some(&4), iter.next()); /// assert_eq!(Some(&6), iter.next()); /// assert_eq!(None, iter.next()); /// ``` fn into_iter(self) -> Self::IntoIter { SubsetIter { indices: self.indices, data: self.data, } } } // Iterator for `Subset`s pub struct SubsetIter<S, I> { indices: Option<I>, data: S, } // TODO: This can be made more efficient with two distinct iterators, thus eliminating the branch // on indices. impl<S, I> Iterator for SubsetIter<S, I> where S: SplitAt + SplitFirst + Set + Dummy, I: SplitFirst + Clone, <I as SplitFirst>::First: std::borrow::Borrow<usize>, { type Item = S::First; fn next(&mut self) -> Option<Self::Item> { use std::borrow::Borrow; let SubsetIter { indices, data } = self; let data_slice = std::mem::replace(data, unsafe { Dummy::dummy() }); match indices { Some(ref mut indices) => indices.clone().split_first().map(|(first, rest)| { let (item, right) = data_slice.split_first().expect("Corrupt subset"); if let Some((second, _)) = rest.clone().split_first() { let (_, r) = right.split_at(*second.borrow() - *first.borrow() - 1); *data = r; } else { // No more elements, the rest is empty, just discard the rest of data. // An alternative implementation simply assigns data to the empty version of S. // This would require additional traits so we settle for this possibly less // efficient version for now. let n = right.len(); let (_, r) = right.split_at(n); *data = r; } *indices = rest; item }), None => data_slice.split_first().map(|(item, rest)| { *data = rest; item }), } } } impl<'a, S, I> Subset<S, I> where S: Set + View<'a>, I: AsRef<[usize]>, { /// Immutably iterate over a borrowed subset. /// /// # Example /// /// ```rust /// use flatk::*; /// let mut v = vec![1,2,3,4,5]; /// let mut subset = Subset::from_indices(vec![0,2,4], v.as_mut_slice()); /// let mut iter = subset.iter(); /// assert_eq!(Some(&1), iter.next()); /// assert_eq!(Some(&3), iter.next()); /// assert_eq!(Some(&5), iter.next()); /// assert_eq!(None, iter.next()); /// ``` pub fn iter(&'a self) -> SubsetIter<S::Type, &'a [usize]> { SubsetIter { indices: self.indices.as_ref().map(|indices| indices.as_ref()), data: self.data.view(), } } } impl<'a, S, I> Subset<S, I> where S: Set + ViewMut<'a>, I: AsRef<[usize]>, { /// Mutably iterate over a borrowed subset. /// /// # Example /// /// ```rust /// use flatk::*; /// let mut v = vec![1,2,3,4,5]; /// let mut subset = Subset::from_indices(vec![0,2,4], v.as_mut_slice()); /// for i in subset.iter_mut() { /// *i += 1; /// } /// assert_eq!(v, vec![2,2,4,4,6]); /// ``` pub fn iter_mut(&'a mut self) -> SubsetIter<<S as ViewMut<'a>>::Type, &'a [usize]> { SubsetIter { indices: self.indices.as_ref().map(|indices| indices.as_ref()), data: self.data.view_mut(), } } } impl<'a, S, I> ViewIterator<'a> for Subset<S, I> where S: Set + View<'a>, I: AsRef<[usize]>, <S as View<'a>>::Type: SplitAt + SplitFirst + Set + Dummy, { type Item = <<S as View<'a>>::Type as SplitFirst>::First; type Iter = SubsetIter<S::Type, &'a [usize]>; fn view_iter(&'a self) -> Self::Iter { self.iter() } } impl<'a, S, I> ViewMutIterator<'a> for Subset<S, I> where S: Set + ViewMut<'a>, I: AsRef<[usize]>, <S as ViewMut<'a>>::Type: SplitAt + SplitFirst + Set + Dummy, { type Item = <<S as ViewMut<'a>>::Type as SplitFirst>::First; type Iter = SubsetIter<S::Type, &'a [usize]>; fn view_mut_iter(&'a mut self) -> Self::Iter { self.iter_mut() } } impl<S: Dummy, I> Dummy for Subset<S, I> { unsafe fn dummy() -> Self { Subset { data: Dummy::dummy(), indices: None, } } } impl<S: Truncate, I: Truncate> Truncate for Subset<S, I> { fn truncate(&mut self, new_len: usize) { match &mut self.indices { // The target data remains untouched. Some(indices) => indices.truncate(new_len), // Since the subset is entire it's ok to truncate the underlying data. None => self.data.truncate(new_len), } } } /* * Conversions */ // TODO: Add conversions for other subsets. impl<T> From<Vec<T>> for Subset<Vec<T>> { fn from(v: Vec<T>) -> Subset<Vec<T>> { Subset::all(v) } } /// Pass through the conversion for structure type `Subset`. impl<S: StorageInto<T>, I, T> StorageInto<T> for Subset<S, I> { type Output = Subset<S::Output, I>; fn storage_into(self) -> Self::Output { Subset { data: self.data.storage_into(), indices: self.indices, } } } /* * Data access */ impl<'a, S: StorageView<'a>, I> StorageView<'a> for Subset<S, I> { type StorageView = S::StorageView; /// Return a view to the underlying storage type. /// /// # Example /// /// ```rust /// use flatk::*; /// let v = vec![1,2,3,4,5,6,7,8,9,10,11,12]; /// let s0 = Chunked3::from_flat(v.clone()); /// let s1 = Subset::from_indices(vec![0, 2, 3], s0.clone()); /// assert_eq!(s1.storage_view(), v.as_slice()); /// ``` fn storage_view(&'a self) -> Self::StorageView { self.data.storage_view() } } impl<S: Storage, I> Storage for Subset<S, I> { type Storage = S::Storage; /// Return an immutable reference to the underlying storage type. /// /// # Example /// /// ```rust /// use flatk::*; /// let v = vec![1,2,3,4,5,6,7,8,9,10,11,12]; /// let s0 = Chunked3::from_flat(v.clone()); /// let s1 = Subset::from_indices(vec![0, 2, 3], s0.clone()); /// assert_eq!(s1.storage(), &v); /// ``` fn storage(&self) -> &Self::Storage { self.data.storage() } } impl<S: StorageMut, I> StorageMut for Subset<S, I> { /// Return a mutable reference to the underlying storage type. /// /// # Example /// /// ```rust /// use flatk::*; /// let mut v = vec![1,2,3,4,5,6,7,8,9,10,11,12]; /// let mut s0 = Chunked3::from_flat(v.clone()); /// let mut s1 = Subset::from_indices(vec![0, 2, 3], s0.clone()); /// assert_eq!(s1.storage_mut(), &mut v); /// ``` fn storage_mut(&mut self) -> &mut Self::Storage { self.data.storage_mut() } } /* * Subsets of uniformly chunked collections */ impl<S: ChunkSize, I> ChunkSize for Subset<S, I> { fn chunk_size(&self) -> usize { self.data.chunk_size() } } impl<S: ChunkSize, I, N: Dimension> Subset<UniChunked<S, N>, I> { pub fn inner_chunk_size(&self) -> usize { self.data.inner_chunk_size() } } /* * Convert views to owned types */ impl<S: IntoOwned, I: IntoOwned> IntoOwned for Subset<S, I> { type Owned = Subset<S::Owned, I::Owned>; fn into_owned(self) -> Self::Owned { Subset { indices: self.indices.map(|x| x.into_owned()), data: self.data.into_owned(), } } } impl<S, I> IntoOwnedData for Subset<S, I> where S: IntoOwnedData, { type OwnedData = Subset<S::OwnedData, I>; fn into_owned_data(self) -> Self::OwnedData { Subset { indices: self.indices, data: self.data.into_owned_data(), } } } /* * Impls for uniformly chunked sparse types */ impl<S, I, M> UniChunkable<M> for Subset<S, I> { type Chunk = Subset<S, I>; } #[cfg(test)] mod tests { use super::*; #[test] fn subset_of_subsets_iter() { let set = vec![1, 2, 3, 4, 5, 6]; let subset = Subset::from_unique_ordered_indices(vec![1, 3, 5], set); let subsubset = Subset::from_unique_ordered_indices(vec![0, 2], subset); let mut iter = subsubset.iter(); assert_eq!(Some(&2), iter.next()); assert_eq!(Some(&6), iter.next()); assert_eq!(None, iter.next()); } }