blob: bf58f3a7ecfc1bec9e1d34adf64e24b6151ed06d (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
|
/*
* Copyright (c) 2007, 2011, 2012, 2015, 2016 Eike Stepper (Berlin, Germany) 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:
* Eike Stepper - initial API and implementation
*/
package org.eclipse.net4j.util.ui.views;
import org.eclipse.net4j.util.container.IContainer;
import org.eclipse.jface.viewers.ITreePathContentProvider;
import org.eclipse.jface.viewers.TreePath;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
/**
* @author Eike Stepper
*/
@Deprecated
public class ContainerPathItemProvider<CONTAINER extends IContainer<Object>> extends ContainerItemProvider<CONTAINER> implements ITreePathContentProvider
{
private Map<Object, List<TreePath>> parents = new HashMap<Object, List<TreePath>>();
public ContainerPathItemProvider()
{
}
public ContainerPathItemProvider(IElementFilter rootElementFilter)
{
super(rootElementFilter);
}
public boolean hasChildren(TreePath path)
{
return hasChildren((Object)path);
}
public Object[] getChildren(TreePath path)
{
return getChildren((Object)path);
}
public TreePath[] getParents(Object element)
{
List<TreePath> paths = parents.get(element);
if (paths != null)
{
return paths.toArray(new TreePath[paths.size()]);
}
return null;
}
@Override
protected void addNode(Object element, Node node)
{
super.addNode(node.getTreePath(), node);
TreePath path = getParentPath(node);
List<TreePath> paths = parents.get(element);
if (paths == null)
{
paths = new ArrayList<TreePath>();
parents.put(element, paths);
}
paths.add(path);
}
@Override
protected Node removeNode(Object element)
{
Node node = super.removeNode(element);
TreePath path = getParentPath(node);
List<TreePath> paths = parents.get(element);
if (paths != null)
{
paths.remove(path);
}
return node;
}
@Override
protected void disconnectInput(CONTAINER input)
{
super.disconnectInput(input);
}
protected TreePath getParentPath(Node node)
{
Node parent = node.getParent();
return parent == null ? TreePath.EMPTY : parent.getTreePath();
}
}
|