getMostFrequentPitch method

Implementation

double getMostFrequentPitch() {
  if (detectedPitches.isEmpty) return 0;

  final Map<double, int> frequencyMap = {};

  for (var pitch in detectedPitches) {
    frequencyMap[pitch] = (frequencyMap[pitch] ?? 0) + 1;
  }

  final mostFrequentEntry = frequencyMap.entries
      .reduce((a, b) => a.value >= b.value ? a : b);

  return mostFrequentEntry.key; //Most recurrent freq
}