/*
 * Licensed to the Apache Software Foundation (ASF) under one
 * or more contributor license agreements.  See the NOTICE file
 * distributed with this work for additional information
 * regarding copyright ownership.  The ASF licenses this file
 * to you 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.
 */

package jline.console.completers;

import jline.console.Completer;

import java.util.Arrays;
import java.util.Collection;
import java.util.List;
import java.util.SortedSet;
import java.util.TreeSet;

/**
 * Completer for a set of strings.
 *
 * @author <a href="mailto:jason@planet57.com">Jason Dillon</a>
 * @since 2.0
 */
public class StringsCompleter
    implements Completer
{
    private final SortedSet<String> strings = new TreeSet<String>();

    public StringsCompleter() {
    }

    public StringsCompleter(final Collection<String> strings) {
        assert strings != null;
        getStrings().addAll(strings);
    }

    public StringsCompleter(final String... strings) {
        this(Arrays.asList(strings));
    }

    public Collection<String> getStrings() {
        return strings;
    }

    public int complete(String buffer, final int cursor, final List<CharSequence> candidates) {
        // buffer could be null
        assert candidates != null;

        if (buffer == null) {
            buffer = "";
        }

        SortedSet<String> matches = strings.tailSet(buffer);

        for (String match : matches) {
            if (!match.startsWith(buffer)) {
                break;
            }

            candidates.add(match);
        }

        if (candidates.size() == 1) {
            candidates.set(0, candidates.get(0) + " ");
        }

        return candidates.isEmpty() ? -1 : 0;
    }
}
@@ -1632,16 +1632,22 @@
 omplete(
+final 
 String b
@@ -1824,40 +1824,73 @@
     
-buffer = %22%22;%0A        %7D%0A%0A
+candidates.addAll(strings);%0A        %7D%0A        else %7B%0A    
         
 Sort
@@ -1889,35 +1889,27 @@
     
-SortedSet%3C
+for (
 String
-%3E
  match
-es =
+ :
  str
@@ -1932,50 +1932,16 @@
 fer)
-;%0A
+) %7B
 %0A    
-    for (String match : matches) %7B%0A
     
@@ -1997,16 +1997,20 @@
         
+    
 break;%0A 
@@ -2012,32 +2012,36 @@
 ak;%0A            
+    
 %7D%0A%0A            c
@@ -2031,32 +2031,36 @@
  %7D%0A%0A            
+    
 candidates.add(m
@@ -2066,16 +2066,30 @@
 match);%0A
+            %7D%0A
         

Optimize slightly