Skip to main content
Module

x/collections/mod.ts>Vector#indexOf

Collection data structures that are not standard built-in objects in JavaScript. This includes a vector (double-ended queue), binary heap (priority queue), binary search tree, and a red black tree.
Very Popular
Latest
method Vector.prototype.indexOf
import { Vector } from "https://deno.land/x/collections@0.12.1/mod.ts";

Returns the first index at which the search value can be found in the vector, or -1 if it is not found. This uses strict equality checks. Optionally, you can search a subset of the vector by providing an index range. The start and end represent the index of values in the vector. The end is exclusive meaning it will not be included. If the index value is negative, it will be subtracted from the end of the vector.

Parameters

searchValue: T
optional
start: number
optional
end: number

Returns

number