Programming-Idioms

Idiom

# 222 Find first index of an element in list

Created by

Lead paragraph

Set _i to the first index in list _items at which the element _x can be found, or -_1 if _items does not contain _x.

New implementation

Language

Imports

Code

Documentation URL

Original attribution URL

Online demo

Username

Be concise.

Be useful.

All contributions dictatorially edited by webmasters to match personal tastes.

Please do not paste any copyright violating resource.

Please try to avoid dependencies to third-party libraries and frameworks.

Other implementations

(defn find-index [x items]
  (or (->> items
         (map-indexed vector)
         (filter #(= x (peek %)))
         ffirst) -1))

(defn find-index [x items]
  (reduce-kv
    #(if (= x %3) (reduced %2) %1) -1 items))

i=items.indexOf(x)

i = findloc(items, x)
if (i == 0) i = -1

i := -1
for j, e := range items {
	if e == x {
		i = j
		break
	}
}

import Data.Foldable (find)
import Data.Maybe (fromMaybe)

findIndex x items = fst <$> (find ((==x) . snd) . zip [0..]) items

i = fromMaybe -1 (findIndex x items)

let i = items.indexOf(x);

i := Items.IndexOf(x);

i = items.index(x) if x in items else -1

i = items.index(x) || -1

let opt_i = items.iter().position(|y| *y == x);


let i = match opt_i {
   Some(index) => index as i32,
   None => -1
};

let i = items.iter().position(|y| *y == x).map_or(-1, |n| n as i32);