* installing to library ‘/home/hornik/tmp/R.check/r-patched-gcc/Work/build/Packages’
* installing *source* package ‘rlemon’ ...
** package ‘rlemon’ successfully unpacked and MD5 sums checked
** using staged installation
** libs
using C++ compiler: ‘g++-14 (Debian 14.2.0-3) 14.2.0’
make[1]: Entering directory '/home/hornik/tmp/scratch/RtmpxnsCVv/R.INSTALLf879751c77734/rlemon/src'
g++-14 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-patched-gcc/Work/build/include" -DNDEBUG -I../inst -I'/home/hornik/tmp/R.check/r-patched-gcc/Work/build/Packages/Rcpp/include' -I/usr/local/include -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c RInterfaces.cpp -o RInterfaces.o
In file included from /usr/include/x86_64-linux-gnu/c++/14/bits/c++allocator.h:33,
from /usr/include/c++/14/bits/allocator.h:46,
from /usr/include/c++/14/bits/alloc_traits.h:39,
from /usr/include/c++/14/ext/alloc_traits.h:34,
from /usr/include/c++/14/bits/hashtable_policy.h:39,
from /usr/include/c++/14/bits/hashtable.h:35,
from /usr/include/c++/14/bits/unordered_map.h:33,
from /usr/include/c++/14/unordered_map:41,
from /home/hornik/tmp/R.check/r-patched-gcc/Work/build/Packages/Rcpp/include/Rcpp/platform/compiler.h:153,
from /home/hornik/tmp/R.check/r-patched-gcc/Work/build/Packages/Rcpp/include/Rcpp/r/headers.h:66,
from /home/hornik/tmp/R.check/r-patched-gcc/Work/build/Packages/Rcpp/include/RcppCommon.h:30,
from /home/hornik/tmp/R.check/r-patched-gcc/Work/build/Packages/Rcpp/include/Rcpp.h:27,
from approximation.h:1,
from RInterfaces.cpp:1:
In member function ‘void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartEdgeSetBase<lemon::ListGraph>::ArcT; _Args = {lemon::SmartEdgeSetBase<lemon::ListGraph>::ArcT}; _Tp = lemon::SmartEdgeSetBase<lemon::ListGraph>::ArcT]’,
inlined from ‘static void std::allocator_traits<std::allocator<_Tp1> >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartEdgeSetBase<lemon::ListGraph>::ArcT; _Args = {lemon::SmartEdgeSetBase<lemon::ListGraph>::ArcT}; _Tp = lemon::SmartEdgeSetBase<lemon::ListGraph>::ArcT]’ at /usr/include/c++/14/bits/alloc_traits.h:534:17,
inlined from ‘std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartEdgeSetBase<lemon::ListGraph>::ArcT}; _Tp = lemon::SmartEdgeSetBase<lemon::ListGraph>::ArcT; _Alloc = std::allocator<lemon::SmartEdgeSetBase<lemon::ListGraph>::ArcT>]’ at /usr/include/c++/14/bits/vector.tcc:117:30,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartEdgeSetBase<lemon::ListGraph>::ArcT; _Alloc = std::allocator<lemon::SmartEdgeSetBase<lemon::ListGraph>::ArcT>]’ at /usr/include/c++/14/bits/stl_vector.h:1301:21,
inlined from ‘lemon::SmartEdgeSetBase<GR>::Edge lemon::SmartEdgeSetBase<GR>::addEdge(const Node&, const Node&) [with GR = lemon::ListGraph]’ at ../inst/lemon/edge_set.h:1144:21,
inlined from ‘lemon::EdgeSetExtender<Base>::Edge lemon::EdgeSetExtender<Base>::addEdge(const Node&, const Node&) [with Base = lemon::SmartEdgeSetBase<lemon::ListGraph>]’ at ../inst/lemon/bits/edge_set_extender.h:588:34:
/usr/include/c++/14/bits/new_allocator.h:191:11: warning: ‘<anonymous>’ may be used uninitialized [-Wmaybe-uninitialized]
191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); }
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from ../inst/lemon/planarity.h:36,
from planarity_embedding.h:1,
from RInterfaces.cpp:11:
../inst/lemon/edge_set.h: In member function ‘lemon::EdgeSetExtender<Base>::Edge lemon::EdgeSetExtender<Base>::addEdge(const Node&, const Node&) [with Base = lemon::SmartEdgeSetBase<lemon::ListGraph>]’:
../inst/lemon/edge_set.h:1144:22: note: ‘<anonymous>’ declared here
1144 | arcs.push_back(ArcT());
| ^~~~~~
In member function ‘void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartEdgeSetBase<lemon::ListGraph>::ArcT; _Args = {lemon::SmartEdgeSetBase<lemon::ListGraph>::ArcT}; _Tp = lemon::SmartEdgeSetBase<lemon::ListGraph>::ArcT]’,
inlined from ‘static void std::allocator_traits<std::allocator<_Tp1> >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartEdgeSetBase<lemon::ListGraph>::ArcT; _Args = {lemon::SmartEdgeSetBase<lemon::ListGraph>::ArcT}; _Tp = lemon::SmartEdgeSetBase<lemon::ListGraph>::ArcT]’ at /usr/include/c++/14/bits/alloc_traits.h:534:17,
inlined from ‘std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartEdgeSetBase<lemon::ListGraph>::ArcT}; _Tp = lemon::SmartEdgeSetBase<lemon::ListGraph>::ArcT; _Alloc = std::allocator<lemon::SmartEdgeSetBase<lemon::ListGraph>::ArcT>]’ at /usr/include/c++/14/bits/vector.tcc:117:30,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartEdgeSetBase<lemon::ListGraph>::ArcT; _Alloc = std::allocator<lemon::SmartEdgeSetBase<lemon::ListGraph>::ArcT>]’ at /usr/include/c++/14/bits/stl_vector.h:1301:21,
inlined from ‘lemon::SmartEdgeSetBase<GR>::Edge lemon::SmartEdgeSetBase<GR>::addEdge(const Node&, const Node&) [with GR = lemon::ListGraph]’ at ../inst/lemon/edge_set.h:1145:21,
inlined from ‘lemon::EdgeSetExtender<Base>::Edge lemon::EdgeSetExtender<Base>::addEdge(const Node&, const Node&) [with Base = lemon::SmartEdgeSetBase<lemon::ListGraph>]’ at ../inst/lemon/bits/edge_set_extender.h:588:34:
/usr/include/c++/14/bits/new_allocator.h:191:11: warning: ‘<anonymous>’ may be used uninitialized [-Wmaybe-uninitialized]
191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); }
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
../inst/lemon/edge_set.h: In member function ‘lemon::EdgeSetExtender<Base>::Edge lemon::EdgeSetExtender<Base>::addEdge(const Node&, const Node&) [with Base = lemon::SmartEdgeSetBase<lemon::ListGraph>]’:
../inst/lemon/edge_set.h:1145:22: note: ‘<anonymous>’ declared here
1145 | arcs.push_back(ArcT());
| ^~~~~~
g++-14 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-patched-gcc/Work/build/include" -DNDEBUG -I../inst -I'/home/hornik/tmp/R.check/r-patched-gcc/Work/build/Packages/Rcpp/include' -I/usr/local/include -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c RcppExports.cpp -o RcppExports.o
g++-14 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-patched-gcc/Work/build/include" -DNDEBUG -I../inst -I'/home/hornik/tmp/R.check/r-patched-gcc/Work/build/Packages/Rcpp/include' -I/usr/local/include -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c base.cpp -o base.o
g++-14 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-patched-gcc/Work/build/include" -DNDEBUG -I../inst -I'/home/hornik/tmp/R.check/r-patched-gcc/Work/build/Packages/Rcpp/include' -I/usr/local/include -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c random.cpp -o random.o
g++-14 -std=gnu++17 -shared -L/home/hornik/tmp/R.check/r-patched-gcc/Work/build/lib -Wl,-O1 -o rlemon.so RInterfaces.o RcppExports.o base.o random.o -L/home/hornik/tmp/R.check/r-patched-gcc/Work/build/lib -lR
make[1]: Leaving directory '/home/hornik/tmp/scratch/RtmpxnsCVv/R.INSTALLf879751c77734/rlemon/src'
make[1]: Entering directory '/home/hornik/tmp/scratch/RtmpxnsCVv/R.INSTALLf879751c77734/rlemon/src'
make[1]: Leaving directory '/home/hornik/tmp/scratch/RtmpxnsCVv/R.INSTALLf879751c77734/rlemon/src'
installing to /home/hornik/tmp/R.check/r-patched-gcc/Work/build/Packages/00LOCK-rlemon/00new/rlemon/libs
** R
** data
*** moving datasets to lazyload DB
** inst
** byte-compile and prepare package for lazy loading
** help
*** installing help indices
converting help for package ‘rlemon’
finding HTML links ... done
AllPairsMinCut html
CountBiEdgeConnectedComponents html
CountBiNodeConnectedComponents html
CountConnectedComponents html
CountStronglyConnectedComponents html
FindBiEdgeConnectedComponents html
FindBiEdgeConnectedCutEdges html
FindBiNodeConnectedComponents html
FindBiNodeConnectedCutNodes html
FindConnectedComponents html
FindStronglyConnectedComponents html
FindStronglyConnectedCutArcs html
GetAndCheckTopologicalSort html
GetBipartitePartitions html
GetTopologicalSort html
GraphSearch html
IsAcyclic html
IsBiEdgeConnected html
IsBiNodeConnected html
IsBipartite html
IsConnected html
IsDAG html
IsEulerian html
IsLoopFree html
IsParallelFree html
IsSimpleGraph html
IsStronglyConnected html
IsTree html
MaxCardinalityMatching html
MaxCardinalitySearch html
MaxClique html
MaxFlow html
MaxMatching html
MinCostArborescence html
MinCostFlow html
MinCut html
MinMeanCycle html
MinSpanningTree html
NetworkCirculation html
PlanarChecking html
PlanarColoring html
PlanarDrawing html
PlanarEmbedding html
ShortestPath html
ShortestPathFromSource html
TravelingSalesperson html
lemon_runners html
small_graph_example html
** building package indices
** testing if installed package can be loaded from temporary location
** checking absolute paths in shared objects and dynamic libraries
** testing if installed package can be loaded from final location
** testing if installed package keeps a record of temporary installation path
* DONE (rlemon)