@@ -41,8 +41,6 @@ public class FederatedMemoTable {
4141 // Maps Hop ID and fedOutType pairs to their plan variants
4242 private final Map <Pair <Long , FederatedOutput >, FedPlanVariants > hopMemoTable = new HashMap <>();
4343
44- public void addFedPlanVariants (long hopID , FederatedOutput fedOutType , FedPlanVariants fedPlanVariants ) {
45- hopMemoTable .put (new ImmutablePair <>(hopID , fedOutType ), fedPlanVariants );
4644 public void addFedPlanVariants (long hopID , FederatedOutput fedOutType , FedPlanVariants fedPlanVariants ) {
4745 hopMemoTable .put (new ImmutablePair <>(hopID , fedOutType ), fedPlanVariants );
4846 }
@@ -136,15 +134,12 @@ public static class FedPlanVariants {
136134 private final FederatedOutput fedOutType ; // Output type (FOUT/LOUT)
137135 protected List <FedPlan > _fedPlanVariants ; // List of plan variants
138136
139- public FedPlanVariants (HopCommon hopCommon , FederatedOutput fedOutType ) {
140- this .hopCommon = hopCommon ;
141137 public FedPlanVariants (HopCommon hopCommon , FederatedOutput fedOutType ) {
142138 this .hopCommon = hopCommon ;
143139 this .fedOutType = fedOutType ;
144140 this ._fedPlanVariants = new ArrayList <>();
145141 }
146142
147- public boolean isEmpty () {return _fedPlanVariants .isEmpty ();}
148143 public boolean isEmpty () {return _fedPlanVariants .isEmpty ();}
149144 public void addFedPlan (FedPlan fedPlan ) {_fedPlanVariants .add (fedPlan );}
150145 public List <FedPlan > getFedPlanVariants () {return _fedPlanVariants ;}
@@ -154,7 +149,6 @@ public boolean pruneFedPlans() {
154149 if (!_fedPlanVariants .isEmpty ()) {
155150 // Find the FedPlan with the minimum cumulative cost
156151 FedPlan minCostPlan = _fedPlanVariants .stream ()
157- .min (Comparator .comparingDouble (FedPlan ::getCumulativeCost ))
158152 .min (Comparator .comparingDouble (FedPlan ::getCumulativeCost ))
159153 .orElse (null );
160154
0 commit comments