complement -package:algebraic-graphs
Reverse all the bits in the argument
Inverts a pattern, e.g.
complement "foo/bar.html"
will match
anything except
"foo/bar.html"
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.
For an m-by-n-matrix a with m>=n this function computes an
m-by-(m-n)-matrix b such that Matrix.multiply (adjoint b)
a is a zero matrix. The function does not try to compensate a
rank deficiency of a. That is, a|||b has full rank
if and only if a has full rank.
For full-rank matrices you might also call this kernel or
nullspace.
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