NekoCWD/libcamera
NekoCWD/libcamera
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages 7 Wiki Activity Actions

ipa: raspberrypi: Code refactoring to match style guidelines

Browse source 
Refactor all the source files in src/ipa/raspberrypi/ to match the recommended
formatting guidelines for the libcamera project. The vast majority of changes
in this commit comprise of switching from snake_case to CamelCase, and starting
class member functions with a lower case character.

Signed-off-by: Naushir Patuck <naush@raspberrypi.com>
Reviewed-by: Laurent Pinchart <laurent.pinchart@ideasonboard.com>
Signed-off-by: Laurent Pinchart <laurent.pinchart@ideasonboard.com>
This commit is contained in:
Naushir Patuck 2022-07-27 09:55:17 +01:00 • committed by Laurent Pinchart
parent b4a3eb6b98
commit 177df04d2b
63 changed files with 2093 additions and 2161 deletions
Download patch file Download diff file Expand all files Collapse all files

34
src/ipa/raspberrypi/controller/histogram.cpp
View file

@ -11,25 +11,25 @@
using namespace RPiController;
uint64_t Histogram::CumulativeFreq(double bin) const
uint64_t Histogram::cumulativeFreq(double bin) const
{
if (bin <= 0)
return 0;
else if (bin >= Bins())
return Total();
else if (bin >= bins())
return total();
int b = (int)bin;
return cumulative_[b] +
(bin - b) * (cumulative_[b + 1] - cumulative_[b]);
}
double Histogram::Quantile(double q, int first, int last) const
double Histogram::quantile(double q, int first, int last) const
{
if (first == -1)
first = 0;
if (last == -1)
last = cumulative_.size() - 2;
assert(first <= last);
uint64_t items = q * Total();
uint64_t items = q * total();
while (first < last) // binary search to find the right bin
{
int middle = (first + last) / 2;
@ -45,20 +45,20 @@ double Histogram::Quantile(double q, int first, int last) const
return first + frac;
}
double Histogram::InterQuantileMean(double q_lo, double q_hi) const
double Histogram::interQuantileMean(double qLo, double qHi) const
{
assert(q_hi > q_lo);
double p_lo = Quantile(q_lo);
double p_hi = Quantile(q_hi, (int)p_lo);
double sum_bin_freq = 0, cumul_freq = 0;
for (double p_next = floor(p_lo) + 1.0; p_next <= ceil(p_hi);
p_lo = p_next, p_next += 1.0) {
int bin = floor(p_lo);
assert(qHi > qLo);
double pLo = quantile(qLo);
double pHi = quantile(qHi, (int)pLo);
double sumBinFreq = 0, cumulFreq = 0;
for (double pNext = floor(pLo) + 1.0; pNext <= ceil(pHi);
pLo = pNext, pNext += 1.0) {
int bin = floor(pLo);
double freq = (cumulative_[bin + 1] - cumulative_[bin]) *
(std::min(p_next, p_hi) - p_lo);
sum_bin_freq += bin * freq;
cumul_freq += freq;
(std::min(pNext, pHi) - pLo);
sumBinFreq += bin * freq;
cumulFreq += freq;
}
// add 0.5 to give an average for bin mid-points
return sum_bin_freq / cumul_freq + 0.5;
return sumBinFreq / cumulFreq + 0.5;
}