prepare (1/3):
finished
make (2/3):
g++ -g -Wall -O2 -o main.o -c main.cpp
main.cpp: In function 'int main(int, char**)':
main.cpp:41:9: warning: unused variable 'totalsize' [-Wunused-variable]
int totalsize = 0;
^~~~~~~~~
main.cpp:42:9: warning: unused variable 'count' [-Wunused-variable]
int count = 0;
^~~~~
In file included from main.cpp:10:0:
unsorted_heap.h: In instantiation of 'TYPE unsorted_heap<TYPE, COMP>::dequeue_min() [with TYPE = point*; COMP = compare_t]':
main.cpp:287:1: required from here
unsorted_heap.h:71:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i =0;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:287:1: required from here
unsorted_heap.h:90:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i =0;i < data.size();i++){
In file included from main.cpp:8:0:
binary_heap.h: In instantiation of 'TYPE binary_heap<TYPE, COMP>::dequeue_min() [with TYPE = point*; COMP = compare_t]':
main.cpp:287:1: required from here
binary_heap.h:87:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int j = 2*(id);j <= data.size();j = 2*(id) ){
binary_heap.h:88:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if(j<data.size() && compare(data[j],data[j-1])) j++;
binary_heap.h:81:9: warning: unused variable 'last' [-Wunused-variable]
int last = data.size()-1;
^~~~
In file included from main.cpp:10:0:
unsorted_heap.h: In member function 'const TYPE& unsorted_heap<TYPE, COMP>::get_min() const [with TYPE = point*; COMP = compare_t]':
unsorted_heap.h:96:16: warning: 'smallest' may be used uninitialized in this function [-Wmaybe-uninitialized]
return data[smallest]; //不懂 如果换成 return min 就会有warning
~~~~^
main.cpp: In function 'int main(int, char**)':
main.cpp:259:37: warning: 'que' may be used uninitialized in this function [-Wmaybe-uninitialized]
que->enqueue(&p[currenty-1][currentx]);
~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
g++ -g -Wall -O2 -o main main.o
finished
clean (3/3):
finished
all task finished, build successfully