function map

[b] ::= f::(b ::= a) l::[a]

Applies a function to each element of the list.

This is a list of links. map foldr

param f The function to apply param l The list to map over return The list containing the results of applying the function to l

In file: List.sv

function foldr

b ::= f::(b ::= a b) i::b l::[a]

In file: List.sv

function foldl

b ::= f::(b ::= b a) i::b l::[a]

In file: List.sv

function foldr1

a ::= f::(a ::= a a) l::[a]

In file: List.sv

function foldl1

a ::= f::(a ::= a a) l::[a]

In file: List.sv

function filter

[a] ::= f::(Boolean ::= a) lst::[a]

In file: List.sv

function partition

Pair<[a] [a]> ::= f::(Boolean ::= a) lst::[a]

In file: List.sv

function containsBy

Boolean ::= eq::(Boolean ::= a a) elem::a lst::[a]

In file: List.sv

function nubBy

[a] ::= eq::(Boolean ::= a a) xs::[a]

In file: List.sv

function removeBy

[a] ::= eq::(Boolean ::= a a) x::a xs::[a]

In file: List.sv

function removeAllBy

[a] ::= eq::(Boolean ::= a a) ys::[a] xs::[a]

In file: List.sv

function init

[a] ::= lst::[a]

In file: List.sv

function last

a ::= lst::[a]

In file: List.sv

function concat

[a] ::= lst::[[a]]

In file: List.sv

function flatMap

[b] ::= f::([b] ::= a) lst::[a]

In file: List.sv

function drop

[a] ::= number::Integer lst::[a]

In file: List.sv

function take

[a] ::= number::Integer lst::[a]

In file: List.sv

function dropWhile

[a] ::= f::(Boolean ::= a) lst::[a]

In file: List.sv

function takeWhile

[a] ::= f::(Boolean ::= a) lst::[a]

In file: List.sv

function takeUntil

[a] ::= f::(Boolean ::= a) lst::[a]

In file: List.sv

function positionOf

Integer ::= eq::(Boolean ::= a a) x::a xs::[a]

In file: List.sv

function positionOfHelper

Integer ::= eq::(Boolean ::= a a) x::a xs::[a] currentPos::Integer

In file: List.sv

function repeat

[a] ::= v::a times::Integer

In file: List.sv

function zipWith

[c] ::= f::(c ::= a b) l1::[a] l2::[b]

In file: List.sv

function reverse

[a] ::= lst::[a]

In file: List.sv

function reverseHelp

[a] ::= lst::[a] sofar::[a]

In file: List.sv

function sortBy

[a] ::= lte::(Boolean ::= a a) lst::[a]

In file: List.sv

function sortByHelp

[a] ::= lte::(Boolean ::= a a) lst::[a] upTo::Integer

In file: List.sv

function mergeBy

[a] ::= lte::(Boolean ::= a a) l1::[a] l2::[a]

In file: List.sv

function groupBy

[[a]] ::= eq::(Boolean ::= a a) l::[a]

In file: List.sv

function groupByHelp

Pair<[a] [a]> ::= eq::(Boolean ::= a a) f::a l::[a]

In file: List.sv

function intersperse

[a] ::= sep::a xs::[a]

In file: List.sv

function unionBy

[a] ::= eq::(Boolean ::= a a) l::[a] r::[a]

In file: List.sv

function intersectBy

[a] ::= eq::(Boolean ::= a a) l::[a] r::[a]

In file: List.sv

function unionsBy

[a] ::= eq::(Boolean ::= a a) ss::[[a]]

In file: List.sv

function all

Boolean ::= l::[Boolean]

In file: List.sv

function any

Boolean ::= l::[Boolean]

In file: List.sv

function nil

[a] ::=

In file: List.sv

function cons

[a] ::= h::a t::[a]

In file: List.sv

function append

[a] ::= l1::[a] l2::[a]

In file: List.sv

function null

Boolean ::= l::[a]

In file: List.sv

function listLength

Integer ::= l::[a]

In file: List.sv

function head

a ::= l::[a]

In file: List.sv

function tail

[a] ::= l::[a]

In file: List.sv

nonterminal List<a>

In file: List.sv

abstract production i_nilList

l::List<a> ::=

In file: List.sv

abstract production i_consList

l::List<a> ::= h::a t::Decorated List<a>

In file: List.sv