List Comprehensions
List comprehensions are a feature of many modern functional programming languages. Subject to certain rules, they provide a succinct notation for generating elements in a list.
List comprehensions are analogous to set comprehensions in Zermelo-Frankel set theory and are called ZF expressions in Miranda. They are analogous to the setof and findall predicates in Prolog.

List comprehensions are written with the following syntax:

[Expr || Qualifier1,…,QualifierN]

Expr is an arbitrary expression, and each Qualifier is either a generator or a filter.

* A generator is written as:
Pattern

但是從R13B以後lc是可以不要generator的, 只要filter也可以.

[email protected]:~# erl
Erlang R13B04 (erts-5.7.5)  [smp:2:2] [rq:2] [async-threads:0] [hipe] [kernel-poll:false]

Eshell V5.7.5  (abort with ^G)
1> Nums = [1,2,3], Nouns = [shoe,box,tape], Verbs = [].
[]
2> [Nums || Nums =/= []] ++ [Nouns || Nouns =/= []] ++ [Verbs || Verbs
=/= []].
[[1,2,3],[shoe,box,tape]] 

這樣的話你就可以寫類似這樣的程式碼:

Cond = 2,
[io:format("hello~n", []) || Cond =/=1].

免得用if 或者case語句寫, 整個程式碼顯得更清爽.

Post Footer automatically generated by wp-posturl plugin for wordpress.