topology-runner
Version:
Run a topology consisting of a directed acyclic graph
23 lines (22 loc) • 654 B
JavaScript
;
var __importDefault = (this && this.__importDefault) || function (mod) {
return (mod && mod.__esModule) ? mod : { "default": mod };
};
Object.defineProperty(exports, "__esModule", { value: true });
exports.findKeys = void 0;
const fp_1 = __importDefault(require("lodash/fp"));
/**
* Find keys where values match pred. pred can be a lodash iteratee.
*/
function findKeys(pred, obj) {
const iteratee = fp_1.default.iteratee(pred);
const keys = [];
for (const key in obj) {
const val = obj[key];
if (iteratee(val)) {
keys.push(key);
}
}
return keys;
}
exports.findKeys = findKeys;