prepare (1/3):
finished
make (2/3):
g++ -g -Wall -O2 -c main.cpp
In file included from main.cpp:5:0:
fib_heap.h: In instantiation of 'fib_heap<TYPE, COMP>::fib_heap(COMP) [with TYPE = point; COMP = point::compare_t]':
main.cpp:65:49: required from here
fib_heap.h:63:15: warning: 'fib_heap<point, point::compare_t>::H_n' will be initialized after [-Wreorder]
size_type H_n; //store the number of element
^~~
fib_heap.h:62:11: warning: 'fib_heap<point, point::compare_t>::node* fib_heap<point, point::compare_t>::H_min' [-Wreorder]
node *H_min; //store the pointer to the min element
^~~~~
fib_heap.h:19:5: warning: when initialized here [-Wreorder]
fib_heap(COMP comp = COMP()):compare(comp),H_n(0),H_min(NULL){};
^~~~~~~~
fib_heap.h: In instantiation of 'void fib_heap<TYPE, COMP>::consolidate() [with TYPE = point; COMP = point::compare_t]':
fib_heap.h:202:11: required from 'TYPE fib_heap<TYPE, COMP>::dequeue_min() [with TYPE = point; COMP = point::compare_t]'
main.cpp:151:1: required from here
fib_heap.h:66:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i=0;i<this->H_n;i++)
~^~~~~~~~~~
fib_heap.h:93:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i=0;i<this->H_n;i++){
~^~~~~~~~~~
g++ -g -Wall -O2 -o main main.o
finished
clean (3/3):
finished
all task finished, build successfully