blob: 6ebeb484d33d2c5eb3f47ab52918723831ce512c [file] [log] [blame]
/*******************************************************************************
* Copyright (c) 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.debug.internal.ui.viewers.model;
import org.eclipse.debug.internal.ui.viewers.model.provisional.IChildrenUpdate;
import org.eclipse.debug.internal.ui.viewers.model.provisional.IElementContentProvider;
import org.eclipse.jface.viewers.TreePath;
/**
* @since 3.3
*/
class ChildrenUpdate extends ViewerUpdateMonitor implements IChildrenUpdate {
private Object[] fElements;
private int fIndex;
private int fLength;
private IElementContentProvider fContentProvider;
private boolean fStarted = false;
/**
* Constructs a request to update an element
*
* @param node node to update
* @param model model containing the node
*/
public ChildrenUpdate(ModelContentProvider provider, TreePath elementPath, Object element, int index, IElementContentProvider presentation) {
super(provider, elementPath, element);
fIndex = index;
fLength = 1;
fContentProvider = presentation;
}
/*
* (non-Javadoc)
*
* @see org.eclipse.debug.ui.viewers.AsynchronousRequestMonitor#performUpdate()
*/
protected void performUpdate() {
TreeModelContentProvider provider = (TreeModelContentProvider) getContentProvider();
TreePath elementPath = getElementPath();
if (fElements != null) {
InternalTreeModelViewer viewer = (InternalTreeModelViewer) provider.getViewer();
for (int i = 0; i < fElements.length; i++) {
int modelIndex = fIndex + i;
Object element = fElements[i];
if (element != null) {
int viewIndex = provider.modelToViewIndex(elementPath, modelIndex);
if (provider.shouldFilter(elementPath, element)) {
if (provider.addFilteredIndex(elementPath, modelIndex)) {
if (ModelContentProvider.DEBUG_CONTENT_PROVIDER) {
System.out.println("REMOVE(" + getElement() + ", modelIndex: " + modelIndex + " viewIndex: " + viewIndex + ", " + element + ")"); //$NON-NLS-1$ //$NON-NLS-2$ //$NON-NLS-3$ //$NON-NLS-4$ //$NON-NLS-5$
}
viewer.remove(elementPath, viewIndex);
}
} else {
if (provider.isFiltered(elementPath, modelIndex)) {
provider.clearFilteredChild(elementPath, modelIndex);
int insertIndex = provider.modelToViewIndex(elementPath, modelIndex);
if (ModelContentProvider.DEBUG_CONTENT_PROVIDER) {
System.out.println("insert(" + getElement() + ", modelIndex: " + modelIndex + " insertIndex: " + insertIndex + ", " + element + ")"); //$NON-NLS-1$ //$NON-NLS-2$ //$NON-NLS-3$ //$NON-NLS-4$ //$NON-NLS-5$
}
viewer.insert(elementPath, element, insertIndex);
} else {
if (ModelContentProvider.DEBUG_CONTENT_PROVIDER) {
System.out.println("replace(" + getElement() + ", modelIndex: " + modelIndex + " viewIndex: " + viewIndex + ", " + element + ")"); //$NON-NLS-1$ //$NON-NLS-2$ //$NON-NLS-3$ //$NON-NLS-4$ //$NON-NLS-5$
}
viewer.replace(elementPath, viewIndex, element);
}
TreePath childPath = elementPath.createChildPath(element);
provider.updateHasChildren(childPath);
}
}
}
} else {
provider.updateHasChildren(elementPath);
}
}
/* (non-Javadoc)
* @see org.eclipse.debug.internal.ui.viewers.model.provisional.IChildrenUpdate#setChild(java.lang.Object, int)
*/
public void setChild(Object child, int index) {
if (fElements == null) {
fElements = new Object[fLength];
}
fElements[index - fIndex] = child;
}
/**
* Coalesce the request with the given index. Return whether the requests can be
* coalesced.
*
* @param index
* @return whether it worked
*/
public boolean coalesce(int index) {
if (index == fIndex + fLength) {
fLength++;
return true;
}
return false;
}
public void start() {
synchronized (this) {
if (fStarted) {
return;
}
fStarted = true;
}
//System.out.println("\tRequest (" + fParent + "): " + fIndex + " length: " + fLength);
TreeModelContentProvider contentProvider = (TreeModelContentProvider)getContentProvider();
contentProvider.childRequestStarted(this);
if (!isCanceled()) {
fContentProvider.update(new IChildrenUpdate[]{this});
} else {
done();
}
}
/* (non-Javadoc)
* @see org.eclipse.debug.internal.ui.viewers.model.provisional.IChildrenUpdate#getLength()
*/
public int getLength() {
return fLength;
}
/* (non-Javadoc)
* @see org.eclipse.debug.internal.ui.viewers.model.provisional.IChildrenUpdate#getOffset()
*/
public int getOffset() {
return fIndex;
}
/* (non-Javadoc)
* @see org.eclipse.debug.internal.ui.viewers.model.ViewerUpdateMonitor#isContained(org.eclipse.jface.viewers.TreePath)
*/
boolean isContained(TreePath path) {
return getElementPath().startsWith(path, null);
}
public String toString() {
StringBuffer buf = new StringBuffer();
buf.append("IChildrenUpdate: "); //$NON-NLS-1$
buf.append(getElement());
buf.append(" {"); //$NON-NLS-1$
buf.append(getOffset());
buf.append(',');
buf.append(getLength());
buf.append("}"); //$NON-NLS-1$
return buf.toString();
}
}