本文整理匯總了TypeScript中src/common/binary-heap.BinaryHeap類的典型用法代碼示例。如果您正苦於以下問題：TypeScript BinaryHeap類的具體用法？TypeScript BinaryHeap怎麽用？TypeScript BinaryHeap使用的例子？那麽, 這裏精選的類代碼示例或許可以為您提供幫助。
在下文中一共展示了BinaryHeap類的2個代碼示例，這些例子默認根據受歡迎程度排序。您可以為喜歡或者感覺有用的代碼點讚，您的評價將有助於係統推薦出更棒的TypeScript代碼示例。
示例1: describe
describe('the binary heap', () => {
let heap: BinaryHeap<MockElement>;
beforeEach(() => {
heap = new BinaryHeap<MockElement>(e => e.score);
});
describe('pull', () => {
it('should return the previously pushed object', () => {
const value = {score: 1};
heap.push(value);
expect(heap.pop()).toBe(value);
});
it('should return undefined when empty', () => {
expect(heap.pop()).toBeUndefined();
});
it('should return objects in the right order', () => {
const values = [];
for (let i=0; i<100; i++) {
values.push({score: i});
heap.push(values[i]);
}
for (let i=0; i<=99; i++) {
expect(heap.pop()).toBe(values[i]);
}
});
});
describe('size', () => {
it('should return 0 when empty', () => {
expect(heap.size).toBe(0);
});
it('should return 100 when there are 100 elements', () => {
for (let i=0; i<100; i++) {
heap.push({score: i});
}
expect(heap.size).toBe(100);
});
it('should return 1 less after pop', () => {
for (let i=0; i<100; i++) {
heap.push({score: i});
}
heap.pop();
expect(heap.size).toBe(99);
});
});
});示例2: it
it('should return 1 less after pop', () => {
for (let i=0; i<100; i++) {
heap.push({score: i});
}
heap.pop();
expect(heap.size).toBe(99);
});