Borderou de evaluare (job #1771794)

Utilizator ArkinyStoica Alex Arkiny Data 6 octombrie 2016 00:04:22
Problema Arie Status done
Runda Arhiva de probleme Compilator cpp | Vezi sursa
Scor 0

Raport evaluator

Eroare de compilare: user.cpp: In member function ‘int Polygon::point_inside_polygon(POINT2D)’: user.cpp:139:29: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses] if (p.y >= points[i].y && p.y <= points[i + 1].y || p.y >= points[i + 1].y && p.y <= points[i].y) ^ user.cpp:153:28: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses] if (p.y >= points[1].y && p.y <= points[number_points].y || p.y >= points[number_points].y && p.y <= points[1].y) ^ user.cpp: In member function ‘void Polygon::trigonometric_order()’: user.cpp:220:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int i = 0;i < stack.size();++i) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from user.cpp:4: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of ‘_RandomAccessIterator std::__unguarded_partition(_RandomAccessIterator, _RandomAccessIterator, const _Tp&, _Compare) [with _RandomAccessIterator = POINT2D*; _Tp = POINT2D; _Compare = Polygon::intertsects(Polygon&)::__lambda1]’: /usr/include/c++/4.8/bits/stl_algo.h:2319:78: required from ‘_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = POINT2D*; _Compare = Polygon::intertsects(Polygon&)::__lambda1]’ /usr/include/c++/4.8/bits/stl_algo.h:2360:62: required from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = POINT2D*; _Size = int; _Compare = Polygon::intertsects(Polygon&)::__lambda1]’ /usr/include/c++/4.8/bits/stl_algo.h:5513:44: required from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = POINT2D*; _Compare = Polygon::intertsects(Polygon&)::__lambda1]’ user.cpp:286:4: required from here /usr/include/c++/4.8/bits/stl_algo.h:2287:35: error: no match for call to ‘(Polygon::intertsects(Polygon&)::__lambda1) (POINT2D&, const POINT2D&)’ while (__comp(*__first, __pivot)) ^ user.cpp:274:64: note: candidates are: sort(poly_inter + 1, poly_inter + number_points_inter + 1, [&](POINT2D &p1, POINT2D &p2) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from user.cpp:4: /usr/include/c++/4.8/bits/stl_algo.h:2287:35: note: int (*)(POINT2D&, POINT2D&) <conversion> while (__comp(*__first, __pivot)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2287:35: note: candidate expects 3 arguments, 3 provided user.cpp:274:90: note: Polygon::intertsects(Polygon&)::__lambda1 sort(poly_inter + 1, poly_inter + number_points_inter + 1, [&](POINT2D &p1, POINT2D &p2) ^ user.cpp:274:90: note: no known conversion for argument 2 from ‘const POINT2D’ to ‘POINT2D&’ In file included from /usr/include/c++/4.8/algorithm:62:0, from user.cpp:4: /usr/include/c++/4.8/bits/stl_algo.h:2290:34: error: no match for call to ‘(Polygon::intertsects(Polygon&)::__lambda1) (const POINT2D&, POINT2D&)’ while (__comp(__pivot, *__last)) ^ user.cpp:274:64: note: candidates are: sort(poly_inter + 1, poly_inter + number_points_inter + 1, [&](POINT2D &p1, POINT2D &p2) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from user.cpp:4: /usr/include/c++/4.8/bits/stl_algo.h:2290:34: note: int (*)(POINT2D&, POINT2D&) <conversion> while (__comp(__pivot, *__last)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2290:34: note: candidate expects 3 arguments, 3 provided user.cpp:274:90: note: Polygon::intertsects(Polygon&)::__lambda1 sort(poly_inter + 1, poly_inter + number_points_inter + 1, [&](POINT2D &p1, POINT2D &p2)

Ceva nu functioneaza?