Search functions

The three search functions are Index of (⊐), Progressive Index of (⊒), and Member of (∊). These are dyadic functions that search one argument ("searched-in") for major cells matching cells from the other ("searched-for"). For example, Index of returns, for each cell in 𝕩, the index of the first cell in 𝕨 that matches it.

The searched-for argument is 𝕩 in Index-of functions (⊐⊒) and 𝕨 in Member of (∊). Bins Up and Down (⍋⍒) are ordering functions but follow the same pattern as Index-of. It's split into cells, but not necessarily major cells: instead, the cells used match the rank of a major cell of the other (searched-in) argument. In the most common case, when the searched-in argument is a list, 0-cells are used for the search (we might also say elements, as it gives the same result).

The result is always an array containing one number for each searched-for cell. For Index of and Member of, every result is computed independently; for Progressive Index of the result for a cell can depend on earlier cells, in index order.

Member of

The simplest of the search functions, Member of (∊) returns 1 if an entry in 𝕨 matches some entry in 𝕩, and 0 if it doesn't.

    "green"‿"bricks"‿"cow"‿"blue" ∊ "red"‿"green"‿"blue"
⟨ 1 0 0 1 ⟩

The result is independent of the ordering of 𝕩: all that matters is which cells it contains.

Member of can be used in a train to compute the set intersection and difference of two arrays. For example, ∊/⊣ uses 𝕨∊𝕩 to filter 𝕨 (from 𝕨⊣𝕩), giving an intersection.

    "initial set" (∊/⊣) "intersect"     # Keep 𝕩
"initiset"

    "initial set" (¬∘∊/⊣) "difference"  # Remove 𝕩
"tal st"

These functions appear in APL as Intersect (∩) and Without (~). Really, only 𝕩 is treated like a set, while the ordering and multiplicity of elements of 𝕨 are maintained. I think the explicit implementations show this well, since 𝕩 is only used as the right argument to ∊, and prefer this clarity to the brevity of a single symbol.

Index of

Index of (⊐) returns the index of the first occurrence of each entry in 𝕨, or ≠𝕨 if an entry doesn't appear in 𝕨 at all.

    "zero"‿"one"‿"two"‿"three" ⊐ "one"‿"eight"‿"two"
⟨ 1 4 2 ⟩

𝕩∊𝕨 is the same as (𝕨⊐𝕩)<≠𝕨. Note the reversal of arguments! In both ∊ and ⊐, the open side points to the searched-in argument and the closed side points to the searched-for argument. Relatedly, in Select (⊏), the open side points to the selected argument, which is more like the searched-in argument in that its cells are generally accessed out of order (the searched-for argument is most like the selection result 𝕨⊏𝕩).

Index of always returns exactly one number, even if there are multiple matches, or no matches at all. To find the indices of all matches, start with Match Each, then apply Indices (I didn't mean for it to sound so repetitive! It just happened!).

    / "letters" ≡¨< 'e'        # Many to one
⟨ 1 4 ⟩

    "letters" (<∘/˘≡⌜˜) "let"  # Many to many
⟨ ⟨ 0 ⟩ ⟨ 1 4 ⟩ ⟨ 2 3 ⟩ ⟩

Progressive Index of

Progressive Index of (⊒), as the name and glyph suggest, is a more sophisticated variant of Index of. Like Index of, it returns either ≠𝕨 or an index of a cell from 𝕨 that matches the given cell of 𝕩. Unlike Index of, no index can ever be repeated (but ≠𝕨 can). Progressive Index of returns the index of the first unused match, provided there's still one left.

    "aaa" ⊒ "aaaaa"
⟨ 0 1 2 3 3 ⟩

    "aaabb" ⊒ "ababababab"
⟨ 0 3 1 4 2 5 5 5 5 5 ⟩

Above we said that 𝕩∊𝕨 is (𝕨⊐𝕩)<≠𝕨, so that ⊐˜<≠∘⊢ is an implementation of Member of. The corresponding ⊒˜<≠∘⊢ implements progressive member of, that is, membership on multisets. So if 𝕩 contains two copies of 'a', only the first two instances of 'a' in 𝕨 are considered to belong to it. And like membership is useful for set intersection and difference, progressive membership gives multiset versions of these.

    "aabbcc" (⊐˜<≠∘⊢) "baa"
⟨ 1 1 1 1 0 0 ⟩

    "aabbcc" (⊒˜<≠∘⊢) "baa"
⟨ 1 1 1 0 0 0 ⟩

    "aabbcc" ((⊒˜=≠∘⊢)/⊣) "baa"  # Multiset difference
"bcc"

This primitive gives an interesting way to implement the ordinals pattern that might be easier to understand than the classic ⍋⍋ (it's probably a little slower though). The idea is to use the sorted array as the left argument to ⊒. Now the index returned for each cell is just where it ended up in that sorted order. If we used ordinary Index of then equal cells would share the smallest index; Progressive Index of means ties are broken in favor of earlier cells.

    ⍋∘⍋ "adebcedba"
⟨ 0 5 7 2 4 8 6 3 1 ⟩

    ∧⊸⊒ "adebcedba"
⟨ 0 5 7 2 4 8 6 3 1 ⟩

    ∧⊸⊐ "adebcedba"  # Ties included
⟨ 0 5 7 2 4 7 5 2 0 ⟩

Here's a goofy code golf tip: if the two arguments to Progressive Index of are the same, then every cell will be matched to itself, because all the previous indices are taken but the current one does match. So ⊒˜ is the same as ↕∘≠.

    ⊒˜ "anything at all"
⟨ 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 ⟩

Single search

Search functions are designed to search for multiple elements at once, and return an array of results. This is the array-oriented way to do it, and can allow faster algorithms to be used for the computation.

    stuff ← "tacks"‿"paper"‿"string"‿"tape"

    stuff ⊐ "tacks"‿"string"
⟨ 0 2 ⟩

The first thing you might try to search for just one element does not go so well (and yes, this is a bad thing).

    stuff ⊐ "string"
⟨ 4 4 4 4 4 4 ⟩

Instead of interpreting 𝕩 as a single element, Index of treats it as a list, and 𝕨 doesn't even contain characters! Well, Enclose (<) makes an array from a single element…

    stuff ⊐< "string"
┌·   
· 2  
    ┘

This result has the right information, but is enclosed and could break the program later on. Remember that the result of a search function is always an array. We really want the first element.

    stuff ⊑∘⊐⟜< "string"
2

If 𝕨 is fixed, then the version I prefer is to use Under to enclose the argument and then un-enclose the result. It requires 𝕨 to be bound to ⊐ because otherwise Under would enclose 𝕨 as well, since it applies 𝔾 to both arguments.

    stuff⊸⊐⌾< "string"
2

For Member of, the equivalent is ∊⟜stuff⌾<.

Higher ranks

So far we've shown search functions acting on lists. Well, and one example with a unit array slipped into the last section. In fact, if the searched-in array is a list, then the searched-for argument can have any rank.

    ["high","rank"] ∊ "list arg"
┌─         
╵ 0 1 1 0  
  1 1 0 0  
          ┘

Member of and Index of compute each result number independently, so only the shape is different. Progressive Index of depends on the way entries in 𝕩 are ordered: it searches them in index order, so that (using Deshape) ⥊𝕨⊒𝕩 is 𝕨⊒⥊𝕩.

    4‿4‿4 ⊒ 3‿2⥊4
┌─     
╵ 0 1  
  2 3  
  3 3  
      ┘

But the searched-in argument doesn't have to be a list either! It can also be an array of higher rank. Rank 0 isn't allowed: if you want to "search" a unit, you're probably just looking for match.

The searched-in argument is treated as a list of its major cells. It's the rank of these major cells—let's call this rank c—that determines how the searched-for argument is treated. That argument must have rank c or more, and it's treated as an array of c-cells. For example, if the left argument to ⊐ is a rank-2 table, then each 1-cell (row) of 𝕩 is searched for independently, yielding one number in the result: a 0-cell.

    ⊢ rows ← ["row","rho","row","rue"]
┌─     
╵"row  
  rho  
  row  
  rue" 
      ┘

    rows ⊐ [["row","row","col"],["rho","cow","col"]]
┌─       
╵ 0 0 4  
  1 4 4  
        ┘

So the result rank of ⊐ is always 𝕩¬○=𝕨, with a result shape (¬=𝕨)↓≢𝕩, and 𝕨⊐𝕩 fails if 1>=𝕨 or the result rank would be negative. In the list case, we have 1==𝕨 (so the first condition holds), and the result rank resolves to =𝕩 (which can't be negative, so the second holds as well). The cell rank of 𝕩 is 0, and the fact that a 0-cell of 𝕩 gives a 0-cell of the result is what causes the shape arithmetic to be so simple.

For Member of, the arguments are reversed relative to Index of, but otherwise everything's the same. This differs from APL, where entries are always elements, not cells. Many APL designers consider the APL definition to be a failure of foresight and would prefer BQN's definition—or rather A+'s or J's definition, as these languages were actually the first to use it. The rank-aware version is more flexible, as it allows both searching for elements and searching for rows. APL would return the first result in both cases below.

    [2‿1,3‿1] ∊ 3‿1‿4‿3
┌─     
╵ 0 1  
  1 1  
      ┘

    [2‿1,3‿1] ∊ 3‿1≍4‿3
⟨ 0 1 ⟩