SpanTraitExt

Fully qualified path: alexandria_data_structures::span_ext::SpanTraitExt

#![allow(unused)]
fn main() {
pub trait SpanTraitExt<T, +Clone<T>, +Drop<T>>
}

Trait functions

pop_front_n

Removes up to n elements from the front of self and returns them in a new span.

Arguments

• self - The span to modify
• n - The number of elements to remove from the front

Fully qualified path: alexandria_data_structures::span_ext::SpanTraitExt::pop_front_n

#![allow(unused)]
fn main() {
fn pop_front_n(ref self: Span<T>, n: usize) -> Span<T>
}

pop_back_n

Removes up to n elements from the back of self and returns them in a new span.

Arguments

• self - The span to modify
• n - The number of elements to remove from the back

Fully qualified path: alexandria_data_structures::span_ext::SpanTraitExt::pop_back_n

#![allow(unused)]
fn main() {
fn pop_back_n(ref self: Span<T>, n: usize) -> Span<T>
}

remove_front_n

Removes up to n elements from the front of self.

Arguments

• self - The span to modify
• n - The number of elements to remove from the front

Fully qualified path: alexandria_data_structures::span_ext::SpanTraitExt::remove_front_n

#![allow(unused)]
fn main() {
fn remove_front_n(ref self: Span<T>, n: usize)
}

remove_back_n

Removes up to n elements from the back of self.

Arguments

• self - The span to modify
• n - The number of elements to remove from the back

Fully qualified path: alexandria_data_structures::span_ext::SpanTraitExt::remove_back_n

#![allow(unused)]
fn main() {
fn remove_back_n(ref self: Span<T>, n: usize)
}

concat

Clones and appends all the elements of self and then other in a single new array.

Arguments

• self - The first span to concatenate
• other - The second span to concatenate

Fully qualified path: alexandria_data_structures::span_ext::SpanTraitExt::concat

#![allow(unused)]
fn main() {
fn concat(self: Span<T>, other: Span<T>) -> Array<T>
}

reversed

Return a new array containing the elements of self in a reversed order.

Arguments

• self - The span to reverse

Fully qualified path: alexandria_data_structures::span_ext::SpanTraitExt::reversed

#![allow(unused)]
fn main() {
fn reversed(self: Span<T>) -> Array<T>
}

contains

Returns true if the span contains an element with the given value.

Arguments

• self - The span to search
• item - The value to search for

Fully qualified path: alexandria_data_structures::span_ext::SpanTraitExt::contains

#![allow(unused)]
fn main() {
fn contains<+PartialEq<T>>(self: Span<T>, item: @T) -> bool
}

position

Searches for an element the span, returning its index.

Arguments

• self - The span to search
• item - The value to search for

Fully qualified path: alexandria_data_structures::span_ext::SpanTraitExt::position

#![allow(unused)]
fn main() {
fn position<+PartialEq<T>>(self: Span<T>, item: @T) -> Option<usize>
}

occurrences

Returns the number of elements in the span with the given value.

Arguments

• self - The span to search
• item - The value to count

Fully qualified path: alexandria_data_structures::span_ext::SpanTraitExt::occurrences

#![allow(unused)]
fn main() {
fn occurrences<+PartialEq<T>>(self: Span<T>, item: @T) -> usize
}

min

Returns the minimum element of a span.

Arguments

• self - The span to find the minimum value in

Fully qualified path: alexandria_data_structures::span_ext::SpanTraitExt::min

#![allow(unused)]
fn main() {
fn min<+PartialOrd<@T>>(self: Span<T>) -> Option<T>
}

min_position

Returns the position of the minimum element of a span.

Arguments

• self - The span to find the minimum position in

Fully qualified path: alexandria_data_structures::span_ext::SpanTraitExt::min_position

#![allow(unused)]
fn main() {
fn min_position<+PartialOrd<@T>>(self: Span<T>) -> Option<usize>
}

max

Returns the maximum element of a span.

Arguments

• self - The span to find the maximum value in

Fully qualified path: alexandria_data_structures::span_ext::SpanTraitExt::max

#![allow(unused)]
fn main() {
fn max<+PartialOrd<@T>>(self: Span<T>) -> Option<T>
}

max_position

Returns the position of the maximum element of a span.

Arguments

• self - The span to find the maximum position in

Fully qualified path: alexandria_data_structures::span_ext::SpanTraitExt::max_position

#![allow(unused)]
fn main() {
fn max_position<+PartialOrd<@T>>(self: Span<T>) -> Option<usize>
}

dedup

Returns a new array, cloned from self but removes consecutive repeated elements. If the span is sorted, this removes all duplicates.

Arguments

• self - The span to deduplicate

Fully qualified path: alexandria_data_structures::span_ext::SpanTraitExt::dedup

#![allow(unused)]
fn main() {
fn dedup<+PartialEq<T>>(self: Span<T>) -> Array<T>
}

unique

Returns a new array, cloned from self but without any duplicate.

Arguments

• self - The span to get unique elements from

Fully qualified path: alexandria_data_structures::span_ext::SpanTraitExt::unique

#![allow(unused)]
fn main() {
fn unique<+PartialEq<T>>(self: Span<T>) -> Array<T>
}