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

com.browseengine.bobo.util.ResultMerger Maven / Gradle / Ivy

There is a newer version: 3.1.2
Show newest version
/**
 * This software is licensed to you under the Apache License, Version 2.0 (the
 * "Apache License").
 *
 * LinkedIn's contributions are made under the Apache License. If you contribute
 * to the Software, the contributions will be deemed to have been made under the
 * Apache License, unless you expressly indicate otherwise. Please do not make any
 * contributions that would be inconsistent with the Apache License.
 *
 * You may obtain a copy of the Apache License at http://www.apache.org/licenses/LICENSE-2.0
 * Unless required by applicable law or agreed to in writing, this software
 * distributed under the Apache License is distributed on an "AS IS" BASIS, WITHOUT
 * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the Apache
 * License for the specific language governing permissions and limitations for the
 * software governed under the Apache License.
 *
 * © 2012 LinkedIn Corp. All Rights Reserved.  
 */

package com.browseengine.bobo.util;

import java.util.Comparator;
import java.util.Iterator;
import java.util.TreeMap;

public class ResultMerger {
	
	public static  Iterator mergeResults(final Iterator[] results,final Comparator comparator){
		
		return new Iterator(){
			TreeMap> map=new TreeMap>(comparator);
			{
				for (Iterator result : results)
				{
					if (result.hasNext())
					{
						map.put(result.next(),result);
					}
				}
			}
			
			public boolean hasNext() {
				return map.size()>0;
			}

			public T next() {
				T first=map.firstKey();
				Iterator iter=map.remove(first);
				while (iter.hasNext())
				{
					T next=iter.next();
					if (!map.containsKey(next))
					{
						map.put(next,iter);
						break;
					}
				}
				return first;
			}

			public void remove() {
				T first=map.firstKey();
				Iterator iter=map.remove(first);
				while (iter.hasNext())
				{
					T next=iter.next();
					if (!map.containsKey(next))
					{
						map.put(next,iter);
						break;
					}
				}
			}
		};
	}
	
	/*public static  Iterator mergeFacets(Iterator[] facetList,final Comparator comparator){
		return null;
	}
	*/
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy