1 package be
.nikiroo
.utils
;
3 import java
.util
.ArrayList
;
4 import java
.util
.EventListener
;
5 import java
.util
.HashMap
;
8 import java
.util
.Map
.Entry
;
11 * Progress reporting system, possibly nested.
13 * A {@link Progress} can have a name, and that name will be reported through
14 * the event system (it will report the first non-null name in the stack from
15 * the {@link Progress} from which the event originated to the parent the event
18 * The {@link Progress} also has a table of keys/values shared amongst all the
19 * hierarchy (note that when adding a {@link Progress} to others, its values
20 * will be prioritized if some with the same keys were already present in the
25 public class Progress
{
27 * This event listener is designed to report progress events from
32 public interface ProgressListener
extends EventListener
{
34 * A progression event.
37 * the {@link Progress} object that generated it, not
38 * necessarily the same as the one where the listener was
39 * attached (it could be a child {@link Progress} of this
42 * the first non-null name of the {@link Progress} step that
43 * generated this event
45 public void progress(Progress progress
, String name
);
48 private Map
<Object
, Object
> map
= new HashMap
<Object
, Object
>();
49 private Progress parent
= null;
50 private Object lock
= new Object();
52 private Map
<Progress
, Double
> children
;
53 private List
<ProgressListener
> listeners
;
56 private double relativeLocalProgress
;
57 private double relativeProgress
; // children included
60 * Create a new default unnamed {@link Progress}, from 0 to 100.
67 * Create a new default {@link Progress}, from 0 to 100.
70 * the name of this {@link Progress} step
72 public Progress(String name
) {
77 * Create a new unnamed {@link Progress}, from min to max.
80 * the minimum progress value (and starting value) -- must be
83 * the maximum progress value
85 public Progress(int min
, int max
) {
90 * Create a new {@link Progress}, from min to max.
93 * the name of this {@link Progress} step
95 * the minimum progress value (and starting value) -- must be
98 * the maximum progress value
100 public Progress(String name
, int min
, int max
) {
102 this.children
= new HashMap
<Progress
, Double
>();
103 this.listeners
= new ArrayList
<Progress
.ProgressListener
>();
109 * The name of this {@link Progress} step.
113 public String
getName() {
118 * The name of this {@link Progress} step.
123 public void setName(String name
) {
129 * The minimum progress value.
133 public int getMin() {
138 * The minimum progress value.
144 * @throws RuntimeException
145 * if min < 0 or if min > max
147 public void setMin(int min
) {
149 throw new RuntimeException("negative values not supported");
152 synchronized (lock
) {
154 throw new RuntimeException(
155 "The minimum progress value must be <= the maximum progress value");
163 * The maximum progress value.
167 public int getMax() {
172 * The maximum progress value (must be >= the minimum progress value).
178 * @throws RuntimeException
181 public void setMax(int max
) {
182 synchronized (lock
) {
185 "The maximum progress value must be >= the minimum progress value");
193 * Set both the minimum and maximum progress values.
200 * @throws RuntimeException
201 * if min < 0 or if min > max
203 public void setMinMax(int min
, int max
) {
205 throw new RuntimeException("negative values not supported");
209 throw new RuntimeException(
210 "The minimum progress value must be <= the maximum progress value");
213 synchronized (lock
) {
220 * Get the total progress value (including the optional children
221 * {@link Progress}) on a {@link Progress#getMin()} to
222 * {@link Progress#getMax()} scale.
224 * @return the progress the value
226 public int getProgress() {
227 return (int) Math
.round(relativeProgress
* (max
- min
));
231 * Set the local progress value (not including the optional children
232 * {@link Progress}), on a {@link Progress#getMin()} to
233 * {@link Progress#getMax()} scale.
236 * the progress to set
238 public void setProgress(int progress
) {
239 synchronized (lock
) {
240 double childrenProgress
= relativeProgress
- relativeLocalProgress
;
242 relativeLocalProgress
= ((double) progress
) / (max
- min
);
244 setRelativeProgress(this, name
, relativeLocalProgress
250 * Get the total progress value (including the optional children
251 * {@link Progress}) on a 0.0 to 1.0 scale.
253 * @return the progress
255 public double getRelativeProgress() {
256 return relativeProgress
;
260 * Set the total progress value (including the optional children
261 * {@link Progress}), on a 0 to 1 scale.
264 * the {@link Progress} to report as the progression emitter
266 * the current name (if it is NULL, the first non-null name in
267 * the hierarchy will overwrite it) of the {@link Progress} who
268 * emitted this change
269 * @param relativeProgress
270 * the progress to set
272 private void setRelativeProgress(Progress pg
, String name
,
273 double relativeProgress
) {
274 synchronized (lock
) {
275 relativeProgress
= Math
.max(0, relativeProgress
);
276 relativeProgress
= Math
.min(1, relativeProgress
);
277 this.relativeProgress
= relativeProgress
;
284 * Get the total progress value (including the optional children
285 * {@link Progress}) on a 0 to 1 scale.
287 * @return the progress the value
289 private int getLocalProgress() {
290 return (int) Math
.round(relativeLocalProgress
* (max
- min
));
294 * Add some value to the current progression of this {@link Progress}.
299 public void add(int step
) {
300 synchronized (lock
) {
301 setProgress(getLocalProgress() + step
);
306 * Check if the action corresponding to this {@link Progress} is done (i.e.,
307 * if its progress value == its max value).
309 * @return TRUE if it is
311 public boolean isDone() {
312 return getProgress() == max
;
316 * Mark the {@link Progress} as done by setting its value to max.
319 synchronized (lock
) {
320 double childrenProgress
= relativeProgress
- relativeLocalProgress
;
321 relativeLocalProgress
= 1 - childrenProgress
;
322 setRelativeProgress(this, name
, 1d
);
327 * Return the list of direct children of this {@link Progress}.
329 * @return the children (Who will think of the children??)
331 public List
<Progress
> getChildren() {
332 synchronized (lock
) {
333 return new ArrayList
<Progress
>(children
.keySet());
338 * Notify the listeners that this {@link Progress} changed value.
341 * the emmiter, that is, the (sub-){link Progress} that just
342 * reported some change, not always the same as <tt>this</tt>
344 * the current name (if it is NULL, the first non-null name in
345 * the hierarchy will overwrite it) of the {@link Progress} who
346 * emitted this change
348 private void changed(Progress pg
, String name
) {
357 synchronized (lock
) {
358 for (ProgressListener l
: listeners
) {
359 l
.progress(pg
, name
);
365 * Add a {@link ProgressListener} that will trigger on progress changes.
367 * Note: the {@link Progress} that will be reported will be the active
368 * progress, not necessarily the same as the current one (it could be a
369 * child {@link Progress} of this {@link Progress}).
374 public void addProgressListener(ProgressListener l
) {
375 synchronized (lock
) {
376 this.listeners
.add(l
);
381 * Remove a {@link ProgressListener} that would trigger on progress changes.
386 * @return TRUE if it was found (and removed)
388 public boolean removeProgressListener(ProgressListener l
) {
389 synchronized (lock
) {
390 return this.listeners
.remove(l
);
395 * Add a child {@link Progress} of the given weight.
398 * the child {@link Progress} to add
400 * the weight (on a {@link Progress#getMin()} to
401 * {@link Progress#getMax()} scale) of this child
402 * {@link Progress} in relation to its parent
404 * @throws RuntimeException
405 * if weight exceed {@link Progress#getMax()} or if progress
406 * already has a parent
408 public void addProgress(Progress progress
, double weight
) {
409 if (weight
< min
|| weight
> max
) {
410 throw new RuntimeException(String
.format(
411 "Progress object %s cannot have a weight of %f, "
412 + "it is outside of its parent (%s) range (%d)",
413 progress
.name
, weight
, name
, max
));
416 if (progress
.parent
!= null) {
417 throw new RuntimeException(String
.format(
418 "Progress object %s cannot be added to %s, "
419 + "as it already has a parent (%s)", progress
.name
,
420 name
, progress
.parent
.name
));
423 ProgressListener progressListener
= new ProgressListener() {
425 public void progress(Progress pg
, String name
) {
426 synchronized (lock
) {
427 double total
= relativeLocalProgress
;
428 for (Entry
<Progress
, Double
> entry
: children
.entrySet()) {
429 total
+= (entry
.getValue() / (max
- min
))
430 * entry
.getKey().getRelativeProgress();
433 setRelativeProgress(pg
, name
, total
);
438 synchronized (lock
) {
439 // Should not happen but just in case
440 if (this.map
!= progress
.map
) {
441 this.map
.putAll(progress
.map
);
443 progress
.map
= this.map
;
444 progress
.parent
= this;
445 this.children
.put(progress
, weight
);
446 progress
.addProgressListener(progressListener
);
451 * Set the given value for the given key on this {@link Progress} and it's
459 public void put(Object key
, Object value
) {
464 * Return the value associated with this key as a {@link String} if any,
467 * If the value is not NULL but not a {@link String}, it will be converted
468 * via {@link Object#toString()}.
473 * @return the value or NULL
475 public String
getString(Object key
) {
476 Object value
= map
.get(key
);
481 return value
.toString();
485 * Return the value associated with this key if any, NULL if not.
490 * @return the value or NULL
492 public Object
get(Object key
) {