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

// Copyright © 2024 Mikhail Hogrefe
//
// This file is part of Malachite.
//
// Malachite is free software: you can redistribute it and/or modify it under the terms of the GNU
// Lesser General Public License (LGPL) as published by the Free Software Foundation; either version
// 3 of the License, or (at your option) any later version. See <https://www.gnu.org/licenses/>.

use crate::rational_sequences::RationalSequence;
use core::cmp::Ordering::{self, *};

impl<T: Eq + Ord> PartialOrd for RationalSequence<T> {
    /// Compares a [`RationalSequence`] to another [`RationalSequence`].
    ///
    /// See [here](RationalSequence::cmp) for more information.
    #[inline]
    fn partial_cmp(&self, other: &RationalSequence<T>) -> Option<Ordering> {
        Some(self.cmp(other))
    }
}

impl<T: Eq + Ord> Ord for RationalSequence<T> {
    /// Compares a [`RationalSequence`] to another [`RationalSequence`].
    ///
    /// The comparison is made lexicographically with respect to the element type's ordering.
    ///
    /// # Worst-case complexity
    /// $T(n) = O(n)$
    ///
    /// $M(n) = O(1)$
    ///
    /// where $T$ is time, $M$ is additional memory, and $n$ is `self.component_len()`.
    ///
    /// # Examples
    /// ```
    /// use malachite_base::rational_sequences::RationalSequence;
    ///
    /// assert!(
    ///     RationalSequence::from_slice(&[1, 2]) < RationalSequence::from_slices(&[1, 2], &[1])
    /// );
    /// assert!(
    ///     RationalSequence::from_slice(&[1, 2, 3])
    ///         < RationalSequence::from_slices(&[1, 2], &[3, 4])
    /// );
    /// ```
    fn cmp(&self, other: &RationalSequence<T>) -> Ordering {
        if self == other {
            Equal
        } else {
            Iterator::cmp(self.iter(), other.iter())
        }
    }
}