|
1 |
| -var vows = require('vows'), |
2 |
| - assert = require('assert'), |
3 |
| - suite = vows.describe('CBuffer'); |
| 1 | +var vows = require('vows'); |
| 2 | +var assert = require('assert'); |
| 3 | +var suite = vows.describe('sortedIndex'); |
4 | 4 |
|
5 | 5 | require('../env');
|
6 | 6 |
|
7 | 7 | suite.addBatch({
|
8 |
| - 'sortedIndex': { |
9 |
| - 'works with simple sorted case': { |
10 |
| - topic: function() { |
11 |
| - return CBuffer(1, 3, 5, 7, 11); |
12 |
| - }, |
13 |
| - 'no iterator provided': function(buffer) { |
14 |
| - assert.equal(buffer.sortedIndex(-1), 0); |
15 |
| - assert.equal(buffer.sortedIndex(1.5), 1); |
16 |
| - }, |
17 |
| - 'returns index of existing items': function(buffer) { |
18 |
| - assert.equal(buffer.sortedIndex(1), 0); |
19 |
| - assert.equal(buffer.sortedIndex(5), 2); |
20 |
| - assert.equal(buffer.sortedIndex(11), 4); |
21 |
| - }, |
22 |
| - 'around the corner': function(buffer) { |
23 |
| - assert.equal(buffer.sortedIndex(-1), 0); |
24 |
| - assert.equal(buffer.sortedIndex(12), 4); |
25 |
| - }, |
26 |
| - 'takes an iterator': function() { |
27 |
| - var buffer = CBuffer(7, 5, 11, 3, 1); |
28 |
| - function iter(a, b) { |
29 |
| - return Math.abs(a - 8) - Math.abs(b - 8); |
30 |
| - } |
31 |
| - assert.equal(buffer.sortedIndex(6, iter), 1); |
32 |
| - }, |
| 8 | + 'sortedIndex': { |
| 9 | + 'works with simple sorted case': { |
| 10 | + topic: function() { |
| 11 | + return CBuffer(1, 3, 5, 7, 11); |
| 12 | + }, |
| 13 | + 'no iterator provided': function(buffer) { |
| 14 | + assert.equal(buffer.sortedIndex(-1), 0); |
| 15 | + assert.equal(buffer.sortedIndex(1.5), 1); |
| 16 | + }, |
| 17 | + 'returns index of existing items': function(buffer) { |
| 18 | + assert.equal(buffer.sortedIndex(1), 0); |
| 19 | + assert.equal(buffer.sortedIndex(5), 2); |
| 20 | + assert.equal(buffer.sortedIndex(11), 4); |
| 21 | + }, |
| 22 | + 'around the corner': function(buffer) { |
| 23 | + assert.equal(buffer.sortedIndex(-1), 0); |
| 24 | + assert.equal(buffer.sortedIndex(12), 4); |
| 25 | + }, |
| 26 | + 'takes an iterator': function() { |
| 27 | + var buffer = CBuffer(7, 5, 11, 3, 1); |
| 28 | + function iter(a, b) { |
| 29 | + return Math.abs(a - 8) - Math.abs(b - 8); |
| 30 | + } |
| 31 | + assert.equal(buffer.sortedIndex(6, iter), 1); |
| 32 | + }, |
33 | 33 |
|
34 |
| - 'non-full circular buffer': { |
35 |
| - topic: function() { |
36 |
| - var buffer = CBuffer(20); |
37 |
| - buffer.push(1, 2, 3, 4, 5, 6, 7, 8); |
38 |
| - return buffer; |
39 |
| - }, |
40 |
| - 'works with partially complete buffers': function(buffer) { |
41 |
| - assert.equal(buffer.sortedIndex(3), 2); |
42 |
| - assert.equal(buffer.sortedIndex(8), 7); |
43 |
| - }, |
44 |
| - 'can determine postion in a fixed length buffer': function(buffer) { |
45 |
| - assert.equal(buffer.sortedIndex(0), 0); |
46 |
| - assert.equal(buffer.sortedIndex(1), 0); |
47 |
| - assert.equal(buffer.sortedIndex(3), 2); |
48 |
| - assert.equal(buffer.sortedIndex(10), 8); |
49 |
| - } |
50 |
| - }, |
| 34 | + 'non-full circular buffer': { |
| 35 | + topic: function() { |
| 36 | + var buffer = CBuffer(20); |
| 37 | + buffer.push(1, 2, 3, 4, 5, 6, 7, 8); |
| 38 | + return buffer; |
| 39 | + }, |
| 40 | + 'works with partially complete buffers': function(buffer) { |
| 41 | + assert.equal(buffer.sortedIndex(3), 2); |
| 42 | + assert.equal(buffer.sortedIndex(8), 7); |
| 43 | + }, |
| 44 | + 'can determine postion in a fixed length buffer': function(buffer) { |
| 45 | + assert.equal(buffer.sortedIndex(0), 0); |
| 46 | + assert.equal(buffer.sortedIndex(1), 0); |
| 47 | + assert.equal(buffer.sortedIndex(3), 2); |
| 48 | + assert.equal(buffer.sortedIndex(10), 8); |
| 49 | + } |
| 50 | + }, |
51 | 51 |
|
52 |
| - 'supports classic repeative item case': { |
53 |
| - topic: function() { |
54 |
| - return CBuffer(0, 0, 0, 1, 1, 1, 1, 1, 1, 3); |
55 |
| - }, |
56 |
| - 'supports repative item': function(buffer) { |
57 |
| - assert.equal(buffer.sortedIndex(2), 9); |
58 |
| - } |
59 |
| - } |
60 |
| - }, |
| 52 | + 'supports classic repeative item case': { |
| 53 | + topic: function() { |
| 54 | + return CBuffer(0, 0, 0, 1, 1, 1, 1, 1, 1, 3); |
| 55 | + }, |
| 56 | + 'supports repative item': function(buffer) { |
| 57 | + assert.equal(buffer.sortedIndex(2), 9); |
| 58 | + } |
| 59 | + } |
| 60 | + }, |
61 | 61 |
|
62 |
| - 'handles circular cases': { |
63 |
| - 'mid circular case': { |
64 |
| - topic: function() { |
65 |
| - var buffer = CBuffer(-1, 0, 1, 3, 5); |
66 |
| - buffer.push(7, 9); |
67 |
| - return buffer; |
68 |
| - }, |
69 |
| - 'simple circular buffer': function(buffer) { |
70 |
| - assert.equal(buffer.sortedIndex(0), 0); |
71 |
| - assert.equal(buffer.sortedIndex(2), 1); |
72 |
| - assert.equal(buffer.sortedIndex(4), 2); |
73 |
| - assert.equal(buffer.sortedIndex(7), 3); |
74 |
| - assert.equal(buffer.sortedIndex(8), 4); |
75 |
| - assert.equal(buffer.sortedIndex(10), 4); |
76 |
| - }, |
77 |
| - 'circular buffer on the pivot': function(buffer) { |
78 |
| - assert.equal(buffer.sortedIndex(4.999), 2); |
79 |
| - assert.equal(buffer.sortedIndex(5), 2); |
80 |
| - assert.equal(buffer.sortedIndex(6), 3); |
81 |
| - }, |
82 |
| - 'returns index of existing item': function(buffer) { |
83 |
| - assert.equal(buffer.sortedIndex(7), 3); |
84 |
| - } |
85 |
| - }, |
| 62 | + 'handles circular cases': { |
| 63 | + 'mid circular case': { |
| 64 | + topic: function() { |
| 65 | + var buffer = CBuffer(-1, 0, 1, 3, 5); |
| 66 | + buffer.push(7, 9); |
| 67 | + return buffer; |
| 68 | + }, |
| 69 | + 'simple circular buffer': function(buffer) { |
| 70 | + assert.equal(buffer.sortedIndex(0), 0); |
| 71 | + assert.equal(buffer.sortedIndex(2), 1); |
| 72 | + assert.equal(buffer.sortedIndex(4), 2); |
| 73 | + assert.equal(buffer.sortedIndex(7), 3); |
| 74 | + assert.equal(buffer.sortedIndex(8), 4); |
| 75 | + assert.equal(buffer.sortedIndex(10), 4); |
| 76 | + }, |
| 77 | + 'circular buffer on the pivot': function(buffer) { |
| 78 | + assert.equal(buffer.sortedIndex(4.999), 2); |
| 79 | + assert.equal(buffer.sortedIndex(5), 2); |
| 80 | + assert.equal(buffer.sortedIndex(6), 3); |
| 81 | + }, |
| 82 | + 'returns index of existing item': function(buffer) { |
| 83 | + assert.equal(buffer.sortedIndex(7), 3); |
| 84 | + } |
| 85 | + }, |
86 | 86 |
|
87 |
| - 'almost sorted data cases (1 item out of place)': { |
88 |
| - topic: function() { |
89 |
| - var buffer = CBuffer(-3, -1, 0, 1, 3, 5, 7); |
90 |
| - buffer.push(7, 9, 11, 13, 15, 17); |
91 |
| - return buffer; |
92 |
| - }, |
93 |
| - 'single item out of place': function(buffer) { |
94 |
| - assert.equal(buffer.sortedIndex(0), 0); |
95 |
| - assert.equal(buffer.sortedIndex(17), 6); |
96 |
| - } |
97 |
| - } |
98 |
| - } |
99 |
| - } |
| 87 | + 'almost sorted data cases (1 item out of place)': { |
| 88 | + topic: function() { |
| 89 | + var buffer = CBuffer(-3, -1, 0, 1, 3, 5, 7); |
| 90 | + buffer.push(7, 9, 11, 13, 15, 17); |
| 91 | + return buffer; |
| 92 | + }, |
| 93 | + 'single item out of place': function(buffer) { |
| 94 | + assert.equal(buffer.sortedIndex(0), 0); |
| 95 | + assert.equal(buffer.sortedIndex(17), 6); |
| 96 | + } |
| 97 | + } |
| 98 | + } |
| 99 | + } |
100 | 100 | });
|
101 | 101 |
|
102 | 102 | suite.export(module);
|
0 commit comments