Generic algorithms and constraints

The idea

A generic function uses type parameters to express relationships among its inputs and outputs. A first-element helper can return T? for an input [T], preserving the caller’s element type. A constraint such as T: Equatable permits equality comparisons inside the implementation. Avoid returning Any when the operation can retain a useful static relationship without losing flexibility.

Constraints should follow the operations the algorithm actually performs. Equality-based search does not require ordering, while sorting needs a comparison policy. Generic array copying retains Swift’s value semantics for the array container, but class instances stored as elements are still references to shared objects. Document independence at the right level so a caller does not assume an outer copy recursively duplicates an arbitrary object graph.

func firstIndex<T:Equatable>(_ values:[T],of target:T)->Int? {for i in values.indices {if values[i]==target{return i}};return nil}
print(firstIndex(["a","b","a"],of:"a") ?? -1)
print(firstIndex([Int](),of:4) ?? -1)

0
-1

The generic search preserves first-match behavior and represents empty or absent cases with nil.