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 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119
use std;
use std::cmp::Ordering;
use std::convert::AsRef;
#[derive(Clone, Debug)]
pub struct Permutation {
forward: bool,
indices: Vec<usize>,
}
impl std::cmp::PartialEq for Permutation {
/// This method compares two Permutations for equality, and is used by `==`
fn eq(&self, other: &Permutation) -> bool {
if self.forward == other.forward {
self.indices == other.indices
} else {
self.indices
.iter()
.enumerate()
.all(|(i, &j)| other.indices[j] == i)
}
}
}
impl std::cmp::Eq for Permutation {}
impl<'a, 'b> std::ops::Mul<&'b Permutation> for &'a Permutation {
type Output = Permutation;
/// Multiply permutations, in the mathematical sense.
///
/// Given two permutations `a`, and `b`, `a * b` is defined as
/// the permutation created by first applying b, then applying a.
///
/// # Examples
///
/// ```
/// # use permutation::Permutation;
/// let p1 = Permutation::oneline([1, 0, 2]);
/// let p2 = Permutation::oneline([0, 2, 1]);
/// assert_eq!(&p1 * &p2, Permutation::oneline([1,2,0]));
/// ```
fn mul(self, rhs: &'b Permutation) -> Self::Output {
match (self.forward, rhs.forward) {
(_, false) => Permutation::oneline(self.apply_slice(&rhs.indices)).inverse(),
(false, true) => return self * &(rhs * &Permutation::one(self.len())),
(true, true) => Permutation {
forward: true,
indices: rhs.apply_inv_slice(&self.indices),
},
}
}
}
impl Permutation {
/// Create a permutation from a vector of indices.
///
/// from_vec(v) returns the permutation P such that P applied to [1,2,...,N] is v.
/// Note that this notation is the inverse of the usual [one-line notation](https://en.wikipedia.org/wiki/Permutation#Definition_and_notations)
/// used in mathematics. This is a known issue and may change in a newer release.
///
/// # Examples
///
/// ```
/// # use permutation::Permutation;
/// let vec = vec!['a','b','c','d'];
/// let permutation = Permutation::from_vec([0,2,3,1]);
/// assert_eq!(permutation.apply_slice(&vec), vec!['a','c','d','b']);
/// ```
#[deprecated(since = "0.4.0", note = "Please replace with oneline(vec).inverse()")]
pub fn from_vec<V>(vec: V) -> Permutation
where
V: Into<Vec<usize>>,
{
let result = Permutation {
forward: false,
indices: vec.into(),
};
debug_assert!(result.valid());
return result;
}
/// Create a permutation from zero-based oneline notation
///
/// This creates a permutation from [one-line notation](https://en.wikipedia.org/wiki/Permutation#Definition_and_notations)
/// notation used in mathematics, but using zero-based indices rather than the one-based indices
/// typically used in mathematics.
///
/// Note that this is the inverse notation used by the deprecated `Permutation::from_vec()`.
///
///
/// # Examples
///
/// ```
/// # use permutation::Permutation;
/// let vec = vec!['a','b','c','d'];
/// let permutation = Permutation::oneline([0,2,3,1]);
/// assert_eq!(permutation.apply_slice(&vec), vec!['a','d','b','c']);
/// ```
pub fn oneline<V>(vec: V) -> Permutation
where
V: Into<Vec<usize>>,
{
let result = Permutation {
forward: true,
indices: vec.into(),
};
debug_assert!(result.valid());
return result;
}
/// Computes the permutation that would sort a given slice.
///
/// This is the same as `permutation::sort()`, but assigned in-place to `self` rather than
/// allocating a new permutation.
///
/// # Panics
///
/// If self.len() != vec.len()
///
/// # Examples
///
/// ```
/// # use permutation::Permutation;
/// // Say you have a permutation that we don't need anymore...
/// let mut permutation = permutation::sort(&[0,1,2]);
///
/// // You can reuse it rather than allocating a new one, as long as the length is the same
/// let mut vec = vec!['z','w','h'];
/// permutation.assign_from_sort(&vec);
/// let permuted = permutation.apply_slice(&vec);
/// vec.sort();
/// assert_eq!(vec, permuted);
///
/// // You can also use it to sort multiple arrays based on the ordering of one.
/// let names = vec!["Bob", "Steve", "Jane"];
/// let salary = vec![10, 5, 15];
/// permutation.assign_from_sort(&salary);
/// let ordered_names = permutation.apply_slice(&names);
/// let ordered_salaries = permutation.apply_slice(&salary);
/// assert_eq!(ordered_names, vec!["Steve", "Bob", "Jane"]);
/// assert_eq!(ordered_salaries, vec![5, 10, 15]);
/// ```
pub fn assign_from_sort<T, S>(&mut self, slice: S)
where
T: Ord,
S: AsRef<[T]>,
{
let s = slice.as_ref();
assert_eq!(self.len(), s.len());
//We use the reverse permutation form, because its more efficient for applying to indices.
self.indices.sort_by_key(|&i| &s[i]);
}
/// Computes the permutation that would sort a given slice by a comparator.
///
/// This is the same as `permutation::sort_by()`, but assigned in-place to `self` rather than
/// allocating a new permutation.
///
/// # Panics
///
/// If self.len() != vec.len()
///
/// # Examples
///
/// ```
/// # use permutation::Permutation;
/// // Say you have a permutation that we don't need anymore...
/// let mut permutation = permutation::sort(&[0,1,2,3,4,5]);
///
/// // You can assign to it rather than allocating a new one, as long as the length is the same
/// let mut vec = vec!['z','w','h','a','s','j'];
/// permutation.assign_from_sort_by(&vec, |a, b| b.cmp(a));
/// let permuted = permutation.apply_slice(&vec);
/// vec.sort_by(|a,b| b.cmp(a));
/// assert_eq!(vec, permuted);
/// ```
pub fn assign_from_sort_by<T, S, F>(&mut self, slice: S, mut compare: F)
where
S: AsRef<[T]>,
F: FnMut(&T, &T) -> Ordering,
{
let s = slice.as_ref();
assert_eq!(self.indices.len(), s.len());
// We use the reverse permutation form, because its more efficient for applying to indices.
self.indices.sort_by(|&i, &j| compare(&s[i], &s[j]));
}
/// Computes the permutation that would sort a given slice by a key function.
///
/// This is the same as `permutation::sort_by_key()`, but assigned in-place to `self` rather than
/// allocating a new permutation.
///
/// # Panics
///
/// If self.len() != vec.len()
///
/// # Examples
///
/// ```
/// # use permutation::Permutation;
/// // Say you have a permutation that we don't need anymore...
/// let mut permutation = permutation::sort(&[0,1,2,3,4,5]);
///
/// // You can assign to it rather than allocating a new one, as long as the length is the same
/// let mut vec = vec![2, 4, 6, 8, 10, 11];
/// permutation.assign_from_sort_by_key(&vec, |a| a % 3);
/// let permuted = permutation.apply_slice(&vec);
/// vec.sort_by_key(|a| a % 3);
/// assert_eq!(vec, permuted);
/// ```
pub fn assign_from_sort_by_key<T, S, B, F>(&mut self, slice: S, mut f: F)
where
B: Ord,
S: AsRef<[T]>,
F: FnMut(&T) -> B,
{
let s = slice.as_ref();
assert_eq!(self.indices.len(), s.len());
//We use the reverse permutation form, because its more efficient for applying to indices.
self.indices.sort_by_key(|&i| f(&s[i]));
}
/// Return the identity permutation of size N.
///
/// This returns the identity permutation of N elements.
///
/// # Examples
/// ```
/// # use permutation::Permutation;
/// let vec = vec!['a','b','c','d'];
/// let permutation = Permutation::one(4);
/// assert_eq!(permutation.apply_slice(&vec), vec!['a','b','c','d']);
/// ```
pub fn one(len: usize) -> Permutation {
Permutation {
forward: false,
indices: (0..len).collect(),
}
}
/// Return the size of a permutation.
///
/// This is the number of elements that the permutation acts on.
///
/// # Examples
/// ```
/// use permutation::Permutation;
/// let permutation = Permutation::one(4);
/// assert_eq!(permutation.len(), 4);
/// ```
pub fn len(&self) -> usize {
return self.indices.len();
}
/// Check whether a permutation is valid.
///
/// A permutation can be invalid if it was constructed with an
/// incorrect vector using ``::from_vec()`` or ``::oneline()``.
/// Debug assertions will catch this on construction, so it should
/// never return true.
///
pub fn valid(&self) -> bool {
let mut sorted = self.indices.clone();
sorted.sort();
return sorted.iter().enumerate().all(|(i, &j)| i == j);
}
/// Return the inverse of a permutation.
///
/// This returns a permutation that will undo a given permutation.
/// Internally, this does not compute the inverse, but just flips a bit.
///
/// ```
/// # use permutation::Permutation;
/// let permutation = Permutation::oneline([0,2,3,1]);
/// assert_eq!(permutation.inverse(), Permutation::oneline([0,3,1,2]));
/// ```
pub fn inverse(mut self) -> Permutation {
self.forward ^= true;
return self;
}
/// Normalize the internal storage of the `Permutation`, optimizing it for forward or inverse application.
///
/// Internally, the permutation has a bit to indicate whether it is inverted.
/// This is because given a permutation P, it is just as easy to compute `P^-1 * Q`
/// as it is to compute `P * Q`. However, computing the entries of `P^-1` requires some computation.
/// However, when applying to the permutation to an index, the permutation has a "preferred" direction, which
/// is much quicker to compute.
///
/// The `normalize()` method does not change the value of the permutation, but
/// it converts it into the preferred form for applying `P` or its inverse, respectively.
///
/// If `backward` is `false`, it will be in the preferred form for applying `P`,
/// if `backward` is `true`, it will be in the preferred form for appling `P^-1`
///
/// # Examples
///
/// ```
/// # use permutation::Permutation;
/// let permutation = Permutation::oneline([0, 3, 2, 5, 1, 4]);
/// let reversed = permutation.inverse().normalize(true);
/// assert_eq!(reversed.apply_inv_idx(3), 5);
/// ```
pub fn normalize(self, backward: bool) -> Permutation {
if self.forward ^ backward {
self
} else {
let len = self.len();
if backward {
&self * &Permutation::one(len)
} else {
(&self.inverse() * &Permutation::one(len)).inverse()
}
}
}
fn apply_idx_fwd(&self, idx: usize) -> usize {
self.indices.iter().position(|&v| v == idx).unwrap()
}
fn apply_idx_bkwd(&self, idx: usize) -> usize {
self.indices[idx]
}
/// Apply the permutation to an index.
///
/// Given an index of an element, this will return the new index
/// of that element after applying the permutation.
///
/// Note that the running time will be O(1) or O(N) depending on
/// how the permutation is normalized (see [`Permutation::normalize`]).
///
/// # Examples
///
/// ```
/// # use permutation::Permutation;
/// let permutation = Permutation::oneline([0,2,1]);
/// assert_eq!(permutation.apply_idx(1), 2);
pub fn apply_idx(&self, idx: usize) -> usize {
match self.forward {
false => self.apply_idx_fwd(idx),
true => self.apply_idx_bkwd(idx),
}
}
/// Apply the inverse of a permutation to an index.
///
/// Given an index of an element, this will return the new index
/// of that element after applying 'P^-1'.
///
/// Equivalently, if `P.apply_idx(i) == j`, then `P.apply_inv_idx(j) == i`.
///
/// Note that the running time will be O(1) or O(N) depending on
/// how the permutation is normalized (see [`Permutation::normalize`]).
///
/// # Examples
///
/// ```
/// # use permutation::Permutation;
/// let permutation = Permutation::oneline([0,2,1]);
/// assert_eq!(permutation.apply_inv_idx(2), 1);
/// ```
pub fn apply_inv_idx(&self, idx: usize) -> usize {
match self.forward {
true => self.apply_idx_fwd(idx),
false => self.apply_idx_bkwd(idx),
}
}
fn apply_slice_fwd<T: Clone, S>(&self, slice: S) -> Vec<T>
where
S: AsRef<[T]>,
{
let s = slice.as_ref();
self.indices.iter().map(|&idx| s[idx].clone()).collect()
}
fn apply_slice_bkwd<T: Clone, S>(&self, slice: S) -> Vec<T>
where
S: AsRef<[T]>,
{
let s = slice.as_ref();
let mut other: Vec<T> = s.to_vec();
for (i, idx) in self.indices.iter().enumerate() {
other[*idx] = s[i].clone();
}
return other;
}
// For the in place methods, we apply each cycle in the permutation in turn, marking the indices with their MSB when
// they have been resolved. The MSB will always be unset as long as n <= isize::max_value().
// This way, we can recover the original indices in O(n) and perform no heap allocations.
#[inline(always)]
fn toggle_mark_idx(idx: usize) -> usize {
idx ^ isize::min_value() as usize
}
#[inline(always)]
fn idx_is_marked(idx: usize) -> bool {
(idx & (isize::min_value() as usize)) != 0
}
fn apply_slice_bkwd_in_place<T, S>(&mut self, slice: &mut S)
where
S: AsMut<[T]> + ?Sized,
{
let s = slice.as_mut();
assert_eq!(s.len(), self.len());
assert!(s.len() <= isize::max_value() as usize);
for idx in self.indices.iter() {
debug_assert!(!Self::idx_is_marked(*idx));
}
for i in 0..self.indices.len() {
let i_idx = self.indices[i];
if Self::idx_is_marked(i_idx) {
continue;
}
let mut j = i;
let mut j_idx = i_idx;
// When we loop back to the first index, we stop
while j_idx != i {
self.indices[j] = Self::toggle_mark_idx(j_idx);
s.swap(j, j_idx);
j = j_idx;
j_idx = self.indices[j];
}
self.indices[j] = Self::toggle_mark_idx(j_idx);
}
for idx in self.indices.iter_mut() {
debug_assert!(Self::idx_is_marked(*idx));
*idx = Self::toggle_mark_idx(*idx);
}
}
fn apply_slice_fwd_in_place<T, S>(&mut self, slice: &mut S)
where
S: AsMut<[T]> + ?Sized,
{
let s = slice.as_mut();
assert_eq!(s.len(), self.len());
assert!(s.len() <= isize::max_value() as usize);
for idx in self.indices.iter() {
debug_assert!(!Self::idx_is_marked(*idx));
}
for i in 0..self.indices.len() {
let i_idx = self.indices[i];
if Self::idx_is_marked(i_idx) {
continue;
}
let mut j = i;
let mut j_idx = i_idx;
// When we loop back to the first index, we stop
while j_idx != i {
self.indices[j] = Self::toggle_mark_idx(j_idx);
s.swap(i, j_idx);
j = j_idx;
j_idx = self.indices[j];
}
self.indices[j] = Self::toggle_mark_idx(j_idx);
}
for idx in self.indices.iter_mut() {
debug_assert!(Self::idx_is_marked(*idx));
*idx = Self::toggle_mark_idx(*idx);
}
}
/// Apply a permutation to a slice of elements
///
/// Given a slice of elements, this will permute the elements according
/// to this permutation and clone them to a `Vec`.
///
/// # Examples
///
/// ```
/// # use permutation::Permutation;
/// let permutation = Permutation::oneline([0,3,1,2]);
/// let vec = vec!['a','b','c','d'];
/// assert_eq!(permutation.apply_slice(&vec), vec!['a', 'c', 'd', 'b']);
/// ```
#[must_use]
pub fn apply_slice<T: Clone, S>(&self, slice: S) -> Vec<T>
where
S: AsRef<[T]>,
{
let s = slice.as_ref();
assert_eq!(s.len(), self.len());
match self.forward {
false => self.apply_slice_fwd(s),
true => self.apply_slice_bkwd(s),
}
}
/// Apply the inverse of a permutation to a slice of elements
///
/// Given a slice of elements, this will permute the elements according
/// to the inverse of this permutation and clone them to a `Vec`.
/// This is equivalent to "undoing" the permutation.
///
/// # Examples
///
/// ```
/// # use permutation::Permutation;
/// let permutation = Permutation::oneline([0,3,1,2]);
/// let vec = vec!['a','b', 'c', 'd'];
/// assert_eq!(permutation.apply_inv_slice(vec), vec!['a', 'd', 'b', 'c']);
/// ```
#[must_use]
pub fn apply_inv_slice<T: Clone, S>(&self, slice: S) -> Vec<T>
where
S: AsRef<[T]>,
{
let s = slice.as_ref();
assert_eq!(s.len(), self.len());
match self.forward {
false => self.apply_slice_bkwd(s),
true => self.apply_slice_fwd(s),
}
}
/// Apply a permutation to a slice of elements
///
/// Given a slice of elements, this will permute the elements in place according
/// to this permutation.
///
/// This method borrows `self` mutably to avoid allocations, but the permutation
/// will be unchanged after it returns.
///
/// # Panics
///
/// If `slice.len() != self.len()`.
/// If `slice.len()` > isize::max_value(), due to implementation reasons.
///
/// # Examples
///
/// ```
/// # use permutation::Permutation;
/// let mut permutation = Permutation::oneline([0,3,1,2]);
/// let mut vec = vec!['a', 'b', 'c', 'd'];
/// let permutation_old = permutation.clone();
/// permutation.apply_slice_in_place(&mut vec);
/// assert_eq!(vec, vec!['a', 'c', 'd', 'b']);
/// assert_eq!(permutation, permutation_old);
/// ```
pub fn apply_slice_in_place<T, S>(&mut self, slice: &mut S)
where
S: AsMut<[T]> + ?Sized,
{
match self.forward {
false => self.apply_slice_bkwd_in_place(slice),
true => self.apply_slice_fwd_in_place(slice),
}
}
/// Apply the inverse of a permutation to a slice of elements
///
/// Given a slice of elements, this will permute the elements in place according
/// to the inverse of this permutation.
/// This is equivalent to "undoing" the permutation.
///
/// This method borrows `self` mutably to avoid allocations, but the permutation
/// will be unchanged after it returns.
///
/// # Panics
///
/// If `slice.len() != self.len()`.
/// If `slice.len()` > isize::max_value(), due to implementation reasons.
///
/// # Examples
///
/// ```
/// # use permutation::Permutation;
/// let mut permutation = Permutation::oneline([0,3,1,2]);
/// let mut vec = vec!['a', 'b', 'c', 'd'];
/// permutation.apply_inv_slice_in_place(&mut vec);
/// assert_eq!(vec, vec!['a', 'd', 'b', 'c']);
/// ```
pub fn apply_inv_slice_in_place<T, S>(&mut self, slice: &mut S)
where
S: AsMut<[T]> + ?Sized,
{
match self.forward {
false => self.apply_slice_fwd_in_place(slice),
true => self.apply_slice_bkwd_in_place(slice),
}
}
}
/// Return the permutation that would sort a given slice.
///
/// This calculates the permutation that if it were applied to the slice,
/// would put the elements in sorted order.
///
/// # Examples
///
/// ```
/// # use permutation::Permutation;
/// let mut vec = vec!['z','w','h','a','s','j'];
/// let permutation = permutation::sort(&vec);
/// let permuted = permutation.apply_slice(&vec);
/// vec.sort();
/// assert_eq!(vec, permuted);
/// ```
///
/// You can also use it to sort multiple arrays based on the ordering of one.
///
/// ```
/// let names = vec!["Bob", "Steve", "Jane"];
/// let salary = vec![10, 5, 15];
/// let permutation = permutation::sort(&salary);
/// let ordered_names = permutation.apply_slice(&names);
/// let ordered_salaries = permutation.apply_slice(&salary);
/// assert_eq!(ordered_names, vec!["Steve", "Bob", "Jane"]);
/// assert_eq!(ordered_salaries, vec![5, 10, 15]);
/// ```
pub fn sort<T, S>(slice: S) -> Permutation
where
T: Ord,
S: AsRef<[T]>,
{
let s = slice.as_ref();
let mut permutation = Permutation::one(s.len());
//We use the reverse permutation form, because its more efficient for applying to indices.
permutation.indices.sort_by_key(|&i| &s[i]);
return permutation;
}
/// Return the permutation that would sort a given slice, but might not
/// preserve the order of equal elements.
///
/// This calculates the permutation that if it were applied to the slice,
/// would put the elements in sorted order.
///
/// # Examples
///
/// ```
/// # use permutation::Permutation;
/// let mut vec = vec!['z','w','h','a','s','j'];
/// let permutation = permutation::sort_unstable(&vec);
/// let permuted = permutation.apply_slice(&vec);
/// vec.sort();
/// assert_eq!(vec, permuted);
/// ```
///
/// You can also use it to sort multiple arrays based on the ordering of one.
///
/// ```
/// let names = vec!["Bob", "Steve", "Jane"];
/// let salary = vec![10, 5, 15];
/// let permutation = permutation::sort_unstable(&salary);
/// let ordered_names = permutation.apply_slice(&names);
/// let ordered_salaries = permutation.apply_slice(&salary);
/// assert_eq!(ordered_names, vec!["Steve", "Bob", "Jane"]);
/// assert_eq!(ordered_salaries, vec![5, 10, 15]);
/// ```
pub fn sort_unstable<T, S>(slice: S) -> Permutation
where
T: Ord,
S: AsRef<[T]>,
{
let s = slice.as_ref();
let mut permutation = Permutation::one(s.len());
//We use the reverse permutation form, because its more efficient for applying to indices.
permutation.indices.sort_unstable_by_key(|&i| &s[i]);
return permutation;
}
/// Return the permutation that would sort a given slice by a comparator.
///
/// This is the same as `permutation::sort()` except that it allows you to specify
/// the comparator to use when sorting similar to `std::slice.sort_by()`.
///
/// If the comparator does not define a total ordering, the order of the elements is unspecified.
/// Per the [Rust Docs](https://doc.rust-lang.org/std/vec/struct.Vec.html#method.sort_by),
/// an order is a total order if it is (for all `a`, `b` and `c`):
///
/// * total and antisymmetric: exactly one of `a < b`, `a == b` or `a > b` is true, and
/// * transitive, `a < b` and `b < c` implies `a < c`. The same must hold for both `==` and `>`.
///
/// # Examples
///
/// ```
/// # use permutation::Permutation;
/// let mut vec = vec!['z','w','h','a','s','j'];
/// let permutation = permutation::sort_by(&vec, |a, b| b.cmp(a));
/// let permuted = permutation.apply_slice(&vec);
/// vec.sort_by(|a,b| b.cmp(a));
/// assert_eq!(vec, permuted);
/// ```
pub fn sort_by<T, S, F>(slice: S, mut compare: F) -> Permutation
where
S: AsRef<[T]>,
F: FnMut(&T, &T) -> Ordering,
{
let s = slice.as_ref();
let mut permutation = Permutation::one(s.len());
//We use the reverse permutation form, because its more efficient for applying to indices.
permutation.indices.sort_by(|&i, &j| compare(&s[i], &s[j]));
return permutation;
}
/// Return the permutation that would sort a given slice by a comparator, but might not
/// preserve the order of equal elements.
///
/// This is the same as `permutation::sort_unstable()` except that it allows you to specify
/// the comparator to use when sorting similar to `std::slice.sort_unstable_by()`.
///
/// If the comparator does not define a total ordering, the order of the elements is unspecified.
/// Per the [Rust Docs](https://doc.rust-lang.org/std/vec/struct.Vec.html#method.sort_unstable_by),
/// an order is a total order if it is (for all `a`, `b` and `c`):
///
/// * total and antisymmetric: exactly one of `a < b`, `a == b` or `a > b` is true, and
/// * transitive, `a < b` and `b < c` implies `a < c`. The same must hold for both `==` and `>`.
///
/// # Examples
///
/// ```
/// # use permutation::Permutation;
/// let mut vec = vec!['z','w','h','a','s','j'];
/// let permutation = permutation::sort_unstable_by(&vec, |a, b| b.cmp(a));
/// let permuted = permutation.apply_slice(&vec);
/// vec.sort_by(|a,b| b.cmp(a));
/// assert_eq!(vec, permuted);
/// ```
pub fn sort_unstable_by<T, S, F>(slice: S, mut compare: F) -> Permutation
where
S: AsRef<[T]>,
F: FnMut(&T, &T) -> Ordering,
{
let s = slice.as_ref();
let mut permutation = Permutation::one(s.len());
//We use the reverse permutation form, because its more efficient for applying to indices.
permutation
.indices
.sort_unstable_by(|&i, &j| compare(&s[i], &s[j]));
return permutation;
}
/// Return the permutation that would sort a given slice by a key function.
///
/// This is the same as `permutation::sort()` except that it allows you to specify
/// the key function simliar to `std::slice.sort_by_key()`
///
/// # Examples
///
/// ```
/// # use permutation::Permutation;
/// let mut vec = vec![2, 4, 6, 8, 10, 11];
/// let permutation = permutation::sort_by_key(&vec, |a| a % 3);
/// let permuted = permutation.apply_slice(&vec);
/// vec.sort_by_key(|a| a % 3);
/// assert_eq!(vec, permuted);
/// ```
pub fn sort_by_key<T, S, B, F>(slice: S, mut f: F) -> Permutation
where
B: Ord,
S: AsRef<[T]>,
F: FnMut(&T) -> B,
{
let s = slice.as_ref();
let mut permutation = Permutation::one(s.len());
//We use the reverse permutation form, because its more efficient for applying to indices.
permutation.indices.sort_by_key(|&i| f(&s[i]));
return permutation;
}
/// Return the permutation that would sort a given slice by a key function, but might not
/// preserve the order of equal elements.
///
/// This is the same as `permutation::sort_unstable()` except that it allows you to specify
/// the key function simliar to `std::slice.sort_unstable_by_key()`
///
/// # Examples
///
/// ```
/// # use permutation::Permutation;
/// let mut vec = vec![2, 4, 6, 8, 10, 11];
/// let permutation = permutation::sort_unstable_by_key(&vec, |a| a % 3);
/// let permuted = permutation.apply_slice(&vec);
/// vec.sort_by_key(|a| a % 3);
/// assert_eq!(vec, permuted);
/// ```
pub fn sort_unstable_by_key<T, S, B, F>(slice: S, mut f: F) -> Permutation
where
B: Ord,
S: AsRef<[T]>,
F: FnMut(&T) -> B,
{
let s = slice.as_ref();
let mut permutation = Permutation::one(s.len());
//We use the reverse permutation form, because its more efficient for applying to indices.
permutation.indices.sort_unstable_by_key(|&i| f(&s[i]));
return permutation;
}
#[cfg(test)]
mod tests {
use permutation;
use permutation::Permutation;
#[test]
fn basics() {
let p1 = Permutation::one(5);
let p2 = Permutation::one(5);
assert!(p1.valid());
assert_eq!(p1, p2);
let p3 = Permutation::one(6);
assert!(p1 != p3);
assert_eq!(&p1 * &p2, p1);
assert_eq!(p1.clone().inverse(), p1);
}
#[test]
#[allow(deprecated)]
fn from_vec_oneline() {
let p_from_vec = Permutation::from_vec(vec![0, 1, 2]);
let p_oneline = Permutation::oneline(vec![0, 1, 2]);
assert_eq!(p_from_vec, p_oneline);
}
#[test]
fn oneline() {
let p = Permutation::oneline(vec![0, 1, 2]);
assert!(p.valid());
}
#[test]
fn oneline_slice() {
let v = vec![0, 1, 2];
let p = Permutation::oneline(&v[..]);
assert!(p.valid());
}
#[test]
fn oneline_array() {
let p = Permutation::oneline([0, 1, 2]);
assert!(p.valid());
}
#[test]
fn powers() {
let id = Permutation::one(3);
let p1 = Permutation::oneline([1, 0, 2]);
let square = &p1 * &p1;
assert_eq!(square, id);
let cube = &p1 * □
assert_eq!(cube, p1);
}
#[test]
fn prod() {
let p1 = Permutation::oneline([1, 0, 2]);
let p2 = Permutation::oneline([0, 2, 1]);
let prod = &p1 * &p2;
assert_eq!(prod, Permutation::oneline([1, 2, 0]));
}
#[test]
fn len() {
let p1 = Permutation::oneline([1, 0, 2]);
assert_eq!(p1.len(), 3)
}
fn check_not_equal_inverses(p2: &Permutation, p3: &Permutation) {
assert!(*p2 != *p3);
assert_eq!(p2 * p3, Permutation::one(p2.len()));
assert_eq!(p3 * p2, Permutation::one(p2.len()));
assert_eq!(*p2, p3.clone().inverse());
assert_eq!(p2.clone().inverse(), *p3);
assert!(p2.clone().inverse() != p3.clone().inverse());
assert!(p2 * &p3.clone().inverse() != Permutation::one(p2.len()));
assert!(&p2.clone().inverse() * p3 != Permutation::one(p2.len()));
}
#[test]
fn inverse() {
let p1 = Permutation::oneline([1, 0, 2]);
let rev = p1.clone().inverse();
assert_eq!(p1, rev);
//An element and its inverse
let p2 = Permutation::oneline([1, 2, 0, 4, 3]);
let p3 = Permutation::oneline([2, 0, 1, 4, 3]);
check_not_equal_inverses(&p2, &p3);
println!(
"{:?}, {:?}, {:?}",
p2.clone().inverse(),
p3.clone().inverse(),
&p2.clone().inverse() * &p3.clone().inverse()
);
assert_eq!(
&p2.clone().inverse() * &p3.clone().inverse(),
Permutation::one(p2.len())
);
//An element, and a distinct element which is not its inverse.
let p4 = Permutation::oneline([1, 2, 0, 3, 4]);
let p5 = Permutation::oneline([2, 0, 1, 4, 3]);
assert!(p4 != p5);
assert!(p4 != p5.clone().inverse());
assert!(p4.clone().inverse() != p5);
assert!(p4.clone().inverse() != p5.clone().inverse());
assert!(&p4 * &p5 != Permutation::one(p4.len()));
assert!(&p5 * &p4 != Permutation::one(p4.len()));
assert!(&p4.clone().inverse() * &p5 != Permutation::one(p4.len()));
assert!(&p4 * &p5.clone().inverse() != Permutation::one(p4.len()));
}
#[test]
fn sort_slice() {
let elems = ['a', 'b', 'g', 'e', 'f'];
let perm = permutation::sort(&elems[..]);
println!("{:?}", perm);
assert_eq!(perm, Permutation::oneline([0, 1, 4, 2, 3]));
}
#[test]
fn sort_array() {
let elems = ['a', 'b', 'e', 'g', 'f'];
permutation::sort(elems);
}
#[test]
fn sort_array_ref() {
let elems = ['a', 'b', 'e', 'g', 'f'];
permutation::sort(&elems);
}
#[test]
fn sort_vec() {
let elems = vec!['a', 'b', 'e', 'g', 'f'];
permutation::sort(&elems);
}
#[test]
fn strings() {
let elems = ["doggie", "cat", "doggo", "dog", "doggies", "god"];
let perm = permutation::sort(&elems);
assert_eq!(perm, Permutation::oneline([2, 0, 4, 1, 3, 5]));
assert!(perm.apply_slice(&elems) == ["cat", "dog", "doggie", "doggies", "doggo", "god"]);
let parallel = ["doggie1", "cat1", "doggo1", "dog1", "doggies1", "god1"];
let par_permuted = perm.apply_slice(¶llel);
println!("{:?}", par_permuted);
assert_eq!(
par_permuted,
["cat1", "dog1", "doggie1", "doggies1", "doggo1", "god1"]
);
assert_eq!(perm.apply_inv_slice(par_permuted), parallel);
}
#[test]
fn by_key() {
let arr = [1, 10, 9, 8];
let perm = permutation::sort_by_key(arr, |i| -i);
assert_eq!(perm, Permutation::oneline([3, 0, 1, 2]));
}
#[test]
fn by_cmp() {
let arr = ["aaabaab", "aba", "cas", "aaab"];
let perm = permutation::sort_by(arr, |a, b| a.cmp(b));
assert_eq!(perm, Permutation::oneline([1, 2, 3, 0]));
}
#[test]
fn by_partially_ordered_cmp() {
let arr = [1.0, 5.0, 3.0, 2.0, 8.0];
let perm = permutation::sort_by(arr, |a, b| a.partial_cmp(b).unwrap());
assert!(perm == Permutation::oneline([0, 3, 2, 1, 4]));
}
#[test]
fn apply_array() {
let arr = [1, 10, 9, 8];
let perm = permutation::sort_by_key(arr, |i| -i);
assert_eq!(perm, Permutation::oneline([3, 0, 1, 2]));
}
#[test]
fn indices() {
let arr = [100, 10, 1, 1000];
let perm = permutation::sort_by_key(arr, |x| -x);
println!("{:?}", perm.apply_inv_idx(0));
assert_eq!(perm.apply_inv_idx(0), 3);
assert_eq!(perm.apply_idx(3), 0);
assert_eq!(perm.apply_inv_idx(1), 0);
assert_eq!(perm.apply_idx(0), 1);
assert_eq!(perm.apply_inv_idx(2), 1);
assert_eq!(perm.apply_idx(1), 2);
assert_eq!(perm.apply_inv_idx(3), 2);
assert_eq!(perm.apply_idx(2), 3);
}
#[test]
fn normalize() {
let arr = [100, 10, 1, 1000];
let perm = permutation::sort_by_key(arr, |x| -x);
let f = perm.clone().normalize(false);
let b = perm.clone().normalize(true);
assert_eq!(perm, f);
assert_eq!(f, b);
for idx in 0..perm.len() {
assert_eq!(perm.apply_idx(idx), f.apply_idx(idx));
assert_eq!(f.apply_idx(idx), b.apply_idx(idx));
assert_eq!(perm.apply_inv_idx(idx), f.apply_inv_idx(idx));
assert_eq!(f.apply_inv_idx(idx), b.apply_inv_idx(idx));
}
let inv = perm.clone().inverse();
let fi = inv.clone().normalize(false);
let bi = inv.clone().normalize(true);
assert_eq!(inv, fi);
assert_eq!(fi, bi);
for idx in 0..perm.len() {
assert_eq!(inv.apply_idx(idx), fi.apply_idx(idx));
assert_eq!(fi.apply_idx(idx), bi.apply_idx(idx));
assert_eq!(inv.apply_inv_idx(idx), fi.apply_inv_idx(idx));
assert_eq!(fi.apply_inv_idx(idx), bi.apply_inv_idx(idx));
}
}
#[test]
fn normalize_inv() {
let p1 = Permutation::oneline([1, 0, 2]);
let rev = p1.clone().inverse();
assert_eq!(p1, rev);
//An element and its inverse
let mut p2 = Permutation::oneline([2, 0, 1, 4, 3]);
let mut p3 = Permutation::oneline([1, 2, 0, 4, 3]);
p2 = p2.normalize(false);
p3 = p3.normalize(false);
check_not_equal_inverses(&p2, &p3);
p2 = p2.normalize(true);
p3 = p3.normalize(true);
check_not_equal_inverses(&p2, &p3);
p2 = p2.normalize(true);
p3 = p3.normalize(false);
check_not_equal_inverses(&p2, &p3);
p2 = p2.normalize(false);
p3 = p3.normalize(true);
check_not_equal_inverses(&p2, &p3);
}
#[test]
fn apply_slice_in_place_vec() {
let mut p = Permutation::oneline([1, 2, 0, 4, 3]);
let mut vec = vec!['a', 'b', 'c', 'd', 'e'];
p.apply_slice_in_place(&mut vec);
assert_eq!(vec, vec!['c', 'a', 'b', 'e', 'd']);
}
#[test]
fn apply_unnorm_in_place() {
let mut p = Permutation::oneline([1, 2, 0, 4, 3]).normalize(false);
let p_old = p.clone();
let mut vec = ['a', 'b', 'c', 'd', 'e'];
p.apply_slice_in_place(&mut vec);
assert_eq!(vec, ['c', 'a', 'b', 'e', 'd']);
assert_eq!(p.indices, p_old.indices);
assert_eq!(p.forward, p_old.forward);
}
#[test]
fn apply_norm_in_place() {
let mut p = Permutation::oneline([1, 2, 0, 4, 3]).normalize(true);
let p_old = p.clone();
let mut vec = ['a', 'b', 'c', 'd', 'e'];
p.apply_slice_in_place(&mut vec);
assert_eq!(vec, ['c', 'a', 'b', 'e', 'd']);
assert_eq!(p.indices, p_old.indices);
assert_eq!(p.forward, p_old.forward);
}
#[test]
fn apply_inv_unnorm_place() {
let mut p = Permutation::oneline([1, 2, 0, 4, 3])
.inverse()
.normalize(false);
let p_old = p.clone();
let mut vec = ['c', 'a', 'b', 'e', 'd'];
p.apply_slice_in_place(&mut vec);
assert_eq!(vec, ['a', 'b', 'c', 'd', 'e']);
assert_eq!(p.indices, p_old.indices);
assert_eq!(p.forward, p_old.forward);
}
#[test]
fn apply_inv_norm_in_place() {
let mut p = Permutation::oneline([1, 2, 0, 4, 3])
.inverse()
.normalize(true);
let p_old = p.clone();
let mut vec = ['c', 'a', 'b', 'e', 'd'];
p.apply_slice_in_place(&mut vec);
assert_eq!(vec, ['a', 'b', 'c', 'd', 'e']);
assert_eq!(p.indices, p_old.indices);
assert_eq!(p.forward, p_old.forward);
}
}