libcamera/libcamera.git - libcamera official repository

summary refs log tree commit diff

path: root/src/qcam/assets/feathericons/key.svg

diff options

author	Laurent Pinchart <laurent.pinchart@ideasonboard.com>	2020-01-05 04:35:25 +0200
committer	Laurent Pinchart <laurent.pinchart@ideasonboard.com>	2020-08-25 20:24:21 +0300
commit	3bd19855459f6b58360197bc67c545a698812899 (patch)
tree	eb73048267e21c6bd72cb6b5b2c1bcbad0c42850 /src/qcam/assets/feathericons/key.svg
parent	852b9d0a7636fd7fa34cb424a9992642af4826b9 (diff)

v4l2: camera: Merge getStreamConfig() with open()

The V4L2CameraProxy always calls V4L2Camera::getStreamConfig() right after V4L2Camera::open(), and never afterwards. Simplify the code by returning the initial configuration from V4L2Camera::open() and removing V4L2Camera::getStreamConfig(). Signed-off-by: Laurent Pinchart <laurent.pinchart@ideasonboard.com> Reviewed-by: Kieran Bingham <kieran.bingham@ideasonboard.com> Reviewed-by: Paul Elder <paul.elder@ideasonboard.com>

Diffstat (limited to 'src/qcam/assets/feathericons/key.svg')

0 files changed, 0 insertions, 0 deletions

> return 0; 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 { if (first == -1) first = 0; if (last == -1) last = cumulative_.size() - 2; assert(first <= last); uint64_t items = q * Total(); while (first < last) // binary search to find the right bin { int middle = (first + last) / 2; if (cumulative_[middle + 1] > items) last = middle; // between first and middle else first = middle + 1; // after middle } assert(items >= cumulative_[first] && items <= cumulative_[last + 1]); double frac = cumulative_[first + 1] == cumulative_[first] ? 0 : (double)(items - cumulative_[first]) / (cumulative_[first + 1] - cumulative_[first]); return first + frac; } double Histogram::InterQuantileMean(double q_lo, double q_hi) 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); double freq = (cumulative_[bin + 1] - cumulative_[bin]) * (std::min(p_next, p_hi) - p_lo); sum_bin_freq += bin * freq; cumul_freq += freq; } // add 0.5 to give an average for bin mid-points return sum_bin_freq / cumul_freq + 0.5; }