mirror of
https://github.com/hashicorp/vault.git
synced 2026-04-23 23:27:10 -04:00
0c6c13dd38
* license: update headers to IBM Corp. * `make proto` * update offset because source file changed Signed-off-by: Ryan Cragun <me@ryan.ec> Co-authored-by: Ryan Cragun <me@ryan.ec>
29 lines
941 B
JavaScript
29 lines
941 B
JavaScript
/**
|
|
* Copyright IBM Corp. 2016, 2025
|
|
* SPDX-License-Identifier: BUSL-1.1
|
|
*/
|
|
|
|
export default function (arr = [], attribute = 'id') {
|
|
if (!arr.length) {
|
|
return '';
|
|
}
|
|
// this assumes an already sorted array
|
|
// if the array is sorted, we want to compare the first and last
|
|
// item in the array - if they share a prefix, all of the items do
|
|
const firstString = arr[0][attribute];
|
|
const lastString = arr[arr.length - 1][attribute];
|
|
|
|
// the longest the shared prefix could be is the length of the match
|
|
const targetLength = firstString.length;
|
|
let prefixLength = 0;
|
|
// walk the two strings, and if they match at the current length,
|
|
// increment the prefixLength and try again
|
|
while (
|
|
prefixLength < targetLength &&
|
|
firstString.charAt(prefixLength) === lastString.charAt(prefixLength)
|
|
) {
|
|
prefixLength++;
|
|
}
|
|
// slice the prefix from the first item
|
|
return firstString.substring(0, prefixLength);
|
|
}
|