| |||||
| |||||
| |||||
Synopsis | |||||
Names set type | |||||
| |||||
Manipulating these sets | |||||
| |||||
| |||||
| |||||
| |||||
| |||||
| |||||
| |||||
| |||||
| |||||
| |||||
| |||||
| |||||
| |||||
| |||||
| |||||
| |||||
True if there is a non-empty intersection. s1 intersectsNameSet s2 doesn't compute s2 if s1 is empty | |||||
| |||||
Free variables | |||||
| |||||
Manipulating sets of free variables | |||||
| |||||
| |||||
| |||||
| |||||
| |||||
| |||||
| |||||
| |||||
| |||||
Defs and uses | |||||
| |||||
A set of names that are defined somewhere | |||||
| |||||
A set of names that are used somewhere | |||||
| |||||
(Just ds, us) => The use of any member of the ds implies that all the us are used too. Also, us may mention ds. Nothing => Nothing is defined in this group, but nevertheless all the uses are essential. Used for instance declarations, for example | |||||
| |||||
A number of DefUses in dependency order: earlier Defs scope over later Uses | |||||
Manipulating defs and uses | |||||
| |||||
| |||||
| |||||
| |||||
| |||||
Given some DefUses and some Uses, find all the uses, transitively. The result is a superset of the input Uses; and includes things defined in the input DefUses (but only if they are used) | |||||
| |||||
| |||||
Just like allUses, but Defs are not eliminated from the Uses returned | |||||
| |||||
Collect all Uses, regardless of whether the group is itself used, but remove Defs on the way | |||||
Produced by Haddock version 2.6.1 |