KO
|
EN
gitlite — search
Search
#javascript
#python
#hacktoberfest
#react
#ai
#typescript
#llm
#go
#golang
#android
#machine-learning
#rust
#deep-learning
#linux
list-diff
★ 8
Open GitHub ↗
diff
Download README (.md)
Explore Similar Repositories
awesome-BTC-embedded
:
A list of projects using Bitcoin on embedded devices.
spring-cloud-example
:
Example for Spring cloud (netflix OSS, spring cloud)
sign_xcorr
:
audio signal cross correlation using FFT
betas
:
UW Data 515 Spring 2019 - Final Project
akaza
:
A cool Whitespace language implementation in Ruby.
// repository documentation
Was this content helpful?
★ 0
(0 ratings)
Select Rating:
★
★
★
★
★
Submit Feedback
Recent Feedback
×
Download README
Do you want to download the
README.md
file for
list-diff
?
Download (.md)
list-diff ================= [](https://circleci.com/gh/livoras/list-diff) [](https://codecov.io/github/livoras/list-diff?branch=master) [](https://badge.fury.io/js/list-diff2) [](https://david-dm.org/livoras/list-diff) [](https://github.com/feross/standard) ## Introduction Diff two lists in time O(n). I The algorithm finding the minimal amount of moves is [Levenshtein distance](https://en.wikipedia.org/wiki/Levenshtein_distance) which is O(n*m). This algorithm is not the best but is enougth for front-end DOM list manipulation. This project is mostly influenced by [virtual-dom](https://github.com/Matt-Esch/virtual-dom/blob/master/vtree/diff.js) algorithm. ## Install $ npm install list-diff2 --save ## Usage ```javascript var diff = require("list-diff2") var oldList = [{id: "a"}, {id: "b"}, {id: "c"}, {id: "d"}, {id: "e"}] var newList = [{id: "c"}, {id: "a"}, {id: "b"}, {id: "e"}, {id: "f"}] var moves = diff(oldList, newList, "id") // `moves` is a sequence of actions (remove or insert): // type 0 is removing, type 1 is inserting // moves: [ // {index: 3, type: 0}, // {index: 0, type: 1, item: {id: "c"}}, // {index: 3, type: 0}, // {index: 4, type: 1, item: {id: "f"}} // ] moves.forEach(function(move) { if (move.type === 0) { oldList.splice(move.index, 1) // type 0 is removing } else { oldList.splice(move.index, 0, move.item) // type 1 is inserting } }) // now `oldList` is equal to `newList` // [{id: "c"}, {id: "a"}, {id: "b"}, {id: "e"}, {id: "f"}] console.log(oldList) ``` ## License The MIT License (MIT) Copyright (c) 2015 Livoras Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
