本文整理汇总了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);
});
});
});
开发者ID:jugglingthebits,项目名称:C3,代码行数:52,代码来源:binary-heap.spec.ts
示例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);
});
开发者ID:jugglingthebits,项目名称:C3,代码行数:7,代码来源:binary-heap.spec.ts
注:本文中的src/common/binary-heap.BinaryHeap类示例由纯净天空整理自Github/MSDocs等源码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。 |
请发表评论