diff --git a/de/d89/graham__scan__functions_8hpp_source.html b/de/d89/graham__scan__functions_8hpp_source.html index 2aefaec76..e3373a1db 100644 --- a/de/d89/graham__scan__functions_8hpp_source.html +++ b/de/d89/graham__scan__functions_8hpp_source.html @@ -199,7 +199,7 @@ document.addEventListener('DOMContentLoaded',() => { initNavTree('de/d89/graham_
73/******************************************************************************
74 * @brief A utility function to find next to top in a stack.
75 * @param S Stack to be used for the process.
-
76 * @returns @param Point Co-ordinates of the Point <int, int>
+
76 * @returns Co-ordinates of the Point <int, int> below the top of the stack
77 *******************************************************************************/
78Point nextToTop(std::stack<Point> *S) {
79 Point p = S->top();
@@ -213,7 +213,7 @@ document.addEventListener('DOMContentLoaded',() => { initNavTree('de/d89/graham_
87 * @brief A utility function to return square of distance between p1 and p2.
88 * @param p1 Co-ordinates of Point 1 <int, int>.
89 * @param p2 Co-ordinates of Point 2 <int, int>.
-
90 * @returns @param int distance between p1 and p2.
+
90 * @returns square of the distance between p1 and p2.
91 *******************************************************************************/
92int distSq(Point p1, Point p2) {
93 return (p1.x - p2.x) * (p1.x - p2.x) + (p1.y - p2.y) * (p1.y - p2.y);
@@ -224,7 +224,7 @@ document.addEventListener('DOMContentLoaded',() => { initNavTree('de/d89/graham_
98 * @param p Co-ordinates of Point p <int, int>.
99 * @param q Co-ordinates of Point q <int, int>.
100 * @param r Co-ordinates of Point r <int, int>.
-
101 * @returns @param int 0 --> p, q and r are collinear, 1 --> Clockwise,
+
101 * @returns 0 --> p, q and r are collinear, 1 --> Clockwise,
102 * 2 --> Counterclockwise
103 *******************************************************************************/
104int orientation(Point p, Point q, Point r) {
@@ -241,7 +241,7 @@ document.addEventListener('DOMContentLoaded',() => { initNavTree('de/d89/graham_
115 * points with respect to the first point
116 * @param vp1 Co-ordinates of Point 1 <int, int>.
117 * @param vp2 Co-ordinates of Point 2 <int, int>.
-
118 * @returns @param int distance between p1 and p2.
+
118 * @returns -1 if Point 1 sorts before Point 2, 1 otherwise.
119 *******************************************************************************/
120int compare(const void *vp1, const void *vp2) {
121 auto *p1 = static_cast<const Point *>(vp1);
@@ -260,7 +260,7 @@ document.addEventListener('DOMContentLoaded',() => { initNavTree('de/d89/graham_
134 * @brief Prints convex hull of a set of n points.
135 * @param points vector of Point<int, int> with co-ordinates.
136 * @param size Size of the vector.
-
137 * @returns @param vector vector of Conver Hull.
+
137 * @returns vector of the Points forming the convex hull.
138 *******************************************************************************/
139std::vector<Point> convexHull(std::vector<Point> points, uint64_t size) {
140 // Find the bottom-most point