61 lines
2.4 KiB
JavaScript
61 lines
2.4 KiB
JavaScript
/*
|
|
Copyright 2020 DigitalOcean
|
|
|
|
This code is licensed under the MIT License.
|
|
You may obtain a copy of the License at
|
|
https://github.com/digitalocean/nginxconfig.io/blob/master/LICENSE or https://mit-license.org/
|
|
|
|
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.
|
|
*/
|
|
|
|
import { compareTwoStrings } from 'string-similarity';
|
|
|
|
export default (newConf, oldConf) => {
|
|
const newNames = Object.keys(newConf);
|
|
const oldNames = Object.keys(oldConf);
|
|
const removed = oldNames.filter(name => !newNames.includes(name));
|
|
const added = newNames.filter(name => !oldNames.includes(name));
|
|
|
|
// For each newly added file, compare it to all the old files
|
|
const addedSimilarity = {};
|
|
for (const newName of added) {
|
|
addedSimilarity[newName] = { old: '', similarity: 0 };
|
|
|
|
for (const oldName of removed) {
|
|
const similarity = compareTwoStrings(newConf[newName], oldConf[oldName]);
|
|
|
|
// Only care about > 50% similarity
|
|
if (similarity <= .5) continue;
|
|
|
|
// Store the most similar
|
|
if (similarity > addedSimilarity[newName].similarity)
|
|
addedSimilarity[newName] = { old: oldName, similarity };
|
|
}
|
|
}
|
|
|
|
// Create a rename map
|
|
return newNames.reduce((prev, current) => {
|
|
if (current in addedSimilarity && addedSimilarity[current].similarity)
|
|
prev[current] = addedSimilarity[current].old;
|
|
else
|
|
prev[current] = current;
|
|
return prev;
|
|
}, {});
|
|
};
|