summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorLaurent Pinchart <laurent.pinchart@ideasonboard.com>2019-04-17 00:36:04 +0300
committerLaurent Pinchart <laurent.pinchart@ideasonboard.com>2019-04-18 18:13:14 +0300
commit889b70d62d1b2fa974951866cb8bbebe66fce3a7 (patch)
treee4c5b8247a68b266cae227f3d82349f8ce0c703b
parent2059b857e1fcccbdd2f3575436d0a9e36f1f2134 (diff)
libcamera: utils: Add set_overlap() function
The new set_overlap() function counts the number of overlapping elements in the intersection of two sorted ranges defined by their beginning and ending iterators. Signed-off-by: Laurent Pinchart <laurent.pinchart@ideasonboard.com> Reviewed-by: Niklas Söderlund <niklas.soderlund@ragnatech.se> Reviewed-by: Jacopo Mondi <jacopo@jmondi.org>
-rw-r--r--src/libcamera/include/utils.h19
-rw-r--r--src/libcamera/utils.cpp12
2 files changed, 31 insertions, 0 deletions
diff --git a/src/libcamera/include/utils.h b/src/libcamera/include/utils.h
index 79038a96..97bd470a 100644
--- a/src/libcamera/include/utils.h
+++ b/src/libcamera/include/utils.h
@@ -26,6 +26,25 @@ std::unique_ptr<T> make_unique(Args&&... args)
char *secure_getenv(const char *name);
+template<class InputIt1, class InputIt2>
+unsigned int set_overlap(InputIt1 first1, InputIt1 last1,
+ InputIt2 first2, InputIt2 last2)
+{
+ unsigned int count = 0;
+
+ while (first1 != last1 && first2 != last2) {
+ if (*first1 < *first2) {
+ ++first1;
+ } else {
+ if (!(*first2 < *first1))
+ count++;
+ ++first2;
+ }
+ }
+
+ return count;
+}
+
} /* namespace utils */
} /* namespace libcamera */
diff --git a/src/libcamera/utils.cpp b/src/libcamera/utils.cpp
index cd0fd761..e38f3268 100644
--- a/src/libcamera/utils.cpp
+++ b/src/libcamera/utils.cpp
@@ -68,6 +68,18 @@ char *secure_getenv(const char *name)
* \brief Constructs an object of type T and wraps it in a std::unique_ptr.
*/
+/**
+ * \fn libcamera::utils::set_overlap(InputIt1 first1, InputIt1 last1,
+ * InputIt2 first2, InputIt2 last2)
+ * \brief Count the number of elements in the intersection of two ranges
+ *
+ * Count the number of elements in the intersection of the sorted ranges [\a
+ * first1, \a last1) and [\a first1, \a last2). Elements are compared using
+ * operator< and the ranges must be sorted with respect to the same.
+ *
+ * \return The number of elements in the intersection of the two ranges
+ */
+
} /* namespace utils */
} /* namespace libcamera */