Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 | 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 176x 176x 176x 176x 176x 176x 176x 176x 176x 176x 176x 96x 176x 80x 80x 160x 160x 80x 176x 176x 176x 176x 176x 36x 36x 140x 176x 571x 571x 1329x 1329x 1329x 100x 100x 1329x 571x 40x 176x 11x 11x 11x 11x 11x | /**
* @license Apache-2.0
*
* Copyright (c) 2019 The Stdlib Authors.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
// TODO: move implementation to package: @stdlib/string/longest-common-prefix
'use strict';
// MODULES //
var isArrayLikeObject = require( '@stdlib/assert/is-array-like-object' );
var isString = require( '@stdlib/assert/is-string' ).isPrimitive;
var format = require( '@stdlib/string/format' );
// MAIN //
/**
* Returns the longest common prefix.
*
* ## Notes
*
* - The algorithmic complexity is `O(M*N)` where `M` is the number of strings and `N` is the length of the first string.
*
* @private
* @param {(string|StringArray)} arg - a string or list of strings
* @param {string} [...str] - strings
* @throws {TypeError} must provide strings
* @returns {string} longest common prefix
*
* @example
* var prefix = longestCommonPrefix( 'beep', 'bebop' );
* // returns 'be'
*
* @example
* var prefix = longestCommonPrefix( [ 'beep', 'bebop' ] );
* // returns 'be'
*/
function longestCommonPrefix() {
var prefix;
var list;
var str;
var ch;
var M;
var N;
var i;
var j;
if ( arguments.length === 1 && isArrayLikeObject( arguments[ 0 ] ) ) {
list = arguments[ 0 ];
} else {
list = [];
for ( i = 0; i < arguments.length; i++ ) {
list.push( arguments[ i ] );
}
}
M = list.length;
if ( M === 0 ) {
return '';
}
prefix = list[ 0 ];
if ( !isString( prefix ) ) {
throw new TypeError( format( 'invalid argument. Must provide a string. Value: `%s`.', prefix ) );
}
if ( M === 1 ) {
return prefix;
}
N = prefix.length;
for ( i = 0; i < N; i++ ) {
ch = prefix[ i ];
for ( j = 1; j < M; j++ ) {
str = list[ j ];
if ( !isString( str ) ) {
throw new TypeError( format( 'invalid argument. Must provide a string. Value: `%s`.', str ) );
}
if ( i >= str.length || str[ i ] !== ch ) {
return prefix.substring( 0, i );
}
}
}
return prefix;
}
// EXPORTS //
module.exports = longestCommonPrefix;
|