☰
searchablelist
searchablelist
§searchablelist(A type :hasEquals searchablelist.A, from list searchablelist.A) => searchablelist searchablelist.A:Sequence searchablelist.A
§searchablelist(A
type
:hasEquals searchablelist.A, from list searchablelist.A) =>
searchablelist searchablelist.A:
Sequence searchablelist.Acreate a list from this searchablelist.
get the number of non-overlapping matches of l within this
get the number of matches of l
get the index of l within this list or nil if it does not exist
replace all occurrences of old by new
replace the first n occurrences of old by new
§replace(old list searchablelist.A, new list searchablelist.A, already_replaced list searchablelist.A, to_be_replaced list searchablelist.A, limit option u64) => list searchablelist.A:Any
§replace(old list searchablelist.A, new list searchablelist.A, already_replaced list searchablelist.A, to_be_replaced list searchablelist.A, limit option u64)
=>
list searchablelist.A:
Any tail recursive helper for the replace features
does this list start with l?
In contrast to searchable_sequence, this uses choice type 'list' and not ref
type 'Sequence', so it is more efficient.