swt tree 拖动

import java.util.HashMap;
import java.util.Map;

import org.eclipse.swt.SWT;
import org.eclipse.swt.dnd.DND;
import org.eclipse.swt.dnd.DragSource;
import org.eclipse.swt.dnd.DragSourceEvent;
import org.eclipse.swt.dnd.DragSourceListener;
import org.eclipse.swt.dnd.DropTarget;
import org.eclipse.swt.dnd.DropTargetAdapter;
import org.eclipse.swt.dnd.DropTargetEvent;
import org.eclipse.swt.dnd.TextTransfer;
import org.eclipse.swt.dnd.Transfer;
import org.eclipse.swt.graphics.Image;
import org.eclipse.swt.graphics.Point;
import org.eclipse.swt.graphics.Rectangle;
import org.eclipse.swt.layout.FillLayout;
import org.eclipse.swt.widgets.Display;
import org.eclipse.swt.widgets.Shell;
import org.eclipse.swt.widgets.Tree;
import org.eclipse.swt.widgets.TreeItem;

public class TreeDrag {
    private static Map<String, Image>   mapping = new HashMap<String, Image>();

    public static void main(String[] args)
    {
        Display display = new Display();
        final Shell shell = new Shell(display);
        shell.setText("StackOverflow");
        shell.setLayout(new FillLayout());

        Tree tree = new Tree(shell, SWT.NONE);

        Image[] images = new Image[] { display.getSystemImage(SWT.ICON_WARNING),
                display.getSystemImage(SWT.ICON_ERROR), display.getSystemImage(SWT.ICON_INFORMATION),
                display.getSystemImage(SWT.ICON_QUESTION) };

        for (int i = 0; i < 10; i++)
        {
            TreeItem item = new TreeItem(tree, SWT.NONE);
            item.setText("Item " + i);
            item.setImage(images[i % images.length]);
            mapping.put("Item " + i, images[i % images.length]);
        }

        initDnD(display, tree);

        shell.pack();
        shell.open();
        while (!shell.isDisposed())
        {
            if (!display.readAndDispatch())
                display.sleep();
        }
        display.dispose();
    }

    private static void initDnD(final Display display, final Tree tree)
    {
        Transfer[] types = new Transfer[] { TextTransfer.getInstance() };
        int operations = DND.DROP_MOVE | DND.DROP_COPY | DND.DROP_LINK;

        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();
                if (selection.length > 0 && selection[0].getItemCount() == 0)
                {
                    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;
            }
        });

        DropTarget target = new DropTarget(tree, operations);
        target.setTransfer(types);
        target.addDropListener(new DropTargetAdapter()
        {
            public void dragOver(DropTargetEvent event)
            {
                event.feedback = DND.FEEDBACK_SCROLL;
                if (event.item != null)
                {
                    TreeItem item = (TreeItem) event.item;
                    Point pt = display.map(null, tree, event.x, event.y);
                    Rectangle bounds = item.getBounds();
                    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;
                    }
                }
            }

            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 = (TreeItem) event.item;
                    Point pt = display.map(null, tree, event.x, event.y);
                    Rectangle bounds = item.getBounds();

                    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);
                        newItem.setImage(mapping.get(text));
                    }
                    else if (pt.y > bounds.y + 2 * bounds.height / 3)
                    {
                        TreeItem newItem = new TreeItem(tree, SWT.NONE, index + 1);
                        newItem.setText(text);
                        newItem.setImage(mapping.get(text));
                    }
                    else
                    {
                        TreeItem newItem = new TreeItem(item, SWT.NONE);
                        newItem.setText(text);
                        newItem.setImage(mapping.get(text));
                    }
                }
            }
        });
    }
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值