blob: 667052cf9bafc1369cab404625f7ba76bc7714b1 [file] [log] [blame]
/*******************************************************************************
* Copyright (c) 2005, 2006 IBM Corporation and others.
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Eclipse Public License v1.0
* which accompanies this distribution, and is available at
* http://www.eclipse.org/legal/epl-v10.html
*
* Contributors:
* IBM Corporation - initial API and implementation
*******************************************************************************/
package org.eclipse.ltk.internal.core.refactoring.history;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashSet;
import java.util.LinkedHashSet;
import java.util.Set;
import org.eclipse.core.runtime.Assert;
import org.eclipse.ltk.core.refactoring.RefactoringDescriptorProxy;
import org.eclipse.ltk.core.refactoring.history.RefactoringHistory;
/**
* Default implementation of a refactoring history.
*
* @since 3.2
*/
public final class RefactoringHistoryImplementation extends RefactoringHistory {
/** The refactoring descriptor proxies */
private final RefactoringDescriptorProxy[] fDescriptorProxies;
/** Is the refactoring history already sorted? */
private boolean fSorted= false;
/**
* Creates a new refactoring history implementation.
*
* @param proxies
* the refactoring descriptor proxies
*/
public RefactoringHistoryImplementation(final RefactoringDescriptorProxy[] proxies) {
Assert.isNotNull(proxies);
fDescriptorProxies= new RefactoringDescriptorProxy[proxies.length];
System.arraycopy(proxies, 0, fDescriptorProxies, 0, proxies.length);
}
/**
* Returns the descriptor proxies, in no particular order.
*
* @return the descriptor proxies
*/
RefactoringDescriptorProxy[] getDescriptorProxies() {
return fDescriptorProxies;
}
/**
* {@inheritDoc}
*/
public RefactoringDescriptorProxy[] getDescriptors() {
if (!fSorted && fDescriptorProxies.length > 1) {
Arrays.sort(fDescriptorProxies, new Comparator() {
public final int compare(final Object first, final Object second) {
final RefactoringDescriptorProxy predecessor= (RefactoringDescriptorProxy) first;
final RefactoringDescriptorProxy successor= (RefactoringDescriptorProxy) second;
final long delta= successor.getTimeStamp() - predecessor.getTimeStamp();
if (delta > 0)
return 1;
else if (delta < 0)
return -1;
return 0;
}
});
}
fSorted= true;
final RefactoringDescriptorProxy[] proxies= new RefactoringDescriptorProxy[fDescriptorProxies.length];
System.arraycopy(fDescriptorProxies, 0, proxies, 0, fDescriptorProxies.length);
return proxies;
}
/**
* {@inheritDoc}
*/
public boolean isEmpty() {
return fDescriptorProxies.length == 0;
}
/**
* {@inheritDoc}
*/
public RefactoringHistory removeAll(final RefactoringHistory history) {
final Set existing= new LinkedHashSet(Arrays.asList(fDescriptorProxies));
final Set other= new HashSet(Arrays.asList(history.getDescriptors()));
existing.removeAll(other);
final RefactoringDescriptorProxy[] proxies= new RefactoringDescriptorProxy[existing.size()];
existing.toArray(proxies);
return new RefactoringHistoryImplementation(proxies);
}
}