sorted-btree
Version:
A sorted list of key-value pairs in a fast, typed in-memory B+ tree with a powerful API.
2 lines (1 loc) • 689 B
JavaScript
;var __importDefault=this&&this.__importDefault||function(e){return e&&e.__esModule?e:{default:e}};Object.defineProperty(exports,"__esModule",{value:!0});var shared_1=require("./shared"),forEachKeyInBoth_1=__importDefault(require("./forEachKeyInBoth")),bulkLoad_1=require("./bulkLoad");function intersect(e,r,o){var t=e,u=r,a=(0,shared_1.checkCanDoSetOperation)(t,u,!0);if(0===t._root.size())return e.clone();if(0===u._root.size())return r.clone();var n=[],i=[];(0,forEachKeyInBoth_1.default)(e,r,function(e,r,t){t=o(e,r,t);n.push(e),i.push(t)});r=new e.constructor(void 0,e._compare,a);return r._root=(0,bulkLoad_1.bulkLoadRoot)(n,i,a,e._compare),r}exports.default=intersect;