1 | /*
|
2 | Terminal Kit
|
3 |
|
4 | Copyright (c) 2009 - 2020 Cédric Ronvel
|
5 |
|
6 | The MIT License (MIT)
|
7 |
|
8 | Permission is hereby granted, free of charge, to any person obtaining a copy
|
9 | of this software and associated documentation files (the "Software"), to deal
|
10 | in the Software without restriction, including without limitation the rights
|
11 | to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
12 | copies of the Software, and to permit persons to whom the Software is
|
13 | furnished to do so, subject to the following conditions:
|
14 |
|
15 | The above copyright notice and this permission notice shall be included in all
|
16 | copies or substantial portions of the Software.
|
17 |
|
18 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
19 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
20 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
21 | AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
22 | LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
23 | OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
24 | SOFTWARE.
|
25 | */
|
26 |
|
27 | ;
|
28 |
|
29 |
|
30 |
|
31 | /*
|
32 | Ideally, this should be done using a graph algorithm, but we will just brute-force it for instance...
|
33 | */
|
34 |
|
35 | module.exports = function autoComplete( array , startString , returnAlternatives , prefix , postfix ) {
|
36 | var i , j , exitLoop , candidate = [] , completed = startString , hasCompleted = false ;
|
37 |
|
38 | if ( ! prefix ) { prefix = '' ; }
|
39 | if ( ! postfix ) { postfix = '' ; }
|
40 |
|
41 | for ( i = 0 ; i < array.length ; i ++ ) {
|
42 | if ( array[ i ].slice( 0 , startString.length ) === startString ) { candidate.push( array[ i ] ) ; }
|
43 | }
|
44 |
|
45 | if ( ! candidate.length ) { return prefix + completed + postfix ; }
|
46 |
|
47 | if ( candidate.length === 1 ) { return prefix + candidate[ 0 ] + postfix ; }
|
48 |
|
49 |
|
50 | // Multiple candidate, complete only the part they have in common
|
51 |
|
52 | j = startString.length ;
|
53 |
|
54 | exitLoop = false ;
|
55 |
|
56 | for ( j = startString.length ; j < candidate[ 0 ].length ; j ++ ) {
|
57 | for ( i = 1 ; i < candidate.length ; i ++ ) {
|
58 | if ( candidate[ i ][ j ] !== candidate[ 0 ][ j ] ) { exitLoop = true ; break ; }
|
59 | }
|
60 |
|
61 | if ( exitLoop ) { break ; }
|
62 |
|
63 | completed += candidate[ 0 ][ j ] ;
|
64 | hasCompleted = true ;
|
65 | }
|
66 |
|
67 | if ( returnAlternatives && ! hasCompleted ) {
|
68 | candidate.prefix = prefix ;
|
69 | candidate.postfix = postfix ;
|
70 | return candidate ;
|
71 | }
|
72 |
|
73 | return prefix + completed + postfix ;
|
74 | } ;
|
75 |
|