Menu
While reading the LearnYouSomeErlang and I found that cons operator is used to get the first element of list. I was a bit confused as to how that works because earlier in the book he mentions that cons operator is used to add elements to the list.
This function returns the first element of a List.
head([H|_]) -> H.
Found in this page http://learnyousomeerlang.com/syntax-in-functions.
Can someone explain how this works in returning the first element of a list.
225
In Scala, List has an operator :: , which is known as the Cons operator. It is useful to add new elements at the beginning of the List . Here, Cons is short for construct the new List object. We cannot use the Cons operator to add a new element at the end of the List .
You can use lists:split/2 for this: divide(L, N) -> divide(L, N, []). divide([], _, Acc) -> lists:reverse(Acc); divide(L, N, Acc) when length(L) < N -> lists:reverse([L|Acc]); divide(L, N, Acc) -> {H,T} = lists:split(N, L), divide(T, N, [H|Acc]).
This is the function that is called: set_viewer_values(Value, ViewerSet) -> if ViewerSet /= empty_set -> lists:map(fun(ViewerPid) -> ViewerPid ! {self(), set_value, Value} end, ViewerSet) end.
In Erlang, Lists are created by enclosing the values in square brackets.
The cons operator can be used to pattern match a list. So a list can be pattern matched to [H|T] which deconstructs the list and H is the first element of the list and the T is the remaining items of the list.
So, the cons operator is both used for pattern matching and also to construct lists. E.g of construction is X = [1|[2,3]].
178
I'm not sure if this will be useful, but...
A cons cell describes a pair of which the first element is a term of some sort and the second is a pointer to another cons cell (or null if at the end of a list). So, if you will let me use '->' as a pointer symbol, a simple cons cell representing a list of one element could be,
[1, -> null] = the list [1].
[2, -> [1,-> null]] = the list [2,1], etc.
A list can be thought of as a linked list of cons cells where the 2nd element of the Cons cell is the pointer to the next link.
A Cons operator creates a new list by creating a Cons cell of which the first element is a new list element and the second element is a pointer to the first Cons cell of the original list. The first element is the Head, and the second element (the Tail) is a pointer to next Cons cell in the 'chain'. In Erlang, the above can be written as
[2|[1|[]]]
which is the list [2,1]. As a short-hand, [1|[]] is written as [1], so
[2|[1|[]]] = [2|[1]]=[2,1]
Now, if my list were [1,2,3], I could represent it as its head Cons-ed with its Tail as in,
[1|[2,3]
So, because Erlang is awesome, this pattern is available to match on as in: "I have a list, [1,2,3] which can be described as a Cons-ed Hd and a Tail (a pointer to the Hd of the rest of the list). So
[Hd|Tail] = [1,2,3]
gives
Hd = 1
and
Tail = [2,->[3,->null]] = [2|[3|[]]] = [2|[3]] = [2,3].
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With
