\n| key | \ntype | \ndescription | \nexample |
|---|
\n\n| filter | \nfunction | \n\nregister a filtration function which returns boolean indicating valid value, running before insertion.\nBy default, function(v) { returns true }, that is, no filtration.\n | \nfunction (v) { return !isNaN(Number(v) } | \n
|---|
\n\n| compare | \none of \"string\", \"number\" | \n\ncomparison function comparing two strings or two numbers asc.
\nBy default, \"number\" comparison.\n | \n\"number\" | \n
|---|
\n\n| compare | \nfunction | \n\na custom comparison function which returns one of [1, 0, -1].
\nThe same spec as Array#sort(fn).\nSee Mozilla official site.\n | \nfunction(a,b) { return a.start - b.start } | \n
|---|
\n\n| resume | \nboolean | \n\nif true, sets the array given in the second arguments with no filtration\n | \ntrue | \n
|---|
\n
\n\n**arr** is a initial value. All elements are shallowly copied.\n\nReturns an instance of SortedList.\n\n### sortedList.insertOne(val) ###\nInserts **val** to the list. \n\nReturns inserted position if succeeded, false if failed.\n\n\n### sortedList.insert(val1, val2, ...) ###\nInserts **val1** **val2**, ... to the list.\n\nReturns list of the result of executing insertOne(val).\n\n console.log(SortedList.create().insert(3,1,2,4,5));\n // [0,0,1,3,4]\n\n### sortedList.remove(pos) ###\nRemoves a value in the position **pos**.\n\nReturns this.\n\n### sortedList.unique(createNew) ###\nMake the list unique.\nIf **createNew** is true, returns a new array.\n\nOtherwise, duplicated elements are internally removed, and this method returns this.\n\n### sortedList.bsearch(val) ###\nExecutes binary search with the given **val**.\nReturns the position before insertion.\n\n var list = SortedList.create([1,2,4,6,10]);\n console.log(list.bsearch(4)); // 2\n console.log(list.bsearch(5)); // 2\n console.log(list.bsearch(0)); // -1\n console.log(list.bsearch(12)); // 4\n\n### sortedList.key(val) ###\nIf the given **val** exists, returns the position.\n\nOtherwise, returns null.\n\n var list = SortedList.create([1,2,4,6,10]);\n console.log(list.key(4)); // 2\n console.log(list.key(5)); // null\n console.log(list.key(1)); // 0\n console.log(list.key(10)); // 4\n\n### sortedList.toArray() ###\nCreates a new array with this list.\n\n## SortedList extends Array ###\nAs SortedList extends Array, we can use every method in Array.\n\n var list = SortedList.create([1,2,4,6,10]);\n\n console.log(list[2]) // 4\n\n list.forEach(function(total, v) {\n // ...\n });\n\n var newArr = list.map(function(total, v) {\n // ...\n });\n\nBe careful of these differences.\n\n Array.isArray(SortedList.create()) // false\n (SortedList.create()) instanceof Array // true\n","maintainers":[{"name":"shinout","email":"shinout310@gmail.com"}],"directories":{}},"0.2.6":{"name":"sortedlist","version":"0.2.6","description":"sorted list","keywords":["sort","list","bsearch","algorithm"],"author":{"name":"SHIN Suzuki","email":"shinout310@gmail.com"},"main":"./SortedList.js","_npmUser":{"name":"shinout","email":"shinout310@gmail.com"},"_id":"sortedlist@0.2.6","dependencies":{},"devDependencies":{},"optionalDependencies":{},"engines":{"node":"*"},"_engineSupported":true,"_npmVersion":"1.1.0-3","_nodeVersion":"v0.6.9","_defaultsLoaded":true,"dist":{"shasum":"83e771a0c9e1fdef89fd8bc5a446b0b7fd5bfd84","tarball":"https://registry.npmjs.org/sortedlist/-/sortedlist-0.2.6.tgz","integrity":"sha512-D4fm43d3aNuHVVdiXgdgx+87sLjetCfmaEaF7RvOX6KJQIikQyZZf4uxg/koxd0qUst5rD1BTE76uOrqmJmbNQ==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIHQlzhAv22i5E8EdtYUFf3YvgZAQhqNn7HFds6CTTDj4AiBYmEEX1FqUXvJbY2MuzClnBXRwqcWLp8AKGttrGtTjCA=="}]},"readme":"SortedList\n==========\nsorted list in JavaScript (browsers (ES5 compatible), Node.js)\n\n## Installation ##\n git clone git://github.com/shinout/SortedList.git\n\n OR\n\n npm install sortedlist\n\n## Usage ##\n\n // sort number\n var list = SortedList.create();\n list.insert(13, 2, 9, 8, 0);\n console.log(list.toArray()); // [0,2,8,9,13]\n\n // sort string\n var arr = [\"foo\", \"bar\", \"hoge\"];\n var strList = SortedList.create(arr, {\n compare: \"string\"\n });\n console.log(strList.toArray()); // [\"bar\", \"foo\", \"hoge\"]\n\n // SortedList is not Array\n console.assert(!Array.isArray(list));\n\n // SortedList is instanceof Array\n console.assert(list instanceof Array);\n\n // SortedList extends Array\n console.assert(list[2], 8);\n console.assert(list.length, 5);\n console.assert(list.pop(), 13);\n\n // register an already filtered array\n var list = SortedList.create([0,1,2,3,4], { resume: true });\n\n## API Documentation ##\n- SortedList.create(options, arr)\n- sortedList.insertOne(val)\n- sortedList.insert(val1, val2, ...)\n- sortedList.remove(pos)\n- sortedList.unique(createNew)\n- sortedList.bsearch(val)\n- sortedList.key(val)\n- sortedList.keys(val)\n- sortedList.toArray()\n\n\n### SortedList.create(options, arr) ###\ncreate an instance of SortedList.\n\n**options** is option object as follows.\n\n| key | \ntype | \ndescription | \nexample |
|---|
\n\n| filter | \nfunction | \n\nregister a filtration function which returns boolean indicating valid value, running before insertion.\nBy default, function(v) { returns true }, that is, no filtration.\n | \nfunction (v) { return !isNaN(Number(v) } | \n
|---|
\n\n| compare | \none of \"string\", \"number\" | \n\ncomparison function comparing two strings or two numbers asc.
\nBy default, \"number\" comparison.\n | \n\"number\" | \n
|---|
\n\n| compare | \nfunction | \n\na custom comparison function which returns one of [1, 0, -1].
\nThe same spec as Array#sort(fn).\nSee Mozilla official site.\n | \nfunction(a,b) { return a.start - b.start } | \n
|---|
\n\n| resume | \nboolean | \n\nif true, sets the array given in the second arguments with no filtration\n | \ntrue | \n
|---|
\n
\n\n**arr** is a initial value. All elements are shallowly copied.\n\nReturns an instance of SortedList.\n\n### sortedList.insertOne(val) ###\nInserts **val** to the list. \n\nReturns inserted position if succeeded, false if failed.\n\n\n### sortedList.insert(val1, val2, ...) ###\nInserts **val1** **val2**, ... to the list.\n\nReturns list of the result of executing insertOne(val).\n\n console.log(SortedList.create().insert(3,1,2,4,5));\n // [0,0,1,3,4]\n\n### sortedList.remove(pos) ###\nRemoves a value in the position **pos**.\n\nReturns this.\n\n### sortedList.unique(createNew) ###\nMake the list unique.\nIf **createNew** is true, returns a new array.\n\nOtherwise, duplicated elements are internally removed, and this method returns this.\n\n### sortedList.bsearch(val) ###\nExecutes binary search with the given **val**.\nReturns the position before insertion.\n\n var list = SortedList.create([1,2,4,6,10]);\n console.log(list.bsearch(4)); // 2\n console.log(list.bsearch(5)); // 2\n console.log(list.bsearch(0)); // -1\n console.log(list.bsearch(12)); // 4\n\n### sortedList.key(val) ###\nIf the given **val** exists, returns the first position.\n\nOtherwise, returns null.\n\n var list = SortedList.create([1,2,4,4,4,6,10]);\n console.log(list.key(10)); // 6\n console.log(list.key(4)); // 2\n console.log(list.key(5)); // null\n console.log(list.key(1)); // 0\n\n### sortedList.keys(val) ###\nIf the given **val** exists, returns an array of all the positions with **val**.\n\nOtherwise, returns null.\n\n var list = SortedList.create([1,2,4,4,4,6,10]);\n console.log(list.keys(10)); // [4]\n console.log(list.keys(4)); // [2, 3, 4]\n console.log(list.keys(5)); // null\n console.log(list.keys(1)); // [0]\n\n\n### sortedList.toArray() ###\nCreates a new array with this list.\n\n## SortedList extends Array ###\nAs SortedList extends Array, we can use every method in Array.\n\n var list = SortedList.create([1,2,4,6,10]);\n\n console.log(list[2]) // 4\n\n list.forEach(function(total, v) {\n // ...\n });\n\n var newArr = list.map(function(total, v) {\n // ...\n });\n\nBe careful of these differences.\n\n Array.isArray(SortedList.create()) // false\n (SortedList.create()) instanceof Array // true\n","maintainers":[{"name":"shinout","email":"shinout310@gmail.com"}],"directories":{}},"0.2.7":{"name":"sortedlist","version":"0.2.7","description":"sorted list","keywords":["sort","list","bsearch","algorithm"],"author":{"name":"SHIN Suzuki","email":"shinout310@gmail.com"},"main":"./SortedList.js","_npmUser":{"name":"shinout","email":"shinout310@gmail.com"},"_id":"sortedlist@0.2.7","dependencies":{},"devDependencies":{},"optionalDependencies":{},"engines":{"node":"*"},"_engineSupported":true,"_npmVersion":"1.1.0-3","_nodeVersion":"v0.6.9","_defaultsLoaded":true,"dist":{"shasum":"9a21ababc2ff22ddc7625896d368f7593caf31af","tarball":"https://registry.npmjs.org/sortedlist/-/sortedlist-0.2.7.tgz","integrity":"sha512-IIfokJmAA6+/S/+x4cZ6Wi3/lO5Ld4GwGb/bSIAtI+my6QrrRmLxZwtYBTwMtntcfNKZF/HE/EjM8bOclRfNQw==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDGQst4AxSeT4btjvxl5jIMqDnOIov4foDf7UbmhyCe0wIhAPGydh69a5O+JkWOqwqudtkkLx8WToxmobiaWcunBSnK"}]},"readme":"SortedList\n==========\nsorted list in JavaScript (browsers (ES5 compatible), Node.js)\n\n## Installation ##\n git clone git://github.com/shinout/SortedList.git\n\n OR\n\n npm install sortedlist\n\n## Usage ##\n\n // sort number\n var list = SortedList.create();\n list.insert(13, 2, 9, 8, 0);\n console.log(list.toArray()); // [0,2,8,9,13]\n\n // sort string\n var arr = [\"foo\", \"bar\", \"hoge\"];\n var strList = SortedList.create(arr, {\n compare: \"string\"\n });\n console.log(strList.toArray()); // [\"bar\", \"foo\", \"hoge\"]\n\n // SortedList is not Array\n console.assert(!Array.isArray(list));\n\n // SortedList is instanceof Array\n console.assert(list instanceof Array);\n\n // SortedList extends Array\n console.assert(list[2], 8);\n console.assert(list.length, 5);\n console.assert(list.pop(), 13);\n\n // register an already filtered array\n var list = SortedList.create([0,1,2,3,4], { resume: true });\n\n## API Documentation ##\n- SortedList.create(options, arr)\n- sortedList.insertOne(val)\n- sortedList.insert(val1, val2, ...)\n- sortedList.remove(pos)\n- sortedList.unique(createNew)\n- sortedList.bsearch(val)\n- sortedList.key(val)\n- sortedList.keys(val)\n- sortedList.toArray()\n\n\n### SortedList.create(options, arr) ###\ncreate an instance of SortedList.\n\n**options** is option object as follows.\n\n| key | \ntype | \ndescription | \nexample |
|---|
\n\n| unique | \nboolean | \nfilter unique values in insertion. | \ntrue | \n
|---|
\n\n| filter | \nfunction | \n\nregister a filtration function which returns boolean indicating valid value, running before insertion.\nBy default, function(v) { returns true }, that is, no filtration.\n | \nfunction (v) { return !isNaN(Number(v) } | \n
|---|
\n\n| compare | \none of \"string\", \"number\" | \n\ncomparison function comparing two strings or two numbers asc.
\nBy default, \"number\" comparison.\n | \n\"number\" | \n
|---|
\n\n| compare | \nfunction | \n\na custom comparison function which returns one of [1, 0, -1].
\nThe same spec as Array#sort(fn).\nSee Mozilla official site.\n | \nfunction(a,b) { return a.start - b.start } | \n
|---|
\n\n| resume | \nboolean | \n\nif true, sets the array given in the second arguments with no filtration\n | \ntrue | \n
|---|
\n
\n\n**arr** is a initial value. All elements are shallowly copied.\n\nReturns an instance of SortedList.\n\n### sortedList.insertOne(val) ###\nInserts **val** to the list. \n\nReturns inserted position if succeeded, false if failed.\n\n\n### sortedList.insert(val1, val2, ...) ###\nInserts **val1** **val2**, ... to the list.\n\nReturns list of the result of executing insertOne(val).\n\n console.log(SortedList.create().insert(3,1,2,4,5));\n // [0,0,1,3,4]\n\n### sortedList.remove(pos) ###\nRemoves a value in the position **pos**.\n\nReturns this.\n\n### sortedList.unique(createNew) ###\nMake the list unique.\nIf **createNew** is true, returns a new array.\n\nOtherwise, duplicated elements are internally removed, and this method returns this.\n\n### sortedList.bsearch(val) ###\nExecutes binary search with the given **val**.\nReturns the position before insertion.\n\n var list = SortedList.create([1,2,4,6,10]);\n console.log(list.bsearch(4)); // 2\n console.log(list.bsearch(5)); // 2\n console.log(list.bsearch(0)); // -1\n console.log(list.bsearch(12)); // 4\n\n### sortedList.key(val) ###\nIf the given **val** exists, returns the first position.\n\nOtherwise, returns null.\n\n var list = SortedList.create([1,2,4,4,4,6,10]);\n console.log(list.key(10)); // 6\n console.log(list.key(4)); // 2\n console.log(list.key(5)); // null\n console.log(list.key(1)); // 0\n\n### sortedList.keys(val) ###\nIf the given **val** exists, returns an array of all the positions with **val**.\n\nOtherwise, returns null.\n\n var list = SortedList.create([1,2,4,4,4,6,10]);\n console.log(list.keys(10)); // [4]\n console.log(list.keys(4)); // [2, 3, 4]\n console.log(list.keys(5)); // null\n console.log(list.keys(1)); // [0]\n\n\n### sortedList.toArray() ###\nCreates a new array with this list.\n\n## SortedList extends Array ###\nAs SortedList extends Array, we can use every method in Array.\n\n var list = SortedList.create([1,2,4,6,10]);\n\n console.log(list[2]) // 4\n\n list.forEach(function(total, v) {\n // ...\n });\n\n var newArr = list.map(function(total, v) {\n // ...\n });\n\nBe careful of these differences.\n\n Array.isArray(SortedList.create()) // false\n (SortedList.create()) instanceof Array // true\n","maintainers":[{"name":"shinout","email":"shinout310@gmail.com"}],"directories":{}},"0.2.8":{"name":"sortedlist","version":"0.2.8","description":"sorted list","keywords":["sort","list","bsearch","algorithm"],"author":{"name":"SHIN Suzuki","email":"shinout310@gmail.com"},"main":"./SortedList.js","_npmUser":{"name":"shinout","email":"shinout310@gmail.com"},"_id":"sortedlist@0.2.8","dependencies":{},"devDependencies":{},"optionalDependencies":{},"engines":{"node":"*"},"_engineSupported":true,"_npmVersion":"1.1.12","_nodeVersion":"v0.6.14","_defaultsLoaded":true,"dist":{"shasum":"123202cdf4867828cefebdadf0c12dfaa0acbf4c","tarball":"https://registry.npmjs.org/sortedlist/-/sortedlist-0.2.8.tgz","integrity":"sha512-8lCmSVvRnk8jAxZObwvUTXDkB8EEHHKhso/SrD6o8laylAbhgjGNgvgJwV20TknlFjxNTWUyc8zBmtiSYt+OgA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIFB30OfCeq8FyrClq406QPNs7XQOg82S3vknnJqE5yCmAiBgzjZYSuOTfl1rKvBLXLWZT6FMjXDl0fEciRq9nDVEag=="}]},"readme":"SortedList\n==========\nsorted list in JavaScript (browsers (ES5 compatible), Node.js)\n\n## Installation ##\n git clone git://github.com/shinout/SortedList.git\n\n OR\n\n npm install sortedlist\n\n## Usage ##\n\n // sort number\n var list = SortedList.create();\n list.insert(13, 2, 9, 8, 0);\n console.log(list.toArray()); // [0,2,8,9,13]\n\n // sort string\n var arr = [\"foo\", \"bar\", \"hoge\"];\n var strList = SortedList.create(arr, {\n compare: \"string\"\n });\n console.log(strList.toArray()); // [\"bar\", \"foo\", \"hoge\"]\n\n // SortedList is not Array\n console.assert(!Array.isArray(list));\n\n // SortedList is instanceof Array\n console.assert(list instanceof Array);\n\n // SortedList extends Array\n console.assert(list[2], 8);\n console.assert(list.length, 5);\n console.assert(list.pop(), 13);\n\n // register an already filtered array\n var list = SortedList.create([0,1,2,3,4], { resume: true });\n\n## API Documentation ##\n- SortedList.create(options, arr)\n- sortedList.insertOne(val)\n- sortedList.insert(val1, val2, ...)\n- sortedList.remove(pos)\n- sortedList.unique(createNew)\n- sortedList.bsearch(val)\n- sortedList.key(val)\n- sortedList.keys(val)\n- sortedList.toArray()\n\n\n### SortedList.create(options, arr) ###\ncreate an instance of SortedList.\n\n**options** is option object as follows.\n\n| key | \ntype | \ndescription | \nexample |
|---|
\n\n| unique | \nboolean | \nfilter unique values in insertion. | \ntrue | \n
|---|
\n\n| filter | \nfunction | \n\nregister a filtration function which returns boolean indicating valid value, running before insertion.\nBy default, function(v) { returns true }, that is, no filtration.\n | \nfunction (v) { return !isNaN(Number(v) } | \n
|---|
\n\n| compare | \none of \"string\", \"number\" | \n\ncomparison function comparing two strings or two numbers asc.
\nBy default, \"number\" comparison.\n | \n\"number\" | \n
|---|
\n\n| compare | \nfunction | \n\na custom comparison function which returns one of [1, 0, -1].
\nThe same spec as Array#sort(fn).\nSee Mozilla official site.\n | \nfunction(a,b) { return a.start - b.start } | \n
|---|
\n\n| resume | \nboolean | \n\nif true, sets the array given in the second arguments with no filtration\n | \ntrue | \n
|---|
\n
\n\n**arr** is a initial value. All elements are shallowly copied.\n\nReturns an instance of SortedList.\n\n### sortedList.insertOne(val) ###\nInserts **val** to the list. \n\nReturns inserted position if succeeded, false if failed.\n\n\n### sortedList.insert(val1, val2, ...) ###\nInserts **val1** **val2**, ... to the list.\n\nReturns list of the result of executing insertOne(val).\n\n console.log(SortedList.create().insert(3,1,2,4,5));\n // [0,0,1,3,4]\n\n### sortedList.remove(pos) ###\nRemoves a value in the position **pos**.\n\nReturns this.\n\n### sortedList.unique(createNew) ###\nMake the list unique.\nIf **createNew** is true, returns a new array.\n\nOtherwise, duplicated elements are internally removed, and this method returns this.\n\n### sortedList.bsearch(val) ###\nExecutes binary search with the given **val**.\nReturns the position before insertion.\n\n var list = SortedList.create([1,2,4,6,10]);\n console.log(list.bsearch(4)); // 2\n console.log(list.bsearch(5)); // 2\n console.log(list.bsearch(0)); // -1\n console.log(list.bsearch(12)); // 4\n\n### sortedList.key(val) ###\nIf the given **val** exists, returns the first position.\n\nOtherwise, returns null.\n\n var list = SortedList.create([1,2,4,4,4,6,10]);\n console.log(list.key(10)); // 6\n console.log(list.key(4)); // 2\n console.log(list.key(5)); // null\n console.log(list.key(1)); // 0\n\n### sortedList.keys(val) ###\nIf the given **val** exists, returns an array of all the positions with **val**.\n\nOtherwise, returns null.\n\n var list = SortedList.create([1,2,4,4,4,6,10]);\n console.log(list.keys(10)); // [4]\n console.log(list.keys(4)); // [2, 3, 4]\n console.log(list.keys(5)); // null\n console.log(list.keys(1)); // [0]\n\n\n### sortedList.toArray() ###\nCreates a new array with this list.\n\n## SortedList extends Array ###\nAs SortedList extends Array, we can use every method in Array.\n\n var list = SortedList.create([1,2,4,6,10]);\n\n console.log(list[2]) // 4\n\n list.forEach(function(total, v) {\n // ...\n });\n\n var newArr = list.map(function(total, v) {\n // ...\n });\n\nBe careful of these differences.\n\n Array.isArray(SortedList.create()) // false\n (SortedList.create()) instanceof Array // true\n","maintainers":[{"name":"shinout","email":"shinout310@gmail.com"}],"directories":{}},"0.3.0":{"name":"sortedlist","version":"0.3.0","description":"sorted list","keywords":["sort","list","bsearch","algorithm"],"author":{"name":"SHIN Suzuki","email":"shinout310@gmail.com"},"main":"./SortedList.js","readme":"SortedList\n==========\nsorted list in JavaScript (browsers (ES5 compatible), Node.js)\n\n## Installation ##\n git clone git://github.com/shinout/SortedList.git\n\n OR\n\n npm install sortedlist\n\n## Usage ##\n\n // sort number\n var list = SortedList.create();\n list.insert(13, 2, 9, 8, 0);\n console.log(list.toArray()); // [0,2,8,9,13]\n\n // sort string\n var arr = [\"foo\", \"bar\", \"hoge\"];\n var strList = SortedList.create(arr, {\n compare: \"string\"\n });\n console.log(strList.toArray()); // [\"bar\", \"foo\", \"hoge\"]\n\n // SortedList is not Array\n console.assert(!Array.isArray(list));\n\n // SortedList is instanceof Array\n console.assert(list instanceof Array);\n\n // SortedList extends Array\n console.assert(list[2], 8);\n console.assert(list.length, 5);\n console.assert(list.pop(), 13);\n\n // register an already filtered array\n var list = SortedList.create([0,1,2,3,4], { resume: true });\n\n## API Documentation ##\n- SortedList.create(options, arr)\n- sortedList.insertOne(val)\n- sortedList.insert(val1, val2, ...)\n- sortedList.remove(pos)\n- sortedList.unique(createNew)\n- sortedList.bsearch(val)\n- sortedList.key(val)\n- sortedList.keys(val)\n- sortedList.toArray()\n\n\n### SortedList.create(options, arr) ###\ncreate an instance of SortedList.\n\n**options** is option object as follows.\n\n| key | \ntype | \ndescription | \nexample |
|---|
\n\n| unique | \nboolean | \nfilter unique values in insertion. | \ntrue | \n
|---|
\n\n| filter | \nfunction | \n\nregister a filtration function which returns boolean indicating valid value, running before insertion.\nBy default, function(v) { returns true }, that is, no filtration.\n | \nfunction (v) { return !isNaN(Number(v) } | \n
|---|
\n\n| compare | \none of \"string\", \"number\" | \n\ncomparison function comparing two strings or two numbers asc.
\nBy default, \"number\" comparison.\n | \n\"number\" | \n
|---|
\n\n| compare | \nfunction | \n\na custom comparison function which returns one of [1, 0, -1].
\nThe same spec as Array#sort(fn).\nSee Mozilla official site.\n | \nfunction(a,b) { return a.start - b.start } | \n
|---|
\n\n| resume | \nboolean | \n\nif true, sets the array given in the second arguments with no filtration\n | \ntrue | \n
|---|
\n
\n\n**arr** is a initial value. All elements are shallowly copied.\n\nReturns an instance of SortedList.\n\n### sortedList.insertOne(val) ###\nInserts **val** to the list. \n\nReturns inserted position if succeeded, false if failed.\n\n\n### sortedList.insert(val1, val2, ...) ###\nInserts **val1** **val2**, ... to the list.\n\nReturns list of the result of executing insertOne(val).\n\n console.log(SortedList.create().insert(3,1,2,4,5));\n // [0,0,1,3,4]\n\n### sortedList.remove(pos) ###\nRemoves a value in the position **pos**.\n\nReturns this.\n\n### sortedList.unique(createNew) ###\nMake the list unique.\nIf **createNew** is true, returns a new array.\n\nOtherwise, duplicated elements are internally removed, and this method returns this.\n\n### sortedList.bsearch(val) ###\nExecutes binary search with the given **val**.\nReturns the position before insertion.\n\n var list = SortedList.create([1,2,4,6,10]);\n console.log(list.bsearch(4)); // 2\n console.log(list.bsearch(5)); // 2\n console.log(list.bsearch(0)); // -1\n console.log(list.bsearch(12)); // 4\n\n### sortedList.key(val) ###\nIf the given **val** exists, returns the first position.\n\nOtherwise, returns null.\n\n var list = SortedList.create([1,2,4,4,4,6,10]);\n console.log(list.key(10)); // 6\n console.log(list.key(4)); // 2\n console.log(list.key(5)); // null\n console.log(list.key(1)); // 0\n\n### sortedList.keys(val) ###\nIf the given **val** exists, returns an array of all the positions with **val**.\n\nOtherwise, returns null.\n\n var list = SortedList.create([1,2,4,4,4,6,10]);\n console.log(list.keys(10)); // [4]\n console.log(list.keys(4)); // [2, 3, 4]\n console.log(list.keys(5)); // null\n console.log(list.keys(1)); // [0]\n\n\n### sortedList.toArray() ###\nCreates a new array with this list.\n\n## SortedList extends Array ###\nAs SortedList extends Array, we can use every method in Array.\n\n var list = SortedList.create([1,2,4,6,10]);\n\n console.log(list[2]) // 4\n\n list.forEach(function(total, v) {\n // ...\n });\n\n var newArr = list.map(function(total, v) {\n // ...\n });\n\nBe careful of these differences.\n\n Array.isArray(SortedList.create()) // false\n (SortedList.create()) instanceof Array // true\n","readmeFilename":"README.md","_id":"sortedlist@0.3.0","dist":{"shasum":"3df63016742ba5fb68a76e4689f900bb6389f6ea","tarball":"https://registry.npmjs.org/sortedlist/-/sortedlist-0.3.0.tgz","integrity":"sha512-pBJsdgvYEAZLPyRk5SBQZooIBwzwkv2GJYs/P+ZQxJsRAaMeo8pdm2Jw8vf9GcPcx8kmQbldaQXoSrEQV16Y5Q==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDhkxmioZX3tKROJZuThYKWKZZpDTzIYeP+AMPsJq6moAIhAIFlqO8vikTmMY5tfB38hH34BqZJMd5Fu7QCjSoaQvKF"}]},"_npmVersion":"1.1.69","_npmUser":{"name":"shinout","email":"shinout310@gmail.com"},"maintainers":[{"name":"shinout","email":"shinout310@gmail.com"}],"directories":{}},"0.3.1":{"name":"sortedlist","version":"0.3.1","description":"sorted list","keywords":["sort","list","bsearch","algorithm"],"author":{"name":"SHIN Suzuki","email":"shinout310@gmail.com"},"main":"./SortedList.js","readme":"SortedList\n==========\nsorted list in JavaScript (browsers (ES5 compatible), Node.js)\n\n## Installation ##\n git clone git://github.com/shinout/SortedList.git\n\n OR\n\n npm install sortedlist\n\n## Usage ##\n\n // sort number\n var list = SortedList.create();\n list.insert(13, 2, 9, 8, 0);\n console.log(list.toArray()); // [0,2,8,9,13]\n\n // sort string\n var arr = [\"foo\", \"bar\", \"hoge\"];\n var strList = SortedList.create(arr, {\n compare: \"string\"\n });\n console.log(strList.toArray()); // [\"bar\", \"foo\", \"hoge\"]\n\n // SortedList is not Array\n console.assert(!Array.isArray(list));\n\n // SortedList is instanceof Array\n console.assert(list instanceof Array);\n\n // SortedList extends Array\n console.assert(list[2], 8);\n console.assert(list.length, 5);\n console.assert(list.pop(), 13);\n\n // register an already filtered array\n var list = SortedList.create([0,1,2,3,4], { resume: true });\n\n## API Documentation ##\n- SortedList.create(options, arr)\n- sortedList.insertOne(val)\n- sortedList.insert(val1, val2, ...)\n- sortedList.remove(pos)\n- sortedList.unique(createNew)\n- sortedList.bsearch(val)\n- sortedList.key(val)\n- sortedList.keys(val)\n- sortedList.toArray()\n\n\n### SortedList.create(options, arr) ###\ncreate an instance of SortedList.\n\n**options** is option object as follows.\n\n| key | \ntype | \ndescription | \nexample |
|---|
\n\n| unique | \nboolean | \nfilter unique values in insertion. | \ntrue | \n
|---|
\n\n| filter | \nfunction | \n\nregister a filtration function which returns boolean indicating valid value, running before insertion.\nBy default, function(v) { returns true }, that is, no filtration.\n | \nfunction (v) { return !isNaN(Number(v) } | \n
|---|
\n\n| compare | \none of \"string\", \"number\" | \n\ncomparison function comparing two strings or two numbers asc.
\nBy default, \"number\" comparison.\n | \n\"number\" | \n
|---|
\n\n| compare | \nfunction | \n\na custom comparison function which returns one of [1, 0, -1].
\nThe same spec as Array#sort(fn).\nSee Mozilla official site.\n | \nfunction(a,b) { return a.start - b.start } | \n
|---|
\n\n| resume | \nboolean | \n\nif true, sets the array given in the second arguments with no filtration\n | \ntrue | \n
|---|
\n
\n\n**arr** is a initial value. All elements are shallowly copied.\n\nReturns an instance of SortedList.\n\n### sortedList.insertOne(val) ###\nInserts **val** to the list. \n\nReturns inserted position if succeeded, false if failed.\n\n\n### sortedList.insert(val1, val2, ...) ###\nInserts **val1** **val2**, ... to the list.\n\nReturns list of the result of executing insertOne(val).\n\n console.log(SortedList.create().insert(3,1,2,4,5));\n // [0,0,1,3,4]\n\n### sortedList.remove(pos) ###\nRemoves a value in the position **pos**.\n\nReturns this.\n\n### sortedList.unique(createNew) ###\nMake the list unique.\nIf **createNew** is true, returns a new array.\n\nOtherwise, duplicated elements are internally removed, and this method returns this.\n\n### sortedList.bsearch(val) ###\nExecutes binary search with the given **val**.\nReturns the position before insertion.\n\n var list = SortedList.create([1,2,4,6,10]);\n console.log(list.bsearch(4)); // 2\n console.log(list.bsearch(5)); // 2\n console.log(list.bsearch(0)); // -1\n console.log(list.bsearch(12)); // 4\n\n### sortedList.key(val) ###\nIf the given **val** exists, returns the first position.\n\nOtherwise, returns null.\n\n var list = SortedList.create([1,2,4,4,4,6,10]);\n console.log(list.key(10)); // 6\n console.log(list.key(4)); // 2\n console.log(list.key(5)); // null\n console.log(list.key(1)); // 0\n\n### sortedList.keys(val) ###\nIf the given **val** exists, returns an array of all the positions with **val**.\n\nOtherwise, returns null.\n\n var list = SortedList.create([1,2,4,4,4,6,10]);\n console.log(list.keys(10)); // [4]\n console.log(list.keys(4)); // [2, 3, 4]\n console.log(list.keys(5)); // null\n console.log(list.keys(1)); // [0]\n\n\n### sortedList.toArray() ###\nCreates a new array with this list.\n\n## SortedList extends Array ###\nAs SortedList extends Array, we can use every method in Array.\n\n var list = SortedList.create([1,2,4,6,10]);\n\n console.log(list[2]) // 4\n\n list.forEach(function(total, v) {\n // ...\n });\n\n var newArr = list.map(function(total, v) {\n // ...\n });\n\nBe careful of these differences.\n\n Array.isArray(SortedList.create()) // false\n (SortedList.create()) instanceof Array // true\n","readmeFilename":"README.md","_id":"sortedlist@0.3.1","dist":{"shasum":"1536ed80bcfe3688b60dee58156a01bb2bfbf5d2","tarball":"https://registry.npmjs.org/sortedlist/-/sortedlist-0.3.1.tgz","integrity":"sha512-qIuu3MQ16DHV1jjbpzBLuZs7OdUEVbYZZYFsjghtJnpj/BSPjkrkoF20uLbVQeHGaW569J4AudGKL92OtZfEZA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIHXox61B0X+AW1etmFqUgVt4NO7xOEVKb89Ld3sLtIXlAiEA1VKqdel95sl/6EXNIZ2pIWIORkjfWNxwQ7AGarJHDJo="}]},"_npmVersion":"1.1.69","_npmUser":{"name":"shinout","email":"shinout310@gmail.com"},"maintainers":[{"name":"shinout","email":"shinout310@gmail.com"}]}},"maintainers":[{"name":"shinout","email":"shinout310@gmail.com"}],"time":{"modified":"2022-06-26T22:18:14.135Z","created":"2011-10-28T08:10:43.860Z","0.0.1":"2011-10-28T08:10:47.328Z","0.1.0":"2011-11-18T12:53:29.779Z","0.1.1":"2012-02-23T01:22:02.418Z","0.2.0":"2012-02-23T01:53:49.261Z","0.2.1":"2012-02-23T01:56:12.143Z","0.2.2":"2012-02-23T02:01:18.126Z","0.2.3":"2012-02-23T07:48:20.014Z","0.2.4":"2012-02-23T17:14:54.808Z","0.2.5":"2012-02-24T01:31:51.634Z","0.2.6":"2012-02-25T05:28:55.182Z","0.2.7":"2012-02-25T05:44:50.360Z","0.2.8":"2012-04-16T12:20:17.286Z","0.3.0":"2013-06-12T20:43:29.807Z","0.3.1":"2013-06-13T19:09:21.282Z"},"author":{"name":"SHIN Suzuki","email":"shinout310@gmail.com"}}