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) 2003 - 2007 Israfil Consulting Services Corporation
* Copyright (c) 2003 - 2007 Christian Edward Gruber
* All Rights Reserved
*
* This software is licensed under the Berkeley Standard Distribution license,
* (BSD license), as defined below:
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* 3. Neither the name of Israfil Consulting Services nor the names of its contributors
* may be used to endorse or promote products derived from this software without
* specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
* INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
* OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY
* OF SUCH DAMAGE.
*
* $Id: Pump.java 362 2007-01-21 06:37:33Z cgruber $
*/
package net.israfil.foundation.concurrent;
import java.util.ArrayList;
import java.util.Collection;
import java.util.List;
import java.util.concurrent.TimeUnit;
/**
* A worker that repeats and draws items from a producer and feeds it to a consumer
*
* @author <a href="mailto:cgruber@israfil.net">Christian Edward Gruber</a>
*/
public class DistributingPump<T> extends AbstractPump<T> {
protected ConcurrentProducer<T> producer;
protected Collection<ConcurrentConsumer<T>> consumers;
private List<ConcurrentConsumer<T>> consumersArray = null;
private int currentItem;
public DistributingPump() {}
public DistributingPump(String name, ConcurrentProducer<T> producer, Collection<ConcurrentConsumer<T>> consumers,
long timeout, TimeUnit timeoutUnit) {
super(name,timeout,timeoutUnit);
setProducer(producer);
setConsumers(consumers);
}
@Override
protected void validate() {
super.validate();
if (getProducer() == null)
throw new IllegalStateException("consumer cannot be null.");
if (getConsumers() == null || getConsumers().size() == 0)
throw new IllegalStateException("producers cannot be null.");
}
@Override
public boolean continueProcessing() { return isRunning(); }
@Override
public long iterationDelay() { return 0; }
public ConcurrentProducer<T> getProducer() { return producer; }
public void setProducer(ConcurrentProducer<T> producer) { this.producer = producer; }
public Collection<ConcurrentConsumer<T>> getConsumers() { return consumers; }
public void setConsumers(Collection<ConcurrentConsumer<T>> consumers) { this.consumers = consumers; }
@Override
protected boolean init() throws InterruptedException {
boolean init = super.init() && this.getProducer() != null &&
this.getConsumers() != null && this.getConsumers().size() > 0;
if (!init) return init; // fail fast.
consumersArray = new ArrayList<ConcurrentConsumer<T>>(consumers); // get consistent list.
return init;
}
@Override
protected void process() throws InterruptedException {
ConcurrentConsumer<T> consumer = consumersArray.get(currentItem++);
if (currentItem >= consumersArray.size()) currentItem = 0;
consumer.consume(producer.produce());
}
}
|
