mirror of
https://github.com/optim-enterprises-bv/vault.git
synced 2025-10-30 18:17:55 +00:00
0b12cdcfd1
* Adding explicit MPL license for sub-package. This directory and its subdirectories (packages) contain files licensed with the MPLv2 `LICENSE` file in this directory and are intentionally licensed separately from the BSL `LICENSE` file at the root of this repository. * Adding explicit MPL license for sub-package. This directory and its subdirectories (packages) contain files licensed with the MPLv2 `LICENSE` file in this directory and are intentionally licensed separately from the BSL `LICENSE` file at the root of this repository. * Updating the license from MPL to Business Source License. Going forward, this project will be licensed under the Business Source License v1.1. Please see our blog post for more details at https://hashi.co/bsl-blog, FAQ at www.hashicorp.com/licensing-faq, and details of the license at www.hashicorp.com/bsl. * add missing license headers * Update copyright file headers to BUS-1.1 * Fix test that expected exact offset on hcl file --------- Co-authored-by: hashicorp-copywrite[bot] <110428419+hashicorp-copywrite[bot]@users.noreply.github.com> Co-authored-by: Sarah Thompson <sthompson@hashicorp.com> Co-authored-by: Brian Kassouf <bkassouf@hashicorp.com>
30 lines
940 B
JavaScript
30 lines
940 B
JavaScript
/**
|
|
* Copyright (c) HashiCorp, Inc.
|
|
* 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);
|
|
}
|