Ignore:
Timestamp:
10/06/20 13:12:20 (4 years ago)
Author:
bart
Message:

Fixes an issue with processing maxPower of a vote. Javadoc maven plugin now uses latest version.

Location:
bidspace/src/main/java/geniusweb/bidspace
Files:
5 edited

Legend:

Unmodified
Added
Removed

  • bidspace/src/main/java/geniusweb/bidspace/AllBidsList.java

    r1 r24  
    2626
    2727        /**
    28          * A list containing all bids in the space. This is an ImmutableList so it
    29          * can contain all bids without pre-computing them.
     28         * This object contains s list containing all bids in the space. This is an
     29         * ImmutableList so it can contain all bids without pre-computing them.
     30         *
     31         * @param domain the {@link Domain}
    3032         *
    3133         */

  • bidspace/src/main/java/geniusweb/bidspace/AllPartialBidsList.java

    r1 r24  
    3232         * pre-computing them.
    3333         *
     34         * @param domain the {@link Domain}
    3435         */
    3536        public AllPartialBidsList(Domain domain) {

  • bidspace/src/main/java/geniusweb/bidspace/BidsWithUtility.java

    r10 r24  
    4343         * Default constructor, uses default precision 6. This value seems practical
    4444         * for the common range of issues, utilities and weights. See
    45          * {@link #BidsWithUtil(LinearAdditive, int)} for more details on the
     45         * {@link #BidsWithUtility(LinearAdditive, int)} for more details on the
    4646         * precision.
    4747         *
    … …  
    7373         *                  digits should be feasible; for 9 issues, 6 digits may be
    7474         *                  the maximum.
    75          *                  <p>
    76          *
    7775         */
    7876        public BidsWithUtility(LinearAdditive space, int precision) {
    … …  
    138136         * utilities in given range.
    139137         *
    140          * @param n    the number of {@link #issueRanges} to consider, we consider
    141          *             0..n here. The recursion decreases n until n=0
     138         * @param n    the number of issueRanges to consider, we consider 0..n here.
     139         *             The recursion decreases n until n=0
    142140         * @param goal the minimum and maximum utility required of the bids. to be
    143141         *             included (both ends inclusive)

  • bidspace/src/main/java/geniusweb/bidspace/Interval.java

    r10 r24  
    1616
    1717        /**
    18          * AN interval [min,max]. If min>max, then there are no values in this
     18         * AN interval [min,max]. If min &gt; max, then there are no values in this
    1919         * interval.
    2020         *
    21          * @param min
    22          * @param max
     21         * @param min the minimum value of the interval
     22         * @param max the maximum value of the interval
    2323         */
    2424        public Interval(BigDecimal min, BigDecimal max) {
    … …  
    4949         *
    5050         * @param value the value to test
    51          * @return true iff min<=value<=max
     51         * @return true iff min &le; value &le; max
    5252         */
    5353        public boolean contains(BigDecimal value) {
    … …  
    6666        /**
    6767         *
    68          * @param minMax another minMax to intersect with
    69          * @return intersection with other. returns null if intersection is empty.
     68         * @param other another {@link Interval} intersect with
     69         * @return intersection of this with other. returns null if intersection is
     70         *         empty.
    7071         */
    7172        public Interval intersect(Interval other) {

  • bidspace/src/main/java/geniusweb/bidspace/IssueInfo.java

    r10 r24  
    2626        private final Map<Value, BigDecimal> weightedUtils;
    2727
     28        /**
     29         *
     30         * @param name      the issue name
     31         * @param values    the {@link ValueSet} of the issue
     32         * @param utils     the {@link ValueSetUtilities} of the issue profile
     33         * @param weight    the weight of the {@link ValueSetUtilities}
     34         * @param precision the precision to compute with. Basically the number of
     35         *                  decimal places used for the computations.
     36         *
     37         */
    2838        public IssueInfo(String name, ValueSet values, ValueSetUtilities utils,
    2939                        BigDecimal weight, int precision) {
    … …  
    4555         *
    4656         * @return weighted minimum and maximum utility achievable with this issue,
    47          *         rounded to the {@link #precision}.
     57         *         rounded to the requested precision.
    4858         */
    4959        public Interval getInterval() {
    … …  
    5363        /**
    5464         *
    55          * @param isMax
     65         * @param isMax if true the max {@link Value} is returned, else the min is
     66         *              returned.
    5667         * @return the extreme value, either the minimum if isMax=false or maximum
    5768         *         if isMax=true
    … …  
    8697         * @param val the issue value to be evaluated
    8798         * @return weighted utility of given value, rounded to nearest value with
    88          *         {@link #precision} digits.
     99         *         the requested precision number of digits.
    89100         */
    90101        public BigDecimal getWeightedUtil(Value val) {
Note: See TracChangeset for help on using the changeset viewer.