kc3-lang/kc3/doc/1_KC3/1.15_List.en.md

Download

1.15 List

Linked lists owning the data. Each node contains a couple of tags : one for data and one for next pointer.

Regular lists can be :

Regular lists end with the empty list : [1] == [1 | []].

You can also contruct dotted lists like in Common Lisp where the next list pointer is an arbitrary form. E.g. :

All these list formats are supported in pattern matching.

1.15.1 Functions

List List.map (List, Fn)
List List.reverse (List)

Top : KC3 documentation

Previous : 1.14 Integer

Next : 1.16 Map


Source

Download