Back to Multiple platform build/check report for BioC 3.15
ABCDEFGHIJKLMNOPQR[S]TUVWXYZ

This page was generated on 2022-03-18 11:08:42 -0400 (Fri, 18 Mar 2022).

HostnameOSArch (*)R versionInstalled pkgs
nebbiolo1Linux (Ubuntu 20.04.4 LTS)x86_64R Under development (unstable) (2022-02-17 r81757) -- "Unsuffered Consequences" 4334
riesling1Windows Server 2019 Standardx64R Under development (unstable) (2021-11-21 r81221) -- "Unsuffered Consequences" 4097
palomino3Windows Server 2022 Datacenterx64R Under development (unstable) (2022-02-17 r81757 ucrt) -- "Unsuffered Consequences" 4083
merida1macOS 10.14.6 Mojavex86_64R Under development (unstable) (2022-03-02 r81842) -- "Unsuffered Consequences" 4134
Click on any hostname to see more info about the system (e.g. compilers)      (*) as reported by 'uname -p', except on Windows and Mac OS X

BUILD BIN results for SIMLR on riesling1


To the developers/maintainers of the SIMLR package:
- Please allow up to 24 hours (and sometimes 48 hours) for your latest push to git@git.bioconductor.org:packages/SIMLR.git to
reflect on this report. See How and When does the builder pull? When will my changes propagate? here for more information.
- Make sure to use the following settings in order to reproduce any error or warning you see on this page.

raw results

Package 1810/2090HostnameOS / ArchINSTALLBUILDCHECKBUILD BIN
SIMLR 1.21.0  (landing page)
Luca De Sano
Snapshot Date: 2022-03-17 13:55:23 -0400 (Thu, 17 Mar 2022)
git_url: https://git.bioconductor.org/packages/SIMLR
git_branch: master
git_last_commit: 5cdd904
git_last_commit_date: 2021-10-26 12:30:14 -0400 (Tue, 26 Oct 2021)
nebbiolo1Linux (Ubuntu 20.04.4 LTS) / x86_64  OK    OK    OK  UNNEEDED, same version is already published
riesling1Windows Server 2019 Standard / x64  OK    OK    OK    OK  
palomino3Windows Server 2022 Datacenter / x64  OK    OK    OK    OK  UNNEEDED, same version is already published
merida1macOS 10.14.6 Mojave / x86_64  OK    OK    OK    OK  UNNEEDED, same version is already published

Summary

Package: SIMLR
Version: 1.21.0
Command: rm -rf SIMLR.buildbin-libdir && mkdir SIMLR.buildbin-libdir && D:\biocbuild\bbs-3.15-bioc\R\bin\R.exe CMD INSTALL --build --library=SIMLR.buildbin-libdir SIMLR_1.21.0.tar.gz
StartedAt: 2022-03-17 21:40:44 -0400 (Thu, 17 Mar 2022)
EndedAt: 2022-03-17 21:42:01 -0400 (Thu, 17 Mar 2022)
EllapsedTime: 76.5 seconds
RetCode: 0
Status:   OK  
PackageFile: SIMLR_1.21.0.zip
PackageFileSize: 3.95 MiB

Command output

##############################################################################
##############################################################################
###
### Running command:
###
###   rm -rf SIMLR.buildbin-libdir && mkdir SIMLR.buildbin-libdir && D:\biocbuild\bbs-3.15-bioc\R\bin\R.exe CMD INSTALL --build --library=SIMLR.buildbin-libdir SIMLR_1.21.0.tar.gz
###
##############################################################################
##############################################################################


* installing *source* package 'SIMLR' ...
** using staged installation
** libs
"C:/rtools40/mingw64/bin/"g++ -std=gnu++11  -I"D:/biocbuild/bbs-3.15-bioc/R/include" -DNDEBUG  -I'D:/biocbuild/bbs-3.15-bioc/R/library/Rcpp/include'   -I"C:/extsoft/include"     -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign -fno-reorder-blocks-and-partition  -c RcppExports.cpp -o RcppExports.o
"C:/rtools40/mingw64/bin/"g++ -std=gnu++11  -I"D:/biocbuild/bbs-3.15-bioc/R/include" -DNDEBUG  -I'D:/biocbuild/bbs-3.15-bioc/R/library/Rcpp/include'   -I"C:/extsoft/include"     -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign -fno-reorder-blocks-and-partition  -c Rtsne.cpp -o Rtsne.o
"C:/rtools40/mingw64/bin/"gcc  -I"D:/biocbuild/bbs-3.15-bioc/R/include" -DNDEBUG  -I'D:/biocbuild/bbs-3.15-bioc/R/library/Rcpp/include'   -I"C:/extsoft/include"     -O2 -Wall  -std=gnu99 -mfpmath=sse -msse2 -mstackrealign -fno-reorder-blocks-and-partition  -c package_init.c -o package_init.o
"C:/rtools40/mingw64/bin/"gcc  -I"D:/biocbuild/bbs-3.15-bioc/R/include" -DNDEBUG  -I'D:/biocbuild/bbs-3.15-bioc/R/library/Rcpp/include'   -I"C:/extsoft/include"     -O2 -Wall  -std=gnu99 -mfpmath=sse -msse2 -mstackrealign -fno-reorder-blocks-and-partition  -c projsplx_R.c -o projsplx_R.o
"C:/rtools40/mingw64/bin/"g++ -std=gnu++11  -I"D:/biocbuild/bbs-3.15-bioc/R/include" -DNDEBUG  -I'D:/biocbuild/bbs-3.15-bioc/R/library/Rcpp/include'   -I"C:/extsoft/include"     -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign -fno-reorder-blocks-and-partition  -c sptree.cpp -o sptree.o
"C:/rtools40/mingw64/bin/"g++ -std=gnu++11  -I"D:/biocbuild/bbs-3.15-bioc/R/include" -DNDEBUG  -I'D:/biocbuild/bbs-3.15-bioc/R/library/Rcpp/include'   -I"C:/extsoft/include"     -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign -fno-reorder-blocks-and-partition  -c tsne.cpp -o tsne.o
tsne.cpp: In member function 'bool TSNE::load_data(double**, int*, int*, int*, double*, double*, int*)':
tsne.cpp:967:48: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long long unsigned int'} and 'int' [-Wsign-compare]
   if (fread(*data, sizeof(double), *n * *d, h) != *n * *d) {
       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
In file included from tsne.cpp:41:
vptree.h: In instantiation of 'void VpTree<T, distance>::search(VpTree<T, distance>::Node*, const T&, int, std::priority_queue<VpTree<T, distance>::HeapItem>&) [with T = DataPoint; double (* distance)(const T&, const T&) = precomputed_distance; typename std::vector<VpTree<T, distance>::HeapItem, std::allocator<VpTree<T, distance>::HeapItem> >::value_type = VpTree<DataPoint, precomputed_distance>::HeapItem]':
vptree.h:131:9:   required from 'void VpTree<T, distance>::search(const T&, int, std::vector<T>*, std::vector<double>*) [with T = DataPoint; double (* distance)(const T&, const T&) = precomputed_distance]'
tsne.cpp:472:59:   required from here
vptree.h:237:28: warning: comparison of integer expressions of different signedness: 'std::priority_queue<VpTree<DataPoint, precomputed_distance>::HeapItem, std::vector<VpTree<DataPoint, precomputed_distance>::HeapItem, std::allocator<VpTree<DataPoint, precomputed_distance>::HeapItem> >, std::less<VpTree<DataPoint, precomputed_distance>::HeapItem> >::size_type' {aka 'long long unsigned int'} and 'int' [-Wsign-compare]
             if(heap.size() == k) heap.pop();                 // remove furthest node from result list (if we already have k results)
In file included from tsne.cpp:41:
vptree.h:239:28: warning: comparison of integer expressions of different signedness: 'std::priority_queue<VpTree<DataPoint, precomputed_distance>::HeapItem, std::vector<VpTree<DataPoint, precomputed_distance>::HeapItem, std::allocator<VpTree<DataPoint, precomputed_distance>::HeapItem> >, std::less<VpTree<DataPoint, precomputed_distance>::HeapItem> >::size_type' {aka 'long long unsigned int'} and 'int' [-Wsign-compare]
             if(heap.size() == k) _tau = heap.top().dist;     // update value of tau (farthest point in result list)
In file included from tsne.cpp:41:
vptree.h: In instantiation of 'void VpTree<T, distance>::search(VpTree<T, distance>::Node*, const T&, int, std::priority_queue<VpTree<T, distance>::HeapItem>&) [with T = DataPoint; double (* distance)(const T&, const T&) = euclidean_distance; typename std::vector<VpTree<T, distance>::HeapItem, std::allocator<VpTree<T, distance>::HeapItem> >::value_type = VpTree<DataPoint, euclidean_distance>::HeapItem]':
vptree.h:131:9:   required from 'void VpTree<T, distance>::search(const T&, int, std::vector<T>*, std::vector<double>*) [with T = DataPoint; double (* distance)(const T&, const T&) = euclidean_distance]'
tsne.cpp:550:59:   required from here
vptree.h:237:28: warning: comparison of integer expressions of different signedness: 'std::priority_queue<VpTree<DataPoint, euclidean_distance>::HeapItem, std::vector<VpTree<DataPoint, euclidean_distance>::HeapItem, std::allocator<VpTree<DataPoint, euclidean_distance>::HeapItem> >, std::less<VpTree<DataPoint, euclidean_distance>::HeapItem> >::size_type' {aka 'long long unsigned int'} and 'int' [-Wsign-compare]
             if(heap.size() == k) heap.pop();                 // remove furthest node from result list (if we already have k results)
In file included from tsne.cpp:41:
vptree.h:239:28: warning: comparison of integer expressions of different signedness: 'std::priority_queue<VpTree<DataPoint, euclidean_distance>::HeapItem, std::vector<VpTree<DataPoint, euclidean_distance>::HeapItem, std::allocator<VpTree<DataPoint, euclidean_distance>::HeapItem> >, std::less<VpTree<DataPoint, euclidean_distance>::HeapItem> >::size_type' {aka 'long long unsigned int'} and 'int' [-Wsign-compare]
             if(heap.size() == k) _tau = heap.top().dist;     // update value of tau (farthest point in result list)
C:/rtools40/mingw64/bin/g++ -std=gnu++11 -shared -s -static-libgcc -o SIMLR.dll tmp.def RcppExports.o Rtsne.o package_init.o projsplx_R.o sptree.o tsne.o -LD:/biocbuild/bbs-3.15-bioc/R/bin/x64 -lRlapack -LD:/biocbuild/bbs-3.15-bioc/R/bin/x64 -lRblas -lgfortran -lm -lquadmath -LC:/extsoft/lib/x64 -LC:/extsoft/lib -LD:/biocbuild/bbs-3.15-bioc/R/bin/x64 -lR
installing to D:/biocbuild/bbs-3.15-bioc/meat/SIMLR.buildbin-libdir/00LOCK-SIMLR/00new/SIMLR/libs/x64
** R
** data
** inst
** byte-compile and prepare package for lazy loading
** help
*** installing help indices
  converting help for package 'SIMLR'
    finding HTML links ... done
    BuettnerFlorian                         html  
    CIMLR                                   html  
    CIMLR_Estimate_Number_of_Clusters       html  
    SIMLR                                   html  
    SIMLR_Estimate_Number_of_Clusters       html  
    SIMLR_Feature_Ranking                   html  
    SIMLR_Large_Scale                       html  
    ZeiselAmit                              html  
** building package indices
** installing vignettes
** testing if installed package can be loaded from temporary location
** testing if installed package can be loaded from final location
** testing if installed package keeps a record of temporary installation path
* MD5 sums
packaged installation of 'SIMLR' as SIMLR_1.21.0.zip
* DONE (SIMLR)