KickJava   Java API By Example, From Geeks To Geeks.

Java > Open Source Codes > org > apache > servicemix > beanflow > JoinQuorum


1 /*
2  * Licensed to the Apache Software Foundation (ASF) under one or more
3  * contributor license agreements. See the NOTICE file distributed with
4  * this work for additional information regarding copyright ownership.
5  * The ASF licenses this file to You under the Apache License, Version 2.0
6  * (the "License"); you may not use this file except in compliance with
7  * the License. You may obtain a copy of the License at
8  *
9  * http://www.apache.org/licenses/LICENSE-2.0
10  *
11  * Unless required by applicable law or agreed to in writing, software
12  * distributed under the License is distributed on an "AS IS" BASIS,
13  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
14  * See the License for the specific language governing permissions and
15  * limitations under the License.
16  */
17 package org.apache.servicemix.beanflow;
18
19 import java.util.List JavaDoc;
20
21 /**
22  * A activity which completes when quorum of the child activities are completed
23  * successfully (or there are too many child activities failed to achieve
24  * quorum).
25  *
26  * @version $Revision: $
27  */
28 public class JoinQuorum extends JoinSupport {
29
30     public JoinQuorum() {
31         super();
32
33     }
34
35     public JoinQuorum(Activity... activities) {
36         super(activities);
37     }
38
39     public JoinQuorum(List JavaDoc<Activity> activities) {
40         super(activities);
41     }
42
43     protected void onChildStateChange(int childCount, int stoppedCount, int failedCount) {
44         int quorum = calculateQuorum(childCount);
45         int successes = stoppedCount - failedCount;
46         if (successes >= quorum) {
47             stop();
48         }
49         else {
50             if (failedCount >= quorum) {
51                 fail("Too many child activities failed: " + failedCount);
52             }
53         }
54     }
55
56     protected int calculateQuorum(int childCount) {
57         return (childCount / 2) + 1;
58     }
59 }
60
Popular Tags