Struct SortedSeq 

pub struct SortedSeq<T>(/* private fields */);

座標圧縮です。

Examples

use zarts::SortedSeq;
let values = vec![2, -1, -1, 5, -1, 2, -3];
// -3, -1, 2, 5
let seq = SortedSeq::new(values);
assert_eq!(seq.ord(&-3), 0);
assert_eq!(seq.ord(&-1), 1);
assert_eq!(seq.ord(&2), 2);
assert_eq!(seq.ord(&5), 3);

assert_eq!(seq.at(0), Some(&(-3)));
assert_eq!(seq.at(1), Some(&(-1)));
assert_eq!(seq.at(2), Some(&2));
assert_eq!(seq.at(3), Some(&5));
assert_eq!(seq.at(4), None);

Panics

構築時に与えられなかったキーを引くとパニックです。

use zarts::SortedSeq;
let primes = vec![2, 3, 5, 7, 11];
let seq = SortedSeq::new(primes);
seq.ord(&4);

Implementations

impl<T> SortedSeq<T>

where T: Ord,

pub fn new(values: Vec<T>) -> Self

pub fn ord(&self, value: &T) -> usize

集合内で小さいほうから何番目か (0-indexed) を返します

pub fn at(&self, index: usize) -> Option<&T>

index 番目の値を返します

Examples

use zarts::SortedSeq;

let seq = SortedSeq::new(vec![4, 16, 9, 1]);
// 1, 4, 9, 16
assert_eq!(seq.at(0), Some(&1));
assert_eq!(seq.at(1), Some(&4));
assert_eq!(seq[2], 9);
assert_eq!(seq[3], 16);
assert_eq!(seq.at(4), None);

pub fn len(&self) -> usize

集合のサイズを返します

pub fn is_empty(&self) -> bool

pub fn iter(&self) -> impl Iterator<Item = &T>

Trait Implementations

impl<T: Clone> Clone for SortedSeq<T>

fn clone(&self) -> SortedSeq<T>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T> Debug for SortedSeq<T>

where T: Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T> FromIterator<T> for SortedSeq<T>

where T: Ord,

fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self

Creates a value from an iterator.

impl<T> Index<usize> for SortedSeq<T>

type Output = T

The returned type after indexing.

fn index(&self, index: usize) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<T: PartialEq> PartialEq for SortedSeq<T>

fn eq(&self, other: &SortedSeq<T>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T: Eq> Eq for SortedSeq<T>

impl<T> StructuralPartialEq for SortedSeq<T>