summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorGravatar Daphne Preston-Kendal 2021-04-02 12:30:17 +0200
committerGravatar Daphne Preston-Kendal 2021-04-02 12:30:17 +0200
commit78cc98f65cef0076fb0c86f976583dfa9e0708ef (patch)
tree51b0b52382bda239280ecb88b8477ff793b621f1
parentFix a stylistic weirdness in code for composed comparator ordering. (diff)
Remove the stuff about performance, which isn’t necessarily true.
It isn’t true in the sample implementation, for instance.
-rw-r--r--composing-comparators.md2
1 files changed, 1 insertions, 1 deletions
diff --git a/composing-comparators.md b/composing-comparators.md
index 4ade085..332f131 100644
--- a/composing-comparators.md
+++ b/composing-comparators.md
@@ -14,7 +14,7 @@ Returns a comparator which compares values satisfying the given predicate `type-
Expands to a form which returns a comparator which compares values satisfying the given predicate `type-test` by running in turn, left to right, wrapper comparators made out of the given `unwrap` and `comparator`, according to the rules for `make-composed-comparator`. `comparator` may be omitted from each form, in which case the SRFI 128 default comparator is used.
-This is equivalent to using the procedural forms `make-composed-comparator` and `make-wrapper-comparator` together, but can be slightly more efficient because it only needs to run the given `type-test` predicate once, whereas composing a number of `make-wrapper-comparator`s would run each wrapper comparator’s type test once for each comparator in the composed comparator.
+This is equivalent to using the procedural forms `make-composed-comparator` and `make-wrapper-comparator` together.
## Examples