001 /*
002 * Sonar, open source software quality management tool.
003 * Copyright (C) 2009 SonarSource SA
004 * mailto:contact AT sonarsource DOT com
005 *
006 * Sonar is free software; you can redistribute it and/or
007 * modify it under the terms of the GNU Lesser General Public
008 * License as published by the Free Software Foundation; either
009 * version 3 of the License, or (at your option) any later version.
010 *
011 * Sonar is distributed in the hope that it will be useful,
012 * but WITHOUT ANY WARRANTY; without even the implied warranty of
013 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
014 * Lesser General Public License for more details.
015 *
016 * You should have received a copy of the GNU Lesser General Public
017 * License along with Sonar; if not, write to the Free Software
018 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02
019 */
020 package org.sonar.squid.math;
021
022 import java.util.Collection;
023 import java.util.Map;
024 import java.util.TreeMap;
025
026 import org.sonar.squid.api.SourceCode;
027 import org.sonar.squid.measures.Metric;
028
029 public class MeasuresDistribution {
030
031 private final Collection<SourceCode> units;
032
033 public MeasuresDistribution(Collection<SourceCode> units) {
034 this.units = units;
035 }
036
037 public Map<Integer, Integer> distributeAccordingTo(Metric metric, int... thresholds) {
038 Map<Integer, Integer> result = new TreeMap<Integer, Integer>();
039 for (int i = 0; i < thresholds.length; i++) {
040 result.put(thresholds[i], 0);
041 }
042 for (SourceCode unit : units) {
043 for (int index = 0; index < thresholds.length; index++) {
044 if (isInFirstRange(index, unit.getDouble(metric), thresholds[index])) {
045 result.put(thresholds[0], result.get(thresholds[0]) + 1);
046 break;
047 } else if (unit.getDouble(metric) < thresholds[index]) {
048 result.put(thresholds[index - 1], result.get(thresholds[index - 1]) + 1);
049 break;
050 } else if (isLastRange(index, thresholds)) {
051 result.put(thresholds[index], result.get(thresholds[index]) + 1);
052 }
053 }
054 }
055 return result;
056 }
057
058 private boolean isLastRange(int index, int[] thresholds) {
059 return index == thresholds.length - 1;
060 }
061
062 private boolean isInFirstRange(int index, double measure, int threshold) {
063 return index == 0 && measure < threshold;
064 }
065 }