Back to the "Multiple platform build/check report" A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q [R] S  T  U  V  W  X  Y  Z 

BioC 3.4: CHECK report for Rtreemix on tokay1

This page was generated on 2017-04-15 16:15:29 -0400 (Sat, 15 Apr 2017).

Package 1095/1296HostnameOS / ArchINSTALLBUILDCHECKBUILD BIN
Rtreemix 1.36.0
Jasmina Bogojeska
Snapshot Date: 2017-04-14 17:17:13 -0400 (Fri, 14 Apr 2017)
URL: https://hedgehog.fhcrc.org/bioconductor/branches/RELEASE_3_4/madman/Rpacks/Rtreemix
Last Changed Rev: 122710 / Revision: 128728
Last Changed Date: 2016-10-17 14:45:06 -0400 (Mon, 17 Oct 2016)
malbec1 Linux (Ubuntu 16.04.1 LTS) / x86_64  NotNeeded  OK  OK UNNEEDED, same version exists in internal repository
tokay1 Windows Server 2012 R2 Standard / x64  NotNeeded  OK [ OK ] OK UNNEEDED, same version exists in internal repository
morelia Mac OS X Mavericks (10.9.5) / x86_64  NotNeeded  OK  OK  OK UNNEEDED, same version exists in internal repository

Summary

Package: Rtreemix
Version: 1.36.0
Command: rm -rf Rtreemix.buildbin-libdir Rtreemix.Rcheck && mkdir Rtreemix.buildbin-libdir Rtreemix.Rcheck && C:\Users\biocbuild\bbs-3.4-bioc\R\bin\R.exe CMD INSTALL --build --merge-multiarch --library=Rtreemix.buildbin-libdir Rtreemix_1.36.0.tar.gz >Rtreemix.Rcheck\00install.out 2>&1 && cp Rtreemix.Rcheck\00install.out Rtreemix-install.out && C:\Users\biocbuild\bbs-3.4-bioc\R\bin\R.exe CMD check --library=Rtreemix.buildbin-libdir --install="check:Rtreemix-install.out" --force-multiarch --no-vignettes --timings Rtreemix_1.36.0.tar.gz
StartedAt: 2017-04-15 00:41:04 -0400 (Sat, 15 Apr 2017)
EndedAt: 2017-04-15 00:43:58 -0400 (Sat, 15 Apr 2017)
EllapsedTime: 174.9 seconds
RetCode: 0
Status:  OK  
CheckDir: Rtreemix.Rcheck
Warnings: 0

Command output

##############################################################################
##############################################################################
###
### Running command:
###
###   rm -rf Rtreemix.buildbin-libdir Rtreemix.Rcheck && mkdir Rtreemix.buildbin-libdir Rtreemix.Rcheck && C:\Users\biocbuild\bbs-3.4-bioc\R\bin\R.exe CMD INSTALL --build --merge-multiarch --library=Rtreemix.buildbin-libdir Rtreemix_1.36.0.tar.gz >Rtreemix.Rcheck\00install.out 2>&1 && cp Rtreemix.Rcheck\00install.out Rtreemix-install.out  && C:\Users\biocbuild\bbs-3.4-bioc\R\bin\R.exe CMD check --library=Rtreemix.buildbin-libdir --install="check:Rtreemix-install.out" --force-multiarch --no-vignettes --timings Rtreemix_1.36.0.tar.gz
###
##############################################################################
##############################################################################


* using log directory 'C:/Users/biocbuild/bbs-3.4-bioc/meat/Rtreemix.Rcheck'
* using R version 3.3.3 (2017-03-06)
* using platform: x86_64-w64-mingw32 (64-bit)
* using session charset: ISO8859-1
* using option '--no-vignettes'
* checking for file 'Rtreemix/DESCRIPTION' ... OK
* checking extension type ... Package
* this is package 'Rtreemix' version '1.36.0'
* checking package namespace information ... OK
* checking package dependencies ... OK
* checking if this is a source package ... OK
* checking if there is a namespace ... OK
* checking for hidden files and directories ... OK
* checking for portable file names ... OK
* checking whether package 'Rtreemix' can be installed ... OK
* checking installed package size ... OK
* checking package directory ... OK
* checking 'build' directory ... OK
* checking DESCRIPTION meta-information ... NOTE
Malformed Title field: should not end in a period.
* checking top-level files ... OK
* checking for left-over files ... OK
* checking index information ... OK
* checking package subdirectories ... OK
* checking R files for non-ASCII characters ... OK
* checking R files for syntax errors ... OK
* loading checks for arch 'i386'
** checking whether the package can be loaded ... OK
** checking whether the package can be loaded with stated dependencies ... OK
** checking whether the package can be unloaded cleanly ... OK
** checking whether the namespace can be loaded with stated dependencies ... OK
** checking whether the namespace can be unloaded cleanly ... OK
** checking loading without being on the library search path ... OK
* loading checks for arch 'x64'
** checking whether the package can be loaded ... OK
** checking whether the package can be loaded with stated dependencies ... OK
** checking whether the package can be unloaded cleanly ... OK
** checking whether the namespace can be loaded with stated dependencies ... OK
** checking whether the namespace can be unloaded cleanly ... OK
** checking loading without being on the library search path ... OK
* checking dependencies in R code ... OK
* checking S3 generic/method consistency ... OK
* checking replacement functions ... OK
* checking foreign function calls ... OK
* checking R code for possible problems ... NOTE
.plott1: no visible binding for global variable 'drawAgNode'
.plott1: no visible global function definition for 'plot.new'
.plott1: no visible global function definition for 'par'
.plott1: no visible global function definition for 'upRight'
.plott1: no visible global function definition for 'boundBox'
.plott1: no visible global function definition for 'plot.window'
.plott1: no visible global function definition for 'getX'
.plott1: no visible global function definition for 'getY'
.plott1: no visible global function definition for 'box'
.plott1: no visible global function definition for 'xy.coords'
.plott1: no visible global function definition for 'getDefaultAttrs'
.plott1: no visible global function definition for 'plot.xy'
.plott1: no visible global function definition for 'title'
.plott1: no visible global function definition for 'AgNode'
.plott1 : <anonymous>: no visible global function definition for
  'getNodeRW'
.plott1 : <anonymous>: no visible global function definition for
  'getNodeLW'
.plott1 : <anonymous>: no visible global function definition for
  'getNodeHeight'
.plott1 : <anonymous>: no visible global function definition for
  'labelText'
.plott1 : <anonymous>: no visible global function definition for
  'txtLabel'
.plott1 : <anonymous>: no visible global function definition for
  'strwidth'
.plott1 : <anonymous>: no visible global function definition for
  'strheight'
.plott1 : <anonymous>: no visible global function definition for
  'labelFontsize'
.plott1: no visible global function definition for 'AgEdge'
.plott1: no visible binding for global variable 'lines'
.plott2: no visible global function definition for 'getDefaultAttrs'
.plott2: no visible global function definition for 'removedEdges'
.plott2: no visible global function definition for 'agopen'
plot,RtreemixModel-missing: no visible global function definition for
  'par'
Undefined global functions or variables:
  AgEdge AgNode agopen boundBox box drawAgNode getDefaultAttrs
  getNodeHeight getNodeLW getNodeRW getX getY labelFontsize labelText
  lines par plot.new plot.window plot.xy removedEdges strheight
  strwidth title txtLabel upRight xy.coords
Consider adding
  importFrom("grDevices", "xy.coords")
  importFrom("graphics", "box", "lines", "par", "plot.new",
             "plot.window", "plot.xy", "strheight", "strwidth", "title")
to your NAMESPACE file.
* checking Rd files ... OK
* checking Rd metadata ... OK
* checking Rd cross-references ... OK
* checking for missing documentation entries ... OK
* checking for code/documentation mismatches ... OK
* checking Rd \usage sections ... OK
* checking Rd contents ... OK
* checking for unstated dependencies in examples ... OK
* checking contents of 'data' directory ... OK
* checking data for non-ASCII characters ... OK
* checking data for ASCII and uncompressed saves ... OK
* checking line endings in C/C++/Fortran sources/headers ... OK
* checking line endings in Makefiles ... OK
* checking compilation flags in Makevars ... OK
* checking for GNU extensions in Makefiles ... OK
* checking for portable use of $(BLAS_LIBS) and $(LAPACK_LIBS) ... OK
* checking compiled code ... NOTE
Note: information on .o files for i386 is not available
Note: information on .o files for x64 is not available
File 'C:/Users/biocbuild/bbs-3.4-bioc/meat/Rtreemix.buildbin-libdir/Rtreemix/libs/i386/Rtreemix.dll':
  Found 'abort', possibly from 'abort' (C), 'runtime' (Fortran)
  Found 'exit', possibly from 'exit' (C), 'stop' (Fortran)
  Found 'printf', possibly from 'printf' (C)
  Found 'rand', possibly from 'rand' (C)
  Found 'srand', possibly from 'srand' (C)

Compiled code should not call entry points which might terminate R nor
write to stdout/stderr instead of to the console, nor the system RNG.
The detected symbols are linked into the code but might come from
libraries and not actually be called.

See 'Writing portable packages' in the 'Writing R Extensions' manual.
* checking installed files from 'inst/doc' ... OK
* checking files in 'vignettes' ... OK
* checking examples ...
** running examples for arch 'i386' ... OK
** running examples for arch 'x64' ... OK
* checking for unstated dependencies in vignettes ... OK
* checking package vignettes in 'inst/doc' ... OK
* checking running R code from vignettes ... SKIPPED
* checking re-building of vignette outputs ... SKIPPED
* checking PDF version of manual ... OK
* DONE

Status: 3 NOTEs
See
  'C:/Users/biocbuild/bbs-3.4-bioc/meat/Rtreemix.Rcheck/00check.log'
for details.

Rtreemix.Rcheck/00install.out:


install for i386

* installing *source* package 'Rtreemix' ...
** libs
C:/Rtools/mingw_32/bin/g++  -I"C:/Users/BIOCBU˜1/BBS-3˜1.4-B/R/include" -DNDEBUG     -I"C:/local323/include"     -O2 -Wall  -mtune=core2 -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.4-B/R/include" -DNDEBUG     -I"C:/local323/include"     -O2 -Wall  -mtune=core2 -c Rtreemix_patch.cc -o Rtreemix_patch.o
C:/Rtools/mingw_32/bin/g++  -I"C:/Users/BIOCBU˜1/BBS-3˜1.4-B/R/include" -DNDEBUG     -I"C:/local323/include"     -O2 -Wall  -mtune=core2 -c WrapGraph.cc -o WrapGraph.o
C:/Rtools/mingw_32/bin/g++  -I"C:/Users/BIOCBU˜1/BBS-3˜1.4-B/R/include" -DNDEBUG     -I"C:/local323/include"     -O2 -Wall  -mtune=core2 -c cfunctions.cc -o cfunctions.o
C:/Rtools/mingw_32/bin/g++  -I"C:/Users/BIOCBU˜1/BBS-3˜1.4-B/R/include" -DNDEBUG     -I"C:/local323/include"     -O2 -Wall  -mtune=core2 -c kmeans.cc -o kmeans.o
C:/Rtools/mingw_32/bin/g++  -I"C:/Users/BIOCBU˜1/BBS-3˜1.4-B/R/include" -DNDEBUG     -I"C:/local323/include"     -O2 -Wall  -mtune=core2 -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.4-B/R/include" -DNDEBUG     -I"C:/local323/include"     -O2 -Wall  -mtune=core2 -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.4-B/R/include" -DNDEBUG     -I"C:/local323/include"     -O2 -Wall  -mtune=core2 -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.4-B/R/include" -DNDEBUG     -I"C:/local323/include"     -O2 -Wall  -mtune=core2 -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:/local323/lib/i386 -LC:/local323/lib -LC:/Users/BIOCBU˜1/BBS-3˜1.4-B/R/bin/i386 -lR
installing to C:/Users/biocbuild/bbs-3.4-bioc/meat/Rtreemix.buildbin-libdir/Rtreemix/libs/i386
** R
** data
** inst
** preparing package for lazy loading
** help
*** installing help indices
** building package indices
** installing vignettes
** testing if installed package can be loaded

install for x64

* installing *source* package 'Rtreemix' ...
** libs
C:/Rtools/mingw_64/bin/g++  -I"C:/Users/BIOCBU˜1/BBS-3˜1.4-B/R/include" -DNDEBUG     -I"C:/local323/include"     -O2 -Wall  -mtune=core2 -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.4-B/R/include" -DNDEBUG     -I"C:/local323/include"     -O2 -Wall  -mtune=core2 -c Rtreemix_patch.cc -o Rtreemix_patch.o
C:/Rtools/mingw_64/bin/g++  -I"C:/Users/BIOCBU˜1/BBS-3˜1.4-B/R/include" -DNDEBUG     -I"C:/local323/include"     -O2 -Wall  -mtune=core2 -c WrapGraph.cc -o WrapGraph.o
C:/Rtools/mingw_64/bin/g++  -I"C:/Users/BIOCBU˜1/BBS-3˜1.4-B/R/include" -DNDEBUG     -I"C:/local323/include"     -O2 -Wall  -mtune=core2 -c cfunctions.cc -o cfunctions.o
C:/Rtools/mingw_64/bin/g++  -I"C:/Users/BIOCBU˜1/BBS-3˜1.4-B/R/include" -DNDEBUG     -I"C:/local323/include"     -O2 -Wall  -mtune=core2 -c kmeans.cc -o kmeans.o
C:/Rtools/mingw_64/bin/g++  -I"C:/Users/BIOCBU˜1/BBS-3˜1.4-B/R/include" -DNDEBUG     -I"C:/local323/include"     -O2 -Wall  -mtune=core2 -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.4-B/R/include" -DNDEBUG     -I"C:/local323/include"     -O2 -Wall  -mtune=core2 -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.4-B/R/include" -DNDEBUG     -I"C:/local323/include"     -O2 -Wall  -mtune=core2 -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.4-B/R/include" -DNDEBUG     -I"C:/local323/include"     -O2 -Wall  -mtune=core2 -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:/local323/lib/x64 -LC:/local323/lib -LC:/Users/BIOCBU˜1/BBS-3˜1.4-B/R/bin/x64 -lR
installing to C:/Users/biocbuild/bbs-3.4-bioc/meat/Rtreemix.buildbin-libdir/Rtreemix/libs/x64
** testing if installed package can be loaded
* MD5 sums
packaged installation of 'Rtreemix' as Rtreemix_1.36.0.zip
* DONE (Rtreemix)

Rtreemix.Rcheck/examples_i386/Rtreemix-Ex.timings:

nameusersystemelapsed
L1.dist000
L2.norm000
Pval.dist000
RtreemixData-class0.020.010.03
RtreemixGPS-class000
RtreemixModel-class0.760.020.78
RtreemixSim-class0.020.000.02
RtreemixStats-class0.050.000.05
bootstrap-methods0.010.000.01
comp.models0.010.000.01
comp.trees0.020.000.02
confIntGPS-methods000
distribution-methods0.030.000.03
fit-methods1.750.021.77
generate-methods000
get.tree.levels000
gps-methods000
hiv.data0.020.000.01
kullback.leibler000
likelihoods-methods0.010.000.02
sim-methods000
stability.sim000

Rtreemix.Rcheck/examples_x64/Rtreemix-Ex.timings:

nameusersystemelapsed
L1.dist000
L2.norm000
Pval.dist000
RtreemixData-class0.010.000.01
RtreemixGPS-class000
RtreemixModel-class0.590.010.61
RtreemixSim-class0.030.000.03
RtreemixStats-class0.070.000.06
bootstrap-methods000
comp.models0.250.000.25
comp.trees0.030.000.03
confIntGPS-methods000
distribution-methods0.040.000.05
fit-methods0.310.000.32
generate-methods000
get.tree.levels0.020.000.01
gps-methods000
hiv.data000
kullback.leibler000
likelihoods-methods0.030.000.03
sim-methods000
stability.sim000