##############################################################################
##############################################################################
###
### Running command:
###
### C:\cygwin\bin\curl.exe -O http://155.52.207.166/BBS/3.14/bioc/src/contrib/SIMLR_1.20.0.tar.gz && rm -rf SIMLR.buildbin-libdir && mkdir SIMLR.buildbin-libdir && C:\Users\biocbuild\bbs-3.14-bioc\R\bin\R.exe CMD INSTALL --merge-multiarch --build --library=SIMLR.buildbin-libdir SIMLR_1.20.0.tar.gz && C:\Users\biocbuild\bbs-3.14-bioc\R\bin\R.exe CMD INSTALL SIMLR_1.20.0.zip && rm SIMLR_1.20.0.tar.gz SIMLR_1.20.0.zip
###
##############################################################################
##############################################################################
% Total % Received % Xferd Average Speed Time Time Time Current
Dload Upload Total Spent Left Speed
0 0 0 0 0 0 0 0 --:--:-- --:--:-- --:--:-- 0
0 3397k 0 20037 0 0 164k 0 0:00:20 --:--:-- 0:00:20 164k
50 3397k 50 1722k 0 0 1539k 0 0:00:02 0:00:01 0:00:01 1539k
100 3397k 100 3397k 0 0 1902k 0 0:00:01 0:00:01 --:--:-- 1902k
install for i386
* installing *source* package 'SIMLR' ...
** using staged installation
** libs
"C:/rtools40/mingw32/bin/"g++ -std=gnu++11 -I"C:/Users/BIOCBU~1/BBS-3~1.14-/R/include" -DNDEBUG -I'C:/Users/biocbuild/bbs-3.14-bioc/R/library/Rcpp/include' -I"C:/extsoft/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c RcppExports.cpp -o RcppExports.o
"C:/rtools40/mingw32/bin/"g++ -std=gnu++11 -I"C:/Users/BIOCBU~1/BBS-3~1.14-/R/include" -DNDEBUG -I'C:/Users/biocbuild/bbs-3.14-bioc/R/library/Rcpp/include' -I"C:/extsoft/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c Rtsne.cpp -o Rtsne.o
"C:/rtools40/mingw32/bin/"gcc -I"C:/Users/BIOCBU~1/BBS-3~1.14-/R/include" -DNDEBUG -I'C:/Users/biocbuild/bbs-3.14-bioc/R/library/Rcpp/include' -I"C:/extsoft/include" -O2 -Wall -std=gnu99 -mfpmath=sse -msse2 -mstackrealign -c package_init.c -o package_init.o
"C:/rtools40/mingw32/bin/"gcc -I"C:/Users/BIOCBU~1/BBS-3~1.14-/R/include" -DNDEBUG -I'C:/Users/biocbuild/bbs-3.14-bioc/R/library/Rcpp/include' -I"C:/extsoft/include" -O2 -Wall -std=gnu99 -mfpmath=sse -msse2 -mstackrealign -c projsplx_R.c -o projsplx_R.o
"C:/rtools40/mingw32/bin/"g++ -std=gnu++11 -I"C:/Users/BIOCBU~1/BBS-3~1.14-/R/include" -DNDEBUG -I'C:/Users/biocbuild/bbs-3.14-bioc/R/library/Rcpp/include' -I"C:/extsoft/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c sptree.cpp -o sptree.o
"C:/rtools40/mingw32/bin/"g++ -std=gnu++11 -I"C:/Users/BIOCBU~1/BBS-3~1.14-/R/include" -DNDEBUG -I'C:/Users/biocbuild/bbs-3.14-bioc/R/library/Rcpp/include' -I"C:/extsoft/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -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 '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 '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 '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 '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 '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/mingw32/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 -LC:/Users/BIOCBU~1/BBS-3~1.14-/R/bin/i386 -lRlapack -LC:/Users/BIOCBU~1/BBS-3~1.14-/R/bin/i386 -lRblas -lgfortran -lm -lquadmath -LC:/extsoft/lib/i386 -LC:/extsoft/lib -LC:/Users/BIOCBU~1/BBS-3~1.14-/R/bin/i386 -lR
installing to C:/Users/biocbuild/bbs-3.14-bioc/meat/SIMLR.buildbin-libdir/00LOCK-SIMLR/00new/SIMLR/libs/i386
** 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
install for x64
* installing *source* package 'SIMLR' ...
** libs
"C:/rtools40/mingw64/bin/"g++ -std=gnu++11 -I"C:/Users/BIOCBU~1/BBS-3~1.14-/R/include" -DNDEBUG -I'C:/Users/biocbuild/bbs-3.14-bioc/R/library/Rcpp/include' -I"C:/extsoft/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c RcppExports.cpp -o RcppExports.o
"C:/rtools40/mingw64/bin/"g++ -std=gnu++11 -I"C:/Users/BIOCBU~1/BBS-3~1.14-/R/include" -DNDEBUG -I'C:/Users/biocbuild/bbs-3.14-bioc/R/library/Rcpp/include' -I"C:/extsoft/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c Rtsne.cpp -o Rtsne.o
"C:/rtools40/mingw64/bin/"gcc -I"C:/Users/BIOCBU~1/BBS-3~1.14-/R/include" -DNDEBUG -I'C:/Users/biocbuild/bbs-3.14-bioc/R/library/Rcpp/include' -I"C:/extsoft/include" -O2 -Wall -std=gnu99 -mfpmath=sse -msse2 -mstackrealign -c package_init.c -o package_init.o
"C:/rtools40/mingw64/bin/"gcc -I"C:/Users/BIOCBU~1/BBS-3~1.14-/R/include" -DNDEBUG -I'C:/Users/biocbuild/bbs-3.14-bioc/R/library/Rcpp/include' -I"C:/extsoft/include" -O2 -Wall -std=gnu99 -mfpmath=sse -msse2 -mstackrealign -c projsplx_R.c -o projsplx_R.o
"C:/rtools40/mingw64/bin/"g++ -std=gnu++11 -I"C:/Users/BIOCBU~1/BBS-3~1.14-/R/include" -DNDEBUG -I'C:/Users/biocbuild/bbs-3.14-bioc/R/library/Rcpp/include' -I"C:/extsoft/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c sptree.cpp -o sptree.o
"C:/rtools40/mingw64/bin/"g++ -std=gnu++11 -I"C:/Users/BIOCBU~1/BBS-3~1.14-/R/include" -DNDEBUG -I'C:/Users/biocbuild/bbs-3.14-bioc/R/library/Rcpp/include' -I"C:/extsoft/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -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 -LC:/Users/BIOCBU~1/BBS-3~1.14-/R/bin/x64 -lRlapack -LC:/Users/BIOCBU~1/BBS-3~1.14-/R/bin/x64 -lRblas -lgfortran -lm -lquadmath -LC:/extsoft/lib/x64 -LC:/extsoft/lib -LC:/Users/BIOCBU~1/BBS-3~1.14-/R/bin/x64 -lR
installing to C:/Users/biocbuild/bbs-3.14-bioc/meat/SIMLR.buildbin-libdir/SIMLR/libs/x64
** testing if installed package can be loaded
* MD5 sums
packaged installation of 'SIMLR' as SIMLR_1.20.0.zip
* DONE (SIMLR)
* installing to library 'C:/Users/biocbuild/bbs-3.14-bioc/R/library'
package 'SIMLR' successfully unpacked and MD5 sums checked
