
com.jaeksoft.searchlib.util.TopSet Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of opensearchserver Show documentation
Show all versions of opensearchserver Show documentation
OpenSearchServer is a powerful, enterprise-class, search engine program. Using the web user interface,
the crawlers (web, file, database, ...) and the REST/RESTFul API you will be able to integrate quickly and
easily advanced full-text search capabilities in your application. OpenSearchServer runs on Windows and
Linux/Unix/BSD.
/**
* License Agreement for OpenSearchServer
*
* Copyright (C) 2011 Emmanuel Keller / Jaeksoft
*
* http://www.open-search-server.com
*
* This file is part of OpenSearchServer.
*
* OpenSearchServer is free software: you can redistribute it and/or
* modify it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* OpenSearchServer is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with OpenSearchServer.
* If not, see .
**/
package com.jaeksoft.searchlib.util;
import java.util.Comparator;
import java.util.TreeSet;
public class TopSet {
private final TreeSet treeSet;
private int max;
/**
* Build a sorted set from an array. The size of the Set is limited by the
* max parameter.
*
* @param array
* @param comparator
* @param max
*/
public TopSet(T[] array, Comparator comparator, int max) {
this.max = max;
this.treeSet = new TreeSet(comparator);
generateTreeMap(array);
}
private void generateTreeMap(T[] array) {
int i = 0;
for (T item : array) {
treeSet.add(item);
if (i++ > max)
treeSet.pollFirst();
}
}
public TreeSet getTreeMap() {
return treeSet;
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy