3 List functions

8.16.0.4

3 List functions🔗ℹ

The list data type is identical to the one used in racket, but malt provides functions to access members of the list in the presence of automatic differentiation.

procedure
(ref lst i) → any?
lst : (listof any?)
i : scalar?

Returns the i’th member of lst.

procedure
(refr lst n) → (listof any?)
lst : (listof any?)
n : scalar?

Returns the remaining members in lst after removing the first n members. This is equivalent to drop.

procedure
(len lst) → scalar?
lst : (listof any?)

Returns the number of members in lst.

1	Overview
2	Entry points
3	List functions
4	Tensor functions
5	Extended Functions
6	Automatic Differentiation
7	Differentiable extended numerical functions
8	Non-differentiable extended numerical functions
9	Base-rank (non-extended) differentiable functions
10	Boolean comparison functions
11	Tensorized comparison functions
12	Hyperparameters
13	Gradient Descent Functions and Hyperparameters
14	Layer functions
15	Loss Functions
16	Building blocks for neural networks
17	He Initialization
18	Random number functions
19	Models and Accuracy
20	Logging
21	Utilities
22	Setting tensor implementations