Sometimes I see an algorithm for a predicate duplicated because the notion of closeness varies. Eg. exact equality, (maximum over) elementwise distance, closeness in norm.
This package is a quick initial attempt at addressing the problem. The idea is to decouple the meaning and implementation of the predicate (eg ishermitian
) from the meaning and implementation of closeness. (eq, exact or approximate equality)