Back to Multiple platform build/check report for BioC 3.7
ABCDEFGHIJKLMNOPQ[R]STUVWXYZ

BUILD BIN report for Rtreemix on tokay2

This page was generated on 2018-10-17 08:33:38 -0400 (Wed, 17 Oct 2018).

Package 1296/1561HostnameOS / ArchINSTALLBUILDCHECKBUILD BIN
Rtreemix 1.42.0
Jasmina Bogojeska
Snapshot Date: 2018-10-15 16:45:08 -0400 (Mon, 15 Oct 2018)
URL: https://git.bioconductor.org/packages/Rtreemix
Branch: RELEASE_3_7
Last Commit: b3f3184
Last Changed Date: 2018-04-30 10:35:08 -0400 (Mon, 30 Apr 2018)
malbec2 Linux (Ubuntu 16.04.1 LTS) / x86_64  OK  OK  OK UNNEEDED, same version exists in internal repository
tokay2 Windows Server 2012 R2 Standard / x64  OK  OK  OK [ OK ]UNNEEDED, same version exists in internal repository
merida2 OS X 10.11.6 El Capitan / x86_64  OK  OK  OK  OK UNNEEDED, same version exists in internal repository

Summary

Package: Rtreemix
Version: 1.42.0
Command: rm -rf Rtreemix.buildbin-libdir && mkdir Rtreemix.buildbin-libdir && C:\Users\biocbuild\bbs-3.7-bioc\R\bin\R.exe CMD INSTALL --merge-multiarch --build --library=Rtreemix.buildbin-libdir Rtreemix_1.42.0.tar.gz
StartedAt: 2018-10-17 06:56:22 -0400 (Wed, 17 Oct 2018)
EndedAt: 2018-10-17 06:57:42 -0400 (Wed, 17 Oct 2018)
EllapsedTime: 79.4 seconds
RetCode: 0
Status:  OK  
PackageFile: Rtreemix_1.42.0.zip
PackageFileSize: 1.461 MiB

Command output

##############################################################################
##############################################################################
###
### Running command:
###
###   rm -rf Rtreemix.buildbin-libdir && mkdir Rtreemix.buildbin-libdir && C:\Users\biocbuild\bbs-3.7-bioc\R\bin\R.exe CMD INSTALL --merge-multiarch --build --library=Rtreemix.buildbin-libdir Rtreemix_1.42.0.tar.gz
###
##############################################################################
##############################################################################



install for i386

* installing *source* package 'Rtreemix' ...
** libs
C:/Rtools/mingw_32/bin/g++  -I"C:/Users/BIOCBU˜1/BBS-3˜1.7-B/R/include" -DNDEBUG     -I"C:/extsoft/include"     -O2 -Wall  -mtune=generic -c Rtreemix.cc -o Rtreemix.o
In file included from include/replaceleda.hh:7:0,
                 from include/max_weight_branch.h:25,
                 from include/mtree.h:14,
                 from include/mtreemix.h:14,
                 from Rtreemix.cc:3:
Rtreemix.cc: In function 'SEXPREC* R_fit(SEXP, SEXP, SEXP, SEXP, SEXP, SEXP, SEXP, SEXP)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
Rtreemix.cc:596:7: note: in expansion of macro 'forall_nodes'
       forall_nodes (n, G[k]) {    
       ^
Rtreemix.cc: In function 'SEXPREC* R_fit1(SEXP, SEXP, SEXP, SEXP)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
Rtreemix.cc:938:7: note: in expansion of macro 'forall_nodes'
       forall_nodes (n, G[k]) {    
       ^
Rtreemix.cc: In function 'SEXPREC* R_fit0(SEXP, SEXP, SEXP, SEXP)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
Rtreemix.cc:1281:7: note: in expansion of macro 'forall_nodes'
       forall_nodes (n, G[k]) {    
       ^
Rtreemix.cc: In function 'SEXPREC* R_bootstrap(SEXP, SEXP, SEXP, SEXP, SEXP, SEXP, SEXP, SEXP, SEXP, SEXP)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
Rtreemix.cc:1728:7: note: in expansion of macro 'forall_nodes'
       forall_nodes (n, G[k]) {    
       ^
Rtreemix.cc: In function 'SEXPREC* R_random(SEXP, SEXP, SEXP, SEXP, SEXP, SEXP, SEXP)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
Rtreemix.cc:2629:7: note: in expansion of macro 'forall_nodes'
       forall_nodes (n, G[k]) {    
       ^
C:/Rtools/mingw_32/bin/g++  -I"C:/Users/BIOCBU˜1/BBS-3˜1.7-B/R/include" -DNDEBUG     -I"C:/extsoft/include"     -O2 -Wall  -mtune=generic -c Rtreemix_patch.cc -o Rtreemix_patch.o
C:/Rtools/mingw_32/bin/g++  -I"C:/Users/BIOCBU˜1/BBS-3˜1.7-B/R/include" -DNDEBUG     -I"C:/extsoft/include"     -O2 -Wall  -mtune=generic -c WrapGraph.cc -o WrapGraph.o
C:/Rtools/mingw_32/bin/g++  -I"C:/Users/BIOCBU˜1/BBS-3˜1.7-B/R/include" -DNDEBUG     -I"C:/extsoft/include"     -O2 -Wall  -mtune=generic -c cfunctions.cc -o cfunctions.o
C:/Rtools/mingw_32/bin/g++  -I"C:/Users/BIOCBU˜1/BBS-3˜1.7-B/R/include" -DNDEBUG     -I"C:/extsoft/include"     -O2 -Wall  -mtune=generic -c kmeans.cc -o kmeans.o
C:/Rtools/mingw_32/bin/g++  -I"C:/Users/BIOCBU˜1/BBS-3˜1.7-B/R/include" -DNDEBUG     -I"C:/extsoft/include"     -O2 -Wall  -mtune=generic -c max_weight_branch.cc -o max_weight_branch.o
In file included from include/replaceleda.hh:7:0,
                 from include/max_weight_branch.h:25,
                 from max_weight_branch.cc:11:
max_weight_branch.cc: In function 'void DOT(replaceleda::graph&, replaceleda::map<replaceleda::RefCountPtr<replaceleda::Node>, std::basic_string<char> >&, replaceleda::map<replaceleda::RefCountPtr<replaceleda::Edge>, double>&, char*)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
max_weight_branch.cc:97:3: note: in expansion of macro 'forall_nodes'
   forall_nodes(v, G)
   ^
max_weight_branch.cc: In function 'replaceleda::list<replaceleda::RefCountPtr<replaceleda::Edge> > max_weight_subgraph_indeg_le_1(replaceleda::graph&)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
max_weight_branch.cc:142:3: note: in expansion of macro 'forall_nodes'
   forall_nodes(v, G)  // choose heaviest inedge
   ^
max_weight_branch.cc: In function 'void contract_all_cycles(replaceleda::graph&, int, replaceleda::array<replaceleda::list<replaceleda::RefCountPtr<replaceleda::Edge> > >, replaceleda::GRAPH<replaceleda::RefCountPtr<replaceleda::Node>, replaceleda::RefCountPtr<replaceleda::Edge> >&)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
max_weight_branch.cc:341:3: note: in expansion of macro 'forall_nodes'
   forall_nodes(v, G)
   ^
max_weight_branch.cc: In function 'replaceleda::list<replaceleda::RefCountPtr<replaceleda::Edge> > MAX_WEIGHT_BRANCHING(replaceleda::graph&, replaceleda::map<replaceleda::RefCountPtr<replaceleda::Node>, std::basic_string<char> >&, replaceleda::edge_array<double>&)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
max_weight_branch.cc:432:3: note: in expansion of macro 'forall_nodes'
   forall_nodes(v, G[0])  // node labels
   ^
C:/Rtools/mingw_32/bin/g++  -I"C:/Users/BIOCBU˜1/BBS-3˜1.7-B/R/include" -DNDEBUG     -I"C:/extsoft/include"     -O2 -Wall  -mtune=generic -c mtree.cc -o mtree.o
In file included from include/replaceleda.hh:7:0,
                 from include/max_weight_branch.h:25,
                 from include/mtree.h:14,
                 from mtree.cc:12:
mtree.cc: In function 'void mgraph_init(replaceleda::array<std::basic_string<char> >&, replaceleda::graph&, replaceleda::map<replaceleda::RefCountPtr<replaceleda::Node>, std::basic_string<char> >&, replaceleda::edge_array<double>&, replaceleda::map<int, replaceleda::RefCountPtr<replaceleda::Node> >&)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
mtree.cc:185:3: note: in expansion of macro 'forall_nodes'
   forall_nodes(v, G)
   ^
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
mtree.cc:186:5: note: in expansion of macro 'forall_nodes'
     forall_nodes(w, G)
     ^
mtree.cc: In function 'replaceleda::list<replaceleda::RefCountPtr<replaceleda::Edge> > mtree_bfs(replaceleda::graph&, replaceleda::node&)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
mtree.cc:272:3: note: in expansion of macro 'forall_nodes'
   forall_nodes(w, G)
   ^
mtree.cc: In function 'double mtree_like(replaceleda::integer_vector&, replaceleda::graph&, replaceleda::map<int, replaceleda::RefCountPtr<replaceleda::Node> >&, replaceleda::map<replaceleda::RefCountPtr<replaceleda::Edge>, double>&)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
mtree.cc:321:3: note: in expansion of macro 'forall_nodes'
   forall_nodes(w, G)
   ^
mtree.cc: In function 'replaceleda::integer_vector mtree_draw(int, replaceleda::graph&, replaceleda::node&, replaceleda::map<replaceleda::RefCountPtr<replaceleda::Edge>, double>&, replaceleda::map<replaceleda::RefCountPtr<replaceleda::Node>, int>&)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
mtree.cc:444:3: note: in expansion of macro 'forall_nodes'
   forall_nodes(w, G)
   ^
mtree.cc: In function 'void mtree_directed(replaceleda::graph&, replaceleda::node&, replaceleda::map<replaceleda::RefCountPtr<replaceleda::Edge>, double>&, double, double)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
mtree.cc:784:3: note: in expansion of macro 'forall_nodes'
   forall_nodes(w, G)
   ^
C:/Rtools/mingw_32/bin/g++  -I"C:/Users/BIOCBU˜1/BBS-3˜1.7-B/R/include" -DNDEBUG     -I"C:/extsoft/include"     -O2 -Wall  -mtune=generic -c mtreemix.cc -o mtreemix.o
In file included from include/replaceleda.hh:7:0,
                 from include/max_weight_branch.h:25,
                 from include/mtree.h:14,
                 from mtreemix.cc:11:
mtreemix.cc: In function 'double mtree_state(replaceleda::map<replaceleda::RefCountPtr<replaceleda::Edge>, int>&, replaceleda::integer_vector&, replaceleda::graph&, replaceleda::map<int, replaceleda::RefCountPtr<replaceleda::Node> >&, replaceleda::map<replaceleda::RefCountPtr<replaceleda::Edge>, double>&)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
mtreemix.cc:1035:3: note: in expansion of macro 'forall_nodes'
   forall_nodes(w, G)
   ^
C:/Rtools/mingw_32/bin/g++  -I"C:/Users/BIOCBU˜1/BBS-3˜1.7-B/R/include" -DNDEBUG     -I"C:/extsoft/include"     -O2 -Wall  -mtune=generic -c replaceleda.cc -o replaceleda.o
In file included from include/replaceleda.hh:7:0,
                 from replaceleda.cc:2:
replaceleda.cc: In function 'bool replaceleda::Is_Acyclic(replaceleda::graph&, replaceleda::list<replaceleda::RefCountPtr<replaceleda::Edge> >&)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
replaceleda.cc:81:5: note: in expansion of macro 'forall_nodes'
     forall_nodes(v,G)
     ^
replaceleda.cc: In function 'void replaceleda::CopyGraph(replaceleda::graph&, replaceleda::graph&)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
replaceleda.cc:128:5: note: in expansion of macro 'forall_nodes'
     forall_nodes(v, g_source){
     ^
replaceleda.cc: In function 'void replaceleda::CopyGraph(replaceleda::GRAPH<replaceleda::RefCountPtr<replaceleda::Node>, replaceleda::RefCountPtr<replaceleda::Edge> >&, replaceleda::graph&)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
replaceleda.cc:149:5: note: in expansion of macro 'forall_nodes'
     forall_nodes(v, g_source){
     ^
replaceleda.cc: In function 'std::ostream& replaceleda::operator<<(std::ostream&, replaceleda::graph&)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
replaceleda.cc:352:5: note: in expansion of macro 'forall_nodes'
     forall_nodes(v, g){
     ^
replaceleda.cc: In function 'void replaceleda::printGraph(replaceleda::graph&, replaceleda::edge_array<double>&)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
replaceleda.cc:373:5: note: in expansion of macro 'forall_nodes'
     forall_nodes(v, g){
     ^
C:/Rtools/mingw_32/bin/g++ -shared -s -static-libgcc -o Rtreemix.dll tmp.def Rtreemix.o Rtreemix_patch.o WrapGraph.o cfunctions.o kmeans.o max_weight_branch.o mtree.o mtreemix.o replaceleda.o -lm -LC:/extsoft/lib/i386 -LC:/extsoft/lib -LC:/Users/BIOCBU˜1/BBS-3˜1.7-B/R/bin/i386 -lR
installing to C:/Users/biocbuild/bbs-3.7-bioc/meat/Rtreemix.buildbin-libdir/Rtreemix/libs/i386
** R
** data
** inst
** byte-compile and prepare package for lazy loading
** help
*** installing help indices
  converting help for package 'Rtreemix'
    finding HTML links ... done
    L1.dist                                 html  
    L2.norm                                 html  
    Pval.dist                               html  
    RtreemixData-class                      html  
    RtreemixGPS-class                       html  
    RtreemixModel-class                     html  
    RtreemixSim-class                       html  
    RtreemixStats-class                     html  
    bootstrap-methods                       html  
    comp.models                             html  
    comp.trees                              html  
    confIntGPS-methods                      html  
    distribution-methods                    html  
    fit-methods                             html  
    generate-methods                        html  
    get.tree.levels                         html  
    gps-methods                             html  
    hiv.data                                html  
    kullback.leibler                        html  
    likelihoods-methods                     html  
    sim-methods                             html  
    stability.sim                           html  
** building package indices
** installing vignettes
** testing if installed package can be loaded
In R CMD INSTALL

install for x64

* installing *source* package 'Rtreemix' ...
** libs
C:/Rtools/mingw_64/bin/g++  -I"C:/Users/BIOCBU˜1/BBS-3˜1.7-B/R/include" -DNDEBUG     -I"C:/extsoft/include"     -O2 -Wall  -mtune=generic -c Rtreemix.cc -o Rtreemix.o
In file included from include/replaceleda.hh:7:0,
                 from include/max_weight_branch.h:25,
                 from include/mtree.h:14,
                 from include/mtreemix.h:14,
                 from Rtreemix.cc:3:
Rtreemix.cc: In function 'SEXPREC* R_fit(SEXP, SEXP, SEXP, SEXP, SEXP, SEXP, SEXP, SEXP)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
Rtreemix.cc:596:7: note: in expansion of macro 'forall_nodes'
       forall_nodes (n, G[k]) {    
       ^
Rtreemix.cc: In function 'SEXPREC* R_fit1(SEXP, SEXP, SEXP, SEXP)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
Rtreemix.cc:938:7: note: in expansion of macro 'forall_nodes'
       forall_nodes (n, G[k]) {    
       ^
Rtreemix.cc: In function 'SEXPREC* R_fit0(SEXP, SEXP, SEXP, SEXP)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
Rtreemix.cc:1281:7: note: in expansion of macro 'forall_nodes'
       forall_nodes (n, G[k]) {    
       ^
Rtreemix.cc: In function 'SEXPREC* R_bootstrap(SEXP, SEXP, SEXP, SEXP, SEXP, SEXP, SEXP, SEXP, SEXP, SEXP)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
Rtreemix.cc:1728:7: note: in expansion of macro 'forall_nodes'
       forall_nodes (n, G[k]) {    
       ^
Rtreemix.cc: In function 'SEXPREC* R_random(SEXP, SEXP, SEXP, SEXP, SEXP, SEXP, SEXP)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
Rtreemix.cc:2629:7: note: in expansion of macro 'forall_nodes'
       forall_nodes (n, G[k]) {    
       ^
C:/Rtools/mingw_64/bin/g++  -I"C:/Users/BIOCBU˜1/BBS-3˜1.7-B/R/include" -DNDEBUG     -I"C:/extsoft/include"     -O2 -Wall  -mtune=generic -c Rtreemix_patch.cc -o Rtreemix_patch.o
C:/Rtools/mingw_64/bin/g++  -I"C:/Users/BIOCBU˜1/BBS-3˜1.7-B/R/include" -DNDEBUG     -I"C:/extsoft/include"     -O2 -Wall  -mtune=generic -c WrapGraph.cc -o WrapGraph.o
C:/Rtools/mingw_64/bin/g++  -I"C:/Users/BIOCBU˜1/BBS-3˜1.7-B/R/include" -DNDEBUG     -I"C:/extsoft/include"     -O2 -Wall  -mtune=generic -c cfunctions.cc -o cfunctions.o
C:/Rtools/mingw_64/bin/g++  -I"C:/Users/BIOCBU˜1/BBS-3˜1.7-B/R/include" -DNDEBUG     -I"C:/extsoft/include"     -O2 -Wall  -mtune=generic -c kmeans.cc -o kmeans.o
C:/Rtools/mingw_64/bin/g++  -I"C:/Users/BIOCBU˜1/BBS-3˜1.7-B/R/include" -DNDEBUG     -I"C:/extsoft/include"     -O2 -Wall  -mtune=generic -c max_weight_branch.cc -o max_weight_branch.o
In file included from include/replaceleda.hh:7:0,
                 from include/max_weight_branch.h:25,
                 from max_weight_branch.cc:11:
max_weight_branch.cc: In function 'void DOT(replaceleda::graph&, replaceleda::map<replaceleda::RefCountPtr<replaceleda::Node>, std::basic_string<char> >&, replaceleda::map<replaceleda::RefCountPtr<replaceleda::Edge>, double>&, char*)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
max_weight_branch.cc:97:3: note: in expansion of macro 'forall_nodes'
   forall_nodes(v, G)
   ^
max_weight_branch.cc: In function 'replaceleda::list<replaceleda::RefCountPtr<replaceleda::Edge> > max_weight_subgraph_indeg_le_1(replaceleda::graph&)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
max_weight_branch.cc:142:3: note: in expansion of macro 'forall_nodes'
   forall_nodes(v, G)  // choose heaviest inedge
   ^
max_weight_branch.cc: In function 'void contract_all_cycles(replaceleda::graph&, int, replaceleda::array<replaceleda::list<replaceleda::RefCountPtr<replaceleda::Edge> > >, replaceleda::GRAPH<replaceleda::RefCountPtr<replaceleda::Node>, replaceleda::RefCountPtr<replaceleda::Edge> >&)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
max_weight_branch.cc:341:3: note: in expansion of macro 'forall_nodes'
   forall_nodes(v, G)
   ^
max_weight_branch.cc: In function 'replaceleda::list<replaceleda::RefCountPtr<replaceleda::Edge> > MAX_WEIGHT_BRANCHING(replaceleda::graph&, replaceleda::map<replaceleda::RefCountPtr<replaceleda::Node>, std::basic_string<char> >&, replaceleda::edge_array<double>&)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
max_weight_branch.cc:432:3: note: in expansion of macro 'forall_nodes'
   forall_nodes(v, G[0])  // node labels
   ^
C:/Rtools/mingw_64/bin/g++  -I"C:/Users/BIOCBU˜1/BBS-3˜1.7-B/R/include" -DNDEBUG     -I"C:/extsoft/include"     -O2 -Wall  -mtune=generic -c mtree.cc -o mtree.o
In file included from include/replaceleda.hh:7:0,
                 from include/max_weight_branch.h:25,
                 from include/mtree.h:14,
                 from mtree.cc:12:
mtree.cc: In function 'void mgraph_init(replaceleda::array<std::basic_string<char> >&, replaceleda::graph&, replaceleda::map<replaceleda::RefCountPtr<replaceleda::Node>, std::basic_string<char> >&, replaceleda::edge_array<double>&, replaceleda::map<int, replaceleda::RefCountPtr<replaceleda::Node> >&)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
mtree.cc:185:3: note: in expansion of macro 'forall_nodes'
   forall_nodes(v, G)
   ^
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
mtree.cc:186:5: note: in expansion of macro 'forall_nodes'
     forall_nodes(w, G)
     ^
mtree.cc: In function 'replaceleda::list<replaceleda::RefCountPtr<replaceleda::Edge> > mtree_bfs(replaceleda::graph&, replaceleda::node&)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
mtree.cc:272:3: note: in expansion of macro 'forall_nodes'
   forall_nodes(w, G)
   ^
mtree.cc: In function 'double mtree_like(replaceleda::integer_vector&, replaceleda::graph&, replaceleda::map<int, replaceleda::RefCountPtr<replaceleda::Node> >&, replaceleda::map<replaceleda::RefCountPtr<replaceleda::Edge>, double>&)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
mtree.cc:321:3: note: in expansion of macro 'forall_nodes'
   forall_nodes(w, G)
   ^
mtree.cc: In function 'replaceleda::integer_vector mtree_draw(int, replaceleda::graph&, replaceleda::node&, replaceleda::map<replaceleda::RefCountPtr<replaceleda::Edge>, double>&, replaceleda::map<replaceleda::RefCountPtr<replaceleda::Node>, int>&)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
mtree.cc:444:3: note: in expansion of macro 'forall_nodes'
   forall_nodes(w, G)
   ^
mtree.cc: In function 'void mtree_directed(replaceleda::graph&, replaceleda::node&, replaceleda::map<replaceleda::RefCountPtr<replaceleda::Edge>, double>&, double, double)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
mtree.cc:784:3: note: in expansion of macro 'forall_nodes'
   forall_nodes(w, G)
   ^
C:/Rtools/mingw_64/bin/g++  -I"C:/Users/BIOCBU˜1/BBS-3˜1.7-B/R/include" -DNDEBUG     -I"C:/extsoft/include"     -O2 -Wall  -mtune=generic -c mtreemix.cc -o mtreemix.o
In file included from include/replaceleda.hh:7:0,
                 from include/max_weight_branch.h:25,
                 from include/mtree.h:14,
                 from mtreemix.cc:11:
mtreemix.cc: In function 'double mtree_state(replaceleda::map<replaceleda::RefCountPtr<replaceleda::Edge>, int>&, replaceleda::integer_vector&, replaceleda::graph&, replaceleda::map<int, replaceleda::RefCountPtr<replaceleda::Node> >&, replaceleda::map<replaceleda::RefCountPtr<replaceleda::Edge>, double>&)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
mtreemix.cc:1035:3: note: in expansion of macro 'forall_nodes'
   forall_nodes(w, G)
   ^
C:/Rtools/mingw_64/bin/g++  -I"C:/Users/BIOCBU˜1/BBS-3˜1.7-B/R/include" -DNDEBUG     -I"C:/extsoft/include"     -O2 -Wall  -mtune=generic -c replaceleda.cc -o replaceleda.o
In file included from include/replaceleda.hh:7:0,
                 from replaceleda.cc:2:
replaceleda.cc: In function 'bool replaceleda::Is_Acyclic(replaceleda::graph&, replaceleda::list<replaceleda::RefCountPtr<replaceleda::Edge> >&)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
replaceleda.cc:81:5: note: in expansion of macro 'forall_nodes'
     forall_nodes(v,G)
     ^
replaceleda.cc: In function 'void replaceleda::CopyGraph(replaceleda::graph&, replaceleda::graph&)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
replaceleda.cc:128:5: note: in expansion of macro 'forall_nodes'
     forall_nodes(v, g_source){
     ^
replaceleda.cc: In function 'void replaceleda::CopyGraph(replaceleda::GRAPH<replaceleda::RefCountPtr<replaceleda::Node>, replaceleda::RefCountPtr<replaceleda::Edge> >&, replaceleda::graph&)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
replaceleda.cc:149:5: note: in expansion of macro 'forall_nodes'
     forall_nodes(v, g_source){
     ^
replaceleda.cc: In function 'std::ostream& replaceleda::operator<<(std::ostream&, replaceleda::graph&)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
replaceleda.cc:352:5: note: in expansion of macro 'forall_nodes'
     forall_nodes(v, g){
     ^
replaceleda.cc: In function 'void replaceleda::printGraph(replaceleda::graph&, replaceleda::edge_array<double>&)':
include/Graph.hh:16:55: warning: value computed is not used [-Wunused-value]
 #define forall_nodes(n,G) for(uint icount = 0; icount < G.number_of_nodes() ,  n = G.getNode(icount);++icount)
                                                       ^
replaceleda.cc:373:5: note: in expansion of macro 'forall_nodes'
     forall_nodes(v, g){
     ^
C:/Rtools/mingw_64/bin/g++ -shared -s -static-libgcc -o Rtreemix.dll tmp.def Rtreemix.o Rtreemix_patch.o WrapGraph.o cfunctions.o kmeans.o max_weight_branch.o mtree.o mtreemix.o replaceleda.o -lm -LC:/extsoft/lib/x64 -LC:/extsoft/lib -LC:/Users/BIOCBU˜1/BBS-3˜1.7-B/R/bin/x64 -lR
installing to C:/Users/biocbuild/bbs-3.7-bioc/meat/Rtreemix.buildbin-libdir/Rtreemix/libs/x64
** testing if installed package can be loaded
* MD5 sums
packaged installation of 'Rtreemix' as Rtreemix_1.42.0.zip
* DONE (Rtreemix)
In R CMD INSTALL
In R CMD INSTALL