(items)
| 257 | * @returns {string} common suffix |
| 258 | */ |
| 259 | const getCommonSuffix = (items) => { |
| 260 | let [suffix] = items; |
| 261 | |
| 262 | for (let i = 1; i < items.length; i++) { |
| 263 | const item = items[i]; |
| 264 | for ( |
| 265 | let itemIndex = item.length - 1, suffixIndex = suffix.length - 1; |
| 266 | suffixIndex >= 0; |
| 267 | itemIndex--, suffixIndex-- |
| 268 | ) { |
| 269 | if (item[itemIndex] !== suffix[suffixIndex]) { |
| 270 | suffix = suffix.slice(suffixIndex + 1); |
| 271 | break; |
| 272 | } |
| 273 | } |
| 274 | } |
| 275 | |
| 276 | return suffix; |
| 277 | }; |
| 278 | |
| 279 | /** |
| 280 | * @param {Set<string>} itemsSet items set |
no outgoing calls
no test coverage detected
searching dependent graphs…