##############################################################################
##############################################################################
###
### Running command:
###
### /home/biocbuild/bbs-3.9-bioc/R/bin/R CMD INSTALL dSimer
###
##############################################################################
##############################################################################
* installing to library ‘/home/biocbuild/bbs-3.9-bioc/R/library’
* installing *source* package ‘dSimer’ ...
** using staged installation
** libs
g++ -std=gnu++11 -I"/home/biocbuild/bbs-3.9-bioc/R/include" -DNDEBUG -I"/home/biocbuild/bbs-3.9-bioc/R/library/Rcpp/include" -I/usr/local/include -fpic -g -O2 -Wall -c BOG.cpp -o BOG.o
BOG.cpp: In function ‘Rcpp::NumericMatrix BOG_simmat_cpp(Rcpp::List&, int, Rcpp::List&)’:
BOG.cpp:35:56: error: no matching function for call to ‘std::tr1::unordered_map, std::vector > >::insert(std::pair, std::vector > >)’
dgMap.insert( std::make_pair( dNames[i], genes ) );
^
In file included from /usr/include/c++/7/tr1/unordered_map:41:0,
from BOG.cpp:8:
/usr/include/c++/7/tr1/hashtable.h:374:7: note: candidate: std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::_Insert_Return_Type std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::insert(const value_type&) [with _Key = std::__cxx11::basic_string; _Value = std::pair, std::vector > >; _Allocator = std::allocator, std::vector > > >; _ExtractKey = std::_Select1st, std::vector > > >; _Equal = std::equal_to >; _H1 = std::tr1::hash >; _H2 = std::tr1::__detail::_Mod_range_hashing; _Hash = std::tr1::__detail::_Default_ranged_hash; _RehashPolicy = std::tr1::__detail::_Prime_rehash_policy; bool __cache_hash_code = false; bool __constant_iterators = false; bool __unique_keys = true; std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::_Insert_Return_Type = std::pair, std::vector > >, false, false>, bool>; std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::value_type = std::pair, std::vector > >]
insert(const value_type& __v)
^~~~~~
/usr/include/c++/7/tr1/hashtable.h:374:7: note: no known conversion for argument 1 from ‘std::pair, std::vector > >’ to ‘const value_type& {aka const std::pair, std::vector > >&}’
/usr/include/c++/7/tr1/hashtable.h:379:7: note: candidate: std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::iterator std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::insert(std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::iterator, const value_type&) [with _Key = std::__cxx11::basic_string; _Value = std::pair, std::vector > >; _Allocator = std::allocator, std::vector > > >; _ExtractKey = std::_Select1st, std::vector > > >; _Equal = std::equal_to >; _H1 = std::tr1::hash >; _H2 = std::tr1::__detail::_Mod_range_hashing; _Hash = std::tr1::__detail::_Default_ranged_hash; _RehashPolicy = std::tr1::__detail::_Prime_rehash_policy; bool __cache_hash_code = false; bool __constant_iterators = false; bool __unique_keys = true; std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::iterator = std::tr1::__detail::_Hashtable_iterator, std::vector > >, false, false>; std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::value_type = std::pair, std::vector > >]
insert(iterator, const value_type& __v)
^~~~~~
/usr/include/c++/7/tr1/hashtable.h:379:7: note: candidate expects 2 arguments, 1 provided
/usr/include/c++/7/tr1/hashtable.h:383:7: note: candidate: std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::const_iterator std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::insert(std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::const_iterator, const value_type&) [with _Key = std::__cxx11::basic_string; _Value = std::pair, std::vector > >; _Allocator = std::allocator, std::vector > > >; _ExtractKey = std::_Select1st, std::vector > > >; _Equal = std::equal_to >; _H1 = std::tr1::hash >; _H2 = std::tr1::__detail::_Mod_range_hashing; _Hash = std::tr1::__detail::_Default_ranged_hash; _RehashPolicy = std::tr1::__detail::_Prime_rehash_policy; bool __cache_hash_code = false; bool __constant_iterators = false; bool __unique_keys = true; std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::const_iterator = std::tr1::__detail::_Hashtable_const_iterator, std::vector > >, false, false>; std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::value_type = std::pair, std::vector > >]
insert(const_iterator, const value_type& __v)
^~~~~~
/usr/include/c++/7/tr1/hashtable.h:383:7: note: candidate expects 2 arguments, 1 provided
/usr/include/c++/7/tr1/hashtable.h:388:2: note: candidate: template void std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::insert(_InputIterator, _InputIterator) [with _InputIterator = _InputIterator; _Key = std::__cxx11::basic_string; _Value = std::pair, std::vector > >; _Allocator = std::allocator, std::vector > > >; _ExtractKey = std::_Select1st, std::vector > > >; _Equal = std::equal_to >; _H1 = std::tr1::hash >; _H2 = std::tr1::__detail::_Mod_range_hashing; _Hash = std::tr1::__detail::_Default_ranged_hash; _RehashPolicy = std::tr1::__detail::_Prime_rehash_policy; bool __cache_hash_code = false; bool __constant_iterators = false; bool __unique_keys = true]
insert(_InputIterator __first, _InputIterator __last);
^~~~~~
/usr/include/c++/7/tr1/hashtable.h:388:2: note: template argument deduction/substitution failed:
BOG.cpp:35:56: note: candidate expects 2 arguments, 1 provided
dgMap.insert( std::make_pair( dNames[i], genes ) );
^
BOG.cpp:47:78: error: no matching function for call to ‘std::tr1::unordered_map, int>::insert(std::pair, int>)’
d2gnum.insert(std::make_pair(dNames[i],Rcpp::as( GeneNumList[i] )));
^
In file included from /usr/include/c++/7/tr1/unordered_map:41:0,
from BOG.cpp:8:
/usr/include/c++/7/tr1/hashtable.h:374:7: note: candidate: std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::_Insert_Return_Type std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::insert(const value_type&) [with _Key = std::__cxx11::basic_string; _Value = std::pair, int>; _Allocator = std::allocator, int> >; _ExtractKey = std::_Select1st, int> >; _Equal = std::equal_to >; _H1 = std::tr1::hash >; _H2 = std::tr1::__detail::_Mod_range_hashing; _Hash = std::tr1::__detail::_Default_ranged_hash; _RehashPolicy = std::tr1::__detail::_Prime_rehash_policy; bool __cache_hash_code = false; bool __constant_iterators = false; bool __unique_keys = true; std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::_Insert_Return_Type = std::pair, int>, false, false>, bool>; std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::value_type = std::pair, int>]
insert(const value_type& __v)
^~~~~~
/usr/include/c++/7/tr1/hashtable.h:374:7: note: no known conversion for argument 1 from ‘std::pair, int>’ to ‘const value_type& {aka const std::pair, int>&}’
/usr/include/c++/7/tr1/hashtable.h:379:7: note: candidate: std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::iterator std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::insert(std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::iterator, const value_type&) [with _Key = std::__cxx11::basic_string; _Value = std::pair, int>; _Allocator = std::allocator, int> >; _ExtractKey = std::_Select1st, int> >; _Equal = std::equal_to >; _H1 = std::tr1::hash >; _H2 = std::tr1::__detail::_Mod_range_hashing; _Hash = std::tr1::__detail::_Default_ranged_hash; _RehashPolicy = std::tr1::__detail::_Prime_rehash_policy; bool __cache_hash_code = false; bool __constant_iterators = false; bool __unique_keys = true; std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::iterator = std::tr1::__detail::_Hashtable_iterator, int>, false, false>; std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::value_type = std::pair, int>]
insert(iterator, const value_type& __v)
^~~~~~
/usr/include/c++/7/tr1/hashtable.h:379:7: note: candidate expects 2 arguments, 1 provided
/usr/include/c++/7/tr1/hashtable.h:383:7: note: candidate: std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::const_iterator std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::insert(std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::const_iterator, const value_type&) [with _Key = std::__cxx11::basic_string; _Value = std::pair, int>; _Allocator = std::allocator, int> >; _ExtractKey = std::_Select1st, int> >; _Equal = std::equal_to >; _H1 = std::tr1::hash >; _H2 = std::tr1::__detail::_Mod_range_hashing; _Hash = std::tr1::__detail::_Default_ranged_hash; _RehashPolicy = std::tr1::__detail::_Prime_rehash_policy; bool __cache_hash_code = false; bool __constant_iterators = false; bool __unique_keys = true; std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::const_iterator = std::tr1::__detail::_Hashtable_const_iterator, int>, false, false>; std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::value_type = std::pair, int>]
insert(const_iterator, const value_type& __v)
^~~~~~
/usr/include/c++/7/tr1/hashtable.h:383:7: note: candidate expects 2 arguments, 1 provided
/usr/include/c++/7/tr1/hashtable.h:388:2: note: candidate: template void std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::insert(_InputIterator, _InputIterator) [with _InputIterator = _InputIterator; _Key = std::__cxx11::basic_string; _Value = std::pair, int>; _Allocator = std::allocator, int> >; _ExtractKey = std::_Select1st, int> >; _Equal = std::equal_to >; _H1 = std::tr1::hash >; _H2 = std::tr1::__detail::_Mod_range_hashing; _Hash = std::tr1::__detail::_Default_ranged_hash; _RehashPolicy = std::tr1::__detail::_Prime_rehash_policy; bool __cache_hash_code = false; bool __constant_iterators = false; bool __unique_keys = true]
insert(_InputIterator __first, _InputIterator __last);
^~~~~~
/usr/include/c++/7/tr1/hashtable.h:388:2: note: template argument deduction/substitution failed:
BOG.cpp:47:78: note: candidate expects 2 arguments, 1 provided
d2gnum.insert(std::make_pair(dNames[i],Rcpp::as( GeneNumList[i] )));
^
BOG.cpp: In function ‘Rcpp::NumericMatrix BOG_normat_cpp(Rcpp::CharacterVector, Rcpp::CharacterVector, Rcpp::NumericMatrix&, Rcpp::List&, Rcpp::List&, Rcpp::List&)’:
BOG.cpp:114:83: error: no matching function for call to ‘std::tr1::unordered_map, int>::insert(std::pair, int>)’
MatNameLoc.insert(std::make_pair(mnames[i],Rcpp::as( matnameloc[i] )));
^
In file included from /usr/include/c++/7/tr1/unordered_map:41:0,
from BOG.cpp:8:
/usr/include/c++/7/tr1/hashtable.h:374:7: note: candidate: std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::_Insert_Return_Type std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::insert(const value_type&) [with _Key = std::__cxx11::basic_string; _Value = std::pair, int>; _Allocator = std::allocator, int> >; _ExtractKey = std::_Select1st, int> >; _Equal = std::equal_to >; _H1 = std::tr1::hash >; _H2 = std::tr1::__detail::_Mod_range_hashing; _Hash = std::tr1::__detail::_Default_ranged_hash; _RehashPolicy = std::tr1::__detail::_Prime_rehash_policy; bool __cache_hash_code = false; bool __constant_iterators = false; bool __unique_keys = true; std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::_Insert_Return_Type = std::pair, int>, false, false>, bool>; std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::value_type = std::pair, int>]
insert(const value_type& __v)
^~~~~~
/usr/include/c++/7/tr1/hashtable.h:374:7: note: no known conversion for argument 1 from ‘std::pair, int>’ to ‘const value_type& {aka const std::pair, int>&}’
/usr/include/c++/7/tr1/hashtable.h:379:7: note: candidate: std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::iterator std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::insert(std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::iterator, const value_type&) [with _Key = std::__cxx11::basic_string; _Value = std::pair, int>; _Allocator = std::allocator, int> >; _ExtractKey = std::_Select1st, int> >; _Equal = std::equal_to >; _H1 = std::tr1::hash >; _H2 = std::tr1::__detail::_Mod_range_hashing; _Hash = std::tr1::__detail::_Default_ranged_hash; _RehashPolicy = std::tr1::__detail::_Prime_rehash_policy; bool __cache_hash_code = false; bool __constant_iterators = false; bool __unique_keys = true; std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::iterator = std::tr1::__detail::_Hashtable_iterator, int>, false, false>; std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::value_type = std::pair, int>]
insert(iterator, const value_type& __v)
^~~~~~
/usr/include/c++/7/tr1/hashtable.h:379:7: note: candidate expects 2 arguments, 1 provided
/usr/include/c++/7/tr1/hashtable.h:383:7: note: candidate: std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::const_iterator std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::insert(std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::const_iterator, const value_type&) [with _Key = std::__cxx11::basic_string; _Value = std::pair, int>; _Allocator = std::allocator, int> >; _ExtractKey = std::_Select1st, int> >; _Equal = std::equal_to >; _H1 = std::tr1::hash >; _H2 = std::tr1::__detail::_Mod_range_hashing; _Hash = std::tr1::__detail::_Default_ranged_hash; _RehashPolicy = std::tr1::__detail::_Prime_rehash_policy; bool __cache_hash_code = false; bool __constant_iterators = false; bool __unique_keys = true; std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::const_iterator = std::tr1::__detail::_Hashtable_const_iterator, int>, false, false>; std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::value_type = std::pair, int>]
insert(const_iterator, const value_type& __v)
^~~~~~
/usr/include/c++/7/tr1/hashtable.h:383:7: note: candidate expects 2 arguments, 1 provided
/usr/include/c++/7/tr1/hashtable.h:388:2: note: candidate: template void std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::insert(_InputIterator, _InputIterator) [with _InputIterator = _InputIterator; _Key = std::__cxx11::basic_string; _Value = std::pair, int>; _Allocator = std::allocator, int> >; _ExtractKey = std::_Select1st, int> >; _Equal = std::equal_to >; _H1 = std::tr1::hash >; _H2 = std::tr1::__detail::_Mod_range_hashing; _Hash = std::tr1::__detail::_Default_ranged_hash; _RehashPolicy = std::tr1::__detail::_Prime_rehash_policy; bool __cache_hash_code = false; bool __constant_iterators = false; bool __unique_keys = true]
insert(_InputIterator __first, _InputIterator __last);
^~~~~~
/usr/include/c++/7/tr1/hashtable.h:388:2: note: template argument deduction/substitution failed:
BOG.cpp:114:83: note: candidate expects 2 arguments, 1 provided
MatNameLoc.insert(std::make_pair(mnames[i],Rcpp::as( matnameloc[i] )));
^
BOG.cpp:128:80: error: no matching function for call to ‘std::tr1::unordered_map, float>::insert(std::pair, float>)’
MaxSimVal.insert(std::make_pair(mnames[i],Rcpp::as( maxsim[i] )));
^
In file included from /usr/include/c++/7/tr1/unordered_map:41:0,
from BOG.cpp:8:
/usr/include/c++/7/tr1/hashtable.h:374:7: note: candidate: std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::_Insert_Return_Type std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::insert(const value_type&) [with _Key = std::__cxx11::basic_string; _Value = std::pair, float>; _Allocator = std::allocator, float> >; _ExtractKey = std::_Select1st, float> >; _Equal = std::equal_to >; _H1 = std::tr1::hash >; _H2 = std::tr1::__detail::_Mod_range_hashing; _Hash = std::tr1::__detail::_Default_ranged_hash; _RehashPolicy = std::tr1::__detail::_Prime_rehash_policy; bool __cache_hash_code = false; bool __constant_iterators = false; bool __unique_keys = true; std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::_Insert_Return_Type = std::pair, float>, false, false>, bool>; std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::value_type = std::pair, float>]
insert(const value_type& __v)
^~~~~~
/usr/include/c++/7/tr1/hashtable.h:374:7: note: no known conversion for argument 1 from ‘std::pair, float>’ to ‘const value_type& {aka const std::pair, float>&}’
/usr/include/c++/7/tr1/hashtable.h:379:7: note: candidate: std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::iterator std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::insert(std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::iterator, const value_type&) [with _Key = std::__cxx11::basic_string; _Value = std::pair, float>; _Allocator = std::allocator, float> >; _ExtractKey = std::_Select1st, float> >; _Equal = std::equal_to >; _H1 = std::tr1::hash >; _H2 = std::tr1::__detail::_Mod_range_hashing; _Hash = std::tr1::__detail::_Default_ranged_hash; _RehashPolicy = std::tr1::__detail::_Prime_rehash_policy; bool __cache_hash_code = false; bool __constant_iterators = false; bool __unique_keys = true; std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::iterator = std::tr1::__detail::_Hashtable_iterator, float>, false, false>; std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::value_type = std::pair, float>]
insert(iterator, const value_type& __v)
^~~~~~
/usr/include/c++/7/tr1/hashtable.h:379:7: note: candidate expects 2 arguments, 1 provided
/usr/include/c++/7/tr1/hashtable.h:383:7: note: candidate: std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::const_iterator std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::insert(std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::const_iterator, const value_type&) [with _Key = std::__cxx11::basic_string; _Value = std::pair, float>; _Allocator = std::allocator, float> >; _ExtractKey = std::_Select1st, float> >; _Equal = std::equal_to >; _H1 = std::tr1::hash >; _H2 = std::tr1::__detail::_Mod_range_hashing; _Hash = std::tr1::__detail::_Default_ranged_hash; _RehashPolicy = std::tr1::__detail::_Prime_rehash_policy; bool __cache_hash_code = false; bool __constant_iterators = false; bool __unique_keys = true; std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::const_iterator = std::tr1::__detail::_Hashtable_const_iterator, float>, false, false>; std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::value_type = std::pair, float>]
insert(const_iterator, const value_type& __v)
^~~~~~
/usr/include/c++/7/tr1/hashtable.h:383:7: note: candidate expects 2 arguments, 1 provided
/usr/include/c++/7/tr1/hashtable.h:388:2: note: candidate: template void std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::insert(_InputIterator, _InputIterator) [with _InputIterator = _InputIterator; _Key = std::__cxx11::basic_string; _Value = std::pair, float>; _Allocator = std::allocator, float> >; _ExtractKey = std::_Select1st, float> >; _Equal = std::equal_to >; _H1 = std::tr1::hash >; _H2 = std::tr1::__detail::_Mod_range_hashing; _Hash = std::tr1::__detail::_Default_ranged_hash; _RehashPolicy = std::tr1::__detail::_Prime_rehash_policy; bool __cache_hash_code = false; bool __constant_iterators = false; bool __unique_keys = true]
insert(_InputIterator __first, _InputIterator __last);
^~~~~~
/usr/include/c++/7/tr1/hashtable.h:388:2: note: template argument deduction/substitution failed:
BOG.cpp:128:80: note: candidate expects 2 arguments, 1 provided
MaxSimVal.insert(std::make_pair(mnames[i],Rcpp::as( maxsim[i] )));
^
BOG.cpp:142:73: error: no matching function for call to ‘std::tr1::unordered_map, float>::insert(std::pair, float>)’
InfCon.insert(std::make_pair(inames[i],Rcpp::as( IC[i] )));
^
In file included from /usr/include/c++/7/tr1/unordered_map:41:0,
from BOG.cpp:8:
/usr/include/c++/7/tr1/hashtable.h:374:7: note: candidate: std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::_Insert_Return_Type std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::insert(const value_type&) [with _Key = std::__cxx11::basic_string; _Value = std::pair, float>; _Allocator = std::allocator, float> >; _ExtractKey = std::_Select1st, float> >; _Equal = std::equal_to >; _H1 = std::tr1::hash >; _H2 = std::tr1::__detail::_Mod_range_hashing; _Hash = std::tr1::__detail::_Default_ranged_hash; _RehashPolicy = std::tr1::__detail::_Prime_rehash_policy; bool __cache_hash_code = false; bool __constant_iterators = false; bool __unique_keys = true; std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::_Insert_Return_Type = std::pair, float>, false, false>, bool>; std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::value_type = std::pair, float>]
insert(const value_type& __v)
^~~~~~
/usr/include/c++/7/tr1/hashtable.h:374:7: note: no known conversion for argument 1 from ‘std::pair, float>’ to ‘const value_type& {aka const std::pair, float>&}’
/usr/include/c++/7/tr1/hashtable.h:379:7: note: candidate: std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::iterator std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::insert(std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::iterator, const value_type&) [with _Key = std::__cxx11::basic_string; _Value = std::pair, float>; _Allocator = std::allocator, float> >; _ExtractKey = std::_Select1st, float> >; _Equal = std::equal_to >; _H1 = std::tr1::hash >; _H2 = std::tr1::__detail::_Mod_range_hashing; _Hash = std::tr1::__detail::_Default_ranged_hash; _RehashPolicy = std::tr1::__detail::_Prime_rehash_policy; bool __cache_hash_code = false; bool __constant_iterators = false; bool __unique_keys = true; std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::iterator = std::tr1::__detail::_Hashtable_iterator, float>, false, false>; std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::value_type = std::pair, float>]
insert(iterator, const value_type& __v)
^~~~~~
/usr/include/c++/7/tr1/hashtable.h:379:7: note: candidate expects 2 arguments, 1 provided
/usr/include/c++/7/tr1/hashtable.h:383:7: note: candidate: std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::const_iterator std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::insert(std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::const_iterator, const value_type&) [with _Key = std::__cxx11::basic_string; _Value = std::pair, float>; _Allocator = std::allocator, float> >; _ExtractKey = std::_Select1st, float> >; _Equal = std::equal_to >; _H1 = std::tr1::hash >; _H2 = std::tr1::__detail::_Mod_range_hashing; _Hash = std::tr1::__detail::_Default_ranged_hash; _RehashPolicy = std::tr1::__detail::_Prime_rehash_policy; bool __cache_hash_code = false; bool __constant_iterators = false; bool __unique_keys = true; std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::const_iterator = std::tr1::__detail::_Hashtable_const_iterator, float>, false, false>; std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::value_type = std::pair, float>]
insert(const_iterator, const value_type& __v)
^~~~~~
/usr/include/c++/7/tr1/hashtable.h:383:7: note: candidate expects 2 arguments, 1 provided
/usr/include/c++/7/tr1/hashtable.h:388:2: note: candidate: template void std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::insert(_InputIterator, _InputIterator) [with _InputIterator = _InputIterator; _Key = std::__cxx11::basic_string; _Value = std::pair, float>; _Allocator = std::allocator, float> >; _ExtractKey = std::_Select1st, float> >; _Equal = std::equal_to >; _H1 = std::tr1::hash >; _H2 = std::tr1::__detail::_Mod_range_hashing; _Hash = std::tr1::__detail::_Default_ranged_hash; _RehashPolicy = std::tr1::__detail::_Prime_rehash_policy; bool __cache_hash_code = false; bool __constant_iterators = false; bool __unique_keys = true]
insert(_InputIterator __first, _InputIterator __last);
^~~~~~
/usr/include/c++/7/tr1/hashtable.h:388:2: note: template argument deduction/substitution failed:
BOG.cpp:142:73: note: candidate expects 2 arguments, 1 provided
InfCon.insert(std::make_pair(inames[i],Rcpp::as( IC[i] )));
^
/home/biocbuild/bbs-3.9-bioc/R/etc/Makeconf:176: recipe for target 'BOG.o' failed
make: *** [BOG.o] Error 1
ERROR: compilation failed for package ‘dSimer’
* removing ‘/home/biocbuild/bbs-3.9-bioc/R/library/dSimer’
