2012-06-27 11:23:58 +00:00
|
|
|
/*
|
|
|
|
* Copyright (C) 2012 The Android Open Source Project
|
|
|
|
*
|
2013-01-21 12:52:57 +00:00
|
|
|
* 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
|
2012-06-27 11:23:58 +00:00
|
|
|
*
|
2013-01-21 12:52:57 +00:00
|
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
2012-06-27 11:23:58 +00:00
|
|
|
*
|
|
|
|
* Unless required by applicable law or agreed to in writing, software
|
2013-01-21 12:52:57 +00:00
|
|
|
* 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.
|
2012-06-27 11:23:58 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
package com.android.inputmethod.latin;
|
|
|
|
|
|
|
|
import com.android.inputmethod.latin.SuggestedWords.SuggestedWordInfo;
|
|
|
|
|
|
|
|
import java.util.Collection;
|
|
|
|
import java.util.Comparator;
|
|
|
|
import java.util.TreeSet;
|
|
|
|
|
|
|
|
/**
|
|
|
|
* A TreeSet that is bounded in size and throws everything that's smaller than its limit
|
|
|
|
*/
|
2012-09-27 09:16:16 +00:00
|
|
|
public final class BoundedTreeSet extends TreeSet<SuggestedWordInfo> {
|
2012-06-27 11:23:58 +00:00
|
|
|
private final int mCapacity;
|
|
|
|
public BoundedTreeSet(final Comparator<SuggestedWordInfo> comparator, final int capacity) {
|
|
|
|
super(comparator);
|
|
|
|
mCapacity = capacity;
|
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
|
|
|
public boolean add(final SuggestedWordInfo e) {
|
|
|
|
if (size() < mCapacity) return super.add(e);
|
|
|
|
if (comparator().compare(e, last()) > 0) return false;
|
|
|
|
super.add(e);
|
|
|
|
pollLast(); // removes the last element
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
|
|
|
public boolean addAll(final Collection<? extends SuggestedWordInfo> e) {
|
|
|
|
if (null == e) return false;
|
|
|
|
return super.addAll(e);
|
|
|
|
}
|
|
|
|
}
|