Struct Array 

#[repr(transparent)]
pub struct Array<T = JsValue> {
    pub obj: Object,
    pub generics: PhantomData<fn() -> (T,)>,
}

Fields

obj: Object

generics: PhantomData<fn() -> (T,)>

Implementations

impl Array

pub fn new() -> Array

Creates a new empty array.

MDN documentation

impl<T> Array<T>

pub fn new_typed() -> Array<T>

where Array<T>: ErasableGenericOwn<Array<JsValue>> + EncodeTypeDef + BatchableResult,

Creates a new empty array.

MDN documentation

impl Array

pub fn new_with_length(len: u32) -> Array

Creates a new array with the specified length (elements are initialized to undefined).

MDN documentation

impl<T> Array<T>

pub fn new_with_length_typed(len: u32) -> Array<T>

where Array<T>: ErasableGenericOwn<Array<JsValue>> + EncodeTypeDef + BatchableResult,

Creates a new array with the specified length (elements are initialized to undefined).

MDN documentation

impl<T> Array<T>

pub fn at(&self, index: i32) -> T

where T: ErasableGenericOwn<JsValue> + EncodeTypeDef + BatchableResult,

Retrieves the element at the index, counting from the end if negative (returns undefined if the index is out of range).

MDN documentation

impl<T> Array<T>

pub fn get(&self, index: u32) -> T

where T: ErasableGenericOwn<JsValue> + EncodeTypeDef + BatchableResult,

Retrieves the element at the index (returns undefined if the index is out of range).

MDN documentation

impl<T> Array<T>

pub fn get_unchecked(&self, index: u32) -> T

where T: ErasableGenericOwn<JsValue> + EncodeTypeDef + BatchableResult,

Retrieves the element at the index (returns undefined if the index is out of range).

MDN documentation

impl<T> Array<T>

pub fn get_checked(&self, index: u32) -> Option<T>

where Option<T>: ErasableGenericOwn<Option<JsValue>> + EncodeTypeDef + BatchableResult,

Retrieves the element at the index (returns None if the index is out of range, or if the element is explicitly undefined).

impl<T> Array<T>

pub fn set(&self, index: u32, value: T)

where T: ErasableGenericOwn<JsValue> + EncodeTypeDef + BinaryEncode,

Sets the element at the index (auto-enlarges the array if the index is out of range).

impl<T> Array<T>

pub fn set_ref(&self, index: u32, value: &T)

where T: ErasableGenericBorrow<JsValue> + EncodeTypeDef, for<'__wry_bindgen> &'__wry_bindgen T: BinaryEncode,

Sets the element at the index (auto-enlarges the array if the index is out of range).

impl<T> Array<T>

pub fn delete(&self, index: u32)

Deletes the element at the index (does nothing if the index is out of range).

The element at the index is set to undefined.

This does not resize the array, the array will still be the same length.

impl Array

pub fn from(val: &JsValue) -> Array

The Array.from() static method creates a new, shallow-copied Array instance from an array-like or iterable object.

MDN documentation

impl Array

pub fn from_iterable<I>(val: &I) -> Result<Array<I::Item>, JsValue>

where I: ErasableGenericBorrow<JsValue> + EncodeTypeDef + Iterable, for<'__wry_bindgen> &'__wry_bindgen I: BinaryEncode, Result<Array<I::Item>, JsValue>: ErasableGenericOwn<Result<Array<JsValue>, JsValue>> + EncodeTypeDef + BatchableResult,

The Array.from() static method creates a new, shallow-copied Array instance from an array-like or iterable object.

MDN documentation

impl<U> Array<U>

pub fn from_iterable_map<I>( val: &I, map: &mut dyn FnMut(I::Item, u32) -> Result<U, JsError>, ) -> Result<Array<U>, JsValue>

where I: ErasableGenericBorrow<JsValue> + EncodeTypeDef + Iterable, for<'__wry_bindgen> &'__wry_bindgen I: BinaryEncode, dyn FnMut(I::Item, u32) -> Result<U, JsError>: ErasableGenericBorrowMut<dyn FnMut(JsValue, u32) -> Result<JsValue, JsError>>, for<'__wry_bindgen> &'__wry_bindgen mut dyn FnMut(I::Item, u32) -> Result<U, JsError>: EncodeTypeDef + BinaryEncode, Result<Array<U>, JsValue>: ErasableGenericOwn<Result<Array<JsValue>, JsValue>> + EncodeTypeDef + BatchableResult,

The Array.from() static method with a map function creates a new, shallow-copied Array instance from an array-like or iterable object, applying the map function to each value.

MDN documentation

impl Array

pub fn from_async<I>(val: &I) -> Result<Promise<Array<I::Item>>, JsValue>

where I: ErasableGenericBorrow<JsValue> + EncodeTypeDef + AsyncIterable, for<'__wry_bindgen> &'__wry_bindgen I: BinaryEncode, Result<Promise<Array<I::Item>>, JsValue>: ErasableGenericOwn<Result<Promise<Array<JsValue>>, JsValue>> + EncodeTypeDef + BatchableResult,

The Array.fromAsync() static method creates a new, shallow-copied Array instance from an async iterable, iterable or array-like object.

MDN documentation

impl Array

pub fn from_async_map<'a, I, R: Promising>( val: &I, map: &ScopedClosure<'a, dyn FnMut(I::Item, u32) -> Result<R, JsError>>, ) -> Result<Promise<Array<R::Resolution>>, JsValue>

where I: ErasableGenericBorrow<JsValue> + EncodeTypeDef + AsyncIterable, for<'__wry_bindgen> &'__wry_bindgen I: BinaryEncode, ScopedClosure<'a, dyn FnMut(I::Item, u32) -> Result<R, JsError>>: ErasableGenericBorrow<ScopedClosure<'static, dyn FnMut(JsValue, u32) -> Result<JsValue, JsError>>>, Result<Promise<Array<R::Resolution>>, JsValue>: ErasableGenericOwn<Result<Promise<Array<JsValue>>, JsValue>> + EncodeTypeDef + BatchableResult,

The Array.fromAsync() static method with a map function creates a new, shallow-copied Array instance from an async iterable, iterable or array-like object, applying the map function to each value.

MDN documentation

impl<T> Array<T>

pub fn copy_within(&self, target: i32, start: i32, end: i32) -> Array<T>

where Array<T>: ErasableGenericOwn<Array<JsValue>> + EncodeTypeDef + BatchableResult,

The copyWithin() method shallow copies part of an array to another location in the same array and returns it, without modifying its size.

MDN documentation

impl<T> Array<T>

pub fn concat<U: Upcast<T>>(&self, array: &Array<U>) -> Array<T>

where Array<U>: ErasableGenericBorrow<Array<JsValue>> + EncodeTypeDef, for<'__wry_bindgen> &'__wry_bindgen Array<U>: BinaryEncode, Array<T>: ErasableGenericOwn<Array<JsValue>> + EncodeTypeDef + BatchableResult,

The concat() method is used to merge two or more arrays. This method does not change the existing arrays, but instead returns a new array.

MDN documentation

impl<T> Array<T>

pub fn concat_many<U: Upcast<T>>(&self, array: &[Array<U>]) -> Array<T>

where [Array<U>]: ErasableGenericBorrow<[Array<JsValue>]>, Array<U>: EncodeTypeDef + JsGeneric, Array<T>: ErasableGenericOwn<Array<JsValue>> + EncodeTypeDef + BatchableResult,

The concat() method is used to merge two or more arrays. This method does not change the existing arrays, but instead returns a new array.

MDN documentation

impl<T> Array<T>

pub fn every(&self, predicate: &mut dyn FnMut(T, u32, Array<T>) -> bool) -> bool

where dyn FnMut(T, u32, Array<T>) -> bool: ErasableGenericBorrowMut<dyn FnMut(JsValue, u32, Array<JsValue>) -> bool>, for<'__wry_bindgen> &'__wry_bindgen mut dyn FnMut(T, u32, Array<T>) -> bool: EncodeTypeDef + BinaryEncode,

The every() method tests whether all elements in the array pass the test implemented by the provided function.

Note: Consider using Array::try_every if the predicate might throw an error.

MDN documentation

impl<T> Array<T>

pub fn try_every( &self, predicate: &mut dyn FnMut(T, u32) -> Result<bool, JsError>, ) -> Result<bool, JsValue>

where dyn FnMut(T, u32) -> Result<bool, JsError>: ErasableGenericBorrowMut<dyn FnMut(JsValue, u32) -> Result<bool, JsError>>, for<'__wry_bindgen> &'__wry_bindgen mut dyn FnMut(T, u32) -> Result<bool, JsError>: EncodeTypeDef + BinaryEncode,

The every() method tests whether all elements in the array pass the test implemented by the provided function. (Fallible variation)

MDN documentation

impl<T> Array<T>

pub fn fill(&self, value: &T, start: u32, end: u32) -> Array<T>

where T: ErasableGenericBorrow<JsValue> + EncodeTypeDef, for<'__wry_bindgen> &'__wry_bindgen T: BinaryEncode, Array<T>: ErasableGenericOwn<Array<JsValue>> + EncodeTypeDef + BatchableResult,

The fill() method fills all the elements of an array from a start index to an end index with a static value. The end index is not included.

MDN documentation

impl<T> Array<T>

pub fn filter( &self, predicate: &mut dyn FnMut(T, u32, Array<T>) -> bool, ) -> Array<T>

where dyn FnMut(T, u32, Array<T>) -> bool: ErasableGenericBorrowMut<dyn FnMut(JsValue, u32, Array<JsValue>) -> bool>, for<'__wry_bindgen> &'__wry_bindgen mut dyn FnMut(T, u32, Array<T>) -> bool: EncodeTypeDef + BinaryEncode, Array<T>: ErasableGenericOwn<Array<JsValue>> + EncodeTypeDef + BatchableResult,

The filter() method creates a new array with all elements that pass the test implemented by the provided function.

Note: Consider using Array::try_filter if the predicate might throw an error.

MDN documentation

impl<T> Array<T>

pub fn try_filter( &self, predicate: &mut dyn FnMut(T, u32) -> Result<bool, JsError>, ) -> Result<Array<T>, JsValue>

where dyn FnMut(T, u32) -> Result<bool, JsError>: ErasableGenericBorrowMut<dyn FnMut(JsValue, u32) -> Result<bool, JsError>>, for<'__wry_bindgen> &'__wry_bindgen mut dyn FnMut(T, u32) -> Result<bool, JsError>: EncodeTypeDef + BinaryEncode, Result<Array<T>, JsValue>: ErasableGenericOwn<Result<Array<JsValue>, JsValue>> + EncodeTypeDef + BatchableResult,

The filter() method creates a new array with all elements that pass the test implemented by the provided function. (Fallible variation)

MDN documentation

impl<T> Array<T>

pub fn find(&self, predicate: &mut dyn FnMut(T, u32, Array<T>) -> bool) -> T

where dyn FnMut(T, u32, Array<T>) -> bool: ErasableGenericBorrowMut<dyn FnMut(JsValue, u32, Array<JsValue>) -> bool>, for<'__wry_bindgen> &'__wry_bindgen mut dyn FnMut(T, u32, Array<T>) -> bool: EncodeTypeDef + BinaryEncode, T: ErasableGenericOwn<JsValue> + EncodeTypeDef + BatchableResult,

The find() method returns the value of the first element in the array that satisfies the provided testing function. Otherwise undefined is returned.

MDN documentation

impl<T> Array<T>

pub fn try_find( &self, predicate: &mut dyn FnMut(T, u32) -> Result<bool, JsError>, ) -> Result<Option<T>, JsValue>

where dyn FnMut(T, u32) -> Result<bool, JsError>: ErasableGenericBorrowMut<dyn FnMut(JsValue, u32) -> Result<bool, JsError>>, for<'__wry_bindgen> &'__wry_bindgen mut dyn FnMut(T, u32) -> Result<bool, JsError>: EncodeTypeDef + BinaryEncode, Result<Option<T>, JsValue>: ErasableGenericOwn<Result<Option<JsValue>, JsValue>> + EncodeTypeDef + BatchableResult,

The find() method returns the value of the first element in the array that satisfies the provided testing function. Otherwise undefined is returned. (Fallible variation)

MDN documentation

impl<T> Array<T>

pub fn find_index( &self, predicate: &mut dyn FnMut(T, u32, Array<T>) -> bool, ) -> i32

where dyn FnMut(T, u32, Array<T>) -> bool: ErasableGenericBorrowMut<dyn FnMut(JsValue, u32, Array<JsValue>) -> bool>, for<'__wry_bindgen> &'__wry_bindgen mut dyn FnMut(T, u32, Array<T>) -> bool: EncodeTypeDef + BinaryEncode,

The findIndex() method returns the index of the first element in the array that satisfies the provided testing function. Otherwise -1 is returned.

Note: Consider using Array::try_find_index if the predicate might throw an error.

MDN documentation

impl<T> Array<T>

pub fn try_find_index( &self, predicate: &mut dyn FnMut(T, u32) -> Result<bool, JsError>, ) -> Result<i32, JsValue>

where dyn FnMut(T, u32) -> Result<bool, JsError>: ErasableGenericBorrowMut<dyn FnMut(JsValue, u32) -> Result<bool, JsError>>, for<'__wry_bindgen> &'__wry_bindgen mut dyn FnMut(T, u32) -> Result<bool, JsError>: EncodeTypeDef + BinaryEncode,

The findIndex() method returns the index of the first element in the array that satisfies the provided testing function. Otherwise -1 is returned. (Fallible variation)

MDN documentation

impl<T> Array<T>

pub fn find_last( &self, predicate: &mut dyn FnMut(T, u32, Array<T>) -> bool, ) -> T

where dyn FnMut(T, u32, Array<T>) -> bool: ErasableGenericBorrowMut<dyn FnMut(JsValue, u32, Array<JsValue>) -> bool>, for<'__wry_bindgen> &'__wry_bindgen mut dyn FnMut(T, u32, Array<T>) -> bool: EncodeTypeDef + BinaryEncode, T: ErasableGenericOwn<JsValue> + EncodeTypeDef + BatchableResult,

The findLast() method of Array instances iterates the array in reverse order and returns the value of the first element that satisfies the provided testing function. If no elements satisfy the testing function, undefined is returned.

MDN documentation

impl<T> Array<T>

pub fn try_find_last( &self, predicate: &mut dyn FnMut(T, u32) -> Result<bool, JsError>, ) -> Result<Option<T>, JsValue>

where dyn FnMut(T, u32) -> Result<bool, JsError>: ErasableGenericBorrowMut<dyn FnMut(JsValue, u32) -> Result<bool, JsError>>, for<'__wry_bindgen> &'__wry_bindgen mut dyn FnMut(T, u32) -> Result<bool, JsError>: EncodeTypeDef + BinaryEncode, Result<Option<T>, JsValue>: ErasableGenericOwn<Result<Option<JsValue>, JsValue>> + EncodeTypeDef + BatchableResult,

The findLast() method of Array instances iterates the array in reverse order and returns the value of the first element that satisfies the provided testing function. If no elements satisfy the testing function, undefined is returned. (Fallible variation)

MDN documentation

impl<T> Array<T>

pub fn find_last_index( &self, predicate: &mut dyn FnMut(T, u32, Array<T>) -> bool, ) -> i32

where dyn FnMut(T, u32, Array<T>) -> bool: ErasableGenericBorrowMut<dyn FnMut(JsValue, u32, Array<JsValue>) -> bool>, for<'__wry_bindgen> &'__wry_bindgen mut dyn FnMut(T, u32, Array<T>) -> bool: EncodeTypeDef + BinaryEncode,

The findLastIndex() method of Array instances iterates the array in reverse order and returns the index of the first element that satisfies the provided testing function. If no elements satisfy the testing function, -1 is returned.

Note: Consider using Array::try_find_last_index if the predicate might throw an error.

MDN documentation

impl<T> Array<T>

pub fn try_find_last_index( &self, predicate: &mut dyn FnMut(T, u32) -> Result<bool, JsError>, ) -> Result<i32, JsValue>

where dyn FnMut(T, u32) -> Result<bool, JsError>: ErasableGenericBorrowMut<dyn FnMut(JsValue, u32) -> Result<bool, JsError>>, for<'__wry_bindgen> &'__wry_bindgen mut dyn FnMut(T, u32) -> Result<bool, JsError>: EncodeTypeDef + BinaryEncode,

The findLastIndex() method of Array instances iterates the array in reverse order and returns the index of the first element that satisfies the provided testing function. If no elements satisfy the testing function, -1 is returned. (Fallible variation)

MDN documentation

impl<T> Array<T>

pub fn flat(&self, depth: i32) -> Array<JsValue>

The flat() method creates a new array with all sub-array elements concatenated into it recursively up to the specified depth.

MDN documentation

impl<T> Array<T>

pub fn flat_map<U>( &self, callback: &mut dyn FnMut(T, u32, Array<T>) -> Vec<U>, ) -> Array<U>

where dyn FnMut(T, u32, Array<T>) -> Vec<U>: ErasableGenericBorrowMut<dyn FnMut(JsValue, u32, Array<JsValue>) -> Vec<JsValue>>, for<'__wry_bindgen> &'__wry_bindgen mut dyn FnMut(T, u32, Array<T>) -> Vec<U>: EncodeTypeDef + BinaryEncode, Array<U>: ErasableGenericOwn<Array<JsValue>> + EncodeTypeDef + BatchableResult,

The flatMap() method first maps each element using a mapping function, then flattens the result into a new array.

Note: Consider using Array::try_flat_map for safer fallible handling.

MDN documentation

impl<T> Array<T>

pub fn try_flat_map<U>( &self, callback: &mut dyn FnMut(T, u32) -> Vec<U>, ) -> Result<Array<U>, JsValue>

where dyn FnMut(T, u32) -> Vec<U>: ErasableGenericBorrowMut<dyn FnMut(JsValue, u32) -> Vec<JsValue>>, for<'__wry_bindgen> &'__wry_bindgen mut dyn FnMut(T, u32) -> Vec<U>: EncodeTypeDef + BinaryEncode, Result<Array<U>, JsValue>: ErasableGenericOwn<Result<Array<JsValue>, JsValue>> + EncodeTypeDef + BatchableResult,

The flatMap() method first maps each element using a mapping function, then flattens the result into a new array.

MDN documentation

impl<T: JsGeneric> Array<T>

pub fn for_each(&self, callback: &mut dyn FnMut(T, u32, Array<T>))

where dyn FnMut(T, u32, Array<T>): ErasableGenericBorrowMut<dyn FnMut(JsValue, u32, Array<JsValue>)>, for<'__wry_bindgen> &'__wry_bindgen mut dyn FnMut(T, u32, Array<T>): EncodeTypeDef + BinaryEncode,

The forEach() method executes a provided function once for each array element.

Note: Consider using Array::try_for_each if the callback might throw an error.

MDN documentation

impl<T> Array<T>

pub fn try_for_each( &self, callback: &mut dyn FnMut(T, u32) -> Result<(), JsError>, ) -> Result<(), JsValue>

where dyn FnMut(T, u32) -> Result<(), JsError>: ErasableGenericBorrowMut<dyn FnMut(JsValue, u32) -> Result<(), JsError>>, for<'__wry_bindgen> &'__wry_bindgen mut dyn FnMut(T, u32) -> Result<(), JsError>: EncodeTypeDef + BinaryEncode,

The forEach() method executes a provided function once for each array element. (Fallible variation)

MDN documentation

impl<T> Array<T>

pub fn includes(&self, value: &T, from_index: i32) -> bool

where T: ErasableGenericBorrow<JsValue> + EncodeTypeDef, for<'__wry_bindgen> &'__wry_bindgen T: BinaryEncode,

The includes() method determines whether an array includes a certain element, returning true or false as appropriate.

MDN documentation

impl<T> Array<T>

pub fn index_of(&self, value: &T, from_index: i32) -> i32

where T: ErasableGenericBorrow<JsValue> + EncodeTypeDef, for<'__wry_bindgen> &'__wry_bindgen T: BinaryEncode,

The indexOf() method returns the first index at which a given element can be found in the array, or -1 if it is not present.

MDN documentation

impl Array

pub fn is_array(value: &JsValue) -> bool

The Array.isArray() method determines whether the passed value is an Array.

MDN documentation

impl<T> Array<T>

pub fn join(&self, delimiter: &str) -> JsString

The join() method joins all elements of an array (or an array-like object) into a string and returns this string.

MDN documentation

impl<T> Array<T>

pub fn last_index_of(&self, value: &T, from_index: i32) -> i32

where T: ErasableGenericBorrow<JsValue> + EncodeTypeDef, for<'__wry_bindgen> &'__wry_bindgen T: BinaryEncode,

The lastIndexOf() method returns the last index at which a given element can be found in the array, or -1 if it is not present. The array is searched backwards, starting at fromIndex.

MDN documentation

impl<T> Array<T>

pub fn length(&self) -> u32

The length property of an object which is an instance of type Array sets or returns the number of elements in that array. The value is an unsigned, 32-bit integer that is always numerically greater than the highest index in the array.

MDN documentation

impl<T> Array<T>

pub fn set_length(&self, value: u32)

Sets the length of the array.

If it is set to less than the current length of the array, it will shrink the array.

If it is set to more than the current length of the array, it will increase the length of the array, filling the new space with empty slots.

MDN documentation

impl<T> Array<T>

pub fn map<U>( &self, predicate: &mut dyn FnMut(T, u32, Array<T>) -> U, ) -> Array<U>

where dyn FnMut(T, u32, Array<T>) -> U: ErasableGenericBorrowMut<dyn FnMut(JsValue, u32, Array<JsValue>) -> JsValue>, for<'__wry_bindgen> &'__wry_bindgen mut dyn FnMut(T, u32, Array<T>) -> U: EncodeTypeDef + BinaryEncode, Array<U>: ErasableGenericOwn<Array<JsValue>> + EncodeTypeDef + BatchableResult,

map() calls a provided callback function once for each element in an array, in order, and constructs a new array from the results. callback is invoked only for indexes of the array which have assigned values, including undefined. It is not called for missing elements of the array (that is, indexes that have never been set, which have been deleted or which have never been assigned a value).

Note: Consider using Array::try_map for safer fallible handling.

MDN documentation

impl<T> Array<T>

pub fn try_map<U>( &self, predicate: &mut dyn FnMut(T, u32) -> Result<U, JsError>, ) -> Result<Array<U>, JsValue>

where dyn FnMut(T, u32) -> Result<U, JsError>: ErasableGenericBorrowMut<dyn FnMut(JsValue, u32) -> Result<JsValue, JsError>>, for<'__wry_bindgen> &'__wry_bindgen mut dyn FnMut(T, u32) -> Result<U, JsError>: EncodeTypeDef + BinaryEncode, Result<Array<U>, JsValue>: ErasableGenericOwn<Result<Array<JsValue>, JsValue>> + EncodeTypeDef + BatchableResult,

map() calls a provided callback function once for each element in an array, in order, and constructs a new array from the results. callback is invoked only for indexes of the array which have assigned values, including undefined. It is not called for missing elements of the array (that is, indexes that have never been set, which have been deleted or which have never been assigned a value). (Fallible variation)

MDN documentation

impl<T> Array<T>

pub fn of(values: &[T]) -> Array<T>

where [T]: ErasableGenericBorrow<[JsValue]>, T: EncodeTypeDef + JsGeneric, Array<T>: ErasableGenericOwn<Array<JsValue>> + EncodeTypeDef + BatchableResult,

The Array.of() method creates a new Array instance with a variable number of arguments, regardless of number or type of the arguments.

Note: For type inference use Array::<T>::of(&[T]).

The difference between Array.of() and the Array constructor is in the handling of integer arguments: Array.of(7) creates an array with a single element, 7, whereas Array(7) creates an empty array with a length property of 7 (Note: this implies an array of 7 empty slots, not slots with actual undefined values).

MDN documentation

impl Array

pub fn of1(a: &JsValue) -> Array

MDN documentation

impl Array

pub fn of2(a: &JsValue, b: &JsValue) -> Array

MDN documentation

impl Array

pub fn of3(a: &JsValue, b: &JsValue, c: &JsValue) -> Array

MDN documentation

impl Array

pub fn of4(a: &JsValue, b: &JsValue, c: &JsValue, d: &JsValue) -> Array

MDN documentation

impl Array

pub fn of5( a: &JsValue, b: &JsValue, c: &JsValue, d: &JsValue, e: &JsValue, ) -> Array

MDN documentation

impl<T> Array<T>

pub fn pop(&self) -> T

where T: ErasableGenericOwn<JsValue> + EncodeTypeDef + BatchableResult,

The pop() method removes the last element from an array and returns that element. This method changes the length of the array.

Note: Consider using Array::pop_checked for handling empty arrays.

MDN documentation

impl<T> Array<T>

pub fn pop_checked(&self) -> Option<T>

where Option<T>: ErasableGenericOwn<Option<JsValue>> + EncodeTypeDef + BatchableResult,

The pop() method removes the last element from an array and returns that element. This method changes the length of the array.

MDN documentation

impl<T> Array<T>

pub fn push(&self, value: &T) -> u32

where T: ErasableGenericBorrow<JsValue> + EncodeTypeDef, for<'__wry_bindgen> &'__wry_bindgen T: BinaryEncode,

The push() method adds one element to the end of an array and returns the new length of the array.

MDN documentation

impl<T> Array<T>

pub fn push_many(&self, values: &[T]) -> u32

where [T]: ErasableGenericBorrow<[JsValue]>, T: EncodeTypeDef + JsGeneric,

The push() method adds one or more elements to the end of an array and returns the new length of the array.

MDN documentation

impl<T> Array<T>

pub fn reduce( &self, predicate: &mut dyn FnMut(JsValue, T, u32, Array<T>) -> JsValue, initial_value: &JsValue, ) -> JsValue

where dyn FnMut(JsValue, T, u32, Array<T>) -> JsValue: ErasableGenericBorrowMut<dyn FnMut(JsValue, JsValue, u32, Array<JsValue>) -> JsValue>, for<'__wry_bindgen> &'__wry_bindgen mut dyn FnMut(JsValue, T, u32, Array<T>) -> JsValue: EncodeTypeDef + BinaryEncode,

The reduce() method applies a function against an accumulator and each element in the array (from left to right) to reduce it to a single value.

MDN documentation

impl<T> Array<T>

pub fn try_reduce<A>( &self, predicate: &mut dyn FnMut(A, T, u32) -> Result<A, JsError>, initial_value: &A, ) -> Result<A, JsValue>

where dyn FnMut(A, T, u32) -> Result<A, JsError>: ErasableGenericBorrowMut<dyn FnMut(JsValue, JsValue, u32) -> Result<JsValue, JsError>>, for<'__wry_bindgen> &'__wry_bindgen mut dyn FnMut(A, T, u32) -> Result<A, JsError>: EncodeTypeDef + BinaryEncode, A: ErasableGenericBorrow<JsValue> + EncodeTypeDef, for<'__wry_bindgen> &'__wry_bindgen A: BinaryEncode, Result<A, JsValue>: ErasableGenericOwn<Result<JsValue, JsValue>> + EncodeTypeDef + BatchableResult,

The reduce() method applies a function against an accumulator and each element in the array (from left to right) to reduce it to a single value. (Fallible variation)

MDN documentation

impl<T> Array<T>

pub fn reduce_right( &self, predicate: &mut dyn FnMut(JsValue, T, u32, Array<T>) -> JsValue, initial_value: &JsValue, ) -> JsValue

where dyn FnMut(JsValue, T, u32, Array<T>) -> JsValue: ErasableGenericBorrowMut<dyn FnMut(JsValue, JsValue, u32, Array<JsValue>) -> JsValue>, for<'__wry_bindgen> &'__wry_bindgen mut dyn FnMut(JsValue, T, u32, Array<T>) -> JsValue: EncodeTypeDef + BinaryEncode,

The reduceRight() method applies a function against an accumulator and each value of the array (from right-to-left) to reduce it to a single value.

MDN documentation

impl<T> Array<T>

pub fn try_reduce_right<A>( &self, predicate: &mut dyn FnMut(JsValue, T, u32) -> Result<A, JsError>, initial_value: &A, ) -> Result<A, JsValue>

where dyn FnMut(JsValue, T, u32) -> Result<A, JsError>: ErasableGenericBorrowMut<dyn FnMut(JsValue, JsValue, u32) -> Result<JsValue, JsError>>, for<'__wry_bindgen> &'__wry_bindgen mut dyn FnMut(JsValue, T, u32) -> Result<A, JsError>: EncodeTypeDef + BinaryEncode, A: ErasableGenericBorrow<JsValue> + EncodeTypeDef, for<'__wry_bindgen> &'__wry_bindgen A: BinaryEncode, Result<A, JsValue>: ErasableGenericOwn<Result<JsValue, JsValue>> + EncodeTypeDef + BatchableResult,

The reduceRight() method applies a function against an accumulator and each value of the array (from right-to-left) to reduce it to a single value. (Fallible variation)

MDN documentation

impl<T> Array<T>

pub fn reverse(&self) -> Array<T>

where Array<T>: ErasableGenericOwn<Array<JsValue>> + EncodeTypeDef + BatchableResult,

The reverse() method reverses an array in place. The first array element becomes the last, and the last array element becomes the first.

MDN documentation

impl<T> Array<T>

pub fn shift(&self) -> T

where T: ErasableGenericOwn<JsValue> + EncodeTypeDef + BatchableResult,

The shift() method removes the first element from an array and returns that removed element. This method changes the length of the array.

Note: Consider using Array::shift_checked for handling empty arrays.

MDN documentation

impl<T> Array<T>

pub fn shift_checked(&self) -> Option<T>

where Option<T>: ErasableGenericOwn<Option<JsValue>> + EncodeTypeDef + BatchableResult,

The shift() method removes the first element from an array and returns that removed element. This method changes the length of the array.

MDN documentation

impl<T> Array<T>

pub fn slice(&self, start: u32, end: u32) -> Array<T>

where Array<T>: ErasableGenericOwn<Array<JsValue>> + EncodeTypeDef + BatchableResult,

The slice() method returns a shallow copy of a portion of an array into a new array object selected from begin to end (end not included). The original array will not be modified.

MDN documentation

impl<T> Array<T>

pub fn slice_from(&self, start: u32) -> Array<T>

where Array<T>: ErasableGenericOwn<Array<JsValue>> + EncodeTypeDef + BatchableResult,

The slice() method returns a shallow copy of a portion of an array into a new array object selected from the given index to the end. The original array will not be modified.

MDN documentation

impl<T> Array<T>

pub fn some(&self, predicate: &mut dyn FnMut(T) -> bool) -> bool

where dyn FnMut(T) -> bool: ErasableGenericBorrowMut<dyn FnMut(JsValue) -> bool>, for<'__wry_bindgen> &'__wry_bindgen mut dyn FnMut(T) -> bool: EncodeTypeDef + BinaryEncode,

The some() method tests whether at least one element in the array passes the test implemented by the provided function. Note: This method returns false for any condition put on an empty array.

Note: Consider using Array::try_some if the predicate might throw an error.

MDN documentation

impl<T> Array<T>

pub fn try_some( &self, predicate: &mut dyn FnMut(T) -> Result<bool, JsError>, ) -> Result<bool, JsValue>

where dyn FnMut(T) -> Result<bool, JsError>: ErasableGenericBorrowMut<dyn FnMut(JsValue) -> Result<bool, JsError>>, for<'__wry_bindgen> &'__wry_bindgen mut dyn FnMut(T) -> Result<bool, JsError>: EncodeTypeDef + BinaryEncode,

The some() method tests whether at least one element in the array passes the test implemented by the provided function. (Fallible variation) Note: This method returns false for any condition put on an empty array. MDN documentation

impl<T> Array<T>

pub fn sort(&self) -> Array<T>

where Array<T>: ErasableGenericOwn<Array<JsValue>> + EncodeTypeDef + BatchableResult,

The sort() method sorts the elements of an array in place and returns the array. The sort is not necessarily stable. The default sort order is according to string Unicode code points.

The time and space complexity of the sort cannot be guaranteed as it is implementation dependent.

MDN documentation

impl<T> Array<T>

pub fn sort_by(&self, compare_fn: &mut dyn FnMut(T, T) -> i32) -> Array<T>

where dyn FnMut(T, T) -> i32: ErasableGenericBorrowMut<dyn FnMut(JsValue, JsValue) -> i32>, for<'__wry_bindgen> &'__wry_bindgen mut dyn FnMut(T, T) -> i32: EncodeTypeDef + BinaryEncode, Array<T>: ErasableGenericOwn<Array<JsValue>> + EncodeTypeDef + BatchableResult,

The sort() method with a custom compare function.

Note: Consider using Array::try_sort_by if the predicate might throw an error.

MDN documentation

impl<T> Array<T>

pub fn try_sort_by( &self, compare_fn: &mut dyn FnMut(T, T) -> Result<i32, JsError>, ) -> Result<Array<T>, JsValue>

where dyn FnMut(T, T) -> Result<i32, JsError>: ErasableGenericBorrowMut<dyn FnMut(JsValue, JsValue) -> Result<i32, JsError>>, for<'__wry_bindgen> &'__wry_bindgen mut dyn FnMut(T, T) -> Result<i32, JsError>: EncodeTypeDef + BinaryEncode, Result<Array<T>, JsValue>: ErasableGenericOwn<Result<Array<JsValue>, JsValue>> + EncodeTypeDef + BatchableResult,

The sort() method with a custom compare function. (Fallible variation)

MDN documentation

impl<T> Array<T>

pub fn splice(&self, start: u32, delete_count: u32, item: &T) -> Array<T>

where T: ErasableGenericBorrow<JsValue> + EncodeTypeDef, for<'__wry_bindgen> &'__wry_bindgen T: BinaryEncode, Array<T>: ErasableGenericOwn<Array<JsValue>> + EncodeTypeDef + BatchableResult,

The splice() method changes the contents of an array by removing existing elements and/or adding new elements.

MDN documentation

impl<T> Array<T>

pub fn splice_many( &self, start: u32, delete_count: u32, items: &[T], ) -> Array<T>

where [T]: ErasableGenericBorrow<[JsValue]>, T: EncodeTypeDef + JsGeneric, Array<T>: ErasableGenericOwn<Array<JsValue>> + EncodeTypeDef + BatchableResult,

The splice() method changes the contents of an array by removing existing elements and/or adding new elements.

MDN documentation

impl<T> Array<T>

pub fn to_locale_string(&self, locales: &JsValue, options: &JsValue) -> JsString

The toLocaleString() method returns a string representing the elements of the array. The elements are converted to Strings using their toLocaleString methods and these Strings are separated by a locale-specific String (such as a comma “,”).

MDN documentation

impl<T> Array<T>

pub fn to_reversed(&self) -> Array<T>

where Array<T>: ErasableGenericOwn<Array<JsValue>> + EncodeTypeDef + BatchableResult,

The toReversed() method returns a new array with the elements in reversed order, without modifying the original array.

MDN documentation

impl<T> Array<T>

pub fn to_sorted(&self) -> Array<T>

where Array<T>: ErasableGenericOwn<Array<JsValue>> + EncodeTypeDef + BatchableResult,

The toSorted() method returns a new array with the elements sorted in ascending order, without modifying the original array.

MDN documentation

impl<T> Array<T>

pub fn to_sorted_by(&self, compare_fn: &mut dyn FnMut(T, T) -> i32) -> Array<T>

where dyn FnMut(T, T) -> i32: ErasableGenericBorrowMut<dyn FnMut(JsValue, JsValue) -> i32>, for<'__wry_bindgen> &'__wry_bindgen mut dyn FnMut(T, T) -> i32: EncodeTypeDef + BinaryEncode, Array<T>: ErasableGenericOwn<Array<JsValue>> + EncodeTypeDef + BatchableResult,

The toSorted() method with a custom compare function.

Note: Consider using Array::try_to_sorted_by if the predicate might throw an error.

MDN documentation

impl<T> Array<T>

pub fn try_to_sorted_by( &self, compare_fn: &mut dyn FnMut(T, T) -> Result<i32, JsError>, ) -> Result<Array<T>, JsValue>

where dyn FnMut(T, T) -> Result<i32, JsError>: ErasableGenericBorrowMut<dyn FnMut(JsValue, JsValue) -> Result<i32, JsError>>, for<'__wry_bindgen> &'__wry_bindgen mut dyn FnMut(T, T) -> Result<i32, JsError>: EncodeTypeDef + BinaryEncode, Result<Array<T>, JsValue>: ErasableGenericOwn<Result<Array<JsValue>, JsValue>> + EncodeTypeDef + BatchableResult,

The toSorted() method with a custom compare function. (Fallible variation)

MDN documentation

impl<T> Array<T>

pub fn to_spliced(&self, start: u32, delete_count: u32, items: &[T]) -> Array<T>

where [T]: ErasableGenericBorrow<[JsValue]>, T: EncodeTypeDef + JsGeneric, Array<T>: ErasableGenericOwn<Array<JsValue>> + EncodeTypeDef + BatchableResult,

The toSpliced() method returns a new array with some elements removed and/or replaced at a given index, without modifying the original array.

MDN documentation

impl<T> Array<T>

pub fn to_string(&self) -> JsString

The toString() method returns a string representing the specified array and its elements.

MDN documentation

impl<T> Array<T>

pub fn to_vec(&self) -> Vec<T>

where Vec<T>: ErasableGenericOwn<Vec<JsValue>> + EncodeTypeDef + BatchableResult,

Converts the Array into a Vector.

impl<T> Array<T>

pub fn unshift(&self, value: &T) -> u32

where T: ErasableGenericBorrow<JsValue> + EncodeTypeDef, for<'__wry_bindgen> &'__wry_bindgen T: BinaryEncode,

The unshift() method adds one element to the beginning of an array and returns the new length of the array.

MDN documentation

impl<T> Array<T>

pub fn unshift_many(&self, values: &[T]) -> u32

where [T]: ErasableGenericBorrow<[JsValue]>, T: EncodeTypeDef + JsGeneric,

The unshift() method adds one or more elements to the beginning of an array and returns the new length of the array.

MDN documentation

impl<T> Array<T>

pub fn with(&self, index: u32, value: &T) -> Array<T>

where T: ErasableGenericBorrow<JsValue> + EncodeTypeDef, for<'__wry_bindgen> &'__wry_bindgen T: BinaryEncode, Array<T>: ErasableGenericOwn<Array<JsValue>> + EncodeTypeDef + BatchableResult,

The with() method returns a new array with the element at the given index replaced with the given value, without modifying the original array.

MDN documentation

impl<T: JsGeneric> Array<T>

pub fn iter(&self) -> ArrayIter<'_, T>

Returns an iterator over the values of the JS array.

impl<T: JsGeneric> Array<T>

pub fn from_iter_typed<A, I>(iter: I) -> Array<T>

where A: IntoJsGeneric<JsCanon = T>, I: IntoIterator<Item = A>,

Collect an iterator into a typed Array<T>, projecting each item through its canonical JsGeneric via IntoJsGeneric.

This is the typed counterpart to the stable impl FromIterator<A> for Array where A: AsRef<JsValue>, which always produces an erased Array<JsValue>. Use from_iter_typed when you want the element type inferred from the iterator item:

use js_sys::{Array, Number};

let arr = Array::from_iter_typed((0..10).map(Number::from));
// arr: Array<Number>

Reference iteration (Item = &U) is supported transparently via the &U: IntoJsGeneric blanket in wasm-bindgen core.

pub fn extend_typed<A, I>(&mut self, iter: I)

where A: IntoJsGeneric<JsCanon = T>, I: IntoIterator<Item = A>,

Extend a typed Array<T> with an iterator of items convertible to T via IntoJsGeneric. Companion to Array::from_iter_typed.

impl<T> Array<T>

pub fn keys(&self) -> Iterator<T>

where Iterator<T>: ErasableGenericOwn<Iterator<JsValue>> + EncodeTypeDef + BatchableResult,

The keys() method returns a new Array Iterator object that contains the keys for each index in the array.

MDN documentation

impl<T> Array<T>

pub fn entries(&self) -> Iterator<T>

where Iterator<T>: ErasableGenericOwn<Iterator<JsValue>> + EncodeTypeDef + BatchableResult,

👎Deprecated:

recommended to use Array::entries_typed instead for typing

The entries() method returns a new Array Iterator object that contains the key/value pairs for each index in the array.

MDN documentation

impl<T: JsGeneric> Array<T>

pub fn entries_typed(&self) -> Iterator<ArrayTuple<(Number, T)>>

where Iterator<ArrayTuple<(Number, T)>>: ErasableGenericOwn<Iterator<ArrayTuple<(Number, JsValue)>>> + EncodeTypeDef + BatchableResult,

The entries() method returns a new Array Iterator object that contains the key/value pairs for each index in the array.

MDN documentation

impl<T> Array<T>

pub fn values(&self) -> Iterator<T>

where Iterator<T>: ErasableGenericOwn<Iterator<JsValue>> + EncodeTypeDef + BatchableResult,

The values() method returns a new Array Iterator object that contains the values for each index in the array.

MDN documentation

Methods from Deref<Target = Object>

pub fn constructor(&self) -> Function

The constructor property returns a reference to the Object constructor function that created the instance object.

MDN documentation

pub fn has_own_property(&self, property: &JsValue) -> bool

👎Deprecated:

Use Object::hasOwn instead.

The hasOwnProperty() method returns a boolean indicating whether the object has the specified property as its own property (as opposed to inheriting it).

MDN documentation

pub fn is_prototype_of(&self, value: &JsValue) -> bool

The isPrototypeOf() method checks if an object exists in another object’s prototype chain.

MDN documentation

pub fn property_is_enumerable(&self, property: &JsValue) -> bool

The propertyIsEnumerable() method returns a Boolean indicating whether the specified property is enumerable.

MDN documentation

pub fn to_locale_string(&self) -> JsString

The toLocaleString() method returns a string representing the object. This method is meant to be overridden by derived objects for locale-specific purposes.

MDN documentation

pub fn to_string(&self) -> JsString

The toString() method returns a string representing the object.

MDN documentation

pub fn to_js_string(&self) -> JsString

The toString() method returns a string representing the object.

MDN documentation

pub fn value_of(&self) -> Object

The valueOf() method returns the primitive value of the specified object.

MDN documentation

Methods from Deref<Target = JsValue>

pub const NULL: JsValue

pub const UNDEFINED: JsValue

pub const TRUE: JsValue

pub const FALSE: JsValue

pub fn id(&self) -> u64

Get the heap ID for this value.

This is used internally for encoding values to send to JS.

pub fn unchecked_into_f64(&self) -> f64

Returns the value as f64 without type checking. Used by serde-wasm-bindgen for numeric conversions.

pub fn has_type<T>(&self) -> bool

where T: JsCast,

Check if this value is an instance of a specific JS type.

pub fn checked_div(&self, rhs: &JsValue) -> JsValue

Checked division.

pub fn pow(&self, rhs: &JsValue) -> JsValue

Power operation.

pub fn bit_and(&self, rhs: &JsValue) -> JsValue

Bitwise AND.

pub fn bit_or(&self, rhs: &JsValue) -> JsValue

Bitwise OR.

pub fn bit_xor(&self, rhs: &JsValue) -> JsValue

Bitwise XOR.

pub fn bit_not(&self) -> JsValue

Bitwise NOT.

pub fn shl(&self, rhs: &JsValue) -> JsValue

Left shift.

pub fn shr(&self, rhs: &JsValue) -> JsValue

Signed right shift.

pub fn unsigned_shr(&self, rhs: &JsValue) -> u32

Unsigned right shift.

pub fn add(&self, rhs: &JsValue) -> JsValue

Add.

pub fn sub(&self, rhs: &JsValue) -> JsValue

Subtract.

pub fn mul(&self, rhs: &JsValue) -> JsValue

Multiply.

pub fn div(&self, rhs: &JsValue) -> JsValue

Divide.

pub fn rem(&self, rhs: &JsValue) -> JsValue

Remainder.

pub fn neg(&self) -> JsValue

Negate.

pub fn lt(&self, other: &JsValue) -> bool

Less than comparison.

pub fn le(&self, other: &JsValue) -> bool

Less than or equal comparison.

pub fn gt(&self, other: &JsValue) -> bool

Greater than comparison.

pub fn ge(&self, other: &JsValue) -> bool

Greater than or equal comparison.

pub fn loose_eq(&self, other: &JsValue) -> bool

Loose equality (==).

pub fn is_falsy(&self) -> bool

Check if this value is a falsy value in JavaScript.

pub fn is_truthy(&self) -> bool

Check if this value is a truthy value in JavaScript.

pub fn is_object(&self) -> bool

Check if this value is an object.

pub fn is_function(&self) -> bool

Check if this value is a function.

pub fn is_string(&self) -> bool

Check if this value is a string.

pub fn is_symbol(&self) -> bool

Check if this value is a symbol.

pub fn is_bigint(&self) -> bool

Check if this value is a bigint.

pub fn is_array(&self) -> bool

Check if this value is an Array.

pub fn is_undefined(&self) -> bool

Check if this value is undefined.

pub fn is_null(&self) -> bool

Check if this value is null.

pub fn is_null_or_undefined(&self) -> bool

Check if this value is null or undefined.

pub fn js_typeof(&self) -> JsValue

Get the typeof this value as a string.

pub fn js_in(&self, obj: &JsValue) -> bool

Check if this value has a property with the given name.

pub fn as_bool(&self) -> Option<bool>

Get the value as a bool.

pub fn as_f64(&self) -> Option<f64>

Get the value as an f64.

pub fn as_string(&self) -> Option<String>

Get the value as a string.

pub fn as_debug_string(&self) -> String

Get a debug string representation of the value.

Trait Implementations

impl<T> AsRef<Array<T>> for Array<T>

fn as_ref(&self) -> &Array<T>

Converts this type into a shared reference of the (usually inferred) input type.

impl AsRef<Array> for RegExpMatchArray

fn as_ref(&self) -> &Array

Converts this type into a shared reference of the (usually inferred) input type.

impl<T> AsRef<JsValue> for Array<T>

fn as_ref(&self) -> &JsValue

Converts this type into a shared reference of the (usually inferred) input type.

impl<T> AsRef<Object> for Array<T>

fn as_ref(&self) -> &Object

Converts this type into a shared reference of the (usually inferred) input type.

impl<T> BatchableResult for Array<T>

fn try_placeholder(batch: &mut Runtime) -> Option<Self>

Returns Some(placeholder) for opaque types that can be batched, None for types that require flushing to get the actual value.

impl<T> BinaryDecode for Array<T>

fn decode(decoder: &mut DecodedData<'_>) -> Result<Self, DecodeError>

impl<T> BinaryEncode for Array<T>

fn encode(self, encoder: &mut EncodedData)

impl<T: Clone> Clone for Array<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for Array<T>

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

Formats the value using the given formatter.

impl Default for Array<JsValue>

fn default() -> Self

Returns the “default value” for a type.

impl<T> Deref for Array<T>

type Target = Object

The resulting type after dereferencing.

fn deref(&self) -> &Object

Dereferences the value.

impl<T> EncodeTypeDef for Array<T>

fn encode_type_def(buf: &mut Vec<u8>)

Encode this type’s definition into the buffer. For primitives, this is just the TypeTag byte. For callbacks, this includes param count, param types, and return type.

impl<T> ErasableGeneric for Array<T>

type Repr = JsValue

impl<A> Extend<A> for Array

where A: AsRef<JsValue>,

fn extend<I>(&mut self, iter: I)

where I: IntoIterator<Item = A>,

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<T> From<Array<T>> for JsValue

fn from(val: Array<T>) -> Self

Converts to this type from the input type.

impl<T> From<Array<T>> for Object

fn from(val: Array<T>) -> Object

Converts to this type from the input type.

impl<T> From<JsValue> for Array<T>

fn from(val: JsValue) -> Self

Converts to this type from the input type.

impl From<RegExpMatchArray> for Array

fn from(val: RegExpMatchArray) -> Array

Converts to this type from the input type.

impl<A> FromIterator<A> for Array

where A: AsRef<JsValue>,

fn from_iter<I>(iter: I) -> Array

where I: IntoIterator<Item = A>,

Creates a value from an iterator.

impl<T: JsGeneric> IntoIterator for Array<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = ArrayIntoIter<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: 'static> IntoJsGeneric for Array<T>

where Array<T>: JsGeneric,

type JsCanon = Array<T>

fn to_js(self) -> Self::JsCanon

impl<T> Iterable for Array<T>

type Item = T

The type of values yielded by this iterable.

impl<T> JsCast for Array<T>

fn instanceof(__val: &JsValue) -> bool

Check if a JsValue is an instance of this type.

fn is_type_of(__val: &JsValue) -> bool

Performs a dynamic type check to see whether the JsValue provided is a value of this type.

fn unchecked_from_js(val: JsValue) -> Self

Unchecked cast from JsValue to this type.

fn unchecked_from_js_ref(val: &JsValue) -> &Self

Unchecked cast from a JsValue reference to a reference of this type.

fn has_type<T>(&self) -> bool

where T: JsCast,

Test whether this JS value has a type T.

fn dyn_into<T>(self) -> Result<T, Self>

where T: JsCast,

Try to cast this value to type T.

fn dyn_ref<T>(&self) -> Option<&T>

where T: JsCast,

Try to get a reference to type T from this value.

fn is_instance_of<T>(&self) -> bool

where T: JsCast,

Test whether this JS value is an instance of the type T.

fn unchecked_into<T>(self) -> T

where T: JsCast,

Unchecked cast to another type.

fn unchecked_ref<T>(&self) -> &T

where T: JsCast,

Unchecked cast to a reference of another type.

impl<T: PartialEq> PartialEq for Array<T>

fn eq(&self, other: &Array<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> Promising for Array<T>

type Resolution = Array<T>

impl<T: Eq> Eq for Array<T>

impl<T> StructuralPartialEq for Array<T>

impl<T, __WryUpcastTarget0> UpcastFrom<Array<T>> for Array<__WryUpcastTarget0>

where __WryUpcastTarget0: UpcastFrom<T>,

impl<T: JsGeneric> UpcastFrom<Array<T>> for ArrayTuple<(JsOption<T>,)>

impl<T: JsGeneric> UpcastFrom<Array<T>> for ArrayTuple<(JsOption<T>, JsOption<T>)>

impl<T: JsGeneric> UpcastFrom<Array<T>> for ArrayTuple<(JsOption<T>, JsOption<T>, JsOption<T>)>

impl<T: JsGeneric> UpcastFrom<Array<T>> for ArrayTuple<(JsOption<T>, JsOption<T>, JsOption<T>, JsOption<T>)>

impl<T: JsGeneric> UpcastFrom<Array<T>> for ArrayTuple<(JsOption<T>, JsOption<T>, JsOption<T>, JsOption<T>, JsOption<T>)>

impl<T: JsGeneric> UpcastFrom<Array<T>> for ArrayTuple<(JsOption<T>, JsOption<T>, JsOption<T>, JsOption<T>, JsOption<T>, JsOption<T>)>

impl<T: JsGeneric> UpcastFrom<Array<T>> for ArrayTuple<(JsOption<T>, JsOption<T>, JsOption<T>, JsOption<T>, JsOption<T>, JsOption<T>, JsOption<T>)>

impl<T: JsGeneric> UpcastFrom<Array<T>> for ArrayTuple<(JsOption<T>, JsOption<T>, JsOption<T>, JsOption<T>, JsOption<T>, JsOption<T>, JsOption<T>, JsOption<T>)>

impl<T> UpcastFrom<Array<T>> for ArrayTuple<(T,)>

impl<T> UpcastFrom<Array<T>> for ArrayTuple<(T, T)>

impl<T> UpcastFrom<Array<T>> for ArrayTuple<(T, T, T)>

impl<T> UpcastFrom<Array<T>> for ArrayTuple<(T, T, T, T)>

impl<T> UpcastFrom<Array<T>> for ArrayTuple<(T, T, T, T, T)>

impl<T> UpcastFrom<Array<T>> for ArrayTuple<(T, T, T, T, T, T)>

impl<T> UpcastFrom<Array<T>> for ArrayTuple<(T, T, T, T, T, T, T)>

impl<T> UpcastFrom<Array<T>> for ArrayTuple<(T, T, T, T, T, T, T, T)>

impl<T> UpcastFrom<Array<T>> for JsOption<JsValue>

impl<T, __WryUpcastTarget0> UpcastFrom<Array<T>> for JsOption<Array<__WryUpcastTarget0>>

where __WryUpcastTarget0: UpcastFrom<T>,

impl<T> UpcastFrom<Array<T>> for JsOption<Object>

impl<T> UpcastFrom<Array<T>> for JsValue

impl<T> UpcastFrom<Array<T>> for Object

impl<T1, Target> UpcastFrom<ArrayTuple<(T1,)>> for Array<Target>

where Target: UpcastFrom<T1>,

impl<T1, T2, Target> UpcastFrom<ArrayTuple<(T1, T2)>> for Array<Target>

where Target: UpcastFrom<T1> + UpcastFrom<T2>,

impl<T1, T2, T3, Target> UpcastFrom<ArrayTuple<(T1, T2, T3)>> for Array<Target>

where Target: UpcastFrom<T1> + UpcastFrom<T2> + UpcastFrom<T3>,

impl<T1, T2, T3, T4, Target> UpcastFrom<ArrayTuple<(T1, T2, T3, T4)>> for Array<Target>

where Target: UpcastFrom<T1> + UpcastFrom<T2> + UpcastFrom<T3> + UpcastFrom<T4>,

impl<T1, T2, T3, T4, T5, Target> UpcastFrom<ArrayTuple<(T1, T2, T3, T4, T5)>> for Array<Target>

where Target: UpcastFrom<T1> + UpcastFrom<T2> + UpcastFrom<T3> + UpcastFrom<T4> + UpcastFrom<T5>,

impl<T1, T2, T3, T4, T5, T6, Target> UpcastFrom<ArrayTuple<(T1, T2, T3, T4, T5, T6)>> for Array<Target>

where Target: UpcastFrom<T1> + UpcastFrom<T2> + UpcastFrom<T3> + UpcastFrom<T4> + UpcastFrom<T5> + UpcastFrom<T6>,

impl<T1, T2, T3, T4, T5, T6, T7, Target> UpcastFrom<ArrayTuple<(T1, T2, T3, T4, T5, T6, T7)>> for Array<Target>

where Target: UpcastFrom<T1> + UpcastFrom<T2> + UpcastFrom<T3> + UpcastFrom<T4> + UpcastFrom<T5> + UpcastFrom<T6> + UpcastFrom<T7>,

impl<T1, T2, T3, T4, T5, T6, T7, T8, Target> UpcastFrom<ArrayTuple<(T1, T2, T3, T4, T5, T6, T7, T8)>> for Array<Target>

where Target: UpcastFrom<T1> + UpcastFrom<T2> + UpcastFrom<T3> + UpcastFrom<T4> + UpcastFrom<T5> + UpcastFrom<T6> + UpcastFrom<T7> + UpcastFrom<T8>,

impl UpcastFrom<RegExpMatchArray> for Array