Search a list of records
Given a vector type (such as list or array), which may be homogeneous or heterogeneous, search for something. Demonstrate by searching for at least two types of things (which may require multiple examples).
J
J supports several "searching" primitives.
i.
finds the indices of the things being looked for (with 0 being the first index). Nonmatches get an
<lang j> 1 2 3 4 5 6 7 8 9 i. 2 3 5 60 1 2 4 9
(;:'one two three four five six seven eight nine') i. ;:'two three five sixty'
1 2 4 9</lang>
e.
finds whether an item is a member of a set, returning a bitmask to select the members:
<lang j> 1 2 3 4 5 6 7 8 9 e. 2 3 5 60 0 1 1 0 1 0 0 0 0
(;:'one two three four five six seven eight nine') e. ;:'two three five sixty'
0 1 1 0 1 0 0 0 0</lang>
I.
finds indices, but performs a binary search (which requires that the list being searched is sorted). This can be useful for finding non-exact matches (the index of the next value is returned for non-exact matches).
<lang j> 1 2 3 4 5 6 7 8 9 I. 2 3 5 60 6.66 1 2 4 9 6
(;:'eight five four nine one seven six three two') I. ;:'two three five sixty'
8 7 1 7</lang>
Perl
<lang perl>if(grep $_ eq $needle, @haystack) { print 'Found'; }</lang>
PHP
<lang PHP>echo in_array('needle', ['hay', 'stack']) ? 'Found' : 'Not found';</lang>
zkl
<lang zkl>list:=List("one",2,3.4,2); list.find(2).println(); //-->1 list.find("one").println(); //-->0 list.index(2,3).println(); //-->3 same as find but exception if not found
// start searching at third position</lang>