0s autopkgtest [16:22:35]: starting date and time: 2025-03-15 16:22:35+0000 0s autopkgtest [16:22:35]: git checkout: 325255d2 Merge branch 'pin-any-arch' into 'ubuntu/production' 0s autopkgtest [16:22:35]: host juju-7f2275-prod-proposed-migration-environment-9; command line: /home/ubuntu/autopkgtest/runner/autopkgtest --output-dir /tmp/autopkgtest-work.oc8cys_8/out --timeout-copy=6000 --setup-commands 'ln -s /dev/null /etc/systemd/system/bluetooth.service; printf "http_proxy=http://squid.internal:3128\nhttps_proxy=http://squid.internal:3128\nno_proxy=127.0.0.1,127.0.1.1,login.ubuntu.com,localhost,localdomain,novalocal,internal,archive.ubuntu.com,ports.ubuntu.com,security.ubuntu.com,ddebs.ubuntu.com,changelogs.ubuntu.com,keyserver.ubuntu.com,launchpadlibrarian.net,launchpadcontent.net,launchpad.net,10.24.0.0/24,keystone.ps5.canonical.com,objectstorage.prodstack5.canonical.com,radosgw.ps5.canonical.com\n" >> /etc/environment' --apt-pocket=proposed=src:glibc --apt-upgrade r-cran-network --timeout-short=300 --timeout-copy=20000 --timeout-build=20000 --env=ADT_TEST_TRIGGERS=glibc/2.41-1ubuntu2 -- lxd -r lxd-armhf-10.145.243.76 lxd-armhf-10.145.243.76:autopkgtest/ubuntu/plucky/armhf 21s autopkgtest [16:22:56]: testbed dpkg architecture: armhf 23s autopkgtest [16:22:58]: testbed apt version: 2.9.33 26s autopkgtest [16:23:01]: @@@@@@@@@@@@@@@@@@@@ test bed setup 28s autopkgtest [16:23:03]: testbed release detected to be: None 36s autopkgtest [16:23:11]: updating testbed package index (apt update) 38s Get:1 http://ftpmaster.internal/ubuntu plucky-proposed InRelease [126 kB] 38s Get:2 http://ftpmaster.internal/ubuntu plucky InRelease [257 kB] 38s Get:3 http://ftpmaster.internal/ubuntu plucky-updates InRelease [126 kB] 39s Get:4 http://ftpmaster.internal/ubuntu plucky-security InRelease [126 kB] 39s Get:5 http://ftpmaster.internal/ubuntu plucky-proposed/universe Sources [379 kB] 39s Get:6 http://ftpmaster.internal/ubuntu plucky-proposed/main Sources [99.7 kB] 40s Get:7 http://ftpmaster.internal/ubuntu plucky-proposed/multiverse Sources [15.8 kB] 40s Get:8 http://ftpmaster.internal/ubuntu plucky-proposed/main armhf Packages [114 kB] 40s Get:9 http://ftpmaster.internal/ubuntu plucky-proposed/main armhf c-n-f Metadata [1832 B] 40s Get:10 http://ftpmaster.internal/ubuntu plucky-proposed/restricted armhf c-n-f Metadata [116 B] 40s Get:11 http://ftpmaster.internal/ubuntu plucky-proposed/universe armhf Packages [312 kB] 40s Get:12 http://ftpmaster.internal/ubuntu plucky-proposed/universe armhf c-n-f Metadata [11.1 kB] 40s Get:13 http://ftpmaster.internal/ubuntu plucky-proposed/multiverse armhf Packages [3472 B] 40s Get:14 http://ftpmaster.internal/ubuntu plucky-proposed/multiverse armhf c-n-f Metadata [240 B] 40s Get:15 http://ftpmaster.internal/ubuntu plucky/multiverse Sources [299 kB] 40s Get:16 http://ftpmaster.internal/ubuntu plucky/universe Sources [21.0 MB] 64s Get:17 http://ftpmaster.internal/ubuntu plucky/main Sources [1394 kB] 66s Get:18 http://ftpmaster.internal/ubuntu plucky/main armhf Packages [1378 kB] 67s Get:19 http://ftpmaster.internal/ubuntu plucky/main armhf c-n-f Metadata [29.4 kB] 67s Get:20 http://ftpmaster.internal/ubuntu plucky/restricted armhf c-n-f Metadata [108 B] 67s Get:21 http://ftpmaster.internal/ubuntu plucky/universe armhf Packages [15.1 MB] 84s Get:22 http://ftpmaster.internal/ubuntu plucky/multiverse armhf Packages [172 kB] 86s Fetched 41.0 MB in 48s (848 kB/s) 87s Reading package lists... 96s autopkgtest [16:24:11]: upgrading testbed (apt dist-upgrade and autopurge) 98s Reading package lists... 99s Building dependency tree... 99s Reading state information... 99s Calculating upgrade...Starting pkgProblemResolver with broken count: 0 99s Starting 2 pkgProblemResolver with broken count: 0 99s Done 100s Entering ResolveByKeep 100s 101s Calculating upgrade... 101s The following packages will be upgraded: 101s libc-bin libc6 locales pinentry-curses python3-jinja2 sos strace 101s 7 upgraded, 0 newly installed, 0 to remove and 0 not upgraded. 101s Need to get 8683 kB of archives. 101s After this operation, 23.6 kB of additional disk space will be used. 101s Get:1 http://ftpmaster.internal/ubuntu plucky-proposed/main armhf libc6 armhf 2.41-1ubuntu2 [2932 kB] 105s Get:2 http://ftpmaster.internal/ubuntu plucky-proposed/main armhf libc-bin armhf 2.41-1ubuntu2 [545 kB] 106s Get:3 http://ftpmaster.internal/ubuntu plucky-proposed/main armhf locales all 2.41-1ubuntu2 [4246 kB] 111s Get:4 http://ftpmaster.internal/ubuntu plucky/main armhf strace armhf 6.13+ds-1ubuntu1 [445 kB] 111s Get:5 http://ftpmaster.internal/ubuntu plucky/main armhf pinentry-curses armhf 1.3.1-2ubuntu3 [40.6 kB] 111s Get:6 http://ftpmaster.internal/ubuntu plucky/main armhf python3-jinja2 all 3.1.5-2ubuntu1 [109 kB] 111s Get:7 http://ftpmaster.internal/ubuntu plucky/main armhf sos all 4.9.0-5 [365 kB] 112s Preconfiguring packages ... 112s Fetched 8683 kB in 11s (825 kB/s) 113s (Reading database ... (Reading database ... 5% (Reading database ... 10% (Reading database ... 15% (Reading database ... 20% (Reading database ... 25% (Reading database ... 30% (Reading database ... 35% (Reading database ... 40% (Reading database ... 45% (Reading database ... 50% (Reading database ... 55% (Reading database ... 60% (Reading database ... 65% (Reading database ... 70% (Reading database ... 75% (Reading database ... 80% (Reading database ... 85% (Reading database ... 90% (Reading database ... 95% (Reading database ... 100% (Reading database ... 64655 files and directories currently installed.) 113s Preparing to unpack .../libc6_2.41-1ubuntu2_armhf.deb ... 113s Unpacking libc6:armhf (2.41-1ubuntu2) over (2.41-1ubuntu1) ... 113s Setting up libc6:armhf (2.41-1ubuntu2) ... 113s (Reading database ... (Reading database ... 5% (Reading database ... 10% (Reading database ... 15% (Reading database ... 20% (Reading database ... 25% (Reading database ... 30% (Reading database ... 35% (Reading database ... 40% (Reading database ... 45% (Reading database ... 50% (Reading database ... 55% (Reading database ... 60% (Reading database ... 65% (Reading database ... 70% (Reading database ... 75% (Reading database ... 80% (Reading database ... 85% (Reading database ... 90% (Reading database ... 95% (Reading database ... 100% (Reading database ... 64655 files and directories currently installed.) 113s Preparing to unpack .../libc-bin_2.41-1ubuntu2_armhf.deb ... 113s Unpacking libc-bin (2.41-1ubuntu2) over (2.41-1ubuntu1) ... 113s Setting up libc-bin (2.41-1ubuntu2) ... 114s (Reading database ... (Reading database ... 5% (Reading database ... 10% (Reading database ... 15% (Reading database ... 20% (Reading database ... 25% (Reading database ... 30% (Reading database ... 35% (Reading database ... 40% (Reading database ... 45% (Reading database ... 50% (Reading database ... 55% (Reading database ... 60% (Reading database ... 65% (Reading database ... 70% (Reading database ... 75% (Reading database ... 80% (Reading database ... 85% (Reading database ... 90% (Reading database ... 95% (Reading database ... 100% (Reading database ... 64655 files and directories currently installed.) 114s Preparing to unpack .../locales_2.41-1ubuntu2_all.deb ... 114s Unpacking locales (2.41-1ubuntu2) over (2.41-1ubuntu1) ... 114s Preparing to unpack .../strace_6.13+ds-1ubuntu1_armhf.deb ... 114s Unpacking strace (6.13+ds-1ubuntu1) over (6.11-0ubuntu1) ... 114s Preparing to unpack .../pinentry-curses_1.3.1-2ubuntu3_armhf.deb ... 114s Unpacking pinentry-curses (1.3.1-2ubuntu3) over (1.3.1-2ubuntu2) ... 114s Preparing to unpack .../python3-jinja2_3.1.5-2ubuntu1_all.deb ... 114s Unpacking python3-jinja2 (3.1.5-2ubuntu1) over (3.1.5-2) ... 114s Preparing to unpack .../archives/sos_4.9.0-5_all.deb ... 115s Unpacking sos (4.9.0-5) over (4.9.0-4) ... 115s Setting up sos (4.9.0-5) ... 115s Setting up pinentry-curses (1.3.1-2ubuntu3) ... 115s Setting up locales (2.41-1ubuntu2) ... 116s Generating locales (this might take a while)... 118s en_US.UTF-8... done 118s Generation complete. 118s Setting up python3-jinja2 (3.1.5-2ubuntu1) ... 118s Setting up strace (6.13+ds-1ubuntu1) ... 118s Processing triggers for man-db (2.13.0-1) ... 120s Processing triggers for systemd (257.3-1ubuntu3) ... 122s Reading package lists... 123s Building dependency tree... 123s Reading state information... 123s Starting pkgProblemResolver with broken count: 0 123s Starting 2 pkgProblemResolver with broken count: 0 123s Done 123s Solving dependencies... 124s 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded. 126s autopkgtest [16:24:41]: rebooting testbed after setup commands that affected boot 165s autopkgtest [16:25:20]: testbed running kernel: Linux 6.8.0-52-generic #53~22.04.1-Ubuntu SMP PREEMPT_DYNAMIC Wed Jan 15 18:10:51 UTC 2 190s autopkgtest [16:25:45]: @@@@@@@@@@@@@@@@@@@@ apt-source r-cran-network 200s Get:1 http://ftpmaster.internal/ubuntu plucky/universe r-cran-network 1.19.0-1 (dsc) [2178 B] 200s Get:2 http://ftpmaster.internal/ubuntu plucky/universe r-cran-network 1.19.0-1 (tar) [507 kB] 200s Get:3 http://ftpmaster.internal/ubuntu plucky/universe r-cran-network 1.19.0-1 (diff) [3492 B] 200s gpgv: Signature made Fri Jan 17 23:25:40 2025 UTC 200s gpgv: using RSA key 724D609337113C710550D7473C26763F6C67E6E2 200s gpgv: Can't check signature: No public key 200s dpkg-source: warning: cannot verify inline signature for ./r-cran-network_1.19.0-1.dsc: no acceptable signature found 200s autopkgtest [16:25:55]: testing package r-cran-network version 1.19.0-1 203s autopkgtest [16:25:58]: build not needed 207s autopkgtest [16:26:02]: test run-unit-test: preparing testbed 209s Reading package lists... 209s Building dependency tree... 209s Reading state information... 210s Starting pkgProblemResolver with broken count: 0 210s Starting 2 pkgProblemResolver with broken count: 0 210s Done 211s The following NEW packages will be installed: 211s fontconfig fontconfig-config fonts-dejavu-core fonts-dejavu-mono 211s fonts-glyphicons-halflings libblas3 libcairo2 libdatrie1 libdeflate0 211s libfontconfig1 libfreetype6 libgfortran5 libgomp1 libgraphite2-3 211s libharfbuzz0b libice6 libjbig0 libjpeg-turbo8 libjpeg8 libjs-bootstrap 211s liblapack3 liblerc4 libpango-1.0-0 libpangocairo-1.0-0 libpangoft2-1.0-0 211s libpaper-utils libpaper2 libpixman-1-0 libsharpyuv0 libsm6 libtcl8.6 211s libthai-data libthai0 libtiff6 libtk8.6 libwebp7 libxcb-render0 libxcb-shm0 211s libxft2 libxrender1 libxss1 libxt6t64 node-html5shiv r-base-core 211s r-cran-askpass r-cran-brio r-cran-callr r-cran-cli r-cran-coda r-cran-covr 211s r-cran-crayon r-cran-curl r-cran-desc r-cran-diffobj r-cran-digest 211s r-cran-evaluate r-cran-fansi r-cran-fs r-cran-glue r-cran-httr 211s r-cran-jsonlite r-cran-lattice r-cran-lazyeval r-cran-lifecycle 211s r-cran-magrittr r-cran-matrix r-cran-mime r-cran-network r-cran-openssl 211s r-cran-pillar r-cran-pkgbuild r-cran-pkgconfig r-cran-pkgload r-cran-praise 211s r-cran-processx r-cran-ps r-cran-r6 r-cran-rex r-cran-rlang r-cran-rprojroot 211s r-cran-sna r-cran-statnet.common r-cran-sys r-cran-testthat r-cran-tibble 211s r-cran-utf8 r-cran-vctrs r-cran-waldo r-cran-withr r-cran-yaml unzip 211s x11-common xdg-utils zip 211s 0 upgraded, 94 newly installed, 0 to remove and 0 not upgraded. 211s Need to get 60.8 MB of archives. 211s After this operation, 109 MB of additional disk space will be used. 211s Get:1 http://ftpmaster.internal/ubuntu plucky/main armhf libfreetype6 armhf 2.13.3+dfsg-1 [330 kB] 211s Get:2 http://ftpmaster.internal/ubuntu plucky/main armhf fonts-dejavu-mono all 2.37-8 [502 kB] 212s Get:3 http://ftpmaster.internal/ubuntu plucky/main armhf fonts-dejavu-core all 2.37-8 [835 kB] 213s Get:4 http://ftpmaster.internal/ubuntu plucky/main armhf fontconfig-config armhf 2.15.0-2ubuntu1 [37.5 kB] 213s Get:5 http://ftpmaster.internal/ubuntu plucky/main armhf libfontconfig1 armhf 2.15.0-2ubuntu1 [114 kB] 213s Get:6 http://ftpmaster.internal/ubuntu plucky/main armhf fontconfig armhf 2.15.0-2ubuntu1 [190 kB] 213s Get:7 http://ftpmaster.internal/ubuntu plucky/universe armhf fonts-glyphicons-halflings all 1.009~3.4.1+dfsg-3 [118 kB] 213s Get:8 http://ftpmaster.internal/ubuntu plucky/main armhf libblas3 armhf 3.12.1-2 [132 kB] 213s Get:9 http://ftpmaster.internal/ubuntu plucky/main armhf libpixman-1-0 armhf 0.44.0-3 [183 kB] 214s Get:10 http://ftpmaster.internal/ubuntu plucky/main armhf libxcb-render0 armhf 1.17.0-2 [15.3 kB] 214s Get:11 http://ftpmaster.internal/ubuntu plucky/main armhf libxcb-shm0 armhf 1.17.0-2 [5774 B] 214s Get:12 http://ftpmaster.internal/ubuntu plucky/main armhf libxrender1 armhf 1:0.9.10-1.1build1 [16.0 kB] 214s Get:13 http://ftpmaster.internal/ubuntu plucky/main armhf libcairo2 armhf 1.18.2-2 [484 kB] 214s Get:14 http://ftpmaster.internal/ubuntu plucky/main armhf libdatrie1 armhf 0.2.13-3build1 [15.7 kB] 214s Get:15 http://ftpmaster.internal/ubuntu plucky/main armhf libdeflate0 armhf 1.23-1 [38.5 kB] 214s Get:16 http://ftpmaster.internal/ubuntu plucky/main armhf libgfortran5 armhf 15-20250222-0ubuntu1 [330 kB] 215s Get:17 http://ftpmaster.internal/ubuntu plucky/main armhf libgomp1 armhf 15-20250222-0ubuntu1 [128 kB] 215s Get:18 http://ftpmaster.internal/ubuntu plucky/main armhf libgraphite2-3 armhf 1.3.14-2ubuntu1 [64.8 kB] 215s Get:19 http://ftpmaster.internal/ubuntu plucky/main armhf libharfbuzz0b armhf 10.2.0-1 [464 kB] 215s Get:20 http://ftpmaster.internal/ubuntu plucky/main armhf x11-common all 1:7.7+23ubuntu3 [21.7 kB] 215s Get:21 http://ftpmaster.internal/ubuntu plucky/main armhf libice6 armhf 2:1.1.1-1 [36.5 kB] 215s Get:22 http://ftpmaster.internal/ubuntu plucky/main armhf libjpeg-turbo8 armhf 2.1.5-3ubuntu2 [127 kB] 215s Get:23 http://ftpmaster.internal/ubuntu plucky/main armhf libjpeg8 armhf 8c-2ubuntu11 [2148 B] 215s Get:24 http://ftpmaster.internal/ubuntu plucky/universe armhf libjs-bootstrap all 3.4.1+dfsg-3 [129 kB] 216s Get:25 http://ftpmaster.internal/ubuntu plucky/main armhf liblapack3 armhf 3.12.1-2 [2091 kB] 218s Get:26 http://ftpmaster.internal/ubuntu plucky/main armhf liblerc4 armhf 4.0.0+ds-5ubuntu1 [160 kB] 218s Get:27 http://ftpmaster.internal/ubuntu plucky/main armhf libthai-data all 0.1.29-2build1 [158 kB] 218s Get:28 http://ftpmaster.internal/ubuntu plucky/main armhf libthai0 armhf 0.1.29-2build1 [15.2 kB] 218s Get:29 http://ftpmaster.internal/ubuntu plucky/main armhf libpango-1.0-0 armhf 1.56.2-1 [216 kB] 219s Get:30 http://ftpmaster.internal/ubuntu plucky/main armhf libpangoft2-1.0-0 armhf 1.56.2-1 [43.6 kB] 219s Get:31 http://ftpmaster.internal/ubuntu plucky/main armhf libpangocairo-1.0-0 armhf 1.56.2-1 [25.1 kB] 219s Get:32 http://ftpmaster.internal/ubuntu plucky/main armhf libpaper2 armhf 2.2.5-0.3 [16.3 kB] 219s Get:33 http://ftpmaster.internal/ubuntu plucky/main armhf libpaper-utils armhf 2.2.5-0.3 [14.2 kB] 219s Get:34 http://ftpmaster.internal/ubuntu plucky/main armhf libsharpyuv0 armhf 1.5.0-0.1 [16.4 kB] 219s Get:35 http://ftpmaster.internal/ubuntu plucky/main armhf libsm6 armhf 2:1.2.4-1 [15.1 kB] 219s Get:36 http://ftpmaster.internal/ubuntu plucky/main armhf libtcl8.6 armhf 8.6.16+dfsg-1 [909 kB] 220s Get:37 http://ftpmaster.internal/ubuntu plucky/main armhf libjbig0 armhf 2.1-6.1ubuntu2 [24.9 kB] 220s Get:38 http://ftpmaster.internal/ubuntu plucky/main armhf libwebp7 armhf 1.5.0-0.1 [188 kB] 220s Get:39 http://ftpmaster.internal/ubuntu plucky/main armhf libtiff6 armhf 4.5.1+git230720-4ubuntu4 [179 kB] 220s Get:40 http://ftpmaster.internal/ubuntu plucky/main armhf libxft2 armhf 2.3.6-1build1 [37.4 kB] 220s Get:41 http://ftpmaster.internal/ubuntu plucky/main armhf libxss1 armhf 1:1.2.3-1build3 [6500 B] 220s Get:42 http://ftpmaster.internal/ubuntu plucky/main armhf libtk8.6 armhf 8.6.16-1 [686 kB] 221s Get:43 http://ftpmaster.internal/ubuntu plucky/main armhf libxt6t64 armhf 1:1.2.1-1.2build1 [145 kB] 221s Get:44 http://ftpmaster.internal/ubuntu plucky/universe armhf node-html5shiv all 3.7.3+dfsg-5 [13.5 kB] 221s Get:45 http://ftpmaster.internal/ubuntu plucky/main armhf zip armhf 3.0-14ubuntu2 [164 kB] 221s Get:46 http://ftpmaster.internal/ubuntu plucky/main armhf unzip armhf 6.0-28ubuntu6 [167 kB] 222s Get:47 http://ftpmaster.internal/ubuntu plucky/main armhf xdg-utils all 1.2.1-2ubuntu1 [66.0 kB] 222s Get:48 http://ftpmaster.internal/ubuntu plucky/universe armhf r-base-core armhf 4.4.3-1 [28.2 MB] 252s Get:49 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-sys armhf 3.4.3-1 [45.2 kB] 252s Get:50 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-askpass armhf 1.2.1-1 [24.6 kB] 252s Get:51 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-brio armhf 1.1.5-1 [37.9 kB] 252s Get:52 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-ps armhf 1.9.0-1 [403 kB] 252s Get:53 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-r6 all 2.6.1-1 [101 kB] 252s Get:54 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-processx armhf 3.8.6-1 [359 kB] 253s Get:55 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-callr all 3.7.6-1 [458 kB] 253s Get:56 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-cli armhf 3.6.4-1 [1377 kB] 255s Get:57 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-lattice armhf 0.22-6-1 [1363 kB] 256s Get:58 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-coda all 0.19-4.1-1 [321 kB] 256s Get:59 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-digest armhf 0.6.37-1 [207 kB] 257s Get:60 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-jsonlite armhf 1.9.1+dfsg-1 [440 kB] 257s Get:61 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-lazyeval armhf 0.2.2-1build1 [142 kB] 257s Get:62 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-rex all 1.2.1-1 [129 kB] 257s Get:63 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-curl armhf 6.2.1+dfsg-1ubuntu1 [194 kB] 258s Get:64 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-mime armhf 0.12-2 [35.5 kB] 258s Get:65 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-openssl armhf 2.3.2+dfsg-1 [403 kB] 258s Get:66 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-httr all 1.4.7+dfsg-1 [459 kB] 259s Get:67 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-crayon all 1.5.3-1 [165 kB] 259s Get:68 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-withr all 3.0.2+dfsg-1 [214 kB] 259s Get:69 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-yaml armhf 2.3.10-1 [101 kB] 259s Get:70 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-covr armhf 3.6.4+dfsg-1 [302 kB] 259s Get:71 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-desc all 1.4.3-1 [359 kB] 260s Get:72 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-diffobj armhf 0.3.5-1 [1115 kB] 261s Get:73 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-evaluate all 1.0.3-1 [114 kB] 261s Get:74 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-fansi armhf 1.0.5-1 [611 kB] 262s Get:75 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-fs armhf 1.6.5+dfsg-1 [242 kB] 262s Get:76 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-glue armhf 1.8.0-1 [162 kB] 262s Get:77 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-rlang armhf 1.1.5-1 [1701 kB] 264s Get:78 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-lifecycle all 1.0.4+dfsg-1 [110 kB] 264s Get:79 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-magrittr armhf 2.0.3-1 [154 kB] 264s Get:80 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-matrix armhf 1.7-3-1 [4039 kB] 268s Get:81 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-utf8 armhf 1.2.4-1 [136 kB] 268s Get:82 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-vctrs armhf 0.6.5-1 [1310 kB] 270s Get:83 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-pillar all 1.10.1+dfsg-1 [453 kB] 270s Get:84 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-pkgconfig all 2.0.3-2build1 [19.7 kB] 270s Get:85 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-tibble armhf 3.2.1+dfsg-3 [420 kB] 271s Get:86 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-statnet.common armhf 4.11.0-1 [277 kB] 271s Get:87 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-network armhf 1.19.0-1 [829 kB] 272s Get:88 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-pkgbuild all 1.4.6-1 [213 kB] 272s Get:89 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-rprojroot all 2.0.4-2 [125 kB] 272s Get:90 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-pkgload all 1.4.0-1 [247 kB] 273s Get:91 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-praise all 1.0.0-4build1 [20.3 kB] 273s Get:92 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-sna armhf 2.8-1 [1246 kB] 274s Get:93 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-waldo all 0.6.1-2 [150 kB] 274s Get:94 http://ftpmaster.internal/ubuntu plucky/universe armhf r-cran-testthat armhf 3.2.3-1 [1633 kB] 276s Preconfiguring packages ... 276s Fetched 60.8 MB in 1min 5s (935 kB/s) 276s Selecting previously unselected package libfreetype6:armhf. 276s (Reading database ... (Reading database ... 5% (Reading database ... 10% (Reading database ... 15% (Reading database ... 20% (Reading database ... 25% (Reading database ... 30% (Reading database ... 35% (Reading database ... 40% (Reading database ... 45% (Reading database ... 50% (Reading database ... 55% (Reading database ... 60% (Reading database ... 65% (Reading database ... 70% (Reading database ... 75% (Reading database ... 80% (Reading database ... 85% (Reading database ... 90% (Reading database ... 95% (Reading database ... 100% (Reading database ... 64655 files and directories currently installed.) 276s Preparing to unpack .../00-libfreetype6_2.13.3+dfsg-1_armhf.deb ... 276s Unpacking libfreetype6:armhf (2.13.3+dfsg-1) ... 276s Selecting previously unselected package fonts-dejavu-mono. 276s Preparing to unpack .../01-fonts-dejavu-mono_2.37-8_all.deb ... 276s Unpacking fonts-dejavu-mono (2.37-8) ... 276s Selecting previously unselected package fonts-dejavu-core. 276s Preparing to unpack .../02-fonts-dejavu-core_2.37-8_all.deb ... 276s Unpacking fonts-dejavu-core (2.37-8) ... 276s Selecting previously unselected package fontconfig-config. 276s Preparing to unpack .../03-fontconfig-config_2.15.0-2ubuntu1_armhf.deb ... 277s Unpacking fontconfig-config (2.15.0-2ubuntu1) ... 277s Selecting previously unselected package libfontconfig1:armhf. 277s Preparing to unpack .../04-libfontconfig1_2.15.0-2ubuntu1_armhf.deb ... 277s Unpacking libfontconfig1:armhf (2.15.0-2ubuntu1) ... 277s Selecting previously unselected package fontconfig. 277s Preparing to unpack .../05-fontconfig_2.15.0-2ubuntu1_armhf.deb ... 277s Unpacking fontconfig (2.15.0-2ubuntu1) ... 277s Selecting previously unselected package fonts-glyphicons-halflings. 277s Preparing to unpack .../06-fonts-glyphicons-halflings_1.009~3.4.1+dfsg-3_all.deb ... 277s Unpacking fonts-glyphicons-halflings (1.009~3.4.1+dfsg-3) ... 277s Selecting previously unselected package libblas3:armhf. 277s Preparing to unpack .../07-libblas3_3.12.1-2_armhf.deb ... 277s Unpacking libblas3:armhf (3.12.1-2) ... 277s Selecting previously unselected package libpixman-1-0:armhf. 277s Preparing to unpack .../08-libpixman-1-0_0.44.0-3_armhf.deb ... 277s Unpacking libpixman-1-0:armhf (0.44.0-3) ... 277s Selecting previously unselected package libxcb-render0:armhf. 277s Preparing to unpack .../09-libxcb-render0_1.17.0-2_armhf.deb ... 277s Unpacking libxcb-render0:armhf (1.17.0-2) ... 277s Selecting previously unselected package libxcb-shm0:armhf. 277s Preparing to unpack .../10-libxcb-shm0_1.17.0-2_armhf.deb ... 277s Unpacking libxcb-shm0:armhf (1.17.0-2) ... 277s Selecting previously unselected package libxrender1:armhf. 277s Preparing to unpack .../11-libxrender1_1%3a0.9.10-1.1build1_armhf.deb ... 277s Unpacking libxrender1:armhf (1:0.9.10-1.1build1) ... 277s Selecting previously unselected package libcairo2:armhf. 277s Preparing to unpack .../12-libcairo2_1.18.2-2_armhf.deb ... 277s Unpacking libcairo2:armhf (1.18.2-2) ... 277s Selecting previously unselected package libdatrie1:armhf. 277s Preparing to unpack .../13-libdatrie1_0.2.13-3build1_armhf.deb ... 277s Unpacking libdatrie1:armhf (0.2.13-3build1) ... 277s Selecting previously unselected package libdeflate0:armhf. 277s Preparing to unpack .../14-libdeflate0_1.23-1_armhf.deb ... 277s Unpacking libdeflate0:armhf (1.23-1) ... 277s Selecting previously unselected package libgfortran5:armhf. 277s Preparing to unpack .../15-libgfortran5_15-20250222-0ubuntu1_armhf.deb ... 277s Unpacking libgfortran5:armhf (15-20250222-0ubuntu1) ... 277s Selecting previously unselected package libgomp1:armhf. 277s Preparing to unpack .../16-libgomp1_15-20250222-0ubuntu1_armhf.deb ... 277s Unpacking libgomp1:armhf (15-20250222-0ubuntu1) ... 277s Selecting previously unselected package libgraphite2-3:armhf. 277s Preparing to unpack .../17-libgraphite2-3_1.3.14-2ubuntu1_armhf.deb ... 277s Unpacking libgraphite2-3:armhf (1.3.14-2ubuntu1) ... 277s Selecting previously unselected package libharfbuzz0b:armhf. 277s Preparing to unpack .../18-libharfbuzz0b_10.2.0-1_armhf.deb ... 277s Unpacking libharfbuzz0b:armhf (10.2.0-1) ... 277s Selecting previously unselected package x11-common. 277s Preparing to unpack .../19-x11-common_1%3a7.7+23ubuntu3_all.deb ... 277s Unpacking x11-common (1:7.7+23ubuntu3) ... 277s Selecting previously unselected package libice6:armhf. 277s Preparing to unpack .../20-libice6_2%3a1.1.1-1_armhf.deb ... 277s Unpacking libice6:armhf (2:1.1.1-1) ... 277s Selecting previously unselected package libjpeg-turbo8:armhf. 277s Preparing to unpack .../21-libjpeg-turbo8_2.1.5-3ubuntu2_armhf.deb ... 277s Unpacking libjpeg-turbo8:armhf (2.1.5-3ubuntu2) ... 277s Selecting previously unselected package libjpeg8:armhf. 277s Preparing to unpack .../22-libjpeg8_8c-2ubuntu11_armhf.deb ... 277s Unpacking libjpeg8:armhf (8c-2ubuntu11) ... 277s Selecting previously unselected package libjs-bootstrap. 277s Preparing to unpack .../23-libjs-bootstrap_3.4.1+dfsg-3_all.deb ... 277s Unpacking libjs-bootstrap (3.4.1+dfsg-3) ... 277s Selecting previously unselected package liblapack3:armhf. 277s Preparing to unpack .../24-liblapack3_3.12.1-2_armhf.deb ... 277s Unpacking liblapack3:armhf (3.12.1-2) ... 278s Selecting previously unselected package liblerc4:armhf. 278s Preparing to unpack .../25-liblerc4_4.0.0+ds-5ubuntu1_armhf.deb ... 278s Unpacking liblerc4:armhf (4.0.0+ds-5ubuntu1) ... 278s Selecting previously unselected package libthai-data. 278s Preparing to unpack .../26-libthai-data_0.1.29-2build1_all.deb ... 278s Unpacking libthai-data (0.1.29-2build1) ... 278s Selecting previously unselected package libthai0:armhf. 278s Preparing to unpack .../27-libthai0_0.1.29-2build1_armhf.deb ... 278s Unpacking libthai0:armhf (0.1.29-2build1) ... 278s Selecting previously unselected package libpango-1.0-0:armhf. 278s Preparing to unpack .../28-libpango-1.0-0_1.56.2-1_armhf.deb ... 278s Unpacking libpango-1.0-0:armhf (1.56.2-1) ... 278s Selecting previously unselected package libpangoft2-1.0-0:armhf. 278s Preparing to unpack .../29-libpangoft2-1.0-0_1.56.2-1_armhf.deb ... 278s Unpacking libpangoft2-1.0-0:armhf (1.56.2-1) ... 278s Selecting previously unselected package libpangocairo-1.0-0:armhf. 278s Preparing to unpack .../30-libpangocairo-1.0-0_1.56.2-1_armhf.deb ... 278s Unpacking libpangocairo-1.0-0:armhf (1.56.2-1) ... 278s Selecting previously unselected package libpaper2:armhf. 278s Preparing to unpack .../31-libpaper2_2.2.5-0.3_armhf.deb ... 278s Unpacking libpaper2:armhf (2.2.5-0.3) ... 278s Selecting previously unselected package libpaper-utils. 278s Preparing to unpack .../32-libpaper-utils_2.2.5-0.3_armhf.deb ... 278s Unpacking libpaper-utils (2.2.5-0.3) ... 278s Selecting previously unselected package libsharpyuv0:armhf. 278s Preparing to unpack .../33-libsharpyuv0_1.5.0-0.1_armhf.deb ... 278s Unpacking libsharpyuv0:armhf (1.5.0-0.1) ... 278s Selecting previously unselected package libsm6:armhf. 278s Preparing to unpack .../34-libsm6_2%3a1.2.4-1_armhf.deb ... 278s Unpacking libsm6:armhf (2:1.2.4-1) ... 278s Selecting previously unselected package libtcl8.6:armhf. 278s Preparing to unpack .../35-libtcl8.6_8.6.16+dfsg-1_armhf.deb ... 278s Unpacking libtcl8.6:armhf (8.6.16+dfsg-1) ... 278s Selecting previously unselected package libjbig0:armhf. 278s Preparing to unpack .../36-libjbig0_2.1-6.1ubuntu2_armhf.deb ... 278s Unpacking libjbig0:armhf (2.1-6.1ubuntu2) ... 278s Selecting previously unselected package libwebp7:armhf. 278s Preparing to unpack .../37-libwebp7_1.5.0-0.1_armhf.deb ... 278s Unpacking libwebp7:armhf (1.5.0-0.1) ... 278s Selecting previously unselected package libtiff6:armhf. 278s Preparing to unpack .../38-libtiff6_4.5.1+git230720-4ubuntu4_armhf.deb ... 278s Unpacking libtiff6:armhf (4.5.1+git230720-4ubuntu4) ... 278s Selecting previously unselected package libxft2:armhf. 278s Preparing to unpack .../39-libxft2_2.3.6-1build1_armhf.deb ... 278s Unpacking libxft2:armhf (2.3.6-1build1) ... 278s Selecting previously unselected package libxss1:armhf. 278s Preparing to unpack .../40-libxss1_1%3a1.2.3-1build3_armhf.deb ... 278s Unpacking libxss1:armhf (1:1.2.3-1build3) ... 278s Selecting previously unselected package libtk8.6:armhf. 278s Preparing to unpack .../41-libtk8.6_8.6.16-1_armhf.deb ... 278s Unpacking libtk8.6:armhf (8.6.16-1) ... 278s Selecting previously unselected package libxt6t64:armhf. 278s Preparing to unpack .../42-libxt6t64_1%3a1.2.1-1.2build1_armhf.deb ... 278s Unpacking libxt6t64:armhf (1:1.2.1-1.2build1) ... 278s Selecting previously unselected package node-html5shiv. 278s Preparing to unpack .../43-node-html5shiv_3.7.3+dfsg-5_all.deb ... 278s Unpacking node-html5shiv (3.7.3+dfsg-5) ... 278s Selecting previously unselected package zip. 278s Preparing to unpack .../44-zip_3.0-14ubuntu2_armhf.deb ... 278s Unpacking zip (3.0-14ubuntu2) ... 278s Selecting previously unselected package unzip. 278s Preparing to unpack .../45-unzip_6.0-28ubuntu6_armhf.deb ... 278s Unpacking unzip (6.0-28ubuntu6) ... 278s Selecting previously unselected package xdg-utils. 278s Preparing to unpack .../46-xdg-utils_1.2.1-2ubuntu1_all.deb ... 278s Unpacking xdg-utils (1.2.1-2ubuntu1) ... 278s Selecting previously unselected package r-base-core. 278s Preparing to unpack .../47-r-base-core_4.4.3-1_armhf.deb ... 278s Unpacking r-base-core (4.4.3-1) ... 279s Selecting previously unselected package r-cran-sys. 279s Preparing to unpack .../48-r-cran-sys_3.4.3-1_armhf.deb ... 279s Unpacking r-cran-sys (3.4.3-1) ... 279s Selecting previously unselected package r-cran-askpass. 279s Preparing to unpack .../49-r-cran-askpass_1.2.1-1_armhf.deb ... 279s Unpacking r-cran-askpass (1.2.1-1) ... 279s Selecting previously unselected package r-cran-brio. 279s Preparing to unpack .../50-r-cran-brio_1.1.5-1_armhf.deb ... 279s Unpacking r-cran-brio (1.1.5-1) ... 279s Selecting previously unselected package r-cran-ps. 279s Preparing to unpack .../51-r-cran-ps_1.9.0-1_armhf.deb ... 279s Unpacking r-cran-ps (1.9.0-1) ... 279s Selecting previously unselected package r-cran-r6. 279s Preparing to unpack .../52-r-cran-r6_2.6.1-1_all.deb ... 279s Unpacking r-cran-r6 (2.6.1-1) ... 279s Selecting previously unselected package r-cran-processx. 279s Preparing to unpack .../53-r-cran-processx_3.8.6-1_armhf.deb ... 279s Unpacking r-cran-processx (3.8.6-1) ... 279s Selecting previously unselected package r-cran-callr. 279s Preparing to unpack .../54-r-cran-callr_3.7.6-1_all.deb ... 279s Unpacking r-cran-callr (3.7.6-1) ... 279s Selecting previously unselected package r-cran-cli. 279s Preparing to unpack .../55-r-cran-cli_3.6.4-1_armhf.deb ... 279s Unpacking r-cran-cli (3.6.4-1) ... 279s Selecting previously unselected package r-cran-lattice. 279s Preparing to unpack .../56-r-cran-lattice_0.22-6-1_armhf.deb ... 279s Unpacking r-cran-lattice (0.22-6-1) ... 279s Selecting previously unselected package r-cran-coda. 279s Preparing to unpack .../57-r-cran-coda_0.19-4.1-1_all.deb ... 279s Unpacking r-cran-coda (0.19-4.1-1) ... 279s Selecting previously unselected package r-cran-digest. 279s Preparing to unpack .../58-r-cran-digest_0.6.37-1_armhf.deb ... 279s Unpacking r-cran-digest (0.6.37-1) ... 279s Selecting previously unselected package r-cran-jsonlite. 279s Preparing to unpack .../59-r-cran-jsonlite_1.9.1+dfsg-1_armhf.deb ... 279s Unpacking r-cran-jsonlite (1.9.1+dfsg-1) ... 279s Selecting previously unselected package r-cran-lazyeval. 279s Preparing to unpack .../60-r-cran-lazyeval_0.2.2-1build1_armhf.deb ... 279s Unpacking r-cran-lazyeval (0.2.2-1build1) ... 279s Selecting previously unselected package r-cran-rex. 279s Preparing to unpack .../61-r-cran-rex_1.2.1-1_all.deb ... 279s Unpacking r-cran-rex (1.2.1-1) ... 279s Selecting previously unselected package r-cran-curl. 279s Preparing to unpack .../62-r-cran-curl_6.2.1+dfsg-1ubuntu1_armhf.deb ... 279s Unpacking r-cran-curl (6.2.1+dfsg-1ubuntu1) ... 279s Selecting previously unselected package r-cran-mime. 279s Preparing to unpack .../63-r-cran-mime_0.12-2_armhf.deb ... 279s Unpacking r-cran-mime (0.12-2) ... 279s Selecting previously unselected package r-cran-openssl. 279s Preparing to unpack .../64-r-cran-openssl_2.3.2+dfsg-1_armhf.deb ... 279s Unpacking r-cran-openssl (2.3.2+dfsg-1) ... 279s Selecting previously unselected package r-cran-httr. 279s Preparing to unpack .../65-r-cran-httr_1.4.7+dfsg-1_all.deb ... 279s Unpacking r-cran-httr (1.4.7+dfsg-1) ... 280s Selecting previously unselected package r-cran-crayon. 280s Preparing to unpack .../66-r-cran-crayon_1.5.3-1_all.deb ... 280s Unpacking r-cran-crayon (1.5.3-1) ... 280s Selecting previously unselected package r-cran-withr. 280s Preparing to unpack .../67-r-cran-withr_3.0.2+dfsg-1_all.deb ... 280s Unpacking r-cran-withr (3.0.2+dfsg-1) ... 280s Selecting previously unselected package r-cran-yaml. 280s Preparing to unpack .../68-r-cran-yaml_2.3.10-1_armhf.deb ... 280s Unpacking r-cran-yaml (2.3.10-1) ... 280s Selecting previously unselected package r-cran-covr. 280s Preparing to unpack .../69-r-cran-covr_3.6.4+dfsg-1_armhf.deb ... 280s Unpacking r-cran-covr (3.6.4+dfsg-1) ... 280s Selecting previously unselected package r-cran-desc. 280s Preparing to unpack .../70-r-cran-desc_1.4.3-1_all.deb ... 280s Unpacking r-cran-desc (1.4.3-1) ... 280s Selecting previously unselected package r-cran-diffobj. 280s Preparing to unpack .../71-r-cran-diffobj_0.3.5-1_armhf.deb ... 280s Unpacking r-cran-diffobj (0.3.5-1) ... 280s Selecting previously unselected package r-cran-evaluate. 280s Preparing to unpack .../72-r-cran-evaluate_1.0.3-1_all.deb ... 280s Unpacking r-cran-evaluate (1.0.3-1) ... 280s Selecting previously unselected package r-cran-fansi. 280s Preparing to unpack .../73-r-cran-fansi_1.0.5-1_armhf.deb ... 280s Unpacking r-cran-fansi (1.0.5-1) ... 280s Selecting previously unselected package r-cran-fs. 280s Preparing to unpack .../74-r-cran-fs_1.6.5+dfsg-1_armhf.deb ... 280s Unpacking r-cran-fs (1.6.5+dfsg-1) ... 280s Selecting previously unselected package r-cran-glue. 280s Preparing to unpack .../75-r-cran-glue_1.8.0-1_armhf.deb ... 280s Unpacking r-cran-glue (1.8.0-1) ... 280s Selecting previously unselected package r-cran-rlang. 280s Preparing to unpack .../76-r-cran-rlang_1.1.5-1_armhf.deb ... 280s Unpacking r-cran-rlang (1.1.5-1) ... 280s Selecting previously unselected package r-cran-lifecycle. 280s Preparing to unpack .../77-r-cran-lifecycle_1.0.4+dfsg-1_all.deb ... 280s Unpacking r-cran-lifecycle (1.0.4+dfsg-1) ... 280s Selecting previously unselected package r-cran-magrittr. 280s Preparing to unpack .../78-r-cran-magrittr_2.0.3-1_armhf.deb ... 280s Unpacking r-cran-magrittr (2.0.3-1) ... 280s Selecting previously unselected package r-cran-matrix. 280s Preparing to unpack .../79-r-cran-matrix_1.7-3-1_armhf.deb ... 280s Unpacking r-cran-matrix (1.7-3-1) ... 280s Selecting previously unselected package r-cran-utf8. 280s Preparing to unpack .../80-r-cran-utf8_1.2.4-1_armhf.deb ... 280s Unpacking r-cran-utf8 (1.2.4-1) ... 280s Selecting previously unselected package r-cran-vctrs. 280s Preparing to unpack .../81-r-cran-vctrs_0.6.5-1_armhf.deb ... 280s Unpacking r-cran-vctrs (0.6.5-1) ... 280s Selecting previously unselected package r-cran-pillar. 280s Preparing to unpack .../82-r-cran-pillar_1.10.1+dfsg-1_all.deb ... 280s Unpacking r-cran-pillar (1.10.1+dfsg-1) ... 281s Selecting previously unselected package r-cran-pkgconfig. 281s Preparing to unpack .../83-r-cran-pkgconfig_2.0.3-2build1_all.deb ... 281s Unpacking r-cran-pkgconfig (2.0.3-2build1) ... 281s Selecting previously unselected package r-cran-tibble. 281s Preparing to unpack .../84-r-cran-tibble_3.2.1+dfsg-3_armhf.deb ... 281s Unpacking r-cran-tibble (3.2.1+dfsg-3) ... 281s Selecting previously unselected package r-cran-statnet.common. 281s Preparing to unpack .../85-r-cran-statnet.common_4.11.0-1_armhf.deb ... 281s Unpacking r-cran-statnet.common (4.11.0-1) ... 281s Selecting previously unselected package r-cran-network. 281s Preparing to unpack .../86-r-cran-network_1.19.0-1_armhf.deb ... 281s Unpacking r-cran-network (1.19.0-1) ... 281s Selecting previously unselected package r-cran-pkgbuild. 281s Preparing to unpack .../87-r-cran-pkgbuild_1.4.6-1_all.deb ... 281s Unpacking r-cran-pkgbuild (1.4.6-1) ... 281s Selecting previously unselected package r-cran-rprojroot. 281s Preparing to unpack .../88-r-cran-rprojroot_2.0.4-2_all.deb ... 281s Unpacking r-cran-rprojroot (2.0.4-2) ... 281s Selecting previously unselected package r-cran-pkgload. 281s Preparing to unpack .../89-r-cran-pkgload_1.4.0-1_all.deb ... 281s Unpacking r-cran-pkgload (1.4.0-1) ... 281s Selecting previously unselected package r-cran-praise. 281s Preparing to unpack .../90-r-cran-praise_1.0.0-4build1_all.deb ... 281s Unpacking r-cran-praise (1.0.0-4build1) ... 281s Selecting previously unselected package r-cran-sna. 281s Preparing to unpack .../91-r-cran-sna_2.8-1_armhf.deb ... 281s Unpacking r-cran-sna (2.8-1) ... 281s Selecting previously unselected package r-cran-waldo. 281s Preparing to unpack .../92-r-cran-waldo_0.6.1-2_all.deb ... 281s Unpacking r-cran-waldo (0.6.1-2) ... 281s Selecting previously unselected package r-cran-testthat. 281s Preparing to unpack .../93-r-cran-testthat_3.2.3-1_armhf.deb ... 281s Unpacking r-cran-testthat (3.2.3-1) ... 281s Setting up libgraphite2-3:armhf (1.3.14-2ubuntu1) ... 281s Setting up libpixman-1-0:armhf (0.44.0-3) ... 281s Setting up libsharpyuv0:armhf (1.5.0-0.1) ... 281s Setting up liblerc4:armhf (4.0.0+ds-5ubuntu1) ... 281s Setting up libxrender1:armhf (1:0.9.10-1.1build1) ... 281s Setting up libdatrie1:armhf (0.2.13-3build1) ... 281s Setting up libxcb-render0:armhf (1.17.0-2) ... 281s Setting up fonts-glyphicons-halflings (1.009~3.4.1+dfsg-3) ... 281s Setting up unzip (6.0-28ubuntu6) ... 281s Setting up x11-common (1:7.7+23ubuntu3) ... 282s Setting up node-html5shiv (3.7.3+dfsg-5) ... 282s Setting up libdeflate0:armhf (1.23-1) ... 282s Setting up libxcb-shm0:armhf (1.17.0-2) ... 282s Setting up libgomp1:armhf (15-20250222-0ubuntu1) ... 282s Setting up libjbig0:armhf (2.1-6.1ubuntu2) ... 282s Setting up zip (3.0-14ubuntu2) ... 282s Setting up libblas3:armhf (3.12.1-2) ... 282s update-alternatives: using /usr/lib/arm-linux-gnueabihf/blas/libblas.so.3 to provide /usr/lib/arm-linux-gnueabihf/libblas.so.3 (libblas.so.3-arm-linux-gnueabihf) in auto mode 282s Setting up libfreetype6:armhf (2.13.3+dfsg-1) ... 282s Setting up fonts-dejavu-mono (2.37-8) ... 282s Setting up libtcl8.6:armhf (8.6.16+dfsg-1) ... 282s Setting up fonts-dejavu-core (2.37-8) ... 282s Setting up libjpeg-turbo8:armhf (2.1.5-3ubuntu2) ... 282s Setting up libgfortran5:armhf (15-20250222-0ubuntu1) ... 282s Setting up libwebp7:armhf (1.5.0-0.1) ... 282s Setting up libharfbuzz0b:armhf (10.2.0-1) ... 282s Setting up libthai-data (0.1.29-2build1) ... 282s Setting up libxss1:armhf (1:1.2.3-1build3) ... 282s Setting up libpaper2:armhf (2.2.5-0.3) ... 282s Setting up xdg-utils (1.2.1-2ubuntu1) ... 282s update-alternatives: using /usr/bin/xdg-open to provide /usr/bin/open (open) in auto mode 282s Setting up libjs-bootstrap (3.4.1+dfsg-3) ... 282s Setting up libjpeg8:armhf (8c-2ubuntu11) ... 282s Setting up libice6:armhf (2:1.1.1-1) ... 282s Setting up liblapack3:armhf (3.12.1-2) ... 282s update-alternatives: using /usr/lib/arm-linux-gnueabihf/lapack/liblapack.so.3 to provide /usr/lib/arm-linux-gnueabihf/liblapack.so.3 (liblapack.so.3-arm-linux-gnueabihf) in auto mode 282s Setting up fontconfig-config (2.15.0-2ubuntu1) ... 282s Setting up libpaper-utils (2.2.5-0.3) ... 282s Setting up libthai0:armhf (0.1.29-2build1) ... 282s Setting up libtiff6:armhf (4.5.1+git230720-4ubuntu4) ... 282s Setting up libfontconfig1:armhf (2.15.0-2ubuntu1) ... 282s Setting up libsm6:armhf (2:1.2.4-1) ... 282s Setting up fontconfig (2.15.0-2ubuntu1) ... 284s Regenerating fonts cache... done. 284s Setting up libxft2:armhf (2.3.6-1build1) ... 284s Setting up libtk8.6:armhf (8.6.16-1) ... 284s Setting up libpango-1.0-0:armhf (1.56.2-1) ... 284s Setting up libcairo2:armhf (1.18.2-2) ... 284s Setting up libxt6t64:armhf (1:1.2.1-1.2build1) ... 284s Setting up libpangoft2-1.0-0:armhf (1.56.2-1) ... 284s Setting up libpangocairo-1.0-0:armhf (1.56.2-1) ... 284s Setting up r-base-core (4.4.3-1) ... 284s Creating config file /etc/R/Renviron with new version 284s Setting up r-cran-crayon (1.5.3-1) ... 284s Setting up r-cran-lattice (0.22-6-1) ... 284s Setting up r-cran-ps (1.9.0-1) ... 284s Setting up r-cran-lazyeval (0.2.2-1build1) ... 284s Setting up r-cran-r6 (2.6.1-1) ... 284s Setting up r-cran-coda (0.19-4.1-1) ... 284s Setting up r-cran-magrittr (2.0.3-1) ... 284s Setting up r-cran-fs (1.6.5+dfsg-1) ... 284s Setting up r-cran-curl (6.2.1+dfsg-1ubuntu1) ... 284s Setting up r-cran-brio (1.1.5-1) ... 284s Setting up r-cran-diffobj (0.3.5-1) ... 284s Setting up r-cran-rlang (1.1.5-1) ... 284s Setting up r-cran-sys (3.4.3-1) ... 284s Setting up r-cran-withr (3.0.2+dfsg-1) ... 284s Setting up r-cran-processx (3.8.6-1) ... 284s Setting up r-cran-mime (0.12-2) ... 284s Setting up r-cran-praise (1.0.0-4build1) ... 284s Setting up r-cran-digest (0.6.37-1) ... 284s Setting up r-cran-yaml (2.3.10-1) ... 284s Setting up r-cran-evaluate (1.0.3-1) ... 284s Setting up r-cran-fansi (1.0.5-1) ... 284s Setting up r-cran-glue (1.8.0-1) ... 284s Setting up r-cran-cli (3.6.4-1) ... 284s Setting up r-cran-lifecycle (1.0.4+dfsg-1) ... 284s Setting up r-cran-rprojroot (2.0.4-2) ... 284s Setting up r-cran-askpass (1.2.1-1) ... 284s Setting up r-cran-jsonlite (1.9.1+dfsg-1) ... 284s Setting up r-cran-pkgconfig (2.0.3-2build1) ... 284s Setting up r-cran-utf8 (1.2.4-1) ... 284s Setting up r-cran-rex (1.2.1-1) ... 284s Setting up r-cran-waldo (0.6.1-2) ... 284s Setting up r-cran-matrix (1.7-3-1) ... 284s Setting up r-cran-statnet.common (4.11.0-1) ... 284s Setting up r-cran-vctrs (0.6.5-1) ... 284s Setting up r-cran-pillar (1.10.1+dfsg-1) ... 284s Setting up r-cran-openssl (2.3.2+dfsg-1) ... 284s Setting up r-cran-callr (3.7.6-1) ... 284s Setting up r-cran-desc (1.4.3-1) ... 284s Setting up r-cran-tibble (3.2.1+dfsg-3) ... 284s Setting up r-cran-network (1.19.0-1) ... 284s Setting up r-cran-sna (2.8-1) ... 284s Setting up r-cran-httr (1.4.7+dfsg-1) ... 284s Setting up r-cran-covr (3.6.4+dfsg-1) ... 284s Setting up r-cran-pkgbuild (1.4.6-1) ... 284s Setting up r-cran-pkgload (1.4.0-1) ... 284s Setting up r-cran-testthat (3.2.3-1) ... 284s Processing triggers for libc-bin (2.41-1ubuntu2) ... 284s Processing triggers for man-db (2.13.0-1) ... 285s Processing triggers for install-info (7.1.1-1) ... 293s autopkgtest [16:27:28]: test run-unit-test: [----------------------- 295s BEGIN TEST general.tests.R 295s 295s R version 4.4.3 (2025-02-28) -- "Trophy Case" 295s Copyright (C) 2025 The R Foundation for Statistical Computing 295s Platform: arm-unknown-linux-gnueabihf (32-bit) 295s 295s R is free software and comes with ABSOLUTELY NO WARRANTY. 295s You are welcome to redistribute it under certain conditions. 295s Type 'license()' or 'licence()' for distribution details. 295s 295s R is a collaborative project with many contributors. 295s Type 'contributors()' for more information and 295s 'citation()' on how to cite R or R packages in publications. 295s 295s Type 'demo()' for some demos, 'help()' for on-line help, or 295s 'help.start()' for an HTML browser interface to help. 295s Type 'q()' to quit R. 295s 295s > #The following battery of tests is intended to verify the functionality of 295s > #the network library 295s > 295s > #Set to TRUE to run tests 295s > if(FALSE){ 295s + 295s + library(network) 295s + 295s + # ----- check assigning multiple attribute values in a single call ------ 295s + test<-network.initialize(3) 295s + set.vertex.attribute(test,c('a','b'),c(1,2)) 295s + if(!all(test%v%'a'==c(1,1,1) & test%v%'b'==c(2,2,2))){ 295s + stop('setting multiple attribute values with set.vertex.attribute failed') 295s + } 295s + 295s + test<-network.initialize(3) 295s + set.vertex.attribute(test,list('a','b'),c(1,2)) 295s + if(!all(test%v%'a'==c(1,1,1) & test%v%'b'==c(2,2,2))){ 295s + stop('setting multiple attribute values with set.vertex.attribute failed') 295s + } 295s + 295s + test<-network.initialize(3) 295s + set.vertex.attribute(test,c('a','b'),list(c(1,2,3),c(4,5,6))) 295s + if(!all(test%v%'a'==c(1,2,3) & test%v%'b'==c(4,5,6))){ 295s + stop('setting multiple attribute values with set.vertex.attribute failed') 295s + } 295s + 295s + test<-network.initialize(3) 295s + set.vertex.attribute(test,c('a','b'),list(list(1,2,3),list(4,5,6))) 295s + if(!all(test%v%'a'==c(1,2,3) & test%v%'b'==c(4,5,6))){ 295s + stop('setting multiple attribute values with set.vertex.attribute failed') 295s + } 295s + 295s + test<-network.initialize(3) 295s + obj<-list(one='a complex object',two=c('with muliple','parts')) 295s + set.vertex.attribute(test,c('a','b'),list(list(as.list(obj)),list(as.list(obj)))) 295s + if(!all(all.equal(get.vertex.attribute(test,'a',unlist=FALSE)[[1]],obj) & all.equal(get.vertex.attribute(test,'b',unlist=FALSE)[[1]],obj))){ 295s + stop('setting multiple attribute values with list values in set.vertex.attribute failed') 295s + } 295s + 295s + # check assignment to list of networks 295s + net <- network.initialize(2) 295s + netlist <- list(net) 295s + set.network.attribute(netlist[[1]],"test","a value") 295s + if (!"test" %in% list.network.attributes(netlist[[1]])) 295s + stop('assignment to list of networks failed') 295s + 295s + # test multiple assignment for network 295s + 295s + test<-network.initialize(3) 295s + set.network.attribute(test,c("a","b"),1:2) 295s + if (!all(test%n%'a'==1,test%n%'b'==2)){ 295s + stop('mulltiple attribute assignment failed for set.network.attribute') 295s + } 295s + 295s + test<-network.initialize(3) 295s + set.network.attribute(test,list("a","b"),as.list(1:2)) 295s + if (!all(test%n%'a'==1,test%n%'b'==2)){ 295s + stop('mulltiple attribute assignment failed for set.network.attribute') 295s + } 295s + 295s + 295s + 295s + # test multiple assignment for edges 295s + 295s + test<-network.initialize(3) 295s + add.edges(test,tail=1:3,head=c(2,3,1)) 295s + net<-test 295s + set.edge.attribute(net,c("a","b"),1:2) 295s + if (!all(net%n%'a'==1,net%n%'b'==2)){ 295s + stop('mulltiple attribute assignment failed for set.edge.attribute') 295s + } 295s + 295s + net<-test 295s + set.edge.attribute(net,c('a','b'),list(c(1,2,3),c(4,5,6))) 295s + if(!all(net%e%'a'==c(1,2,3) & net%e%'b'==c(4,5,6))){ 295s + stop('setting multiple attribute values with set.edge.attribute failed') 295s + } 295s + 295s + net<-test 295s + set.edge.attribute(net,c('a','b'),list(list(1,2,3),list(4,5,6))) 295s + if(!all(net%e%'a'==c(1,2,3) & net%e%'b'==c(4,5,6))){ 295s + stop('setting multiple attribute values with set.edge.attribute failed') 295s + } 295s + 295s + net<-test 295s + obj<-list(one='a complex object',two=c('with muliple','parts')) 295s + set.edge.attribute(net,c('a','b'),list(list(as.list(obj)),list(as.list(obj)))) 295s + if(!all(all.equal(get.edge.attribute(net,'a',unlist=FALSE)[[1]],obj) & all.equal(get.edge.attribute(net,'b',unlist=FALSE)[[1]],obj))){ 295s + stop('setting multiple attribute values with list values in set.edge.attribute failed') 295s + } 295s + 295s + 295s + 295s + # ---- checks for get.edge.attribute overloading and omit args ---- 295s + net<-network.initialize(3) 295s + add.edges(net,c(1,2,3),c(2,3,1)) 295s + set.edge.attribute(net,'test',"a") 295s + if(!all(get.edge.attribute(net,'test')==c("a","a","a"))){stop("overloading of get.edge.attribute to get.edge.value not working correctly ")} 295s + 295s + # check list output of get.edge.attribute with deleted.edges.omit 295s + delete.edges(net,2) 295s + set.edge.attribute(net,'foo','bar',1) 295s + if(!identical(list('bar',NULL,NULL),get.edge.attribute(net,'foo',unlist=FALSE, deleted.edges.omit = FALSE))){ 295s + stop("deleted.edges.omit argument causing bad return values in get.edge.attribute ") 295s + } 295s + if(!identical(list('bar',NULL),get.edge.attribute(net,'foo',unlist=FALSE, deleted.edges.omit = TRUE))){ 295s + stop("deleted.edges.omit argument causing bad return values in get.edge.attribute ") 295s + } 295s + 295s + # check unlisted output of get.edge.attribute with na.omit and deleted.edges.omit 295s + if(!identical(c('bar'),get.edge.attribute(net,'foo',unlist=TRUE,deleted.edges.omit=TRUE))){ 295s + stop("omission argument causing bad return values in get.edge.attribute") 295s + } 295s + if(!identical(c('bar'),get.edge.attribute(net,'foo',unlist=TRUE,deleted.edges.omit=TRUE))){ 295s + stop("omission arguments causing bad return values in get.edge.attribute") 295s + } 295s + 295s + # check for null.na recoding of non-set attributes 295s + if(!identical(c('bar'),get.edge.attribute(net,'foo',unlist=TRUE,null.na=FALSE))){ 295s + stop("null.na arguments causing bad return values in get.edge.attribute") 295s + } 295s + if(!identical(c('bar',NA),get.edge.attribute(net,'foo',unlist=TRUE,null.na=TRUE))){ 295s + stop("null.na arguments causing bad return values in get.edge.attribute") 295s + } 295s + if(!identical(list('bar',NULL,NULL),get.edge.attribute(net,'foo',unlist=FALSE,null.na=FALSE))){ 295s + stop("null.na arguments causing bad return values in get.edge.attribute") 295s + } 295s + if(!identical(list('bar',NULL,NA),get.edge.attribute(net,'foo',unlist=FALSE,null.na=TRUE))){ 295s + stop("null.na arguments causing bad return values in get.edge.attribute") 295s + } 295s + 295s + 295s + 295s + #mark an edge as missing to test na.omit 295s + set.edge.attribute(net,'na',TRUE,e=1) 295s + 295s + # check that values corresponding to missing edges are ommited 295s + if(!identical(list('bar',NULL,NULL),get.edge.attribute(net,'foo',unlist=FALSE,na.omit=FALSE))){ 295s + stop("na.omit argument causing bad return values in get.edge.attribute") 295s + } 295s + if(!identical(list(NULL,NULL),get.edge.attribute(net,'foo',unlist=FALSE,na.omit=TRUE))){ 295s + stop("na.omit argument causing bad return values in get.edge.attribute") 295s + } 295s + 295s + if(!identical(c('bar'),get.edge.attribute(net,'foo',unlist=TRUE,na.omit=FALSE))){ 295s + stop("na.omit argument causing bad return values in get.edge.attribute") 295s + } 295s + if(!identical(NULL,get.edge.attribute(net,'foo',unlist=TRUE,na.omit=TRUE))){ 295s + stop("na.omit argument causing bad return values in get.edge.attribute") 295s + } 295s + # check for behavior when querying the 'na' attribute 295s + if(!identical(c(TRUE,FALSE),get.edge.attribute(net,'na',na.omit=FALSE))){ 295s + stop("get.edge.attribute did not return correct values for 'na' attribute with na.omit=FALSE") 295s + } 295s + if(!identical(c(FALSE),get.edge.attribute(net,'na',na.omit=TRUE))){ 295s + stop("get.edge.attribute did not return correct values for 'na' attribute with na.omit=TRUE") 295s + } 295s + 295s + # check behavior on a network with no edges 295s + if(!identical(list(),get.edge.attribute(network.initialize(3),'foo',unlist=FALSE))){ 295s + stop("get.edge.attribute did not return correct values network with no edges") 295s + } 295s + 295s + if(!identical(NULL,get.edge.attribute(network.initialize(3),'foo',unlist=TRUE))){ 295s + stop("get.edge.attribute did not return correct values network with no edges") 295s + } 295s + 295s + if(!identical(NULL,get.edge.attribute(net,'bar'))){ 295s + stop("get.edge.attribute did not return correct values for attribute that does not exist") 295s + } 295s + 295s + 295s + # check for behavior of attribute values explicitly set to null 295s + net<-network.initialize(3) 295s + net[1,2]<-1 295s + net[1,3]<-1 295s + set.edge.attribute(net,'nullval',list(NULL)) 295s + 295s + # expect NULL,NULL 295s + if(!identical(list(NULL,NULL),get.edge.attribute(net,'nullval',unlist=FALSE,null.na=FALSE))){ 295s + stop("get.edge.attribute not returning NULL values stored as edge attribute correctly") 295s + } 295s + 295s + # expect that this should return NULL values, which will dissappear on unlisting 295s + # do NOT want to see NA,NA 295s + if(!identical(NULL,get.edge.attribute(net,'nullval',null.na=FALSE))){ 295s + stop("get.edge.attribute not returning NULL values stored as edge attribute correctly") 295s + } 295s + if(!identical(NULL,get.edge.attribute(net,'nullval',null.na=TRUE))){ 295s + stop("get.edge.attribute not returning NULL values stored as edge attribute correctly") 295s + } 295s + 295s + #End tests 295s + } 295s > 295s BEGIN TEST general.tests2.R 295s 295s R version 4.4.3 (2025-02-28) -- "Trophy Case" 295s Copyright (C) 2025 The R Foundation for Statistical Computing 295s Platform: arm-unknown-linux-gnueabihf (32-bit) 295s 295s R is free software and comes with ABSOLUTELY NO WARRANTY. 295s You are welcome to redistribute it under certain conditions. 295s Type 'license()' or 'licence()' for distribution details. 295s 295s R is a collaborative project with many contributors. 295s Type 'contributors()' for more information and 295s 'citation()' on how to cite R or R packages in publications. 295s 295s Type 'demo()' for some demos, 'help()' for on-line help, or 295s 'help.start()' for an HTML browser interface to help. 295s Type 'q()' to quit R. 295s 295s > #Set to TRUE to run tests 295s > if(FALSE){ 295s + 295s + # additional tests of misc network functionality split off from general.tests.R to avoid speed warnings 295s + library(network) 295s + 295s + # ----- check memory saftey with a big assignment --- 295s + net<-network.initialize(100000) 295s + net<-add.edges(net,1:99999,2:100000) 295s + set.edge.attribute(net,'LETTERS',LETTERS) 295s + 295s + # --- tests for get.induced.subgraph additions -- 295s + data(emon) 295s + # extract the network of responders in MtStHelens network with interaction Frequency of 4 295s + subG4<-get.inducedSubgraph(emon$MtStHelens,eid=which(emon$MtStHelens%e%'Frequency'==4)) 295s + if(network.size(subG4)!=24){ 295s + stop('wrong size eid induced subgraph') 295s + } 295s + 295s + if (any(subG4%e%'Frequency'!=4)){ 295s + stop('bad edges in eid induced subgraph') 295s + } 295s + 295s + # checks for error conditions 295s + # can't specify eid with v or alter 295s + # get.inducedSubgraph(v=1:2,emon$MtStHelens,eid=which(emon$MtStHelens%e%'Frequency'==4)) 295s + # get.inducedSubgraph(alter=1:2,emon$MtStHelens,eid=which(emon$MtStHelens%e%'Frequency'==4)) 295s + # get.inducedSubgraph(emon$MtStHelens,eid=200:300) 295s + 295s + 295s + # ---- tests for specific bugs/edgecases ----- 295s + 295s + # ticket #180 (used to throw error if no edges exist) 295s + set.edge.attribute(network.initialize(3),"test","a") 295s + 295s + # check for network of zero size --used to give error ticket #255 295s + set.vertex.attribute(network.initialize(0),'foo','bar') 295s + 295s + 295s + # check for is.na.network problems #619 295s + x2<-network.initialize(3) 295s + x2[1,2]<-NA 295s + if(is.na.network(x2)[1,2]!=1){ 295s + stop('problem iwth is.na.netowrk') 295s + } 295s + 295s + # check for na problems in which.matrix.type #926 295s + mat <- matrix(rbinom(200, 1, 0.2), nrow = 20) 295s + naIndices <- sample(1:200, 20) 295s + mat[naIndices] <- NA 295s + nw <- network(mat) 295s + 295s + # ---- check for undirected loops getID cases #327 #609 ----- 295s + net<-network.initialize(2,loops=TRUE,directed=FALSE) 295s + net[1,1]<-1 295s + net[1,2]<-1 295s + net[2,2]<-1 295s + if(get.edgeIDs(net,v=1,alter=1)!=1){ 295s + stop("problem with get.edgeIDs on undirected network with loops") 295s + } 295s + if(get.edgeIDs(net,v=2,alter=2)!=3){ 295s + stop("problem with get.edgeIDs on undirected network with loops") 295s + } 295s + 295s + net<-network.initialize(2,loops=TRUE,directed=FALSE) 295s + net[1,2]<-1 295s + if(length(get.edgeIDs(net,v=2,alter=2))>0){ 295s + stop("problem with get.edgeIDs on undirected network with loops") 295s + } 295s + 295s + # check for problem with as.network.edgelist with zero edges #1138 295s + result1 <- as.matrix.network.edgelist(network.initialize(5),as.sna.edgelist = TRUE) 295s + if (nrow(result1) != 0){ 295s + stop('as.matrix.network.edgelist did not return correct value for net with zero edges') 295s + } 295s + result1a <- tibble::as_tibble(network.initialize(5)) 295s + if (nrow(result1a) != 0){ 295s + stop('as_tibble.network did not return correct value for net with zero edges') 295s + } 295s + result2<-as.matrix.network.adjacency(network.initialize(5)) 295s + if(nrow(result2) != 5 & ncol(result2) != 5){ 295s + stop('as.matrix.network.adjacency did not return matrix with correct dimensions') 295s + } 295s + result3<-as.matrix.network.adjacency(network.initialize(0)) 295s + if(nrow(result3) != 0 & ncol(result3) != 0){ 295s + stop('as.matrix.network.adjacency did not return matrix with correct dimensions') 295s + } 295s + result4<-as.matrix.network.incidence(network.initialize(5)) 295s + if(nrow(result4) != 5 & ncol(result4) != 0){ 295s + stop('as.matrix.network.incidence did not return matrix with correct dimensions') 295s + } 295s + result5<-as.matrix.network.incidence(network.initialize(0)) 295s + if(nrow(result5) != 0 & ncol(result5) != 0){ 295s + stop('as.matrix.network.incidence did not return matrix with correct dimensions') 295s + } 295s + 295s + #End test 295s + } 295s > 295s BEGIN TEST list.attribute.tests.R 295s 295s R version 4.4.3 (2025-02-28) -- "Trophy Case" 295s Copyright (C) 2025 The R Foundation for Statistical Computing 295s Platform: arm-unknown-linux-gnueabihf (32-bit) 295s 295s R is free software and comes with ABSOLUTELY NO WARRANTY. 295s You are welcome to redistribute it under certain conditions. 295s Type 'license()' or 'licence()' for distribution details. 295s 295s R is a collaborative project with many contributors. 295s Type 'contributors()' for more information and 295s 'citation()' on how to cite R or R packages in publications. 295s 295s Type 'demo()' for some demos, 'help()' for on-line help, or 295s 'help.start()' for an HTML browser interface to help. 295s Type 'q()' to quit R. 295s 295s > #Set to TRUE to run tests 295s > if(FALSE){ 295s + 295s + require(network) 295s + 295s + # --------- test list.vertex.attributes --- 295s + 295s + net<-network.initialize(3) 295s + 295s + list.vertex.attributes(net) 295s + 295s + if(!all(list.vertex.attributes(net)==c('na','vertex.names'))){ 295s + stop('list.vertex.attribute did not report default attributes corrrectly') 295s + } 295s + 295s + set.vertex.attribute(net,'letters',c("a","b","c")) 295s + 295s + if(!all(list.vertex.attributes(net)==c('letters','na','vertex.names'))){ 295s + stop('list.vertex.attribute did not report added attributes corrrectly') 295s + } 295s + 295s + 295s + # ----- test list.edge.attributes ---- 295s + 295s + net<-network.initialize(3) 295s + if(length(list.edge.attributes(net))!=0){ 295s + stop("list.edge.attributes did not return empty list for network with no edges") 295s + } 295s + 295s + add.edges(net,1,2) 295s + add.edges(net,2,3) 295s + if(list.edge.attributes(net)!='na'){ 295s + stop("list.edge.attributes did not return 'na' for network with only edges") 295s + } 295s + 295s + set.edge.attribute(net,'letter',c("a","b")) 295s + if(!all(list.edge.attributes(net)==c('letter','na'))){ 295s + stop("list.edge.attributes did not return attribute names for network with edges") 295s + } 295s + 295s + delete.edges(net,eid=1) 295s + if(!all(list.edge.attributes(net)==c('letter','na'))){ 295s + stop("list.edge.attributes did not return attribute names for network deleted edge") 295s + } 295s + 295s + # ---- test list.network.attributes ---- 295s + net<-network.initialize(3) 295s + if(!all(list.network.attributes(net)==c("bipartite", "directed", "hyper","loops","mnext", "multiple","n" ))){ 295s + stop("list.network.attributes returned unexpected values for default attributes of a network") 295s + } 295s + 295s + set.network.attribute(net,'letter',"a") 295s + if(!all(list.network.attributes(net)==c("bipartite", "directed", "hyper","letter","loops","mnext", "multiple","n" ))){ 295s + stop("list.network.attributes returned unexpected values for network with attribute added") 295s + } 295s + 295s + # ----- tests for printing function for edges cases ------ 295s + net<-network.initialize(100) 295s + net%n%'a_matrix'<-matrix(1:100,nrow=10,ncol=10) 295s + net%n%'a_null'<-NULL 295s + net%n%'a_list'<-list(part1=list(c("A","B")),part2=list("c")) 295s + net%n%'a_desc_vec'<-numeric(rep(100,1)) 295s + net%n%'a_net'<-network.initialize(5) 295s + print.network(net) 295s + 295s + #End tests 295s + } 295s > 295s BEGIN TEST network.access.test.R 295s 295s R version 4.4.3 (2025-02-28) -- "Trophy Case" 295s Copyright (C) 2025 The R Foundation for Statistical Computing 295s Platform: arm-unknown-linux-gnueabihf (32-bit) 295s 295s R is free software and comes with ABSOLUTELY NO WARRANTY. 295s You are welcome to redistribute it under certain conditions. 295s Type 'license()' or 'licence()' for distribution details. 295s 295s R is a collaborative project with many contributors. 295s Type 'contributors()' for more information and 295s 'citation()' on how to cite R or R packages in publications. 295s 295s Type 'demo()' for some demos, 'help()' for on-line help, or 295s 'help.start()' for an HTML browser interface to help. 295s Type 'q()' to quit R. 295s 295s > #Set to TRUE to run tests 295s > if(FALSE){ 295s + 295s + library(network) 295s + 295s + binet = network.initialize(10, bipartite = 6) 295s + set.vertex.attribute(binet, 'myval', paste('b1', 1:6), v=1:6) 295s + set.vertex.attribute(binet, 'myval', paste('b2', 1:4), v=7:10) 295s + 295s + check <- vector() 295s + check[1] <- all(get.vertex.attribute(binet, 'myval') == c("b1 1", "b1 2", "b1 3", "b1 4", "b1 5", "b1 6", "b2 1", "b2 2", "b2 3" ,"b2 4")) 295s + 295s + # check for distinction between bipartite=FALSE and bipartite=0 295s + testA<-network.initialize(3,bipartite=0) 295s + if(!is.bipartite(testA)){ 295s + stop('failed test of is.bipartite for bipartite=0') 295s + } 295s + 295s + testB<-network.initialize(3,bipartite=FALSE) 295s + if(is.bipartite(testB)){ 295s + stop('failed test of is.bipartite for bipartite=FALSE') 295s + } 295s + 295s + testC<-network.initialize(3,bipartite=TRUE) 295s + if(!is.bipartite(testC)){ 295s + stop('failed test of is.bipartite for bipartite=TRUE') 295s + } 295s + 295s + if(!is.bipartite(binet)){ 295s + stop('failed test of is.bipartite for bipartite=6') 295s + } 295s + 295s + # add vertices to bipartite graphs 295s + g = binet; add.vertices(g, 5, last.mode=F) 295s + check[2] <- network.size(g) == 15 295s + check[3] <- get.network.attribute(g, 'bipartite') == 11 295s + check[4] <- identical(get.vertex.attribute(g, 'myval'), 295s + c("b1 1", "b1 2", "b1 3", "b1 4", "b1 5", "b1 6", NA,NA,NA,NA,NA,"b2 1","b2 2","b2 3","b2 4")) 295s + 295s + test<-network.initialize(3,bipartite=0) 295s + test%v%'letters'<-LETTERS[1:3] 295s + add.vertices(test,nv=1,last.mode=FALSE) 295s + if(!identical(test%v%'letters',c(NA,"A","B","C"))){ 295s + stop("Error adding vertices to first mode of network with biparite=0") 295s + } 295s + 295s + test<-network.initialize(3,bipartite=0) 295s + test%v%'letters'<-LETTERS[1:3] 295s + add.vertices(test,nv=1,last.mode=TRUE) 295s + if(!identical(test%v%'letters',c("A","B","C",NA))){ 295s + stop("Error adding vertices to last mode of network with biparite=0") 295s + } 295s + 295s + 295s + g = binet 295s + add.vertices(g, 5, last.mode=T) 295s + check[5] <- network.size(g) == 15 295s + check[6] <- get.network.attribute(g, 'bipartite') == 6 296s + check[7] <- identical(get.vertex.attribute(g, 'myval'), 296s + c("b1 1", "b1 2", "b1 3", "b1 4", "b1 5", "b1 6","b2 1","b2 2","b2 3","b2 4", NA,NA,NA,NA,NA)) 296s + 296s + # replacement operators should always replace 296s + y <- network.initialize(4,dir=FALSE) # This network can have at most 1 edge. 296s + y[1,2] <- NA # Assign NA to (1,2) 296s + y[1,2] <- NA 296s + check[8] <- network.edgecount(y) == 0 296s + check[9] <- network.edgecount(y, na.omit=F) == 1 296s + 296s + y[,] <- 1 296s + check[10] <- network.edgecount(y) == 6 296s + y[,] <- NA 296s + check[11] <- network.edgecount(y) == 0 296s + check[12] <- network.edgecount(y, na.omit=F) == 6 296s + y[,] <- 0 296s + check[13] <- network.edgecount(y, na.omit=F) == 0 296s + 296s + 296s + # ------ test valid.eids function 296s + net<-network.initialize(4) 296s + net[,]<-1 296s + delete.edges(net,eid=4:6) 296s + if(!all(valid.eids(net)==c(1,2,3,7,8,9,10,11,12))){ 296s + stop('valid.eids did not return correct ids for non-null elements of network') 296s + } 296s + 296s + #If everything worked, check is TRUE 296s + if(!all(check)){ #Should be TRUE 296s + stop(paste("network package test failed on test(s):",which(!check))) 296s + } 296s + 296s + #End tests 296s + } 296s > 296s BEGIN TEST network.battery.R 296s 296s R version 4.4.3 (2025-02-28) -- "Trophy Case" 296s Copyright (C) 2025 The R Foundation for Statistical Computing 296s Platform: arm-unknown-linux-gnueabihf (32-bit) 296s 296s R is free software and comes with ABSOLUTELY NO WARRANTY. 296s You are welcome to redistribute it under certain conditions. 296s Type 'license()' or 'licence()' for distribution details. 296s 296s R is a collaborative project with many contributors. 296s Type 'contributors()' for more information and 296s 'citation()' on how to cite R or R packages in publications. 296s 296s Type 'demo()' for some demos, 'help()' for on-line help, or 296s 'help.start()' for an HTML browser interface to help. 296s Type 'q()' to quit R. 296s 296s > #The following battery of tests is intended to verify the functionality of 296s > #the network library 296s > 296s > #Set to TRUE to run tests 296s > if(FALSE){ 296s + 296s + library(network) 296s + #These functions are intended to mimic functionality from the sna package. 296s + #Said package is not required to use network, but was used in creating this 296s + #battery of tests. 296s + rgraph<-function(n){ 296s + m<-matrix(rbinom(n*n,1,0.5),n,n) 296s + diag(m)<-0 296s + m 296s + } 296s + degree<-function(d,cmode = "freeman") 296s + { 296s + n <- dim(d)[1] 296s + diag(d) <- NA 296s + switch(cmode, indegree = apply(d, 2, sum, na.rm = TRUE), 296s + outdegree = apply(d, 1, sum, na.rm = TRUE), freeman = apply(d, 296s + 2, sum, na.rm = TRUE) + apply(d, 1, sum, na.rm = TRUE)) 296s + } 296s + #gctorture(TRUE) #Uncomment to perform a more intensive (SLOW) test 296s + 296s + # ---- Check assignment, deletion, and adjacency for dyadic graphs ---- 296s + check<-vector() 296s + temp<-network(matrix(0,5,5)) 296s + temp[1,2]<-1 #Add edge 296s + check[1]<-temp[1,2]==1 #Check adjacency 296s + check[2]<-get.network.attribute(temp,"mnext")==2 #Check count 296s + temp[1,2]<-1 #Should have no effect 296s + check[3]<-get.network.attribute(temp,"mnext")==2 #Check count 296s + temp[1,1]<-1 #Should have no effect 296s + check[4]<-temp[1,1]==0 #Shouldn't be present 296s + check[5]<-get.network.attribute(temp,"mnext")==2 #Check count 296s + temp[,2]<-1 #Should add 3 edges 296s + check[6]<-get.network.attribute(temp,"mnext")==5 #Check count 296s + check[7]<-all(temp[,2]==c(1,0,1,1,1)) #Verify row 296s + temp[3:4,3:4]<-1 #Should add 2 edges 296s + check[8]<-get.network.attribute(temp,"mnext")==7 #Check count 296s + temp[,]<-0 #Delete edges 296s + check[9]<-all(temp[,]==matrix(0,5,5)) #Verify that edges were removed 296s + temp[1:2,3:5]<-1 #Add new edges 296s + check[10]<-sum(temp[,])==6 #Check edge sum 296s + temp<-add.vertices(temp,3) #Add vertices 296s + check[11]<-network.size(temp)==8 296s + check[12]<-sum(temp[,])==6 #Edges should still be there 296s + check[13]<-all(temp[,5]==c(1,1,0,0,0,0,0,0)) 296s + temp[8,]<-1 #Add edges to new vertex 296s + check[14]<-all(temp[8,]==c(1,1,1,1,1,1,1,0)) #Verify 296s + temp<-delete.vertices(temp,c(7,8)) #Remove vertices 296s + check[15]<-network.size(temp)==6 #Verify removal 296s + check[16]<-sum(temp[,])==6 #Check edge sum 296s + check[17]<-!any(c(7,8)%in%c(sapply(temp$mel,"[[","inl"),sapply(temp$mel,"[[","outl"))) #Make sure they're really gone! 296s + temp<-network(matrix(0,5,5),directed=FALSE,loops=TRUE) #Create undir graph 296s + check[18]<-is.directed(temp)==FALSE #Some simple gal tests 296s + check[19]<-has.loops(temp)==TRUE 296s + temp[1,]<-1 296s + check[20]<-all(temp[,1]==temp[1,]) #Verify edges 296s + temp<-permute.vertexIDs(temp,5:1) #Permute 296s + check[21]<-all(temp[1,]==c(0,0,0,0,1)) #Verify permutation 296s + check[22]<-all(temp[,5]==rep(1,5)) 296s + check[23]<-all(get.neighborhood(temp,1)%in%c(5,1)) #Check neighborhoods 296s + check[24]<-all(sort(get.neighborhood(temp,5))==1:5) 296s + check[25]<-length(get.edges(temp,5))==5 #Check get.edges 296s + check[26]<-length(get.edges(temp,5,2))==1 296s + g<-rgraph(10) 296s + temp<-network(g) 296s + check[27]<-all(g==temp[,]) #Yet more edge checkage 296s + check[28]<-all(g[3:1,-(4:3)]==temp[3:1,-(4:3)]) 296s + temp[,,,names.eval="newval"]<-matrix(1:100,10,10) #Edge value assignment 296s + check[29]<-all(as.sociomatrix(temp,"newval")==matrix(1:100,10,10)*g) 296s + check[30]<-all(apply(as.matrix.network.incidence(temp),1,sum)==(degree(g,cmode="indegree")-degree(g,cmode="outdegree"))) #Check incidence matrix 296s + check[31]<-all(dim(as.matrix.network.incidence(temp))==c(10,sum(g))) 296s + check[32]<-all(apply(as.matrix.network.incidence(temp,"newval"),1,sum)==(degree(matrix(1:100,10,10)*g,cmode="indegree")-degree(matrix(1:100,10,10)*g,cmode="outdegree"))) 296s + check[33]<-all(as.matrix.network.edgelist(temp,"newval")==cbind(row(g)[g>0],col(g)[g>0],matrix(1:100,10,10)[g>0])) 296s + temp[1:3,1:5,names.eval="newval"]<-matrix(1:15,3,5) 296s + check[34]<-all(as.sociomatrix(temp,"newval")[1:3,1:5]==g[1:3,1:5]*matrix(1:15,3,5)) 296s + temp[,,"na"]<-TRUE #Verify NA filtering 296s + check[35]<-sum(temp[,,na.omit=TRUE])==0 296s + check[36]<-sum(is.na(temp[,,na.omit=FALSE]))==sum(g) 296s + 296s + #---- Check assignment, deletion, and adjacency for hypergraphs ---- 296s + temp<-network.initialize(10,directed=F,hyper=T,loops=T) 296s + check[37]<-sum(temp[,])==0 296s + temp<-add.edge(temp,1:4,1:4,"value",list(5)) 296s + temp<-add.edge(temp,3:5,3:5,"value",list(6)) 296s + temp<-add.edge(temp,4:7,4:7,"value",list(7)) 296s + temp<-add.edge(temp,6:10,6:10,"value",list(8)) 296s + check[38]<-all(as.matrix.network.incidence(temp)==cbind(c(1,1,1,1,0,0,0,0,0,0),c(0,0,1,1,1,0,0,0,0,0),c(0,0,0,1,1,1,1,0,0,0),c(0,0,0,0,0,1,1,1,1,1))) 296s + check[39]<-all(as.matrix.network.incidence(temp,"value")==cbind(5*c(1,1,1,1,0,0,0,0,0,0),6*c(0,0,1,1,1,0,0,0,0,0),7*c(0,0,0,1,1,1,1,0,0,0),8*c(0,0,0,0,0,1,1,1,1,1))) 296s + check[40]<-all(temp[,]==((as.matrix.network.incidence(temp)%*%t(as.matrix.network.incidence(temp)))>0)) 296s + 296s + #---- Check coercion and construction methods ---- 296s + g<-rgraph(10) 296s + temp<-network(g) 296s + check[41]<-all(temp[,]==g) 296s + temp<-as.network(g*matrix(1:100,10,10),names.eval="value",ignore.eval=FALSE) 296s + check[42]<-all(as.sociomatrix(temp,"value")==g*matrix(1:100,10,10)) 296s + temp<-as.network.matrix(as.matrix.network.edgelist(temp,"value"),matrix.type="edgelist",names.eval="value",ignore.eval=FALSE) 296s + check[43]<-all(as.sociomatrix(temp,"value")==g*matrix(1:100,10,10)) 296s + temp<-as.network.matrix(as.matrix.network.incidence(temp,"value"),matrix.type="incidence",names.eval="value",ignore.eval=FALSE) 296s + check[44]<-all(as.sociomatrix(temp,"value")==g*matrix(1:100,10,10)) 296s + 296s + # check functioning of na.rm argument #922 296s + plain<-as.network.matrix(matrix(c(0,1,NA,NA),ncol=2),na.rm=TRUE) 296s + if (network.naedgecount(plain) != 0){ 296s + stop('problem with na values in adjacency matrix coericon') 296s + } 296s + plain<-as.network.matrix(matrix(c(0,1,NA,NA),ncol=2),na.rm=FALSE) 296s + if (network.naedgecount(plain) != 1){ 296s + stop('problem with na values in adjacnecy matrix coericon') 296s + } 296s + 296s + 296s + 296s + # test for as.matrix.network edgelist bug #935 296s + x <- network.initialize(10) 296s + add.edge(x,1,2) 296s + add.edge(x,2,3) 296s + set.edge.attribute(x,'foo','bar',e=2) # i.e. the edge from 2 to 3 296s + if (!identical(as.matrix.network.edgelist(x,'foo'),structure(c("1", "2", "2", "3", NA, "bar"), .Dim = 2:3, n = 10, vnames = 1:10))){ 296s + stop("problem with as.matrix.network.edgelist with attribute and deleted edge") 296s + } 296s + 296s + 296s + 296s + #---- Check attribute assignment/access ---- 296s + g<-rgraph(10) 296s + temp<-network(g) 296s + temp<-set.vertex.attribute(temp,"value",1:10) 296s + check[45]<-all(get.vertex.attribute(temp,"value")==1:10) 296s + temp<-delete.vertex.attribute(temp,"value") 296s + check[46]<-all(is.na(get.vertex.attribute(temp,"value"))) 296s + temp<-set.vertex.attribute(temp,"value",1:5,c(2,4,6,8,10)) 296s + check[47]<-all(get.vertex.attribute(temp,"value")[c(2,4,6,8,10)]==1:5) 296s + temp<-set.network.attribute(temp,"value","pork!") 296s + check[48]<-get.network.attribute(temp,"value")=="pork!" 296s + temp<-delete.network.attribute(temp,"value") 296s + check[49]<-is.null(get.network.attribute(temp,"value")) 296s + temp<-set.edge.attribute(temp,"value",5) 296s + check[50]<-all(get.edge.attribute(temp$mel,"value")==5) 296s + temp<-delete.edge.attribute(temp,"value") 296s + check[51]<-all(is.null(get.edge.attribute(temp$mel,"value"))) 296s + temp<-set.edge.value(temp,"value",g*matrix(1:100,10,10)) 296s + check[52]<-all(get.edge.value(temp,"value")==(g*matrix(1:100,10,10))[g>0]) 296s + check[53]<-all(as.sociomatrix(temp,"value")==(g*matrix(1:100,10,10))) 296s + 296s + 296s + #---- Check additional operators ---- 296s + g<-rgraph(10) 296s + temp<-network(g,names.eval="value",ignore.eval=FALSE) 296s + temp2<-network(g*2,names.eval="value",ignore.eval=FALSE) 296s + check[54]<-all(g==as.sociomatrix(temp+temp2)) 296s + check[55]<-all(g*3==as.sociomatrix(sum(temp,temp2,attrname="value"),"value")) 296s + check[56]<-all(g==as.sociomatrix(temp*temp2)) 296s + check[57]<-all(g*2==as.sociomatrix(prod(temp,temp2,attrname="value"),"value")) 296s + check[58]<-all(0==as.sociomatrix(temp-temp2)) 296s + check[59]<-all(-g==as.sociomatrix(sum(temp,-as.sociomatrix(temp2,"value"),attrname="value"),"value")) 296s + check[60]<-all(((g%*%g)>0)==as.sociomatrix("%c%.network"(temp,temp2))) 296s + check[61]<-all(((g%*%g)>0)==as.sociomatrix(temp%c%temp2)) 296s + check[62]<-all(((!temp)[,]==!g)[diag(10)<1]) 296s + check[63]<-all((temp|temp2)[,]==g) 296s + check[64]<-all((temp&temp2)[,]==g) 296s + temp%v%"value"<-1:10 296s + check[65]<-all(temp%v%"value"==1:10) 296s + temp%n%"value"<-"pork!" 296s + check[66]<-temp%n%"value"=="pork!" 296s + 296s + # ---- Check to ensure that in-place modification is not producing side effects ---- 296s + g<-network.initialize(5); checkg<-g; add.vertices(g,3) 296s + check[67]<-(network.size(checkg)==5)&&(network.size(g)==8) 296s + g<-network.initialize(5); checkg<-g; delete.vertices(g,2) 296s + check[68]<-(network.size(checkg)==5)&&(network.size(g)==4) 296s + g<-network.initialize(5); checkg<-g; add.edge(g,2,3) 296s + check[69]<-(sum(checkg[,])==0)&&(sum(g[,])==1) 296s + g<-network.initialize(5); checkg<-g; add.edges(g,c(2,2,2),c(1,3,4)) 296s + check[70]<-(sum(checkg[,])==0)&&(sum(g[,])==3) 296s + g<-network.initialize(5); checkg<-g; g%v%"boo"<-1:5 296s + check[71]<-all(is.na(checkg%v%"boo"))&&all(g%v%"boo"==1:5) 296s + g<-network.initialize(5); checkg<-g; g%n%"boo"<-1:5 296s + check[72]<-is.null(checkg%n%"boo")&&all(g%n%"boo"==1:5) 296s + g<-network.initialize(5); g[1,]<-1; checkg<-g; g%e%"boo"<-col(matrix(0,5,5)) 296s + check[73]<-is.null(checkg%e%"boo")&&all(g%e%"boo"==2:5) 296s + g<-network.initialize(5); checkg<-g; permute.vertexIDs(g,5:1) 296s + check[74]<-all(checkg%v%"vertex.names"==1:5)&&all(g%v%"vertex.names"==5:1) 296s + g<-network.initialize(5); temp<-(function(){add.vertices(g,3); network.size(g)})() 296s + check[75]<-(network.size(g)==5)&&(temp==8) 296s + g<-network.initialize(5); (function(){g<-network.initialize(4); add.vertices(g,3)})() 296s + check[76]<-(network.size(g)==5) 296s + 296s + # check for operators with undirected edge error ticket #279 296s + # nw1 is assigned tail
head 296s + nw2<-network.initialize(3,directed=FALSE) 296s + nw2[2,1]<-1 296s + 296s + # Which, the binary network operators don't take into account: 296s + check[77]<-network.edgecount(nw1-nw2)==0 # Should have 0, has 1. 296s + check[78]<-network.edgecount(nw1|nw2)==1 # Should have 1, has 2 (1->2 and 2->1). 296s + check[79]<-network.edgecount(nw1&nw2)==1 # Should have 1, has 0 (since it treats 1->2 and 2->1 differently). 296s + check[80]<-network.edgecount(!nw1)==2 # Should have choose(3,2)-1=2, has 3. 296s + check[81]<-network.edgecount(!nw2)==2 # Should have choose(3,2)-1=2, has 2. 296s + 296s + #If everything worked, check is TRUE 296s + if(!all(check)){ #Should be TRUE 296s + stop(paste("network package test failed on test(s):",which(!check))) 296s + } 296s + 296s + #End test 296s + } 296s > 296s BEGIN TEST pathological.tests.R 296s 296s R version 4.4.3 (2025-02-28) -- "Trophy Case" 296s Copyright (C) 2025 The R Foundation for Statistical Computing 296s Platform: arm-unknown-linux-gnueabihf (32-bit) 296s 296s R is free software and comes with ABSOLUTELY NO WARRANTY. 296s You are welcome to redistribute it under certain conditions. 296s Type 'license()' or 'licence()' for distribution details. 296s 296s R is a collaborative project with many contributors. 296s Type 'contributors()' for more information and 296s 'citation()' on how to cite R or R packages in publications. 296s 296s Type 'demo()' for some demos, 'help()' for on-line help, or 296s 'help.start()' for an HTML browser interface to help. 296s Type 'q()' to quit R. 296s 296s > #Set to TRUE to run tests 296s > if(FALSE){ 296s + 296s + library(network) 296s + if (require(statnet.common,quietly=TRUE)){ 296s + 296s + opttest({ 296s + gctorture(TRUE) 296s + n <- 10 296s + test <- network.initialize(n) 296s + for (i in 1:(n-1)){ 296s + for (j in (i+1):n){ 296s + cat(i,j,'\n') 296s + get.inducedSubgraph(test,v=i:j) 296s + } 296s + } 296s + gctorture(FALSE) 296s + },'Ticket #180 Test 1','NETWORK_pathology_TESTS') 296s + 296s + opttest({ 296s + gctorture(TRUE) 296s + test <- network.initialize(10) 296s + delete.vertices(test,5) 296s + gctorture(FALSE) 296s + },'Ticket #180 Test 2','NETWORK_pathology_TESTS') 296s + 296s + opttest({ 296s + x <- network.initialize(10) 296s + x[,] <- 1 296s + try(set.edge.value(x,'foo',matrix('bar',5,5))) 296s + },'Ticket #827','NETWORK_pathology_TESTS') 296s + 296s + } 296s + 296s + #End tests 296s + } 296s > 296s BEGIN TEST plotflo.R 296s 296s R version 4.4.3 (2025-02-28) -- "Trophy Case" 296s Copyright (C) 2025 The R Foundation for Statistical Computing 296s Platform: arm-unknown-linux-gnueabihf (32-bit) 296s 296s R is free software and comes with ABSOLUTELY NO WARRANTY. 296s You are welcome to redistribute it under certain conditions. 296s Type 'license()' or 'licence()' for distribution details. 296s 296s R is a collaborative project with many contributors. 296s Type 'contributors()' for more information and 296s 'citation()' on how to cite R or R packages in publications. 296s 296s Type 'demo()' for some demos, 'help()' for on-line help, or 296s 'help.start()' for an HTML browser interface to help. 296s Type 'q()' to quit R. 296s 296s > #Set to TRUE to run tests 296s > if(FALSE){ 296s + 296s + # 296s + # load the library 296s + # 296s + library(network) 296s + # 296s + # attach the sociomatrix for the Florentine marriage data 296s + # This is not yet a graph object. 296s + # 296s + data(flo) 296s + # 296s + # print out the sociomatrix for the Florentine marriage data 296s + # 296s + flo 296s + # 296s + # Create a network object out of the adjacency matrix and print it out 296s + # 296s + nflo <- network(flo,directed=FALSE) 296s + nflo 296s + # 296s + # print out the sociomatrix for the Florentine marriage data 296s + # 296s + print(nflo,matrix.type="adjacency") 296s + # 296s + # plot the Florentine marriage data 296s + # 296s + plot(nflo) 296s + # 296s + # create a vector indicating the Medici family and add it as a covariate to the 296s + # graph object. 296s + # 296s + nflo <- set.vertex.attribute(nflo,"medici",c(0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0)) 296s + nflo 296s + # 296s + # create a vector indicating the Medici family for the graph 296s + # 296s + medici <- rep("",nrow(flo)) 296s + names(medici) <- dimnames(flo)[[1]] 296s + medici[names(medici)=="Medici"] <- "Medici" 296s + # 296s + # plot the marriage data, highlighting the Medici family 296s + # 296s + plot(nflo,vertex.col=1+get.vertex.attribute(nflo,"medici")) 296s + 296s + # plot the emon St. Helens network, with edge widths proportional 296s + # to 'Frequency', and edges labeled by their id 296s + data(emon) 296s + par(mar=c(0,0,0,0)) 296s + plot(emon[[5]],edge.label=TRUE,edge.label.cex=0.6, 296s + edge.col='gray',edge.lwd=(emon[[5]]%e%'Frequency')*2) 296s + 296s + #End tests 296s + } 296s > 296s BEGIN TEST speedTests.R 296s 296s R version 4.4.3 (2025-02-28) -- "Trophy Case" 296s Copyright (C) 2025 The R Foundation for Statistical Computing 296s Platform: arm-unknown-linux-gnueabihf (32-bit) 296s 296s R is free software and comes with ABSOLUTELY NO WARRANTY. 296s You are welcome to redistribute it under certain conditions. 296s Type 'license()' or 'licence()' for distribution details. 296s 296s R is a collaborative project with many contributors. 296s Type 'contributors()' for more information and 296s 'citation()' on how to cite R or R packages in publications. 296s 296s Type 'demo()' for some demos, 'help()' for on-line help, or 296s 'help.start()' for an HTML browser interface to help. 296s Type 'q()' to quit R. 296s 296s > #Set to TRUE to run tests 296s > if(FALSE){ 296s + 296s + # some really basic speed checks to help us know if we make changes that massively degrade performance 296s + require(network) 296s + 296s + init<-system.time(net<-network.initialize(100000))[3] 296s + setv<-system.time(set.vertex.attribute(net,"foo","bar"))[3] 296s + getv<-system.time(get.vertex.attribute(net,"foo"))[3] 296s + listv<-system.time(list.vertex.attributes(net))[3] 296s + adde<-system.time(add.edges(net,tail=1:99999,head=2:100000))[3] 296s + sete<-system.time(set.edge.attribute(net,"foo","bar"))[3] 296s + gete<-system.time(get.edge.attribute(net,"foo"))[3] 296s + liste<-system.time(list.edge.attributes(net))[3] 296s + addmoree<-system.time(add.edge(net,100000,1))[3] 296s + addmorev<-system.time(add.vertices(net,1))[3] 296s + 296s + 296s + # optionally compare to benchmarks saved in test folder to see if things have changed 296s + # benchmarks<-rbind(init,setv,getv,listv,adde,sete,gete,liste,addmoree,addmorev) 296s + # oldmarks<-read.table(file.choose(),header=TRUE,colClasses=c('character','numeric')) 296s + # all.equal(oldmarks[,1],benchmarks[,1],check.attributes=FALSE) 296s + 296s + # optionally save out benchmarks to test directory 296s + # write.table(benchmarks,file=file.choose()) 296s + 296s + # some absolute thresholds 296s + 296s + if(init>5){ 296s + stop("initializing network for large number of vertices took much longer than expected") 296s + } 296s + 296s + if(setv>5){ 296s + stop("set.vertex.attribute for large number of vertices took much longer than expected") 296s + } 296s + 296s + if(getv>5){ 296s + stop("get.vertex.attribute for large number of vertices took much longer than expected") 296s + } 296s + 296s + if(listv>1){ 296s + stop("list.vertex.attributes for large number of vertices took much longer than expected") 296s + } 296s + 296s + if(adde>5){ 296s + stop("add.edges for a large number of edges took much longer than expected") 296s + } 296s + 296s + if(sete>10){ 296s + stop("set.edge.attribute for a large number of edges took much longer than expected") 296s + } 296s + 296s + if(gete>1){ 296s + stop("get.edge.attribute for a large number of edges took much longer than expected") 296s + } 296s + 296s + if(liste>1){ 296s + stop("list.edge.attribute for a large number of edges took much longer than expected") 296s + } 296s + 296s + if(addmoree>5){ 296s + stop("add.edge for a network with a large number of edges took much longer than expected") 296s + } 296s + 296s + if(addmorev>5){ 296s + stop("add.vertices for a network with large number of vertices took longer than expected") 296s + } 296s + 296s + #End tests 296s + } 296s > 296s BEGIN TEST testthat.R 296s 296s R version 4.4.3 (2025-02-28) -- "Trophy Case" 296s Copyright (C) 2025 The R Foundation for Statistical Computing 296s Platform: arm-unknown-linux-gnueabihf (32-bit) 296s 296s R is free software and comes with ABSOLUTELY NO WARRANTY. 296s You are welcome to redistribute it under certain conditions. 296s Type 'license()' or 'licence()' for distribution details. 296s 296s R is a collaborative project with many contributors. 296s Type 'contributors()' for more information and 296s 'citation()' on how to cite R or R packages in publications. 296s 296s Type 'demo()' for some demos, 'help()' for on-line help, or 296s 'help.start()' for an HTML browser interface to help. 296s Type 'q()' to quit R. 296s 297s > library(testthat) 297s > library(network) 297s 297s ‘network’ 1.19.0 (2024-12-08), part of the Statnet Project 297s * ‘news(package="network")’ for changes since last version 297s * ‘citation("network")’ for citation information 297s * ‘https://statnet.org’ for help, support, and other information 297s 297s > 297s > test_check("network") 299s [ FAIL 0 | WARN 1 | SKIP 0 | PASS 234 ] 299s 299s [ FAIL 0 | WARN 1 | SKIP 0 | PASS 234 ] 299s > 299s BEGIN TEST vignette.R 299s 299s R version 4.4.3 (2025-02-28) -- "Trophy Case" 299s Copyright (C) 2025 The R Foundation for Statistical Computing 299s Platform: arm-unknown-linux-gnueabihf (32-bit) 299s 299s R is free software and comes with ABSOLUTELY NO WARRANTY. 299s You are welcome to redistribute it under certain conditions. 299s Type 'license()' or 'licence()' for distribution details. 299s 299s R is a collaborative project with many contributors. 299s Type 'contributors()' for more information and 299s 'citation()' on how to cite R or R packages in publications. 299s 299s Type 'demo()' for some demos, 'help()' for on-line help, or 299s 'help.start()' for an HTML browser interface to help. 299s Type 'q()' to quit R. 299s 299s Loading required package: network 299s > require("network") 299s 299s ‘network’ 1.19.0 (2024-12-08), part of the Statnet Project 299s * ‘news(package="network")’ for changes since last version 299s * ‘citation("network")’ for citation information 299s * ‘https://statnet.org’ for help, support, and other information 299s 299s > set.seed(1702) 299s > 299s > results = NULL 299s > 299s > data("flo") 299s > data("emon") 299s > 299s > net <- network.initialize(5) 299s > net 299s Network attributes: 299s vertices = 5 299s directed = TRUE 299s hyper = FALSE 299s loops = FALSE 299s multiple = FALSE 299s bipartite = FALSE 299s total edges= 0 299s missing edges= 0 299s non-missing edges= 0 299s 299s Vertex attribute names: 299s vertex.names 299s 299s No edge attributes 299s > 299s > nmat <- matrix(rbinom(25, 1, 0.5), nr = 5, nc = 5) 299s > net <- network(nmat, loops = TRUE) 299s > net 299s Network attributes: 299s vertices = 5 299s directed = TRUE 299s hyper = FALSE 299s loops = TRUE 299s multiple = FALSE 299s bipartite = FALSE 299s total edges= 9 299s missing edges= 0 299s non-missing edges= 9 299s 299s Vertex attribute names: 299s vertex.names 299s 299s No edge attributes 299s > 299s > summary(net) 299s Network attributes: 299s vertices = 5 299s directed = TRUE 299s hyper = FALSE 299s loops = TRUE 299s multiple = FALSE 299s bipartite = FALSE 299s total edges = 9 299s missing edges = 0 299s non-missing edges = 9 299s density = 0.36 299s 299s Vertex attributes: 299s vertex.names: 299s character valued attribute 299s 5 valid vertex names 299s 299s No edge attributes 299s 299s Network adjacency matrix: 299s 1 2 3 4 5 299s 1 1 0 1 0 1 299s 2 1 0 0 1 0 299s 3 1 0 1 1 0 299s 4 0 0 1 0 0 299s 5 0 0 0 0 0 299s > results[1] = all(nmat == net[,]) 299s > 299s > net <- as.network(nmat, loops = TRUE) 299s > results[2] = all(nmat == net[,]) 299s > 299s > nflo <- network(flo, directed = FALSE) 299s > nflo 299s Network attributes: 299s vertices = 16 299s directed = FALSE 299s hyper = FALSE 299s loops = FALSE 299s multiple = FALSE 299s bipartite = FALSE 299s total edges= 20 299s missing edges= 0 299s non-missing edges= 20 299s 299s Vertex attribute names: 299s vertex.names 299s 299s No edge attributes 299s > 299s > results[3] = all(nflo[9,] == c(1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1)) 299s > results[4] = nflo[9,1] == 1 299s > results[5] = nflo[9,4] == 0 299s > results[6] = is.adjacent(nflo, 9, 1) == TRUE 299s > results[7] = is.adjacent(nflo, 9, 4) == FALSE 299s > 299s > results[8] = network.size(nflo) == 16 299s > results[9] = network.edgecount(nflo) == 20 299s > results[10] = network.density(nflo) == 1/6 299s > results[11] = has.loops(nflo) == FALSE 299s > results[12] = is.bipartite(nflo) == FALSE 299s > results[13] = is.directed(nflo) == FALSE 299s > results[14] = is.hyper(nflo) == FALSE 299s > results[15] = is.multiplex(nflo) == FALSE 299s > 299s > as.sociomatrix(nflo) 299s Acciaiuoli Albizzi Barbadori Bischeri Castellani Ginori Guadagni 299s Acciaiuoli 0 0 0 0 0 0 0 299s Albizzi 0 0 0 0 0 1 1 299s Barbadori 0 0 0 0 1 0 0 299s Bischeri 0 0 0 0 0 0 1 299s Castellani 0 0 1 0 0 0 0 299s Ginori 0 1 0 0 0 0 0 299s Guadagni 0 1 0 1 0 0 0 299s Lamberteschi 0 0 0 0 0 0 1 299s Medici 1 1 1 0 0 0 0 299s Pazzi 0 0 0 0 0 0 0 299s Peruzzi 0 0 0 1 1 0 0 299s Pucci 0 0 0 0 0 0 0 299s Ridolfi 0 0 0 0 0 0 0 299s Salviati 0 0 0 0 0 0 0 299s Strozzi 0 0 0 1 1 0 0 299s Tornabuoni 0 0 0 0 0 0 1 299s Lamberteschi Medici Pazzi Peruzzi Pucci Ridolfi Salviati Strozzi 299s Acciaiuoli 0 1 0 0 0 0 0 0 299s Albizzi 0 1 0 0 0 0 0 0 299s Barbadori 0 1 0 0 0 0 0 0 299s Bischeri 0 0 0 1 0 0 0 1 299s Castellani 0 0 0 1 0 0 0 1 299s Ginori 0 0 0 0 0 0 0 0 299s Guadagni 1 0 0 0 0 0 0 0 299s Lamberteschi 0 0 0 0 0 0 0 0 299s Medici 0 0 0 0 0 1 1 0 299s Pazzi 0 0 0 0 0 0 1 0 299s Peruzzi 0 0 0 0 0 0 0 1 299s Pucci 0 0 0 0 0 0 0 0 299s Ridolfi 0 1 0 0 0 0 0 1 299s Salviati 0 1 1 0 0 0 0 0 299s Strozzi 0 0 0 1 0 1 0 0 299s Tornabuoni 0 1 0 0 0 1 0 0 299s Tornabuoni 299s Acciaiuoli 0 299s Albizzi 0 299s Barbadori 0 299s Bischeri 0 299s Castellani 0 299s Ginori 0 299s Guadagni 1 299s Lamberteschi 0 299s Medici 1 299s Pazzi 0 299s Peruzzi 0 299s Pucci 0 299s Ridolfi 1 299s Salviati 0 299s Strozzi 0 299s Tornabuoni 0 299s > 299s > results[16] = all(nflo[,] == as.sociomatrix(nflo)) 299s > results[17] = all(as.matrix(nflo) == as.sociomatrix(nflo)) 299s > as.matrix(nflo,matrix.type = "edgelist") 299s [,1] [,2] 299s [1,] 9 1 299s [2,] 6 2 299s [3,] 7 2 299s [4,] 9 2 299s [5,] 5 3 299s [6,] 9 3 299s [7,] 7 4 299s [8,] 11 4 299s [9,] 15 4 299s [10,] 11 5 299s [11,] 15 5 299s [12,] 8 7 299s [13,] 16 7 299s [14,] 13 9 299s [15,] 14 9 299s [16,] 16 9 299s [17,] 14 10 299s [18,] 15 11 299s [19,] 15 13 299s [20,] 16 13 299s attr(,"n") 299s [1] 16 299s attr(,"vnames") 299s [1] "Acciaiuoli" "Albizzi" "Barbadori" "Bischeri" "Castellani" 299s [6] "Ginori" "Guadagni" "Lamberteschi" "Medici" "Pazzi" 299s [11] "Peruzzi" "Pucci" "Ridolfi" "Salviati" "Strozzi" 299s [16] "Tornabuoni" 299s > 299s > net <- network.initialize(5, loops = TRUE) 299s > net[nmat>0] <- 1 299s > results[18] = all(nmat == net[,]) 299s > 299s > net[,] <- 0 299s > net[,] <- nmat 299s > results[19] = all(nmat == net[,]) 299s > 299s > net[,] <- 0 299s > for(i in 1:5) 299s + for(j in 1:5) 299s + if(nmat[i,j]) 299s + net[i,j] <- 1 299s > results[20] = all(nmat == net[,]) 299s > 299s > net[,] <- 0 299s > add.edges(net, row(nmat)[nmat>0], col(nmat)[nmat>0]) 299s > results[21] = all(nmat == net[,]) 299s > 299s > net[,] <- as.numeric(nmat[,]) 299s > results[22] = all(nmat == net[,]) 299s > 299s > net <- network.initialize(5) 299s > add.edge(net, 2, 3) 299s > net[,] 299s 1 2 3 4 5 299s 1 0 0 0 0 0 299s 2 0 0 1 0 0 299s 3 0 0 0 0 0 299s 4 0 0 0 0 0 299s 5 0 0 0 0 0 299s > results[23] = net[2,3] == 1 299s > 299s > add.edges(net, c(3, 5), c(4, 4)) 299s > net[,] 299s 1 2 3 4 5 299s 1 0 0 0 0 0 299s 2 0 0 1 0 0 299s 3 0 0 0 1 0 299s 4 0 0 0 0 0 299s 5 0 0 0 1 0 299s > results[24] = (net[3,4] == 1 && net[5,4] == 1) 299s > 299s > net[,2] <- 1 299s > net[,] 299s 1 2 3 4 5 299s 1 0 1 0 0 0 299s 2 0 0 1 0 0 299s 3 0 1 0 1 0 299s 4 0 1 0 0 0 299s 5 0 1 0 1 0 299s > results[25] = net[2,2] == 0 299s > 299s > delete.vertices(net, 4) 299s > results[26] = all(net[,] == matrix(c(0,1,0,0,0,0,1,0,0,1,0,0,0,1,0,0), byrow=T, nrow=4)) 299s > 299s > add.vertices(net, 2) 299s > net[,] 299s 1 2 3 5