Borderou de evaluare (job #2218062)
Utilizator | Data | 3 iulie 2018 11:18:23 | |
---|---|---|---|
Problema | Heapuri | Status | done |
Runda | Arhiva educationala | Compilator | cpp | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
user.cpp:12:10: error: expected ‘;’ at end of member declaration
bool tiperator<(const heap &x) const
^~~~~~~~~
user.cpp:12:19: error: expected unqualified-id before ‘<’ token
bool tiperator<(const heap &x) const
^
In file included from /usr/include/c++/6/string:48:0,
from /usr/include/c++/6/bits/locale_classes.h:40,
from /usr/include/c++/6/bits/ios_base.h:41,
from /usr/include/c++/6/ios:42,
from /usr/include/c++/6/istream:38,
from /usr/include/c++/6/fstream:38,
from user.cpp:1:
/usr/include/c++/6/bits/stl_function.h: In instantiation of ‘bool std::less<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = heap]’:
/usr/include/c++/6/bits/predefined_ops.h:147:11: required from ‘bool __gnu_cxx::__ops::_Iter_comp_val<_Compare>::operator()(_Iterator, _Value&) [with _Iterator = __gnu_cxx::__normal_iterator<heap*, std::vector<heap, std::allocator<heap> > >; _Value = heap; _Compare = std::less<heap>]’
/usr/include/c++/6/bits/stl_heap.h:129:48: required from ‘void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<heap*, std::vector<heap, std::allocator<heap> > >; _Distance = int; _Tp = heap; _Compare = __gnu_cxx::__ops::_Iter_comp_val<std::less<heap> >]’
/usr/include/c++/6/bits/stl_heap.h:201:23: required from ‘void std::push_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<heap*, std::vector<heap, std::allocator<heap> > >; _Compare = std::less<heap>]’
/usr/include/c++/6/bits/stl_queue.h:569:16: required from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(std::priority_queue<_Tp, _Sequence, _Compare>::value_type&&) [with _Tp = heap; _Sequence = std::vector<heap, std::allocator<heap> >; _Compare = std::less<heap>; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = heap]’
user.cpp:31:27: required from here
/usr/include/c++/6/bits/stl_function.h:386:20: error: no match for ‘operator<’ (operand types are ‘const heap’ and ‘const heap’)
{ return __x < __y; }
~~~~^~~~~
In file included from /usr/include/c++/6/bits/stl_algobase.h:64:0,
from /usr/include/c++/6/bits/char_traits.h:39,
from /usr/include/c++/6/ios:40,
from /usr/include/c++/6/istream:38,
from /usr/include/c++/6/fstream:38,
from user.cpp:1:
/usr/include/c++/6/bits/stl_pair.h:441:5: note: candidate: template<class _T1, class _T2> constexpr bool std::operator<(const std::pair<_T1, _T2>&, const std::pair<_T1, _T2>&)
operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
^~~~~~~~
/usr/include/c++/6/bits/stl_pair.h:441:5: note: template argument deduction/substitution failed:
In file included from /usr/include/c++/6/string:48:0,
from /usr/include/c++/6/bits/locale_classes.h:40,
from /usr/include/c++/6/bits/ios_base.h:41,
from /usr/include/c++/6/ios:42,
from /usr/include/c++/6/istream:38,
from /usr/include/c++/6/fstream:38,
from user.cpp:1:
/usr/include/c++/6/bits/stl_function.h:386:20: note: ‘const heap’ is not derived from ‘const std::pair<_T1, _T2>’
{ return __x < __y; }
~~~~^~~~~
In file included from /usr/include/c++/6/bits/stl_algobase.h:67:0,
from /usr/include/c++/6/bits/char_traits.h:39,
from /usr/include/c++/6/ios:40,
from /usr/include/c++/6/istream:38,
from /usr/include/c++/6/fstream:38,
from user.cpp:1:
/usr/include/c++/6/bits/stl_iterator.h:298:5: note: candidate: template<class _Iterator> bool std::operator<(const std::reverse_iterator<_Iterator>&, const std::reverse_iterator<_Iterator>&)
operator<(const reverse_iterator<_Iterator>& __x,
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !