ActiveCluster - 1.1-SNAPSHOT

Clover coverage report - ActiveCluster - 1.1-SNAPSHOT

Coverage timestamp: Tue May 24 2005 08:48:28 BST

FRAMES NO FRAMES

file stats:	LOC:	78		Methods:	6
	NCLOC:	33		Classes:	1

30 day Evaluation Version distributed via the Maven Jar Repository. Clover is not free. You have 30 days to evaluate it. Please visit http://www.thecortex.net/clover to obtain a licensed version of Clover

Source file

Conditionals

Statements

Methods

TOTAL

NodeMemberships.java

 /** 
  * 
  * Copyright 2004 Protique Ltd
  * 
  * Licensed under the Apache License, Version 2.0 (the "License"); 
  * you may not use this file except in compliance with the License. 
  * You may obtain a copy of the License at 
  * 
  * http://www.apache.org/licenses/LICENSE-2.0
  * 
  * Unless required by applicable law or agreed to in writing, software
  * distributed under the License is distributed on an "AS IS" BASIS, 
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 
  * See the License for the specific language governing permissions and 
  * limitations under the License. 
  * 
  **/
 package org.activecluster.group;
 
 import org.activecluster.Node;
 
 import java.util.HashMap;
 import java.util.Map;
 
 /**
  * Represents all of the memberhips of a node and can be used to act
  * as a weighting to decide which is the least heavily loaded Node
  * to be assigned to a buddy group.
  *
  * @version $Revision: 1.1 $
  */
 public class NodeMemberships {
     private Node node;
     private Map memberships = new HashMap();
     private int weighting;
 
     public NodeMemberships(Node node) {
         this.node = node;
     }
 
     public void addToGroup(Group group) {
         if (!isMember(group)) {
             int index = group.addMember(node);
             Membership membership = new Membership(group, index);
             memberships.put(group, membership);
             weighting += membership.getWeighting();
         }
     }
 
     public boolean removeFromGroup(Group group) {
         // TODO when we remove a node from a group, we need to reweight the
         // other nodes in the group
 
         memberships.remove(group);
         return group.removeMember(node);
     }
 
     public Node getNode() {
         return node;
     }
 
     /**
      * Returns the weighting of how heavily loaded the node is
      * so that a decision can be made on which node to buddy group
      * with
      */
     public int getWeighting() {
         return weighting;
     }
 
     /**
      * Returns true if this node is a member of the given group
      */
     public boolean isMember(Group group) {
         return memberships.containsKey(group);
     }
 }
 

1		/**
2		*
3		* Copyright 2004 Protique Ltd
4		*
5		* Licensed under the Apache License, Version 2.0 (the "License");
6		* you may not use this file except in compliance with the License.
7		* 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		**/
18		package org.activecluster.group;
19
20		import org.activecluster.Node;
21
22		import java.util.HashMap;
23		import java.util.Map;
24
25		/**
26		* Represents all of the memberhips of a node and can be used to act
27		* as a weighting to decide which is the least heavily loaded Node
28		* to be assigned to a buddy group.
29		*
30		* @version $Revision: 1.1 $
31		*/
32		public class NodeMemberships {
33		private Node node;
34		private Map memberships = new HashMap();
35		private int weighting;
36
37	0	public NodeMemberships(Node node) {
38	0	this.node = node;
39		}
40
41	0	public void addToGroup(Group group) {
42	0	if (!isMember(group)) {
43	0	int index = group.addMember(node);
44	0	Membership membership = new Membership(group, index);
45	0	memberships.put(group, membership);
46	0	weighting += membership.getWeighting();
47		}
48		}
49
50	0	public boolean removeFromGroup(Group group) {
51		// TODO when we remove a node from a group, we need to reweight the
52		// other nodes in the group
53
54	0	memberships.remove(group);
55	0	return group.removeMember(node);
56		}
57
58	0	public Node getNode() {
59	0	return node;
60		}
61
62		/**
63		* Returns the weighting of how heavily loaded the node is
64		* so that a decision can be made on which node to buddy group
65		* with
66		*/
67	0	public int getWeighting() {
68	0	return weighting;
69		}
70
71		/**
72		* Returns true if this node is a member of the given group
73		*/
74	0	public boolean isMember(Group group) {
75	0	return memberships.containsKey(group);
76		}
77		}
78