All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.jaeksoft.searchlib.join.JoinListCacheKey Maven / Gradle / Ivy

Go to download

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.

The newest version!
/**   
 * License Agreement for OpenSearchServer
 *
 * Copyright (C) 2012 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.join;

import java.util.Iterator;
import java.util.TreeSet;

import com.jaeksoft.searchlib.query.ParseException;

public class JoinListCacheKey implements Comparable {

	private TreeSet joinCacheKeySet;

	public JoinListCacheKey(JoinList joinList) throws ParseException {
		joinCacheKeySet = new TreeSet();
		for (JoinItem joinItem : joinList)
			joinCacheKeySet.add(joinItem);
	}

	@Override
	public int compareTo(JoinListCacheKey o) {
		int i1 = joinCacheKeySet.size();
		int i2 = o.joinCacheKeySet.size();
		if (i1 < i2)
			return -1;
		else if (i1 > i2)
			return 1;
		Iterator it = o.joinCacheKeySet.iterator();
		for (JoinItem joinItem : joinCacheKeySet) {
			int c = joinItem.compareTo(it.next());
			if (c != 0)
				return c;
		}
		return 0;
	}

}




© 2015 - 2025 Weber Informatics LLC | Privacy Policy