complement -package:lapack
Reverse all the bits in the argument
Inverts a pattern, e.g.
complement "foo/bar.html"
will match
anything except
"foo/bar.html"
The edge complement of a graph. Note that, as can be seen from the
examples below, this operation ignores self-loops. Complexity:
O(n^2 * log n) time,
O(n^2) memory.
complement empty == empty
complement (vertex x) == (vertex x)
complement (edge 1 2) == (vertices [1, 2])
complement (edge 0 0) == (edge 0 0)
complement (star 1 [2, 3]) == (overlay (vertex 1) (edge 2 3))
complement . complement == id
Bitwise complement (flip every bit).
Complement.
>>> empty .== complement (full :: SSet Integer)
True
Complementing twice gets us back the original set:
>>> prove $ \(s :: SSet Integer) -> complement (complement s) .== s
Q.E.D.
Complement the interval set.
A color harmony using the base color and its opposite.
Constructs the complement relation <math> of a relation
<math>, which is defined by <math>.
Invert the colors of all keys.
O(n). Complement of the set.
O(n). Complement of the set.
Set complement. Returns the set of things in xs that are not
in ys.
x `complementBit` i is the same as x `xor` bit i