Link.java

/**
 * Copyright (c) 2004-2025 Carnegie Mellon University and others. (see Contributors file). 
 * All Rights Reserved.
 * 
 * NO WARRANTY. ALL MATERIAL IS FURNISHED ON AN "AS-IS" BASIS. CARNEGIE MELLON UNIVERSITY MAKES NO WARRANTIES OF ANY
 * KIND, EITHER EXPRESSED OR IMPLIED, AS TO ANY MATTER INCLUDING, BUT NOT LIMITED TO, WARRANTY OF FITNESS FOR PURPOSE
 * OR MERCHANTABILITY, EXCLUSIVITY, OR RESULTS OBTAINED FROM USE OF THE MATERIAL. CARNEGIE MELLON UNIVERSITY DOES NOT
 * MAKE ANY WARRANTY OF ANY KIND WITH RESPECT TO FREEDOM FROM PATENT, TRADEMARK, OR COPYRIGHT INFRINGEMENT.
 * 
 * This program and the accompanying materials are made available under the terms of the Eclipse Public License 2.0
 * which is available at https://www.eclipse.org/legal/epl-2.0/
 * SPDX-License-Identifier: EPL-2.0
 * 
 * Created, in part, with funding and support from the United States Government. (see Acknowledgments file).
 * 
 * This program includes and/or can make use of certain third party source code, object code, documentation and other
 * files ("Third Party Software"). The Third Party Software that is used by this program is dependent upon your system
 * configuration. By using this program, You agree to comply with any and all relevant Third Party Software terms and
 * conditions contained in any such Third Party Software or separate license file distributed with such Third Party
 * Software. The parties who own the Third Party Software ("Third Party Licensors") are intended third party benefici-
 * aries to this license with respect to the terms applicable to their Third Party Software. Third Party Software li-
 * censes only apply to the Third Party Software and not any other portion of this program or this program as a whole.
 */
package EAnalysis.BinPacking;

import java.util.Collection;
import java.util.Comparator;
import java.util.Iterator;
import java.util.TreeSet;

public class Link extends HardwareNode {
	TreeSet connectedNodes;

	public void add(HardwareNode node) {
		if (!connectedNodes.contains(node))
			connectedNodes.add(node);
	}

	public void remove(HardwareNode node) {
		connectedNodes.remove(node);
	}

	public void addAllNodes(Collection c) {
		for (Iterator iter = c.iterator(); iter.hasNext();)
			add((HardwareNode) iter.next());
	}

	/**
	 * return the set of nodes connected to this link order in non-decreasing of
	 * available capacity
	 */
	public TreeSet getConnectedNodes() {
		return connectedNodes;
	}

	/**
	 * The messages deployed over this link will be scheduled with
	 * 
	 * @param s
	 */
	public Link(Comparator c, Scheduler s, double cyclesPerSec) {
		super(s, cyclesPerSec);
		connectedNodes = new TreeSet(c);
	}
}