aboutsummaryrefslogtreecommitdiff
path: root/node_modules/fbjs/lib/minBy.js
diff options
context:
space:
mode:
Diffstat (limited to 'node_modules/fbjs/lib/minBy.js')
-rw-r--r--node_modules/fbjs/lib/minBy.js61
1 files changed, 61 insertions, 0 deletions
diff --git a/node_modules/fbjs/lib/minBy.js b/node_modules/fbjs/lib/minBy.js
new file mode 100644
index 000000000..73091158b
--- /dev/null
+++ b/node_modules/fbjs/lib/minBy.js
@@ -0,0 +1,61 @@
+"use strict";
+
+/**
+ * Copyright (c) 2013-present, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under the BSD-style license found in the
+ * LICENSE file in the root directory of this source tree. An additional grant
+ * of patent rights can be found in the PATENTS file in the same directory.
+ *
+ *
+ */
+
+var compareNumber = function compareNumber(a, b) {
+ return a - b;
+};
+
+/**
+ * Returns the minimum element as measured by a scoring function f. Returns the
+ * first such element if there are ties.
+ */
+function minBy(as, f, compare) {
+ compare = compare || compareNumber;
+
+ var minA = undefined;
+ var minB = undefined;
+ var seenFirst = false;
+ var _iteratorNormalCompletion = true;
+ var _didIteratorError = false;
+ var _iteratorError = undefined;
+
+ try {
+ for (var _iterator = as[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {
+ var a = _step.value;
+
+ var b = f(a);
+ if (!seenFirst || compare(b, minB) < 0) {
+ minA = a;
+ minB = b;
+ seenFirst = true;
+ }
+ }
+ } catch (err) {
+ _didIteratorError = true;
+ _iteratorError = err;
+ } finally {
+ try {
+ if (!_iteratorNormalCompletion && _iterator["return"]) {
+ _iterator["return"]();
+ }
+ } finally {
+ if (_didIteratorError) {
+ throw _iteratorError;
+ }
+ }
+ }
+
+ return minA;
+}
+
+module.exports = minBy; \ No newline at end of file