├── .gitignore ├── LICENSE ├── README.md ├── circle.yml ├── index.js ├── lib └── diff.js ├── package.json └── test └── list-diff.spec.js /.gitignore: -------------------------------------------------------------------------------- 1 | # Logs 2 | logs 3 | *.log 4 | npm-debug.log* 5 | yarn-debug.log* 6 | yarn-error.log* 7 | 8 | # Runtime data 9 | pids 10 | *.pid 11 | *.seed 12 | *.pid.lock 13 | 14 | # Directory for instrumented libs generated by jscoverage/JSCover 15 | lib-cov 16 | 17 | # Coverage directory used by tools like istanbul 18 | coverage 19 | 20 | # nyc test coverage 21 | .nyc_output 22 | 23 | # Grunt intermediate storage (http://gruntjs.com/creating-plugins#storing-task-files) 24 | .grunt 25 | 26 | # Bower dependency directory (https://bower.io/) 27 | bower_components 28 | 29 | # node-waf configuration 30 | .lock-wscript 31 | 32 | # Compiled binary addons (https://nodejs.org/api/addons.html) 33 | build/Release 34 | 35 | # Dependency directories 36 | node_modules/ 37 | jspm_packages/ 38 | 39 | # TypeScript v1 declaration files 40 | typings/ 41 | 42 | # Optional npm cache directory 43 | .npm 44 | 45 | # Optional eslint cache 46 | .eslintcache 47 | 48 | # Optional REPL history 49 | .node_repl_history 50 | 51 | # Output of 'npm pack' 52 | *.tgz 53 | 54 | # Yarn Integrity file 55 | .yarn-integrity 56 | 57 | # dotenv environment variables file 58 | .env 59 | 60 | # next.js build output 61 | .next 62 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | The MIT License (MIT) 2 | 3 | Copyright (c) 2015 Livoras 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 all 13 | 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 THE 21 | SOFTWARE. 22 | 23 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # diff -------------------------------------------------------------------------------- /circle.yml: -------------------------------------------------------------------------------- 1 | machine: 2 | node: 3 | version: 4 4 | dependencies: 5 | pre: 6 | - npm install -g istanbul 7 | - npm install -g standard 8 | test: 9 | override: 10 | - standard && istanbul cover ./node_modules/mocha/bin/_mocha -- -R spec && cat ./coverage/coverage.json | ./node_modules/codecov.io/bin/codecov.io.js -------------------------------------------------------------------------------- /index.js: -------------------------------------------------------------------------------- 1 | module.exports = require('./lib/diff').diff 2 | -------------------------------------------------------------------------------- /lib/diff.js: -------------------------------------------------------------------------------- 1 | /** 2 | * Diff two list in O(N). 3 | * @param {Array} oldList - Original List 4 | * @param {Array} newList - List After certain insertions, removes, or moves 5 | * @return {Object} - {moves: } 6 | * - moves is a list of actions that telling how to remove and insert 7 | */ 8 | function diff (oldList, newList, key) { 9 | var oldMap = makeKeyIndexAndFree(oldList, key) 10 | var newMap = makeKeyIndexAndFree(newList, key) 11 | 12 | var newFree = newMap.free 13 | 14 | var oldKeyIndex = oldMap.keyIndex 15 | var newKeyIndex = newMap.keyIndex 16 | 17 | var moves = [] 18 | 19 | // a simulate list to manipulate 20 | var children = [] 21 | var i = 0 22 | var item 23 | var itemKey 24 | var freeIndex = 0 25 | 26 | // fist pass to check item in old list: if it's removed or not 27 | while (i < oldList.length) { 28 | item = oldList[i] 29 | itemKey = getItemKey(item, key) 30 | if (itemKey) { 31 | if (!newKeyIndex.hasOwnProperty(itemKey)) { 32 | children.push(null) 33 | } else { 34 | var newItemIndex = newKeyIndex[itemKey] 35 | children.push(newList[newItemIndex]) 36 | } 37 | } else { 38 | var freeItem = newFree[freeIndex++] 39 | children.push(freeItem || null) 40 | } 41 | i++ 42 | } 43 | 44 | var simulateList = children.slice(0) 45 | 46 | // remove items no longer exist 47 | i = 0 48 | while (i < simulateList.length) { 49 | if (simulateList[i] === null) { 50 | remove(i) 51 | removeSimulate(i) 52 | } else { 53 | i++ 54 | } 55 | } 56 | 57 | // i is cursor pointing to a item in new list 58 | // j is cursor pointing to a item in simulateList 59 | var j = i = 0 60 | while (i < newList.length) { 61 | item = newList[i] 62 | itemKey = getItemKey(item, key) 63 | 64 | var simulateItem = simulateList[j] 65 | var simulateItemKey = getItemKey(simulateItem, key) 66 | 67 | if (simulateItem) { 68 | if (itemKey === simulateItemKey) { 69 | j++ 70 | } else { 71 | // new item, just inesrt it 72 | if (!oldKeyIndex.hasOwnProperty(itemKey)) { 73 | insert(i, item) 74 | } else { 75 | // if remove current simulateItem make item in right place 76 | // then just remove it 77 | var nextItemKey = getItemKey(simulateList[j + 1], key) 78 | if (nextItemKey === itemKey) { 79 | remove(i) 80 | removeSimulate(j) 81 | j++ // after removing, current j is right, just jump to next one 82 | } else { 83 | // else insert item 84 | insert(i, item) 85 | } 86 | } 87 | } 88 | } else { 89 | insert(i, item) 90 | } 91 | 92 | i++ 93 | } 94 | 95 | //if j is not remove to the end, remove all the rest item 96 | var k = 0; 97 | while (j++