├── .gitignore ├── .travis.yml ├── LICENSE ├── README.md ├── example.js ├── index.js ├── package.json └── test.js /.gitignore: -------------------------------------------------------------------------------- 1 | node_modules 2 | -------------------------------------------------------------------------------- /.travis.yml: -------------------------------------------------------------------------------- 1 | language: node_js 2 | node_js: 3 | - '0.10' 4 | - '0.12' 5 | - '4' 6 | - '6' 7 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | The MIT License (MIT) 2 | 3 | Copyright (c) 2016 Mathias Buus 4 | 5 | Permission is hereby granted, free of charge, to any person obtaining a copy 6 | of this software and associated documentation files (the "Software"), to deal 7 | in the Software without restriction, including without limitation the rights 8 | to use, copy, modify, merge, publish, distribute, sublicense, and/or sell 9 | copies of the Software, and to permit persons to whom the Software is 10 | furnished to do so, subject to the following conditions: 11 | 12 | The above copyright notice and this permission notice shall be included in 13 | all copies or substantial portions of the Software. 14 | 15 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 16 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 17 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 18 | AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 19 | LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 20 | OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN 21 | THE SOFTWARE. 22 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # sorted-array-functions 2 | 3 | Maintain and search through a sorted array using some low level functions 4 | 5 | ``` 6 | npm install sorted-array-functions 7 | ``` 8 | 9 | [![build status](http://img.shields.io/travis/mafintosh/sorted-array-functions.svg?style=flat)](http://travis-ci.org/mafintosh/sorted-array-functions) 10 | 11 | ## Usage 12 | 13 | ``` js 14 | var sorted = require('sorted-array-functions') 15 | var list = [] 16 | 17 | sorted.add(list, 1) 18 | sorted.add(list, 4) 19 | sorted.add(list, 2) 20 | 21 | console.log(list) // prints out [1, 2, 4] 22 | console.log(sorted.has(list, 2)) // returns true 23 | console.log(sorted.has(list, 3)) // returns false 24 | console.log(sorted.eq(list, 2)) // returns 1 (the index) 25 | console.log(sorted.gt(list, 2)) // returns 2 26 | console.log(sorted.gt(list, 4)) // returns -1 27 | ``` 28 | 29 | ## API 30 | 31 | #### `sorted.add(list, value, [compare])` 32 | 33 | Insert a new value into the list sorted. 34 | Optionally you can use a custom compare function that returns, `compare(a, b)` that returns 1 if `a > b`, 0 if `a === b` and -1 if `a < b`. 35 | 36 | #### `sorted.addFromFront(list, value, [compare])` 37 | 38 | Inserts a new value (same result as `sorted.add()`) optimized for prepend. 39 | 40 | #### `var bool = sorted.remove(list, value, [compare])` 41 | 42 | Remove a value. Returns true if the value was in the list. 43 | 44 | #### `var bool = sorted.has(list, value, [compare])` 45 | 46 | Check if a value is in the list. 47 | 48 | #### `var index = sorted.eq(list, value, [compare])` 49 | 50 | Get the index of a value in the list (uses binary search). 51 | If the value could not be found -1 is returned. 52 | 53 | #### `var index = sorted.gte(list, value, [compare])` 54 | 55 | Get the index of the first value that is `>=`. 56 | If the value could not be found -1 is returned. 57 | 58 | #### `var index = sorted.gt(list, value, [compare])` 59 | 60 | Get the index of the first value that is `>`. 61 | If the value could not be found -1 is returned. 62 | 63 | #### `var index = sorted.lte(list, value, [compare])` 64 | 65 | Get the index of the first value that is `<=`. 66 | If the value could not be found -1 is returned. 67 | 68 | #### `var index = sorted.lt(list, value, [compare])` 69 | 70 | Get the index of the first value that is `<`. 71 | If the value could not be found -1 is returned. 72 | 73 | ## License 74 | 75 | MIT 76 | -------------------------------------------------------------------------------- /example.js: -------------------------------------------------------------------------------- 1 | var sorted = require('./') 2 | var list = [] 3 | 4 | sorted.add(list, 1) 5 | sorted.add(list, 4) 6 | sorted.add(list, 2) 7 | 8 | console.log(list) // prints out [1, 2, 4] 9 | console.log(sorted.has(list, 2)) // returns true 10 | console.log(sorted.has(list, 3)) // returns false 11 | console.log(sorted.eq(list, 2)) // returns 1 (the index) 12 | console.log(sorted.gt(list, 2)) // returns 2 13 | console.log(sorted.gt(list, 4)) // returns -1 14 | -------------------------------------------------------------------------------- /index.js: -------------------------------------------------------------------------------- 1 | exports.add = add 2 | exports.addFromFront = addFromFront 3 | exports.remove = remove 4 | exports.has = has 5 | exports.eq = eq 6 | exports.lte = lte 7 | exports.lt = lt 8 | exports.gte = gte 9 | exports.gt = gt 10 | exports.nearest = nearest 11 | 12 | function defaultCmp (a, b) { 13 | if (a === b) return 0 14 | return a < b ? -1 : 1 15 | } 16 | 17 | function add (list, value, cmp) { 18 | if (!cmp) cmp = defaultCmp 19 | 20 | var top = list.push(value) - 1 21 | 22 | while (top) { 23 | if (cmp(list[top - 1], value) < 0) return 24 | list[top] = list[top - 1] 25 | list[top - 1] = value 26 | top-- 27 | } 28 | } 29 | 30 | function addFromFront (list, value, cmp) { 31 | if (!cmp) cmp = defaultCmp 32 | 33 | var top = list.unshift(value) - 1 34 | 35 | for (var i = 0; i < top; i++) { 36 | if (cmp(value, list[i + 1]) < 0) return 37 | list[i] = list[i + 1] 38 | list[i + 1] = value 39 | } 40 | } 41 | 42 | function lte (list, value, cmp) { 43 | if (!cmp) cmp = defaultCmp 44 | 45 | var i = indexOf(list, value, cmp) 46 | if (i === -1) return -1 47 | 48 | for (; i >= 0; i--) { 49 | var c = cmp(list[i], value) 50 | if (c <= 0) return i 51 | } 52 | 53 | return -1 54 | } 55 | 56 | function lt (list, value, cmp) { 57 | if (!cmp) cmp = defaultCmp 58 | 59 | var i = indexOf(list, value, cmp) 60 | if (i === -1) return -1 61 | 62 | for (; i >= 0; i--) { 63 | var c = cmp(list[i], value) 64 | if (c < 0) return i 65 | } 66 | 67 | return -1 68 | } 69 | 70 | function gte (list, value, cmp) { 71 | if (!cmp) cmp = defaultCmp 72 | 73 | var i = indexOf(list, value, cmp) 74 | if (i === -1) return -1 75 | 76 | for (; i < list.length; i++) { 77 | var c = cmp(list[i], value) 78 | if (c >= 0) return i 79 | } 80 | 81 | return -1 82 | } 83 | 84 | function gt (list, value, cmp) { 85 | if (!cmp) cmp = defaultCmp 86 | 87 | var i = indexOf(list, value, cmp) 88 | if (i === -1) return -1 89 | 90 | for (; i < list.length; i++) { 91 | var c = cmp(list[i], value) 92 | if (c > 0) return i 93 | } 94 | 95 | return -1 96 | } 97 | 98 | function eq (list, value, cmp) { 99 | if (!cmp) cmp = defaultCmp 100 | 101 | var i = indexOf(list, value, cmp) 102 | if (i === -1) return -1 103 | return cmp(list[i], value) === 0 ? i : -1 104 | } 105 | 106 | function nearest (list, value, cmp) { 107 | if (!cmp) cmp = defaultCmp 108 | 109 | var len = list.length 110 | var top = len - 1 111 | var btm = 0 112 | var mid = -1 113 | var trending = 1 // 0 = down, 2 = up 114 | 115 | while (top >= btm && btm >= 0 && top < len) { 116 | mid = Math.floor((top + btm) / 2) 117 | 118 | var c = cmp(list[mid], value) 119 | if (c === 0) return mid 120 | 121 | if (c >= 0) { 122 | if (trending === 1) trending = 0 123 | else if (trending === 2) { 124 | if (Math.abs(list[mid] - value) > Math.abs(list[mid - 1] - value)) return mid - 1 125 | return mid 126 | } 127 | 128 | top = mid - 1 129 | } else { 130 | if (trending === 1) trending = 2 131 | else if (trending === 0) return mid 132 | 133 | btm = mid + 1 134 | } 135 | } 136 | 137 | return mid 138 | } 139 | 140 | function indexOf (list, value, cmp) { 141 | if (!cmp) cmp = defaultCmp 142 | 143 | var len = list.length 144 | var top = len - 1 145 | var btm = 0 146 | var mid = -1 147 | 148 | while (top >= btm && btm >= 0 && top < len) { 149 | mid = Math.floor((top + btm) / 2) 150 | 151 | var c = cmp(list[mid], value) 152 | if (c === 0) return mid 153 | 154 | if (c >= 0) { 155 | top = mid - 1 156 | } else { 157 | btm = mid + 1 158 | } 159 | } 160 | 161 | return mid 162 | } 163 | 164 | function has (list, value, cmp) { 165 | return eq(list, value, cmp) > -1 166 | } 167 | 168 | function remove (list, value, cmp) { 169 | var i = eq(list, value, cmp) 170 | if (i === -1) return false 171 | list.splice(i, 1) 172 | return true 173 | } 174 | -------------------------------------------------------------------------------- /package.json: -------------------------------------------------------------------------------- 1 | { 2 | "name": "sorted-array-functions", 3 | "version": "1.3.0", 4 | "description": "Maintain and search through a sorted array using some low level functions", 5 | "main": "index.js", 6 | "dependencies": {}, 7 | "devDependencies": { 8 | "standard": "^8.4.0", 9 | "tape": "^4.6.2" 10 | }, 11 | "scripts": { 12 | "test": "standard && tape test.js" 13 | }, 14 | "repository": { 15 | "type": "git", 16 | "url": "https://github.com/mafintosh/sorted-array-functions.git" 17 | }, 18 | "author": "Mathias Buus (@mafintosh)", 19 | "license": "MIT", 20 | "bugs": { 21 | "url": "https://github.com/mafintosh/sorted-array-functions/issues" 22 | }, 23 | "homepage": "https://github.com/mafintosh/sorted-array-functions" 24 | } 25 | -------------------------------------------------------------------------------- /test.js: -------------------------------------------------------------------------------- 1 | var tape = require('tape') 2 | var sorted = require('./') 3 | 4 | tape('add', function (t) { 5 | var list = [] 6 | 7 | sorted.add(list, 3) 8 | sorted.add(list, 4) 9 | sorted.add(list, 3) 10 | sorted.add(list, 9) 11 | sorted.add(list, 0) 12 | sorted.add(list, 5) 13 | sorted.add(list, 8) 14 | 15 | t.same(list, [0, 3, 3, 4, 5, 8, 9]) 16 | t.end() 17 | }) 18 | 19 | tape('addFromFront', function (t) { 20 | var list = [] 21 | 22 | sorted.addFromFront(list, 3) 23 | sorted.addFromFront(list, 4) 24 | sorted.addFromFront(list, 3) 25 | sorted.addFromFront(list, 9) 26 | sorted.addFromFront(list, 0) 27 | sorted.addFromFront(list, 5) 28 | sorted.addFromFront(list, 8) 29 | 30 | t.same(list, [0, 3, 3, 4, 5, 8, 9]) 31 | t.end() 32 | }) 33 | 34 | tape('remove', function (t) { 35 | var list = [] 36 | 37 | sorted.add(list, 3) 38 | sorted.add(list, 4) 39 | sorted.add(list, 3) 40 | sorted.add(list, 9) 41 | sorted.add(list, 0) 42 | sorted.add(list, 5) 43 | sorted.add(list, 8) 44 | 45 | sorted.remove(list, 3) 46 | sorted.remove(list, 5) 47 | sorted.remove(list, 6) 48 | 49 | t.same(list, [0, 3, 4, 8, 9]) 50 | t.end() 51 | }) 52 | 53 | tape('has', function (t) { 54 | var list = [] 55 | 56 | sorted.add(list, 3) 57 | t.same(sorted.has(list, 3), true) 58 | t.same(sorted.has(list, 2), false) 59 | 60 | sorted.add(list, 5) 61 | t.same(sorted.has(list, 5), true) 62 | t.same(sorted.has(list, 3), true) 63 | t.same(sorted.has(list, 2), false) 64 | 65 | sorted.add(list, 1) 66 | t.same(sorted.has(list, 1), true) 67 | t.same(sorted.has(list, 5), true) 68 | t.same(sorted.has(list, 3), true) 69 | t.same(sorted.has(list, 2), false) 70 | t.same(sorted.has(list, 8), false) 71 | 72 | t.end() 73 | }) 74 | 75 | tape('eq', function (t) { 76 | var list = [] 77 | 78 | sorted.add(list, 3) 79 | t.same(sorted.eq(list, 3), 0) 80 | t.same(sorted.eq(list, 2), -1) 81 | 82 | sorted.add(list, 5) 83 | t.same(sorted.eq(list, 5), 1) 84 | t.same(sorted.eq(list, 3), 0) 85 | t.same(sorted.eq(list, 2), -1) 86 | 87 | sorted.add(list, 1) 88 | t.same(sorted.eq(list, 1), 0) 89 | t.same(sorted.eq(list, 5), 2) 90 | t.same(sorted.eq(list, 3), 1) 91 | t.same(sorted.eq(list, 2), -1) 92 | t.same(sorted.eq(list, 8), -1) 93 | 94 | t.end() 95 | }) 96 | 97 | tape('gte', function (t) { 98 | var list = [] 99 | 100 | sorted.add(list, 3) 101 | t.same(sorted.gte(list, 3), 0) 102 | t.same(sorted.gte(list, 2), 0) 103 | 104 | sorted.add(list, 5) 105 | t.same(sorted.gte(list, 5), 1) 106 | t.same(sorted.gte(list, 3), 0) 107 | t.same(sorted.gte(list, 2), 0) 108 | 109 | sorted.add(list, 1) 110 | t.same(sorted.gte(list, 1), 0) 111 | t.same(sorted.gte(list, 5), 2) 112 | t.same(sorted.gte(list, 3), 1) 113 | t.same(sorted.gte(list, 2), 1) 114 | t.same(sorted.gte(list, 8), -1) 115 | 116 | t.end() 117 | }) 118 | 119 | tape('gt', function (t) { 120 | var list = [] 121 | 122 | sorted.add(list, 3) 123 | t.same(sorted.gt(list, 3), -1) 124 | t.same(sorted.gt(list, 2), 0) 125 | 126 | sorted.add(list, 5) 127 | t.same(sorted.gt(list, 5), -1) 128 | t.same(sorted.gt(list, 3), 1) 129 | t.same(sorted.gt(list, 2), 0) 130 | 131 | sorted.add(list, 1) 132 | t.same(sorted.gt(list, 1), 1) 133 | t.same(sorted.gt(list, 5), -1) 134 | t.same(sorted.gt(list, 3), 2) 135 | t.same(sorted.gt(list, 2), 1) 136 | t.same(sorted.gt(list, 8), -1) 137 | 138 | t.end() 139 | }) 140 | 141 | tape('lte', function (t) { 142 | var list = [] 143 | 144 | sorted.add(list, 3) 145 | t.same(sorted.lte(list, 3), 0) 146 | t.same(sorted.lte(list, 2), -1) 147 | 148 | sorted.add(list, 5) 149 | t.same(sorted.lte(list, 6), 1) 150 | t.same(sorted.lte(list, 5), 1) 151 | t.same(sorted.lte(list, 3), 0) 152 | t.same(sorted.lte(list, 2), -1) 153 | 154 | sorted.add(list, 1) 155 | t.same(sorted.lte(list, 1), 0) 156 | t.same(sorted.lte(list, 5), 2) 157 | t.same(sorted.lte(list, 3), 1) 158 | t.same(sorted.lte(list, 2), 0) 159 | t.same(sorted.lte(list, 8), 2) 160 | 161 | t.end() 162 | }) 163 | 164 | tape('lt', function (t) { 165 | var list = [] 166 | 167 | sorted.add(list, 3) 168 | t.same(sorted.lt(list, 3), -1) 169 | t.same(sorted.lt(list, 2), -1) 170 | t.same(sorted.lt(list, 4), 0) 171 | 172 | sorted.add(list, 5) 173 | t.same(sorted.lt(list, 6), 1) 174 | t.same(sorted.lt(list, 5), 0) 175 | t.same(sorted.lt(list, 3), -1) 176 | t.same(sorted.lt(list, 2), -1) 177 | 178 | sorted.add(list, 1) 179 | t.same(sorted.lt(list, 1), -1) 180 | t.same(sorted.lt(list, 5), 1) 181 | t.same(sorted.lt(list, 3), 0) 182 | t.same(sorted.lt(list, 2), 0) 183 | t.same(sorted.lt(list, 8), 2) 184 | 185 | t.end() 186 | }) 187 | 188 | tape('custom compare add', function (t) { 189 | var list = [] 190 | 191 | sorted.add(list, {foo: 3}, cmp) 192 | sorted.add(list, {foo: 4}, cmp) 193 | sorted.add(list, {foo: 3}, cmp) 194 | sorted.add(list, {foo: 9}, cmp) 195 | sorted.add(list, {foo: 0}, cmp) 196 | sorted.add(list, {foo: 5}, cmp) 197 | sorted.add(list, {foo: 8}, cmp) 198 | 199 | t.same(list, [{foo: 0}, {foo: 3}, {foo: 3}, {foo: 4}, {foo: 5}, {foo: 8}, {foo: 9}]) 200 | t.end() 201 | }) 202 | 203 | tape('custom compare remove', function (t) { 204 | var list = [] 205 | 206 | sorted.add(list, {foo: 3}, cmp) 207 | sorted.add(list, {foo: 4}, cmp) 208 | sorted.add(list, {foo: 3}, cmp) 209 | sorted.add(list, {foo: 9}, cmp) 210 | sorted.add(list, {foo: 0}, cmp) 211 | sorted.add(list, {foo: 5}, cmp) 212 | sorted.add(list, {foo: 8}, cmp) 213 | 214 | sorted.remove(list, {foo: 3}, cmp) 215 | sorted.remove(list, {foo: 5}, cmp) 216 | sorted.remove(list, {foo: 6}, cmp) 217 | 218 | t.same(list, [{foo: 0}, {foo: 3}, {foo: 4}, {foo: 8}, {foo: 9}]) 219 | t.end() 220 | }) 221 | 222 | tape('custom compare has', function (t) { 223 | var list = [] 224 | 225 | sorted.add(list, {foo: 3}, cmp) 226 | t.same(sorted.has(list, {foo: 3}, cmp), true) 227 | t.same(sorted.has(list, {foo: 2}, cmp), false) 228 | 229 | sorted.add(list, {foo: 5}, cmp) 230 | t.same(sorted.has(list, {foo: 5}, cmp), true) 231 | t.same(sorted.has(list, {foo: 3}, cmp), true) 232 | t.same(sorted.has(list, {foo: 2}, cmp), false) 233 | 234 | sorted.add(list, {foo: 1}, cmp) 235 | t.same(sorted.has(list, {foo: 1}, cmp), true) 236 | t.same(sorted.has(list, {foo: 5}, cmp), true) 237 | t.same(sorted.has(list, {foo: 3}, cmp), true) 238 | t.same(sorted.has(list, {foo: 2}, cmp), false) 239 | t.same(sorted.has(list, {foo: 8}, cmp), false) 240 | 241 | t.end() 242 | }) 243 | 244 | tape('custom compare eq', function (t) { 245 | var list = [] 246 | 247 | sorted.add(list, {foo: 3}, cmp) 248 | t.same(sorted.eq(list, {foo: 3}, cmp), 0) 249 | t.same(sorted.eq(list, {foo: 2}, cmp), -1) 250 | 251 | sorted.add(list, {foo: 5}, cmp) 252 | t.same(sorted.eq(list, {foo: 5}, cmp), 1) 253 | t.same(sorted.eq(list, {foo: 3}, cmp), 0) 254 | t.same(sorted.eq(list, {foo: 2}, cmp), -1) 255 | 256 | sorted.add(list, {foo: 1}, cmp) 257 | t.same(sorted.eq(list, {foo: 1}, cmp), 0) 258 | t.same(sorted.eq(list, {foo: 5}, cmp), 2) 259 | t.same(sorted.eq(list, {foo: 3}, cmp), 1) 260 | t.same(sorted.eq(list, {foo: 2}, cmp), -1) 261 | t.same(sorted.eq(list, {foo: 8}, cmp), -1) 262 | 263 | t.end() 264 | }) 265 | 266 | tape('custom compare gte', function (t) { 267 | var list = [] 268 | 269 | sorted.add(list, {foo: 3}, cmp) 270 | t.same(sorted.gte(list, {foo: 3}, cmp), 0) 271 | t.same(sorted.gte(list, {foo: 2}, cmp), 0) 272 | 273 | sorted.add(list, {foo: 5}, cmp) 274 | t.same(sorted.gte(list, {foo: 5}, cmp), 1) 275 | t.same(sorted.gte(list, {foo: 3}, cmp), 0) 276 | t.same(sorted.gte(list, {foo: 2}, cmp), 0) 277 | 278 | sorted.add(list, {foo: 1}, cmp) 279 | t.same(sorted.gte(list, {foo: 1}, cmp), 0) 280 | t.same(sorted.gte(list, {foo: 5}, cmp), 2) 281 | t.same(sorted.gte(list, {foo: 3}, cmp), 1) 282 | t.same(sorted.gte(list, {foo: 2}, cmp), 1) 283 | t.same(sorted.gte(list, {foo: 8}, cmp), -1) 284 | 285 | t.end() 286 | }) 287 | 288 | tape('custom compare gt', function (t) { 289 | var list = [] 290 | 291 | sorted.add(list, {foo: 3}, cmp) 292 | t.same(sorted.gt(list, {foo: 3}, cmp), -1) 293 | t.same(sorted.gt(list, {foo: 2}, cmp), 0) 294 | 295 | sorted.add(list, {foo: 5}, cmp) 296 | t.same(sorted.gt(list, {foo: 5}, cmp), -1) 297 | t.same(sorted.gt(list, {foo: 3}, cmp), 1) 298 | t.same(sorted.gt(list, {foo: 2}, cmp), 0) 299 | 300 | sorted.add(list, {foo: 1}, cmp) 301 | t.same(sorted.gt(list, {foo: 1}, cmp), 1) 302 | t.same(sorted.gt(list, {foo: 5}, cmp), -1) 303 | t.same(sorted.gt(list, {foo: 3}, cmp), 2) 304 | t.same(sorted.gt(list, {foo: 2}, cmp), 1) 305 | t.same(sorted.gt(list, {foo: 8}, cmp), -1) 306 | 307 | t.end() 308 | }) 309 | 310 | tape('custom compare lte', function (t) { 311 | var list = [] 312 | 313 | sorted.add(list, {foo: 3}, cmp) 314 | t.same(sorted.lte(list, {foo: 3}, cmp), 0) 315 | t.same(sorted.lte(list, {foo: 2}, cmp), -1) 316 | 317 | sorted.add(list, {foo: 5}, cmp) 318 | t.same(sorted.lte(list, {foo: 6}, cmp), 1) 319 | t.same(sorted.lte(list, {foo: 5}, cmp), 1) 320 | t.same(sorted.lte(list, {foo: 3}, cmp), 0) 321 | t.same(sorted.lte(list, {foo: 2}, cmp), -1) 322 | 323 | sorted.add(list, {foo: 1}, cmp) 324 | t.same(sorted.lte(list, {foo: 1}, cmp), 0) 325 | t.same(sorted.lte(list, {foo: 5}, cmp), 2) 326 | t.same(sorted.lte(list, {foo: 3}, cmp), 1) 327 | t.same(sorted.lte(list, {foo: 2}, cmp), 0) 328 | t.same(sorted.lte(list, {foo: 8}, cmp), 2) 329 | 330 | t.end() 331 | }) 332 | 333 | tape('custom compare lt', function (t) { 334 | var list = [] 335 | 336 | sorted.add(list, {foo: 3}, cmp) 337 | t.same(sorted.lt(list, {foo: 3}, cmp), -1) 338 | t.same(sorted.lt(list, {foo: 2}, cmp), -1) 339 | t.same(sorted.lt(list, {foo: 4}, cmp), 0) 340 | 341 | sorted.add(list, {foo: 5}, cmp) 342 | t.same(sorted.lt(list, {foo: 6}, cmp), 1) 343 | t.same(sorted.lt(list, {foo: 5}, cmp), 0) 344 | t.same(sorted.lt(list, {foo: 3}, cmp), -1) 345 | t.same(sorted.lt(list, {foo: 2}, cmp), -1) 346 | 347 | sorted.add(list, {foo: 1}, cmp) 348 | t.same(sorted.lt(list, {foo: 1}, cmp), -1) 349 | t.same(sorted.lt(list, {foo: 5}, cmp), 1) 350 | t.same(sorted.lt(list, {foo: 3}, cmp), 0) 351 | t.same(sorted.lt(list, {foo: 2}, cmp), 0) 352 | t.same(sorted.lt(list, {foo: 8}, cmp), 2) 353 | 354 | t.end() 355 | }) 356 | 357 | tape('find nearest value', function (t) { 358 | var list = [] 359 | 360 | sorted.add(list, 0.001) 361 | sorted.add(list, 10) 362 | sorted.add(list, 20) 363 | sorted.add(list, 30) 364 | sorted.add(list, 40) 365 | sorted.add(list, 50) 366 | sorted.add(list, 70) 367 | 368 | t.equal(sorted.nearest(list, 66), 6) 369 | t.equal(sorted.nearest(list, 51), 5) 370 | t.equal(sorted.nearest(list, 1), 0) 371 | t.equal(sorted.nearest(list, 0), 0) 372 | t.equal(sorted.nearest(list, 69.999), 6) 373 | t.equal(sorted.nearest(list, 72), 6) 374 | 375 | t.end() 376 | }) 377 | 378 | function cmp (a, b) { 379 | return a.foo - b.foo 380 | } 381 | 382 | --------------------------------------------------------------------------------