Appveyor takes more than one hour to check examples and stops there, resulting in appveyor build failure with a message "Build execution time has reached the maximum allowed time for your plan (60 minutes)". I have ran checks for examples on windows 10 machine successfully without any warnings. Can you point us the reason or solution?
rohith008 opened this issue · comments
Build started
2$ErrorActionPreference = "Stop"
3Invoke-WebRequest http://raw.github.com/krlmlr/r-appveyor/master/scripts/appveyor-tool.ps1 -OutFile "..\appveyor-tool.ps1"
4Import-Module '..\appveyor-tool.ps1'
5
6git clone -q --branch=master https://github.com/Mathelab/IntLIM.git C:\projects\intlim
7git checkout -qf b4e649d20e296fa7d0b5bfdf07bcc6973d2815a9
8Running Install scripts
9Bootstrap
10== 07/03/2019 10:29:24: Bootstrap: Start
11== 07/03/2019 10:29:24: Adding GnuWin32 tools to PATH
12== 07/03/2019 10:29:24: Setting time zone
13UTC
14GMT Standard Time
15== 07/03/2019 10:29:24: Version: release
16== 07/03/2019 10:29:28: URL path:
17== 07/03/2019 10:29:28: Downloading R from: https://cloud.r-project.org/bin/windows/base/R-3.6.0-win.exe
18== 07/03/2019 10:29:30: Running R installer
19R is now available on drive C:
20== 07/03/2019 10:29:46: Setting PATH
21== 07/03/2019 10:29:46: Testing R installation
22R version 3.6.0 (2019-04-26)
23Platform: x86_64-w64-mingw32/x64 (64-bit)
24Running under: Windows Server 2012 R2 x64 (build 9600)
25
26Matrix products: default
27
28locale:
29[1] LC_COLLATE=English_United States.1252
30[2] LC_CTYPE=English_United States.1252
31[3] LC_MONETARY=English_United States.1252
32[4] LC_NUMERIC=C
33[5] LC_TIME=English_United States.1252
34
35attached base packages:
36[1] stats graphics grDevices utils datasets methods base
37
38loaded via a namespace (and not attached):
39[1] compiler_3.6.0
40== 07/03/2019 10:29:46: Determining Rtools version
41== 07/03/2019 10:29:46: Downloading Rtools from: https://cloud.r-project.org/bin/windows/Rtools/Rtools35.exe
42== 07/03/2019 10:29:48: Running Rtools installer
43Rtools is now available on drive C:
44== 07/03/2019 10:30:30: Setting PATH
45== 07/03/2019 10:30:30: Downloading and installing travis-tool.sh
46@bash.exe ../travis-tool.sh %*
47^..Rproj$
48^.travis.yml$
49^.Rproj.user$
50^doc$
51^Meta$
52^travis-tool.sh.cmd$
53C:\Rtools\bin
54C:\Rtools\MinGW\bin
55C:\Rtools\gcc-4.6.3\bin
56C:\R\bin\x64
57C:\Rtools\mingw_64\bin
58C:\MinGW\msys\1.0\bin
59C:\Program Files (x86)\Git\bin
60C:\Program Files (x86)\Microsoft SDKs\Azure\CLI2\wbin
61C:\Perl\site\bin
62C:\Perl\bin
63C:\Windows\system32
64C:\Windows
65C:\Windows\System32\Wbem
66C:\Windows\System32\WindowsPowerShell\v1.0
67C:\Program Files\7-Zip
68C:\Program Files\Microsoft\Web Platform Installer
69C:\Tools\GitVersion
70C:\Tools\PsTools
71C:\Program Files\Git LFS
72C:\Program Files (x86)\Subversion\bin
73C:\Program Files\Microsoft SQL Server\120\Tools\Binn
74C:\Program Files\Microsoft SQL Server\Client SDK\ODBC\110\Tools\Binn
75C:\Program Files (x86)\Microsoft SQL Server\120\Tools\Binn
76C:\Program Files\Microsoft SQL Server\120\DTS\Binn
77C:\Program Files (x86)\Microsoft SQL Server\120\Tools\Binn\ManagementStudio
78C:\Tools\WebDriver
79C:\Program Files (x86)\Microsoft SDKs\TypeScript\1.4
80C:\Program Files (x86)\Microsoft Visual Studio 12.0\Common7\IDE\PrivateAssemblies
81C:\Program Files (x86)\Microsoft SDKs\Azure\CLI\wbin
82C:\Ruby193\bin
83C:\Tools\NUnit\bin
84C:\Tools\xUnit
85C:\Tools\MSpec
86C:\Tools\Coverity\bin
87C:\Program Files (x86)\CMake\bin
88C:\go\bin
89C:\Program Files\Java\jdk1.8.0\bin
90C:\Python27
91C:\Program Files\nodejs
92C:\Program Files (x86)\iojs
93C:\Program Files\iojs
94C:\Program Files\Microsoft SQL Server\130\Tools\Binn
95C:\Program Files (x86)\MSBuild\14.0\Bin
96C:\Tools\NuGet
97C:\Program Files (x86)\Microsoft Visual Studio 14.0\Common7\IDE\CommonExtensions\Microsoft\TestWindow
98C:\Program Files\Microsoft DNX\Dnvm
99C:\Program Files\Microsoft SQL Server\Client SDK\ODBC\130\Tools\Binn
100C:\Program Files (x86)\Microsoft SQL Server\130\Tools\Binn
101C:\Program Files (x86)\Microsoft SQL Server\130\DTS\Binn
102C:\Program Files\Microsoft SQL Server\130\DTS\Binn
103C:\Program Files (x86)\Microsoft SQL Server\110\DTS\Binn
104C:\Program Files (x86)\Microsoft SQL Server\120\DTS\Binn
105C:\Program Files (x86)\Apache\Maven\bin
106C:\Python27\Scripts
107C:\Tools\NUnit3
108C:\Program Files\Mercurial
109C:\Program Files\dotnet
110C:\Tools\curl\bin
111C:\Program Files\Amazon\AWSCLI
112C:\Program Files (x86)\Microsoft SQL Server\140\DTS\Binn
113C:\Program Files (x86)\Microsoft Visual Studio 14.0\Common7\IDE\Extensions\Microsoft\SQLDB\DAC\140
114C:\Tools\vcpkg
115C:\Program Files (x86)\Microsoft SQL Server\140\Tools\Binn
116C:\Program Files\Microsoft SQL Server\140\Tools\Binn
117C:\Program Files\Microsoft SQL Server\140\DTS\Binn
118C:\Program Files\erl9.2\bin
119C:\Program Files (x86)\NSIS
120C:\Tools\Octopus
121C:\Program Files\Git\cmd
122C:\Program Files\Git\usr\bin
123C:\Program Files\Microsoft Service Fabric\bin\Fabric\Fabric.Code
124C:\Program Files\Microsoft SDKs\Service Fabric\Tools\ServiceFabricLocalClusterManager
125C:\Program Files\LLVM\bin
126C:\Program Files (x86)\Yarn\bin
127C:\Users\appveyor\AppData\Roaming\npm
128C:\Program Files\PowerShell\6
129C:\ProgramData\chocolatey\bin
130C:\Program Files (x86)\nodejs
131C:\Users\appveyor.dotnet\tools
132C:\Users\appveyor\AppData\Local\Yarn\bin
133C:\Users\appveyor\AppData\Roaming\npm
134C:\Program Files\AppVeyor\BuildAgent
135== 07/03/2019 10:30:30: Setting R_LIBS_USER
136
137
138 Directory: C:
139
140
141Mode LastWriteTime Length Name
142---- ------------- ------ ----
143d----- 7/3/2019 10:30 AM RLibrary
144== 07/03/2019 10:30:30: Setting TAR to 'internal'
145== 07/03/2019 10:30:30: Bootstrap: Done
146
147
148travis-tool.sh install_bioc Biobase MultiDataSet BiocGenerics GenomicRanges IRanges
149+ CRAN=https://cran.rstudio.com
150+ BIOC=http://bioconductor.org/biocLite.R
151+ PKGTYPE=both
152+ BIOC_USE_DEVEL=FALSE
153++ uname -s
154+ OS=MSYS_NT-6.3-WOW
155+ PANDOC_VERSION=1.13.1
156+ PANDOC_DIR=/opt/pandoc
157+ PANDOC_URL=https://s3.amazonaws.com/rstudio-buildtools/pandoc-1.13.1.zip
158+ PATH='/c/Rtools/bin:/c/Rtools/MinGW/bin:/c/Rtools/gcc-4.6.3/bin:/c/R/bin/x64:/c/Rtools/mingw_64/bin:/usr/bin:/c/Program Files (x86)/Git/bin:/c/Program Files (x86)/Microsoft SDKs/Azure/CLI2/wbin:/c/Perl/site/bin:/c/Perl/bin:/c/Windows/system32:/c/Windows:/c/Windows/System32/Wbem:/c/Windows/System32/WindowsPowerShell/v1.0/:/c/Program Files/7-Zip:/c/Program Files/Microsoft/Web Platform Installer/:/c/Tools/GitVersion:/c/Tools/PsTools:/c/Program Files/Git LFS:/c/Program Files (x86)/Subversion/bin:/c/Program Files/Microsoft SQL Server/120/Tools/Binn/:/c/Program Files/Microsoft SQL Server/Client SDK/ODBC/110/Tools/Binn/:/c/Program Files (x86)/Microsoft SQL Server/120/Tools/Binn/:/c/Program Files/Microsoft SQL Server/120/DTS/Binn/:/c/Program Files (x86)/Microsoft SQL Server/120/Tools/Binn/ManagementStudio/:/c/Tools/WebDriver:/c/Program Files (x86)/Microsoft SDKs/TypeScript/1.4/:/c/Program Files (x86)/Microsoft Visual Studio 12.0/Common7/IDE/PrivateAssemblies/:/c/Program Files (x86)/Microsoft SDKs/Azure/CLI/wbin:/c/Ruby193/bin:/c/Tools/NUnit/bin:/c/Tools/xUnit:/c/Tools/MSpec:/c/Tools/Coverity/bin:/c/Program Files (x86)/CMake/bin:/c/go/bin:/c/Program Files/Java/jdk1.8.0/bin:/c/Python27:/c/Program Files/nodejs:/c/Program Files (x86)/iojs:/c/Program Files/iojs:/c/Program Files/Microsoft SQL Server/130/Tools/Binn/:/c/Program Files (x86)/MSBuild/14.0/Bin:/c/Tools/NuGet:/c/Program Files (x86)/Microsoft Visual Studio 14.0/Common7/IDE/CommonExtensions/Microsoft/TestWindow:/c/Program Files/Microsoft DNX/Dnvm:/c/Program Files/Microsoft SQL Server/Client SDK/ODBC/130/Tools/Binn/:/c/Program Files (x86)/Microsoft SQL Server/130/Tools/Binn/:/c/Program Files (x86)/Microsoft SQL Server/130/DTS/Binn/:/c/Program Files/Microsoft SQL Server/130/DTS/Binn/:/c/Program Files (x86)/Microsoft SQL Server/110/DTS/Binn/:/c/Program Files (x86)/Microsoft SQL Server/120/DTS/Binn/:/c/Program Files (x86)/Apache/Maven/bin:/c/Python27/Scripts:/c/Tools/NUnit3:/c/Program Files/Mercurial/:/c/Program Files/dotnet/:/c/Tools/curl/bin:/c/Program Files/Amazon/AWSCLI/:/c/Program Files (x86)/Microsoft SQL Server/140/DTS/Binn/:/c/Program Files (x86)/Microsoft Visual Studio 14.0/Common7/IDE/Extensions/Microsoft/SQLDB/DAC/140:/c/Tools/vcpkg:/c/Program Files (x86)/Microsoft SQL Server/140/Tools/Binn/:/c/Program Files/Microsoft SQL Server/140/Tools/Binn/:/c/Program Files/Microsoft SQL Server/140/DTS/Binn/:/c/Program Files/erl9.2/bin:/c/Program Files (x86)/NSIS:/c/Tools/Octopus:/c/Program Files/Git/cmd:/c/Program Files/Git/usr/bin:/c/Program Files/Microsoft Service Fabric/bin/Fabric/Fabric.Code:/c/Program Files/Microsoft SDKs/Service Fabric/Tools/ServiceFabricLocalClusterManager:/c/Program Files/LLVM/bin:/c/Program Files (x86)/Yarn/bin/:/c/Users/appveyor/AppData/Roaming/npm:/c/Program Files/PowerShell/6/:/c/ProgramData/chocolatey/bin:/c/Program Files (x86)/nodejs/:/c/Users/appveyor/.dotnet/tools:/c/Users/appveyor/AppData/Local/Yarn/bin:/c/Users/appveyor/AppData/Roaming/npm:/c/Program Files/AppVeyor/BuildAgent/:/usr/texbin'
159+ R_BUILD_ARGS=--no-manual
160+ R_CHECK_ARGS='--no-manual --as-cran'
161+ R_VERSION_TEST='getRversion() >= '''3.5.0''''
162+ R_USE_BIOC_INST='source('''http://bioconductor.org/biocLite.R'\''); tryCatch(useDevel(FALSE), error=function(e) {if (!grepl('''already in use''', e)) {e}}); options(repos=biocinstallRepos())'
163+ R_USE_BIOC_MNGR='if (!requireNamespace('''BiocManager''', quietly=TRUE)) install.packages('''BiocManager''', repos=c(CRAN='''https://cran.rstudio.com'\'')); if (FALSE) BiocManager::install(version = '''devel'''); options(repos=BiocManager::repositories())'
164+ R_USE_BIOC_CMDS='if (getRversion() >= '''3.5.0''') {if (!requireNamespace('''BiocManager''', quietly=TRUE)) install.packages('''BiocManager''', repos=c(CRAN='''https://cran.rstudio.com'\'')); if (FALSE) BiocManager::install(version = '''devel'''); options(repos=BiocManager::repositories())} else {source('''http://bioconductor.org/biocLite.R'\''); tryCatch(useDevel(FALSE), error=function(e) {if (!grepl('''already in use''', e)) {e}}); options(repos=biocinstallRepos())};'
165+ BIOC_INSTALL='{if (getRversion() >= '''3.5.0''') BiocManager::install else BiocInstaller::biocLite}'
166+ COMMAND=install_bioc
167+ echo 'Running command: install_bioc'
168Running command: install_bioc
169+ shift
170+ case $COMMAND in
171+ BiocInstall Biobase MultiDataSet BiocGenerics GenomicRanges IRanges
172+ [[ '' == \B\i\o\b\a\s\e\ \M\u\l\t\i\D\a\t\a\S\e\t\ \B\i\o\c\G\e\n\e\r\i\c\s\ \G\e\n\o\m\i\c\R\a\n\g\e\s\ \I\R\a\n\g\e\s ]]
173+ echo 'Installing R Bioconductor package(s): Biobase' MultiDataSet BiocGenerics GenomicRanges IRanges
174Installing R Bioconductor package(s): Biobase MultiDataSet BiocGenerics GenomicRanges IRanges
175+ Rscript -e 'if (getRversion() >= '''3.5.0''') {if (!requireNamespace('''BiocManager''', quietly=TRUE)) install.packages('''BiocManager''', repos=c(CRAN='''https://cran.rstudio.com'\'')); if (FALSE) BiocManager::install(version = '''devel'''); options(repos=BiocManager::repositories())} else {source('''http://bioconductor.org/biocLite.R'\''); tryCatch(useDevel(FALSE), error=function(e) {if (!grepl('''already in use''', e)) {e}}); options(repos=biocinstallRepos())}; {if (getRversion() >= '''3.5.0''') BiocManager::install else BiocInstaller::biocLite}(commandArgs(TRUE))' Biobase MultiDataSet BiocGenerics GenomicRanges IRanges
176Installing package into 'c:/RLibrary'
177(as 'lib' is unspecified)
178trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/BiocManager_1.30.4.zip'
179Content type 'application/zip' length 292998 bytes (286 KB)
180==================================================
181downloaded 286 KB
182
183package 'BiocManager' successfully unpacked and MD5 sums checked
184
185The downloaded binary packages are in
186 C:\Users\appveyor\AppData\Local\Temp\1\RtmpEZn5pd\downloaded_packages
187Bioconductor version 3.9 (BiocManager 1.30.4), R 3.6.0 (2019-04-26)
188Installing package(s) 'BiocVersion', 'Biobase', 'MultiDataSet', 'BiocGenerics',
189 'GenomicRanges', 'IRanges'
190also installing the dependencies 'formatR', 'lambda.r', 'futile.options', 'backports', 'zeallot', 'futile.logger', 'snow', 'BH', 'glue', 'magrittr', 'stringi', 'colorspace', 'assertthat', 'utf8', 'vctrs', 'matrixStats', 'BiocParallel', 'plyr', 'stringr', 'labeling', 'munsell', 'R6', 'RColorBrewer', 'cli', 'crayon', 'fansi', 'pillar', 'pkgconfig', 'bitops', 'DelayedArray', 'digest', 'gtable', 'lazyeval', 'reshape2', 'rlang', 'scales', 'tibble', 'viridisLite', 'withr', 'Rcpp', 'calibrate', 'RCurl', 'GenomeInfoDbData', 'zlibbioc', 'S4Vectors', 'SummarizedExperiment', 'ggplot2', 'ggrepel', 'qqman', 'limma', 'GenomeInfoDb', 'XVector'
191
192
193 There is a binary version available but the source version is later:
194 binary source needs_compilation
195BiocParallel 1.17.18 1.18.0 TRUE
196
197trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/formatR_1.7.zip'
198Content type 'application/zip' length 152430 bytes (148 KB)
199==================================================
200downloaded 148 KB
201
202trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/lambda.r_1.2.3.zip'
203Content type 'application/zip' length 112559 bytes (109 KB)
204==================================================
205downloaded 109 KB
206
207trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/futile.options_1.0.1.zip'
208Content type 'application/zip' length 21145 bytes (20 KB)
209==================================================
210downloaded 20 KB
211
212trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/backports_1.1.4.zip'
213Content type 'application/zip' length 66819 bytes (65 KB)
214==================================================
215downloaded 65 KB
216
217trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/zeallot_0.1.0.zip'
218Content type 'application/zip' length 62189 bytes (60 KB)
219==================================================
220downloaded 60 KB
221
222trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/futile.logger_1.4.3.zip'
223Content type 'application/zip' length 97464 bytes (95 KB)
224==================================================
225downloaded 95 KB
226
227trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/snow_0.4-3.zip'
228Content type 'application/zip' length 111094 bytes (108 KB)
229==================================================
230downloaded 108 KB
231
232trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/BH_1.69.0-1.zip'
233Content type 'application/zip' length 19008275 bytes (18.1 MB)
234==================================================
235downloaded 18.1 MB
236
237trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/glue_1.3.1.zip'
238Content type 'application/zip' length 172962 bytes (168 KB)
239==================================================
240downloaded 168 KB
241
242trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/magrittr_1.5.zip'
243Content type 'application/zip' length 158187 bytes (154 KB)
244==================================================
245downloaded 154 KB
246
247trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/stringi_1.4.3.zip'
248Content type 'application/zip' length 15297905 bytes (14.6 MB)
249==================================================
250downloaded 14.6 MB
251
252trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/colorspace_1.4-1.zip'
253Content type 'application/zip' length 2550405 bytes (2.4 MB)
254==================================================
255downloaded 2.4 MB
256
257trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/assertthat_0.2.1.zip'
258Content type 'application/zip' length 55132 bytes (53 KB)
259==================================================
260downloaded 53 KB
261
262trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/utf8_1.1.4.zip'
263Content type 'application/zip' length 215445 bytes (210 KB)
264==================================================
265downloaded 210 KB
266
267trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/vctrs_0.1.0.zip'
268Content type 'application/zip' length 621784 bytes (607 KB)
269==================================================
270downloaded 607 KB
271
272trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/matrixStats_0.54.0.zip'
273Content type 'application/zip' length 1636070 bytes (1.6 MB)
274==================================================
275downloaded 1.6 MB
276
277trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/plyr_1.8.4.zip'
278Content type 'application/zip' length 1302561 bytes (1.2 MB)
279==================================================
280downloaded 1.2 MB
281
282trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/stringr_1.4.0.zip'
283Content type 'application/zip' length 216597 bytes (211 KB)
284==================================================
285downloaded 211 KB
286
287trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/labeling_0.3.zip'
288Content type 'application/zip' length 62937 bytes (61 KB)
289==================================================
290downloaded 61 KB
291
292trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/munsell_0.5.0.zip'
293Content type 'application/zip' length 245256 bytes (239 KB)
294==================================================
295downloaded 239 KB
296
297trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/R6_2.4.0.zip'
298Content type 'application/zip' length 58832 bytes (57 KB)
299==================================================
300downloaded 57 KB
301
302trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/RColorBrewer_1.1-2.zip'
303Content type 'application/zip' length 55569 bytes (54 KB)
304==================================================
305downloaded 54 KB
306
307trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/cli_1.1.0.zip'
308Content type 'application/zip' length 176572 bytes (172 KB)
309==================================================
310downloaded 172 KB
311
312trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/crayon_1.3.4.zip'
313Content type 'application/zip' length 749351 bytes (731 KB)
314==================================================
315downloaded 731 KB
316
317trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/fansi_0.4.0.zip'
318Content type 'application/zip' length 221318 bytes (216 KB)
319==================================================
320downloaded 216 KB
321
322trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/pillar_1.4.2.zip'
323Content type 'application/zip' length 182635 bytes (178 KB)
324==================================================
325downloaded 178 KB
326
327trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/pkgconfig_2.0.2.zip'
328Content type 'application/zip' length 22316 bytes (21 KB)
329==================================================
330downloaded 21 KB
331
332trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/bitops_1.0-6.zip'
333Content type 'application/zip' length 38469 bytes (37 KB)
334==================================================
335downloaded 37 KB
336
337trying URL 'https://bioconductor.org/packages/3.9/bioc/bin/windows/contrib/3.6/DelayedArray_0.10.0.zip'
338Content type 'application/zip' length 2239865 bytes (2.1 MB)
339==================================================
340downloaded 2.1 MB
341
342trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/digest_0.6.19.zip'
343Content type 'application/zip' length 211452 bytes (206 KB)
344==================================================
345downloaded 206 KB
346
347trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/gtable_0.3.0.zip'
348Content type 'application/zip' length 434187 bytes (424 KB)
349==================================================
350downloaded 424 KB
351
352trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/lazyeval_0.2.2.zip'
353Content type 'application/zip' length 172261 bytes (168 KB)
354==================================================
355downloaded 168 KB
356
357trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/reshape2_1.4.3.zip'
358Content type 'application/zip' length 627773 bytes (613 KB)
359==================================================
360downloaded 613 KB
361
362trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/rlang_0.4.0.zip'
363Content type 'application/zip' length 1090280 bytes (1.0 MB)
364==================================================
365downloaded 1.0 MB
366
367trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/scales_1.0.0.zip'
368Content type 'application/zip' length 1071774 bytes (1.0 MB)
369==================================================
370downloaded 1.0 MB
371
372trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/tibble_2.1.3.zip'
373Content type 'application/zip' length 337182 bytes (329 KB)
374==================================================
375downloaded 329 KB
376
377trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/viridisLite_0.3.0.zip'
378Content type 'application/zip' length 60698 bytes (59 KB)
379==================================================
380downloaded 59 KB
381
382trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/withr_2.1.2.zip'
383Content type 'application/zip' length 152233 bytes (148 KB)
384==================================================
385downloaded 148 KB
386
387trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/Rcpp_1.0.1.zip'
388Content type 'application/zip' length 4495059 bytes (4.3 MB)
389==================================================
390downloaded 4.3 MB
391
392trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/calibrate_1.7.2.zip'
393Content type 'application/zip' length 326111 bytes (318 KB)
394==================================================
395downloaded 318 KB
396
397trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/RCurl_1.95-4.12.zip'
398Content type 'application/zip' length 2974210 bytes (2.8 MB)
399==================================================
400downloaded 2.8 MB
401
402trying URL 'https://bioconductor.org/packages/3.9/bioc/bin/windows/contrib/3.6/zlibbioc_1.30.0.zip'
403Content type 'application/zip' length 374970 bytes (366 KB)
404==================================================
405downloaded 366 KB
406
407trying URL 'https://bioconductor.org/packages/3.9/bioc/bin/windows/contrib/3.6/S4Vectors_0.22.0.zip'
408Content type 'application/zip' length 2030028 bytes (1.9 MB)
409==================================================
410downloaded 1.9 MB
411
412trying URL 'https://bioconductor.org/packages/3.9/bioc/bin/windows/contrib/3.6/SummarizedExperiment_1.14.0.zip'
413Content type 'application/zip' length 2806553 bytes (2.7 MB)
414==================================================
415downloaded 2.7 MB
416
417trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/ggplot2_3.2.0.zip'
418Content type 'application/zip' length 3964600 bytes (3.8 MB)
419==================================================
420downloaded 3.8 MB
421
422trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/ggrepel_0.8.1.zip'
423Content type 'application/zip' length 1133065 bytes (1.1 MB)
424==================================================
425downloaded 1.1 MB
426
427trying URL 'https://cran.rstudio.com/bin/windows/contrib/3.6/qqman_0.1.4.zip'
428Content type 'application/zip' length 1415363 bytes (1.3 MB)
429==================================================
430downloaded 1.3 MB
431
432trying URL 'https://bioconductor.org/packages/3.9/bioc/bin/windows/contrib/3.6/limma_3.40.2.zip'
433Content type 'application/zip' length 3059804 bytes (2.9 MB)
434==================================================
435downloaded 2.9 MB
436
437trying URL 'https://bioconductor.org/packages/3.9/bioc/bin/windows/contrib/3.6/GenomeInfoDb_1.20.0.zip'
438Content type 'application/zip' length 3835294 bytes (3.7 MB)
439==================================================
440downloaded 3.7 MB
441
442trying URL 'https://bioconductor.org/packages/3.9/bioc/bin/windows/contrib/3.6/XVector_0.24.0.zip'
443Content type 'application/zip' length 714038 bytes (697 KB)
444==================================================
445downloaded 697 KB
446
447trying URL 'https://bioconductor.org/packages/3.9/bioc/bin/windows/contrib/3.6/BiocVersion_3.9.0.zip'
448Content type 'application/zip' length 8915 bytes
449==================================================
450downloaded 8915 bytes
451
452trying URL 'https://bioconductor.org/packages/3.9/bioc/bin/windows/contrib/3.6/Biobase_2.44.0.zip'
453Content type 'application/zip' length 2421976 bytes (2.3 MB)
454==================================================
455downloaded 2.3 MB
456
457trying URL 'https://bioconductor.org/packages/3.9/bioc/bin/windows/contrib/3.6/MultiDataSet_1.12.0.zip'
458Content type 'application/zip' length 1133701 bytes (1.1 MB)
459==================================================
460downloaded 1.1 MB
461
462trying URL 'https://bioconductor.org/packages/3.9/bioc/bin/windows/contrib/3.6/BiocGenerics_0.30.0.zip'
463Content type 'application/zip' length 736201 bytes (718 KB)
464==================================================
465downloaded 718 KB
466
467trying URL 'https://bioconductor.org/packages/3.9/bioc/bin/windows/contrib/3.6/GenomicRanges_1.36.0.zip'
468Content type 'application/zip' length 2135144 bytes (2.0 MB)
469==================================================
470downloaded 2.0 MB
471
472trying URL 'https://bioconductor.org/packages/3.9/bioc/bin/windows/contrib/3.6/IRanges_2.18.1.zip'
473Content type 'application/zip' length 2373684 bytes (2.3 MB)
474==================================================
475downloaded 2.3 MB
476
477package 'formatR' successfully unpacked and MD5 sums checked
478package 'lambda.r' successfully unpacked and MD5 sums checked
479package 'futile.options' successfully unpacked and MD5 sums checked
480package 'backports' successfully unpacked and MD5 sums checked
481package 'zeallot' successfully unpacked and MD5 sums checked
482package 'futile.logger' successfully unpacked and MD5 sums checked
483package 'snow' successfully unpacked and MD5 sums checked
484package 'BH' successfully unpacked and MD5 sums checked
485package 'glue' successfully unpacked and MD5 sums checked
486package 'magrittr' successfully unpacked and MD5 sums checked
487package 'stringi' successfully unpacked and MD5 sums checked
488package 'colorspace' successfully unpacked and MD5 sums checked
489package 'assertthat' successfully unpacked and MD5 sums checked
490package 'utf8' successfully unpacked and MD5 sums checked
491package 'vctrs' successfully unpacked and MD5 sums checked
492package 'matrixStats' successfully unpacked and MD5 sums checked
493package 'plyr' successfully unpacked and MD5 sums checked
494package 'stringr' successfully unpacked and MD5 sums checked
495package 'labeling' successfully unpacked and MD5 sums checked
496package 'munsell' successfully unpacked and MD5 sums checked
497package 'R6' successfully unpacked and MD5 sums checked
498package 'RColorBrewer' successfully unpacked and MD5 sums checked
499package 'cli' successfully unpacked and MD5 sums checked
500package 'crayon' successfully unpacked and MD5 sums checked
501package 'fansi' successfully unpacked and MD5 sums checked
502package 'pillar' successfully unpacked and MD5 sums checked
503package 'pkgconfig' successfully unpacked and MD5 sums checked
504package 'bitops' successfully unpacked and MD5 sums checked
505package 'DelayedArray' successfully unpacked and MD5 sums checked
506package 'digest' successfully unpacked and MD5 sums checked
507package 'gtable' successfully unpacked and MD5 sums checked
508package 'lazyeval' successfully unpacked and MD5 sums checked
509package 'reshape2' successfully unpacked and MD5 sums checked
510package 'rlang' successfully unpacked and MD5 sums checked
511package 'scales' successfully unpacked and MD5 sums checked
512package 'tibble' successfully unpacked and MD5 sums checked
513package 'viridisLite' successfully unpacked and MD5 sums checked
514package 'withr' successfully unpacked and MD5 sums checked
515package 'Rcpp' successfully unpacked and MD5 sums checked
516package 'calibrate' successfully unpacked and MD5 sums checked
517package 'RCurl' successfully unpacked and MD5 sums checked
518package 'zlibbioc' successfully unpacked and MD5 sums checked
519package 'S4Vectors' successfully unpacked and MD5 sums checked
520package 'SummarizedExperiment' successfully unpacked and MD5 sums checked
521package 'ggplot2' successfully unpacked and MD5 sums checked
522package 'ggrepel' successfully unpacked and MD5 sums checked
523package 'qqman' successfully unpacked and MD5 sums checked
524package 'limma' successfully unpacked and MD5 sums checked
525package 'GenomeInfoDb' successfully unpacked and MD5 sums checked
526package 'XVector' successfully unpacked and MD5 sums checked
527package 'BiocVersion' successfully unpacked and MD5 sums checked
528package 'Biobase' successfully unpacked and MD5 sums checked
529package 'MultiDataSet' successfully unpacked and MD5 sums checked
530package 'BiocGenerics' successfully unpacked and MD5 sums checked
531package 'GenomicRanges' successfully unpacked and MD5 sums checked
532package 'IRanges' successfully unpacked and MD5 sums checked
533
534The downloaded binary packages are in
535 C:\Users\appveyor\AppData\Local\Temp\1\RtmpEZn5pd\downloaded_packages
536installing the source packages 'BiocParallel', 'GenomeInfoDbData'
537
538trying URL 'https://bioconductor.org/packages/3.9/bioc/src/contrib/BiocParallel_1.18.0.tar.gz'
539Content type 'application/x-gzip' length 928675 bytes (906 KB)
540==================================================
541downloaded 906 KB
542
543trying URL 'https://bioconductor.org/packages/3.9/data/annotation/src/contrib/GenomeInfoDbData_1.2.1.tar.gz'
544Content type 'application/x-gzip' length 9792100 bytes (9.3 MB)
545==================================================
546downloaded 9.3 MB
547
548 installing source package 'BiocParallel' ...
549** using staged installation
550
551 **********************************************
552 WARNING: this package has a configure script
553 It probably needs manual configuration
554 **********************************************
555
556
557** libs
558
559*** arch - i386
560C:/Rtools/mingw_32/bin/g++ -std=gnu++11 -I"c:/R/include" -DNDEBUG -I"c:/RLibrary/BH/include" -O2 -Wall -mtune=generic -c ipcmutex.cpp -o ipcmutex.o
561In file included from c:/RLibrary/BH/include/boost/random/detail/integer_log2.hpp:19:0,
562 from c:/RLibrary/BH/include/boost/random/detail/large_arithmetic.hpp:19,
563 from c:/RLibrary/BH/include/boost/random/detail/const_mod.hpp:23,
564 from c:/RLibrary/BH/include/boost/random/detail/seed_impl.hpp:26,
565 from c:/RLibrary/BH/include/boost/random/mersenne_twister.hpp:30,
566 from c:/RLibrary/BH/include/boost/uuid/random_generator.hpp:17,
567 from c:/RLibrary/BH/include/boost/uuid/uuid_generators.hpp:17,
568 from ipcmutex.cpp:3:
569c:/RLibrary/BH/include/boost/pending/integer_log2.hpp:7:89: note: #pragma message: This header is deprecated. Use <boost/integer/integer_log2.hpp> instead.
570 BOOST_HEADER_DEPRECATED("<boost/integer/integer_log2.hpp>");
571 ^
572In file included from c:/RLibrary/BH/include/boost/container/map.hpp:30:0,
573 from c:/RLibrary/BH/include/boost/interprocess/sync/windows/sync_utils.hpp:37,
574 from c:/RLibrary/BH/include/boost/interprocess/mapped_region.hpp:50,
575 from c:/RLibrary/BH/include/boost/interprocess/detail/managed_open_or_create_impl.hpp:26,
576 from c:/RLibrary/BH/include/boost/interprocess/managed_shared_memory.hpp:26,
577 from ipcmutex.cpp:13:
578c:/RLibrary/BH/include/boost/container/detail/tree.hpp: In instantiation of 'T& boost::container::dtl::tree_node<T, VoidPointer, tree_type_value, OptimizeSize>::get_data() [with T = std::pair<const boost::interprocess::ipcdetail::sync_id* const, boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::pair<const boost::interprocess::ipcdetail::sync_id, void*> > > >; VoidPointer = void*; boost::container::tree_type_enum tree_type_value = (boost::container::tree_type_enum)0u; bool OptimizeSize = true]':
579c:/RLibrary/BH/include/boost/container/detail/iterators.hpp:854:36: required from 'boost::container::dtl::iterator_from_iiterator<IIterator, IsConst>::reference boost::container::dtl::iterator_from_iiterator<IIterator, IsConst>::operator*() const [with IIterator = boost::intrusive::tree_iterator<boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::interprocess::ipcdetail::sync_id* const, boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::pair<const boost::interprocess::ipcdetail::sync_id, void*> > > >, void*, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>, false>; bool IsConst = false; boost::container::dtl::iterator_from_iiterator<IIterator, IsConst>::reference = std::pair<const boost::interprocess::ipcdetail::sync_id* const, boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::pair<const boost::interprocess::ipcdetail::sync_id, void*> > > >&]'
580c:/RLibrary/BH/include/boost/container/detail/iterators.hpp:857:87: required from 'boost::container::dtl::iterator_from_iiterator<IIterator, IsConst>::pointer boost::container::dtl::iterator_from_iiterator<IIterator, IsConst>::operator->() const [with IIterator = boost::intrusive::tree_iterator<boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::interprocess::ipcdetail::sync_id* const, boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::pair<const boost::interprocess::ipcdetail::sync_id, void*> > > >, void*, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>, false>; bool IsConst = false; boost::container::dtl::iterator_from_iiterator<IIterator, IsConst>::pointer = std::pair<const boost::interprocess::ipcdetail::sync_id* const, boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::pair<const boost::interprocess::ipcdetail::sync_id, void*> > > >]'
581c:/RLibrary/BH/include/boost/interprocess/sync/windows/sync_utils.hpp:220:41: required from here
582c:/RLibrary/BH/include/boost/container/detail/tree.hpp:148:56: warning: dereferencing type-punned pointer will break strict-aliasing rules [-Wstrict-aliasing]
583 { return reinterpret_cast<T>(this->m_storage.data); }
584 ^
585c:/RLibrary/BH/include/boost/container/detail/tree.hpp: In instantiation of 'T& boost::container::dtl::tree_node<T, VoidPointer, tree_type_value, OptimizeSize>::get_data() [with T = std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>; VoidPointer = void; boost::container::tree_type_enum tree_type_value = (boost::container::tree_type_enum)0u; bool OptimizeSize = true]':
586c:/RLibrary/BH/include/boost/container/detail/iterators.hpp:854:36: required from 'boost::container::dtl::iterator_from_iiterator<IIterator, IsConst>::reference boost::container::dtl::iterator_from_iiterator<IIterator, IsConst>::operator*() const [with IIterator = boost::intrusive::tree_iterator<boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>, false>; bool IsConst = false; boost::container::dtl::iterator_from_iiterator<IIterator, IsConst>::reference = std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>&]'
587c:/RLibrary/BH/include/boost/container/detail/iterators.hpp:857:87: required from 'boost::container::dtl::iterator_from_iiterator<IIterator, IsConst>::pointer boost::container::dtl::iterator_from_iiterator<IIterator, IsConst>::operator->() const [with IIterator = boost::intrusive::tree_iterator<boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>, false>; bool IsConst = false; boost::container::dtl::iterator_from_iiterator<IIterator, IsConst>::pointer = std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>]'
588c:/RLibrary/BH/include/boost/interprocess/detail/windows_intermodule_singleton.hpp:192:20: required from here
589c:/RLibrary/BH/include/boost/container/detail/tree.hpp:148:56: warning: dereferencing type-punned pointer will break strict-aliasing rules [-Wstrict-aliasing]
590c:/RLibrary/BH/include/boost/container/detail/tree.hpp: In instantiation of 'boost::container::dtl::tree_node<T, VoidPointer, tree_type_value, OptimizeSize>::~tree_node() [with T = std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>; VoidPointer = void; boost::container::tree_type_enum tree_type_value = (boost::container::tree_type_enum)0u; bool OptimizeSize = true]':
591c:/RLibrary/BH/include/boost/container/allocator_traits.hpp:394:7: required from 'static void boost::container::allocator_traits::priv_destroy(boost::move_detail::false_type, Allocator&, T*) [with T = boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true>; Allocator = boost::container::new_allocator<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true> >; boost::move_detail::false_type = boost::move_detail::integral_constant<bool, false>]'
592c:/RLibrary/BH/include/boost/container/allocator_traits.hpp:322:48: required from 'static void boost::container::allocator_traits::destroy(Allocator&, T*) [with T = boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true>; Allocator = boost::container::new_allocator<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true> >]'
593c:/RLibrary/BH/include/boost/container/detail/destroyers.hpp:155:77: required from 'boost::container::dtl::scoped_destroy_deallocator::~scoped_destroy_deallocator() [with Allocator = boost::container::new_allocator<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true> >]'
594c:/RLibrary/BH/include/boost/container/detail/tree.hpp:947:88: required from 'boost::container::dtl::tree<T, KeyOfValue, Compare, Allocator, Options>::iterator boost::container::dtl::tree<T, KeyOfValue, Compare, Allocator, Options>::insert_unique_commit(MovableConvertible&&, boost::container::dtl::tree<T, KeyOfValue, Compare, Allocator, Options>::insert_commit_data&) [with MovableConvertible = std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>; T = std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>; KeyOfValue = boost::container::dtl::select1st<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >; Compare = std::less<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >; Allocator = boost::container::new_allocator<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr> >; Options = void; boost::container::dtl::tree<T, KeyOfValue, Compare, Allocator, Options>::iterator = boost::container::dtl::iterator_from_iiterator<boost::intrusive::tree_iterator<boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>, false>, false>; typename boost::container::dtl::intrusive_tree_type<Allocator, boost::intrusive::tree_value_compare<typename boost::container::allocator_traits::pointer, Compare, KeyOfValue>, typename boost::container::dtl::get_tree_opt::type:: tree_type, typename boost::container::dtl::get_tree_opt::type:: optimize_size>::type::iterator = boost::intrusive::tree_iterator<boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>, false>; boost::container::dtl::tree<T, KeyOfValue, Compare, Allocator, Options>::insert_commit_data = boost::intrusive::insert_commit_data_t<boost::intrusive::compact_rbtree_node<void*>>]'
595c:/RLibrary/BH/include/boost/container/detail/tree.hpp:960:20: required from 'std::pair<boost::container::dtl::iterator_from_iiterator<typename boost::container::dtl::intrusive_tree_type<Allocator, boost::intrusive::tree_value_compare<typename boost::container::allocator_traits::pointer, Compare, KeyOfValue>, typename boost::container::dtl::get_tree_opt::type:: tree_type, typename boost::container::dtl::get_tree_opt::type:: optimize_size>::type::iterator, false>, bool> boost::container::dtl::tree<T, KeyOfValue, Compare, Allocator, Options>::insert_unique(MovableConvertible&&) [with MovableConvertible = std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>; T = std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>; KeyOfValue = boost::container::dtl::select1st<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >; Compare = std::less<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >; Allocator = boost::container::new_allocator<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr> >; Options = void; typename boost::container::dtl::intrusive_tree_type<Allocator, boost::intrusive::tree_value_compare<typename boost::container::allocator_traits::pointer, Compare, KeyOfValue>, typename boost::container::dtl::get_tree_opt::type:: tree_type, typename boost::container::dtl::get_tree_opt::type:: optimize_size>::type::iterator = boost::intrusive::tree_iterator<boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>, false>]'
596c:/RLibrary/BH/include/boost/container/map.hpp:735:55: required from 'std::pair<typename boost::container::dtl::tree<std::pair<const Key, T>, boost::container::dtl::select1st, Compare, Allocator, Options>::iterator, bool> boost::container::map<Key, T, Compare, Allocator, Options>::insert(boost::container::map<Key, T, Compare, Allocator, Options>::value_type&&) [with Key = boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >; T = boost::interprocess::ipcdetail::ref_count_ptr; Compare = std::less<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >; Allocator = boost::container::new_allocator<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr> >; Options = void; typename boost::container::dtl::tree<std::pair<const Key, T>, boost::container::dtl::select1st, Compare, Allocator, Options>::iterator = boost::container::dtl::iterator_from_iiterator<boost::intrusive::tree_iterator<boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>, false>, false>; boost::container::map<Key, T, Compare, Allocator, Options>::value_type = std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>]'
597c:/RLibrary/BH/include/boost/interprocess/detail/windows_intermodule_singleton.hpp:203:99: required from here
598c:/RLibrary/BH/include/boost/container/detail/tree.hpp:172:7: warning: dereferencing type-punned pointer will break strict-aliasing rules [-Wstrict-aliasing]
599 { reinterpret_cast<internal_type*>(this->m_storage.data)->~internal_type(); }
600 ^
601c:/RLibrary/BH/include/boost/container/detail/tree.hpp: In instantiation of 'const T& boost::container::dtl::tree_node<T, VoidPointer, tree_type_value, OptimizeSize>::get_data() const [with T = std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>; VoidPointer = void*; boost::container::tree_type_enum tree_type_value = (boost::container::tree_type_enum)0u; bool OptimizeSize = true]':
602c:/RLibrary/BH/include/boost/container/detail/tree.hpp:443:41: required from 'static const key_type& boost::container::dtl::key_node_compare<KeyCompare, KeyOfValue>::key_from(const boost::container::dtl::tree_node<T, VoidPointer, tree_type_value, OptimizeSize>&) [with T = std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>; VoidPointer = void*; boost::container::tree_type_enum tree_type_value = (boost::container::tree_type_enum)0u; bool OptimizeSize = true; KeyCompare = std::less<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >; KeyOfValue = boost::container::dtl::select1st<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >; boost::container::dtl::key_node_compare<KeyCompare, KeyOfValue>::key_type = boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >]'
603c:/RLibrary/BH/include/boost/container/detail/tree.hpp:464:60: required from 'bool boost::container::dtl::key_node_compare<KeyCompare, KeyOfValue>::operator()(const key_type&, const U&) const [with U = boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true>; KeyCompare = std::less<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >; KeyOfValue = boost::container::dtl::select1st<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >; boost::container::dtl::key_node_compare<KeyCompare, KeyOfValue>::key_type = boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >]'
604c:/RLibrary/BH/include/boost/intrusive/detail/tree_value_compare.hpp:180:44: required from 'Ret boost::intrusive::tree_value_compare<ValuePtr, KeyCompare, KeyOfValue, Ret, true>::operator()(const U&, const key_type&, typename boost::intrusive::disable_if_smartref_to<U, ValuePtr>::type*) const [with U = boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >; ValuePtr = boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true>; KeyCompare = boost::container::dtl::key_node_compare<std::less<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >, boost::container::dtl::select1st<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > > >; KeyOfValue = boost::move_detail::identity<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void, (boost::container::tree_type_enum)0u, true> >; Ret = bool; boost::intrusive::tree_value_compare<ValuePtr, KeyCompare, KeyOfValue, Ret, true>::key_type = boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true>; typename boost::intrusive::disable_if_smartref_to<U, ValuePtr>::type = void]'
605c:/RLibrary/BH/include/boost/intrusive/detail/key_nodeptr_comp.hpp:110:19: required from 'bool boost::intrusive::detail::key_nodeptr_comp<KeyTypeKeyCompare, ValueTraits, KeyOfValue>::operator()(const T1&, const T2&, typename boost::move_detail::enable_if_c<((! boost::intrusive::detail::key_nodeptr_comp<KeyTypeKeyCompare, ValueTraits, KeyOfValue>::is_same_or_nodeptr_convertible::value) && boost::intrusive::detail::key_nodeptr_comp<KeyTypeKeyCompare, ValueTraits, KeyOfValue>::is_same_or_nodeptr_convertible::value), boost::intrusive::detail::key_nodeptr_comp<KeyTypeKeyCompare, ValueTraits, KeyOfValue>::sfinae_type*>::type) const [with T1 = boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >; T2 = boost::intrusive::compact_rbtree_node<void*>; KeyTypeKeyCompare = boost::container::dtl::key_node_compare<std::less<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >, boost::container::dtl::select1st<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > > >; ValueTraits = boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>; KeyOfValue = boost::move_detail::identity<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true> >; typename boost::move_detail::enable_if_c<((! boost::intrusive::detail::key_nodeptr_comp<KeyTypeKeyCompare, ValueTraits, KeyOfValue>::is_same_or_nodeptr_convertible::value) && boost::intrusive::detail::key_nodeptr_comp<KeyTypeKeyCompare, ValueTraits, KeyOfValue>::is_same_or_nodeptr_convertible::value), boost::intrusive::detail::key_nodeptr_comp<KeyTypeKeyCompare, ValueTraits, KeyOfValue>::sfinae_type*>::type = boost::intrusive::detail::key_nodeptr_comp<boost::container::dtl::key_node_compare<std::less<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >, boost::container::dtl::select1st<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > > >, boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>, boost::move_detail::identity<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true> > >::sfinae_type*]'
606c:/RLibrary/BH/include/boost/intrusive/bstree_algorithms.hpp:755:38: required from 'static boost::intrusive::bstree_algorithms::node_ptr boost::intrusive::bstree_algorithms::find(const const_node_ptr&, const KeyType&, KeyNodePtrCompare) [with KeyType = boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >; KeyNodePtrCompare = boost::intrusive::detail::key_nodeptr_comp<boost::container::dtl::key_node_compare<std::less<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >, boost::container::dtl::select1st<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > > >, boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>, boost::move_detail::identity<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true> > >; NodeTraits = boost::intrusive::rbtree_node_traits<void*, true>; boost::intrusive::bstree_algorithms::node_ptr = boost::intrusive::compact_rbtree_node<void*>; boost::intrusive::bstree_algorithms::const_node_ptr = const boost::intrusive::compact_rbtree_node<void>]'
607c:/RLibrary/BH/include/boost/intrusive/bstree.hpp:383:83: required from 'boost::intrusive::bstbase2<ValueTraits, VoidOrKeyOfValue, VoidOrKeyComp, AlgoType, HeaderHolder>::iterator boost::intrusive::bstbase2<ValueTraits, VoidOrKeyOfValue, VoidOrKeyComp, AlgoType, HeaderHolder>::find(const KeyType&, KeyTypeKeyCompare) [with KeyType = boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >; KeyTypeKeyCompare = boost::container::dtl::key_node_compare<std::less<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >, boost::container::dtl::select1st<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > > >; ValueTraits = boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>; VoidOrKeyOfValue = void; VoidOrKeyComp = boost::container::value_to_node_compare<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true>, boost::intrusive::tree_value_compare<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, std::less<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >, boost::container::dtl::select1st<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >, bool, false>, bool>; boost::intrusive::algo_types AlgoType = (boost::intrusive::algo_types)5u; HeaderHolder = void; boost::intrusive::bstbase2<ValueTraits, VoidOrKeyOfValue, VoidOrKeyComp, AlgoType, HeaderHolder>::iterator = boost::intrusive::tree_iterator<boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>, false>]'
608c:/RLibrary/BH/include/boost/container/detail/tree.hpp:1301:72: required from 'boost::container::dtl::tree<T, KeyOfValue, Compare, Allocator, Options>::iterator boost::container::dtl::tree<T, KeyOfValue, Compare, Allocator, Options>::find(const key_type&) [with T = std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>; KeyOfValue = boost::container::dtl::select1st<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >; Compare = std::less<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >; Allocator = boost::container::new_allocator<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr> >; Options = void; boost::container::dtl::tree<T, KeyOfValue, Compare, Allocator, Options>::iterator = boost::container::dtl::iterator_from_iiterator<boost::intrusive::tree_iterator<boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>, false>, false>; typename boost::container::dtl::intrusive_tree_type<Allocator, boost::intrusive::tree_value_compare<typename boost::container::allocator_traits::pointer, Compare, KeyOfValue>, typename boost::container::dtl::get_tree_opt::type:: tree_type, typename boost::container::dtl::get_tree_opt::type:: optimize_size>::type::iterator = boost::intrusive::tree_iterator<boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>, false>; boost::container::dtl::tree<T, KeyOfValue, Compare, Allocator, Options>::key_type = boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >]'
609c:/RLibrary/BH/include/boost/interprocess/detail/windows_intermodule_singleton.hpp:190:70: required from here
610c:/RLibrary/BH/include/boost/container/detail/tree.hpp:151:62: warning: dereferencing type-punned pointer will break strict-aliasing rules [-Wstrict-aliasing]
611 { return reinterpret_cast<const T>(this->m_storage.data); }
612 ^
613c:/RLibrary/BH/include/boost/container/detail/tree.hpp: In instantiation of 'const T& boost::container::dtl::tree_node<T, VoidPointer, tree_type_value, OptimizeSize>::get_data() const [with T = std::pair<const boost::interprocess::ipcdetail::sync_id* const, boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::pair<const boost::interprocess::ipcdetail::sync_id, void*> > > >; VoidPointer = void*; boost::container::tree_type_enum tree_type_value = (boost::container::tree_type_enum)0u; bool OptimizeSize = true]':
614c:/RLibrary/BH/include/boost/container/detail/tree.hpp:443:41: required from 'static const key_type& boost::container::dtl::key_node_compare<KeyCompare, KeyOfValue>::key_from(const boost::container::dtl::tree_node<T, VoidPointer, tree_type_value, OptimizeSize>&) [with T = std::pair<const boost::interprocess::ipcdetail::sync_id* const, boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::pair<const boost::interprocess::ipcdetail::sync_id, void*> > > >; VoidPointer = void*; boost::container::tree_type_enum tree_type_value = (boost::container::tree_type_enum)0u; bool OptimizeSize = true; KeyCompare = boost::interprocess::ipcdetail::sync_handles::address_less; KeyOfValue = boost::container::dtl::select1st<const boost::interprocess::ipcdetail::sync_id*>; boost::container::dtl::key_node_compare<KeyCompare, KeyOfValue>::key_type = const boost::interprocess::ipcdetail::sync_id*]'
615c:/RLibrary/BH/include/boost/container/detail/tree.hpp:468:60: required from 'bool boost::container::dtl::key_node_compare<KeyCompare, KeyOfValue>::operator()(const U&, const key_type&) const [with U = boost::container::dtl::tree_node<std::pair<const boost::interprocess::ipcdetail::sync_id* const, boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::pair<const boost::interprocess::ipcdetail::sync_id, void*> > > >, void*, (boost::container::tree_type_enum)0u, true>; KeyCompare = boost::interprocess::ipcdetail::sync_handles::address_less; KeyOfValue = boost::container::dtl::select1st<const boost::interprocess::ipcdetail::sync_id*>; boost::container::dtl::key_node_compare<KeyCompare, KeyOfValue>::key_type = const boost::interprocess::ipcdetail::sync_id*]'
616c:/RLibrary/BH/include/boost/intrusive/detail/tree_value_compare.hpp:175:44: required from 'Ret boost::intrusive::tree_value_compare<ValuePtr, KeyCompare, KeyOfValue, Ret, true>::operator()(const key_type&, const U&, typename boost::intrusive::disable_if_smartref_to<U, ValuePtr>::type*) const [with U = const boost::interprocess::ipcdetail::sync_id*; ValuePtr = boost::container::dtl::tree_node<std::pair<const boost::interprocess::ipcdetail::sync_id* const, boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::pair<const boost::interprocess::ipcdetail::sync_id, void*> > > >, void*, (boost::container::tree_type_enum)0u, true>; KeyCompare = boost::container::dtl::key_node_compare<boost::interprocess::ipcdetail::sync_handles::address_less, boost::container::dtl::select1st<const boost::interprocess::ipcdetail::sync_id> >; KeyOfValue = boost::move_detail::identity<boost::container::dtl::tree_node<std::pair<const boost::interprocess::ipcdetail::sync_id* const, boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::pair<const boost::interprocess::ipcdetail::sync_id, void*> > > >, void*, (boost::container::tree_type_enum)0u, true> >; Ret = bool; boost::intrusive::tree_value_compare<ValuePtr, KeyCompare, KeyOfValue, Ret, true>::key_type = boost::container::dtl::tree_node<std::pair<const boost::interprocess::ipcdetail::sync_id* const, boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::pair<const boost::interprocess::ipcdetail::sync_id, void*> > > >, void*, (boost::container::tree_type_enum)0u, true>; typename boost::intrusive::disable_if_smartref_to<U, ValuePtr>::type = void]'
617c:/RLibrary/BH/include/boost/intrusive/detail/key_nodeptr_comp.hpp:104:19: required from 'bool boost::intrusive::detail::key_nodeptr_comp<KeyTypeKeyCompare, ValueTraits, KeyOfValue>::operator()(const T1&, const T2&, typename boost::move_detail::enable_if_c<(boost::intrusive::detail::key_nodeptr_comp<KeyTypeKeyCompare, ValueTraits, KeyOfValue>::is_same_or_nodeptr_convertible::value && (! boost::intrusive::detail::key_nodeptr_comp<KeyTypeKeyCompare, ValueTraits, KeyOfValue>::is_same_or_nodeptr_convertible::value)), boost::intrusive::detail::key_nodeptr_comp<KeyTypeKeyCompare, ValueTraits, KeyOfValue>::sfinae_type*>::type) const [with T1 = boost::intrusive::compact_rbtree_node<void*>; T2 = const boost::interprocess::ipcdetail::sync_id; KeyTypeKeyCompare = boost::container::dtl::key_node_compare<boost::interprocess::ipcdetail::sync_handles::address_less, boost::container::dtl::select1st<const boost::interprocess::ipcdetail::sync_id*> >; ValueTraits = boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::interprocess::ipcdetail::sync_id* const, boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::pair<const boost::interprocess::ipcdetail::sync_id, void*> > > >, void*, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>; KeyOfValue = boost::move_detail::identity<boost::container::dtl::tree_node<std::pair<const boost::interprocess::ipcdetail::sync_id* const, boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::pair<const boost::interprocess::ipcdetail::sync_id, void*> > > >, void*, (boost::container::tree_type_enum)0u, true> >; typename boost::move_detail::enable_if_c<(boost::intrusive::detail::key_nodeptr_comp<KeyTypeKeyCompare, ValueTraits, KeyOfValue>::is_same_or_nodeptr_convertible::value && (! boost::intrusive::detail::key_nodeptr_comp<KeyTypeKeyCompare, ValueTraits, KeyOfValue>::is_same_or_nodeptr_convertible::value)), boost::intrusive::detail::key_nodeptr_comp<KeyTypeKeyCompare, ValueTraits, KeyOfValue>::sfinae_type*>::type = boost::intrusive::detail::key_nodeptr_comp<boost::container::dtl::key_node_compare<boost::interprocess::ipcdetail::sync_handles::address_less, boost::container::dtl::select1st<const boost::interprocess::ipcdetail::sync_id*> >, boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::interprocess::ipcdetail::sync_id* const, boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::pair<const boost::interprocess::ipcdetail::sync_id, void*> > > >, void*, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>, boost::move_detail::identity<boost::container::dtl::tree_node<std::pair<const boost::interprocess::ipcdetail::sync_id* const, boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::pair<const boost::interprocess::ipcdetail::sync_id, void*> > > >, void*, (boost::container::tree_type_enum)0u, true> > >::sfinae_type*]'
618c:/RLibrary/BH/include/boost/intrusive/bstree_algorithms.hpp:2028:24: required from 'static boost::intrusive::bstree_algorithms::node_ptr boost::intrusive::bstree_algorithms::lower_bound_loop(boost::intrusive::bstree_algorithms::node_ptr, boost::intrusive::bstree_algorithms::node_ptr, const KeyType&, KeyNodePtrCompare) [with KeyType = const boost::interprocess::ipcdetail::sync_id*; KeyNodePtrCompare = boost::intrusive::detail::key_nodeptr_comp<boost::container::dtl::key_node_compare<boost::interprocess::ipcdetail::sync_handles::address_less, boost::container::dtl::select1st<const boost::interprocess::ipcdetail::sync_id*> >, boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::interprocess::ipcdetail::sync_id* const, boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::pair<const boost::interprocess::ipcdetail::sync_id, void*> > > >, void*, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>, boost::move_detail::identity<boost::container::dtl::tree_node<std::pair<const boost::interprocess::ipcdetail::sync_id* const, boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::pair<const boost::interprocess::ipcdetail::sync_id, void*> > > >, void*, (boost::container::tree_type_enum)0u, true> > >; NodeTraits = boost::intrusive::rbtree_node_traits<void*, true>; boost::intrusive::bstree_algorithms::node_ptr = boost::intrusive::compact_rbtree_node<void*>]'
619c:/RLibrary/BH/include/boost/intrusive/bstree_algorithms.hpp:920:96: required from 'static boost::intrusive::bstree_algorithms::node_ptr boost::intrusive::bstree_algorithms::lower_bound(const const_node_ptr&, const KeyType&, KeyNodePtrCompare) [with KeyType = const boost::interprocess::ipcdetail::sync_id; KeyNodePtrCompare = boost::intrusive::detail::key_nodeptr_comp<boost::container::dtl::key_node_compare<boost::interprocess::ipcdetail::sync_handles::address_less, boost::container::dtl::select1st<const boost::interprocess::ipcdetail::sync_id*> >, boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::interprocess::ipcdetail::sync_id* const, boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::pair<const boost::interprocess::ipcdetail::sync_id, void*> > > >, void*, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>, boost::move_detail::identity<boost::container::dtl::tree_node<std::pair<const boost::interprocess::ipcdetail::sync_id* const, boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::pair<const boost::interprocess::ipcdetail::sync_id, void*> > > >, void*, (boost::container::tree_type_enum)0u, true> > >; NodeTraits = boost::intrusive::rbtree_node_traits<void*, true>; boost::intrusive::bstree_algorithms::node_ptr = boost::intrusive::compact_rbtree_node<void*>; boost::intrusive::bstree_algorithms::const_node_ptr = const boost::intrusive::compact_rbtree_node<void>]'
620c:/RLibrary/BH/include/boost/intrusive/bstree.hpp:334:61: required from 'boost::intrusive::bstbase2<ValueTraits, VoidOrKeyOfValue, VoidOrKeyComp, AlgoType, HeaderHolder>::iterator boost::intrusive::bstbase2<ValueTraits, VoidOrKeyOfValue, VoidOrKeyComp, AlgoType, HeaderHolder>::lower_bound(const KeyType&, KeyTypeKeyCompare) [with KeyType = const boost::interprocess::ipcdetail::sync_id; KeyTypeKeyCompare = boost::container::dtl::key_node_compare<boost::interprocess::ipcdetail::sync_handles::address_less, boost::container::dtl::select1st<const boost::interprocess::ipcdetail::sync_id*> >; ValueTraits = boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::interprocess::ipcdetail::sync_id* const, boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::pair<const boost::interprocess::ipcdetail::sync_id, void*> > > >, void*, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>; VoidOrKeyOfValue = void; VoidOrKeyComp = boost::container::value_to_node_compare<boost::container::dtl::tree_node<std::pair<const boost::interprocess::ipcdetail::sync_id* const, boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::pair<const boost::interprocess::ipcdetail::sync_id, void*> > > >, void*, (boost::container::tree_type_enum)0u, true>, boost::intrusive::tree_value_compare<std::pair<const boost::interprocess::ipcdetail::sync_id* const, boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::pair<const boost::interprocess::ipcdetail::sync_id, void*> > > >, boost::interprocess::ipcdetail::sync_handles::address_less, boost::container::dtl::select1st<const boost::interprocess::ipcdetail::sync_id>, bool, false>, bool>; boost::intrusive::algo_types AlgoType = (boost::intrusive::algo_types)5u; HeaderHolder = void; boost::intrusive::bstbase2<ValueTraits, VoidOrKeyOfValue, VoidOrKeyComp, AlgoType, HeaderHolder>::iterator = boost::intrusive::tree_iterator<boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::interprocess::ipcdetail::sync_id* const, boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::pair<const boost::interprocess::ipcdetail::sync_id, void*> > > >, void*, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>, false>]'
621c:/RLibrary/BH/include/boost/container/detail/tree.hpp:1337:79: required from 'boost::container::dtl::tree<T, KeyOfValue, Compare, Allocator, Options>::iterator boost::container::dtl::tree<T, KeyOfValue, Compare, Allocator, Options>::lower_bound(const key_type&) [with T = std::pair<const boost::interprocess::ipcdetail::sync_id* const, boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::pair<const boost::interprocess::ipcdetail::sync_id, void*> > > >; KeyOfValue = boost::container::dtl::select1st<const boost::interprocess::ipcdetail::sync_id*>; Compare = boost::interprocess::ipcdetail::sync_handles::address_less; Allocator = boost::container::new_allocator<std::pair<const boost::interprocess::ipcdetail::sync_id* const, boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::pair<const boost::interprocess::ipcdetail::sync_id, void*> > > > >; Options = void; boost::container::dtl::tree<T, KeyOfValue, Compare, Allocator, Options>::iterator = boost::container::dtl::iterator_from_iiterator<boost::intrusive::tree_iterator<boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::interprocess::ipcdetail::sync_id* const, boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::pair<const boost::interprocess::ipcdetail::sync_id, void*> > > >, void*, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>, false>, false>; typename boost::container::dtl::intrusive_tree_type<Allocator, boost::intrusive::tree_value_compare<typename boost::container::allocator_traits::pointer, Compare, KeyOfValue>, typename boost::container::dtl::get_tree_opt::type:: tree_type, typename boost::container::dtl::get_tree_opt::type:: optimize_size>::type::iterator = boost::intrusive::tree_iterator<boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::interprocess::ipcdetail::sync_id* const, boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::pair<const boost::interprocess::ipcdetail::sync_id, void*> > > >, void*, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>, false>; boost::container::dtl::tree<T, KeyOfValue, Compare, Allocator, Options>::key_type = const boost::interprocess::ipcdetail::sync_id*]'
622c:/RLibrary/BH/include/boost/interprocess/sync/windows/sync_utils.hpp:217:56: required from here
623c:/RLibrary/BH/include/boost/container/detail/tree.hpp:151:62: warning: dereferencing type-punned pointer will break strict-aliasing rules [-Wstrict-aliasing]
624C:/Rtools/mingw_32/bin/g++ -shared -s -static-libgcc -o BiocParallel.dll tmp.def ipcmutex.o -Lc:/R/bin/i386 -lR
625installing to c:/RLibrary/00LOCK-BiocParallel/00new/BiocParallel/libs/i386
626
627*** arch - x64
628C:/Rtools/mingw_64/bin/g++ -std=gnu++11 -I"c:/R/include" -DNDEBUG -I"c:/RLibrary/BH/include" -O2 -Wall -mtune=generic -c ipcmutex.cpp -o ipcmutex.o
629In file included from c:/RLibrary/BH/include/boost/random/detail/integer_log2.hpp:19:0,
630 from c:/RLibrary/BH/include/boost/random/detail/large_arithmetic.hpp:19,
631 from c:/RLibrary/BH/include/boost/random/detail/const_mod.hpp:23,
632 from c:/RLibrary/BH/include/boost/random/detail/seed_impl.hpp:26,
633 from c:/RLibrary/BH/include/boost/random/mersenne_twister.hpp:30,
634 from c:/RLibrary/BH/include/boost/uuid/random_generator.hpp:17,
635 from c:/RLibrary/BH/include/boost/uuid/uuid_generators.hpp:17,
636 from ipcmutex.cpp:3:
637c:/RLibrary/BH/include/boost/pending/integer_log2.hpp:7:89: note: #pragma message: This header is deprecated. Use <boost/integer/integer_log2.hpp> instead.
638 BOOST_HEADER_DEPRECATED("<boost/integer/integer_log2.hpp>");
639 ^
640In file included from c:/RLibrary/BH/include/boost/container/map.hpp:30:0,
641 from c:/RLibrary/BH/include/boost/interprocess/sync/windows/sync_utils.hpp:37,
642 from c:/RLibrary/BH/include/boost/interprocess/mapped_region.hpp:50,
643 from c:/RLibrary/BH/include/boost/interprocess/detail/managed_open_or_create_impl.hpp:26,
644 from c:/RLibrary/BH/include/boost/interprocess/managed_shared_memory.hpp:26,
645 from ipcmutex.cpp:13:
646c:/RLibrary/BH/include/boost/container/detail/tree.hpp: In instantiation of 'T& boost::container::dtl::tree_node<T, VoidPointer, tree_type_value, OptimizeSize>::get_data() [with T = std::pair<const boost::interprocess::ipcdetail::sync_id* const, boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::pair<const boost::interprocess::ipcdetail::sync_id, void*> > > >; VoidPointer = void*; boost::container::tree_type_enum tree_type_value = (boost::container::tree_type_enum)0u; bool OptimizeSize = true]':
647c:/RLibrary/BH/include/boost/container/detail/iterators.hpp:854:36: required from 'boost::container::dtl::iterator_from_iiterator<IIterator, IsConst>::reference boost::container::dtl::iterator_from_iiterator<IIterator, IsConst>::operator*() const [with IIterator = boost::intrusive::tree_iterator<boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::interprocess::ipcdetail::sync_id* const, boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::pair<const boost::interprocess::ipcdetail::sync_id, void*> > > >, void*, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>, false>; bool IsConst = false; boost::container::dtl::iterator_from_iiterator<IIterator, IsConst>::reference = std::pair<const boost::interprocess::ipcdetail::sync_id* const, boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::pair<const boost::interprocess::ipcdetail::sync_id, void*> > > >&]'
648c:/RLibrary/BH/include/boost/container/detail/iterators.hpp:857:87: required from 'boost::container::dtl::iterator_from_iiterator<IIterator, IsConst>::pointer boost::container::dtl::iterator_from_iiterator<IIterator, IsConst>::operator->() const [with IIterator = boost::intrusive::tree_iterator<boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::interprocess::ipcdetail::sync_id* const, boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::pair<const boost::interprocess::ipcdetail::sync_id, void*> > > >, void*, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>, false>; bool IsConst = false; boost::container::dtl::iterator_from_iiterator<IIterator, IsConst>::pointer = std::pair<const boost::interprocess::ipcdetail::sync_id* const, boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::pair<const boost::interprocess::ipcdetail::sync_id, void*> > > >]'
649c:/RLibrary/BH/include/boost/interprocess/sync/windows/sync_utils.hpp:220:41: required from here
650c:/RLibrary/BH/include/boost/container/detail/tree.hpp:148:56: warning: dereferencing type-punned pointer will break strict-aliasing rules [-Wstrict-aliasing]
651 { return reinterpret_cast<T>(this->m_storage.data); }
652 ^
653c:/RLibrary/BH/include/boost/container/detail/tree.hpp: In instantiation of 'T& boost::container::dtl::tree_node<T, VoidPointer, tree_type_value, OptimizeSize>::get_data() [with T = std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>; VoidPointer = void; boost::container::tree_type_enum tree_type_value = (boost::container::tree_type_enum)0u; bool OptimizeSize = true]':
654c:/RLibrary/BH/include/boost/container/detail/iterators.hpp:854:36: required from 'boost::container::dtl::iterator_from_iiterator<IIterator, IsConst>::reference boost::container::dtl::iterator_from_iiterator<IIterator, IsConst>::operator*() const [with IIterator = boost::intrusive::tree_iterator<boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>, false>; bool IsConst = false; boost::container::dtl::iterator_from_iiterator<IIterator, IsConst>::reference = std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>&]'
655c:/RLibrary/BH/include/boost/container/detail/iterators.hpp:857:87: required from 'boost::container::dtl::iterator_from_iiterator<IIterator, IsConst>::pointer boost::container::dtl::iterator_from_iiterator<IIterator, IsConst>::operator->() const [with IIterator = boost::intrusive::tree_iterator<boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>, false>; bool IsConst = false; boost::container::dtl::iterator_from_iiterator<IIterator, IsConst>::pointer = std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>]'
656c:/RLibrary/BH/include/boost/interprocess/detail/windows_intermodule_singleton.hpp:192:20: required from here
657c:/RLibrary/BH/include/boost/container/detail/tree.hpp:148:56: warning: dereferencing type-punned pointer will break strict-aliasing rules [-Wstrict-aliasing]
658c:/RLibrary/BH/include/boost/container/detail/tree.hpp: In instantiation of 'boost::container::dtl::tree_node<T, VoidPointer, tree_type_value, OptimizeSize>::~tree_node() [with T = std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>; VoidPointer = void; boost::container::tree_type_enum tree_type_value = (boost::container::tree_type_enum)0u; bool OptimizeSize = true]':
659c:/RLibrary/BH/include/boost/container/allocator_traits.hpp:394:7: required from 'static void boost::container::allocator_traits::priv_destroy(boost::move_detail::false_type, Allocator&, T*) [with T = boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true>; Allocator = boost::container::new_allocator<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true> >; boost::move_detail::false_type = boost::move_detail::integral_constant<bool, false>]'
660c:/RLibrary/BH/include/boost/container/allocator_traits.hpp:322:48: required from 'static void boost::container::allocator_traits::destroy(Allocator&, T*) [with T = boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true>; Allocator = boost::container::new_allocator<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true> >]'
661c:/RLibrary/BH/include/boost/container/detail/destroyers.hpp:155:77: required from 'boost::container::dtl::scoped_destroy_deallocator::~scoped_destroy_deallocator() [with Allocator = boost::container::new_allocator<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true> >]'
662c:/RLibrary/BH/include/boost/container/detail/tree.hpp:947:88: required from 'boost::container::dtl::tree<T, KeyOfValue, Compare, Allocator, Options>::iterator boost::container::dtl::tree<T, KeyOfValue, Compare, Allocator, Options>::insert_unique_commit(MovableConvertible&&, boost::container::dtl::tree<T, KeyOfValue, Compare, Allocator, Options>::insert_commit_data&) [with MovableConvertible = std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>; T = std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>; KeyOfValue = boost::container::dtl::select1st<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >; Compare = std::less<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >; Allocator = boost::container::new_allocator<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr> >; Options = void; boost::container::dtl::tree<T, KeyOfValue, Compare, Allocator, Options>::iterator = boost::container::dtl::iterator_from_iiterator<boost::intrusive::tree_iterator<boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>, false>, false>; typename boost::container::dtl::intrusive_tree_type<Allocator, boost::intrusive::tree_value_compare<typename boost::container::allocator_traits::pointer, Compare, KeyOfValue>, typename boost::container::dtl::get_tree_opt::type:: tree_type, typename boost::container::dtl::get_tree_opt::type:: optimize_size>::type::iterator = boost::intrusive::tree_iterator<boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>, false>; boost::container::dtl::tree<T, KeyOfValue, Compare, Allocator, Options>::insert_commit_data = boost::intrusive::insert_commit_data_t<boost::intrusive::compact_rbtree_node<void*>>]'
663c:/RLibrary/BH/include/boost/container/detail/tree.hpp:960:20: required from 'std::pair<boost::container::dtl::iterator_from_iiterator<typename boost::container::dtl::intrusive_tree_type<Allocator, boost::intrusive::tree_value_compare<typename boost::container::allocator_traits::pointer, Compare, KeyOfValue>, typename boost::container::dtl::get_tree_opt::type:: tree_type, typename boost::container::dtl::get_tree_opt::type:: optimize_size>::type::iterator, false>, bool> boost::container::dtl::tree<T, KeyOfValue, Compare, Allocator, Options>::insert_unique(MovableConvertible&&) [with MovableConvertible = std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>; T = std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>; KeyOfValue = boost::container::dtl::select1st<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >; Compare = std::less<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >; Allocator = boost::container::new_allocator<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr> >; Options = void; typename boost::container::dtl::intrusive_tree_type<Allocator, boost::intrusive::tree_value_compare<typename boost::container::allocator_traits::pointer, Compare, KeyOfValue>, typename boost::container::dtl::get_tree_opt::type:: tree_type, typename boost::container::dtl::get_tree_opt::type:: optimize_size>::type::iterator = boost::intrusive::tree_iterator<boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>, false>]'
664c:/RLibrary/BH/include/boost/container/map.hpp:735:55: required from 'std::pair<typename boost::container::dtl::tree<std::pair<const Key, T>, boost::container::dtl::select1st, Compare, Allocator, Options>::iterator, bool> boost::container::map<Key, T, Compare, Allocator, Options>::insert(boost::container::map<Key, T, Compare, Allocator, Options>::value_type&&) [with Key = boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >; T = boost::interprocess::ipcdetail::ref_count_ptr; Compare = std::less<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >; Allocator = boost::container::new_allocator<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr> >; Options = void; typename boost::container::dtl::tree<std::pair<const Key, T>, boost::container::dtl::select1st, Compare, Allocator, Options>::iterator = boost::container::dtl::iterator_from_iiterator<boost::intrusive::tree_iterator<boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>, false>, false>; boost::container::map<Key, T, Compare, Allocator, Options>::value_type = std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>]'
665c:/RLibrary/BH/include/boost/interprocess/detail/windows_intermodule_singleton.hpp:203:99: required from here
666c:/RLibrary/BH/include/boost/container/detail/tree.hpp:172:7: warning: dereferencing type-punned pointer will break strict-aliasing rules [-Wstrict-aliasing]
667 { reinterpret_cast<internal_type*>(this->m_storage.data)->~internal_type(); }
668 ^
669c:/RLibrary/BH/include/boost/container/detail/tree.hpp: In instantiation of 'const T& boost::container::dtl::tree_node<T, VoidPointer, tree_type_value, OptimizeSize>::get_data() const [with T = std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>; VoidPointer = void*; boost::container::tree_type_enum tree_type_value = (boost::container::tree_type_enum)0u; bool OptimizeSize = true]':
670c:/RLibrary/BH/include/boost/container/detail/tree.hpp:443:41: required from 'static const key_type& boost::container::dtl::key_node_compare<KeyCompare, KeyOfValue>::key_from(const boost::container::dtl::tree_node<T, VoidPointer, tree_type_value, OptimizeSize>&) [with T = std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>; VoidPointer = void*; boost::container::tree_type_enum tree_type_value = (boost::container::tree_type_enum)0u; bool OptimizeSize = true; KeyCompare = std::less<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >; KeyOfValue = boost::container::dtl::select1st<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >; boost::container::dtl::key_node_compare<KeyCompare, KeyOfValue>::key_type = boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >]'
671c:/RLibrary/BH/include/boost/container/detail/tree.hpp:464:60: required from 'bool boost::container::dtl::key_node_compare<KeyCompare, KeyOfValue>::operator()(const key_type&, const U&) const [with U = boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true>; KeyCompare = std::less<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >; KeyOfValue = boost::container::dtl::select1st<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >; boost::container::dtl::key_node_compare<KeyCompare, KeyOfValue>::key_type = boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >]'
672c:/RLibrary/BH/include/boost/intrusive/detail/tree_value_compare.hpp:180:44: required from 'Ret boost::intrusive::tree_value_compare<ValuePtr, KeyCompare, KeyOfValue, Ret, true>::operator()(const U&, const key_type&, typename boost::intrusive::disable_if_smartref_to<U, ValuePtr>::type*) const [with U = boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >; ValuePtr = boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true>; KeyCompare = boost::container::dtl::key_node_compare<std::less<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >, boost::container::dtl::select1st<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > > >; KeyOfValue = boost::move_detail::identity<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void, (boost::container::tree_type_enum)0u, true> >; Ret = bool; boost::intrusive::tree_value_compare<ValuePtr, KeyCompare, KeyOfValue, Ret, true>::key_type = boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true>; typename boost::intrusive::disable_if_smartref_to<U, ValuePtr>::type = void]'
673c:/RLibrary/BH/include/boost/intrusive/detail/key_nodeptr_comp.hpp:110:19: required from 'bool boost::intrusive::detail::key_nodeptr_comp<KeyTypeKeyCompare, ValueTraits, KeyOfValue>::operator()(const T1&, const T2&, typename boost::move_detail::enable_if_c<((! boost::intrusive::detail::key_nodeptr_comp<KeyTypeKeyCompare, ValueTraits, KeyOfValue>::is_same_or_nodeptr_convertible::value) && boost::intrusive::detail::key_nodeptr_comp<KeyTypeKeyCompare, ValueTraits, KeyOfValue>::is_same_or_nodeptr_convertible::value), boost::intrusive::detail::key_nodeptr_comp<KeyTypeKeyCompare, ValueTraits, KeyOfValue>::sfinae_type*>::type) const [with T1 = boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >; T2 = boost::intrusive::compact_rbtree_node<void*>; KeyTypeKeyCompare = boost::container::dtl::key_node_compare<std::less<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >, boost::container::dtl::select1st<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > > >; ValueTraits = boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>; KeyOfValue = boost::move_detail::identity<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true> >; typename boost::move_detail::enable_if_c<((! boost::intrusive::detail::key_nodeptr_comp<KeyTypeKeyCompare, ValueTraits, KeyOfValue>::is_same_or_nodeptr_convertible::value) && boost::intrusive::detail::key_nodeptr_comp<KeyTypeKeyCompare, ValueTraits, KeyOfValue>::is_same_or_nodeptr_convertible::value), boost::intrusive::detail::key_nodeptr_comp<KeyTypeKeyCompare, ValueTraits, KeyOfValue>::sfinae_type*>::type = boost::intrusive::detail::key_nodeptr_comp<boost::container::dtl::key_node_compare<std::less<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >, boost::container::dtl::select1st<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > > >, boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>, boost::move_detail::identity<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true> > >::sfinae_type*]'
674c:/RLibrary/BH/include/boost/intrusive/bstree_algorithms.hpp:755:38: required from 'static boost::intrusive::bstree_algorithms::node_ptr boost::intrusive::bstree_algorithms::find(const const_node_ptr&, const KeyType&, KeyNodePtrCompare) [with KeyType = boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >; KeyNodePtrCompare = boost::intrusive::detail::key_nodeptr_comp<boost::container::dtl::key_node_compare<std::less<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >, boost::container::dtl::select1st<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > > >, boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>, boost::move_detail::identity<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true> > >; NodeTraits = boost::intrusive::rbtree_node_traits<void*, true>; boost::intrusive::bstree_algorithms::node_ptr = boost::intrusive::compact_rbtree_node<void*>; boost::intrusive::bstree_algorithms::const_node_ptr = const boost::intrusive::compact_rbtree_node<void>]'
675c:/RLibrary/BH/include/boost/intrusive/bstree.hpp:383:83: required from 'boost::intrusive::bstbase2<ValueTraits, VoidOrKeyOfValue, VoidOrKeyComp, AlgoType, HeaderHolder>::iterator boost::intrusive::bstbase2<ValueTraits, VoidOrKeyOfValue, VoidOrKeyComp, AlgoType, HeaderHolder>::find(const KeyType&, KeyTypeKeyCompare) [with KeyType = boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >; KeyTypeKeyCompare = boost::container::dtl::key_node_compare<std::less<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >, boost::container::dtl::select1st<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > > >; ValueTraits = boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>; VoidOrKeyOfValue = void; VoidOrKeyComp = boost::container::value_to_node_compare<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true>, boost::intrusive::tree_value_compare<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, std::less<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >, boost::container::dtl::select1st<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >, bool, false>, bool>; boost::intrusive::algo_types AlgoType = (boost::intrusive::algo_types)5u; HeaderHolder = void; boost::intrusive::bstbase2<ValueTraits, VoidOrKeyOfValue, VoidOrKeyComp, AlgoType, HeaderHolder>::iterator = boost::intrusive::tree_iterator<boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>, false>]'
676c:/RLibrary/BH/include/boost/container/detail/tree.hpp:1301:72: required from 'boost::container::dtl::tree<T, KeyOfValue, Compare, Allocator, Options>::iterator boost::container::dtl::tree<T, KeyOfValue, Compare, Allocator, Options>::find(const key_type&) [with T = std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>; KeyOfValue = boost::container::dtl::select1st<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >; Compare = std::less<boost::container::basic_string<char, std::char_traits, boost::container::new_allocator > >; Allocator = boost::container::new_allocator<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr> >; Options = void; boost::container::dtl::tree<T, KeyOfValue, Compare, Allocator, Options>::iterator = boost::container::dtl::iterator_from_iiterator<boost::intrusive::tree_iterator<boost::intrusive::bhtraits<boost::container::dtl::tree_node<std::pair<const boost::container::basic_string<char, std::char_traits, boost::container::new_allocator >, boost::interprocess::ipcdetail::ref_count_ptr>, void*, (boost::container::tree_type_enum)0u, true>, boost::intrusive::rbtree_node_traits<void*, true>, (boost::intrusive::link_mode_type)0u, boost::intrusive::dft_tag, 3u>, false>, false>; typename boost::container::dtl::intrusive_tree_type<Allocator, boost::intrusive::tree_value_compare<typename boost::container::allocator_traits
Attached is the screen shot
This is a free service and has a 60 minutes time limit, see https://www.appveyor.com/pricing/
Hi Gaborcsardi,
I ran checks on windows machine, it took less than 5 min to check those examples. I have no clue on this ! Is this something related to AppVeyor ?
Thanks for help!
-Rohith
Probably one of your examples freezes. Try to find which one, and then investigate why.