读书人

swt中给tree平添拖拽功能的2点改进

发布时间: 2013-09-12 22:07:00 作者: rapoo

swt中给tree添加拖拽功能的2点改进

在博文http://www.blogjava.net/hengheng123456789/articles/79661.html?opt=admin中谈到了给swt中的树添加拖拽功能的方法,但是在实际使用该方法过程中发现2个问题,

一、只能拖拽叶节点

二、拖拽的节点放在自身的位置上是会导致节点丢失。

针对这2个问题,笔者做了改进。代码如下:

private void createActions() {
//+++++++++++++++++++给本体树添加拖拽功能+++++++++++++++++
Transfer[] types = new Transfer[] {TextTransfer.getInstance()};
int operations = DND.DROP_MOVE | DND.DROP_COPY | DND.DROP_LINK;

//建立拖拽 源————树tree对象
final DragSource source = new DragSource (tree, operations);
source.setTransfer(types);
final TreeItem[] dragSourceItem = new TreeItem[1];
source.addDragListener (new DragSourceListener () {
public void dragStart(DragSourceEvent event) {
TreeItem[] selection = tree.getSelection(); // 获取所选tree的节点
// if (selection.length > 0 && selection[0].getItemCount() == 0) //判断所选节点是否存在并且为末端节点
if (selection.length > 0&&!("Thing".equals(selection[0].getText())))
{
event.doit = true; //启动拖拽功能
dragSourceItem[0] = selection[0]; //保存拖拽节点信息
} else {
event.doit = false;
}
};
public void dragSetData (DragSourceEvent event) {
event.data = dragSourceItem[0].getText(); //保存拖拽节点信息到事件数据中
}
public void dragFinished(DragSourceEvent event) {
if (event.detail == DND.DROP_MOVE)
dragSourceItem[0].dispose();
dragSourceItem[0] = null;
}
});

//建立拖拽 目的————树tree对象
DropTarget target = new DropTarget(tree, operations);
target.setTransfer(types);
target.addDropListener (new DropTargetAdapter() {
//处理拖拽到目的上空时的方法
public void dragOver(DropTargetEvent event) {
event.feedback = DND.FEEDBACK_EXPAND | DND.FEEDBACK_SCROLL; //响应拖拽动作,FEEDBACK_EXPAND表示拖拽到可以展开的节点时展开相应节点。
if (event.item != null) {
TreeItem item = (TreeItem)event.item;
//处理拖拽动作响应,根据拖拽的位置不同产生不同的响应
Point pt = Display.getCurrent().map(null, tree, event.x, event.y); //获取拖拽当前位置点
Rectangle bounds = item.getBounds(); //获取目的节点的边框

//根据拖拽当前位置点与目的节点的边框位置设置响应,如显示为FEEDBACK_INSERT_BEFORE、FEEDBACK_INSERT_AFTER
if (pt.y < bounds.y + bounds.height/3) {
event.feedback |= DND.FEEDBACK_INSERT_BEFORE;
} else if (pt.y > bounds.y + 2*bounds.height/3) {
event.feedback |= DND.FEEDBACK_INSERT_AFTER;
} else {
event.feedback |= DND.FEEDBACK_SELECT;
}
}
}
//处理放下时的方法
public void drop(DropTargetEvent event) {
if ((event.data == null)) {
event.detail = DND.DROP_NONE;
return;
}
String text = (String)event.data;
//如果放下的位置没有节点,则新建立一个节点,以根节点为父节点
if (event.item == null)
{
// TreeItem item = new TreeItem(tree.getItem(0), SWT.NONE);
// item.setText(dragSourceItem[0].getText());
//更改为可以拖拽含有子节点的节点
addSubNodes(tree.getItem(0),dragSourceItem[0]);


}
//如果放下的位置有节点
else
{
TreeItem item = (TreeItem)event.item;
Point pt = Display.getCurrent().map(null, tree, event.x, event.y);
Rectangle bounds = item.getBounds();
TreeItem parent = item.getParentItem();

if(dragSourceItem[0].getText().equals(item.getText())){
event.detail = DND.DROP_NONE;
return;
}

if (parent != null) {
TreeItem[] items = parent.getItems();
int index = 0;
for (int i = 0; i < items.length; i++) {
if (items[i] == item) {
index = i;
break;
}
}
if (pt.y < bounds.y + bounds.height/3) {
//以当前节点的父节点为父建立一个子节点,并且插入到当前节点前
//TreeItem newItem = new TreeItem(parent, SWT.NONE, index);
// newItem.setText(text);
addSubNodes(parent,dragSourceItem[0],index);
} else if (pt.y > bounds.y + 2*bounds.height/3) {
//以当前节点的父节点为父建立一个子节点,并且插入到当前节点前
// TreeItem newItem = new TreeItem(parent, SWT.NONE, index+1);
// newItem.setText(text);
addSubNodes(parent,dragSourceItem[0],index+1);
} else {
//以当前为父节点建立一个子节点
//TreeItem newItem = new TreeItem(item, SWT.NONE);
//newItem.setText(text);
addSubNodes(item,dragSourceItem[0]);
}

} else {
TreeItem[] items = tree.getItems();
int index = 0;
for (int i = 0; i < items.length; i++) {
if (items[i] == item) {
index = i;
break;
}
}
//---------------------------------------作用
if (pt.y < bounds.y + bounds.height/3) {
TreeItem newItem = new TreeItem(tree, SWT.NONE, index);
newItem.setText(text);
} else if (pt.y > bounds.y + 2*bounds.height/3) {
TreeItem newItem = new TreeItem(tree, SWT.NONE, index+1);
newItem.setText(text);
} else {
//TreeItem newItem = new TreeItem(item, SWT.NONE);
//newItem.setText(text);

addSubNodes(item,dragSourceItem[0]);
}
//-------------------------------------------
}


}
}
});

//-----------------------------------------------------
}


public void addSubNodes(TreeItem parent,TreeItem nodes){
if(nodes!=null){

TreeItem it=new TreeItem(parent,SWT.None);
it.setText(nodes.getText());

for(TreeItem myitem:nodes.getItems()){
addSubNodes(it,myitem);
}

}

}

public void addSubNodes(TreeItem parent,TreeItem nodes,int index){
if(nodes!=null){
TreeItem it=new TreeItem(parent,SWT.None,index);
it.setText(nodes.getText());

for(TreeItem myitem:nodes.getItems()){
addSubNodes(it,myitem);
}

}

}

读书人网 >编程

热点推荐