Index: packages/quiver_iterables/lib/src/min_max.dart |
diff --git a/packages/quiver/lib/src/iterables/min_max.dart b/packages/quiver_iterables/lib/src/min_max.dart |
similarity index 54% |
copy from packages/quiver/lib/src/iterables/min_max.dart |
copy to packages/quiver_iterables/lib/src/min_max.dart |
index c1e306964c6db2c0c76778986a3bbb8ef4df49fa..41ef95a063d85d2f91f14a66fdf8d601bc754b7a 100644 |
--- a/packages/quiver/lib/src/iterables/min_max.dart |
+++ b/packages/quiver_iterables/lib/src/min_max.dart |
@@ -14,41 +14,35 @@ |
part of quiver.iterables; |
-/** |
- * Returns the maximum value in [i], according to the order specified by the |
- * [compare] function, or `null` if [i] is empty. |
- * |
- * The compare function must act as a [Comparator]. If [compare] is omitted, |
- * [Comparable.compare] is used. If [i] contains null elements, an exception |
- * will be thrown. |
- * |
- */ |
+/// Returns the maximum value in [i], according to the order specified by the |
+/// [compare] function, or `null` if [i] is empty. |
+/// |
+/// The compare function must act as a [Comparator]. If [compare] is omitted, |
+/// [Comparable.compare] is used. If [i] contains null elements, an exception |
+/// will be thrown. |
+/// |
dynamic max(Iterable i, [Comparator compare = Comparable.compare]) => |
i.isEmpty ? null : i.reduce((a, b) => compare(a, b) > 0 ? a : b); |
-/** |
- * Returns the minimum value in [i], according to the order specified by the |
- * [compare] function, or `null` if [i] is empty. |
- * |
- * The compare function must act as a [Comparator]. If [compare] is omitted, |
- * [Comparable.compare] is used. If [i] contains null elements, an exception |
- * will be thrown. |
- */ |
+/// Returns the minimum value in [i], according to the order specified by the |
+/// [compare] function, or `null` if [i] is empty. |
+/// |
+/// The compare function must act as a [Comparator]. If [compare] is omitted, |
+/// [Comparable.compare] is used. If [i] contains null elements, an exception |
+/// will be thrown. |
dynamic min(Iterable i, [Comparator compare = Comparable.compare]) => |
i.isEmpty ? null : i.reduce((a, b) => compare(a, b) < 0 ? a : b); |
-/** |
- * Returns the minimum and maximum values in [i], according to the order |
- * specified by the [compare] function, in an [Extent] instance. Always returns |
- * an [Extent], but [Extent.min] and [Extent.max] may be `null` if [i] is empty. |
- * |
- * The compare function must act as a [Comparator]. If [compare] is omitted, |
- * [Comparable.compare] is used. If [i] contains null elements, an exception |
- * will be thrown. |
- * |
- * If [i] is empty, an [Extent] is returned with [:null:] values for [:min:] and |
- * [:max:], since there are no valid values for them. |
- */ |
+/// Returns the minimum and maximum values in [i], according to the order |
+/// specified by the [compare] function, in an [Extent] instance. Always returns |
+/// an [Extent], but [Extent.min] and [Extent.max] may be `null` if [i] is empty. |
+/// |
+/// The compare function must act as a [Comparator]. If [compare] is omitted, |
+/// [Comparable.compare] is used. If [i] contains null elements, an exception |
+/// will be thrown. |
+/// |
+/// If [i] is empty, an [Extent] is returned with [:null:] values for [:min:] and |
+/// [:max:], since there are no valid values for them. |
Extent extent(Iterable i, [Comparator compare = Comparable.compare]) { |
var iterator = i.iterator; |
var hasNext = iterator.moveNext(); |