prepare (1/3):
finished
make (2/3):
g++ -g -Wall -O2 -o main.o -c main.cpp
main.cpp: In constructor 'grid::grid(unsigned int, unsigned int, unsigned int, unsigned int, unsigned int, unsigned int)':
main.cpp:43:14: warning: 'grid::height' will be initialized after [-Wreorder]
unsigned height;
^~~~~~
main.cpp:41:14: warning: 'unsigned int grid::start' [-Wreorder]
unsigned start,end;
^~~~~
main.cpp:45:5: warning: when initialized here [-Wreorder]
grid(unsigned width,unsigned height, unsigned sx,unsigned sy,unsigned ex,unsigned ey):
^~~~
In file included from main.cpp:3:0:
unsorted_heap.h: In instantiation of 'TYPE unsorted_heap<TYPE, COMP>::dequeue_min() [with TYPE = point*; COMP = compare_t]':
main.cpp:246:1: required from here
unsorted_heap.h:71:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 1; i < data.size(); ++i) {
unsorted_heap.h: In instantiation of 'const TYPE& unsorted_heap<TYPE, COMP>::get_min() const [with TYPE = point*; COMP = compare_t]':
main.cpp:246:1: required from here
unsorted_heap.h:86:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 1; i < data.size(); ++i) {
In file included from main.cpp:4:0:
binary_heap.h: In instantiation of 'void binary_heap<TYPE, COMP>::enqueue(const TYPE&) [with TYPE = point*; COMP = compare_t]':
main.cpp:246:1: required from here
binary_heap.h:71:34: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
if(compare(data[i],data[i-1>>1]))
~^~
binary_heap.h:72:21: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
swap(i,i-1>>1);
~^~
binary_heap.h: In instantiation of 'TYPE binary_heap<TYPE, COMP>::dequeue_min() [with TYPE = point*; COMP = compare_t]':
main.cpp:246:1: required from here
binary_heap.h:86:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int j = 2*id+1; j <size() ; j=2*id+1) {
~~^~~~~~~
binary_heap.h:87:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if(j<size()-1&&compare(data[j+1],data[j]))j++;
~^~~~~~~~~
g++ -g -Wall -O2 -o main main.o
finished
clean (3/3):
finished
all task finished, build successfully