| 1 | |
|
| 2 | |
|
| 3 | |
|
| 4 | |
|
| 5 | |
|
| 6 | |
|
| 7 | |
|
| 8 | |
|
| 9 | |
|
| 10 | |
|
| 11 | |
|
| 12 | |
|
| 13 | |
|
| 14 | |
|
| 15 | |
|
| 16 | |
|
| 17 | |
|
| 18 | |
|
| 19 | |
|
| 20 | |
|
| 21 | |
|
| 22 | |
|
| 23 | |
|
| 24 | |
package org.dishevelled.observable.graph.impl; |
| 25 | |
|
| 26 | |
import org.dishevelled.graph.Edge; |
| 27 | |
import org.dishevelled.graph.Graph; |
| 28 | |
import org.dishevelled.graph.Node; |
| 29 | |
|
| 30 | |
import org.dishevelled.observable.graph.AbstractObservableGraph; |
| 31 | |
|
| 32 | |
import org.dishevelled.observable.graph.event.GraphChangeVetoException; |
| 33 | |
|
| 34 | |
|
| 35 | |
|
| 36 | |
|
| 37 | |
|
| 38 | |
|
| 39 | |
|
| 40 | |
|
| 41 | |
|
| 42 | |
|
| 43 | |
|
| 44 | |
public final class ObservableGraphImpl<N, E> |
| 45 | |
extends AbstractObservableGraph<N, E> |
| 46 | |
{ |
| 47 | |
|
| 48 | |
|
| 49 | |
|
| 50 | |
|
| 51 | |
|
| 52 | |
|
| 53 | |
public ObservableGraphImpl(final Graph<N, E> graph) |
| 54 | |
{ |
| 55 | 134 | super(graph); |
| 56 | 133 | } |
| 57 | |
|
| 58 | |
|
| 59 | |
|
| 60 | |
protected boolean preClear() |
| 61 | |
{ |
| 62 | |
try |
| 63 | |
{ |
| 64 | 4 | fireWillClear(); |
| 65 | 2 | return true; |
| 66 | |
} |
| 67 | 2 | catch (GraphChangeVetoException e) |
| 68 | |
{ |
| 69 | 2 | return false; |
| 70 | |
} |
| 71 | |
} |
| 72 | |
|
| 73 | |
|
| 74 | |
protected void postClear() |
| 75 | |
{ |
| 76 | 1 | fireCleared(); |
| 77 | 1 | } |
| 78 | |
|
| 79 | |
|
| 80 | |
protected boolean preCreateNode(final N value) |
| 81 | |
{ |
| 82 | |
try |
| 83 | |
{ |
| 84 | 23 | fireWillCreateNode(value); |
| 85 | 17 | return true; |
| 86 | |
} |
| 87 | 6 | catch (GraphChangeVetoException e) |
| 88 | |
{ |
| 89 | 6 | return false; |
| 90 | |
} |
| 91 | |
} |
| 92 | |
|
| 93 | |
|
| 94 | |
protected void postCreateNode(final N value, final Node<N, E> node) |
| 95 | |
{ |
| 96 | 15 | fireNodeCreated(node); |
| 97 | 15 | } |
| 98 | |
|
| 99 | |
|
| 100 | |
protected boolean preRemove(final Node<N, E> node) |
| 101 | |
{ |
| 102 | |
try |
| 103 | |
{ |
| 104 | 4 | fireWillRemoveNode(node); |
| 105 | 2 | return true; |
| 106 | |
} |
| 107 | 2 | catch (GraphChangeVetoException e) |
| 108 | |
{ |
| 109 | 2 | return false; |
| 110 | |
} |
| 111 | |
} |
| 112 | |
|
| 113 | |
|
| 114 | |
protected void postRemove(final Node<N, E> node) |
| 115 | |
{ |
| 116 | 1 | fireNodeRemoved(node); |
| 117 | 1 | } |
| 118 | |
|
| 119 | |
|
| 120 | |
protected boolean preCreateEdge(final Node<N, E> source, |
| 121 | |
final Node<N, E> target, |
| 122 | |
final E value) |
| 123 | |
{ |
| 124 | |
try |
| 125 | |
{ |
| 126 | 5 | fireWillCreateEdge(source, target, value); |
| 127 | 3 | return true; |
| 128 | |
} |
| 129 | 2 | catch (GraphChangeVetoException e) |
| 130 | |
{ |
| 131 | 2 | return false; |
| 132 | |
} |
| 133 | |
} |
| 134 | |
|
| 135 | |
|
| 136 | |
protected void postCreateEdge(final Node<N, E> source, |
| 137 | |
final Node<N, E> target, |
| 138 | |
final E value, |
| 139 | |
final Edge<N, E> edge) |
| 140 | |
{ |
| 141 | 3 | fireEdgeCreated(edge); |
| 142 | 3 | } |
| 143 | |
|
| 144 | |
|
| 145 | |
protected boolean preRemove(final Edge<N, E> edge) |
| 146 | |
{ |
| 147 | |
try |
| 148 | |
{ |
| 149 | 4 | fireWillRemoveEdge(edge); |
| 150 | 2 | return true; |
| 151 | |
} |
| 152 | 2 | catch (GraphChangeVetoException e) |
| 153 | |
{ |
| 154 | 2 | return false; |
| 155 | |
} |
| 156 | |
} |
| 157 | |
|
| 158 | |
|
| 159 | |
protected void postRemove(final Edge<N, E> edge) |
| 160 | |
{ |
| 161 | 1 | fireEdgeRemoved(edge); |
| 162 | 1 | } |
| 163 | |
} |