/*
 * ARX: Powerful Data Anonymization
 * Copyright (C) 2012 - 2014 Florian Kohlmayer, Fabian Prasser
 * 
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 * 
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
 * GNU General Public License for more details.
 * 
 * You should have received a copy of the GNU General Public License
 * along with this program. If not, see <http://www.gnu.org/licenses/>.
 */

package org.deidentifier.arx.metric;

/**
 * Information loss with a potential lower bound
 * @author Fabian Prasser
 *
 */
public class BoundInformationLossDefault extends BoundInformationLoss<InformationLossDefault> {

    /**
     * Creates a new instance without a lower bound
     * @param informationLoss
     */
    public BoundInformationLossDefault(double informationLoss) {
        super(new InformationLossDefault(informationLoss));
    }

    /**
     * Creates a new instance
     * @param lowerBound
     * @param informationLoss
     */
    public BoundInformationLossDefault(double lowerBound,
                                       double informationLoss) {
        super(new InformationLossDefault(lowerBound), new InformationLossDefault(informationLoss));
    }
}

@@ -1257,48 +1257,48 @@
 ram 
-lowerBound%0A     * @param informationLoss
+informationLoss%0A     * @param lowerBound
 %0A   
@@ -1348,26 +1348,31 @@
 (double 
-lowerBound
+informationLoss
 ,%0A      
@@ -1407,39 +1407,34 @@
      double 
-informationLoss
+lowerBound
 ) %7B%0A        

correct order of parameters