union -base -containers

package union-find
package
The Union/Find algorithm implements these operations in (effectively) constant-time: * Check whether two elements are in the same equivalence class. * Create a union of two equivalence classes. * Look up the descriptor of the equivalence class. Version 0.2
package union-find-array
package
ST based implementation of Tarjan's disjoint set forests, using mutable arrays storing indices instead of references internally. There is also a pure, immutable version of the data structure, which is useful for querying the result of a union find construction. Version 0.1
unionFileModes :: FileMode -> FileMode -> FileMode
unix System.Posix.Files.ByteString, unix System.Posix.Files
Combines the two file modes into one that contains modes that appear in either.
package funion
package
A unioning file-system using HFuse Version 0.0.2