~/f/erlang27/RPMS.2 ~/f/erlang27 ~/f/erlang27 RPMS.2/erlang27-27.1.3-1.1.x86_64.rpm RPMS/erlang27-27.1.3-1.1.x86_64.rpm differ: byte 225, line 1 Comparing erlang27-27.1.3-1.1.x86_64.rpm to erlang27-27.1.3-1.1.x86_64.rpm comparing the rpm tags of erlang27 --- old-rpm-tags +++ new-rpm-tags @@ -3184 +3184 @@ -/usr/lib64/erlang/lib/ssh-5.2.11.4/ebin/ssh_options.beam 0ad290346ee4e1a04fc02f8aa11f65d20cbe00d53cc7b39bafebefc21864acf6 0 +/usr/lib64/erlang/lib/ssh-5.2.11.4/ebin/ssh_options.beam ceef9d73f4ce896f9eb4a696f60371c129375ad9ad92c977ae421d5d21ff108d 0 @@ -3520,16 +3520,16 @@ -/usr/lib64/erlang/man/man1/cdv.1.gz fd35278ebf4570ffbef11f6c39750677aef4c8dc226ecd1d600dcf9e95fd1f56 0 -/usr/lib64/erlang/man/man1/ct_run.1.gz 777a364f2e6eefb1f8221857a660b856c80726057768d696f690fdffdcad964f 0 -/usr/lib64/erlang/man/man1/diameterc.1.gz 4e066e5520d49b8eb4beb64d2ede224222cf05b39d97cf64fbda535a5f1e4273 0 -/usr/lib64/erlang/man/man1/edoc.1.gz 9c877f16d634db17d8c6b53083daa0dda512027c83f1d0cacde461897d143fb6 0 -/usr/lib64/erlang/man/man1/epmd.1.gz 8bfbc955ba3fcaa7a6ef5d072a54e26467958ef310776fec13729dd6ed31bb0a 0 -/usr/lib64/erlang/man/man1/erl.1.gz 66f4096faa803adbcfa844623edb997182e28a7fcb19c257503bb60734713f9e 0 -/usr/lib64/erlang/man/man1/erl_call.1.gz ad59cd5bb44409fced15cde6be25d3398dc3ff8ab436593abe566dd2b635ca64 0 -/usr/lib64/erlang/man/man1/erlc.1.gz 9980f2985f2cf12696097080021187441d9e0fb63c5ae8a604183f65a61da8e1 0 -/usr/lib64/erlang/man/man1/erlsrv.1.gz b16f6a915dd5c3b90c1c40a5cbe48925b09332c6d1034fa82124db07659417d0 0 -/usr/lib64/erlang/man/man1/escript.1.gz 9dd5bc384b5a0612cf9c74e842b200f67338e119bda97f976167c7872e798e9e 0 -/usr/lib64/erlang/man/man1/run_erl.1.gz 0957c7eb66d5d414b21ce54935468832305cf9a904f8ede6d91ffc1ffe954b62 0 -/usr/lib64/erlang/man/man1/snmpc.1.gz 3324053911a22948279960adb86974ce404337e83a761f7c2691b36153d0ed54 0 -/usr/lib64/erlang/man/man1/start.1.gz d6272a98560b4a4f3aa72fafd857ee0edfb740638bcb269f757c385407658a35 0 -/usr/lib64/erlang/man/man1/start_erl.1.gz d09d79c16455d2e163e57708baa0ad1c26ed5b3dad71ac07144c6fc749a57b14 0 -/usr/lib64/erlang/man/man1/typer.1.gz 9b2f3fbc6a03a32cb218fe519422c326bf6bf389b68ddf9648e964cdb110e1aa 0 -/usr/lib64/erlang/man/man1/werl.1.gz fe7e98276be1794becd29467c2bdd67f451d5c09af7fafcb80e99b57a37f668e 0 +/usr/lib64/erlang/man/man1/cdv.1.gz 58f6b512882cc8f6daffb866eda65ea77b30fe1b62f8c9788c8c6254954f1727 0 +/usr/lib64/erlang/man/man1/ct_run.1.gz e2d1961d86c94aafe4929e4b504ee9eabcb69062e3338994dabbd88df9a1ce91 0 +/usr/lib64/erlang/man/man1/diameterc.1.gz a3f88915366302eca57c948257d971801419674a3dc0d827ecb5675b95b8ef52 0 +/usr/lib64/erlang/man/man1/edoc.1.gz b687faa1b008d2465b657112a77eb2028eabf55f97a1c563fa7cacfa767820a2 0 +/usr/lib64/erlang/man/man1/epmd.1.gz 0b449abc63e1209dfe473501039c9133b64ff2800220eaac8061705bdfc5bc11 0 +/usr/lib64/erlang/man/man1/erl.1.gz 7be5cbba7d59447cb0ebe0fdd4bdbe3835503297f8267d905fc6c5fac9ad7270 0 +/usr/lib64/erlang/man/man1/erl_call.1.gz ceef891bb00d521897404f75d3230ef26f95fb3563d9dd658f3ad60f588943c3 0 +/usr/lib64/erlang/man/man1/erlc.1.gz 3bf3b2dcdec563b2c230dbb74ef82b9a025e033b2df0f0f85bb33bbc56441690 0 +/usr/lib64/erlang/man/man1/erlsrv.1.gz a5df300bb48af9226cd67f042d8fd0b675a820166e20681dc32b0583ac982800 0 +/usr/lib64/erlang/man/man1/escript.1.gz 2974cfb25c0f57dc917ea9d77027632b2b0b0261977ffdeeeda74b10aa405809 0 +/usr/lib64/erlang/man/man1/run_erl.1.gz e9e60f0e3f8d6b3c62507fde55c8556bafb0b6931305d0b372bd44387c7f049e 0 +/usr/lib64/erlang/man/man1/snmpc.1.gz fb56c1562f34cfdc1d50aab686585c784a5834c1e916dffc2de9e04ccf6f865b 0 +/usr/lib64/erlang/man/man1/start.1.gz 41780c1212c75d5c584cbf6cc397208388d06cee8cfbf2685bdcf1b483d7fbe9 0 +/usr/lib64/erlang/man/man1/start_erl.1.gz f6c56951647199815c79029096c52c705d7dea9965eff69b149a958f60efcbc4 0 +/usr/lib64/erlang/man/man1/typer.1.gz 4245eb84883ace560d3f0c57d853842a7eea4452b7c8c37d0441c121c064c812 0 +/usr/lib64/erlang/man/man1/werl.1.gz 654c4dc466bfbe6fb1f50244777d3a07df44e6960cac9f5b1efff3284af4fdb7 0 comparing rpmtags comparing RELEASE comparing PROVIDES comparing scripts comparing filelist comparing file checksum creating rename script RPM file checksum differs. Extracting packages /usr/lib64/erlang/lib/ssh-5.2.11.4/ebin/ssh_options.beam differs at offset '69475' (Erlang BEAM file) --- old /usr/lib64/erlang/lib/ssh-5.2.11.4/ebin/ssh_options.beam (hex) +++ new /usr/lib64/erlang/lib/ssh-5.2.11.4/ebin/ssh_options.beam (hex) @@ -1,8 +1,8 @@ 00010f40 6e 65 74 00 00 00 03 77 05 74 69 74 6c 65 6d 00 |net....w.titlem.| 00010f50 00 00 0e 44 61 65 6d 6f 6e 20 4f 70 74 69 6f 6e |...Daemon Option| -00010f60 73 77 05 65 71 75 69 76 6d 00 00 00 0a 70 77 64 |sw.equivm....pwd| -00010f70 66 75 6e 5f 34 2f 30 77 08 65 78 70 6f 72 74 65 |fun_4/0w.exporte| -00010f80 64 77 05 66 61 6c 73 65 68 05 68 03 77 04 74 79 |dw.falseh.h.w.ty| +00010f60 73 77 08 65 78 70 6f 72 74 65 64 77 05 66 61 6c |sw.exportedw.fal| +00010f70 73 65 77 05 65 71 75 69 76 6d 00 00 00 0a 70 77 |sew.equivm....pw| +00010f80 64 66 75 6e 5f 34 2f 30 68 05 68 03 77 04 74 79 |dfun_4/0h.h.w.ty| 00010f90 70 65 77 0c 6b 62 5f 69 6e 74 5f 74 75 70 6c 65 |pew.kb_int_tuple| 00010fa0 61 00 6c 00 00 00 02 68 02 77 04 66 69 6c 65 6b |a.l....h.w.filek| 00010fb0 00 07 73 73 68 2e 68 72 6c 68 02 77 08 6c 6f 63 |..ssh.hrlh.w.loc| RPMS.2/erlang27-doc-27.1.3-1.1.x86_64.rpm RPMS/erlang27-doc-27.1.3-1.1.x86_64.rpm differ: byte 225, line 1 Comparing erlang27-doc-27.1.3-1.1.x86_64.rpm to erlang27-doc-27.1.3-1.1.x86_64.rpm comparing the rpm tags of erlang27-doc --- old-rpm-tags +++ new-rpm-tags @@ -213 +213 @@ -/usr/share/doc/packages/erlang27-doc/doc/system/dist/search_data-055E0B48.js 2 (none) 100644 root root 0 4294967295 +/usr/share/doc/packages/erlang27-doc/doc/system/dist/search_data-A3AB6FFD.js 2 (none) 100644 root root 0 4294967295 @@ -547 +547 @@ -/usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/dist/search_data-B6F18E29.js 2 (none) 100644 root root 0 4294967295 +/usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/dist/search_data-889ACB16.js 2 (none) 100644 root root 0 4294967295 @@ -592 +592 @@ -/usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/dist/search_data-1406756F.js 2 (none) 100644 root root 0 4294967295 +/usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/dist/search_data-55C9925A.js 2 (none) 100644 root root 0 4294967295 @@ -753 +753 @@ -/usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/dist/search_data-1A8AA22A.js 2 (none) 100644 root root 0 4294967295 +/usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/dist/search_data-FC950B1D.js 2 (none) 100644 root root 0 4294967295 @@ -871 +871 @@ -/usr/share/doc/packages/erlang27-doc/lib/eunit-2.9.1/doc/html/dist/search_data-4CEF3D2D.js 2 (none) 100644 root root 0 4294967295 +/usr/share/doc/packages/erlang27-doc/lib/eunit-2.9.1/doc/html/dist/search_data-C541596B.js 2 (none) 100644 root root 0 4294967295 @@ -904 +904 @@ -/usr/share/doc/packages/erlang27-doc/lib/ftp-1.2.3/doc/html/dist/search_data-DCE6DC3D.js 2 (none) 100644 root root 0 4294967295 +/usr/share/doc/packages/erlang27-doc/lib/ftp-1.2.3/doc/html/dist/search_data-6DB131C5.js 2 (none) 100644 root root 0 4294967295 @@ -938 +938 @@ -/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/dist/search_data-CCC5FE1B.js 2 (none) 100644 root root 0 4294967295 +/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/dist/search_data-BA4EB9A1.js 2 (none) 100644 root root 0 4294967295 @@ -1224 +1224 @@ -/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/dist/search_data-492AF504.js 2 (none) 100644 root root 0 4294967295 +/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/dist/search_data-2DB78EC4.js 2 (none) 100644 root root 0 4294967295 @@ -1441 +1441 @@ -/usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/dist/search_data-F08ECED6.js 2 (none) 100644 root root 0 4294967295 +/usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/dist/search_data-8BDC4DA6.js 2 (none) 100644 root root 0 4294967295 @@ -1587 +1587 @@ -/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/dist/search_data-D2253CE5.js 2 (none) 100644 root root 0 4294967295 +/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/dist/search_data-12AAC588.js 2 (none) 100644 root root 0 4294967295 @@ -1960 +1960 @@ -/usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/dist/search_data-486AE036.js 2 (none) 100644 root root 0 4294967295 +/usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/dist/search_data-9671378E.js 2 (none) 100644 root root 0 4294967295 @@ -2001 +2001 @@ -/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/dist/search_data-FCB758A3.js 2 (none) 100644 root root 0 4294967295 +/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/dist/search_data-C30560BD.js 2 (none) 100644 root root 0 4294967295 @@ -2369,2 +2369,2 @@ -/usr/share/doc/packages/erlang27-doc/doc/404.html e507051682899c100e8ebb30a7c9a2667871313ce85c1e0ed9eed4f184ef9ea3 2 -/usr/share/doc/packages/erlang27-doc/doc/asn1.html 2d5d1ae62b6c8ac065a6c2b7a67bffa528663c5b7fa75c614012ca44eab4203c 2 +/usr/share/doc/packages/erlang27-doc/doc/404.html 27d8b6d928d73141c781276620291b6ebfa192efe3cf22ffea9364fed6822e69 2 +/usr/share/doc/packages/erlang27-doc/doc/asn1.html 90efafb6ef574aa6f763497093956b79bf4c84760b70372f678ad5d252ef2ff6 2 @@ -2373,8 +2373,8 @@ -/usr/share/doc/packages/erlang27-doc/doc/common_test.html 33dc8d1195b6282ffca1bc92b193e69d225c9257c45c31f072c1f3428bee7cff 2 -/usr/share/doc/packages/erlang27-doc/doc/compiler.html cb6f169b29002a37b4098841e66b4340091b6332963aaaa6fd775c61a205a8ec 2 -/usr/share/doc/packages/erlang27-doc/doc/crypto.html bb06997da2c76e804b2322825826133473f011add29045dc64120a40df5dddba 2 -/usr/share/doc/packages/erlang27-doc/doc/debugger.html 7b22083a1e84557edfbae82c46c069330d8a05cb522684403905ca6a6c15deb0 2 -/usr/share/doc/packages/erlang27-doc/doc/deprecations.html ab2cdf5746126d9d15f7f4a4dcbbdce6bb99c5a6e218f38166387da94d31b577 2 -/usr/share/doc/packages/erlang27-doc/doc/design_principles.html b6485eb1ddcec01ee4f01ecb8c896a9418d09dcc6f7172c22fc0e7b05d5640a9 2 -/usr/share/doc/packages/erlang27-doc/doc/dialyzer.html f06876ff6aed856544cef04e9ec18aa2200c8d80c637a82b05139d1ef00e3e65 2 -/usr/share/doc/packages/erlang27-doc/doc/diameter.html d35647219828880ec93e86fbba566445cb98eac2d70dd903f1b1a3e3ad826e4e 2 +/usr/share/doc/packages/erlang27-doc/doc/common_test.html 4e7d1bbbbba3fddf3c875f50fbabfadca5b5a52107fa4dac6ee2bd1ce03e8fec 2 +/usr/share/doc/packages/erlang27-doc/doc/compiler.html 2a13e4a70b639bacbb3b28d0e004e6240a7dc26366529adf66bcd8f591b9e106 2 +/usr/share/doc/packages/erlang27-doc/doc/crypto.html 85678de5a1de90e166b39a377ff69423843101771466505e860a61867e562cfc 2 +/usr/share/doc/packages/erlang27-doc/doc/debugger.html 95734e3fc6b73ed8d14a6c8975c2e062280785fd17e61a6d4d9c9d01c170dee8 2 +/usr/share/doc/packages/erlang27-doc/doc/deprecations.html 60426e123e2a66798c2830ac164758657bb9b4a80a0929df8ab3c48029423591 2 +/usr/share/doc/packages/erlang27-doc/doc/design_principles.html ac7c22addd639b97f858bb5d4a57edbb13f0ac8478abfffdbad95b7d79cb71d2 2 +/usr/share/doc/packages/erlang27-doc/doc/dialyzer.html 4f071bfad1136c8a569aab665a202aba1778cee2bc53201e8da7e670952ba650 2 +/usr/share/doc/packages/erlang27-doc/doc/diameter.html 4649d407a78653b06b402a9079257ad9ec9deb225b1c825d08640095cb386f82 2 @@ -2401,10 +2401,10 @@ -/usr/share/doc/packages/erlang27-doc/doc/edoc.html ce83debb7b0ef88c93a64cef24f745481b0e1cf5fd5f6e3a32ffd53c9f5492cf 2 -/usr/share/doc/packages/erlang27-doc/doc/efficiency_guide.html 238f2978ba6a016e47238b8f3f575d9c5b7baddfb138922f1e34c58652c579a9 2 -/usr/share/doc/packages/erlang27-doc/doc/eldap.html e04a0820d33d3c4ce5c156e973935a02c0c4e234e00845f6f28af6ae2898b672 2 -/usr/share/doc/packages/erlang27-doc/doc/embedded.html b91d9a7e4acb443a19d5d9e4a5eea6bcb7614907dd5273ae2ae486f7fa4d45f7 2 -/usr/share/doc/packages/erlang27-doc/doc/erl_interface.html 0a3d879a1251698e0e52023702271fbeb6f82893c8b528c8b9fdee23e6c02901 2 -/usr/share/doc/packages/erlang27-doc/doc/erts.html fc93eeeeacbc3479d2c1ad2a07cf4eddd8a7b7d06d860ace3236bb762c8fb570 2 -/usr/share/doc/packages/erlang27-doc/doc/et.html 7131d82e86f6500f32736826d05f47b340af5e375e2f15b37222c1a9a97e4c84 2 -/usr/share/doc/packages/erlang27-doc/doc/eunit.html 20dbf3d7d2cbb57a3a90834a62bb164900519b8c97b4023d6f0f3d73185f8349 2 -/usr/share/doc/packages/erlang27-doc/doc/ftp.html a4c1531faa69ae3714bce32baa9c7e8dd6f90c8f5cfd2bd516b9c790e77ed6e0 2 -/usr/share/doc/packages/erlang27-doc/doc/getting_started.html 5d81655b769c7558732ab6040ffe5bd99137c5d3b26dd474d0c1683c63a8b685 2 +/usr/share/doc/packages/erlang27-doc/doc/edoc.html e051bcbe1858608d9e4a3ad7e17d5f71cc15dd7c1ef856e12169552666d9586f 2 +/usr/share/doc/packages/erlang27-doc/doc/efficiency_guide.html 4c8588b3237561cbab2f3ec130cbb0f52cc0550e2fd94df46362fd277fdad73b 2 +/usr/share/doc/packages/erlang27-doc/doc/eldap.html ea0de49df3bc18285aaa3e0f7c5d19270c1b0b4ecb13c1839d8effd132b1e40c 2 +/usr/share/doc/packages/erlang27-doc/doc/embedded.html 9c9d301fe49c64ea1cf568a1e477f3e352576431317e8f91607d5d038eaf0bf4 2 +/usr/share/doc/packages/erlang27-doc/doc/erl_interface.html 1a6cb2e8c831b71f44e0eab1b4196e6ce7e27cdb1f41c053e3efc0803c0ac5da 2 +/usr/share/doc/packages/erlang27-doc/doc/erts.html c93a496a359cbc88215efb5e19e946310ab9947d4557690aedf627fccd794d86 2 +/usr/share/doc/packages/erlang27-doc/doc/et.html 955f075b93aad352c59c75481870c946d3c23096d02217737eaf7b20f550bda4 2 +/usr/share/doc/packages/erlang27-doc/doc/eunit.html 3e470e968cd04f419ead7edf21ab372745041beeb0266eaddd2bef48bea88ddf 2 +/usr/share/doc/packages/erlang27-doc/doc/ftp.html b7dc3ff89152a671a85b2eb1ffa83f66499d2a19a84f46e93b12f2d0e32acc51 2 +/usr/share/doc/packages/erlang27-doc/doc/getting_started.html 999acc6beba039b361ffe780b015d73aadaa94209752d31d011aa2f3681de06d 2 @@ -2412,26 +2412,26 @@ -/usr/share/doc/packages/erlang27-doc/doc/inets.html e2cd762250de8212105bc689531333c5e4a69ccc0036d25ab934747b97e144c5 2 -/usr/share/doc/packages/erlang27-doc/doc/installation_guide.html 00c3e6ad4c31402fdb4d2effe5999ff8a46a4daa031d2cfbcfa87bd6e37ace5c 2 -/usr/share/doc/packages/erlang27-doc/doc/jinterface.html 3d013f29fe1404174a256e6b8e6b77594e744014a953ae0abd7831b65b0fa4da 2 -/usr/share/doc/packages/erlang27-doc/doc/kernel.html bc56d0602490ea1b6e7f62cb4b6eadf9efc00f6088b56e56cda9119d0594a4ae 2 -/usr/share/doc/packages/erlang27-doc/doc/man_index.html be332bbde9ad868026ba5861f97ee283125e280fd308bef440f2d311b46c5ba0 2 -/usr/share/doc/packages/erlang27-doc/doc/megaco.html 8e2d1adbaf2aa9cd58223e25b90a21ef58d513c13bc523fb473e53da7830a74d 2 -/usr/share/doc/packages/erlang27-doc/doc/mnesia.html ef5d5ec73453fe42d283660ed1049b681fbd900fad036f08147de6f2c3133a01 2 -/usr/share/doc/packages/erlang27-doc/doc/observer.html ea6dde49c80986cb6f4c70c9d1c051f4f3e0b16458537df77786ecb060e7921b 2 -/usr/share/doc/packages/erlang27-doc/doc/odbc.html abe8a5780e913db65aac1b69724855c9450557d992405f1997f835db4b336b4e 2 -/usr/share/doc/packages/erlang27-doc/doc/os_mon.html f62413fe61d07cd32b9bbe05c9c9f5061680a15792913e8c51a7e68e2e479cee 2 -/usr/share/doc/packages/erlang27-doc/doc/parsetools.html 58fb65615d4567790b49c7426195e20d6dd2e72a833dbf5667cf26959acbfe98 2 -/usr/share/doc/packages/erlang27-doc/doc/programming_examples.html f72d6a29e1e3b38c4ffdce4f0566fb3a3b7be9f8c2bb7c3c8b9b040a9e1ac2a1 2 -/usr/share/doc/packages/erlang27-doc/doc/public_key.html d3481411d590cfe21c000a5dd1e6ea5a9b02cff974ceb2f4da4cbd28183bf1b3 2 -/usr/share/doc/packages/erlang27-doc/doc/readme.html c205efb46b083e0edc35a626ac1ed8f480e4a748efd6120eaffe21fae3d5c1b6 2 -/usr/share/doc/packages/erlang27-doc/doc/reference_manual.html 09d88163bb169149e371a7b8518c41f92df0e8578a090506fe0fc1bf080c34ef 2 -/usr/share/doc/packages/erlang27-doc/doc/reltool.html cfb8660ac4d0abda8c8f7567ec8aae3238718be8d4f580579e5efec52ee56bbd 2 -/usr/share/doc/packages/erlang27-doc/doc/removed.html 5ae42781b2f4e52ba50ba46b89a4d3aeed1e42103a368c25fb68267e0103c982 2 -/usr/share/doc/packages/erlang27-doc/doc/runtime_tools.html 6b255daa3e29bec821655ffb9022706a110b0fce75ff4643768f3cbb49dd447c 2 -/usr/share/doc/packages/erlang27-doc/doc/sasl.html 3e58b2847485d84c549384f671533b8c80b285018a7a6c11dbe6782bdda3ff38 2 -/usr/share/doc/packages/erlang27-doc/doc/scheduled_for_removal.html 598fa2962520980642face9e843b6bc1841b175f2584e89e9ba091db80c42a9a 2 -/usr/share/doc/packages/erlang27-doc/doc/search.html 86c1a009e19000b7fd1af1195fab1d6c0fc9cee00fd5b1cfda6e0c2ed99627fe 2 -/usr/share/doc/packages/erlang27-doc/doc/snmp.html 535608e5a1ed7237082dc5dac0271cf598cec5c1b2757687713f8bd3faf94c11 2 -/usr/share/doc/packages/erlang27-doc/doc/ssh.html 79fa4659dc596900686d462dc7ab33d7822cd561d8bd735648014039fa3ffbb8 2 -/usr/share/doc/packages/erlang27-doc/doc/ssl.html 6dca9d42749d11fbae7c979daa686decbfc60fb5c09874894ad9649248bcc8e4 2 -/usr/share/doc/packages/erlang27-doc/doc/stdlib.html b2425d889ef8eda64d7e50b1c2b10105cb69b7a572864f8540285df785713b19 2 -/usr/share/doc/packages/erlang27-doc/doc/syntax_tools.html 7d2660ae6835572c4f02326c0029196d28ff723216f7a5051399c83ff75a7605 2 +/usr/share/doc/packages/erlang27-doc/doc/inets.html 3762b8c13032a299a8ae181ce4a870e4695661641a285eb4bba1986bfef9df96 2 +/usr/share/doc/packages/erlang27-doc/doc/installation_guide.html 26007873d63e66b065ff64719613c93e10df9eb867b3cf3b22a77713837fb0cc 2 +/usr/share/doc/packages/erlang27-doc/doc/jinterface.html 1adccf7837c438a7fdf9eb26ec68a49e58c5f2a0a401b60621dbe4b9bdbd81e2 2 +/usr/share/doc/packages/erlang27-doc/doc/kernel.html 570a0b7634bb18627c29fc2ebc7a0ef61c73717f7aa65f05048afe24f987f7d2 2 +/usr/share/doc/packages/erlang27-doc/doc/man_index.html 732b7682dd481acbf6e03375101cd3d960391d2b81932063346ec1da04bd8b92 2 +/usr/share/doc/packages/erlang27-doc/doc/megaco.html 19184ddd8b37bdc8f7371fc388e71dbb66b6b40610a777c1cfe4faebbee8631d 2 +/usr/share/doc/packages/erlang27-doc/doc/mnesia.html 9950a6b17c337a9433b4710b5c02c97dfaf28127386d4236f1c5808daec82012 2 +/usr/share/doc/packages/erlang27-doc/doc/observer.html e83d378e88a8d13bed448b879dba3dab38f50b0c983875e54d9288da7ccbd9bd 2 +/usr/share/doc/packages/erlang27-doc/doc/odbc.html 74f711cf11360aaf649c9459f28498e1cb866cd792ff526f736fded2a4cd44d2 2 +/usr/share/doc/packages/erlang27-doc/doc/os_mon.html 9e64a12c27564231c4303709c337ac1e851df3e0b59516809b6289137da5b396 2 +/usr/share/doc/packages/erlang27-doc/doc/parsetools.html 0ab96102ca8b7c5717165159d62e6f6361af9051cb6a032d73ace46b12c93834 2 +/usr/share/doc/packages/erlang27-doc/doc/programming_examples.html 01d39cff27dbecb53824a2fface10d72155f99b4bbcb4dd50350a6967011bf6a 2 +/usr/share/doc/packages/erlang27-doc/doc/public_key.html 0335ccb415c21ef85039f8b7ce238e968a7689ee8777a7e16b4be6d4b98b351d 2 +/usr/share/doc/packages/erlang27-doc/doc/readme.html 89c9a7ff2f4bff22f731f55fc1b97ae46fab46a0e3e31cbc50bda9a1dd081b4a 2 +/usr/share/doc/packages/erlang27-doc/doc/reference_manual.html bc0fa5a30ee3a27276f6c387b642b0c54a3473faac89a67edf2b3dbf6beafdb5 2 +/usr/share/doc/packages/erlang27-doc/doc/reltool.html aa7c575d5ed6c1aa299603dc6d45af38fc97948ce434273a2a9d193c6e851a7d 2 +/usr/share/doc/packages/erlang27-doc/doc/removed.html 706a8d40f15175f40be2d54c1a580053940e7e34f3bb270a94fbcfeebb6352df 2 +/usr/share/doc/packages/erlang27-doc/doc/runtime_tools.html 173f9150e6ca77dc5d7bc318c5701925a17c23c6e3fa49a4cbf2e8289417f9dd 2 +/usr/share/doc/packages/erlang27-doc/doc/sasl.html 205f73789bd0d7006febb773f0d90b15882f0b632b13adc78760a5ce129bb4b2 2 +/usr/share/doc/packages/erlang27-doc/doc/scheduled_for_removal.html fdde445852564adaceb2da1a74a83f73bf39927dd8f0a2c2c7ae481a2ca4712e 2 +/usr/share/doc/packages/erlang27-doc/doc/search.html 5d7366751844e8d19aaed8103dfe26648b64dc62e1a94af6b6f1e9fefdcfe22c 2 +/usr/share/doc/packages/erlang27-doc/doc/snmp.html b17039248cfe7fac2772318abccfe3b0ba272782e870b9b4d7a22e26c6eccd0b 2 +/usr/share/doc/packages/erlang27-doc/doc/ssh.html b548c7f286417e5a430b1f70035ba59b22dff229caf61d7e4b24bc1838fccafb 2 +/usr/share/doc/packages/erlang27-doc/doc/ssl.html 9a8dae73f971d93b6736961d8cf003ebbc8bc870fe95068dc3e1ba0fa4a2face 2 +/usr/share/doc/packages/erlang27-doc/doc/stdlib.html e2a5529395c3f3eb0cfad30ce64c3117d77177c34122592e4e7ca4b34ee66052 2 +/usr/share/doc/packages/erlang27-doc/doc/syntax_tools.html fc91e02caf9162156a8423f464fcbe2efe3150ac87b06c7e3da40b2c41925e99 2 @@ -2439,4 +2439,4 @@ -/usr/share/doc/packages/erlang27-doc/doc/system/404.html c102f86f568c04b869abbc9e0826c78eb59f870735913d72c68c3ae59ff23c1e 2 -/usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub 7ecd02683504dd6a3852dc3bf92c0e2335663e118e0f41ae04791bc47110b174 2 -/usr/share/doc/packages/erlang27-doc/doc/system/applications.html 1d8263a067db8fd90989d5db3266b059f33c24d8639b19a87f9e4993af458453 2 -/usr/share/doc/packages/erlang27-doc/doc/system/appup_cookbook.html db18493910ea76019dfefc8c23c0d4da2273ebf55205188ad88102056197d878 2 +/usr/share/doc/packages/erlang27-doc/doc/system/404.html 0901d793426c6c52c8988a52f4694c8b9eb66fe22ab9901f1318f967aabcfef1 2 +/usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub 6ff1c58c84e50609a52a8a52d908911811b4a6940c85313db8e69897156e9bec 2 +/usr/share/doc/packages/erlang27-doc/doc/system/applications.html 50bc38ca3ef0ad357aaa8add3a1761f800bcbe82480462005a94905cb07c759f 2 +/usr/share/doc/packages/erlang27-doc/doc/system/appup_cookbook.html cca031ceaf513123aad385b618645e21092268e0b4b95b7791bd1dd172977fad 2 @@ -2452,14 +2452,14 @@ -/usr/share/doc/packages/erlang27-doc/doc/system/benchmarking.html d13fa44445931f6ae60ea104fc603639adf04516de15049495232e24a318b2b9 2 -/usr/share/doc/packages/erlang27-doc/doc/system/binaryhandling.html 43596390b8b08f0d5d443d66e33eb86601706ebda487cde0734fca28f0136a9b 2 -/usr/share/doc/packages/erlang27-doc/doc/system/bit_syntax.html b5ec2da5a0dc9162b1aa262030a1a8d56ce9339b1494fc8ed8d6f6579b68f74e 2 -/usr/share/doc/packages/erlang27-doc/doc/system/c_port.html d3526d831af25814793824d9f66d04c9e01d12788179badda8f805def75271f5 2 -/usr/share/doc/packages/erlang27-doc/doc/system/c_portdriver.html 11756c698f235f8d9268a4408b756b0e6387d6d04c4fdedeba632cd381c9f677 2 -/usr/share/doc/packages/erlang27-doc/doc/system/character_set.html 40d10ae87a353f0e560b22655a7f5745d1fea196c1d70a5fec9879f79cb7257d 2 -/usr/share/doc/packages/erlang27-doc/doc/system/cnode.html 2ec4623300f8fbcb2d4c79e3eb05cae6b44f8e7403a24734c7f316758d636a90 2 -/usr/share/doc/packages/erlang27-doc/doc/system/code_loading.html acdc08c693ed2a08cd107f1235f534f7c3391219df2fdc6c20c7bfd4e5be5348 2 -/usr/share/doc/packages/erlang27-doc/doc/system/commoncaveats.html ea7e0ba194b742b51759a1a9a32b73d2fff9df1181f0c444d6fedc6012d44bc6 2 -/usr/share/doc/packages/erlang27-doc/doc/system/conc_prog.html 3c52ae5fd60d47c080cedf451c4a9d28989bf0ac5c511711ab59898a161f9715 2 -/usr/share/doc/packages/erlang27-doc/doc/system/create_target.html d9695a4e98874bf16447068b8f3b7e381a35e653063508eb1758421d34122116 2 -/usr/share/doc/packages/erlang27-doc/doc/system/data_types.html 07edf1864d25e77bad8427757b105b44d66a4a3ae962b27268ed6776473eba3e 2 -/usr/share/doc/packages/erlang27-doc/doc/system/debugging.html 29ff1fb21dc68dac2183d42c340943f43f946a30c6cdc06493d66ccc34a20e22 2 -/usr/share/doc/packages/erlang27-doc/doc/system/design_principles.html 9e4400052bad1a57ea50c699f0b427c32a6d22600271db4c62c2c754f13391a2 2 +/usr/share/doc/packages/erlang27-doc/doc/system/benchmarking.html 35472eeb5ae041ec7b768a54b5c8894ea344207e9bd7fbcd6abb0dfbdab8f397 2 +/usr/share/doc/packages/erlang27-doc/doc/system/binaryhandling.html 34143b035169516980b7d753628e8457528df34b07f1529b4dddd3bfe9dc25d7 2 +/usr/share/doc/packages/erlang27-doc/doc/system/bit_syntax.html 5338c6beac9817f731a9f703e7362098e24c78c08db84b35cb6d5c956b73105f 2 +/usr/share/doc/packages/erlang27-doc/doc/system/c_port.html fdc04c4547a4e8edf8910215e3e5cc523cfb5f70c2c283a58f63198970de33de 2 +/usr/share/doc/packages/erlang27-doc/doc/system/c_portdriver.html 0ea6a69856f068511a7cf403de04464afaad6d714193a935e69f7a840488144e 2 +/usr/share/doc/packages/erlang27-doc/doc/system/character_set.html 92ec9fbc22130c0a73e61f21cfe946bbcaf61217786870da9d8b28d3c464a76d 2 +/usr/share/doc/packages/erlang27-doc/doc/system/cnode.html cbaa71566d4103a41ce21ee51840fa61e5c50b6ea6198a4c818e90c956a7ee97 2 +/usr/share/doc/packages/erlang27-doc/doc/system/code_loading.html 7d42e8e3f94c668561f5024f6592b3922cfb501ec58a52f901321f76ac67960b 2 +/usr/share/doc/packages/erlang27-doc/doc/system/commoncaveats.html 42347e574d8fad6d367ab28a2d9bc0d7bbd158e66fd5be32095eebf262a5d6a3 2 +/usr/share/doc/packages/erlang27-doc/doc/system/conc_prog.html cab90f257a5c5d6b89a9326d09c628d5142a90a12f2036875a217a3d78d141a5 2 +/usr/share/doc/packages/erlang27-doc/doc/system/create_target.html 8397e9be7177b14b134cdb52fb3699797caf07dafaa7411e137d35328ed02f09 2 +/usr/share/doc/packages/erlang27-doc/doc/system/data_types.html 15a4dd5cc2c3577cedd358fd3171ee2520f7ab762bcb8aa59e63b7f0c9006948 2 +/usr/share/doc/packages/erlang27-doc/doc/system/debugging.html c24fa8351cf5854a5fe04fb4393a8476ab3f4affcc1d3fcc15ed89bb7c621274 2 +/usr/share/doc/packages/erlang27-doc/doc/system/design_principles.html 3cae9fa8490c7e6f03fd366aa217f377601d466e4f6183bf818816cc7cf36a9e 2 @@ -2484 +2484 @@ -/usr/share/doc/packages/erlang27-doc/doc/system/dist/search_data-055E0B48.js d0c0d0768cc77721fe3a8cab786d10d25cc92ce2e04823af9ec8a238c0280e7d 2 +/usr/share/doc/packages/erlang27-doc/doc/system/dist/search_data-A3AB6FFD.js d9ac70a2af82e7fe392f772d934eb59c1b6343fe5a5fb1f25173ee0faa5cf8a7 2 @@ -2486,19 +2486,19 @@ -/usr/share/doc/packages/erlang27-doc/doc/system/distributed.html 2d859266a609ba47f5ec53d596c8440980c7cb6e0eac08f91f8c483134215fd7 2 -/usr/share/doc/packages/erlang27-doc/doc/system/distributed_applications.html 119588a9101f9e0dd47c674f8863c2fd09946aa81b0a1e16b4d31ca3e1b8e28d 2 -/usr/share/doc/packages/erlang27-doc/doc/system/documentation.html fd502703e300b26f0a3608c854fe9e5e548803f7c263305fcbf32f74462992a2 2 -/usr/share/doc/packages/erlang27-doc/doc/system/drivers.html be37ef7866487700ed49e069f735fdda2569a89b4a5632288d12528dcfb08ded 2 -/usr/share/doc/packages/erlang27-doc/doc/system/eff_guide_functions.html b618481c0255b398001f80a1e2f9581dfaf00e738e1f9b00886737e93061ae05 2 -/usr/share/doc/packages/erlang27-doc/doc/system/eff_guide_processes.html d423d0ea077adc36f0e5acac8bae11439e6bd447b38b72d445edb13548529106 2 -/usr/share/doc/packages/erlang27-doc/doc/system/efficiency_guide.html e013124f3f3c80b2a70d3e96648f721d56357f061f397ef3c5baea529e773e61 2 -/usr/share/doc/packages/erlang27-doc/doc/system/embedded.html 655eb96f43040814d60fc4b7456da7c0bef45626f559957d8d325cfbf1ad0936 2 -/usr/share/doc/packages/erlang27-doc/doc/system/erl_interface.html e98b1f01d699206e1eba88e0215f21aa0b48ca3a2ce3ad204a2ec3a4dff30c80 2 -/usr/share/doc/packages/erlang27-doc/doc/system/error_logging.html 0cc108f21e73361b8014a5de895ef21c7b0f322b18dff76707e3eab1b9558e4f 2 -/usr/share/doc/packages/erlang27-doc/doc/system/errors.html 205b1b3bba084999c1e4f2e623a0bd5d3144fedd70015bdccf9236a48f19756d 2 -/usr/share/doc/packages/erlang27-doc/doc/system/events.html 3c150f752c89752dc8add2468018692c8a8104deb6f3041f5c357b8a3df008c0 2 -/usr/share/doc/packages/erlang27-doc/doc/system/example.html ae4c1b62300b364ea08fa2c5ff14f78cf919299e75883bd9ded034fc4c7f9a11 2 -/usr/share/doc/packages/erlang27-doc/doc/system/expressions.html d10d7d45e574f5471bdcdc1bf7d82fcca2e1f6676aca21eb537e75efd491cdc4 2 -/usr/share/doc/packages/erlang27-doc/doc/system/features.html cfd474d6ffc90c60fa1cbbb5a525389df7aac4c5d735c82eef1925e0f8714595 2 -/usr/share/doc/packages/erlang27-doc/doc/system/funs.html 41445753708ad7b77e092a2ee68de83fe095a0dcdebaa8066398d786dda30c27 2 -/usr/share/doc/packages/erlang27-doc/doc/system/gen_server_concepts.html 0c189c1f5ea93ac90537d84f7fef4710515b941c968d68b0cf9a8905316265ea 2 -/usr/share/doc/packages/erlang27-doc/doc/system/getting_started.html 55da3c6031db5f39ae75c68c14b6efcc72b17c9164433675aeeaf0986fc0e988 2 -/usr/share/doc/packages/erlang27-doc/doc/system/included_applications.html fea217b7e53fe8713f3f7f1c08a1ebe728a7caf45e3f0703c167624bb3a3238d 2 +/usr/share/doc/packages/erlang27-doc/doc/system/distributed.html fed9bbce7915c742cb848c76b1f8a10cbbb31ebe83ca1bd1a09587a5f09509ca 2 +/usr/share/doc/packages/erlang27-doc/doc/system/distributed_applications.html f16d6ece872d260c6356351e95ed6c0534f0aee326930333dcd8008845561fd7 2 +/usr/share/doc/packages/erlang27-doc/doc/system/documentation.html 83aef3dbbab24c63f6f10246f904ec0a3863ba18d1c940cdf4c13d1831451ccf 2 +/usr/share/doc/packages/erlang27-doc/doc/system/drivers.html 151c027d45ef6e03188e1aff126bd0b69a2bf1198c310f8f694c500b8a76899b 2 +/usr/share/doc/packages/erlang27-doc/doc/system/eff_guide_functions.html 371cb7aba02036d0eb4167d40646506127aec17ba7dc126d1fbf6a6eb4311e7d 2 +/usr/share/doc/packages/erlang27-doc/doc/system/eff_guide_processes.html 8b3aabc7c506c8c26b961ab0b3fbd328da001cb06ab8c7ae34feaf5c6ec32540 2 +/usr/share/doc/packages/erlang27-doc/doc/system/efficiency_guide.html f13bc559053883dda84d9c965da98253f69b5e55d98353914ff27699f845127b 2 +/usr/share/doc/packages/erlang27-doc/doc/system/embedded.html 44febe7b261d39a077381eee976f99cdda5dfcac2fd56f07277bf051aa679095 2 +/usr/share/doc/packages/erlang27-doc/doc/system/erl_interface.html 634188b42c31c7bba772f8ac80769de1e151c3f7b289247c5a28a913789355cd 2 +/usr/share/doc/packages/erlang27-doc/doc/system/error_logging.html 8b6292bb0e95a8f21f5fcd04abae8d3f7e9083730341d536d04f4e8e67e1b782 2 +/usr/share/doc/packages/erlang27-doc/doc/system/errors.html e8a9ffb26eac6085358826ca20b67600cf786a1bb683babe1c271daedaba48a9 2 +/usr/share/doc/packages/erlang27-doc/doc/system/events.html c4c9acee0b649837b8441473fc01e767291195ce14172c9e7289f75223649590 2 +/usr/share/doc/packages/erlang27-doc/doc/system/example.html 55d56b84a6a22ea3d2334444c4866f35364065b189a7c630d66369449e3fc61c 2 +/usr/share/doc/packages/erlang27-doc/doc/system/expressions.html dc4a969421168cf66ec6a7ff7ac4d7fb9115176be9e36675f1487f636293cd3b 2 +/usr/share/doc/packages/erlang27-doc/doc/system/features.html 482d8ca4088c217676c9a2667275550b089697adbb58e0590dfaa1a0107f0c6b 2 +/usr/share/doc/packages/erlang27-doc/doc/system/funs.html d50fe0f5b708eed514c6923a2b4759a8c5f146ce0d4afa1c8c6393b0a03855f3 2 +/usr/share/doc/packages/erlang27-doc/doc/system/gen_server_concepts.html 96336daaa9a91a7caee15286f10ed27dd46dfdb59405278cd40da937dad2f668 2 +/usr/share/doc/packages/erlang27-doc/doc/system/getting_started.html 850b2db91677f47d639014250cc180149dfae79f6a0c4937b79f6354d9e8e957 2 +/usr/share/doc/packages/erlang27-doc/doc/system/included_applications.html c3ee9e1aeb3279559d70c96e40b1f664b54d3b218f80fc99afff19815e9a2a40 2 @@ -2506,48 +2506,48 @@ -/usr/share/doc/packages/erlang27-doc/doc/system/install-cross.html 73c7c3f003957f4fbb4e0cf30580381c5f0ac20916418900846a947d2ee367b6 2 -/usr/share/doc/packages/erlang27-doc/doc/system/install-win32.html 44bc5d8232f2b305bfa056da18a656fab22461b1a97b5a13386447908ad9c02b 2 -/usr/share/doc/packages/erlang27-doc/doc/system/install.html 096d4b082f190aacb33e8d0959f894dfb6c4a0a5e96cc4174b1c447d4e3128b7 2 -/usr/share/doc/packages/erlang27-doc/doc/system/installation_guide.html 6604721a9f0cd7ed1b64650f18b7cc9677ecadd8e77fed4265490c168fca9a38 2 -/usr/share/doc/packages/erlang27-doc/doc/system/list_comprehensions.html 558a4c1b2ff319a431e40a230f58b138abf7d390fb76c88f4b5f16f63d9ae675 2 -/usr/share/doc/packages/erlang27-doc/doc/system/listhandling.html 38c028ac6a61f4e4d56979f56ddff0d6dcf3ee4179c5b52e7372cf5ae2194336 2 -/usr/share/doc/packages/erlang27-doc/doc/system/macros.html 909e343eb4eb1dc915ac2b7fc6f84e3f2857f2fc4aea0ac25e5c604c19c9d557 2 -/usr/share/doc/packages/erlang27-doc/doc/system/maps.html bdcb7a02cd52e781ead980a3a0b360817758fade18c72111c8079984178de267 2 -/usr/share/doc/packages/erlang27-doc/doc/system/memory.html 1d253c066d583e3f0fcbc0d87da288984b32d5c5c2e0c244ba37fa33464d0e92 2 -/usr/share/doc/packages/erlang27-doc/doc/system/misc.html 19f2cda187803f4270a5487ab4330673a0cfe7c591bfaf29b61f8a80870e5679 2 -/usr/share/doc/packages/erlang27-doc/doc/system/modules.html 66bd7caacce24167ac0b2381da7ee8da8bccb2fa99b80d432c394c0c49c56235 2 -/usr/share/doc/packages/erlang27-doc/doc/system/nif.html cb962409f97fd396abd1f4f0ae5046cfd6d99930e8e4d222b409d0addfc11b09 2 -/usr/share/doc/packages/erlang27-doc/doc/system/opaques.html 90a976c7d22929407966d5462bb5f86bc45fa9e81f59e67caac78f7dfc3501bc 2 -/usr/share/doc/packages/erlang27-doc/doc/system/otp-patch-apply.html 0cf5e0944d860d3f883ac111c0eab9d15c9a926e9378eb540058cd6126ee8ddc 2 -/usr/share/doc/packages/erlang27-doc/doc/system/overview.html d55be303f68cc0ce54c89247079e018a68c8f31d23b9bdfb020cdb66c74fd912 2 -/usr/share/doc/packages/erlang27-doc/doc/system/patterns.html 72702ebd84b0cf569032583ecdd5749be2c867c15539d2fbd092eabd8663da49 2 -/usr/share/doc/packages/erlang27-doc/doc/system/ports.html 8be5b9f07b4e53443bf166bda82abeec1f2e972af065c11afcf16cbfb12d4362 2 -/usr/share/doc/packages/erlang27-doc/doc/system/profiling.html 06a9ed1d5af736a12d22d214f1a1ff626c50394d7363b40db065c7a66858d878 2 -/usr/share/doc/packages/erlang27-doc/doc/system/prog_ex_records.html 3fcee0a46afed2eb572134b706b683ff39cac3e975b40ff0e08d2a6c9c680126 2 -/usr/share/doc/packages/erlang27-doc/doc/system/programming_examples.html 3d111d61fca42486fd7a4e8878fd456e6e7321ea2adc975d9be98dd805d9cd4e 2 -/usr/share/doc/packages/erlang27-doc/doc/system/readme.html 3cfa5ca28597480b0e449d00905171a054c3fb076bf888cc87b844bc5c6cf5d3 2 -/usr/share/doc/packages/erlang27-doc/doc/system/records_macros.html 29b953c892955b2bffcce997e678f361535bf77a4d7eb073bcf46c4c78dc2021 2 -/usr/share/doc/packages/erlang27-doc/doc/system/ref_man_functions.html 71e58d937eb47c7f21dc123cf173a3146bcd0efea80afc05296cd15569f91981 2 -/usr/share/doc/packages/erlang27-doc/doc/system/ref_man_processes.html db6952f3509fea82252a5f18ea2a7bc40e0de12752199bea055ee52a9a37f0d7 2 -/usr/share/doc/packages/erlang27-doc/doc/system/ref_man_records.html b13ee283475fc2dceeeb0dfc1cc627ced57a61bbe570e753c2848faa93f4429f 2 -/usr/share/doc/packages/erlang27-doc/doc/system/reference_manual.html 488dc82e5b0fcbbcd8291d4c00dfc465155583011dbc18beb0312bb141a8f702 2 -/usr/share/doc/packages/erlang27-doc/doc/system/release_handling.html 4615aa99ecc5d9f2ed43f0e43e13064a8e330185c0a57896fa52eeb727308026 2 -/usr/share/doc/packages/erlang27-doc/doc/system/release_structure.html 851cf3da4317c4ee88cd05ed322ef611eb065bf0a451ac95a021eb483bbde71d 2 -/usr/share/doc/packages/erlang27-doc/doc/system/robustness.html 1148beebe5d0dbbf8cd4cbbae8d315644ff0a7d03465e99868e84491980e4528 2 -/usr/share/doc/packages/erlang27-doc/doc/system/search.html 839aa849041d40df95538e94c8d75d6f38376788a6d5fce71971881b46bf595c 2 -/usr/share/doc/packages/erlang27-doc/doc/system/seq_prog.html 796d074aa2dab77527e201c0c00a5e0b58c233747f1b705b89271d1944caee73 2 -/usr/share/doc/packages/erlang27-doc/doc/system/spec_proc.html e90b1bbcc93a2ec04409a9e57c4b3c6b30e23644f2cafb83ef2602724e46efe7 2 -/usr/share/doc/packages/erlang27-doc/doc/system/statem.html e1b230386e8fe35d654ad56b55fbff52a41147a05f749c241bec3f20515e67b7 2 -/usr/share/doc/packages/erlang27-doc/doc/system/sup_princ.html e97243f633c870ae686675bf1738d69ffe3f4e8d6823b7488a8e8f4ee3af771d 2 -/usr/share/doc/packages/erlang27-doc/doc/system/system_limits.html 34fea7a2cf23d464a6160dceedc5233b00677f2556f1b49263b851df57304286 2 -/usr/share/doc/packages/erlang27-doc/doc/system/system_principles.html 1fcc475bae1a978dec14a13b785c4bdf09edc05075a7a22f0558e42992ce17de 2 -/usr/share/doc/packages/erlang27-doc/doc/system/tablesdatabases.html 3f6b26d922875e34503b8b41dbcfe08c68c4e1f021eb462613b877414d69990c 2 -/usr/share/doc/packages/erlang27-doc/doc/system/tutorial.html 8e3abdb7b5dd266411b960fe061a4df3a66a099e6f430b8cee77c9e378a45f68 2 -/usr/share/doc/packages/erlang27-doc/doc/system/typespec.html 90d1f3ea51450ce523786cd7a7a61c449cae2932b2189787853adf70fc0ffbf4 2 -/usr/share/doc/packages/erlang27-doc/doc/system/upgrade.html 65bb2501b3ed8275b7c4bc51894cd02b33a07255160d433e69e04e673dd3f62a 2 -/usr/share/doc/packages/erlang27-doc/doc/system/versions.html 2a49509e2cce2e76eac435c267efc1ec6ca10eafd99b1a8d0aeb3cfd67616df4 2 -/usr/share/doc/packages/erlang27-doc/doc/system_principles.html 906fbdc1a0617b697a1ee8778fc0c15c20a4e9b0b642436dce65a369bee0c8ab 2 -/usr/share/doc/packages/erlang27-doc/doc/tftp.html b7ec2dd28bef8b31616d96565c03c78d92e294df722915013d06106f0d7b7130 2 -/usr/share/doc/packages/erlang27-doc/doc/tools.html c0a682f5ab01ec78a1cec2421f9bc2a12ff2f0e99d8f29863f63e8adf7e2e3b2 2 -/usr/share/doc/packages/erlang27-doc/doc/tutorial.html d57ffc4c84aa6a1ea2d3b9c0f013681b629e73de4055cef22112b4ad87e1679f 2 -/usr/share/doc/packages/erlang27-doc/doc/upcoming_incompatibilities.html bd58b1b4c75eb9442e43ef882f8c0f2f90a45ec378de833663969b4bb8780edb 2 -/usr/share/doc/packages/erlang27-doc/doc/wx.html 2f047a75c3281e642a1e7b901bc907cab81bd7eab85e1e9d57e9ab34dc883c96 2 -/usr/share/doc/packages/erlang27-doc/doc/xmerl.html db3f0f7baf06bbdf3acf112c84adf75b35f5ce6f2c8d7601b9edaf6c50e2afb6 2 +/usr/share/doc/packages/erlang27-doc/doc/system/install-cross.html b43c1e3006978a82c8f0ebf6f883e796f8f22d26e229d3380828a54c2c4fde91 2 +/usr/share/doc/packages/erlang27-doc/doc/system/install-win32.html 5d68b16ca38644daa9e06dd93bc4623e0eadb626f940ab6e877abed50ddf6a37 2 +/usr/share/doc/packages/erlang27-doc/doc/system/install.html f1d3a726cac417608152545b2086687a6fb38e44d05893e639b137ac72e80bcd 2 +/usr/share/doc/packages/erlang27-doc/doc/system/installation_guide.html 645857683fd18cb27666cf2aa194b57e0925e9a746e234314d22d844a8917ce9 2 +/usr/share/doc/packages/erlang27-doc/doc/system/list_comprehensions.html 49030360d1be901d2ae7287c3abaaeff375042ae36707a913ff44b0a61c80167 2 +/usr/share/doc/packages/erlang27-doc/doc/system/listhandling.html e39d22b3ba54adca86ec3dc52eebb84a6d45a1278634613d068fcf38bcdadc5e 2 +/usr/share/doc/packages/erlang27-doc/doc/system/macros.html ebf75dee32e2b4f0dc6e02a2a5986ebb1d1bafac0619b244683eb144542063f2 2 +/usr/share/doc/packages/erlang27-doc/doc/system/maps.html 5693f2b5ff72a4b4648041013d1858c4e0f86bc5a0c1296290e26cea51f70453 2 +/usr/share/doc/packages/erlang27-doc/doc/system/memory.html b2b11396f5c1b9bed281d7e3a02fd8f8f1a4d31087f30bb8cd0b4cc029275494 2 +/usr/share/doc/packages/erlang27-doc/doc/system/misc.html fadbb7cee3c2b025986272f73c3814e0bd4f8616e299905fda624f29f599b4ad 2 +/usr/share/doc/packages/erlang27-doc/doc/system/modules.html aa47bf2164c7659f11fe2ba17e0a6ec5b08f2b510d24e9fc9912dea723aa1957 2 +/usr/share/doc/packages/erlang27-doc/doc/system/nif.html e6f1a29a6129d679392ee9b1bda9f6277ed1898f72dc38317d006f183e562617 2 +/usr/share/doc/packages/erlang27-doc/doc/system/opaques.html a3f9940667c93a3539686533bed56d0122394bca8c68b6b4e9ce934784213fd0 2 +/usr/share/doc/packages/erlang27-doc/doc/system/otp-patch-apply.html d8d202667b1360719ea61cad76d540b71598c8bc283559cf993c1b98f3bc21fb 2 +/usr/share/doc/packages/erlang27-doc/doc/system/overview.html dcee32cf85b0b57d4ca77aaef1a51392761e856e7afd7f15a9f51e3ea3d72a80 2 +/usr/share/doc/packages/erlang27-doc/doc/system/patterns.html ada05e686eda7df0aa2523121176769e973683a6e44f8f422c85bdad1e9a497e 2 +/usr/share/doc/packages/erlang27-doc/doc/system/ports.html 3c0be8eb7e22c147f6cbd7a27a3f5e3669f6eacf8988b77c5a579e73765834ee 2 +/usr/share/doc/packages/erlang27-doc/doc/system/profiling.html f9577fb4a886db52093226f0efbe7d5be54d4b7781fda237b96bb12071f8fc70 2 +/usr/share/doc/packages/erlang27-doc/doc/system/prog_ex_records.html 11794244701d28b938ff350ff207ee44774930a2d0ccc4e1b62d856339fd0370 2 +/usr/share/doc/packages/erlang27-doc/doc/system/programming_examples.html 44cf7b193d14648756ff0443c8baf638ee228650ba174b9d081b39d574b6b6f4 2 +/usr/share/doc/packages/erlang27-doc/doc/system/readme.html 9045164edf722129b0f265dbe4fea6816e889ce0c53d0dd0666877a468ecd04a 2 +/usr/share/doc/packages/erlang27-doc/doc/system/records_macros.html e0e02e0973009841203862bb1233ce36c3236e21e146b3909f98c6425578fdbb 2 +/usr/share/doc/packages/erlang27-doc/doc/system/ref_man_functions.html b128ff5c2d2f5ed703928c0ecee705fd42017cfe40dbc2f99baa1a7fa4de0c46 2 +/usr/share/doc/packages/erlang27-doc/doc/system/ref_man_processes.html 124f52ed4d5394e5356738a02f0aa2e4c9816d630e86e2f676cec4292b5b2fd2 2 +/usr/share/doc/packages/erlang27-doc/doc/system/ref_man_records.html e426cb79bcdbffb18c3417d9b7aaba094be034b1815435657ef0abdb27f159d2 2 +/usr/share/doc/packages/erlang27-doc/doc/system/reference_manual.html 28bffd99f82d6454f34340923e53a747fb134b99ff387144f512dbf2e1944d96 2 +/usr/share/doc/packages/erlang27-doc/doc/system/release_handling.html e487aede48d48388e4c5dfde984f5172df41d1f3c0ccbe525915bbb3453e35a8 2 +/usr/share/doc/packages/erlang27-doc/doc/system/release_structure.html 82b0c4c4b866a98812c331bfd2c2f728e1ab9ce8b6105ea0f49fac46c2992360 2 +/usr/share/doc/packages/erlang27-doc/doc/system/robustness.html b61ed5f43bb8d8dcf74b3a66186bc6c05bfd9dc8cc9570e2b0be5f62eef6c6cb 2 +/usr/share/doc/packages/erlang27-doc/doc/system/search.html 4d8dc5d6e8bfd1c4adac12180a085dcbdfa6b57813bc048bce4a5d2da62a50ca 2 +/usr/share/doc/packages/erlang27-doc/doc/system/seq_prog.html 8eca937a0ba5421c59e32efa4ce878aef20c7b46ea9263bf2e4d2d8decb16df5 2 +/usr/share/doc/packages/erlang27-doc/doc/system/spec_proc.html 0db70b5f6d2d36401dbd7d383e1350921427084b8c5ce6f259f12db74d284dbe 2 +/usr/share/doc/packages/erlang27-doc/doc/system/statem.html cb4fbbb2e067d75346e63efe767eab0f61a10cb5b1812421d2cb3fe0b79b576f 2 +/usr/share/doc/packages/erlang27-doc/doc/system/sup_princ.html 3209c53438de000a82076aa32ae2e889a1b29c5bf4517b35a856cc38a7443070 2 +/usr/share/doc/packages/erlang27-doc/doc/system/system_limits.html ae48f0bdba745a3294a5fb25f0f6868b18d565162e9ab033884307054c03a76e 2 +/usr/share/doc/packages/erlang27-doc/doc/system/system_principles.html 550a6dd0ffd8568f83ac7a33ac073fb54c8645510a8c8bec0f08c55d35defd04 2 +/usr/share/doc/packages/erlang27-doc/doc/system/tablesdatabases.html ae91e73e9553ce3050990214df9f51ce8f566a63f61f1be2e2c7286df070de95 2 +/usr/share/doc/packages/erlang27-doc/doc/system/tutorial.html 4bf9a2e82101d4192d6ecc060a819c148a1373b1536dcb53e7d1bf7edf15a564 2 +/usr/share/doc/packages/erlang27-doc/doc/system/typespec.html 34bf71322a535ff0565388ae4dcc227d51dacec2efdfcbd03d6a6ad25003c377 2 +/usr/share/doc/packages/erlang27-doc/doc/system/upgrade.html 942bac9558bbf20f8e478c880b5747e8cb40e3e298d8bcfde1fb46e09fb2776e 2 +/usr/share/doc/packages/erlang27-doc/doc/system/versions.html b354563fbe57a385b3820cc59a6993e217be5dc0bb02e79743012902972db742 2 +/usr/share/doc/packages/erlang27-doc/doc/system_principles.html 793e20347d85276388db091106c71ef98a525603b3939b9afd93af6183754caa 2 +/usr/share/doc/packages/erlang27-doc/doc/tftp.html 1b97fdaabb7ef202529387bf6dd891f0b92e7c1bb32aa0072abde4e0cd120b50 2 +/usr/share/doc/packages/erlang27-doc/doc/tools.html 1310be108b6dcbb110f091e5d83158b3d3ef3a49f84d7e86e50126ea341ccc4f 2 +/usr/share/doc/packages/erlang27-doc/doc/tutorial.html 39e3f5b01b0cf08273746d3657e01e4900d90aafea8321c29370ca8a19a3cfab 2 +/usr/share/doc/packages/erlang27-doc/doc/upcoming_incompatibilities.html a769ff0d13c0c884ff7306a9e73d4054a25d91045ee66044478165cb6be57557 2 +/usr/share/doc/packages/erlang27-doc/doc/wx.html 286d58628307a98c27d29b49f27c91f8659080dc701319c95c2c2772d595cae6 2 +/usr/share/doc/packages/erlang27-doc/doc/xmerl.html e25528c9edbdc12cab737124e0c5783e82a44a525e869c282b4ccc89a3a8a849 2 @@ -2557,5 +2557,5 @@ -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/404.html 1d514a53a1b104ac421abe3fc4d16915e40eb86f199456976cb7d261e4c0a3c0 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/absform.html 3318534c96fdd55be564b596b1b0439f584c5e8bfff0f3f119a6bc12fa224b57 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/alt_disco.html d38a7de4f1583e898933009eaea8060d960ee16ee257d6738ec0ef0a27214296 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/alt_dist.html 2e3fbf60a25fd68dc82c1a656a5ba8b84d52034ec27f7b74fe93d93d5f7fd522 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/api-reference.html 25c522fbbc09c1bf0ccb765c62b312d458354c19597721659e42f763c2791d6e 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/404.html c4c456a475c7912ba76e1a99747168d8f9853614ace7a797b331c4d30aef8a65 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/absform.html 32f901b0a07889d4c89ac8815ace87f9909528df6a4d73b8047f13f04288138c 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/alt_disco.html d3406bf835d987abee999a044342437e52fea6326cc8c0df503ab715b1472f27 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/alt_dist.html d824cc45538c173fdb4cfdf98d908a6130179c5e3419e521006708adaca68432 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/api-reference.html 43eaf323038a939af8ccee63720571ffb11a3512bef6c7a9abdfbdde8d6bbf4b 2 @@ -2577,11 +2577,11 @@ -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/atomics.html a8703e0c721a335730c36fcf1f8bb44e1a4ab7ad91890f96d26f84e561c45146 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/automaticyieldingofccode.html e62dd348a99582c4a5c07cfcbb8f4b481ede4f98d5d636947a992dacf8528a46 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/beam_makeops.html 4fb5a01ca24bc2a789c11e47340208c1b6ecf319aeca46474c527e3dc441afc8 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/beamasm.html f0c53b0f36dc867ee026893010d056c284b933724b2053e2908cff3f2b2505c0 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/carriermigration.html 3059780ad03bba3bafd85fb43b7196399fe6aa7c6e3479afef44299d87344397 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/codeloading.html 08ff23e3047d5eab479b60382348b5791e9b3117014c87ce4ee9a0bc05ad89d0 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/communication.html d2d0ba22690904cafacd452807c0acca6c2e8d9aec1fecc5c2d14d4c8bc89927 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/counters.html 43dbb05f76f545bdd0a103f2e079c9b8b6b285ba0a59861c41d3fc6126186c5d 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/countinginstructions.html 274a63dac442265464fd841109d63481a402f7528fc4f3a5cd7bc23cd8034266 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/crash_dump.html 4dab13e85348479c7b56804701d96748d733bbcb4c53ef49dedd12c08649ecf7 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/delayeddealloc.html bf0b802142f4f38fe50711e2f7462b17553620c5c8155a31ec6bb79d72500932 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/atomics.html 1d065b206ed3cebb9c058f554b1eb424a812e5376a0634f04ff6c9448ccb2682 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/automaticyieldingofccode.html d3b2b83b4d75e371d3c2c4d8cfed93c1401092490c267bff8efab32304b1a6f0 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/beam_makeops.html 0ce826b8fbc22e1a2ad279e85914b53b6d60995a9880728ebc4cb3efa1fe3a7d 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/beamasm.html 8df5e071279472add55dd6f75762050ace1f3af3105c6cb2fee3d848a1a333c2 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/carriermigration.html eaf369595cf4acf5732bc374dc2f9de024cdc71e44455fd6f329ab749f7c5440 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/codeloading.html ed9dcd6f4801f319c48adcbbd202b4c0a0d5ff5c7feb832aa5afac03f414470d 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/communication.html 407a8cf38da0e860d78a9d8baa30331e8428ad283f220c5dafccf59c1fcb0780 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/counters.html 7a8b30ad8c94d61160a65e9204c5b0ccb888b79e99cb9f8314f8aedc2456907c 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/countinginstructions.html f09b358b1b76273ed143c286a6f7af1e07a0f14ea395613ca2dc67673d6e942f 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/crash_dump.html 31798ae7358c237c7a6b2922eaba825bd33feba0af3255acbbd6ac894f1f2c48 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/delayeddealloc.html 3f9ba1c630ac7ed13bbe33a0b38d521ccc396a17e9ae5954e6e13df54aa36576 2 @@ -2608,16 +2608,16 @@ -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/driver.html a1df1ecba764b69532d2f80012f6e5cc0072988d059011e28523e0be2a4473bb 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/driver_entry.html aea0b5107d3a42bf3a16f9152845aee2ccb8bb938fd238d6100495222fdcd177 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/epmd_cmd.html bfd977516335c729582d7947a1e96c4556d3eb63606acecebd810f8466ce7002 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erl_cmd.html f58a3a94efadde11f4d8528a6c01953e97ffd428e90211bfc90bbcdfd693f3af 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erl_dist_protocol.html 4ca65a0df6b4edafd1519272f7a66a3a79c0fa32796e25ff1f77fd5c0197e859 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erl_driver.html 4820639b28da41eb28cdf8562370460d75e45078fe22f9d2ad73a2345f927ee0 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erl_ext_dist.html f8204a9d8bd1325bc7d48dc0aecade18535514ae7e371c2fe8f5f16c86c3ff72 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erl_nif.html a3da90f5a1aab4477681b4f74e715fd29be6097fa8ce6e74a4721225c151eb5f 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erl_prim_loader.html f62fbd081df7b18e9505d750a444f8241961b046650b131bacecc631b55271ab 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erl_tracer.html 20143200c1ec1d7abc9ffe593e3b705e48e6bad4942af93cd2cc059e19730d07 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erlang.html da2b62407f6cdaf72d05c5ab8fa5743d4713610de92a2621f1097a9c2fa0f745 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erlc_cmd.html 3bfeee7732c562539389a868e25e38778bd260cf5a1f06221bbcd609985ecac6 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erlsrv_cmd.html 06373004e1d9a8919982d91f3dd846ad42b1e81aeffedeb4cdc39f9065c6edf3 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erts_alloc.html d0b930d0f7d756c02627562138b2f725fae782bb9ce7208cd682db5bcec72e84 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/escript_cmd.html 89e96b1643ec2ca9ab0a07841572a8f865ce207e2d9d0168a18c9964c1e11bb2 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/garbagecollection.html 018fe49f6d61aba5fe5c1d338297dda7711139571bca80479dd1af61b6153cb0 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/driver.html 18bb553e7f6a479a6f81b31c084a81d85fc28d3c6465d25ffffc4ced5c05ef74 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/driver_entry.html 0a1b4fc9e9636b4b6668f34bdc1adb8ffcf04568e330eeff1cb2fe583541e407 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/epmd_cmd.html 6948cfe00ebb31d08169f0341e6c8c83cf4cfb3931c9d48fe5dffeef30a1b282 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erl_cmd.html 29a654ff5d8d7d83c05bef178ef413cc50e96b239d5f51ae3732468978041e53 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erl_dist_protocol.html 163856440310d2571bb9635460de6e2430096b9913e092e3b639e582ec993886 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erl_driver.html 1ae65da3de02404e4677918424614310b56fdfcec68c44308f6ca9273279d45a 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erl_ext_dist.html 57cb419f47ad469ecfa9ff8db8d2c62cdddf49ee51bad3a1ab8f1f8c298fc785 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erl_nif.html a2bbadaa55d28ef5a4e4ab78a0ac8e5ef39132be037122653d4a2f6257d449c4 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erl_prim_loader.html 0769c9f27b8d5ea983f4659ac6469d9ab4470635ac386ee68e6cd1345940c6a4 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erl_tracer.html 4e7874621e64ead1c46461d826df7d288345679fd2ad897b3543265e6d9e20f2 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erlang.html 647b652f407e50c87b0e1ea1485b6a905267122ad8657699067b6c895e828e46 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erlc_cmd.html 29c782c760dd536a452174fa2158ef6a94f06ae992bae2e92b9b614dcf5345a4 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erlsrv_cmd.html 13c55dc1655877e8d6ca3b141c8b02e2c5980243d3b44bbb88faf76f427737e0 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erts_alloc.html 6e59af26d23a1354e0d44afde7a0b580f7447e31fd63376d913be8bf813aeef7 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/escript_cmd.html af23c8397447cd0185cccec2affcf87e79c00be7c34048fcda81126922267d26 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/garbagecollection.html c325ac1b736696e816a6798b7e8bb2e6874c74cd6f9d324558960ee464d33d17 2 @@ -2625,20 +2625,20 @@ -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/inet_cfg.html b0a75ccd486703cafe54d18061b6048e7811748b3374b14b9ede769cf9fc3b02 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/init.html 29377cc2a549df307cd906c5284c670ca049f1033e05bb8a7ff791c153ee4e92 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/introduction.html eb6118b05e2f89377d20d5111a30bf26e8ce3d3fe6a938c6c7794234d4a4546f 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/match_spec.html 68934c2c5fb3ff1fc44f88a1638dd099f59c75993b33e92808ead31ef6c6b481 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/notes.html 36ec8e28d4536dd296be9a9e678771476c3e78f732bd0834d5ed519ff4c53b03 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/persistent_term.html 4dcf53912a9c0398114bc09c48ff18e3849914705816d52c6610573e108b5b8c 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/portsignals.html b803fb0271c83f2a9b8c6375b31c1bbc4feec1767ec6582b0b027c6cac3dd40e 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/processmanagementoptimizations.html 824adfd641c2be1efbe61cbabbedd7b7f7fdcfd5077ade51a1a3e7a78791360b 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/ptables.html a08c4263a83cb1b101efb38924ba8d2474c0256490685bdc748426bc44961639 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/run_erl_cmd.html 119c66f10b22d765aca13a3e86904e7d451579067df7e7477508ab7c483ea8f0 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/search.html 8d9f9be7cb98ebdd22b97db5cc2ab8c44b75f0aa98e92fcad054cea7934ec4a4 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/start_cmd.html af42eacf9a038b3639463b7889501a06bc9c73f7d293fb98177ed00dc5ad1275 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/start_erl_cmd.html ce30bd86c9cb964e346e39f91dafc5f8f579fca47c2938e54fb4a4f6283522f6 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/supercarrier.html 58ddd223918e1e20b9d5b295bfdf5d6b48ed66b9990f9a5257153b68b4b3c925 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/threadprogress.html 97e909a00b8864f77331467c37ea58423c42edbfe2f804ea6e3b7e04375f1fe7 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/time_correction.html 0c636fba3db7ecd703dcf429014cf74278176d5aeec4f21e2d51725b7ff6df2b 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/tracing.html b213b895333d818d21c1bb23a7362ac62225d7adfacb2909c0350daf980f0b19 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/tty.html e4d423e05efa58e963b464bd7bac2ee5bc34a6e23a539f908d242c2a317de611 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/werl_cmd.html dc01b8b7b6e0405416440a2bfed95cc0aee0fa8db0ee7785120f33212f1e39e3 2 -/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/zlib.html b494d44a9c940a6022515cdcf73205efb1c7b85a724d1e3c12bca5744d145461 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/inet_cfg.html 8041f67c8b4c88a0cc4d0974c565f347bfa9ae423c76ed8b207247685b1f6a5a 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/init.html d0e0b1f08bfe9f7a5a9e1c66ac5a58ce4563cadffb1e3cd8b7d451c9b8c8b107 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/introduction.html 10f2f7c1bd84cb70a6b7808673dcab81c5baf493aa86419c71bb16f8c8ddc906 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/match_spec.html 054e72c7d6f026b0f0de40b24195f17c0765aa6a00e3bb7d4fdc5b4cdf14447a 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/notes.html 4102f91091d4414b27740d7fdad431bd9e76e558814fd301b1df2a6260835d83 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/persistent_term.html 83c750c905659280942d98aad5979a26e61e17a7a3daf51f4d4e5dd375fed84e 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/portsignals.html 09f04c8feac0a37481806147f19c33f4f2472b1ea26537253e13683467c506de 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/processmanagementoptimizations.html 6a854fff2f54f5ed1cd017a0f9b7d4cdc901d506854f13f77595026946322a7a 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/ptables.html 1da49f60142a99802da3a60ed1df7cb7fb64c3609e625a69d629ddd12590306d 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/run_erl_cmd.html 8a31af86b4b65bb42a2aea4200d758ee41298c3e81abf7f4c235b6cdab16f69c 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/search.html e702a89afbf5c467ed60d6f5ff07c2e88eb3e4aa3334d8a229d34beea12e079a 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/start_cmd.html aa374ea95470268ab25e2f5ff281551032b711febdfe10f84fae46671b3564b1 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/start_erl_cmd.html df6cbaa5792b53055b4ef922da13b190616926f6284637eba422b9a31dde2282 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/supercarrier.html f7aaf159e9cbbb66f241de2a218c0c80dc234534a37ba8342164f4b9b6dfbc95 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/threadprogress.html 220c98d6b65cc05d6c7fcfd60a02aefdd13c44c6fff7ac49c9a8fe75ec4d6892 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/time_correction.html a44fd261237ac5bce8c667011cdde2e41f7da71f24d3c2ca1b2a02fc0c97bbf9 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/tracing.html e08b420a69514838a79f87729c33ae9dc30eb00e1854b8a4814e9a8328519225 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/tty.html 373ea518aadef4e3b437e179d65584986f4ef9f04ef33167d2e19de879fde082 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/werl_cmd.html a6fa015d3ecdfadc57b950a2a864f81de3dd90fb996842598b657b8e3f335b32 2 +/usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/zlib.html a1c33d9360c83ff21013b75c8107e9b1a70b77f6b5af0cbb4d3734d14582469b 2 @@ -2649,8 +2649,8 @@ -/usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/404.html d965d77afa160d5c25e76c61756b52579587595786ec8ae80e165b80e6eb0c93 2 -/usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/api-reference.html c64fbee5194d1498fcd01e05728a5c71c2c6ca4c948cf466782382f36737b7fe 2 -/usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1.epub 8205ec7f3d3345de90907388756b3d1ba02c506facb2175958276a16fd374bfd 2 -/usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1_getting_started.html e80a0ce4b7e837fb8a3b49df69ba4bcacfa20a7c7d502451e8edde8b1c310b36 2 -/usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1_introduction.html 4557f79e8541218f25f0c0cc56b73561a73c3465af3335a2855d41a9808cd1a1 2 -/usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1_overview.html ec5ab88c62d064fd29313c0e81f86891b648c5f2e671751671ed622ed43607c0 2 -/usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1_spec.html 669fb39d4c7ab199c6b3961e26608dc02fd5cc43cd7574712973af5393f099f5 2 -/usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1ct.html f7390b2e5f374b40d43ae03b4422fa81bf61556f386a1f72c65311eea28efdb0 2 +/usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/404.html 0b47234ece8a59ed674b404f21a9c2796fa71d1010e6c81405bb111ad33c6e95 2 +/usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/api-reference.html e0f7c5321f7fabc4614c5641ef3c35d598c7e9567795891f069c8f3fc2548117 2 +/usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1.epub 26db88de351a51d1e189ab5cd84289a098dfa151f5b6a336a3f1353c4a1aaf77 2 +/usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1_getting_started.html 8d141664677a87ff374a48a46f1a70248294becb0d4e40d966fe1a6f3ee7ff1b 2 +/usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1_introduction.html 238fabccfc267dc922996ac43f2b598a68d26bea775cb09a88d1a071ea945dd9 2 +/usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1_overview.html 79aa948b0ec6cf3d30c41f192aea977de2438630d9713cab3864429b594c9585 2 +/usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1_spec.html 2a1999356e0bc2d1aeef750e138fbe6620bba522025c7a79319762166f095095 2 +/usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1ct.html 2bb8e24395632aaddf0a01d988c9ed08c0f50fadf48d316fe4869c7d46ba8cfa 2 @@ -2683,2 +2683,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/notes.html 8c36a799afb36ff20a251c088820c9c80ad7a3a59247ebf512e86e019f8c1c95 2 -/usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/search.html 95722a6f508f44c94e42260bd563dbb025fa031a768321d3ee80ccd73726d5f7 2 +/usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/notes.html 53f0c6006e3a8d30edba6239cf8cfb9cb55b6c5708edc0b35ed42d5914a95bb2 2 +/usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/search.html ebb3a2fc9ef5c2234cccdd76a582c3364510d2a82f829f971100eba92a21bff0 2 @@ -2688,2 +2688,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/404.html e8dba931a7a9e1e0215ff6a807a91534b1b912a976afb45fb70ce33d000d685d 2 -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/api-reference.html 3441a557a03ff056960a717e89c0672b630a56c863f471bae7bce4ed96ac43a4 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/404.html 977012a34640e1ae287d48fe525e9dc247b96dd8cf544cc0e1c403fe04082133 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/api-reference.html d135f7959d16a24fe452a6c82d216d3bae5b4bede29a4db54d5da972ac65df5c 2 @@ -2695,24 +2695,24 @@ -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/basics_chapter.html 129104545b79d2a05f31a4a111ab661ad2c6eafb58dd2aaef2e3c7b3e9d02677 2 -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub 974b54af1236c31954a935a84b9b6f0e9dd4310b6e26cdca860a05961333748a 2 -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test_app.html 86aa659b88e64d87a93c1bce5887654562af423b082d6aa723fed47055b051d4 2 -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/config_file_chapter.html 05ebaf21b34b332aa640330342affbc49358abcd72912bc197f12c68d8498200 2 -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/cover_chapter.html 58bffcb10cd9ed42f5026a3a02aed53fde3cf505cecdd547c9ef0d667c712389 2 -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct.html 6e78d7c67e2a2c67c00b107c943c36572a4b299c83fdb35e7a87b65cd92255c8 2 -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_cover.html 3f9b152e66865f855fb9f0795cacd25479839d7cb32eaeb1c28cdab2a0cf092a 2 -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_ftp.html a3e0b9888b9f3186edca4baff95e9cb7309d83d12bdfe3362c1531b235311f8e 2 -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_hooks.html c97e5c137bc2fc8497394b24a71c0a2750566c983c9d514515d7fb2d95ef55d1 2 -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_hooks_chapter.html f6261d9b692ca73d559fe4f7fcfe93800702441473586f9a44e2b16e68b5b326 2 -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_master.html 5c2b5edbada9599a8fc86120bbeac74c5ad13e5a20cdff9be45737c13fb1125e 2 -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_master_chapter.html 72a0a1b74c64e338e8bedfd270d05c557cf9fe00ab1fff3a02c7c1fe5673e373 2 -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_netconfc.html fd886a5d621ad3155473f4bdb589a46c65f04a4ed2f50c657da3ff1bc13a405c 2 -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_property_test.html d04ebcb922ae093bed14c498405886fdf877b22259403a17d2eed50008de290d 2 -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_property_test_chapter.html ebbafb3db0b5c3f1fd3d6ae812bf2022298625882ed4c0ef62cdfd11d33ce84a 2 -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_rpc.html 46d2ee2d57c1185d38e3e5f6554520bae9812a827a83a5e94f9a30c8221f7af5 2 -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_run_cmd.html 7d099cd5733d0b0c5188a2826b9f1225701ee59c365c5c17b9971b92654fc842 2 -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_slave.html 9e6eb4b4566c699a09bc2a904b5f35feeb5c1ea9826fa77f8dca33de2f1c7fe4 2 -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_snmp.html 9dbf552aa89a07347aff43ab3d51e1b6e55189e00302c494e29f9814b9a7f70e 2 -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_ssh.html e3759b8907e95d99189adddda151857303e1b5da5eabbec9cf12cd8b99136167 2 -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_suite.html 4066c0c6286e0b4cb073ee5e1da69632d47d4ef3e571ec4e68cc00edf1928534 2 -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_telnet.html 0f3cbfedd61044f5cd7c5e01a2eb0c79be013d742cee6a9cc075ddc0bba53001 2 -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_testspec.html 702a91b303e7294fa62734752c005dc2907a01ed7a174de24f46579889633efb 2 -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/dependencies_chapter.html fba7171429cfb514dfa3a56eb536807fb3bf4582aa56364135da1fb13eae1fca 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/basics_chapter.html 820ed63bdb0e8205b747f5885f583703209e9c0c02ee6161e03b5734e8e2fd52 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub 9b584cfa73f017171a51bc63b83738c4d681ef6d19dc7872f4b2a6f978533269 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test_app.html 07217c461fe42ba4a394de4b2a5dfa6e2a5358c36270115ab8937a2b032536ea 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/config_file_chapter.html 2b3f486e84cad83e890874f460515a813986b648d389db6b00e92aa58bacd19a 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/cover_chapter.html b07d9965bc1d35b903c9b698c74de19e5af600bc65f748d2279c6e87440563da 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct.html d6b1e256af5961bc084b4e0da5d55a93cd60b4e2a32d40273668127e19384be0 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_cover.html 9ec646a27a992355b5ab06efbad60a47fa2d4aebf052fde8112626d30c66f434 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_ftp.html 7c3b587c010ee305c1784fc9cfb942a0339f396cb8831d70228fbd8b37031ea6 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_hooks.html 78def9a3421a42d4e33ef305b4ec3ffca676a392938386375b8a72b251c604f0 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_hooks_chapter.html 978ed6f4d2d123a9f316a678a71f62d3688a1aa614170247b2767e25af2faf07 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_master.html bcd09f0f4e44c639c2e745e040ff58a89e30611875674f2e008d8bd5f3feeada 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_master_chapter.html 0601bf7bd44474775cc035bdec7247d8058bd7de69f9ee77d01fd61cb199859d 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_netconfc.html 1a65e78a231a25b75822c81b0da9dff29a2932750de334552994238f27e21e88 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_property_test.html 8c949e8b62284e27aa702bf9676df173eaa28991ad5b9fff063c23821216ffc9 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_property_test_chapter.html 23a7e4cbfaf2f9501577b95d5f26fe9996ab5e0b15266905380b5b4f75b694fd 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_rpc.html 26f88cf2cf6aaa6bbfe79261b1cfc758309c68af76c5985e8bc3d5e5f2a09c7f 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_run_cmd.html e82c58d13cb52f4b387f15def26dd34a752e47a0612ae0df38ff07c52a335ef8 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_slave.html d5b6552815e2bdde55894f3f8afa70a7b2ef0427cfa5afaa518b3d3bfe6bd82a 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_snmp.html 2026a47e7f28b0be07222630bd92c1d76443ee72c8a03119413c7aabdf061c04 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_ssh.html c743d14d39c750311893d3e5c310c4ee39936672f5818bdc79f6d35208275dfa 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_suite.html 754dc5b8f4c38a0fa1b1d1a1a9e0fe7d98067de7bcfe923c89071e7173150a38 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_telnet.html 372d03e127311b78a444876f1361773e952baf1b1b5bc716299f04f6b32e1a86 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_testspec.html ea681ed785ba7cc5e6c5cbf498f6d8fe12bd2fffb3f30cb8839eb0b7aa508c8d 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/dependencies_chapter.html 276a61c73f4eb74794a8bd2714f0c28bbb10ed089d80f8c2789da5cffd3208eb 2 @@ -2739,3 +2739,3 @@ -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/event_handler_chapter.html b09fc1dd1b5500b9d654f89e45351ca855a33434f8aa02d0e16dacbc9d668750 2 -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/example_chapter.html 8b0b43eb4662cda00bfc9d83fdf145782507f44794cc5c347e302de36ee34425 2 -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/getting_started_chapter.html a057d996a5e54f93fe1e9bf042f662fb214a21ab9fab860221bfa37ea4dde4e6 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/event_handler_chapter.html 736c7000ba817b2c1165d7ff2eeefc372c67a759a3417a8f42312ba93e0a1974 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/example_chapter.html 976c581e2c4fc9eea4102b6ab1be23ce2db325616bcaa51fa1f64d58a0dc585d 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/getting_started_chapter.html dbecc357fb691f844d5aa1f4b234b3d22e3a3b58ad3706e5819d1a0d2513d4b3 2 @@ -2743,9 +2743,9 @@ -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/install_chapter.html 16a33edde057b0d9ac2a79910c29f482243353b36b566ded365abc15825f11c2 2 -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/introduction.html b178745b53e0dea97d6010ba39a1cceadd62946e5089a10ed6a6ec32cb959c4f 2 -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/notes.html f66aabbd53cafd2dd7737e461ab51a79707f2fe8ad83f495393d5935bf4860ca 2 -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/run_test_chapter.html 6821ece76233e214d0db25e0e4a638b8d7d16010c3f2975b9f6e8c6f4719de4d 2 -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/search.html eafce606d56694c6a81f88c20b7e52e862f1e59734a6db41b99fa32fd9c67ff2 2 -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/test_structure_chapter.html b19026447eb46da6c6ba96c5eefd64f43c60908a9141eba164d70d1297d1cb61 2 -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/unix_telnet.html 23606ee80388726380f8384e372646754efced2259c26f3256f19759a6c8fd93 2 -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/why_test_chapter.html c6f524c0caaea322ca2d6264bf02dfa24432b7a39f464931e511789de332aee7 2 -/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/write_test_chapter.html 9407926197a04998c1d47687004391a1a3ce686db91e3da8706200c72f8f6934 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/install_chapter.html d34dffef14e06466e288c125cebcdae94674b6a5113a905c49091ec5bbceb22a 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/introduction.html 36ae8aed0a7f568de7944f524cf89dcff348a7e461332fa0fdff63912a09dda0 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/notes.html 17dc64bc28efd84c3f13b61ede9ae666b1b12c3f49894d20c51dcc1e4b03d092 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/run_test_chapter.html f64fe9f039ba15acdf0128ecab9a2c16fdc900f98d0edb8b2aae1d2540cbc5f0 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/search.html 589886b0184d37544e224550c3acad6e647b7d540d3fd818c48ceb1f4c8c636d 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/test_structure_chapter.html 6f9f47ab0375e01f96f6f0b156febb13b4b95fb5d0ac4a8e123869218d7546ff 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/unix_telnet.html 6f800ede87f39bc4457ee3a6474396ab8a62061eb4c6519ac3fc455c56ce6196 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/why_test_chapter.html 60d89fcfec675ed283d577738d4cd06d72b788c298a169122fc9fd3dbc93bc25 2 +/usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/write_test_chapter.html 3469a84611a6b2ba948c5836492abc482a5ab2f2a4ccef3b01e09c8664497394 2 @@ -2755,2 +2755,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/404.html ac0fc18117a898b7ac8acc11e0d8b9a30f10a3273f55e2271c983cc71311248c 2 -/usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/api-reference.html 65494970fcbfd2e9767aa2b3755a3acbbd80e8e83397cf09b30f7fa1c29c7a7e 2 +/usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/404.html 7845bbf086a851adf8618d8d30dce22b9f6b65f0d30bd9e50a0566dee4c7b92e 2 +/usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/api-reference.html cc0acb3fa5c86b3e1a398cd2d17af2e0cd0ddc1c08f927fe9e2d9e3d1a7be8c3 2 @@ -2759,6 +2759,6 @@ -/usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/beam_ssa.html e4b25fdc27261da57107650d3ac3607c01fcd98106ac0d167ce65c1f9c0d0031 2 -/usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/cerl.html d513d2604944be8031eaf98aeff35f0bb150b24b831f6fc9b8954c4a442e810c 2 -/usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/cerl_clauses.html 9e7b8f462f801a2dcab8e60c43e5cf8702b8466bae265e6842f6014e65366373 2 -/usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/cerl_trees.html 05078f8bde8fce09b66ac0cd4c9a2f665b5a6f7d13681e5520d67bdb9694e0d8 2 -/usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/compile.html ae5c3347a00383179de865d99a37808e9e943a70949d639a04b3fbae5d4d9778 2 -/usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/compiler.epub 53c92fb2a55b9352e8bced418d52ee82ff4475e107aa50256b2244c9b66c42df 2 +/usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/beam_ssa.html ebf6ac5ecddb2cac06b5a9025b5622edd65b54332d48dcab6223ce36bc926e43 2 +/usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/cerl.html cea8cbc96fbcf9d8f1343a1f437daba6e3e20ec64c79cf5e0f80a00c0f6d127a 2 +/usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/cerl_clauses.html 27b4280cd580792871745922ee15025d2d4f0cab8e31cf416a382f8f1aec259f 2 +/usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/cerl_trees.html 80997173d8952c405daba563d67be8bf2d1a0e1317531559956301315dc616f9 2 +/usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/compile.html d51836d7ee0a3c8b10a4ffbfa25a06740e45b30bf90ea4c2ac0f442ba7fa92a1 2 +/usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/compiler.epub 81e7e9dfdd97abd2b7e33c86f7f1a79071c60cd6d6bd5a840ffdccdfda035e6c 2 @@ -2786,3 +2786,3 @@ -/usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/notes.html 42b7529d2f65db1175c653e6045c4eb58dbfb56cadca6ae065c4ef6c553731e1 2 -/usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/search.html ff11c6b24154bfe5014a7d30620d6f2cc7d7e240b71385eaa52dce0093e36910 2 -/usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/ssa_checks.html 1e44b2d23b41fafaea4a3e71abe51f77f621d0dba10b9e25cd2cead815930b3e 2 +/usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/notes.html 2343d9790f888193c20f2268dbf1bd97e554ef87776a6d471441a323d072c318 2 +/usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/search.html 2fbbcdc087364de9738c591e279e91d46e992dc456cad8f8eb9db554893a7d56 2 +/usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/ssa_checks.html 8f07cc7bee653923f254460fb902ce8f3a8a7c652999364faf676501dd0a745f 2 @@ -2792,3 +2792,3 @@ -/usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/404.html c7b3810e6ddbb06bbd2af7b7a0bd9e7428a5817ebfed2b6d9d1e68c82eb4ceae 2 -/usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/algorithm_details.html 46e8f3c34e6bd3f4a4845de38daa8e109d8ae85506254846a23bc0f2bf7ca60f 2 -/usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/api-reference.html 5e334a4dd98c1f5de39dbd0d5e2d6b6ba41a735e8129b9c66a6a2da01156d540 2 +/usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/404.html 812eac2f4d8d987481533b542ee2ff751fab0efa0b650795de48acb1a3194e06 2 +/usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/algorithm_details.html 7793071cc70b95621fdc371ccb625940f9a86d09f651e3ba7f405f6caf160f79 2 +/usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/api-reference.html 950f71c71655e3bdf728b467e75f70e079d7bb7825d3f34bd29b86a88d717ace 2 @@ -2797,3 +2797,3 @@ -/usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/crypto.epub e2c1e998ad3c72c9bddd19378cc1d33d4cf269475256b22abc53c211c3ed71eb 2 -/usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/crypto.html b4660161c902de943fd211549014b84ed26e742930ec255061c3018f9386047c 2 -/usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/crypto_app.html 769b5720a1c6ab2e0fa0bd58eb4b5c691ab69ffd08eb3e099ccac795ce789682 2 +/usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/crypto.epub cef4586055f69174c41e3c20efdf5611427bc0fb77a2bc263455e3de1d319cb9 2 +/usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/crypto.html f59980e29bc34735dda1ef9585780a1b9ef30045750e1b6e2aa7968c9c42241e 2 +/usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/crypto_app.html 60552733ba564cf6411334d1051f2d38080a2b81e7a566c8a5b627ca9590ce76 2 @@ -2818 +2818 @@ -/usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/dist/search_data-B6F18E29.js 99cfc7e59a0c7f50f596ce70da16ea41e63d3e1112dbe8dd30dc9d51bf8d95ba 2 +/usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/dist/search_data-889ACB16.js 975ee8fbadf29189e23f7a0820f71d8949d7afe0e3b28582bf41bc6141231150 2 @@ -2820,3 +2820,3 @@ -/usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/engine_keys.html 858d45fa947b3b59ac6dd2e9917f8999e189cfaae113abdf922b6d70820c795b 2 -/usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/engine_load.html ace5305aa344026ea2901dcfead938bc5b0a8235764402b4d504ebe9ca2e5856 2 -/usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/fips.html 7504d6a082135bf2cd72f22a67270a0e0f4bc27bb093ea2f775fd15d74c3a299 2 +/usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/engine_keys.html f26c8ca7d98dace021a4ff5aac7a696b9a92fe859779eaf06e3e8f20950bb940 2 +/usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/engine_load.html 967207df50a3b90bad7e19ed452297b6f83845e3fb0a79966152cb65dc17a9e8 2 +/usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/fips.html 62e95c304b6282131730d894f0bc1a0cea34ba1229d7756513141e11d992444f 2 @@ -2824,4 +2824,4 @@ -/usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/licenses.html b0106190e06ca5a5e70f181cef0be786f57fa889400fefca6ff1fead0ffdad5c 2 -/usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/new_api.html febcdc45c1869f9bd4ec2d6b1db5f710e8c092782984a69ff5f8fabf924fb274 2 -/usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/notes.html 829a5e869df9b06e28fcd15dd0ddc86b2790c9ef1f16b5ab40a2df209d36b885 2 -/usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/search.html 4c973e44cdfdf3d3ac1a8f168d2292b2f27d9469161ed9548cf05576388ab7d6 2 +/usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/licenses.html 50a8bd8a78a28b918a4f3dbfa4b2cb3632f145226df09931329affbf5bd58ded 2 +/usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/new_api.html 7f39f7a2c908715c017ab587a4e4deb030e18ef4472d2fb5046254dec05485c0 2 +/usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/notes.html 56bed691861fb070180e17cede18670ea887a63751f4144d4d1df8160c836500 2 +/usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/search.html 8987fefe4da215829e40db78efb8cff60cef455f4824eb0ead4af69a64a3d880 2 @@ -2831,2 +2831,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/404.html a443d15c61d8df3a16fab4b906786880c6716a85a8ebab5fe12400b81d3a1bf4 2 -/usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/api-reference.html 97579aeb79560df224328cbb6873f6452050110e34e3ae30fcde07cd69281c4c 2 +/usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/404.html 436ff7d5a65d5b45c3e7e5ddee55d74c7943c96c7864e76263d4a14384db2d66 2 +/usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/api-reference.html f1e8ed3ae2a05e777b41a5b2c40ab59733ec8de44d509ae55774745c7dbc1e04 2 @@ -2842,3 +2842,3 @@ -/usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/debugger.epub 0d720a853f1745aa5fa6d6037bfa700b54af26f172856568a012be83f6d46901 2 -/usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/debugger.html 8aa7cbf8546d9a41555325eae0b59fbd2bd1b0a42acb2b0ce339dfe49c58037c 2 -/usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/debugger_chapter.html 751bbdc84614a51a693ed94291705598dc25e2f21ee732cf932a3e005975c2f3 2 +/usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/debugger.epub 40808384493575333d5c8b539f0292f257ec3e2708ee7fce1b716459bd291336 2 +/usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/debugger.html 5a119bf0350443f55b6c0793ef6b4e8c58d8f88dd5bb436f68d1a34c3587ac4e 2 +/usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/debugger_chapter.html 23719e6b42e9ae2bdc9ccc365a3ed44dd2cd43ca8151dae2237dcd720833df6b 2 @@ -2863 +2863 @@ -/usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/dist/search_data-1406756F.js 552e33e5039719802b8c4db1bd915aa3cd4e54d0d5b5f6249ccdc3c81e319f98 2 +/usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/dist/search_data-55C9925A.js 1b7365886753d6422fec9ada7c67f34b12d2f7fac19b1762160514697a1a6093 2 @@ -2865 +2865 @@ -/usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/i.html bd4f89f739783f0a56806b7ccd5dddab301473ed9273583f49a37920c2d4e139 2 +/usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/i.html 32489ff409694d202c419961ee38485ade9d4dc024705c49015def38fc843e4c 2 @@ -2867,4 +2867,4 @@ -/usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/int.html 700aa95e06772f3ecd6320ba2689d4aa04cd7868714a645abfcf19d98a032f47 2 -/usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/introduction.html 5a579d3ab76e1690e223925a954ec3020279e25e18790c5b24ee8b5da4ec2d9c 2 -/usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/notes.html 338321259a0a44704f0d76d34826c11c9de5efdd537b668a71ee50e33c5f4329 2 -/usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/search.html 6e3047c58d622ea945a790a14137f6375a157b048ba2ae6ec06b10a0d29c1b6a 2 +/usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/int.html e6f7683f25e78d20d1cd645c561b89ee591761ab568333cf16fcdae964d3f296 2 +/usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/introduction.html 8e202a55b5d3156fa8c4d7983dfe66b50c7415f56d2edef00d31cb7c4291ca8a 2 +/usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/notes.html 3805d4e9939add4e53364a0ae63283a8f6da456e5608f2d506a782aba0ecc924 2 +/usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/search.html 3bc169664731f6dec4227e6ca665a2cb01036b2fde30d8f95e117ca7a53a1d7a 2 @@ -2874,2 +2874,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/404.html 5dbc5c63a1e4e32b53408d15719d9c47d9e14a31a414d264b50acaab010e8bcd 2 -/usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/api-reference.html 52f56ab4672f1473544fa46340d89e7aba27c0725f021f80c2037199728ef845 2 +/usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/404.html d34ffd7c72d6660e493a437a67c3c46a155fd67c1859ea81c113791d517e7406 2 +/usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/api-reference.html 6fe654e45a0eefb0453c4b2943ba93c629b46b51a545ee888828502f7b820d45 2 @@ -2878,3 +2878,3 @@ -/usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/dialyzer.epub 155daa65c2debf9b38737cb2fafd7dab37dc27389d4dedd3edb28ab5a93bcf90 2 -/usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/dialyzer.html d7731636e6a6d2928ef08a17fce8c351964ac95cff0c4633bb6dda024087d62f 2 -/usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/dialyzer_chapter.html f8669d0b201980b5bce034b7f81b323d64374791a65e1c1c3816f9bd0a2bafca 2 +/usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/dialyzer.epub bde39c3a2239d736b9360b87ca912391f09c906cfc28675c6eeee335514d40d9 2 +/usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/dialyzer.html e81c207d1094044c71e9bdb6cc9c3c64361acfe534ebc7320145822edec30e02 2 +/usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/dialyzer_chapter.html 171a0760fb2f2a6f270288373b69c8c68277870afdf79ca5a1969c30913e0cb3 2 @@ -2902,3 +2902,3 @@ -/usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/notes.html 004a344c7bdfbe6a8b49b9396b660e3f2557cee10b38f1e9881c0b121b6fa6af 2 -/usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/search.html 68e8c9111cca8ae3066177530447bde3ac293c7d115ec90db05ebdae982479d1 2 -/usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/typer_cmd.html 5fd5a6c5d6b2a5b1781f1f0b0bd3b269c68b268b521c62c7a55dd77f663e1cd4 2 +/usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/notes.html d005c4324d5fea7c295ce3a5c84bd29f3149f99b775fa7bf9a7c7f85e0cb589b 2 +/usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/search.html dd23ac4c6107c3e3bae40a459a25637d9e0e584ffa55f6f744b9a7e6e62e5b36 2 +/usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/typer_cmd.html dd58e24c35bb2d0c4da09657f99b39eca183677911fc3cc96d2249396185fa7d 2 @@ -2908,2 +2908,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/404.html 07b22cd93117e20be78aa75d75e6185abfa6d0a1ae18e27d78f082244b0ec22d 2 -/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/api-reference.html b780b95b4381772f555f1e93eb4295cdd261cce429aa37e505e5d176d912b7f1 2 +/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/404.html 672ed759aee77a1b2db7e6f801f70514b99268891ae942c3c01ceef4d8b9394e 2 +/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/api-reference.html 4e6eb35b25c37c087f3f33fff16298095396ab17eebaa3f7b6273e7b8788b195 2 @@ -2912,15 +2912,15 @@ -/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter.epub 257774c56e8e2449a1462c1b561d65aa811770223af5826880c8fdfddf9d1fdf 2 -/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter.html d5bda9e9d43746fe6f7da097ae8245a3c14b4ed30b2fae7fdd40c3464f0bd683 2 -/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_app.html c58e8c1cf38b28db8121e1ba9ff2b0710ced029aaf3e9e17c4c5d36bfecc9595 2 -/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_codec.html 2eb6cb28553968ddfc0cfb5d2ffec501c9fc1e09f68ea1d683a27d4ca7f347f0 2 -/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_dict.html 1f4c4bcfe2655c73c0de85878921c346a8ed7877d90bc091685bd999473e6198 2 -/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_examples.html 1c02deb0dc7f84763a78d5b27665e3eaa0f6006ed31c115a8589ad7541c9b2b5 2 -/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_intro.html 82520a89e6b220fa1cae4aa6ade5eee1667d11c8d9073f68885fcd8bc4ed22a9 2 -/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_make.html 7cc1113407773926b55f9602f88e281cae95ec6ee2dff9e72c42e1359457da58 2 -/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_sctp.html cd4d2d7970ca7229d6039b574c38973da02e6528fb7e6f811adca87331c7bf8b 2 -/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_service.html 9af097f0170849fe9cb1c29b0d10ccc10241bc12b0f1db0213e181f8b011c20c 2 -/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_soc.html 0cf46731e2daf646221d55734c2eb127037c75298d5b7b00bd32513c2f9cec89 2 -/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_tcp.html a9d8d8e38f45e795ca0770fe175e99a6462e54de417bc3ab8794ba11a080a39e 2 -/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_transport.html 36d3e251603d92473fa0c5fbde3bcdda80a88ba8f162ec2c589d91fa6006fe12 2 -/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_using.html d0017793dd4f38d081d410ff6a8203e35da3d3e68e3173fcf80287084aaf8ae2 2 -/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameterc_cmd.html f899e41c8af4da26a09910f44b6ebf2491cc14028b1360ca8904856b81b7eb43 2 +/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter.epub 501bf256d727bb6d41456496a44594d7e0eb79a816dceb5d4a89a809c71e2ce8 2 +/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter.html 5fb7d63101e3004223a7644d869b67ee3a028644c2217f5ddcda8d18f8987ecd 2 +/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_app.html 1c2d203e823cca59e234749944e374c330b25f182ec17b64382465fe8aab79ef 2 +/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_codec.html 54f0d153561d63771f42f7c23c9ddf7576daeba71e1e83a81618cea84dffab15 2 +/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_dict.html 3bafe7b3a19b2722df381af14599d5d757e3b010695b71978592c428bba0fb7b 2 +/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_examples.html db996093cd9ae7dcc62515d6b80491bde64b08634e3c91a9d98cbb705b6d828b 2 +/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_intro.html 1bc84dc6132dc4c59d5b53643717bea174fbc12a7e69642b69b49437d9d5af78 2 +/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_make.html 5abc4272236872f48038c8729cce15c45f6dcfe1b04c9cdf62d4cc2fb8929f7e 2 +/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_sctp.html e3da7b8f8bcf87e5c8895b17652d852c91a6bed78e9ecee5e939e9c02f10d50f 2 +/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_service.html 2ec9ce26f85403408bb976797316cf7b10140a69037885c4a7cf3496fb3b281b 2 +/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_soc.html 958ca0e6a79e810d08ff93a4ead9fa88407a47280c36c4d07d20b532873740c5 2 +/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_tcp.html 2fbc3d4e2f807b66cfddf528b5c8b54cd3511089aecee206a7555d5b4eef6635 2 +/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_transport.html 9fe4a9108da434442934aff2abf3692b7b83a94611c241d84468485198a429ea 2 +/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_using.html 38a1b9357f092601e94a296cb459efc4bdae44e53fa97d240fc10c951423ea7a 2 +/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameterc_cmd.html 33a61dc4d92319b0e5d1e5811ace240b2cdeda07e260bdc0d47c6265d57eb699 2 @@ -2948,2 +2948,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/notes.html c6ba099b9a71555c8e65fb113bf4a4769b6ee1c578e7964c592b6a764ffc5ecd 2 -/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/search.html 58ae14891a421a62ac4b455b764952b681ac5e40c9104be0869ed7cad244b1c3 2 +/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/notes.html c5d569fa4e643ecc5714a59b72838c53494a61a417ee743aecab7c43340ad1bf 2 +/usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/search.html 10e57b73af22c131d4ca9c5e8184236cc862668d173dc9597860422e1397dfb3 2 @@ -2957,2 +2957,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/404.html 7e861ea6313ff9d2f9bb676caf3d5a6f6be6ba8c9d59b5a1a7505a8ff34e4d44 2 -/usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/api-reference.html dc8a5473974849c1b1b6cefc3b15d49fc92e26bb1177c2e10f5bac6ba807c028 2 +/usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/404.html 70b287dec48f11a9267bd0c6edc17e25815a9814d7bb0d82da954921b29f142b 2 +/usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/api-reference.html 4992c160ecf795d58c88f22d118697d3f1c947008a3322ab3d5e62128c85c1ac 2 @@ -2963 +2963 @@ -/usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/chapter.html c7530343387c88dbc9443ec88561345a26cb34dea1594642e6ce8ecbb18ce017 2 +/usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/chapter.html b334e4307ba649bb6ca8e66bd1d66721546688854acbc675b9fa564b0621d057 2 @@ -2984,12 +2984,12 @@ -/usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/doc_storage.html f8f1597997efaddd77859a987d2358013587ebadb28a89adcf72d79fccca09d8 2 -/usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc.html 4a8c70a289e6b481b59f25d1b46543401c97dcd7cd661b2002399df9fa3738fb 2 -/usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_cmd.html 7ed66441201c2f70f0e970c1184abd357907e5793e5bf638d76e9ec9af5d3218 2 -/usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_doclet.html c6c1a408a8d29e5c07833d71d053f1d270b619e95be520814cf72a0cb87d229e 2 -/usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_doclet_chunks.html 333b7d68b5cd5e45ef1bda471a528ece31bbcea74bec4df09243428d366aa6c0 2 -/usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_doclet_markdown.html 61300d3bb96be1d291158e795353543d5c1454bf3dc0a31d3411b7af9d8e7bc3 2 -/usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_extract.html dc0a65c53973cfb1aa2c691f3cba146df1f7a68c93e5d5e2cef5392fdaa42a0e 2 -/usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_html_to_markdown.html 4135159ca35f3eeeb785254624c6ec62af2d5b66851774223afab724bc596921 2 -/usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_layout.html 7afc8a9bb6400646f034f7bdcc1123f58ad4fa487f402ce83decec8416d335f7 2 -/usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_layout_chunks.html 930a23332aa140e239835a0825e60b5af3e24e2fc0bd03a78fd56e18b1c6af78 2 -/usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_lib.html 3a8350b755082e322873e4191f3e00ef8720f3b355c9b8794e9d05b350fe5f4c 2 -/usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_run.html d32abf6083559d9f8868b4e9dc497e4691ebad6c2559c9f91ab45613d99772ff 2 +/usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/doc_storage.html a97cad7e28257052bff0651565c037d48812a724519ffb3d13df9f247c0edd92 2 +/usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc.html a019fada635726b3d9de58a8667e5f77bf9075a2a0d1f1f865d18ec5f48448fd 2 +/usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_cmd.html 0c58f67a89b7245d2c07b6286b427b02ce57645b03958ab701c47dd96c21c9fb 2 +/usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_doclet.html 455a32b39ccfdbcea1647e426a1718d45ec1e1ac7f0c0975de2f5cb146cae43a 2 +/usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_doclet_chunks.html 2cdae86b705ec3c3e36c2ff8611cc2aa28da4a8a9c367fc3be8b5ad47f14e5d8 2 +/usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_doclet_markdown.html e46eec0e66fae123120b3af064165e1338a4b7c416dd160f168363f56134fa42 2 +/usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_extract.html cff1db0ee1232e6ee810c23a034a6547394515b95e2088b1d3d6e347aa509d8c 2 +/usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_html_to_markdown.html d0b276e3657b8cbbe86f8750ffd8385fee1f475abb34e516d05224ce4a3ac543 2 +/usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_layout.html 92eefdda18d4198ecddec7a51092dc587b260c4d4ede66f3e848a9e6aeb8823e 2 +/usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_layout_chunks.html d626b631b179f387ce2f69370455507260da57d922650315dd3c39d0c6dee05a 2 +/usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_lib.html 7b24c670c6006071f860f8c12c5f6717059b294548ec06184cde80582d29178e 2 +/usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_run.html d578c916af9d96d67b40b3f1940c2046c98f34cb09591219c582a10ded941e11 2 @@ -2997,2 +2997,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/notes.html 8caf1e317cc6407652bfe21f40c1bed8a779fb2553fca5bf1787e3e584a09163 2 -/usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/search.html 1cee261d46634d3c4f5a45cad9c0d1f0116f524f1ecc12ac09c2f04fae4edf40 2 +/usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/notes.html 3f88e4583fa71f78ebfe99de15ad6268b15d1a90860baaef7a52971a5958defb 2 +/usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/search.html fdc9797236051118858b8008fd9519f637ebc83fdcfe5f8242908526b96f65e4 2 @@ -3002,2 +3002,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/404.html 6845315327eb4443d48653a7a847c389a1f03d86c680d164efc5f45ba7f3880e 2 -/usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/api-reference.html c713b344041417613fe27d3a0cd0efb6982a5ff5d908948b1353db206c0d7bc5 2 +/usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/404.html b2e35c6796f7339e7b9fca6b69696bcc74197f3a4d7c2e1a0908c80ec979cebe 2 +/usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/api-reference.html ff3644465ad95e2fe53ab4a646bce0a219f63bc6e447fb72012100e19382450f 2 @@ -3024 +3024 @@ -/usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/dist/search_data-1A8AA22A.js d1896ce6cf639895ec351e7ee77535274fbd0cefacb342a0211c3fdaee3b0e5f 2 +/usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/dist/search_data-FC950B1D.js 58b9d5e899ecc7704feb43487988b8a3ffa160637018938597f6ff4febb71811 2 @@ -3026,2 +3026,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/eldap.epub cad3e83f7343604bc31e188437605cf5d7092592972c60b6a4cabb075f5ee30e 2 -/usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/eldap.html 7c01e80a51e05f4c48ed7132c5b8c22a8eeaef41f7eddbe6276c69c01151ed4c 2 +/usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/eldap.epub b61dfebcf7075701cf23cf1afcff4ba444782f8798fa6f590c84afeb20f5dbe4 2 +/usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/eldap.html c74d71c1767d9b83e9c4405821ddf2012da214062bb761d5c12ec4105195a83d 2 @@ -3029,2 +3029,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/notes.html b561375947d91cfdd5c96492f76012a687eb00af7e9cff991f0337ca6c0af968 2 -/usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/search.html df1d9707a83766d0f2a01320ebe6b2d97dea3f8ddfff54aea5ada171f64d2581 2 +/usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/notes.html c3c996c418834a57080232f12839e731102f5076e430edc1c97e18fea650ba05 2 +/usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/search.html 68e4c6bb821955c5902bd959eaba088591fbc13cc0613f07f45e816da7f40ce9 2 @@ -3034 +3034 @@ -/usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/404.html 971aada3e4fb06ed756b482f935f56f97c8ea5bb4d7667978bee02336125732c 2 +/usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/404.html 289d6ab33967c5c4d41d8037e9e5abca4ac93f83e0c0213e4577423ae52f0744 2 @@ -3057,6 +3057,6 @@ -/usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/ei.html 65343f1dca632d8b2f6f2edf35c636f1d65f8d30ae7ba1bbd9e9d15039d95bc4 2 -/usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/ei_connect.html 72a72e4d6fe38ac9149f03c9b26a541f66f16d1abf47e117b7c58a1810e66ffe 2 -/usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/ei_global.html a2a856f52a73d33eee1b236a48a6d258e64b7654bfb43a196a71e9a6603fdcb2 2 -/usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/ei_users_guide.html 8cc9c52e2584e0151f12c384d89b1a413328d6fe37a5fb8c12f6418423e7b8e7 2 -/usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/erl_call_cmd.html 32c5d74dea06d35e7e1a564ce1d393120b72be3d68358da8486b9a62d41651da 2 -/usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/erl_interface.epub a39fde7146558aedee675fd5cc04a16520a6c298b21ef171140afb19c55a85d7 2 +/usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/ei.html d1413a33fd0902763ce40e1b44c682fa71fe60fb74260adeee0895987ec16114 2 +/usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/ei_connect.html f0016aa910e3b4c4bb4f59043b862117407529c2c50eaccbc8ee5c565383346f 2 +/usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/ei_global.html 43c76e4c35061e0d1a3664485d2afacc03dfdfb540a98cad8b2582151f784f71 2 +/usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/ei_users_guide.html e0208db3cd2826894b790bdd330dc2a72abe453444e31c2e9050825c619f1cae 2 +/usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/erl_call_cmd.html d7c261139afa4a7817e295931bcf54c96145bb26d08f8dbb62f3e741f928266e 2 +/usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/erl_interface.epub 6580544cfe2c25bb1e8a8abd1f83b0e51476d87f9f2de9fb04cb1088b4cba8d5 2 @@ -3064,2 +3064,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/notes.html 14ad0b0b49d7e58a3f9ec2a273f5586d7a5719ab3eac9c0a37a0bccf2e62da54 2 -/usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/search.html 32f9bf0cfa6cd849d396a63fc6883d4b21becf665936ccd2e15c8ebcd60d6843 2 +/usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/notes.html 533b28ce58a33e930dbc3ed53dfc4abd4a407b25cd12466434371d1518314f7e 2 +/usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/search.html e802236a79122af78bd4ac6ce00f566a60c336666de28a9ac3b43368e7169074 2 @@ -3069,2 +3069,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/et-1.7.1/doc/html/404.html 7145a86428ebbe73e8ee42c598d5f69ea548f06749c38623b02a7ef8be2289be 2 -/usr/share/doc/packages/erlang27-doc/lib/et-1.7.1/doc/html/api-reference.html 0bb472edc419260c43a9b6b8e139fe9bc6a759b0c386fa06b5b03cbed8d1f4b1 2 +/usr/share/doc/packages/erlang27-doc/lib/et-1.7.1/doc/html/404.html 21494159644cb6e739bd1b14954eb3fcd437307844cc62de51bd862cd77680c8 2 +/usr/share/doc/packages/erlang27-doc/lib/et-1.7.1/doc/html/api-reference.html b467fd1e50fa106619b0206cb54c1cd16af5873681d399eb5754ef8ace64d61b 2 @@ -3104,9 +3104,9 @@ -/usr/share/doc/packages/erlang27-doc/lib/et-1.7.1/doc/html/et.epub 625cb30911f72861661269439aa0e8317d4e1a8b4515439de880f73caa2196cd 2 -/usr/share/doc/packages/erlang27-doc/lib/et-1.7.1/doc/html/et.html 4ed2d2adfde4245ec0d4ec15ee58adac6461859be5c3e353e6005b46ec320b17 2 -/usr/share/doc/packages/erlang27-doc/lib/et-1.7.1/doc/html/et_collector.html e896dab8af18269bfe91902ac2c669f550c67a7303de868f960074c7e3567d67 2 -/usr/share/doc/packages/erlang27-doc/lib/et-1.7.1/doc/html/et_desc.html 440765ddcb62db79afa3f2e8185740fed247d5beb3b46ee2e124a4a55518d52d 2 -/usr/share/doc/packages/erlang27-doc/lib/et-1.7.1/doc/html/et_examples.html f660c7761aab069b7d563edfeae8749bd2312143863a9a95695a19b21179fedc 2 -/usr/share/doc/packages/erlang27-doc/lib/et-1.7.1/doc/html/et_intro.html 6c55187ce3af1658f2cf4c307e7a13b686a756d4c040ec43130b89d1e29d152f 2 -/usr/share/doc/packages/erlang27-doc/lib/et-1.7.1/doc/html/et_selector.html f114900127049b63c4117a6e8eb334e48b28f5ec22b1772a7664b06e6cd92efb 2 -/usr/share/doc/packages/erlang27-doc/lib/et-1.7.1/doc/html/et_tutorial.html 5ff670a7f636775dac40cf560d6bd4a97b33bbec6e2d8948ca62210c4aa6c7f2 2 -/usr/share/doc/packages/erlang27-doc/lib/et-1.7.1/doc/html/et_viewer.html 34ba7c9e59ca55d5c2defa29fb4f679cf351f26fbecde14d1b74515362ea5571 2 +/usr/share/doc/packages/erlang27-doc/lib/et-1.7.1/doc/html/et.epub 3589a9c984344e62d00fd8f788b87953f6d3fe8c4ed45465519262063aaca54f 2 +/usr/share/doc/packages/erlang27-doc/lib/et-1.7.1/doc/html/et.html 08afce994aae338bef44ec52fb24d5750b24c12783be33602edee2c9b0a4830a 2 +/usr/share/doc/packages/erlang27-doc/lib/et-1.7.1/doc/html/et_collector.html db0b0a3544d93a83354d83281240521e8d386cb753063d2f47ba33134c2dbd2a 2 +/usr/share/doc/packages/erlang27-doc/lib/et-1.7.1/doc/html/et_desc.html 93b841e92274767d89978231af6f890e06771534cbcbc9a54a9360d9211ac61e 2 +/usr/share/doc/packages/erlang27-doc/lib/et-1.7.1/doc/html/et_examples.html b85237a73cf21a13de11311b3a21e78e92ab9c956bcb6efa8bd6d61724391d1b 2 +/usr/share/doc/packages/erlang27-doc/lib/et-1.7.1/doc/html/et_intro.html 563acc1c42a178b2e93037b29f4dae95bc295ec64b81b4ca3918b44a916ac741 2 +/usr/share/doc/packages/erlang27-doc/lib/et-1.7.1/doc/html/et_selector.html 87d6474a3aa336204b87cc612e5880d5fe7c327db6d438706b994fbb5faa11e8 2 +/usr/share/doc/packages/erlang27-doc/lib/et-1.7.1/doc/html/et_tutorial.html 7974aabcb39cfdca829464216d083b3ad7ef364d463e3534c859195e95074356 2 +/usr/share/doc/packages/erlang27-doc/lib/et-1.7.1/doc/html/et_viewer.html 5f7a59bb1bd621d121ff381a3c509c131ed4ffda8c861cc8866799b8f5e3ac6c 2 @@ -3114,2 +3114,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/et-1.7.1/doc/html/notes.html 1cf1d6f7afbb1f9547365d355ce6e9bab71d3ed242d454ec39a7246df6a3ba2c 2 -/usr/share/doc/packages/erlang27-doc/lib/et-1.7.1/doc/html/search.html e2715e82e6bd8479da9e051121ee7575b9f5aa9d5d51a09f22f62b9efa04f044 2 +/usr/share/doc/packages/erlang27-doc/lib/et-1.7.1/doc/html/notes.html 9ca09ceee649a4462ea64c0e96ec7dfea550b2950f2bdfb03febaa473503f083 2 +/usr/share/doc/packages/erlang27-doc/lib/et-1.7.1/doc/html/search.html 4dfd4933737670e0f6a5c8ee9d4fc95d9719912b572a38b1545f72b5724b87f2 2 @@ -3119,2 +3119,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/eunit-2.9.1/doc/html/404.html 7fbee599eb54ec5d718c4b46c5bbc49c0cb9d35068183ee72780d6f8f63c43ee 2 -/usr/share/doc/packages/erlang27-doc/lib/eunit-2.9.1/doc/html/api-reference.html 874c070d32b6f2efab23dbd50f0fcff6ef28bc23ded1f8f33eb9bc587fee819f 2 +/usr/share/doc/packages/erlang27-doc/lib/eunit-2.9.1/doc/html/404.html b663f3ff1f02f5cbfdc875b97aa07b160914c30e26999bd8fd795f0ccd340f33 2 +/usr/share/doc/packages/erlang27-doc/lib/eunit-2.9.1/doc/html/api-reference.html 8a876273ef3bea5d908eddb85cf8eee160ddf9864bcf7bb8d1b616943bcd1d6a 2 @@ -3123 +3123 @@ -/usr/share/doc/packages/erlang27-doc/lib/eunit-2.9.1/doc/html/chapter.html e67f2e60a9b049a60ed2808ad9621d0893054c8925d46ce754ecb0715eb558b1 2 +/usr/share/doc/packages/erlang27-doc/lib/eunit-2.9.1/doc/html/chapter.html 8b57a821d699661832d82958ea5117f5870af02dc57cdd19fc1abdb9b7fc3894 2 @@ -3142 +3142 @@ -/usr/share/doc/packages/erlang27-doc/lib/eunit-2.9.1/doc/html/dist/search_data-4CEF3D2D.js 60a7448d313b050230cc3b500ada62649b8143bafe3642dbd6f6ba9c073a2f32 2 +/usr/share/doc/packages/erlang27-doc/lib/eunit-2.9.1/doc/html/dist/search_data-C541596B.js 6d53994879e1422a8048e36fe9804291bda414edc89fb85e04ff58580756c08c 2 @@ -3144,3 +3144,3 @@ -/usr/share/doc/packages/erlang27-doc/lib/eunit-2.9.1/doc/html/eunit.epub 8e03f5f07c08771fdab0c73cb5e2c21ce8fa2152728663ffe68d3164a9b335c8 2 -/usr/share/doc/packages/erlang27-doc/lib/eunit-2.9.1/doc/html/eunit.html 45b77fb9af957558c1d5bdafc78d2663d7698894931c41eed443f387c8e1959d 2 -/usr/share/doc/packages/erlang27-doc/lib/eunit-2.9.1/doc/html/eunit_surefire.html e19e4605e1889bdb13712708db6bfba2913509a5c50254f4a87c0838fd1b3db9 2 +/usr/share/doc/packages/erlang27-doc/lib/eunit-2.9.1/doc/html/eunit.epub a949888e1ed209ad7b5eb201afe50c6af3bb25af8fe83a0b91ab2d0879ef90c9 2 +/usr/share/doc/packages/erlang27-doc/lib/eunit-2.9.1/doc/html/eunit.html 8fc350d0c0861eecacddbacdd72cae2c11d6b1ebc716deddbcd6b8c79d0d2d0f 2 +/usr/share/doc/packages/erlang27-doc/lib/eunit-2.9.1/doc/html/eunit_surefire.html ed62a219377f2ecc820db467c9fb19f5fb92279bca87827dca55e0050e69fb79 2 @@ -3148,2 +3148,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/eunit-2.9.1/doc/html/notes.html 4ce3c76594a60b3c50d45d42a3834fec51b02bc77df9cf8d498d18aea61906ce 2 -/usr/share/doc/packages/erlang27-doc/lib/eunit-2.9.1/doc/html/search.html 1540f7b8a848fc386e8013ca2f821c24724741497e23165e2cfb0930816f54c0 2 +/usr/share/doc/packages/erlang27-doc/lib/eunit-2.9.1/doc/html/notes.html 5ad8c83aa605837311ead8d28173f520d88e5cf04447b4fc5717089466007751 2 +/usr/share/doc/packages/erlang27-doc/lib/eunit-2.9.1/doc/html/search.html c9637f48eac30dda71255d2db8ac32a925583b6db58a0ed9f3c1b484e6ed9bc6 2 @@ -3153,2 +3153,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/ftp-1.2.3/doc/html/404.html 39986dc4969aa8ebdcd1f5d49ae3903c829b1d58bd42c83741e9c33dadf1c4c0 2 -/usr/share/doc/packages/erlang27-doc/lib/ftp-1.2.3/doc/html/api-reference.html 52be056fc6aa410a81ad70f167b3ec0211c34bcd438e6d06d3b260bdb9bf1820 2 +/usr/share/doc/packages/erlang27-doc/lib/ftp-1.2.3/doc/html/404.html de8c71f34c07a0590ed9f1bf1820c4bd5fb04e46b066dadcf5126862e8ef3dbb 2 +/usr/share/doc/packages/erlang27-doc/lib/ftp-1.2.3/doc/html/api-reference.html 6944ae5c01f04910d286fa2bd89b2d94f2b44b1ab44e9d7dc8c21d85b335911a 2 @@ -3175 +3175 @@ -/usr/share/doc/packages/erlang27-doc/lib/ftp-1.2.3/doc/html/dist/search_data-DCE6DC3D.js 3462854b02af79d5b4b80c26306f5f72ca461bce3be07c0748f5d24d4a8f037c 2 +/usr/share/doc/packages/erlang27-doc/lib/ftp-1.2.3/doc/html/dist/search_data-6DB131C5.js d110c5cac5418f29c629ee93ec2bfc6085ece6479412513cd3c9cefe22ef6d6f 2 @@ -3177,3 +3177,3 @@ -/usr/share/doc/packages/erlang27-doc/lib/ftp-1.2.3/doc/html/ftp.epub 794e2165c61e50bcf533071c7e3ecd4f46ecf7a2d4968a6bcda1c8a53c59f6fd 2 -/usr/share/doc/packages/erlang27-doc/lib/ftp-1.2.3/doc/html/ftp.html da31199552dda4a9302fc6de248f598f3cdef8a348add03e99cf5960dd0ad226 2 -/usr/share/doc/packages/erlang27-doc/lib/ftp-1.2.3/doc/html/ftp_client.html 1ac5aaa24967d7f5ac04b0cca71ef53e41e86ff144194ea6fbc26f521552c033 2 +/usr/share/doc/packages/erlang27-doc/lib/ftp-1.2.3/doc/html/ftp.epub ca24d6c44bc3309648cb84436db846f42a2bb508736941b9ca2e056395efb42c 2 +/usr/share/doc/packages/erlang27-doc/lib/ftp-1.2.3/doc/html/ftp.html 3d7801d4f97996583d961fc7ec4cfd745b8a560147846fa98c2592bf5aa7592b 2 +/usr/share/doc/packages/erlang27-doc/lib/ftp-1.2.3/doc/html/ftp_client.html da0b476be26038651b8be30ec37b84ae85eb959072721225112ee2283aeb3203 2 @@ -3181,3 +3181,3 @@ -/usr/share/doc/packages/erlang27-doc/lib/ftp-1.2.3/doc/html/introduction.html f334f11926787d98e16d5c06590f943e99bb75a451c65ec130f59a2061698b72 2 -/usr/share/doc/packages/erlang27-doc/lib/ftp-1.2.3/doc/html/notes.html e6cb1ce7ebf5e34a6e3d9e2796a2d6f187c3a48222da7ae50f206860b4f5a7e0 2 -/usr/share/doc/packages/erlang27-doc/lib/ftp-1.2.3/doc/html/search.html 688b1b689248f06b155b4af4196ad1918d9498c8edcda6251ca1cc5b4e10a621 2 +/usr/share/doc/packages/erlang27-doc/lib/ftp-1.2.3/doc/html/introduction.html d2baa0b85bc3159282f83298226fc6d920aef0d3599dd2734fdd146ed50c6026 2 +/usr/share/doc/packages/erlang27-doc/lib/ftp-1.2.3/doc/html/notes.html c1db13bfae78db3a92b997c03dad1b5507df1d55cb18d5fd45c71291444b140a 2 +/usr/share/doc/packages/erlang27-doc/lib/ftp-1.2.3/doc/html/search.html e41eb85a9135d683a07461550836268947c33b3f0cbb44f2e1c62e4e03d46f91 2 @@ -3187,2 +3187,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/404.html 6a929575600d1b5afdf24eedc0e5db92e12f6a69d29a0de16ef739d9dbd3b3d1 2 -/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/api-reference.html a5234bc78d22b22af8aa43aa31bab22ca77f29ec673df494283a449327788fe5 2 +/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/404.html c5f5de226f0d693a7d424d966b27544e2ef5867e6e385fb44177151fe6781543 2 +/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/api-reference.html 557dde458a9ce92cd49f97836bcb430650c3141605f9b5eb80d5ce43fe0942a8 2 @@ -3209 +3209 @@ -/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/dist/search_data-CCC5FE1B.js 7cfc6ccf4fe0122c57926345550e8f1e8f88fed39c3de5b7b0e7e6cd7f3595fb 2 +/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/dist/search_data-BA4EB9A1.js eeedf316f6a6cbde6a923256f2fcdf6f58e7fbda6266165ab618f1a475f22417 2 @@ -3211,8 +3211,8 @@ -/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/http_client.html 63e0785f6d9bfabbaf118e40704c3787208dfe9e40d68b06101173051567861b 2 -/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/http_server.html 567bc3fbb50a0aee4d718fbc6aeaa99d875e9d4f09e660a64c542ed4d3c058ef 2 -/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/http_uri.html d966f0525df48b3827ac487e8af8fae3f32f2f92f8b9fbd547ad63c33ba17be4 2 -/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/httpc.html 8277fd5ba512b8a300fa4ce0ce5edb458039d1f4d6810aa2d150fc2180f574f1 2 -/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/httpd.html 4566b3b8478d832d00497244c145cd601db6da8932f1e3fe30bec202a562ce8d 2 -/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/httpd_custom_api.html 461cbe37fd5af7bdc82d3bcb8085f6bdf4da312478e4431c3635f89dd71276fb 2 -/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/httpd_socket.html d688e95eb24470333c0ef89090e603a6d982887c8546bc5d0958d55d536a121b 2 -/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/httpd_util.html d658d19ca3919c3fbc49c5a754c0ea6d6f1f55f9b27387d7252d0622744b2349 2 +/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/http_client.html 00f4a330a2f68d9c6af47f4a324187da921f4c2f9f94ee34f0fa750f48951871 2 +/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/http_server.html b6561952df396689d5510b00ec7b3f3872341871eebdcacc86981c955e7e4240 2 +/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/http_uri.html efa9ce786b282fab7712186ee94467fa1e3dc93a4dda557958a5c04a3702ea34 2 +/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/httpc.html 98b6066df428f1856f325d35eabab93b059d43925503cfcfc3029b574cbc080c 2 +/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/httpd.html 441ecf00472a063cb46839af99c6f7f9e97b578a0e92d14cce9a4de914884d56 2 +/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/httpd_custom_api.html 5374c18b21652e2535f0bc4ebe0beb9918e88ebf26d42eefcdd7d2d19d66e854 2 +/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/httpd_socket.html c72325148d0f6260bd19f50256b7cc78bbdbe42b778e8b41fa30c814dd6f6b1e 2 +/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/httpd_util.html 06773c2899480b3b3bae0da5e5aef0377ffabef717942ed58e612c07b28ea45e 2 @@ -3220,10 +3220,10 @@ -/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/inets.epub 22fdfba3e8230dd25ecaad1387d054baa6d2e3aa1862bfb8570a2a353d1dc941 2 -/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/inets.html 3e335e543ed0babd9173df2c15b47e9f561c88250acbc01216bcc871a700416a 2 -/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/inets_services.html e98001ca90381530e28f00d4591b140d2b41d4c91025e8827e8bc47c2da68c17 2 -/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/introduction.html 85f66001229f007f0515547f1bfc225d8b3008809f8a307aaf44e5a7a4670c45 2 -/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/mod_alias.html acf5075bf3eb16213a77ef346aa5db8b3c6750d29f1ced8f8055f08c3faf177e 2 -/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/mod_auth.html b56febd03281e15b1a86fc66da5a2fdaaada08f1f9072d02ccd29f7a4ac1c8fd 2 -/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/mod_esi.html 7e869239800a806b856f4d88b96d38d71107a0cebd0b4922ebbd6b4280505c2d 2 -/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/mod_security.html dbe6c8498caf0aa1a3a8130d86385d6732bde2249c53b17013f50a882c3c2e6b 2 -/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/notes.html 4b172fb5998209f06c05540f5db8a81be3e04e6bd3256414bfb21e5ee8d590d6 2 -/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/search.html ff8f8b6a4845dc0f20aecb119b9bb553cb802b62e49fe90523fa6d5ab88907f6 2 +/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/inets.epub e4155e6c837be5dec3c32ba17effff0a44469dd11b75dceca2b3d89b2a224762 2 +/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/inets.html 8587a5eafbdd178eab6b09a61fe42745d1964de055575f7de3bce18022523048 2 +/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/inets_services.html 4ffd772387814f246a7072b1beb75477602a4f36da42d3c0d6daadf3ec328536 2 +/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/introduction.html cf33e57e0516e2b07ae4c0e6f375df7969b56de70354ee8b1d52d3ce442c33e4 2 +/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/mod_alias.html 27fbb66d603573a81289ef23b378ead249d7d94f9dca23e71bbdd4319571419a 2 +/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/mod_auth.html cc9f057b2ec6aa25b497dbf8cb5542dd8ec948061c35ae877a42be24a851e142 2 +/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/mod_esi.html bd47e4c4497f17488c296579138af54433506392dbcb387d42c488ad3cd0c014 2 +/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/mod_security.html 8ee7c4f72ce0d067c699fd5845d9e16c40190f77cfcee83661683043cfffb5b1 2 +/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/notes.html ca05af66b11572c43d0ad4596ce9c18fc4aa37df81e9d41ad7017aa6a76ce9e2 2 +/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/search.html 08aaa3dfe5445cbf45c2669d08c10a328907b8eebea35eb4dc607744918ea0a6 2 @@ -3233 +3233 @@ -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/404.html b0c2a78b5e26e0e3cd90fb94cfa1d3886c2be327ff833149a39a76e4e1283cfb 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/404.html 939f08cd80b7aec93d3d4258648b1904940631b65e78356b714792a2f5c6a5a2 2 @@ -3236,2 +3236,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/allclasses-index.html 1f45193f6ba599ce8f00d708b5913f0148b25dc95a238652a03cf58f37362c8d 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/allpackages-index.html 0aed95098d7d867c722ea0b1e7d52b4ca5dbda8dbe67fc7f647f6b45525955b3 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/allclasses-index.html 42470d853650a5d9983cd03bb4394d45756b424cce9bad21bfcc38080d95923b 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/allpackages-index.html c276e8887110a359e4990658d973ec502bd01d3cefd88b156ddb370bd5e4ffab 2 @@ -3242,61 +3242,61 @@ -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/AbstractConnection.html cceecf17217ebaaab8183fe38aad8a93ac2603acb3b750a2eac69c32e49d1a15 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/AbstractNode.html b200b1fb5132005556683d19e14876091caad074455b2a19f63d09752ac347f5 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/GenericQueue.html 4c06d5319e063d723c64da42a8b0f81278be0fe6d557646459599c7f4f668a18 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpAuthException.html 5a5b2d22e91f90f6a942ff9ee38464e9955a86753e56c65c02163c127905e1fc 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpConnection.html f5bb26b74e255546b9549ca4840a8fda5981562d517ba1640352849f6d7aa23b 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpCookedConnection.html b08282227a7b7cd6a46944db6eeb1201b13c01bf48e03f0f5f201cd1f330a755 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpEpmd.html 010ad39709b22de966152964083555353959ce76aae839ceab89b6a9f3e15e70 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangAtom.html 8f9efb641366529de5a460299149aa0078af314853dc0ef586f7d8959d174738 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangBinary.html 6ac6ed5dea3e1f3f68ea334b7f0e6c160b9dcc2249aa0debd882f431e9d5b5bf 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangBitstr.html fcc68fbdb11f6860511bab127d8fd9b159708575fd6b30ad2c6f43f5b070e964 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangBoolean.html 6abe4c89ac271e96b8b11df6390e41d8030da517e44f96c96228fe6c42d1d5bb 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangByte.html 54cba56ce7ae27599a912f08cc121f604c32d8d0f1cfa9335be805e601182080 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangChar.html 7abe4989c83e40168439b752681639b154fd0d459a00933f0fe82d904c41e9b1 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangDecodeException.html cdfff8a1885efb4658152fec702323932dfb6a0a61d2305e95e8b8442909534e 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangDouble.html d597e2d3049871152f4f6b8b01b8ee5a5d7cffcea32100b4b6feec88191b3db2 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangException.html dcbee5e0378ed95d4909dfce1b8aa3eeb37702d388cec08e4690154372134413 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangExit.html 692420efaa28309c38cc9dc34d69c642f71af8b3f5ad98f7f8e544c1fd191b3c 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangExternalFun.html 473bc7e1070e20c50f80164e36b34f91315d7c4fc242882b5421d98b0541f2b2 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangFloat.html fc0315b6610d8e48a29a68cee8e24de8d29be6951cf608a1c28514ebe84f65cd 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangFun.html f8712a36e414732f3f3759d0237962929ee90ad4889f32dc34032a67b977d632 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangInt.html 6be11ab1e9afca724e270f3e2871e256ec0c46f7a59bdef8d599451969f67f38 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangList.SubList.html 99737d1339d3741d373848aed3a60ce2455965ed481b04319902fe4f7b89a23e 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangList.html 36bb03f6e53ea0555c77c6e66621bf2bcb4adde769ca19ee1a6b50a54ee5c622 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangLong.html 2d990e5adb8ac61bedbae992af64d15ce21b8018731180ca1875e728b1bd8e22 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangMap.html b0f2950dbab99f464b4c7e1eaf2e43f03e89c8b56ec0701703fd79658257bcfe 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangObject.Hash.html 19c36c695e2401190487a87c203918eaa34b0b820dc3db839781716ae5f1afbf 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangObject.html 7ba7516bb7366fb1d11571880922bb4f5ceefbb59a209b89d7cdacc4edd4858a 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangPid.html 9f5900c5d3c120e6e75c0f6fbbf1439181b725f27d1fd0c0a34c4673371eb816 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangPort.html a30fd45cac89a010875953f87cbfaffe1cad8bc166cefe86f6defd1a547f5693 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangRangeException.html 7d4db971f52d3f0bac5499ffe8fdbccbe3634959d0737b5b0709bc629f6add39 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangRef.html 4ecb5b812929cab9be8891d4bf5201dac6ebce0f57da5621179f9bbb5e450dcc 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangShort.html 762c22f9d5f43df0e0f3f7f2b01a51dffc490d83476317bf15c6ac962c12c049 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangString.html bba8d010fa1f9be6780f8c347c0c2546c720629ad0d6bb1c91bb62afce59e7cb 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangTuple.html f28d3372c08547d03341a68494eb64c2f1c24ed4e28d4f34eb6c1b69e840d465 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangUInt.html b2d85f6d23b44d85e2bd47518396947e5545ee6d52d5980316720c92d760eb1c 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangUShort.html d82da2571a59027622fe2032b774856bbdf8e5e7a00883437c360b9ada36fd6a 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpException.html 43cec02ed9ff0ba691dbc3032e2cc11cca4fe2b6cba33646e0274dec15234693 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpExternal.html fd13ab2794e7969ea4d885694c4fb08883767c10eb5ce78f2239fe4fd6e9b389 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpGenericTransportFactory.html d4ff41328beb215453b0cba9c830f7d0fd10567418bb68fd67c0ed47529c879a 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpInputStream.html dd553627e3b1a53190518ab7dc3a9d39d08e4f07e6423ca14ff830eb0f71c032 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpLocalNode.html 879e6bfe485276df37253039680a1cc38445d8ede65a98e5ec1a00c34be588c8 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpMbox.html c740747ce6e35892b523a322ddd8c03958f9f5bb9867b8b9ed2b3aff87412424 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpMsg.html f4d348cae33de23727d25ab98754a1ae262abb14348e5b92ffa66ca5607c176c 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpNode.Acceptor.html 98d5c68f7a2c07c341f474715f28a48672dcda6b9c0c68906969797bbfabccc3 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpNode.Mailboxes.html e84a2eaa240821fc10b459a796bb4d9cfb72cf420e258a22596d6282a5424d76 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpNode.html 6847028f28ba62439110ce7302e0918e103f8c6c38753b2a6e631eecd27619fe 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpNodeStatus.html d23a8ab3ac04c3545dce0cb0c6987be8a111b2eec7aeb86744a9dff28c6552a6 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpOutputStream.html ea685d6be476e71e1e3be8d1d96a9e4adf8ab8e2d68b7c0a636990757c7d52c6 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpPeer.html d705eb6f6b4d0a924549a29d9297850613c51f15ccbc035aeb6164cab99c6e02 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpSelf.html fcc8f75216f8b4597ed5cea2f0180f0da44cffb2a12cfe4dc640198078a99cfd 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpServer.html c98797ad4cdde39c0b3925a7b39b207526f395606904d5deb95ba912a13792ea 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpServerSocketTransport.html ad6367cdf5bbb5ef07b4459b885c737bb637572985462b5f855f1a0e5e9e52bf 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpServerTransport.html 20e9a00bc822cbb6aee75f1235af8294708aea9d06d272b3a2b2cc7423c6cd01 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpSocketTransport.html 5bd2e78ef238f84ca2563a49d59da51fc136955b9039b30e65a2f7125ab1ae86 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpSocketTransportFactory.html e9713f40f713f9dea411c11aa7fd855ef11a7f77c8b4d18ad7b6ef3b56ef1e91 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpTransport.html 31a92503fc3441490ecb116f88cf744f75927b4c48c2e28b94de979a1b3c5d51 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpTransportFactory.html e4fa102c76dca15de61c3ca82e164b81bb2b152f591425254db74e95d67c847d 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/package-summary.html 3fa0cbd0fe6253b615da715ca7e49317b977f4b0714ea6c38e5475e0cb0618a5 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/package-tree.html 26ed27b1f9e2a8f50af9e7042ff62ba1789fc29bc69106b8d717e795b103e577 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/constant-values.html 26d5d01cc6f481b0b75da4ecbe35389797226c9a43de2f53ae00329f6f5f650b 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/deprecated-list.html 3aeed33a99da131e9c8c76f1cd2c82e49000865e6e308550cd0028286dee9da6 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/AbstractConnection.html 7e9d5df0a30656b3c788ce4911217b59730463d070445355b76120100f5de823 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/AbstractNode.html 1037f3fdb8db8685445cb7e561bb57894004caba01572597fea5aa5b211340b0 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/GenericQueue.html b7dc1ac6b85915291dc8048708781c13b4570b5ab65687e93f11570d00738791 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpAuthException.html 90419321a401237d6f2226bd7a94e9dff0fdbb8b8c742e8f2924ff1256260bf3 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpConnection.html 27565e57e8ca92e776cd20a95c6cf9456e48df2fe4fde6602688496dcc07e63f 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpCookedConnection.html 0d4f884e42b349980d9040192a333292f4150d1f9d2c0b80764c7758fb526302 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpEpmd.html 0154bb9a343f11ed325c642be11edd3f4fab10e73d9b26d7865e1469060507de 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangAtom.html 7044a39234b972494686eac615adc9cd8a185e2a624bfac1f19240a20e5b55bf 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangBinary.html 5fc0e5623e8dc187a11bc39664b3bae6a1d1a839fac157cca1680ba1a010f53e 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangBitstr.html d0d142adc4340bc1726fdc6af3408cf268a05b8ffedefc0916680e0629fb05c8 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangBoolean.html 021b37f25031e2758a147f0f97f40838a7d09770c18562ddf2f469c3e4ae8b94 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangByte.html 0d59c735c696e0f1f8483a45a18d88cc651d5119512e63d4d24385bc076e1b18 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangChar.html 75cf5ca6b3baad315b001783e9fc513c85f2832bfe57c0f9617b967f4b3a0d5a 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangDecodeException.html 690237592861f856ca935049b8fbdd99096fa8a22c0cf14d44d2a930642632bf 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangDouble.html 4f59a9f8906fe53ecf1eb1c755852d302e3420ce37400bed669e33c713094b71 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangException.html 5b9c98c1cd9421a046644d41b2d5530723b229751d80925fb0473a84cf351c2b 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangExit.html 6a939ffc70813e70fde339ac5fe18dec01553bf66b48052624fabcc977d3ad38 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangExternalFun.html 0a089878b89525e17965ef4f0a16d90268b66d6bef1b61b885a933c0b72eaaec 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangFloat.html 89811ad1e93453a2aca33cd42ca2c3d6dfc44a65586e2bc784a5b076e747be6a 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangFun.html 505d4c1a2a55ddbfcd402a567f7b73cb0128cb9b8f37e1e6b7d2bcdc6df2c3f4 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangInt.html 685ee3ecbdc42c2662c74965e3c273f0daddbab112c6cf20c9b5952dd1cc161b 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangList.SubList.html a4d54f4c01025590c151f4320d467add9d48e92da5f863545eb832a5ebcfd1dd 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangList.html 0cbe9503fcbc4e4f92c562ae575288d7e64ae2f61c4aa3a7cf98a2c4671c9bfa 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangLong.html 4c4c2f8ff61043297cc17c58fecb6c42a178fac069dd497d8fc0469fe44e78ed 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangMap.html 40910701df82d5e8d5f40d291d7c4c125ee51e38368b7b4e9f796c2a8963319a 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangObject.Hash.html 94810625820b156eb4bb0a377e574bc0abda8380ce90070052939094a80f0a0b 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangObject.html 5d003cd9249ba70255aa63943f8c5307b608d21112efee42950aaddfb6219086 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangPid.html 566136dfb7b8e48c34cfbdd9cf5635182ded681ca61ab2215b93d2d5a24eb005 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangPort.html 231cad889e477bb6df5a7d4f96943092f1a3322699fab33743fce2837acdae44 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangRangeException.html 1c0adeec98530abe0cc1c65fb7f9f8498f0acc1e56b466f757e71f1d03c8c20f 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangRef.html 939ef9b9f8a5d250c14ec7f9236d43052e2164e9ae8f44ecc72fe2845d5e7a87 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangShort.html f911345b44bcdfaf149adeda693cd087a95f246b1c601574c6a73f6fede001b8 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangString.html c02a20e52e97cb0acb291ff39707230966bc1341c2e64250954e3854a4e80629 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangTuple.html d252d5674f0f3ee9f395812152689953b9dfb43610814d1a90f5ab645a2eecd2 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangUInt.html 481059191b8d2daeb5590560a970aea7be04d743f1d84d075db8dc9da08f7413 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpErlangUShort.html e51b279780b4b93b232320046c2cd5228a12aef652ebf4facc38d2e6b6b065e4 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpException.html fe362e1ba8f8785aa643539fe8f0526bb292989b4df80cb479528ade02b93ec4 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpExternal.html a3b6678441ebb2eba224328d1cc34f66c0622ac5cd5b3d99f20dadc3f2f91bbe 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpGenericTransportFactory.html d759ce707006876f2f2b45339a46803c2f75e81e931a406d4dc8fc2fedc59481 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpInputStream.html 448bf1b254955beaff2e98a40f6dbd99da541ec84f5f8bbd0895730558b8aba5 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpLocalNode.html e5d1208428ada1c1d101ec8bf4eb556470e798753852f2e1464a1ee8faa41ba5 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpMbox.html 098346fc838543eab3c110ddccc0f53a83b0738a7cf10b5ebb5f5edcc5f8103e 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpMsg.html cd7897ab4ebf351b6629f239bd038083804c3bdbee479552e52a06f84528a129 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpNode.Acceptor.html 3b3ee8067c9679155910192451694be899b48600d5e6c241fe278842cd90dc38 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpNode.Mailboxes.html 473b75d9fa944891cbbd31a6f005886f7e0d132951e20abbbae4ae95c19d5e0c 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpNode.html 6af7eb1fbdc4a344fb01507f1fe6701bf48bcd3c19fe1da55573d982615032fd 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpNodeStatus.html b5885a78582faaa3e2aef55a9eaaf7ab86d98df1c0f7b250ef6ac9edbf94199d 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpOutputStream.html 02da55059bee84f47573076e7a3d52e3ab41b22920dc6b6c18b8143f917ad776 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpPeer.html b082fa97a2c698b9cfc1dc09f602e37b62524f0c4455f2c6969605dcbb887fde 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpSelf.html e251ec5d2ba9495694108a532b60d22fec4267a119e73dd7cdc02c23911852a6 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpServer.html 929ec2a8a3de2caa8ad9a19b151fbb25a7d016858680fdd444e1aa6504e56e6d 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpServerSocketTransport.html 8442bc0b0e66fbe32e6b319b3e1a7c0aebba7c0e66248cc4b85eda9e15794ba7 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpServerTransport.html b173b0359733a113041f57d63e93b9fad5eac68f6e0b5fd65db1ac6fec1d7331 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpSocketTransport.html dcd5df8a393f0d1f014bc139d1c1b513d3b673f94169458fa6deda8ba24b1dcd 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpSocketTransportFactory.html 40c3e9e6839ceb2eeb4321ee7d37ba41049e98cc7707632cac416e155a60c71f 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpTransport.html 8d2625ebeb3fd09cf22bffa702e7e6b571f21ae66cf54d218d2538b62659bd69 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/OtpTransportFactory.html f347513ffc3766c49d0ede8f0c75e1292e8e4d80e2869beeb0981eff17b0994b 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/package-summary.html 3681fafda83ab5fea3ebcd07376f67b66ff0d3f01c5d577f4dd8e421aa1410d5 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/com/ericsson/otp/erlang/package-tree.html 367c007cc7020bc905832ad1c82a1673bb686b02f69e68beb9c7a40c6c45f954 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/constant-values.html 1e82fa6c51a013fe27c98c1b3fab1869ea566440974651225e0a1c3853f437f0 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/deprecated-list.html 3f8631c5be7b9b6e521209cf0d46ce3ef892115a1d8f8644f689b87647f27658 2 @@ -3304,3 +3304,3 @@ -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/help-doc.html d641a00a391ea6cf6dec7429050a22b8dd4e48c5c47bf61ef561990c1066956d 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/index-all.html 7dc5350456bf58b953baff196aea06dae7cbb4346e1be3fcd6a6f027e5c45b0d 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/index.html 32f035646ab562359f97e053cba2aea8704a673450d60a3b37e40164ce5e9dad 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/help-doc.html a1f3af9c6a63e0e94490a0011f34156ec879b920be4fa8afd01e2ef84320fcdb 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/index-all.html 26c7a0f0c7afeb0c684907411ff28ce9504e7674c3916762629412dd673d4b50 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/index.html fff5377a0183aab7f9b537922a17c0c828b0630070553b86378da9d9c0ca32d0 2 @@ -3316 +3316 @@ -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/overview-tree.html 66181083a981e62d67b5c797d5592d15c66cf32258e433e3c1a414c1871410fc 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/overview-tree.html 6d4e16711f52dc8ad14ea89da7042797c0c6c0498a18aa6f413f1179dc797890 2 @@ -3359,2 +3359,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/search.html 25ea83b10b8bf9ccb8aee0726f2a0fad8da4387528da6e50ed078ed81438222f 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/serialized-form.html c34dff80208693c7e176fde4e0855c57ad50ac933348202c37ee0ae4adf83ea1 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/search.html 7628e0463aa494f822ae57bcbfc8d9273430f18ab9a94b12413e3db2b41eee20 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/assets/java/serialized-form.html d93760c3aed41eb870e2e56564b161b49e9094c28464d0219f7b954f375c6604 2 @@ -3385,3 +3385,3 @@ -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/jinterface_users_guide.html 8afba6b13c9261afab02ae3e19e6ab11cb50db01d83b429ccd2167c6bf058af7 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/notes.html 7ec33d8681d15f24abf909abdcda0c5adda1c7703701bd8a486433a8e0fd78f5 2 -/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/search.html 173a310b626e92d47a1531c235b783526ba13f54668370a8b51acb25fe013138 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/jinterface_users_guide.html 4c6cca952568482556ff5a0686e6cbc7387856436084b1c365ab626fc661633b 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/notes.html bcb21c0704d0faea262815d31e2a2ca18a0c5d7fb5561a519d10590fcc04853b 2 +/usr/share/doc/packages/erlang27-doc/lib/jinterface-1.14.1/doc/html/search.html c36bb6408f33229c93df17ee887cea6376674d9768db75aa917ec8cec4b267a3 2 @@ -3391,4 +3391,4 @@ -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/404.html f9dc2ae79f3bf0e4b0833518ac0a06abead9ee32af7e02a427cbc3086995fc88 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/api-reference.html 1df0d60fb050a84c8c7ea701d876f6585c9436aefd60a2f708b64d2bbdd872d4 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/app.html 2744604bd9565b1d44a3d2a8f09d57a8e2414bd69d4e80b585912d47b2a02800 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/application.html 13e2e2ddeb01af9600aa3df698837701d660597263720dc207d72f995a9fb6b0 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/404.html 6252b760ddbcec59eecad4a7544d4c276069b82aadcc2101e1b21617cfc627c9 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/api-reference.html ad309db7fe7d5e001d35e87446adbe1d5b4442b7d327cf8a5824fa51d0a64ea3 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/app.html 40b830e879f6808d24f4563eaa44812ad54d9487ea3af66ebea7d1a1241349b4 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/application.html 727dd92bfd3d17879ab705f33a2723218f0130224f5af23ee6ffe167b4dbf293 2 @@ -3397,4 +3397,4 @@ -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/auth.html b5536e981210295665c36f15e65153add101d292e996f86631ed59c9d185eef6 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/code.html d2a82c53a24d7233e50c541e95a9ca57c2f8d83b01ff565287c8509fb738ca67 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/config.html 38cf59b9a65789923dc362c9787dfda2367e255bdd47052a9c9236cb23d2dffb 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/disk_log.html fff74343a2faa03f40e13161bb36f922b9f05bcc0905c97c9adf222832e61f44 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/auth.html 6467d97a18d70f5d0595bd914e0bca9deab36c66ad5995fbb1c5081d49f283f2 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/code.html e1bacdfe4d5f9daf642556e92208a04e4fd1159b8b3f50081aa5fee256960a2d 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/config.html 74264d2bfad841ada3b22e46d1e4c797b02b9b4e63ee8fc075c2b27f6d274506 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/disk_log.html c798f4e754ba87d1bf53c95754e27ce57f9705d250368779848fc18080b2be9f 2 @@ -3421,14 +3421,14 @@ -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/eep48_chapter.html ef216ecb6caf187d4be7322c55560e9df12976953645102dbddd4a533254f556 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/erl_boot_server.html 4b88632946214707fcb231c55a0bf0e9477e00e9090f3ec196e27ac0dff7d764 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/erl_ddll.html 1c7aae3fb36a222fd00340c58e26e32e53a3bd114e116382add347745ee2f051 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/erl_epmd.html a814b793e746e5a9c40c4ea842c046d622a8b17723d6221c25a734ab48b134ee 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/erpc.html 639e2588110fd3e3110416e0e1b403fa52887cf769243f5ca058a26910fd543d 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/error_handler.html a45a06bcde59648c4243f0e0577c4ebace75b3337efc38fe48c5bf40f1081645 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/error_logger.html 873e795098b8f348b6cab2c5b8a8e6bdf8f2f7c37f9a0a47f5bd8a33d67450f2 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/file.html c3319f18a07ff1d45eebbfd444cdc68c8340c850844bbf4f20d3d6b1fa25f23e 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/gen_sctp.html da2f972f26290e1968743d1165b048e8e9db6291c972c6fc585fe235cbf9733b 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/gen_tcp.html 8f0540106fdfb6e1bcfec0f8f58aa86170e187a0b153a0af71a99579ffefbd2f 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/gen_udp.html ee5f97a5b6cdc3a57c1ff295edbc6215db02e6d326308b64ec62b50a6ce174ec 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/global.html 83482a5ead1785acae4d55367ae715fae4f43243c0f7fd46e02d5a29497696c3 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/global_group.html 6e5981a2e1b633f94b0c9b8ab2e32e109d2a69631e449c8e5dc249a6bcb79586 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/heart.html 11bc5e51fff37ca3598b286401086a389ebece27252d101c099890a9f0cabc5a 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/eep48_chapter.html 2c8b95cf80db41316299fabc095774c273c0a48de4e885d3fc94da40b258d147 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/erl_boot_server.html 8dce477551dc188afbd9e421a6f6ecaff63c98beba330189c077729ee363b3b2 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/erl_ddll.html 789b53763852a619c6f7b23632ea16109e35080cf526ec44b5ed10b449eecdd4 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/erl_epmd.html 0c92df7b0718eeb3538623796bb13b2941089d96887063b969bd716f5e55b3e2 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/erpc.html fe488d50b777856717eed64b26e5dcf79e218bb99c0b0fa8a2a4687986593ff1 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/error_handler.html c105826f452c579cf21cd73b85f622265d59481fb02ed508292dcb33a2859602 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/error_logger.html 8c7aba86071e812acf27c1740ed68437ad45afa47d7211dfaeadb3b19f9c363b 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/file.html 61dedc021dc38f889104cb08c23f9a4995b6334106ba8d43d04d2d66d8e872f7 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/gen_sctp.html 1dfcd8e0d3939a6ab9cd5a1b2654187b6938313c5581c868c473ab34caa04df7 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/gen_tcp.html da81f7db0ae6dd37db410416195ab001438043f3886a5b915b653d8c9b53eefe 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/gen_udp.html 0c2b4f80e45f2b7ff1439039ae5388d3d9e8158590eea3a4dc2798da437cfac3 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/global.html 48779f68502a70de4db8ec110b022a77995e0e6394bb328372c87ac1706d59d9 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/global_group.html 6a5e5b80e1e251a16d369d2d51cd2f5569db823372da4078fb0490b310cb4d21 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/heart.html 991bb4fd6d545375430e61e6c3de4c2ad3e4c235e5ed3b5df74926b77cace9e8 2 @@ -3436,26 +3436,26 @@ -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/inet.html 99563b0cd7c16fb04177f073043cb12cfeb8699495163238dd9d0739e13087d1 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/inet_res.html 4e7dba0908462744abe700b42eac4ae03c2130a81141d44fee48f3f13258cb69 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/introduction_chapter.html c4d68e018903b1d3b0efecfe135b8a103a31e366da8b6167e5afb70998a6e64b 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub 56c3ea41fbcb3287ccf94bcede5bf283a23794a452f9053aef8a1750206dbfd6 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel_app.html 61c1e65dd49848bd9dae695b1cdb8e2878dd2e45c6a4437d4b51ca12dcc10c12 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger.html ebe5b56d773f9aebe2b65b90e5b5552a7d006442c4b9330216727d03aa2980c0 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger_chapter.html c279e86098904479aeb61b0f60a29d733667eada2abe87fdc2cb25dbd63af375 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger_cookbook.html 07242f161c2eb39e7987e9cdf1bb7e6e21d7ab553fa068be5e9122b3a58a3a07 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger_disk_log_h.html d8c27e8ca07a31d068c0b90174962d78386b2855414097bf218bd20f151a4126 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger_filters.html 89c18a73ea3654dab1a794c36dbcc15ed07db5af2110424453520c26b9372493 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger_formatter.html 1459994a9e7f9fef9b4824a2d435963c69dd5518c550186350f05b155f7e7833 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger_handler.html 63d05ff05a4e778369ff8d70b9b207129bdcc79de08dda6d7227033a82335f4f 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger_std_h.html 624aaa48bc351787b22ca4da3cd643784297e64924eca6f2a49637da0ff40ceb 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/net.html e250cd327f2dd9494d897b04c229e9814c3969c83206e4b90be311b9cd28a5d3 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/net_adm.html 0237c196cd2bade6bb0ff5b4e2bd602c1f8dc7f7f996108c76008de9dcd6ac0b 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/net_kernel.html 84c55bf71c7689e4a52a04ed143c6512d7b96a543c2979ebb9c440e0f0575866 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/notes.html 255cf04d95d01279db56b5590b43a7b6274fb20f59918ad1d3bf324b012e01ac 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/os.html 6333839d607f1560fb1fddc92421287ad7d73c78899109f1f2397b2dcbae2a50 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/pg.html d263a5d82ab489a91963e5b367dcfb7ed1adbed34811474cfc03a0c6a93e7d17 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/rpc.html 9ccf12df4b2511488fd6234024b745507211a96ebc3eb1b2a04c3ba7c28652a4 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/search.html 9e49642c347c1b86fc3fd31f616ab73436a032e713ca097d0bdc99a20df6b9c1 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/seq_trace.html 43c7391a7b07466f2a566cea0be55281200c32b75174592714a32fd2b19027fe 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/socket.html 8d57c06b6c59867a4ed460d195d345c166051d5c8543e233e876760f04457ca8 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/socket_usage.html eb58abd3e1062ed3404a002fb7e04ca766f7aeea59a0a97d5c9aef5a0746da68 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/trace.html d309986eff748719022700a4fe0c489d69dc6d12ecbd317fd080ff6ff9d304ab 2 -/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/wrap_log_reader.html 7b4a1cbe255e6ad40de2ab313c51625951ec33b9dd6ad631f7e3b3b5c8e23192 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/inet.html 9cfcdc41dbafb22fc30248212ef8a14ff84a8cd3305820f11cc2bedbcb2a23a6 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/inet_res.html 79177fd07bd170f7d81f44ee8c8a60d893a1e490c06c207e79082434f4ec6ae1 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/introduction_chapter.html 7c5aae9e1f8c6dd890c5a4296c315dee77f9f4be265c9c0ae63e7e87c29a1736 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub 1c770a30e9a14890e92405ded1097964df5492d97705d4c18abe3f02b0404947 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel_app.html 8a4710250a156787bb0786bb5b763a10a6e0c7a66158dd194afc74a23f232304 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger.html 9c047ae872465dea321906b7574b406a33843900ec376e48a1a2b1518c7ae602 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger_chapter.html 1270130748e9029092c13fe87ce40a494f638ce1e4b1e54361a89917e05cb7f6 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger_cookbook.html 8de6d5d4ed35fd4f523accfae8be31a8d6963bb69a676ee2adbf4b58eb256c16 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger_disk_log_h.html 5ed33bc23fe9bea861acf1d787c72748399011c0695daaea47654c14fc47b582 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger_filters.html 4ce3e122e8f334dd732c841af06b9147488fdc84e1dfc145f7a5fa34830c2c4d 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger_formatter.html f39c7ae09fde3c1ccb7c7d8fe0deff292dd7b4e2a239d8442f863815fe5acf4e 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger_handler.html 2e6b334d2b94bd90f282e0e1140aa08e02697b24fae71cf8c88ead1d21898631 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger_std_h.html b0aa4bcd896e5c8bf3f4c3ff9d5fb59c8f00e58adf1b542559e40e2d90f1fbb2 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/net.html 715c8e63ac5f8a67ed5c72804e47dbecde15d8f923b3a5b01a4c428111029aba 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/net_adm.html 87f46cf69d3fb5b3e9cf492f566fd43e4dd0de429c58ec7a275ae0ced8aca193 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/net_kernel.html be7028afbf3cce5a93994509d8993c06502fbbdb61c789fa08a22739b65087be 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/notes.html 3ea4b768c9443e6ecb455835e6023ef26019615ed7a9b9c19064a22b3d4130cd 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/os.html 2ebe8b283ede3d78aaf8cfdb57f34678e43cac8cd07b2947e99b6340a7defc1a 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/pg.html 95329b38e9b3e8501c76b44eba8d4bcbfbbb02642361242c6ff46a4d2428d764 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/rpc.html bdfcca0a6bbd6ed82505bcbdfcd0309b4edc3ab6f2d5d79f841c3c56a2751b2c 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/search.html c899f1df71fbcf545853a149a24a266fcf9a3cd146ab24f0d07ddd8061954b73 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/seq_trace.html a9e035dd33e3fe29f571319a948839abe84e0ed6a5a4dfaf0126af9baa566a6d 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/socket.html af6ba52fade12880db2e7e6c258cde322df065e6b0dd9bc17754fa6cdd888176 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/socket_usage.html d0769cc6ed1fdebd5508b776c7ef10b994b1cd1383c5b1594e7ee34b9b430920 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/trace.html 5a78b57b2dd761713dd18c55b489b8600a6b8d04816af70e1421313bd2d48968 2 +/usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/wrap_log_reader.html 39d948397e00cc23e5bdc0896b68f91b64c840874c37223c1d523c703e88cf7f 2 @@ -3465,2 +3465,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/404.html f6ca03a504f9c88cab2a6f6246b58eef0c60165e69861904784f8b1911482321 2 -/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/api-reference.html b1a9afce3974ded6b1494992326f38ca508a5b99b23fedabd4980185173c01a0 2 +/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/404.html e02f8d4f26c73286760fb75b4003095f5fb91197dcdfd893e55581cff6619ff3 2 +/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/api-reference.html 3b3e984b5540c366015b8b8e3d5fcc5439d2e586822c017750770972e17bc7f1 2 @@ -3495 +3495 @@ -/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/dist/search_data-492AF504.js 8ce64bb8b7cb3f58758d49f28e0adfb9d5c80fd2b47cbc56adc3719668db5211 2 +/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/dist/search_data-2DB78EC4.js 7b15b2a8221134c47d5da6aaf4a6e94ed97259821686beb526406e9035f26274 2 @@ -3498,26 +3498,26 @@ -/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco.epub 66d1c1202de9a7275ce4f2b11458ae7143c3dc4c4277d783ad38e0b873ac6ba3 2 -/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco.html 87f348a32549f9c1a317833588c2dd6638fc46749b362b7355c0d6571a8feedb 2 -/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_architecture.html ccc3fbdbe5bfa2ffae92cd6a1a24101caa22e7e0c2467343deaf6ffaa31a0af7 2 -/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_codec_meas.html 3c25ed863f38ba9e93f0655a4094509382c690cc88d0a99e49f6e8c2e14ae69c 2 -/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_codec_mstone1.html b0326266a45c8c2d4a1fce093a5c6579a7bd8102039efabbca831f96753d63cd 2 -/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_codec_mstone2.html 615f286a93a402717898274268387c0bb71da4d92fb43bf5e2e5bd1925688458 2 -/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_codec_transform.html f6391c0d0f08c5f615aa4e5154ed878baf178f57e64de01e085d9cd356301094 2 -/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_debug.html ed401dad34af2a49b9ab2e4c243f84c8f89add5af996cc565dd305a0c9c4d8bd 2 -/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_digit_map.html 9a3eb56fbd95db3aa00a68281dfe18967737b150635e9328d361f42760be50ea 2 -/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_edist_compress.html fa95061d2464a440d5c9001b7da3324d9724b21e538b35e3aa88b6dff8c7a733 2 -/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_encode.html 029ee3dbf6fb374a88481a59eb8685423ba02f8790cbbc45550f8f1302489b7c 2 -/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_encoder.html e32f42aa96dcbcdc33a2b0de68ec788df45160f834c93a714ce17f58378d40c1 2 -/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_examples.html 68ef9693b656baad02d9037a85880a6e4f0d7fba24194051ef84ba9e848c3c35 2 -/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_flex_scanner.html 62964b829ba895ba31bf7f5adf165f622eb359271bd62ec69f0221b9f8d1d4cc 2 -/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_intro.html 4d34ba5386ff512043a5c32758490abd997fd587b5da35f5e6edcd9b9c6aca5a 2 -/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_mib.html af5eca7c71c0168b2f696f91f049484b6588106e00688d0244ebd5b8be20ed67 2 -/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_performance.html f0e18a990f32f4a24091c3bc4e080fbff4e64537fe9567b619b4c97f2b4ba2ff 2 -/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_run.html e97f93b28db9c53e4e57e507e156db332a4d1e27c3455fc57b4cf6de0f827b65 2 -/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_sdp.html 1986227f67818fb215b1981ca82f8c11d9df668c0c9565d9a51ac89a66171751 2 -/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_tcp.html 16f54daa84c05592abb251a058fe9ed31f03695a9b8654722d7fad4d318c24b3 2 -/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_transport.html 0d182dfcee4022c35b179fbfb5e482de46fb1910bac3f9d6b1ccd3d863e5765f 2 -/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_transport_mechanisms.html d82474632944c82fb8375aa3661e0f40acb8da129cb0cb87d04b19cbc78f487f 2 -/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_udp.html bed639c4abb3d885d0d7ea28a067c6f92734ab4646e53baf013233c929041c56 2 -/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_user.html fc5cd4635d6c6430eb3125177ad9870d5157603fc219214c9dfa4dcccce22e06 2 -/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/notes.html e5b3fc77d67fc4b44154cdd3e044f646ada94d211569f0cf1e4d2bf42978685e 2 -/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/search.html cfa16c2b1abf82dc001db3927bef90a550877a611d7ccceb718f98ac8c63bec5 2 +/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco.epub 6e5a517949479984a2cd590e175a55d9963b3ddfe0361cba825ee7466f1c68fe 2 +/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco.html 0361f8ca564f22a0786d731ac16019e55ba1c0f2a790441f1f74111eb2b1e3d9 2 +/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_architecture.html 8b9f724aa8913c8bf21b5c88077134ee3bb8fd6f89c224ea401363f047068475 2 +/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_codec_meas.html 6a92ba4151a44f0c5dde9bd7a9dc3792afcd64936bb0783895f7de4e88f2c94c 2 +/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_codec_mstone1.html 97b1953a0014fee7ac59d56c1d0fac308940b4c03b0748016d715de61000945a 2 +/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_codec_mstone2.html c3e0b7c26df73ebb79bd79287bab33e54b113b5da335c14ed5ba0a93f63a5bf1 2 +/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_codec_transform.html d41ca59faf9d5bd66322125cc91e8d981b5e60c4530912db5cd5c59ec28faaa6 2 +/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_debug.html 4a2cf021553de508e6003950f825ddb331bca51712be96f5dcdbfd183447822d 2 +/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_digit_map.html a8c0243d55087f841ae56be69be63587492bbb00e50d6539923419f49260c442 2 +/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_edist_compress.html 3acd90acdcdab6fa29bf60be8e18bf1359154b6eea1c271195e3089a25e90bc7 2 +/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_encode.html 217243fb2c0689912c83eab14bf54b48c88eda42633fb8772bd8a27315e97b1c 2 +/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_encoder.html eb7518146379655634dde511bdd5f6b9d496cbc1a52c56fae61e9b2ffe32cacf 2 +/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_examples.html ffbea2af9ec8790b53522ea5de1fff4908aba842768a871a5197ce5a837148a2 2 +/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_flex_scanner.html 774b74f80112b26adbdf72848f3d7cf2dde04365ed1c02b37d79b6e5ef23cd2e 2 +/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_intro.html 372532bf38f882d6f54666cf0b8ff0be03a7530caf096d27f5fa44a3bd5c9c9e 2 +/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_mib.html a107d9c8d76c2d142e9fa5a1aec046dd840442b1fda8c7c48688a75750150b96 2 +/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_performance.html 9b146b4a7c5e10b5727b3d2ca77ba22a9dfeaaba0ae2d6a0d8ae3cd822aaac25 2 +/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_run.html 6abbcf4bb0cee3345cca3471d111862fb81ac49d3e726f74e3e2961670c56111 2 +/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_sdp.html cc0cd558dbf730cea08a9b319f11a0e0c010572ecd03758180f65666e2bd97e6 2 +/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_tcp.html 40241c0217830245e13509083bf4acafd1fd819b2b2ffa1e5426a50330237a55 2 +/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_transport.html fb471c2e4ce2a69b0d174c52c29c0f5638fa382a2692a3cbf8dff2684d3c74a7 2 +/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_transport_mechanisms.html 11ea81c6dac23dbb203b0eb8b6dbc383f26b469f11b774199cd249ef7bb9be08 2 +/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_udp.html 30d9029dbf8080b31d1e4f8a75737769ab939913583aae39b8342c53dc84d979 2 +/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_user.html 556e0aabc4468a72ce19a4263ba8544b6b75982a966d9b845343a725608ee24c 2 +/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/notes.html b881e4a82f3df7ad4bf81fa48db7d95b671214d7dcaf4c746816f8273f91066b 2 +/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/search.html 4843831797edcbc47bfd01ccf8255e3a483bd04f6067b2604aba56196aa8df4e 2 @@ -3527,2 +3527,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/404.html dee5e8f9cf897ce1b8aacd2c3411c5c18b1d38cda32059c33a09237baa7a1a6e 2 -/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/api-reference.html 97e008ef3fd774844e7030963f63676a0a07ba780783751e63cf56fdc11a5281 2 +/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/404.html 246a13386b886f097e0c3a6a1ce2fc4d9256310a6f7226f2ee94c8425b902796 2 +/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/api-reference.html 12445a1762c4ab9c133921333b412746694c565298ff2acee29e1d9bb3525ab1 2 @@ -3552,17 +3552,17 @@ -/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.epub 057008b7c52c4789bc4271b6a0169051876776f0cacd9d43ac38d2a450a586a8 2 -/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.html 66692889dc96aff16771654e4d608431d7e774cab8c20db3fc8b286db7e484da 2 -/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_app_a.html 5ba58b0e01dd5e8408f2156821fb7a7bf40ff0b50d402f6293b57d492a0d3f50 2 -/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_app_b.html 38c27fa923e6db39c6c8b04921113105a3dcc3c7ac3e27e08f1415efb119fdb8 2 -/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_app_c.html 5bb9023d2fc328fca8c46abb690647bed4a507cef9834a918010124593e213cc 2 -/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_chap1.html 2d1b3d5a44f83fa2965a8f1348cf26048fd6a4eaf8e794756b7efaa637f129b6 2 -/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_chap2.html 2b347c67f888a3bdaf0925f41cebcc91478ef6ce3aaa5d7bb0de1d3bb4f9e7a0 2 -/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_chap3.html ea0a6ebf2e72ef7903bc5a95987a38cfbf93524cf0fde859f39287009c973ba2 2 -/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_chap4.html bf342be0e3659667295a34c2e2ded70380ae0bc2813d270acfdb2ebb89e0e4ac 2 -/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_chap5.html e01ad9067288cfc642fb60471c376d12c1e75b262a9ed7108545aeb4774acebf 2 -/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_chap7.html e96e8ed73181e9bcd0b278769d5a4e4010bd56ff4462f5255bcabae712124963 2 -/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_chap8.html d56216f372112750bd1232f9f1843cfa671cc3ce21472bbf7fc9cbe73255b2af 2 -/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_frag_hash.html bff69361eef81858c0869faa5a66586c77cf0891d42a54adf26fd3aadebe71a6 2 -/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_overview.html 9244999fdb519c54063a3e735ca0c5b44f64d6bbcbcdefe801a73590b5cedba7 2 -/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_registry.html 3fbc709b045a6cdea99353ffb78e5f57bb0a82ddc9cac8b55771c7dc7fd1c2db 2 -/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/notes.html d3b1e032a0ec573c2e78da97f3ff67b1ac379b30d2e68fa56253a6bc0c1d176b 2 -/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/search.html 20ff8cc5bb5cfbedd52a08c8a593d27f6e742035ee4b4a6e1bc7601b27eb18bb 2 +/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.epub ffeb8235fa7cebe7f3afba56be3bf2073441d4057903f41e53e4494dbba65f4a 2 +/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.html ab1930b1ba25029b8a29c84301393aa97e8716ce591b572fe62c05369493e1bf 2 +/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_app_a.html 7b710fdb1d8b990ea513e6628178d1e981ad5a88e87c8ee053af1215e4bf8517 2 +/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_app_b.html 4e6e0b9061f7f798f41d35a92c158f76b2b9f9666eb5812a69fad2ad0fee5ce6 2 +/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_app_c.html 0847743de4d16b6289c6ac805e801732eca78c794a19f140c040ca21e2bae41c 2 +/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_chap1.html 138c4a5874e91d5171c8ffa31783e9b917a38b8b00c248bc73a0e52113b9340c 2 +/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_chap2.html bced47e7467677aa790c31100aa0ca8391ab2936978867522c7903481a1207b1 2 +/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_chap3.html 52989092341063c40505406251743ad9f7765a94cb2e255b95b78d521fbdb525 2 +/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_chap4.html f20883834dc4f05e5deaa64e47a74b2e392023a4a024bc3f6f9e111a63238a18 2 +/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_chap5.html 2b9108978d65b184f8a42408bf703dbd1a8419dc138aa24700bd530ee613251f 2 +/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_chap7.html d1d0439b552772b0aae718f1eeb5dd5c0e5012942b12d1395e8efd3548450c8d 2 +/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_chap8.html acacff25d6a8c5dfa4969b4e9fbd9ec1185eaddd3ebc7b9b226fb3b19f47c486 2 +/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_frag_hash.html b5345f39d1939c0253801d1e10627e3005990d74931c4a745bf9084fc519ce83 2 +/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_overview.html 09d99512c3ffd5c91a0f4c39090cca78fcb5d05c3ff843a59006be52950be5a0 2 +/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_registry.html a15b484c60e54f5416d59105d628f6f2334f4cd5c948e6385c79b6001b8beaf3 2 +/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/notes.html 468945fcc5779e2e43e13a6e44da5069178ae6e7f814882ffe3a7ea6a94a38e4 2 +/usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/search.html 7afadb8dda22f58eb2ba3dd27e17c6006771042dc5f3cd0d93fa6fd92adb4cf4 2 @@ -3572,2 +3572,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/404.html 3b0d545fafae111b3540e285261e75b751e8b53bb946a68df154949a4689a3b7 2 -/usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/api-reference.html 4d2a76a2e66cc62884be489fee4adb05f078be211d216d93f2ef7b4029b50e77 2 +/usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/404.html 390ab3dd83329e5659c15430247bdb8264c17496b89f1a1357293d3b3833857a 2 +/usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/api-reference.html bb69033a83dfcd5d88455974a93573eabaa36a7be2f26025cd834d99fad13e2b 2 @@ -3578,3 +3578,3 @@ -/usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/cdv_cmd.html 7e4dd467799dd394c635b77f71236fc4e82eefb63152fd39ae18f3f73a6f9999 2 -/usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/crashdump_ug.html 723ef1faa7e06440e0a8f2450c741c25412bab70b54ddd55209d283e4c1d95d2 2 -/usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/crashdump_viewer.html 4095c9a0eb274a512f634c405612a2eee1d5bb054b7f64f06a696d32c6fa4547 2 +/usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/cdv_cmd.html f62dafdbdfc9a51177f352a218734147d11fa544a9aa5a1d13e32ea10ad47faf 2 +/usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/crashdump_ug.html b0c52d520f12cc69ed6d533ebdfe8065a04520e24391961c94fb7ed92fc97d91 2 +/usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/crashdump_viewer.html d3a30aaebba1d922187d60cb43f91baad2a3a72221c259fa87b1795a82316357 2 @@ -3601,2 +3601,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/etop.html bc85a6ef2e48b3ab07e5d1f0dfc89b8955a78afba42c79710d31164aaf1eda3d 2 -/usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/etop_ug.html c28f7a3875bce3e85ec64eb2ca4499ed87347f23bee2935d43f35ff1dff19e79 2 +/usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/etop.html a9ef00d12b23ee21b7ff9e92b318c7b7b890d1f45d1fd7326fbaa904edb5d332 2 +/usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/etop_ug.html f01bf19ebb5557de58ac79bfb696e576c1a9514dee65f108371ba2dda9241ba1 2 @@ -3604,9 +3604,9 @@ -/usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/introduction_ug.html c45b95cf13351d1ef2139debea20f3f02c81f9da718dba002fefd0065137b5f1 2 -/usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/notes.html 4d2a36fcd5809b5e51019c95bc1f0bc71fd7c61d2563445495431daa5179cc8f 2 -/usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/observer.epub 29620c6400fcd53f550cbd80e66e3b969005a47d7387bbfb6776b36c5a78986c 2 -/usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/observer.html 30e696ce6fe83f5c9dca3ca650e5d021a2c612b75eb66c3bc305923f2aedab59 2 -/usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/observer_app.html 6e591ed8f5a1b52b37959cf1af6ddc1285cf462f5402b61142a2defe4bdda31a 2 -/usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/observer_ug.html a814aed2e6da667f350ace33b24e4f78769d9907bea281e4ec79e26e182fdc5a 2 -/usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/search.html f674af264488f80c080be7116a3e31249261a3bb6c794fdadbb1cd2eb8dd12a1 2 -/usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/ttb.html 8c017017ec0144712797c0c9c71b45b1b567f914fbf4cbe71dd80cbde1a1f987 2 -/usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/ttb_ug.html cc129ff55517bb3edb44d0493422f2821dd064d11639454e53e25e5a1c6d4d82 2 +/usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/introduction_ug.html 06682732ddaa58678d12689fc4471fd9b61570e36b7e7bf529f61849f5fe77b8 2 +/usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/notes.html a2dac79b164de89e92e584be03da24fd90eb10c73d1516d6c2f2f5a5bd6ebbe5 2 +/usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/observer.epub 8d30a65882eafffb282bfb01af92d400fd25f04c0ae3a21fd31bdbac13d6e4d9 2 +/usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/observer.html a96f7cb854c279020e0bc8b392f850febc6b214b342c80f968e9c40c66f3b539 2 +/usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/observer_app.html d1d74b8d7f89c978e48cac104a82faf45233979dd8ade571c690423470483036 2 +/usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/observer_ug.html e3b6b2923d9096187bd1093583a737649e63f750e5df79e77e050fbe41c2848e 2 +/usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/search.html 413f485535b478c647c187c1f0f0f84886ec57f7d88d69d68718e6e199be3d36 2 +/usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/ttb.html a8cb36b98e0dcba9971d9fd7571d28f21ac3ff9c2a250dbf4d54cd7450be6341 2 +/usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/ttb_ug.html 9b24683b7957cea6cb51e5c41808a26aa5b3d985336e91a4e6e692bfd030cfd7 2 @@ -3616,2 +3616,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/404.html 7c9012c6a430a42816f391500ec11c070935fd39bd270643065ded09f0f2142f 2 -/usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/api-reference.html 2c87bd314c52d597f0605ad961b4c5ccac90d508a283b88eada2e736ab9a12d5 2 +/usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/404.html 4a941c0c3c8ceb71affa9b367363556aa9f6937a658498b0da650969c45290a1 2 +/usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/api-reference.html 5aa16c9f038ba764128cfc6bd190abf300bcfe124b0d9822c5199e9362bd98a5 2 @@ -3621 +3621 @@ -/usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/databases.html f4ef351779572a39a9d2d3c9d29ed2b227871acc7eabf80cc4bc8cd5884d3710 2 +/usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/databases.html 04b3d813dcbdfac6836fdbe4b6670d7b46826d1e4733f4f92f4938a5e8210d98 2 @@ -3642,2 +3642,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/error_handling.html 5d6b3c979a564fb6609b4777f0f0beb0a408cc73111d8296d99f41da7a18af70 2 -/usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/getting_started.html 6cb219b927804602425a988646b653eb8f6f7b99c751b92f11d2fb0c746dabb3 2 +/usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/error_handling.html 11932f5441850691be6314179cb7bc89c069f3771b5537c327ff73d6d3d9d673 2 +/usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/getting_started.html 498d93f0eaea609d81503f6e1d6846925a0547664a8bf1d517c59867dd11d6aa 2 @@ -3645,5 +3645,5 @@ -/usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/introduction.html 43fa911bd80a3c13ec499800fb4188781e53d147f33b0edd990995c00b29c82b 2 -/usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/notes.html 9cd14e01ec977a4ebabd9dfaa2e7ed81a3a3cdc45879e2aaf2d3a604447e8328 2 -/usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/odbc.epub d49f501c8eb4c6e823f09b0ce6a2465a7e1c70b627e99898c8b06cf70066e2eb 2 -/usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/odbc.html e7a4f99ab195fc43b08964f5a594ccffcf224afbc546215688aaa0150f7e0e87 2 -/usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/search.html 8313da8017b67701ec2e3ce62b5f6933a6ab0dc1ecd582b5b79515f30e8aaee9 2 +/usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/introduction.html af8b5cf9f959e7996aea8bda3e23b4bec993319a50c64fa7b6e72d023c0bfc48 2 +/usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/notes.html 76ea458656b019baeaed5d98e02a7fac3959de0d2d0c0cff63a6fa0884c4295a 2 +/usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/odbc.epub 8fcc7e0045e7483cb4622162402afd54fdabec10b1c18960ffce60d14a226de0 2 +/usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/odbc.html 5b4db9771b218bdc11adace7147d349c2040edbde33a52977d01f515b108a535 2 +/usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/search.html fd63c22035c7a222e4b106bc86dc14b321edaa8019c4c273e11986c693d344b0 2 @@ -3653,2 +3653,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/404.html 198ae8d14d14b13c7c5a1a5a035a7489ee87056c2074510a96473c03884a0580 2 -/usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/api-reference.html 100a2e7fc40ffb4f71e6addc417f89ac78effe853769aba34a46e00ede2b1ca1 2 +/usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/404.html 8e3259cc774d8fb6bb1c719db39b9de6e62f4fe0cfbffb3a5edcded2d17c2f62 2 +/usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/api-reference.html ccf509d6abff5770295ee578f33f61f4951173a2892ce71b1b6fe7d426558b15 2 @@ -3657,2 +3657,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/cpu_sup.html 4c9b6ac502d15da3fca4f93d2bb4d20968ea603eb20c8b62c12062eb40d398a4 2 -/usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/disksup.html 08cc6cf1310072a44030bf3f7c3e5b29e1685ebac503e91a5be88558dc4a5e4b 2 +/usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/cpu_sup.html 2c4a0b2e743577b301abb771211a3399fb23525a8d309ed5d62ded8b4c581373 2 +/usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/disksup.html 84a4c453c74dd362209f42e4dfd9ec2a613007e1e6dd21838ea4d103994321b4 2 @@ -3680,7 +3680,7 @@ -/usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/memsup.html bb9dfe07215d36d90abee54b16942df011ccc2cf7be240b55adb68be3bde65d4 2 -/usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/notes.html c78dfb727ec090b553f9c33d84f295daa6350f672ea8a2d7c0de09bb8340a78f 2 -/usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/nteventlog.html 0e22bc9e514210a447b20c5e1719885a6422cee60eea454093c844fbfd512f58 2 -/usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/os_mon.epub 8b0548e6c485989a7db1e50ffc314aab8449aaccb0928245e896cf8433df716d 2 -/usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/os_mon_app.html 53cc6a2c461683360e41ae8995ca08e2fd162a449b2cc29c4fbac64daa1e859d 2 -/usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/os_sup.html 83312d0b81ee26b300d63af33ad77ffead43b0e5893344fbd6243f7d8c22ab82 2 -/usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/search.html ca6002ae5694916bc530f45220b40072b2b1e734796ee748d8a9cec0909c1484 2 +/usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/memsup.html b2e1bd0441c03f3834665f9fbe8b78c1ffd5d65bed72455241e1febec851ba8b 2 +/usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/notes.html e4fcb7c5108e311e7c365394adcb1c5ab84c75f4c550ec97e2885a00662a7371 2 +/usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/nteventlog.html 26858285f752ce43146d6f2b775351b0f9f533a654cfa9b24fa39b1f7c9243b6 2 +/usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/os_mon.epub d73e17626bc76c10296ef6840fe6f6f921b2846179723c51d4fafef61d3704c7 2 +/usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/os_mon_app.html 319e707a27d264ce246dd3e688ffa56b1b98c0691604227e35e7736b17f0c793 2 +/usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/os_sup.html 3663bce3689c5e10c64b86ec63e231229583448e90a7a177edf59924e89e7942 2 +/usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/search.html 590919c162687767bdbb5f16a2405a3ada0f5e0b8b09256d4c46d5f99683053c 2 @@ -3690,2 +3690,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/404.html e8990e760abb9a3f4b2496bea8b3e3838e6a724154fb9b25dfd27554822d5046 2 -/usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/api-reference.html 70531e23f7ba5a77b466e66d159836bd5d9b6b8bb802196d3dc059c34673f886 2 +/usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/404.html 51bae02f23f204d5b6362f8595f53c7d78fa368b09199131b02603c221947eff 2 +/usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/api-reference.html a79a65f8674b765e73575f8d0a3b1fce5ee67d40ba0d6f0967f826a355ccf4a2 2 @@ -3712 +3712 @@ -/usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/dist/search_data-F08ECED6.js 40cbdb269d240d07cc8a39ab471ac2920039d4a6973ae15d99c13714d8b84919 2 +/usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/dist/search_data-8BDC4DA6.js d103c092cd8ea46b35530ee75bd94336986b0db54c28ded79f89e160337166c4 2 @@ -3715,5 +3715,5 @@ -/usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/leex.html 1de607ae72c1be1db87ceeb9fb95cb3fb9a12f043be6f35dd3b4698dcf3f0c24 2 -/usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/notes.html a72bf0cebc85c55839d93f7bf7e778e88d5d7ba0cae92b0e45bdcc5fd4d96393 2 -/usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/parsetools.epub f94c0ea87cba4080b07eb3abfbdad900eee444bfdf88f24390d35fb032bd04b4 2 -/usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/search.html abbfcea45d8cd035f08bdcd86fb6a18de828b709636b79b1c4856554597cd5d6 2 -/usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/yecc.html 5678e56069c1d01098805c568cf54b5773b67dbe9953232ef1b90d05522a9f92 2 +/usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/leex.html fdd3482a5db6b0105f9d6321e12c5e2e95607dcc511dbc486c9d40fa5b16e20c 2 +/usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/notes.html 36b99b57994923d5b90ccfe4eceef700529b59861ab3a0fcc38668fa72184cc6 2 +/usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/parsetools.epub ac2b0d80ee569121dbf6d8d030ad0c438fb5e79166374a6904500dbe71678630 2 +/usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/search.html 7f3e1a69c2f2999ce26d4ab5e14893d82d890fd325f4b6d4fce6481b44cfd5f5 2 +/usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/yecc.html 176b5c03a5376a0b2151694e43b3063d25607b6df78cd27208692db82602f23c 2 @@ -3723,2 +3723,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/404.html d59a5701d8f20085a9a5d8d31fe416daf679378eaf915987e4318f9caefb52a0 2 -/usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/api-reference.html 0429444450e0cb95abfda6fefe4743337e674f90d2c59e681df9736fc7c8e9bb 2 +/usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/404.html 8f2655279398fde37254ecc2c2633593b58fceaf6ed69648ed3dd2ac2497f94b 2 +/usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/api-reference.html 2cb889e3b2eb1aa613ba0130436cd264b23b3a83efeed72f816291c57a3c680e 2 @@ -3748,7 +3748,7 @@ -/usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/notes.html 569b4f6827adbbca7594a5ab7e5026bba097256468872989194b683673661a66 2 -/usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/public_key.epub 5e03b2950129a00ba850e754b897873ebbdce7f38af38768062a6343638ccfda 2 -/usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/public_key.html c68c5526cb24882ca0ffd543285b1445ff8ab0febf2c0dc9118103ebfbfe4400 2 -/usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/public_key_app.html 1da90b0a25337dc1bd4b092be894ea183d974bf9ee3dc3254f2a4f434613f403 2 -/usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/public_key_records.html cb1de1cfbf7066b812063e6f67672ae0f6b7c4f40c8075aac45695e154d1f558 2 -/usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/search.html 0665e9da921e014321b7b46a89c9389c05107d83c471382e681843315de2359a 2 -/usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/using_public_key.html 139176130307bef8a9595e7716e1e74b279791ea1099d24ca6163cdb234c9bd8 2 +/usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/notes.html f94cdbca5b93a64ee6695d4fed3dfac3dca45dbe86153aca8c37e1c178fe5a1b 2 +/usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/public_key.epub d3afe1551aec30920f94c92f873a1740839847bdf551ea7fc1b8b1aaa2fc3c59 2 +/usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/public_key.html 3ee5d2489a92b2c7183b0016e92fc16789e977e16961717a8504e14aa2ac0ce6 2 +/usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/public_key_app.html 4c9f78a04152add13d4c5a30c410e3676371b96a2cdac7f31b526556a3e1e157 2 +/usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/public_key_records.html f4eff3544f5b3067de79f04b37093fe43c4ca8cbc48ab0df0d6470842c06ace1 2 +/usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/search.html aebc358e267674a58462db1ec18f5b41101f5c5ff2d32e1b2659ba18bd65f535 2 +/usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/using_public_key.html 48821bb9b507499d63f5680b9b6f73d38f45bd432d9b02f553a327454b79a729 2 @@ -3758,2 +3758,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/404.html f025d7cdb6895a3416917e5bf9cc9b46a2ede3231adc913a26f5fe4de1fe69e5 2 -/usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/api-reference.html 8e404f761a2ea6885d0250016f0e8dc2a31ec431795406377aa5783a8a7a0d29 2 +/usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/404.html 91e17738a039f84498592d4ec25d0371c8897d20c143aac5b7f943bc9b184736 2 +/usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/api-reference.html c7c26335e8fe979d929bdaf4d6040b983d44e39b6d78a213ba6bbd3c6aa6913e 2 @@ -3783,7 +3783,7 @@ -/usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/notes.html 30b62fba25dda1c87bdcfd2088068c52a787bacc2e275455cf92c6f603024463 2 -/usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/reltool.epub e54782d1691d9124f23fef0644fc2189fcff78cb2cc89cc6641e0f401d522e52 2 -/usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/reltool.html 2a3232fde89971504bc5b03a6b8ab54dc26c4edd1575d39bc290650d374f3cec 2 -/usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/reltool_examples.html 3d463483335bb4fe15c58dbc5f7459f2214747f426545d83ed657a6cb3fb81f4 2 -/usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/reltool_intro.html b27e37535ee64a841dfe3d48e08f2e4f0f8f9e35203877411e4353f0a9f0b7a2 2 -/usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/reltool_usage.html 31ee63877fdabdddece55d0f61bf23eaa547173afd46c95a147da0b1e9bbd2aa 2 -/usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/search.html fd22bacf39cd3630cd8947866652f3d647ded297921d4641f21e089643e41116 2 +/usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/notes.html 6e10d552cc27f53666b09a921a44eb787ac0bd08e5f280bfeffa83c0e0697522 2 +/usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/reltool.epub 705d719cec49798923dd6a373c1f21b4e2cba662f112c451ca113bca18da0d85 2 +/usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/reltool.html 827532f20b963e6ff66e0ae7bb7edd1eaefcdf5f036050b5f7a56f9639030ae9 2 +/usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/reltool_examples.html 8e81d7c262f8722f21091d35c71e1faa44f120585af5871c88ccfc688c6c7fc6 2 +/usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/reltool_intro.html cdeaa7a01a28bf3690aa064eddd03c4658b2335796a0505e0993e637f3d2cc6e 2 +/usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/reltool_usage.html a6e278e1ce063231e3e8fd5b86bf06a7bef4f326e6e97820304286af9b9d147d 2 +/usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/search.html 9fa79c2dcb44c7ebdf13ce2b8b5bc2865acbbfd73d7e016335eb208c5bf8cc2e 2 @@ -3793,2 +3793,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/404.html 24350d717fa2e03074c98223cc087dfcc77619bca5debce28976d4d19c873df1 2 -/usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/api-reference.html 88d486c5e2e6584691f4cc047d3c3ac33ca8a2cd9d9b244846a2020903bce731 2 +/usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/404.html f2ca4a02da00c25c2e38051522696deb907f3d93258a65721d37fe74245cf636 2 +/usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/api-reference.html 4cde3eee3a7587c73ca2c84ec2f339d0fb3c1b328976ccb1427cb9ed51087457 2 @@ -3797 +3797 @@ -/usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/dbg.html 7d28d0364a67c76023a73bb8529963d5032c0132697534418347b232c5693c5d 2 +/usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/dbg.html a624acf865c1b9ed5ddbca0c1e5c518d8c78d733d526fb6b15c13d15b758adf2 2 @@ -3818,2 +3818,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/dtrace.html 85feccf629c05fbe7ed745e89c46d9be38f03a0459d27b5c6e539473c2869959 2 -/usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/dyntrace.html d824733223d7d667d971285e80b87c27868c92df25138952530e9fcc52fc608a 2 +/usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/dtrace.html 55c5cf0d1506509e3ba7e05f5fe23892795c972e2d1e4c9fe6bd5a273f9d4d07 2 +/usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/dyntrace.html 9714c749fb0fe648248c550078fa14751278810b8aded264658eb11d5d140a9b 2 @@ -3821,10 +3821,10 @@ -/usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/instrument.html ce9681818a3c87bae5e179b666c02b3aaac63fccc32b65af993a8929e3189306 2 -/usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/lttng.html 5be707acf576eb187815d5df9f475a222ed6e872abae556a95844858698b2d15 2 -/usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/msacc.html 9da4481ad6d044a3de174c219af29c6dd7cdd4bb72da673ef6b2c294916c865a 2 -/usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/notes.html 4cc33fbcd6c516facb473972c1e375ad9cc890756ba44ff695b7cdcb95a1b231 2 -/usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/runtime_tools.epub cccf105f78922c0046d9296880ddba720eec4364e0157d291be64f3a295a8834 2 -/usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/runtime_tools_app.html 0d7e1753277b56cb1b6da62a9c55c196fe6c408ea55da31ee6342b731e362645 2 -/usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/scheduler.html 809cd8fa5ae0d534c67b019f409a69f1ceb61e7e52a562f8f610c0052453c36b 2 -/usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/search.html 6d84b65535e740a4ac63dc3d567609bcf09f56345632e87b974ca4244da048c4 2 -/usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/system_information.html 06f54d0c307ed7aeab44b7b0bb93e0ddaed524c11beaa68e4f1d3308e5a0342b 2 -/usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/systemtap.html 592818067fdd09b58bf952fc9d564f6114a7d0be7893d8748973f856cdeab7f0 2 +/usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/instrument.html a805f217784a35afc54d9deb6ebdec319d6038673994ebab6366ba6a75cb9382 2 +/usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/lttng.html b975fb196eab406ca66bf813efb480ecb227ff2251defbdac1749725f512b8f4 2 +/usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/msacc.html 6b3f0f61e50cb5c60c581d05659720fd791f054abf57ee6c351db698298bcb7a 2 +/usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/notes.html e88f8759613b92cc7d0d908f986006b307d996d95a1f421b367ad4e50910a049 2 +/usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/runtime_tools.epub 6d629472c26b0ac20bb6606d50b06daf4b997190cee3e564d854101155ca8b8e 2 +/usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/runtime_tools_app.html e96bb9ad0ed52f5d1fc95b6351a01b5886d9e5c3011cdae1281f77406c160ec6 2 +/usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/scheduler.html e9e968b8ee35d834aec047007add0845b628bcc1d4164b235d71ce9c06734ce1 2 +/usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/search.html bcf8636814e713686d6f6b1563cd26006fe868a3ea34dcab8a6fea1e522a9a65 2 +/usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/system_information.html fb3c5aafa8cbf6eb12e6c0f2ebc1b55e493825b77d36730cc8b211034076395f 2 +/usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/systemtap.html 6e09a99bcbf2af4e93265c4543fad964e7d1fcabff5916fbc76ad6f600f199c6 2 @@ -3834,4 +3834,4 @@ -/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/404.html 739604664d484cd9d75882fe8904944c8f2e84be0988b86b0af8c2ff8657697d 2 -/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/alarm_handler.html dbcc5e586a4a1832b3f3ad6bfb134e7f83704aa3c2b03707a8fefd14ca47eaa0 2 -/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/api-reference.html b1d5d08669d2c86da9a7fef1fee9bb4786c171da85a5b76654316163545a1e93 2 -/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/appup.html 8f970e53e840987c1e972e860291cc27c98ddc12dafd487d1d78e04ac1300a87 2 +/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/404.html c7c766e68a75f584e99bf96342e65a55aed20dfefddd8497f77f7963fd289438 2 +/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/alarm_handler.html 87af3cc1fad386a25be64b47d4e7029e855ba21a6bf3084478dbfc943705afd9 2 +/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/api-reference.html 6f9f7f2b55ce77189f6c40806d1918c8cd3237d45106736d080bb464f2c82c70 2 +/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/appup.html c868f3379af19772bbed6c519d9e8eadf49a550a55ae550da1f12ca65f6450eb 2 @@ -3858 +3858 @@ -/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/dist/search_data-D2253CE5.js 678b50e9092253a4c186068ba31c5d2c2ce327f477d5475f52a12ca7381ae2d1 2 +/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/dist/search_data-12AAC588.js c23d12526231e2fed3940ce1b97b6a11060ae38065d0c1b0cfd815fc3f4f6d99 2 @@ -3860 +3860 @@ -/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/error_logging.html 74ee360984f566de155f4ce1a10d5a0fec34a84b3fd0cb276317c968b63d4154 2 +/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/error_logging.html 4ed4ed18c6f3227b72286e44210a066be833bd9a5c470275cb91794d073bbf17 2 @@ -3862,11 +3862,11 @@ -/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/notes.html 37f7fd75c70748ce91ca03a827d52c6403af20f47b04b9413f036e3160782bc9 2 -/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/rb.html ea9b8b150e27142f446e3c8161eb5516c5b5956be3282cd8e4402a414565edd3 2 -/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/rel.html 542aa4111784aa0e3df8fda3ed9a45bf639b2f5124bf6a6787de6832a924e6ed 2 -/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/release_handler.html 7fb80837e04c46466e2f79447fd5aadb69009f9d95cfef6d283dfd1d263bcbc8 2 -/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/relup.html 5c61d0d184456f2eecec376a40032b5f9bfffb00ea1fefe86e983c8499f2b59f 2 -/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/sasl.epub c72ddb522d85653c06e40e633defce6e376112c989a33e07ebca0ce377ced7dc 2 -/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/sasl_app.html 3e8dab909dea4258248ee93c6fe63cd063e608e9aef61bdd8f1c41d01d7813d2 2 -/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/sasl_intro.html 127c61da435cc5372f5f2c01da84ed414778b0581c2582daa5f8b27d7d1ff4da 2 -/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/script.html ce89f4229816733a9da8caa3622974c2cd50005aba1c4ccc4266a81ea2394f04 2 -/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/search.html f308dd46ba24f6d2baa968e692549122efb4cc9561b9cf521a37e4510262f798 2 -/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/systools.html 6f6d32681e06dd04ae9fe9e874ca846820f179fed508390b022d2a8e575cd9e0 2 +/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/notes.html 589425cdef20c810d4914adc57737d0af8775df5b3dbbbcd6c3e5efecfa4bdc8 2 +/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/rb.html c98ee79fed40944710607b44a968725a587d6bbc5e43ee05234b5b1678686484 2 +/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/rel.html 954f2b9ee539c0ae8deeaa79112691526be0ad0601a4a5fc29e9cda6ef2e9ad6 2 +/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/release_handler.html ebc15a918e5cd91807cfa628172e1a0056a31fe2f7687c422a74bfbccd4e7252 2 +/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/relup.html 7cffe1758329908e13d522865aaea5a7d82e781e799e02fc1899844ac59fb461 2 +/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/sasl.epub 72edfd637a794ba3dd889add8223ea9da00fc06f69993c8e2ae0b17831ffc60f 2 +/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/sasl_app.html b0b2b06259e85a3c23cb88d752a1a3ba6026bea1da985b3afe8151406a3f5a29 2 +/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/sasl_intro.html 74e84e5948a66cdea147ece4f5ea48d9bd9d40ef932d21a42073bb94079074df 2 +/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/script.html b387d75a515b1d520cd21480e9bac0d47477f6a6243c21478bfb4c9d87be4895 2 +/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/search.html 2f5fde22e89f0ad358b8ec8a3181a271109d80c76d4e65726ea3c3227f2aec6f 2 +/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/systools.html 971ff58d3108a22da06e3adf44a8e598802c25a5d4c893b6a6e4fc91393801d3 2 @@ -3876,2 +3876,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/404.html 6e7f4b464c84899d78e43fbb541b1eca03022f643c265ab70ec1742937dc06e7 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/api-reference.html 1ceed2732da93d5fd4fb6888e10785a854950eeef315bb646d4930c9fd412d75 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/404.html 50f2fdbcf331261f139dbbad701ed3adc107e89c364b4b3d2047238855206c4f 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/api-reference.html 79d08174ac11f22a709346e09bbc73a16454cabde7abe75b862619fa935dfbf8 2 @@ -3911,57 +3911,57 @@ -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/notes.html 9c3700fa9dd151f5ea467ff3a954a8095633264eae059d37e1422e1e4218ef18 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/search.html c074db83511990f3db21fa9681db28d89ea3f84c3b5d0d7ed4be15df2ce01a75 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub 724da4f25a059014cab6b76d0e203bb06f83908040ca9ecc0634239bc4a01d4d 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.html f42966efb42626afc9f1cea8fc9ebd4b5d00052cfa53650e4813ee880cb21073 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_advanced_agent.html 5978c5ecd78d821120c5c8ee924b14b3ffae20cc52f021b9c69fd7e7aef3a71f 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_agent_config_files.html ee2ef1fd3b85b394500ec01c8e8aeb7784d7a022fedd396591b903697d2bb8c4 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_agent_funct_descr.html a251ecff0d4adf5fb220ba20c7000eddda0f37f1c3cf114d250093914ec5c403 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_agent_netif.html 440fc6f75266f365bbd59056d1152f3db78e912b262ea1599b2296f3dcabac83 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_app.html 8b97c4f5e81005f7b0d2efc8e0eaa2cb634d7b1367f34077411ddbc71cbd60e9 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_app_a.html 5c6d277f1fef92d577bf328a4db440d9872f9d18371edbc88e22f14106d0f9e1 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_app_b.html 34be2a4e33a2ec38a41f6c94d2930e4481fa46771a9bbf8c04e2dc220800e971 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_app_c.html f40d9d69127c5055acad2a233b6219eb46d9a18c85a6d0547777796d88f3a9e0 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_audit_trail_log.html 06619d2ca85defcb927ede196dbb62f209c430bdd288e1eb99618ff4c12ec123 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_community_mib.html e00e91e0e6926917be963a8b8b0f83593762b1468914aa84f22ea31245a98d05 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_config.html 5b93ba81bcfb7f7cfeaad718128a175dd559d20f1fd630b22eb518fc4534008a 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_def_instr_functions.html 1ea4e281f6cde813e08ba417a5dad809bd93cd87fb853ef286f7635354430e4e 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_framework_mib.html 981cd1425622f126fe877dadc801b4e2429dfa5379967f73ff183fa012d139fb 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_generic.html a7d8db7dba48acd207579245bae3ca52a3b993d29895b416cf5490da76663786 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_impl_example_agent.html 0c7abc3a166cd131fc6fb706f716c8f02b005baf26225b051060f0e2e4f3fe2c 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_impl_example_manager.html 1d8283c447052018a684849abafd7ca548c9667092724002afb1be28cfd435ba 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_index.html ab7129aa522ec89b9b9e387b6478cc0749849d98a8484492423726994279498a 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_instr_functions.html 1a6ff22e59994b6698a2aaf49ef3eaf2be5e99e459c7dc4a488435f56374b6aa 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_intro.html 7512f78f382807926af628aa2fb653020e066493a085744ab7d0b9de8de42f0b 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_manager_config_files.html bccc55d05d71be49df744496f3c82e22e73a636ef5d3ecf8961a0981a592a34c 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_manager_funct_descr.html b5f41bdd75dd49b2efa91539fafd456dff00413a79dcd1bc602c4ec54a0a54a7 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_manager_netif.html 36d4c10cf113c6467a1b40d45f879698cf9cd2df54874e671c99212ce06d6d65 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_mib_compiler.html 93a55dd39fe65b0c3ab58a5b9876cac90f41a0b4f6be3718d71fc186c7a24bb5 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_notification_mib.html b004f1a3213f7a6c3d7d157048e1ef46e2b12fca536f858b9a0b982ba0385c35 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_pdus.html 9f23e81b6bb3e5604992356d6fc505d500618c987b2b42899def44f84addfb57 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_standard_mib.html e36a7a94367fc6b58379a7b9e5c80a21b45347cd0c65a62921a309e30978ba9e 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_target_mib.html 6a14d38decf095fee868a35a07c08204cabfb4bcc39a1fff94c22b86fff6666d 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_user_based_sm_mib.html 1ca5ab795f5cd4c116fa57ad1d1d4177d4f15f3a1780d805a5bfb8dfba47f477 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_view_based_acm_mib.html 5a304e99c7115caeb2979f809fcabe1b0d6b23ec9980dcf61b5e5738f39ebd9b 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa.html 4a4c8bf11709aa76c0ce65e2c09d0528b53f3249a2a5bcbee26fcf4deeab1531 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_conf.html baf2198557feb2f93aa35f9006c0ab2ca08ac464fb2f55f016163f91bc195af6 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_discovery_handler.html 0559cd18c7a9f41fb8852378cae98277e0072a27a25eff2c8f7dcfff5bf45af6 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_error.html ca2b3750afd10e9a8d514fefc3b91c02b07911c136134ed9acfbe040e2ce59b4 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_error_io.html 288f2ecdb92b834710bd90d30fbf1ddce1200b3f169ff19b810a55477acd80e8 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_error_logger.html 2347243fd978f3538fe29a5d242e431a410f25228074094c489a0052376df8aa 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_error_report.html 4908f27cf890d63be2252f8de3d1e77460b4971edb51d650c44b68d42721343b 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_local_db.html eb0ad93db5819429e601de8e6bb08302e99e9347771c294a1d81bb585e115f99 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_mib_data.html f06d523ab0a863b06666fd80df1c18c33efaed01bb71253ca1dee744c34a06bc 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_mib_storage.html dfa11771a7aaa9b591e705490a1214d7f47e8389b43bd65f10199868db5aedf8 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_mpd.html 6e83edadc53225fce589e57b2d17b867817dc8830664ff65240a2e7f827a66eb 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_network_interface.html 31117fb2af7c0ad1ed897ed0e33456a776ec5422df63f11b50fa9253830008e1 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_network_interface_filter.html 44bcdf0fe0811de8df9eea69cb2a5b3476ccd55f96a4d8df23465cdd07407070 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_notification_delivery_info_receiver.html 8cc3ce09656adcda86d2e21664cdc9c127c51d2a6d17883f084fcb5f6c12123e 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_notification_filter.html 3d91a15a0f751a9d0392f7d35fe2fee737e0a3f12bea7f2028d0591d788a8bef 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_supervisor.html 47b2c1754761cb6ab00a1092b4a71e558319f6e0d60cdfdc2008c7ab57e325d4 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpc.html 973fecc6cc65976ab36c8b090ffd1dac528555d7d7c854d4d377c63062e39fa0 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpc_cmd.html cd66a61bf350ff33f95bd30023253209f5c126dc0ba4d57cca49cc0e75bc436f 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpm.html c87be7e5a9d8dfc400cfbdb5f487e73ccb33679db9e8f6deb549fcc96ace0eae 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpm_conf.html 487baec5f437bf01d3231e9942493292ef71310c79f338ba31adb393f0571f16 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpm_mpd.html 9c68ec7318a770af403702626c01f12ad8a23d5b115ba46754573ab9d5aafcc4 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpm_network_interface.html 8b0a34cda106e699d9c18693f6931647f371f50754790ebc48fcb8a4a4a0ad96 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpm_network_interface_filter.html 3d43ead92123ccb3394a78e2a35c5a92f6407fb110125d23f37b60ce55d0215f 2 -/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpm_user.html 337cf67d82b9711d085d5c11faeaab4c0d089b75c58ad2f83b59d861f6c5ddd8 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/notes.html 55f67b703b068baf0e678df0bc86fabd38c4952c0eecf8ae170d2d22fe0d460b 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/search.html fcd44c684ac722ed2279f426757e809fea50686b4270c2f174c58a095b594f8d 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub 8ff051a6683616f9c32848f6210d77f9ab6cab1c45abd8508930e89954ad7541 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.html bf3fdb78f16a1955b8baff994d2656092ac33ea16ee3cbbba4553f7e829f1d1d 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_advanced_agent.html af3c8bd8df2f111c29133aa31def9e9d908aaad6d48cb3d2604265dfe1a0aab0 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_agent_config_files.html deb16022c3c366e92d3b43471818c262a0f96df8e4832e7e1d68dbc808af3f67 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_agent_funct_descr.html 32012f9ae2924cdfcc0088c5cf172322636b049d6a09778fec0f0fec3789d7a4 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_agent_netif.html cd338e202fdd75440bdb15d42cbd50d2c1352bd3c7902fbadb2cb9927f4e73cf 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_app.html 3f9987afe3b18c723a75545633ff5a30ade7261802c4d1360623ffc6515316a7 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_app_a.html 63776dc01489edc7b53f2f59df6ccd5d3b8d170cecd7dfae54d8a109b82c137d 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_app_b.html 6a8b0f60699025a7448dcd8798ebb34aaed21fb4d8efd9daeaa08bb03b82d855 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_app_c.html 34678a25f2a9164659808d85d753a19b443395fd03799492cd49f6404db77914 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_audit_trail_log.html 8fb0c7c58f20331491aa581fc984dd474f2d1e9cac7f7874de31e9592c96e3c3 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_community_mib.html 17070b0b6681a0314f30d97f96cc4302c809f245019706aa45528d110614015a 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_config.html db9e3a4db401318c1a5388b6f74cd2f0665ea2e08d0018e71fc549d41d64ca87 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_def_instr_functions.html ecd3fff20efdcf26d9e645c695d235fe2ed1fd3292a611827c86875266466754 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_framework_mib.html b08b1eb292f8258ffd145871f75b7ceb5177c8ea99379b8c78442c19723e74c6 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_generic.html afc041596de1370ee529dc00548e6942ee8852d4396dfca9252038859784c4be 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_impl_example_agent.html c89589eb1b6f9899e4cab47a1af2ff6b2508017236de526141358e456dbdc6a1 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_impl_example_manager.html b493e8d61689a4027b876233ba014355d9eb17c3ae83f4254c6852678f08ce71 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_index.html 7e0e052b540ff19562db2e2ba21f3e0c8b707dd0e02681e08c6a76d21b4dcfd4 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_instr_functions.html 63b747255a7255d950be37619b04ebc74762aff5a1b3dccfe45b55ad874a9c4a 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_intro.html 29f01ee1f47e7514f526855d5800236b92d8bec3125c5caa17c5129e60f57a22 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_manager_config_files.html 7e94308d7ccd137ea8b5a6093d0739ef22ba53e8b6df92c879246c372bb2d717 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_manager_funct_descr.html 8c10686ece33eaf2fb63dc14590acf99129c9d6eaa114adef433a1b0c461cfd6 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_manager_netif.html 379d83dbb95385b8b9b34e23883afd7a272a9fbb9212eb546bed8d788f0932d9 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_mib_compiler.html 3c3ac82ac5a59a2a47941ae19e4f5aaa96ee18934087b724bdf828782b8d22db 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_notification_mib.html f5723418e2edb42499886bbc8d2d9c267cb234a65751ae1aa85e6a0e0b520d0a 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_pdus.html 6547b86bb7b3f6c5983def66904251c7d63badd902851bcd5f2f6b7fa8a81cb1 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_standard_mib.html 8feea3a2ca358f4f3e4d7803ba027faf8b627559bdc327a8c1ed89d4b36518b0 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_target_mib.html 38e092c56dee7821c86564700b3e9a29de23aa07c8dd597e73492665e6eeb321 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_user_based_sm_mib.html 6d564913318c90fa58fc24bd639627099ea9690501eb968985e07f2fee815636 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_view_based_acm_mib.html 4a0b09237986f2d481c2a1620ad2f4aae853c3ec84907c9a5804fc419f26b57e 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa.html 335e92efbc6322bb5cb30b529189ab2c30cfd56fa39cfe469da14ccdf022c163 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_conf.html 2909abc1f2f9f4d603cc47ce7f9855795ca2b77515c2ada9a8fd494a76f19014 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_discovery_handler.html 2c702c3231c8ab29a3706329f7bbf7d82864adf57759eb120ba9bf5d10d16fcd 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_error.html ba28ef0415d0579c74d5b368a392b5177279d025151b67498bedede1f1ecf266 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_error_io.html 7b26467bf224bf78519c38e8e3995607f82178345922eded8dcd7cf6d90dc495 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_error_logger.html 40295a71ea82994e6690d463f3275615819c372f5ec2b9c9a9e1f01fa3455b0d 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_error_report.html 731e4e402d5039ca6bf027643a64867fb43b1737293674feed3acb5c68fe31ec 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_local_db.html 4caba55f63f88c6e092a9f171ebdc444e46c04b91a13c5356b0c5beb06ef6c5b 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_mib_data.html 19943dbdb4dfb0eca15d93643e12e3652b01400d3e05f03e464d7a4eca754833 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_mib_storage.html dcb2911a99a634edb9bb0ecf630c965c4b16216e2c5e8547e0f1bace42d418b4 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_mpd.html 59b0bf7032cfc5c2fce9d4e7f36a0e5eebeabab60784dcb9f925ca35d3b77608 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_network_interface.html a23e6dc45caa4e1f75c6f8fd00538bd32e0b0078cd9bf9c6ac89d6602a03c96f 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_network_interface_filter.html e8219905216fd39a2e9360860ad2051a1d75ae7ca21d4bdcc5508eafc0c8ada5 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_notification_delivery_info_receiver.html 1c78f6a5cf7605b4c3195fd3f620c005bb1271e2ba0b0cc9118f232bf03653e2 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_notification_filter.html 880e7b417994cdd9aefdc91977fe7b9815d4da1b4f4f4f26ac46b3c5bd92a353 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_supervisor.html 39f0045fd87a1f4de8cee89fb34c463fc169851b39b2b4dbfd027ecaf329da2f 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpc.html f86251b0fbacd78f277239d5d2df6a14afd2fb2c8953be75a3bad3bb5bcc72a9 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpc_cmd.html 05f2fa2694de34f2cbc58e0a8ba75a1f99fa9a9fd0d996d7875d6bef85663c7f 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpm.html d4a58c1b28c92c5987c257dc12acc06d9dd2cf78f27efd57e38a4bba1fe1de2b 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpm_conf.html 2f2c334eeee7ead647c97d664200e6b4f85cc2feb9a297d82fec62048176e272 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpm_mpd.html e09787a284f6f47ce74c8a1a6f8e4226c74f175eab934b5cd52beddd6faf0231 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpm_network_interface.html fcbb767823907c0443334d1b35fcb6e1dac974b18475cf176a87af7050511260 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpm_network_interface_filter.html e30342d221959dff6eb03a69e9c8a281741a159d01a6f3772a51e42d01f65108 2 +/usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpm_user.html c1de71d4aeb0a2a7e86a2d484da1e00d1228ee2904922386d70fa1831dd27779 2 @@ -3971,2 +3971,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/404.html cf1f6b6969ce1cb8a84891ca4bafa424b0c8af5ea0f3b595747bb48a3c150c2e 2 -/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/api-reference.html 6f4e8c9b10282cb6040c67e19087eb41dc6a6f82d4a94db795ce46aaa118e0c4 2 +/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/404.html 6a3ba7d9b529d78f0f18cc1c4de9ec6a2660884370125c8e9a71d09300803aae 2 +/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/api-reference.html 8edc816d2493143c00b4d0c72e687afe2d6654ff0372ab7302c906060da4e6ae 2 @@ -3976,2 +3976,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/configurations.html a7385f1eb44daf439c6b510a150a92361e903b344bf01da6dcc0bd10c0ba484e 2 -/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/configure_algos.html bf76def25593ab918b4b19b7e5d6f2db12f6e147b3e9d39174602e19c94a38c0 2 +/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/configurations.html 4300301f75a44ff39da011a860643c36336f569945d4ed83b46d4f3b691cb7e4 2 +/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/configure_algos.html 2f426822819754196a8a5f19cbcbeb36ec666789dafcd0a6c790df0a20271e6d 2 @@ -3998 +3998 @@ -/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/hardening.html 777022f875be15195177431b8d4e9aec2011273aee44742b256edb0904b435f3 2 +/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/hardening.html fbc4b7f77ad84c17991d8e3b8ad13c70ad50d4ff5d0ae7db9d9a613548174062 2 @@ -4000,17 +4000,17 @@ -/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/introduction.html c6d1e7b181ad1b143b012cbf552a636cb12f1dc5eebc21c633b5a5fa712efaf8 2 -/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/notes.html 89b6d8cd623fd375375f02d3d3823205ed9e8ef91011264d8f7ec49a20fa7c7f 2 -/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/search.html bdc1053ad3774deb67a2219f2a96a3220956c74ddede8a72f1664e81f187bfae 2 -/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh.epub 0787a1255b8c02c931e63390e5ef4403b9143615f9503dc8985488208d0e9e80 2 -/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh.html 26ec251ce311d98eba3ddae665903a0a0dbb560caa71df9f6ee3b78da975b8ba 2 -/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_agent.html d4187cabaa6576018f18a16b137daf61ea4d7a7c310a01bc6e6169bf9435233d 2 -/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_app.html 8e17f0ce9107e71dcbeaac945a048d428145a61f43ad2100f5476b43bd3f2edf 2 -/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_client_channel.html 9a674a01a3a975fd1df68a6f1d4519dfaca5466cc110ac3643cd829e15524d94 2 -/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_client_key_api.html ae0084ee0415af375b2047d4663003a6a33a24773773dbe06ad75916d50ead18 2 -/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_connection.html a9fc56fc7f5108c4c76066fd20818271cbd414d2e33380e54ade5dbd44b050f0 2 -/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_file.html c54bd76e5ac9d9045548f922d5f34d4c560c13fbca89472e4e92318c6eacd7cd 2 -/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_server_channel.html ab0d33b1c7048db8ecef723eb4fb38f4a6027c471e2836ac8ab34f2d4952871f 2 -/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_server_key_api.html fe58d2ea93a8f729358b30e9962dd3c50ffa01e10de278d5a9a8db6039d7effd 2 -/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_sftp.html c439c9f3c299c6feb361c765a96149a089ba3a2e31f4320a57d69103de2ef3c2 2 -/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_sftpd.html 5570de6fca7ff7b7b5b4996ffbe10f4601d611f4280f956bb985e033168fb45d 2 -/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/terminology.html 798d8117ef4de7e1bdbbaf8ebe04a4b003143b0e0008d1f2b4d7e206dc639dfc 2 -/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/using_ssh.html ff448e3679d46343bf7eb59e0ee875b24d846f490c3fc9125f45971167724b22 2 +/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/introduction.html 14883c132e27d7e1eeca0137f0664217e1309d18e4ad91c8988d2ac6ef358f10 2 +/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/notes.html 3a5ca08a770a48058ca0f3c981235d58639e624ab688995aa7d4cc54eceee47b 2 +/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/search.html cfd31f988327704d139439c4c36a2fa9959e17b0e18867444507b43566adaedb 2 +/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh.epub c6629a190c73f1f31f2e28fbc9624e708b470bd42c37d1fe98e4741ee1e99b98 2 +/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh.html 0476032fea002fb9e7880a6ae8dea8a7133cad408b83adf293f641ed7c52e4a9 2 +/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_agent.html 3df31447fe85735a42024ec04c5f1a509f11198c6303a1cd1939b14ebd47b3ff 2 +/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_app.html 018568fbc81e37244c7e08b9008720866221aa6f3b5be18d573e81b3d646097e 2 +/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_client_channel.html af6014aba50b360b03d6ebe2f6f755091a1ca5e2126220be0da734fbf5d14c2c 2 +/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_client_key_api.html e9558a15101cfbabebb72166aa2e794b0ec0daad9400d8625a49104629c5d301 2 +/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_connection.html ad26be09f4d05059724fc575a63152fbdb63142d53af7fcc71bfb691427dd453 2 +/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_file.html dcb67ab375b6b1bd8e9d23ee5c0095b2ec68a65671730027afaf76d29f5ddf21 2 +/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_server_channel.html d2f3744056b85eea3156b7423a7e5b9a671b3d0a9b0fdd62f3da21b3d165124d 2 +/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_server_key_api.html a78b90e6ee340bf640d4495f038177eac938ec09100f26d676d30f9f1e70fd02 2 +/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_sftp.html 749e8ad9b00947e04ab2a6b60820b606fba7b09a8609703a2108d2e4f99e20c1 2 +/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_sftpd.html e56924f36a04372f8b97eaa3def0bbcaca62fa8d031c72d9c8d1627be1a29585 2 +/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/terminology.html 5b0113f15721cb2493c030901e720d965c0e55e8682edcbc4f8a709d053dd4a5 2 +/usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/using_ssh.html b4e8ed00fdf8e18f1a25054edaf3bfda3eda2ff235e6cdf689dd92fe74f1c7b0 2 @@ -4020,2 +4020,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/404.html ec769ae4e7a1a5e694fc18562c0908b810c1f6cbd8186f23c4f550da75db710d 2 -/usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/api-reference.html 70f59b319d991ee2475211ece8e124762acfcd8e76a8e2f3485aad3f5d02aaa2 2 +/usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/404.html a515e1d735e24cdcbf9c36daaa750bb891df80b308bf70a181ff1c09b163f5f9 2 +/usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/api-reference.html 29740b396bf42d6a576e066f3efefe9e1b23b358f422f4f9f7722eb518e622de 2 @@ -4045,12 +4045,12 @@ -/usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/notes.html f182bdb062837cfbae5dd92a7f329cde4ab534f4b560929cd0aa65456a4e42be 2 -/usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/search.html 136866f1061a9145b8f0dd73becb50fad8ab82b25cbdac3a322b7618ca03cbf7 2 -/usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/ssl.epub 8939120e4bc98cd9635b3d03351152b01d6a68a39c474882976850a0ce0fbb32 2 -/usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/ssl.html cbb35909a59064ca3115df672a8c73a045636ceabd41106305550e6924b2a705 2 -/usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/ssl_app.html 51807d9a8f164cebf2fcbbbdd3e43fb683db3262670a5dada1bd2992b2bd96a8 2 -/usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/ssl_crl_cache.html bc601ed43e76e7f53dcfd2e902af91e1febbfa812dc9cf3f945924ef996ba4eb 2 -/usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/ssl_crl_cache_api.html b5c1cdc23bf07b81ab6f57b3bb01c3df567d6392cd573a5358d966ed6eacc03d 2 -/usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/ssl_distribution.html c2dfb904feed6a8dd7824bd8ef515ec986edb30c86abb178d871120f3ee7f83c 2 -/usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/ssl_protocol.html 82f68b99362aaccd93404a039b2b16216353d2578331fee8c2ad0975cdc0fb41 2 -/usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/ssl_session_cache_api.html c202bedd5e1dfb9a4e03580cd05ced9ae1dae8cc3f1e65b52ca9a9cc0f123945 2 -/usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/standards_compliance.html 55d852f62e19cfc74daea9813b6777770b5cc144c2a6ed95446b06f2f182bf4b 2 -/usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/using_ssl.html a90d2122d77bce6cb7ac605402f586d22d8c09a4855bed552927c846f367d70a 2 +/usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/notes.html 3556bc971ae0181afc910432913926ec56d7cff17118bbd694ccb883cb9336df 2 +/usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/search.html e4d8f7ad2889dceffe50386eb043e937d51312d1d850cfb107d87890d0dc4415 2 +/usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/ssl.epub c371451685d28577721a64cc49ab0bb9ab9aa1db405db605347153056714ac43 2 +/usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/ssl.html 14bcac15d57c253120f19e933d601dc68bc89a63faee4c288ffa8df7d8409626 2 +/usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/ssl_app.html 649d83c73154d2403b6ac31ad82432cd6cd1bf0f5dfafee5ed95c290d6884904 2 +/usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/ssl_crl_cache.html fd7155663535ee0880bad188a619565050ab2fe50bd0b24832dc974d6fe05ace 2 +/usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/ssl_crl_cache_api.html e1a92bb8a1f6ea03ac94e87ba65017e7240db1f74fd03a955e3dffc78058c53c 2 +/usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/ssl_distribution.html 82ae2cafcfe3bfe7b55d046d6084b84586af6932dcc241bfc6a666f45ee6f44e 2 +/usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/ssl_protocol.html aaedce2bad50e8a8b186515ee40486f85e9c3221d15ec9f805b7e4ccb8a87db4 2 +/usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/ssl_session_cache_api.html 32c34a445f7c0f2e0450c5dbc010c8aeab3e06d6775bcbf2f61991926d043adc 2 +/usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/standards_compliance.html 231e4e9b8b2e79050512f968d3d857f1440f297e9e8917fea5e089ea5ce8c807 2 +/usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/using_ssl.html 73fe69c2664a6995efa025bc4bdb8c2024610ec0df78759d83bc7aa59b07fae5 2 @@ -4060,5 +4060,5 @@ -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/404.html 54e1bee480e5287b1dc5f833218c6669e352133b8ad4489150d20d9561aa34a2 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/api-reference.html 39b026de8816d5bca29dbbbb43d6e84fe02c014dc71337fa6115efd596fd1107 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/argparse.html 718b2f5462c419e0a66aa49c3baedc786139789202be1fb8e661490c25212f2c 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/array.html 0c7f25882678a1a8f824ecf52a9e0a271b6ddc63630763af7bb96adbb0af2a5c 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/assert_hrl.html faddb8215e08bd91ff09dcdaacee907e0551e9f8ecbb8b61edf16d5a46886a0e 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/404.html 5899c8ae291febfa899aa9ee0d87a61946d49ad1aea43051248af4478ce0d2a7 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/api-reference.html e99e307e29199d44e67a1b7ca25caf7ceb08971dd0857f3b56539ac227ecb889 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/argparse.html 382b4280bbe30f5895d33161cd748235c5841751371f766622234c7c2f0c6b26 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/array.html 1052e090e33c0b645b0548538c0fdde664a338593d9daa6eb61ecaad065435b7 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/assert_hrl.html b61c5469f14df01fb0a1f50cda099748f2ebc87ed37bc1603ebf46e1d8bf28f4 2 @@ -4067,9 +4067,9 @@ -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/base64.html e0711d33d0529f353fe88ff6f47bbac2235c12bc182b3deaddc0fbaf50a6567b 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/beam_lib.html dd42cf0f93f366fbd47d0346576a6cbdcbb473c0d0d6ecb69302d92d19905095 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/binary.html a00e2d540e6455815100d00f9c0075b598049d26890e397ab49cddef72565475 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/c.html 0524dc518720c85acf664103fe5e732fe0a27df1c4c71c55fbbe1b22fb8b418f 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/calendar.html eace694cf8e69766482f042c258d4b52e5ea151b5500ebccbf7aa7f58d0c083e 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/dets.html b929ca5bcd06940464e506402ba1a118db17c43dfcfdc890c04a9389ef923bee 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/dict.html 2579449fb396e6ea9437ab979b7a24852cbc7904de5e4be6c83252152ec3d59f 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/digraph.html 94b2aa6625b7c08e2b207720b217d06ba21321f79dfe7734b9f7e908dba3977a 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/digraph_utils.html 6e96e97c9181222895b7d4d3fcfc3dedb5d2e3b20d6e01f6c491fa9602a098dd 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/base64.html 3fc9e3761bd2bcdd7c7405198fccd695e86cccaa47eec412eea8367aba374ff9 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/beam_lib.html f95461c3283a2e3ce9611a5b4b672cb2b91a6f041dae1dd29f992e35b4bf40e3 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/binary.html 5dfbc06e5f61aa725dc0acb4a5eb53b3265aed6f2c3100c4aa23f72846d01f49 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/c.html 725d85fe5ea21021e464621eea75d7b4062e611721dfbb3116c43b0ea239887f 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/calendar.html 354a49f17b879c028e2c167f3d94c1cc46a87630072444f5a143697c4f87f538 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/dets.html 2338ece7f7944c5d8bd5e49f51395a0e9b0e424d491ce4d4a17919083efc4078 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/dict.html 1da64628657fcb75d3da02da0c9bea614cb078733d7bb5f8a7f53d4156d7ffe2 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/digraph.html 49e878fe5845368d707e9fa0e895766ebe83d752fbbb6460d450a3404f7d7af9 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/digraph_utils.html e298ba8303b0e7a940ae9105628f5077f23671c4715ad9b7585d165e3c092f39 2 @@ -4096,26 +4096,26 @@ -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/edlin.html 84a6bcda3ffd5ff5eba5fd01fb964b5a9c589c1bb8957b63cf20ac738dd66957 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/edlin_expand.html 72d06f9d8281b1d56c0ac29e242814dcfe35cd706be2385acb8ea653ae8d7681 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/epp.html 573022106d1ec9d3764e6dafb90e6c5d9a0d9e96981494523334808df2048034 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_anno.html 8e0d27dce36427c506bc073767742a9c2603a97d996bba0becbc309f25f536af 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_error.html b3a7884c25bb1a33b2e4e8143bf69b28a2c987ac941fe483a7a3d8f69ecfec39 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_eval.html 1fa7804d119e8dcaa876238c3db43bbbc2c9995e2bf4f17f93ca1827ee59576e 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_expand_records.html 32d794c5062193443aac5fc4ce7005924afcaeabc04569cbff35e29114b046f9 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_features.html 83dd8bcfe652af0e67dffef12228671ffb66de0ffa412ae726bfef28220ddc78 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_id_trans.html a490883d0f1c07a8100eb1969991f7ab3606491b14a5f92cef27f82301d343be 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_internal.html cd87bacf54af496955fbeca4887748538c0307572e22be1269e5abbda28d5292 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_lint.html 4b38b3c1171da7aecf75fa144a4d9704bb439861721ebbdaf949c204b1e74a7c 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_parse.html f55e1f81f615d0f872f64d50faabd6cf9a0e0bbdc4d207b271761cc4cb9daf1d 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_pp.html 761d143a7b06ed2f43931e5cf22a780c6bf7a935c877279cd39f945ebde41456 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_scan.html dc30404b3d7e0739d24ef534afb09e32b0d889e26146ac68ed101f9798340d75 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_tar.html b4c5fa4565b058aea7d5d5807326cdc6125479e7ada5ac44b8b8005d73924f5f 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/escript.html a8efb629f125354335efd328c00c1612f8246095e1917882fc24e5c6a6526ff2 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/ets.html 3cac80d29a0ed5e6aee7e0309c3ac0f0adb4c2a86889f4a177da14d9934dfd1a 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/file_sorter.html d5f8e7af664959576c180c7dcc051385dc269a8a0e8888ad2c102db2273327fc 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/filelib.html d21f6f7612c14f2bd08cf5dee4921cfd39a60fe17710253389b25bc2513c34c2 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/filename.html 4a70eddefbbf83e00728b206217fe3483047ca079c86afc1030e4b7a998e990f 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/gb_sets.html b83e0e121a8e083abc088dd2a03be036679685bd9f47585e3cb3a49ec6f44b3f 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/gb_trees.html 288545de41c159b97fa63c8578803ee57e1e64a1bbba471793b324869097b205 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/gen_event.html e07d2f0568fc22b4fc7a9ed8d315c5b62de7de65b2f711583f0a2509b3ff3608 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/gen_fsm.html f032461c4887851956f9d0651eeccead91d8ebdc38295ff9006fbba577ff74ab 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/gen_server.html 33293e5b8ec0f5d8b4bd515dc8b914a53b62f786ceedbd851377bb931f72bc89 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/gen_statem.html b96f05b3b2467c4538ef5c0ad6969b3b1113598f18ce44b683f716a39889f23c 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/edlin.html 7cfbfce258afd1d488cabc7e62716c46b8de20fc24362b466345d2780ccd617f 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/edlin_expand.html 929e2492a5c067ff687439deee55878db483cd09c54af5c2dda620d32b4b4e35 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/epp.html 46ff60299ad1d67891c9cd6a5c548140d871a1519878f0bb20c7c05f464a3a49 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_anno.html da27e8af677c84c440aff1fc04efc5047521bb46e70b490eed45979f4f9c6eb4 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_error.html 0816c3f6ab1184ad9ced8ce55087e55743744c4ac0e1aa6dedbd0089726deb8c 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_eval.html 6290cf703d70ec2aa8393227270dd21cd4c34b23259457371920b53f357f9616 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_expand_records.html 9f2f273e2ffc881c3b9239b5b7b681f2ac3bd94f24bf50c0d2ab006774cfab71 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_features.html 838deab51a2fcbd2ec738be7c8a0e3745a9d822ea279b5187ec657254fc124e3 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_id_trans.html 50297e7d663eb3c851fce1890e30b5c70ad82cbc1f00f9dd21745f47ec00dd6f 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_internal.html 9d6f36947dcd49729cebc1ce30bcfd506e00a4ed8e9f0f66e23dc5d3f59c2880 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_lint.html 716678222f998a44ee3a9492fc00b12386d472c590c63bc5eb70c1dc73b659ca 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_parse.html ad3bdada7850b813e4313b8ee4c5119817199880dfce2e7827e96ab7279d5dc5 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_pp.html 693a3bb396aa5c7ab2af27980496dcf5f794020b8ad6c665b335d21eea2ece0f 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_scan.html 78be7e28ea65934af0e16897e12f2960b48749ce963e973e74b08945c694b6ca 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_tar.html 5aa2ef571e6302909d9f8a15a5fd1c3af2ef3fa023754f8e73864680ef39aa8c 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/escript.html 1231cef7a2e64d05edacd1ebf006550640e1a55fc69dd9f6d359f00c84cc7331 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/ets.html 350443206541d86c37381bdfd9191c54653845821d5e985513fa6bc7321525ad 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/file_sorter.html c99adec96be1ca309ced96eb5e28a0b80458d3b3d6e2375374651de43e1f30fb 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/filelib.html 870bc0bc52903336b9bc8ab748332eee2153c762a838144e4cbbe407d0c13eb0 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/filename.html 3a569ba6c5498b4e9c0566a390d97b2c7ebdca2327001ba27ac52eb057ff3b7d 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/gb_sets.html a27e16ebbd050086216d8e80405c07027bff3a02604f89f75918baa4f6b8e47c 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/gb_trees.html fdf466b5ae5b08e76ef6f5a6725b6019a2e27dd73a9751b2c8de1e0bae26d86d 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/gen_event.html 058d08d12bdb786c49fb67d69f63d14b3e1c6754a9c30d2fa454b5efb18e69d4 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/gen_fsm.html 18021c24add225af8d8275e91060b361f95504c8e9dde64890cda8acc6001e36 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/gen_server.html f70affb1585110110ca37208b71c33316969db1bb47f2d682ff56e2fa29b4e25 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/gen_statem.html 761d3e9f34c91add45b5cce2cf7c47d337faad5b1ef0454e3284eb2e8602e3a5 2 @@ -4123,42 +4123,42 @@ -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/introduction.html 8a88613dfe0c09a71259ab05fb03992c35a11c4f33355d55a84db42cfed8fddb 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/io.html 07e5a466e4bdac2878204069eb9f365c99cf6f1ada80b86db74811421d75c867 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/io_lib.html d0c160e7786f664ed8fc7cc7660d9744031ad4b5e2456aea9be1c575e0384c03 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/io_protocol.html 938f7ef803ca3ff78299b31d1631c6bfe8c9d70ef65122d1d7fe0c2d54c6049f 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/json.html 737683f2f82ecab0e7485c8ae55b95bfbeecc90811b5aee0fc2e33fc34475c01 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/lists.html 560261d47e35f41d4cc5da9b98d18b256372f47cedfe9d1533556983d1e72528 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/log_mf_h.html b18e1c64d7a9e54ff3029e7b46612439fdd9e68e7ed930dcdddbea8cb7ccd3fc 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/maps.html 7a9999ba0224809d987aa350250adb989c77f2c590772da50c1cf64311716dde 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/math.html 552d763f16154e8d43e0d2a68198e9685ef2646b1cdc8aeea7cee3f150e12b83 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/ms_transform.html c81cad99bc16af175129dc8180720f518922c94391a2be1a7d6fff6551cae22a 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/notes.html 5253e4b989bd823377cf9fb9f8fcf9b7e06263c6f7585549f9552a56c65a4ef6 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/orddict.html 9cc644b29610e808f0707b0196cc75df300bcedd3fc937e1f56a928419573e7a 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/ordsets.html 7229f9166ec8b7d13f77f1bf5cc5d108a9af71e54b30ad1e491ec1d38eda88cc 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/peer.html dee1fd7a9429255baf7bedd2f8d00800968313bf768c3da9257bf647f00263cd 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/pool.html dd496ee489fa10bf49f668f097eb5dc61ac09ba0d2e5d40822de6369aa0bcf12 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/proc_lib.html adf5d3b78e92ef02b940f83fbbeeb8d487e9b75fe9195f960ff4ec0bb580fd45 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/proplists.html 8e9dfd8e90bddbf8f17f231abc6092e5b5885f1742eb293a232851fe124fdb59 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/qlc.html e05e166f3fc3b038c30bc64cf23b320c1d28db41240b796d5d56e3fda7b3cbfc 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/queue.html b2da6c586a03b97236fa174d1004645dc39497be0b6c9d69bd36013af7652b2f 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/rand.html 08679baf8ebe66f7510071e0b77e2d76d383ea9e08454d81f0b0f3b7c93f785e 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/random.html f394932fbed18e9e2468d61c4622c453688f2b49c6036c736716590fb33ab686 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/re.html 8c441967b74f3f58c1f0505c178bb0da0307d2d089af543d5365813d6c8a1fe8 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/search.html 2c49968b6632353792f733498857629571afe74533f1b8efb32a9eb9340edcea 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/sets.html d81d934ca38a417517aa6dfc593b051600f3327692809ee6e6fa8578a28cc8fb 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/shell.html 902eea920daf9e2a8f45b098e506f32688936214f039bd614d3868e5c59bf6eb 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/shell_default.html c8a9befe6555a354cc3a9c23748d1d24adcdf2e1df11298d6e0e0e47e88680a0 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/shell_docs.html f16132d648d8787e85608d92b2c6b6563442b607124515d1cef3f66fbae62b9b 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/slave.html f548ab90e5cd08622f911dc8862c1759c3b0d05d3e13bdd9ad7a8f1c40b1ffa5 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/sofs.html c1796c45606d0e3ca1f3f080b1e7421fe720484922c33bde563c1b17f54fda64 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub d87ad9f62d74420439e3dac97b1afa76d0d00027cd2e4dbd3442ac8265d7ca95 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib_app.html a1df67f0da279084b6dd45f302368ead2870cc63804ee1dd4d1b6c1c60ffac60 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/string.html 0a3c9f10d047773bbe8208db98292e7f75ae46f33a3ba3f1e28c518a074010c3 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/supervisor.html 7600377447afea436d20b2af862f6a99bb29d148fe5f12b5d1be1203e534b41d 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/supervisor_bridge.html 4c480d82b3f539394584b754f2d23c1ffce77f09bc70d119627e5527bd762e7e 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/sys.html a6032140b89a10ddf9c45681c50522720e6229700db092b801aa70082d11e89d 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/timer.html 0cc00e282091fa471a97745c801d270fa55bea53b1ec8bfcdecfdccf41ca81a7 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/unicode.html 54398d006ab06ea74efc3c79ebf0c7543f162894bed49b09d8cf1c54ad0f338d 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/unicode_usage.html bc88e8dd81e2908ebfe93d6a9818c4cd483b49bfbec615d3ce545bf4fe517479 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/uri_string.html 0b84ded717e4c24146775fde095bf57ad574b1d4c3987ae3462d73ff82575cff 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/uri_string_usage.html 888682ce2148bb24d8a89872975b2684f63e40e6b00982ed21147462efb4831e 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/win32reg.html 9bee5b01edb2e20fc5509e4a1fc311e3f988a931e86e6b69cf66500d242adcc2 2 -/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/zip.html 42b3bec9739cb6f2437643908c844d086c0c2ef9f7fd9c13085819dce06cff7d 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/introduction.html 5c696804114252ac1f77b2ca18fc31444a4d43489ae02397bf099134f33acd31 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/io.html 0f873cfcca6965f646fe4c6130e1f1b760ee54a18660d30b1254f3b5283af858 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/io_lib.html ab326f7d6bac593784506e7869e86d6d67eb10b237a9f8ad692ec98689ea3295 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/io_protocol.html 8863aa1f3e0943e96f24965c13f7ebb311235158594f2b6686af3c5117fb3190 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/json.html beeaa4824d630484f8eb3d4c3fb4f95dcc2db968d85203062f8673d0fbefde99 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/lists.html 2d9a261afbfa01f77fb7270e6100ace801fd7a429900db4ad348a42e11241ea9 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/log_mf_h.html be7b12aa4e63e851c16f08537cefcdb5efff5057272e80b783c21296d339e7ee 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/maps.html 20ba81240181e645511925d4f99d438eb74c6e63e5fd01181fb9ace95a068c88 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/math.html bcb9de983f3557eec9774b6f1f6286228fc5b9f1904542789c860653df4a8774 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/ms_transform.html 8f6d3fe9286b599b43f0f6baaeef8feb4e9989507b4ae5f51da9f25bcfcb23dc 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/notes.html b94e2db18c9fa66e63d50ccd17a1093bd9b3a638235c6a658160ef11403c4036 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/orddict.html 9a841ad87efc59ef4de4f6a6023641e4bab55514ca7bb1cdb91f8fac8b4f62d1 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/ordsets.html 7ee3083bd90ae36f412f00fb58a320c6ab846ad44ab9762703b1dc395d600221 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/peer.html 3bdab1788765d81fe8d6e98c6716ca4aa81769146483449c522b12c79a957758 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/pool.html 4c042a149800a7476937ba785da42d4befd429ba840fc86a3acdd4bb31cee87a 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/proc_lib.html 80bc7efd56f4c902cde10160a398ec8b762c395f58485ce75ec998c396dec1e8 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/proplists.html ee51edda5991cc874b660fe0853e3985f21b8b4fb38bc9bea509c9056e77a7d7 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/qlc.html f464682244fbdf97a1332dbfc551847a58a6634a55469176238e31eb72fb93a2 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/queue.html c9b4c6a72331071d22bfe4209f7a8f2c7422ba33af6e41840004ad6387007cc5 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/rand.html 026cc1df635c1aaefed744fccb54c39265ba31db3032ec465ee7622a663a2d9d 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/random.html 94a9b9646e506bcfce3e114011fcc4ddf84dd09ba44d2d96ed11f00b29ef9efc 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/re.html 170f77fe6834d143059405762a2b1fa2357ab9ecf458656034fda265041f2730 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/search.html 63559839c69b5872b26b529d3bc326211aaec39d7514a1b42aef0ff68125562e 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/sets.html 6a075d143d57cd08bf88bec20cf688aac61fb1745e2c91eb33637cb02a6af1bf 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/shell.html fb8df0ef1cbcf0fde8ec2bcc4b430bdc18d1277116b9c75933ddacad8e2a07d6 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/shell_default.html b298c83ad8dc76e37ac25c5fd664122acca46958a5a7113f57596422b78ff4d5 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/shell_docs.html 3d62ccbeb6c3bd1efa43aea7f21d9035e1943008c98aa0ab5f0dd7cfa059e99b 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/slave.html 744e65644ea17e1e8503660520628b4940a723c56cffb0e0ba784b6ed2244616 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/sofs.html bd755c70e9ffcffd38b014d690aa10bd993300d5f9715d9607c5c9eb1229f661 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub 5e5b08b839b2e5a2e6234cedb1429426d215cc7ade62b5973ef4fff652f5eff9 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib_app.html 8b16b2abe1092db7434a22b981e0d512808fb5213e4ec6f35219647ac8a95182 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/string.html 934e18d51658c7bade0d0390ae74f3ff4ca666552cf5fdaaf9cf8a0e41ce5bb1 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/supervisor.html 0e609e1fda5376ea13ad933f129d21814c8af78010f667f849f7646fe9522672 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/supervisor_bridge.html 410194fadebab22c7eba247171c4a8de1c8c1d2459c5582bae8cf26158ef23d1 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/sys.html 77b4fc2aafed4345ba1da52c30dd220b8c3981b9929842d2ae4aefd148302290 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/timer.html a2a3b378950d2acb021d93c31768835e150cc11e50b4b47d9ba313a8922c0995 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/unicode.html dd2e3ebcbce29554ffc312553ba51525d416fce008ceac68dcf246734a422460 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/unicode_usage.html 3f1a18d22ef76c02bcc8cdb21a2f58d53c4c6c4cce15f29dab55f98855bda65c 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/uri_string.html fb39b78d8cf2fdbe7591fbb147be92db1c4e692de190963d503898ca7c877bb3 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/uri_string_usage.html 9a2e1331dd747ed0a6b9317affe2ef833a826466d3ee2db71a0370be519cd2f2 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/win32reg.html 93581fba20af4a71f9416f03933eb65bce8629c0e6419332d9c781a71638dd54 2 +/usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/zip.html 8729ef559700167e5fd90710623376416bca6b2fecdbf70e76ae1fa38f0bef94 2 @@ -4168,2 +4168,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/404.html de824264181f2da96707e73f6c21d53bea54c8b322d161899817acf74ce07945 2 -/usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/api-reference.html 97b542a69d672a4e292772d1f537ad7841e12899fd5d83f19880ddcb36984012 2 +/usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/404.html 683900bcbb94492e6f98652e45522b4df8daa1b7ca7859805c510fda87f4e076 2 +/usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/api-reference.html f39e1a7eecbceef66578724d996a2d32576ab6b99874a923c10aedd2c90287c0 2 @@ -4173 +4173 @@ -/usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/chapter.html 4bac81a71e08fbeaf1aacf777b89890d41e4a9715ac61445be69bf276a80dfec 2 +/usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/chapter.html a8f22535c0ea4da05565b6f7f360f120706806731be1d95277eeac2990dd2077 2 @@ -4194,6 +4194,6 @@ -/usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/epp_dodger.html b59b40dfc95a36f0dc68720ae752ab1fc8b767202e78fe08493c9a5b079505c9 2 -/usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/erl_comment_scan.html 7884ce645000465820a7b6459db951ba4c716cd96da9d3b0d457238824cf9f1f 2 -/usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/erl_prettypr.html 4d32c58d52a243abfe1911a54f66b35c1d7c81078a109cef25b3550e6ded0f39 2 -/usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/erl_recomment.html 8423359f7b5e2d0d1c0c8a43a9dce8839fe123c0a9d8bcfea1aa5f82f774c85e 2 -/usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/erl_syntax.html 942705c662c536d4fe4d7759899c36a58ac71d1a83a7f151d3d2106b60d2a911 2 -/usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/erl_syntax_lib.html aa1b4a267613fe56f0374664f29a55233f6c0ef967c1ca2a32a32c822fe212f0 2 +/usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/epp_dodger.html c1ca8ab53ff904507600fe35492f56d1b8c921793e449f660f231f4929aa898d 2 +/usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/erl_comment_scan.html a3d2a63a0ff8c42dcdeee297216ea8e676b69a40c9c0c14cd4b5df76cc167be0 2 +/usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/erl_prettypr.html 54e172c8c2a8771e9f9f3902188da05a6b1fa70ead58bc98400d6d5d79012987 2 +/usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/erl_recomment.html 7f288198fbc2420c7107edb14b64e5419acd8272f041d697e4583666b6e891f5 2 +/usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/erl_syntax.html 224c093ed1f0a983f3ae9dc5dc598f3f2a89f748b18ea3b81864a973c66e8a7c 2 +/usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/erl_syntax_lib.html 060aeda1e309194b1fed41b3a5e866f8856627dfa1553c2be18059828c0fc5b0 2 @@ -4201,5 +4201,5 @@ -/usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/merl.html 013b662cabb5a804af2bd8cf4c8ed0919bb1ff89064790ce2b066cdaffc9e41a 2 -/usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/merl_transform.html 22b7410af081ffeb293b6f1f657bc792cafdc58270e420a6df2f7efcda4435f9 2 -/usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/notes.html 7d65bd82201295ed0e187b4677a4fa486926ec8d21e0b4714b8c38898b21d3d2 2 -/usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/prettypr.html 9e2f5357b06d56adc00b5efe271876ca80e7ab837d12836f98e14630d7e1a79d 2 -/usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/search.html 8eb41908d31736504f54e57d192e328de8d53b103b8a1909d23a5c3a768b73d8 2 +/usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/merl.html 9614586098ffb5b0924a0574c578a3cabfa1b955cfb3b6c90205a4d38aed7a1f 2 +/usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/merl_transform.html 76a7e9dde3deb86a769d8cb7f90f83bb27f936f5d7542f32d4ff6ecf33c79b2b 2 +/usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/notes.html b3b2c80954da4758f014c71ed61458e6fd343b1a8db229d1144f4a0611004163 2 +/usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/prettypr.html 963513a81b3c42bc6224d317e1f4dd722b2d80edf308941e62974c493b0d56fc 2 +/usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/search.html 3f38e0f27da3376a5ff06c5bff97eab068fe4ccc2528679cfc2aa382fed0d489 2 @@ -4209,2 +4209,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/404.html 3194b8ec049944de9a3cb4e255838fc1e2c90ba6cc6dbb49b4b8c937fb21f1a6 2 -/usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/api-reference.html ad67dffde540e7566689e914a292d1ae36e9766169c8564a6548a2521b93c287 2 +/usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/404.html edaa1c5a2da0f61f6a0ff948bd491db7f70fce46b8765707f043be5e8a170656 2 +/usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/api-reference.html fd924bac34b5a04672ffbcce5c4e2507cd3ea6e859a33b0eeb369e5ca36d5429 2 @@ -4231 +4231 @@ -/usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/dist/search_data-486AE036.js 99fc67b39440e82ef3acb91476fab7db7e1550723c7ffc35a6851d3c15759517 2 +/usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/dist/search_data-9671378E.js 9279d2bd5f33939bceb2e164660ae04faa53ab88aeea7f5fb1c23132903e9b82 2 @@ -4233 +4233 @@ -/usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/getting_started.html 1a762b51867f7a94d4195ceba4f93d9b6cd898ea17968c29313a5fd4eb0bf9b2 2 +/usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/getting_started.html 3d1b08117424a0d610a34a82693ed5d4bfb3a9823f8c095fb398b93b94207612 2 @@ -4235,6 +4235,6 @@ -/usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/introduction.html 4905d88b5a19f8f2ec7f73cae39134542efc9c503c0367c5bb1735f86b373406 2 -/usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/notes.html 92191c76dbbad4f2a6a543463ff28e0f903ec9e70d7e6effb2ab1e4d095ce4d7 2 -/usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/search.html fe3307b07224b28a69cff96b202d089bf094605bd05f980d5438d9647363fb32 2 -/usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/tftp.epub 557c96714b19fea424116a564d07fb82a479c5a256a2450a419e7d03c38d441a 2 -/usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/tftp.html bd14b4efabc619d2fdd19d3052857e84df53608c0a54c21698cbdfde92c70d61 2 -/usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/tftp_logger.html 5c0b49a1f201a3403415dbc1e5d0b01d0975d48e2ced70f52965214a2dd621d7 2 +/usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/introduction.html 628bdde711783d0d2c5c06c19aed7d09e010c07f853f6323443f1644ede021a2 2 +/usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/notes.html 5e72c7044aed971b0be05be6c26ba168d73f491046976d5068b9b7b26b671c5a 2 +/usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/search.html f5a919e50cf14f05a23b7c374d65620d65e5f72dd069907e6c2397becef16e00 2 +/usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/tftp.epub b2888839b87965866dede2dd132c209eddca224094f379dea1860c2c1914cf3b 2 +/usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/tftp.html 323c6b01218094eb15d14dedbb13a1fbbdc0feafeb12e95869e47d0d546c3bfb 2 +/usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/tftp_logger.html 1b2481a22f9e81ff32efbf0ad1c41083f3ee4a46c69b8d714a52375af7c46198 2 @@ -4244,2 +4244,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/404.html 919ac422cd817c37ebc7353e77ae97a8af1bdad6d6817cb38f2e3cf3da19d3aa 2 -/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/api-reference.html 7e071cbf87a9ad0347024e965aaa4523001b5bf3e64d4b02121b7c42e0dacd4d 2 +/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/404.html e957f821674fb77bed7f7ae36059d2981a261044abd3decdec2bd8f035cbf7ce 2 +/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/api-reference.html 3773edb5b696a472b2931c4aa77389fe822d846c7c88b3cf4534c8de89596587 2 @@ -4250,4 +4250,4 @@ -/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/cover.html 8e4abf556465b87c9b3bb3a6b89c00adcf043ce1634b40a6e29f32abbe6d218e 2 -/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/cover_chapter.html e241015947f2f692c8a0fa49cef7c806434f638777e6f06e6611259329d884c3 2 -/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/cprof.html a3013a136257845ccbb2a9aeab080ca685a02ab3c0a01a5964fb20abec8045b5 2 -/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/cprof_chapter.html 199fb29e058eb6fc165a4a42ae1740db1b60afebc4c1c065000cd13919b1b9cb 2 +/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/cover.html c924024d6ce0ad17b17cbe3058ded705509b464a3d6e23622c117208a634774f 2 +/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/cover_chapter.html 559b5f8c1a9e784930d56b318ab7834b397c5b2e517778ea7ba503b545e9b2a1 2 +/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/cprof.html cd0adb045f5cb912e0b87aa047802c211568095b58f112638ee4450ae5724736 2 +/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/cprof_chapter.html 5fb6d3a409a8f991c370169e6da2d32d3c393c5d1c5f144cb4cc6049fdfce9fd 2 @@ -4272 +4272 @@ -/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/dist/search_data-FCB758A3.js c2423312684de5d64566414a566ddc5b1f67453c95f5a9b4ef17debd430a01ed 2 +/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/dist/search_data-C30560BD.js 803e8630a3d30329dbdc4e9739b5c67d7c3b571c001144f03e0d3dab89d98d2a 2 @@ -4274,5 +4274,5 @@ -/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/eprof.html ed0ea63830eae5f53be09529c1f0545284664e2381044c61ce7aca0776e9b985 2 -/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/erlang-el.html d99f383ec16868821dbe979fc47792eb8833468290543a27e95c4c16036067dc 2 -/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/erlang_mode_chapter.html b31b219e3bf22ff8090750c086d659a4d406d460299196b2564d82decaebfd9c 2 -/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/fprof.html 3b6d6d3d53c052617cd50e76101988e0f7f177bf58ca935ca7123bba5c0441b6 2 -/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/fprof_chapter.html 84125bf01c957862386223de15a99d563b73ce5f931803bf3daa6a7d75aa4247 2 +/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/eprof.html da06eb9c7a72deb2cecc3b64f0cc4ef3dab06e3ebac001e77e24cdde1dad5664 2 +/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/erlang-el.html 484cc305e5672a2427e297f87e092f3c908e587cdf3d85d46abfb8aa25803ce4 2 +/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/erlang_mode_chapter.html a15630315b1c6618db519bb2ab262021b7db899dda5f9ce7de9272a41a54a48b 2 +/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/fprof.html a050f3c88449f4091dbb7d759d4dd54b47acbeb1c2b57a8334d560d9537c9ffa 2 +/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/fprof_chapter.html 9402446c76e4b8f52d29f0c4ca77451eacb4a8faf831889c793d89b9a6be39d8 2 @@ -4280,10 +4280,10 @@ -/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/lcnt.html 4831b05381c815991035965df07a18369d3dafe80f206a4eb3a94fc50db51fef 2 -/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/lcnt_chapter.html d46768775a7b7c4dfb3eeaa18dfd35a8d07fcd9442caf945315dcce04fc3d40b 2 -/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/make.html 08cc0b9602ee7b9c500e74e94760705c59f0e294ebe58d7e345779514b440826 2 -/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/notes.html ab05402f010097e19802c41dfc8e826b18abc83a1712c84a7ea0743105cf2e5e 2 -/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/search.html 597998d77e0b2fee8d526fddd6c8cbacde91d302d015e7f3d2332af3f071745e 2 -/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tags.html c81e64051e49242800bbced30c2d520437587fda9a8c84470de3fc7417c2c1dc 2 -/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub a638dbae9dccda2bdf6ee6270e972a4d4910785a087588a8ea98e198d3c9c637 2 -/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tprof.html de6b572847ed76400bbfc0bb5dbf263dbefa28c5acf5bcd3f72a41eb94136957 2 -/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/xref.html 5882b31e1b1ee4bb9b5e36c0a8414ae5a54d2e65662e919b612e8a82b1417d4e 2 -/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/xref_chapter.html cb0efa1454deca73ed3ea705bf4eec74a1a922113aaaacd82e52a57c9b4c5eeb 2 +/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/lcnt.html 3b2daf054f0040889ddc968a3789026378c7c6fecc507d56244525b1424b2971 2 +/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/lcnt_chapter.html 34863d230b1a23088d015513a684461f71737a285b1b029cceae649eec572519 2 +/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/make.html 10450e3be05058859e5e9e9f3e5dcd6cf949acaff7afa1929efa0ab245cce89f 2 +/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/notes.html cf3fbc5c5a5ca570d1b89c17ed7e78cb21775bc522566dc9041f83b5149ba724 2 +/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/search.html 8fdf81845ce20a09b35803cfd4c9c2489053f6998bdee98594525f89083bbc33 2 +/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tags.html f678b248f8849460668f48ee91861bfc1cf9d92cd9b3b2692ea83edf18146e01 2 +/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub 02b2db575c6c8728a6762353fea2ed6e1679c61c520448d1727e3a565ae3ec11 2 +/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tprof.html 7f5b43ba48c3229cf90890a88b38b9335ea8dda2a0d0622605f7ca319373c04f 2 +/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/xref.html 561134afde2d90b0b8fdab29f114a13e619003536a71d596601c30f401e78934 2 +/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/xref_chapter.html b9c9ab06162d55b6432ab785dd4257a68a26d050145db8ce4fc52ea65e4bb21d 2 @@ -4293,2 +4293,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/404.html 24663de58c9e64dcf3580235c05032ff6e89864e166e0c3e3853a1b573c2d638 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/api-reference.html 00f872fc42bc9bbadbe58dfac829f80bbd30af2574bdbbd02b460c8dda971a6f 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/404.html f348230c96f06b029d1bc57faa1d7eaa6bdfe898647639d28ac860ac06fe3d91 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/api-reference.html c7521f5562c2943f8242a51f7223e52f84ed2a948c04533d946089cfb3fa704b 2 @@ -4297 +4297 @@ -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/chapter.html fcd9fa21c4484966d0f9653440e8606b08284d4fa5f0f172aa1f29a5a8b11e2d 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/chapter.html 5dcb236eb62103f3af59e26acada339a3d51f9821a12ec8cb267fc5e89a72409 2 @@ -4318,2 +4318,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/gl.html e5a031128041edef78887aa8368568b9543ed4d920edadf9753be201072e9045 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/glu.html a24e40f040d357ee98e6f51e10a05e774e8f63bae06f9fdb8605ca723e496567 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/gl.html 4014ca183a79a51c28d2f95c13095a7ec30958a8b9ae86cbc735c2e570c749d6 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/glu.html 0276d14540192d9a6fec596e8cc001a3c929b1ced6a648af3b83f331a527f265 2 @@ -4321,239 +4321,239 @@ -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/notes.html 306275d3bde9c2de853fe1b6a6f7940c1560d7a227ae20a4196a97109181767a 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/search.html feb67a8c395e3604b551438d5bbde24dadb9674505dc4057ab71904b63346ee7 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wx.epub 025c03d7e226ce5177d599d7e7b7f398dd9efa45f4295250541641b7ff5444dc 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wx.html 390e8e1b999eb87c6fb5671156dda88924fc763865b776948bd2801b9ae5e41d 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAcceleratorEntry.html c87fe288b27c9769efbc355166e295dddb967d62073f0683fad1ebb6dab3322e 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAcceleratorTable.html c9f1bc73b83c27700064945922938fbe808319e8ea249e53e9b0f7e6b3f93da9 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxActivateEvent.html 37d4d5723f466c80ea4775ecac23f855837cf81f7cb6c3a13769237d057a2df9 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxArtProvider.html 06f0e05fcdbabaae0ff752cd417c16763b4eabd59c17d187f3a99fb72197cdc8 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiDockArt.html 491ad4e42ccc17e5c3aa325635b58618d6ef3d0f2fa0c2321c27a7749fb0e212 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiManager.html 194bf33d12c56080bc457ed8f5322a8462b7500339bdfc96c42df2f2bd356453 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiManagerEvent.html 91cccbd2d962768eb0dd32b2db90d30c60efd4264da97c9c27cf403c96c8e4a6 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiNotebook.html ca756e56766c4afcf1f653001e14605c33be7b88c961c76d8dbe91f3aa2cd4d5 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiNotebookEvent.html 6698a9b787dc23f123da2210c94afa04d82a3ae6ed601a7d77eb36f85f1b57af 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiPaneInfo.html f2bda4bc165380acbf5418ce00d6f28750e309e40760a6ba6508b6996031c2fb 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiSimpleTabArt.html dad6dc365fae15364fec4f416246e266ef6b8ff0952a225d45b13c45ae46f5db 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiTabArt.html 41e2c3afe60907d5cd2b339b3dc08e9bf4da6d75ab85e90cddaaf1209608ad34 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBitmap.html fabae1dc65682804ce6c0afa0c3a00b8af5c2031b22ce8000e3fa16ba736e84d 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBitmapButton.html 3fc2093c5fe27ce7a4aa9d5faeae280b1f352e92f511069993b83def42397d1f 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBitmapDataObject.html bd6df5e7498ebcc8e6c733cba909881554124b8cf68017e18dda4b1183820dcd 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBookCtrlBase.html 686e8d395fab064d43a66e6a919e4fbb96f137659e6dc6b0c12fd184a3f79e8f 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBookCtrlEvent.html 5f8930e12d22882cdc6c2c558e1bd77c898c800e8974ec7d0ca59e9fc4634bbb 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBoxSizer.html b9c6970d4a5abf486c0ede7fd78922d912518c5fa11be02d18fc5fec9c6f2955 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBrush.html 50cdf3b63af6dda0db28896d7950b4efb8739b0945f8fefd02302111e1a9b363 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBufferedDC.html 11f95c97a15dabc0b6e21db0166612e1b8eb9cbf1bdb26b93d1b3f519849d066 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBufferedPaintDC.html 81dd6ba8ecea6ffe15a8c826dcc3de67ccbf3d0d54ee315f09fb83365b8cfa98 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxButton.html eaafcc44531d9ea068377d273552369105cbaf070e02aa785e8ebd7960b8a801 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCalendarCtrl.html d935a99f374abebb6e3dd74a4f96b929e81baa4a9197990b33e34083159b064a 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCalendarDateAttr.html c11a9c925f0aa00d83db58974274590ba3df9376111498fa17bd64be0ce55e14 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCalendarEvent.html 5f6e51eba9c43c007ceb57e37183b5816285eac0db96b38ce8abfd66f31a8eac 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCaret.html 59df42ca601e2724beb042a471d854951cbed90186c83fcf6c653c42dd240807 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCheckBox.html 77f82f063ea952ab0e940a3ec530fd00c45b797dff2cfe2b08f26584e710a11e 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCheckListBox.html 993f51a5dbe77b688eabd32c0594e05a7c934157e21d8f28c93537943cd246d0 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxChildFocusEvent.html 273a9f5ac8cf8e8949320b84b3b0afe9b5eb3474feb340a0cfa7eeb8aaee807f 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxChoice.html 575c00e0cdba0303d5c9cab9a45217239fe47660139c177164321bb204567f26 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxChoicebook.html b449e4df4d66396f2a826b2e28438332ad3a8380073f2573eaa43a4568e7fd8f 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxClientDC.html 398176195ebecc7d31bed3707881ed6dfd61ffa72fd241438b8dce20ed82dd9d 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxClipboard.html 80245dabce7b83a8b5141377ce0005dbb84fca2b99f590dab60d30265022cb1e 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxClipboardTextEvent.html ed3a2610f3e3ae44e167adfd0f72302b498737b309d862cb1fcfdb337e8f8ee4 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCloseEvent.html a230b343799f0d77ddebc7d2d03601952fd012f6e6afcaa3d4a9efbbc696c88a 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxColourData.html 6ecc3b2ce9990b9bf8cc5aad50f9226da0e6687f46cdd0109f92f966292b5d0f 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxColourDialog.html 368b45605bdf9906f2c4fe725db466e3099c4bcced3e182063f9d21226680bf5 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxColourPickerCtrl.html a37b473621eeeae7516ff72cd9890b2344c08e866f01fdcd2101e4cf086d3ba4 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxColourPickerEvent.html 77a6aa41b74cf59c075d6699b78e957febc9ab3dee858e500942d2310b9f0ebe 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxComboBox.html deec94f1fe7cfe5852d412b569a708344603007c0c241aac42cef333291b1762 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCommandEvent.html f80ae86aaf371c967341c19858e926f39488e0b6aabb055c64fce6d60ac7ac8a 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxContextMenuEvent.html a13965c722804ae7dad0c9c109b3c2b4b90f5644941a483be46de0915a259a7c 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxControl.html 905fac4b9a92d800157d130baca157c3c6113fc0565450eb52e4712e1716c52f 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxControlWithItems.html 323b8fdae6bb242d06d5c31bf802299545b737a7beda1c640c2dab7d9b7116f0 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCursor.html 700c045e3601b3f6ddae8b4ae642efaea20cad87995d5ccee97f8a933fdc8656 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDC.html f05018516088dc54cef91f576ec59fb71e5de271039b05ee0a8c041bbebdf6f3 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDCOverlay.html bf319686a9664cec6a75d3594b6a6e186cd9ed32dfeae56a8c0ed04d60003851 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDataObject.html 3ac265d3d20a8adf449e3b43a8332ef9404be28649a93b290c89bb4a960d3f83 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDateEvent.html 3e55420ef479873d75de6fa3dda8c8581609068bb80f3452073fc4306d889f3f 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDatePickerCtrl.html 6207bc7031f892cdc0f11ed10b806e8a4dc0b3a798608c9cdf508a5ec2400458 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDialog.html c1682876edabb3d9d9d60b5f04804fe5200bc708a38071f6efc4f83458e33d27 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDirDialog.html b74f13d61cdf7c3930645a77a963697cddb71a7e81565cd87a50033031a78bad 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDirPickerCtrl.html 32b077b97e3ec1be3d3174d927a1b6ba116e84c8d0abde212cc22bdfd0b67905 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDisplay.html 54f36c81f04cc7c52dc47786c8a6ef09265e8228c8011b8030466bd3804522c7 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDisplayChangedEvent.html 1d65e8b9a44f9c5efc8eaa91e1352962d507e37c96a64ce1829b7b170eacd23b 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDropFilesEvent.html 90162ad34189cd674d1eea8429f2ee930c01b9d94921968acaec5f7ff5905576 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxEraseEvent.html 6013bcc19544c1c6dd8750502ef8e57f7032736f891499ff6f414b5b8ef45d3d 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxEvent.html 79be35023c9b5d0d6387a85d9162f37371ea16a6242e524cb5d43f51ea4b72fc 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxEvtHandler.html 2f4edd59b446b3289ad5bdcab866a271d9287620e992d1c8fddabf82e9688fe2 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFileDataObject.html d74336080070175e872105287b20487290b50a2ce7c3b1f5eff6dba3bd6766de 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFileDialog.html c276bb402d0a7d1b7cc75796f377565c5b39b9a1f161624de5a555af2b18b588 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFileDirPickerEvent.html d95a464c451108f0781f0d1a07819832d48480151a495881805cf3998057e070 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFilePickerCtrl.html 2944e449b811dcbc149a4aef7ae53edbf4c214068849705193410f217fb35df0 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFindReplaceData.html d01a6d8a292466793aa213474c60d9a26c5f8956d4365703fe00f65129913752 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFindReplaceDialog.html 25e0d1904dab80501d374e00398dfd56bf969621bf85249925addd24affc54d1 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFlexGridSizer.html ebffa1bfd007428d47490ffcfa8e49a1f1380d8589d3195b2a867e120cdfb68e 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFocusEvent.html ad45a816fd7be23b916ab5e774bed67c8f53fe44700e17eb7ab2d84b1df7ec1a 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFont.html 353649b281ab42727ac2ac15eed34c3267e23b7c4325d7bb7222ba508c16410a 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFontData.html 093aa8101d0a2502087362774d74a342041b4bb7950c023d85a4d79dc60e442a 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFontDialog.html 98619d4ce777825c146e0e25c18eb669fdeb138cfb1a9aab8a86dd171d766220 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFontPickerCtrl.html 986a12f533f22d82648dff0785501930e8cdeacafd5d058f26b8a12d39731919 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFontPickerEvent.html 862c402395c3ce3020ed48cedc823a76c70c4ecbcd32e3e66df1734379122623 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFrame.html 9f2e6832df57af68aa3a54cdef63e5789a4a663e788a25b5b0781557e9711abe 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGBSizerItem.html a67c19a01020f71f4b57ece64a7da90df834db143f0acf4b9e30c18012b49d99 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGCDC.html e0fd2bf617a812f97bb237248cf456323c77eddbf6e3e6e9f8eb3faa09d27447 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGLCanvas.html 6aaf0b046ede7f0b3292efa4c312ba79b1c2411bdbb5417ffdc319c90acae591 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGLContext.html 17c29b4b3f0cfff16ee4b9e4113df3fe997237c254f6fd17934eae90573c3946 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGauge.html 9a15a342a1aab7d0ef4ab77c9bcb14cf32c69ad66d7b5682964322affe90764f 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGenericDirCtrl.html 830f26a379bb125a0525e99e37ee9aa767bcac5d0a5f517e9a269fac532148f7 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsBrush.html c81e31997bd734a205572fc646fcf6c80de6c866837275353cb69e06bb6f5af8 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsContext.html 86782da60f9eb1f0ca69ec156498b47e7bb09349b5a153494bea6576ef241598 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsFont.html 4869a5aa4e13144ba17ac8d6ec1dfce1f7d692f1dcf1f1120baef184cded1b3f 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsGradientStops.html 930cc04f355361e985aea4d972d1c4a7ea1caa723f640c86d3f748b996ec58f3 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsMatrix.html 6d5e5db44d4b4ccbed49cc9e72c0c4d7d94c1b9c6f288f2bb054fa5c1ca1f1d5 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsObject.html cf307a033bfb52fa63251f409eca45390d903cc99e22d1eef3a51e513ee0ffcc 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsPath.html f1ae81ea9ab5e76612477ae5ebd2bcd9ca811d4be64da01a80f996b2d907fc8f 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsPen.html 04bf27e0d31e9b20cbc1e1f07c151800e0d43272e7f0131a3a85b1c4e645a8f1 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsRenderer.html 98a95c59bff0c01a49d2ff6581903c14e42f45cd526e2cc2b4fb3e8dfca2b7ea 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGrid.html ae2c5b2306097713b77d43d2d9dbacf2d84eb1c70eed7054f660d696d4f8237b 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridBagSizer.html f34c0762fb7e2216c95147c3206cb7ddf5614ef445a3d5c13414cc0683dbf5c8 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellAttr.html 01c27d79f0d7b72fd7cac0cd20ddbdb1eac2ccd7fa6c0a319722cc1580a2ee9d 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellBoolEditor.html 4197e962be38db57782cb6bb889826a58ae19210c30022afee5f45dfca2f8c66 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellBoolRenderer.html 8bedf153b173b67246841dd3bf5d98a3562601c560ba4fc2e9a56b7399dffbca 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellChoiceEditor.html 4d11a52c1c6acb8341826e66d79d6640181377e798f44f26ab7c53086e40948a 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellEditor.html c023d83bbe887494ad8778b80c21c6d375127c051ea94aaaa0a1b1203d556b47 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellFloatEditor.html eb4f078ec6aee94c3d5f349811a2d8546e0553cde45fdf8a5ed83e43b5c24aae 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellFloatRenderer.html 188a3bc87c8a589c06d92107c0d5cc8e9457660496090f8906374d0ec852b1f6 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellNumberEditor.html 30bc409fb1536593ef7147b7d2893fb4a4b64feede9a963435228a4104ca204d 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellNumberRenderer.html e925dbb18ab06769dbbbaac7ccde60e20b58d7dfb8a9643e501366b27f0018e0 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellRenderer.html f2b7f3c21ab203dd4239a66f674333ee5ff4be123e697efdd41176cb207fd834 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellStringRenderer.html 59c1c232991393ec2094884be8abfdf1e40518c4431c5d6e4a543547537f64e3 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellTextEditor.html ce750bcf673fc672055b21a1b182e0d7e95e66e11b3cd64c11fd67b938d05cde 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridEvent.html 09b2a4feb04cb89a573c5d7584c38dadd7d2875c65aaf0b0c01d06505b1bc379 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridSizer.html 5bb3c0deb507c62820d4cd3bee2722c531ea4b0d62779aba44f13074989763af 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxHelpEvent.html f736df1530dd3e47904e5f1f830839f3e9cee17264fcef0bd93aa0b4b90f3578 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxHtmlEasyPrinting.html 350c13df702f9e26cfc860aa9ad4aa0835c220815b22cd19a8eceed429dacbf4 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxHtmlLinkEvent.html 30f9bc7ef5fd8c45c1530b753f36228b51c1c8318725be82662b9f817e4f2c9f 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxHtmlWindow.html 3bafe3602268d02614142e03ffdf3d903e93fe69cd8d4beff095d4720233efaf 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxIcon.html b528acd56fa709d9970a4800cae3b50a001c9fe3f4a7a22991ba501c5b6a4189 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxIconBundle.html fb66e8e493d0567c7eae3a0c5c037abc8fa2aa6215a7c41a199c8d3e00588234 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxIconizeEvent.html 745a292d45564c13aa176d2e23e33aa69dec07d8e31f61b4c51d03c8b6ce8913 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxIdleEvent.html 47dbf3189d56190fb414f11300e136cef9c39b214050de1e0b6f879d00d71163 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxImage.html 922c3bc2f69ecd5258b0cb93e67800055d18896db2f2b0e65d4128650680b1bb 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxImageList.html a872da2921e740e6f9ebf1ece5a313dc251755bf916c949958283b7272a8d652 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxInitDialogEvent.html 7aef77c8e20b9bbeca28eb8d93572cd2f22e4ca04c373d4cd31c351486ad3b9a 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxJoystickEvent.html dc89695e2fd8ed738e229caad54326e489cfdb6caa48a682c0d7d7c4909dfe3a 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxKeyEvent.html 63cab58c480b863a50e5fb869a820d0700849dfce655a3f4f09f2b87375ada87 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxLayoutAlgorithm.html acd7e7e68beb1f2403839bc3649e3c95d0ceff84415bb1e9b94038414779c106 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxListBox.html 373a5cc78e82c560958cbe864c42fdd63563c20e70230683d19ae25e229a2f3d 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxListCtrl.html 61a123544aa3e4519805e38df2a2a9ffbf3bfffe6cf9b0bb26eafd4e16a8495f 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxListEvent.html 9b58f012b5eafdd01d8a745092b21bbcf3977b68cbaff7e7d2cd48538c06cd3b 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxListItem.html b03c8989b2d81557455de467b8ededd1f5cd86b369a5f549f53981f606b3de4e 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxListItemAttr.html d4d9ca9c55ec024631d709f6bed2c24622d6d3d675840250085f4a8724e31598 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxListView.html ee6535ac6690a4b5fc5662ab63d3ee3ead566c68b6c14d27872e515c4f515eff 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxListbook.html 2a1eaed10154dea81c76ad5013b3947216e55ecffd57574f201ce48b503e9a3c 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxLocale.html 9a1d04c9452c89525459d66e87c9b755de5ae0e51a0b2c3397545041cb7f8421 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxLogNull.html 52a0895ee8ddaf3bc4f9ba43fb1d44be0f10fd6c83c597638964ae89d07750c3 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMDIChildFrame.html 9ee8d44b85fcc7d26e4b4e3661f5f340bbd8d5488b2fa1f03519bb90d8e897dd 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMDIClientWindow.html d4ce15cc7052b28fc88c353f625cfd8c78879faf1bb83f6132ca302577f8fab1 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMDIParentFrame.html eb6f47e323e56e11f7de7f8f07bb1bcdeb19071191b5d0f04b2ec23f04523c1f 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMask.html 2f833e239f1c241e3fe2efbffac046bc3a8eb26fbcde5e05c9f8d2f215f618a2 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMaximizeEvent.html dbe8af65655922baa6428a8656ac78a6d7d7db76ae26a13d238a6926334f6916 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMemoryDC.html ece19f0f101f7df67456d49b308cf33906c4a744d5a4f9c6bea1a388419d6d69 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMenu.html 7fd2f5e34b345692b2af40cb74632762d093cda02c9a8bfa8b072972340d587a 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMenuBar.html 932953cd91efaf395609afc8dc223e9458cffe9f8634275d5031504d6d324721 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMenuEvent.html a871424d66662faa9dbfa74cd3ae8e8cf2c7c2f507f2ef58edb4569d6b99e992 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMenuItem.html 0f961d1f4e1a87ef2700dca9a20ae2fa6ea19cfe3e8b2796aa70117d57488f37 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMessageDialog.html fa322006bfab8c79d79207d9540cdac54438edf07a2aff3417ecb033c1647c2b 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMiniFrame.html a4a5767d30be2f05ecbf89b118e617909b31bd65bf69714710ed144311d73dec 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMirrorDC.html d3e10ff877703af91cd8f159acd640c3bec70fca6cfc064c189c5aad93f3f6a4 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMouseCaptureChangedEvent.html 06f03e17d7d05acb3f498080094f6eddcd4ac8e40acfa7d90ebf94a871b700d1 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMouseCaptureLostEvent.html 7e7e18ce8d7e3d296b671bb003c39c13ba071417b42ae6349bba579cd5bbca34 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMouseEvent.html 617055203b68e410a51a6fb16da8e0b95c112511732d24a3ab08a4b3a7e036e3 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMoveEvent.html 66b9920c25ab5c2defbaac03030d262d90816512f9339a89cad2db95fe17f7e1 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMultiChoiceDialog.html a3bd04133ed7237cd485fa756647bc7c6a7ca1c5e401fb9cecf31e338c522bc4 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxNavigationKeyEvent.html 0a8b461f6a650c320a57ee053777313736fb0b9479bf8b49fae5f7887f6647b6 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxNotebook.html 106dca8b9403b14b2f75290effaa9a0c03d4b5f12b3f9fbcd286aa5ac87147d9 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxNotificationMessage.html 513f45ebaa21d0982a626db229f2708e2f5569a32240121ba55bb54446859601 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxNotifyEvent.html d317ba5792ca1c80ed79195ab8042dbbeae3c0120a2951b86ae3d86924ed964e 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxOverlay.html f0501499fc7777ca75b5dc37869a0f51660fd943131a28b3e959b659297e72f4 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPageSetupDialog.html 60381e1949970a9efaf1d5b11614bb1514a275fd5418cd16689a859402b366fe 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPageSetupDialogData.html 83f1b85490384c014ee5a9f4b77c9bb1fd9a78b537e4eb20a3cc39709108205b 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPaintDC.html 64f87795d53c647be6e88c5b803cf15f058b549626e672bdf7e3ee7800fd4e89 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPaintEvent.html db7bdfb3ea431ccd940a743d89603bf9b99bb5863ab569f68a2e267ba006f4b5 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPalette.html b3a897655aa1b23cda6d6e72a78cf168c7866b182c119f4cf73a7e852ad3e40f 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPaletteChangedEvent.html 2471cd0e1d096847c1912494b17c46237b602029e9de8484567e4ebd87fbbb3b 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPanel.html 8130a5af28d76b5f7df1cc13214187a8198cc72281a4aa320642df935d908d36 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPasswordEntryDialog.html b71bc291fd8bc181abcc8964f0f3910b249b7a69e566a114d5bb7ccfe9c9dc85 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPen.html 182a372bee84a70331ed594c00477cf963a6d5ef2f2f46b40fbb49c4018b2e9e 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPickerBase.html 4fc5923c44d83c8910c7aa2c5219c91c89c1f392473a33650be8c75cbdb4d5f1 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPopupTransientWindow.html 1c3efa731b83b0f08c4379eec790804a242c2ae8e1d2a9af92a249b99d59cfd8 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPopupWindow.html 6c4d4786ca79c4c7995bc87cfa9135c83e5a2b1db5cecfe2784a2a3d232549a3 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPostScriptDC.html 9be2ed9b2e03f8dc36b8a45fc7f668281d73619ed1d057c5d93c4ebe0fb7f831 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPreviewCanvas.html 2eeebfb75dc917f1eba2875a5a80c7122ac86aa06867567b9bcc2702e11a04f0 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPreviewControlBar.html b3d96b7d4f1cf5849f73ba329f17bfeb6238ca3d01fe42d418cea35da142e6d7 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPreviewFrame.html edc585198329b80f93a086cac3b3f06574114fa94baae7794d46a609fe06dedb 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPrintData.html bb2a20a1d92f83fa605d28b36fa9a4c04f0908ad5c578db3a42fa013b3568f54 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPrintDialog.html d254d9349d83ea8bd91f1703873b494ad6844d50bfa524332f11e008cd27b07a 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPrintDialogData.html cfd406f820339fc87a9045244897151d7fe0cd874e659810fea87c2e0355198e 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPrintPreview.html 419fc6d15927853f134b082ce5ff7e1312e2b554879355a64566b01905bc5b2c 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPrinter.html 8132e18b76275f3c17c1c06854267baf25e9bd370b54ea9ce777818ff7eb45a1 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPrintout.html 133ab35bf0f1c281131668fcbfe766bd32fcf8fc3938437c04b5d80ad13e5ad3 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxProgressDialog.html 792da2643ebc4080bfa6d633c55391b393a11114e9f5da621ed5f7c6adc3c764 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxQueryNewPaletteEvent.html 19e5aca33677d8af91f1c161863d0658c8ff53202e8003f0eb96c2721cc25af8 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxRadioBox.html e4f63a6f98053eadea5ee50eab9600e24133f9334d4ff09eb843996fb1084f23 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxRadioButton.html 4f13d3b39cbb9b0dbb30a9268874f919d7192f0b9132d5bcc62269e4ed0d6d84 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxRegion.html 88fd1fbba3f90d77aab65d1eeafda07cfaa07b58cd82cc3a2200fd28659c097a 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSashEvent.html fa866b93a228c204839e8480f342266eea6ad37f836c7c5595a6d83add7189fd 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSashLayoutWindow.html 43e801d79804c5749fd13841ec38540b229b9b6f91c8ec5ab41e087389a27163 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSashWindow.html c8c3a19886574f48f3a61c6e9d92f49a3408c0f58f5724aae9da4efd0c02f44d 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxScreenDC.html 1340f45be4dd4bce573195ff428fee34407ae49fddac1ed9bd16253bf2bf51ae 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxScrollBar.html dc6af815837c353e3b4a15b422f69342552707e90e0531ae02f6abe0b92c4840 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxScrollEvent.html 3cc50f651957323034bda4731fd3f916fc1f829ca1518b640af62066c3c0a18d 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxScrollWinEvent.html 3ca4fe4bafb58b4030cbfc7b4f640e9c9283e26c8531cd80debfaca3e540a061 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxScrolledWindow.html 60c2ed28f099d40d29c712ccb3d27bfd3f96e88c1a716da1609584747945043d 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSetCursorEvent.html 6fcb24e0b9c0011d13fee60cbf0b68a07c70d4b3050ab12db28cc9209d54db0d 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxShowEvent.html ff2cd6cb44f2875db4df6559c4470ec996f18dacc432152688522d4235df204f 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSingleChoiceDialog.html 707f19acf566dc7e3103ece9b9e7bf17564381f7d96762594821783d677a0bf9 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSizeEvent.html 7211676598374639524a4cbf01167ce0f4d2dca16872df3431225181a79b852f 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSizer.html f4d1b3a8848c83a19d5298926a5ebddc59645b4373c79b6ff5248fd30f00d473 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSizerFlags.html 2c401795817b3d0c03fd665d5ac4371830260639662c1a4c234c1ffd1bb0daa3 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSizerItem.html e05f1ed653a85be4754616c24054ce352d938ad647faaaa86a673f89be0b7fa0 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSlider.html 8f2d7cf5b0bca95d8a378f6536483bf83eed5ac02d065c1f1e58d8f0816a6530 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSpinButton.html d37db10fb1942c0e211a837a343387c11d584ec9f0607ed540bbab1fcf660b25 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSpinCtrl.html 42926d539aeaee4938997883faef17845153589cfe1d81e72c0bc672897df893 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSpinEvent.html d49a47b93e10814b623fea315def77be89f67d2d7a20cfdb9155547b788b44fa 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSplashScreen.html 2e1805b333c96aad4b863f18b8217f74573eb3000f9ef35e4aafea8938bba30f 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSplitterEvent.html 5fb0d827d333bc90e2b2402068e920ec59666487f711993f19060edb956092f6 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSplitterWindow.html 405a17ade7e79a5acd667e416528cf4ef0c2b2fbbb5847934c9a4f1516d7620f 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStaticBitmap.html 0e974ddeaa4ea358fbc7cea20a4b1f0fcbf72c85c37561b08946e2004e0e3386 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStaticBox.html a2a1e6f25dd276180583f9c1232deae042b9af6953555994ff04f9f69a7825af 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStaticBoxSizer.html 8ff0a11c2eac42ce3b0c6898c96059255cdc301b34566755b0bb0f57fcd90479 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStaticLine.html 4f457754dbfbe0f0cf95d4265a36c7135396826de4356ca30a4be1e35ee90ca7 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStaticText.html 18596da738af4203ffce5633dcf2807ee55f6a4f96c81f3d8e960f6c22cc28b8 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStatusBar.html b09a11bf22f04b4722f9be878155d5ead599f3e2608088390e16ac265c69604b 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStdDialogButtonSizer.html ba5e4a4c941dfafd8d34c631f9f98a273c0ac91db4a6f83a0a5b110c952c56b5 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStyledTextCtrl.html 3e4580b486f2a0d93cb1604d4562f90284c59095ebfac40fa033605ac39f9783 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStyledTextEvent.html 0f2a4231a616f7baa59386963da017b48e6268e448609b1e46256b61c5249d3a 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSysColourChangedEvent.html ab4bb51373741dc732cf4622a04cc4fdcbf7886063bf6a3fe53e112287e28d9a 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSystemOptions.html 37c39d0f6b2c8bffe669410cef04394da55fea35f9d72116dd0dade20aed0652 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSystemSettings.html 9fea3f4953d5c5514d597995bcc489d82136274975911a8558dd40f0adb0c538 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTaskBarIcon.html 68e18770ae555d385e30f07b7fa53b509c788d3a57b338a5f0428a4047782dd2 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTaskBarIconEvent.html ffd1101cc0a5655817eda99392942a26ba98cd9cb58f33246e6ca74e5af8a6bb 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTextAttr.html 4994cd2ffafdb0e7af5890ff60a11e2ff52a090dd5a25ffcd1e7ec224a427e9f 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTextCtrl.html 9d6b6a5969b452bd50fbf4d3145060e88daef2ebf0610095a82a3dfee64fe680 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTextDataObject.html c45b18cd2116c39ba2556575e1b6207d0a4c27b9c3b0b885e8ebd3ce2afe2c22 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTextEntryDialog.html 80ddac845527de7621a1a91111253e48cffa7cde65d4fb325a119c2b830a7bea 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxToggleButton.html 36823d74aae001e83a0922ceb5665b39ac55cb9bb885653b58ea80493202b646 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxToolBar.html c1346167dce3691cb8e4474c82d25cacf7f6af78756594a2bea89061c83a099b 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxToolTip.html fd5d351d81499653e3df44525ce85616bf1652cbd4227516da6c1ae7fcc2db67 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxToolbook.html 612a4e61699af7ca7a9866dda841cfae5eb472cdcea3b131483b633611adeccf 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTopLevelWindow.html 16e09e1d2ff9367ec863a79bed1218fd3d6b62728bf463de90b73d01c837a021 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTreeCtrl.html b020d9418cbafc2b9994d514e6a0ad31e0b9eaa06490ec97387ab2a88f3a8db4 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTreeEvent.html c1b24d69df4f9bae322a01808b46ccb7a18ddf08d67361b137d795f0779b7da3 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTreebook.html 691fe80e82cfb21570e40134df7d05d5a3131ce2197f3fd7aa1b48bf63bfdc6d 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxUpdateUIEvent.html 2537942eace31f031eeaf1139d214f8b9ec0ed9653a5eaa2de57a117f9f6a9af 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxWebView.html 43cf84254fec516e0b60e16f5765d61368fd2299501ea9e9cedbcf37a195c2ef 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxWebViewEvent.html aa7fc06d3da1faa5ad0b84011a4073d77332b40bd363ff165469c479f3a861c8 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxWindow.html 0fdff4b88e83a6ec367f92ee9bd0f48a65aab94575f72735e06f764afdf2f30f 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxWindowCreateEvent.html 83110e5825144668b338f9184329c2e1ed2e11d9b6945661f51429e7427ee6c7 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxWindowDC.html 48dd6bfca836f3582467a47dfcb3a6cc5d4581b8b17f071a394141797f5c1b6a 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxWindowDestroyEvent.html a8461652808a1fb917860ab9a66738b7f9b2be2701eee718a1eec5ca9b22fcd3 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxXmlResource.html 3263945263ad919b7f93bc2040995af667e897529b37f67ee6c9d630a43db90a 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wx_misc.html 89dca6a30af573777ec7a06c46588e46672eb3439abc66d7aa99964cc85f3617 2 -/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wx_object.html eebfebfd79e5d48f19a6a37b861d1b898ef75ea4f5504cdbfd26c7b908685dca 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/notes.html f8b8bd3f96883efc7ac7f6cb7722dc7b0c846a32134b8075870a850954f11cf8 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/search.html 34d3676dec92c20435b3ad96c376fccabe9452c42a25dd0d3868fe84d9fdb84f 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wx.epub 6ca3081c8ce5499c73462ac04ff07e5c35fe00883cea36a4e334a0f8165f348a 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wx.html feeb3ee586c9044e73558717243774c7174698db343296774f48631dd78b57c0 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAcceleratorEntry.html cf749ec2538ecd488b1a0289dbd30bd5e13adcd48d9d3a2b360f72ca67f7c6ec 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAcceleratorTable.html 7087e241cd3eda6f936bf97a717271a5081fc82ded1e443892b9a3d7e968ea5f 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxActivateEvent.html 7d0cf7c35307ce9143b3c4f322bb3946f190ba5d66f66c8d6693d6109c1c78ce 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxArtProvider.html 106d29a063cc10d63083fdac28f688e1c42c024d045883ee6fc5ce6e7544313c 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiDockArt.html 04223ffad51c3a89746719046141dd24bc9f82641a68a1e44db8ffdf2f0f1165 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiManager.html 79dfb75bfa5ef5e87ab0ee5b3e1c78388028ad1be5a4adda45f9c663031fcdd1 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiManagerEvent.html 6a1392363eb7607a48eafabb8c5966634679579adf14ff59cb500a87913a20d9 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiNotebook.html cbf1559ec4f93ee9a09cb1f3acda2bdce028325147b5b765ef2bc5255c6c9662 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiNotebookEvent.html 2d71e30cb1739b1f5bc00327ae5092f8862d7987f815917ec4d3579bd1e7b788 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiPaneInfo.html ce1ca298a78ee13a637f3c2ccd256326bee00b7c2ee4d8612bf11a10216284c8 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiSimpleTabArt.html 46f802df4b0834d5f88984c6c2a27e42185592a39eb3511adbd4404fe1cbe32e 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiTabArt.html 2401cf810181afe272f675817ea5457104a91ad554e8a744e2b049ac8d0ff2ae 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBitmap.html d7b3869df2e8b7799f89eb41bbc6536be2ca3bd717b8ee1a1780ffeeeacce3ac 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBitmapButton.html 53a40f2724250fcf07a7d61cac983f70c01497b677c2fbeb5fb58331bdae8c20 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBitmapDataObject.html 7727f56bdf38f47d5bc30f0cf68eefb7b00737e62e3a57b013d5db2cae5578a1 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBookCtrlBase.html c4e7cca36825f9b3bf1e02827017caa60f8783475d6d40d4b20de2e03b95321f 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBookCtrlEvent.html 421cde9eb5ce062aa65418182abece6a7d52f98b5006ed48eabd7046ca03ef36 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBoxSizer.html c1af71c606d533d7054d594bb86c66ffe380ccf497aba0b0fbaed3971137cec9 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBrush.html 06bacfbe6bf8feb530de8d3056bacd6dc37d644895d3e5ce008bd9f89bf2cb8c 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBufferedDC.html 9bca73b8fdb0fbc79a1e6c3d92664c5bc3fdc50efc4a3516078248d513f1182c 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBufferedPaintDC.html a6fe80d22d695419bf7513a95e07bba049ba9f8a1b9cb38298d7e0a483b35ee8 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxButton.html 0ad1c87b6f685179adfe9157f5639e6ac5669fcb4e7d8af097e7917c588ccf5f 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCalendarCtrl.html d1ba00ca5d787138e475a5f66ebdcf67d829aec1d135362ff995d9cca8748a4e 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCalendarDateAttr.html abe6e2a37325f0fe76952537473f1c765b01fb99910b1c9ab9d1a8e4f52e4992 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCalendarEvent.html 7de3fd54cbb1fe569ac784b30f088b474dccc2376ca68f01cb2890ab0956028a 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCaret.html 5913718f4d22169b6b07a6c6e0804dfac7e58289f92703dc94c72669421473e5 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCheckBox.html 835528b6c50c08e8ff83c64aebd34e90c47fb37c2ad35cb307368b87a78703fd 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCheckListBox.html ea4696f6f98e1d68978da1b1de5be6d0327961edf1eaea3fdfa5c9ed24b49472 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxChildFocusEvent.html 71dd49010f77fde64eaf7d5301231a992b6207f1ec90c6ae79e7013a77619606 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxChoice.html b7c3c3d787a641473c205a47ff28d30fea0ab17b56090763fab3599ecae6cf82 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxChoicebook.html 90e90bc671136908e030f6f3a2b3e269e87392ffa370c19b50ec20ad106cdd8b 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxClientDC.html 4de68c4a12cd8c0e388f906c5c81429b11be8e764e76aee7c88123de802787f8 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxClipboard.html 9d09910d6f0e23153a95e6e039b75d89cd2cc7451345a8b111c06f8722ce5b71 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxClipboardTextEvent.html fe02fdf128aab62c724df483cf7849ff8aa5e5bd7429e2494debc96c7b93c270 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCloseEvent.html f5a4ed02fcfa510ec925aba108326ea40fa90350e0a3c10974fcc23d5635d1d8 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxColourData.html 479bed7019eea95f80665eda5dbb556f3e5259128ab1f006df906e86b7d39969 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxColourDialog.html 0f91641f8ee28616b6f69f67a713a3048caf290691f8ef0c7ed45c5891d16b09 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxColourPickerCtrl.html e5c9c100e1041fa3917ae10855b9f96c288444c344f37929ec95d146c431eed7 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxColourPickerEvent.html d8eb2b22d4e5bdc3fc3a59c52525b57bc0dab2e9c8be37affba475397714dfdd 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxComboBox.html 0e0c1e5512e3795b167a837c97aeef196df01de7411f02334653a4ea9f9e475d 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCommandEvent.html 8fe6d2e0c4d546bc6e27d3b5cd569d63090800f54d6132dfa249f7ae2127d023 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxContextMenuEvent.html 7772fee09ba6650f645c55de4a5877a221f1433800e872db7a96c578dd9aafe8 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxControl.html 813c63663debb13acae8e339cd9b4e54e4733fa8ae341fd87595168e9c83a7d0 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxControlWithItems.html 482704d6386542c47ee002d172c48584baf359cf919c0c19181ef982caaf30f6 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCursor.html 2140b70ae3799451e76486785d3a2b4be9701a12dbd11ff95fc7b577be5720f8 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDC.html d56b63e9b5b647ba6ee3dcc24ea69cc7bfac2dd25f96896520102bdaade733b5 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDCOverlay.html d0e3ad7aca97246d8743bd77018697cb7d38b2d965b8804b8710807858b1e88b 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDataObject.html a34a16ef99d8602153d36056d21b8c4cc3a0cbc41189b7523efc8015d3f8f96d 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDateEvent.html 374b4f9866df51614f872361eeb3baad32a7404491c6ecf68121833315a0933c 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDatePickerCtrl.html 9d09a6b6adb8a3cdda7239d781c090ecd15e96fa14f6a5bf153ea5346f211a22 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDialog.html 0a83b8da17f493ac3c9a8e9a3099a2853aab4532819b5d641027f26d4b009763 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDirDialog.html b0aee8d78994c770d1d7408684933b4c005a8ea7b93dedf56b0fb6130bba73ca 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDirPickerCtrl.html 2cfc4e771152909ab8e94d08f9613bcfb3856567f4b4c7e651cb22565571c212 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDisplay.html 3e51592c3de991f8f5af14fee190365288736992dcd22ef2623e5af40989f228 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDisplayChangedEvent.html edd823e8eabeb9e136a2f598b0cdb0ce843a19dfa997a4d25add27abd6ca9ad8 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDropFilesEvent.html 6fbc04383bb1976c4af25ae419b83cda36bf6bca6acf77f08b364bc8fbd4e131 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxEraseEvent.html e597a92606d5af8863144f120a5214b9fc52160f0b7336c4516b2f4a898e5d11 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxEvent.html 3c7f449f54a36f492a1938575f82b4cb4004d2b07d49df50ca45bc871c3dc665 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxEvtHandler.html 080352e16bc38407e63446141bbc3dfd172d9be5805f9406635011a9efef3508 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFileDataObject.html 67d42def0503526b863da481c67dd03983db2e50a2f44fa0a201d4f2f55e4842 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFileDialog.html 770e7e7893ea70ef556e67a2a2a57c65eed85cee165c65868c1568ff41c712e3 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFileDirPickerEvent.html 12c6c815585201b426e64af4f837684da62bc6c7052461b48cd51d1d9d80a169 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFilePickerCtrl.html 13ab0ccc3a07f4913539b7466a7742f0d00836d7bcf48a9aa80b41a31f9bc194 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFindReplaceData.html 0a9dee2f0354f464051d9e0323e378169ac9670b5663c69aaf1cbcd85e710dcb 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFindReplaceDialog.html 6a454d6ae8f24971b8def88cdd76761238e9486a399d0a02d4a1a5c85c74e029 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFlexGridSizer.html 0a4d416081687ac5434438873d3e0cb93e61489b163b047e43a14575299c4a5f 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFocusEvent.html d1fff3043fd2ab8ab07fbee542cdd0cb018c14e0890fea4fd8e6144b0db9c3c8 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFont.html af8d20961bbe38c5bb5a1912df0a93688c2c6793b2c69a6fa3cf085df1a0b4c8 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFontData.html 06b8ca8f530e4b6c58c2c98cba48200977184d46601d18c78deb7c5f49d70c9e 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFontDialog.html 6defcbb0b7cef333f645ab574a968f5c5086702763696a3910faf1b66a448fc5 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFontPickerCtrl.html 325cb403ad9f9ffc1ad12e60d8fa49fb5563845ad25ba8596426cec9d88498fe 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFontPickerEvent.html a708a418ace42d9f1959a4b23891a9d13527a5aefd2f26948b55d067593d805d 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFrame.html f08a2bb334efeb72ae503aed36acd784e98312953731609e40ed2d4a93741eaf 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGBSizerItem.html 358ff69e9367395361da8053330e1c401a542cceef19b993c6b96511d213b52c 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGCDC.html f5a806d66092d7e36397da73e2de8ca519f3ce112a8b5d5548d6e2b184d4261f 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGLCanvas.html d0b602756b1928b780aaa3414194134f6773e698d59b12eab333a2ced2b7f1c2 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGLContext.html ecd7b133192909dd62820e36501297b47384ad36c28053c06c4ca4f0be7a8acd 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGauge.html 1da8cee161568fda7ad890855d74ca90fe8df8dd2c11a0d856d6af89f83ae258 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGenericDirCtrl.html a174ede2cfdd28ee039db44069490f9ed04961dc834d88880ba57c2ee2718ce5 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsBrush.html 80c48e8bab88147056d762a56984be01ff3be846f96bbd63986969f77ccb7e46 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsContext.html 1d552eb8b117c909a9d9f691c3491387a70213cbf952cbe3149a0b533657b89a 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsFont.html 3a58cd9e6a0eec2f88bfa9cf9fe97ed7290bde7e9e1216d7ff887eec7e490921 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsGradientStops.html 6299a88d8c579815f90767f2f374a4a2db2da29dc0a7f0ac3eb73a8386b62528 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsMatrix.html 0ba596c481b36625ab7adf358c70eaefe2eba427664e2c8b5f756514dd28b397 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsObject.html 875cd732e0380154c77fbac033c6b79fa1cd1e0d8d8ee2596fdccc942bc8ee0f 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsPath.html 3c314fc51a6e12eaf21356fa09782bfcef25de97e8325cb3d12b08049cab2b2e 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsPen.html f89ee298f63e585db041bc7f49bc796e6cf8b3bf4c99326ed500ca55ec3c0ec0 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsRenderer.html 91a4331cdeff453e224bbfa9648af5413c9f6b33dacf7c515ddf71d761e455c6 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGrid.html 1f657c2d05981a343ae35959a73e2f5336a22434604f780d5e00e35bb18e3b41 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridBagSizer.html ce234ed0e36701380f3266d96ec66dde5996f3893b741e6613e0786f8f85ab75 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellAttr.html 87f0a1e644f35933cc0a80c2c4789c4d3322bb05efda49ac226e425f415c771a 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellBoolEditor.html 1782f122d32f844ce90aad84f486eccd3397191280173b63563f51383aa7490c 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellBoolRenderer.html 99ba625fcb4a4c930b13f70b0dc74a7d8d5842885682ad7b3ba15ce20f6c5324 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellChoiceEditor.html 1e205feeddeb6e3af9635f20e466499abe29377f8ad52599989feaa53955d50b 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellEditor.html 4721946a0d6a0aea4ca3c1208c81ef947258493e9f67ba0904f9c9a53a8e9138 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellFloatEditor.html cb05f318b29d9175b164b3ac3ad2e6998a49ad58184504256df0097b072c6ae6 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellFloatRenderer.html 000b26d16add56fcfa17e6d9e2a3bc9ae9a3f1c26a11f46471ed24fd3433ceb7 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellNumberEditor.html dcf4bb6e87f25109735fef497b043b108de481d005ee9da98f08ed757ceb6804 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellNumberRenderer.html bbc7beb52efe899b503da403ff2fb2b3b35b6b88ebf34f352148117436aabb34 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellRenderer.html e1d31053562e81ea35cb4d77676e1b546322343751323e04f79dd6489bfa00be 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellStringRenderer.html a5d8ed6854d1b2bf86845c98e9118dd90092db94c9782273abfdd582b034f67e 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellTextEditor.html e0432cad5c61676187db106fbda8d5c6ac0a35ea285709f93e6d2c240f29d533 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridEvent.html 25bfff4843940e6a73e1972f428e7a4c2adf5c57e2f59abaa2ecac66247d0258 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridSizer.html f08ebbcd0977f3fedbba2ea09fcf3294799f5987c0a3990bb221c696363e294a 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxHelpEvent.html 7634ea6366a058930567d730e504fbfba5fcb73ae2826fc8178dde26e907a96f 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxHtmlEasyPrinting.html 63d65ec634aea81d9667bfd74948d4c9e5a244ba6499cc4e9c56d6142fcc3a31 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxHtmlLinkEvent.html ef0db1de88e2364a04195f3086ee48f464c1addf03876c0f979229bc14efb4bb 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxHtmlWindow.html 7006a43303c6e65b39ccdd97a65dd2d5d2209bd88643da9759df010eb630e4ed 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxIcon.html 0603b3544688cdea96c1e6fec9188d49ef302e4eaa8861ad532b0eb25cf8dddc 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxIconBundle.html a9499b453e43beae6d01d784068ec57bbada35a6016c4a854329338ffc3d5686 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxIconizeEvent.html da4f99bcb759cf1e686aa8e2ad933ef8ee97d99f2bb9a809f777cb2f72cdf3f8 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxIdleEvent.html 348c9627b3230b5b6b3506ea379cb8e75d954bd0da735cbcb7b50a3cdf08ca44 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxImage.html fe0f43749e9036dea2e8f7027b62bf17c1ae361d5ae7e3e1aab653788bb4b7ef 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxImageList.html abfc2437dc92363ef5f626283c1663350b7931abda7dad6fa12e566eb4301e6f 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxInitDialogEvent.html 2ddf64b782ab0132f1218598b72447eb32f059b9de72174eb3072ad05392adc0 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxJoystickEvent.html 109882e389370f7bfd6b7f849c87048c9534724ff0890e630e9ba410fbcf818e 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxKeyEvent.html b7d49044147c6779ff8e3172c1e80f87860778f4fff991a731344e7374bc2c90 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxLayoutAlgorithm.html 40426a92dafcf015b25b9719a3ee3d9b59bf265b6ed1224e2b3d238c0301b175 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxListBox.html 4911b77df31e89755829a5d7ae4b0f6184c3817224abc9b0b8b7e90dc7b0694f 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxListCtrl.html 40c70633d60f16bd5326afd3bdd7d95bf4627b943471c64fb353cceaebeb3bfd 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxListEvent.html bee9f4e82db540b8785c9d08dd35029aedcc316bae6079a747aab7e38ea05aab 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxListItem.html 7c5a5de15600a85c12dcd79c825e40a5fac42ae11320ffc90f1effdaf7722469 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxListItemAttr.html f8a2603514c8edb35a5e994a9fc2571b545c78892da3b6670c60d94a8d8aa7fd 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxListView.html ca512f1bcd75fa4728aba4b7e7bc481b9ed3974d0d3db5bda626fe2ff46d1f7b 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxListbook.html 779ec2aac9be1ea50785defc70fdab9730f6f01a821b4172f068f12cf3abc172 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxLocale.html 145e613b0b2b7571bb605730b63aa40dd3c45ddb0d313e96b0886d5e839aa66a 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxLogNull.html b8fbb506c34404722a9607e01e16827151072182fd734f80b0f39483cef592d2 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMDIChildFrame.html f1e9c71b277f035f22cebafdf52eb28c64518f6a12453bb4b1bb10f6a9b24b6d 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMDIClientWindow.html 5f2080e32097a83ff0b1366841672d841ec01fa791cc774caf3ccc5b2383cbf6 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMDIParentFrame.html 8b89972a0fecd35cee9fe51ab5c0015151fb96cbfd4b028478a24884ae4db4b9 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMask.html d6f6d557076b715162638828ff8c4402b534c65d25bca5809744a96431a442c5 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMaximizeEvent.html 3fd3cc135f014850ab3715d318ea6db5738caa25de1452906e26372c3a5f381d 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMemoryDC.html 9115e93c5b6016edd5d9196b865c42406950b752766aba3f6dbbddd6322555d4 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMenu.html 0d89f96de88819cb428c3a452375fd1c62419839a0207d49e7e082a9d7374504 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMenuBar.html 62d544b93371774be87821f20f021ec41e19e2b29e09858713dbc4410a054470 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMenuEvent.html 04053b4f654a064e7b5a607177a6f210d75291b8dc4fdb8e94a8b12f26abeb0f 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMenuItem.html bd690959c33b70a85963183f8a21c47cbf816c7c460da93f2e630dd1f086684a 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMessageDialog.html 86ef1f3a0b11a7cd58570402a1906d3b825403be7c7a5cf94272743754c32174 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMiniFrame.html 495690e95d72abc1724469cdffa1ff83c0ba0ff0fcb002d6419e83685fa74de1 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMirrorDC.html b5955bdb9d058db96eb447a66f865c5bf9233af8779edae9a559c19491e17bd4 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMouseCaptureChangedEvent.html 4ea250cceeb10005b09f10666f69165626f4f03db25afcf3ed05f8e822a1ce69 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMouseCaptureLostEvent.html 39b2bb36c90bb000125650d8c46a311c4906ceceed87f5c9b3b7e20885e417ac 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMouseEvent.html d790e506907ce8cb32fa7d84d7da3212f9dd1d1127e989d242e2bd38cb88beeb 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMoveEvent.html e0335b65f5ecd6af26f17a7598bed08ae923fcd5ff369a763afb71079d60cb77 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMultiChoiceDialog.html 90e245f88ccd9de831b8a6c019883b04496c032da5fd4424808074ac36e165d7 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxNavigationKeyEvent.html 57944478ae915030c5a8b673eb332627781d34280e4a2cad8326e8a608ce37f2 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxNotebook.html c0624e6c96125371900da8504b812fec3103acf75af34f343ef0ff2fffffea66 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxNotificationMessage.html b1deba66074862c902f1e8e88f9c7094bae794cd658ed3568d50887f49b99ec3 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxNotifyEvent.html a6fcf2530cfecd13f5a2c3754ddbc64d4e9e9d87df7385616b7aa25f10ac03c4 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxOverlay.html 45d0c4e98b099476c242c42e8c31fc53ab08ed60325ea4273165a54fab481770 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPageSetupDialog.html d1c3c951eaa1e56fc21f7b49bfb1e26f375b12bfe525d60dd7cf5dc9005329e1 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPageSetupDialogData.html 2536207de0a2554695dcb56b0bc603c3804c69d2634e5d3c7f203e65154d7d8b 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPaintDC.html e30c5f402e08a9dc044e2967a304b8c47a9f110f1cee821efca168a05f6fe085 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPaintEvent.html 386cd7b6071ac8463410b13a914efb7822fb79f108cd87b57fcf9b852d572c92 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPalette.html 7fcd41e146e7f733cc3c8447444ed844f9ec139f6296a338e744eba653b4e349 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPaletteChangedEvent.html 0d5b45c8264a159df1db702ffa2d6812aa90e8cf86306048fddff3c0497aae03 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPanel.html cba8e03465035a7a3c32379b72c023001542dbfddab5da543513104b175f1d1f 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPasswordEntryDialog.html c3b508aed6ae370a59cda91b4c47021a85d5c1439135e6c69c72faa968c53a04 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPen.html e8cb474035d4383fab428778c8c875b1b22215647d293767cf57b98eec87ed86 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPickerBase.html 769d243625585627c70b06fccc5761320a541304661c1456d83732da56b5f8de 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPopupTransientWindow.html 41e96a84a5a258d14d079038e29def63cf223470393e6d1c9393cab02b6521fc 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPopupWindow.html e572cf34d6cecfae8e77aef6b0321d94ccfb390e782732de8218b28b93a391c9 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPostScriptDC.html 79281fddeea7156dd7889270994a381338bb01bb0acf9a483fab2d1b89aebcf8 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPreviewCanvas.html 7f321cef763e75a52503cf854cdfda2fce688a5f2d3d837068ffa7655947f54c 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPreviewControlBar.html a4c4b81f0f8c14a65b597d1ec96a39dfd49424ef772b61a27243ee0f7df7e1de 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPreviewFrame.html 646d63014ea7e40ab386736c25fdf66b086e8fca2c0541949363da421ef59f70 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPrintData.html 2ed5aef7d65530223811f8b247c018af87ac39a79f995ef8feb732693dc3f51c 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPrintDialog.html 77a4f12bd4bc814cf55af1ddc87c9ae2f8ba2bbf52e9220d0d1c24bc10941626 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPrintDialogData.html 5c568e5b3931566ff09d741c41899bd6fb1d07853cdd93bd555b4a5b95c0c888 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPrintPreview.html 4332ac506cdb79a05b0b30c30b98ac2b0f6cc9b810f9d51cd6e87fe19c2446fd 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPrinter.html e3db2984ee5711cf2b1208d786264b0d028ebbdf274df874cfc9e8f9939a18e2 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPrintout.html 4c34296050a4f1ce133f0ea4385025a7e8f577fad0553bfadaacdfa9ff874cc1 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxProgressDialog.html 4c083c457d78b854cb2ef35daa78d04633b5607ab7d6790fa096e605e20f0529 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxQueryNewPaletteEvent.html 3cb99d359ae0a6d0c2e56de0acc55006c4b61c5dcd5e6b36e8fbcad9b88ad24f 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxRadioBox.html 75d540b32fa1e607c51bb528435f1fa51bf67b137dac0dc58eebf957f38aefea 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxRadioButton.html 160fbe1084f6ae2cc0c0947cfa51cf9186ee7299fc250fb156bd1ea2f4093aaa 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxRegion.html 86082d7aa843d32f57099c4a98e509d7cb466b2d47455ecdf50c2b290e274068 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSashEvent.html 7f817475223e28ce0978d3e53a293d78f3e40455a602557f3ec75649ab7e3b69 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSashLayoutWindow.html 87f0ff04131039b3742c5f4533cece25b5ea9449693d3454401b4ebd2b0e4a21 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSashWindow.html 36a46ee692377bc6eab91c4d600d4b5920fc9f2ac3a1ed4386d98ac3926969ce 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxScreenDC.html 9d9fd20ac40cf12dcbbae3c2a48925de50d0216ff8594caf8af241da4b6de0de 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxScrollBar.html 4032dedb10d080bbdacaeae038dc5e91a9b1d9cf5cb3311967693add38585119 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxScrollEvent.html ff81753dd6075a1e91bbde629d25c6c35cc7efd2d2d3149be66b6fc85813bb79 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxScrollWinEvent.html fe0288122deb41564be4119a462d3f3e8095b463e14698eb099e0122ff9fa5d0 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxScrolledWindow.html 5830b3961620489f76e4f99a953481cc13e18a2bd2d2306f41d95239531764e6 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSetCursorEvent.html 7154a7649985c82849ddaadf25ecf0ba24e38f9b5a4398582f3de8e79552c895 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxShowEvent.html 89dd9c3fc58f33efea6e91571ca14b081d199bfc3928d1a88d5e253761d4068f 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSingleChoiceDialog.html 67c4b33a7662b912695902dc5fa46e16f7369e7d9ca8e1d674ba8b8dda4ff18d 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSizeEvent.html c1fa8075c4610338c013cd89d9b86ad141fc904bafcf4bbe0092188da7c9bdc8 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSizer.html 554353643cd1c72b80bacdf372364238dd0d5d3fc66cd9eadb1acecef9bad4f3 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSizerFlags.html cc7fe9947f397a7cb8d05c8bd278606dedb7f2134806d629f42e54a4c9ccebb5 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSizerItem.html a91bd55490cca58024ac2856dc0a9c0d7ea3d649eaaad671cc932b0be2562bc4 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSlider.html b65627f57773c4fb4aea18d17c62cbb10d44c9a6569cabc3c34ace31523048a6 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSpinButton.html dd92ba47d07fabe318ee3eec75ab82004d2ba763e922fd09e843ef5b451929c1 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSpinCtrl.html e9fb6317df26350ff9066afbe2170dd4ee91eccda7b32eca45575175fc091fe3 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSpinEvent.html 71df8918466bc4a56d97fd27d64a27a73fcecc1973b3b3ef141a07101bc29fe8 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSplashScreen.html 1a073570955f188d88858993835f42f536973c022293d51ecd439f36887ca541 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSplitterEvent.html 63d36e6da7c71cd98cb717c6c9793d028e0b288d1c4179579733eadc74da1fea 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSplitterWindow.html efc8fd6a6af8fcdac31edaec79c55522d04f83bc992f94120751bc36105b85bb 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStaticBitmap.html 4f3750e2373ce7d04f416088ca0dac4b6b298e1b050404a47e36b318f069a959 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStaticBox.html 2609a1879522576fd03e84341f9b377da45f852d98aae214c7eaa1bba11272ad 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStaticBoxSizer.html 550c02925846ada28531308545da147d746449bf19a18e5fbdff8fbd84c38aed 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStaticLine.html eff182a36c24218034782c0df77ac15f2c45271044254a1af44ac91665c1cfb7 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStaticText.html 406310ce6d6b6e16f777352682e07293d5213757399fca9b7282bf08f151fc65 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStatusBar.html 476f7a9ab358d8ae51cb5b926f404660d5a59dd7b4cce80e2c565b2200adae86 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStdDialogButtonSizer.html 095122146bde1a8050c0f74c5de0b066d5714f39ce1b298eb73be96384e83d98 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStyledTextCtrl.html ce0dbbb59eb5974914070b8451c536229134761f4fac21b2074bea720332d86d 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStyledTextEvent.html 2a33f934618549adba9e0ac02d1c0f0196613dcaa8b4fea3af313c4eb4443beb 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSysColourChangedEvent.html f4ced2f23c20f13e1b1fddddf36e765d9201d443f38d558997a669c0d022768d 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSystemOptions.html f1b3fd1e6efa7ad58dd951fc7bef2df701d5102ba2a923c3ac1dbbe0f424945b 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSystemSettings.html 74b1c1a2f4c1a4d556fa1dc8d059a21205d7e9887a62bb4798cbecdab91e9d38 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTaskBarIcon.html e9001f54b528b0cc6082868e06e87b97e9f42b5cd003e9919da0f1f439dbfcfe 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTaskBarIconEvent.html 2c2f3427c3667211ee0660f6ad82aec872209e887516a2caa01dca7695ef87ce 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTextAttr.html 415b09a5c3c8906c20399d2c48d88128c66b0bfc0ee25ba49a7344fb2b43bfbb 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTextCtrl.html f85e1a721700bcbdc579c0ed2c1bd7cf514d41cfcf067ebd390e899edc6e177b 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTextDataObject.html 83b66215dd3f3c72ead60406246f00f7e57c37cb3a90ab1102460daf7283bb9c 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTextEntryDialog.html 233e0cdc1898c9863f297e0b989b1782d4c4b44960118a71ad3386183594c930 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxToggleButton.html 0b2c5e42adc1125488df82038f554ae68563367bbe81b5ef295d620f49464fbe 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxToolBar.html e04cc013fdb7f538607b090d10e6f7d2d7e2223b6983aab52c2db2db6c12f0f4 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxToolTip.html 41715af77962b27c7b3a494eb3a34c615218e922211bba6328058f4a3f3fdb39 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxToolbook.html d160a2ffaee2803fb5ad821257d948e55ef9bd586a5a6229a1840a6f01cdbcc0 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTopLevelWindow.html 5c2de1d1f3806feb9e25aa4f6c33f951ce30c5790e8879dc55494e1498974bbf 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTreeCtrl.html d1c9aadb9135e4d00e3e80d70945c2958f43e9ab10a64d50a34650fb917a7c34 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTreeEvent.html bb35cc335c04b4ced6e972ecd9cd49cea0c4104252722abd90dbfb8bb8e6e411 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTreebook.html 8e0673da74bb5653d6c02d61ed5c795510a5824242ab325d69795401f371e8ae 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxUpdateUIEvent.html c63cb893441434cdbc74895001ed68bb8f57629b9cbe8dcd197e007885c5f679 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxWebView.html b30a71057ea659b5330817e692529db416ace66a30a76e4d3b69cea180ffd0ab 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxWebViewEvent.html cecf4ae47fcb97d3dea192f9c67ddbb7b42c919d89ea0137a6d015c2d94401e7 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxWindow.html 9ae93af9207e06b414580c115741bf81949e480e329f0c7094e2b522510c6dda 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxWindowCreateEvent.html d9d9cf6f66c6d68633ac189ddb69d664bc80353e85142439ba6b3f8fa9dc9923 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxWindowDC.html 599d472fe76a1bc32fa79b6fddad0b172a3df7be94275f8ba31ef6f3aadd608b 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxWindowDestroyEvent.html ca7804a60f82cfaf92fbbd7482fbc75e1bc09e5caad114def582c5211afa0cbc 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxXmlResource.html e842bbd84d4e32bf6aa3bcf875805830b23da5f992b0c3a9c196e64c5bf8cccf 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wx_misc.html a9c564fe4e5f8307cf1348f98a86c882dbd6fa83917efadee7f8131a5dc231c4 2 +/usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wx_object.html 5da3f846e18ffd3f2c9a6dcdea568535cafb034bd3b49cb677f67d08ff74ae5d 2 @@ -4563,2 +4563,2 @@ -/usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/404.html f96f4501e114ddd06dc4c23ff882bfec392f8adfe8b9c5147f62b9ecc93a58af 2 -/usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/api-reference.html 554fe337b71fae0d8c623d2cc68d49ebcfcb76c8d87d3b94409b3dd7fdf6e31c 2 +/usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/404.html 9a597880ad412c94f6b391f5d5c419c826e10db685e51208ac3b89d6a2fadcb7 2 +/usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/api-reference.html d3382db7ca375de650bdb894f2f4773a65fdb0f8e550036e59be4effb17f1d33 2 @@ -4599,12 +4599,12 @@ -/usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/notes.html f479f48d007b5ddf554236481e202146a66f49e672d838931b51d6b39139dcee 2 -/usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/search.html e0f37cdbce3c19e8befdf45a76a86fda5efaabe5376eba20eabc1c5c321778a0 2 -/usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl.html 7295bc1da7372d83cc66eb4bd53aae8de089418a15193a83c1df3daa19c947ab 2 -/usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_eventp.html a7e8ea9bf089b61f9261d1b57c637bdbd3d2eaca741a435edbaff0d63f3f8a18 2 -/usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_examples.html 45774682efa4981c2f9e2fa5723a2659d8e60a6852cade7abd91f1d3ddee4bac 2 -/usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_sax_parser.html 8e168903563b653be873a795e2a33b1a29cba9a29981be211f6d72064e905fed 2 -/usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_scan.html b33a074a58b3b01f8e61e734947113740a4b80c5936038e785c024fa04945292 2 -/usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_ug.html 993bde68ef0a0b6d33f3046f73f2dff90c3aef10fa97e70d347d4742d38446fc 2 -/usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_xpath.html cdd54159115604e060c8835570f8584296fdb9425387a2bd89daa857bb1ee285 2 -/usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_xs.html e2e4fe5c14525b46dcec4da60f4222268480501ede85a0d896ca6920b0a2f360 2 -/usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_xs_examples.html 780113b63535287865064620b529309fbed588eacd6286a6f0dc8545d4af4510 2 -/usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_xsd.html be0f78d1f8b3a01c2ca446457cf0ed82b0fbb30b89af346dbed1137d97cd5194 2 +/usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/notes.html aad96cf431f1d4821e3412e0e2b81dc0f8b447198afb11de91475af38bcd92f8 2 +/usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/search.html abbae852aae641cb99c4c8814a25a71295c112e41720492381d52109fafe9798 2 +/usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl.html 119e136f69fa07b683a401d6c4fc8e6f67b4e7c0095976feac0dde562afa4546 2 +/usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_eventp.html eba0a41c3a1905e86662b04e2f972949b82a250723face975fb5e7f620603ea2 2 +/usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_examples.html eee9fd11648faf23a875f5f474f4f4f3bd42a023670a351a43ee7b640d6ccea6 2 +/usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_sax_parser.html 5f1d10e233522f766b2e6762e4ddd52d9ce4aaac3b6fb5855ace674601b722eb 2 +/usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_scan.html fd4ce7c9bdbfeb3d8ea0189e344a179066d91d8e5795bd86de841c960e9c492c 2 +/usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_ug.html bd0c5c611723cc67f10c0aa31a587b8ba5e86e7c5bbec3627d79b221c254b06f 2 +/usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_xpath.html 3d9807c68714da991e68522e85ae8414cb34c20a62dccb5728051b005b9883d9 2 +/usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_xs.html b946d2ff2a7b249fac78d62fd7c76b74eec7b8d242c1631046d65ac3faab5ed5 2 +/usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_xs_examples.html 8ae7f0335ddddc582f4cecc9834d6ea463a00e952f24dfc81449c682ddbc32a6 2 +/usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_xsd.html e51afd986636959e53808822b38396681624c2349ed4d59bcb6556269bcf2750 2 comparing rpmtags comparing RELEASE comparing PROVIDES comparing scripts comparing filelist --- old-filelist +++ new-filelist @@ -137,7 +137,7 @@ /usr/share/doc/packages/erlang27-doc/doc/system/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 2 (none) 120777 root root 0 4294967295 ../../../lib/xmerl-2.1/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 /usr/share/doc/packages/erlang27-doc/doc/system/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 2 (none) 120777 root root 0 4294967295 ../../../lib/xmerl-2.1/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 /usr/share/doc/packages/erlang27-doc/doc/system/dist/remixicon-NKANDIL5.woff2 2 (none) 120777 root root 0 4294967295 ../../../lib/xmerl-2.1/doc/html/dist/remixicon-NKANDIL5.woff2 -/usr/share/doc/packages/erlang27-doc/doc/system/dist/search_data-055E0B48.js 2 (none) 100644 root root 0 4294967295 +/usr/share/doc/packages/erlang27-doc/doc/system/dist/search_data-A3AB6FFD.js 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/doc/system/dist/sidebar_items-4A143270.js 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/doc/system/distributed.html 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/doc/system/distributed_applications.html 2 (none) 100644 root root 0 4294967295 @@ -471,7 +471,7 @@ /usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 2 (none) 120777 root root 0 4294967295 ../../../../xmerl-2.1/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 /usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 2 (none) 120777 root root 0 4294967295 ../../../../xmerl-2.1/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 /usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/dist/remixicon-NKANDIL5.woff2 2 (none) 120777 root root 0 4294967295 ../../../../xmerl-2.1/doc/html/dist/remixicon-NKANDIL5.woff2 -/usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/dist/search_data-B6F18E29.js 2 (none) 100644 root root 0 4294967295 +/usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/dist/search_data-889ACB16.js 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/dist/sidebar_items-6B016F1F.js 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/engine_keys.html 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/engine_load.html 2 (none) 100644 root root 0 4294967295 @@ -516,7 +516,7 @@ /usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 2 (none) 120777 root root 0 4294967295 ../../../../xmerl-2.1/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 /usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 2 (none) 120777 root root 0 4294967295 ../../../../xmerl-2.1/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 /usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/dist/remixicon-NKANDIL5.woff2 2 (none) 120777 root root 0 4294967295 ../../../../xmerl-2.1/doc/html/dist/remixicon-NKANDIL5.woff2 -/usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/dist/search_data-1406756F.js 2 (none) 100644 root root 0 4294967295 +/usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/dist/search_data-55C9925A.js 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/dist/sidebar_items-E1F6BD8E.js 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/i.html 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/index.html 2 (none) 100644 root root 0 4294967295 @@ -677,7 +677,7 @@ /usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 2 (none) 120777 root root 0 4294967295 ../../../../xmerl-2.1/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 /usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 2 (none) 120777 root root 0 4294967295 ../../../../xmerl-2.1/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 /usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/dist/remixicon-NKANDIL5.woff2 2 (none) 120777 root root 0 4294967295 ../../../../xmerl-2.1/doc/html/dist/remixicon-NKANDIL5.woff2 -/usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/dist/search_data-1A8AA22A.js 2 (none) 100644 root root 0 4294967295 +/usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/dist/search_data-FC950B1D.js 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/dist/sidebar_items-A81F2B0C.js 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/eldap.epub 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/eldap.html 2 (none) 100644 root root 0 4294967295 @@ -795,7 +795,7 @@ /usr/share/doc/packages/erlang27-doc/lib/eunit-2.9.1/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 2 (none) 120777 root root 0 4294967295 ../../../../xmerl-2.1/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 /usr/share/doc/packages/erlang27-doc/lib/eunit-2.9.1/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 2 (none) 120777 root root 0 4294967295 ../../../../xmerl-2.1/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 /usr/share/doc/packages/erlang27-doc/lib/eunit-2.9.1/doc/html/dist/remixicon-NKANDIL5.woff2 2 (none) 120777 root root 0 4294967295 ../../../../xmerl-2.1/doc/html/dist/remixicon-NKANDIL5.woff2 -/usr/share/doc/packages/erlang27-doc/lib/eunit-2.9.1/doc/html/dist/search_data-4CEF3D2D.js 2 (none) 100644 root root 0 4294967295 +/usr/share/doc/packages/erlang27-doc/lib/eunit-2.9.1/doc/html/dist/search_data-C541596B.js 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/lib/eunit-2.9.1/doc/html/dist/sidebar_items-3A2D003A.js 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/lib/eunit-2.9.1/doc/html/eunit.epub 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/lib/eunit-2.9.1/doc/html/eunit.html 2 (none) 100644 root root 0 4294967295 @@ -828,7 +828,7 @@ /usr/share/doc/packages/erlang27-doc/lib/ftp-1.2.3/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 2 (none) 120777 root root 0 4294967295 ../../../../xmerl-2.1/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 /usr/share/doc/packages/erlang27-doc/lib/ftp-1.2.3/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 2 (none) 120777 root root 0 4294967295 ../../../../xmerl-2.1/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 /usr/share/doc/packages/erlang27-doc/lib/ftp-1.2.3/doc/html/dist/remixicon-NKANDIL5.woff2 2 (none) 120777 root root 0 4294967295 ../../../../xmerl-2.1/doc/html/dist/remixicon-NKANDIL5.woff2 -/usr/share/doc/packages/erlang27-doc/lib/ftp-1.2.3/doc/html/dist/search_data-DCE6DC3D.js 2 (none) 100644 root root 0 4294967295 +/usr/share/doc/packages/erlang27-doc/lib/ftp-1.2.3/doc/html/dist/search_data-6DB131C5.js 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/lib/ftp-1.2.3/doc/html/dist/sidebar_items-B6B07F6E.js 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/lib/ftp-1.2.3/doc/html/ftp.epub 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/lib/ftp-1.2.3/doc/html/ftp.html 2 (none) 100644 root root 0 4294967295 @@ -862,7 +862,7 @@ /usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 2 (none) 120777 root root 0 4294967295 ../../../../xmerl-2.1/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 /usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 2 (none) 120777 root root 0 4294967295 ../../../../xmerl-2.1/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 /usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/dist/remixicon-NKANDIL5.woff2 2 (none) 120777 root root 0 4294967295 ../../../../xmerl-2.1/doc/html/dist/remixicon-NKANDIL5.woff2 -/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/dist/search_data-CCC5FE1B.js 2 (none) 100644 root root 0 4294967295 +/usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/dist/search_data-BA4EB9A1.js 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/dist/sidebar_items-2F64977B.js 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/http_client.html 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/http_server.html 2 (none) 100644 root root 0 4294967295 @@ -1148,7 +1148,7 @@ /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 2 (none) 120777 root root 0 4294967295 ../../../../xmerl-2.1/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 2 (none) 120777 root root 0 4294967295 ../../../../xmerl-2.1/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/dist/remixicon-NKANDIL5.woff2 2 (none) 120777 root root 0 4294967295 ../../../../xmerl-2.1/doc/html/dist/remixicon-NKANDIL5.woff2 -/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/dist/search_data-492AF504.js 2 (none) 100644 root root 0 4294967295 +/usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/dist/search_data-2DB78EC4.js 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/dist/sidebar_items-50746EC9.js 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/index.html 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco.epub 2 (none) 100644 root root 0 4294967295 @@ -1365,7 +1365,7 @@ /usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 2 (none) 120777 root root 0 4294967295 ../../../../xmerl-2.1/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 /usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 2 (none) 120777 root root 0 4294967295 ../../../../xmerl-2.1/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 /usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/dist/remixicon-NKANDIL5.woff2 2 (none) 120777 root root 0 4294967295 ../../../../xmerl-2.1/doc/html/dist/remixicon-NKANDIL5.woff2 -/usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/dist/search_data-F08ECED6.js 2 (none) 100644 root root 0 4294967295 +/usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/dist/search_data-8BDC4DA6.js 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/dist/sidebar_items-E70C9F62.js 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/index.html 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/leex.html 2 (none) 100644 root root 0 4294967295 @@ -1511,7 +1511,7 @@ /usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 2 (none) 120777 root root 0 4294967295 ../../../../xmerl-2.1/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 /usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 2 (none) 120777 root root 0 4294967295 ../../../../xmerl-2.1/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 /usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/dist/remixicon-NKANDIL5.woff2 2 (none) 120777 root root 0 4294967295 ../../../../xmerl-2.1/doc/html/dist/remixicon-NKANDIL5.woff2 -/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/dist/search_data-D2253CE5.js 2 (none) 100644 root root 0 4294967295 +/usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/dist/search_data-12AAC588.js 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/dist/sidebar_items-EAF2F83F.js 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/error_logging.html 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/index.html 2 (none) 100644 root root 0 4294967295 @@ -1884,7 +1884,7 @@ /usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 2 (none) 120777 root root 0 4294967295 ../../../../xmerl-2.1/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 /usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 2 (none) 120777 root root 0 4294967295 ../../../../xmerl-2.1/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 /usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/dist/remixicon-NKANDIL5.woff2 2 (none) 120777 root root 0 4294967295 ../../../../xmerl-2.1/doc/html/dist/remixicon-NKANDIL5.woff2 -/usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/dist/search_data-486AE036.js 2 (none) 100644 root root 0 4294967295 +/usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/dist/search_data-9671378E.js 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/dist/sidebar_items-78F60625.js 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/getting_started.html 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/index.html 2 (none) 100644 root root 0 4294967295 @@ -1925,7 +1925,7 @@ /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 2 (none) 120777 root root 0 4294967295 ../../../../xmerl-2.1/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 2 (none) 120777 root root 0 4294967295 ../../../../xmerl-2.1/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/dist/remixicon-NKANDIL5.woff2 2 (none) 120777 root root 0 4294967295 ../../../../xmerl-2.1/doc/html/dist/remixicon-NKANDIL5.woff2 -/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/dist/search_data-FCB758A3.js 2 (none) 100644 root root 0 4294967295 +/usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/dist/search_data-C30560BD.js 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/dist/sidebar_items-0E887516.js 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/eprof.html 2 (none) 100644 root root 0 4294967295 /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/erlang-el.html 2 (none) 100644 root root 0 4294967295 comparing file checksum creating rename script RPM meta information is different Extracting packages /usr/share/doc/packages/erlang27-doc/doc/404.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/404.html 2026-06-04 19:04:58.509413830 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/404.html 2026-06-04 19:04:58.511413848 +0000 @@ -131,7 +131,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/asn1.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/asn1.html 2026-06-04 19:04:58.525413978 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/asn1.html 2026-06-04 19:04:58.525413978 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/common_test.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/common_test.html 2026-06-04 19:04:58.542414136 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/common_test.html 2026-06-04 19:04:58.542414136 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/compiler.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/compiler.html 2026-06-04 19:04:58.557414275 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/compiler.html 2026-06-04 19:04:58.558414284 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/crypto.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/crypto.html 2026-06-04 19:04:58.572414414 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/crypto.html 2026-06-04 19:04:58.572414414 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/debugger.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/debugger.html 2026-06-04 19:04:58.585414535 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/debugger.html 2026-06-04 19:04:58.585414535 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/deprecations.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1235)) --- old//usr/share/doc/packages/erlang27-doc/doc/deprecations.html 2026-06-04 19:04:58.602414693 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/deprecations.html 2026-06-04 19:04:58.602414693 +0000 @@ -463,7 +463,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/design_principles.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/design_principles.html 2026-06-04 19:04:58.616414822 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/design_principles.html 2026-06-04 19:04:58.618414841 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/dialyzer.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/dialyzer.html 2026-06-04 19:04:58.635414999 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/dialyzer.html 2026-06-04 19:04:58.635414999 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/diameter.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/diameter.html 2026-06-04 19:04:58.651415147 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/diameter.html 2026-06-04 19:04:58.651415147 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/edoc.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/edoc.html 2026-06-04 19:04:58.671415333 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/edoc.html 2026-06-04 19:04:58.671415333 +0000 @@ -153,7 +153,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/efficiency_guide.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/efficiency_guide.html 2026-06-04 19:04:58.690415509 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/efficiency_guide.html 2026-06-04 19:04:58.690415509 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/eldap.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/eldap.html 2026-06-04 19:04:58.706415657 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/eldap.html 2026-06-04 19:04:58.706415657 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/embedded.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/embedded.html 2026-06-04 19:04:58.722415805 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/embedded.html 2026-06-04 19:04:58.722415805 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/erl_interface.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/erl_interface.html 2026-06-04 19:04:58.739415963 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/erl_interface.html 2026-06-04 19:04:58.739415963 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/erts.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/erts.html 2026-06-04 19:04:58.755416112 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/erts.html 2026-06-04 19:04:58.755416112 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/et.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/et.html 2026-06-04 19:04:58.770416251 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/et.html 2026-06-04 19:04:58.770416251 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/eunit.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/eunit.html 2026-06-04 19:04:58.784416381 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/eunit.html 2026-06-04 19:04:58.784416381 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/ftp.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/ftp.html 2026-06-04 19:04:58.798416510 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/ftp.html 2026-06-04 19:04:58.798416510 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/getting_started.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/getting_started.html 2026-06-04 19:04:58.813416650 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/getting_started.html 2026-06-04 19:04:58.814416659 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/inets.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/inets.html 2026-06-04 19:04:58.829416798 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/inets.html 2026-06-04 19:04:58.829416798 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/installation_guide.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/installation_guide.html 2026-06-04 19:04:58.845416946 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/installation_guide.html 2026-06-04 19:04:58.846416956 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/jinterface.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/jinterface.html 2026-06-04 19:04:58.862417104 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/jinterface.html 2026-06-04 19:04:58.862417104 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/kernel.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/kernel.html 2026-06-04 19:04:58.877417243 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/kernel.html 2026-06-04 19:04:58.879417262 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/man_index.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (61671)) --- old//usr/share/doc/packages/erlang27-doc/doc/man_index.html 2026-06-04 19:04:58.942417846 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/man_index.html 2026-06-04 19:04:58.942417846 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/megaco.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/megaco.html 2026-06-04 19:04:58.960418013 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/megaco.html 2026-06-04 19:04:58.961418023 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/mnesia.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/mnesia.html 2026-06-04 19:04:58.978418180 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/mnesia.html 2026-06-04 19:04:58.977418171 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/observer.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/observer.html 2026-06-04 19:04:58.993418319 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/observer.html 2026-06-04 19:04:58.994418329 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/odbc.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/odbc.html 2026-06-04 19:04:59.009418468 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/odbc.html 2026-06-04 19:04:59.009418468 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/os_mon.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/os_mon.html 2026-06-04 19:04:59.026418625 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/os_mon.html 2026-06-04 19:04:59.026418625 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/parsetools.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/parsetools.html 2026-06-04 19:04:59.041418765 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/parsetools.html 2026-06-04 19:04:59.041418765 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/programming_examples.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/programming_examples.html 2026-06-04 19:04:59.056418904 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/programming_examples.html 2026-06-04 19:04:59.057418913 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/public_key.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/public_key.html 2026-06-04 19:04:59.072419052 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/public_key.html 2026-06-04 19:04:59.072419052 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/readme.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (2824)) --- old//usr/share/doc/packages/erlang27-doc/doc/readme.html 2026-06-04 19:04:59.088419201 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/readme.html 2026-06-04 19:04:59.091419228 +0000 @@ -153,7 +153,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/reference_manual.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/reference_manual.html 2026-06-04 19:04:59.105419358 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/reference_manual.html 2026-06-04 19:04:59.105419358 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/reltool.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/reltool.html 2026-06-04 19:04:59.123419525 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/reltool.html 2026-06-04 19:04:59.124419535 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/removed.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (2545)) --- old//usr/share/doc/packages/erlang27-doc/doc/removed.html 2026-06-04 19:04:59.142419701 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/removed.html 2026-06-04 19:04:59.142419701 +0000 @@ -392,7 +392,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/runtime_tools.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/runtime_tools.html 2026-06-04 19:04:59.158419850 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/runtime_tools.html 2026-06-04 19:04:59.158419850 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/sasl.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/sasl.html 2026-06-04 19:04:59.174419998 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/sasl.html 2026-06-04 19:04:59.174419998 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/scheduled_for_removal.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (427)) --- old//usr/share/doc/packages/erlang27-doc/doc/scheduled_for_removal.html 2026-06-04 19:04:59.190420147 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/scheduled_for_removal.html 2026-06-04 19:04:59.191420156 +0000 @@ -216,7 +216,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/search.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/search.html 2026-06-04 19:04:59.206700038 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/search.html 2026-06-04 19:04:59.206700038 +0000 @@ -131,7 +131,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/snmp.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/snmp.html 2026-06-04 19:04:59.221420434 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/snmp.html 2026-06-04 19:04:59.221420434 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/ssh.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/ssh.html 2026-06-04 19:04:59.236420574 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/ssh.html 2026-06-04 19:04:59.236420574 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/ssl.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/ssl.html 2026-06-04 19:04:59.250420703 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/ssl.html 2026-06-04 19:04:59.250420703 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/stdlib.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/stdlib.html 2026-06-04 19:04:59.265420843 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/stdlib.html 2026-06-04 19:04:59.265420843 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/syntax_tools.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/syntax_tools.html 2026-06-04 19:04:59.282421000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/syntax_tools.html 2026-06-04 19:04:59.283421009 +0000 @@ -162,7 +162,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/system/404.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/system/404.html 2026-06-04 19:04:59.299638184 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/404.html 2026-06-04 19:04:59.299638184 +0000 @@ -135,7 +135,7 @@ Erlang programming language

-

Copyright © 1996-2026 Ericsson AB

+

Copyright © 1996-2042 Ericsson AB

/usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/applications.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (996)) --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/applications.xhtml" 2026-06-04 00:09:02.000000000 +0000 +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/applications.xhtml" 2042-07-06 13:28:26.000000000 +0000 @@ -44,8 +44,8 @@ Application Callback Module

How to start and stop the code for the application, including its supervision -tree, is described by two callback functions:

start(StartType, StartArgs) -> {ok, Pid} | {ok, Pid, State}
-stop(State)

Example:

-moduledoc {file, "../doc/arith.asciidoc"}.
--moduledoc #{since => "0.1", format => "text/asciidoc"}.
--moduledoc #{deprecated => "Use the Erlang arithmetic operators instead."}.

+of the format.

Example:

-moduledoc {file, "../doc/arith.asciidoc"}.
+-moduledoc #{since => "0.1", format => "text/asciidoc"}.
+-moduledoc #{deprecated => "Use the Erlang arithmetic operators instead."}.

@@ -129,7 +129,7 @@ We use a special number here so that we know that this number comes from this module. """. --opaque number() :: {arith, erlang:number()}. +-opaque number() :: {arith, erlang:number()}. -doc """ Adds two numbers. @@ -140,8 +140,8 @@ 1> arith:add(arith:number(1), arith:number(2)). {number, 3} ``` """. --spec add(number(), number()) -> number(). -add({number, One}, {number, Two}) -> {number, One + Two}.

+-spec add(number(), number()) -> number(). +add({number, One}, {number, Two}) -> {number, One + Two}.

@@ -153,12 +153,12 @@ automatically insert this key if there is a -deprecated attribute marking a function as deprecated.

  • equiv => unicode:chardata() | F/A | F(...) - Notes that this function is equivalent to another function in this module. The equivalence can be described using either -Func/Arity, Func(Args) or a unicode string. For example:

    -doc #{equiv => add/3}.
    -add(One, Two) -> add(One, Two, []).
    -add(One, Two, Options) -> ...

    or

    -doc #{equiv => add(One, Two, [])}.
    --spec add(One :: number(), Two :: number()) -> number().
    -add(One, Two) -> add(One, Two, []).
    -add(One, Two, Options) -> ...

    The entry into the EEP-48 doc chunk metadata is +Func/Arity, Func(Args) or a unicode string. For example:

    -doc #{equiv => add/3}.
    +add(One, Two) -> add(One, Two, []).
    +add(One, Two, Options) -> ...

    or

    -doc #{equiv => add(One, Two, [])}.
    +-spec add(One :: number(), Two :: number()) -> number().
    +add(One, Two) -> add(One, Two, []).
    +add(One, Two, Options) -> ...

    The entry into the EEP-48 doc chunk metadata is the value converted to a string.

  • exported => boolean() - A boolean/0 signifying if the entry is exported or not. This value is automatically set by the compiler and should not be set by the user.

  • @@ -169,20 +169,20 @@

    The doc signature is a short text shown to describe the function and its arguments. By default it is determined by looking at the names of the arguments in the --spec or function. For example:

    add(One, Two) -> One + Two.
    +-spec or function. For example:

    add(One, Two) -> One + Two.
     
    --spec sub(One :: integer(), Two :: integer()) -> integer().
    -sub(X, Y) -> X - Y.

    will have a signature of add(One, Two) and sub(One, Two).

    For types or callbacks, the signature is derived from the type or callback -specification. For example:

    -type number(Value) :: {number, Value}.
    +-spec sub(One :: integer(), Two :: integer()) -> integer().
    +sub(X, Y) -> X - Y.

    will have a signature of add(One, Two) and sub(One, Two).

    For types or callbacks, the signature is derived from the type or callback +specification. For example:

    -type number(Value) :: {number, Value}.
     %% signature will be `number(Value)`
     
    --opaque number() :: {number, number()}.
    +-opaque number() :: {number, number()}.
     %% signature will be `number()`
     
    --callback increment(In :: number()) -> Out.
    +-callback increment(In :: number()) -> Out.
     %% signature will be `increment(In)`
     
    --callback increment(In) -> Out when In :: number().
    +-callback increment(In) -> Out when In :: number().
     %% signature will be `increment(In)`

    If it is not possible to "easily" figure out a nice signature from the code, the MFA syntax is used instead. For example: add/2, number/1, increment/1

    It is possible to supply a custom signature by placing it as the first line of the -doc attribute. The provided signature must be in the form of a function @@ -191,7 +191,7 @@ Adds two numbers. """. -add(A, B) -> A + B.

    Will create the signature add(One, Two). The signature will be removed from the +add(A, B) -> A + B.

    Will create the signature add(One, Two). The signature will be removed from the documentation string, so in the example above only the text "Adds two numbers" will be part of the documentation. This works for functions, types, and callbacks.

    @@ -284,13 +284,13 @@ rebar3_ex_doc plugin. To set up a rebar3 project to use ExDoc to generate documentation add the following to your rebar3.config.

    %% Enable the plugin
    -{plugins, [rebar3_ex_doc]}.
    +{plugins, [rebar3_ex_doc]}.
     
    -{ex_doc, [
    -  {extras, ["README.md"]},
    /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/drivers.xhtml differs (HTML document, ASCII text, with very long lines (841))
    --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/drivers.xhtml"	2026-06-04 00:09:02.000000000 +0000
    +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/drivers.xhtml"	2042-07-06 13:28:26.000000000 +0000
    @@ -31,15 +31,15 @@
     running.

    A driver can be configured to have one lock for each port instead.

    If a driver is used in a functional way (that is, holds no state, but only does some heavy calculation and returns a result), several ports with registered names can be opened beforehand, and the port to be used can be chosen based on -the scheduler ID as follows:

    -define(PORT_NAMES(),
    -	{some_driver_01, some_driver_02, some_driver_03, some_driver_04,
    +the scheduler ID as follows:

    -define(PORT_NAMES(),
    +	{some_driver_01, some_driver_02, some_driver_03, some_driver_04,
     	 some_driver_05, some_driver_06, some_driver_07, some_driver_08,
     	 some_driver_09, some_driver_10, some_driver_11, some_driver_12,
    -	 some_driver_13, some_driver_14, some_driver_15, some_driver_16}).
    +	 some_driver_13, some_driver_14, some_driver_15, some_driver_16}).
     
    -client_port() ->
    -    element(erlang:system_info(scheduler_id) rem tuple_size(?PORT_NAMES()) + 1,
    -	    ?PORT_NAMES()).

    As long as there are no more than 16 schedulers, there will never be any lock +client_port() -> + element(erlang:system_info(scheduler_id) rem tuple_size(?PORT_NAMES()) + 1, + ?PORT_NAMES()).

    As long as there are no more than 16 schedulers, there will never be any lock contention on the port lock for the driver.

    /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/eff_guide_functions.xhtml differs (HTML document, ASCII text, with very long lines (1276)) --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/eff_guide_functions.xhtml" 2026-06-04 00:09:02.000000000 +0000 +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/eff_guide_functions.xhtml" 2042-07-06 13:28:26.000000000 +0000 @@ -31,13 +31,13 @@ rearranging clauses.

    One exception is pattern matching of binaries. The compiler does not rearrange clauses that match binaries. Placing the clause that matches against the empty binary last is usually slightly faster than placing it first.

    The following is a rather unnatural example to show another exception where -rearranging clauses is beneficial:

    DO NOT

    atom_map1(one) -> 1;
    -atom_map1(two) -> 2;
    -atom_map1(three) -> 3;
    -atom_map1(Int) when is_integer(Int) -> Int;
    -atom_map1(four) -> 4;
    -atom_map1(five) -> 5;
    -atom_map1(six) -> 6.

    The problem is the clause with the variable Int. As a variable can match +rearranging clauses is beneficial:

    DO NOT

    atom_map1(one) -> 1;
    +atom_map1(two) -> 2;
    +atom_map1(three) -> 3;
    +atom_map1(Int) when is_integer(Int) -> Int;
    +atom_map1(four) -> 4;
    +atom_map1(five) -> 5;
    +atom_map1(six) -> 6.

    The problem is the clause with the variable Int. As a variable can match anything, including the atoms four, five, and six, which the following clauses also match, the compiler must generate suboptimal code that executes as follows:

    Rewriting to either:

    DO

    atom_map2(one) -> 1;
    -atom_map2(two) -> 2;
    -atom_map2(three) -> 3;
    -atom_map2(four) -> 4;
    -atom_map2(five) -> 5;
    -atom_map2(six) -> 6;
    -atom_map2(Int) when is_integer(Int) -> Int.

    or:

    DO

    atom_map3(Int) when is_integer(Int) -> Int;
    -atom_map3(one) -> 1;
    -atom_map3(two) -> 2;
    -atom_map3(three) -> 3;
    -atom_map3(four) -> 4;
    -atom_map3(five) -> 5;
    -atom_map3(six) -> 6.

    gives slightly more efficient matching code.

    Another example:

    DO NOT

    map_pairs1(_Map, [], Ys) ->
    +exception if none of the values matched.)

    Rewriting to either:

    DO

    atom_map2(one) -> 1;
    +atom_map2(two) -> 2;
    +atom_map2(three) -> 3;
    +atom_map2(four) -> 4;
    +atom_map2(five) -> 5;
    +atom_map2(six) -> 6;
    +atom_map2(Int) when is_integer(Int) -> Int.

    or:

    DO

    atom_map3(Int) when is_integer(Int) -> Int;
    +atom_map3(one) -> 1;
    +atom_map3(two) -> 2;
    +atom_map3(three) -> 3;
    +atom_map3(four) -> 4;
    +atom_map3(five) -> 5;
    +atom_map3(six) -> 6.

    gives slightly more efficient matching code.

    Another example:

    DO NOT

    map_pairs1(_Map, [], Ys) ->
         Ys;
    -map_pairs1(_Map, Xs, []) ->
    +map_pairs1(_Map, Xs, []) ->
         Xs;
    -map_pairs1(Map, [X|Xs], [Y|Ys]) ->
    -    [Map(X, Y)|map_pairs1(Map, Xs, Ys)].

    The first argument is not a problem. It is variable, but it is a variable in +map_pairs1(Map, [X|Xs], [Y|Ys]) -> + [Map(X, Y)|map_pairs1(Map, Xs, Ys)].

    The first argument is not a problem. It is variable, but it is a variable in all clauses. The problem is the variable in the second argument, Xs, in the middle clause. Because the variable can match anything, the compiler is not allowed to rearrange the clauses, but must generate code that matches them in the order written.

    If the function is rewritten as follows, the compiler is free to rearrange the -clauses:

    DO

    map_pairs2(_Map, [], Ys) ->
    +clauses:

    DO

    map_pairs2(_Map, [], Ys) ->
         Ys;
    -map_pairs2(_Map, [_|_]=Xs, [] ) ->
    +map_pairs2(_Map, [_|_]=Xs, [] ) ->
         Xs;
    -map_pairs2(Map, [X|Xs], [Y|Ys]) ->
    -    [Map(X, Y)|map_pairs2(Map, Xs, Ys)].

    The compiler will generate code similar to this:

    DO NOT (already done by the compiler)

    explicit_map_pairs(Map, Xs0, Ys0) ->
    +map_pairs2(Map, [X|Xs], [Y|Ys]) ->
    +    [Map(X, Y)|map_pairs2(Map, Xs, Ys)].

    The compiler will generate code similar to this:

    DO NOT (already done by the compiler)

    explicit_map_pairs(Map, Xs0, Ys0) ->
         case Xs0 of
    -	[X|Xs] ->
    +	[X|Xs] ->
     	    case Ys0 of
    -		[Y|Ys] ->
    -		    [Map(X, Y)|explicit_map_pairs(Map, Xs, Ys)];
    -		[] ->
    +		[Y|Ys] ->
    +		    [Map(X, Y)|explicit_map_pairs(Map, Xs, Ys)];
    +		[] ->
     		    Xs0
     	    end;
    -	[] ->
    +	[] ->
     	    Ys0
         end.

    This is slightly faster for probably the most common case that the input lists are not empty or very short. (Another advantage is that Dialyzer can deduce a /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/eff_guide_processes.xhtml differs (HTML document, ASCII text, with very long lines (1653)) --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/eff_guide_processes.xhtml" 2026-06-04 00:09:02.000000000 +0000 +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/eff_guide_processes.xhtml" 2042-07-06 13:28:26.000000000 +0000 @@ -28,37 +28,37 @@

    An Erlang process is lightweight compared to threads and processes in operating systems.

    A newly spawned Erlang process uses 327 words of memory. The size can be found -as follows:

    Erlang/OTP 27 [erts-14.2.3] [64-bit] [smp:8:8] [ds:8:8:10] [async-threads:1] [jit]
    +as follows:

    Erlang/OTP 27 [erts-14.2.3] [64-bit] [smp:8:8] [ds:8:8:10] [async-threads:1] [jit]
     
    -Eshell V14.2.3 (press Ctrl+G to abort, type help(). for help)
    -1> Fun = fun() -> receive after infinity -> ok end end.
    +Eshell V14.2.3 (press Ctrl+G to abort, type help(). for help)
    +1> Fun = fun() -> receive after infinity -> ok end end.
     #Fun<erl_eval.43.39164016>
    -2> {_,Bytes} = process_info(spawn(Fun), memory).
    -{memory,2616}
    -3> Bytes div erlang:system_info(wordsize).
    +2> {_,Bytes} = process_info(spawn(Fun), memory).
    +{memory,2616}
    +3> Bytes div erlang:system_info(wordsize).
     327

    The size includes 233 words for the heap area (which includes the stack). The garbage collector increases the heap as needed.

    The main (outer) loop for a process must be tail-recursive. Otherwise, the -stack grows until the process terminates.

    DO NOT

    loop() ->
    +stack grows until the process terminates.

    DO NOT

    loop() ->
       receive
    -     {sys, Msg} ->
    -         handle_sys_msg(Msg),
    -         loop();
    -     {From, Msg} ->
    -          Reply = handle_msg(Msg),
    +     {sys, Msg} ->
    +         handle_sys_msg(Msg),
    +         loop();
    +     {From, Msg} ->
    +          Reply = handle_msg(Msg),
               From ! Reply,
    -          loop()
    +          loop()
       end,
    -  io:format("Message is processed~n", []).

    The call to io:format/2 will never be executed, but a return address will + io:format("Message is processed~n", []).

    The call to io:format/2 will never be executed, but a return address will still be pushed to the stack each time loop/0 is called recursively. The -correct tail-recursive version of the function looks as follows:

    DO

    loop() ->
    +correct tail-recursive version of the function looks as follows:

    DO

    loop() ->
        receive
    -      {sys, Msg} ->
    -         handle_sys_msg(Msg),
    -         loop();
    -      {From, Msg} ->
    -         Reply = handle_msg(Msg),
    +      {sys, Msg} ->
    +         handle_sys_msg(Msg),
    +         loop();
    +      {From, Msg} ->
    +         Reply = handle_msg(Msg),
              From ! Reply,
    -         loop()
    +         loop()
      end.

    @@ -98,22 +98,22 @@

    The cost of receiving messages depends on how complicated the receive expression is. A simple expression that matches any message is very cheap because it retrieves the first message in the message queue:

    DO

    receive
    -    Message -> handle_msg(Message)
    +    Message -> handle_msg(Message)
     end.

    However, this is not always convenient: we can receive a message that we do not know how to handle at this point, so it is common to only match the messages we expect:

    receive
    -    {Tag, Message} -> handle_msg(Message)
    +    {Tag, Message} -> handle_msg(Message)
     end.

    While this is convenient it means that the entire message queue must be searched until it finds a matching message. This is very expensive for processes with long message queues, so there is an optimization for the common case of -sending a request and waiting for a response shortly after:

    DO

    MRef = monitor(process, Process),
    -Process ! {self(), MRef, Request},
    +sending a request and waiting for a response shortly after:

    DO

    MRef = monitor(process, Process),
    +Process ! {self(), MRef, Request},
     receive
    -    {MRef, Reply} ->
    -        erlang:demonitor(MRef, [flush]),
    -        handle_reply(Reply);
    -    {'DOWN', MRef, _, _, Reason} ->
    -        handle_error(Reason)
    +    {MRef, Reply} ->
    +        erlang:demonitor(MRef, [flush]),
    +        handle_reply(Reply);
    +    {'DOWN', MRef, _, _, Reason} ->
    +        handle_error(Reason)
     end.

    Since the compiler knows that the reference created by monitor/2 cannot exist before the call (since it is a globally unique identifier), and that the receive only matches messages that contain @@ -137,45 +137,45 @@ efficiency_guide.erl:222: Warning: OPTIMIZED: all clauses match reference in function parameter 1

    To make it clearer exactly what code the warnings refer to, the warnings in the following examples are inserted as comments after the clause they refer to, for example:

    %% DO
    -simple_receive() ->
    +simple_receive() ->
     %% efficiency_guide.erl:194: Warning: INFO: not a selective receive, this is always fast
     receive
    -    Message -> handle_msg(Message)
    +    Message -> handle_msg(Message)
     end.
     
     %% DO NOT, unless Tag is known to be a suitable reference: see
     %% cross_function_receive/0 further down.
    -selective_receive(Tag, Message) ->
    +selective_receive(Tag, Message) ->
     %% efficiency_guide.erl:200: Warning: NOT OPTIMIZED: all clauses do not match a suitable reference
     receive
    -    {Tag, Message} -> handle_msg(Message)
    +    {Tag, Message} -> handle_msg(Message)
     end.
     
     %% DO
    -optimized_receive(Process, Request) ->
    +optimized_receive(Process, Request) ->
     %% efficiency_guide.erl:206: Warning: OPTIMIZED: reference used to mark a message queue position
    -    MRef = monitor(process, Process),
    -    Process ! {self(), MRef, Request},
    +    MRef = monitor(process, Process),
    +    Process ! {self(), MRef, Request},
         %% efficiency_guide.erl:208: Warning: OPTIMIZED: matches reference created by monitor/2 at efficiency_guide.erl:206
         receive
    -        {MRef, Reply} ->
    -        erlang:demonitor(MRef, [flush]),
    -        handle_reply(Reply);
    -    {'DOWN', MRef, _, _, Reason} ->
    -    handle_error(Reason)
    +        {MRef, Reply} ->
    +        erlang:demonitor(MRef, [flush]),
    +        handle_reply(Reply);
    +    {'DOWN', MRef, _, _, Reason} ->
    +    handle_error(Reason)
         end.
     
     %% DO
    -cross_function_receive() ->
    +cross_function_receive() ->
         %% efficiency_guide.erl:218: Warning: OPTIMIZED: reference used to mark a message queue position
    -    Ref = make_ref(),
    +    Ref = make_ref(),
         %% efficiency_guide.erl:219: Warning: INFO: passing reference created by make_ref/0 at efficiency_guide.erl:218
    -    cross_function_receive(Ref).
    +    cross_function_receive(Ref).
     
    -cross_function_receive(Ref) ->
    +cross_function_receive(Ref) ->
         %% efficiency_guide.erl:222: Warning: OPTIMIZED: all clauses match reference in function parameter 1
         receive
    -        {Ref, Message} -> handle_msg(Message)
    +        {Ref, Message} -> handle_msg(Message)
         end.

    @@ -186,8 +186,8 @@ each loaded module has its own pool. The following function does not build the tuple every time it is called (only to have it discarded the next time the garbage collector was run), but the tuple is located in the module's literal -pool:

    DO

    days_in_month(M) ->
    -    element(M, {31,28,31,30,31,30,31,31,30,31,30,31}).

    If a literal, or a term that contains a literal, is inserted into an Ets table, +pool:

    DO

    days_in_month(M) ->
    +    element(M, {31,28,31,30,31,30,31,31,30,31,30,31}).

    If a literal, or a term that contains a literal, is inserted into an Ets table, it is copied. The reason is that the module containing the literal can be unloaded in the future.

    When a literal is sent to another process, it is not copied. When a module holding a literal is unloaded, the literal will be copied to the heap of all @@ -202,28 +202,28 @@ Loss of Sharing

    -

    An Erlang term can have shared subterms. Here is a simple example:

    {SubTerm, SubTerm}

    Shared subterms are not preserved in the following cases:

    • When a term is sent to another process
    • When a term is passed as the initial process arguments in the spawn call
    • When a term is stored in an Ets table

    That is an optimization. Most applications do not send messages with shared -subterms.

    The following example shows how a shared subterm can be created:

    kilo_byte() ->
    -    kilo_byte(10, [42]).
    +

    An Erlang term can have shared subterms. Here is a simple example:

    {SubTerm, SubTerm}

    Shared subterms are not preserved in the following cases:

    • When a term is sent to another process
    • When a term is passed as the initial process arguments in the spawn call
    • When a term is stored in an Ets table

    That is an optimization. Most applications do not send messages with shared +subterms.

    The following example shows how a shared subterm can be created:

    kilo_byte() ->
    +    kilo_byte(10, [42]).
     
    -kilo_byte(0, Acc) ->
    +kilo_byte(0, Acc) ->
         Acc;
    -kilo_byte(N, Acc) ->
    -    kilo_byte(N-1, [Acc|Acc]).

    kilo_byte/1 creates a deep list. If list_to_binary/1 +kilo_byte(N, Acc) -> + kilo_byte(N-1, [Acc|Acc]).

    kilo_byte/1 creates a deep list. If list_to_binary/1 is called, the deep list can be converted to a binary of 1024 bytes:

    1> byte_size(list_to_binary(efficiency_guide:kilo_byte())).
     1024

    Using the erts_debug:size/1 BIF, it can be seen that the deep list only -requires 22 words of heap space:

    2> erts_debug:size(efficiency_guide:kilo_byte()).
    +requires 22 words of heap space:

    2> erts_debug:size(efficiency_guide:kilo_byte()).
     22

    Using the erts_debug:flat_size/1 BIF, the size of the deep list can be calculated if sharing is ignored. It becomes the size of the list when it has -been sent to another process or stored in an Ets table:

    3> erts_debug:flat_size(efficiency_guide:kilo_byte()).
    +been sent to another process or stored in an Ets table:

    3> erts_debug:flat_size(efficiency_guide:kilo_byte()).
     4094

    It can be verified that sharing will be lost if the data is inserted into an Ets -table:

    4> T = ets:new(tab, []).
    +table:

    4> T = ets:new(tab, []).
     #Ref<0.1662103692.2407923716.214181>
    -5> ets:insert(T, {key,efficiency_guide:kilo_byte()}).
    +5> ets:insert(T, {key,efficiency_guide:kilo_byte()}).
     true
    /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/erl_interface.xhtml differs (HTML document, ASCII text, with very long lines (2648))
    --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/erl_interface.xhtml"	2026-06-04 00:09:02.000000000 +0000
    +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/erl_interface.xhtml"	2042-07-06 13:28:26.000000000 +0000
    @@ -29,111 +29,111 @@
       Erlang Program
     

    The following example shows an Erlang program communicating with a C program -over a plain port with home made encoding:

    -module(complex1).
    --export([start/1, stop/0, init/1]).
    --export([foo/1, bar/1]).
    -
    -start(ExtPrg) ->
    -    spawn(?MODULE, init, [ExtPrg]).
    -stop() ->
    +over a plain port with home made encoding:

    -module(complex1).
    +-export([start/1, stop/0, init/1]).
    +-export([foo/1, bar/1]).
    +
    +start(ExtPrg) ->
    +    spawn(?MODULE, init, [ExtPrg]).
    +stop() ->
         complex ! stop.
     
    -foo(X) ->
    -    call_port({foo, X}).
    -bar(Y) ->
    -    call_port({bar, Y}).
    +foo(X) ->
    +    call_port({foo, X}).
    +bar(Y) ->
    +    call_port({bar, Y}).
     
    -call_port(Msg) ->
    -    complex ! {call, self(), Msg},
    +call_port(Msg) ->
    +    complex ! {call, self(), Msg},
         receive
    -	{complex, Result} ->
    +	{complex, Result} ->
     	    Result
         end.
     
    -init(ExtPrg) ->
    -    register(complex, self()),
    -    process_flag(trap_exit, true),
    -    Port = open_port({spawn, ExtPrg}, [{packet, 2}]),
    -    loop(Port).
    +init(ExtPrg) ->
    +    register(complex, self()),
    +    process_flag(trap_exit, true),
    +    Port = open_port({spawn, ExtPrg}, [{packet, 2}]),
    +    loop(Port).
     
    -loop(Port) ->
    +loop(Port) ->
         receive
    -	{call, Caller, Msg} ->
    -	    Port ! {self(), {command, encode(Msg)}},
    +	{call, Caller, Msg} ->
    +	    Port ! {self(), {command, encode(Msg)}},
     	    receive
    -		{Port, {data, Data}} ->
    -		    Caller ! {complex, decode(Data)}
    +		{Port, {data, Data}} ->
    +		    Caller ! {complex, decode(Data)}
     	    end,
    -	    loop(Port);
    +	    loop(Port);
     	stop ->
    -	    Port ! {self(), close},
    +	    Port ! {self(), close},
     	    receive
    -		{Port, closed} ->
    -		    exit(normal)
    +		{Port, closed} ->
    +		    exit(normal)
     	    end;
    -	{'EXIT', Port, Reason} ->
    -	    exit(port_terminated)
    +	{'EXIT', Port, Reason} ->
    +	    exit(port_terminated)
         end.
     
    -encode({foo, X}) -> [1, X];
    -encode({bar, Y}) -> [2, Y].
    +encode({foo, X}) -> [1, X];
    +encode({bar, Y}) -> [2, Y].
     
    -decode([Int]) -> Int.

    There are two differences when using Erl_Interface on the C side compared to the +decode([Int]) -> Int.

    There are two differences when using Erl_Interface on the C side compared to the example in Ports, using only the plain port:

    • As Erl_Interface operates on the Erlang external term format, the port must be set to use binaries.
    • Instead of inventing an encoding/decoding scheme, the term_to_binary/1 and -binary_to_term/1 BIFs are to be used.

    That is:

    open_port({spawn, ExtPrg}, [{packet, 2}])

    is replaced with:

    open_port({spawn, ExtPrg}, [{packet, 2}, binary])

    And:

    Port ! {self(), {command, encode(Msg)}},
    +binary_to_term/1 BIFs are to be used.

    That is:

    open_port({spawn, ExtPrg}, [{packet, 2}])

    is replaced with:

    open_port({spawn, ExtPrg}, [{packet, 2}, binary])

    And:

    Port ! {self(), {command, encode(Msg)}},
     receive
    -  {Port, {data, Data}} ->
    -    Caller ! {complex, decode(Data)}
    -end

    is replaced with:

    Port ! {self(), {command, term_to_binary(Msg)}},
    +  {Port, {data, Data}} ->
    +    Caller ! {complex, decode(Data)}
    +end

    is replaced with:

    Port ! {self(), {command, term_to_binary(Msg)}},
     receive
    -  {Port, {data, Data}} ->
    -    Caller ! {complex, binary_to_term(Data)}
    -end

    The resulting Erlang program is as follows:

    -module(complex2).
    --export([start/1, stop/0, init/1]).
    --export([foo/1, bar/1]).
    -
    -start(ExtPrg) ->
    -    spawn(?MODULE, init, [ExtPrg]).
    -stop() ->
    +  {Port, {data, Data}} ->
    +    Caller ! {complex, binary_to_term(Data)}
    +end

    The resulting Erlang program is as follows:

    -module(complex2).
    +-export([start/1, stop/0, init/1]).
    +-export([foo/1, bar/1]).
    +
    +start(ExtPrg) ->
    +    spawn(?MODULE, init, [ExtPrg]).
    +stop() ->
         complex ! stop.
     
    -foo(X) ->
    -    call_port({foo, X}).
    -bar(Y) ->
    -    call_port({bar, Y}).
    +foo(X) ->
    +    call_port({foo, X}).
    +bar(Y) ->
    +    call_port({bar, Y}).
     
    -call_port(Msg) ->
    -    complex ! {call, self(), Msg},
    +call_port(Msg) ->
    +    complex ! {call, self(), Msg},
         receive
    -	{complex, Result} ->
    +	{complex, Result} ->
     	    Result
         end.
     
    -init(ExtPrg) ->
    -    register(complex, self()),
    -    process_flag(trap_exit, true),
    -    Port = open_port({spawn, ExtPrg}, [{packet, 2}, binary]),
    -    loop(Port).
    +init(ExtPrg) ->
    +    register(complex, self()),
    +    process_flag(trap_exit, true),
    +    Port = open_port({spawn, ExtPrg}, [{packet, 2}, binary]),
    +    loop(Port).
     
    -loop(Port) ->
    +loop(Port) ->
         receive
    -	{call, Caller, Msg} ->
    -	    Port ! {self(), {command, term_to_binary(Msg)}},
    +	{call, Caller, Msg} ->
    +	    Port ! {self(), {command, term_to_binary(Msg)}},
     	    receive
    -		{Port, {data, Data}} ->
    -		    Caller ! {complex, binary_to_term(Data)}
    +		{Port, {data, Data}} ->
    +		    Caller ! {complex, binary_to_term(Data)}
     	    end,
    -	    loop(Port);
    +	    loop(Port);
     	stop ->
    -	    Port ! {self(), close},
    +	    Port ! {self(), close},
     	    receive
    -		{Port, closed} ->
    -		    exit(normal)
    +		{Port, closed} ->
    +		    exit(normal)
     	    end;
    -	{'EXIT', Port, Reason} ->
    -	    exit(port_terminated)
    +	{'EXIT', Port, Reason} ->
    +	    exit(port_terminated)
         end.

    Notice that calling complex2:foo/1 and complex2:bar/1 results in the tuple {foo,X} or {bar,Y} being sent to the complex process, which codes them as binaries and sends them to the port. This means that the C program must be able @@ -153,53 +153,53 @@ typedef unsigned char byte; -int read_cmd(byte *buf); -int write_cmd(byte *buf, int len); -int foo(int x); -int bar(int y); - -static void fail(int place) { - fprintf(stderr, "Something went wrong %d\n", place); - exit(1); -} +int read_cmd(byte *buf); +int write_cmd(byte *buf, int len); +int foo(int x); +int bar(int y); /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/error_logging.xhtml differs (HTML document, ASCII text, with very long lines (1788)) --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/error_logging.xhtml" 2026-06-04 00:09:02.000000000 +0000 +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/error_logging.xhtml" 2042-07-06 13:28:26.000000000 +0000 @@ -52,7 +52,7 @@ logger_sasl_compatible to true. For more information, see SASL Error Logging in the SASL User's Guide.

    % erl -kernel logger_level info
    -Erlang/OTP 21 [erts-10.0] [source-13c50db] [64-bit] [smp:4:4] [ds:4:4:10] [async-threads:1] [hipe]
    +Erlang/OTP 21 [erts-10.0] [source-13c50db] [64-bit] [smp:4:4] [ds:4:4:10] [async-threads:1] [hipe]
     
     =PROGRESS REPORT==== 8-Jun-2018::16:54:19.916404 ===
         application: kernel
    @@ -61,22 +61,22 @@
         application: stdlib
         started_at: nonode@nohost
     =PROGRESS REPORT==== 8-Jun-2018::16:54:19.925755 ===
    -    supervisor: {local,kernel_safe_sup}
    -    started: [{pid,<0.74.0>},
    -              {id,disk_log_sup},
    -              {mfargs,{disk_log_sup,start_link,[]}},
    -              {restart_type,permanent},
    -              {shutdown,1000},
    -              {child_type,supervisor}]
    +    supervisor: {local,kernel_safe_sup}
    +    started: [{pid,<0.74.0>},
    +              {id,disk_log_sup},
    +              {mfargs,{disk_log_sup,start_link,[]}},
    +              {restart_type,permanent},
    +              {shutdown,1000},
    +              {child_type,supervisor}]
     =PROGRESS REPORT==== 8-Jun-2018::16:54:19.926056 ===
    -    supervisor: {local,kernel_safe_sup}
    -    started: [{pid,<0.75.0>},
    -              {id,disk_log_server},
    -              {mfargs,{disk_log_server,start_link,[]}},
    -              {restart_type,permanent},
    -              {shutdown,2000},
    -              {child_type,worker}]
    -Eshell V10.0  (abort with ^G)
    +    supervisor: {local,kernel_safe_sup}
    +    started: [{pid,<0.75.0>},
    +              {id,disk_log_server},
    +              {mfargs,{disk_log_server,start_link,[]}},
    +              {restart_type,permanent},
    +              {shutdown,2000},
    +              {child_type,worker}]
    +Eshell V10.0  (abort with ^G)
     1>
    /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/errors.xhtml differs (HTML document, ASCII text, with very long lines (1230)) --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/errors.xhtml" 2026-06-04 00:09:02.000000000 +0000 +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/errors.xhtml" 2042-07-06 13:28:26.000000000 +0000 @@ -60,14 +60,14 @@ Exit Reason), and a stack trace (which aids in finding the code location of the exception).

    The stack trace can be bound to a variable from within a try expression for any exception class, or as part of the exit reason when a run-time error is -caught by a catch. Example:

    > {'EXIT',{test,Stacktrace}} = (catch error(test)), Stacktrace.
    -[{shell,apply_fun,3,[]},
    - {erl_eval,do_apply,6,[]},
    - ...]
    -> try throw(test) catch Class:Reason:Stacktrace -> Stacktrace end.
    -[{shell,apply_fun,3,[]},
    - {erl_eval,do_apply,6,[]},
    - ...]

    +caught by a catch. Example:

    > {'EXIT',{test,Stacktrace}} = (catch error(test)), Stacktrace.
    +[{shell,apply_fun,3,[]},
    + {erl_eval,do_apply,6,[]},
    + ...]
    +> try throw(test) catch Class:Reason:Stacktrace -> Stacktrace end.
    +[{shell,apply_fun,3,[]},
    + {erl_eval,do_apply,6,[]},
    + ...]

    /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/events.xhtml differs (HTML document, ASCII text, with very long lines (784)) --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/events.xhtml" 2026-06-04 00:09:02.000000000 +0000 +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/events.xhtml" 2042-07-06 13:28:26.000000000 +0000 @@ -44,35 +44,35 @@ Example

    The callback module for the event handler writing error messages to the terminal -can look as follows:

    -module(terminal_logger).
    --behaviour(gen_event).
    +can look as follows:

    -module(terminal_logger).
    +-behaviour(gen_event).
     
    --export([init/1, handle_event/2, terminate/2]).
    +-export([init/1, handle_event/2, terminate/2]).
     
    -init(_Args) ->
    -    {ok, []}.
    +init(_Args) ->
    +    {ok, []}.
     
    -handle_event(ErrorMsg, State) ->
    -    io:format("***Error*** ~p~n", [ErrorMsg]),
    -    {ok, State}.
    +handle_event(ErrorMsg, State) ->
    +    io:format("***Error*** ~p~n", [ErrorMsg]),
    +    {ok, State}.
     
    -terminate(_Args, _State) ->
    +terminate(_Args, _State) ->
         ok.

    The callback module for the event handler writing error messages to a file can -look as follows:

    -module(file_logger).
    --behaviour(gen_event).
    +look as follows:

    -module(file_logger).
    +-behaviour(gen_event).
     
    --export([init/1, handle_event/2, terminate/2]).
    +-export([init/1, handle_event/2, terminate/2]).
     
    -init(File) ->
    -    {ok, Fd} = file:open(File, read),
    -    {ok, Fd}.
    -
    -handle_event(ErrorMsg, Fd) ->
    -    io:format(Fd, "***Error*** ~p~n", [ErrorMsg]),
    -    {ok, Fd}.
    +init(File) ->
    +    {ok, Fd} = file:open(File, read),
    +    {ok, Fd}.
    +
    +handle_event(ErrorMsg, Fd) ->
    +    io:format(Fd, "***Error*** ~p~n", [ErrorMsg]),
    +    {ok, Fd}.
     
    -terminate(_Args, Fd) ->
    -    file:close(Fd).

    The code is explained in the next sections.

    +terminate(_Args, Fd) -> + file:close(Fd).

    The code is explained in the next sections.

    @@ -93,19 +93,19 @@ Adding an Event Handler

    The following example shows how to start an event manager and add an event -handler to it by using the shell:

    1> gen_event:start({local, error_man}).
    -{ok,<0.31.0>}
    -2> gen_event:add_handler(error_man, terminal_logger, []).
    +handler to it by using the shell:

    1> gen_event:start({local, error_man}).
    +{ok,<0.31.0>}
    +2> gen_event:add_handler(error_man, terminal_logger, []).
     ok

    This function sends a message to the event manager registered as error_man, telling it to add the event handler terminal_logger. The event manager calls the callback function terminal_logger:init([]), where the argument [] is the third argument to add_handler. init/1 is expected to return {ok, State}, -where State is the internal state of the event handler.

    init(_Args) ->
    -    {ok, []}.

    Here, init/1 does not need any input data and ignores its argument. For +where State is the internal state of the event handler.

    init(_Args) ->
    +    {ok, []}.

    Here, init/1 does not need any input data and ignores its argument. For terminal_logger, the internal state is not used. For file_logger, the -internal state is used to save the open file descriptor.

    init(File) ->
    -    {ok, Fd} = file:open(File, read),
    -    {ok, Fd}.

    +internal state is used to save the open file descriptor.

    init(File) ->
    +    {ok, Fd} = file:open(File, read),
    +    {ok, Fd}.

    @@ -117,25 +117,25 @@ is received, the event manager calls handle_event(Event, State) for each installed event handler, in the same order as they were added. The function is expected to return a tuple {ok,State1}, where State1 is a new value for the -state of the event handler.

    In terminal_logger:

    handle_event(ErrorMsg, State) ->
    -    io:format("***Error*** ~p~n", [ErrorMsg]),
    -    {ok, State}.

    In file_logger:

    handle_event(ErrorMsg, Fd) ->
    -    io:format(Fd, "***Error*** ~p~n", [ErrorMsg]),
    -    {ok, Fd}.

    +state of the event handler.

    In terminal_logger:

    handle_event(ErrorMsg, State) ->
    +    io:format("***Error*** ~p~n", [ErrorMsg]),
    +    {ok, State}.

    In file_logger:

    handle_event(ErrorMsg, Fd) ->
    +    io:format(Fd, "***Error*** ~p~n", [ErrorMsg]),
    +    {ok, Fd}.

    Deleting an Event Handler

    -
    4> gen_event:delete_handler(error_man, terminal_logger, []).
    +
    4> gen_event:delete_handler(error_man, terminal_logger, []).
     ok

    This function sends a message to the event manager registered as error_man, telling it to delete the event handler terminal_logger. The event manager calls the callback function terminal_logger:terminate([], State), where the argument [] is the third argument to delete_handler. terminate/2 is to be the opposite of init/1 and do any necessary cleaning up. Its return value is -ignored.

    For terminal_logger, no cleaning up is necessary:

    terminate(_Args, _State) ->
    -    ok.

    For file_logger, the file descriptor opened in init must be closed:

    terminate(_Args, Fd) ->
    -    file:close(Fd).

    +ignored.

    For terminal_logger, no cleaning up is necessary:

    terminate(_Args, _State) ->
    +    ok.

    For file_logger, the file descriptor opened in init must be closed:

    terminate(_Args, Fd) ->
    +    file:close(Fd).

    @@ -158,7 +158,7 @@ Standalone Event Managers

    -

    An event manager can also be stopped by calling:

    1> gen_event:stop(error_man).
    +

    An event manager can also be stopped by calling:

    1> gen_event:stop(error_man).
     ok

    @@ -170,13 +170,13 @@ implemented to handle them. Examples of other messages are exit messages if the event manager is linked to other processes than the supervisor (for example via gen_event:add_sup_handler/3) and is -trapping exit signals.

    handle_info({'EXIT', Pid, Reason}, State) ->
    +trapping exit signals.

    handle_info({'EXIT', Pid, Reason}, State) ->
         %% Code to handle exits here.
         ...
    -    {noreply, State1}.

    The final function to implement is code_change/3:

    code_change(OldVsn, State, Extra) ->
    +    {noreply, State1}.

    The final function to implement is code_change/3:

    code_change(OldVsn, State, Extra) ->
         %% Code to convert state (and more) during code change.
         ...
    -    {ok, NewState}.
    +
    {ok, NewState}.
    /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/example.xhtml differs (HTML document, ASCII text, with very long lines (359)) --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/example.xhtml" 2026-06-04 00:09:02.000000000 +0000 +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/example.xhtml" 2042-07-06 13:28:26.000000000 +0000 @@ -30,17 +30,17 @@ code, solving a complex problem, in your Erlang program. Suppose for example, that you have the following C functions that you would like to call from Erlang:

    /* complex.c */
     
    -int foo(int x) {
    +int foo(int x) {
       return x+1;
    -}
    +}
     
    -int bar(int y) {
    +int bar(int y) {
       return y*2;
    -}

    The functions are deliberately kept as simple as possible, for readability +}

    The functions are deliberately kept as simple as possible, for readability reasons.

    From an Erlang perspective, it is preferable to be able to call foo and bar without having to bother about that they are C functions:

    % Erlang code
     ...
    -Res = complex:foo(X),
    +Res = complex:foo(X),
     ...

    Here, the communication with C is hidden in the implementation of complex.erl. In the following sections, it is shown how this module can be implemented using the different interoperability mechanisms.

    /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/expressions.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (1490)) --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/expressions.xhtml" 2026-06-04 00:09:02.000000000 +0000 +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/expressions.xhtml" 2042-07-06 13:28:26.000000000 +0000 @@ -60,12 +60,12 @@ single assignment, that is, a variable can only be bound once.

    The anonymous variable is denoted by underscore (_) and can be used when a variable is required but its value can be ignored.

    Example:

    [H|_] = [1,2,3]

    Variables starting with underscore (_), for example, _Height, are normal variables, not anonymous. However, they are ignored by the compiler in the sense -that they do not generate warnings.

    Example:

    The following code:

    member(_, []) ->
    -    [].

    can be rewritten to be more readable:

    member(Elem, []) ->
    -    [].

    This causes a warning for an unused variable, Elem. To avoid the warning, -the code can be rewritten to:

    member(_Elem, []) ->
    -    [].

    Notice that since variables starting with an underscore are not anonymous, the -following example matches:

    {_,_} = {1,2}

    But this example fails:

    {_N,_N} = {1,2}

    The scope for a variable is its function clause. Variables bound in a branch of +that they do not generate warnings.

    Example:

    The following code:

    member(_, []) ->
    +    [].

    can be rewritten to be more readable:

    member(Elem, []) ->
    +    [].

    This causes a warning for an unused variable, Elem. To avoid the warning, +the code can be rewritten to:

    member(_Elem, []) ->
    +    [].

    Notice that since variables starting with an underscore are not anonymous, the +following example matches:

    {_,_} = {1,2}

    But this example fails:

    {_N,_N} = {1,2}

    The scope for a variable is its function clause. Variables bound in a branch of an if, case, or receive expression must be bound in all branches to have a value outside the expression. Otherwise they are regarded as unsafe outside the expression.

    For the try expression variable scoping is limited so that variables bound in @@ -76,8 +76,8 @@ Patterns

    A pattern has the same structure as a term but can contain unbound variables.

    Example:

    Name1
    -[H|T]
    -{error,Reason}

    Patterns are allowed in clause heads, case expressions, +[H|T] +{error,Reason}

    Patterns are allowed in clause heads, case expressions, receive expressions, and match expressions.

    @@ -87,13 +87,13 @@

    If Pattern1 and Pattern2 are valid patterns, the following is also a valid pattern:

    Pattern1 = Pattern2

    When matched against a term, both Pattern1 and Pattern2 are matched against -the term. The idea behind this feature is to avoid reconstruction of terms.

    Example:

    f({connect,From,To,Number,Options}, To) ->
    -    Signal = {connect,From,To,Number,Options},
    +the term. The idea behind this feature is to avoid reconstruction of terms.

    Example:

    f({connect,From,To,Number,Options}, To) ->
    +    Signal = {connect,From,To,Number,Options},
         ...;
    -f(Signal, To) ->
    -    ignore.

    can instead be written as

    f({connect,_,To,_,_} = Signal, To) ->
    +f(Signal, To) ->
    +    ignore.

    can instead be written as

    f({connect,_,To,_,_} = Signal, To) ->
         ...;
    -f(Signal, To) ->
    +f(Signal, To) ->
         ignore.

    The compound pattern operator does not imply that its operands are matched in any particular order. That means that it is not legal to bind a variable in Pattern1 and use it in Pattern2, or vice versa.

    @@ -102,15 +102,15 @@ String Prefix in Patterns

    -

    When matching strings, the following is a valid pattern:

    f("prefix" ++ Str) -> ...

    This is syntactic sugar for the equivalent, but harder to read:

    f([$p,$r,$e,$f,$i,$x | Str]) -> ...

    +

    When matching strings, the following is a valid pattern:

    f("prefix" ++ Str) -> ...

    This is syntactic sugar for the equivalent, but harder to read:

    f([$p,$r,$e,$f,$i,$x | Str]) -> ...

    Expressions in Patterns

    An arithmetic expression can be used within a pattern if it meets both of the -following two conditions:

    • It uses only numeric or bitwise operators.
    • Its value can be evaluated to a constant when complied.

    Example:

    case {Value, Result} of
    -    {?THRESHOLD+1, ok} -> ...

    +following two conditions:

    • It uses only numeric or bitwise operators.
    • Its value can be evaluated to a constant when complied.

    Example:

    case {Value, Result} of
    +    {?THRESHOLD+1, ok} -> ...

    @@ -118,15 +118,15 @@

    The following matches Pattern against Expr:

    Pattern = Expr

    If the matching succeeds, any unbound variable in the pattern becomes bound and the value of Expr is returned.

    If multiple match operators are applied in sequence, they will be evaluated from -right to left.

    If the matching fails, a badmatch run-time error occurs.

    Examples:

    1> {A, B} = T = {answer, 42}.
    -{answer,42}
    +right to left.

    If the matching fails, a badmatch run-time error occurs.

    Examples:

    1> {A, B} = T = {answer, 42}.
    +{answer,42}
     2> A.
     answer
     3> B.
     42
     4> T.
    -{answer,42}
    -5> {C, D} = [1, 2].
    +{answer,42}
    +5> {C, D} = [1, 2].
     ** exception error: no match of right-hand side value [1,2]

    Because multiple match operators are evaluated from right to left, it means that:

    Pattern1 = Pattern2 = . . . = PatternN = Expression

    is equivalent to:

    Temporary = Expression,
     PatternN = Temporary,
    @@ -148,20 +148,20 @@
     compound pattern matches if all of its constituent patterns match. It is not
     legal for a pattern that is part of a compound pattern to use variables (as keys
     in map patterns or sizes in binary patterns) bound in other sub patterns of the
    -same compound pattern.

    Examples:

    1> fun(#{Key := Value} = #{key := Key}) -> Value end.
    +same compound pattern.

    Examples:

    1> fun(#{Key := Value} = #{key := Key}) -> Value end.
     * 1:7: variable 'Key' is unbound
    -2> F = fun({A, B} = E) -> {E, A + B} end, F({1,2}).
    -{{1,2},3}
    -3> G = fun(<<A:8,B:8>> = <<C:16>>) -> {A, B, C} end, G(<<42,43>>).
    -{42,43,10795}

    The match operator is allowed everywhere an expression is allowed. It is used +2> F = fun({A, B} = E) -> {E, A + B} end, F({1,2}). +{{1,2},3} +3> G = fun(<<A:8,B:8>> = <<C:16>>) -> {A, B, C} end, G(<<42,43>>). +{42,43,10795}

    The match operator is allowed everywhere an expression is allowed. It is used to match the value of an expression to a pattern. If multiple match operators -are applied in sequence, they will be evaluated from right to left.

    Examples:

    1> M = #{key => key2, key2 => value}.
    -#{key => key2,key2 => value}
    -2> f(Key), #{Key := Value} = #{key := Key} = M, Value.
    +are applied in sequence, they will be evaluated from right to left.

    Examples:

    1> M = #{key => key2, key2 => value}.
    +#{key => key2,key2 => value}
    +2> f(Key), #{Key := Value} = #{key := Key} = M, Value.
     value
    -3> f(Key), #{Key := Value} = (#{key := Key} = M), Value.
    +3> f(Key), #{Key := Value} = (#{key := Key} = M), Value.
     value
    -4> f(Key), (#{Key := Value} = #{key := Key}) = M, Value.
    +4> f(Key), (#{Key := Value} = #{key := Key}) = M, Value.
     * 1:12: variable 'Key' is unbound
     5> <<X:Y>> = begin Y = 8, <<42:8>> end, X.
     42

    The expression at prompt 2> first matches the value of variable M against @@ -185,22 +185,22 @@ Function Calls -

    ExprF(Expr1,...,ExprN)
    -ExprM:ExprF(Expr1,...,ExprN)

    In the first form of function calls, ExprM:ExprF(Expr1,...,ExprN), each of +

    ExprF(Expr1,...,ExprN)
    +ExprM:ExprF(Expr1,...,ExprN)

    In the first form of function calls, ExprM:ExprF(Expr1,...,ExprN), each of ExprM and ExprF must be an atom or an expression that evaluates to an atom. The function is said to be called by using the fully qualified function name. -This is often referred to as a remote or external function call.

    Example:

    lists:keyfind(Name, 1, List)

    In the second form of function calls, ExprF(Expr1,...,ExprN), ExprF must be +This is often referred to as a remote or external function call.

    Example:

    lists:keyfind(Name, 1, List)

    In the second form of function calls, ExprF(Expr1,...,ExprN), ExprF must be an atom or evaluate to a fun.

    If ExprF is an atom, the function is said to be called by using the implicitly qualified function name. If the function ExprF is locally defined, it is called. Alternatively, if ExprF is explicitly imported from the M module, M:ExprF(Expr1,...,ExprN) is called. If ExprF is neither declared locally nor explicitly imported, ExprF must be the name of an automatically -imported BIF.

    Examples:

    handle(Msg, State)
    -spawn(m, init, [])

    Examples where ExprF is a fun:

    1> Fun1 = fun(X) -> X+1 end,
    -Fun1(3).
    +imported BIF.

    Examples:

    handle(Msg, State)
    +spawn(m, init, [])

    Examples where ExprF is a fun:

    1> Fun1 = fun(X) -> X+1 end,
    +Fun1(3).
     4
    -2> fun lists:append/2([1,2], [3,4]).
    -[1,2,3,4]
    +2> fun lists:append/2([1,2], [3,4]).
    +[1,2,3,4]
     3>

    Notice that when calling a local function, there is a difference between using the implicitly or fully qualified function name. The latter always refers to the latest version of the module. See @@ -225,32 +225,32 @@ (ERTS version 5.8) and have an implicitly qualified call to that function in your code, you either need to explicitly remove the auto-import using a compiler directive, or replace the call with a fully qualified function call. Otherwise -you get a compilation error. See the following example:

    -export([length/1,f/1]).
    +you get a compilation error. See the following example:

    -export([length/1,f/1]).
     
    --compile({no_auto_import,[length/1]}). % erlang:length/1 no longer autoimported
    +-compile({no_auto_import,[length/1]}). % erlang:length/1 no longer autoimported
     
    -length([]) ->
    +length([]) ->
         0;
    -length([H|T]) ->
    -    1 + length(T). %% Calls the local function length/1
    +length([H|T]) ->
    +    1 + length(T). %% Calls the local function length/1
     
    -f(X) when erlang:length(X) > 3 -> %% Calls erlang:length/1,
    +f(X) when erlang:length(X) > 3 -> %% Calls erlang:length/1,
                                       %% which is allowed in guards
         long.

    The same logic applies to explicitly imported functions from other modules, as to locally defined functions. It is not allowed to both import a function from -another module and have the function declared in the module at the same time:

    -export([f/1]).
    +another module and have the function declared in the module at the same time:

    -export([f/1]).
     
    --compile({no_auto_import,[length/1]}). % erlang:length/1 no longer autoimported
    +-compile({no_auto_import,[length/1]}). % erlang:length/1 no longer autoimported
     
    --import(mod,[length/1]).
    +-import(mod,[length/1]).
     
    -f(X) when erlang:length(X) > 33 -> %% Calls erlang:length/1,
    +f(X) when erlang:length(X) > 33 -> %% Calls erlang:length/1,
                                        %% which is allowed in guards
     
    -    erlang:length(X);              %% Explicit call to erlang:length in body
    +    erlang:length(X);              %% Explicit call to erlang:length in body
     
    -f(X) ->
    -    length(X).                     %% mod:length/1 is called

    For auto-imported BIFs added in Erlang/OTP R14A and thereafter, overriding the +f(X) -> + length(X). %% mod:length/1 is called

    For auto-imported BIFs added in Erlang/OTP R14A and thereafter, overriding the name with a local function or explicit import is always allowed. However, if the -compile({no_auto_import,[F/A]) directive is not used, the compiler issues a warning whenever the function is called in the module using the implicitly @@ -270,7 +270,7 @@ sequence GuardSeq that evaluates to true is found. Then the corresponding /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/funs.xhtml differs (HTML document, ASCII text, with very long lines (2205)) --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/funs.xhtml" 2026-06-04 00:09:02.000000000 +0000 +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/funs.xhtml" 2042-07-06 13:28:26.000000000 +0000 @@ -26,14 +26,14 @@ map -

    The following function, double, doubles every element in a list:

    double([H|T]) -> [2*H|double(T)];
    -double([])    -> [].

    Hence, the argument entered as input is doubled as follows:

    > double([1,2,3,4]).
    -[2,4,6,8]

    The following function, add_one, adds one to every element in a list:

    add_one([H|T]) -> [H+1|add_one(T)];
    -add_one([])    -> [].

    The functions double and add_one have a similar structure. This can be used -by writing a function map that expresses this similarity:

    map(F, [H|T]) -> [F(H)|map(F, T)];
    -map(F, [])    -> [].

    The functions double and add_one can now be expressed in terms of map as -follows:

    double(L)  -> map(fun(X) -> 2*X end, L).
    -add_one(L) -> map(fun(X) -> 1 + X end, L).

    map(F, List) is a function that takes a function F and a list L as +

    The following function, double, doubles every element in a list:

    double([H|T]) -> [2*H|double(T)];
    +double([])    -> [].

    Hence, the argument entered as input is doubled as follows:

    > double([1,2,3,4]).
    +[2,4,6,8]

    The following function, add_one, adds one to every element in a list:

    add_one([H|T]) -> [H+1|add_one(T)];
    +add_one([])    -> [].

    The functions double and add_one have a similar structure. This can be used +by writing a function map that expresses this similarity:

    map(F, [H|T]) -> [F(H)|map(F, T)];
    +map(F, [])    -> [].

    The functions double and add_one can now be expressed in terms of map as +follows:

    double(L)  -> map(fun(X) -> 2*X end, L).
    +add_one(L) -> map(fun(X) -> 1 + X end, L).

    map(F, List) is a function that takes a function F and a list L as arguments and returns a new list, obtained by applying F to each of the elements in L.

    The process of abstracting out the common features of a number of different programs is called procedural abstraction. Procedural abstraction can be used @@ -47,21 +47,21 @@ foreach

    This section illustrates procedural abstraction. Initially, the following two -examples are written as conventional functions.

    This function prints all elements of a list onto a stream:

    print_list(Stream, [H|T]) ->
    -    io:format(Stream, "~p~n", [H]),
    -    print_list(Stream, T);
    -print_list(Stream, []) ->
    -    true.

    This function broadcasts a message to a list of processes:

    broadcast(Msg, [Pid|Pids]) ->
    +examples are written as conventional functions.

    This function prints all elements of a list onto a stream:

    print_list(Stream, [H|T]) ->
    +    io:format(Stream, "~p~n", [H]),
    +    print_list(Stream, T);
    +print_list(Stream, []) ->
    +    true.

    This function broadcasts a message to a list of processes:

    broadcast(Msg, [Pid|Pids]) ->
         Pid ! Msg,
    -    broadcast(Msg, Pids);
    -broadcast(_, []) ->
    +    broadcast(Msg, Pids);
    +broadcast(_, []) ->
         true.

    These two functions have a similar structure. They both iterate over a list and do something to each element in the list. The "something" is passed on as an -extra argument to the function that does this.

    The function foreach expresses this similarity:

    foreach(F, [H|T]) ->
    -    F(H),
    -    foreach(F, T);
    -foreach(F, []) ->
    -    ok.

    Using the function foreach, the function print_list becomes:

    foreach(fun(H) -> io:format(S, "~p~n",[H]) end, L)

    Using the function foreach, the function broadcast becomes:

    foreach(fun(Pid) -> Pid ! M end, L)

    foreach is evaluated for its side-effect and not its value. foreach(Fun ,L) +extra argument to the function that does this.

    The function foreach expresses this similarity:

    foreach(F, [H|T]) ->
    +    F(H),
    +    foreach(F, T);
    +foreach(F, []) ->
    +    ok.

    Using the function foreach, the function print_list becomes:

    foreach(fun(H) -> io:format(S, "~p~n",[H]) end, L)

    Using the function foreach, the function broadcast becomes:

    foreach(fun(Pid) -> Pid ! M end, L)

    foreach is evaluated for its side-effect and not its value. foreach(Fun ,L) calls Fun(X) for each element X in L and the processing occurs in the order that the elements were defined in L. map does not define the order in which its elements are processed.

    @@ -71,24 +71,24 @@ Syntax of Funs

    Funs are written with the following syntax (see -Fun Expressions for full description):

    F = fun (Arg1, Arg2, ... ArgN) ->
    +Fun Expressions for full description):

    F = fun (Arg1, Arg2, ... ArgN) ->
             ...
         end

    This creates an anonymous function of N arguments and binds it to the variable F.

    Another function, FunctionName, written in the same module, can be passed as an argument, using the following syntax:

    F = fun FunctionName/Arity

    With this form of function reference, the function that is referred to does not need to be exported from the module.

    It is also possible to refer to a function defined in a different module, with -the following syntax:

    F = fun Module:FunctionName/Arity

    In this case, the function must be exported from the module in question.

    The following program illustrates the different ways of creating funs:

    -module(fun_test).
    --export([t1/0, t2/0]).
    --import(lists, [map/2]).
    +the following syntax:

    F = fun Module:FunctionName/Arity

    In this case, the function must be exported from the module in question.

    The following program illustrates the different ways of creating funs:

    -module(fun_test).
    +-export([t1/0, t2/0]).
    +-import(lists, [map/2]).
     
    -t1() -> map(fun(X) -> 2 * X end, [1,2,3,4,5]).
    +t1() -> map(fun(X) -> 2 * X end, [1,2,3,4,5]).
     
    -t2() -> map(fun double/1, [1,2,3,4,5]).
    +t2() -> map(fun double/1, [1,2,3,4,5]).
     
    -double(X) -> X * 2.

    The fun F can be evaluated with the following syntax:

    F(Arg1, Arg2, ..., Argn)

    To check whether a term is a fun, use the test -is_function/1 in a guard.

    Example:

    f(F, Args) when is_function(F) ->
    -   apply(F, Args);
    -f(N, _) when is_integer(N) ->
    +double(X) -> X * 2.

    The fun F can be evaluated with the following syntax:

    F(Arg1, Arg2, ..., Argn)

    To check whether a term is a fun, use the test +is_function/1 in a guard.

    Example:

    f(F, Args) when is_function(F) ->
    +   apply(F, Args);
    +f(N, _) when is_integer(N) ->
        N.

    Funs are a distinct type. The BIFs erlang:fun_info/1,2 can be used to retrieve information about a fun, and the BIF erlang:fun_to_list/1 returns a textual representation of a fun. The check_process_code/2 @@ -101,18 +101,18 @@

    The scope rules for variables that occur in funs are as follows:

    • All variables that occur in the head of a fun are assumed to be "fresh" variables.
    • Variables that are defined before the fun, and that occur in function calls or -guard tests within the fun, have the values they had outside the fun.
    • Variables cannot be exported from a fun.

    The following examples illustrate these rules:

    print_list(File, List) ->
    -    {ok, Stream} = file:open(File, write),
    -    foreach(fun(X) -> io:format(Stream,"~p~n",[X]) end, List),
    -    file:close(Stream).

    Here, the variable X, defined in the head of the fun, is a new variable. The +guard tests within the fun, have the values they had outside the fun.

  • Variables cannot be exported from a fun.
  • The following examples illustrate these rules:

    print_list(File, List) ->
    +    {ok, Stream} = file:open(File, write),
    +    foreach(fun(X) -> io:format(Stream,"~p~n",[X]) end, List),
    +    file:close(Stream).

    Here, the variable X, defined in the head of the fun, is a new variable. The variable Stream, which is used within the fun, gets its value from the file:open line.

    As any variable that occurs in the head of a fun is considered a new variable, -it is equally valid to write as follows:

    print_list(File, List) ->
    -    {ok, Stream} = file:open(File, write),
    -    foreach(fun(File) ->
    -                io:format(Stream,"~p~n",[File])
    -            end, List),
    -    file:close(Stream).

    Here, File is used as the new variable instead of X. This is not so wise +it is equally valid to write as follows:

    print_list(File, List) ->
    +    {ok, Stream} = file:open(File, write),
    +    foreach(fun(File) ->
    +                io:format(Stream,"~p~n",[File])
    +            end, List),
    +    file:close(Stream).

    Here, File is used as the new variable instead of X. This is not so wise because code in the fun body cannot refer to the variable File, which is defined outside of the fun. Compiling this example gives the following diagnostic:

    ./FileName.erl:Line: Warning: variable 'File'
    @@ -121,20 +121,20 @@
     pattern matching operations must be moved into guard expressions and cannot be
     written in the head of the fun. For example, you might write the following code
     if you intend the first clause of F to be evaluated when the value of its
    -argument is Y:

    f(...) ->
    +argument is Y:

    f(...) ->
         Y = ...
    -    map(fun(X) when X == Y ->
    +    map(fun(X) when X == Y ->
                  ;
    -           (_) ->
    +           (_) ->
                  ...
    -        end, ...)
    -    ...

    instead of writing the following code:

    f(...) ->
    +        end, ...)
    +    ...

    instead of writing the following code:

    f(...) ->
         Y = ...
    -    map(fun(Y) ->
    +    map(fun(Y) ->
                  ;
    -           (_) ->
    +           (_) ->
                  ...
    -        end, ...)
    +        end, ...)
         ...

    @@ -148,58 +148,58 @@ map

    -

    lists:map/2 takes a function of one argument and a list of terms:

    map(F, [H|T]) -> [F(H)|map(F, T)];
    -map(F, [])    -> [].

    It returns the list obtained by applying the function to every argument in the +

    lists:map/2 takes a function of one argument and a list of terms:

    map(F, [H|T]) -> [F(H)|map(F, T)];
    +map(F, [])    -> [].

    It returns the list obtained by applying the function to every argument in the list.

    When a new fun is defined in the shell, the value of the fun is printed as -Fun#<erl_eval>:

    > Double = fun(X) -> 2 * X end.
    +Fun#<erl_eval>:

    > Double = fun(X) -> 2 * X end.
     #Fun<erl_eval.6.72228031>
    -> lists:map(Double, [1,2,3,4,5]).
    -[2,4,6,8,10]

    +> lists:map(Double, [1,2,3,4,5]). +[2,4,6,8,10]

    any

    -

    lists:any/2 takes a predicate P of one argument and a list of terms:

    any(Pred, [H|T]) ->
    -    case Pred(H) of
    +

    lists:any/2 takes a predicate P of one argument and a list of terms:

    any(Pred, [H|T]) ->
    +    case Pred(H) of
             true  ->  true;
    -        false ->  any(Pred, T)
    +        false ->  any(Pred, T)
         end;
    -any(Pred, []) ->
    +any(Pred, []) ->
         false.

    A predicate is a function that returns true or false. any is true if there is a term X in the list such that P(X) is true.

    A predicate Big(X) is defined, which is true if its argument is greater that -10:

    > Big =  fun(X) -> if X > 10 -> true; true -> false end end.
    +10:

    > Big =  fun(X) -> if X > 10 -> true; true -> false end end.
     #Fun<erl_eval.6.72228031>
    -> lists:any(Big, [1,2,3,4]).
    +> lists:any(Big, [1,2,3,4]).
     false
    -> lists:any(Big, [1,2,3,12,5]).
    +> lists:any(Big, [1,2,3,12,5]).
     true

    all

    -

    lists:all/2 has the same arguments as any:

    all(Pred, [H|T]) ->
    /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/gen_server_concepts.xhtml differs (HTML document, ASCII text, with very long lines (1295))
    --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/gen_server_concepts.xhtml"	2026-06-04 00:09:02.000000000 +0000
    +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/gen_server_concepts.xhtml"	2042-07-06 13:28:26.000000000 +0000
    @@ -66,40 +66,40 @@
     
     

    An example of a simple server written in plain Erlang is provided in Overview. The server can be reimplemented using -gen_server, resulting in this callback module:

    -module(ch3).
    --behaviour(gen_server).
    +gen_server, resulting in this callback module:

    -module(ch3).
    +-behaviour(gen_server).
     
    --export([start_link/0]).
    --export([alloc/0, free/1]).
    --export([init/1, handle_call/3, handle_cast/2]).
    +-export([start_link/0]).
    +-export([alloc/0, free/1]).
    +-export([init/1, handle_call/3, handle_cast/2]).
     
    -start_link() ->
    -    gen_server:start_link({local, ch3}, ch3, [], []).
    +start_link() ->
    +    gen_server:start_link({local, ch3}, ch3, [], []).
     
    -alloc() ->
    -    gen_server:call(ch3, alloc).
    +alloc() ->
    +    gen_server:call(ch3, alloc).
     
    -free(Ch) ->
    -    gen_server:cast(ch3, {free, Ch}).
    +free(Ch) ->
    +    gen_server:cast(ch3, {free, Ch}).
     
    -init(_Args) ->
    -    {ok, channels()}.
    +init(_Args) ->
    +    {ok, channels()}.
     
    -handle_call(alloc, _From, Chs) ->
    -    {Ch, Chs2} = alloc(Chs),
    -    {reply, Ch, Chs2}.
    +handle_call(alloc, _From, Chs) ->
    +    {Ch, Chs2} = alloc(Chs),
    +    {reply, Ch, Chs2}.
     
    -handle_cast({free, Ch}, Chs) ->
    -    Chs2 = free(Ch, Chs),
    -    {noreply, Chs2}.

    The code is explained in the next sections.

    +handle_cast({free, Ch}, Chs) -> + Chs2 = free(Ch, Chs), + {noreply, Chs2}.

    The code is explained in the next sections.

    Starting a Gen_Server

    In the example in the previous section, gen_server is started by calling -ch3:start_link():

    start_link() ->
    -    gen_server:start_link({local, ch3}, ch3, [], []) => {ok, Pid}

    start_link/0 calls function gen_server:start_link/4. This function +ch3:start_link():

    start_link() ->
    +    gen_server:start_link({local, ch3}, ch3, [], []) => {ok, Pid}

    start_link/0 calls function gen_server:start_link/4. This function spawns and links to a new process, a gen_server.

    • The first argument, {local, ch3}, specifies the name. The gen_server is then locally registered as ch3.

      If the name is omitted, the gen_server is not registered. Instead its pid must be used. The name can also be given as {global, Name}, in which case @@ -113,8 +113,8 @@ for the available options.

    If name registration succeeds, the new gen_server process calls the callback function ch3:init([]). init is expected to return {ok, State}, where State is the internal state of the gen_server. In this case, the state is -the available channels.

    init(_Args) ->
    -    {ok, channels()}.

    gen_server:start_link/4 is synchronous. It does not return until the +the available channels.

    init(_Args) ->
    +    {ok, channels()}.

    gen_server:start_link/4 is synchronous. It does not return until the gen_server has been initialized and is ready to receive requests.

    gen_server:start_link/4 must be used if the gen_server is part of a supervision tree, meaning that it was started by a supervisor. There is another function, gen_server:start/4, to start a standalone @@ -130,9 +130,9 @@ When the request is received, the gen_server calls handle_call(Request, From, State), which is expected to return a tuple {reply,Reply,State1}. Reply is the reply that is to be sent back -to the client, and State1 is a new value for the state of the gen_server.

    handle_call(alloc, _From, Chs) ->
    -    {Ch, Chs2} = alloc(Chs),
    -    {reply, Ch, Chs2}.

    In this case, the reply is the allocated channel Ch and the new state is the +to the client, and State1 is a new value for the state of the gen_server.

    handle_call(alloc, _From, Chs) ->
    +    {Ch, Chs2} = alloc(Chs),
    +    {reply, Ch, Chs2}.

    In this case, the reply is the allocated channel Ch and the new state is the set of remaining available channels Chs2.

    Thus, the call ch3:alloc() returns the allocated channel Ch and the gen_server then waits for new requests, now with an updated list of available channels.

    @@ -141,13 +141,13 @@ Asynchronous Requests - Cast

    -

    The asynchronous request free(Ch) is implemented using gen_server:cast/2:

    free(Ch) ->
    -    gen_server:cast(ch3, {free, Ch}).

    ch3 is the name of the gen_server. {free, Ch} is the actual request.

    The request is made into a message and sent to the gen_server. +

    The asynchronous request free(Ch) is implemented using gen_server:cast/2:

    free(Ch) ->
    +    gen_server:cast(ch3, {free, Ch}).

    ch3 is the name of the gen_server. {free, Ch} is the actual request.

    The request is made into a message and sent to the gen_server. cast, and thus free, then returns ok.

    When the request is received, the gen_server calls handle_cast(Request, State), which is expected to return a tuple -{noreply,State1}. State1 is a new value for the state of the gen_server.

    handle_cast({free, Ch}, Chs) ->
    -    Chs2 = free(Ch, Chs),
    -    {noreply, Chs2}.

    In this case, the new state is the updated list of available channels Chs2. +{noreply,State1}. State1 is a new value for the state of the gen_server.

    handle_cast({free, Ch}, Chs) ->
    +    Chs2 = free(Ch, Chs),
    +    {noreply, Chs2}.

    In this case, the new state is the updated list of available channels Chs2. The gen_server is now ready for new requests.

    @@ -166,15 +166,15 @@ set in the supervisor.

    If it is necessary to clean up before termination, the shutdown strategy must be a time-out value and the gen_server must be set to trap exit signals in function init. When ordered to shutdown, the gen_server then calls -the callback function terminate(shutdown, State):

    init(Args) ->
    +the callback function terminate(shutdown, State):

    init(Args) ->
         ...,
    -    process_flag(trap_exit, true),
    +    process_flag(trap_exit, true),
         ...,
    -    {ok, State}.
    +    {ok, State}.
     
     ...
     
    -terminate(shutdown, State) ->
    +terminate(shutdown, State) ->
         %% Code for cleaning up here
         ...
         ok.

    @@ -185,21 +185,21 @@

    If the gen_server is not part of a supervision tree, a stop function can be useful, for example:

    ...
    -export([stop/0]).
    +export([stop/0]).
     ...
     
    -stop() ->
    -    gen_server:cast(ch3, stop).
    +stop() ->
    +    gen_server:cast(ch3, stop).
     ...
     
    -handle_cast(stop, State) ->
    -    {stop, normal, State};
    -handle_cast({free, Ch}, State) ->
    +handle_cast(stop, State) ->
    +    {stop, normal, State};
    +handle_cast({free, Ch}, State) ->
         ...
     
     ...
     
    -terminate(normal, State) ->
    +terminate(normal, State) ->
         ok.

    The callback function handling the stop request returns a tuple {stop,normal,State1}, where normal specifies that it is a normal termination and State1 is a new value for the state @@ -214,13 +214,13 @@ the callback function handle_info(Info, State) must be implemented to handle them. Examples of other messages are exit messages, if the gen_server is linked to other processes than the supervisor -and it is trapping exit signals.

    handle_info({'EXIT', Pid, Reason}, State) ->
    +and it is trapping exit signals.

    handle_info({'EXIT', Pid, Reason}, State) ->
         %% Code to handle exits here.
         ...
    -    {noreply, State1}.

    The final function to implement is code_change/3:

    code_change(OldVsn, State, Extra) ->
    +    {noreply, State1}.

    The final function to implement is code_change/3:

    code_change(OldVsn, State, Extra) ->
         %% Code to convert state (and more) during code change.
         ...
    -    {ok, NewState}.
    +
    {ok, NewState}.
    /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/included_applications.xhtml differs (HTML document, ASCII text, with very long lines (931)) --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/included_applications.xhtml" 2026-06-04 00:09:02.000000000 +0000 +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/included_applications.xhtml" 2042-07-06 13:28:26.000000000 +0000 @@ -70,16 +70,16 @@ Specifying Included Applications

    Which applications to include is defined by the included_applications key in -the .app file:

    {application, prim_app,
    - [{description, "Tree application"},
    -  {vsn, "1"},
    -  {modules, [prim_app_cb, prim_app_sup, prim_app_server]},
    -  {registered, [prim_app_server]},
    -  {included_applications, [incl_app]},
    -  {applications, [kernel, stdlib, sasl]},
    -  {mod, {prim_app_cb,[]}},
    -  {env, [{file, "/usr/local/log"}]}
    - ]}.

    +the .app file:

    {application, prim_app,
    + [{description, "Tree application"},
    +  {vsn, "1"},
    +  {modules, [prim_app_cb, prim_app_sup, prim_app_server]},
    +  {registered, [prim_app_server]},
    +  {included_applications, [incl_app]},
    +  {applications, [kernel, stdlib, sasl]},
    +  {mod, {prim_app_cb,[]}},
    +  {env, [{file, "/usr/local/log"}]}
    + ]}.

    @@ -93,27 +93,27 @@ term.

    The value of the mod key of the including application must be set to {application_starter,[Module,StartArgs]}, where Module as usual is the application callback module. StartArgs is a term provided as argument to the -callback function Module:start/2:

    {application, prim_app,
    - [{description, "Tree application"},
    -  {vsn, "1"},
    -  {modules, [prim_app_cb, prim_app_sup, prim_app_server]},
    -  {registered, [prim_app_server]},
    -  {included_applications, [incl_app]},
    -  {start_phases, [{init,[]}, {go,[]}]},
    -  {applications, [kernel, stdlib, sasl]},
    -  {mod, {application_starter,[prim_app_cb,[]]}},
    -  {env, [{file, "/usr/local/log"}]}
    - ]}.
    +callback function Module:start/2:

    {application, prim_app,
    + [{description, "Tree application"},
    +  {vsn, "1"},
    +  {modules, [prim_app_cb, prim_app_sup, prim_app_server]},
    +  {registered, [prim_app_server]},
    +  {included_applications, [incl_app]},
    +  {start_phases, [{init,[]}, {go,[]}]},
    +  {applications, [kernel, stdlib, sasl]},
    +  {mod, {application_starter,[prim_app_cb,[]]}},
    +  {env, [{file, "/usr/local/log"}]}
    + ]}.
     
    -{application, incl_app,
    - [{description, "Included application"},
    -  {vsn, "1"},
    -  {modules, [incl_app_cb, incl_app_sup, incl_app_server]},
    -  {registered, []},
    -  {start_phases, [{go,[]}]},
    -  {applications, [kernel, stdlib, sasl]},
    -  {mod, {incl_app_cb,[]}}
    - ]}.

    When starting a primary application with included applications, the primary +{application, incl_app, + [{description, "Included application"}, + {vsn, "1"}, + {modules, [incl_app_cb, incl_app_sup, incl_app_server]}, + {registered, []}, + {start_phases, [{go,[]}]}, + {applications, [kernel, stdlib, sasl]}, + {mod, {incl_app_cb,[]}} + ]}.

    When starting a primary application with included applications, the primary application is started the normal way, that is:

    • The application controller creates an application master for the application
    • The application master calls Module:start(normal, StartArgs) to start the top supervisor.

    Then, for the primary application and each included application in top-down, left-to-right order, the application master calls @@ -126,11 +126,11 @@ of specified phases must be a subset of the set of phases specified for the primary application.

    When starting prim_app as defined above, the application controller calls the following callback functions before application:start(prim_app) returns a -value:

    application:start(prim_app)
    - => prim_app_cb:start(normal, [])
    - => prim_app_cb:start_phase(init, normal, [])
    - => prim_app_cb:start_phase(go, normal, [])
    - => incl_app_cb:start_phase(go, normal, [])
    +value:

    application:start(prim_app)
    + => prim_app_cb:start(normal, [])
    + => prim_app_cb:start_phase(init, normal, [])
    + => prim_app_cb:start_phase(go, normal, [])
    + => incl_app_cb:start_phase(go, normal, [])
     ok
    /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/install-win32.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (579)) --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/install-win32.xhtml" 2026-06-04 00:09:02.000000000 +0000 +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/install-win32.xhtml" 2042-07-06 13:28:26.000000000 +0000 @@ -204,7 +204,7 @@

    and sometimes

    $ cd $ERL_TOP
     $ make local_setup
     

    So now when you run $ERL_TOP/erl.exe, you should have a debug compiled -emulator, which you will see if you do a:

    1> erlang:system_info(system_version).

    in the erlang shell. If the returned string contains [debug], you +emulator, which you will see if you do a:

    1> erlang:system_info(system_version).

    in the erlang shell. If the returned string contains [debug], you got a debug compiled emulator.

    To hack the erlang libraries, you simply do a make opt in the specific "applications" directory, like:

    $ cd $ERL_TOP/lib/stdlib
     $ make opt
    @@ -227,11 +227,11 @@
     

    Remember that:

    • Windows specific C-code goes in the $ERL_TOP/erts/emulator/sys/win32, $ERL_TOP/erts/emulator/drivers/win32 or $ERL_TOP/erts/etc/win32.

    • Windows specific erlang code should be used conditionally and the host OS tested in runtime, the exactly same beam files should be -distributed for every platform! So write code like:

      case os:type() of
      -    {win32,_} ->
      -        do_windows_specific();
      +distributed for every platform! So write code like:

      case os:type() of
      +    {win32,_} ->
      +        do_windows_specific();
           Other ->
      -        do_fallback_or_exit()
      +        do_fallback_or_exit()
       end,

    That's basically all you need to get going.

    /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/list_comprehensions.xhtml differs (HTML document, ASCII text, with very long lines (2031)) --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/list_comprehensions.xhtml" 2026-06-04 00:09:02.000000000 +0000 +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/list_comprehensions.xhtml" 2042-07-06 13:28:26.000000000 +0000 @@ -26,25 +26,25 @@ Simple Examples

    -

    This section starts with a simple example, showing a generator and a filter:

    > [X || X <- [1,2,a,3,4,b,5,6], X > 3].
    -[a,4,b,5,6]

    This is read as follows: The list of X such that X is taken from the list +

    This section starts with a simple example, showing a generator and a filter:

    > [X || X <- [1,2,a,3,4,b,5,6], X > 3].
    +[a,4,b,5,6]

    This is read as follows: The list of X such that X is taken from the list [1,2,a,...] and X is greater than 3.

    The notation X <- [1,2,a,...] is a generator and the expression X > 3 is a filter.

    An additional filter, is_integer(X), can be added to -restrict the result to integers:

    > [X || X <- [1,2,a,3,4,b,5,6], is_integer(X), X > 3].
    -[4,5,6]

    Generators can be combined. For example, the Cartesian product of two lists can -be written as follows:

    > [{X, Y} || X <- [1,2,3], Y <- [a,b]].
    -[{1,a},{1,b},{2,a},{2,b},{3,a},{3,b}]

    +restrict the result to integers:

    > [X || X <- [1,2,a,3,4,b,5,6], is_integer(X), X > 3].
    +[4,5,6]

    Generators can be combined. For example, the Cartesian product of two lists can +be written as follows:

    > [{X, Y} || X <- [1,2,3], Y <- [a,b]].
    +[{1,a},{1,b},{2,a},{2,b},{3,a},{3,b}]

    Quick Sort

    -

    The well-known quick sort routine can be written as follows:

    sort([]) -> [];
    -sort([_] = L) -> L;
    -sort([Pivot|T]) ->
    -    sort([ X || X <- T, X < Pivot]) ++
    -    [Pivot] ++
    -    sort([ X || X <- T, X >= Pivot]).

    The expression [X || X <- T, X < Pivot] is the list of all elements in T +

    The well-known quick sort routine can be written as follows:

    sort([]) -> [];
    +sort([_] = L) -> L;
    +sort([Pivot|T]) ->
    +    sort([ X || X <- T, X < Pivot]) ++
    +    [Pivot] ++
    +    sort([ X || X <- T, X >= Pivot]).

    The expression [X || X <- T, X < Pivot] is the list of all elements in T that are less than Pivot.

    [X || X <- T, X >= Pivot] is the list of all elements in T that are greater than or equal to Pivot.

    With the algorithm above, a list is sorted as follows:

    • A list with zero or one element is trivially sorted.
    • For lists with more than one element:
      1. The first element in the list is isolated as the pivot element.
      2. The remaining list is partitioned into two sublists, such that:
      • The first sublist contains all elements that are smaller than the pivot element.
      • The second sublist contains all elements that are greater than or equal to @@ -60,11 +60,11 @@ Permutations -

        The following example generates all permutations of the elements in a list:

        perms([]) -> [[]];
        -perms(L)  -> [[H|T] || H <- L, T <- perms(L--[H])].

        This takes H from L in all possible ways. The result is the set of all lists +

        The following example generates all permutations of the elements in a list:

        perms([]) -> [[]];
        +perms(L)  -> [[H|T] || H <- L, T <- perms(L--[H])].

        This takes H from L in all possible ways. The result is the set of all lists [H|T], where T is the set of all possible permutations of L, with H -removed:

        > perms([b,u,g]).
        -[[b,u,g],[b,g,u],[u,b,g],[u,g,b],[g,b,u],[g,u,b]]

        +removed:

        > perms([b,u,g]).
        +[[b,u,g],[b,g,u],[u,b,g],[u,g,b],[g,b,u],[g,u,b]]

        @@ -73,47 +73,47 @@

        Pythagorean triplets are sets of integers {A,B,C} such that A**2 + B**2 = C**2.

        The function pyth(N) generates a list of all integers {A,B,C} such that A**2 + B**2 = C**2 and where the sum of the sides is equal to, or less than, -N:

        pyth(N) ->
        -    [ {A,B,C} ||
        -        A <- lists:seq(1,N),
        -        B <- lists:seq(1,N),
        -        C <- lists:seq(1,N),
        +N:

        pyth(N) ->
        +    [ {A,B,C} ||
        +        A <- lists:seq(1,N),
        +        B <- lists:seq(1,N),
        +        C <- lists:seq(1,N),
                 A+B+C =< N,
                 A*A+B*B == C*C
        -    ].
        > pyth(3).
        -[].
        -> pyth(11).
        -[].
        -> pyth(12).
        -[{3,4,5},{4,3,5}]
        -> pyth(50).
        -[{3,4,5},
        - {4,3,5},
        - {5,12,13},
        - {6,8,10},
        - {8,6,10},
        - {8,15,17},
        - {9,12,15},
        - {12,5,13},
        - {12,9,15},
        - {12,16,20},
        - {15,8,17},
        - {16,12,20}]

        The following code reduces the search space and is more efficient:

        pyth1(N) ->
        -   [{A,B,C} ||
        -       A <- lists:seq(1,N-2),
        -       B <- lists:seq(A+1,N-1),
        -       C <- lists:seq(B+1,N),
        +    ].
        > pyth(3).
        +[].
        +> pyth(11).
        +[].
        +> pyth(12).
        +[{3,4,5},{4,3,5}]
        +> pyth(50).
        +[{3,4,5},
        + {4,3,5},
        + {5,12,13},
        + {6,8,10},
        + {8,6,10},
        + {8,15,17},
        + {9,12,15},
        + {12,5,13},
        + {12,9,15},
        + {12,16,20},
        + {15,8,17},
        + {16,12,20}]

        The following code reduces the search space and is more efficient:

        pyth1(N) ->
        +   [{A,B,C} ||
        +       A <- lists:seq(1,N-2),
        +       B <- lists:seq(A+1,N-1),
        +       C <- lists:seq(B+1,N),
                A+B+C =< N,
        -       A*A+B*B == C*C ].

        + A*A+B*B == C*C ].

        Simplifications With List Comprehensions

        As an example, list comprehensions can be used to simplify some of the functions -in lists.erl:

        append(L)   ->  [X || L1 <- L, X <- L1].
        -map(Fun, L) -> [Fun(X) || X <- L].
        -filter(Pred, L) -> [X || X <- L, Pred(X)].

        +in lists.erl:

        append(L)   ->  [X || L1 <- L, X <- L1].
        +map(Fun, L) -> [Fun(X) || X <- L].
        +filter(Pred, L) -> [X || X <- L, Pred(X)].

        @@ -125,20 +125,20 @@ which selects certain elements from a list of tuples. Suppose you write select(X, L) -> [Y || {X, Y} <- L]. with the intention of extracting all tuples from L, where the first item is X.

        Compiling this gives the following diagnostic:

        ./FileName.erl:Line: Warning: variable 'X' shadowed in generate

        This diagnostic warns that the variable X in the pattern is not the same as -the variable X that occurs in the function head.

        Evaluating select gives the following result:

        > select(b,[{a,1},{b,2},{c,3},{b,7}]).
        -[1,2,3,7]

        This is not the wanted result. To achieve the desired effect, select must be -written as follows:

        select(X, L) ->  [Y || {X1, Y} <- L, X == X1].

        The generator now contains unbound variables and the test has been moved into -the filter.

        This now works as expected:

        > select(b,[{a,1},{b,2},{c,3},{b,7}]).
        -[2,7]

        Also note that a variable in a generator pattern will shadow a variable with the -same name bound in a previous generator pattern. For example:

        > [{X,Y} || X <- [1,2,3], X=Y <- [a,b,c]].
        -[{a,a},{b,b},{c,c},{a,a},{b,b},{c,c},{a,a},{b,b},{c,c}]

        A consequence of the rules for importing variables into a list comprehensions is +the variable X that occurs in the function head.

        Evaluating select gives the following result:

        > select(b,[{a,1},{b,2},{c,3},{b,7}]).
        +[1,2,3,7]

        This is not the wanted result. To achieve the desired effect, select must be +written as follows:

        select(X, L) ->  [Y || {X1, Y} <- L, X == X1].

        The generator now contains unbound variables and the test has been moved into +the filter.

        This now works as expected:

        > select(b,[{a,1},{b,2},{c,3},{b,7}]).
        +[2,7]

        Also note that a variable in a generator pattern will shadow a variable with the +same name bound in a previous generator pattern. For example:

        > [{X,Y} || X <- [1,2,3], X=Y <- [a,b,c]].
        +[{a,a},{b,b},{c,c},{a,a},{b,b},{c,c},{a,a},{b,b},{c,c}]

        A consequence of the rules for importing variables into a list comprehensions is that certain pattern matching operations must be moved into the filters and -cannot be written directly in the generators.

        To illustrate this, do not write as follows:

        f(...) ->
        +cannot be written directly in the generators.

        To illustrate this, do not write as follows:

        f(...) ->
             Y = ...
        -    [ Expression || PatternInvolving Y  <- Expr, ...]
        -    ...

        Instead, write as follows:

        f(...) ->
        +    [ Expression || PatternInvolving Y  <- Expr, ...]
        +    ...

        Instead, write as follows:

        f(...) ->
             Y = ...
        -    [ Expression || PatternInvolving Y1  <- Expr, Y == Y1, ...]
        +    [ Expression || PatternInvolving Y1  <- Expr, Y == Y1, ...]
             ...
        /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/listhandling.xhtml differs (HTML document, ASCII text, with very long lines (1446)) --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/listhandling.xhtml" 2026-06-04 00:09:02.000000000 +0000 +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/listhandling.xhtml" 2042-07-06 13:28:26.000000000 +0000 @@ -29,47 +29,47 @@

        Lists can only be built starting from the end and attaching list elements at the beginning. If you use the ++ operator as follows, a new list is created that is a copy of the elements in List1, followed by List2:

        List1 ++ List2

        Looking at how lists:append/2 or ++ would be implemented in plain Erlang, -clearly the first list is copied:

        append([H|T], Tail) ->
        -    [H|append(T, Tail)];
        -append([], Tail) ->
        +clearly the first list is copied:

        append([H|T], Tail) ->
        +    [H|append(T, Tail)];
        +append([], Tail) ->
             Tail.

        When recursing and building a list, it is important to ensure that you attach the new elements to the beginning of the list. In this way, you will build one -list, not hundreds or thousands of copies of the growing result list.

        Let us first see how it is not to be done:

        DO NOT

        bad_fib(N) ->
        -    bad_fib(N, 0, 1, []).
        +list, not hundreds or thousands of copies of the growing result list.

        Let us first see how it is not to be done:

        DO NOT

        bad_fib(N) ->
        +    bad_fib(N, 0, 1, []).
         
        -bad_fib(0, _Current, _Next, Fibs) ->
        +bad_fib(0, _Current, _Next, Fibs) ->
             Fibs;
        -bad_fib(N, Current, Next, Fibs) ->
        -    bad_fib(N - 1, Next, Current + Next, Fibs ++ [Current]).

        Here more than one list is built. In each iteration step a new list is created +bad_fib(N, Current, Next, Fibs) -> + bad_fib(N - 1, Next, Current + Next, Fibs ++ [Current]).

        Here more than one list is built. In each iteration step a new list is created that is one element longer than the new previous list.

        To avoid copying the result in each iteration, build the list in reverse order -and reverse the list when you are done:

        DO

        tail_recursive_fib(N) ->
        -    tail_recursive_fib(N, 0, 1, []).
        +and reverse the list when you are done:

        DO

        tail_recursive_fib(N) ->
        +    tail_recursive_fib(N, 0, 1, []).
         
        -tail_recursive_fib(0, _Current, _Next, Fibs) ->
        -    lists:reverse(Fibs);
        -tail_recursive_fib(N, Current, Next, Fibs) ->
        -    tail_recursive_fib(N - 1, Next, Current + Next, [Current|Fibs]).

        +tail_recursive_fib(0, _Current, _Next, Fibs) -> + lists:reverse(Fibs); +tail_recursive_fib(N, Current, Next, Fibs) -> + tail_recursive_fib(N - 1, Next, Current + Next, [Current|Fibs]).

        List Comprehensions

        -

        A list comprehension:

        [Expr(E) || E <- List]

        is basically translated to a local function:

        'lc^0'([E|Tail], Expr) ->
        -    [Expr(E)|'lc^0'(Tail, Expr)];
        -'lc^0'([], _Expr) -> [].

        If the result of the list comprehension will obviously not be used, a list -will not be constructed. For example, in this code:

        [io:put_chars(E) || E <- List],
        +

        A list comprehension:

        [Expr(E) || E <- List]

        is basically translated to a local function:

        'lc^0'([E|Tail], Expr) ->
        +    [Expr(E)|'lc^0'(Tail, Expr)];
        +'lc^0'([], _Expr) -> [].

        If the result of the list comprehension will obviously not be used, a list +will not be constructed. For example, in this code:

        [io:put_chars(E) || E <- List],
         ok.

        or in this code:

        case Var of
             ... ->
        -        [io:put_chars(E) || E <- List];
        +        [io:put_chars(E) || E <- List];
             ... ->
         end,
        -some_function(...),

        the value is not assigned to a variable, not passed to another function, and not +some_function(...),

        the value is not assigned to a variable, not passed to another function, and not returned. This means that there is no need to construct a list and the compiler -will simplify the code for the list comprehension to:

        'lc^0'([E|Tail], Expr) ->
        -    Expr(E),
        -    'lc^0'(Tail, Expr);
        -'lc^0'([], _Expr) -> [].

        The compiler also understands that assigning to _ means that the value will -not be used. Therefore, the code in the following example will also be optimized:

        _ = [io:put_chars(E) || E <- List],
        +will simplify the code for the list comprehension to:

        'lc^0'([E|Tail], Expr) ->
        +    Expr(E),
        +    'lc^0'(Tail, Expr);
        +'lc^0'([], _Expr) -> [].

        The compiler also understands that assigning to _ means that the value will +not be used. Therefore, the code in the following example will also be optimized:

        _ = [io:put_chars(E) || E <- List],
         ok.

        @@ -82,11 +82,11 @@ to flatten the list before sending it to the port.

      • When calling BIFs that accept deep lists, such as list_to_binary/1 or iolist_to_binary/1.
      • When you know that your list is only one level deep. Use lists:append/1 -instead.

      Examples:

      DO

      port_command(Port, DeepList)

      DO NOT

      port_command(Port, lists:flatten(DeepList))

      A common way to send a zero-terminated string to a port is the following:

      DO NOT

      TerminatedStr = String ++ [0],
      -port_command(Port, TerminatedStr)

      Instead:

      DO

      TerminatedStr = [String, 0],
      -port_command(Port, TerminatedStr)

      DO

      1> lists:append([[1], [2], [3]]).
      -[1,2,3]

      DO NOT

      1> lists:flatten([[1], [2], [3]]).
      -[1,2,3]

      +instead.

    Examples:

    DO

    port_command(Port, DeepList)

    DO NOT

    port_command(Port, lists:flatten(DeepList))

    A common way to send a zero-terminated string to a port is the following:

    DO NOT

    TerminatedStr = String ++ [0],
    +port_command(Port, TerminatedStr)

    Instead:

    DO

    TerminatedStr = [String, 0],
    +port_command(Port, TerminatedStr)

    DO

    1> lists:append([[1], [2], [3]]).
    +[1,2,3]

    DO NOT

    1> lists:flatten([[1], [2], [3]]).
    +[1,2,3]

    @@ -94,17 +94,17 @@

    There are two basic ways to write a function that traverses a list and produces a new list.

    The first way is writing a body-recursive function:

    %% Add 42 to each integer in the list.
    -add_42_body([H|T]) ->
    -    [H + 42 | add_42_body(T)];
    -add_42_body([]) ->
    -    [].

    The second way is writing a tail-recursive function:

    %% Add 42 to each integer in the list.
    -add_42_tail(List) ->
    -    add_42_tail(List, []).
    +add_42_body([H|T]) ->
    +    [H + 42 | add_42_body(T)];
    +add_42_body([]) ->
    +    [].

    The second way is writing a tail-recursive function:

    %% Add 42 to each integer in the list.
    +add_42_tail(List) ->
    +    add_42_tail(List, []).
     
    -add_42_tail([H|T], Acc) ->
    -    add_42_tail(T, [H + 42 | Acc]);
    -add_42_tail([], Acc) ->
    -    lists:reverse(Acc).

    In early version of Erlang the tail-recursive function would typically +add_42_tail([H|T], Acc) -> + add_42_tail(T, [H + 42 | Acc]); +add_42_tail([], Acc) -> + lists:reverse(Acc).

    In early version of Erlang the tail-recursive function would typically be more efficient. In modern versions of Erlang, there is usually not much difference in performance between a body-recursive list function and tail-recursive function that reverses the list at the end. Therefore, @@ -115,11 +115,11 @@ function that does not construct a list runs in constant space, while the corresponding body-recursive function uses stack space proportional to the length of the list.

    For example, a function that sums a list of integers, is not to be written as -follows:

    DO NOT

    recursive_sum([H|T]) -> H+recursive_sum(T);
    -recursive_sum([])    -> 0.

    Instead:

    DO

    sum(L) -> sum(L, 0).
    +follows:

    DO NOT

    recursive_sum([H|T]) -> H+recursive_sum(T);
    +recursive_sum([])    -> 0.

    Instead:

    DO

    sum(L) -> sum(L, 0).
     
    -sum([H|T], Sum) -> sum(T, Sum + H);
    -sum([], Sum)    -> Sum.
    +
    sum([H|T], Sum) -> sum(T, Sum + H); +sum([], Sum) -> Sum.
    /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/macros.xhtml differs (HTML document, ASCII text, with very long lines (1348)) --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/macros.xhtml" 2026-06-04 00:09:02.000000000 +0000 +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/macros.xhtml" 2042-07-06 13:28:26.000000000 +0000 @@ -26,8 +26,8 @@ File Inclusion -

    A file can be included as follows:

    -include(File).
    --include_lib(File).

    File, a string, is to point out a file. The contents of this file are included +

    A file can be included as follows:

    -include(File).
    +-include_lib(File).

    File, a string, is to point out a file. The contents of this file are included as is, at the position of the directive.

    Include files are typically used for record and macro definitions that are shared by several modules. It is recommended to use the file name extension .hrl for include files.

    File can start with a path component $VAR, for some string VAR. If that is @@ -36,12 +36,12 @@ $VAR is left as is.

    If the filename File is absolute (possibly after variable substitution), the include file with that name is included. Otherwise, the specified file is searched for in the following directories, and in this order:

    1. The current working directory
    2. The directory where the module is being compiled
    3. The directories given by the include option

    For details, see erlc in ERTS and -compile in Compiler.

    Examples:

    -include("my_records.hrl").
    --include("incdir/my_records.hrl").
    --include("/home/user/proj/my_records.hrl").
    --include("$PROJ_ROOT/my_records.hrl").

    include_lib is similar to include, but is not to point out an absolute file. +compile in Compiler.

    Examples:

    -include("my_records.hrl").
    +-include("incdir/my_records.hrl").
    +-include("/home/user/proj/my_records.hrl").
    +-include("$PROJ_ROOT/my_records.hrl").

    include_lib is similar to include, but is not to point out an absolute file. Instead, the first path component (possibly after variable substitution) is -assumed to be the name of an application.

    Example:

    -include_lib("kernel/include/file.hrl").

    The code server uses code:lib_dir(kernel) to find the directory of the current +assumed to be the name of an application.

    Example:

    -include_lib("kernel/include/file.hrl").

    The code server uses code:lib_dir(kernel) to find the directory of the current (latest) version of Kernel, and then the subdirectory include is searched for the file file.hrl.

    @@ -49,25 +49,25 @@ Defining and Using Macros

    -

    A macro is defined as follows:

    -define(Const, Replacement).
    --define(Func(Var1,...,VarN), Replacement).

    A macro definition can be placed anywhere among the attributes and function +

    A macro is defined as follows:

    -define(Const, Replacement).
    +-define(Func(Var1,...,VarN), Replacement).

    A macro definition can be placed anywhere among the attributes and function declarations of a module, but the definition must come before any usage of the macro.

    If a macro is used in several modules, it is recommended that the macro definition is placed in an include file.

    A macro is used as follows:

    ?Const
     ?Func(Arg1,...,ArgN)

    Macros are expanded during compilation. A simple macro ?Const is replaced with -Replacement.

    Example:

    -define(TIMEOUT, 200).
    +Replacement.

    Example:

    -define(TIMEOUT, 200).
     ...
    -call(Request) ->
    -    server:call(refserver, Request, ?TIMEOUT).

    This is expanded to:

    call(Request) ->
    -    server:call(refserver, Request, 200).

    A macro ?Func(Arg1,...,ArgN) is replaced with Replacement, where all +call(Request) -> + server:call(refserver, Request, ?TIMEOUT).

    This is expanded to:

    call(Request) ->
    +    server:call(refserver, Request, 200).

    A macro ?Func(Arg1,...,ArgN) is replaced with Replacement, where all occurrences of a variable Var from the macro definition are replaced with the -corresponding argument Arg.

    Example:

    -define(MACRO1(X, Y), {a, X, b, Y}).
    +corresponding argument Arg.

    Example:

    -define(MACRO1(X, Y), {a, X, b, Y}).
     ...
    -bar(X) ->
    -    ?MACRO1(a, b),
    -    ?MACRO1(X, 123)

    This is expanded to:

    bar(X) ->
    -    {a,a,b,b},
    -    {a,X,b,123}.

    It is good programming practice, but not mandatory, to ensure that a macro +bar(X) -> + ?MACRO1(a, b), + ?MACRO1(X, 123)

    This is expanded to:

    bar(X) ->
    +    {a,a,b,b},
    +    {a,X,b,123}.

    It is good programming practice, but not mandatory, to ensure that a macro definition is a valid Erlang syntactic form.

    To view the result of macro expansion, a module can be compiled with the 'P' option. compile:file(File, ['P']). This produces a listing of the parsed code after preprocessing and parse transforms, in the file File.P.

    @@ -94,21 +94,21 @@

    It is possible to overload macros, except for predefined macros. An overloaded macro has more than one definition, each with a different number of arguments.

    Change

    Support for overloading of macros was added in Erlang 5.7.5/OTP R13B04.

    A macro ?Func(Arg1,...,ArgN) with a (possibly empty) list of arguments results in an error message if there is at least one definition of Func with -arguments, but none with N arguments.

    Assuming these definitions:

    -define(F0(), c).
    --define(F1(A), A).
    --define(C, m:f).

    the following does not work:

    f0() ->
    +arguments, but none with N arguments.

    Assuming these definitions:

    -define(F0(), c).
    +-define(F1(A), A).
    +-define(C, m:f).

    the following does not work:

    f0() ->
         ?F0. % No, an empty list of arguments expected.
     
    -f1(A) ->
    -    ?F1(A, A). % No, exactly one argument expected.

    On the other hand,

    f() ->
    -    ?C().

    is expanded to

    f() ->
    -    m:f().

    +f1(A) -> + ?F1(A, A). % No, exactly one argument expected.

    On the other hand,

    f() ->
    +    ?C().

    is expanded to

    f() ->
    +    m:f().

    Removing a macro definition

    -

    A definition of macro can be removed as follows:

    -undef(Macro).

    +

    A definition of macro can be removed as follows:

    -undef(Macro).

    @@ -128,13 +128,13 @@ elif also supports calling the psuedo-function defined(Name), which tests whether the Name argument is the name of a previously defined macro. defined(Name) evaluates to true if the macro is defined and false -otherwise. An attempt to call other functions results in a compilation error.

    Example:

    -module(m).
    +otherwise. An attempt to call other functions results in a compilation error.

    Example:

    -module(m).
     ...
     
    --ifdef(debug).
    --define(LOG(X), io:format("{~p,~p}: ~p~n", [?MODULE,?LINE,X])).
    +-ifdef(debug).
    +-define(LOG(X), io:format("{~p,~p}: ~p~n", [?MODULE,?LINE,X])).
     -else.
    --define(LOG(X), true).
    +-define(LOG(X), true).
     -endif.
     
     ...

    When trace output is desired, debug is to be defined when the module m is @@ -142,21 +142,21 @@ or -1> c(m, {d, debug}). -{ok,m}

    ?LOG(Arg) is then expanded to a call to io:format/2 and provide the user -with some simple trace output.

    Example:

    -module(m)
    +1> c(m, {d, debug}).
    +{ok,m}

    ?LOG(Arg) is then expanded to a call to io:format/2 and provide the user +with some simple trace output.

    Example:

    -module(m)
     ...
    --if(?OTP_RELEASE >= 25).
    +-if(?OTP_RELEASE >= 25).
     %% Code that will work in OTP 25 or higher
    --elif(?OTP_RELEASE >= 26).
    +-elif(?OTP_RELEASE >= 26).
     %% Code that will work in OTP 26 or higher
     -else.
     %% Code that will work in OTP 24 or lower.
     -endif.
     ...

    This code uses the OTP_RELEASE macro to conditionally select code depending on -release.

    Example:

    -module(m)
    +release.

    Example:

    -module(m)
     ...
    --if(?OTP_RELEASE >= 26 andalso defined(debug)).
    +-if(?OTP_RELEASE >= 26 andalso defined(debug)).
     %% Debugging code that requires OTP 26 or later.
     -else.
     %% Non-debug code that works in any release.
    @@ -179,23 +179,23 @@
       
       -error() and -warning() directives
     

    -

    The directive -error(Term) causes a compilation error.

    Example:

    -module(t).
    --export([version/0]).
    +

    The directive -error(Term) causes a compilation error.

    Example:

    -module(t).
    +-export([version/0]).
     
    --ifdef(VERSION).
    -version() -> ?VERSION.
    +-ifdef(VERSION).
    +version() -> ?VERSION.
     -else.
    --error("Macro VERSION must be defined.").
    -version() -> "".
    +-error("Macro VERSION must be defined.").
    +version() -> "".
     -endif.

    The error message will look like this:

    % erlc t.erl
    -t.erl:7: -error("Macro VERSION must be defined.").

    The directive -warning(Term) causes a compilation warning.

    Example:

    -module(t).
    --export([version/0]).
    +t.erl:7: -error("Macro VERSION must be defined.").

    The directive -warning(Term) causes a compilation warning.

    Example:

    -module(t).
    +-export([version/0]).
     
    --ifndef(VERSION).
    --warning("Macro VERSION not defined -- using default version.").
    --define(VERSION, "0").
    +-ifndef(VERSION).
    +-warning("Macro VERSION not defined -- using default version.").
    +-define(VERSION, "0").
     -endif.
    -version() -> ?VERSION.

    The warning message will look like this:

    % erlc t.erl
    +version() -> ?VERSION.

    The warning message will look like this:

    % erlc t.erl
     t.erl:5: Warning: -warning("Macro VERSION not defined -- using default version.").

    Change

    The -error() and -warning() directives were added in Erlang/OTP 19.

    @@ -204,11 +204,11 @@

    The construction ??Arg, where Arg is a macro argument, is expanded to a string containing the tokens of the argument. This is similar to the #arg -stringifying construction in C.

    Example:

    -define(TESTCALL(Call), io:format("Call ~s: ~w~n", [??Call, Call])).
    +stringifying construction in C.

    Example:

    -define(TESTCALL(Call), io:format("Call ~s: ~w~n", [??Call, Call])).
     
    -?TESTCALL(myfunction(1,2)),
    -?TESTCALL(you:function(2,1)).

    results in

    io:format("Call ~s: ~w~n",["myfunction ( 1 , 2 )",myfunction(1,2)]),
    -io:format("Call ~s: ~w~n",["you : function ( 2 , 1 )",you:function(2,1)]).

    That is, a trace output, with both the function called and the resulting value.

    +
    ?TESTCALL(myfunction(1,2)), +?TESTCALL(you:function(2,1)).

    results in

    io:format("Call ~s: ~w~n",["myfunction ( 1 , 2 )",myfunction(1,2)]),
    +io:format("Call ~s: ~w~n",["you : function ( 2 , 1 )",you:function(2,1)]).

    That is, a trace output, with both the function called and the resulting value.

    /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/maps.xhtml differs (HTML document, ASCII text, with very long lines (1572)) --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/maps.xhtml" 2026-06-04 00:09:02.000000000 +0000 +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/maps.xhtml" 2042-07-06 13:28:26.000000000 +0000 @@ -57,8 +57,8 @@ values, sharing of keys between different instances of the map will be less effective, and it is not possible to match multiple elements having default values in one go.

  • To avoid having to deal with a map that may lack some keys, maps:merge/2 can -efficiently add multiple default values. For example:

    DefaultMap = #{shoe_size => 42, editor => emacs},
    -MapWithDefaultsApplied = maps:merge(DefaultMap, OtherMap)
  • +efficiently add multiple default values. For example:

    DefaultMap = #{shoe_size => 42, editor => emacs},
    +MapWithDefaultsApplied = maps:merge(DefaultMap, OtherMap)

    @@ -76,10 +76,10 @@ Using Maps as Sets

    Starting in OTP 24, the sets module has an option to represent sets as maps. -Examples:

    1> sets:new([{version,2}]).
    -#{}
    -2> sets:from_list([x,y,z], [{version,2}]).
    -#{x => [],y => [],z => []}

    sets backed by maps is generally the most efficient set representation, with a +Examples:

    1> sets:new([{version,2}]).
    +#{}
    +2> sets:from_list([x,y,z], [{version,2}]).
    +#{x => [],y => [],z => []}

    sets backed by maps is generally the most efficient set representation, with a few possible exceptions:

    • ordsets:intersection/2 can be more efficient than sets:intersection/2. If the intersection operation is frequently used and operations that operate on a single element in a set (such as is_element/2) are avoided, ordsets can @@ -112,10 +112,10 @@ allowing the key tuple to be shared with other instances of the map that have the same keys. In fact, the key tuple can be shared between all maps with the same keys with some care. To arrange that, define a function that returns a map. -For example:

      new() ->
      -    #{a => default, b => default, c => default}.

      Defined like this, the key tuple {a,b,c} will be a global literal. To ensure +For example:

      new() ->
      +    #{a => default, b => default, c => default}.

      Defined like this, the key tuple {a,b,c} will be a global literal. To ensure that the key tuple is shared when creating an instance of the map, always call -new() and modify the returned map:

          (SOME_MODULE:new())#{a := 42}.

      Using the map syntax with small maps is particularly efficient. As long as the +new() and modify the returned map:

          (SOME_MODULE:new())#{a := 42}.

      Using the map syntax with small maps is particularly efficient. As long as the keys are known at compile-time, the map is updated in one go, making the time to update a map essentially constant regardless of the number of keys updated. The same goes for matching. (When the keys are variables, one or more of the keys @@ -150,13 +150,13 @@

      Using the map syntax is usually slightly more efficient than using the corresponding function in the maps module.

      The gain in efficiency for the map syntax is more noticeable for the following -operations that can only be achieved using the map syntax:

      • Matching multiple literal keys
      • Updating multiple literal keys
      • Adding multiple literal keys to a map

      For example:

      DO

      Map = Map1#{x := X, y := Y, z := Z}

      DO NOT

      Map2 = maps:update(x, X, Map1),
      -Map3 = maps:update(y, Y, Map2),
      -Map = maps:update(z, Z, Map3)

      If the map is a small map, the first example runs roughly three times as fast.

      Note that for variable keys, the elements are updated sequentially from left to -right. For example, given the following update with variable keys:

      Map = Map1#{Key1 := X, Key2 := Y, Key3 := Z}

      the compiler rewrites it like this to ensure that the updates are applied from -left to right:

      Map2 = Map1#{Key1 := X},
      -Map3 = Map2#{Key2 := Y},
      -Map = Map3#{Key3 := Z}

      If a key is known to exist in a map, using the := operator is slightly more +operations that can only be achieved using the map syntax:

      • Matching multiple literal keys
      • Updating multiple literal keys
      • Adding multiple literal keys to a map

      For example:

      DO

      Map = Map1#{x := X, y := Y, z := Z}

      DO NOT

      Map2 = maps:update(x, X, Map1),
      +Map3 = maps:update(y, Y, Map2),
      +Map = maps:update(z, Z, Map3)

      If the map is a small map, the first example runs roughly three times as fast.

      Note that for variable keys, the elements are updated sequentially from left to +right. For example, given the following update with variable keys:

      Map = Map1#{Key1 := X, Key2 := Y, Key3 := Z}

      the compiler rewrites it like this to ensure that the updates are applied from +left to right:

      Map2 = Map1#{Key1 := X},
      +Map3 = Map2#{Key2 := Y},
      +Map = Map3#{Key3 := Z}

      If a key is known to exist in a map, using the := operator is slightly more efficient than using the => operator for a small map.

      @@ -215,15 +215,15 @@

      As an optimization, the compiler will rewrite a call to maps:get/3 to Erlang code similar to the following:

      Result = case Map of
      -             #{Key := Value} -> Value;
      -             #{} -> Default
      +             #{Key := Value} -> Value;
      +             #{} -> Default
                end

      This is reasonably efficient, but if a small map is used as an alternative to using a record it is often better not to rely on default values as it prevents sharing of keys, which may in the end use more memory than what you save from not storing default values in the map.

      If default values are nevertheless required, instead of calling maps:get/3 multiple times, consider putting the default values in a map and merging that -map with the other map:

      DefaultMap = #{Key1 => Value2, Key2 => Value2, ..., KeyN => ValueN},
      -MapWithDefaultsApplied = maps:merge(DefaultMap, OtherMap)

      This helps share keys between the default map and the one you applied defaults +map with the other map:

      DefaultMap = #{Key1 => Value2, Key2 => Value2, ..., KeyN => ValueN},
      +MapWithDefaultsApplied = maps:merge(DefaultMap, OtherMap)

      This helps share keys between the default map and the one you applied defaults to, as long as the default map contains all the keys that will ever be used and not just the ones with default values. Whether this is faster than calling maps:get/3 multiple times depends on the size of the map and the number of /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/modules.xhtml differs (HTML document, ASCII text, with very long lines (1097)) --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/modules.xhtml" 2026-06-04 00:09:02.000000000 +0000 +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/modules.xhtml" 2042-07-06 13:28:26.000000000 +0000 @@ -27,12 +27,12 @@ Module Syntax

      Erlang code is divided into modules. A module consists of a sequence of -attributes and function declarations, each terminated by a period (.).

      Example:

      -module(m).          % module attribute
      --export([fact/1]).   % module attribute
      +attributes and function declarations, each terminated by a period (.).

      Example:

      -module(m).          % module attribute
      +-export([fact/1]).   % module attribute
       
      -fact(N) when N>0 ->  % beginning of function declaration
      -    N * fact(N-1);   %  |
      -fact(0) ->           %  |
      +fact(N) when N>0 ->  % beginning of function declaration
      +    N * fact(N-1);   %  |
      +fact(0) ->           %  |
           1.               % end of function declaration

      For a description of function declarations, see Function Declaration Syntax.

      @@ -85,9 +85,9 @@ Behaviour Module Attribute

      It is possible to specify that the module is the callback module for a -behaviour:

      -behaviour(Behaviour).

      The atom Behaviour gives the name of the behaviour, which can be a +behaviour:

      -behaviour(Behaviour).

      The atom Behaviour gives the name of the behaviour, which can be a user-defined behaviour or one of the following OTP standard behaviours:

      • gen_server
      • gen_statem
      • gen_event
      • supervisor

      The spelling behavior is also accepted.

      The callback functions of the module can be specified either directly by the -exported function behaviour_info/1:

      behaviour_info(callbacks) -> Callbacks.

      or by a -callback attribute for each callback function:

      -callback Name(Arguments) -> Result.

      Here, Arguments is a list of zero or more arguments. The -callback attribute +exported function behaviour_info/1:

      behaviour_info(callbacks) -> Callbacks.

      or by a -callback attribute for each callback function:

      -callback Name(Arguments) -> Result.

      Here, Arguments is a list of zero or more arguments. The -callback attribute is to be preferred since the extra type information can be used by tools to produce documentation or find discrepancies.

      Read more about behaviours and callback modules in OTP Design Principles.

      @@ -96,7 +96,7 @@ Record Definitions

      -

      The same syntax as for module attributes is used for record definitions:

      -record(Record, Fields).

      Record definitions are allowed anywhere in a module, also among the function +

      The same syntax as for module attributes is used for record definitions:

      -record(Record, Fields).

      Record definitions are allowed anywhere in a module, also among the function declarations. Read more in Records.

      @@ -104,15 +104,15 @@ Preprocessor

      The same syntax as for module attributes is used by the preprocessor, which -supports file inclusion, macros, and conditional compilation:

      -include("SomeFile.hrl").
      --define(Macro, Replacement).

      Read more in Preprocessor.

      +supports file inclusion, macros, and conditional compilation:

      -include("SomeFile.hrl").
      +-define(Macro, Replacement).

      Read more in Preprocessor.

      Setting File and Line

      The same syntax as for module attributes is used for changing the pre-defined -macros ?FILE and ?LINE:

      -file(File, Line).

      This attribute is used by tools, such as Yecc, to inform the compiler that the +macros ?FILE and ?LINE:

      -file(File, Line).

      This attribute is used by tools, such as Yecc, to inform the compiler that the source program is generated by another tool. It also indicates the correspondence of source files to lines of the original user-written file, from which the source program is produced.

      @@ -122,8 +122,8 @@ Types and function specifications

      A similar syntax as for module attributes is used for specifying types and -function specifications:

      -type my_type() :: atom() | integer().
      --spec my_function(integer()) -> integer().

      Read more in Types and Function specifications.

      The description is based on +function specifications:

      -type my_type() :: atom() | integer().
      +-spec my_function(integer()) -> integer().

      Read more in Types and Function specifications.

      The description is based on EEP8 - Types and function specifications, which is not to be further updated.

      @@ -132,16 +132,16 @@ Documentation attributes

      The module attribute -doc(Documentation) is used to provide user documentation -for a function/type/callback:

      -doc("Example documentation").
      -example() -> ok.

      The attribute should be placed just before the entity it documents.The +for a function/type/callback:

      -doc("Example documentation").
      +example() -> ok.

      The attribute should be placed just before the entity it documents.The parenthesis are optional around Documentation. The allowed values for Documentation are:

      • literal string or utf-8 encoded binary string - The string documenting the entity. Any literal string is allowed, so both triple quoted strings and sigils that translate to literal strings can be used. -The following examples are equivalent:

        -doc("Example \"docs\"").
        --doc(<<"Example \"docs\""/utf8>>).
        +The following examples are equivalent:

        -doc("Example \"docs\"").
        +-doc(<<"Example \"docs\""/utf8>>).
         -doc ~S/Example "docs"/.
         -doc """
            Example "docs"
        @@ -162,7 +162,7 @@
         
         

        While not a module attribute, but rather a directive (since it might affect syntax), there is the -feature(..) directive used for enabling and disabling -features.

        The syntax is similar to that of an attribute, but has two arguments:

        -feature(FeatureName, enable | disable).

        Note that the feature directive can only appear +features.

        The syntax is similar to that of an attribute, but has two arguments:

        -feature(FeatureName, enable | disable).

        Note that the feature directive can only appear in a prefix of the module.

        /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/nif.xhtml differs (HTML document, ASCII text, with very long lines (1558)) --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/nif.xhtml" 2026-06-04 00:09:02.000000000 +0000 +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/nif.xhtml" 2042-07-06 13:28:26.000000000 +0000 @@ -42,18 +42,18 @@ they can also be used as fallback implementations for functions that do not have native implementations on some architectures.

        NIF libraries are loaded by calling erlang:load_nif/2, with the name of the shared library as argument. The second argument can be any term that will be -passed on to the library and used for initialization:

        -module(complex6).
        --export([foo/1, bar/1]).
        --nifs([foo/1, bar/1]).
        --on_load(init/0).
        -
        -init() ->
        -    ok = erlang:load_nif("./complex6_nif", 0).
        -
        -foo(_X) ->
        -    erlang:nif_error(nif_library_not_loaded).
        -bar(_Y) ->
        -    erlang:nif_error(nif_library_not_loaded).

        Here, the directive on_load is used to get function init to be automatically +passed on to the library and used for initialization:

        -module(complex6).
        +-export([foo/1, bar/1]).
        +-nifs([foo/1, bar/1]).
        +-on_load(init/0).
        +
        +init() ->
        +    ok = erlang:load_nif("./complex6_nif", 0).
        +
        +foo(_X) ->
        +    erlang:nif_error(nif_library_not_loaded).
        +bar(_Y) ->
        +    erlang:nif_error(nif_library_not_loaded).

        Here, the directive on_load is used to get function init to be automatically called when the module is loaded. If init returns anything other than ok, such when the loading of the NIF library fails in this example, the module is unloaded and calls to functions within it, fail.

        Loading the NIF library overrides the stub implementations and cause calls to @@ -74,35 +74,35 @@ API functions. The environment contains information about the calling Erlang process:

        #include <erl_nif.h>
         
        -extern int foo(int x);
        -extern int bar(int y);
        +extern int foo(int x);
        +extern int bar(int y);
         
        -static ERL_NIF_TERM foo_nif(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
        -{
        +static ERL_NIF_TERM foo_nif(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
        +{
             int x, ret;
        -    if (!enif_get_int(env, argv[0], &x)) {
        -	return enif_make_badarg(env);
        -    }
        -    ret = foo(x);
        -    return enif_make_int(env, ret);
        -}
        +    if (!enif_get_int(env, argv[0], &x)) {
        +	return enif_make_badarg(env);
        +    }
        +    ret = foo(x);
        +    return enif_make_int(env, ret);
        +}
         
        -static ERL_NIF_TERM bar_nif(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
        -{
        +static ERL_NIF_TERM bar_nif(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
        +{
             int y, ret;
        -    if (!enif_get_int(env, argv[0], &y)) {
        -	return enif_make_badarg(env);
        -    }
        -    ret = bar(y);
        -    return enif_make_int(env, ret);
        -}
        -
        -static ErlNifFunc nif_funcs[] = {
        -    {"foo", 1, foo_nif},
        -    {"bar", 1, bar_nif}
        -};
        +    if (!enif_get_int(env, argv[0], &y)) {
        +	return enif_make_badarg(env);
        +    }
        +    ret = bar(y);
        +    return enif_make_int(env, ret);
        +}
        +
        +static ErlNifFunc nif_funcs[] = {
        +    {"foo", 1, foo_nif},
        +    {"bar", 1, bar_nif}
        +};
         
        -ERL_NIF_INIT(complex6, nif_funcs, NULL, NULL, NULL, NULL)

        Here, ERL_NIF_INIT has the following arguments:

        • The first argument must be the name of the Erlang module as a C-identifier. It +ERL_NIF_INIT(complex6, nif_funcs, NULL, NULL, NULL, NULL)

        Here, ERL_NIF_INIT has the following arguments:

        • The first argument must be the name of the Erlang module as a C-identifier. It will be stringified by the macro.
        • The second argument is the array of ErlNifFunc structures containing name, arity, and function pointer of each NIF.
        • The remaining arguments are pointers to callback functions that can be used to initialize the library. They are not used in this simple example, hence they @@ -118,15 +118,15 @@

          Step 1. Compile the C code:

          unix> gcc -o complex6_nif.so -fpic -shared complex.c complex6_nif.c
           windows> cl -LD -MD -Fe complex6_nif.dll complex.c complex6_nif.c

          Step 2: Start Erlang and compile the Erlang code:

          > erl
          -Erlang R13B04 (erts-5.7.5) [64-bit] [smp:4:4] [rq:4] [async-threads:0] [kernel-poll:false]
          +Erlang R13B04 (erts-5.7.5) [64-bit] [smp:4:4] [rq:4] [async-threads:0] [kernel-poll:false]
           
          -Eshell V5.7.5  (abort with ^G)
          -1> c(complex6).
          -{ok,complex6}

          Step 3: Run the example:

          3> complex6:foo(3).
          +Eshell V5.7.5  (abort with ^G)
          +1> c(complex6).
          +{ok,complex6}

          Step 3: Run the example:

          3> complex6:foo(3).
           4
          -4> complex6:bar(5).
          +4> complex6:bar(5).
           10
          -5> complex6:foo("not an integer").
          +5> complex6:foo("not an integer").
           ** exception error: bad argument
                in function  complex6:foo/1
                   called as comlpex6:foo("not an integer")
          /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/opaques.xhtml differs (HTML document, ASCII text, with very long lines (1391)) --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/opaques.xhtml" 2026-06-04 00:09:02.000000000 +0000 +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/opaques.xhtml" 2042-07-06 13:28:26.000000000 +0000 @@ -31,16 +31,16 @@ The runtime does not check opacity. Dialyzer provides some opacity-checking, but the rest is up to convention.

          This document explains what Erlang opacity is (and the trade-offs involved) via the example of the sets:set() data type. This type was -defined in the sets module like this:

          -opaque set(Element) :: #set{segs :: segs(Element)}.

          OTP 24 changed the definition to the following in -this commit.

          -opaque set(Element) :: #set{segs :: segs(Element)} | #{Element => ?VALUE}.

          And this change was safer and more backwards-compatible than if the type had +defined in the sets module like this:

          -opaque set(Element) :: #set{segs :: segs(Element)}.

          OTP 24 changed the definition to the following in +this commit.

          -opaque set(Element) :: #set{segs :: segs(Element)} | #{Element => ?VALUE}.

          And this change was safer and more backwards-compatible than if the type had been defined with -type instead of -opaque. Here is why: when a module defines an -opaque, the contract is that only the defining module should rely on the definition of the type: no other modules should rely on the definition.

          This means that code that pattern-matched on set as a record/tuple technically broke the contract, and opted in to being potentially broken when the definition of set() changed. Before OTP 24, this code printed ok. In OTP 24 it may -error:

          case sets:new() of
          -    Set when is_tuple(Set) ->
          -        io:format("ok")
          +error:

          case sets:new() of
          +    Set when is_tuple(Set) ->
          +        io:format("ok")
           end.

          When working with an opaque defined in another module, here are some recommendations:

          • Don't examine the underlying type using pattern-matching, guards, or functions that reveal the type, such as tuple_size/1 .
          • Instead, use functions provided by the module for working with the type. For /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/otp-patch-apply.xhtml differs (HTML document, ASCII text, with very long lines (391)) --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/otp-patch-apply.xhtml" 2026-06-04 00:09:02.000000000 +0000 +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/otp-patch-apply.xhtml" 2042-07-06 13:28:26.000000000 +0000 @@ -110,7 +110,7 @@ Application dependencies are verified among installed applications by otp_patch_apply, but these are not necessarily those actually loaded. By calling system_information:sanity_check() one can validate -dependencies among applications actually loaded.

            1> system_information:sanity_check().
            +dependencies among applications actually loaded.

            1> system_information:sanity_check().
             ok

            Please take a look at the reference of sanity_check() for more information.

            /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/patterns.xhtml differs (HTML document, ASCII text, with very long lines (531)) --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/patterns.xhtml" 2026-06-04 00:09:02.000000000 +0000 +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/patterns.xhtml" 2042-07-06 13:28:26.000000000 +0000 @@ -37,10 +37,10 @@
            2 3> X + 1. 3 -4> {X, Y} = {1, 2}. +4> {X, Y} = {1, 2}. ** exception error: no match of right hand side value {1,2} -5> {X, Y} = {2, 3}. -{2,3} +5> {X, Y} = {2, 3}. +{2,3} 6> Y. 3
            /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/prog_ex_records.xhtml differs (HTML document, ASCII text, with very long lines (1278)) --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/prog_ex_records.xhtml" 2026-06-04 00:09:02.000000000 +0000 +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/prog_ex_records.xhtml" 2042-07-06 13:28:26.000000000 +0000 @@ -31,17 +31,17 @@ To illustrate these differences, suppose that you want to represent a person with the tuple {Name, Address, Phone}.

            To write functions that manipulate this data, remember the following:

            • The Name field is the first element of the tuple.
            • The Address field is the second element.
            • The Phone field is the third element.

            For example, to extract data from a variable P that contains such a tuple, you can write the following code and then use pattern matching to extract the -relevant fields:

            Name = element(1, P),
            -Address = element(2, P),
            +relevant fields:

            Name = element(1, P),
            +Address = element(2, P),
             ...

            Such code is difficult to read and understand, and errors occur if the numbering of the elements in the tuple is wrong. If the data representation of the fields is changed, by re-ordering, adding, or removing fields, all references to the person tuple must be checked and possibly modified.

            Records allow references to the fields by name, instead of by position. In the -following example, a record instead of a tuple is used to store the data:

            -record(person, {name, phone, address}).

            This enables references to the fields of the record by name. For example, if P +following example, a record instead of a tuple is used to store the data:

            -record(person, {name, phone, address}).

            This enables references to the fields of the record by name. For example, if P is a variable whose value is a person record, the following code access the name and address fields of the records:

            Name = P#person.name,
             Address = P#person.address,
            -...

            Internally, records are represented using tagged tuples:

            {person, Name, Phone, Address}

            +...

            Internally, records are represented using tagged tuples:

            {person, Name, Phone, Address}

            @@ -51,8 +51,8 @@ section. Three fields are included, name, phone, and address. The default values for name and phone is "" and [], respectively. The default value for address is the atom undefined, since no default value is supplied for this -field:

            -record(person, {name = "", phone = [], address}).

            The record must be defined in the shell to enable use of the record syntax in -the examples:

            > rd(person, {name = "", phone = [], address}).
            +field:

            -record(person, {name = "", phone = [], address}).

            The record must be defined in the shell to enable use of the record syntax in +the examples:

            > rd(person, {name = "", phone = [], address}).
             person

            This is because record definitions are only available at compile time, not at runtime. For details on records in the shell, see the shell manual page in STDLIB.

            @@ -61,10 +61,10 @@ Creating a Record

            -

            A new person record is created as follows:

            > #person{phone=[0,8,2,3,4,3,1,2], name="Robert"}.
            -#person{name = "Robert",phone = [0,8,2,3,4,3,1,2],address = undefined}

            As the address field was omitted, its default value is used.

            From Erlang 5.1/OTP R8B, a value to all fields in a record can be set with the -special field _. _ means "all fields not explicitly specified".

            Example:

            > #person{name = "Jakob", _ = '_'}.
            -#person{name = "Jakob",phone = '_',address = '_'}

            It is primarily intended to be used in ets:match/2 and +

            A new person record is created as follows:

            > #person{phone=[0,8,2,3,4,3,1,2], name="Robert"}.
            +#person{name = "Robert",phone = [0,8,2,3,4,3,1,2],address = undefined}

            As the address field was omitted, its default value is used.

            From Erlang 5.1/OTP R8B, a value to all fields in a record can be set with the +special field _. _ means "all fields not explicitly specified".

            Example:

            > #person{name = "Jakob", _ = '_'}.
            +#person{name = "Jakob",phone = '_',address = '_'}

            It is primarily intended to be used in ets:match/2 and mnesia:match_object/3, to set record fields to the atom '_'. (This is a wildcard in ets:match/2.)

            @@ -72,8 +72,8 @@ Accessing a Record Field

            -

            The following example shows how to access a record field:

            > P = #person{name = "Joe", phone = [0,8,2,3,4,3,1,2]}.
            -#person{name = "Joe",phone = [0,8,2,3,4,3,1,2],address = undefined}
            +

            The following example shows how to access a record field:

            > P = #person{name = "Joe", phone = [0,8,2,3,4,3,1,2]}.
            +#person{name = "Joe",phone = [0,8,2,3,4,3,1,2],address = undefined}
             > P#person.name.
             "Joe"

            @@ -81,33 +81,33 @@ Updating a Record

            -

            The following example shows how to update a record:

            > P1 = #person{name="Joe", phone=[1,2,3], address="A street"}.
            -#person{name = "Joe",phone = [1,2,3],address = "A street"}
            -> P2 = P1#person{name="Robert"}.
            -#person{name = "Robert",phone = [1,2,3],address = "A street"}

            +

            The following example shows how to update a record:

            > P1 = #person{name="Joe", phone=[1,2,3], address="A street"}.
            +#person{name = "Joe",phone = [1,2,3],address = "A street"}
            +> P2 = P1#person{name="Robert"}.
            +#person{name = "Robert",phone = [1,2,3],address = "A street"}

            Type Testing

            The following example shows that the guard succeeds if P is record of type -person:

            foo(P) when is_record(P, person) -> a_person;
            -foo(_) -> not_a_person.

            +person:

            foo(P) when is_record(P, person) -> a_person;
            +foo(_) -> not_a_person.

            Pattern Matching

            Matching can be used in combination with records, as shown in the following -example:

            > P3 = #person{name="Joe", phone=[0,0,7], address="A street"}.
            -#person{name = "Joe",phone = [0,0,7],address = "A street"}
            -> #person{name = Name} = P3, Name.
            +example:

            > P3 = #person{name="Joe", phone=[0,0,7], address="A street"}.
            +#person{name = "Joe",phone = [0,0,7],address = "A street"}
            +> #person{name = Name} = P3, Name.
             "Joe"

            The following function takes a list of person records and searches for the -phone number of a person with a particular name:

            find_phone([#person{name=Name, phone=Phone} | _], Name) ->
            -    {found,  Phone};
            -find_phone([_| T], Name) ->
            -    find_phone(T, Name);
            -find_phone([], Name) ->
            +phone number of a person with a particular name:

            find_phone([#person{name=Name, phone=Phone} | _], Name) ->
            +    {found,  Phone};
            +find_phone([_| T], Name) ->
            +    find_phone(T, Name);
            +find_phone([], Name) ->
                 not_found.

            The fields referred to in the pattern can be given in any order.

            @@ -116,12 +116,12 @@

            The value of a field in a record can be an instance of a record. Retrieval of nested data can be done stepwise, or in a single step, as shown in the following -example:

            -record(name, {first = "Robert", last = "Ericsson"}).
            --record(person, {name = #name{}, phone}).
            +example:

            -record(name, {first = "Robert", last = "Ericsson"}).
            +-record(person, {name = #name{}, phone}).
             
            -demo() ->
            -  P = #person{name= #name{first="Robert",last="Virding"}, phone=123},
            -  First = (P#person.name)#name.first.

            Here, demo() evaluates to "Robert".

            +demo() -> + P = #person{name= #name{first="Robert",last="Virding"}, phone=123}, + First = (P#person.name)#name.first.

            Here, demo() evaluates to "Robert".

            @@ -139,40 +139,40 @@ %% about the person. %% A {Key, Value} list (default is the empty list). %%------------------------------------------------------------ --record(person, {name, age, phone = [], dict = []}).

            -module(person).
            --include("person.hrl").
            --compile(export_all). % For test purposes only.
            +-record(person, {name, age, phone = [], dict = []}).
            -module(person).
            +-include("person.hrl").
            +-compile(export_all). % For test purposes only.
             
             %% This creates an instance of a person.
             %%   Note: The phone number is not supplied so the
             %%         default value [] will be used.
             
            -make_hacker_without_phone(Name, Age) ->
            -   #person{name = Name, age = Age,
            -           dict = [{computer_knowledge, excellent},
            -                   {drinks, coke}]}.
            +make_hacker_without_phone(Name, Age) ->
            +   #person{name = Name, age = Age,
            +           dict = [{computer_knowledge, excellent},
            +                   {drinks, coke}]}.
             
             %% This demonstrates matching in arguments
             
            -print(#person{name = Name, age = Age,
            -              phone = Phone, dict = Dict}) ->
            -  io:format("Name: ~s, Age: ~w, Phone: ~w ~n"
            -            "Dictionary: ~w.~n", [Name, Age, Phone, Dict]).
            +print(#person{name = Name, age = Age,
            +              phone = Phone, dict = Dict}) ->
            +  io:format("Name: ~s, Age: ~w, Phone: ~w ~n"
            +            "Dictionary: ~w.~n", [Name, Age, Phone, Dict]).
             
             %% Demonstrates type testing, selector, updating.
             
            -birthday(P) when is_record(P, person) ->
            -   P#person{age = P#person.age + 1}.
            +birthday(P) when is_record(P, person) ->
            +   P#person{age = P#person.age + 1}.
             
            -register_two_hackers() ->
            -   Hacker1 = make_hacker_without_phone("Joe", 29),
            -   OldHacker = birthday(Hacker1),
            +register_two_hackers() ->
            +   Hacker1 = make_hacker_without_phone("Joe", 29),
            +   OldHacker = birthday(Hacker1),
                % The central_register_server should have
                % an interface function for this.
            -   central_register_server ! {register_person, Hacker1},
            -   central_register_server ! {register_person,
            -             OldHacker#person{name = "Robert",
            -                              phone = [0,8,3,2,4,5,3,1]}}.
            +
            central_register_server ! {register_person, Hacker1}, + central_register_server ! {register_person, + OldHacker#person{name = "Robert", + phone = [0,8,3,2,4,5,3,1]}}.
            /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/records_macros.xhtml differs (HTML document, ASCII text, with very long lines (2706)) --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/records_macros.xhtml" 2026-06-04 00:09:02.000000000 +0000 +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/records_macros.xhtml" 2042-07-06 13:28:26.000000000 +0000 @@ -33,7 +33,7 @@ introduced:

            %%%----FILE mess_config.hrl----
             
             %%% Configure the location of the server node,
            --define(server_node, messenger@super).
            +-define(server_node, messenger@super).
             
             %%%----END FILE----
            %%%----FILE mess_interface.hrl----
             
            @@ -41,24 +41,24 @@
             %%% messenger program
             
             %%%Messages from Client to server received in server/1 function.
            --record(logon,{client_pid, username}).
            --record(message,{client_pid, to_name, message}).
            +-record(logon,{client_pid, username}).
            +-record(message,{client_pid, to_name, message}).
             %%% {'EXIT', ClientPid, Reason}  (client terminated or unreachable.
             
             %%% Messages from Server to Client, received in await_result/0 function
            --record(abort_client,{message}).
            +-record(abort_client,{message}).
             %%% Messages are: user_exists_at_other_node,
             %%%               you_are_not_logged_on
            --record(server_reply,{message}).
            +-record(server_reply,{message}).
             %%% Messages are: logged_on
             %%%               receiver_not_found
             %%%               sent  (Message has been sent (no guarantee)
             %%% Messages from Server to Client received in client/1 function
            --record(message_from,{from_name, message}).
            +-record(message_from,{from_name, message}).
             
             %%% Messages from shell to Client received in client/1 function
             %%% spawn(mess_client, client, [server_node(), Name])
            --record(message_to,{to_name, message}).
            +-record(message_to,{to_name, message}).
             %%% logoff
             
             %%%----END FILE----
            %%%----FILE user_interface.erl----
            @@ -79,27 +79,27 @@
             %%%     function is not logged on or if ToName is not logged on at
             %%%     any node.
             
            --module(user_interface).
            --export([logon/1, logoff/0, message/2]).
            --include("mess_interface.hrl").
            --include("mess_config.hrl").
            +-module(user_interface).
            +-export([logon/1, logoff/0, message/2]).
            +-include("mess_interface.hrl").
            +-include("mess_config.hrl").
             
            -logon(Name) ->
            -    case whereis(mess_client) of
            +logon(Name) ->
            +    case whereis(mess_client) of
                     undefined ->
            -            register(mess_client,
            -                     spawn(mess_client, client, [?server_node, Name]));
            +            register(mess_client,
            +                     spawn(mess_client, client, [?server_node, Name]));
                     _ -> already_logged_on
                 end.
             
            -logoff() ->
            +logoff() ->
                 mess_client ! logoff.
             
            -message(ToName, Message) ->
            -    case whereis(mess_client) of % Test if the client is running
            +message(ToName, Message) ->
            +    case whereis(mess_client) of % Test if the client is running
                     undefined ->
                         not_logged_on;
            -        _ -> mess_client ! #message_to{to_name=ToName, message=Message},
            +        _ -> mess_client ! #message_to{to_name=ToName, message=Message},
                          ok
             end.
             
            @@ -107,107 +107,107 @@
             
             %%% The client process which runs on each user node
             
            --module(mess_client).
            --export([client/2]).
            --include("mess_interface.hrl").
            -
            -client(Server_Node, Name) ->
            -    {messenger, Server_Node} ! #logon{client_pid=self(), username=Name},
            -    await_result(),
            -    client(Server_Node).
            +-module(mess_client).
            +-export([client/2]).
            +-include("mess_interface.hrl").
            +
            +client(Server_Node, Name) ->
            +    {messenger, Server_Node} ! #logon{client_pid=self(), username=Name},
            +    await_result(),
            +    client(Server_Node).
             
            -client(Server_Node) ->
            +client(Server_Node) ->
                 receive
                     logoff ->
            -            exit(normal);
            -        #message_to{to_name=ToName, message=Message} ->
            -            {messenger, Server_Node} !
            -                #message{client_pid=self(), to_name=ToName, message=Message},
            -            await_result();
            -        {message_from, FromName, Message} ->
            -            io:format("Message from ~p: ~p~n", [FromName, Message])
            +            exit(normal);
            +        #message_to{to_name=ToName, message=Message} ->
            +            {messenger, Server_Node} !
            +                #message{client_pid=self(), to_name=ToName, message=Message},
            +            await_result();
            +        {message_from, FromName, Message} ->
            +            io:format("Message from ~p: ~p~n", [FromName, Message])
                 end,
            -    client(Server_Node).
            +    client(Server_Node).
             
             %%% wait for a response from the server
            -await_result() ->
            +await_result() ->
                 receive
            -        #abort_client{message=Why} ->
            -            io:format("~p~n", [Why]),
            -            exit(normal);
            -        #server_reply{message=What} ->
            -            io:format("~p~n", [What])
            +        #abort_client{message=Why} ->
            +            io:format("~p~n", [Why]),
            +            exit(normal);
            +        #server_reply{message=What} ->
            +            io:format("~p~n", [What])
                 after 5000 ->
            -            io:format("No response from server~n", []),
            -            exit(timeout)
            +            io:format("No response from server~n", []),
            +            exit(timeout)
                 end.
             
             %%%----END FILE---
            %%%----FILE mess_server.erl----
             
             %%% This is the server process of the messenger service
             
            --module(mess_server).
            --export([start_server/0, server/0]).
            --include("mess_interface.hrl").
            -
            -server() ->
            -    process_flag(trap_exit, true),
            -    server([]).
            +-module(mess_server).
            +-export([start_server/0, server/0]).
            +-include("mess_interface.hrl").
            +
            +server() ->
            +    process_flag(trap_exit, true),
            +    server([]).
             
             %%% the user list has the format [{ClientPid1, Name1},{ClientPid22, Name2},...]
            -server(User_List) ->
            -    io:format("User list = ~p~n", [User_List]),
            +server(User_List) ->
            +    io:format("User list = ~p~n", [User_List]),
                 receive
            -        #logon{client_pid=From, username=Name} ->
            -            New_User_List = server_logon(From, Name, User_List),
            -            server(New_User_List);
            -        {'EXIT', From, _} ->
            -            New_User_List = server_logoff(From, User_List),
            -            server(New_User_List);
            -        #message{client_pid=From, to_name=To, message=Message} ->
            -            server_transfer(From, To, Message, User_List),
            -            server(User_List)
            +        #logon{client_pid=From, username=Name} ->
            +            New_User_List = server_logon(From, Name, User_List),
            +            server(New_User_List);
            +        {'EXIT', From, _} ->
            +            New_User_List = server_logoff(From, User_List),
            +            server(New_User_List);
            +        #message{client_pid=From, to_name=To, message=Message} ->
            +            server_transfer(From, To, Message, User_List),
            +            server(User_List)
                 end.
             
             %%% Start the server
            -start_server() ->
            -    register(messenger, spawn(?MODULE, server, [])).
            +start_server() ->
            +    register(messenger, spawn(?MODULE, server, [])).
             
             %%% Server adds a new user to the user list
            -server_logon(From, Name, User_List) ->
            +server_logon(From, Name, User_List) ->
            /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/ref_man_functions.xhtml differs (HTML document, ASCII text, with very long lines (831))
            --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/ref_man_functions.xhtml"	2026-06-04 00:09:02.000000000 +0000
            +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/ref_man_functions.xhtml"	2042-07-06 13:28:26.000000000 +0000
            @@ -29,10 +29,10 @@
             

            A function declaration is a sequence of function clauses separated by semicolons, and terminated by a period (.).

            A function clause consists of a clause head and a clause body, separated by ->.

            A clause head consists of the function name, an argument list, and an optional -guard sequence beginning with the keyword when:

            Name(Pattern11,...,Pattern1N) [when GuardSeq1] ->
            +guard sequence beginning with the keyword when:

            Name(Pattern11,...,Pattern1N) [when GuardSeq1] ->
                 Body1;
             ...;
            -Name(PatternK1,...,PatternKN) [when GuardSeqK] ->
            +Name(PatternK1,...,PatternKN) [when GuardSeqK] ->
                 BodyK.

            The function name is an atom. Each argument is a pattern.

            The number of arguments N is the arity of the function. A function is uniquely defined by the module name, function name, and arity. That is, two functions with the same name and in the same module, but with different arities @@ -40,10 +40,10 @@ mod:f/N.

            A clause body consists of a sequence of expressions separated by comma (,):

            Expr1,
             ...,
             ExprN

            Valid Erlang expressions and guard sequences are described in -Expressions.

            Example:

            fact(N) when N > 0 ->  % first clause head
            -    N * fact(N-1);     % first clause body
            +Expressions.

            Example:

            fact(N) when N > 0 ->  % first clause head
            +    N * fact(N-1);     % first clause body
             
            -fact(0) ->             % second clause head
            +fact(0) ->             % second clause head
                 1.                 % second clause body

            @@ -56,16 +56,16 @@ clause is found that fulfills both of the following two conditions:

            1. The patterns in the clause head can be successfully matched against the given arguments.
            2. The guard sequence, if any, is true.

            If such a clause cannot be found, a function_clause runtime error occurs.

            If such a clause is found, the corresponding clause body is evaluated. That is, the expressions in the body are evaluated sequentially and the value of the last -expression is returned.

            Consider the function fact:

            -module(mod).
            --export([fact/1]).
            +expression is returned.

            Consider the function fact:

            -module(mod).
            +-export([fact/1]).
             
            -fact(N) when N > 0 ->
            -    N * fact(N - 1);
            -fact(0) ->
            +fact(N) when N > 0 ->
            +    N * fact(N - 1);
            +fact(0) ->
                 1.

            Assume that you want to calculate the factorial for 1:

            1> mod:fact(1).

            Evaluation starts at the first clause. The pattern N is matched against argument 1. The matching succeeds and the guard (N > 0) is true, thus N is -bound to 1, and the corresponding body is evaluated:

            N * fact(N-1) => (N is bound to 1)
            -1 * fact(0)

            Now, fact(0) is called, and the function clauses are scanned +bound to 1, and the corresponding body is evaluated:

            N * fact(N-1) => (N is bound to 1)
            +1 * fact(0)

            Now, fact(0) is called, and the function clauses are scanned sequentially again. First, the pattern N is matched against 0. The matching succeeds, but the guard (N > 0) is false. Second, the pattern 0 is matched against the argument 0. The matching succeeds @@ -82,9 +82,9 @@ tail-recursive call is done. This is to ensure that no system resources, for example, call stack, are consumed. This means that an infinite loop using tail-recursive calls will not exhaust the call -stack and can (in principle) run forever.

            Example:

            loop(N) ->
            -    io:format("~w~n", [N]),
            -    loop(N+1).

            The earlier factorial example is a counter-example. It is not +stack and can (in principle) run forever.

            Example:

            loop(N) ->
            +    io:format("~w~n", [N]),
            +    loop(N+1).

            The earlier factorial example is a counter-example. It is not tail-recursive, since a multiplication is done on the result of the recursive call to fact(N-1).

            @@ -100,9 +100,9 @@ not need to be prefixed with the module name. Which BIFs that are auto-imported is specified in the erlang module in ERTS. For example, standard-type conversion BIFs like atom_to_list and BIFs allowed in guards can be called -without specifying the module name.

            Examples:

            1> tuple_size({a,b,c}).
            +without specifying the module name.

            Examples:

            1> tuple_size({a,b,c}).
             3
            -2> atom_to_list('Erlang').
            +2> atom_to_list('Erlang').
             "Erlang"
            /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/ref_man_processes.xhtml differs (HTML document, ASCII text, with very long lines (1285)) --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/ref_man_processes.xhtml" 2026-06-04 00:09:02.000000000 +0000 +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/ref_man_processes.xhtml" 2042-07-06 13:28:26.000000000 +0000 @@ -34,10 +34,10 @@ Process Creation

            -

            A process is created by calling spawn():

            spawn(Module, Name, Args) -> pid()
            -  Module = Name = atom()
            -  Args = [Arg1,...,ArgN]
            -    ArgI = term()

            spawn() creates a new process and returns the pid.

            The new process starts executing in Module:Name(Arg1,...,ArgN) where the +

            A process is created by calling spawn():

            spawn(Module, Name, Args) -> pid()
            +  Module = Name = atom()
            +  Args = [Arg1,...,ArgN]
            +    ArgI = term()

            spawn() creates a new process and returns the pid.

            The new process starts executing in Module:Name(Arg1,...,ArgN) where the arguments are the elements of the (possible empty) Args argument list.

            There exist a number of different spawn BIFs:

            /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/ref_man_records.xhtml differs (HTML document, ASCII text, with very long lines (977)) --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/ref_man_records.xhtml" 2026-06-04 00:09:02.000000000 +0000 +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/ref_man_records.xhtml" 2042-07-06 13:28:26.000000000 +0000 @@ -32,9 +32,9 @@

            A record definition consists of the name of the record, followed by the field names of the record. Record and field names must be atoms. Each field can be given an optional default value. If no default value is supplied, undefined is -used.

            -record(Name, {Field1 [= Expr1],
            +used.

            -record(Name, {Field1 [= Expr1],
                            ...
            -               FieldN [= ExprN]}).

            The default value for a field is an arbitrary expression, except that it must + FieldN [= ExprN]}).

            The default value for a field is an arbitrary expression, except that it must not use any variables.

            A record definition can be placed anywhere among the attributes and function declarations of a module, but the definition must come before any usage of the record.

            If a record is used in several modules, it is recommended that the record @@ -52,24 +52,24 @@ default value instead.

            If several fields are to be assigned the same value, the following construction can be used:

            #Name{Field1=Expr1, ..., FieldK=ExprK, _=ExprL}

            Omitted fields then get the value of evaluating ExprL instead of their default values. This feature is primarily intended to be used to create patterns for ETS -and Mnesia match functions.

            Example:

            -record(person, {name, phone, address}).
            +and Mnesia match functions.

            Example:

            -record(person, {name, phone, address}).
             
            -lookup(Name, Tab) ->
            -    ets:match_object(Tab, #person{name=Name, _='_'}).

            +lookup(Name, Tab) -> + ets:match_object(Tab, #person{name=Name, _='_'}).

            Accessing Record Fields

            Expr#Name.Field

            Returns the value of the specified field. Expr is to evaluate to a Name -record.

            Example:

            -record(person, {name, phone, address}).
            +record.

            Example:

            -record(person, {name, phone, address}).
             
            -get_person_name(Person) ->
            +get_person_name(Person) ->
                 Person#person.name.

            The following expression returns the position of the specified field in the -tuple representation of the record:

            #Name.Field

            Example:

            -record(person, {name, phone, address}).
            +tuple representation of the record:

            #Name.Field

            Example:

            -record(person, {name, phone, address}).
             
            -lookup(Name, List) ->
            -    lists:keyfind(Name, #person.name, List).

            +lookup(Name, List) -> + lists:keyfind(Name, #person.name, List).

            @@ -87,13 +87,13 @@

            Since record expressions are expanded to tuple expressions, creating records and accessing record fields are allowed in guards. However, all subexpressions (for initializing fields), must be valid guard -expressions as well.

            Examples:

            handle(Msg, State) when Msg =:= #msg{to=void, no=3} ->
            +expressions as well.

            Examples:

            handle(Msg, State) when Msg =:= #msg{to=void, no=3} ->
                 ...
             
            -handle(Msg, State) when State#state.running =:= true ->
            -    ...

            There is also a type test BIF is_record(Term, RecordTag).

            Example:

            is_person(P) when is_record(P, person) ->
            +handle(Msg, State) when State#state.running =:= true ->
            +    ...

            There is also a type test BIF is_record(Term, RecordTag).

            Example:

            is_person(P) when is_record(P, person) ->
                 true;
            -is_person(_P) ->
            +is_person(_P) ->
                 false.

            @@ -107,11 +107,11 @@ Nested Records

            -

            Assume the following record definitions:

            -record(nrec0, {name = "nested0"}).
            --record(nrec1, {name = "nested1", nrec0=#nrec0{}}).
            --record(nrec2, {name = "nested2", nrec1=#nrec1{}}).
            +

            Assume the following record definitions:

            -record(nrec0, {name = "nested0"}).
            +-record(nrec1, {name = "nested1", nrec0=#nrec0{}}).
            +-record(nrec2, {name = "nested2", nrec1=#nrec1{}}).
             
            -N2 = #nrec2{},

            Accessing or updating nested records can be written without parentheses:

            "nested0" = N2#nrec2.nrec1#nrec1.nrec0#nrec0.name,
            +N2 = #nrec2{},

            Accessing or updating nested records can be written without parentheses:

            "nested0" = N2#nrec2.nrec1#nrec1.nrec0#nrec0.name,
                 N0n = N2#nrec2.nrec1#nrec1.nrec0#nrec0{name = "nested0a"},

            which is equivalent to:

            "nested0" = ((N2#nrec2.nrec1)#nrec1.nrec0)#nrec0.name,
             N0n = ((N2#nrec2.nrec1)#nrec1.nrec0)#nrec0{name = "nested0a"},

            Change

            Before Erlang/OTP R14, parentheses were necessary when accessing or updating nested records.

            @@ -121,9 +121,9 @@ Internal Representation of Records

            Record expressions are translated to tuple expressions during compilation. A -record defined as:

            -record(Name, {Field1, ..., FieldN}).

            is internally represented by the tuple:

            {Name, Value1, ..., ValueN}

            Here each ValueI is the default value for FieldI.

            To each module using records, a pseudo function is added during compilation to -obtain information about records:

            record_info(fields, Record) -> [Field]
            -record_info(size, Record) -> Size

            Size is the size of the tuple representation, that is, one more than the +record defined as:

            -record(Name, {Field1, ..., FieldN}).

            is internally represented by the tuple:

            {Name, Value1, ..., ValueN}

            Here each ValueI is the default value for FieldI.

            To each module using records, a pseudo function is added during compilation to +obtain information about records:

            record_info(fields, Record) -> [Field]
            +record_info(size, Record) -> Size

            Size is the size of the tuple representation, that is, one more than the number of fields.

            /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/release_handling.xhtml differs (HTML document, ASCII text, with very long lines (1111)) --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/release_handling.xhtml" 2026-06-04 00:09:02.000000000 +0000 +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/release_handling.xhtml" 2042-07-06 13:28:26.000000000 +0000 @@ -132,15 +132,15 @@ Instead, it is necessary to:

            • Suspend the processes using the module (to avoid that they try to handle any requests before the code replacement is completed).
            • Ask them to transform the internal state format and switch to the new version of the module.
            • Remove the old version.
            • Resume the processes.

            This is called synchronized code replacement and for this the following -instructions are used:

            {update, Module, {advanced, Extra}}
            -{update, Module, supervisor}

            update with argument {advanced,Extra} is used when changing the internal +instructions are used:

            {update, Module, {advanced, Extra}}
            +{update, Module, supervisor}

            update with argument {advanced,Extra} is used when changing the internal state of a behaviour as described above. It causes behaviour processes to call the callback function code_change/3, passing the term Extra and some other information as arguments. See the manual pages for the respective behaviours and Appup Cookbook.

            update with argument supervisor is used when changing the start specification of a supervisor. See Appup Cookbook.

            When a module is to be updated, the release handler finds which processes that are using the module by traversing the supervision tree of each running -application and checking all the child specifications:

            {Id, StartFunc, Restart, Shutdown, Type, Modules}

            A process uses a module if the name is listed in Modules in the child +application and checking all the child specifications:

            {Id, StartFunc, Restart, Shutdown, Type, Modules}

            A process uses a module if the name is listed in Modules in the child specification for the process.

            If Modules=dynamic, which is the case for event managers, the event manager process informs the release handler about the list of currently installed event handlers (gen_event), and it is checked if the module name is in this list @@ -152,10 +152,10 @@ add_module and delete_module

            -

            If a new module is introduced, the following instruction is used:

            {add_module, Module}

            This instruction loads module Module. When running Erlang in +

            If a new module is introduced, the following instruction is used:

            {add_module, Module}

            This instruction loads module Module. When running Erlang in embedded mode it is necessary to use this this instruction. It is not strictly required when running Erlang in interactive mode, since the -code server automatically searches for and loads unloaded modules.

            The opposite of add_module is delete_module, which unloads a module:

            {delete_module, Module}

            Any process, in any application, with Module as residence module, is +code server automatically searches for and loads unloaded modules.

            The opposite of add_module is delete_module, which unloads a module:

            {delete_module, Module}

            Any process, in any application, with Module as residence module, is killed when the instruction is evaluated. Therefore, the user must ensure that all such processes are terminated before deleting module Module to avoid a situation with failing supervisor restarts.

            @@ -236,13 +236,13 @@

            To define how to upgrade/downgrade between the current version and previous versions of an application, an application upgrade file, or in short .appup file is created. The file is to be called Application.appup, where -Application is the application name:

            {Vsn,
            - [{UpFromVsn1, InstructionsU1},
            +Application is the application name:

            {Vsn,
            + [{UpFromVsn1, InstructionsU1},
               ...,
            -  {UpFromVsnK, InstructionsUK}],
            - [{DownToVsn1, InstructionsD1},
            +  {UpFromVsnK, InstructionsUK}],
            + [{DownToVsn1, InstructionsD1},
               ...,
            -  {DownToVsnK, InstructionsDK}]}.
            • Vsn, a string, is the current version of the application, as defined in the + {DownToVsnK, InstructionsDK}]}.
            • Vsn, a string, is the current version of the application, as defined in the .app file.
            • Each UpFromVsn is a previous version of the application to upgrade from.
            • Each DownToVsn is a previous version of the application to downgrade to.
            • Each Instructions is a list of release handling instructions.

            UpFromVsn and DownToVsn can also be specified as regular expressions. For more information about the syntax and contents of the .appup file, see appup in SASL.

            Appup Cookbook includes examples of .appup files for @@ -250,52 +250,52 @@ Releases. Assume you want to add a function available/0 to server ch3, which returns the number of available channels (when trying out the example, make the change in a copy of the original -directory, to ensure that the first version is still available):

            -module(ch3).
            --behaviour(gen_server).
            +directory, to ensure that the first version is still available):

            -module(ch3).
            +-behaviour(gen_server).
             
            --export([start_link/0]).
            --export([alloc/0, free/1]).
            --export([available/0]).
            --export([init/1, handle_call/3, handle_cast/2]).
            +-export([start_link/0]).
            +-export([alloc/0, free/1]).
            +-export([available/0]).
            +-export([init/1, handle_call/3, handle_cast/2]).
             
            -start_link() ->
            -    gen_server:start_link({local, ch3}, ch3, [], []).
            +start_link() ->
            +    gen_server:start_link({local, ch3}, ch3, [], []).
             
            -alloc() ->
            -    gen_server:call(ch3, alloc).
            +alloc() ->
            +    gen_server:call(ch3, alloc).
             
            -free(Ch) ->
            -    gen_server:cast(ch3, {free, Ch}).
            +free(Ch) ->
            +    gen_server:cast(ch3, {free, Ch}).
             
            -available() ->
            -    gen_server:call(ch3, available).
            +available() ->
            +    gen_server:call(ch3, available).
             
            -init(_Args) ->
            -    {ok, channels()}.
            +init(_Args) ->
            +    {ok, channels()}.
             
            -handle_call(alloc, _From, Chs) ->
            -    {Ch, Chs2} = alloc(Chs),
            -    {reply, Ch, Chs2};
            -handle_call(available, _From, Chs) ->
            -    N = available(Chs),
            -    {reply, N, Chs}.
            +handle_call(alloc, _From, Chs) ->
            +    {Ch, Chs2} = alloc(Chs),
            +    {reply, Ch, Chs2};
            +handle_call(available, _From, Chs) ->
            +    N = available(Chs),
            +    {reply, N, Chs}.
             
            -handle_cast({free, Ch}, Chs) ->
            -    Chs2 = free(Ch, Chs),
            -    {noreply, Chs2}.

            A new version of the ch_app.app file must now be created, where the version is -updated:

            {application, ch_app,
            - [{description, "Channel allocator"},
            -  {vsn, "2"},
            -  {modules, [ch_app, ch_sup, ch3]},
            -  {registered, [ch3]},
            -  {applications, [kernel, stdlib, sasl]},
            -  {mod, {ch_app,[]}}
            - ]}.

            To upgrade ch_app from "1" to "2" (and to downgrade from "2" to "1"), +handle_cast({free, Ch}, Chs) -> + Chs2 = free(Ch, Chs), + {noreply, Chs2}.

            A new version of the ch_app.app file must now be created, where the version is +updated:

            {application, ch_app,
            + [{description, "Channel allocator"},
            +  {vsn, "2"},
            +  {modules, [ch_app, ch_sup, ch3]},
            +  {registered, [ch3]},
            +  {applications, [kernel, stdlib, sasl]},
            +  {mod, {ch_app,[]}}
            + ]}.

            To upgrade ch_app from "1" to "2" (and to downgrade from "2" to "1"), you only need to load the new (old) version of the ch3 callback module. Create -the application upgrade file ch_app.appup in the ebin directory:

            {"2",
            - [{"1", [{load_module, ch3}]}],
            - [{"1", [{load_module, ch3}]}]
            -}.

            +the application upgrade file ch_app.appup in the ebin directory:

            {"2",
            + [{"1", [{load_module, ch3}]}],
            + [{"1", [{load_module, ch3}]}]
            +}.

            @@ -314,14 +314,14 @@ relup in SASL.

            Example, continued from the previous section: You have a new version "2" of ch_app and an .appup file. A new version of the .rel file is also needed. This time the file is called ch_rel-2.rel and the release version string is -changed from "A" to "B":

            {release,
            - {"ch_rel", "B"},
            - {erts, "14.2.5"},
            - [{kernel, "9.2.4"},
            -  {stdlib, "5.2.3"},
            -  {sasl, "4.2.1"},
            -  {ch_app, "2"}]
            -}.

            Now the relup file can be generated:

            1> systools:make_relup("ch_rel-2", ["ch_rel-1"], ["ch_rel-1"]).
            +changed from "A" to "B":

            {release,
            + {"ch_rel", "B"},
            + {erts, "14.2.5"},
            + [{kernel, "9.2.4"},
            +  {stdlib, "5.2.3"},
            +  {sasl, "4.2.1"},
            +  {ch_app, "2"}]
            +}.

            Now the relup file can be generated:

            1> systools:make_relup("ch_rel-2", ["ch_rel-1"], ["ch_rel-1"]).
             ok

            This generates a relup file with instructions for how to upgrade from version "A" ("ch_rel-1") to version "B" ("ch_rel-2") and how to downgrade from version "B" to version "A".

            Both the old and new versions of the .app and .rel files must be in the code @@ -342,17 +342,17 @@ packages. The release_handler module communicates with this process.

            Assuming there is an operational target system with installation root directory $ROOT, the release package with the new version of the release is to be copied to $ROOT/releases.

            First, unpack the release package. The files are then extracted from the -package:

            release_handler:unpack_release(ReleaseName) => {ok, Vsn}
            • ReleaseName is the name of the release package except the .tar.gz +package:

              release_handler:unpack_release(ReleaseName) => {ok, Vsn}
              • ReleaseName is the name of the release package except the .tar.gz extension.
              • Vsn is the version of the unpacked release, as defined in its .rel file.

              A directory $ROOT/lib/releases/Vsn is created, where the .rel file, the boot script start.boot, the system configuration file sys.config, and relup are placed. For applications with new version numbers, the application directories are placed under $ROOT/lib. Unchanged applications are not affected.

              An unpacked release can be installed. The release handler then evaluates the -instructions in relup, step by step:

              release_handler:install_release(Vsn) => {ok, FromVsn, []}

              If an error occurs during the installation, the system is rebooted using the old +instructions in relup, step by step:

              release_handler:install_release(Vsn) => {ok, FromVsn, []}

              If an error occurs during the installation, the system is rebooted using the old version of the release. If installation succeeds, the system is afterwards using the new version of the release, but if anything happens and the system is rebooted, it starts using the previous version again.

              To be made the default version, the newly installed release must be made permanent, which means the previous version becomes old:

              release_handler:make_permanent(Vsn) => ok

              The system keeps information about which versions are old and permanent in the -files $ROOT/releases/RELEASES and $ROOT/releases/start_erl.data.

              To downgrade from Vsn to FromVsn, install_release must be called again:

              release_handler:install_release(FromVsn) => {ok, Vsn, []}

              An installed, but not permanent, release can be removed. Information about the +files $ROOT/releases/RELEASES and $ROOT/releases/start_erl.data.

              To downgrade from Vsn to FromVsn, install_release must be called again:

              release_handler:install_release(FromVsn) => {ok, Vsn, []}

              An installed, but not permanent, release can be removed. Information about the release is then deleted from $ROOT/releases/RELEASES and the release-specific code, that is, the new application directories and the $ROOT/releases/Vsn directory, are removed.

              release_handler:remove_release(Vsn) => ok

              @@ -371,9 +371,9 @@ ...

            $ROOT is the installation directory of the target system.

            Step 3) In another Erlang shell, generate start scripts and create a release package for the new version "B". Remember to include (a possible updated) sys.config and the relup file. For more information, see -Release Upgrade File.

            1> systools:make_script("ch_rel-2").
            +Release Upgrade File.

            1> systools:make_script("ch_rel-2").
             ok
            -2> systools:make_tar("ch_rel-2").
            +2> systools:make_tar("ch_rel-2").
             ok

            The new release package now also contains version "2" of ch_app and the relup file:

            % tar tf ch_rel-2.tar
             lib/kernel-9.2.4/ebin/kernel.app
            @@ -394,23 +394,23 @@
            /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/release_structure.xhtml differs (HTML document, ASCII text, with very long lines (787))
            --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/release_structure.xhtml"	2026-06-04 00:09:02.000000000 +0000
            +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/release_structure.xhtml"	2042-07-06 13:28:26.000000000 +0000
            @@ -45,29 +45,29 @@
             

            To define a release, create a release resource file, or in short a .rel file. In the file, specify the name and version of the release, which ERTS -version it is based on, and which applications it consists of:

            {release, {Name,Vsn}, {erts, EVsn},
            - [{Application1, AppVsn1},
            +version it is based on, and which applications it consists of:

            {release, {Name,Vsn}, {erts, EVsn},
            + [{Application1, AppVsn1},
                ...
            -  {ApplicationN, AppVsnN}]}.

            Name, Vsn, EVsn, and AppVsn are strings.

            The file must be named Rel.rel, where Rel is a unique name.

            Each Application (atom) and AppVsn is the name and version of an application + {ApplicationN, AppVsnN}]}.

            Name, Vsn, EVsn, and AppVsn are strings.

            The file must be named Rel.rel, where Rel is a unique name.

            Each Application (atom) and AppVsn is the name and version of an application included in the release. The minimal release based on Erlang/OTP consists of the Kernel and STDLIB applications, so these applications must be included in the list.

            If the release is to be upgraded, it must also include the SASL application.

            Here is an example showing the .app file for a release of ch_app from -the Applications section:

            {application, ch_app,
            - [{description, "Channel allocator"},
            -  {vsn, "1"},
            -  {modules, [ch_app, ch_sup, ch3]},
            -  {registered, [ch3]},
            -  {applications, [kernel, stdlib, sasl]},
            -  {mod, {ch_app,[]}}
            - ]}.

            The .rel file must also contain kernel, stdlib, and sasl, as these -applications are required by ch_app. The file is called ch_rel-1.rel:

            {release,
            - {"ch_rel", "A"},
            - {erts, "14.2.5"},
            - [{kernel, "9.2.4"},
            -  {stdlib, "5.2.3"},
            -  {sasl, "4.2.1"},
            -  {ch_app, "1"}]
            -}.

            +the Applications section:

            {application, ch_app,
            + [{description, "Channel allocator"},
            +  {vsn, "1"},
            +  {modules, [ch_app, ch_sup, ch3]},
            +  {registered, [ch3]},
            +  {applications, [kernel, stdlib, sasl]},
            +  {mod, {ch_app,[]}}
            + ]}.

            The .rel file must also contain kernel, stdlib, and sasl, as these +applications are required by ch_app. The file is called ch_rel-1.rel:

            {release,
            + {"ch_rel", "A"},
            + {erts, "14.2.5"},
            + [{kernel, "9.2.4"},
            +  {stdlib, "5.2.3"},
            +  {sasl, "4.2.1"},
            +  {ch_app, "1"}]
            +}.

            @@ -99,9 +99,9 @@

            The systools:make_tar/1,2 function takes a .rel file as input and creates a zipped tar file with the code for -the specified applications, a release package:

            1> systools:make_script("ch_rel-1").
            +the specified applications, a release package:

            1> systools:make_script("ch_rel-1").
             ok
            -2> systools:make_tar("ch_rel-1").
            +2> systools:make_tar("ch_rel-1").
             ok

            The release package by default contains:

            • The .app files
            • The .rel file
            • The object code for all applications, structured according to the application directory structure
            • The binary boot script renamed to start.boot
            % tar tf ch_rel-1.tar
             lib/kernel-9.2.4/ebin/kernel.app
            /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/robustness.xhtml differs (HTML document, ASCII text, with very long lines (835))
            --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/robustness.xhtml"	2026-06-04 00:09:02.000000000 +0000
            +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/robustness.xhtml"	2042-07-06 13:28:26.000000000 +0000
            @@ -37,36 +37,36 @@
             "pong" so that "pong" can also finish. Another way to let "pong" finish is to
             make "pong" exit if it does not receive a message from ping within a certain
             time. This can be done by adding a time-out to pong as shown in the
            -following example:

            -module(tut19).
            +following example:

            -module(tut19).
             
            --export([start_ping/1, start_pong/0,  ping/2, pong/0]).
            +-export([start_ping/1, start_pong/0,  ping/2, pong/0]).
             
            -ping(0, Pong_Node) ->
            -    io:format("ping finished~n", []);
            +ping(0, Pong_Node) ->
            +    io:format("ping finished~n", []);
             
            -ping(N, Pong_Node) ->
            -    {pong, Pong_Node} ! {ping, self()},
            +ping(N, Pong_Node) ->
            +    {pong, Pong_Node} ! {ping, self()},
                 receive
                     pong ->
            -            io:format("Ping received pong~n", [])
            +            io:format("Ping received pong~n", [])
                 end,
            -    ping(N - 1, Pong_Node).
            +    ping(N - 1, Pong_Node).
             
            -pong() ->
            +pong() ->
                 receive
            -        {ping, Ping_PID} ->
            -            io:format("Pong received ping~n", []),
            +        {ping, Ping_PID} ->
            +            io:format("Pong received ping~n", []),
                         Ping_PID ! pong,
            -            pong()
            +            pong()
                 after 5000 ->
            -            io:format("Pong timed out~n", [])
            +            io:format("Pong timed out~n", [])
                 end.
             
            -start_pong() ->
            -    register(pong, spawn(tut19, pong, [])).
            +start_pong() ->
            +    register(pong, spawn(tut19, pong, [])).
             
            -start_ping(Pong_Node) ->
            -    spawn(tut19, ping, [3, Pong_Node]).

            After this is compiled and the file tut19.beam is copied to the necessary +start_ping(Pong_Node) -> + spawn(tut19, ping, [3, Pong_Node]).

            After this is compiled and the file tut19.beam is copied to the necessary directories, the following is seen on (pong@kosken):

            (pong@kosken)1> tut19:start_pong().
             true
             Pong received ping
            @@ -77,20 +77,20 @@
             Ping received pong
             Ping received pong
             Ping received pong
            -ping finished

            The time-out is set in:

            pong() ->
            +ping finished

            The time-out is set in:

            pong() ->
                 receive
            -        {ping, Ping_PID} ->
            -            io:format("Pong received ping~n", []),
            +        {ping, Ping_PID} ->
            +            io:format("Pong received ping~n", []),
                         Ping_PID ! pong,
            -            pong()
            +            pong()
                 after 5000 ->
            -            io:format("Pong timed out~n", [])
            +            io:format("Pong timed out~n", [])
                 end.

            The time-out (after 5000) is started when receive is entered. The time-out is canceled if {ping,Ping_PID} is received. If {ping,Ping_PID} is not received, the actions following the time-out are done after 5000 milliseconds. after must be last in the receive, that is, preceded by all other message reception specifications in the receive. It is also possible to call a -function that returned an integer for the time-out:

            after pong_timeout() ->

            In general, there are better ways than using time-outs to supervise parts of a +function that returned an integer for the time-out:

            after pong_timeout() ->

            In general, there are better ways than using time-outs to supervise parts of a distributed Erlang system. Time-outs are usually appropriate to supervise external events, for example, if you have expected a message from some external system within a specified time. For example, a time-out can be used to log a @@ -118,36 +118,36 @@ If one of the processes exits abnormally, all the processes in the transaction are killed. As it is often wanted to create a process and link to it at the same time, there is a special BIF, spawn_link that does the -same as spawn, but also creates a link to the spawned process.

            Now an example of the ping pong example using links to terminate "pong":

            -module(tut20).
            +same as spawn, but also creates a link to the spawned process.

            Now an example of the ping pong example using links to terminate "pong":

            -module(tut20).
             
            --export([start/1,  ping/2, pong/0]).
            +-export([start/1,  ping/2, pong/0]).
             
            -ping(N, Pong_Pid) ->
            -    link(Pong_Pid),
            -    ping1(N, Pong_Pid).
            +ping(N, Pong_Pid) ->
            +    link(Pong_Pid),
            +    ping1(N, Pong_Pid).
             
            -ping1(0, _) ->
            -    exit(ping);
            +ping1(0, _) ->
            +    exit(ping);
             
            -ping1(N, Pong_Pid) ->
            -    Pong_Pid ! {ping, self()},
            +ping1(N, Pong_Pid) ->
            +    Pong_Pid ! {ping, self()},
                 receive
                     pong ->
            -            io:format("Ping received pong~n", [])
            +            io:format("Ping received pong~n", [])
                 end,
            -    ping1(N - 1, Pong_Pid).
            +    ping1(N - 1, Pong_Pid).
             
            -pong() ->
            +pong() ->
                 receive
            -        {ping, Ping_PID} ->
            -            io:format("Pong received ping~n", []),
            +        {ping, Ping_PID} ->
            +            io:format("Pong received ping~n", []),
                         Ping_PID ! pong,
            -            pong()
            +            pong()
                 end.
             
            -start(Ping_Node) ->
            -    PongPID = spawn(tut20, pong, []),
            -    spawn(Ping_Node, tut20, ping, [3, PongPID]).
            (s1@bill)3> tut20:start(s2@kosken).
            +start(Ping_Node) ->
            +    PongPID = spawn(tut20, pong, []),
            +    spawn(Ping_Node, tut20, ping, [3, PongPID]).
            (s1@bill)3> tut20:start(s2@kosken).
             Pong received ping
             <3820.41.0>
             Ping received pong
            @@ -161,45 +161,45 @@
             sent to "pong", which also terminates.

            It is possible to modify the default behaviour of a process so that it does not get killed when it receives abnormal exit signals. Instead, all signals are turned into normal messages on the format {'EXIT',FromPID,Reason} and added to -the end of the receiving process' message queue. This behaviour is set by:

            process_flag(trap_exit, true)

            There are several other process flags, see erlang(3). +the end of the receiving process' message queue. This behaviour is set by:

            process_flag(trap_exit, true)

            There are several other process flags, see erlang(3). Changing the default behaviour of a process in this way is usually not done in standard user programs, but is left to the supervisory programs in OTP. However, -the ping pong program is modified to illustrate exit trapping.

            -module(tut21).
            +the ping pong program is modified to illustrate exit trapping.

            -module(tut21).
             
            --export([start/1,  ping/2, pong/0]).
            +-export([start/1,  ping/2, pong/0]).
             
            -ping(N, Pong_Pid) ->
            -    link(Pong_Pid),
            -    ping1(N, Pong_Pid).
            +ping(N, Pong_Pid) ->
            +    link(Pong_Pid),
            +    ping1(N, Pong_Pid).
             
            -ping1(0, _) ->
            -    exit(ping);
            +ping1(0, _) ->
            +    exit(ping);
             
            -ping1(N, Pong_Pid) ->
            -    Pong_Pid ! {ping, self()},
            +ping1(N, Pong_Pid) ->
            +    Pong_Pid ! {ping, self()},
                 receive
                     pong ->
            -            io:format("Ping received pong~n", [])
            +            io:format("Ping received pong~n", [])
                 end,
            -    ping1(N - 1, Pong_Pid).
            +    ping1(N - 1, Pong_Pid).
             
            -pong() ->
            -    process_flag(trap_exit, true),
            -    pong1().
            +pong() ->
            +    process_flag(trap_exit, true),
            +    pong1().
             
            -pong1() ->
            +pong1() ->
                 receive
            -        {ping, Ping_PID} ->
            -            io:format("Pong received ping~n", []),
            +        {ping, Ping_PID} ->
            +            io:format("Pong received ping~n", []),
                         Ping_PID ! pong,
            -            pong1();
            -        {'EXIT', From, Reason} ->
            -            io:format("pong exiting, got ~p~n", [{'EXIT', From, Reason}])
            +            pong1();
            +        {'EXIT', From, Reason} ->
            +            io:format("pong exiting, got ~p~n", [{'EXIT', From, Reason}])
                 end.
             
            -start(Ping_Node) ->
            /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/seq_prog.xhtml differs (HTML document, ASCII text, with very long lines (1535))
            --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/seq_prog.xhtml"	2026-06-04 00:09:02.000000000 +0000
            +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/seq_prog.xhtml"	2042-07-06 13:28:26.000000000 +0000
            @@ -45,13 +45,13 @@
             more editing commands in the shell (see
             tty - A command line interface in ERTS User's Guide).

            (Notice that many line numbers given by the shell in the following examples are out of sequence. This is because this tutorial was written and code-tested in -separate sessions).

            Here is a bit more complex calculation:

            2> (42 + 77) * 66 / 3.
            +separate sessions).

            Here is a bit more complex calculation:

            2> (42 + 77) * 66 / 3.
             2618.0

            Notice the use of brackets, the multiplication operator *, and the division operator /, as in normal arithmetic (see Expressions).

            Press Control-C to shut down the Erlang system and the Erlang shell.

            The following output is shown:

            BREAK: (a)bort (c)ontinue (p)roc info (i)nfo (l)oaded
                    (v)ersion (k)ill (D)b-tables (d)istribution
             a
            -$

            Type a to leave the Erlang system.

            Another way to shut down the Erlang system is by entering halt/0:

            3> halt().
            +$

            Type a to leave the Erlang system.

            Another way to shut down the Erlang system is by entering halt/0:

            3> halt().
             $

            @@ -65,55 +65,55 @@ editor has an Erlang mode that makes it easier for you to enter and format your code nicely (see The Erlang mode for Emacs in Tools User's Guide), but you can manage perfectly well without. Here is the -code to enter:

            -module(tut).
            --export([double/1]).
            +code to enter:

            -module(tut).
            +-export([double/1]).
             
            -double(X) ->
            +double(X) ->
                 2 * X.

            It is not hard to guess that this program doubles the value of numbers. The first two lines of the code are described later. Let us compile the program. -This can be done in an Erlang shell as follows, where c means compile:

            3> c(tut).
            -{ok,tut}

            The {ok,tut} means that the compilation is OK. If it says error it means +This can be done in an Erlang shell as follows, where c means compile:

            3> c(tut).
            +{ok,tut}

            The {ok,tut} means that the compilation is OK. If it says error it means that there is some mistake in the text that you entered. Additional error messages gives an idea to what is wrong so you can modify the text and then try -to compile the program again.

            Now run the program:

            4> tut:double(10).
            +to compile the program again.

            Now run the program:

            4> tut:double(10).
             20

            As expected, double of 10 is 20.

            Now let us get back to the first two lines of the code. Erlang programs are written in files. Each file contains an Erlang module. The first line of code -in the module is the module name (see Modules):

            -module(tut).

            Thus, the module is called tut. Notice the full stop . at the end of the +in the module is the module name (see Modules):

            -module(tut).

            Thus, the module is called tut. Notice the full stop . at the end of the line. The files which are used to store the module must have the same name as the module but with the extension .erl. In this case the file name is tut.erl. When using a function in another module, the syntax module_name:function_name(arguments) is used. So the following means call -function double in module tut with argument 10.

            4> tut:double(10).

            The second line says that the module tut contains a function called double, -which takes one argument (X in our example):

            -export([double/1]).

            The second line also says that this function can be called from outside the +function double in module tut with argument 10.

            4> tut:double(10).

            The second line says that the module tut contains a function called double, +which takes one argument (X in our example):

            -export([double/1]).

            The second line also says that this function can be called from outside the module tut. More about this later. Again, notice the . at the end of the line.

            Now for a more complicated example, the factorial of a number. For example, the -factorial of 4 is 4 3 2 * 1, which equals 24.

            Enter the following code in a file named tut1.erl:

            -module(tut1).
            --export([fac/1]).
            +factorial of 4 is 4  3  2 * 1, which equals 24.

            Enter the following code in a file named tut1.erl:

            -module(tut1).
            +-export([fac/1]).
             
            -fac(1) ->
            +fac(1) ->
                 1;
            -fac(N) ->
            -    N * fac(N - 1).

            So this is a module, called tut1 that contains a function called fac>, which -takes one argument, N.

            The first part says that the factorial of 1 is 1.:

            fac(1) ->
            +fac(N) ->
            +    N * fac(N - 1).

            So this is a module, called tut1 that contains a function called fac>, which +takes one argument, N.

            The first part says that the factorial of 1 is 1.:

            fac(1) ->
                 1;

            Notice that this part ends with a semicolon ; that indicates that there is more of the function fac> to come.

            The second part says that the factorial of N is N multiplied by the factorial of -N - 1:

            fac(N) ->
            -    N * fac(N - 1).

            Notice that this part ends with a . saying that there are no more parts of -this function.

            Compile the file:

            5> c(tut1).
            -{ok,tut1}

            And now calculate the factorial of 4.

            6> tut1:fac(4).
            +N - 1:

            fac(N) ->
            +    N * fac(N - 1).

            Notice that this part ends with a . saying that there are no more parts of +this function.

            Compile the file:

            5> c(tut1).
            +{ok,tut1}

            And now calculate the factorial of 4.

            6> tut1:fac(4).
             24

            Here the function fac> in module tut1 is called with argument 4.

            A function can have many arguments. Let us expand the module tut1 with the -function to multiply two numbers:

            -module(tut1).
            --export([fac/1, mult/2]).
            +function to multiply two numbers:

            -module(tut1).
            +-export([fac/1, mult/2]).
             
            -fac(1) ->
            +fac(1) ->
                 1;
            -fac(N) ->
            -    N * fac(N - 1).
            +fac(N) ->
            +    N * fac(N - 1).
             
            -mult(X, Y) ->
            +mult(X, Y) ->
                 X * Y.

            Notice that it is also required to expand the -export line with the -information that there is another function mult with two arguments.

            Compile:

            7> c(tut1).
            -{ok,tut1}

            Try out the new function mult:

            8> tut1:mult(3,4).
            +information that there is another function mult with two arguments.

            Compile:

            7> c(tut1).
            +{ok,tut1}

            Try out the new function mult:

            8> tut1:mult(3,4).
             12

            In this example the numbers are integers and the arguments in the functions in the code N, X, and Y are called variables. Variables must start with a capital letter (see Variables). Examples of @@ -127,56 +127,56 @@ Atom), for example, charles, centimeter, and inch. Atoms are simply names, nothing else. They are not like variables, which can have a value.

            Enter the next program in a file named tut2.erl). It can be useful for -converting from inches to centimeters and conversely:

            -module(tut2).
            --export([convert/2]).
            +converting from inches to centimeters and conversely:

            -module(tut2).
            +-export([convert/2]).
             
            -convert(M, inch) ->
            +convert(M, inch) ->
                 M / 2.54;
             
            -convert(N, centimeter) ->
            -    N * 2.54.

            Compile:

            9> c(tut2).
            -{ok,tut2}

            Test:

            10> tut2:convert(3, inch).
            +convert(N, centimeter) ->
            +    N * 2.54.

            Compile:

            9> c(tut2).
            +{ok,tut2}

            Test:

            10> tut2:convert(3, inch).
             1.1811023622047243
            -11> tut2:convert(7, centimeter).
            +11> tut2:convert(7, centimeter).
             17.78

            Notice the introduction of decimals (floating point numbers) without any explanation. Hopefully you can cope with that.

            Let us see what happens if something other than centimeter or inch is -entered in the convert function:

            12> tut2:convert(3, miles).
            +entered in the convert function:

            12> tut2:convert(3, miles).
             ** exception error: no function clause matching tut2:convert(3,miles) (tut2.erl, line 4)

            The two parts of the convert function are called its clauses. As shown, miles is not part of either of the clauses. The Erlang system cannot match either of the clauses so an error message function_clause is returned. The shell formats the error message nicely, but the error tuple is saved in the -shell's history list and can be output by the shell command v/1:

            13> v(12).
            -{'EXIT',{function_clause,[{tut2,convert,
            -                                [3,miles],
            -                                [{file,"tut2.erl"},{line,4}]},
            -                          {erl_eval,do_apply,6,
            -                                    [{file,"erl_eval.erl"},{line,677}]},
            -                          {shell,exprs,7,[{file,"shell.erl"},{line,687}]},
            -                          {shell,eval_exprs,7,[{file,"shell.erl"},{line,642}]},
            -                          {shell,eval_loop,3,
            -                                 [{file,"shell.erl"},{line,627}]}]}}

            +shell's history list and can be output by the shell command v/1:

            13> v(12).
            +{'EXIT',{function_clause,[{tut2,convert,
            +                                [3,miles],
            +                                [{file,"tut2.erl"},{line,4}]},
            +                          {erl_eval,do_apply,6,
            +                                    [{file,"erl_eval.erl"},{line,677}]},
            +                          {shell,exprs,7,[{file,"shell.erl"},{line,687}]},
            +                          {shell,eval_exprs,7,[{file,"shell.erl"},{line,642}]},
            +                          {shell,eval_loop,3,
            +                                 [{file,"shell.erl"},{line,627}]}]}}

            Tuples

            -

            Now the tut2 program is hardly good programming style. Consider:

            tut2:convert(3, inch).

            Does this mean that 3 is in inches? Or does it mean that 3 is in centimeters and +

            Now the tut2 program is hardly good programming style. Consider:

            tut2:convert(3, inch).

            Does this mean that 3 is in inches? Or does it mean that 3 is in centimeters and is to be converted to inches? Erlang has a way to group things together to make things more understandable. These are called tuples and are surrounded by curly brackets, { and }.

            So, {inch,3} denotes 3 inches and {centimeter,5} denotes 5 centimeters. Now let us write a new program that converts centimeters to inches and conversely. -Enter the following code in a file called tut3.erl):

            -module(tut3).
            --export([convert_length/1]).
            +Enter the following code in a file called tut3.erl):

            -module(tut3).
            +-export([convert_length/1]).
             
            -convert_length({centimeter, X}) ->
            -    {inch, X / 2.54};
            -convert_length({inch, Y}) ->
            -    {centimeter, Y * 2.54}.

            Compile and test:

            14> c(tut3).
            -{ok,tut3}
            -15> tut3:convert_length({inch, 5}).
            -{centimeter,12.7}
            -16> tut3:convert_length(tut3:convert_length({inch, 5})).
            -{inch,5.0}

            Notice on line 16 that 5 inches is converted to centimeters and back again and +convert_length({centimeter, X}) -> + {inch, X / 2.54}; +convert_length({inch, Y}) -> + {centimeter, Y * 2.54}.

            Compile and test:

            14> c(tut3).
            +{ok,tut3}
            +15> tut3:convert_length({inch, 5}).
            +{centimeter,12.7}
            +16> tut3:convert_length(tut3:convert_length({inch, 5})).
            +{inch,5.0}

            Notice on line 16 that 5 inches is converted to centimeters and back again and reassuringly get back to the original value. That is, the argument to a function can be the result of another function. Consider how line 16 (above) works. The argument given to the function {inch,5} is first matched against the first @@ -185,9 +185,9 @@ before the ->). This having failed, let us try the head of the next clause that is, convert_length({inch,Y}). This matches, and Y gets the value 5.

            Tuples can have more than two parts, in fact as many parts as you want, and contain any valid Erlang term. For example, to represent the temperature of -various cities of the world:

            {moscow, {c, -10}}
            -{cape_town, {f, 70}}
            -{paris, {f, 28}}

            Tuples have a fixed number of items in them. Each item in a tuple is called an +various cities of the world:

            {moscow, {c, -10}}
            +{cape_town, {f, 70}}
            +{paris, {f, 28}}

            Tuples have a fixed number of items in them. Each item in a tuple is called an element. In the tuple {moscow,{c,-10}}, element 1 is moscow and element 2 is {c,-10}. Here c represents Celsius and f Fahrenheit.

            /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/spec_proc.xhtml differs (HTML document, ASCII text, with very long lines (1676)) --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/spec_proc.xhtml" 2026-06-04 00:09:02.000000000 +0000 +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/spec_proc.xhtml" 2042-07-06 13:28:26.000000000 +0000 @@ -32,64 +32,64 @@

            The sys module has functions for simple debugging of processes implemented using behaviours. The code_lock example from -gen_statem Behaviour is used to illustrate this:

            Erlang/OTP 27 [erts-15.0] [64-bit] [smp:8:8] [ds:8:8:10] [async-threads:1] [jit]
            +gen_statem Behaviour is used to illustrate this:

            Erlang/OTP 27 [erts-15.0] [64-bit] [smp:8:8] [ds:8:8:10] [async-threads:1] [jit]
             
            -Eshell V15.0 (press Ctrl+G to abort, type help(). for help)
            -1> code_lock:start_link([1,2,3,4]).
            +Eshell V15.0 (press Ctrl+G to abort, type help(). for help)
            +1> code_lock:start_link([1,2,3,4]).
             Lock
            -{ok,<0.90.0>}
            -2> sys:statistics(code_lock, true).
            +{ok,<0.90.0>}
            +2> sys:statistics(code_lock, true).
             ok
            -3> sys:trace(code_lock, true).
            +3> sys:trace(code_lock, true).
             ok
            -4> code_lock:button(1).
            -*DBG* code_lock receive cast {button,1} in state locked
            +4> code_lock:button(1).
            +*DBG* code_lock receive cast {button,1} in state locked
             ok
            -*DBG* code_lock consume cast {button,1} in state locked
            -5> code_lock:button(2).
            -*DBG* code_lock receive cast {button,2} in state locked
            +*DBG* code_lock consume cast {button,1} in state locked
            +5> code_lock:button(2).
            +*DBG* code_lock receive cast {button,2} in state locked
             ok
            -*DBG* code_lock consume cast {button,2} in state locked
            -6> code_lock:button(3).
            -*DBG* code_lock receive cast {button,3} in state locked
            +*DBG* code_lock consume cast {button,2} in state locked
            +6> code_lock:button(3).
            +*DBG* code_lock receive cast {button,3} in state locked
             ok
            -*DBG* code_lock consume cast {button,3} in state locked
            -7> code_lock:button(4).
            -*DBG* code_lock receive cast {button,4} in state locked
            +*DBG* code_lock consume cast {button,3} in state locked
            +7> code_lock:button(4).
            +*DBG* code_lock receive cast {button,4} in state locked
             ok
             Unlock
            -*DBG* code_lock consume cast {button,4} in state locked => open
            -*DBG* code_lock start_timer {state_timeout,10000,lock,[]} in state open
            +*DBG* code_lock consume cast {button,4} in state locked => open
            +*DBG* code_lock start_timer {state_timeout,10000,lock,[]} in state open
             *DBG* code_lock receive state_timeout lock in state open
             Lock
             *DBG* code_lock consume state_timeout lock in state open => locked
            -8> sys:statistics(code_lock, get).
            -{ok,[{start_time,{{2024,5,3},{8,11,1}}},
            -     {current_time,{{2024,5,3},{8,11,48}}},
            -     {reductions,4098},
            -     {messages_in,5},
            -     {messages_out,0}]}
            -9> sys:statistics(code_lock, false).
            +8> sys:statistics(code_lock, get).
            +{ok,[{start_time,{{2024,5,3},{8,11,1}}},
            +     {current_time,{{2024,5,3},{8,11,48}}},
            +     {reductions,4098},
            +     {messages_in,5},
            +     {messages_out,0}]}
            +9> sys:statistics(code_lock, false).
             ok
            -10> sys:trace(code_lock, false).
            +10> sys:trace(code_lock, false).
             ok
            -11> sys:get_status(code_lock).
            -{status,<0.90.0>,
            -        {module,gen_statem},
            -        [[{'$initial_call',{code_lock,init,1}},
            -          {'$ancestors',[<0.88.0>,<0.87.0>,<0.70.0>,<0.65.0>,<0.69.0>,
            -                         <0.64.0>,kernel_sup,<0.47.0>]}],
            -         running,<0.88.0>,[],
            -         [{header,"Status for state machine code_lock"},
            -          {data,[{"Status",running},
            -                 {"Parent",<0.88.0>},
            -                 {"Modules",[code_lock]},
            -                 {"Time-outs",{0,[]}},
            -                 {"Logged Events",[]},
            -                 {"Postponed",[]}]},
            -          {data,[{"State",
            -                  {locked,#{code => [1,2,3,4],
            -                            length => 4,buttons => []}}}]}]]}

            +11> sys:get_status(code_lock). +{status,<0.90.0>, + {module,gen_statem}, + [[{'$initial_call',{code_lock,init,1}}, + {'$ancestors',[<0.88.0>,<0.87.0>,<0.70.0>,<0.65.0>,<0.69.0>, + <0.64.0>,kernel_sup,<0.47.0>]}], + running,<0.88.0>,[], + [{header,"Status for state machine code_lock"}, + {data,[{"Status",running}, + {"Parent",<0.88.0>}, + {"Modules",[code_lock]}, + {"Time-outs",{0,[]}}, + {"Logged Events",[]}, + {"Postponed",[]}]}, + {data,[{"State", + {locked,#{code => [1,2,3,4], + length => 4,buttons => []}}}]}]]}

            @@ -107,109 +107,109 @@

            Here follows the simple server from Overview, -implemented using sys and proc_lib to fit into a supervision tree:

            -module(ch4).
            --export([start_link/0]).
            --export([alloc/0, free/1]).
            --export([init/1]).
            --export([system_continue/3, system_terminate/4,
            +implemented using sys and proc_lib to fit into a supervision tree:

            -module(ch4).
            +-export([start_link/0]).
            +-export([alloc/0, free/1]).
            +-export([init/1]).
            +-export([system_continue/3, system_terminate/4,
                      write_debug/3,
            -         system_get_state/1, system_replace_state/2]).
            +         system_get_state/1, system_replace_state/2]).
             
            -start_link() ->
            -    proc_lib:start_link(ch4, init, [self()]).
            +start_link() ->
            +    proc_lib:start_link(ch4, init, [self()]).
             
            -alloc() ->
            -    ch4 ! {self(), alloc},
            +alloc() ->
            +    ch4 ! {self(), alloc},
                 receive
            -        {ch4, Res} ->
            +        {ch4, Res} ->
                         Res
                 end.
             
            -free(Ch) ->
            -    ch4 ! {free, Ch},
            +free(Ch) ->
            +    ch4 ! {free, Ch},
                 ok.
             
            -init(Parent) ->
            -    register(ch4, self()),
            -    Chs = channels(),
            -    Deb = sys:debug_options([]),
            -    proc_lib:init_ack(Parent, {ok, self()}),
            -    loop(Chs, Parent, Deb).
            +init(Parent) ->
            +    register(ch4, self()),
            +    Chs = channels(),
            +    Deb = sys:debug_options([]),
            +    proc_lib:init_ack(Parent, {ok, self()}),
            +    loop(Chs, Parent, Deb).
             
            -loop(Chs, Parent, Deb) ->
            +loop(Chs, Parent, Deb) ->
                 receive
            -        {From, alloc} ->
            -            Deb2 = sys:handle_debug(Deb, fun ch4:write_debug/3,
            -                                    ch4, {in, alloc, From}),
            -            {Ch, Chs2} = alloc(Chs),
            -            From ! {ch4, Ch},
            -            Deb3 = sys:handle_debug(Deb2, fun ch4:write_debug/3,
            -                                    ch4, {out, {ch4, Ch}, From}),
            -            loop(Chs2, Parent, Deb3);
            -        {free, Ch} ->
            -            Deb2 = sys:handle_debug(Deb, fun ch4:write_debug/3,
            -                                    ch4, {in, {free, Ch}}),
            -            Chs2 = free(Ch, Chs),
            -            loop(Chs2, Parent, Deb2);
            -
            -        {system, From, Request} ->
            -            sys:handle_system_msg(Request, From, Parent,
            -                                  ch4, Deb, Chs)
            +        {From, alloc} ->
            +            Deb2 = sys:handle_debug(Deb, fun ch4:write_debug/3,
            +                                    ch4, {in, alloc, From}),
            +            {Ch, Chs2} = alloc(Chs),
            +            From ! {ch4, Ch},
            +            Deb3 = sys:handle_debug(Deb2, fun ch4:write_debug/3,
            +                                    ch4, {out, {ch4, Ch}, From}),
            +            loop(Chs2, Parent, Deb3);
            +        {free, Ch} ->
            +            Deb2 = sys:handle_debug(Deb, fun ch4:write_debug/3,
            +                                    ch4, {in, {free, Ch}}),
            +            Chs2 = free(Ch, Chs),
            +            loop(Chs2, Parent, Deb2);
            +
            +        {system, From, Request} ->
            +            sys:handle_system_msg(Request, From, Parent,
            +                                  ch4, Deb, Chs)
            /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/statem.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (1044))
            --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/statem.xhtml"	2026-06-04 00:09:02.000000000 +0000
            +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/statem.xhtml"	2042-07-06 13:28:26.000000000 +0000
            @@ -33,7 +33,7 @@
             a state transition and the output is actions executed during
             the state transition.  Analogously to the mathematical model
             of a Finite State Machine, it can be described as a set of relations
            -of the following form:

            State(S) x Event(E) -> Actions(A), State(S')

            These relations are interpreted as follows: if we are in state S, +of the following form:

            State(S) x Event(E) -> Actions(A), State(S')

            These relations are interpreted as follows: if we are in state S, and event E occurs, we are to perform actions A, and make a transition to state S'. Notice that S' can be equal to S, and that A can be empty.

            In gen_statem we define a state change as a state transition in which the @@ -314,12 +314,12 @@ mode, automatically call the state callback with special arguments whenever the state changes, so you can write state enter actions near the rest of the state transition rules. -It typically looks like this:

            StateName(enter, OldState, Data) ->
            +It typically looks like this:

            StateName(enter, OldState, Data) ->
                 ... code for state enter actions here ...
            -    {keep_state, NewData};
            -StateName(EventType, EventContent, Data) ->
            +    {keep_state, NewData};
            +StateName(EventType, EventContent, Data) ->
                 ... code for actions here ...
            -    {next_state, NewStateName, NewData}.

            Since the state enter call is not an event there are restrictions on the + {next_state, NewStateName, NewData}.

            Since the state enter call is not an event there are restrictions on the allowed return value and state transition actions. You must not change the state, postpone this non-event, insert any events, or change the @@ -408,55 +408,55 @@ open --> open : {button, Digit} open --> locked : state_timeout\n* do_lock()

            This code lock state machine can be implemented using gen_statem with -the following callback module:

            -module(code_lock).
            --behaviour(gen_statem).
            --define(NAME, code_lock).
            +the following callback module:

            -module(code_lock).
            +-behaviour(gen_statem).
            +-define(NAME, code_lock).
             
            --export([start_link/1]).
            --export([button/1]).
            --export([init/1,callback_mode/0,terminate/3]).
            --export([locked/3,open/3]).
            -
            -start_link(Code) ->
            -    gen_statem:start_link({local,?NAME}, ?MODULE, Code, []).
            -
            -button(Button) ->
            -    gen_statem:cast(?NAME, {button,Button}).
            -
            -init(Code) ->
            -    do_lock(),
            -    Data = #{code => Code, length => length(Code), buttons => []},
            -    {ok, locked, Data}.
            -
            -callback_mode() ->
            -    state_functions.
            locked(
            -  cast, {button,Button},
            -  #{code := Code, length := Length, buttons := Buttons} = Data) ->
            +-export([start_link/1]).
            +-export([button/1]).
            +-export([init/1,callback_mode/0,terminate/3]).
            +-export([locked/3,open/3]).
            +
            +start_link(Code) ->
            +    gen_statem:start_link({local,?NAME}, ?MODULE, Code, []).
            +
            +button(Button) ->
            +    gen_statem:cast(?NAME, {button,Button}).
            +
            +init(Code) ->
            +    do_lock(),
            +    Data = #{code => Code, length => length(Code), buttons => []},
            +    {ok, locked, Data}.
            +
            +callback_mode() ->
            +    state_functions.
            locked(
            +  cast, {button,Button},
            +  #{code := Code, length := Length, buttons := Buttons} = Data) ->
                 NewButtons =
                     if
            -            length(Buttons) < Length ->
            +            length(Buttons) < Length ->
                             Buttons;
                         true ->
            -                tl(Buttons)
            -        end ++ [Button],
            +                tl(Buttons)
            +        end ++ [Button],
                 if
                     NewButtons =:= Code -> % Correct
            -	    do_unlock(),
            -            {next_state, open, Data#{buttons := []},
            -             [{state_timeout,10_000,lock}]}; % Time in milliseconds
            +	    do_unlock(),
            +            {next_state, open, Data#{buttons := []},
            +             [{state_timeout,10_000,lock}]}; % Time in milliseconds
             	true -> % Incomplete | Incorrect
            -            {next_state, locked, Data#{buttons := NewButtons}}
            -    end.
            open(state_timeout, lock,  Data) ->
            -    do_lock(),
            -    {next_state, locked, Data};
            -open(cast, {button,_}, Data) ->
            -    {next_state, open, Data}.
            do_lock() ->
            -    io:format("Lock~n", []).
            -do_unlock() ->
            -    io:format("Unlock~n", []).
            +            {next_state, locked, Data#{buttons := NewButtons}}
            +    end.
            open(state_timeout, lock,  Data) ->
            +    do_lock(),
            +    {next_state, locked, Data};
            +open(cast, {button,_}, Data) ->
            +    {next_state, open, Data}.
            do_lock() ->
            +    io:format("Lock~n", []).
            +do_unlock() ->
            +    io:format("Unlock~n", []).
             
            -terminate(_Reason, State, _Data) ->
            -    State =/= locked andalso do_lock(),
            +terminate(_Reason, State, _Data) ->
            +    State =/= locked andalso do_lock(),
                 ok.

            The code is explained in the next sections.

            @@ -464,8 +464,8 @@ Starting gen_statem

            In the example in the previous section, gen_statem is started by calling -code_lock:start_link(Code):

            start_link(Code) ->
            -    gen_statem:start_link({local,?NAME}, ?MODULE, Code, []).

            start_link/1 calls function gen_statem:start_link/4, +code_lock:start_link(Code):

            start_link(Code) ->
            +    gen_statem:start_link({local,?NAME}, ?MODULE, Code, []).

            start_link/1 calls function gen_statem:start_link/4, which spawns and links to a new process, a gen_statem.

            • The first argument, {local,?NAME}, specifies the name. In this case, the gen_statem is locally registered as code_lock through the macro ?NAME.

              If the name is omitted, the gen_statem is not registered. Instead its pid must be used. The name can also be specified as {global, Name}, then the @@ -483,10 +483,10 @@ Data is the internal server data of the gen_statem. Here the server data is a map() with key code that stores the correct button sequence, key length store its length, and key buttons -that stores the collected buttons up to the same length.

              init(Code) ->
              -    do_lock(),
              -    Data = #{code => Code, length => length(Code), buttons => []},
              -    {ok, locked, Data}.

              Function gen_statem:start_link/3,4 +that stores the collected buttons up to the same length.

              init(Code) ->
              +    do_lock(),
              +    Data = #{code => Code, length => length(Code), buttons => []},
              +    {ok, locked, Data}.

              Function gen_statem:start_link/3,4 is synchronous. It does not return until the gen_statem is initialized and is ready to receive events.

              Function gen_statem:start_link/3,4 must be used if the gen_statem is part of a supervision tree, that is, @@ -495,7 +495,7 @@ a standalone gen_statem, meaning it is not part of a supervision tree.

              Function Module:callback_mode/0 selects the CallbackMode for the callback module, in this case state_functions. -That is, each state has its own handler function:

              callback_mode() ->
              +That is, each state has its own handler function:

              callback_mode() ->
                   state_functions.

              @@ -503,8 +503,8 @@ Handling Events

              The function notifying the code lock about a button event is implemented using -gen_statem:cast/2:

              button(Button) ->
              -    gen_statem:cast(?NAME, {button,Button}).

              The first argument is the name of the gen_statem and must agree with +gen_statem:cast/2:

              button(Button) ->
              +    gen_statem:cast(?NAME, {button,Button}).

              The first argument is the name of the gen_statem and must agree with the name used to start it. So, we use the same macro ?NAME as when starting. {button, Button} is the event content.

              The event is sent to the gen_statem. When the event is received, the gen_statem calls StateName(cast, Event, Data), which is expected @@ -512,30 +512,30 @@ {next_state, NewStateName, NewData, Actions}. StateName is the name of the current state and NewStateName is the name of the next state. NewData is a new value for the server data of the gen_statem, -and Actions is a list of actions to be performed by the gen_statem engine.

              locked(
              -  cast, {button,Button},
              -  #{code := Code, length := Length, buttons := Buttons} = Data) ->
              +and Actions is a list of actions to be performed by the gen_statem engine.

              locked(
              +  cast, {button,Button},
              +  #{code := Code, length := Length, buttons := Buttons} = Data) ->
                   NewButtons =
                       if
              -            length(Buttons) < Length ->
              +            length(Buttons) < Length ->
                               Buttons;
                           true ->
              -                tl(Buttons)
              -        end ++ [Button],
              +                tl(Buttons)
              +        end ++ [Button],
                   if
                       NewButtons =:= Code -> % Correct
              -	    do_unlock(),
              -            {next_state, open, Data#{buttons := []},
              -             [{state_timeout,10_000,lock}]}; % Time in milliseconds
              +	    do_unlock(),
              +            {next_state, open, Data#{buttons := []},
              +             [{state_timeout,10_000,lock}]}; % Time in milliseconds
               	true -> % Incomplete | Incorrect
              -            {next_state, locked, Data#{buttons := NewButtons}}
              /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/sup_princ.xhtml differs (HTML document, ASCII text, with very long lines (1319))
              --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/sup_princ.xhtml"	2026-06-04 00:09:02.000000000 +0000
              +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/sup_princ.xhtml"	2042-07-06 13:28:26.000000000 +0000
              @@ -37,24 +37,24 @@
                 Example
               

            The callback module for a supervisor starting the server from -gen_server Behaviour can look as follows:

            -module(ch_sup).
            --behaviour(supervisor).
            +gen_server Behaviour can look as follows:

            -module(ch_sup).
            +-behaviour(supervisor).
             
            --export([start_link/0]).
            --export([init/1]).
            +-export([start_link/0]).
            +-export([init/1]).
             
            -start_link() ->
            -    supervisor:start_link(ch_sup, []).
            +start_link() ->
            +    supervisor:start_link(ch_sup, []).
             
            -init(_Args) ->
            -    SupFlags = #{strategy => one_for_one, intensity => 1, period => 5},
            -    ChildSpecs = [#{id => ch3,
            -                    start => {ch3, start_link, []},
            +init(_Args) ->
            +    SupFlags = #{strategy => one_for_one, intensity => 1, period => 5},
            +    ChildSpecs = [#{id => ch3,
            +                    start => {ch3, start_link, []},
                                 restart => permanent,
                                 shutdown => brutal_kill,
                                 type => worker,
            -                    modules => [ch3]}],
            -    {ok, {SupFlags, ChildSpecs}}.

            The SupFlags variable in the return value from init/1 represents the + modules => [ch3]}], + {ok, {SupFlags, ChildSpecs}}.

            The SupFlags variable in the return value from init/1 represents the supervisor flags.

            The ChildSpecs variable in the return value from init/1 is a list of child specifications.

            @@ -62,15 +62,15 @@ Supervisor Flags

            -

            This is the type definition for the supervisor flags:

            sup_flags() = #{strategy => strategy(),           % optional
            -                intensity => non_neg_integer(),   % optional
            -                period => pos_integer(),          % optional
            -                auto_shutdown => auto_shutdown()} % optional
            -    strategy() = one_for_all
            +

            This is the type definition for the supervisor flags:

            sup_flags() = #{strategy => strategy(),           % optional
            +                intensity => non_neg_integer(),   % optional
            +                period => pos_integer(),          % optional
            +                auto_shutdown => auto_shutdown()} % optional
            +    strategy() = one_for_all
                            | one_for_one
                            | rest_for_one
                            | simple_one_for_one
            -    auto_shutdown() = never
            +    auto_shutdown() = never
                                 | any_significant
                                 | all_significant

            -

            The type definition for a child specification is as follows:

            child_spec() = #{id => child_id(),             % mandatory
            -                 start => mfargs(),            % mandatory
            -                 restart => restart(),         % optional
            -                 significant => significant(), % optional
            -                 shutdown => shutdown(),       % optional
            -                 type => worker(),             % optional
            -                 modules => modules()}         % optional
            -    child_id() = term()
            -    mfargs() = {M :: module(), F :: atom(), A :: [term()]}
            -    modules() = [module()] | dynamic
            -    restart() = permanent | transient | temporary
            -    significant() = boolean()
            -    shutdown() = brutal_kill | timeout()
            -    worker() = worker | supervisor
            • id is used to identify the child specification internally by the supervisor.

              The id key is mandatory.

              Note that this identifier occasionally has been called "name". As far as +

              The type definition for a child specification is as follows:

              child_spec() = #{id => child_id(),             % mandatory
              +                 start => mfargs(),            % mandatory
              +                 restart => restart(),         % optional
              +                 significant => significant(), % optional
              +                 shutdown => shutdown(),       % optional
              +                 type => worker(),             % optional
              +                 modules => modules()}         % optional
              +    child_id() = term()
              +    mfargs() = {M :: module(), F :: atom(), A :: [term()]}
              +    modules() = [module()] | dynamic
              +    restart() = permanent | transient | temporary
              +    significant() = boolean()
              +    shutdown() = brutal_kill | timeout()
              +    worker() = worker | supervisor
              • id is used to identify the child specification internally by the supervisor.

                The id key is mandatory.

                Note that this identifier occasionally has been called "name". As far as possible, the terms "identifier" or "id" are now used but in order to keep backwards compatibility, some occurrences of "name" can still be found, for example in error messages.

              • start defines the function call used to start the child process. It is a @@ -366,32 +366,32 @@ name of the callback module.

              This information is used by the release handler during upgrades and downgrades; see Release Handling.

              The modules key is optional. If it is not given, it defaults to [M], where M comes from the child's start {M,F,A}.

            Example: The child specification to start the server ch3 in the previous -example look as follows:

            #{id => ch3,
            -  start => {ch3, start_link, []},
            +example look as follows:

            #{id => ch3,
            +  start => {ch3, start_link, []},
               restart => permanent,
               shutdown => brutal_kill,
               type => worker,
            -  modules => [ch3]}

            or simplified, relying on the default values:

            #{id => ch3,
            +  modules => [ch3]}

            or simplified, relying on the default values:

            #{id => ch3,
               start => {ch3, start_link, []},
               shutdown => brutal_kill}

            Example: A child specification to start the event manager from the chapter about -gen_event:

            #{id => error_man,
            -  start => {gen_event, start_link, [{local, error_man}]},
            -  modules => dynamic}

            Both server and event manager are registered processes which can be expected to +gen_event:

            #{id => error_man,
            +  start => {gen_event, start_link, [{local, error_man}]},
            +  modules => dynamic}

            Both server and event manager are registered processes which can be expected to be always accessible. Thus they are specified to be permanent.

            ch3 does not need to do any cleaning up before termination. Thus, no shutdown time is needed, but brutal_kill is sufficient. error_man can need some time for the event handlers to clean up, thus the shutdown time is set to 5000 ms -(which is the default value).

            Example: A child specification to start another supervisor:

            #{id => sup,
            -  start => {sup, start_link, []},
            +(which is the default value).

            Example: A child specification to start another supervisor:

            #{id => sup,
            +  start => {sup, start_link, []},
               restart => transient,
            -  type => supervisor} % will cause default shutdown=>infinity

            + type => supervisor} % will cause default shutdown=>infinity

            Starting a Supervisor

            In the previous example, the supervisor is started by calling -ch_sup:start_link():

            start_link() ->
            -    supervisor:start_link(ch_sup, []).

            ch_sup:start_link calls function supervisor:start_link/2, which spawns and +ch_sup:start_link():

            start_link() ->
            +    supervisor:start_link(ch_sup, []).

            ch_sup:start_link calls function supervisor:start_link/2, which spawns and links to a new process, a supervisor.

            • The first argument, ch_sup, is the name of the callback module, that is, the module where the init callback function is located.
            • The second argument, [], is a term that is passed as is to the callback function init. Here, init does not need any data and ignores the argument.

            In this case, the supervisor is not registered. Instead its pid must be used. A @@ -399,12 +399,12 @@ supervisor:start_link({local, Name}, Module, Args) or supervisor:start_link({global, Name}, Module, Args).

            The new supervisor process calls the callback function ch_sup:init([]). init -has to return {ok, {SupFlags, ChildSpecs}}:

            init(_Args) ->
            -    SupFlags = #{},
            -    ChildSpecs = [#{id => ch3,
            -                    start => {ch3, start_link, []},
            -                    shutdown => brutal_kill}],
            -    {ok, {SupFlags, ChildSpecs}}.

            Subsequently, the supervisor starts its child processes according to the child +has to return {ok, {SupFlags, ChildSpecs}}:

            init(_Args) ->
            +    SupFlags = #{},
            +    ChildSpecs = [#{id => ch3,
            +                    start => {ch3, start_link, []},
            +                    shutdown => brutal_kill}],
            +    {ok, {SupFlags, ChildSpecs}}.

            Subsequently, the supervisor starts its child processes according to the child specifications in the start specification. In this case there is a single child process, called ch3.

            supervisor:start_link/3 is synchronous. It does not return until all child processes have been started.

            @@ -441,23 +441,23 @@

            A supervisor with restart strategy simple_one_for_one is a simplified one_for_one supervisor, where all child processes are dynamically added instances of the same process.

            The following is an example of a callback module for a simple_one_for_one -supervisor:

            -module(simple_sup).
            --behaviour(supervisor).
            +supervisor:

            -module(simple_sup).
            +-behaviour(supervisor).
             
            --export([start_link/0]).
            --export([init/1]).
            +-export([start_link/0]).
            +-export([init/1]).
             
            -start_link() ->
            -    supervisor:start_link(simple_sup, []).
            +start_link() ->
            +    supervisor:start_link(simple_sup, []).
             
            -init(_Args) ->
            -    SupFlags = #{strategy => simple_one_for_one,
            +init(_Args) ->
            +    SupFlags = #{strategy => simple_one_for_one,
                              intensity => 0,
            -                 period => 1},
            -    ChildSpecs = [#{id => call,
            -                    start => {call, start_link, []},
            -                    shutdown => brutal_kill}],
            -    {ok, {SupFlags, ChildSpecs}}.

            When started, the supervisor does not start any child + period => 1}, + ChildSpecs = [#{id => call, + start => {call, start_link, []}, + shutdown => brutal_kill}], + {ok, {SupFlags, ChildSpecs}}.

            When started, the supervisor does not start any child processes. Instead, all child processes need to be added dynamically by calling supervisor:start_child(Sup, List).

            Sup is the pid, or name, of the supervisor. List is an arbitrary list of terms, which are added to the list of arguments specified in the child /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/tablesdatabases.xhtml differs (HTML document, ASCII text, with very long lines (1432)) --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/tablesdatabases.xhtml" 2026-06-04 00:09:02.000000000 +0000 +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/tablesdatabases.xhtml" 2042-07-06 13:28:26.000000000 +0000 @@ -55,11 +55,11 @@

            The delete operation is considered successful if the element was not present in the table. Hence all attempts to check that the element is present in the Ets/Mnesia table before deletion are unnecessary. Here follows an example for -Ets tables:

            DO

            ets:delete(Tab, Key),

            DO NOT

            case ets:lookup(Tab, Key) of
            -    [] ->
            +Ets tables:

            DO

            ets:delete(Tab, Key),

            DO NOT

            case ets:lookup(Tab, Key) of
            +    [] ->
                     ok;
            -    [_|_] ->
            -        ets:delete(Tab, Key)
            +    [_|_] ->
            +        ets:delete(Tab, Key)
             end,

            @@ -71,49 +71,49 @@ functions print_name/1, print_age/1, and print_occupation/1.

            Note

            If the function print_name/1, and so on, had been interface functions, the situation would have been different, as you do not want the user of the interface to know about the internal data representation.

            DO

            %%% Interface function
            -print_person(PersonId) ->
            +print_person(PersonId) ->
                 %% Look up the person in the named table person,
            -    case ets:lookup(person, PersonId) of
            -        [Person] ->
            -            print_name(Person),
            -            print_age(Person),
            -            print_occupation(Person);
            -        [] ->
            -            io:format("No person with ID = ~p~n", [PersonID])
            +    case ets:lookup(person, PersonId) of
            +        [Person] ->
            +            print_name(Person),
            +            print_age(Person),
            +            print_occupation(Person);
            +        [] ->
            +            io:format("No person with ID = ~p~n", [PersonID])
                 end.
             
             %%% Internal functions
            -print_name(Person) ->
            -    io:format("No person ~p~n", [Person#person.name]).
            +print_name(Person) ->
            +    io:format("No person ~p~n", [Person#person.name]).
             
            -print_age(Person) ->
            -    io:format("No person ~p~n", [Person#person.age]).
            +print_age(Person) ->
            +    io:format("No person ~p~n", [Person#person.age]).
             
            -print_occupation(Person) ->
            -    io:format("No person ~p~n", [Person#person.occupation]).

            DO NOT

            %%% Interface function
            -print_person(PersonId) ->
            +print_occupation(Person) ->
            +    io:format("No person ~p~n", [Person#person.occupation]).

            DO NOT

            %%% Interface function
            +print_person(PersonId) ->
                 %% Look up the person in the named table person,
            -    case ets:lookup(person, PersonId) of
            -        [Person] ->
            -            print_name(PersonID),
            -            print_age(PersonID),
            -            print_occupation(PersonID);
            -        [] ->
            -            io:format("No person with ID = ~p~n", [PersonID])
            +    case ets:lookup(person, PersonId) of
            +        [Person] ->
            +            print_name(PersonID),
            +            print_age(PersonID),
            +            print_occupation(PersonID);
            +        [] ->
            +            io:format("No person with ID = ~p~n", [PersonID])
                 end.
             
             %%% Internal functions
            -print_name(PersonID) ->
            -    [Person] = ets:lookup(person, PersonId),
            -    io:format("No person ~p~n", [Person#person.name]).
            -
            -print_age(PersonID) ->
            -    [Person] = ets:lookup(person, PersonId),
            -    io:format("No person ~p~n", [Person#person.age]).
            -
            -print_occupation(PersonID) ->
            -    [Person] = ets:lookup(person, PersonId),
            -    io:format("No person ~p~n", [Person#person.occupation]).

            +print_name(PersonID) -> + [Person] = ets:lookup(person, PersonId), + io:format("No person ~p~n", [Person#person.name]). + +print_age(PersonID) -> + [Person] = ets:lookup(person, PersonId), + io:format("No person ~p~n", [Person#person.age]). + +print_occupation(PersonID) -> + [Person] = ets:lookup(person, PersonId), + io:format("No person ~p~n", [Person#person.occupation]).

            @@ -135,30 +135,30 @@ #person{idno = 4, name = "Carl", age = 25, occupation = "mailman"}]

            If you must return all data stored in the Ets table, you can use ets:tab2list/1. However, usually you are only interested in a subset of the information in which case ets:tab2list/1 is expensive. If you only want to -extract one field from each record, for example, the age of every person, then:

            DO

            ets:select(Tab, [{#person{idno='_',
            +extract one field from each record, for example, the age of every person, then:

            DO

            ets:select(Tab, [{#person{idno='_',
                                       name='_',
                                       age='$1',
            -                          occupation = '_'},
            -                [],
            -                ['$1']}]),

            DO NOT

            TabList = ets:tab2list(Tab),
            -lists:map(fun(X) -> X#person.age end, TabList),

            If you are only interested in the age of all persons named "Bryan", then:

            DO

            ets:select(Tab, [{#person{idno='_',
            +                          occupation = '_'},
            +                [],
            +                ['$1']}]),

            DO NOT

            TabList = ets:tab2list(Tab),
            +lists:map(fun(X) -> X#person.age end, TabList),

            If you are only interested in the age of all persons named "Bryan", then:

            DO

            ets:select(Tab, [{#person{idno='_',
                                       name="Bryan",
                                       age='$1',
            -                          occupation = '_'},
            -                [],
            -                ['$1']}])

            DO NOT

            TabList = ets:tab2list(Tab),
            -lists:foldl(fun(X, Acc) -> case X#person.name of
            +                          occupation = '_'},
            +                [],
            +                ['$1']}])

            DO NOT

            TabList = ets:tab2list(Tab),
            +lists:foldl(fun(X, Acc) -> case X#person.name of
                                             "Bryan" ->
            -                                    [X#person.age|Acc];
            +                                    [X#person.age|Acc];
                                              _ ->
                                                  Acc
                                        end
            -             end, [], TabList)

            If you need all information stored in the Ets table about persons named "Bryan", -then:

            DO

            ets:select(Tab, [{#person{idno='_',
            +             end, [], TabList)

            If you need all information stored in the Ets table about persons named "Bryan", +then:

            DO

            ets:select(Tab, [{#person{idno='_',
                                       name="Bryan",
                                       age='_',
            -                          occupation = '_'}, [], ['$_']}]),

            DO NOT

            TabList = ets:tab2list(Tab),
            -lists:filter(fun(X) -> X#person.name == "Bryan" end, TabList),

            + occupation = '_'}, [], ['$_']}]),

            DO NOT

            TabList = ets:tab2list(Tab),
            +lists:filter(fun(X) -> X#person.name == "Bryan" end, TabList),

            @@ -202,12 +202,12 @@ #index_entry{name="Bryan", idno=2}, #index_entry{name="Bryan", idno=3}, #index_entry{name="Carl", idno=4}]

            Given this index table, a lookup of the age fields for all persons named -"Bryan" can be done as follows:

            MatchingIDs = ets:lookup(IndexTable,"Bryan"),
            -lists:map(fun(#index_entry{idno = ID}) ->
            -                 [#person{age = Age}] = ets:lookup(PersonTable, ID),
            +"Bryan" can be done as follows:

            MatchingIDs = ets:lookup(IndexTable,"Bryan"),
            +lists:map(fun(#index_entry{idno = ID}) ->
            +                 [#person{age = Age}] = ets:lookup(PersonTable, ID),
                              Age
                       end,
            -          MatchingIDs),

            Notice that this code does not use ets:match/2, but instead uses the + MatchingIDs),

            Notice that this code does not use ets:match/2, but instead uses the ets:lookup/2 call. The lists:map/2 call is only used to traverse the idnos matching the name "Bryan" in the table; thus the number of lookups in the master table is minimized.

            Keeping an index table introduces some overhead when inserting records in the @@ -230,17 +230,17 @@ mnesia:match_object() as these function traverse the whole table. Instead, you can create a secondary index and use mnesia:index_read/3 to get faster access at the expense of using more -memory.

            Example:

            -record(person, {idno, name, age, occupation}).
            +memory.

            Example:

            -record(person, {idno, name, age, occupation}).
                     ...
            -{atomic, ok} =
            -mnesia:create_table(person, [{index,[#person.age]},
            -                              {attributes,
            -                                    record_info(fields, person)}]),
            -{atomic, ok} = mnesia:add_table_index(person, age),
            +{atomic, ok} =
            +mnesia:create_table(person, [{index,[#person.age]},
            +                              {attributes,
            +                                    record_info(fields, person)}]),
            +{atomic, ok} = mnesia:add_table_index(person, age),
             ...
             
             PersonsAge42 =
            -     mnesia:dirty_index_read(person, 42, #person.age),

            + mnesia:dirty_index_read(person, 42, #person.age),

            @@ -254,19 +254,19 @@ the table. Other processes must send update requests to that process.

            Example:

            ...
             %% Using transaction
             
            -Fun = fun() ->
            -          [mnesia:read({Table, Key}),
            -           mnesia:read({Table2, Key2})]
            +Fun = fun() ->
            +          [mnesia:read({Table, Key}),
            +           mnesia:read({Table2, Key2})]
                   end,
             
            /usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/typespec.xhtml differs (HTML document, ASCII text, with very long lines (7202))
            --- "old//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/typespec.xhtml"	2026-06-04 00:09:02.000000000 +0000
            +++ "new//usr/share/doc/packages/erlang27-doc/doc/system/Erlang System Documentation.epub/OEBPS/typespec.xhtml"	2042-07-06 13:28:26.000000000 +0000
            @@ -146,11 +146,11 @@
             predefined aliases for the type unions also shown in the table.

            Built-in typeDefined as
            term/0any/0
            binary/0<<_:_*8>>
            nonempty_binary/0<<_:8, _:_*8>>
            bitstring/0<<_:_*1>>
            nonempty_bitstring/0<<_:1, _:_*1>>
            boolean/0'false' | 'true'
            byte/00..255
            char/00..16#10ffff
            nil/0[]
            number/0integer/0 | float/0
            list/0[any()]
            maybe_improper_list/0maybe_improper_list(any(), any())
            nonempty_list/0nonempty_list(any())
            string/0[char()]
            nonempty_string/0[char(),...]
            iodata/0iolist() | binary()
            iolist/0maybe_improper_list(byte() | binary() | iolist(), binary() | [])
            map/0#{any() => any()}
            function/0fun()
            module/0atom/0
            mfa/0{module(),atom(),arity()}
            arity/00..255
            identifier/0pid() | port() | reference()
            node/0atom/0
            timeout/0'infinity' | non_neg_integer()
            no_return/0none/0

            Table: Built-in types, predefined aliases

            In addition, the following three built-in types exist and can be thought as defined below, though strictly their "type definition" is not valid syntax according to the type language defined above.

            Built-in typeCan be thought defined by the syntax
            non_neg_integer/00..
            pos_integer/01..
            neg_integer/0..-1

            Table: Additional built-in types

            Note

            The following built-in list types also exist, but they are expected to be -rarely used. Hence, they have long names:

            nonempty_maybe_improper_list() :: nonempty_maybe_improper_list(any(), any())
            -nonempty_improper_list(Type1, Type2)
            -nonempty_maybe_improper_list(Type1, Type2)

            where the last two types define the set of Erlang terms one would expect.

            Also for convenience, record notation is allowed to be used. Records are -shorthands for the corresponding tuples:

            Record :: #Erlang_Atom{}
            -        | #Erlang_Atom{Fields}

            Records are extended to possibly contain type information. This is described in +rarely used. Hence, they have long names:

            nonempty_maybe_improper_list() :: nonempty_maybe_improper_list(any(), any())
            +nonempty_improper_list(Type1, Type2)
            +nonempty_maybe_improper_list(Type1, Type2)

            where the last two types define the set of Erlang terms one would expect.

            Also for convenience, record notation is allowed to be used. Records are +shorthands for the corresponding tuples:

            Record :: #Erlang_Atom{}
            +        | #Erlang_Atom{Fields}

            Records are extended to possibly contain type information. This is described in Type Information in Record Declarations.

            @@ -161,8 +161,8 @@ name as a built-in type.

            It is recommended to avoid deliberately reusing built-in names because it can be confusing. However, when an Erlang/OTP release introduces a new type, code that happened to define its own type having the same name will continue to work.

            As an example, imagine that the Erlang/OTP 42 release introduces a new type -gadget() defined like this:

            -type gadget() :: {'gadget', reference()}.

            Further imagine that some code has its own (different) definition of gadget(), -for example:

            -type gadget() :: #{}.

            Since redefinitions are allowed, the code will still compile (but with a +gadget() defined like this:

            -type gadget() :: {'gadget', reference()}.

            Further imagine that some code has its own (different) definition of gadget(), +for example:

            -type gadget() :: #{}.

            Since redefinitions are allowed, the code will still compile (but with a warning), and Dialyzer will not emit any additional warnings.

            @@ -171,8 +171,8 @@

            As seen, the basic syntax of a type is an atom followed by closed parentheses. New types are declared using -type and -opaque attributes as in the -following:

            -type my_struct_type() :: Type.
            --opaque my_opaq_type() :: Type.

            The type name is the atom my_struct_type, followed by parentheses. Type is a +following:

            -type my_struct_type() :: Type.
            +-opaque my_opaq_type() :: Type.

            The type name is the atom my_struct_type, followed by parentheses. Type is a type as defined in the previous section. A current restriction is that Type can contain only predefined types, or user-defined types which are either of the following:

            • Module-local type, that is, with a definition that is present in the code of @@ -182,10 +182,10 @@ similar restriction currently exists for records.)

              Type declarations can also be parameterized by including type variables between the parentheses. The syntax of type variables is the same as Erlang variables, that is, starts with an upper-case letter. These variables is to -appear on the RHS of the definition. A concrete example follows:

              -type orddict(Key, Val) :: [{Key, Val}].

              A module can export some types to declare that other modules are allowed to -refer to them as remote types. This declaration has the following form:

              -export_type([T1/A1, ..., Tk/Ak]).

              Here the Tis are atoms (the name of the type) and the Ais are their arguments.

              Example:

              -export_type([my_struct_type/0, orddict/2]).

              Assuming that these types are exported from module 'mod', you can refer to -them from other modules using remote type expressions like the following:

              mod:my_struct_type()
              -mod:orddict(atom(), term())

              It is not allowed to refer to types that are not declared as exported.

              Types declared as opaque represent sets of terms whose structure is not +appear on the RHS of the definition. A concrete example follows:

              -type orddict(Key, Val) :: [{Key, Val}].

              A module can export some types to declare that other modules are allowed to +refer to them as remote types. This declaration has the following form:

              -export_type([T1/A1, ..., Tk/Ak]).

              Here the Tis are atoms (the name of the type) and the Ais are their arguments.

              Example:

              -export_type([my_struct_type/0, orddict/2]).

              Assuming that these types are exported from module 'mod', you can refer to +them from other modules using remote type expressions like the following:

              mod:my_struct_type()
              +mod:orddict(atom(), term())

              It is not allowed to refer to types that are not declared as exported.

              Types declared as opaque represent sets of terms whose structure is not supposed to be visible from outside of their defining module. That is, only the module defining them is allowed to depend on their term structure. Consequently, such types do not make much sense as module local - module local types are not @@ -196,33 +196,33 @@ Type Information in Record Declarations

            The types of record fields can be specified in the declaration of the record. -The syntax for this is as follows:

            -record(rec, {field1 :: Type1, field2, field3 :: Type3}).

            For fields without type annotations, their type defaults to any(). That is, the -previous example is a shorthand for the following:

            -record(rec, {field1 :: Type1, field2 :: any(), field3 :: Type3}).

            In the presence of initial values for fields, the type must be declared after -the initialization, as follows:

            -record(rec, {field1 = [] :: Type1, field2, field3 = 42 :: Type3}).

            The initial values for fields are to be compatible with (that is, a member of) +The syntax for this is as follows:

            -record(rec, {field1 :: Type1, field2, field3 :: Type3}).

            For fields without type annotations, their type defaults to any(). That is, the +previous example is a shorthand for the following:

            -record(rec, {field1 :: Type1, field2 :: any(), field3 :: Type3}).

            In the presence of initial values for fields, the type must be declared after +the initialization, as follows:

            -record(rec, {field1 = [] :: Type1, field2, field3 = 42 :: Type3}).

            The initial values for fields are to be compatible with (that is, a member of) the corresponding types. This is checked by the compiler and results in a compilation error if a violation is detected.

            Change

            Before Erlang/OTP 19, for fields without initial values, the singleton type 'undefined' was added to all declared types. In other words, the following -two record declarations had identical effects:

            -record(rec, {f1 = 42 :: integer(),
            -             f2      :: float(),
            -             f3      :: 'a' | 'b'}).
            +two record declarations had identical effects:

            -record(rec, {f1 = 42 :: integer(),
            +             f2      :: float(),
            +             f3      :: 'a' | 'b'}).
             
            --record(rec, {f1 = 42 :: integer(),
            -              f2      :: 'undefined' | float(),
            -              f3      :: 'undefined' | 'a' | 'b'}).

            This is no longer the case. If you require 'undefined' in your record field +-record(rec, {f1 = 42 :: integer(), + f2 :: 'undefined' | float(), + f3 :: 'undefined' | 'a' | 'b'}).

            This is no longer the case. If you require 'undefined' in your record field type, you must explicitly add it to the typespec, as in the 2nd example.

            Any record, containing type information or not, once defined, can be used as a type using the following syntax:

            #rec{}

            In addition, the record fields can be further specified when using a record type by adding type information about the field as follows:

            #rec{some_field :: Type}

            Any unspecified fields are assumed to have the type in the original record declaration.

            Note

            When records are used to create patterns for ETS and Mnesia match functions, -Dialyzer may need some help not to emit bad warnings. For example:

            -type height() :: pos_integer().
            --record(person, {name :: string(), height :: height()}).
            +Dialyzer may need some help not to emit bad warnings. For example:

            -type height() :: pos_integer().
            +-record(person, {name :: string(), height :: height()}).
             
            -lookup(Name, Tab) ->
            -    ets:match_object(Tab, #person{name = Name, _ = '_'}).

            Dialyzer will emit a warning since '_' is not in the type of record field +lookup(Name, Tab) -> + ets:match_object(Tab, #person{name = Name, _ = '_'}).

            Dialyzer will emit a warning since '_' is not in the type of record field height.

            The recommended way of dealing with this is to declare the smallest record field types to accommodate all your needs, and then create refinements as -needed. The modified example:

            -record(person, {name :: string(), height :: height() | '_'}).
            +needed. The modified example:

            -record(person, {name :: string(), height :: height() | '_'}).
             
            --type person() :: #person{height :: height()}.

            In specifications and type declarations the type person() is to be preferred +-type person() :: #person{height :: height()}.

            In specifications and type declarations the type person() is to be preferred before #person{}.

            @@ -235,27 +235,27 @@ arguments, otherwise the compilation fails.

            The following longer format with module name is also valid as long as Module is the name of the current module. This can be useful for documentation purposes.

            -spec Module:Function(ArgType1, ..., ArgTypeN) -> ReturnType.

            Also, for documentation purposes, argument names can be given:

            -spec Function(ArgName1 :: Type1, ..., ArgNameN :: TypeN) -> RT.

            A function specification can be overloaded. That is, it can have several types, -separated by a semicolon (;). For example:

            -spec foo(T1, T2) -> T3;
            -         (T4, T5) -> T6.

            A current restriction, which currently results in a warning by Dialyzer, is that +separated by a semicolon (;). For example:

            -spec foo(T1, T2) -> T3;
            +         (T4, T5) -> T6.

            A current restriction, which currently results in a warning by Dialyzer, is that the domains of the argument types cannot overlap. For example, the following -specification results in a warning:

            -spec foo(pos_integer()) -> pos_integer();
            -         (integer()) -> integer().

            Type variables can be used in specifications to specify relations for the input +specification results in a warning:

            -spec foo(pos_integer()) -> pos_integer();
            +         (integer()) -> integer().

            Type variables can be used in specifications to specify relations for the input and output arguments of a function. For example, the following specification defines the type of a polymorphic identity function:

            -spec id(X) -> X.

            Notice that the above specification does not restrict the input and output type in any way. These types can be constrained by guard-like subtype constraints and -provide bounded quantification:

            -spec id(X) -> X when X :: tuple().

            Currently, the :: constraint (read as "is a subtype of") is the only guard +provide bounded quantification:

            -spec id(X) -> X when X :: tuple().

            Currently, the :: constraint (read as "is a subtype of") is the only guard constraint that can be used in the when part of a -spec attribute.

            Note

            The above function specification uses multiple occurrences of the same type variable. That provides more type information than the following function -specification, where the type variables are missing:

            -spec id(tuple()) -> tuple().

            The latter specification says that the function takes some tuple and returns +specification, where the type variables are missing:

            -spec id(tuple()) -> tuple().

            The latter specification says that the function takes some tuple and returns some tuple. The specification with the X type variable specifies that the function takes a tuple and returns the same tuple.

            However, it is up to the tools that process the specifications to choose whether to take this extra information into account or not.

            The scope of a :: constraint is the (...) -> RetType specification after which it appears. To avoid confusion, it is suggested that different variables are used in different constituents of an overloaded contract, as shown in the -following example:

            -spec foo({X, integer()}) -> X when X :: atom();
            -         ([Y]) -> Y when Y :: number().

            Some functions in Erlang are not meant to return; either because they define +following example:

            -spec foo({X, integer()}) -> X when X :: atom();
            +         ([Y]) -> Y when Y :: number().

            Some functions in Erlang are not meant to return; either because they define servers or because they are used to throw exceptions, as in the following -function:

            my_error(Err) -> throw({error, Err}).

            For such functions, it is recommended to use the special no_return/0 type +function:

            my_error(Err) -> throw({error, Err}).

            For such functions, it is recommended to use the special no_return/0 type for their "return", through a contract of the following form:

            -spec my_error(term()) -> no_return().

            Note

            Erlang uses the shorthand version _ as an anonymous type variable equivalent to term/0 or any/0. For example, the following function

            -spec Function(string(), _) -> string().

            is equivalent to:

            -spec Function(string(), any()) -> string().
            /usr/share/doc/packages/erlang27-doc/doc/system/applications.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (996)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/applications.html 2026-06-04 19:04:59.873426483 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/applications.html 2026-06-04 19:04:59.873426483 +0000 @@ -139,8 +139,8 @@ Application Callback Module

            How to start and stop the code for the application, including its supervision -tree, is described by two callback functions:

            start(StartType, StartArgs) -> {ok, Pid} | {ok, Pid, State}
            -stop(State)
            • start/2 is called when starting the application and is to create the +tree, is described by two callback functions:

              start(StartType, StartArgs) -> {ok, Pid} | {ok, Pid, State}
              +stop(State)
              • start/2 is called when starting the application and is to create the supervision tree by starting the top supervisor. It is expected to return the pid of the top supervisor and an optional term, State, which defaults to []. This term is passed as is to stop/1.
              • StartType is usually the atom normal. It has other values only in the case @@ -150,15 +150,15 @@ necessary cleaning up. The actual stopping of the application, that is, shutting down the supervision tree, is handled automatically as described in Starting and Stopping Applications.

              Example of an application callback module for packaging the supervision tree -from Supervisor Behaviour:

              -module(ch_app).
              --behaviour(application).
              +from Supervisor Behaviour:

              -module(ch_app).
              +-behaviour(application).
               
              --export([start/2, stop/1]).
              +-export([start/2, stop/1]).
               
              -start(_Type, _Args) ->
              -    ch_sup:start_link().
              +start(_Type, _Args) ->
              +    ch_sup:start_link().
               
              -stop(_State) ->
              +stop(_State) ->
                   ok.

              A library application that cannot be started or stopped does not need any application callback module.

              @@ -177,14 +177,14 @@ in this case ch_app and [], respectively. This means that the following is called when the application is to be started:

              ch_app:start(normal, [])

              The following is called when the application is stopped:

              ch_app:stop([])

              When using systools, the Erlang/OTP tools for packaging code (see Section Releases), the keys description, vsn, modules, -registered, and applications are also to be specified:

              {application, ch_app,
              - [{description, "Channel allocator"},
              -  {vsn, "1"},
              -  {modules, [ch_app, ch_sup, ch3]},
              -  {registered, [ch3]},
              -  {applications, [kernel, stdlib, sasl]},
              -  {mod, {ch_app,[]}}
              - ]}.
              • description - A short description, a string. Defaults to "".
              • vsn - Version number, a string. Defaults to "".
              • modules - All modules introduced by this application. systools uses +registered, and applications are also to be specified:

                {application, ch_app,
                + [{description, "Channel allocator"},
                +  {vsn, "1"},
                +  {modules, [ch_app, ch_sup, ch3]},
                +  {registered, [ch3]},
                +  {applications, [kernel, stdlib, sasl]},
                +  {mod, {ch_app,[]}}
                + ]}.
                • description - A short description, a string. Defaults to "".
                • vsn - Version number, a string. Defaults to "".
                • modules - All modules introduced by this application. systools uses this list when generating boot scripts and tar files. A module must only be included in one application. Defaults to [].
                • registered - All names of registered processes in the application. systools uses this list to detect name clashes between applications. @@ -304,30 +304,30 @@ Loading and Unloading Applications

              Before an application can be started, it must be loaded. The application -controller reads and stores the information from the .app file:

              1> application:load(ch_app).
              +controller reads and stores the information from the .app file:

              1> application:load(ch_app).
               ok
              -2> application:loaded_applications().
              -[{kernel,"ERTS  CXC 138 10","2.8.1.3"},
              - {stdlib,"ERTS  CXC 138 10","1.11.4.3"},
              - {ch_app,"Channel allocator","1"}]

              An application that has been stopped, or has never been started, can be +2> application:loaded_applications(). +[{kernel,"ERTS CXC 138 10","2.8.1.3"}, + {stdlib,"ERTS CXC 138 10","1.11.4.3"}, + {ch_app,"Channel allocator","1"}]

              An application that has been stopped, or has never been started, can be unloaded. The information about the application is erased from the internal -database of the application controller.

              3> application:unload(ch_app).
              +database of the application controller.

              3> application:unload(ch_app).
               ok
              -4> application:loaded_applications().
              -[{kernel,"ERTS  CXC 138 10","2.8.1.3"},
              - {stdlib,"ERTS  CXC 138 10","1.11.4.3"}]

              Note

              Loading/unloading an application does not load/unload the code used by the +4> application:loaded_applications(). +[{kernel,"ERTS CXC 138 10","2.8.1.3"}, + {stdlib,"ERTS CXC 138 10","1.11.4.3"}]

              Note

              Loading/unloading an application does not load/unload the code used by the application. Code loading is handled in the usual way by the code server.

              Starting and Stopping Applications

              -

              An application is started by calling:

              5> application:start(ch_app).
              +

              An application is started by calling:

              5> application:start(ch_app).
               ok
              -6> application:which_applications().
              -[{kernel,"ERTS  CXC 138 10","2.8.1.3"},
              - {stdlib,"ERTS  CXC 138 10","1.11.4.3"},
              - {ch_app,"Channel allocator","1"}]

              If the application is not already loaded, the application controller first loads +6> application:which_applications(). +[{kernel,"ERTS CXC 138 10","2.8.1.3"}, + {stdlib,"ERTS CXC 138 10","1.11.4.3"}, + {ch_app,"Channel allocator","1"}]

              If the application is not already loaded, the application controller first loads it using application:load/1. It checks the value of the applications key to ensure that all applications that are to be started before this application are running.

              Following that, the application controller creates an application master for @@ -351,47 +351,47 @@ Configuring an Application

            An application can be configured using configuration parameters. These are a -list of {Par,Val} tuples specified by a key env in the .app file:

            {application, ch_app,
            - [{description, "Channel allocator"},
            -  {vsn, "1"},
            -  {modules, [ch_app, ch_sup, ch3]},
            -  {registered, [ch3]},
            -  {applications, [kernel, stdlib, sasl]},
            -  {mod, {ch_app,[]}},
            -  {env, [{file, "/usr/local/log"}]}
            - ]}.

            Par is to be an atom. Val is any term. The application can retrieve the +list of {Par,Val} tuples specified by a key env in the .app file:

            {application, ch_app,
            + [{description, "Channel allocator"},
            +  {vsn, "1"},
            +  {modules, [ch_app, ch_sup, ch3]},
            +  {registered, [ch3]},
            +  {applications, [kernel, stdlib, sasl]},
            +  {mod, {ch_app,[]}},
            +  {env, [{file, "/usr/local/log"}]}
            + ]}.

            Par is to be an atom. Val is any term. The application can retrieve the value of a configuration parameter by calling application:get_env(App, Par) or a number of similar functions. For more information, see module application in Kernel.

            Example:

            % erl
            -Erlang (BEAM) emulator version 5.2.3.6 [hipe] [threads:0]
            +Erlang (BEAM) emulator version 5.2.3.6 [hipe] [threads:0]
             
            -Eshell V5.2.3.6  (abort with ^G)
            -1> application:start(ch_app).
            +Eshell V5.2.3.6  (abort with ^G)
            +1> application:start(ch_app).
             ok
            -2> application:get_env(ch_app, file).
            -{ok,"/usr/local/log"}

            The values in the .app file can be overridden by values in a system +2> application:get_env(ch_app, file). +{ok,"/usr/local/log"}

            The values in the .app file can be overridden by values in a system configuration file. This is a file that contains configuration parameters for -relevant applications:

            [{Application1, [{Par11,Val11},...]},
            +relevant applications:

            [{Application1, [{Par11,Val11},...]},
              ...,
            - {ApplicationN, [{ParN1,ValN1},...]}].

            The system configuration is to be called Name.config and Erlang is to be + {ApplicationN, [{ParN1,ValN1},...]}].

            The system configuration is to be called Name.config and Erlang is to be started with the command-line argument -config Name. For details, see config in Kernel.

            Example:

            A file test.config is created with the following contents:

            [{ch_app, [{file, "testlog"}]}].

            The value of file overrides the value of file as defined in the .app file:

            % erl -config test
            -Erlang (BEAM) emulator version 5.2.3.6 [hipe] [threads:0]
            +Erlang (BEAM) emulator version 5.2.3.6 [hipe] [threads:0]
             
            -Eshell V5.2.3.6  (abort with ^G)
            -1> application:start(ch_app).
            +Eshell V5.2.3.6  (abort with ^G)
            +1> application:start(ch_app).
             ok
            -2> application:get_env(ch_app, file).
            -{ok,"testlog"}

            If release handling is used, exactly one system +2> application:get_env(ch_app, file). +{ok,"testlog"}

            If release handling is used, exactly one system configuration file is to be used and that file is to be called sys.config.

            The values in the .app file and the values in a system configuration file can be overridden directly from the command line:

            % erl -ApplName Par1 Val1 ... ParN ValN

            Example:

            % erl -ch_app file '"testlog"'
            -Erlang (BEAM) emulator version 5.2.3.6 [hipe] [threads:0]
            +Erlang (BEAM) emulator version 5.2.3.6 [hipe] [threads:0]
             
            -Eshell V5.2.3.6  (abort with ^G)
            -1> application:start(ch_app).
            +Eshell V5.2.3.6  (abort with ^G)
            +1> application:start(ch_app).
             ok
            -2> application:get_env(ch_app, file).
            -{ok,"testlog"}

            +2> application:get_env(ch_app, file). +{ok,"testlog"}

            @@ -457,7 +457,7 @@ Erlang programming language

            -

            Copyright © 1996-2026 Ericsson AB

            +

            Copyright © 1996-2042 Ericsson AB

            /usr/share/doc/packages/erlang27-doc/doc/system/appup_cookbook.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1058)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/appup_cookbook.html 2026-06-04 19:04:59.898426714 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/appup_cookbook.html 2026-06-04 19:04:59.899426724 +0000 @@ -124,10 +124,10 @@

            When a functional module has been changed, for example, if a new function has been added or a bug has been corrected, simple code replacement is sufficient, -for example:

            {"2",
            - [{"1", [{load_module, m}]}],
            - [{"1", [{load_module, m}]}]
            -}.

            +for example:

            {"2",
            + [{"1", [{load_module, m}]}],
            + [{"1", [{load_module, m}]}]
            +}.

            @@ -146,10 +146,10 @@

            A callback module is a functional module, and for code extensions simple code replacement is sufficient.

            Example

            When adding a function to ch3, as described in the example in -Release Handling, ch_app.appup looks as follows:

            {"2",
            - [{"1", [{load_module, ch3}]}],
            - [{"1", [{load_module, ch3}]}]
            -}.

            OTP also supports changing the internal state of behaviour processes; see +Release Handling, ch_app.appup looks as follows:

            {"2",
            + [{"1", [{load_module, ch3}]}],
            + [{"1", [{load_module, ch3}]}]
            +}.

            OTP also supports changing the internal state of behaviour processes; see Changing Internal State.

            @@ -163,21 +163,21 @@ gen_server Behaviour. The internal state is a term Chs representing the available channels. Assume you want to add a counter N, which keeps track of the number of alloc requests so far. This means that the -format must be changed to {Chs,N}.

            The .appup file can look as follows:

            {"2",
            - [{"1", [{update, ch3, {advanced, []}}]}],
            - [{"1", [{update, ch3, {advanced, []}}]}]
            -}.

            The third element of the update instruction is a tuple {advanced,Extra}, +format must be changed to {Chs,N}.

            The .appup file can look as follows:

            {"2",
            + [{"1", [{update, ch3, {advanced, []}}]}],
            + [{"1", [{update, ch3, {advanced, []}}]}]
            +}.

            The third element of the update instruction is a tuple {advanced,Extra}, which says that the affected processes are to do a state transformation before loading the new version of the module. This is done by the processes calling the callback function code_change/3 (see gen_server in STDLIB). -The term Extra, in this case [], is passed as is to the function:

            -module(ch3).
            +The term Extra, in this case [], is passed as is to the function:

            -module(ch3).
             ...
            --export([code_change/3]).
            +-export([code_change/3]).
             ...
            -code_change({down, _Vsn}, {Chs, N}, _Extra) ->
            -    {ok, Chs};
            -code_change(_Vsn, Chs, _Extra) ->
            -    {ok, {Chs, 0}}.

            The first argument is {down,Vsn} if there is a downgrade, or Vsn if there is +code_change({down, _Vsn}, {Chs, N}, _Extra) -> + {ok, Chs}; +code_change(_Vsn, Chs, _Extra) -> + {ok, {Chs, 0}}.

            The first argument is {down,Vsn} if there is a downgrade, or Vsn if there is a upgrade. The term Vsn is fetched from the 'original' version of the module, that is, the version you are upgrading from, or downgrading to.

            The version is defined by the module attribute vsn, if any. There is no such attribute in ch3, so in this case the version is the checksum (a huge integer) @@ -194,29 +194,29 @@ can occur during release upgrade if the new version of m1 is loaded first and calls ch3:available/0 before the new version of ch3 is loaded.

            Thus, ch3 must be loaded before m1, in the upgrade case, and conversely in the downgrade case. m1 is said to be dependent on ch3. In a release -handling instruction, this is expressed by the DepMods element:

            {load_module, Module, DepMods}
            -{update, Module, {advanced, Extra}, DepMods}

            DepMods is a list of modules, on which Module is dependent.

            Example

            The module m1 in application myapp is dependent on ch3 when +handling instruction, this is expressed by the DepMods element:

            {load_module, Module, DepMods}
            +{update, Module, {advanced, Extra}, DepMods}

            DepMods is a list of modules, on which Module is dependent.

            Example

            The module m1 in application myapp is dependent on ch3 when upgrading from "1" to "2", or downgrading from "2" to "1":

            myapp.appup:
             
            -{"2",
            - [{"1", [{load_module, m1, [ch3]}]}],
            - [{"1", [{load_module, m1, [ch3]}]}]
            -}.
            +{"2",
            + [{"1", [{load_module, m1, [ch3]}]}],
            + [{"1", [{load_module, m1, [ch3]}]}]
            +}.
             
             ch_app.appup:
             
            -{"2",
            - [{"1", [{load_module, ch3}]}],
            - [{"1", [{load_module, ch3}]}]
            -}.

            If instead m1 and ch3 belong to the same application, the .appup file can -look as follows:

            {"2",
            - [{"1",
            -   [{load_module, ch3},
            -    {load_module, m1, [ch3]}]}],
            - [{"1",
            -   [{load_module, ch3},
            -    {load_module, m1, [ch3]}]}]
            -}.

            m1 is dependent on ch3 also when downgrading. systools knows the +{"2", + [{"1", [{load_module, ch3}]}], + [{"1", [{load_module, ch3}]}] +}.

            If instead m1 and ch3 belong to the same application, the .appup file can +look as follows:

            {"2",
            + [{"1",
            +   [{load_module, ch3},
            +    {load_module, m1, [ch3]}]}],
            + [{"1",
            +   [{load_module, ch3},
            +    {load_module, m1, [ch3]}]}]
            +}.

            m1 is dependent on ch3 also when downgrading. systools knows the difference between up- and downgrading and generates a correct relup, where ch3 is loaded before m1 when upgrading, but m1 is loaded before ch3 when downgrading.

            @@ -231,22 +231,22 @@ synchronized code replacement must be used.

            Note

            The name(s) of the user-defined residence module(s) must be listed in the Modules part of the child specification for the special process. Otherwise the release handler cannot find the process.

            Example

            Consider the example ch4 in sys and proc_lib. -When started by a supervisor, the child specification can look as follows:

            {ch4, {ch4, start_link, []},
            - permanent, brutal_kill, worker, [ch4]}

            If ch4 is part of the application sp_app and a new version of the module is +When started by a supervisor, the child specification can look as follows:

            {ch4, {ch4, start_link, []},
            + permanent, brutal_kill, worker, [ch4]}

            If ch4 is part of the application sp_app and a new version of the module is to be loaded when upgrading from version "1" to "2" of this application, -sp_app.appup can look as follows:

            {"2",
            - [{"1", [{update, ch4, {advanced, []}}]}],
            - [{"1", [{update, ch4, {advanced, []}}]}]
            -}.

            The update instruction must contain the tuple {advanced,Extra}. The +sp_app.appup can look as follows:

            {"2",
            + [{"1", [{update, ch4, {advanced, []}}]}],
            + [{"1", [{update, ch4, {advanced, []}}]}]
            +}.

            The update instruction must contain the tuple {advanced,Extra}. The instruction makes the special process call the callback function system_code_change/4, a function the user must implement. The term Extra, in -this case [], is passed as is to system_code_change/4:

            -module(ch4).
            +this case [], is passed as is to system_code_change/4:

            -module(ch4).
             ...
            --export([system_code_change/4]).
            +-export([system_code_change/4]).
             ...
             
            -system_code_change(Chs, _Module, _OldVsn, _Extra) ->
            -    {ok, Chs}.
            • The first argument is the internal state State, passed from +system_code_change(Chs, _Module, _OldVsn, _Extra) -> + {ok, Chs}.
            • The first argument is the internal state State, passed from function sys:handle_system_msg(Request, From, Parent, Module, Deb, State), and called by the special process when a system message is received. In ch4, the internal state is the set of available channels Chs.
            • The second argument is the name of the module (ch4).
            • The third argument is Vsn or {down,Vsn}, as described for @@ -275,24 +275,24 @@ of upgrade and downgrade. Then the new return value of init/1 can be checked and the internal state be changed accordingly.

              The following upgrade instruction is used for supervisors:

              {update, Module, supervisor}

              Example

              To change the restart strategy of ch_sup (from Supervisor Behaviour) from one_for_one to one_for_all, -change the callback function init/1 in ch_sup.erl:

              -module(ch_sup).
              +change the callback function init/1 in ch_sup.erl:

              -module(ch_sup).
               ...
               
              -init(_Args) ->
              -    {ok, {#{strategy => one_for_all, ...}, ...}}.

              The file ch_app.appup:

              {"2",
              - [{"1", [{update, ch_sup, supervisor}]}],
              - [{"1", [{update, ch_sup, supervisor}]}]
              -}.

              +init(_Args) -> + {ok, {#{strategy => one_for_all, ...}, ...}}.

              The file ch_app.appup:

              {"2",
              + [{"1", [{update, ch_sup, supervisor}]}],
              + [{"1", [{update, ch_sup, supervisor}]}]
              +}.

              Changing Child Specifications

              The instruction, and thus the .appup file, when changing an existing child -specification, is the same as when changing properties as described earlier:

              {"2",
              - [{"1", [{update, ch_sup, supervisor}]}],
              - [{"1", [{update, ch_sup, supervisor}]}]
              -}.

              The changes do not affect existing child processes. For example, changing the +specification, is the same as when changing properties as described earlier:

              {"2",
              + [{"1", [{update, ch_sup, supervisor}]}],
              + [{"1", [{update, ch_sup, supervisor}]}]
              +}.

              The changes do not affect existing child processes. For example, changing the start function only specifies how the child process is to be restarted, if needed later on.

              The id of the child specification cannot be changed.

              Changing the Modules field of the child specification can affect the release handling process itself, as this field is used to identify which processes are @@ -307,34 +307,34 @@ Child processes are not automatically started or terminated, this must be done using apply instructions.

              Example

              Assume a new child process m1 is to be added to ch_sup when upgrading ch_app from "1" to "2". This means m1 is to be deleted when -downgrading from "2" to "1":

              {"2",
              - [{"1",
              -   [{update, ch_sup, supervisor},
              -    {apply, {supervisor, restart_child, [ch_sup, m1]}}
              -   ]}],
              - [{"1",
              -   [{apply, {supervisor, terminate_child, [ch_sup, m1]}},
              -    {apply, {supervisor, delete_child, [ch_sup, m1]}},
              -    {update, ch_sup, supervisor}
              -   ]}]
              -}.

              The order of the instructions is important.

              The supervisor must be registered as ch_sup for the script to work. If the +downgrading from "2" to "1":

              {"2",
              + [{"1",
              +   [{update, ch_sup, supervisor},
              +    {apply, {supervisor, restart_child, [ch_sup, m1]}}
              +   ]}],
              /usr/share/doc/packages/erlang27-doc/doc/system/benchmarking.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (788))
              --- old//usr/share/doc/packages/erlang27-doc/doc/system/benchmarking.html	2026-06-04 19:04:59.917426891 +0000
              +++ new//usr/share/doc/packages/erlang27-doc/doc/system/benchmarking.html	2026-06-04 19:04:59.917426891 +0000
              @@ -148,8 +148,8 @@
               crypto:strong_rand_bytes(100).          1    1915 Ki     522 ns   90%

              rand:bytes/1 is still faster when we generate 100 bytes at the time, but the relative difference is smaller.

              % erlperf 'rand:bytes(1000).' 'crypto:strong_rand_bytes(1000).'
               Code                                    ||        QPS       Time   Rel
              -crypto:strong_rand_bytes(1000).          1    1518 Ki     658 ns  100%
              -rand:bytes(1000).                        1     284 Ki    3521 ns   19%

              When we generate 1000 bytes at the time, crypto:strong_rand_bytes/1 is +crypto:strong_rand_bytes(1000). 1 1518 Ki 658 ns 100% +rand:bytes(1000). 1 284 Ki 3521 ns 19%

            When we generate 1000 bytes at the time, crypto:strong_rand_bytes/1 is now the fastest.

            @@ -223,7 +223,7 @@ Erlang programming language

            -

            Copyright © 1996-2026 Ericsson AB

            +

            Copyright © 1996-2042 Ericsson AB

            /usr/share/doc/packages/erlang27-doc/doc/system/binaryhandling.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (885)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/binaryhandling.html 2026-06-04 19:04:59.937427076 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/binaryhandling.html 2026-06-04 19:04:59.937427076 +0000 @@ -118,35 +118,35 @@

            This section gives a few examples on how to handle binaries in an efficient way. The sections that follow take an in-depth look at how binaries are implemented and how to best take advantages of the optimizations done by the compiler and -runtime system.

            Binaries can be efficiently built in the following way:

            DO

            my_list_to_binary(List) ->
            -    my_list_to_binary(List, <<>>).
            +runtime system.

            Binaries can be efficiently built in the following way:

            DO

            my_list_to_binary(List) ->
            +    my_list_to_binary(List, <<>>).
             
            -my_list_to_binary([H|T], Acc) ->
            -    my_list_to_binary(T, <<Acc/binary,H>>);
            -my_list_to_binary([], Acc) ->
            +my_list_to_binary([H|T], Acc) ->
            +    my_list_to_binary(T, <<Acc/binary,H>>);
            +my_list_to_binary([], Acc) ->
                 Acc.

            Appending data to a binary as in the example is efficient because it is specially optimized by the runtime system to avoid copying the Acc binary -every time.

            Prepending data to a binary in a loop is not efficient:

            DO NOT

            rev_list_to_binary(List) ->
            -    rev_list_to_binary(List, <<>>).
            +every time.

            Prepending data to a binary in a loop is not efficient:

            DO NOT

            rev_list_to_binary(List) ->
            +    rev_list_to_binary(List, <<>>).
             
            -rev_list_to_binary([H|T], Acc) ->
            -    rev_list_to_binary(T, <<H,Acc/binary>>);
            -rev_list_to_binary([], Acc) ->
            +rev_list_to_binary([H|T], Acc) ->
            +    rev_list_to_binary(T, <<H,Acc/binary>>);
            +rev_list_to_binary([], Acc) ->
                 Acc.

            This is not efficient for long lists because the Acc binary is copied every -time. One way to make the function more efficient is like this:

            DO NOT

            rev_list_to_binary(List) ->
            -    rev_list_to_binary(lists:reverse(List), <<>>).
            +time. One way to make the function more efficient is like this:

            DO NOT

            rev_list_to_binary(List) ->
            +    rev_list_to_binary(lists:reverse(List), <<>>).
             
            -rev_list_to_binary([H|T], Acc) ->
            -    rev_list_to_binary(T, <<Acc/binary,H>>);
            -rev_list_to_binary([], Acc) ->
            -    Acc.

            Another way to avoid copying the binary each time is like this:

            DO

            rev_list_to_binary([H|T]) ->
            -    RevTail = rev_list_to_binary(T),
            +rev_list_to_binary([H|T], Acc) ->
            +    rev_list_to_binary(T, <<Acc/binary,H>>);
            +rev_list_to_binary([], Acc) ->
            +    Acc.

            Another way to avoid copying the binary each time is like this:

            DO

            rev_list_to_binary([H|T]) ->
            +    RevTail = rev_list_to_binary(T),
                 <<RevTail/binary,H>>;
            -rev_list_to_binary([]) ->
            +rev_list_to_binary([]) ->
                 <<>>.

            Note that in each of the DO examples, the binary to be appended to is always -given as the first segment.

            Binaries can be efficiently matched in the following way:

            DO

            my_binary_to_list(<<H,T/binary>>) ->
            -    [H|my_binary_to_list(T)];
            -my_binary_to_list(<<>>) -> [].

            +given as the first segment.

            Binaries can be efficiently matched in the following way:

            DO

            my_binary_to_list(<<H,T/binary>>) ->
            +    [H|my_binary_to_list(T)];
            +my_binary_to_list(<<>>) -> [].

            @@ -223,7 +223,7 @@ Bin2 = <<Bin1/binary,4,5,6>>, %% 3 Bin3 = <<Bin2/binary,7,8,9>>, %% 4 Bin4 = <<Bin1/binary,17>>, %% 5 !!! -{Bin4,Bin3} %% 6

            • Line 1 (marked with the %% 1 comment), assigns a +{Bin4,Bin3} %% 6

            • Line 1 (marked with the %% 1 comment), assigns a heap binary to the Bin0 variable.

            • Line 2 is an append operation. As Bin0 has not been involved in an append operation, a new refc binary is created and the contents of Bin0 is copied into it. The ProcBin part of the refc @@ -257,15 +257,15 @@ for every append operation, the runtime system must create a sub binary.

              When the compiler can determine that none of those situations need to be handled and that the append operation cannot possibly fail, the compiler generates code that causes the runtime system to apply a more efficient variant of the -optimization.

              Example:

              -module(repack).
              --export([repack/1]).
              +optimization.

              Example:

              -module(repack).
              +-export([repack/1]).
               
              -repack(Bin) when is_binary(Bin) ->
              -    repack(Bin, <<>>).
              +repack(Bin) when is_binary(Bin) ->
              +    repack(Bin, <<>>).
               
              -repack(<<C:8,T/binary>>, Result) ->
              -    repack(T, <<Result/binary,C:16>>);
              -repack(<<>>, Result) ->
              +repack(<<C:8,T/binary>>, Result) ->
              +    repack(T, <<Result/binary,C:16>>);
              +repack(<<>>, Result) ->
                   Result.

              The repack/2 function only keeps a single version of the binary, so there is never any need to copy the binary. The compiler rewrites the creation of the empty binary in repack/1 to instead create a refc binary with 256 bytes @@ -308,9 +308,9 @@ Matching Binaries

            -

            Let us revisit the example in the beginning of the previous section:

            DO

            my_binary_to_list(<<H,T/binary>>) ->
            -    [H|my_binary_to_list(T)];
            -my_binary_to_list(<<>>) -> [].

            The first time my_binary_to_list/1 is called, a +

            Let us revisit the example in the beginning of the previous section:

            DO

            my_binary_to_list(<<H,T/binary>>) ->
            +    [H|my_binary_to_list(T)];
            +my_binary_to_list(<<>>) -> [].

            The first time my_binary_to_list/1 is called, a match context is created. The match context points to the first byte of the binary. 1 byte is matched out and the match context is updated to point to the second byte in the binary.

            At this point it would make sense to create a @@ -325,24 +325,24 @@ there is no longer any reference to it).

            To summarize, my_binary_to_list/1 only needs to create one match context and no sub binaries.

            Notice that the match context in my_binary_to_list/1 was discarded when the entire binary had been traversed. What happens if the iteration stops before it -has reached the end of the binary? Will the optimization still work?

            after_zero(<<0,T/binary>>) ->
            +has reached the end of the binary? Will the optimization still work?

            after_zero(<<0,T/binary>>) ->
                 T;
            -after_zero(<<_,T/binary>>) ->
            -    after_zero(T);
            -after_zero(<<>>) ->
            +after_zero(<<_,T/binary>>) ->
            +    after_zero(T);
            +after_zero(<<>>) ->
                 <<>>.

            Yes, it will. The compiler will remove the building of the sub binary in the second clause:

            ...
            -after_zero(<<_,T/binary>>) ->
            -    after_zero(T);
            -...

            But it will generate code that builds a sub binary in the first clause:

            after_zero(<<0,T/binary>>) ->
            +after_zero(<<_,T/binary>>) ->
            +    after_zero(T);
            +...

            But it will generate code that builds a sub binary in the first clause:

            after_zero(<<0,T/binary>>) ->
                 T;
             ...

            Therefore, after_zero/1 builds one match context and one sub binary (assuming -it is passed a binary that contains a zero byte).

            Code like the following will also be optimized:

            all_but_zeroes_to_list(Buffer, Acc, 0) ->
            -    {lists:reverse(Acc),Buffer};
            -all_but_zeroes_to_list(<<0,T/binary>>, Acc, Remaining) ->
            -    all_but_zeroes_to_list(T, Acc, Remaining-1);
            -all_but_zeroes_to_list(<<Byte,T/binary>>, Acc, Remaining) ->
            -    all_but_zeroes_to_list(T, [Byte|Acc], Remaining-1).

            The compiler removes building of sub binaries in the second and third clauses, +it is passed a binary that contains a zero byte).

            Code like the following will also be optimized:

            all_but_zeroes_to_list(Buffer, Acc, 0) ->
            +    {lists:reverse(Acc),Buffer};
            +all_but_zeroes_to_list(<<0,T/binary>>, Acc, Remaining) ->
            +    all_but_zeroes_to_list(T, Acc, Remaining-1);
            +all_but_zeroes_to_list(<<Byte,T/binary>>, Acc, Remaining) ->
            +    all_but_zeroes_to_list(T, [Byte|Acc], Remaining-1).

            The compiler removes building of sub binaries in the second and third clauses, and it adds an instruction to the first clause that converts Buffer from a match context to a sub binary (or do nothing if Buffer is a binary already).

            But in more complicated code, how can one know whether the optimization is applied or not?

            @@ -358,13 +358,13 @@ practical approach.

            The warnings look as follows:

            ./efficiency_guide.erl:60: Warning: NOT OPTIMIZED: binary is returned from the function
             ./efficiency_guide.erl:62: Warning: OPTIMIZED: match context reused

            To make it clearer exactly what code the warnings refer to, the warnings in the following examples are inserted as comments after the clause they refer to, for -example:

            after_zero(<<0,T/binary>>) ->
            +example:

            after_zero(<<0,T/binary>>) ->
                      %% BINARY CREATED: binary is returned from the function
                 T;
            -after_zero(<<_,T/binary>>) ->
            +after_zero(<<_,T/binary>>) ->
                      %% OPTIMIZED: match context reused
            -    after_zero(T);
            -after_zero(<<>>) ->
            +    after_zero(T);
            +after_zero(<<>>) ->
                 <<>>.

            The warning for the first clause says that the creation of a sub binary cannot be delayed, because it will be returned. The warning for the second clause says that a sub binary will not be created (yet).

            @@ -374,14 +374,14 @@ Unused Variables

            The compiler figures out if a variable is unused. The same code is generated for -each of the following functions:

            count1(<<_,T/binary>>, Count) -> count1(T, Count+1);
            -count1(<<>>, Count) -> Count.
            +each of the following functions:

            count1(<<_,T/binary>>, Count) -> count1(T, Count+1);
            +count1(<<>>, Count) -> Count.
             
            -count2(<<H,T/binary>>, Count) -> count2(T, Count+1);
            -count2(<<>>, Count) -> Count.
            +count2(<<H,T/binary>>, Count) -> count2(T, Count+1);
            +count2(<<>>, Count) -> Count.
             
            -count3(<<_H,T/binary>>, Count) -> count3(T, Count+1);
            -count3(<<>>, Count) -> Count.

            In each iteration, the first 8 bits in the binary will be skipped, not matched +count3(<<_H,T/binary>>, Count) -> count3(T, Count+1); +count3(<<>>, Count) -> Count.

            In each iteration, the first 8 bits in the binary will be skipped, not matched out.

            @@ -433,7 +433,7 @@ Erlang programming language

            -

            Copyright © 1996-2026 Ericsson AB

            +

            Copyright © 1996-2042 Ericsson AB

            /usr/share/doc/packages/erlang27-doc/doc/system/bit_syntax.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1328)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/bit_syntax.html 2026-06-04 19:04:59.956427252 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/bit_syntax.html 2026-06-04 19:04:59.956427252 +0000 @@ -145,17 +145,17 @@ variables, and Bin2 is bound, as in Example 2:

            <<D:16, E, F/binary>> = Bin2

            This gives D = 273, E = 00, and F binds to a binary of size 1: binary_to_list(F) = [42].

            Example 4: The following is a more elaborate example of matching. Here, Dgram is bound to the consecutive bytes of an IP datagram of IP protocol -version 4. The ambition is to extract the header and the data of the datagram:

            -define(IP_VERSION, 4).
            --define(IP_MIN_HDR_LEN, 5).
            +version 4. The ambition is to extract the header and the data of the datagram:

            -define(IP_VERSION, 4).
            +-define(IP_MIN_HDR_LEN, 5).
             
            -DgramSize = byte_size(Dgram),
            +DgramSize = byte_size(Dgram),
             case Dgram of
                 <<?IP_VERSION:4, HLen:4, SrvcType:8, TotLen:16,
                   ID:16, Flgs:3, FragOff:13,
                   TTL:8, Proto:8, HdrChkSum:16,
                   SrcIP:32,
                   DestIP:32, RestDgram/binary>> when HLen>=5, 4*HLen=<DgramSize ->
            -        OptsLen = 4*(HLen - ?IP_MIN_HDR_LEN),
            +        OptsLen = 4*(HLen - ?IP_MIN_HDR_LEN),
                     <<Opts:OptsLen/binary,Data/binary>> = RestDgram,
                 ...
             end.

            Here, the segment corresponding to the Opts variable has a type modifier, @@ -233,7 +233,7 @@ However, for syntactical reasons, both Value and Size must be enclosed in parenthesis if the expression consists of anything more than a single literal or a variable. The following gives a compiler syntax error:

            <<X+1:8>>

            This expression must be rewritten into the following, to be accepted by the -compiler:

            <<(X+1):8>>

            +compiler:

            <<(X+1):8>>

            @@ -253,11 +253,11 @@ restrictions on the size. A segment of type float must have size 64 or 32.

            As mentioned earlier, segments have the following general syntax:

            Value:Size/TypeSpecifierList

            When matching Value, value must be either a variable or an integer, or a floating point literal. Expressions are not allowed.

            Size must be a guard expression, which can use -literals and previously bound variables. The following is not allowed:

            foo(N, <<X:N,T/binary>>) ->
            -   {X,T}.

            The two occurrences of N are not related. The compiler will complain that the -N in the size field is unbound.

            The correct way to write this example is as follows:

            foo(N, Bin) ->
            +literals and previously bound variables. The following is not allowed:

            foo(N, <<X:N,T/binary>>) ->
            +   {X,T}.

            The two occurrences of N are not related. The compiler will complain that the +N in the size field is unbound.

            The correct way to write this example is as follows:

            foo(N, Bin) ->
                <<X:N,T/binary>> = Bin,
            -   {X,T}.

            Note

            Before OTP 23, Size was restricted to be an integer or a variable bound to + {X,T}.

            Note

            Before OTP 23, Size was restricted to be an integer or a variable bound to an integer.

            @@ -266,28 +266,28 @@

            There is one exception to the rule that a variable that is used as size must be previously bound. It is possible to match and bind a variable, and use it as a -size within the same binary pattern. For example:

            bar(<<Sz:8,Payload:Sz/binary-unit:8,Rest/binary>>) ->
            -   {Payload,Rest}.

            Here Sz is bound to the value in the first byte of the binary. Sz is then -used at the number of bytes to match out as a binary.

            Starting in OTP 23, the size can be a guard expression:

            bar(<<Sz:8,Payload:((Sz-1)*8)/binary,Rest/binary>>) ->
            -   {Payload,Rest}.

            Here Sz is the combined size of the header and the payload, so we will need to +size within the same binary pattern. For example:

            bar(<<Sz:8,Payload:Sz/binary-unit:8,Rest/binary>>) ->
            +   {Payload,Rest}.

            Here Sz is bound to the value in the first byte of the binary. Sz is then +used at the number of bytes to match out as a binary.

            Starting in OTP 23, the size can be a guard expression:

            bar(<<Sz:8,Payload:((Sz-1)*8)/binary,Rest/binary>>) ->
            +   {Payload,Rest}.

            Here Sz is the combined size of the header and the payload, so we will need to subtract one byte to get the size of the payload.

            Getting the Rest of the Binary or Bitstring

            -

            To match out the rest of a binary, specify a binary field without size:

            foo(<<A:8,Rest/binary>>) ->

            The size of the tail must be evenly divisible by 8.

            To match out the rest of a bitstring, specify a field without size:

            foo(<<A:8,Rest/bitstring>>) ->

            There are no restrictions on the number of bits in the tail.

            +

            To match out the rest of a binary, specify a binary field without size:

            foo(<<A:8,Rest/binary>>) ->

            The size of the tail must be evenly divisible by 8.

            To match out the rest of a bitstring, specify a field without size:

            foo(<<A:8,Rest/bitstring>>) ->

            There are no restrictions on the number of bits in the tail.

            Appending to a Binary

            -

            Appending to a binary in an efficient way can be done as follows:

            triples_to_bin(T) ->
            -    triples_to_bin(T, <<>>).
            +

            Appending to a binary in an efficient way can be done as follows:

            triples_to_bin(T) ->
            +    triples_to_bin(T, <<>>).
             
            -triples_to_bin([{X,Y,Z} | T], Acc) ->
            -    triples_to_bin(T, <<Acc/binary,X:32,Y:32,Z:32>>);
            -triples_to_bin([], Acc) ->
            +triples_to_bin([{X,Y,Z} | T], Acc) ->
            +    triples_to_bin(T, <<Acc/binary,X:32,Y:32,Z:32>>);
            +triples_to_bin([], Acc) ->
                 Acc.
            @@ -339,7 +339,7 @@ Erlang programming language

            -

            Copyright © 1996-2026 Ericsson AB

            +

            Copyright © 1996-2042 Ericsson AB

            /usr/share/doc/packages/erlang27-doc/doc/system/c_port.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1758)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/c_port.html 2026-06-04 19:04:59.976427438 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/c_port.html 2026-06-04 19:04:59.976427438 +0000 @@ -152,93 +152,93 @@ length indicator is to be used to simplify the communication between C and Erlang. The Erlang port automatically adds the length indicator, but this must be done explicitly in the external C program.

            The process is also set to trap exits, which enables detection of failure of the -external program:

            -module(complex1).
            --export([start/1, init/1]).
            +external program:

            -module(complex1).
            +-export([start/1, init/1]).
             
            -start(ExtPrg) ->
            -  spawn(?MODULE, init, [ExtPrg]).
            +start(ExtPrg) ->
            +  spawn(?MODULE, init, [ExtPrg]).
             
            -init(ExtPrg) ->
            -  register(complex, self()),
            -  process_flag(trap_exit, true),
            -  Port = open_port({spawn, ExtPrg}, [{packet, 2}]),
            -  loop(Port).

            Now complex1:foo/1 and complex1:bar/1 can be implemented. Both send a -message to the complex process and receive the following replies:

            foo(X) ->
            -  call_port({foo, X}).
            -bar(Y) ->
            -  call_port({bar, Y}).
            +init(ExtPrg) ->
            +  register(complex, self()),
            +  process_flag(trap_exit, true),
            +  Port = open_port({spawn, ExtPrg}, [{packet, 2}]),
            +  loop(Port).

            Now complex1:foo/1 and complex1:bar/1 can be implemented. Both send a +message to the complex process and receive the following replies:

            foo(X) ->
            +  call_port({foo, X}).
            +bar(Y) ->
            +  call_port({bar, Y}).
             
            -call_port(Msg) ->
            -  complex ! {call, self(), Msg},
            +call_port(Msg) ->
            +  complex ! {call, self(), Msg},
               receive
            -    {complex, Result} ->
            +    {complex, Result} ->
                   Result
            -  end.

            The complex process does the following:

            • Encodes the message into a sequence of bytes.
            • Sends it to the port.
            • Waits for a reply.
            • Decodes the reply.
            • Sends it back to the caller:
            loop(Port) ->
            +  end.

            The complex process does the following:

            • Encodes the message into a sequence of bytes.
            • Sends it to the port.
            • Waits for a reply.
            • Decodes the reply.
            • Sends it back to the caller:
            loop(Port) ->
               receive
            -    {call, Caller, Msg} ->
            -      Port ! {self(), {command, encode(Msg)}},
            +    {call, Caller, Msg} ->
            +      Port ! {self(), {command, encode(Msg)}},
                   receive
            -        {Port, {data, Data}} ->
            -          Caller ! {complex, decode(Data)}
            +        {Port, {data, Data}} ->
            +          Caller ! {complex, decode(Data)}
                   end,
            -      loop(Port)
            +      loop(Port)
               end.

            Assuming that both the arguments and the results from the C functions are less than 256, a simple encoding/decoding scheme is employed. In this scheme, foo is represented by byte 1, bar is represented by 2, and the argument/result is -represented by a single byte as well:

            encode({foo, X}) -> [1, X];
            -encode({bar, Y}) -> [2, Y].
            +represented by a single byte as well:

            encode({foo, X}) -> [1, X];
            +encode({bar, Y}) -> [2, Y].
             
            -decode([Int]) -> Int.

            The resulting Erlang program, including functionality for stopping the port and -detecting port failures, is as follows:

            -module(complex1).
            --export([start/1, stop/0, init/1]).
            --export([foo/1, bar/1]).
            -
            -start(ExtPrg) ->
            -    spawn(?MODULE, init, [ExtPrg]).
            -stop() ->
            +decode([Int]) -> Int.

            The resulting Erlang program, including functionality for stopping the port and +detecting port failures, is as follows:

            -module(complex1).
            +-export([start/1, stop/0, init/1]).
            +-export([foo/1, bar/1]).
            +
            +start(ExtPrg) ->
            +    spawn(?MODULE, init, [ExtPrg]).
            +stop() ->
                 complex ! stop.
             
            -foo(X) ->
            -    call_port({foo, X}).
            -bar(Y) ->
            -    call_port({bar, Y}).
            +foo(X) ->
            +    call_port({foo, X}).
            +bar(Y) ->
            +    call_port({bar, Y}).
             
            -call_port(Msg) ->
            -    complex ! {call, self(), Msg},
            +call_port(Msg) ->
            +    complex ! {call, self(), Msg},
                 receive
            -	{complex, Result} ->
            +	{complex, Result} ->
             	    Result
                 end.
             
            -init(ExtPrg) ->
            -    register(complex, self()),
            -    process_flag(trap_exit, true),
            -    Port = open_port({spawn, ExtPrg}, [{packet, 2}]),
            -    loop(Port).
            +init(ExtPrg) ->
            +    register(complex, self()),
            +    process_flag(trap_exit, true),
            +    Port = open_port({spawn, ExtPrg}, [{packet, 2}]),
            +    loop(Port).
             
            -loop(Port) ->
            +loop(Port) ->
                 receive
            -	{call, Caller, Msg} ->
            -	    Port ! {self(), {command, encode(Msg)}},
            +	{call, Caller, Msg} ->
            +	    Port ! {self(), {command, encode(Msg)}},
             	    receive
            -		{Port, {data, Data}} ->
            -		    Caller ! {complex, decode(Data)}
            +		{Port, {data, Data}} ->
            +		    Caller ! {complex, decode(Data)}
             	    end,
            -	    loop(Port);
            +	    loop(Port);
             	stop ->
            -	    Port ! {self(), close},
            +	    Port ! {self(), close},
             	    receive
            -		{Port, closed} ->
            -		    exit(normal)
            +		{Port, closed} ->
            +		    exit(normal)
             	    end;
            -	{'EXIT', Port, Reason} ->
            -	    exit(port_terminated)
            +	{'EXIT', Port, Reason} ->
            +	    exit(port_terminated)
                 end.
             
            -encode({foo, X}) -> [1, X];
            -encode({bar, Y}) -> [2, Y].
            +encode({foo, X}) -> [1, X];
            +encode({bar, Y}) -> [2, Y].
             
            -decode([Int]) -> Int.

            +decode([Int]) -> Int.

            @@ -255,55 +255,55 @@ typedef unsigned char byte; -int read_exact(byte *buf, int len) -{ +int read_exact(byte *buf, int len) +{ int i, got=0; - do { - if ((i = read(0, buf+got, len-got)) <= 0){ - return(i); - } + do { + if ((i = read(0, buf+got, len-got)) <= 0){ + return(i); + } got += i; - } while (got<len); + } while (got<len); - return(len); -} + return(len); +} -int write_exact(byte *buf, int len) -{ +int write_exact(byte *buf, int len) +{ int i, wrote = 0; - do { - if ((i = write(1, buf+wrote, len-wrote)) <= 0) - return (i); + do { + if ((i = write(1, buf+wrote, len-wrote)) <= 0) + return (i); wrote += i; - } while (wrote<len); + } while (wrote<len); - return (len); -} + return (len); /usr/share/doc/packages/erlang27-doc/doc/system/c_portdriver.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1758)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/c_portdriver.html 2026-06-04 19:04:59.998427642 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/c_portdriver.html 2026-06-04 19:04:59.998427642 +0000 @@ -155,104 +155,104 @@ argument.

            The port is then created using the BIF open_port/2, with the tuple {spawn, DriverName} as the first argument. The string SharedLib is the name of the port driver. The second argument is a list of options, none in this -case:

            -module(complex5).
            --export([start/1, init/1]).
            +case:

            -module(complex5).
            +-export([start/1, init/1]).
             
            -start(SharedLib) ->
            -    case erl_ddll:load_driver(".", SharedLib) of
            +start(SharedLib) ->
            +    case erl_ddll:load_driver(".", SharedLib) of
                     ok -> ok;
            -        {error, already_loaded} -> ok;
            -        _ -> exit({error, could_not_load_driver})
            +        {error, already_loaded} -> ok;
            +        _ -> exit({error, could_not_load_driver})
                 end,
            -    spawn(?MODULE, init, [SharedLib]).
            +    spawn(?MODULE, init, [SharedLib]).
             
            -init(SharedLib) ->
            -  register(complex, self()),
            -  Port = open_port({spawn, SharedLib}, []),
            -  loop(Port).

            Now complex5:foo/1 and complex5:bar/1 can be implemented. Both send a -message to the complex process and receive the following reply:

            foo(X) ->
            -    call_port({foo, X}).
            -bar(Y) ->
            -    call_port({bar, Y}).
            +init(SharedLib) ->
            +  register(complex, self()),
            +  Port = open_port({spawn, SharedLib}, []),
            +  loop(Port).

            Now complex5:foo/1 and complex5:bar/1 can be implemented. Both send a +message to the complex process and receive the following reply:

            foo(X) ->
            +    call_port({foo, X}).
            +bar(Y) ->
            +    call_port({bar, Y}).
             
            -call_port(Msg) ->
            -    complex ! {call, self(), Msg},
            +call_port(Msg) ->
            +    complex ! {call, self(), Msg},
                 receive
            -        {complex, Result} ->
            +        {complex, Result} ->
                         Result
            -    end.

            The complex process performs the following:

            • Encodes the message into a sequence of bytes.
            • Sends it to the port.
            • Waits for a reply.
            • Decodes the reply.
            • Sends it back to the caller:
            loop(Port) ->
            +    end.

            The complex process performs the following:

            • Encodes the message into a sequence of bytes.
            • Sends it to the port.
            • Waits for a reply.
            • Decodes the reply.
            • Sends it back to the caller:
            loop(Port) ->
                 receive
            -        {call, Caller, Msg} ->
            -            Port ! {self(), {command, encode(Msg)}},
            +        {call, Caller, Msg} ->
            +            Port ! {self(), {command, encode(Msg)}},
                         receive
            -                {Port, {data, Data}} ->
            -                    Caller ! {complex, decode(Data)}
            +                {Port, {data, Data}} ->
            +                    Caller ! {complex, decode(Data)}
                         end,
            -            loop(Port)
            +            loop(Port)
                 end.

            Assuming that both the arguments and the results from the C functions are less than 256, a simple encoding/decoding scheme is employed. In this scheme, foo is represented by byte 1, bar is represented by 2, and the argument/result is -represented by a single byte as well:

            encode({foo, X}) -> [1, X];
            -encode({bar, Y}) -> [2, Y].
            +represented by a single byte as well:

            encode({foo, X}) -> [1, X];
            +encode({bar, Y}) -> [2, Y].
             
            -decode([Int]) -> Int.

            The resulting Erlang program, including functions for stopping the port and +decode([Int]) -> Int.

            The resulting Erlang program, including functions for stopping the port and detecting port failures, is as follows:

            
            --module(complex5).
            --export([start/1, stop/0, init/1]).
            --export([foo/1, bar/1]).
            +-module(complex5).
            +-export([start/1, stop/0, init/1]).
            +-export([foo/1, bar/1]).
             
            -start(SharedLib) ->
            -    case erl_ddll:load_driver(".", SharedLib) of
            +start(SharedLib) ->
            +    case erl_ddll:load_driver(".", SharedLib) of
             	ok -> ok;
            -	{error, already_loaded} -> ok;
            -	_ -> exit({error, could_not_load_driver})
            +	{error, already_loaded} -> ok;
            +	_ -> exit({error, could_not_load_driver})
                 end,
            -    spawn(?MODULE, init, [SharedLib]).
            +    spawn(?MODULE, init, [SharedLib]).
             
            -init(SharedLib) ->
            -    register(complex, self()),
            -    Port = open_port({spawn, SharedLib}, []),
            -    loop(Port).
            +init(SharedLib) ->
            +    register(complex, self()),
            +    Port = open_port({spawn, SharedLib}, []),
            +    loop(Port).
             
            -stop() ->
            +stop() ->
                 complex ! stop.
             
            -foo(X) ->
            -    call_port({foo, X}).
            -bar(Y) ->
            -    call_port({bar, Y}).
            +foo(X) ->
            +    call_port({foo, X}).
            +bar(Y) ->
            +    call_port({bar, Y}).
             
            -call_port(Msg) ->
            -    complex ! {call, self(), Msg},
            +call_port(Msg) ->
            +    complex ! {call, self(), Msg},
                 receive
            -	{complex, Result} ->
            +	{complex, Result} ->
             	    Result
                 end.
             
            -loop(Port) ->
            +loop(Port) ->
                 receive
            -	{call, Caller, Msg} ->
            -	    Port ! {self(), {command, encode(Msg)}},
            +	{call, Caller, Msg} ->
            +	    Port ! {self(), {command, encode(Msg)}},
             	    receive
            -		{Port, {data, Data}} ->
            -		    Caller ! {complex, decode(Data)}
            +		{Port, {data, Data}} ->
            +		    Caller ! {complex, decode(Data)}
             	    end,
            -	    loop(Port);
            +	    loop(Port);
             	stop ->
            -	    Port ! {self(), close},
            +	    Port ! {self(), close},
             	    receive
            -		{Port, closed} ->
            -		    exit(normal)
            +		{Port, closed} ->
            +		    exit(normal)
             	    end;
            -	{'EXIT', Port, Reason} ->
            -	    io:format("~p ~n", [Reason]),
            -	    exit(port_terminated)
            +	{'EXIT', Port, Reason} ->
            +	    io:format("~p ~n", [Reason]),
            +	    exit(port_terminated)
                 end.
             
            -encode({foo, X}) -> [1, X];
            -encode({bar, Y}) -> [2, Y].
            +encode({foo, X}) -> [1, X];
            +encode({bar, Y}) -> [2, Y].
             
            -decode([Int]) -> Int.

            +decode([Int]) -> Int.

            @@ -277,36 +277,36 @@ #include <stdio.h> #include "erl_driver.h" -typedef struct { +typedef struct { ErlDrvPort port; -} example_data; +} example_data; -static ErlDrvData example_drv_start(ErlDrvPort port, char *buff) -{ - example_data* d = (example_data*)driver_alloc(sizeof(example_data)); +static ErlDrvData example_drv_start(ErlDrvPort port, char *buff) +{ + example_data* d = (example_data*)driver_alloc(sizeof(example_data)); d->port = port; - return (ErlDrvData)d; -} + return (ErlDrvData)d; +} -static void example_drv_stop(ErlDrvData handle) -{ - driver_free((char*)handle); -} - -static void example_drv_output(ErlDrvData handle, char *buff, - ErlDrvSizeT bufflen) -{ - example_data* d = (example_data*)handle; /usr/share/doc/packages/erlang27-doc/doc/system/character_set.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1950)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/character_set.html 2026-06-04 19:05:00.016427809 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/character_set.html 2026-06-04 19:05:00.015427800 +0000 @@ -190,7 +190,7 @@ Erlang programming language

            -

            Copyright © 1996-2026 Ericsson AB

            +

            Copyright © 1996-2042 Ericsson AB

            /usr/share/doc/packages/erlang27-doc/doc/system/cnode.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/system/cnode.html 2026-06-04 19:05:00.031427948 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/cnode.html 2026-06-04 19:05:00.031427948 +0000 @@ -168,7 +168,7 @@ Erlang programming language

            -

            Copyright © 1996-2026 Ericsson AB

            +

            Copyright © 1996-2042 Ericsson AB

            /usr/share/doc/packages/erlang27-doc/doc/system/code_loading.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (544)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/code_loading.html 2026-06-04 19:05:00.047428097 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/code_loading.html 2026-06-04 19:05:00.047428097 +0000 @@ -126,8 +126,8 @@

            Erlang programs must be compiled to object code. The compiler can generate a new file that contains the object code. The current abstract machine, which runs the object code, is called BEAM, therefore the object files get the suffix -.beam. The compiler can also generate a binary which can be loaded directly.

            The compiler is located in the module compile in Compiler.

            compile:file(Module)
            -compile:file(Module, Options)

            The Erlang shell understands the command c(Module), which both compiles and +.beam. The compiler can also generate a binary which can be loaded directly.

            The compiler is located in the module compile in Compiler.

            compile:file(Module)
            +compile:file(Module, Options)

            The Erlang shell understands the command c(Module), which both compiles and loads Module.

            There is also a module make, which provides a set of functions similar to the UNIX type Make functions, see module make in Tools.

            The compiler can also be accessed from the OS prompt using the erl executable in ERTS.

            % erl -compile Module1...ModuleN
            @@ -160,16 +160,16 @@
             evaluated because of processes lingering in the old code.

            If a third instance of the module is loaded, the code server removes (purges) the old code and any processes lingering in it is terminated. Then the third instance becomes 'current' and the previously current code becomes 'old'.

            To change from old code to current code, a process must make a fully qualified -function call.

            Example:

            -module(m).
            --export([loop/0]).
            +function call.

            Example:

            -module(m).
            +-export([loop/0]).
             
            -loop() ->
            +loop() ->
                 receive
                     code_switch ->
            -            m:loop();
            +            m:loop();
                     Msg ->
                         ...
            -            loop()
            +            loop()
                 end.

            To make the process change code, send the message code_switch to it. The process then makes a fully qualified call to m:loop() and changes to current code. Notice that m:loop/0 must be exported.

            For code replacement of funs to work, use the syntax @@ -180,7 +180,7 @@ Running a Function When a Module is Loaded

            The -on_load() directive names a function that is to be run automatically when -a module is loaded.

            Its syntax is as follows:

            -on_load(Name/0).

            It is not necessary to export the function. It is called in a freshly spawned +a module is loaded.

            Its syntax is as follows:

            -on_load(Name/0).

            It is not necessary to export the function. It is called in a freshly spawned process (which terminates as soon as the function returns).

            The function must return ok if the module is to become the new current code for the module and become callable.

            Returning any other value or generating an exception causes the new code to be unloaded. If the return value is not an atom, a warning error report is sent to @@ -193,13 +193,13 @@ code would become old, essentially leaving the system without any working and reachable instance of the module.

            In embedded mode, first all modules are loaded. Then all on_load functions are called. The system is terminated unless all of the on_load functions return -ok.

            Example:

            -module(m).
            --on_load(load_my_nifs/0).
            +ok.

            Example:

            -module(m).
            +-on_load(load_my_nifs/0).
             
            -load_my_nifs() ->
            +load_my_nifs() ->
                 NifPath = ...,    %Set up the path to the NIF library.
                 Info = ...,       %Initialize the Info term
            -    erlang:load_nif(NifPath, Info).

            If the call to erlang:load_nif/2 fails, the module is unloaded and a warning + erlang:load_nif(NifPath, Info).

            If the call to erlang:load_nif/2 fails, the module is unloaded and a warning report is sent to the error loader.

            @@ -251,7 +251,7 @@ Erlang programming language

            -

            Copyright © 1996-2026 Ericsson AB

            +

            Copyright © 1996-2042 Ericsson AB

            /usr/share/doc/packages/erlang27-doc/doc/system/commoncaveats.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1393)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/commoncaveats.html 2026-06-04 19:05:00.066428273 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/commoncaveats.html 2026-06-04 19:05:00.066428273 +0000 @@ -122,23 +122,23 @@ Operator ++

            The ++ operator copies its left-hand side operand. That is clearly -seen if we do our own implementation in Erlang:

            my_plus_plus([H|T], Tail) ->
            -    [H|my_plus_plus(T, Tail)];
            -my_plus_plus([], Tail) ->
            -    Tail.

            We must be careful how we use ++ in a loop. First is how not to use it:

            DO NOT

            naive_reverse([H|T]) ->
            -    naive_reverse(T) ++ [H];
            -naive_reverse([]) ->
            -    [].

            As the ++ operator copies its left-hand side operand, the growing -result is copied repeatedly, leading to quadratic complexity.

            On the other hand, using ++ in loop like this is perfectly fine:

            OK

            naive_but_ok_reverse(List) ->
            -    naive_but_ok_reverse(List, []).
            -
            -naive_but_ok_reverse([H|T], Acc) ->
            -    naive_but_ok_reverse(T, [H] ++ Acc);
            -naive_but_ok_reverse([], Acc) ->
            +seen if we do our own implementation in Erlang:

            my_plus_plus([H|T], Tail) ->
            +    [H|my_plus_plus(T, Tail)];
            +my_plus_plus([], Tail) ->
            +    Tail.

            We must be careful how we use ++ in a loop. First is how not to use it:

            DO NOT

            naive_reverse([H|T]) ->
            +    naive_reverse(T) ++ [H];
            +naive_reverse([]) ->
            +    [].

            As the ++ operator copies its left-hand side operand, the growing +result is copied repeatedly, leading to quadratic complexity.

            On the other hand, using ++ in loop like this is perfectly fine:

            OK

            naive_but_ok_reverse(List) ->
            +    naive_but_ok_reverse(List, []).
            +
            +naive_but_ok_reverse([H|T], Acc) ->
            +    naive_but_ok_reverse(T, [H] ++ Acc);
            +naive_but_ok_reverse([], Acc) ->
                 Acc.

            Each list element is copied only once. The growing result Acc is the right-hand -side operand, which it is not copied.

            Experienced Erlang programmers would probably write as follows:

            DO

            vanilla_reverse([H|T], Acc) ->
            -    vanilla_reverse(T, [H|Acc]);
            -vanilla_reverse([], Acc) ->
            +side operand, which it is not copied.

            Experienced Erlang programmers would probably write as follows:

            DO

            vanilla_reverse([H|T], Acc) ->
            +    vanilla_reverse(T, [H|Acc]);
            +vanilla_reverse([], Acc) ->
                 Acc.

            In principle, this is slightly more efficient because the list element [H] is not built before being copied and discarded. In practice, the compiler rewrites [H] ++ Acc to [H|Acc].

            @@ -164,41 +164,41 @@ Accidental Copying and Loss of Sharing

            When spawning a new process using a fun, one can accidentally copy more data to -the process than intended. For example:

            DO NOT

            accidental1(State) ->
            -    spawn(fun() ->
            -                  io:format("~p\n", [State#state.info])
            -          end).

            The code in the fun will extract one element from the record and print it. The +the process than intended. For example:

            DO NOT

            accidental1(State) ->
            +    spawn(fun() ->
            +                  io:format("~p\n", [State#state.info])
            +          end).

            The code in the fun will extract one element from the record and print it. The rest of the state record is not used. However, when the spawn/1 -function is executed, the entire record is copied to the newly created process.

            The same kind of problem can happen with a map:

            DO NOT

            accidental2(State) ->
            -    spawn(fun() ->
            -                  io:format("~p\n", [map_get(info, State)])
            -          end).

            In the following example (part of a module implementing the gen_server -behavior) the created fun is sent to another process:

            DO NOT

            handle_call(give_me_a_fun, _From, State) ->
            -    Fun = fun() -> State#href_anchor"ss">state.size =:= 42 end,
            -    {reply, Fun, State}.

            How bad that unnecessary copy is depends on the contents of the record or the -map.

            For example, if the state record is initialized like this:

            init1() ->
            -    #state{data=lists:seq(1, 10000)}.

            a list with 10000 elements (or about 20000 heap words) will be copied to the +function is executed, the entire record is copied to the newly created process.

            The same kind of problem can happen with a map:

            DO NOT

            accidental2(State) ->
            +    spawn(fun() ->
            +                  io:format("~p\n", [map_get(info, State)])
            +          end).

            In the following example (part of a module implementing the gen_server +behavior) the created fun is sent to another process:

            DO NOT

            handle_call(give_me_a_fun, _From, State) ->
            +    Fun = fun() -> State#href_anchor"ss">state.size =:= 42 end,
            +    {reply, Fun, State}.

            How bad that unnecessary copy is depends on the contents of the record or the +map.

            For example, if the state record is initialized like this:

            init1() ->
            +    #state{data=lists:seq(1, 10000)}.

            a list with 10000 elements (or about 20000 heap words) will be copied to the newly created process.

            An unnecessary copy of 10000 element list can be bad enough, but it can get even worse if the state record contains shared subterms. Here is a simple example -of a term with a shared subterm:

            {SubTerm, SubTerm}

            When a term is copied to another process, sharing of subterms will be lost and -the copied term can be many times larger than the original term. For example:

            init2() ->
            -    SharedSubTerms = lists:foldl(fun(_, A) -> [A|A] end, [0], lists:seq(1, 15)),
            -    #state{data=Shared}.

            In the process that calls init2/0, the size of the data field in the state +of a term with a shared subterm:

            {SubTerm, SubTerm}

            When a term is copied to another process, sharing of subterms will be lost and +the copied term can be many times larger than the original term. For example:

            init2() ->
            +    SharedSubTerms = lists:foldl(fun(_, A) -> [A|A] end, [0], lists:seq(1, 15)),
            +    #state{data=Shared}.

            In the process that calls init2/0, the size of the data field in the state record will be 32 heap words. When the record is copied to the newly created process, sharing will be lost and the size of the copied data field will be 131070 heap words. More details about loss off sharing are found in a later section.

            To avoid the problem, outside of the fun extract only the fields of the record -that are actually used:

            DO

            fixed_accidental1(State) ->
            +that are actually used:

            DO

            fixed_accidental1(State) ->
                 Info = State#state.info,
            -    spawn(fun() ->
            -                  io:format("~p\n", [Info])
            -          end).

            Similarly, outside of the fun extract only the map elements that are actually -used:

            DO

            fixed_accidental2(State) ->
            -    Info = map_get(info, State),
            -    spawn(fun() ->
            -                  io:format("~p\n", [Info])
            -          end).

            + spawn(fun() -> + io:format("~p\n", [Info]) + end).

            Similarly, outside of the fun extract only the map elements that are actually +used:

            DO

            fixed_accidental2(State) ->
            +    Info = map_get(info, State),
            +    spawn(fun() ->
            +                  io:format("~p\n", [Info])
            +          end).

            @@ -213,7 +213,7 @@ to guard against a denial-of-service attack. (All atoms that are allowed must have been created earlier, for example, by using all of them in a module and loading that module.)

            Using list_to_atom/1 to construct an atom that -is passed to apply/3 is quite expensive.

            DO NOT

            apply(list_to_atom("some_prefix"++Var), foo, Args)

            +is passed to apply/3 is quite expensive.

            DO NOT

            apply(list_to_atom("some_prefix"++Var), foo, Args)

            @@ -225,8 +225,8 @@ execute in constant time.

            Normally, there is no need to worry about the speed of length/1, because it is efficiently implemented in C. In time-critical code, you might want to avoid it if the input list could potentially be very long.

            Some uses of length/1 can be replaced by matching. For example, -the following code:

            foo(L) when length(L) >= 3 ->
            -    ...

            can be rewritten to:

            foo([_,_,_|_]=L) ->
            +the following code:

            foo(L) when length(L) >= 3 ->
            +    ...

            can be rewritten to:

            foo([_,_,_|_]=L) ->
                ...

            One slight difference is that length(L) fails if L is an improper list, while the pattern in the second code fragment accepts an improper list.

            @@ -242,10 +242,10 @@ as if the tuple was copied, the call to setelement/3 is replaced with a special destructive setelement instruction. In the following code sequence, the first setelement/3 call copies the tuple -and modifies the ninth element:

            multiple_setelement(T0) when tuple_size(T0) =:= 9 ->
            -    T1 = setelement(9, T0, bar),
            -    T2 = setelement(7, T1, foobar),
            -    setelement(5, T2, new_value).

            The two following setelement/3 calls modify the tuple in +and modifies the ninth element:

            multiple_setelement(T0) when tuple_size(T0) =:= 9 ->
            +    T1 = setelement(9, T0, bar),
            +    T2 = setelement(7, T1, foobar),
            +    setelement(5, T2, new_value).

            The two following setelement/3 calls modify the tuple in place.

            For the optimization to be applied, all the following conditions must be true:

            • The tuple argument must be known to be a tuple of a known size.
            • The indices must be integer literals, not variables or expressions.
            • The indices must be given in descending order.
            • There must be no calls to another function in between the calls to setelement/3.
            • The tuple returned from one setelement/3 call must only be used in the subsequent call to setelement/3.

            If the code cannot be structured as in the multiple_setelement/1 example, the @@ -321,7 +321,7 @@ Erlang programming language

            -

            Copyright © 1996-2026 Ericsson AB

            +

            Copyright © 1996-2042 Ericsson AB

            /usr/share/doc/packages/erlang27-doc/doc/system/conc_prog.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1347)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/conc_prog.html 2026-06-04 19:05:00.097428561 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/conc_prog.html 2026-06-04 19:05:00.097428561 +0000 @@ -136,21 +136,21 @@ Threads of execution in Erlang share no data, that is why they are called processes).

            The Erlang BIF spawn is used to create a new process: spawn(Module, Exported_Function, List of Arguments). Consider the following -module:

            -module(tut14).
            +module:

            -module(tut14).
             
            --export([start/0, say_something/2]).
            +-export([start/0, say_something/2]).
             
            -say_something(What, 0) ->
            +say_something(What, 0) ->
                 done;
            -say_something(What, Times) ->
            -    io:format("~p~n", [What]),
            -    say_something(What, Times - 1).
            -
            -start() ->
            -    spawn(tut14, say_something, [hello, 3]),
            -    spawn(tut14, say_something, [goodbye, 3]).
            5> c(tut14).
            -{ok,tut14}
            -6> tut14:say_something(hello, 3).
            +say_something(What, Times) ->
            +    io:format("~p~n", [What]),
            +    say_something(What, Times - 1).
            +
            +start() ->
            +    spawn(tut14, say_something, [hello, 3]),
            +    spawn(tut14, say_something, [goodbye, 3]).
            5> c(tut14).
            +{ok,tut14}
            +6> tut14:say_something(hello, 3).
             hello
             hello
             hello
            @@ -159,7 +159,7 @@
             processes, one that writes "hello" three times and one that writes "goodbye"
             three times. Both processes use the function say_something. Notice that a
             function used in this way by spawn, to start a process, must be exported from
            -the module (that is, in the -export at the start of the module).

            9> tut14:start().
            +the module (that is, in the -export at the start of the module).

            9> tut14:start().
             hello
             goodbye
             <0.63.0>
            @@ -170,7 +170,7 @@
             Instead, the first process wrote a "hello", the second a "goodbye", the first
             another "hello" and so forth. But where did the <0.63.0> come from? The return
             value of a function is the return value of the last "thing" in the function. The
            -last thing in the function start is

            spawn(tut14, say_something, [goodbye, 3]).

            spawn returns a process identifier, or pid, which uniquely identifies the +last thing in the function start is

            spawn(tut14, say_something, [goodbye, 3]).

            spawn returns a process identifier, or pid, which uniquely identifies the process. So <0.63.0> is the pid of the spawn function call above. The next example shows how to use pids.

            Notice also that ~p is used instead of ~w in io:format/2. To quote the manual:

            ~p Writes the data with standard syntax in the same way as ~w, but breaks terms whose printed representation is longer than one line into many lines and indents @@ -182,37 +182,37 @@ Message Passing

            In the following example two processes are created and they send messages to -each other a number of times.

            -module(tut15).
            +each other a number of times.

            -module(tut15).
             
            --export([start/0, ping/2, pong/0]).
            +-export([start/0, ping/2, pong/0]).
             
            -ping(0, Pong_PID) ->
            +ping(0, Pong_PID) ->
                 Pong_PID ! finished,
            -    io:format("ping finished~n", []);
            +    io:format("ping finished~n", []);
             
            -ping(N, Pong_PID) ->
            -    Pong_PID ! {ping, self()},
            +ping(N, Pong_PID) ->
            +    Pong_PID ! {ping, self()},
                 receive
                     pong ->
            -            io:format("Ping received pong~n", [])
            +            io:format("Ping received pong~n", [])
                 end,
            -    ping(N - 1, Pong_PID).
            +    ping(N - 1, Pong_PID).
             
            -pong() ->
            +pong() ->
                 receive
                     finished ->
            -            io:format("Pong finished~n", []);
            -        {ping, Ping_PID} ->
            -            io:format("Pong received ping~n", []),
            +            io:format("Pong finished~n", []);
            +        {ping, Ping_PID} ->
            +            io:format("Pong received ping~n", []),
                         Ping_PID ! pong,
            -            pong()
            +            pong()
                 end.
             
            -start() ->
            -    Pong_PID = spawn(tut15, pong, []),
            -    spawn(tut15, ping, [3, Pong_PID]).
            1> c(tut15).
            -{ok,tut15}
            -2> tut15: start().
            +start() ->
            +    Pong_PID = spawn(tut15, pong, []),
            +    spawn(tut15, ping, [3, Pong_PID]).
            1> c(tut15).
            +{ok,tut15}
            +2> tut15: start().
             <0.36.0>
             Pong received ping
             Ping received pong
            @@ -221,14 +221,14 @@
             Pong received ping
             Ping received pong
             ping finished
            -Pong finished

            The function start first creates a process, let us call it "pong":

            Pong_PID = spawn(tut15, pong, [])

            This process executes tut15:pong(). Pong_PID is the process identity of the -"pong" process. The function start now creates another process "ping":

            spawn(tut15, ping, [3, Pong_PID]),

            This process executes:

            tut15:ping(3, Pong_PID)

            <0.36.0> is the return value from the start function.

            The process "pong" now does:

            receive
            +Pong finished

            The function start first creates a process, let us call it "pong":

            Pong_PID = spawn(tut15, pong, [])

            This process executes tut15:pong(). Pong_PID is the process identity of the +"pong" process. The function start now creates another process "ping":

            spawn(tut15, ping, [3, Pong_PID]),

            This process executes:

            tut15:ping(3, Pong_PID)

            <0.36.0> is the return value from the start function.

            The process "pong" now does:

            receive
                 finished ->
            -        io:format("Pong finished~n", []);
            -    {ping, Ping_PID} ->
            -        io:format("Pong received ping~n", []),
            +        io:format("Pong finished~n", []);
            +    {ping, Ping_PID} ->
            +        io:format("Pong received ping~n", []),
                     Ping_PID ! pong,
            -        pong()
            +        pong()
             end.

            The receive construct is used to allow processes to wait for messages from other processes. It has the following format:

            receive
                pattern1 ->
            @@ -257,21 +257,21 @@
             procedure is repeated.

            The Erlang implementation is "clever" and minimizes the number of times each message is tested against the patterns in each receive.

            Now back to the ping pong example.

            "Pong" is waiting for messages. If the atom finished is received, "pong" writes "Pong finished" to the output and, as it has nothing more to do, -terminates. If it receives a message with the format:

            {ping, Ping_PID}

            it writes "Pong received ping" to the output and sends the atom pong to the +terminates. If it receives a message with the format:

            {ping, Ping_PID}

            it writes "Pong received ping" to the output and sends the atom pong to the process "ping":

            Ping_PID ! pong

            Notice how the operator "!" is used to send messages. The syntax of "!" is:

            Pid ! Message

            That is, Message (any Erlang term) is sent to the process with identity Pid.

            After sending the message pong to the process "ping", "pong" calls the pong function again, which causes it to get back to the receive again and wait for -another message.

            Now let us look at the process "ping". Recall that it was started by executing:

            tut15:ping(3, Pong_PID)

            Looking at the function ping/2, the second clause of ping/2 is executed +another message.

            Now let us look at the process "ping". Recall that it was started by executing:

            tut15:ping(3, Pong_PID)

            Looking at the function ping/2, the second clause of ping/2 is executed since the value of the first argument is 3 (not 0) (first clause head is -ping(0,Pong_PID), second clause head is ping(N,Pong_PID), so N becomes 3).

            The second clause sends a message to "pong":

            Pong_PID ! {ping, self()},

            self/0 returns the pid of the process that executes self/0, in this case the +ping(0,Pong_PID), second clause head is ping(N,Pong_PID), so N becomes 3).

            The second clause sends a message to "pong":

            Pong_PID ! {ping, self()},

            self/0 returns the pid of the process that executes self/0, in this case the pid of "ping". (Recall the code for "pong", this lands up in the variable Ping_PID in the receive previously explained.)

            "Ping" now waits for a reply from "pong":

            receive
                 pong ->
            -        io:format("Ping received pong~n", [])
            +        io:format("Ping received pong~n", [])
             end,

            It writes "Ping received pong" when this reply arrives, after which "ping" calls -the ping function again.

            ping(N - 1, Pong_PID)

            N-1 causes the first argument to be decremented until it becomes 0. When this -occurs, the first clause of ping/2 is executed:

            ping(0, Pong_PID) ->
            +the ping function again.

            ping(N - 1, Pong_PID)

            N-1 causes the first argument to be decremented until it becomes 0. When this +occurs, the first clause of ping/2 is executed:

            ping(0, Pong_PID) ->
                 Pong_PID !  finished,
            -    io:format("ping finished~n", []);

            The atom finished is sent to "pong" (causing it to terminate as described + io:format("ping finished~n", []);

            The atom finished is sent to "pong" (causing it to terminate as described above) and "ping finished" is written to the output. "Ping" then terminates as it has nothing left to do.

            @@ -285,38 +285,38 @@ processes which need to know each other's identities are started independently of each other. Erlang thus provides a mechanism for processes to be given names so that these names can be used as identities instead of pids. This is done by -using the register BIF:

            register(some_atom, Pid)

            Let us now rewrite the ping pong example using this and give the name pong to -the "pong" process:

            -module(tut16).
            +using the register BIF:

            register(some_atom, Pid)

            Let us now rewrite the ping pong example using this and give the name pong to +the "pong" process:

            -module(tut16).
             
            --export([start/0, ping/1, pong/0]).
            +-export([start/0, ping/1, pong/0]).
             
            -ping(0) ->
            +ping(0) ->
                 pong ! finished,
            -    io:format("ping finished~n", []);
            +    io:format("ping finished~n", []);
             
            -ping(N) ->
            -    pong ! {ping, self()},
            +ping(N) ->
            +    pong ! {ping, self()},
                 receive
                     pong ->
            -            io:format("Ping received pong~n", [])
            +            io:format("Ping received pong~n", [])
                 end,
            -    ping(N - 1).
            +    ping(N - 1).
             
            -pong() ->
            +pong() ->
                 receive
                     finished ->
            -            io:format("Pong finished~n", []);
            -        {ping, Ping_PID} ->
            -            io:format("Pong received ping~n", []),
            +            io:format("Pong finished~n", []);
            +        {ping, Ping_PID} ->
            +            io:format("Pong received ping~n", []),
            /usr/share/doc/packages/erlang27-doc/doc/system/create_target.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (788))
            --- old//usr/share/doc/packages/erlang27-doc/doc/system/create_target.html	2026-06-04 19:05:00.126428829 +0000
            +++ new//usr/share/doc/packages/erlang27-doc/doc/system/create_target.html	2026-06-04 19:05:00.126428829 +0000
            @@ -142,13 +142,13 @@
             SASL), which specifies the ERTS version and lists all applications that are to
             be included in the new basic target system. An example is the following
             mysystem.rel file:

            %% mysystem.rel
            -{release,
            - {"MYSYSTEM", "FIRST"},
            - {erts, "5.10.4"},
            - [{kernel, "2.16.4"},
            -  {stdlib, "1.19.4"},
            -  {sasl, "2.3.4"},
            -  {pea, "1.0"}]}.

            The listed applications are not only original Erlang/OTP applications but +{release, + {"MYSYSTEM", "FIRST"}, + {erts, "5.10.4"}, + [{kernel, "2.16.4"}, + {stdlib, "1.19.4"}, + {sasl, "2.3.4"}, + {pea, "1.0"}]}.

            The listed applications are not only original Erlang/OTP applications but possibly also new applications that you have written (here exemplified by the application Pea (pea)).

            Step 2. Start Erlang/OTP from the directory where the mysystem.rel file resides:

            % erl -pa /home/user/target_system/myapps/pea-1.0/ebin

            The -pa argument prepends the path to the ebin directory for @@ -246,17 +246,17 @@

            In this example the Pea application has been changed, and so are the applications ERTS, Kernel, STDLIB and SASL.

            Step 1. Create the file .rel:

            %% mysystem2.rel
            -{release,
            - {"MYSYSTEM", "SECOND"},
            - {erts, "6.0"},
            - [{kernel, "3.0"},
            -  {stdlib, "2.0"},
            -  {sasl, "2.4"},
            -  {pea, "2.0"}]}.

            Step 2. Create the application upgrade file (see +{release, + {"MYSYSTEM", "SECOND"}, + {erts, "6.0"}, + [{kernel, "3.0"}, + {stdlib, "2.0"}, + {sasl, "2.4"}, + {pea, "2.0"}]}.

            Step 2. Create the application upgrade file (see appup in SASL) for Pea, for example:

            %% pea.appup
            -{"2.0",
            - [{"1.0",[{load_module,pea_lib}]}],
            - [{"1.0",[{load_module,pea_lib}]}]}.

            Step 3. From the directory where the file mysystem2.rel resides, start the +{"2.0", + [{"1.0",[{load_module,pea_lib}]}], + [{"1.0",[{load_module,pea_lib}]}]}.

            Step 3. From the directory where the file mysystem2.rel resides, start the Erlang/OTP system, giving the path to the new version of Pea:

            % erl -pa /home/user/target_system/myapps/pea-2.0/ebin

            Step 4. Create the release upgrade file (see relup in SASL):

            1> systools:make_relup("mysystem2",["mysystem"],["mysystem"],
                 [{path,["/home/user/target_system/myapps/pea-1.0/ebin",
            @@ -296,21 +296,21 @@
             release_handler:install_release/1 means that the release_handler has
             restarted the node by using heart. This is always done when the upgrade
             involves a change of the applications ERTS, Kernel, STDLIB, or SASL. For more
            -information, see Upgrade when Erlang/OTP has Changed.

            The node is accessible through a new pipe:

            % /usr/local/erl-target/bin/to_erl /tmp/erlang.pipe.2

            List the available releases in the system:

            1> release_handler:which_releases().
            -[{"MYSYSTEM","SECOND",
            -  ["kernel-3.0","stdlib-2.0","sasl-2.4","pea-2.0"],
            -  current},
            - {"MYSYSTEM","FIRST",
            -  ["kernel-2.16.4","stdlib-1.19.4","sasl-2.3.4","pea-1.0"],
            -  permanent}]

            Our new release, "SECOND", is now the current release, but we can also see that +information, see Upgrade when Erlang/OTP has Changed.

            The node is accessible through a new pipe:

            % /usr/local/erl-target/bin/to_erl /tmp/erlang.pipe.2

            List the available releases in the system:

            1> release_handler:which_releases().
            +[{"MYSYSTEM","SECOND",
            +  ["kernel-3.0","stdlib-2.0","sasl-2.4","pea-2.0"],
            +  current},
            + {"MYSYSTEM","FIRST",
            +  ["kernel-2.16.4","stdlib-1.19.4","sasl-2.3.4","pea-1.0"],
            +  permanent}]

            Our new release, "SECOND", is now the current release, but we can also see that our "FIRST" release is still permanent. This means that if the node would be -restarted now, it would come up running the "FIRST" release again.

            Step 3. Make the new release permanent:

            2> release_handler:make_permanent("SECOND").

            Check the releases again:

            3> release_handler:which_releases().
            -[{"MYSYSTEM","SECOND",
            -  ["kernel-3.0","stdlib-2.0","sasl-2.4","pea-2.0"],
            -  permanent},
            - {"MYSYSTEM","FIRST",
            -  ["kernel-2.16.4","stdlib-1.19.4","sasl-2.3.4","pea-1.0"],
            -  old}]

            We see that the new release version is permanent, so it would be safe to +restarted now, it would come up running the "FIRST" release again.

            Step 3. Make the new release permanent:

            2> release_handler:make_permanent("SECOND").

            Check the releases again:

            3> release_handler:which_releases().
            +[{"MYSYSTEM","SECOND",
            +  ["kernel-3.0","stdlib-2.0","sasl-2.4","pea-2.0"],
            +  permanent},
            + {"MYSYSTEM","FIRST",
            +  ["kernel-2.16.4","stdlib-1.19.4","sasl-2.3.4","pea-1.0"],
            +  old}]

            We see that the new release version is permanent, so it would be safe to restart the node.

            @@ -319,8 +319,8 @@

            This module can also be found in the examples directory of the SASL application.

            
            --module(target_system).
            --export([create/1, create/2, install/2]).
            +-module(target_system).
            +-export([create/1, create/2, install/2]).
             
             %% Note: RelFileName below is the *stem* without trailing .rel,
             %% .script etc.
            @@ -328,176 +328,176 @@
             
             %% create(RelFileName)
             %%
            -create(RelFileName) ->
            -    create(RelFileName,[]).
            +create(RelFileName) ->
            +    create(RelFileName,[]).
             
            -create(RelFileName,SystoolsOpts) ->
            +create(RelFileName,SystoolsOpts) ->
                 RelFile = RelFileName ++ ".rel",
            -    Dir = filename:dirname(RelFileName),
            -    PlainRelFileName = filename:join(Dir,"plain"),
            +    Dir = filename:dirname(RelFileName),
            +    PlainRelFileName = filename:join(Dir,"plain"),
                 PlainRelFile = PlainRelFileName ++ ".rel",
            -    io:fwrite("Reading file: ~ts ...~n", [RelFile]),
            -    {ok, [RelSpec]} = file:consult(RelFile),
            -    io:fwrite("Creating file: ~ts from ~ts ...~n",
            -              [PlainRelFile, RelFile]),
            -    {release,
            -     {RelName, RelVsn},
            -     {erts, ErtsVsn},
            -     AppVsns} = RelSpec,
            -    PlainRelSpec = {release,
            -                    {RelName, RelVsn},
            -                    {erts, ErtsVsn},
            -                    lists:filter(fun({kernel, _}) ->
            +    io:fwrite("Reading file: ~ts ...~n", [RelFile]),
            +    {ok, [RelSpec]} = file:consult(RelFile),
            +    io:fwrite("Creating file: ~ts from ~ts ...~n",
            +              [PlainRelFile, RelFile]),
            +    {release,
            +     {RelName, RelVsn},
            +     {erts, ErtsVsn},
            +     AppVsns} = RelSpec,
            +    PlainRelSpec = {release,
            +                    {RelName, RelVsn},
            +                    {erts, ErtsVsn},
            +                    lists:filter(fun({kernel, _}) ->
                                                      true;
            -                                    ({stdlib, _}) ->
            +                                    ({stdlib, _}) ->
                                                      true;
            -                                    (_) ->
            +                                    (_) ->
                                                      false
            -                                 end, AppVsns)
            -                   },
            -    {ok, Fd} = file:open(PlainRelFile, [write]),
            -    io:fwrite(Fd, "~p.~n", [PlainRelSpec]),
            -    file:close(Fd),
            -
            -    io:fwrite("Making \"~ts.script\" and \"~ts.boot\" files ...~n",
            -	      [PlainRelFileName,PlainRelFileName]),
            -    make_script(PlainRelFileName,SystoolsOpts),
            -
            -    io:fwrite("Making \"~ts.script\" and \"~ts.boot\" files ...~n",
            -              [RelFileName, RelFileName]),
            -    make_script(RelFileName,SystoolsOpts),
            +                                 end, AppVsns)
            +                   },
            +    {ok, Fd} = file:open(PlainRelFile, [write]),
            +    io:fwrite(Fd, "~p.~n", [PlainRelSpec]),
            +    file:close(Fd),
            +
            +    io:fwrite("Making \"~ts.script\" and \"~ts.boot\" files ...~n",
            +	      [PlainRelFileName,PlainRelFileName]),
            +    make_script(PlainRelFileName,SystoolsOpts),
            +
            +    io:fwrite("Making \"~ts.script\" and \"~ts.boot\" files ...~n",
            +              [RelFileName, RelFileName]),
            +    make_script(RelFileName,SystoolsOpts),
             
                 TarFileName = RelFileName ++ ".tar.gz",
            -    io:fwrite("Creating tar file ~ts ...~n", [TarFileName]),
            -    make_tar(RelFileName,SystoolsOpts),
            +    io:fwrite("Creating tar file ~ts ...~n", [TarFileName]),
            +    make_tar(RelFileName,SystoolsOpts),
             
            -    TmpDir = filename:join(Dir,"tmp"),
            -    io:fwrite("Creating directory ~tp ...~n",[TmpDir]),
            -    file:make_dir(TmpDir),
            -
            -    io:fwrite("Extracting ~ts into directory ~ts ...~n", [TarFileName,TmpDir]),
            -    extract_tar(TarFileName, TmpDir),
            -
            -    TmpBinDir = filename:join([TmpDir, "bin"]),
            -    ErtsBinDir = filename:join([TmpDir, "erts-" ++ ErtsVsn, "bin"]),
            -    io:fwrite("Deleting \"erl\" and \"start\" in directory ~ts ...~n",
            -              [ErtsBinDir]),
            -    file:delete(filename:join([ErtsBinDir, "erl"])),
            -    file:delete(filename:join([ErtsBinDir, "start"])),
            -
            -    io:fwrite("Creating temporary directory ~ts ...~n", [TmpBinDir]),
            -    file:make_dir(TmpBinDir),
            -
            -    io:fwrite("Copying file \"~ts.boot\" to ~ts ...~n",
            -              [PlainRelFileName, filename:join([TmpBinDir, "start.boot"])]),
            -    copy_file(PlainRelFileName++".boot",filename:join([TmpBinDir, "start.boot"])),
            +    TmpDir = filename:join(Dir,"tmp"),
            /usr/share/doc/packages/erlang27-doc/doc/system/data_types.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (3751))
            --- old//usr/share/doc/packages/erlang27-doc/doc/system/data_types.html	2026-06-04 19:05:00.151429061 +0000
            +++ new//usr/share/doc/packages/erlang27-doc/doc/system/data_types.html	2026-06-04 19:05:00.152429070 +0000
            @@ -196,10 +196,10 @@
             arithmetic operations. This is because floats are represented by a fixed number
             of bits in a base-2 system while printed floats are represented with a base-10
             system. Erlang uses 64-bit floats. Here are examples of this phenomenon:

            1> 0.1+0.2.
            -0.30000000000000004

            The real numbers 0.1 and 0.2 cannot be represented exactly as floats.

            1> {36028797018963968.0, 36028797018963968 == 36028797018963968.0,
            -  36028797018963970.0, 36028797018963970 == 36028797018963970.0}.
            -{3.602879701896397e16, true,
            - 3.602879701896397e16, false}.

            The value 36028797018963968 can be represented exactly as a float value but +0.30000000000000004

            The real numbers 0.1 and 0.2 cannot be represented exactly as floats.

            1> {36028797018963968.0, 36028797018963968 == 36028797018963968.0,
            +  36028797018963970.0, 36028797018963970 == 36028797018963970.0}.
            +{3.602879701896397e16, true,
            + 3.602879701896397e16, false}.

            The value 36028797018963968 can be represented exactly as a float value but Erlang's pretty printer rounds 36028797018963968.0 to 3.602879701896397e16 (=36028797018963970.0) as all values in the range [36028797018963966.0, 36028797018963972.0] are represented by @@ -240,11 +240,11 @@ 3> <<1:1,0:1>>. <<2:2>>

            The is_bitstring/1 BIF tests whether a term is a bit string, and the is_binary/1 -BIF tests whether a term is a binary.

            Examples:

            1> is_bitstring(<<1:1>>).
            +BIF tests whether a term is a binary.

            Examples:

            1> is_bitstring(<<1:1>>).
             true
            -2> is_binary(<<1:1>>).
            +2> is_binary(<<1:1>>).
             false
            -3> is_binary(<<42>>).
            +3> is_binary(<<42>>).
             true
             

            For more examples, see Programming Examples.

            @@ -256,9 +256,9 @@ among connected nodes. A reference is created by calling the make_ref/0 BIF. The is_reference/1 BIF tests whether a term -is a reference.

            Examples:

            1> Ref = make_ref().
            +is a reference.

            Examples:

            1> Ref = make_ref().
             #Ref<0.76482849.3801088007.198204>
            -2> is_reference(Ref).
            +2> is_reference(Ref).
             true

            @@ -267,17 +267,17 @@

            A fun is a functional object. Funs make it possible to create an anonymous function and pass the function itself — not its name — as argument to other -functions.

            Examples:

            1> Fun1 = fun (X) -> X+1 end.
            +functions.

            Examples:

            1> Fun1 = fun (X) -> X+1 end.
             #Fun<erl_eval.6.39074546>
            -2> Fun1(2).
            +2> Fun1(2).
             3

            The is_function/1 and is_function/2 -BIFs tests whether a term is a fun.

            Examples:

            1> F = fun() -> ok end.
            +BIFs tests whether a term is a fun.

            Examples:

            1> F = fun() -> ok end.
             #Fun<erl_eval.43.105768164>
            -2> is_function(F).
            +2> is_function(F).
             true
            -3> is_function(F, 0).
            +3> is_function(F, 0).
             true
            -4> is_function(F, 1).
            +4> is_function(F, 1).
             false

            Read more about funs in Fun Expressions. For more examples, see Programming Examples.

            @@ -303,17 +303,17 @@ a message, which is the case when calling the spawn_request/5 BIF. A Pid is typically used when when sending a process a signal. The -is_pid/1 BIF tests whether a term is a Pid.

            Example:

            -module(m).
            --export([loop/0]).
            +is_pid/1 BIF tests whether a term is a Pid.

            Example:

            -module(m).
            +-export([loop/0]).
             
            -loop() ->
            +loop() ->
                 receive
                     who_are_you ->
            -            io:format("I am ~p~n", [self()]),
            -            loop()
            +            io:format("I am ~p~n", [self()]),
            +            loop()
                 end.
             
            -1> P = spawn(m, loop, []).
            +1> P = spawn(m, loop, []).
             <0.58.0>
             2> P ! who_are_you.
             I am <0.58.0>
            @@ -324,19 +324,19 @@
               Tuple
             

            A tuple is a compound data type with a fixed number of terms:

            {Term1,...,TermN}

            Each term Term in the tuple is called an element. The number of elements is -said to be the size of the tuple.

            There exists a number of BIFs to manipulate tuples.

            Examples:

            1> P = {adam,24,{july,29}}.
            -{adam,24,{july,29}}
            -2> element(1,P).
            +said to be the size of the tuple.

            There exists a number of BIFs to manipulate tuples.

            Examples:

            1> P = {adam,24,{july,29}}.
            +{adam,24,{july,29}}
            +2> element(1,P).
             adam
            -3> element(3,P).
            -{july,29}
            -4> P2 = setelement(2,P,25).
            -{adam,25,{july,29}}
            -5> tuple_size(P).
            +3> element(3,P).
            +{july,29}
            +4> P2 = setelement(2,P,25).
            +{adam,25,{july,29}}
            +5> tuple_size(P).
             3
            -6> tuple_size({}).
            +6> tuple_size({}).
             0
            -7> is_tuple({a,b,c}).
            +7> is_tuple({a,b,c}).
             true

            @@ -345,17 +345,17 @@

            A map is a compound data type with a variable number of key-value associations:

            #{Key1 => Value1, ..., KeyN => ValueN}

            Each key-value association in the map is called an association pair. The key and value parts of the pair are called elements. The number of association -pairs is said to be the size of the map.

            There exists a number of BIFs to manipulate maps.

            Examples:

            1> M1 = #{name => adam, age => 24, date => {july,29}}.
            -#{age => 24,date => {july,29},name => adam}
            -2> maps:get(name, M1).
            +pairs is said to be the size of the map.

            There exists a number of BIFs to manipulate maps.

            Examples:

            1> M1 = #{name => adam, age => 24, date => {july,29}}.
            +#{age => 24,date => {july,29},name => adam}
            +2> maps:get(name, M1).
             adam
            -3> maps:get(date, M1).
            -{july,29}
            -4> M2 = maps:update(age, 25, M1).
            -#{age => 25,date => {july,29},name => adam}
            -5> map_size(M).
            +3> maps:get(date, M1).
            +{july,29}
            +4> M2 = maps:update(age, 25, M1).
            +#{age => 25,date => {july,29},name => adam}
            +5> map_size(M).
             3
            -6> map_size(#{}).
            +6> map_size(#{}).
             0

            A collection of maps processing functions are found in module maps in STDLIB.

            Read more about maps in Map Expressions.

            Change

            Maps were introduced as an experimental feature in Erlang/OTP R17. Their functionality was extended and became fully supported in Erlang/OTP 18.

            @@ -370,19 +370,19 @@ latter can be expressed as [H|T]. The notation [Term1,...,TermN] above is equivalent with the list [Term1|[...|[TermN|[]]]].

            Example:

            [] is a list, thus
            [c|[]] is a list, thus
            [b|[c|[]]] is a list, thus
            [a|[b|[c|[]]]] is a list, or in short [a,b,c]

            A list where the tail is a list is sometimes called a proper list. It is allowed to have a list where the tail is not a list, for example, [a|b]. -However, this type of list is of little practical use.

            Examples:

            1> L1 = [a,2,{c,4}].
            -[a,2,{c,4}]
            -2> [H|T] = L1.
            -[a,2,{c,4}]
            +However, this type of list is of little practical use.

            Examples:

            1> L1 = [a,2,{c,4}].
            +[a,2,{c,4}]
            +2> [H|T] = L1.
            +[a,2,{c,4}]
             3> H.
             a
             4> T.
            -[2,{c,4}]
            -5> L2 = [d|T].
            -[d,2,{c,4}]
            -6> length(L1).
            +[2,{c,4}]
            +5> L2 = [d|T].
            +[d,2,{c,4}]
            +6> length(L1).
             3
            -7> length([]).
            +7> length([]).
             0

            A collection of list processing functions are found in module lists in STDLIB.

            @@ -510,16 +510,16 @@ data type. Instead, record expressions are translated to tuple expressions during compilation. Therefore, record expressions are not understood by the shell unless special actions are taken. For details, see module shell -in STDLIB.

            Examples:

            -module(person).
            --export([new/2]).
            +in STDLIB.

            Examples:

            -module(person).
            +-export([new/2]).
             
            --record(person, {name, age}).
            +-record(person, {name, age}).
             
            -new(Name, Age) ->
            -    #href_anchor"ss">person{name=Name, age=Age}.
            +new(Name, Age) ->
            +    #href_anchor"ss">person{name=Name, age=Age}.
             
            -1> person:new(ernie, 44).
            -{person,ernie,44}

            Read more about records in Records. More examples are +1> person:new(ernie, 44). +{person,ernie,44}

            Read more about records in Records. More examples are found in Programming Examples.

            /usr/share/doc/packages/erlang27-doc/doc/system/debugging.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (432)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/debugging.html 2026-06-04 19:05:00.174429275 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/debugging.html 2026-06-04 19:05:00.173429266 +0000 @@ -335,7 +335,7 @@ Erlang programming language

            -

            Copyright © 1996-2026 Ericsson AB

            +

            Copyright © 1996-2042 Ericsson AB

            /usr/share/doc/packages/erlang27-doc/doc/system/design_principles.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (847)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/design_principles.html 2026-06-04 19:05:00.199429507 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/design_principles.html 2026-06-04 19:05:00.199429507 +0000 @@ -156,94 +156,94 @@ specific part. Consider the following code (written in plain Erlang) for a simple server, which keeps track of a number of "channels". Other processes can allocate and free the channels by calling the functions alloc/0 and free/1, -respectively.

            -module(ch1).
            --export([start/0]).
            --export([alloc/0, free/1]).
            --export([init/0]).
            +respectively.

            -module(ch1).
            +-export([start/0]).
            +-export([alloc/0, free/1]).
            +-export([init/0]).
             
            -start() ->
            -    spawn(ch1, init, []).
            +start() ->
            +    spawn(ch1, init, []).
             
            -alloc() ->
            -    ch1 ! {self(), alloc},
            +alloc() ->
            +    ch1 ! {self(), alloc},
                 receive
            -        {ch1, Res} ->
            +        {ch1, Res} ->
                         Res
                 end.
             
            -free(Ch) ->
            -    ch1 ! {free, Ch},
            +free(Ch) ->
            +    ch1 ! {free, Ch},
                 ok.
             
            -init() ->
            -    register(ch1, self()),
            -    Chs = channels(),
            -    loop(Chs).
            +init() ->
            +    register(ch1, self()),
            +    Chs = channels(),
            +    loop(Chs).
             
            -loop(Chs) ->
            +loop(Chs) ->
                 receive
            -        {From, alloc} ->
            -            {Ch, Chs2} = alloc(Chs),
            -            From ! {ch1, Ch},
            -            loop(Chs2);
            -        {free, Ch} ->
            -            Chs2 = free(Ch, Chs),
            -            loop(Chs2)
            -    end.

            The code for the server can be rewritten into a generic part server.erl:

            -module(server).
            --export([start/1]).
            --export([call/2, cast/2]).
            --export([init/1]).
            +        {From, alloc} ->
            +            {Ch, Chs2} = alloc(Chs),
            +            From ! {ch1, Ch},
            +            loop(Chs2);
            +        {free, Ch} ->
            +            Chs2 = free(Ch, Chs),
            +            loop(Chs2)
            +    end.

            The code for the server can be rewritten into a generic part server.erl:

            -module(server).
            +-export([start/1]).
            +-export([call/2, cast/2]).
            +-export([init/1]).
             
            -start(Mod) ->
            -    spawn(server, init, [Mod]).
            +start(Mod) ->
            +    spawn(server, init, [Mod]).
             
            -call(Name, Req) ->
            -    Name ! {call, self(), Req},
            +call(Name, Req) ->
            +    Name ! {call, self(), Req},
                 receive
            -        {Name, Res} ->
            +        {Name, Res} ->
                         Res
                 end.
             
            -cast(Name, Req) ->
            -    Name ! {cast, Req},
            +cast(Name, Req) ->
            +    Name ! {cast, Req},
                 ok.
             
            -init(Mod) ->
            -    register(Mod, self()),
            -    State = Mod:init(),
            -    loop(Mod, State).
            +init(Mod) ->
            +    register(Mod, self()),
            +    State = Mod:init(),
            +    loop(Mod, State).
             
            -loop(Mod, State) ->
            +loop(Mod, State) ->
                 receive
            -        {call, From, Req} ->
            -            {Res, State2} = Mod:handle_call(Req, State),
            -            From ! {Mod, Res},
            -            loop(Mod, State2);
            -        {cast, Req} ->
            -            State2 = Mod:handle_cast(Req, State),
            -            loop(Mod, State2)
            -    end.

            And a callback module ch2.erl:

            -module(ch2).
            --export([start/0]).
            --export([alloc/0, free/1]).
            --export([init/0, handle_call/2, handle_cast/2]).
            -
            -start() ->
            -    server:start(ch2).
            -
            -alloc() ->
            -    server:call(ch2, alloc).
            -
            -free(Ch) ->
            -    server:cast(ch2, {free, Ch}).
            +        {call, From, Req} ->
            +            {Res, State2} = Mod:handle_call(Req, State),
            +            From ! {Mod, Res},
            +            loop(Mod, State2);
            +        {cast, Req} ->
            +            State2 = Mod:handle_cast(Req, State),
            +            loop(Mod, State2)
            +    end.

            And a callback module ch2.erl:

            -module(ch2).
            +-export([start/0]).
            +-export([alloc/0, free/1]).
            +-export([init/0, handle_call/2, handle_cast/2]).
            +
            +start() ->
            +    server:start(ch2).
            +
            +alloc() ->
            +    server:call(ch2, alloc).
            +
            +free(Ch) ->
            +    server:cast(ch2, {free, Ch}).
             
            -init() ->
            -    channels().
            +init() ->
            +    channels().
             
            -handle_call(alloc, Chs) ->
            -    alloc(Chs). % => {Ch,Chs2}
            +handle_call(alloc, Chs) ->
            +    alloc(Chs). % => {Ch,Chs2}
             
            -handle_cast({free, Ch}, Chs) ->
            -    free(Ch, Chs). % => Chs2

            Notice the following:

            • The code in server can be reused to build many different servers.
            • The server name, in this example the atom ch2, is hidden from the users of +handle_cast({free, Ch}, Chs) -> + free(Ch, Chs). % => Chs2

            Notice the following:

            • The code in server can be reused to build many different servers.
            • The server name, in this example the atom ch2, is hidden from the users of the client functions. This means that the name can be changed without affecting them.
            • The protocol (messages sent to and received from the server) is also hidden. This is good programming practice and allows one to change the protocol @@ -252,16 +252,16 @@ and free/2 has been intentionally left out, as it is not relevant to the example. For completeness, one way to write these functions is given below. This is an example only, a realistic implementation must be able to handle situations -like running out of channels to allocate, and so on.

              channels() ->
              -   {_Allocated = [], _Free = lists:seq(1, 100)}.
              +like running out of channels to allocate, and so on.

              channels() ->
              +   {_Allocated = [], _Free = lists:seq(1, 100)}.
               
              -alloc({Allocated, [H|T] = _Free}) ->
              -   {H, {[H|Allocated], T}}.
              +alloc({Allocated, [H|T] = _Free}) ->
              +   {H, {[H|Allocated], T}}.
               
              -free(Ch, {Alloc, Free} = Channels) ->
              -   case lists:member(Ch, Alloc) of
              +free(Ch, {Alloc, Free} = Channels) ->
              +   case lists:member(Ch, Alloc) of
                     true ->
              -         {lists:delete(Ch, Alloc), [Ch|Free]};
              +         {lists:delete(Ch, Alloc), [Ch|Free]};
                     false ->
                        Channels
                  end.

              Code written without using behaviours can be more efficient, but the increased @@ -270,13 +270,13 @@ other programmers. Improvised programming structures, while possibly more efficient, are always more difficult to understand.

              The server module corresponds, greatly simplified, to the Erlang/OTP behaviour gen_server.

              The standard Erlang/OTP behaviours are:

              • gen_server

                For implementing the server of a client-server relation

              • gen_statem

                For implementing state machines

              • gen_event

                For implementing event handling functionality

              • supervisor

                For implementing a supervisor in a supervision tree

              The compiler understands the module attribute -behaviour(Behaviour) and issues -warnings about missing callback functions, for example:

              -module(chs3).
              --behaviour(gen_server).
              +warnings about missing callback functions, for example:

              -module(chs3).
              +-behaviour(gen_server).
               ...
               
              -3> c(chs3).
              +3> c(chs3).
               ./chs3.erl:10: Warning: undefined call-back function handle_call/3
              -{ok,chs3}

              Missing in old package: /usr/share/doc/packages/erlang27-doc/doc/system/dist/search_data-A3AB6FFD.js Missing in old package: /usr/share/doc/packages/erlang27-doc/doc/system/dist/search_data-A3AB6FFD.js /usr/share/doc/packages/erlang27-doc/doc/system/distributed.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1626)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/distributed.html 2026-06-04 19:05:00.226429757 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/distributed.html 2026-06-04 19:05:00.226429757 +0000 @@ -146,17 +146,17 @@ the user. host is the full host name if long names are used, or the first part of the host name if short names are used. Function node() returns the name of the node.

              Example:

              % erl -name dilbert
              -(dilbert@uab.ericsson.se)1> node().
              +(dilbert@uab.ericsson.se)1> node().
               'dilbert@uab.ericsson.se'
               
               % erl -sname dilbert
              -(dilbert@uab)1> node().
              +(dilbert@uab)1> node().
               dilbert@uab

              The node name can also be given in runtime by calling net_kernel:start/1.

              Example:

              % erl
              -1> node().
              +1> node().
               nonode@nohost
              -2> net_kernel:start([dilbert,shortnames]).
              -{ok,<0.102.0>}
              -(dilbert@uab)3> node().
              +2> net_kernel:start([dilbert,shortnames]).
              +{ok,<0.102.0>}
              +(dilbert@uab)3> node().
               dilbert@uab

              Note

              A node with a long node name cannot communicate with a node with a short node name.

              @@ -360,7 +360,7 @@ Erlang programming language

              -

              Copyright © 1996-2026 Ericsson AB

              +

              Copyright © 1996-2042 Ericsson AB

              /usr/share/doc/packages/erlang27-doc/doc/system/distributed_applications.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1060)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/distributed_applications.html 2026-06-04 19:05:00.245429933 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/distributed_applications.html 2026-06-04 19:05:00.245429933 +0000 @@ -154,13 +154,13 @@ elapsed, all applications start. If not all mandatory nodes are up, the node terminates.

              Example:

              An application myapp is to run at the node cp1@cave. If this node goes down, myapp is to be restarted at cp2@cave or cp3@cave. A system configuration -file cp1.config for cp1@cave can look as follows:

              [{kernel,
              -  [{distributed, [{myapp, 5000, [cp1@cave, {cp2@cave, cp3@cave}]}]},
              -   {sync_nodes_mandatory, [cp2@cave, cp3@cave]},
              -   {sync_nodes_timeout, 5000}
              -  ]
              - }
              -].

              The system configuration files for cp2@cave and cp3@cave are identical, +file cp1.config for cp1@cave can look as follows:

              [{kernel,
              +  [{distributed, [{myapp, 5000, [cp1@cave, {cp2@cave, cp3@cave}]}]},
              +   {sync_nodes_mandatory, [cp2@cave, cp3@cave]},
              +   {sync_nodes_timeout, 5000}
              +  ]
              + }
              +].

              The system configuration files for cp2@cave and cp3@cave are identical, except for the list of mandatory nodes, which is to be [cp1@cave, cp3@cave] for cp2@cave and [cp1@cave, cp2@cave] for cp3@cave.

              Note

              All involved nodes must have the same value for distributed and sync_nodes_timeout. Otherwise the system behavior is undefined.

              @@ -175,7 +175,7 @@ automatically starts the application.

              The application is started at the first operational node that is listed in the list of nodes in the distributed configuration parameter. The application is started as usual. That is, an application master is created and calls the -application callback function:

              Module:start(normal, StartArgs)

              Example:

              Continuing the example from the previous section, the three nodes are started, +application callback function:

              Module:start(normal, StartArgs)

              Example:

              Continuing the example from the previous section, the three nodes are started, specifying the system configuration file:

              > erl -sname cp1 -config cp1
               > erl -sname cp2 -config cp2
               > erl -sname cp3 -config cp3

              When all nodes are operational, myapp can be started. This is achieved by @@ -191,9 +191,9 @@ restarted (after the specified time-out) at the first operational node that is listed in the list of nodes in the distributed configuration parameter. This is called a failover.

              The application is started the normal way at the new node, that is, by the -application master calling:

              Module:start(normal, StartArgs)

              An exception is if the application has the start_phases key defined (see +application master calling:

              Module:start(normal, StartArgs)

              An exception is if the application has the start_phases key defined (see Included Applications). The application is then -instead started by calling:

              Module:start({failover, Node}, StartArgs)

              Here Node is the terminated node.

              Example:

              If cp1 goes down, the system checks which one of the other nodes, cp2 or +instead started by calling:

              Module:start({failover, Node}, StartArgs)

              Here Node is the terminated node.

              Example:

              If cp1 goes down, the system checks which one of the other nodes, cp2 or cp3, has the least number of running applications, but waits for 5 seconds for cp1 to restart. If cp1 does not restart and cp2 runs fewer applications than cp3, myapp is restarted on cp2.

              Application myapp - Situation 2

              Suppose now that cp2 goes also down and does not restart within 5 seconds. @@ -206,7 +206,7 @@

              If a node is started, which has higher priority according to distributed than the node where a distributed application is running, the application is restarted at the new node and stopped at the old node. This is called a -takeover.

              The application is started by the application master calling:

              Module:start({takeover, Node}, StartArgs)

              Here Node is the old node.

              Example:

              If myapp is running at cp3, and if cp2 now restarts, it does not restart +takeover.

              The application is started by the application master calling:

              Module:start({takeover, Node}, StartArgs)

              Here Node is the old node.

              Example:

              If myapp is running at cp3, and if cp2 now restarts, it does not restart myapp, as the order between the cp2 and cp3 nodes is undefined.

              Application myapp - Situation 4

              However, if cp1 also restarts, the function application:takeover/2 moves myapp to cp1, as cp1 has a higher priority than cp3 for this application. In this case, Module:start({takeover, cp3@cave}, StartArgs) is @@ -261,7 +261,7 @@ Erlang programming language

              -

              Copyright © 1996-2026 Ericsson AB

              +

              Copyright © 1996-2042 Ericsson AB

              /usr/share/doc/packages/erlang27-doc/doc/system/documentation.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1250)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/documentation.html 2026-06-04 19:05:00.266430128 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/documentation.html 2026-06-04 19:05:00.266430128 +0000 @@ -116,15 +116,15 @@

              Documentation in Erlang is done through the -moduledoc and -doc -attributes. For example:

              -module(arith).
              +attributes. For example:

              -module(arith).
               -moduledoc """
               A module for basic arithmetic.
               """.
               
              --export([add/2]).
              +-export([add/2]).
               
               -doc "Adds two numbers.".
              -add(One, Two) -> One + Two.

              The -moduledoc attribute has to be located before the first -doc attribute +add(One, Two) -> One + Two.

              The -moduledoc attribute has to be located before the first -doc attribute or function declaration. It documents the overall purpose of the module.

              The -doc attribute always precedes the function or attribute it documents. The attributes that can be documented are @@ -144,23 +144,23 @@ Documentation metadata

            It is possible to add metadata to the documentation entry. You do this by adding -a -moduledoc or -doc attribute with a map as argument. For example:

            -module(arith).
            +a -moduledoc or -doc attribute with a map as argument. For example:

            -module(arith).
             -moduledoc """
             A module for basic arithmetic.
             """.
            --moduledoc #{since => "1.0"}.
            +-moduledoc #{since => "1.0"}.
             
            --export([add/2]).
            +-export([add/2]).
             
             -doc "Adds two numbers.".
            --doc(#{since => "1.0"}).
            -add(One, Two) -> One + Two.

            The metadata is used by documentation tools to provide extra information to the +-doc(#{since => "1.0"}). +add(One, Two) -> One + Two.

            The metadata is used by documentation tools to provide extra information to the user. There can be multiple metadata documentation entries, in which case the maps will be merged with the latest taking precedence if there are duplicate keys. Example:

            -doc "Adds two numbers.".
            --doc #{since => "1.0", author => "Joe"}.
            --doc #{since => "2.0"}.
            -add(One, Two) -> One + Two.

            This will result in a metadata entry of #{since => "2.0", author => "Joe"}.

            The keys and values in the metadata map can be any type, but it is recommended +-doc #{since => "1.0", author => "Joe"}. +-doc #{since => "2.0"}. +add(One, Two) -> One + Two.

            This will result in a metadata entry of #{since => "2.0", author => "Joe"}.

            The keys and values in the metadata map can be any type, but it is recommended that only atoms are used for keys and strings for the values.

            @@ -172,8 +172,8 @@ -doc {file, "path/to/doc.md"} to point to the documentation. The path used is relative to the file where the -doc attribute is located. For example:

            %% doc/add.md
             Adds two numbers.

            and

            %% src/arith.erl
            --doc({file, "../doc/add.md"}).
            -add(One, Two) -> One + Two.

            +-doc({file, "../doc/add.md"}). +add(One, Two) -> One + Two.

            @@ -184,7 +184,7 @@ and other diagrams to better show the usage of the module. Instead of writing a long text in the moduledoc attribute, it could be better to break it out into an external page.

            The moduledoc attribute should start with a short paragraph describing the -module and then go into greater details. For example:

            -module(arith).
            +module and then go into greater details. For example:

            -module(arith).
             -moduledoc """
                A module for basic arithmetic.
             
            @@ -207,9 +207,9 @@
             deprecated and what to use instead.

          • format - The format to use for all documentation in this module. The default is text/markdown. It should be written using the mime type -of the format.

          Example:

          -moduledoc {file, "../doc/arith.asciidoc"}.
          --moduledoc #href_anchor"ss">since => "0.1", format => "text/asciidoc"}.
          --moduledoc #{deprecated => "Use the Erlang arithmetic operators instead."}.

          +of the format.

        Example:

        -moduledoc {file, "../doc/arith.asciidoc"}.
        +-moduledoc #href_anchor"ss">since => "0.1", format => "text/asciidoc"}.
        +-moduledoc #{deprecated => "Use the Erlang arithmetic operators instead."}.

        @@ -224,7 +224,7 @@ We use a special number here so that we know that this number comes from this module. """. --opaque number() :: {arith, erlang:number()}. +-opaque number() :: {arith, erlang:number()}. -doc """ Adds two numbers. @@ -235,8 +235,8 @@ 1> arith:add(arith:number(1), arith:number(2)). {number, 3} ``` """. --spec add(number(), number()) -> number(). -add({number, One}, {number, Two}) -> {number, One + Two}.

        +-spec add(number(), number()) -> number(). +add({number, One}, {number, Two}) -> {number, One + Two}.

      @@ -248,12 +248,12 @@ automatically insert this key if there is a -deprecated attribute marking a function as deprecated.

    • equiv => unicode:chardata() | F/A | F(...) - Notes that this function is equivalent to another function in this module. The equivalence can be described using either -Func/Arity, Func(Args) or a unicode string. For example:

      -doc #{equiv => add/3}.
      -add(One, Two) -> add(One, Two, []).
      -add(One, Two, Options) -> ...

      or

      -doc #{equiv => add(One, Two, [])}.
      --spec add(One :: number(), Two :: number()) -> number().
      -add(One, Two) -> add(One, Two, []).
      -add(One, Two, Options) -> ...

      The entry into the EEP-48 doc chunk metadata is +Func/Arity, Func(Args) or a unicode string. For example:

      -doc #{equiv => add/3}.
      +add(One, Two) -> add(One, Two, []).
      +add(One, Two, Options) -> ...

      or

      -doc #{equiv => add(One, Two, [])}.
      +-spec add(One :: number(), Two :: number()) -> number().
      +add(One, Two) -> add(One, Two, []).
      +add(One, Two, Options) -> ...

      The entry into the EEP-48 doc chunk metadata is the value converted to a string.

    • exported => boolean() - A boolean/0 signifying if the entry is exported or not. This value is automatically set by the compiler and should not be set by the user.

    @@ -264,20 +264,20 @@

    The doc signature is a short text shown to describe the function and its arguments. By default it is determined by looking at the names of the arguments in the --spec or function. For example:

    add(One, Two) -> One + Two.
    +-spec or function. For example:

    add(One, Two) -> One + Two.
     
    --spec sub(One :: integer(), Two :: integer()) -> integer().
    -sub(X, Y) -> X - Y.

    will have a signature of add(One, Two) and sub(One, Two).

    For types or callbacks, the signature is derived from the type or callback -specification. For example:

    -type number(Value) :: {number, Value}.
    +-spec sub(One :: integer(), Two :: integer()) -> integer().
    +sub(X, Y) -> X - Y.

    will have a signature of add(One, Two) and sub(One, Two).

    For types or callbacks, the signature is derived from the type or callback +specification. For example:

    -type number(Value) :: {number, Value}.
     %% signature will be `number(Value)`
     
    --opaque number() :: {number, number()}.
    +-opaque number() :: {number, number()}.
     %% signature will be `number()`
     
    --callback increment(In :: number()) -> Out.
    +-callback increment(In :: number()) -> Out.
     %% signature will be `increment(In)`
     
    --callback increment(In) -> Out when In :: number().
    +-callback increment(In) -> Out when In :: number().
     %% signature will be `increment(In)`

    If it is not possible to "easily" figure out a nice signature from the code, the MFA syntax is used instead. For example: add/2, number/1, increment/1

    It is possible to supply a custom signature by placing it as the first line of the -doc attribute. The provided signature must be in the form of a function @@ -286,7 +286,7 @@ Adds two numbers. """. -add(A, B) -> A + B.

    Will create the signature add(One, Two). The signature will be removed from the +add(A, B) -> A + B.

    Will create the signature add(One, Two). The signature will be removed from the documentation string, so in the example above only the text "Adds two numbers" will be part of the documentation. This works for functions, types, and callbacks.

    A pattern has the same structure as a term but can contain unbound variables.

    Example:

    Name1
    -[H|T]
    -{error,Reason}

    Patterns are allowed in clause heads, case expressions, +[H|T] +{error,Reason}

    Patterns are allowed in clause heads, case expressions, receive expressions, and match expressions.

    @@ -182,13 +182,13 @@

    If Pattern1 and Pattern2 are valid patterns, the following is also a valid pattern:

    Pattern1 = Pattern2

    When matched against a term, both Pattern1 and Pattern2 are matched against -the term. The idea behind this feature is to avoid reconstruction of terms.

    Example:

    f({connect,From,To,Number,Options}, To) ->
    -    Signal = {connect,From,To,Number,Options},
    +the term. The idea behind this feature is to avoid reconstruction of terms.

    Example:

    f({connect,From,To,Number,Options}, To) ->
    +    Signal = {connect,From,To,Number,Options},
         ...;
    -f(Signal, To) ->
    -    ignore.

    can instead be written as

    f({connect,_,To,_,_} = Signal, To) ->
    +f(Signal, To) ->
    +    ignore.

    can instead be written as

    f({connect,_,To,_,_} = Signal, To) ->
         ...;
    -f(Signal, To) ->
    +f(Signal, To) ->
         ignore.

    The compound pattern operator does not imply that its operands are matched in any particular order. That means that it is not legal to bind a variable in Pattern1 and use it in Pattern2, or vice versa.

    @@ -197,15 +197,15 @@ String Prefix in Patterns

    -

    When matching strings, the following is a valid pattern:

    f("prefix" ++ Str) -> ...

    This is syntactic sugar for the equivalent, but harder to read:

    f([$p,$r,$e,$f,$i,$x | Str]) -> ...

    +

    When matching strings, the following is a valid pattern:

    f("prefix" ++ Str) -> ...

    This is syntactic sugar for the equivalent, but harder to read:

    f([$p,$r,$e,$f,$i,$x | Str]) -> ...

    Expressions in Patterns

    An arithmetic expression can be used within a pattern if it meets both of the -following two conditions:

    • It uses only numeric or bitwise operators.
    • Its value can be evaluated to a constant when complied.

    Example:

    case {Value, Result} of
    -    {?THRESHOLD+1, ok} -> ...

    +following two conditions:

    • It uses only numeric or bitwise operators.
    • Its value can be evaluated to a constant when complied.

    Example:

    case {Value, Result} of
    +    {?THRESHOLD+1, ok} -> ...

    @@ -213,15 +213,15 @@

    The following matches Pattern against Expr:

    Pattern = Expr

    If the matching succeeds, any unbound variable in the pattern becomes bound and the value of Expr is returned.

    If multiple match operators are applied in sequence, they will be evaluated from -right to left.

    If the matching fails, a badmatch run-time error occurs.

    Examples:

    1> {A, B} = T = {answer, 42}.
    -{answer,42}
    +right to left.

    If the matching fails, a badmatch run-time error occurs.

    Examples:

    1> {A, B} = T = {answer, 42}.
    +{answer,42}
     2> A.
     answer
     3> B.
     42
     4> T.
    -{answer,42}
    -5> {C, D} = [1, 2].
    +{answer,42}
    +5> {C, D} = [1, 2].
     ** exception error: no match of right-hand side value [1,2]

    Because multiple match operators are evaluated from right to left, it means that:

    Pattern1 = Pattern2 = . . . = PatternN = Expression

    is equivalent to:

    Temporary = Expression,
     PatternN = Temporary,
    @@ -243,20 +243,20 @@
     compound pattern matches if all of its constituent patterns match. It is not
     legal for a pattern that is part of a compound pattern to use variables (as keys
     in map patterns or sizes in binary patterns) bound in other sub patterns of the
    -same compound pattern.

    Examples:

    1> fun(#{Key := Value} = #{key := Key}) -> Value end.
    +same compound pattern.

    Examples:

    1> fun(#{Key := Value} = #{key := Key}) -> Value end.
     * 1:7: variable 'Key' is unbound
    -2> F = fun({A, B} = E) -> {E, A + B} end, F({1,2}).
    -{{1,2},3}
    -3> G = fun(<<A:8,B:8>> = <<C:16>>) -> {A, B, C} end, G(<<42,43>>).
    -{42,43,10795}

    The match operator is allowed everywhere an expression is allowed. It is used +2> F = fun({A, B} = E) -> {E, A + B} end, F({1,2}). +{{1,2},3} +3> G = fun(<<A:8,B:8>> = <<C:16>>) -> {A, B, C} end, G(<<42,43>>). +{42,43,10795}

    The match operator is allowed everywhere an expression is allowed. It is used to match the value of an expression to a pattern. If multiple match operators -are applied in sequence, they will be evaluated from right to left.

    Examples:

    1> M = #{key => key2, key2 => value}.
    -#{key => key2,key2 => value}
    -2> f(Key), #{Key := Value} = #{key := Key} = M, Value.
    +are applied in sequence, they will be evaluated from right to left.

    Examples:

    1> M = #{key => key2, key2 => value}.
    +#{key => key2,key2 => value}
    +2> f(Key), #{Key := Value} = #{key := Key} = M, Value.
     value
    -3> f(Key), #{Key := Value} = (#{key := Key} = M), Value.
    +3> f(Key), #{Key := Value} = (#{key := Key} = M), Value.
     value
    -4> f(Key), (#{Key := Value} = #{key := Key}) = M, Value.
    +4> f(Key), (#{Key := Value} = #{key := Key}) = M, Value.
     * 1:12: variable 'Key' is unbound
     5> <<X:Y>> = begin Y = 8, <<42:8>> end, X.
     42

    The expression at prompt 2> first matches the value of variable M against @@ -280,22 +280,22 @@ Function Calls -

    ExprF(Expr1,...,ExprN)
    -ExprM:ExprF(Expr1,...,ExprN)

    In the first form of function calls, ExprM:ExprF(Expr1,...,ExprN), each of +

    ExprF(Expr1,...,ExprN)
    +ExprM:ExprF(Expr1,...,ExprN)

    In the first form of function calls, ExprM:ExprF(Expr1,...,ExprN), each of ExprM and ExprF must be an atom or an expression that evaluates to an atom. The function is said to be called by using the fully qualified function name. -This is often referred to as a remote or external function call.

    Example:

    lists:keyfind(Name, 1, List)

    In the second form of function calls, ExprF(Expr1,...,ExprN), ExprF must be +This is often referred to as a remote or external function call.

    Example:

    lists:keyfind(Name, 1, List)

    In the second form of function calls, ExprF(Expr1,...,ExprN), ExprF must be an atom or evaluate to a fun.

    If ExprF is an atom, the function is said to be called by using the implicitly qualified function name. If the function ExprF is locally defined, it is called. Alternatively, if ExprF is explicitly imported from the M module, M:ExprF(Expr1,...,ExprN) is called. If ExprF is neither declared locally nor explicitly imported, ExprF must be the name of an automatically -imported BIF.

    Examples:

    handle(Msg, State)
    -spawn(m, init, [])

    Examples where ExprF is a fun:

    1> Fun1 = fun(X) -> X+1 end,
    -Fun1(3).
    +imported BIF.

    Examples:

    handle(Msg, State)
    +spawn(m, init, [])

    Examples where ExprF is a fun:

    1> Fun1 = fun(X) -> X+1 end,
    +Fun1(3).
     4
    -2> fun lists:append/2([1,2], [3,4]).
    -[1,2,3,4]
    +2> fun lists:append/2([1,2], [3,4]).
    +[1,2,3,4]
     3>

    Notice that when calling a local function, there is a difference between using the implicitly or fully qualified function name. The latter always refers to the latest version of the module. See @@ -320,32 +320,32 @@ (ERTS version 5.8) and have an implicitly qualified call to that function in your code, you either need to explicitly remove the auto-import using a compiler directive, or replace the call with a fully qualified function call. Otherwise -you get a compilation error. See the following example:

    -export([length/1,f/1]).
    +you get a compilation error. See the following example:

    -export([length/1,f/1]).
     
    --compile({no_auto_import,[length/1]}). % erlang:length/1 no longer autoimported
    +-compile({no_auto_import,[length/1]}). % erlang:length/1 no longer autoimported
     
    -length([]) ->
    +length([]) ->
         0;
    -length([H|T]) ->
    -    1 + length(T). %% Calls the local function length/1
    +length([H|T]) ->
    +    1 + length(T). %% Calls the local function length/1
     
    -f(X) when erlang:length(X) > 3 -> %% Calls erlang:length/1,
    +f(X) when erlang:length(X) > 3 -> %% Calls erlang:length/1,
                                       %% which is allowed in guards
         long.

    The same logic applies to explicitly imported functions from other modules, as to locally defined functions. It is not allowed to both import a function from -another module and have the function declared in the module at the same time:

    -export([f/1]).
    +another module and have the function declared in the module at the same time:

    -export([f/1]).
     
    --compile({no_auto_import,[length/1]}). % erlang:length/1 no longer autoimported
    +-compile({no_auto_import,[length/1]}). % erlang:length/1 no longer autoimported
     
    --import(mod,[length/1]).
    +-import(mod,[length/1]).
     
    -f(X) when erlang:length(X) > 33 -> %% Calls erlang:length/1,
    +f(X) when erlang:length(X) > 33 -> %% Calls erlang:length/1,
                                        %% which is allowed in guards
     
    -    erlang:length(X);              %% Explicit call to erlang:length in body
    +    erlang:length(X);              %% Explicit call to erlang:length in body
     
    -f(X) ->
    -    length(X).                     %% mod:length/1 is called

    For auto-imported BIFs added in Erlang/OTP R14A and thereafter, overriding the +f(X) -> + length(X). %% mod:length/1 is called

    For auto-imported BIFs added in Erlang/OTP R14A and thereafter, overriding the name with a local function or explicit import is always allowed. However, if the -compile({no_auto_import,[F/A]) directive is not used, the compiler issues a warning whenever the function is called in the module using the implicitly @@ -365,7 +365,7 @@ sequence GuardSeq that evaluates to true is found. Then the corresponding /usr/share/doc/packages/erlang27-doc/doc/system/features.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1111)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/features.html 2026-06-04 19:05:00.509432382 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/features.html 2026-06-04 19:05:00.509432382 +0000 @@ -239,7 +239,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/doc/system/funs.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (2205)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/funs.html 2026-06-04 19:05:00.534432614 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/funs.html 2026-06-04 19:05:00.535432623 +0000 @@ -121,14 +121,14 @@ map -

    The following function, double, doubles every element in a list:

    double([H|T]) -> [2*H|double(T)];
    -double([])    -> [].

    Hence, the argument entered as input is doubled as follows:

    > double([1,2,3,4]).
    -[2,4,6,8]

    The following function, add_one, adds one to every element in a list:

    add_one([H|T]) -> [H+1|add_one(T)];
    -add_one([])    -> [].

    The functions double and add_one have a similar structure. This can be used -by writing a function map that expresses this similarity:

    map(F, [H|T]) -> [F(H)|map(F, T)];
    -map(F, [])    -> [].

    The functions double and add_one can now be expressed in terms of map as -follows:

    double(L)  -> map(fun(X) -> 2*X end, L).
    -add_one(L) -> map(fun(X) -> 1 + X end, L).

    map(F, List) is a function that takes a function F and a list L as +

    The following function, double, doubles every element in a list:

    double([H|T]) -> [2*H|double(T)];
    +double([])    -> [].

    Hence, the argument entered as input is doubled as follows:

    > double([1,2,3,4]).
    +[2,4,6,8]

    The following function, add_one, adds one to every element in a list:

    add_one([H|T]) -> [H+1|add_one(T)];
    +add_one([])    -> [].

    The functions double and add_one have a similar structure. This can be used +by writing a function map that expresses this similarity:

    map(F, [H|T]) -> [F(H)|map(F, T)];
    +map(F, [])    -> [].

    The functions double and add_one can now be expressed in terms of map as +follows:

    double(L)  -> map(fun(X) -> 2*X end, L).
    +add_one(L) -> map(fun(X) -> 1 + X end, L).

    map(F, List) is a function that takes a function F and a list L as arguments and returns a new list, obtained by applying F to each of the elements in L.

    The process of abstracting out the common features of a number of different programs is called procedural abstraction. Procedural abstraction can be used @@ -142,21 +142,21 @@ foreach

    This section illustrates procedural abstraction. Initially, the following two -examples are written as conventional functions.

    This function prints all elements of a list onto a stream:

    print_list(Stream, [H|T]) ->
    -    io:format(Stream, "~p~n", [H]),
    -    print_list(Stream, T);
    -print_list(Stream, []) ->
    -    true.

    This function broadcasts a message to a list of processes:

    broadcast(Msg, [Pid|Pids]) ->
    +examples are written as conventional functions.

    This function prints all elements of a list onto a stream:

    print_list(Stream, [H|T]) ->
    +    io:format(Stream, "~p~n", [H]),
    +    print_list(Stream, T);
    +print_list(Stream, []) ->
    +    true.

    This function broadcasts a message to a list of processes:

    broadcast(Msg, [Pid|Pids]) ->
         Pid ! Msg,
    -    broadcast(Msg, Pids);
    -broadcast(_, []) ->
    +    broadcast(Msg, Pids);
    +broadcast(_, []) ->
         true.

    These two functions have a similar structure. They both iterate over a list and do something to each element in the list. The "something" is passed on as an -extra argument to the function that does this.

    The function foreach expresses this similarity:

    foreach(F, [H|T]) ->
    -    F(H),
    -    foreach(F, T);
    -foreach(F, []) ->
    -    ok.

    Using the function foreach, the function print_list becomes:

    foreach(fun(H) -> io:format(S, "~p~n",[H]) end, L)

    Using the function foreach, the function broadcast becomes:

    foreach(fun(Pid) -> Pid ! M end, L)

    foreach is evaluated for its side-effect and not its value. foreach(Fun ,L) +extra argument to the function that does this.

    The function foreach expresses this similarity:

    foreach(F, [H|T]) ->
    +    F(H),
    +    foreach(F, T);
    +foreach(F, []) ->
    +    ok.

    Using the function foreach, the function print_list becomes:

    foreach(fun(H) -> io:format(S, "~p~n",[H]) end, L)

    Using the function foreach, the function broadcast becomes:

    foreach(fun(Pid) -> Pid ! M end, L)

    foreach is evaluated for its side-effect and not its value. foreach(Fun ,L) calls Fun(X) for each element X in L and the processing occurs in the order that the elements were defined in L. map does not define the order in which its elements are processed.

    @@ -166,24 +166,24 @@ Syntax of Funs

    Funs are written with the following syntax (see -Fun Expressions for full description):

    F = fun (Arg1, Arg2, ... ArgN) ->
    +Fun Expressions for full description):

    F = fun (Arg1, Arg2, ... ArgN) ->
             ...
         end

    This creates an anonymous function of N arguments and binds it to the variable F.

    Another function, FunctionName, written in the same module, can be passed as an argument, using the following syntax:

    F = fun FunctionName/Arity

    With this form of function reference, the function that is referred to does not need to be exported from the module.

    It is also possible to refer to a function defined in a different module, with -the following syntax:

    F = fun Module:FunctionName/Arity

    In this case, the function must be exported from the module in question.

    The following program illustrates the different ways of creating funs:

    -module(fun_test).
    --export([t1/0, t2/0]).
    --import(lists, [map/2]).
    -
    -t1() -> map(fun(X) -> 2 * X end, [1,2,3,4,5]).
    -
    -t2() -> map(fun double/1, [1,2,3,4,5]).
    -
    -double(X) -> X * 2.

    The fun F can be evaluated with the following syntax:

    F(Arg1, Arg2, ..., Argn)

    To check whether a term is a fun, use the test -is_function/1 in a guard.

    Example:

    f(F, Args) when is_function(F) ->
    -   apply(F, Args);
    -f(N, _) when is_integer(N) ->
    +the following syntax:

    F = fun Module:FunctionName/Arity

    In this case, the function must be exported from the module in question.

    The following program illustrates the different ways of creating funs:

    -module(fun_test).
    +-export([t1/0, t2/0]).
    +-import(lists, [map/2]).
    +
    +t1() -> map(fun(X) -> 2 * X end, [1,2,3,4,5]).
    +
    +t2() -> map(fun double/1, [1,2,3,4,5]).
    +
    +double(X) -> X * 2.

    The fun F can be evaluated with the following syntax:

    F(Arg1, Arg2, ..., Argn)

    To check whether a term is a fun, use the test +is_function/1 in a guard.

    Example:

    f(F, Args) when is_function(F) ->
    +   apply(F, Args);
    +f(N, _) when is_integer(N) ->
        N.

    Funs are a distinct type. The BIFs erlang:fun_info/1,2 can be used to retrieve information about a fun, and the BIF erlang:fun_to_list/1 returns a textual representation of a fun. The check_process_code/2 @@ -196,18 +196,18 @@

    The scope rules for variables that occur in funs are as follows:

    • All variables that occur in the head of a fun are assumed to be "fresh" variables.
    • Variables that are defined before the fun, and that occur in function calls or -guard tests within the fun, have the values they had outside the fun.
    • Variables cannot be exported from a fun.

    The following examples illustrate these rules:

    print_list(File, List) ->
    -    {ok, Stream} = file:open(File, write),
    -    foreach(fun(X) -> io:format(Stream,"~p~n",[X]) end, List),
    -    file:close(Stream).

    Here, the variable X, defined in the head of the fun, is a new variable. The +guard tests within the fun, have the values they had outside the fun.

  • Variables cannot be exported from a fun.
  • The following examples illustrate these rules:

    print_list(File, List) ->
    +    {ok, Stream} = file:open(File, write),
    +    foreach(fun(X) -> io:format(Stream,"~p~n",[X]) end, List),
    +    file:close(Stream).

    Here, the variable X, defined in the head of the fun, is a new variable. The variable Stream, which is used within the fun, gets its value from the file:open line.

    As any variable that occurs in the head of a fun is considered a new variable, -it is equally valid to write as follows:

    print_list(File, List) ->
    -    {ok, Stream} = file:open(File, write),
    -    foreach(fun(File) ->
    -                io:format(Stream,"~p~n",[File])
    -            end, List),
    -    file:close(Stream).

    Here, File is used as the new variable instead of X. This is not so wise +it is equally valid to write as follows:

    print_list(File, List) ->
    +    {ok, Stream} = file:open(File, write),
    +    foreach(fun(File) ->
    +                io:format(Stream,"~p~n",[File])
    +            end, List),
    +    file:close(Stream).

    Here, File is used as the new variable instead of X. This is not so wise because code in the fun body cannot refer to the variable File, which is defined outside of the fun. Compiling this example gives the following diagnostic:

    ./FileName.erl:Line: Warning: variable 'File'
    @@ -216,20 +216,20 @@
     pattern matching operations must be moved into guard expressions and cannot be
     written in the head of the fun. For example, you might write the following code
     if you intend the first clause of F to be evaluated when the value of its
    -argument is Y:

    f(...) ->
    +argument is Y:

    f(...) ->
         Y = ...
    -    map(fun(X) when X == Y ->
    +    map(fun(X) when X == Y ->
                  ;
    -           (_) ->
    +           (_) ->
                  ...
    -        end, ...)
    -    ...

    instead of writing the following code:

    f(...) ->
    +        end, ...)
    +    ...

    instead of writing the following code:

    f(...) ->
         Y = ...
    -    map(fun(Y) ->
    +    map(fun(Y) ->
                  ;
    -           (_) ->
    +           (_) ->
                  ...
    -        end, ...)
    +        end, ...)
         ...

    @@ -243,58 +243,58 @@ map

    -

    lists:map/2 takes a function of one argument and a list of terms:

    map(F, [H|T]) -> [F(H)|map(F, T)];
    -map(F, [])    -> [].

    It returns the list obtained by applying the function to every argument in the +

    lists:map/2 takes a function of one argument and a list of terms:

    map(F, [H|T]) -> [F(H)|map(F, T)];
    +map(F, [])    -> [].

    It returns the list obtained by applying the function to every argument in the list.

    When a new fun is defined in the shell, the value of the fun is printed as -Fun#<erl_eval>:

    > Double = fun(X) -> 2 * X end.
    +Fun#<erl_eval>:

    > Double = fun(X) -> 2 * X end.
     #Fun<erl_eval.6.72228031>
    -> lists:map(Double, [1,2,3,4,5]).
    -[2,4,6,8,10]

    +> lists:map(Double, [1,2,3,4,5]). +[2,4,6,8,10]

    any

    -

    lists:any/2 takes a predicate P of one argument and a list of terms:

    any(Pred, [H|T]) ->
    -    case Pred(H) of
    +

    lists:any/2 takes a predicate P of one argument and a list of terms:

    any(Pred, [H|T]) ->
    +    case Pred(H) of
             true  ->  true;
    -        false ->  any(Pred, T)
    +        false ->  any(Pred, T)
         end;
    -any(Pred, []) ->
    +any(Pred, []) ->
         false.

    A predicate is a function that returns true or false. any is true if there is a term X in the list such that P(X) is true.

    A predicate Big(X) is defined, which is true if its argument is greater that -10:

    > Big =  fun(X) -> if X > 10 -> true; true -> false end end.
    +10:

    > Big =  fun(X) -> if X > 10 -> true; true -> false end end.
     #Fun<erl_eval.6.72228031>
    -> lists:any(Big, [1,2,3,4]).
    +> lists:any(Big, [1,2,3,4]).
     false
    -> lists:any(Big, [1,2,3,12,5]).
    +> lists:any(Big, [1,2,3,12,5]).
     true

    /usr/share/doc/packages/erlang27-doc/doc/system/gen_server_concepts.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1297)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/gen_server_concepts.html 2026-06-04 19:05:00.557432827 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/gen_server_concepts.html 2026-06-04 19:05:00.558432837 +0000 @@ -161,40 +161,40 @@

    An example of a simple server written in plain Erlang is provided in Overview. The server can be reimplemented using -gen_server, resulting in this callback module:

    -module(ch3).
    --behaviour(gen_server).
    +gen_server, resulting in this callback module:

    -module(ch3).
    +-behaviour(gen_server).
     
    --export([start_link/0]).
    --export([alloc/0, free/1]).
    --export([init/1, handle_call/3, handle_cast/2]).
    +-export([start_link/0]).
    +-export([alloc/0, free/1]).
    +-export([init/1, handle_call/3, handle_cast/2]).
     
    -start_link() ->
    -    gen_server:start_link({local, ch3}, ch3, [], []).
    +start_link() ->
    +    gen_server:start_link({local, ch3}, ch3, [], []).
     
    -alloc() ->
    -    gen_server:call(ch3, alloc).
    +alloc() ->
    +    gen_server:call(ch3, alloc).
     
    -free(Ch) ->
    -    gen_server:cast(ch3, {free, Ch}).
    +free(Ch) ->
    +    gen_server:cast(ch3, {free, Ch}).
     
    -init(_Args) ->
    -    {ok, channels()}.
    +init(_Args) ->
    +    {ok, channels()}.
     
    -handle_call(alloc, _From, Chs) ->
    -    {Ch, Chs2} = alloc(Chs),
    -    {reply, Ch, Chs2}.
    +handle_call(alloc, _From, Chs) ->
    +    {Ch, Chs2} = alloc(Chs),
    +    {reply, Ch, Chs2}.
     
    -handle_cast({free, Ch}, Chs) ->
    -    Chs2 = free(Ch, Chs),
    -    {noreply, Chs2}.

    The code is explained in the next sections.

    +handle_cast({free, Ch}, Chs) -> + Chs2 = free(Ch, Chs), + {noreply, Chs2}.

    The code is explained in the next sections.

    Starting a Gen_Server

    In the example in the previous section, gen_server is started by calling -ch3:start_link():

    start_link() ->
    -    gen_server:start_link({local, ch3}, ch3, [], []) => {ok, Pid}

    start_link/0 calls function gen_server:start_link/4. This function +ch3:start_link():

    start_link() ->
    +    gen_server:start_link({local, ch3}, ch3, [], []) => {ok, Pid}

    start_link/0 calls function gen_server:start_link/4. This function spawns and links to a new process, a gen_server.

    • The first argument, {local, ch3}, specifies the name. The gen_server is then locally registered as ch3.

      If the name is omitted, the gen_server is not registered. Instead its pid must be used. The name can also be given as {global, Name}, in which case @@ -208,8 +208,8 @@ for the available options.

    If name registration succeeds, the new gen_server process calls the callback function ch3:init([]). init is expected to return {ok, State}, where State is the internal state of the gen_server. In this case, the state is -the available channels.

    init(_Args) ->
    -    {ok, channels()}.

    gen_server:start_link/4 is synchronous. It does not return until the +the available channels.

    init(_Args) ->
    +    {ok, channels()}.

    gen_server:start_link/4 is synchronous. It does not return until the gen_server has been initialized and is ready to receive requests.

    gen_server:start_link/4 must be used if the gen_server is part of a supervision tree, meaning that it was started by a supervisor. There is another function, gen_server:start/4, to start a standalone @@ -225,9 +225,9 @@ When the request is received, the gen_server calls handle_call(Request, From, State), which is expected to return a tuple {reply,Reply,State1}. Reply is the reply that is to be sent back -to the client, and State1 is a new value for the state of the gen_server.

    handle_call(alloc, _From, Chs) ->
    -    {Ch, Chs2} = alloc(Chs),
    -    {reply, Ch, Chs2}.

    In this case, the reply is the allocated channel Ch and the new state is the +to the client, and State1 is a new value for the state of the gen_server.

    handle_call(alloc, _From, Chs) ->
    +    {Ch, Chs2} = alloc(Chs),
    +    {reply, Ch, Chs2}.

    In this case, the reply is the allocated channel Ch and the new state is the set of remaining available channels Chs2.

    Thus, the call ch3:alloc() returns the allocated channel Ch and the gen_server then waits for new requests, now with an updated list of available channels.

    @@ -236,13 +236,13 @@ Asynchronous Requests - Cast

    -

    The asynchronous request free(Ch) is implemented using gen_server:cast/2:

    free(Ch) ->
    -    gen_server:cast(ch3, {free, Ch}).

    ch3 is the name of the gen_server. {free, Ch} is the actual request.

    The request is made into a message and sent to the gen_server. +

    The asynchronous request free(Ch) is implemented using gen_server:cast/2:

    free(Ch) ->
    +    gen_server:cast(ch3, {free, Ch}).

    ch3 is the name of the gen_server. {free, Ch} is the actual request.

    The request is made into a message and sent to the gen_server. cast, and thus free, then returns ok.

    When the request is received, the gen_server calls handle_cast(Request, State), which is expected to return a tuple -{noreply,State1}. State1 is a new value for the state of the gen_server.

    handle_cast({free, Ch}, Chs) ->
    -    Chs2 = free(Ch, Chs),
    -    {noreply, Chs2}.

    In this case, the new state is the updated list of available channels Chs2. +{noreply,State1}. State1 is a new value for the state of the gen_server.

    handle_cast({free, Ch}, Chs) ->
    +    Chs2 = free(Ch, Chs),
    +    {noreply, Chs2}.

    In this case, the new state is the updated list of available channels Chs2. The gen_server is now ready for new requests.

    @@ -261,15 +261,15 @@ set in the supervisor.

    If it is necessary to clean up before termination, the shutdown strategy must be a time-out value and the gen_server must be set to trap exit signals in function init. When ordered to shutdown, the gen_server then calls -the callback function terminate(shutdown, State):

    init(Args) ->
    +the callback function terminate(shutdown, State):

    init(Args) ->
         ...,
    -    process_flag(trap_exit, true),
    +    process_flag(trap_exit, true),
         ...,
    -    {ok, State}.
    +    {ok, State}.
     
     ...
     
    -terminate(shutdown, State) ->
    +terminate(shutdown, State) ->
         %% Code for cleaning up here
         ...
         ok.

    @@ -280,21 +280,21 @@

    If the gen_server is not part of a supervision tree, a stop function can be useful, for example:

    ...
    -export([stop/0]).
    +export([stop/0]).
     ...
     
    -stop() ->
    -    gen_server:cast(ch3, stop).
    +stop() ->
    +    gen_server:cast(ch3, stop).
     ...
     
    -handle_cast(stop, State) ->
    -    {stop, normal, State};
    -handle_cast({free, Ch}, State) ->
    +handle_cast(stop, State) ->
    +    {stop, normal, State};
    +handle_cast({free, Ch}, State) ->
         ...
     
     ...
     
    -terminate(normal, State) ->
    +terminate(normal, State) ->
         ok.

    The callback function handling the stop request returns a tuple {stop,normal,State1}, where normal specifies that it is a normal termination and State1 is a new value for the state @@ -309,13 +309,13 @@ the callback function handle_info(Info, State) must be implemented to handle them. Examples of other messages are exit messages, if the gen_server is linked to other processes than the supervisor -and it is trapping exit signals.

    handle_info({'EXIT', Pid, Reason}, State) ->
    +and it is trapping exit signals.

    handle_info({'EXIT', Pid, Reason}, State) ->
         %% Code to handle exits here.
         ...
    -    {noreply, State1}.

    The final function to implement is code_change/3:

    code_change(OldVsn, State, Extra) ->
    +    {noreply, State1}.

    The final function to implement is code_change/3:

    code_change(OldVsn, State, Extra) ->
         %% Code to convert state (and more) during code change.
         ...
    -    {ok, NewState}.
    +
    {ok, NewState}.
    @@ -366,7 +366,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/doc/system/getting_started.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (331)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/getting_started.html 2026-06-04 19:05:00.576433004 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/getting_started.html 2026-06-04 19:05:00.577433013 +0000 @@ -185,7 +185,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/doc/system/included_applications.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (931)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/included_applications.html 2026-06-04 19:05:00.594433171 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/included_applications.html 2026-06-04 19:05:00.595433180 +0000 @@ -165,16 +165,16 @@ Specifying Included Applications

    Which applications to include is defined by the included_applications key in -the .app file:

    {application, prim_app,
    - [{description, "Tree application"},
    -  {vsn, "1"},
    -  {modules, [prim_app_cb, prim_app_sup, prim_app_server]},
    -  {registered, [prim_app_server]},
    -  {included_applications, [incl_app]},
    -  {applications, [kernel, stdlib, sasl]},
    -  {mod, {prim_app_cb,[]}},
    -  {env, [{file, "/usr/local/log"}]}
    - ]}.

    +the .app file:

    {application, prim_app,
    + [{description, "Tree application"},
    +  {vsn, "1"},
    +  {modules, [prim_app_cb, prim_app_sup, prim_app_server]},
    +  {registered, [prim_app_server]},
    +  {included_applications, [incl_app]},
    +  {applications, [kernel, stdlib, sasl]},
    +  {mod, {prim_app_cb,[]}},
    +  {env, [{file, "/usr/local/log"}]}
    + ]}.

    @@ -188,27 +188,27 @@ term.

    The value of the mod key of the including application must be set to {application_starter,[Module,StartArgs]}, where Module as usual is the application callback module. StartArgs is a term provided as argument to the -callback function Module:start/2:

    {application, prim_app,
    - [{description, "Tree application"},
    -  {vsn, "1"},
    -  {modules, [prim_app_cb, prim_app_sup, prim_app_server]},
    -  {registered, [prim_app_server]},
    -  {included_applications, [incl_app]},
    -  {start_phases, [{init,[]}, {go,[]}]},
    -  {applications, [kernel, stdlib, sasl]},
    -  {mod, {application_starter,[prim_app_cb,[]]}},
    -  {env, [{file, "/usr/local/log"}]}
    - ]}.
    -
    -{application, incl_app,
    - [{description, "Included application"},
    -  {vsn, "1"},
    -  {modules, [incl_app_cb, incl_app_sup, incl_app_server]},
    -  {registered, []},
    -  {start_phases, [{go,[]}]},
    -  {applications, [kernel, stdlib, sasl]},
    -  {mod, {incl_app_cb,[]}}
    - ]}.

    When starting a primary application with included applications, the primary +callback function Module:start/2:

    {application, prim_app,
    + [{description, "Tree application"},
    +  {vsn, "1"},
    +  {modules, [prim_app_cb, prim_app_sup, prim_app_server]},
    +  {registered, [prim_app_server]},
    +  {included_applications, [incl_app]},
    +  {start_phases, [{init,[]}, {go,[]}]},
    +  {applications, [kernel, stdlib, sasl]},
    +  {mod, {application_starter,[prim_app_cb,[]]}},
    +  {env, [{file, "/usr/local/log"}]}
    + ]}.
    +
    +{application, incl_app,
    + [{description, "Included application"},
    +  {vsn, "1"},
    +  {modules, [incl_app_cb, incl_app_sup, incl_app_server]},
    +  {registered, []},
    +  {start_phases, [{go,[]}]},
    +  {applications, [kernel, stdlib, sasl]},
    +  {mod, {incl_app_cb,[]}}
    + ]}.

    When starting a primary application with included applications, the primary application is started the normal way, that is:

    • The application controller creates an application master for the application
    • The application master calls Module:start(normal, StartArgs) to start the top supervisor.

    Then, for the primary application and each included application in top-down, left-to-right order, the application master calls @@ -221,11 +221,11 @@ of specified phases must be a subset of the set of phases specified for the primary application.

    When starting prim_app as defined above, the application controller calls the following callback functions before application:start(prim_app) returns a -value:

    application:start(prim_app)
    - => prim_app_cb:start(normal, [])
    - => prim_app_cb:start_phase(init, normal, [])
    - => prim_app_cb:start_phase(go, normal, [])
    - => incl_app_cb:start_phase(go, normal, [])
    +value:

    application:start(prim_app)
    + => prim_app_cb:start(normal, [])
    + => prim_app_cb:start_phase(init, normal, [])
    + => prim_app_cb:start_phase(go, normal, [])
    + => incl_app_cb:start_phase(go, normal, [])
     ok
    @@ -277,7 +277,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/doc/system/install-cross.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (542)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/install-cross.html 2026-06-04 19:05:00.614433356 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/install-cross.html 2026-06-04 19:05:00.614433356 +0000 @@ -488,7 +488,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/doc/system/install-win32.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (579)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/install-win32.html 2026-06-04 19:05:00.633433532 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/install-win32.html 2026-06-04 19:05:00.633433532 +0000 @@ -299,7 +299,7 @@

    and sometimes

    $ cd $ERL_TOP
     $ make local_setup
     

    So now when you run $ERL_TOP/erl.exe, you should have a debug compiled -emulator, which you will see if you do a:

    1> erlang:system_info(system_version).

    in the erlang shell. If the returned string contains [debug], you +emulator, which you will see if you do a:

    1> erlang:system_info(system_version).

    in the erlang shell. If the returned string contains [debug], you got a debug compiled emulator.

    To hack the erlang libraries, you simply do a make opt in the specific "applications" directory, like:

    $ cd $ERL_TOP/lib/stdlib
     $ make opt
    @@ -322,11 +322,11 @@
     

    Remember that:

    • Windows specific C-code goes in the $ERL_TOP/erts/emulator/sys/win32, $ERL_TOP/erts/emulator/drivers/win32 or $ERL_TOP/erts/etc/win32.

    • Windows specific erlang code should be used conditionally and the host OS tested in runtime, the exactly same beam files should be -distributed for every platform! So write code like:

      case os:type() of
      -    {win32,_} ->
      -        do_windows_specific();
      +distributed for every platform! So write code like:

      case os:type() of
      +    {win32,_} ->
      +        do_windows_specific();
           Other ->
      -        do_fallback_or_exit()
      +        do_fallback_or_exit()
       end,

    That's basically all you need to get going.

    @@ -435,7 +435,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/doc/system/install.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (888)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/install.html 2026-06-04 19:05:00.659433774 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/install.html 2026-06-04 19:05:00.659433774 +0000 @@ -661,7 +661,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/doc/system/installation_guide.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/system/installation_guide.html 2026-06-04 19:05:00.676433931 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/installation_guide.html 2026-06-04 19:05:00.676433931 +0000 @@ -175,7 +175,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/doc/system/list_comprehensions.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (2031)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/list_comprehensions.html 2026-06-04 19:05:00.696434117 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/list_comprehensions.html 2026-06-04 19:05:00.696434117 +0000 @@ -121,25 +121,25 @@ Simple Examples

    -

    This section starts with a simple example, showing a generator and a filter:

    > [X || X <- [1,2,a,3,4,b,5,6], X > 3].
    -[a,4,b,5,6]

    This is read as follows: The list of X such that X is taken from the list +

    This section starts with a simple example, showing a generator and a filter:

    > [X || X <- [1,2,a,3,4,b,5,6], X > 3].
    +[a,4,b,5,6]

    This is read as follows: The list of X such that X is taken from the list [1,2,a,...] and X is greater than 3.

    The notation X <- [1,2,a,...] is a generator and the expression X > 3 is a filter.

    An additional filter, is_integer(X), can be added to -restrict the result to integers:

    > [X || X <- [1,2,a,3,4,b,5,6], is_integer(X), X > 3].
    -[4,5,6]

    Generators can be combined. For example, the Cartesian product of two lists can -be written as follows:

    > [{X, Y} || X <- [1,2,3], Y <- [a,b]].
    -[{1,a},{1,b},{2,a},{2,b},{3,a},{3,b}]

    +restrict the result to integers:

    > [X || X <- [1,2,a,3,4,b,5,6], is_integer(X), X > 3].
    +[4,5,6]

    Generators can be combined. For example, the Cartesian product of two lists can +be written as follows:

    > [{X, Y} || X <- [1,2,3], Y <- [a,b]].
    +[{1,a},{1,b},{2,a},{2,b},{3,a},{3,b}]

    Quick Sort

    -

    The well-known quick sort routine can be written as follows:

    sort([]) -> [];
    -sort([_] = L) -> L;
    -sort([Pivot|T]) ->
    -    sort([ X || X <- T, X < Pivot]) ++
    -    [Pivot] ++
    -    sort([ X || X <- T, X >= Pivot]).

    The expression [X || X <- T, X < Pivot] is the list of all elements in T +

    The well-known quick sort routine can be written as follows:

    sort([]) -> [];
    +sort([_] = L) -> L;
    +sort([Pivot|T]) ->
    +    sort([ X || X <- T, X < Pivot]) ++
    +    [Pivot] ++
    +    sort([ X || X <- T, X >= Pivot]).

    The expression [X || X <- T, X < Pivot] is the list of all elements in T that are less than Pivot.

    [X || X <- T, X >= Pivot] is the list of all elements in T that are greater than or equal to Pivot.

    With the algorithm above, a list is sorted as follows:

    • A list with zero or one element is trivially sorted.
    • For lists with more than one element:
      1. The first element in the list is isolated as the pivot element.
      2. The remaining list is partitioned into two sublists, such that:
      • The first sublist contains all elements that are smaller than the pivot element.
      • The second sublist contains all elements that are greater than or equal to @@ -155,11 +155,11 @@ Permutations -

        The following example generates all permutations of the elements in a list:

        perms([]) -> [[]];
        -perms(L)  -> [[H|T] || H <- L, T <- perms(L--[H])].

        This takes H from L in all possible ways. The result is the set of all lists +

        The following example generates all permutations of the elements in a list:

        perms([]) -> [[]];
        +perms(L)  -> [[H|T] || H <- L, T <- perms(L--[H])].

        This takes H from L in all possible ways. The result is the set of all lists [H|T], where T is the set of all possible permutations of L, with H -removed:

        > perms([b,u,g]).
        -[[b,u,g],[b,g,u],[u,b,g],[u,g,b],[g,b,u],[g,u,b]]

        +removed:

        > perms([b,u,g]).
        +[[b,u,g],[b,g,u],[u,b,g],[u,g,b],[g,b,u],[g,u,b]]

        @@ -168,47 +168,47 @@

        Pythagorean triplets are sets of integers {A,B,C} such that A**2 + B**2 = C**2.

        The function pyth(N) generates a list of all integers {A,B,C} such that A**2 + B**2 = C**2 and where the sum of the sides is equal to, or less than, -N:

        pyth(N) ->
        -    [ {A,B,C} ||
        -        A <- lists:seq(1,N),
        -        B <- lists:seq(1,N),
        -        C <- lists:seq(1,N),
        +N:

        pyth(N) ->
        +    [ {A,B,C} ||
        +        A <- lists:seq(1,N),
        +        B <- lists:seq(1,N),
        +        C <- lists:seq(1,N),
                 A+B+C =< N,
                 A*A+B*B == C*C
        -    ].
        > pyth(3).
        -[].
        -> pyth(11).
        -[].
        -> pyth(12).
        -[{3,4,5},{4,3,5}]
        -> pyth(50).
        -[{3,4,5},
        - {4,3,5},
        - {5,12,13},
        - {6,8,10},
        - {8,6,10},
        - {8,15,17},
        - {9,12,15},
        - {12,5,13},
        - {12,9,15},
        - {12,16,20},
        - {15,8,17},
        - {16,12,20}]

        The following code reduces the search space and is more efficient:

        pyth1(N) ->
        -   [{A,B,C} ||
        -       A <- lists:seq(1,N-2),
        -       B <- lists:seq(A+1,N-1),
        -       C <- lists:seq(B+1,N),
        +    ].
        > pyth(3).
        +[].
        +> pyth(11).
        +[].
        +> pyth(12).
        +[{3,4,5},{4,3,5}]
        +> pyth(50).
        +[{3,4,5},
        + {4,3,5},
        + {5,12,13},
        + {6,8,10},
        + {8,6,10},
        + {8,15,17},
        + {9,12,15},
        + {12,5,13},
        + {12,9,15},
        + {12,16,20},
        + {15,8,17},
        + {16,12,20}]

        The following code reduces the search space and is more efficient:

        pyth1(N) ->
        +   [{A,B,C} ||
        +       A <- lists:seq(1,N-2),
        +       B <- lists:seq(A+1,N-1),
        +       C <- lists:seq(B+1,N),
                A+B+C =< N,
        -       A*A+B*B == C*C ].

        + A*A+B*B == C*C ].

        Simplifications With List Comprehensions

        As an example, list comprehensions can be used to simplify some of the functions -in lists.erl:

        append(L)   ->  [X || L1 <- L, X <- L1].
        -map(Fun, L) -> [Fun(X) || X <- L].
        -filter(Pred, L) -> [X || X <- L, Pred(X)].

        +in lists.erl:

        append(L)   ->  [X || L1 <- L, X <- L1].
        +map(Fun, L) -> [Fun(X) || X <- L].
        +filter(Pred, L) -> [X || X <- L, Pred(X)].

        @@ -220,20 +220,20 @@ which selects certain elements from a list of tuples. Suppose you write select(X, L) -> [Y || {X, Y} <- L]. with the intention of extracting all tuples from L, where the first item is X.

        Compiling this gives the following diagnostic:

        ./FileName.erl:Line: Warning: variable 'X' shadowed in generate

        This diagnostic warns that the variable X in the pattern is not the same as -the variable X that occurs in the function head.

        Evaluating select gives the following result:

        > select(b,[{a,1},{b,2},{c,3},{b,7}]).
        -[1,2,3,7]

        This is not the wanted result. To achieve the desired effect, select must be -written as follows:

        select(X, L) ->  [Y || {X1, Y} <- L, X == X1].

        The generator now contains unbound variables and the test has been moved into -the filter.

        This now works as expected:

        > select(b,[{a,1},{b,2},{c,3},{b,7}]).
        -[2,7]

        Also note that a variable in a generator pattern will shadow a variable with the -same name bound in a previous generator pattern. For example:

        > [{X,Y} || X <- [1,2,3], X=Y <- [a,b,c]].
        -[{a,a},{b,b},{c,c},{a,a},{b,b},{c,c},{a,a},{b,b},{c,c}]

        A consequence of the rules for importing variables into a list comprehensions is +the variable X that occurs in the function head.

        Evaluating select gives the following result:

        > select(b,[{a,1},{b,2},{c,3},{b,7}]).
        +[1,2,3,7]

        This is not the wanted result. To achieve the desired effect, select must be +written as follows:

        select(X, L) ->  [Y || {X1, Y} <- L, X == X1].

        The generator now contains unbound variables and the test has been moved into +the filter.

        This now works as expected:

        > select(b,[{a,1},{b,2},{c,3},{b,7}]).
        +[2,7]

        Also note that a variable in a generator pattern will shadow a variable with the +same name bound in a previous generator pattern. For example:

        > [{X,Y} || X <- [1,2,3], X=Y <- [a,b,c]].
        +[{a,a},{b,b},{c,c},{a,a},{b,b},{c,c},{a,a},{b,b},{c,c}]

        A consequence of the rules for importing variables into a list comprehensions is that certain pattern matching operations must be moved into the filters and -cannot be written directly in the generators.

        To illustrate this, do not write as follows:

        f(...) ->
        +cannot be written directly in the generators.

        To illustrate this, do not write as follows:

        f(...) ->
             Y = ...
        -    [ Expression || PatternInvolving Y  <- Expr, ...]
        -    ...

        Instead, write as follows:

        f(...) ->
        +    [ Expression || PatternInvolving Y  <- Expr, ...]
        +    ...

        Instead, write as follows:

        f(...) ->
             Y = ...
        -    [ Expression || PatternInvolving Y1  <- Expr, Y == Y1, ...]
        +    [ Expression || PatternInvolving Y1  <- Expr, Y == Y1, ...]
             ...
        @@ -285,7 +285,7 @@ Erlang programming language

        -

        Copyright © 1996-2026 Ericsson AB

        +

        Copyright © 1996-2042 Ericsson AB

        /usr/share/doc/packages/erlang27-doc/doc/system/listhandling.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1446)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/listhandling.html 2026-06-04 19:05:00.717434312 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/listhandling.html 2026-06-04 19:05:00.717434312 +0000 @@ -124,47 +124,47 @@

        Lists can only be built starting from the end and attaching list elements at the beginning. If you use the ++ operator as follows, a new list is created that is a copy of the elements in List1, followed by List2:

        List1 ++ List2

        Looking at how lists:append/2 or ++ would be implemented in plain Erlang, -clearly the first list is copied:

        append([H|T], Tail) ->
        -    [H|append(T, Tail)];
        -append([], Tail) ->
        +clearly the first list is copied:

        append([H|T], Tail) ->
        +    [H|append(T, Tail)];
        +append([], Tail) ->
             Tail.

        When recursing and building a list, it is important to ensure that you attach the new elements to the beginning of the list. In this way, you will build one -list, not hundreds or thousands of copies of the growing result list.

        Let us first see how it is not to be done:

        DO NOT

        bad_fib(N) ->
        -    bad_fib(N, 0, 1, []).
        +list, not hundreds or thousands of copies of the growing result list.

        Let us first see how it is not to be done:

        DO NOT

        bad_fib(N) ->
        +    bad_fib(N, 0, 1, []).
         
        -bad_fib(0, _Current, _Next, Fibs) ->
        +bad_fib(0, _Current, _Next, Fibs) ->
             Fibs;
        -bad_fib(N, Current, Next, Fibs) ->
        -    bad_fib(N - 1, Next, Current + Next, Fibs ++ [Current]).

        Here more than one list is built. In each iteration step a new list is created +bad_fib(N, Current, Next, Fibs) -> + bad_fib(N - 1, Next, Current + Next, Fibs ++ [Current]).

        Here more than one list is built. In each iteration step a new list is created that is one element longer than the new previous list.

        To avoid copying the result in each iteration, build the list in reverse order -and reverse the list when you are done:

        DO

        tail_recursive_fib(N) ->
        -    tail_recursive_fib(N, 0, 1, []).
        +and reverse the list when you are done:

        DO

        tail_recursive_fib(N) ->
        +    tail_recursive_fib(N, 0, 1, []).
         
        -tail_recursive_fib(0, _Current, _Next, Fibs) ->
        -    lists:reverse(Fibs);
        -tail_recursive_fib(N, Current, Next, Fibs) ->
        -    tail_recursive_fib(N - 1, Next, Current + Next, [Current|Fibs]).

        +tail_recursive_fib(0, _Current, _Next, Fibs) -> + lists:reverse(Fibs); +tail_recursive_fib(N, Current, Next, Fibs) -> + tail_recursive_fib(N - 1, Next, Current + Next, [Current|Fibs]).

        List Comprehensions

        -

        A list comprehension:

        [Expr(E) || E <- List]

        is basically translated to a local function:

        'lc^0'([E|Tail], Expr) ->
        -    [Expr(E)|'lc^0'(Tail, Expr)];
        -'lc^0'([], _Expr) -> [].

        If the result of the list comprehension will obviously not be used, a list -will not be constructed. For example, in this code:

        [io:put_chars(E) || E <- List],
        +

        A list comprehension:

        [Expr(E) || E <- List]

        is basically translated to a local function:

        'lc^0'([E|Tail], Expr) ->
        +    [Expr(E)|'lc^0'(Tail, Expr)];
        +'lc^0'([], _Expr) -> [].

        If the result of the list comprehension will obviously not be used, a list +will not be constructed. For example, in this code:

        [io:put_chars(E) || E <- List],
         ok.

        or in this code:

        case Var of
             ... ->
        -        [io:put_chars(E) || E <- List];
        +        [io:put_chars(E) || E <- List];
             ... ->
         end,
        -some_function(...),

        the value is not assigned to a variable, not passed to another function, and not +some_function(...),

        the value is not assigned to a variable, not passed to another function, and not returned. This means that there is no need to construct a list and the compiler -will simplify the code for the list comprehension to:

        'lc^0'([E|Tail], Expr) ->
        -    Expr(E),
        -    'lc^0'(Tail, Expr);
        -'lc^0'([], _Expr) -> [].

        The compiler also understands that assigning to _ means that the value will -not be used. Therefore, the code in the following example will also be optimized:

        _ = [io:put_chars(E) || E <- List],
        +will simplify the code for the list comprehension to:

        'lc^0'([E|Tail], Expr) ->
        +    Expr(E),
        +    'lc^0'(Tail, Expr);
        +'lc^0'([], _Expr) -> [].

        The compiler also understands that assigning to _ means that the value will +not be used. Therefore, the code in the following example will also be optimized:

        _ = [io:put_chars(E) || E <- List],
         ok.

        @@ -177,11 +177,11 @@ to flatten the list before sending it to the port.

      • When calling BIFs that accept deep lists, such as list_to_binary/1 or iolist_to_binary/1.
      • When you know that your list is only one level deep. Use lists:append/1 -instead.

      Examples:

      DO

      port_command(Port, DeepList)

      DO NOT

      port_command(Port, lists:flatten(DeepList))

      A common way to send a zero-terminated string to a port is the following:

      DO NOT

      TerminatedStr = String ++ [0],
      -port_command(Port, TerminatedStr)

      Instead:

      DO

      TerminatedStr = [String, 0],
      -port_command(Port, TerminatedStr)

      DO

      1> lists:append([[1], [2], [3]]).
      -[1,2,3]

      DO NOT

      1> lists:flatten([[1], [2], [3]]).
      -[1,2,3]

      +instead.

    Examples:

    DO

    port_command(Port, DeepList)

    DO NOT

    port_command(Port, lists:flatten(DeepList))

    A common way to send a zero-terminated string to a port is the following:

    DO NOT

    TerminatedStr = String ++ [0],
    +port_command(Port, TerminatedStr)

    Instead:

    DO

    TerminatedStr = [String, 0],
    +port_command(Port, TerminatedStr)

    DO

    1> lists:append([[1], [2], [3]]).
    +[1,2,3]

    DO NOT

    1> lists:flatten([[1], [2], [3]]).
    +[1,2,3]

    @@ -189,17 +189,17 @@

    There are two basic ways to write a function that traverses a list and produces a new list.

    The first way is writing a body-recursive function:

    %% Add 42 to each integer in the list.
    -add_42_body([H|T]) ->
    -    [H + 42 | add_42_body(T)];
    -add_42_body([]) ->
    -    [].

    The second way is writing a tail-recursive function:

    %% Add 42 to each integer in the list.
    -add_42_tail(List) ->
    -    add_42_tail(List, []).
    -
    -add_42_tail([H|T], Acc) ->
    -    add_42_tail(T, [H + 42 | Acc]);
    -add_42_tail([], Acc) ->
    -    lists:reverse(Acc).

    In early version of Erlang the tail-recursive function would typically +add_42_body([H|T]) -> + [H + 42 | add_42_body(T)]; +add_42_body([]) -> + [].

    The second way is writing a tail-recursive function:

    %% Add 42 to each integer in the list.
    +add_42_tail(List) ->
    +    add_42_tail(List, []).
    +
    +add_42_tail([H|T], Acc) ->
    +    add_42_tail(T, [H + 42 | Acc]);
    +add_42_tail([], Acc) ->
    +    lists:reverse(Acc).

    In early version of Erlang the tail-recursive function would typically be more efficient. In modern versions of Erlang, there is usually not much difference in performance between a body-recursive list function and tail-recursive function that reverses the list at the end. Therefore, @@ -210,11 +210,11 @@ function that does not construct a list runs in constant space, while the corresponding body-recursive function uses stack space proportional to the length of the list.

    For example, a function that sums a list of integers, is not to be written as -follows:

    DO NOT

    recursive_sum([H|T]) -> H+recursive_sum(T);
    -recursive_sum([])    -> 0.

    Instead:

    DO

    sum(L) -> sum(L, 0).
    +follows:

    DO NOT

    recursive_sum([H|T]) -> H+recursive_sum(T);
    +recursive_sum([])    -> 0.

    Instead:

    DO

    sum(L) -> sum(L, 0).
     
    -sum([H|T], Sum) -> sum(T, Sum + H);
    -sum([], Sum)    -> Sum.
    +
    sum([H|T], Sum) -> sum(T, Sum + H); +sum([], Sum) -> Sum.
    @@ -265,7 +265,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/doc/system/macros.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1348)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/macros.html 2026-06-04 19:05:00.738434507 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/macros.html 2026-06-04 19:05:00.738434507 +0000 @@ -121,8 +121,8 @@ File Inclusion -

    A file can be included as follows:

    -include(File).
    --include_lib(File).

    File, a string, is to point out a file. The contents of this file are included +

    A file can be included as follows:

    -include(File).
    +-include_lib(File).

    File, a string, is to point out a file. The contents of this file are included as is, at the position of the directive.

    Include files are typically used for record and macro definitions that are shared by several modules. It is recommended to use the file name extension .hrl for include files.

    File can start with a path component $VAR, for some string VAR. If that is @@ -131,12 +131,12 @@ $VAR is left as is.

    If the filename File is absolute (possibly after variable substitution), the include file with that name is included. Otherwise, the specified file is searched for in the following directories, and in this order:

    1. The current working directory
    2. The directory where the module is being compiled
    3. The directories given by the include option

    For details, see erlc in ERTS and -compile in Compiler.

    Examples:

    -include("my_records.hrl").
    --include("incdir/my_records.hrl").
    --include("/home/user/proj/my_records.hrl").
    --include("$PROJ_ROOT/my_records.hrl").

    include_lib is similar to include, but is not to point out an absolute file. +compile in Compiler.

    Examples:

    -include("my_records.hrl").
    +-include("incdir/my_records.hrl").
    +-include("/home/user/proj/my_records.hrl").
    +-include("$PROJ_ROOT/my_records.hrl").

    include_lib is similar to include, but is not to point out an absolute file. Instead, the first path component (possibly after variable substitution) is -assumed to be the name of an application.

    Example:

    -include_lib("kernel/include/file.hrl").

    The code server uses code:lib_dir(kernel) to find the directory of the current +assumed to be the name of an application.

    Example:

    -include_lib("kernel/include/file.hrl").

    The code server uses code:lib_dir(kernel) to find the directory of the current (latest) version of Kernel, and then the subdirectory include is searched for the file file.hrl.

    @@ -144,25 +144,25 @@ Defining and Using Macros

    -

    A macro is defined as follows:

    -define(Const, Replacement).
    --define(Func(Var1,...,VarN), Replacement).

    A macro definition can be placed anywhere among the attributes and function +

    A macro is defined as follows:

    -define(Const, Replacement).
    +-define(Func(Var1,...,VarN), Replacement).

    A macro definition can be placed anywhere among the attributes and function declarations of a module, but the definition must come before any usage of the macro.

    If a macro is used in several modules, it is recommended that the macro definition is placed in an include file.

    A macro is used as follows:

    ?Const
     ?Func(Arg1,...,ArgN)

    Macros are expanded during compilation. A simple macro ?Const is replaced with -Replacement.

    Example:

    -define(TIMEOUT, 200).
    +Replacement.

    Example:

    -define(TIMEOUT, 200).
     ...
    -call(Request) ->
    -    server:call(refserver, Request, ?TIMEOUT).

    This is expanded to:

    call(Request) ->
    -    server:call(refserver, Request, 200).

    A macro ?Func(Arg1,...,ArgN) is replaced with Replacement, where all +call(Request) -> + server:call(refserver, Request, ?TIMEOUT).

    This is expanded to:

    call(Request) ->
    +    server:call(refserver, Request, 200).

    A macro ?Func(Arg1,...,ArgN) is replaced with Replacement, where all occurrences of a variable Var from the macro definition are replaced with the -corresponding argument Arg.

    Example:

    -define(MACRO1(X, Y), {a, X, b, Y}).
    +corresponding argument Arg.

    Example:

    -define(MACRO1(X, Y), {a, X, b, Y}).
     ...
    -bar(X) ->
    -    ?MACRO1(a, b),
    -    ?MACRO1(X, 123)

    This is expanded to:

    bar(X) ->
    -    {a,a,b,b},
    -    {a,X,b,123}.

    It is good programming practice, but not mandatory, to ensure that a macro +bar(X) -> + ?MACRO1(a, b), + ?MACRO1(X, 123)

    This is expanded to:

    bar(X) ->
    +    {a,a,b,b},
    +    {a,X,b,123}.

    It is good programming practice, but not mandatory, to ensure that a macro definition is a valid Erlang syntactic form.

    To view the result of macro expansion, a module can be compiled with the 'P' option. compile:file(File, ['P']). This produces a listing of the parsed code after preprocessing and parse transforms, in the file File.P.

    @@ -189,21 +189,21 @@

    It is possible to overload macros, except for predefined macros. An overloaded macro has more than one definition, each with a different number of arguments.

    Change

    Support for overloading of macros was added in Erlang 5.7.5/OTP R13B04.

    A macro ?Func(Arg1,...,ArgN) with a (possibly empty) list of arguments results in an error message if there is at least one definition of Func with -arguments, but none with N arguments.

    Assuming these definitions:

    -define(F0(), c).
    --define(F1(A), A).
    --define(C, m:f).

    the following does not work:

    f0() ->
    +arguments, but none with N arguments.

    Assuming these definitions:

    -define(F0(), c).
    +-define(F1(A), A).
    +-define(C, m:f).

    the following does not work:

    f0() ->
         ?F0. % No, an empty list of arguments expected.
     
    -f1(A) ->
    -    ?F1(A, A). % No, exactly one argument expected.

    On the other hand,

    f() ->
    -    ?C().

    is expanded to

    f() ->
    -    m:f().

    +f1(A) -> + ?F1(A, A). % No, exactly one argument expected.

    On the other hand,

    f() ->
    +    ?C().

    is expanded to

    f() ->
    +    m:f().

    Removing a macro definition

    -

    A definition of macro can be removed as follows:

    -undef(Macro).

    +

    A definition of macro can be removed as follows:

    -undef(Macro).

    @@ -223,13 +223,13 @@ elif also supports calling the psuedo-function defined(Name), which tests whether the Name argument is the name of a previously defined macro. defined(Name) evaluates to true if the macro is defined and false -otherwise. An attempt to call other functions results in a compilation error.

    Example:

    -module(m).
    +otherwise. An attempt to call other functions results in a compilation error.

    Example:

    -module(m).
     ...
     
    --ifdef(debug).
    --define(LOG(X), io:format("{~p,~p}: ~p~n", [?MODULE,?LINE,X])).
    +-ifdef(debug).
    +-define(LOG(X), io:format("{~p,~p}: ~p~n", [?MODULE,?LINE,X])).
     -else.
    --define(LOG(X), true).
    +-define(LOG(X), true).
     -endif.
     
     ...

    When trace output is desired, debug is to be defined when the module m is @@ -237,21 +237,21 @@ or -1> c(m, {d, debug}). -{ok,m}

    ?LOG(Arg) is then expanded to a call to io:format/2 and provide the user -with some simple trace output.

    Example:

    -module(m)
    +1> c(m, {d, debug}).
    +{ok,m}

    ?LOG(Arg) is then expanded to a call to io:format/2 and provide the user +with some simple trace output.

    Example:

    -module(m)
     ...
    --if(?OTP_RELEASE >= 25).
    +-if(?OTP_RELEASE >= 25).
     %% Code that will work in OTP 25 or higher
    --elif(?OTP_RELEASE >= 26).
    +-elif(?OTP_RELEASE >= 26).
     %% Code that will work in OTP 26 or higher
     -else.
     %% Code that will work in OTP 24 or lower.
     -endif.
     ...

    This code uses the OTP_RELEASE macro to conditionally select code depending on -release.

    Example:

    -module(m)
    +release.

    Example:

    -module(m)
     ...
    --if(?OTP_RELEASE >= 26 andalso defined(debug)).
    +-if(?OTP_RELEASE >= 26 andalso defined(debug)).
     %% Debugging code that requires OTP 26 or later.
     -else.
     %% Non-debug code that works in any release.
    @@ -274,23 +274,23 @@
       
       -error() and -warning() directives
     

    -

    The directive -error(Term) causes a compilation error.

    Example:

    -module(t).
    --export([version/0]).
    +

    The directive -error(Term) causes a compilation error.

    Example:

    -module(t).
    +-export([version/0]).
     
    --ifdef(VERSION).
    -version() -> ?VERSION.
    +-ifdef(VERSION).
    +version() -> ?VERSION.
     -else.
    --error("Macro VERSION must be defined.").
    -version() -> "".
    +-error("Macro VERSION must be defined.").
    +version() -> "".
     -endif.

    The error message will look like this:

    % erlc t.erl
    -t.erl:7: -error("Macro VERSION must be defined.").

    The directive -warning(Term) causes a compilation warning.

    Example:

    -module(t).
    --export([version/0]).
    +t.erl:7: -error("Macro VERSION must be defined.").

    The directive -warning(Term) causes a compilation warning.

    Example:

    -module(t).
    +-export([version/0]).
     
    --ifndef(VERSION).
    --warning("Macro VERSION not defined -- using default version.").
    --define(VERSION, "0").
    +-ifndef(VERSION).
    +-warning("Macro VERSION not defined -- using default version.").
    +-define(VERSION, "0").
     -endif.
    -version() -> ?VERSION.

    The warning message will look like this:

    % erlc t.erl
    +version() -> ?VERSION.

    The warning message will look like this:

    % erlc t.erl
     t.erl:5: Warning: -warning("Macro VERSION not defined -- using default version.").

    Change

    The -error() and -warning() directives were added in Erlang/OTP 19.

    @@ -299,11 +299,11 @@

    The construction ??Arg, where Arg is a macro argument, is expanded to a string containing the tokens of the argument. This is similar to the #arg -stringifying construction in C.

    Example:

    -define(TESTCALL(Call), io:format("Call ~s: ~w~n", [??Call, Call])).
    +stringifying construction in C.

    Example:

    -define(TESTCALL(Call), io:format("Call ~s: ~w~n", [??Call, Call])).
     
    -?TESTCALL(myfunction(1,2)),
    -?TESTCALL(you:function(2,1)).

    results in

    io:format("Call ~s: ~w~n",["myfunction ( 1 , 2 )",myfunction(1,2)]),
    -io:format("Call ~s: ~w~n",["you : function ( 2 , 1 )",you:function(2,1)]).

    That is, a trace output, with both the function called and the resulting value.

    +
    ?TESTCALL(myfunction(1,2)), +?TESTCALL(you:function(2,1)).

    results in

    io:format("Call ~s: ~w~n",["myfunction ( 1 , 2 )",myfunction(1,2)]),
    +io:format("Call ~s: ~w~n",["you : function ( 2 , 1 )",you:function(2,1)]).

    That is, a trace output, with both the function called and the resulting value.

    @@ -354,7 +354,7 @@ Erlang programming language /usr/share/doc/packages/erlang27-doc/doc/system/maps.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1567)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/maps.html 2026-06-04 19:05:00.761434720 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/maps.html 2026-06-04 19:05:00.767434776 +0000 @@ -152,8 +152,8 @@ values, sharing of keys between different instances of the map will be less effective, and it is not possible to match multiple elements having default values in one go.

  • To avoid having to deal with a map that may lack some keys, maps:merge/2 can -efficiently add multiple default values. For example:

    DefaultMap = #{shoe_size => 42, editor => emacs},
    -MapWithDefaultsApplied = maps:merge(DefaultMap, OtherMap)
  • +efficiently add multiple default values. For example:

    DefaultMap = #{shoe_size => 42, editor => emacs},
    +MapWithDefaultsApplied = maps:merge(DefaultMap, OtherMap)

    @@ -171,10 +171,10 @@ Using Maps as Sets

    Starting in OTP 24, the sets module has an option to represent sets as maps. -Examples:

    1> sets:new([{version,2}]).
    -#href_anchor"p" data-group-id="5170166299-4">}
    -2> sets:from_list([x,y,z], [{version,2}]).
    -#{x => [],y => [],z => []}

    sets backed by maps is generally the most efficient set representation, with a +Examples:

    1> sets:new([{version,2}]).
    +#href_anchor"p" data-group-id="2050939104-4">}
    +2> sets:from_list([x,y,z], [{version,2}]).
    +#{x => [],y => [],z => []}

    sets backed by maps is generally the most efficient set representation, with a few possible exceptions:

    • ordsets:intersection/2 can be more efficient than sets:intersection/2. If the intersection operation is frequently used and operations that operate on a single element in a set (such as is_element/2) are avoided, ordsets can @@ -207,10 +207,10 @@ allowing the key tuple to be shared with other instances of the map that have the same keys. In fact, the key tuple can be shared between all maps with the same keys with some care. To arrange that, define a function that returns a map. -For example:

      new() ->
      -    #{a => default, b => default, c => default}.

      Defined like this, the key tuple {a,b,c} will be a global literal. To ensure +For example:

      new() ->
      +    #{a => default, b => default, c => default}.

      Defined like this, the key tuple {a,b,c} will be a global literal. To ensure that the key tuple is shared when creating an instance of the map, always call -new() and modify the returned map:

          (SOME_MODULE:new())#{a := 42}.

      Using the map syntax with small maps is particularly efficient. As long as the +new() and modify the returned map:

          (SOME_MODULE:new())#{a := 42}.

      Using the map syntax with small maps is particularly efficient. As long as the keys are known at compile-time, the map is updated in one go, making the time to update a map essentially constant regardless of the number of keys updated. The same goes for matching. (When the keys are variables, one or more of the keys @@ -245,13 +245,13 @@

      Using the map syntax is usually slightly more efficient than using the corresponding function in the maps module.

      The gain in efficiency for the map syntax is more noticeable for the following -operations that can only be achieved using the map syntax:

      • Matching multiple literal keys
      • Updating multiple literal keys
      • Adding multiple literal keys to a map

      For example:

      DO

      Map = Map1#href_anchor"ss">x := X, y := Y, z := Z}

      DO NOT

      Map2 = maps:update(x, X, Map1),
      -Map3 = maps:update(y, Y, Map2),
      -Map = maps:update(z, Z, Map3)

      If the map is a small map, the first example runs roughly three times as fast.

      Note that for variable keys, the elements are updated sequentially from left to -right. For example, given the following update with variable keys:

      Map = Map1#{Key1 := X, Key2 := Y, Key3 := Z}

      the compiler rewrites it like this to ensure that the updates are applied from -left to right:

      Map2 = Map1#{Key1 := X},
      -Map3 = Map2#{Key2 := Y},
      -Map = Map3#{Key3 := Z}

      If a key is known to exist in a map, using the := operator is slightly more +operations that can only be achieved using the map syntax:

      • Matching multiple literal keys
      • Updating multiple literal keys
      • Adding multiple literal keys to a map

      For example:

      DO

      Map = Map1#href_anchor"ss">x := X, y := Y, z := Z}

      DO NOT

      Map2 = maps:update(x, X, Map1),
      +Map3 = maps:update(y, Y, Map2),
      +Map = maps:update(z, Z, Map3)

      If the map is a small map, the first example runs roughly three times as fast.

      Note that for variable keys, the elements are updated sequentially from left to +right. For example, given the following update with variable keys:

      Map = Map1#{Key1 := X, Key2 := Y, Key3 := Z}

      the compiler rewrites it like this to ensure that the updates are applied from +left to right:

      Map2 = Map1#{Key1 := X},
      +Map3 = Map2#{Key2 := Y},
      +Map = Map3#{Key3 := Z}

      If a key is known to exist in a map, using the := operator is slightly more efficient than using the => operator for a small map.

      @@ -310,15 +310,15 @@

      As an optimization, the compiler will rewrite a call to maps:get/3 to Erlang code similar to the following:

      Result = case Map of
      -             #{Key := Value} -> Value;
      -             #{} -> Default
      +             #{Key := Value} -> Value;
      +             #{} -> Default
                end

      This is reasonably efficient, but if a small map is used as an alternative to using a record it is often better not to rely on default values as it prevents sharing of keys, which may in the end use more memory than what you save from not storing default values in the map.

      If default values are nevertheless required, instead of calling maps:get/3 multiple times, consider putting the default values in a map and merging that -map with the other map:

      DefaultMap = #{Key1 => Value2, Key2 => Value2, ..., KeyN => ValueN},
      -MapWithDefaultsApplied = maps:merge(DefaultMap, OtherMap)

      This helps share keys between the default map and the one you applied defaults +map with the other map:

      DefaultMap = #{Key1 => Value2, Key2 => Value2, ..., KeyN => ValueN},
      +MapWithDefaultsApplied = maps:merge(DefaultMap, OtherMap)

      This helps share keys between the default map and the one you applied defaults to, as long as the default map contains all the keys that will ever be used and not just the ones with default values. Whether this is faster than calling maps:get/3 multiple times depends on the size of the map and the number of @@ -523,7 +523,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/doc/system/memory.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/system/memory.html 2026-06-04 19:05:00.785434942 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/memory.html 2026-06-04 19:05:00.785434942 +0000 @@ -222,7 +222,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/doc/system/misc.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (587)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/misc.html 2026-06-04 19:05:00.801435091 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/misc.html 2026-06-04 19:05:00.801435091 +0000 @@ -241,7 +241,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/doc/system/modules.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1097)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/modules.html 2026-06-04 19:05:00.819435258 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/modules.html 2026-06-04 19:05:00.819435258 +0000 @@ -122,12 +122,12 @@ Module Syntax

    Erlang code is divided into modules. A module consists of a sequence of -attributes and function declarations, each terminated by a period (.).

    Example:

    -module(m).          % module attribute
    --export([fact/1]).   % module attribute
    +attributes and function declarations, each terminated by a period (.).

    Example:

    -module(m).          % module attribute
    +-export([fact/1]).   % module attribute
     
    -fact(N) when N>0 ->  % beginning of function declaration
    -    N * fact(N-1);   %  |
    -fact(0) ->           %  |
    +fact(N) when N>0 ->  % beginning of function declaration
    +    N * fact(N-1);   %  |
    +fact(0) ->           %  |
         1.               % end of function declaration

    For a description of function declarations, see Function Declaration Syntax.

    @@ -180,9 +180,9 @@ Behaviour Module Attribute

    It is possible to specify that the module is the callback module for a -behaviour:

    -behaviour(Behaviour).

    The atom Behaviour gives the name of the behaviour, which can be a +behaviour:

    -behaviour(Behaviour).

    The atom Behaviour gives the name of the behaviour, which can be a user-defined behaviour or one of the following OTP standard behaviours:

    • gen_server
    • gen_statem
    • gen_event
    • supervisor

    The spelling behavior is also accepted.

    The callback functions of the module can be specified either directly by the -exported function behaviour_info/1:

    behaviour_info(callbacks) -> Callbacks.

    or by a -callback attribute for each callback function:

    -callback Name(Arguments) -> Result.

    Here, Arguments is a list of zero or more arguments. The -callback attribute +exported function behaviour_info/1:

    behaviour_info(callbacks) -> Callbacks.

    or by a -callback attribute for each callback function:

    -callback Name(Arguments) -> Result.

    Here, Arguments is a list of zero or more arguments. The -callback attribute is to be preferred since the extra type information can be used by tools to produce documentation or find discrepancies.

    Read more about behaviours and callback modules in OTP Design Principles.

    @@ -191,7 +191,7 @@ Record Definitions

    -

    The same syntax as for module attributes is used for record definitions:

    -record(Record, Fields).

    Record definitions are allowed anywhere in a module, also among the function +

    The same syntax as for module attributes is used for record definitions:

    -record(Record, Fields).

    Record definitions are allowed anywhere in a module, also among the function declarations. Read more in Records.

    @@ -199,15 +199,15 @@ Preprocessor

    The same syntax as for module attributes is used by the preprocessor, which -supports file inclusion, macros, and conditional compilation:

    -include("SomeFile.hrl").
    --define(Macro, Replacement).

    Read more in Preprocessor.

    +supports file inclusion, macros, and conditional compilation:

    -include("SomeFile.hrl").
    +-define(Macro, Replacement).

    Read more in Preprocessor.

    Setting File and Line

    The same syntax as for module attributes is used for changing the pre-defined -macros ?FILE and ?LINE:

    -file(File, Line).

    This attribute is used by tools, such as Yecc, to inform the compiler that the +macros ?FILE and ?LINE:

    -file(File, Line).

    This attribute is used by tools, such as Yecc, to inform the compiler that the source program is generated by another tool. It also indicates the correspondence of source files to lines of the original user-written file, from which the source program is produced.

    @@ -217,8 +217,8 @@ Types and function specifications

    A similar syntax as for module attributes is used for specifying types and -function specifications:

    -type my_type() :: atom() | integer().
    --spec my_function(integer()) -> integer().

    Read more in Types and Function specifications.

    The description is based on +function specifications:

    -type my_type() :: atom() | integer().
    +-spec my_function(integer()) -> integer().

    Read more in Types and Function specifications.

    The description is based on EEP8 - Types and function specifications, which is not to be further updated.

    @@ -227,16 +227,16 @@ Documentation attributes

    The module attribute -doc(Documentation) is used to provide user documentation -for a function/type/callback:

    -doc("Example documentation").
    -example() -> ok.

    The attribute should be placed just before the entity it documents.The +for a function/type/callback:

    -doc("Example documentation").
    +example() -> ok.

    The attribute should be placed just before the entity it documents.The parenthesis are optional around Documentation. The allowed values for Documentation are:

    • literal string or utf-8 encoded binary string - The string documenting the entity. Any literal string is allowed, so both triple quoted strings and sigils that translate to literal strings can be used. -The following examples are equivalent:

      -doc("Example \"docs\"").
      --doc(<<"Example \"docs\""/utf8>>).
      +The following examples are equivalent:

      -doc("Example \"docs\"").
      +-doc(<<"Example \"docs\""/utf8>>).
       -doc ~S/Example "docs"/.
       -doc """
          Example "docs"
      @@ -257,7 +257,7 @@
       
       

      While not a module attribute, but rather a directive (since it might affect syntax), there is the -feature(..) directive used for enabling and disabling -features.

      The syntax is similar to that of an attribute, but has two arguments:

      -feature(FeatureName, enable | disable).

      Note that the feature directive can only appear +features.

      The syntax is similar to that of an attribute, but has two arguments:

      -feature(FeatureName, enable | disable).

      Note that the feature directive can only appear in a prefix of the module.

      @@ -351,7 +351,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/doc/system/nif.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1558)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/nif.html 2026-06-04 19:05:00.837435425 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/nif.html 2026-06-04 19:05:00.837435425 +0000 @@ -137,18 +137,18 @@ they can also be used as fallback implementations for functions that do not have native implementations on some architectures.

      NIF libraries are loaded by calling erlang:load_nif/2, with the name of the shared library as argument. The second argument can be any term that will be -passed on to the library and used for initialization:

      -module(complex6).
      --export([foo/1, bar/1]).
      --nifs([foo/1, bar/1]).
      --on_load(init/0).
      -
      -init() ->
      -    ok = erlang:load_nif("./complex6_nif", 0).
      -
      -foo(_X) ->
      -    erlang:nif_error(nif_library_not_loaded).
      -bar(_Y) ->
      -    erlang:nif_error(nif_library_not_loaded).

      Here, the directive on_load is used to get function init to be automatically +passed on to the library and used for initialization:

      -module(complex6).
      +-export([foo/1, bar/1]).
      +-nifs([foo/1, bar/1]).
      +-on_load(init/0).
      +
      +init() ->
      +    ok = erlang:load_nif("./complex6_nif", 0).
      +
      +foo(_X) ->
      +    erlang:nif_error(nif_library_not_loaded).
      +bar(_Y) ->
      +    erlang:nif_error(nif_library_not_loaded).

      Here, the directive on_load is used to get function init to be automatically called when the module is loaded. If init returns anything other than ok, such when the loading of the NIF library fails in this example, the module is unloaded and calls to functions within it, fail.

      Loading the NIF library overrides the stub implementations and cause calls to @@ -169,35 +169,35 @@ API functions. The environment contains information about the calling Erlang process:

      #include <erl_nif.h>
       
      -extern int foo(int x);
      -extern int bar(int y);
      +extern int foo(int x);
      +extern int bar(int y);
       
      -static ERL_NIF_TERM foo_nif(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
      -{
      +static ERL_NIF_TERM foo_nif(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
      +{
           int x, ret;
      -    if (!enif_get_int(env, argv[0], &x)) {
      -	return enif_make_badarg(env);
      -    }
      -    ret = foo(x);
      -    return enif_make_int(env, ret);
      -}
      +    if (!enif_get_int(env, argv[0], &x)) {
      +	return enif_make_badarg(env);
      +    }
      +    ret = foo(x);
      +    return enif_make_int(env, ret);
      +}
       
      -static ERL_NIF_TERM bar_nif(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
      -{
      +static ERL_NIF_TERM bar_nif(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
      +{
           int y, ret;
      -    if (!enif_get_int(env, argv[0], &y)) {
      -	return enif_make_badarg(env);
      -    }
      -    ret = bar(y);
      -    return enif_make_int(env, ret);
      -}
      -
      -static ErlNifFunc nif_funcs[] = {
      -    {"foo", 1, foo_nif},
      -    {"bar", 1, bar_nif}
      -};
      +    if (!enif_get_int(env, argv[0], &y)) {
      +	return enif_make_badarg(env);
      +    }
      +    ret = bar(y);
      +    return enif_make_int(env, ret);
      +}
      +
      +static ErlNifFunc nif_funcs[] = {
      +    {"foo", 1, foo_nif},
      +    {"bar", 1, bar_nif}
      +};
       
      -ERL_NIF_INIT(complex6, nif_funcs, NULL, NULL, NULL, NULL)

      Here, ERL_NIF_INIT has the following arguments:

      • The first argument must be the name of the Erlang module as a C-identifier. It +ERL_NIF_INIT(complex6, nif_funcs, NULL, NULL, NULL, NULL)

      Here, ERL_NIF_INIT has the following arguments:

      • The first argument must be the name of the Erlang module as a C-identifier. It will be stringified by the macro.
      • The second argument is the array of ErlNifFunc structures containing name, arity, and function pointer of each NIF.
      • The remaining arguments are pointers to callback functions that can be used to initialize the library. They are not used in this simple example, hence they @@ -213,15 +213,15 @@

        Step 1. Compile the C code:

        unix> gcc -o complex6_nif.so -fpic -shared complex.c complex6_nif.c
         windows> cl -LD -MD -Fe complex6_nif.dll complex.c complex6_nif.c

        Step 2: Start Erlang and compile the Erlang code:

        > erl
        -Erlang R13B04 (erts-5.7.5) [64-bit] [smp:4:4] [rq:4] [async-threads:0] [kernel-poll:false]
        +Erlang R13B04 (erts-5.7.5) [64-bit] [smp:4:4] [rq:4] [async-threads:0] [kernel-poll:false]
         
        -Eshell V5.7.5  (abort with ^G)
        -1> c(complex6).
        -{ok,complex6}

        Step 3: Run the example:

        3> complex6:foo(3).
        +Eshell V5.7.5  (abort with ^G)
        +1> c(complex6).
        +{ok,complex6}

        Step 3: Run the example:

        3> complex6:foo(3).
         4
        -4> complex6:bar(5).
        +4> complex6:bar(5).
         10
        -5> complex6:foo("not an integer").
        +5> complex6:foo("not an integer").
         ** exception error: bad argument
              in function  complex6:foo/1
                 called as comlpex6:foo("not an integer")
        @@ -275,7 +275,7 @@ Erlang programming language

        -

        Copyright © 1996-2026 Ericsson AB

        +

        Copyright © 1996-2042 Ericsson AB

        /usr/share/doc/packages/erlang27-doc/doc/system/opaques.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1383)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/opaques.html 2026-06-04 19:05:00.854435582 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/opaques.html 2026-06-04 19:05:00.853435573 +0000 @@ -126,16 +126,16 @@ The runtime does not check opacity. Dialyzer provides some opacity-checking, but the rest is up to convention.

        This document explains what Erlang opacity is (and the trade-offs involved) via the example of the sets:set() data type. This type was -defined in the sets module like this:

        -opaque set(Element) :: #set{segs :: segs(Element)}.

        OTP 24 changed the definition to the following in -this commit.

        -opaque set(Element) :: #href_anchor"ss">set{segs :: segs(Element)} | #{Element => ?VALUE}.

        And this change was safer and more backwards-compatible than if the type had +defined in the sets module like this:

        -opaque set(Element) :: #set{segs :: segs(Element)}.

        OTP 24 changed the definition to the following in +this commit.

        -opaque set(Element) :: #href_anchor"ss">set{segs :: segs(Element)} | #{Element => ?VALUE}.

        And this change was safer and more backwards-compatible than if the type had been defined with -type instead of -opaque. Here is why: when a module defines an -opaque, the contract is that only the defining module should rely on the definition of the type: no other modules should rely on the definition.

        This means that code that pattern-matched on set as a record/tuple technically broke the contract, and opted in to being potentially broken when the definition of set() changed. Before OTP 24, this code printed ok. In OTP 24 it may -error:

        case sets:new() of
        -    Set when is_tuple(Set) ->
        -        io:format("ok")
        +error:

        case sets:new() of
        +    Set when is_tuple(Set) ->
        +        io:format("ok")
         end.

        When working with an opaque defined in another module, here are some recommendations:

        • Don't examine the underlying type using pattern-matching, guards, or functions that reveal the type, such as tuple_size/1 .
        • Instead, use functions provided by the module for working with the type. For @@ -209,7 +209,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/doc/system/otp-patch-apply.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (391)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/otp-patch-apply.html 2026-06-04 19:05:00.872435749 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/otp-patch-apply.html 2026-06-04 19:05:00.871435740 +0000 @@ -205,7 +205,7 @@ Application dependencies are verified among installed applications by otp_patch_apply, but these are not necessarily those actually loaded. By calling system_information:sanity_check() one can validate -dependencies among applications actually loaded.

          1> system_information:sanity_check().
          +dependencies among applications actually loaded.

          1> system_information:sanity_check().
           ok

          Please take a look at the reference of sanity_check() for more information.

          @@ -258,7 +258,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/doc/system/overview.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1064)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/overview.html 2026-06-04 19:05:00.888435898 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/overview.html 2026-06-04 19:05:00.888435898 +0000 @@ -311,7 +311,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/doc/system/patterns.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (531)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/patterns.html 2026-06-04 19:05:00.904436046 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/patterns.html 2026-06-04 19:05:00.904436046 +0000 @@ -132,10 +132,10 @@
          2 3> X + 1. 3 -4> {X, Y} = {1, 2}. +4> {X, Y} = {1, 2}. ** exception error: no match of right hand side value {1,2} -5> {X, Y} = {2, 3}. -{2,3} +5> {X, Y} = {2, 3}. +{2,3} 6> Y. 3
          @@ -188,7 +188,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/doc/system/ports.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (594)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/ports.html 2026-06-04 19:05:00.921436204 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/ports.html 2026-06-04 19:05:00.921436204 +0000 @@ -229,7 +229,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/doc/system/profiling.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1783)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/profiling.html 2026-06-04 19:05:00.940436380 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/profiling.html 2026-06-04 19:05:00.939436371 +0000 @@ -315,7 +315,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/doc/system/prog_ex_records.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1278)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/prog_ex_records.html 2026-06-04 19:05:00.959436557 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/prog_ex_records.html 2026-06-04 19:05:00.960436566 +0000 @@ -126,17 +126,17 @@ To illustrate these differences, suppose that you want to represent a person with the tuple {Name, Address, Phone}.

          To write functions that manipulate this data, remember the following:

          • The Name field is the first element of the tuple.
          • The Address field is the second element.
          • The Phone field is the third element.

          For example, to extract data from a variable P that contains such a tuple, you can write the following code and then use pattern matching to extract the -relevant fields:

          Name = element(1, P),
          -Address = element(2, P),
          +relevant fields:

          Name = element(1, P),
          +Address = element(2, P),
           ...

          Such code is difficult to read and understand, and errors occur if the numbering of the elements in the tuple is wrong. If the data representation of the fields is changed, by re-ordering, adding, or removing fields, all references to the person tuple must be checked and possibly modified.

          Records allow references to the fields by name, instead of by position. In the -following example, a record instead of a tuple is used to store the data:

          -record(person, {name, phone, address}).

          This enables references to the fields of the record by name. For example, if P +following example, a record instead of a tuple is used to store the data:

          -record(person, {name, phone, address}).

          This enables references to the fields of the record by name. For example, if P is a variable whose value is a person record, the following code access the name and address fields of the records:

          Name = P#person.name,
           Address = P#person.address,
          -...

          Internally, records are represented using tagged tuples:

          {person, Name, Phone, Address}

          +...

          Internally, records are represented using tagged tuples:

          {person, Name, Phone, Address}

          @@ -146,8 +146,8 @@ section. Three fields are included, name, phone, and address. The default values for name and phone is "" and [], respectively. The default value for address is the atom undefined, since no default value is supplied for this -field:

          -record(person, {name = "", phone = [], address}).

          The record must be defined in the shell to enable use of the record syntax in -the examples:

          > rd(person, {name = "", phone = [], address}).
          +field:

          -record(person, {name = "", phone = [], address}).

          The record must be defined in the shell to enable use of the record syntax in +the examples:

          > rd(person, {name = "", phone = [], address}).
           person

          This is because record definitions are only available at compile time, not at runtime. For details on records in the shell, see the shell manual page in STDLIB.

          @@ -156,10 +156,10 @@ Creating a Record

          -

          A new person record is created as follows:

          > #person{phone=[0,8,2,3,4,3,1,2], name="Robert"}.
          -#person{name = "Robert",phone = [0,8,2,3,4,3,1,2],address = undefined}

          As the address field was omitted, its default value is used.

          From Erlang 5.1/OTP R8B, a value to all fields in a record can be set with the -special field _. _ means "all fields not explicitly specified".

          Example:

          > #person{name = "Jakob", _ = '_'}.
          -#person{name = "Jakob",phone = '_',address = '_'}

          It is primarily intended to be used in ets:match/2 and +

          A new person record is created as follows:

          > #person{phone=[0,8,2,3,4,3,1,2], name="Robert"}.
          +#person{name = "Robert",phone = [0,8,2,3,4,3,1,2],address = undefined}

          As the address field was omitted, its default value is used.

          From Erlang 5.1/OTP R8B, a value to all fields in a record can be set with the +special field _. _ means "all fields not explicitly specified".

          Example:

          > #person{name = "Jakob", _ = '_'}.
          +#person{name = "Jakob",phone = '_',address = '_'}

          It is primarily intended to be used in ets:match/2 and mnesia:match_object/3, to set record fields to the atom '_'. (This is a wildcard in ets:match/2.)

          @@ -167,8 +167,8 @@ Accessing a Record Field

          -

          The following example shows how to access a record field:

          > P = #person{name = "Joe", phone = [0,8,2,3,4,3,1,2]}.
          -#person{name = "Joe",phone = [0,8,2,3,4,3,1,2],address = undefined}
          +

          The following example shows how to access a record field:

          > P = #person{name = "Joe", phone = [0,8,2,3,4,3,1,2]}.
          +#person{name = "Joe",phone = [0,8,2,3,4,3,1,2],address = undefined}
           > P#person.name.
           "Joe"

          @@ -176,33 +176,33 @@ Updating a Record

          -

          The following example shows how to update a record:

          > P1 = #person{name="Joe", phone=[1,2,3], address="A street"}.
          -#person{name = "Joe",phone = [1,2,3],address = "A street"}
          -> P2 = P1#person{name="Robert"}.
          -#person{name = "Robert",phone = [1,2,3],address = "A street"}

          +

          The following example shows how to update a record:

          > P1 = #person{name="Joe", phone=[1,2,3], address="A street"}.
          +#person{name = "Joe",phone = [1,2,3],address = "A street"}
          +> P2 = P1#person{name="Robert"}.
          +#person{name = "Robert",phone = [1,2,3],address = "A street"}

          Type Testing

          The following example shows that the guard succeeds if P is record of type -person:

          foo(P) when is_record(P, person) -> a_person;
          -foo(_) -> not_a_person.

          +person:

          foo(P) when is_record(P, person) -> a_person;
          +foo(_) -> not_a_person.

          Pattern Matching

          Matching can be used in combination with records, as shown in the following -example:

          > P3 = #person{name="Joe", phone=[0,0,7], address="A street"}.
          -#person{name = "Joe",phone = [0,0,7],address = "A street"}
          -> #person{name = Name} = P3, Name.
          +example:

          > P3 = #person{name="Joe", phone=[0,0,7], address="A street"}.
          +#person{name = "Joe",phone = [0,0,7],address = "A street"}
          +> #person{name = Name} = P3, Name.
           "Joe"

          The following function takes a list of person records and searches for the -phone number of a person with a particular name:

          find_phone([#person{name=Name, phone=Phone} | _], Name) ->
          -    {found,  Phone};
          -find_phone([_| T], Name) ->
          -    find_phone(T, Name);
          -find_phone([], Name) ->
          +phone number of a person with a particular name:

          find_phone([#person{name=Name, phone=Phone} | _], Name) ->
          +    {found,  Phone};
          +find_phone([_| T], Name) ->
          +    find_phone(T, Name);
          +find_phone([], Name) ->
               not_found.

          The fields referred to in the pattern can be given in any order.

          @@ -211,12 +211,12 @@

          The value of a field in a record can be an instance of a record. Retrieval of nested data can be done stepwise, or in a single step, as shown in the following -example:

          -record(name, {first = "Robert", last = "Ericsson"}).
          --record(person, {name = #name{}, phone}).
          +example:

          -record(name, {first = "Robert", last = "Ericsson"}).
          +-record(person, {name = #name{}, phone}).
           
          -demo() ->
          -  P = #person{name= #name{first="Robert",last="Virding"}, phone=123},
          -  First = (P#person.name)#name.first.

          Here, demo() evaluates to "Robert".

          +demo() -> + P = #person{name= #name{first="Robert",last="Virding"}, phone=123}, + First = (P#person.name)#name.first.

          Here, demo() evaluates to "Robert".

          @@ -234,40 +234,40 @@ %% about the person. %% A {Key, Value} list (default is the empty list). %%------------------------------------------------------------ --record(person, {name, age, phone = [], dict = []}).

          -module(person).
          --include("person.hrl").
          --compile(export_all). % For test purposes only.
          +-record(person, {name, age, phone = [], dict = []}).
          -module(person).
          +-include("person.hrl").
          +-compile(export_all). % For test purposes only.
           
           %% This creates an instance of a person.
           %%   Note: The phone number is not supplied so the
           %%         default value [] will be used.
           
          -make_hacker_without_phone(Name, Age) ->
          -   #person{name = Name, age = Age,
          -           dict = [{computer_knowledge, excellent},
          -                   {drinks, coke}]}.
          +make_hacker_without_phone(Name, Age) ->
          +   #person{name = Name, age = Age,
          +           dict = [{computer_knowledge, excellent},
          +                   {drinks, coke}]}.
           
           %% This demonstrates matching in arguments
           
          -print(#person{name = Name, age = Age,
          -              phone = Phone, dict = Dict}) ->
          -  io:format("Name: ~s, Age: ~w, Phone: ~w ~n"
          -            "Dictionary: ~w.~n", [Name, Age, Phone, Dict]).
          +print(#person{name = Name, age = Age,
          +              phone = Phone, dict = Dict}) ->
          +  io:format("Name: ~s, Age: ~w, Phone: ~w ~n"
          +            "Dictionary: ~w.~n", [Name, Age, Phone, Dict]).
           
           %% Demonstrates type testing, selector, updating.
           
          -birthday(P) when is_record(P, person) ->
          -   P#person{age = P#person.age + 1}.
          +birthday(P) when is_record(P, person) ->
          +   P#person{age = P#person.age + 1}.
           
          -register_two_hackers() ->
          -   Hacker1 = make_hacker_without_phone("Joe", 29),
          -   OldHacker = birthday(Hacker1),
          +register_two_hackers() ->
          +   Hacker1 = make_hacker_without_phone("Joe", 29),
          +   OldHacker = birthday(Hacker1),
              % The central_register_server should have
              % an interface function for this.
          -   central_register_server ! {register_person, Hacker1},
          -   central_register_server ! {register_person,
          -             OldHacker#person{name = "Robert",
          -                              phone = [0,8,3,2,4,5,3,1]}}.
          +
          central_register_server ! {register_person, Hacker1}, + central_register_server ! {register_person, + OldHacker#person{name = "Robert", + phone = [0,8,3,2,4,5,3,1]}}.
          @@ -318,7 +318,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/doc/system/programming_examples.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/system/programming_examples.html 2026-06-04 19:05:00.977436723 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/programming_examples.html 2026-06-04 19:05:00.977436723 +0000 @@ -167,7 +167,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/doc/system/readme.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/system/readme.html 2026-06-04 19:05:00.993436872 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/readme.html 2026-06-04 19:05:00.993436872 +0000 @@ -169,7 +169,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/doc/system/records_macros.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (2706)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/records_macros.html 2026-06-04 19:05:01.013437057 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/records_macros.html 2026-06-04 19:05:01.014437067 +0000 @@ -128,7 +128,7 @@ introduced:

          %%%----FILE mess_config.hrl----
           
           %%% Configure the location of the server node,
          --define(server_node, messenger@super).
          +-define(server_node, messenger@super).
           
           %%%----END FILE----
          %%%----FILE mess_interface.hrl----
           
          @@ -136,24 +136,24 @@
           %%% messenger program
           
           %%%Messages from Client to server received in server/1 function.
          --record(logon,{client_pid, username}).
          --record(message,{client_pid, to_name, message}).
          +-record(logon,{client_pid, username}).
          +-record(message,{client_pid, to_name, message}).
           %%% {'EXIT', ClientPid, Reason}  (client terminated or unreachable.
           
           %%% Messages from Server to Client, received in await_result/0 function
          --record(abort_client,{message}).
          +-record(abort_client,{message}).
           %%% Messages are: user_exists_at_other_node,
           %%%               you_are_not_logged_on
          --record(server_reply,{message}).
          +-record(server_reply,{message}).
           %%% Messages are: logged_on
           %%%               receiver_not_found
           %%%               sent  (Message has been sent (no guarantee)
           %%% Messages from Server to Client received in client/1 function
          --record(message_from,{from_name, message}).
          +-record(message_from,{from_name, message}).
           
           %%% Messages from shell to Client received in client/1 function
           %%% spawn(mess_client, client, [server_node(), Name])
          --record(message_to,{to_name, message}).
          +-record(message_to,{to_name, message}).
           %%% logoff
           
           %%%----END FILE----
          %%%----FILE user_interface.erl----
          @@ -174,27 +174,27 @@
           %%%     function is not logged on or if ToName is not logged on at
           %%%     any node.
           
          --module(user_interface).
          --export([logon/1, logoff/0, message/2]).
          --include("mess_interface.hrl").
          --include("mess_config.hrl").
          +-module(user_interface).
          +-export([logon/1, logoff/0, message/2]).
          +-include("mess_interface.hrl").
          +-include("mess_config.hrl").
           
          -logon(Name) ->
          -    case whereis(mess_client) of
          +logon(Name) ->
          +    case whereis(mess_client) of
                   undefined ->
          -            register(mess_client,
          -                     spawn(mess_client, client, [?server_node, Name]));
          +            register(mess_client,
          +                     spawn(mess_client, client, [?server_node, Name]));
                   _ -> already_logged_on
               end.
           
          -logoff() ->
          +logoff() ->
               mess_client ! logoff.
           
          -message(ToName, Message) ->
          -    case whereis(mess_client) of % Test if the client is running
          +message(ToName, Message) ->
          +    case whereis(mess_client) of % Test if the client is running
                   undefined ->
                       not_logged_on;
          -        _ -> mess_client ! #message_to{to_name=ToName, message=Message},
          +        _ -> mess_client ! #message_to{to_name=ToName, message=Message},
                        ok
           end.
           
          @@ -202,107 +202,107 @@
           
           %%% The client process which runs on each user node
           
          --module(mess_client).
          --export([client/2]).
          --include("mess_interface.hrl").
          -
          -client(Server_Node, Name) ->
          -    {messenger, Server_Node} ! #logon{client_pid=self(), username=Name},
          -    await_result(),
          -    client(Server_Node).
          +-module(mess_client).
          +-export([client/2]).
          +-include("mess_interface.hrl").
          +
          +client(Server_Node, Name) ->
          +    {messenger, Server_Node} ! #logon{client_pid=self(), username=Name},
          +    await_result(),
          +    client(Server_Node).
           
          -client(Server_Node) ->
          +client(Server_Node) ->
               receive
                   logoff ->
          -            exit(normal);
          -        #message_to{to_name=ToName, message=Message} ->
          -            {messenger, Server_Node} !
          -                #message{client_pid=self(), to_name=ToName, message=Message},
          -            await_result();
          -        {message_from, FromName, Message} ->
          -            io:format("Message from ~p: ~p~n", [FromName, Message])
          +            exit(normal);
          +        #message_to{to_name=ToName, message=Message} ->
          +            {messenger, Server_Node} !
          +                #message{client_pid=self(), to_name=ToName, message=Message},
          +            await_result();
          +        {message_from, FromName, Message} ->
          +            io:format("Message from ~p: ~p~n", [FromName, Message])
               end,
          -    client(Server_Node).
          +    client(Server_Node).
           
           %%% wait for a response from the server
          -await_result() ->
          +await_result() ->
               receive
          -        #abort_client{message=Why} ->
          -            io:format("~p~n", [Why]),
          -            exit(normal);
          -        #server_reply{message=What} ->
          -            io:format("~p~n", [What])
          +        #abort_client{message=Why} ->
          +            io:format("~p~n", [Why]),
          +            exit(normal);
          +        #server_reply{message=What} ->
          +            io:format("~p~n", [What])
               after 5000 ->
          -            io:format("No response from server~n", []),
          -            exit(timeout)
          +            io:format("No response from server~n", []),
          +            exit(timeout)
               end.
           
           %%%----END FILE---
          %%%----FILE mess_server.erl----
           
           %%% This is the server process of the messenger service
           
          --module(mess_server).
          --export([start_server/0, server/0]).
          --include("mess_interface.hrl").
          -
          -server() ->
          -    process_flag(trap_exit, true),
          -    server([]).
          +-module(mess_server).
          +-export([start_server/0, server/0]).
          +-include("mess_interface.hrl").
          +
          +server() ->
          +    process_flag(trap_exit, true),
          +    server([]).
           
           %%% the user list has the format [{ClientPid1, Name1},{ClientPid22, Name2},...]
          -server(User_List) ->
          -    io:format("User list = ~p~n", [User_List]),
          +server(User_List) ->
          +    io:format("User list = ~p~n", [User_List]),
               receive
          -        #logon{client_pid=From, username=Name} ->
          -            New_User_List = server_logon(From, Name, User_List),
          -            server(New_User_List);
          -        {'EXIT', From, _} ->
          -            New_User_List = server_logoff(From, User_List),
          -            server(New_User_List);
          -        #message{client_pid=From, to_name=To, message=Message} ->
          -            server_transfer(From, To, Message, User_List),
          -            server(User_List)
          +        #logon{client_pid=From, username=Name} ->
          +            New_User_List = server_logon(From, Name, User_List),
          +            server(New_User_List);
          +        {'EXIT', From, _} ->
          +            New_User_List = server_logoff(From, User_List),
          +            server(New_User_List);
          +        #message{client_pid=From, to_name=To, message=Message} ->
          +            server_transfer(From, To, Message, User_List),
          +            server(User_List)
               end.
           
           %%% Start the server
          -start_server() ->
          -    register(messenger, spawn(?MODULE, server, [])).
          +start_server() ->
          +    register(messenger, spawn(?MODULE, server, [])).
           
           %%% Server adds a new user to the user list
          -server_logon(From, Name, User_List) ->
          +server_logon(From, Name, User_List) ->
          /usr/share/doc/packages/erlang27-doc/doc/system/ref_man_functions.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (831))
          --- old//usr/share/doc/packages/erlang27-doc/doc/system/ref_man_functions.html	2026-06-04 19:05:01.035437262 +0000
          +++ new//usr/share/doc/packages/erlang27-doc/doc/system/ref_man_functions.html	2026-06-04 19:05:01.035437262 +0000
          @@ -124,10 +124,10 @@
           

          A function declaration is a sequence of function clauses separated by semicolons, and terminated by a period (.).

          A function clause consists of a clause head and a clause body, separated by ->.

          A clause head consists of the function name, an argument list, and an optional -guard sequence beginning with the keyword when:

          Name(Pattern11,...,Pattern1N) [when GuardSeq1] ->
          +guard sequence beginning with the keyword when:

          Name(Pattern11,...,Pattern1N) [when GuardSeq1] ->
               Body1;
           ...;
          -Name(PatternK1,...,PatternKN) [when GuardSeqK] ->
          +Name(PatternK1,...,PatternKN) [when GuardSeqK] ->
               BodyK.

          The function name is an atom. Each argument is a pattern.

          The number of arguments N is the arity of the function. A function is uniquely defined by the module name, function name, and arity. That is, two functions with the same name and in the same module, but with different arities @@ -135,10 +135,10 @@ mod:f/N.

          A clause body consists of a sequence of expressions separated by comma (,):

          Expr1,
           ...,
           ExprN

          Valid Erlang expressions and guard sequences are described in -Expressions.

          Example:

          fact(N) when N > 0 ->  % first clause head
          -    N * fact(N-1);     % first clause body
          +Expressions.

          Example:

          fact(N) when N > 0 ->  % first clause head
          +    N * fact(N-1);     % first clause body
           
          -fact(0) ->             % second clause head
          +fact(0) ->             % second clause head
               1.                 % second clause body

          @@ -151,16 +151,16 @@ clause is found that fulfills both of the following two conditions:

          1. The patterns in the clause head can be successfully matched against the given arguments.
          2. The guard sequence, if any, is true.

          If such a clause cannot be found, a function_clause runtime error occurs.

          If such a clause is found, the corresponding clause body is evaluated. That is, the expressions in the body are evaluated sequentially and the value of the last -expression is returned.

          Consider the function fact:

          -module(mod).
          --export([fact/1]).
          +expression is returned.

          Consider the function fact:

          -module(mod).
          +-export([fact/1]).
           
          -fact(N) when N > 0 ->
          -    N * fact(N - 1);
          -fact(0) ->
          +fact(N) when N > 0 ->
          +    N * fact(N - 1);
          +fact(0) ->
               1.

          Assume that you want to calculate the factorial for 1:

          1> mod:fact(1).

          Evaluation starts at the first clause. The pattern N is matched against argument 1. The matching succeeds and the guard (N > 0) is true, thus N is -bound to 1, and the corresponding body is evaluated:

          N * fact(N-1) => (N is bound to 1)
          -1 * fact(0)

          Now, fact(0) is called, and the function clauses are scanned +bound to 1, and the corresponding body is evaluated:

          N * fact(N-1) => (N is bound to 1)
          +1 * fact(0)

          Now, fact(0) is called, and the function clauses are scanned sequentially again. First, the pattern N is matched against 0. The matching succeeds, but the guard (N > 0) is false. Second, the pattern 0 is matched against the argument 0. The matching succeeds @@ -177,9 +177,9 @@ tail-recursive call is done. This is to ensure that no system resources, for example, call stack, are consumed. This means that an infinite loop using tail-recursive calls will not exhaust the call -stack and can (in principle) run forever.

          Example:

          loop(N) ->
          -    io:format("~w~n", [N]),
          -    loop(N+1).

          The earlier factorial example is a counter-example. It is not +stack and can (in principle) run forever.

          Example:

          loop(N) ->
          +    io:format("~w~n", [N]),
          +    loop(N+1).

          The earlier factorial example is a counter-example. It is not tail-recursive, since a multiplication is done on the result of the recursive call to fact(N-1).

          @@ -195,9 +195,9 @@ not need to be prefixed with the module name. Which BIFs that are auto-imported is specified in the erlang module in ERTS. For example, standard-type conversion BIFs like atom_to_list and BIFs allowed in guards can be called -without specifying the module name.

          Examples:

          1> tuple_size({a,b,c}).
          +without specifying the module name.

          Examples:

          1> tuple_size({a,b,c}).
           3
          -2> atom_to_list(&#href_anchor"p" data-group-id="4356496373-3">).
          +2> atom_to_list(&#href_anchor"p" data-group-id="3071257581-3">).
           "Erlang"
          @@ -249,7 +249,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/doc/system/ref_man_processes.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1276)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/ref_man_processes.html 2026-06-04 19:05:01.057437466 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/ref_man_processes.html 2026-06-04 19:05:01.058437475 +0000 @@ -129,10 +129,10 @@ Process Creation

          -

          A process is created by calling spawn():

          spawn(Module, Name, Args) -> pid()
          -  Module = Name = atom()
          -  Args = [Arg1,...,ArgN]
          -    ArgI = term()

          spawn() creates a new process and returns the pid.

          The new process starts executing in Module:Name(Arg1,...,ArgN) where the +

          A process is created by calling spawn():

          spawn(Module, Name, Args) -> pid()
          +  Module = Name = atom()
          +  Args = [Arg1,...,ArgN]
          +    ArgI = term()

          spawn() creates a new process and returns the pid.

          The new process starts executing in Module:Name(Arg1,...,ArgN) where the arguments are the elements of the (possible empty) Args argument list.

          There exist a number of different spawn BIFs:

          @@ -587,7 +587,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/doc/system/ref_man_records.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (977)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/ref_man_records.html 2026-06-04 19:05:01.076437642 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/ref_man_records.html 2026-06-04 19:05:01.077437651 +0000 @@ -127,9 +127,9 @@

          A record definition consists of the name of the record, followed by the field names of the record. Record and field names must be atoms. Each field can be given an optional default value. If no default value is supplied, undefined is -used.

          -record(Name, {Field1 [= Expr1],
          +used.

          -record(Name, {Field1 [= Expr1],
                          ...
          -               FieldN [= ExprN]}).

          The default value for a field is an arbitrary expression, except that it must + FieldN [= ExprN]}).

          The default value for a field is an arbitrary expression, except that it must not use any variables.

          A record definition can be placed anywhere among the attributes and function declarations of a module, but the definition must come before any usage of the record.

          If a record is used in several modules, it is recommended that the record @@ -147,24 +147,24 @@ default value instead.

          If several fields are to be assigned the same value, the following construction can be used:

          #Name{Field1=Expr1, ..., FieldK=ExprK, _=ExprL}

          Omitted fields then get the value of evaluating ExprL instead of their default values. This feature is primarily intended to be used to create patterns for ETS -and Mnesia match functions.

          Example:

          -record(person, {name, phone, address}).
          +and Mnesia match functions.

          Example:

          -record(person, {name, phone, address}).
           
          -lookup(Name, Tab) ->
          -    ets:match_object(Tab, #person{name=Name, _='_'}).

          +lookup(Name, Tab) -> + ets:match_object(Tab, #person{name=Name, _='_'}).

          Accessing Record Fields

          Expr#Name.Field

          Returns the value of the specified field. Expr is to evaluate to a Name -record.

          Example:

          -record(person, {name, phone, address}).
          +record.

          Example:

          -record(person, {name, phone, address}).
           
          -get_person_name(Person) ->
          +get_person_name(Person) ->
               Person#person.name.

          The following expression returns the position of the specified field in the -tuple representation of the record:

          #Name.Field

          Example:

          -record(person, {name, phone, address}).
          +tuple representation of the record:

          #Name.Field

          Example:

          -record(person, {name, phone, address}).
           
          -lookup(Name, List) ->
          -    lists:keyfind(Name, #person.name, List).

          +lookup(Name, List) -> + lists:keyfind(Name, #person.name, List).

          @@ -182,13 +182,13 @@

          Since record expressions are expanded to tuple expressions, creating records and accessing record fields are allowed in guards. However, all subexpressions (for initializing fields), must be valid guard -expressions as well.

          Examples:

          handle(Msg, State) when Msg =:= #msg{to=void, no=3} ->
          +expressions as well.

          Examples:

          handle(Msg, State) when Msg =:= #msg{to=void, no=3} ->
               ...
           
          -handle(Msg, State) when State#state.running =:= true ->
          -    ...

          There is also a type test BIF is_record(Term, RecordTag).

          Example:

          is_person(P) when is_record(P, person) ->
          +handle(Msg, State) when State#state.running =:= true ->
          +    ...

          There is also a type test BIF is_record(Term, RecordTag).

          Example:

          is_person(P) when is_record(P, person) ->
               true;
          -is_person(_P) ->
          +is_person(_P) ->
               false.

          @@ -202,11 +202,11 @@ Nested Records

          -

          Assume the following record definitions:

          -record(nrec0, {name = "nested0"}).
          --record(nrec1, {name = "nested1", nrec0=#nrec0{}}).
          --record(nrec2, {name = "nested2", nrec1=#nrec1{}}).
          +

          Assume the following record definitions:

          -record(nrec0, {name = "nested0"}).
          +-record(nrec1, {name = "nested1", nrec0=#nrec0{}}).
          +-record(nrec2, {name = "nested2", nrec1=#nrec1{}}).
           
          -N2 = #nrec2{},

          Accessing or updating nested records can be written without parentheses:

          "nested0" = N2#nrec2.nrec1#nrec1.nrec0#nrec0.name,
          +N2 = #nrec2{},

          Accessing or updating nested records can be written without parentheses:

          "nested0" = N2#nrec2.nrec1#nrec1.nrec0#nrec0.name,
               N0n = N2#nrec2.nrec1#nrec1.nrec0#nrec0{name = "nested0a"},

          which is equivalent to:

          "nested0" = ((N2#nrec2.nrec1)#nrec1.nrec0)#nrec0.name,
           N0n = ((N2#nrec2.nrec1)#nrec1.nrec0)#nrec0{name = "nested0a"},

          Change

          Before Erlang/OTP R14, parentheses were necessary when accessing or updating nested records.

          @@ -216,9 +216,9 @@ Internal Representation of Records

          Record expressions are translated to tuple expressions during compilation. A -record defined as:

          -record(Name, {Field1, ..., FieldN}).

          is internally represented by the tuple:

          {Name, Value1, ..., ValueN}

          Here each ValueI is the default value for FieldI.

          To each module using records, a pseudo function is added during compilation to -obtain information about records:

          record_info(fields, Record) -> [Field]
          -record_info(size, Record) -> Size

          Size is the size of the tuple representation, that is, one more than the +record defined as:

          -record(Name, {Field1, ..., FieldN}).

          is internally represented by the tuple:

          {Name, Value1, ..., ValueN}

          Here each ValueI is the default value for FieldI.

          To each module using records, a pseudo function is added during compilation to +obtain information about records:

          record_info(fields, Record) -> [Field]
          +record_info(size, Record) -> Size

          Size is the size of the tuple representation, that is, one more than the number of fields.

          @@ -270,7 +270,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/doc/system/reference_manual.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (364)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/reference_manual.html 2026-06-04 19:05:01.091437781 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/reference_manual.html 2026-06-04 19:05:01.092437790 +0000 @@ -213,7 +213,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/doc/system/release_handling.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1111)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/release_handling.html 2026-06-04 19:05:01.113437985 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/release_handling.html 2026-06-04 19:05:01.113437985 +0000 @@ -227,15 +227,15 @@ Instead, it is necessary to:

          • Suspend the processes using the module (to avoid that they try to handle any requests before the code replacement is completed).
          • Ask them to transform the internal state format and switch to the new version of the module.
          • Remove the old version.
          • Resume the processes.

          This is called synchronized code replacement and for this the following -instructions are used:

          {update, Module, {advanced, Extra}}
          -{update, Module, supervisor}

          update with argument {advanced,Extra} is used when changing the internal +instructions are used:

          {update, Module, {advanced, Extra}}
          +{update, Module, supervisor}

          update with argument {advanced,Extra} is used when changing the internal state of a behaviour as described above. It causes behaviour processes to call the callback function code_change/3, passing the term Extra and some other information as arguments. See the manual pages for the respective behaviours and Appup Cookbook.

          update with argument supervisor is used when changing the start specification of a supervisor. See Appup Cookbook.

          When a module is to be updated, the release handler finds which processes that are using the module by traversing the supervision tree of each running -application and checking all the child specifications:

          {Id, StartFunc, Restart, Shutdown, Type, Modules}

          A process uses a module if the name is listed in Modules in the child +application and checking all the child specifications:

          {Id, StartFunc, Restart, Shutdown, Type, Modules}

          A process uses a module if the name is listed in Modules in the child specification for the process.

          If Modules=dynamic, which is the case for event managers, the event manager process informs the release handler about the list of currently installed event handlers (gen_event), and it is checked if the module name is in this list @@ -247,10 +247,10 @@ add_module and delete_module

          -

          If a new module is introduced, the following instruction is used:

          {add_module, Module}

          This instruction loads module Module. When running Erlang in +

          If a new module is introduced, the following instruction is used:

          {add_module, Module}

          This instruction loads module Module. When running Erlang in embedded mode it is necessary to use this this instruction. It is not strictly required when running Erlang in interactive mode, since the -code server automatically searches for and loads unloaded modules.

          The opposite of add_module is delete_module, which unloads a module:

          {delete_module, Module}

          Any process, in any application, with Module as residence module, is +code server automatically searches for and loads unloaded modules.

          The opposite of add_module is delete_module, which unloads a module:

          {delete_module, Module}

          Any process, in any application, with Module as residence module, is killed when the instruction is evaluated. Therefore, the user must ensure that all such processes are terminated before deleting module Module to avoid a situation with failing supervisor restarts.

          @@ -331,13 +331,13 @@

          To define how to upgrade/downgrade between the current version and previous versions of an application, an application upgrade file, or in short .appup file is created. The file is to be called Application.appup, where -Application is the application name:

          {Vsn,
          - [{UpFromVsn1, InstructionsU1},
          +Application is the application name:

          {Vsn,
          + [{UpFromVsn1, InstructionsU1},
             ...,
          -  {UpFromVsnK, InstructionsUK}],
          - [{DownToVsn1, InstructionsD1},
          +  {UpFromVsnK, InstructionsUK}],
          + [{DownToVsn1, InstructionsD1},
             ...,
          -  {DownToVsnK, InstructionsDK}]}.
          • Vsn, a string, is the current version of the application, as defined in the + {DownToVsnK, InstructionsDK}]}.
          • Vsn, a string, is the current version of the application, as defined in the .app file.
          • Each UpFromVsn is a previous version of the application to upgrade from.
          • Each DownToVsn is a previous version of the application to downgrade to.
          • Each Instructions is a list of release handling instructions.

          UpFromVsn and DownToVsn can also be specified as regular expressions. For more information about the syntax and contents of the .appup file, see appup in SASL.

          Appup Cookbook includes examples of .appup files for @@ -345,52 +345,52 @@ Releases. Assume you want to add a function available/0 to server ch3, which returns the number of available channels (when trying out the example, make the change in a copy of the original -directory, to ensure that the first version is still available):

          -module(ch3).
          --behaviour(gen_server).
          +directory, to ensure that the first version is still available):

          -module(ch3).
          +-behaviour(gen_server).
           
          --export([start_link/0]).
          --export([alloc/0, free/1]).
          --export([available/0]).
          --export([init/1, handle_call/3, handle_cast/2]).
          -
          -start_link() ->
          -    gen_server:start_link({local, ch3}, ch3, [], []).
          -
          -alloc() ->
          -    gen_server:call(ch3, alloc).
          -
          -free(Ch) ->
          -    gen_server:cast(ch3, {free, Ch}).
          -
          -available() ->
          -    gen_server:call(ch3, available).
          -
          -init(_Args) ->
          -    {ok, channels()}.
          -
          -handle_call(alloc, _From, Chs) ->
          -    {Ch, Chs2} = alloc(Chs),
          -    {reply, Ch, Chs2};
          -handle_call(available, _From, Chs) ->
          -    N = available(Chs),
          -    {reply, N, Chs}.
          -
          -handle_cast({free, Ch}, Chs) ->
          -    Chs2 = free(Ch, Chs),
          -    {noreply, Chs2}.

          A new version of the ch_app.app file must now be created, where the version is -updated:

          {application, ch_app,
          - [{description, "Channel allocator"},
          -  {vsn, "2"},
          -  {modules, [ch_app, ch_sup, ch3]},
          -  {registered, [ch3]},
          -  {applications, [kernel, stdlib, sasl]},
          -  {mod, {ch_app,[]}}
          - ]}.

          To upgrade ch_app from "1" to "2" (and to downgrade from "2" to "1"), +-export([start_link/0]). +-export([alloc/0, free/1]). +-export([available/0]). +-export([init/1, handle_call/3, handle_cast/2]). + +start_link() -> + gen_server:start_link({local, ch3}, ch3, [], []). + +alloc() -> + gen_server:call(ch3, alloc). + +free(Ch) -> + gen_server:cast(ch3, {free, Ch}). + +available() -> + gen_server:call(ch3, available). + +init(_Args) -> + {ok, channels()}. + +handle_call(alloc, _From, Chs) -> + {Ch, Chs2} = alloc(Chs), + {reply, Ch, Chs2}; +handle_call(available, _From, Chs) -> + N = available(Chs), + {reply, N, Chs}. + +handle_cast({free, Ch}, Chs) -> + Chs2 = free(Ch, Chs), + {noreply, Chs2}.

          A new version of the ch_app.app file must now be created, where the version is +updated:

          {application, ch_app,
          + [{description, "Channel allocator"},
          +  {vsn, "2"},
          +  {modules, [ch_app, ch_sup, ch3]},
          +  {registered, [ch3]},
          +  {applications, [kernel, stdlib, sasl]},
          +  {mod, {ch_app,[]}}
          + ]}.

          To upgrade ch_app from "1" to "2" (and to downgrade from "2" to "1"), you only need to load the new (old) version of the ch3 callback module. Create -the application upgrade file ch_app.appup in the ebin directory:

          {"2",
          - [{"1", [{load_module, ch3}]}],
          - [{"1", [{load_module, ch3}]}]
          -}.

          +the application upgrade file ch_app.appup in the ebin directory:

          {"2",
          + [{"1", [{load_module, ch3}]}],
          + [{"1", [{load_module, ch3}]}]
          +}.

          @@ -409,14 +409,14 @@ relup in SASL.

          Example, continued from the previous section: You have a new version "2" of ch_app and an .appup file. A new version of the .rel file is also needed. This time the file is called ch_rel-2.rel and the release version string is -changed from "A" to "B":

          {release,
          - {"ch_rel", "B"},
          - {erts, "14.2.5"},
          - [{kernel, "9.2.4"},
          -  {stdlib, "5.2.3"},
          -  {sasl, "4.2.1"},
          -  {ch_app, "2"}]
          -}.

          Now the relup file can be generated:

          1> systools:make_relup("ch_rel-2", ["ch_rel-1"], ["ch_rel-1"]).
          +changed from "A" to "B":

          {release,
          + {"ch_rel", "B"},
          + {erts, "14.2.5"},
          + [{kernel, "9.2.4"},
          +  {stdlib, "5.2.3"},
          +  {sasl, "4.2.1"},
          +  {ch_app, "2"}]
          +}.

          Now the relup file can be generated:

          1> systools:make_relup("ch_rel-2", ["ch_rel-1"], ["ch_rel-1"]).
           ok

          This generates a relup file with instructions for how to upgrade from version "A" ("ch_rel-1") to version "B" ("ch_rel-2") and how to downgrade from version "B" to version "A".

          Both the old and new versions of the .app and .rel files must be in the code @@ -437,17 +437,17 @@ packages. The release_handler module communicates with this process.

          Assuming there is an operational target system with installation root directory $ROOT, the release package with the new version of the release is to be copied to $ROOT/releases.

          First, unpack the release package. The files are then extracted from the -package:

          release_handler:unpack_release(ReleaseName) => {ok, Vsn}
          • ReleaseName is the name of the release package except the .tar.gz +package:

            release_handler:unpack_release(ReleaseName) => {ok, Vsn}
            • ReleaseName is the name of the release package except the .tar.gz extension.
            • Vsn is the version of the unpacked release, as defined in its .rel file.

            A directory $ROOT/lib/releases/Vsn is created, where the .rel file, the boot script start.boot, the system configuration file sys.config, and relup are placed. For applications with new version numbers, the application directories are placed under $ROOT/lib. Unchanged applications are not affected.

            An unpacked release can be installed. The release handler then evaluates the -instructions in relup, step by step:

            release_handler:install_release(Vsn) => {ok, FromVsn, []}

            If an error occurs during the installation, the system is rebooted using the old +instructions in relup, step by step:

            release_handler:install_release(Vsn) => {ok, FromVsn, []}

            If an error occurs during the installation, the system is rebooted using the old version of the release. If installation succeeds, the system is afterwards using the new version of the release, but if anything happens and the system is rebooted, it starts using the previous version again.

            To be made the default version, the newly installed release must be made permanent, which means the previous version becomes old:

            release_handler:make_permanent(Vsn) => ok

            The system keeps information about which versions are old and permanent in the -files $ROOT/releases/RELEASES and $ROOT/releases/start_erl.data.

            To downgrade from Vsn to FromVsn, install_release must be called again:

            release_handler:install_release(FromVsn) => {ok, Vsn, []}

            An installed, but not permanent, release can be removed. Information about the +files $ROOT/releases/RELEASES and $ROOT/releases/start_erl.data.

            To downgrade from Vsn to FromVsn, install_release must be called again:

            release_handler:install_release(FromVsn) => {ok, Vsn, []}

            An installed, but not permanent, release can be removed. Information about the release is then deleted from $ROOT/releases/RELEASES and the release-specific code, that is, the new application directories and the $ROOT/releases/Vsn directory, are removed.

            release_handler:remove_release(Vsn) => ok

            @@ -466,9 +466,9 @@ ...

          $ROOT is the installation directory of the target system.

          Step 3) In another Erlang shell, generate start scripts and create a release package for the new version "B". Remember to include (a possible updated) sys.config and the relup file. For more information, see -Release Upgrade File.

          1> systools:make_script("ch_rel-2").
          +Release Upgrade File.

          1> systools:make_script("ch_rel-2").
          /usr/share/doc/packages/erlang27-doc/doc/system/release_structure.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (787))
          --- old//usr/share/doc/packages/erlang27-doc/doc/system/release_structure.html	2026-06-04 19:05:01.132438161 +0000
          +++ new//usr/share/doc/packages/erlang27-doc/doc/system/release_structure.html	2026-06-04 19:05:01.132438161 +0000
          @@ -140,29 +140,29 @@
           

          To define a release, create a release resource file, or in short a .rel file. In the file, specify the name and version of the release, which ERTS -version it is based on, and which applications it consists of:

          {release, {Name,Vsn}, {erts, EVsn},
          - [{Application1, AppVsn1},
          +version it is based on, and which applications it consists of:

          {release, {Name,Vsn}, {erts, EVsn},
          + [{Application1, AppVsn1},
              ...
          -  {ApplicationN, AppVsnN}]}.

          Name, Vsn, EVsn, and AppVsn are strings.

          The file must be named Rel.rel, where Rel is a unique name.

          Each Application (atom) and AppVsn is the name and version of an application + {ApplicationN, AppVsnN}]}.

          Name, Vsn, EVsn, and AppVsn are strings.

          The file must be named Rel.rel, where Rel is a unique name.

          Each Application (atom) and AppVsn is the name and version of an application included in the release. The minimal release based on Erlang/OTP consists of the Kernel and STDLIB applications, so these applications must be included in the list.

          If the release is to be upgraded, it must also include the SASL application.

          Here is an example showing the .app file for a release of ch_app from -the Applications section:

          {application, ch_app,
          - [{description, "Channel allocator"},
          -  {vsn, "1"},
          -  {modules, [ch_app, ch_sup, ch3]},
          -  {registered, [ch3]},
          -  {applications, [kernel, stdlib, sasl]},
          -  {mod, {ch_app,[]}}
          - ]}.

          The .rel file must also contain kernel, stdlib, and sasl, as these -applications are required by ch_app. The file is called ch_rel-1.rel:

          {release,
          - {"ch_rel", "A"},
          - {erts, "14.2.5"},
          - [{kernel, "9.2.4"},
          -  {stdlib, "5.2.3"},
          -  {sasl, "4.2.1"},
          -  {ch_app, "1"}]
          -}.

          +the Applications section:

          {application, ch_app,
          + [{description, "Channel allocator"},
          +  {vsn, "1"},
          +  {modules, [ch_app, ch_sup, ch3]},
          +  {registered, [ch3]},
          +  {applications, [kernel, stdlib, sasl]},
          +  {mod, {ch_app,[]}}
          + ]}.

          The .rel file must also contain kernel, stdlib, and sasl, as these +applications are required by ch_app. The file is called ch_rel-1.rel:

          {release,
          + {"ch_rel", "A"},
          + {erts, "14.2.5"},
          + [{kernel, "9.2.4"},
          +  {stdlib, "5.2.3"},
          +  {sasl, "4.2.1"},
          +  {ch_app, "1"}]
          +}.

          @@ -194,9 +194,9 @@

          The systools:make_tar/1,2 function takes a .rel file as input and creates a zipped tar file with the code for -the specified applications, a release package:

          1> systools:make_script("ch_rel-1").
          +the specified applications, a release package:

          1> systools:make_script("ch_rel-1").
           ok
          -2> systools:make_tar("ch_rel-1").
          +2> systools:make_tar("ch_rel-1").
           ok

          The release package by default contains:

          • The .app files
          • The .rel file
          • The object code for all applications, structured according to the application directory structure
          • The binary boot script renamed to start.boot
          % tar tf ch_rel-1.tar
           lib/kernel-9.2.4/ebin/kernel.app
          @@ -355,7 +355,7 @@
                     Erlang programming language
           
                 

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/doc/system/robustness.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (805)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/robustness.html 2026-06-04 19:05:01.154438366 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/robustness.html 2026-06-04 19:05:01.154438366 +0000 @@ -132,36 +132,36 @@ "pong" so that "pong" can also finish. Another way to let "pong" finish is to make "pong" exit if it does not receive a message from ping within a certain time. This can be done by adding a time-out to pong as shown in the -following example:

          -module(tut19).
          +following example:

          -module(tut19).
           
          --export([start_ping/1, start_pong/0,  ping/2, pong/0]).
          +-export([start_ping/1, start_pong/0,  ping/2, pong/0]).
           
          -ping(0, Pong_Node) ->
          -    io:format("ping finished~n", []);
          +ping(0, Pong_Node) ->
          +    io:format("ping finished~n", []);
           
          -ping(N, Pong_Node) ->
          -    {pong, Pong_Node} ! {ping, self()},
          +ping(N, Pong_Node) ->
          +    {pong, Pong_Node} ! {ping, self()},
               receive
                   pong ->
          -            io:format("Ping received pong~n", [])
          +            io:format("Ping received pong~n", [])
               end,
          -    ping(N - 1, Pong_Node).
          +    ping(N - 1, Pong_Node).
           
          -pong() ->
          +pong() ->
               receive
          -        {ping, Ping_PID} ->
          -            io:format("Pong received ping~n", []),
          +        {ping, Ping_PID} ->
          +            io:format("Pong received ping~n", []),
                       Ping_PID ! pong,
          -            pong()
          +            pong()
               after 5000 ->
          -            io:format("Pong timed out~n", [])
          +            io:format("Pong timed out~n", [])
               end.
           
          -start_pong() ->
          -    register(pong, spawn(tut19, pong, [])).
          +start_pong() ->
          +    register(pong, spawn(tut19, pong, [])).
           
          -start_ping(Pong_Node) ->
          -    spawn(tut19, ping, [3, Pong_Node]).

          After this is compiled and the file tut19.beam is copied to the necessary +start_ping(Pong_Node) -> + spawn(tut19, ping, [3, Pong_Node]).

          After this is compiled and the file tut19.beam is copied to the necessary directories, the following is seen on (pong@kosken):

          (pong@kosken)1> tut19:start_pong().
           true
           Pong received ping
          @@ -172,20 +172,20 @@
           Ping received pong
           Ping received pong
           Ping received pong
          -ping finished

          The time-out is set in:

          pong() ->
          +ping finished

          The time-out is set in:

          pong() ->
               receive
          -        {ping, Ping_PID} ->
          -            io:format("Pong received ping~n", []),
          +        {ping, Ping_PID} ->
          +            io:format("Pong received ping~n", []),
                       Ping_PID ! pong,
          -            pong()
          +            pong()
               after 5000 ->
          -            io:format("Pong timed out~n", [])
          +            io:format("Pong timed out~n", [])
               end.

          The time-out (after 5000) is started when receive is entered. The time-out is canceled if {ping,Ping_PID} is received. If {ping,Ping_PID} is not received, the actions following the time-out are done after 5000 milliseconds. after must be last in the receive, that is, preceded by all other message reception specifications in the receive. It is also possible to call a -function that returned an integer for the time-out:

          after pong_timeout() ->

          In general, there are better ways than using time-outs to supervise parts of a +function that returned an integer for the time-out:

          after pong_timeout() ->

          In general, there are better ways than using time-outs to supervise parts of a distributed Erlang system. Time-outs are usually appropriate to supervise external events, for example, if you have expected a message from some external system within a specified time. For example, a time-out can be used to log a @@ -213,36 +213,36 @@ If one of the processes exits abnormally, all the processes in the transaction are killed. As it is often wanted to create a process and link to it at the same time, there is a special BIF, spawn_link that does the -same as spawn, but also creates a link to the spawned process.

          Now an example of the ping pong example using links to terminate "pong":

          -module(tut20).
          +same as spawn, but also creates a link to the spawned process.

          Now an example of the ping pong example using links to terminate "pong":

          -module(tut20).
           
          --export([start/1,  ping/2, pong/0]).
          +-export([start/1,  ping/2, pong/0]).
           
          -ping(N, Pong_Pid) ->
          -    link(Pong_Pid),
          -    ping1(N, Pong_Pid).
          +ping(N, Pong_Pid) ->
          +    link(Pong_Pid),
          +    ping1(N, Pong_Pid).
           
          -ping1(0, _) ->
          -    exit(ping);
          +ping1(0, _) ->
          +    exit(ping);
           
          -ping1(N, Pong_Pid) ->
          -    Pong_Pid ! {ping, self()},
          +ping1(N, Pong_Pid) ->
          +    Pong_Pid ! {ping, self()},
               receive
                   pong ->
          -            io:format("Ping received pong~n", [])
          +            io:format("Ping received pong~n", [])
               end,
          -    ping1(N - 1, Pong_Pid).
          +    ping1(N - 1, Pong_Pid).
           
          -pong() ->
          +pong() ->
               receive
          -        {ping, Ping_PID} ->
          -            io:format("Pong received ping~n", []),
          +        {ping, Ping_PID} ->
          +            io:format("Pong received ping~n", []),
                       Ping_PID ! pong,
          -            pong()
          +            pong()
               end.
           
          -start(Ping_Node) ->
          -    PongPID = spawn(tut20, pong, []),
          -    spawn(Ping_Node, tut20, ping, [3, PongPID]).
          (s1@bill)3> tut20:start(s2@kosken).
          +start(Ping_Node) ->
          +    PongPID = spawn(tut20, pong, []),
          +    spawn(Ping_Node, tut20, ping, [3, PongPID]).
          (s1@bill)3> tut20:start(s2@kosken).
           Pong received ping
           <3820.41.0>
           Ping received pong
          @@ -256,45 +256,45 @@
           sent to "pong", which also terminates.

          It is possible to modify the default behaviour of a process so that it does not get killed when it receives abnormal exit signals. Instead, all signals are turned into normal messages on the format {'EXIT',FromPID,Reason} and added to -the end of the receiving process' message queue. This behaviour is set by:

          process_flag(trap_exit, true)

          There are several other process flags, see erlang(3). +the end of the receiving process' message queue. This behaviour is set by:

          process_flag(trap_exit, true)

          There are several other process flags, see erlang(3). Changing the default behaviour of a process in this way is usually not done in standard user programs, but is left to the supervisory programs in OTP. However, -the ping pong program is modified to illustrate exit trapping.

          -module(tut21).
          +the ping pong program is modified to illustrate exit trapping.

          -module(tut21).
           
          --export([start/1,  ping/2, pong/0]).
          +-export([start/1,  ping/2, pong/0]).
           
          -ping(N, Pong_Pid) ->
          -    link(Pong_Pid),
          -    ping1(N, Pong_Pid).
          +ping(N, Pong_Pid) ->
          +    link(Pong_Pid),
          +    ping1(N, Pong_Pid).
           
          -ping1(0, _) ->
          -    exit(ping);
          +ping1(0, _) ->
          +    exit(ping);
           
          -ping1(N, Pong_Pid) ->
          -    Pong_Pid ! {ping, self()},
          +ping1(N, Pong_Pid) ->
          +    Pong_Pid ! {ping, self()},
               receive
                   pong ->
          -            io:format("Ping received pong~n", [])
          +            io:format("Ping received pong~n", [])
               end,
          -    ping1(N - 1, Pong_Pid).
          +    ping1(N - 1, Pong_Pid).
           
          -pong() ->
          -    process_flag(trap_exit, true),
          -    pong1().
          +pong() ->
          +    process_flag(trap_exit, true),
          +    pong1().
           
          -pong1() ->
          +pong1() ->
               receive
          -        {ping, Ping_PID} ->
          -            io:format("Pong received ping~n", []),
          +        {ping, Ping_PID} ->
          +            io:format("Pong received ping~n", []),
                       Ping_PID ! pong,
          -            pong1();
          -        {'EXIT', From, Reason} ->
          -            io:format("pong exiting, got ~p~n", [{'EXIT', From, Reason}])
          +            pong1();
          +        {'EXIT', From, Reason} ->
          +            io:format("pong exiting, got ~p~n", [{'EXIT', From, Reason}])
               end.
           
          -start(Ping_Node) ->
          /usr/share/doc/packages/erlang27-doc/doc/system/search.html differs (HTML document, Unicode text, UTF-8 text)
          --- old//usr/share/doc/packages/erlang27-doc/doc/system/search.html	2026-06-04 19:05:01.171945550 +0000
          +++ new//usr/share/doc/packages/erlang27-doc/doc/system/search.html	2026-06-04 19:05:01.170438514 +0000
          @@ -112,7 +112,7 @@
           
             
          - + /usr/share/doc/packages/erlang27-doc/doc/system/seq_prog.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1535)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/seq_prog.html 2026-06-04 19:05:01.223439006 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/seq_prog.html 2026-06-04 19:05:01.223439006 +0000 @@ -140,13 +140,13 @@ more editing commands in the shell (see tty - A command line interface in ERTS User's Guide).

          (Notice that many line numbers given by the shell in the following examples are out of sequence. This is because this tutorial was written and code-tested in -separate sessions).

          Here is a bit more complex calculation:

          2> (42 + 77) * 66 / 3.
          +separate sessions).

          Here is a bit more complex calculation:

          2> (42 + 77) * 66 / 3.
           2618.0

          Notice the use of brackets, the multiplication operator *, and the division operator /, as in normal arithmetic (see Expressions).

          Press Control-C to shut down the Erlang system and the Erlang shell.

          The following output is shown:

          BREAK: (a)bort (c)ontinue (p)roc info (i)nfo (l)oaded
                  (v)ersion (k)ill (D)b-tables (d)istribution
           a
          -$

          Type a to leave the Erlang system.

          Another way to shut down the Erlang system is by entering halt/0:

          3> halt().
          +$

          Type a to leave the Erlang system.

          Another way to shut down the Erlang system is by entering halt/0:

          3> halt().
           $

          @@ -160,55 +160,55 @@ editor has an Erlang mode that makes it easier for you to enter and format your code nicely (see The Erlang mode for Emacs in Tools User's Guide), but you can manage perfectly well without. Here is the -code to enter:

          -module(tut).
          --export([double/1]).
          +code to enter:

          -module(tut).
          +-export([double/1]).
           
          -double(X) ->
          +double(X) ->
               2 * X.

          It is not hard to guess that this program doubles the value of numbers. The first two lines of the code are described later. Let us compile the program. -This can be done in an Erlang shell as follows, where c means compile:

          3> c(tut).
          -{ok,tut}

          The {ok,tut} means that the compilation is OK. If it says error it means +This can be done in an Erlang shell as follows, where c means compile:

          3> c(tut).
          +{ok,tut}

          The {ok,tut} means that the compilation is OK. If it says error it means that there is some mistake in the text that you entered. Additional error messages gives an idea to what is wrong so you can modify the text and then try -to compile the program again.

          Now run the program:

          4> tut:double(10).
          +to compile the program again.

          Now run the program:

          4> tut:double(10).
           20

          As expected, double of 10 is 20.

          Now let us get back to the first two lines of the code. Erlang programs are written in files. Each file contains an Erlang module. The first line of code -in the module is the module name (see Modules):

          -module(tut).

          Thus, the module is called tut. Notice the full stop . at the end of the +in the module is the module name (see Modules):

          -module(tut).

          Thus, the module is called tut. Notice the full stop . at the end of the line. The files which are used to store the module must have the same name as the module but with the extension .erl. In this case the file name is tut.erl. When using a function in another module, the syntax module_name:function_name(arguments) is used. So the following means call -function double in module tut with argument 10.

          4> tut:double(10).

          The second line says that the module tut contains a function called double, -which takes one argument (X in our example):

          -export([double/1]).

          The second line also says that this function can be called from outside the +function double in module tut with argument 10.

          4> tut:double(10).

          The second line says that the module tut contains a function called double, +which takes one argument (X in our example):

          -export([double/1]).

          The second line also says that this function can be called from outside the module tut. More about this later. Again, notice the . at the end of the line.

          Now for a more complicated example, the factorial of a number. For example, the -factorial of 4 is 4 3 2 * 1, which equals 24.

          Enter the following code in a file named tut1.erl:

          -module(tut1).
          --export([fac/1]).
          +factorial of 4 is 4  3  2 * 1, which equals 24.

          Enter the following code in a file named tut1.erl:

          -module(tut1).
          +-export([fac/1]).
           
          -fac(1) ->
          +fac(1) ->
               1;
          -fac(N) ->
          -    N * fac(N - 1).

          So this is a module, called tut1 that contains a function called fac>, which -takes one argument, N.

          The first part says that the factorial of 1 is 1.:

          fac(1) ->
          +fac(N) ->
          +    N * fac(N - 1).

          So this is a module, called tut1 that contains a function called fac>, which +takes one argument, N.

          The first part says that the factorial of 1 is 1.:

          fac(1) ->
               1;

          Notice that this part ends with a semicolon ; that indicates that there is more of the function fac> to come.

          The second part says that the factorial of N is N multiplied by the factorial of -N - 1:

          fac(N) ->
          -    N * fac(N - 1).

          Notice that this part ends with a . saying that there are no more parts of -this function.

          Compile the file:

          5> c(tut1).
          -{ok,tut1}

          And now calculate the factorial of 4.

          6> tut1:fac(4).
          +N - 1:

          fac(N) ->
          +    N * fac(N - 1).

          Notice that this part ends with a . saying that there are no more parts of +this function.

          Compile the file:

          5> c(tut1).
          +{ok,tut1}

          And now calculate the factorial of 4.

          6> tut1:fac(4).
           24

          Here the function fac> in module tut1 is called with argument 4.

          A function can have many arguments. Let us expand the module tut1 with the -function to multiply two numbers:

          -module(tut1).
          --export([fac/1, mult/2]).
          +function to multiply two numbers:

          -module(tut1).
          +-export([fac/1, mult/2]).
           
          -fac(1) ->
          +fac(1) ->
               1;
          -fac(N) ->
          -    N * fac(N - 1).
          +fac(N) ->
          +    N * fac(N - 1).
           
          -mult(X, Y) ->
          +mult(X, Y) ->
               X * Y.

          Notice that it is also required to expand the -export line with the -information that there is another function mult with two arguments.

          Compile:

          7> c(tut1).
          -{ok,tut1}

          Try out the new function mult:

          8> tut1:mult(3,4).
          +information that there is another function mult with two arguments.

          Compile:

          7> c(tut1).
          +{ok,tut1}

          Try out the new function mult:

          8> tut1:mult(3,4).
           12

          In this example the numbers are integers and the arguments in the functions in the code N, X, and Y are called variables. Variables must start with a capital letter (see Variables). Examples of @@ -222,56 +222,56 @@ Atom), for example, charles, centimeter, and inch. Atoms are simply names, nothing else. They are not like variables, which can have a value.

          Enter the next program in a file named tut2.erl). It can be useful for -converting from inches to centimeters and conversely:

          -module(tut2).
          --export([convert/2]).
          +converting from inches to centimeters and conversely:

          -module(tut2).
          +-export([convert/2]).
           
          -convert(M, inch) ->
          +convert(M, inch) ->
               M / 2.54;
           
          -convert(N, centimeter) ->
          -    N * 2.54.

          Compile:

          9> c(tut2).
          -{ok,tut2}

          Test:

          10> tut2:convert(3, inch).
          +convert(N, centimeter) ->
          +    N * 2.54.

          Compile:

          9> c(tut2).
          +{ok,tut2}

          Test:

          10> tut2:convert(3, inch).
           1.1811023622047243
          -11> tut2:convert(7, centimeter).
          +11> tut2:convert(7, centimeter).
           17.78

          Notice the introduction of decimals (floating point numbers) without any explanation. Hopefully you can cope with that.

          Let us see what happens if something other than centimeter or inch is -entered in the convert function:

          12> tut2:convert(3, miles).
          +entered in the convert function:

          12> tut2:convert(3, miles).
           ** exception error: no function clause matching tut2:convert(3,miles) (tut2.erl, line 4)

          The two parts of the convert function are called its clauses. As shown, miles is not part of either of the clauses. The Erlang system cannot match either of the clauses so an error message function_clause is returned. The shell formats the error message nicely, but the error tuple is saved in the -shell's history list and can be output by the shell command v/1:

          13> v(12).
          -{&#href_anchor"p">,{function_clause,[{tut2,convert,
          -                                [3,miles],
          -                                [{file,"tut2.erl"},{line,4}]},
          -                          {erl_eval,do_apply,6,
          -                                    [{file,"erl_eval.erl"},{line,677}]},
          -                          {shell,exprs,7,[{file,"shell.erl"},{line,687}]},
          -                          {shell,eval_exprs,7,[{file,"shell.erl"},{line,642}]},
          -                          {shell,eval_loop,3,
          -                                 [{file,"shell.erl"},{line,627}]}]}}

          +shell's history list and can be output by the shell command v/1:

          13> v(12).
          +{&#href_anchor"p">,{function_clause,[{tut2,convert,
          +                                [3,miles],
          +                                [{file,"tut2.erl"},{line,4}]},
          +                          {erl_eval,do_apply,6,
          +                                    [{file,"erl_eval.erl"},{line,677}]},
          +                          {shell,exprs,7,[{file,"shell.erl"},{line,687}]},
          +                          {shell,eval_exprs,7,[{file,"shell.erl"},{line,642}]},
          +                          {shell,eval_loop,3,
          +                                 [{file,"shell.erl"},{line,627}]}]}}

          Tuples

          -

          Now the tut2 program is hardly good programming style. Consider:

          tut2:convert(3, inch).

          Does this mean that 3 is in inches? Or does it mean that 3 is in centimeters and +

          Now the tut2 program is hardly good programming style. Consider:

          tut2:convert(3, inch).

          Does this mean that 3 is in inches? Or does it mean that 3 is in centimeters and is to be converted to inches? Erlang has a way to group things together to make things more understandable. These are called tuples and are surrounded by curly brackets, { and }.

          So, {inch,3} denotes 3 inches and {centimeter,5} denotes 5 centimeters. Now let us write a new program that converts centimeters to inches and conversely. -Enter the following code in a file called tut3.erl):

          -module(tut3).
          --export([convert_length/1]).
          +Enter the following code in a file called tut3.erl):

          -module(tut3).
          +-export([convert_length/1]).
           
          -convert_length({centimeter, X}) ->
          -    {inch, X / 2.54};
          -convert_length({inch, Y}) ->
          -    {centimeter, Y * 2.54}.

          Compile and test:

          14> c(tut3).
          -{ok,tut3}
          -15> tut3:convert_length({inch, 5}).
          -{centimeter,12.7}
          -16> tut3:convert_length(tut3:convert_length({inch, 5})).
          -{inch,5.0}

          Notice on line 16 that 5 inches is converted to centimeters and back again and +convert_length({centimeter, X}) -> + {inch, X / 2.54}; +convert_length({inch, Y}) -> + {centimeter, Y * 2.54}.

          Compile and test:

          14> c(tut3).
          +{ok,tut3}
          +15> tut3:convert_length({inch, 5}).
          +{centimeter,12.7}
          +16> tut3:convert_length(tut3:convert_length({inch, 5})).
          +{inch,5.0}

          Notice on line 16 that 5 inches is converted to centimeters and back again and reassuringly get back to the original value. That is, the argument to a function can be the result of another function. Consider how line 16 (above) works. The argument given to the function {inch,5} is first matched against the first @@ -280,9 +280,9 @@ before the ->). This having failed, let us try the head of the next clause that is, convert_length({inch,Y}). This matches, and Y gets the value 5.

          Tuples can have more than two parts, in fact as many parts as you want, and contain any valid Erlang term. For example, to represent the temperature of -various cities of the world:

          {moscow, {c, -10}}
          -{cape_town, {f, 70}}
          -{paris, {f, 28}}

          Tuples have a fixed number of items in them. Each item in a tuple is called an +various cities of the world:

          {moscow, {c, -10}}
          +{cape_town, {f, 70}}
          +{paris, {f, 28}}

          Tuples have a fixed number of items in them. Each item in a tuple is called an element. In the tuple {moscow,{c,-10}}, element 1 is moscow and element 2 is {c,-10}. Here c represents Celsius and f Fahrenheit.

          /usr/share/doc/packages/erlang27-doc/doc/system/spec_proc.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1679)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/spec_proc.html 2026-06-04 19:05:01.253439284 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/spec_proc.html 2026-06-04 19:05:01.253439284 +0000 @@ -127,64 +127,64 @@

          The sys module has functions for simple debugging of processes implemented using behaviours. The code_lock example from -gen_statem Behaviour is used to illustrate this:

          Erlang/OTP 27 [erts-15.0] [64-bit] [smp:8:8] [ds:8:8:10] [async-threads:1] [jit]
          +gen_statem Behaviour is used to illustrate this:

          Erlang/OTP 27 [erts-15.0] [64-bit] [smp:8:8] [ds:8:8:10] [async-threads:1] [jit]
           
          -Eshell V15.0 (press Ctrl+G to abort, type help(). for help)
          -1> code_lock:start_link([1,2,3,4]).
          +Eshell V15.0 (press Ctrl+G to abort, type help(). for help)
          +1> code_lock:start_link([1,2,3,4]).
           Lock
          -{ok,<0.90.0>}
          -2> sys:statistics(code_lock, true).
          +{ok,<0.90.0>}
          +2> sys:statistics(code_lock, true).
           ok
          -3> sys:trace(code_lock, true).
          +3> sys:trace(code_lock, true).
           ok
          -4> code_lock:button(1).
          -*DBG* code_lock receive cast {button,1} in state locked
          +4> code_lock:button(1).
          +*DBG* code_lock receive cast {button,1} in state locked
           ok
          -*DBG* code_lock consume cast {button,1} in state locked
          -5> code_lock:button(2).
          -*DBG* code_lock receive cast {button,2} in state locked
          +*DBG* code_lock consume cast {button,1} in state locked
          +5> code_lock:button(2).
          +*DBG* code_lock receive cast {button,2} in state locked
           ok
          -*DBG* code_lock consume cast {button,2} in state locked
          -6> code_lock:button(3).
          -*DBG* code_lock receive cast {button,3} in state locked
          +*DBG* code_lock consume cast {button,2} in state locked
          +6> code_lock:button(3).
          +*DBG* code_lock receive cast {button,3} in state locked
           ok
          -*DBG* code_lock consume cast {button,3} in state locked
          -7> code_lock:button(4).
          -*DBG* code_lock receive cast {button,4} in state locked
          +*DBG* code_lock consume cast {button,3} in state locked
          +7> code_lock:button(4).
          +*DBG* code_lock receive cast {button,4} in state locked
           ok
           Unlock
          -*DBG* code_lock consume cast {button,4} in state locked => open
          -*DBG* code_lock start_timer {state_timeout,10000,lock,[]} in state open
          +*DBG* code_lock consume cast {button,4} in state locked => open
          +*DBG* code_lock start_timer {state_timeout,10000,lock,[]} in state open
           *DBG* code_lock receive state_timeout lock in state open
           Lock
           *DBG* code_lock consume state_timeout lock in state open => locked
          -8> sys:statistics(code_lock, get).
          -{ok,[{start_time,{{2024,5,3},{8,11,1}}},
          -     {current_time,{{2024,5,3},{8,11,48}}},
          -     {reductions,4098},
          -     {messages_in,5},
          -     {messages_out,0}]}
          -9> sys:statistics(code_lock, false).
          +8> sys:statistics(code_lock, get).
          +{ok,[{start_time,{{2024,5,3},{8,11,1}}},
          +     {current_time,{{2024,5,3},{8,11,48}}},
          +     {reductions,4098},
          +     {messages_in,5},
          +     {messages_out,0}]}
          +9> sys:statistics(code_lock, false).
           ok
          -10> sys:trace(code_lock, false).
          +10> sys:trace(code_lock, false).
           ok
          -11> sys:get_status(code_lock).
          -{status,<0.90.0>,
          -        {module,gen_statem},
          -        [[{'$initial_call',{code_lock,init,1}},
          -          {'$ancestors',[<0.88.0>,<0.87.0>,<0.70.0>,<0.65.0>,<0.69.0>,
          -                         <0.64.0>,kernel_sup,<0.47.0>]}],
          -         running,<0.88.0>,[],
          -         [{header,"Status for state machine code_lock"},
          -          {data,[{"Status",running},
          -                 {"Parent",<0.88.0>},
          -                 {"Modules",[code_lock]},
          -                 {"Time-outs",{0,[]}},
          -                 {"Logged Events",[]},
          -                 {"Postponed",[]}]},
          -          {data,[{"State",
          -                  {locked,#{code => [1,2,3,4],
          -                            length => 4,buttons => []}}}]}]]}

          +11> sys:get_status(code_lock). +{status,<0.90.0>, + {module,gen_statem}, + [[{'$initial_call',{code_lock,init,1}}, + {'$ancestors',[<0.88.0>,<0.87.0>,<0.70.0>,<0.65.0>,<0.69.0>, + <0.64.0>,kernel_sup,<0.47.0>]}], + running,<0.88.0>,[], + [{header,"Status for state machine code_lock"}, + {data,[{"Status",running}, + {"Parent",<0.88.0>}, + {"Modules",[code_lock]}, + {"Time-outs",{0,[]}}, + {"Logged Events",[]}, + {"Postponed",[]}]}, + {data,[{"State", + {locked,#{code => [1,2,3,4], + length => 4,buttons => []}}}]}]]}

          @@ -202,109 +202,109 @@

          Here follows the simple server from Overview, -implemented using sys and proc_lib to fit into a supervision tree:

          -module(ch4).
          --export([start_link/0]).
          --export([alloc/0, free/1]).
          --export([init/1]).
          --export([system_continue/3, system_terminate/4,
          +implemented using sys and proc_lib to fit into a supervision tree:

          -module(ch4).
          +-export([start_link/0]).
          +-export([alloc/0, free/1]).
          +-export([init/1]).
          +-export([system_continue/3, system_terminate/4,
                    write_debug/3,
          -         system_get_state/1, system_replace_state/2]).
          +         system_get_state/1, system_replace_state/2]).
           
          -start_link() ->
          -    proc_lib:start_link(ch4, init, [self()]).
          +start_link() ->
          +    proc_lib:start_link(ch4, init, [self()]).
           
          -alloc() ->
          -    ch4 ! {self(), alloc},
          +alloc() ->
          +    ch4 ! {self(), alloc},
               receive
          -        {ch4, Res} ->
          +        {ch4, Res} ->
                       Res
               end.
           
          -free(Ch) ->
          -    ch4 ! {free, Ch},
          +free(Ch) ->
          +    ch4 ! {free, Ch},
               ok.
           
          -init(Parent) ->
          -    register(ch4, self()),
          -    Chs = channels(),
          -    Deb = sys:debug_options([]),
          -    proc_lib:init_ack(Parent, {ok, self()}),
          -    loop(Chs, Parent, Deb).
          +init(Parent) ->
          +    register(ch4, self()),
          +    Chs = channels(),
          +    Deb = sys:debug_options([]),
          +    proc_lib:init_ack(Parent, {ok, self()}),
          +    loop(Chs, Parent, Deb).
           
          -loop(Chs, Parent, Deb) ->
          +loop(Chs, Parent, Deb) ->
               receive
          -        {From, alloc} ->
          -            Deb2 = sys:handle_debug(Deb, fun ch4:write_debug/3,
          -                                    ch4, {in, alloc, From}),
          -            {Ch, Chs2} = alloc(Chs),
          -            From ! {ch4, Ch},
          -            Deb3 = sys:handle_debug(Deb2, fun ch4:write_debug/3,
          -                                    ch4, {out, {ch4, Ch}, From}),
          -            loop(Chs2, Parent, Deb3);
          -        {free, Ch} ->
          -            Deb2 = sys:handle_debug(Deb, fun ch4:write_debug/3,
          -                                    ch4, {in, {free, Ch}}),
          -            Chs2 = free(Ch, Chs),
          -            loop(Chs2, Parent, Deb2);
          -
          -        {system, From, Request} ->
          -            sys:handle_system_msg(Request, From, Parent,
          -                                  ch4, Deb, Chs)
          +        {From, alloc} ->
          +            Deb2 = sys:handle_debug(Deb, fun ch4:write_debug/3,
          +                                    ch4, {in, alloc, From}),
          +            {Ch, Chs2} = alloc(Chs),
          +            From ! {ch4, Ch},
          +            Deb3 = sys:handle_debug(Deb2, fun ch4:write_debug/3,
          +                                    ch4, {out, {ch4, Ch}, From}),
          +            loop(Chs2, Parent, Deb3);
          +        {free, Ch} ->
          +            Deb2 = sys:handle_debug(Deb, fun ch4:write_debug/3,
          +                                    ch4, {in, {free, Ch}}),
          +            Chs2 = free(Ch, Chs),
          +            loop(Chs2, Parent, Deb2);
          +
          +        {system, From, Request} ->
          +            sys:handle_system_msg(Request, From, Parent,
          +                                  ch4, Deb, Chs)
          /usr/share/doc/packages/erlang27-doc/doc/system/statem.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1044))
          --- old//usr/share/doc/packages/erlang27-doc/doc/system/statem.html	2026-06-04 19:05:01.297439692 +0000
          +++ new//usr/share/doc/packages/erlang27-doc/doc/system/statem.html	2026-06-04 19:05:01.297439692 +0000
          @@ -128,7 +128,7 @@
           a state transition and the output is actions executed during
           the state transition.  Analogously to the mathematical model
           of a Finite State Machine, it can be described as a set of relations
          -of the following form:

          State(S) x Event(E) -> Actions(A), State(S')

          These relations are interpreted as follows: if we are in state S, +of the following form:

          State(S) x Event(E) -> Actions(A), State(S')

          These relations are interpreted as follows: if we are in state S, and event E occurs, we are to perform actions A, and make a transition to state S'. Notice that S' can be equal to S, and that A can be empty.

          In gen_statem we define a state change as a state transition in which the @@ -409,12 +409,12 @@ mode, automatically call the state callback with special arguments whenever the state changes, so you can write state enter actions near the rest of the state transition rules. -It typically looks like this:

          StateName(enter, OldState, Data) ->
          +It typically looks like this:

          StateName(enter, OldState, Data) ->
               ... code for state enter actions here ...
          -    {keep_state, NewData};
          -StateName(EventType, EventContent, Data) ->
          +    {keep_state, NewData};
          +StateName(EventType, EventContent, Data) ->
               ... code for actions here ...
          -    {next_state, NewStateName, NewData}.

          Since the state enter call is not an event there are restrictions on the + {next_state, NewStateName, NewData}.

          Since the state enter call is not an event there are restrictions on the allowed return value and state transition actions. You must not change the state, postpone this non-event, insert any events, or change the @@ -503,55 +503,55 @@ open --> open : {button, Digit} open --> locked : state_timeout\n* do_lock()

          This code lock state machine can be implemented using gen_statem with -the following callback module:

          -module(code_lock).
          --behaviour(gen_statem).
          --define(NAME, code_lock).
          +the following callback module:

          -module(code_lock).
          +-behaviour(gen_statem).
          +-define(NAME, code_lock).
           
          --export([start_link/1]).
          --export([button/1]).
          --export([init/1,callback_mode/0,terminate/3]).
          --export([locked/3,open/3]).
          -
          -start_link(Code) ->
          -    gen_statem:start_link({local,?NAME}, ?MODULE, Code, []).
          -
          -button(Button) ->
          -    gen_statem:cast(?NAME, {button,Button}).
          -
          -init(Code) ->
          -    do_lock(),
          -    Data = #href_anchor"ss">code => Code, length => length(Code), buttons => []},
          -    {ok, locked, Data}.
          -
          -callback_mode() ->
          -    state_functions.
          locked(
          -  cast, {button,Button},
          -  #{code := Code, length := Length, buttons := Buttons} = Data) ->
          +-export([start_link/1]).
          +-export([button/1]).
          +-export([init/1,callback_mode/0,terminate/3]).
          +-export([locked/3,open/3]).
          +
          +start_link(Code) ->
          +    gen_statem:start_link({local,?NAME}, ?MODULE, Code, []).
          +
          +button(Button) ->
          +    gen_statem:cast(?NAME, {button,Button}).
          +
          +init(Code) ->
          +    do_lock(),
          +    Data = #href_anchor"ss">code => Code, length => length(Code), buttons => []},
          +    {ok, locked, Data}.
          +
          +callback_mode() ->
          +    state_functions.
          locked(
          +  cast, {button,Button},
          +  #{code := Code, length := Length, buttons := Buttons} = Data) ->
               NewButtons =
                   if
          -            length(Buttons) < Length ->
          +            length(Buttons) < Length ->
                           Buttons;
                       true ->
          -                tl(Buttons)
          -        end ++ [Button],
          +                tl(Buttons)
          +        end ++ [Button],
               if
                   NewButtons =:= Code -> % Correct
          -	    do_unlock(),
          -            {next_state, open, Data#{buttons := []},
          -             [{state_timeout,10_000,lock}]}; % Time in milliseconds
          +	    do_unlock(),
          +            {next_state, open, Data#{buttons := []},
          +             [{state_timeout,10_000,lock}]}; % Time in milliseconds
           	true -> % Incomplete | Incorrect
          -            {next_state, locked, Data#{buttons := NewButtons}}
          -    end.
          open(state_timeout, lock,  Data) ->
          -    do_lock(),
          -    {next_state, locked, Data};
          -open(cast, {button,_}, Data) ->
          -    {next_state, open, Data}.
          do_lock() ->
          -    io:format("Lock~n", []).
          -do_unlock() ->
          -    io:format("Unlock~n", []).
          +            {next_state, locked, Data#{buttons := NewButtons}}
          +    end.
          open(state_timeout, lock,  Data) ->
          +    do_lock(),
          +    {next_state, locked, Data};
          +open(cast, {button,_}, Data) ->
          +    {next_state, open, Data}.
          do_lock() ->
          +    io:format("Lock~n", []).
          +do_unlock() ->
          +    io:format("Unlock~n", []).
           
          -terminate(_Reason, State, _Data) ->
          -    State =/= locked andalso do_lock(),
          +terminate(_Reason, State, _Data) ->
          +    State =/= locked andalso do_lock(),
               ok.

          The code is explained in the next sections.

          @@ -559,8 +559,8 @@ Starting gen_statem

          In the example in the previous section, gen_statem is started by calling -code_lock:start_link(Code):

          start_link(Code) ->
          -    gen_statem:start_link({local,?NAME}, ?MODULE, Code, []).

          start_link/1 calls function gen_statem:start_link/4, +code_lock:start_link(Code):

          start_link(Code) ->
          +    gen_statem:start_link({local,?NAME}, ?MODULE, Code, []).

          start_link/1 calls function gen_statem:start_link/4, which spawns and links to a new process, a gen_statem.

          • The first argument, {local,?NAME}, specifies the name. In this case, the gen_statem is locally registered as code_lock through the macro ?NAME.

            If the name is omitted, the gen_statem is not registered. Instead its pid must be used. The name can also be specified as {global, Name}, then the @@ -578,10 +578,10 @@ Data is the internal server data of the gen_statem. Here the server data is a map() with key code that stores the correct button sequence, key length store its length, and key buttons -that stores the collected buttons up to the same length.

            init(Code) ->
            -    do_lock(),
            -    Data = #href_anchor"ss">code => Code, length => length(Code), buttons => []},
            -    {ok, locked, Data}.

            Function gen_statem:start_link/3,4 +that stores the collected buttons up to the same length.

            init(Code) ->
            +    do_lock(),
            +    Data = #href_anchor"ss">code => Code, length => length(Code), buttons => []},
            +    {ok, locked, Data}.

            Function gen_statem:start_link/3,4 is synchronous. It does not return until the gen_statem is initialized and is ready to receive events.

            Function gen_statem:start_link/3,4 must be used if the gen_statem is part of a supervision tree, that is, @@ -590,7 +590,7 @@ a standalone gen_statem, meaning it is not part of a supervision tree.

            Function Module:callback_mode/0 selects the CallbackMode for the callback module, in this case state_functions. -That is, each state has its own handler function:

            callback_mode() ->
            +That is, each state has its own handler function:

            callback_mode() ->
                 state_functions.

            @@ -598,8 +598,8 @@ Handling Events

            The function notifying the code lock about a button event is implemented using -gen_statem:cast/2:

            button(Button) ->
            -    gen_statem:cast(?NAME, {button,Button}).

            The first argument is the name of the gen_statem and must agree with +gen_statem:cast/2:

            button(Button) ->
            +    gen_statem:cast(?NAME, {button,Button}).

            The first argument is the name of the gen_statem and must agree with the name used to start it. So, we use the same macro ?NAME as when starting. {button, Button} is the event content.

            The event is sent to the gen_statem. When the event is received, the gen_statem calls StateName(cast, Event, Data), which is expected @@ -607,30 +607,30 @@ {next_state, NewStateName, NewData, Actions}. StateName is the name of the current state and NewStateName is the name of the next state. NewData is a new value for the server data of the gen_statem, -and Actions is a list of actions to be performed by the gen_statem engine.

            locked(
            -  cast, {button,Button},
            -  #{code := Code, length := Length, buttons := Buttons} = Data) ->
            +and Actions is a list of actions to be performed by the gen_statem engine.

            locked(
            +  cast, {button,Button},
            +  #{code := Code, length := Length, buttons := Buttons} = Data) ->
                 NewButtons =
                     if
            -            length(Buttons) < Length ->
            +            length(Buttons) < Length ->
                             Buttons;
                         true ->
            -                tl(Buttons)
            -        end ++ [Button],
            +                tl(Buttons)
            +        end ++ [Button],
                 if
                     NewButtons =:= Code -> % Correct
            -	    do_unlock(),
            -            {next_state, open, Data#{buttons := []},
            -             [{state_timeout,10_000,lock}]}; % Time in milliseconds
            +	    do_unlock(),
            +            {next_state, open, Data#{buttons := []},
            +             [{state_timeout,10_000,lock}]}; % Time in milliseconds
             	true -> % Incomplete | Incorrect
            -            {next_state, locked, Data#{buttons := NewButtons}}
            /usr/share/doc/packages/erlang27-doc/doc/system/sup_princ.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1319))
            --- old//usr/share/doc/packages/erlang27-doc/doc/system/sup_princ.html	2026-06-04 19:05:01.322439924 +0000
            +++ new//usr/share/doc/packages/erlang27-doc/doc/system/sup_princ.html	2026-06-04 19:05:01.323439933 +0000
            @@ -132,24 +132,24 @@
               Example
             

          The callback module for a supervisor starting the server from -gen_server Behaviour can look as follows:

          -module(ch_sup).
          --behaviour(supervisor).
          +gen_server Behaviour can look as follows:

          -module(ch_sup).
          +-behaviour(supervisor).
           
          --export([start_link/0]).
          --export([init/1]).
          +-export([start_link/0]).
          +-export([init/1]).
           
          -start_link() ->
          -    supervisor:start_link(ch_sup, []).
          +start_link() ->
          +    supervisor:start_link(ch_sup, []).
           
          -init(_Args) ->
          -    SupFlags = #href_anchor"ss">strategy => one_for_one, intensity => 1, period => 5},
          -    ChildSpecs = [#{id => ch3,
          -                    start => {ch3, start_link, []},
          +init(_Args) ->
          +    SupFlags = #href_anchor"ss">strategy => one_for_one, intensity => 1, period => 5},
          +    ChildSpecs = [#{id => ch3,
          +                    start => {ch3, start_link, []},
                               restart => permanent,
                               shutdown => brutal_kill,
                               type => worker,
          -                    modules => [ch3]}],
          -    {ok, {SupFlags, ChildSpecs}}.

          The SupFlags variable in the return value from init/1 represents the + modules => [ch3]}], + {ok, {SupFlags, ChildSpecs}}.

          The SupFlags variable in the return value from init/1 represents the supervisor flags.

          The ChildSpecs variable in the return value from init/1 is a list of child specifications.

          @@ -157,15 +157,15 @@ Supervisor Flags

          -

          This is the type definition for the supervisor flags:

          sup_flags() = #{strategy => strategy(),           % optional
          -                intensity => non_neg_integer(),   % optional
          -                period => pos_integer(),          % optional
          -                auto_shutdown => auto_shutdown()} % optional
          -    strategy() = one_for_all
          +

          This is the type definition for the supervisor flags:

          sup_flags() = #{strategy => strategy(),           % optional
          +                intensity => non_neg_integer(),   % optional
          +                period => pos_integer(),          % optional
          +                auto_shutdown => auto_shutdown()} % optional
          +    strategy() = one_for_all
                          | one_for_one
                          | rest_for_one
                          | simple_one_for_one
          -    auto_shutdown() = never
          +    auto_shutdown() = never
                               | any_significant
                               | all_significant

          -

          The type definition for a child specification is as follows:

          child_spec() = #{id => child_id(),             % mandatory
          -                 start => mfargs(),            % mandatory
          -                 restart => restart(),         % optional
          -                 significant => significant(), % optional
          -                 shutdown => shutdown(),       % optional
          -                 type => worker(),             % optional
          -                 modules => modules()}         % optional
          -    child_id() = term()
          -    mfargs() = {M :: module(), F :: atom(), A :: [term()]}
          -    modules() = [module()] | dynamic
          -    restart() = permanent | transient | temporary
          -    significant() = boolean()
          -    shutdown() = brutal_kill | timeout()
          -    worker() = worker | supervisor
          • id is used to identify the child specification internally by the supervisor.

            The id key is mandatory.

            Note that this identifier occasionally has been called "name". As far as +

            The type definition for a child specification is as follows:

            child_spec() = #{id => child_id(),             % mandatory
            +                 start => mfargs(),            % mandatory
            +                 restart => restart(),         % optional
            +                 significant => significant(), % optional
            +                 shutdown => shutdown(),       % optional
            +                 type => worker(),             % optional
            +                 modules => modules()}         % optional
            +    child_id() = term()
            +    mfargs() = {M :: module(), F :: atom(), A :: [term()]}
            +    modules() = [module()] | dynamic
            +    restart() = permanent | transient | temporary
            +    significant() = boolean()
            +    shutdown() = brutal_kill | timeout()
            +    worker() = worker | supervisor
            • id is used to identify the child specification internally by the supervisor.

              The id key is mandatory.

              Note that this identifier occasionally has been called "name". As far as possible, the terms "identifier" or "id" are now used but in order to keep backwards compatibility, some occurrences of "name" can still be found, for example in error messages.

            • start defines the function call used to start the child process. It is a @@ -461,32 +461,32 @@ name of the callback module.

            This information is used by the release handler during upgrades and downgrades; see Release Handling.

            The modules key is optional. If it is not given, it defaults to [M], where M comes from the child's start {M,F,A}.

          Example: The child specification to start the server ch3 in the previous -example look as follows:

          #href_anchor"ss">id => ch3,
          -  start => {ch3, start_link, []},
          +example look as follows:

          #href_anchor"ss">id => ch3,
          +  start => {ch3, start_link, []},
             restart => permanent,
             shutdown => brutal_kill,
             type => worker,
          -  modules => [ch3]}

          or simplified, relying on the default values:

          #{id => ch3,
          +  modules => [ch3]}

          or simplified, relying on the default values:

          #{id => ch3,
             start => {ch3, start_link, []},
             shutdown => brutal_kill}

          Example: A child specification to start the event manager from the chapter about -gen_event:

          #{id => error_man,
          -  start => {gen_event, start_link, [{local, error_man}]},
          -  modules => dynamic}

          Both server and event manager are registered processes which can be expected to +gen_event:

          #{id => error_man,
          +  start => {gen_event, start_link, [{local, error_man}]},
          +  modules => dynamic}

          Both server and event manager are registered processes which can be expected to be always accessible. Thus they are specified to be permanent.

          ch3 does not need to do any cleaning up before termination. Thus, no shutdown time is needed, but brutal_kill is sufficient. error_man can need some time for the event handlers to clean up, thus the shutdown time is set to 5000 ms -(which is the default value).

          Example: A child specification to start another supervisor:

          #{id => sup,
          -  start => {sup, start_link, []},
          +(which is the default value).

          Example: A child specification to start another supervisor:

          #{id => sup,
          +  start => {sup, start_link, []},
             restart => transient,
          -  type => supervisor} % will cause default shutdown=>infinity

          + type => supervisor} % will cause default shutdown=>infinity

          Starting a Supervisor

          In the previous example, the supervisor is started by calling -ch_sup:start_link():

          start_link() ->
          -    supervisor:start_link(ch_sup, []).

          ch_sup:start_link calls function supervisor:start_link/2, which spawns and +ch_sup:start_link():

          start_link() ->
          +    supervisor:start_link(ch_sup, []).

          ch_sup:start_link calls function supervisor:start_link/2, which spawns and links to a new process, a supervisor.

          • The first argument, ch_sup, is the name of the callback module, that is, the module where the init callback function is located.
          • The second argument, [], is a term that is passed as is to the callback function init. Here, init does not need any data and ignores the argument.

          In this case, the supervisor is not registered. Instead its pid must be used. A @@ -494,12 +494,12 @@ supervisor:start_link({local, Name}, Module, Args) or supervisor:start_link({global, Name}, Module, Args).

          The new supervisor process calls the callback function ch_sup:init([]). init -has to return {ok, {SupFlags, ChildSpecs}}:

          init(_Args) ->
          -    SupFlags = #{},
          -    ChildSpecs = [#{id => ch3,
          -                    start => {ch3, start_link, []},
          -                    shutdown => brutal_kill}],
          -    {ok, {SupFlags, ChildSpecs}}.

          Subsequently, the supervisor starts its child processes according to the child +has to return {ok, {SupFlags, ChildSpecs}}:

          init(_Args) ->
          +    SupFlags = #{},
          +    ChildSpecs = [#{id => ch3,
          +                    start => {ch3, start_link, []},
          +                    shutdown => brutal_kill}],
          +    {ok, {SupFlags, ChildSpecs}}.

          Subsequently, the supervisor starts its child processes according to the child specifications in the start specification. In this case there is a single child process, called ch3.

          supervisor:start_link/3 is synchronous. It does not return until all child processes have been started.

          @@ -536,23 +536,23 @@

          A supervisor with restart strategy simple_one_for_one is a simplified one_for_one supervisor, where all child processes are dynamically added instances of the same process.

          The following is an example of a callback module for a simple_one_for_one -supervisor:

          -module(simple_sup).
          --behaviour(supervisor).
          +supervisor:

          -module(simple_sup).
          +-behaviour(supervisor).
           
          --export([start_link/0]).
          --export([init/1]).
          +-export([start_link/0]).
          +-export([init/1]).
           
          -start_link() ->
          -    supervisor:start_link(simple_sup, []).
          +start_link() ->
          +    supervisor:start_link(simple_sup, []).
           
          -init(_Args) ->
          -    SupFlags = #{strategy => simple_one_for_one,
          +init(_Args) ->
          +    SupFlags = #{strategy => simple_one_for_one,
                            intensity => 0,
          -                 period => 1},
          -    ChildSpecs = [#{id => call,
          -                    start => {call, start_link, []},
          -                    shutdown => brutal_kill}],
          -    {ok, {SupFlags, ChildSpecs}}.

          When started, the supervisor does not start any child + period => 1}, + ChildSpecs = [#{id => call, + start => {call, start_link, []}, + shutdown => brutal_kill}], + {ok, {SupFlags, ChildSpecs}}.

          When started, the supervisor does not start any child processes. Instead, all child processes need to be added dynamically by calling supervisor:start_child(Sup, List).

          Sup is the pid, or name, of the supervisor. List is an arbitrary list of terms, which are added to the list of arguments specified in the child @@ -664,7 +664,7 @@ Erlang programming language

          /usr/share/doc/packages/erlang27-doc/doc/system/system_limits.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/system/system_limits.html 2026-06-04 19:05:01.342440109 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/system_limits.html 2026-06-04 19:05:01.342440109 +0000 @@ -217,7 +217,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/doc/system/system_principles.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (2346)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/system_principles.html 2026-06-04 19:05:01.359440267 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/system_principles.html 2026-06-04 19:05:01.359440267 +0000 @@ -270,7 +270,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/doc/system/tablesdatabases.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1432)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/tablesdatabases.html 2026-06-04 19:05:01.379440453 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/tablesdatabases.html 2026-06-04 19:05:01.379440453 +0000 @@ -150,11 +150,11 @@

          The delete operation is considered successful if the element was not present in the table. Hence all attempts to check that the element is present in the Ets/Mnesia table before deletion are unnecessary. Here follows an example for -Ets tables:

          DO

          ets:delete(Tab, Key),

          DO NOT

          case ets:lookup(Tab, Key) of
          -    [] ->
          +Ets tables:

          DO

          ets:delete(Tab, Key),

          DO NOT

          case ets:lookup(Tab, Key) of
          +    [] ->
                   ok;
          -    [_|_] ->
          -        ets:delete(Tab, Key)
          +    [_|_] ->
          +        ets:delete(Tab, Key)
           end,

          @@ -166,49 +166,49 @@ functions print_name/1, print_age/1, and print_occupation/1.

          Note

          If the function print_name/1, and so on, had been interface functions, the situation would have been different, as you do not want the user of the interface to know about the internal data representation.

          DO

          %%% Interface function
          -print_person(PersonId) ->
          +print_person(PersonId) ->
               %% Look up the person in the named table person,
          -    case ets:lookup(person, PersonId) of
          -        [Person] ->
          -            print_name(Person),
          -            print_age(Person),
          -            print_occupation(Person);
          -        [] ->
          -            io:format("No person with ID = ~p~n", [PersonID])
          +    case ets:lookup(person, PersonId) of
          +        [Person] ->
          +            print_name(Person),
          +            print_age(Person),
          +            print_occupation(Person);
          +        [] ->
          +            io:format("No person with ID = ~p~n", [PersonID])
               end.
           
           %%% Internal functions
          -print_name(Person) ->
          -    io:format("No person ~p~n", [Person#person.name]).
          +print_name(Person) ->
          +    io:format("No person ~p~n", [Person#person.name]).
           
          -print_age(Person) ->
          -    io:format("No person ~p~n", [Person#person.age]).
          +print_age(Person) ->
          +    io:format("No person ~p~n", [Person#person.age]).
           
          -print_occupation(Person) ->
          -    io:format("No person ~p~n", [Person#person.occupation]).

          DO NOT

          %%% Interface function
          -print_person(PersonId) ->
          +print_occupation(Person) ->
          +    io:format("No person ~p~n", [Person#person.occupation]).

          DO NOT

          %%% Interface function
          +print_person(PersonId) ->
               %% Look up the person in the named table person,
          -    case ets:lookup(person, PersonId) of
          -        [Person] ->
          -            print_name(PersonID),
          -            print_age(PersonID),
          -            print_occupation(PersonID);
          -        [] ->
          -            io:format("No person with ID = ~p~n", [PersonID])
          +    case ets:lookup(person, PersonId) of
          +        [Person] ->
          +            print_name(PersonID),
          +            print_age(PersonID),
          +            print_occupation(PersonID);
          +        [] ->
          +            io:format("No person with ID = ~p~n", [PersonID])
               end.
           
           %%% Internal functions
          -print_name(PersonID) ->
          -    [Person] = ets:lookup(person, PersonId),
          -    io:format("No person ~p~n", [Person#person.name]).
          -
          -print_age(PersonID) ->
          -    [Person] = ets:lookup(person, PersonId),
          -    io:format("No person ~p~n", [Person#person.age]).
          -
          -print_occupation(PersonID) ->
          -    [Person] = ets:lookup(person, PersonId),
          -    io:format("No person ~p~n", [Person#person.occupation]).

          +print_name(PersonID) -> + [Person] = ets:lookup(person, PersonId), + io:format("No person ~p~n", [Person#person.name]). + +print_age(PersonID) -> + [Person] = ets:lookup(person, PersonId), + io:format("No person ~p~n", [Person#person.age]). + +print_occupation(PersonID) -> + [Person] = ets:lookup(person, PersonId), + io:format("No person ~p~n", [Person#person.occupation]).

          @@ -230,30 +230,30 @@ #person{idno = 4, name = "Carl", age = 25, occupation = "mailman"}]

          If you must return all data stored in the Ets table, you can use ets:tab2list/1. However, usually you are only interested in a subset of the information in which case ets:tab2list/1 is expensive. If you only want to -extract one field from each record, for example, the age of every person, then:

          DO

          ets:select(Tab, [{#person{idno='_',
          +extract one field from each record, for example, the age of every person, then:

          DO

          ets:select(Tab, [{#person{idno='_',
                                     name='_',
                                     age='$1',
          -                          occupation = '_'},
          -                [],
          -                ['$1']}]),

          DO NOT

          TabList = ets:tab2list(Tab),
          -lists:map(fun(X) -> X#person.age end, TabList),

          If you are only interested in the age of all persons named "Bryan", then:

          DO

          ets:select(Tab, [{#person{idno='_',
          +                          occupation = '_'},
          +                [],
          +                ['$1']}]),

          DO NOT

          TabList = ets:tab2list(Tab),
          +lists:map(fun(X) -> X#person.age end, TabList),

          If you are only interested in the age of all persons named "Bryan", then:

          DO

          ets:select(Tab, [{#person{idno='_',
                                     name="Bryan",
                                     age='$1',
          -                          occupation = '_'},
          -                [],
          -                ['$1']}])

          DO NOT

          TabList = ets:tab2list(Tab),
          -lists:foldl(fun(X, Acc) -> case X#person.name of
          +                          occupation = '_'},
          +                [],
          +                ['$1']}])

          DO NOT

          TabList = ets:tab2list(Tab),
          +lists:foldl(fun(X, Acc) -> case X#person.name of
                                           "Bryan" ->
          -                                    [X#person.age|Acc];
          +                                    [X#person.age|Acc];
                                            _ ->
                                                Acc
                                      end
          -             end, [], TabList)

          If you need all information stored in the Ets table about persons named "Bryan", -then:

          DO

          ets:select(Tab, [{#person{idno='_',
          +             end, [], TabList)

          If you need all information stored in the Ets table about persons named "Bryan", +then:

          DO

          ets:select(Tab, [{#person{idno='_',
                                     name="Bryan",
                                     age='_',
          -                          occupation = '_'}, [], ['$_']}]),

          DO NOT

          TabList = ets:tab2list(Tab),
          -lists:filter(fun(X) -> X#person.name == "Bryan" end, TabList),

          + occupation = '_'}, [], ['$_']}]),

          DO NOT

          TabList = ets:tab2list(Tab),
          +lists:filter(fun(X) -> X#person.name == "Bryan" end, TabList),

          @@ -297,12 +297,12 @@ #index_entry{name="Bryan", idno=2}, #index_entry{name="Bryan", idno=3}, #index_entry{name="Carl", idno=4}]

          Given this index table, a lookup of the age fields for all persons named -"Bryan" can be done as follows:

          MatchingIDs = ets:lookup(IndexTable,"Bryan"),
          -lists:map(fun(#index_entry{idno = ID}) ->
          -                 [#person{age = Age}] = ets:lookup(PersonTable, ID),
          +"Bryan" can be done as follows:

          MatchingIDs = ets:lookup(IndexTable,"Bryan"),
          +lists:map(fun(#index_entry{idno = ID}) ->
          +                 [#person{age = Age}] = ets:lookup(PersonTable, ID),
                            Age
                     end,
          -          MatchingIDs),

          Notice that this code does not use ets:match/2, but instead uses the + MatchingIDs),

          Notice that this code does not use ets:match/2, but instead uses the ets:lookup/2 call. The lists:map/2 call is only used to traverse the idnos matching the name "Bryan" in the table; thus the number of lookups in the master table is minimized.

          Keeping an index table introduces some overhead when inserting records in the @@ -325,17 +325,17 @@ mnesia:match_object() as these function traverse the whole table. Instead, you can create a secondary index and use mnesia:index_read/3 to get faster access at the expense of using more -memory.

          Example:

          -record(person, {idno, name, age, occupation}).
          +memory.

          Example:

          -record(person, {idno, name, age, occupation}).
                   ...
          -{atomic, ok} =
          -mnesia:create_table(person, [{index,[#person.age]},
          -                              {attributes,
          -                                    record_info(fields, person)}]),
          -{atomic, ok} = mnesia:add_table_index(person, age),
          +{atomic, ok} =
          +mnesia:create_table(person, [{index,[#person.age]},
          +                              {attributes,
          +                                    record_info(fields, person)}]),
          +{atomic, ok} = mnesia:add_table_index(person, age),
           ...
           
           PersonsAge42 =
          -     mnesia:dirty_index_read(person, 42, #person.age),

          + mnesia:dirty_index_read(person, 42, #person.age),

          @@ -349,19 +349,19 @@ the table. Other processes must send update requests to that process.

          Example:

          ...
           %% Using transaction
           
          -Fun = fun() ->
          -          [mnesia:read({Table, Key}),
          -           mnesia:read({Table2, Key2})]
          +Fun = fun() ->
          +          [mnesia:read({Table, Key}),
          +           mnesia:read({Table2, Key2})]
                 end,
           
          /usr/share/doc/packages/erlang27-doc/doc/system/tutorial.html differs (HTML document, Unicode text, UTF-8 text)
          --- old//usr/share/doc/packages/erlang27-doc/doc/system/tutorial.html	2026-06-04 19:05:01.397440620 +0000
          +++ new//usr/share/doc/packages/erlang27-doc/doc/system/tutorial.html	2026-06-04 19:05:01.397440620 +0000
          @@ -188,7 +188,7 @@
                     Erlang programming language
           
                 

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/doc/system/typespec.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (7081)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/typespec.html 2026-06-04 19:05:01.420440833 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/typespec.html 2026-06-04 19:05:01.420440833 +0000 @@ -241,11 +241,11 @@ predefined aliases for the type unions also shown in the table.

          Built-in typeDefined as
          term/0any/0
          binary/0<<_:_*8>>
          nonempty_binary/0<<_:8, _:_*8>>
          bitstring/0<<_:_*1>>
          nonempty_bitstring/0<<_:1, _:_*1>>
          boolean/0'false' | 'true'
          byte/00..255
          char/00..16#10ffff
          nil/0[]
          number/0integer/0 | float/0
          list/0[any()]
          maybe_improper_list/0maybe_improper_list(any(), any())
          nonempty_list/0nonempty_list(any())
          string/0[char()]
          nonempty_string/0[char(),...]
          iodata/0iolist() | binary()
          iolist/0maybe_improper_list(byte() | binary() | iolist(), binary() | [])
          map/0#{any() => any()}
          function/0fun()
          module/0atom/0
          mfa/0{module(),atom(),arity()}
          arity/00..255
          identifier/0pid() | port() | reference()
          node/0atom/0
          timeout/0'infinity' | non_neg_integer()
          no_return/0none/0

          Table: Built-in types, predefined aliases

          In addition, the following three built-in types exist and can be thought as defined below, though strictly their "type definition" is not valid syntax according to the type language defined above.

          Built-in typeCan be thought defined by the syntax
          non_neg_integer/00..
          pos_integer/01..
          neg_integer/0..-1

          Table: Additional built-in types

          Note

          The following built-in list types also exist, but they are expected to be -rarely used. Hence, they have long names:

          nonempty_maybe_improper_list() :: nonempty_maybe_improper_list(any(), any())
          -nonempty_improper_list(Type1, Type2)
          -nonempty_maybe_improper_list(Type1, Type2)

          where the last two types define the set of Erlang terms one would expect.

          Also for convenience, record notation is allowed to be used. Records are -shorthands for the corresponding tuples:

          Record :: #Erlang_Atom{}
          -        | #Erlang_Atom{Fields}

          Records are extended to possibly contain type information. This is described in +rarely used. Hence, they have long names:

          nonempty_maybe_improper_list() :: nonempty_maybe_improper_list(any(), any())
          +nonempty_improper_list(Type1, Type2)
          +nonempty_maybe_improper_list(Type1, Type2)

          where the last two types define the set of Erlang terms one would expect.

          Also for convenience, record notation is allowed to be used. Records are +shorthands for the corresponding tuples:

          Record :: #Erlang_Atom{}
          +        | #Erlang_Atom{Fields}

          Records are extended to possibly contain type information. This is described in Type Information in Record Declarations.

          @@ -256,8 +256,8 @@ name as a built-in type.

          It is recommended to avoid deliberately reusing built-in names because it can be confusing. However, when an Erlang/OTP release introduces a new type, code that happened to define its own type having the same name will continue to work.

          As an example, imagine that the Erlang/OTP 42 release introduces a new type -gadget() defined like this:

          -type gadget() :: {'gadget', reference()}.

          Further imagine that some code has its own (different) definition of gadget(), -for example:

          -type gadget() :: #{}.

          Since redefinitions are allowed, the code will still compile (but with a +gadget() defined like this:

          -type gadget() :: {'gadget', reference()}.

          Further imagine that some code has its own (different) definition of gadget(), +for example:

          -type gadget() :: #{}.

          Since redefinitions are allowed, the code will still compile (but with a warning), and Dialyzer will not emit any additional warnings.

          @@ -266,8 +266,8 @@

          As seen, the basic syntax of a type is an atom followed by closed parentheses. New types are declared using -type and -opaque attributes as in the -following:

          -type my_struct_type() :: Type.
          --opaque my_opaq_type() :: Type.

          The type name is the atom my_struct_type, followed by parentheses. Type is a +following:

          -type my_struct_type() :: Type.
          +-opaque my_opaq_type() :: Type.

          The type name is the atom my_struct_type, followed by parentheses. Type is a type as defined in the previous section. A current restriction is that Type can contain only predefined types, or user-defined types which are either of the following:

          • Module-local type, that is, with a definition that is present in the code of @@ -277,10 +277,10 @@ similar restriction currently exists for records.)

            Type declarations can also be parameterized by including type variables between the parentheses. The syntax of type variables is the same as Erlang variables, that is, starts with an upper-case letter. These variables is to -appear on the RHS of the definition. A concrete example follows:

            -type orddict(Key, Val) :: [{Key, Val}].

            A module can export some types to declare that other modules are allowed to -refer to them as remote types. This declaration has the following form:

            -export_type([T1/A1, ..., Tk/Ak]).

            Here the Tis are atoms (the name of the type) and the Ais are their arguments.

            Example:

            -export_type([my_struct_type/0, orddict/2]).

            Assuming that these types are exported from module 'mod', you can refer to -them from other modules using remote type expressions like the following:

            mod:my_struct_type()
            -mod:orddict(atom(), term())

            It is not allowed to refer to types that are not declared as exported.

            Types declared as opaque represent sets of terms whose structure is not +appear on the RHS of the definition. A concrete example follows:

            -type orddict(Key, Val) :: [{Key, Val}].

            A module can export some types to declare that other modules are allowed to +refer to them as remote types. This declaration has the following form:

            -export_type([T1/A1, ..., Tk/Ak]).

            Here the Tis are atoms (the name of the type) and the Ais are their arguments.

            Example:

            -export_type([my_struct_type/0, orddict/2]).

            Assuming that these types are exported from module 'mod', you can refer to +them from other modules using remote type expressions like the following:

            mod:my_struct_type()
            +mod:orddict(atom(), term())

            It is not allowed to refer to types that are not declared as exported.

            Types declared as opaque represent sets of terms whose structure is not supposed to be visible from outside of their defining module. That is, only the module defining them is allowed to depend on their term structure. Consequently, such types do not make much sense as module local - module local types are not @@ -291,33 +291,33 @@ Type Information in Record Declarations

          The types of record fields can be specified in the declaration of the record. -The syntax for this is as follows:

          -record(rec, {field1 :: Type1, field2, field3 :: Type3}).

          For fields without type annotations, their type defaults to any(). That is, the -previous example is a shorthand for the following:

          -record(rec, {field1 :: Type1, field2 :: any(), field3 :: Type3}).

          In the presence of initial values for fields, the type must be declared after -the initialization, as follows:

          -record(rec, {field1 = [] :: Type1, field2, field3 = 42 :: Type3}).

          The initial values for fields are to be compatible with (that is, a member of) +The syntax for this is as follows:

          -record(rec, {field1 :: Type1, field2, field3 :: Type3}).

          For fields without type annotations, their type defaults to any(). That is, the +previous example is a shorthand for the following:

          -record(rec, {field1 :: Type1, field2 :: any(), field3 :: Type3}).

          In the presence of initial values for fields, the type must be declared after +the initialization, as follows:

          -record(rec, {field1 = [] :: Type1, field2, field3 = 42 :: Type3}).

          The initial values for fields are to be compatible with (that is, a member of) the corresponding types. This is checked by the compiler and results in a compilation error if a violation is detected.

          Change

          Before Erlang/OTP 19, for fields without initial values, the singleton type 'undefined' was added to all declared types. In other words, the following -two record declarations had identical effects:

          -record(rec, {f1 = 42 :: integer(),
          -             f2      :: float(),
          -             f3      :: 'a' | 'b'}).
          +two record declarations had identical effects:

          -record(rec, {f1 = 42 :: integer(),
          +             f2      :: float(),
          +             f3      :: 'a' | 'b'}).
           
          --record(rec, {f1 = 42 :: integer(),
          -              f2      :: 'undefined' | float(),
          -              f3      :: 'undefined' | 'a' | 'b'}).

          This is no longer the case. If you require 'undefined' in your record field +-record(rec, {f1 = 42 :: integer(), + f2 :: 'undefined' | float(), + f3 :: 'undefined' | 'a' | 'b'}).

          This is no longer the case. If you require 'undefined' in your record field type, you must explicitly add it to the typespec, as in the 2nd example.

          Any record, containing type information or not, once defined, can be used as a type using the following syntax:

          #rec{}

          In addition, the record fields can be further specified when using a record type by adding type information about the field as follows:

          #rec{some_field :: Type}

          Any unspecified fields are assumed to have the type in the original record declaration.

          Note

          When records are used to create patterns for ETS and Mnesia match functions, -Dialyzer may need some help not to emit bad warnings. For example:

          -type height() :: pos_integer().
          --record(person, {name :: string(), height :: height()}).
          +Dialyzer may need some help not to emit bad warnings. For example:

          -type height() :: pos_integer().
          +-record(person, {name :: string(), height :: height()}).
           
          -lookup(Name, Tab) ->
          -    ets:match_object(Tab, #person{name = Name, _ = '_'}).

          Dialyzer will emit a warning since '_' is not in the type of record field +lookup(Name, Tab) -> + ets:match_object(Tab, #person{name = Name, _ = '_'}).

          Dialyzer will emit a warning since '_' is not in the type of record field height.

          The recommended way of dealing with this is to declare the smallest record field types to accommodate all your needs, and then create refinements as -needed. The modified example:

          -record(person, {name :: string(), height :: height() | '_'}).
          +needed. The modified example:

          -record(person, {name :: string(), height :: height() | '_'}).
           
          --type person() :: #person{height :: height()}.

          In specifications and type declarations the type person() is to be preferred +-type person() :: #person{height :: height()}.

          In specifications and type declarations the type person() is to be preferred before #person{}.

          @@ -330,27 +330,27 @@ arguments, otherwise the compilation fails.

          The following longer format with module name is also valid as long as Module is the name of the current module. This can be useful for documentation purposes.

          -spec Module:Function(ArgType1, ..., ArgTypeN) -> ReturnType.

          Also, for documentation purposes, argument names can be given:

          -spec Function(ArgName1 :: Type1, ..., ArgNameN :: TypeN) -> RT.

          A function specification can be overloaded. That is, it can have several types, -separated by a semicolon (;). For example:

          -spec foo(T1, T2) -> T3;
          -         (T4, T5) -> T6.

          A current restriction, which currently results in a warning by Dialyzer, is that +separated by a semicolon (;). For example:

          -spec foo(T1, T2) -> T3;
          +         (T4, T5) -> T6.

          A current restriction, which currently results in a warning by Dialyzer, is that the domains of the argument types cannot overlap. For example, the following -specification results in a warning:

          -spec foo(pos_integer()) -> pos_integer();
          -         (integer()) -> integer().

          Type variables can be used in specifications to specify relations for the input +specification results in a warning:

          -spec foo(pos_integer()) -> pos_integer();
          +         (integer()) -> integer().

          Type variables can be used in specifications to specify relations for the input and output arguments of a function. For example, the following specification defines the type of a polymorphic identity function:

          -spec id(X) -> X.

          Notice that the above specification does not restrict the input and output type in any way. These types can be constrained by guard-like subtype constraints and -provide bounded quantification:

          -spec id(X) -> X when X :: tuple().

          Currently, the :: constraint (read as "is a subtype of") is the only guard +provide bounded quantification:

          -spec id(X) -> X when X :: tuple().

          Currently, the :: constraint (read as "is a subtype of") is the only guard constraint that can be used in the when part of a -spec attribute.

          Note

          The above function specification uses multiple occurrences of the same type variable. That provides more type information than the following function -specification, where the type variables are missing:

          -spec id(tuple()) -> tuple().

          The latter specification says that the function takes some tuple and returns +specification, where the type variables are missing:

          -spec id(tuple()) -> tuple().

          The latter specification says that the function takes some tuple and returns some tuple. The specification with the X type variable specifies that the function takes a tuple and returns the same tuple.

          However, it is up to the tools that process the specifications to choose whether to take this extra information into account or not.

          The scope of a :: constraint is the (...) -> RetType specification after which it appears. To avoid confusion, it is suggested that different variables are used in different constituents of an overloaded contract, as shown in the -following example:

          -spec foo({X, integer()}) -> X when X :: atom();
          -         ([Y]) -> Y when Y :: number().

          Some functions in Erlang are not meant to return; either because they define +following example:

          -spec foo({X, integer()}) -> X when X :: atom();
          +         ([Y]) -> Y when Y :: number().

          Some functions in Erlang are not meant to return; either because they define servers or because they are used to throw exceptions, as in the following -function:

          my_error(Err) -> throw({error, Err}).

          For such functions, it is recommended to use the special no_return/0 type +function:

          my_error(Err) -> throw({error, Err}).

          For such functions, it is recommended to use the special no_return/0 type for their "return", through a contract of the following form:

          -spec my_error(term()) -> no_return().

          Note

          Erlang uses the shorthand version _ as an anonymous type variable equivalent to term/0 or any/0. For example, the following function

          -spec Function(string(), _) -> string().

          is equivalent to:

          -spec Function(string(), any()) -> string().
          @@ -403,7 +403,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/doc/system/upgrade.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/system/upgrade.html 2026-06-04 19:05:01.437440991 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/upgrade.html 2026-06-04 19:05:01.438441000 +0000 @@ -219,7 +219,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/doc/system/versions.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (2642)) --- old//usr/share/doc/packages/erlang27-doc/doc/system/versions.html 2026-06-04 19:05:01.455441158 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system/versions.html 2026-06-04 19:05:01.455441158 +0000 @@ -333,7 +333,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/doc/system_principles.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/system_principles.html 2026-06-04 19:05:01.471441306 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/system_principles.html 2026-06-04 19:05:01.471441306 +0000 @@ -162,7 +162,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/doc/tftp.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/tftp.html 2026-06-04 19:05:01.487441455 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/tftp.html 2026-06-04 19:05:01.487441455 +0000 @@ -162,7 +162,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/doc/tools.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/tools.html 2026-06-04 19:05:01.505441621 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/tools.html 2026-06-04 19:05:01.506441631 +0000 @@ -162,7 +162,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/doc/tutorial.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/tutorial.html 2026-06-04 19:05:01.521441770 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/tutorial.html 2026-06-04 19:05:01.522441779 +0000 @@ -162,7 +162,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/doc/upcoming_incompatibilities.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (982)) --- old//usr/share/doc/packages/erlang27-doc/doc/upcoming_incompatibilities.html 2026-06-04 19:05:01.539441937 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/upcoming_incompatibilities.html 2026-06-04 19:05:01.539441937 +0000 @@ -170,10 +170,10 @@ Singleton type variables will become a compile-time error

          -

          Before Erlang/OTP 26, the compiler would silenty accept the following spec:

          -spec f(Opts) -> term() when
          -    Opts :: {ok, Unknown} | {error, Unknown}.
          -f(_) -> error.

          In OTP 26, the compiler emits a warning pointing out that the type variable -Unknown is unbound:

          t.erl:6:18: Warning: type variable 'Unknown' is only used once (is unbound)
          +

          Before Erlang/OTP 26, the compiler would silenty accept the following spec:

          -spec f(Opts) -> term() when
          +    Opts :: {ok, Unknown} | {error, Unknown}.
          +f(_) -> error.

          In OTP 26, the compiler emits a warning pointing out that the type variable +Unknown is unbound:

          t.erl:6:18: Warning: type variable 'Unknown' is only used once (is unbound)
           %    6|     Opts :: {ok, Unknown} | {error, Unknown}.
           %     |                  ^

          In OTP 27, that warning will become an error.

          @@ -183,7 +183,7 @@

          Escripts will be compiled by default instead of interpreted. That means that the compiler application must be available.

          The old behavior of interpreting escripts can be restored by adding the -following line to the script file:

          -mode(interpret).

          In OTP 28, support for interpreting an escript will be removed.

          +following line to the script file:

          -mode(interpret).

          In OTP 28, support for interpreting an escript will be removed.

          @@ -235,10 +235,10 @@ %% In OTP 27 it is instead interpreted as a %% Triple-Quoted String equivalent to "String Content"

          """"
          -++ foo() ++
          +++ foo() ++
           """"
           %% Became
          -"" ++ foo() ++ ""
          +"" ++ foo() ++ ""
           %%
           %% In OTP 27 it is instead interpreted as a
           %% Triple-Quoted String (triple-or-more) equivalent to
          @@ -362,7 +362,7 @@
                     Erlang programming language
           
                 

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/doc/wx.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/wx.html 2026-06-04 19:05:01.557442104 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/wx.html 2026-06-04 19:05:01.556442095 +0000 @@ -162,7 +162,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/doc/xmerl.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/doc/xmerl.html 2026-06-04 19:05:01.571442234 +0000 +++ new//usr/share/doc/packages/erlang27-doc/doc/xmerl.html 2026-06-04 19:05:01.572442243 +0000 @@ -162,7 +162,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/404.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/404.html 2026-06-04 19:05:01.587918477 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/404.html 2026-06-04 19:05:01.587918477 +0000 @@ -143,7 +143,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/absform.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (878)) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/absform.html 2026-06-04 19:05:01.606442558 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/absform.html 2026-06-04 19:05:01.606442558 +0000 @@ -516,7 +516,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/alt_disco.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/alt_disco.html 2026-06-04 19:05:01.626442744 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/alt_disco.html 2026-06-04 19:05:01.625442735 +0000 @@ -206,7 +206,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/alt_dist.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1274)) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/alt_dist.html 2026-06-04 19:05:01.663443087 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/alt_dist.html 2026-06-04 19:05:01.664443096 +0000 @@ -241,10 +241,10 @@ Exported Callback Functions

          -

          The following functions are mandatory:

          • listen(Name) ->
            -  {ok, {Listen, Address, Creation}} | {error, Error}
            -listen(Name,Host) ->
            -  {ok, {Listen, Address, Creation}} | {error, Error}

            listen/2 is called once in order to listen for incoming connection requests. +

            The following functions are mandatory:

            • listen(Name) ->
              +  {ok, {Listen, Address, Creation}} | {error, Error}
              +listen(Name,Host) ->
              +  {ok, {Listen, Address, Creation}} | {error, Error}

              listen/2 is called once in order to listen for incoming connection requests. The call is made when the distribution is brought up. The argument Name is the part of the node name before the @ sign in the full node name. It can be either an atom or a string. The argument Host is the part of the node name @@ -254,12 +254,12 @@ #net_address{} record is defined in kernel/include/net_address.hrl), and Creation which (currently) is an integer 1, 2, or 3.

              If epmd is to be used for node discovery, you typically want to use the erl_epmd module (part of the kernel application) in order to -register the listen port with epmd and retrieve Creation to use.

            • address() ->
              +register the listen port with epmd and retrieve Creation to use.

            • address() ->
                 Address

              address/0 is called in order to get the Address part of the listen/2 function without creating a listen socket. -All fields except address have to be set in the returned record

              Example:

              address() ->
              -    {ok, Host} = inet:gethostname(),
              -    #net_address{ host = Host, protocol = tcp, family = inet6 }.
            • accept(Listen) ->
              +All fields except address have to be set in the returned record

              Example:

              address() ->
              +    {ok, Host} = inet:gethostname(),
              +    #net_address{ host = Host, protocol = tcp, family = inet6 }.
            • accept(Listen) ->
                 AcceptorPid

              accept/1 should spawn a process that accepts connections. This process should preferably execute on max priority. The process identifier of this process should be returned.

              The Listen argument will be the same as the Listen handle part of the @@ -268,7 +268,7 @@ may not be the process registered as net_kernel) and is in this document identified as Kernel. When a connection has been accepted by the acceptor process, it needs to inform Kernel about the accepted connection. This is -done by passing a message on the form:

              Kernel ! {accept, AcceptorPid, DistController, Family, Proto}

              DistController is either the process or port identifier of the distribution +done by passing a message on the form:

              Kernel ! {accept, AcceptorPid, DistController, Family, Proto}

              DistController is either the process or port identifier of the distribution controller for the connection. The distribution controller should be created by the acceptor processes when a new connection is accepted. Its job is to dispatch traffic on the connection.

              Kernel responds with one of the following messages:

              • {Kernel, controller, SupervisorPid} - The request was accepted and @@ -276,7 +276,7 @@ process (which is created in the accept_connection/5 callback).

              • {Kernel, unsupported_protocol} - The request was rejected. This is a fatal error. The acceptor process should terminate.

              When an accept sequence has been completed the acceptor process is expected to -continue accepting further requests.

            • accept_connection(AcceptorPid, DistCtrl, MyNode, Allowed, SetupTime) ->
              +continue accepting further requests.

            • accept_connection(AcceptorPid, DistCtrl, MyNode, Allowed, SetupTime) ->
                 ConnectionSupervisorPid

              accept_connection/5 should spawn a process that will perform the Erlang distribution handshake for the connection. If the handshake successfully completes it should continue to function as a connection supervisor. This @@ -298,7 +298,7 @@ the handshake in a #hs_data{} record and call dist_util:handshake_other_started(HsData) with this record.

              dist_util:handshake_other_started(HsData) will perform the handshake and if the handshake successfully completes this process will then continue in a -connection supervisor loop as long as the connection is up.

            • setup(Node, Type, MyNode, LongOrShortNames, SetupTime) ->
              +connection supervisor loop as long as the connection is up.

            • setup(Node, Type, MyNode, LongOrShortNames, SetupTime) ->
                 ConnectionSupervisorPid

              setup/5 should spawn a process that connects to Node. When connection has been established it should perform the Erlang distribution handshake for the connection. If the handshake successfully completes it should continue to @@ -324,15 +324,15 @@ the handshake in a #hs_data{} record and call dist_util:handshake_we_started(HsData) with this record.

              dist_util:handshake_we_started(HsData) will perform the handshake and the handshake successfully completes this process will then continue in a -connection supervisor loop as long as the connection is up.

            • close(Listen) ->
              -  void()

              Called in order to close the Listen handle that originally was passed from -the listen/1 callback.

            • select(NodeName) ->
              -  boolean()

              Return true if the host name part of the NodeName is valid for use with -this protocol; otherwise, false.

            There are also two optional functions that may be exported:

            • setopts(Listen, Opts) ->
              -  ok | {error, Error}

              The argument Listen is the handle originally passed from the +connection supervisor loop as long as the connection is up.

            • close(Listen) ->
              +  void()

              Called in order to close the Listen handle that originally was passed from +the listen/1 callback.

            • select(NodeName) ->
              +  boolean()

              Return true if the host name part of the NodeName is valid for use with +this protocol; otherwise, false.

            There are also two optional functions that may be exported:

            • setopts(Listen, Opts) ->
              +  ok | {error, Error}

              The argument Listen is the handle originally passed from the listen/1 callback. The argument Opts is a list of -options to set on future connections.

            • getopts(Listen, Opts) ->
              -  {ok, OptionValues} | {error, Error}

              The argument Listen is the handle originally passed from the +options to set on future connections.

            • getopts(Listen, Opts) ->
              +  {ok, OptionValues} | {error, Error}

              The argument Listen is the handle originally passed from the listen/1 callback. The argument Opts is a list of options to read for future connections.

            @@ -354,36 +354,36 @@ dist_util:start_timer/1.

          • allowed - Information passed as Allowed to accept_connection/5. This field is only mandatory when the remote node initiated the connection. That is, when the connection is set up via -accept_connection/5.

          • f_send - A fun with the following signature:

            fun (DistCtrlr, Data) -> ok | {error, Error}

            where DistCtrlr is the identifier of the distribution controller and Data -is io data to pass to the other side.

            Only used during handshake phase.

          • f_recv - A fun with the following signature:

            fun (DistCtrlr, Length) -> {ok, Packet} | {error, Reason}

            where DistCtrlr is the identifier of the distribution controller. If +accept_connection/5.

          • f_send - A fun with the following signature:

            fun (DistCtrlr, Data) -> ok | {error, Error}

            where DistCtrlr is the identifier of the distribution controller and Data +is io data to pass to the other side.

            Only used during handshake phase.

          • f_recv - A fun with the following signature:

            fun (DistCtrlr, Length) -> {ok, Packet} | {error, Reason}

            where DistCtrlr is the identifier of the distribution controller. If Length is 0, all available bytes should be returned. If Length > 0, exactly Length bytes should be returned, or an error; possibly discarding less than Length bytes of data when the connection is closed from the other side. It is used for passive receive of data from the other end.

            Only used during handshake phase.

          • f_setopts_pre_nodeup - A fun with the -following signature:

            fun (DistCtrlr) -> ok | {error, Error}

            where DistCtrlr is the identifier of the distribution controller. Called +following signature:

            fun (DistCtrlr) -> ok | {error, Error}

            where DistCtrlr is the identifier of the distribution controller. Called just before the distribution channel is taken up for normal traffic.

            Only used during handshake phase.

          • f_setopts_post_nodeup - A fun with -the following signature:

            fun (DistCtrlr) -> ok | {error, Error}

            where DistCtrlr is the identifier of the distribution controller. Called -just after distribution channel has been taken up for normal traffic.

            Only used during handshake phase.

          • f_getll - A fun with the following signature:

            fun (DistCtrlr) -> ID

            where DistCtrlr is the identifier of the distribution controller and ID is +the following signature:

            fun (DistCtrlr) -> ok | {error, Error}

            where DistCtrlr is the identifier of the distribution controller. Called +just after distribution channel has been taken up for normal traffic.

            Only used during handshake phase.

          • f_getll - A fun with the following signature:

            fun (DistCtrlr) -> ID

            where DistCtrlr is the identifier of the distribution controller and ID is the identifier of the low level entity that handles the connection (often -DistCtrlr itself).

            Only used during handshake phase.

          • f_address - A fun with the following signature:

            fun (DistCtrlr, Node) -> NetAddress

            where DistCtrlr is the identifier of the distribution controller, Node is +DistCtrlr itself).

            Only used during handshake phase.

          • f_address - A fun with the following signature:

            fun (DistCtrlr, Node) -> NetAddress

            where DistCtrlr is the identifier of the distribution controller, Node is the node name of the node on the other end, and NetAddress is a #net_address{} record with information about the address for the Node on the other end of the connection. The #net_address{} record is defined in -kernel/include/net_address.hrl.

            Only used during handshake phase.

          • mf_tick - A fun with the following signature:

            fun (DistCtrlr) -> void()

            where DistCtrlr is the identifier of the distribution controller. This +kernel/include/net_address.hrl.

            Only used during handshake phase.

          • mf_tick - A fun with the following signature:

            fun (DistCtrlr) -> void()

            where DistCtrlr is the identifier of the distribution controller. This function should send information over the connection that is not interpreted by the other end while increasing the statistics of received packets on the other end. This is usually implemented by sending an empty packet.

            Note

            It is of vital importance that this operation does not block the caller for -a long time. This since it is called from the connection supervisor.

            Used when connection is up.

          • mf_getstat - A fun with the following signature:

            fun (DistCtrlr) -> {ok, Received, Sent, PendSend}

            where DistCtrlr is the identifier of the distribution controller, Received +a long time. This since it is called from the connection supervisor.

            Used when connection is up.

          • mf_getstat - A fun with the following signature:

            fun (DistCtrlr) -> {ok, Received, Sent, PendSend}

            where DistCtrlr is the identifier of the distribution controller, Received is received packets, Sent is sent packets, and PendSend is amount of data in queue to be sent (typically in bytes, but dist_util only checks whether the value is non-zero to know there is data in queue) or a boolean/0 indicating whether there are packets in queue to be sent.

            Note

            It is of vital importance that this operation does not block the caller for a long time. This since it is called from the connection supervisor.

            Used when connection is up.

          • request_type - The request Type as passed to setup/5. This is only mandatory when the connection has -been initiated by this node. That is, the connection is set up via setup/5.

          • mf_setopts - A fun with the following signature:

            fun (DistCtrl, Opts) -> ok | {error, Error}

            where DistCtrlr is the identifier of the distribution controller and Opts -is a list of options to set on the connection.

            This function is optional. Used when connection is up.

          • mf_getopts - A fun with the following signature:

            fun (DistCtrl, Opts) -> {ok, OptionValues} | {error, Error}

            where DistCtrlr is the identifier of the distribution controller and Opts +been initiated by this node. That is, the connection is set up via setup/5.

          • mf_setopts - A fun with the following signature:

            fun (DistCtrl, Opts) -> ok | {error, Error}

            where DistCtrlr is the identifier of the distribution controller and Opts +is a list of options to set on the connection.

            This function is optional. Used when connection is up.

          • mf_getopts - A fun with the following signature:

            fun (DistCtrl, Opts) -> {ok, OptionValues} | {error, Error}

            where DistCtrlr is the identifier of the distribution controller and Opts is a list of options to read for the connection.

            This function is optional. Used when connection is up.

          • f_handshake_complete - A fun with the -following signature:

            fun (DistCtrlr, Node, DHandle) -> void()

            where DistCtrlr is the identifier of the distribution controller, Node is +following signature:

            fun (DistCtrlr, Node, DHandle) -> void()

            where DistCtrlr is the identifier of the distribution controller, Node is the node name of the node connected at the other end, and DHandle is a distribution handle needed by a distribution controller process when calling the following BIFs:

            This function is called when the handshake has completed and the distribution @@ -519,62 +519,62 @@ because in most situation you need to do it. Unix domain sockets are reliable and order maintaining, so we do not need to implement resends and such in the driver.

            We start writing the example Unix domain sockets driver by declaring prototypes -and filling in a static ErlDrvEntry structure:

            ( 1) #include <stdio.h>
            -( 2) #include <stdlib.h>
            -( 3) #include <string.h>
            -( 4) #include <unistd.h>
            -( 5) #include <errno.h>
            -( 6) #include <sys/types.h>
            -( 7) #include <sys/stat.h>
            -( 8) #include <sys/socket.h>
            -( 9) #include <sys/un.h>
            -(10) #include <fcntl.h>
            +and filling in a static ErlDrvEntry structure:

            ( 1) #include <stdio.h>
            +( 2) #include <stdlib.h>
            +( 3) #include <string.h>
            +( 4) #include <unistd.h>
            +( 5) #include <errno.h>
            +( 6) #include <sys/types.h>
            +( 7) #include <sys/stat.h>
            +( 8) #include <sys/socket.h>
            +( 9) #include <sys/un.h>
            +(10) #include <fcntl.h>
             
            -(11) #define HAVE_UIO_H
            -(12) #include "erl_driver.h"
            +(11) #define HAVE_UIO_H
            +(12) #include "erl_driver.h"
             
            -(13) /*
            +(13) /*
             (14) ** Interface routines
             (15) */
            -(16) static ErlDrvData uds_start(ErlDrvPort port, char *buff);
            -(17) static void uds_stop(ErlDrvData handle);
            -(18) static void uds_command(ErlDrvData handle, char *buff, int bufflen);
            -(19) static void uds_input(ErlDrvData handle, ErlDrvEvent event);
            -(20) static void uds_output(ErlDrvData handle, ErlDrvEvent event);
            -(21) static void uds_finish(void);
            -(22) static int uds_control(ErlDrvData handle, unsigned int command,
            -(23)                        char* buf, int count, char** res, int res_size);
            -
            -(24) /* The driver entry */
            -(25) static ErlDrvEntry uds_driver_entry = {
            -(26)     NULL,                            /* init, N/A */
            -(27)     uds_start,                       /* start, called when port is opened */
            -(28)     uds_stop,                        /* stop, called when port is closed */
            -(29)     uds_command,                     /* output, called when erlang has sent */
            -(30)     uds_input,                       /* ready_input, called when input
            +(16) static ErlDrvData uds_start(ErlDrvPort port, char *buff);
            +(17) static void uds_stop(ErlDrvData handle);
            +(18) static void uds_command(ErlDrvData handle, char *buff, int bufflen);
            +(19) static void uds_input(ErlDrvData handle, ErlDrvEvent event);
            +(20) static void uds_output(ErlDrvData handle, ErlDrvEvent event);
            +(21) static void uds_finish(void);
            +(22) static int uds_control(ErlDrvData handle, unsigned int command,
            +(23)                        char* buf, int count, char** res, int res_size);
            +
            +(24) /* The driver entry */
            +(25) static ErlDrvEntry uds_driver_entry = {
            +(26)     NULL,                            /* init, N/A */
            +(27)     uds_start,                       /* start, called when port is opened */
            +(28)     uds_stop,                        /* stop, called when port is closed */
            +(29)     uds_command,                     /* output, called when erlang has sent */
            +(30)     uds_input,                       /* ready_input, called when input
             (31)                                         descriptor ready */
            /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/api-reference.html differs (HTML document, Unicode text, UTF-8 text)
            --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/api-reference.html	2026-06-04 19:05:01.684443282 +0000
            +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/api-reference.html	2026-06-04 19:05:01.685443291 +0000
            @@ -245,7 +245,7 @@
                       Erlang programming language
             
                   

            -

            Copyright © 1996-2026 Ericsson AB

            +

            Copyright © 1996-2042 Ericsson AB

            /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/atomics.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (556)) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/atomics.html 2026-06-04 19:05:01.705443477 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/atomics.html 2026-06-04 19:05:01.705443477 +0000 @@ -667,7 +667,7 @@ Erlang programming language

            -

            Copyright © 1996-2026 Ericsson AB

            +

            Copyright © 1996-2042 Ericsson AB

            /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/automaticyieldingofccode.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (918)) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/automaticyieldingofccode.html 2026-06-04 19:05:01.724443653 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/automaticyieldingofccode.html 2026-06-04 19:05:01.724443653 +0000 @@ -213,9 +213,9 @@ function is used, the convention is to "comment out" the source for the function by surrounding it with the following #ifdef (this way, one will not get warnings about unused functions):

            #ifdef INCLUDE_YCF_TRANSFORMED_ONLY_FUNCTIONS
            -void my_fun() {
            +void my_fun() {
                 ...
            -}
            +}
             #endif /* INCLUDE_YCF_TRANSFORMED_ONLY_FUNCTIONS */

            While editing the function one can define INCLUDE_YCF_TRANSFORMED_ONLY_FUNCTIONS so that one can see errors and warnings in the non-transformed source.

            @@ -369,7 +369,7 @@ Erlang programming language

            -

            Copyright © 1996-2026 Ericsson AB

            +

            Copyright © 1996-2042 Ericsson AB

            /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/beam_makeops.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1041)) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/beam_makeops.html 2026-06-04 19:05:01.772444098 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/beam_makeops.html 2026-06-04 19:05:01.772444098 +0000 @@ -155,9 +155,9 @@ BEAM interpreter. For the BeamAsm JIT introduced in OTP 24, the implementation of instructions are defined in emitter functions written in C++.

          Generic instructions have typed operands. Here are a few examples of -operands for move/2:

          {move,{atom,id},{x,5}}.
          -{move,{x,3},{x,0}}.
          -{move,{x,2},{y,1}}.

          When those instructions are loaded, the loader rewrites them +operands for move/2:

          {move,{atom,id},{x,5}}.
          +{move,{x,3},{x,0}}.
          +{move,{x,2},{y,1}}.

          When those instructions are loaded, the loader rewrites them to specific instructions:

          move_cx id 5
           move_xx 3 0
           move_xy 2 1

          Corresponding to each generic instruction, there is a family of @@ -189,9 +189,9 @@ an integer, an atom, or a literal).

          Now let's look at the implementation of the move instruction. There are multiple files containing implementations of instructions in the erts/emulator/beam/emu directory. The move instruction is defined -in instrs.tab. It looks like this:

          move(Src, Dst) {
          +in instrs.tab.  It looks like this:

          move(Src, Dst) {
               $Dst = $Src;
          -}

          The implementation for an instruction largely follows the C syntax, +}

          The implementation for an instruction largely follows the C syntax, except that the variables in the function head don't have any types. The $ before an identifier denotes a macro expansion. Thus, $Src will expand to the code to pick up the source operand for @@ -208,14 +208,14 @@ is stored in the lower 32 bits of the word. In the upper 32 bits is the byte offset to the X register; the register number 5 has been multiplied by the word size size 8.

          In the next word the tagged atom id is stored.

          With that background, we can look at the generated code for move_cx -in beam_hot.h:

          OpCase(move_cx):
          -{
          -  BeamInstr next_pf = BeamCodeAddr(I[2]);
          -  xb(BeamExtraData(I[0])) = I[1];
          +in beam_hot.h:

          OpCase(move_cx):
          +{
          +  BeamInstr next_pf = BeamCodeAddr(I[2]);
          +  xb(BeamExtraData(I[0])) = I[1];
             I += 2;
          -  ASSERT(VALID_INSTR(next_pf));
          -  GotoPF(next_pf);
          -}

          We will go through each line in turn.

          • OpCase(move_cx): defines a label for the instruction. The + ASSERT(VALID_INSTR(next_pf)); + GotoPF(next_pf); +}

          We will go through each line in turn.

          • OpCase(move_cx): defines a label for the instruction. The OpCase() macro is defined in beam_emu.c. It will expand this line to lb_move_cx:.

          • BeamInstr next_pf = BeamCodeAddr(I[2]); fetches the pointer to code for the next instruction to be executed. The BeamCodeAddr() @@ -229,15 +229,15 @@ this case).

          • I += 2 advances the instruction pointer to the next instruction.

          • In a debug-compiled emulator, ASSERT(VALID_INSTR(next_pf)); makes sure that next_pf is a valid instruction (that is, that it points -within the process_main() function in beam_emu.c).

          • GotoPF(next_pf); transfers control to the next instruction.

          Now let's look at the implementation of move_xx:

          OpCase(move_xx):
          -{
          -  Eterm tmp_packed1 = BeamExtraData(I[0]);
          -  BeamInstr next_pf = BeamCodeAddr(I[1]);
          -  xb((tmp_packed1>>BEAM_TIGHT_SHIFT)) = xb(tmp_packed1&BEAM_TIGHT_MASK);
          +within the process_main() function in beam_emu.c).

        • GotoPF(next_pf); transfers control to the next instruction.

        Now let's look at the implementation of move_xx:

        OpCase(move_xx):
        +{
        +  Eterm tmp_packed1 = BeamExtraData(I[0]);
        +  BeamInstr next_pf = BeamCodeAddr(I[1]);
        +  xb((tmp_packed1>>BEAM_TIGHT_SHIFT)) = xb(tmp_packed1&BEAM_TIGHT_MASK);
           I += 1;
        -  ASSERT(VALID_INSTR(next_pf));
        -  GotoPF(next_pf);
        -}

        We will go through the lines that are new or have changed compared to + ASSERT(VALID_INSTR(next_pf)); + GotoPF(next_pf); +}

        We will go through the lines that are new or have changed compared to move_cx.

        • Eterm tmp_packed1 = BeamExtraData(I[0]); picks up both X register numbers packed into the upper 32 bits of the instruction word.

        • BeamInstr next_pf = BeamCodeAddr(I[1]); pre-fetches the address of the next instruction. Note that because both X registers operands fits @@ -246,15 +246,15 @@ copies the source to the destination. (For a 64-bit architecture, BEAM_TIGHT_SHIFT is 16 and BEAM_TIGHT_MASK is 0xFFFF.)

        • I += 1; advances the instruction pointer to the next instruction.

        move_xy is almost identical to move_xx. The only difference is the use of the yb() macro instead of xb() to reference the -destination register:

        OpCase(move_xy):
        -{
        -  Eterm tmp_packed1 = BeamExtraData(I[0]);
        -  BeamInstr next_pf = BeamCodeAddr(I[1]);
        -  yb((tmp_packed1>>BEAM_TIGHT_SHIFT)) = xb(tmp_packed1&BEAM_TIGHT_MASK);
        +destination register:

        OpCase(move_xy):
        +{
        +  Eterm tmp_packed1 = BeamExtraData(I[0]);
        +  BeamInstr next_pf = BeamCodeAddr(I[1]);
        +  yb((tmp_packed1>>BEAM_TIGHT_SHIFT)) = xb(tmp_packed1&BEAM_TIGHT_MASK);
           I += 1;
        -  ASSERT(VALID_INSTR(next_pf));
        -  GotoPF(next_pf);
        -}

        + ASSERT(VALID_INSTR(next_pf)); + GotoPF(next_pf); +}

        @@ -275,13 +275,13 @@ move2 x y x y // In instrs.tab -move2(S1, D1, S2, D2) { +move2(S1, D1, S2, D2) { Eterm V1, V2; V1 = $S1; V2 = $S2; $D1 = V1; $D2 = V2; -}

      When the loader has found a match and replaced the matched instructions, +}

    When the loader has found a match and replaced the matched instructions, it will match the new instructions against the transformation rules. Because of that, we can define the rule for a move3/6 instruction as follows:

    move2 X1=x Y1=y X2=x Y2=y | move X3=x Y3=y =>
    @@ -437,21 +437,21 @@
     i_fcheckerror
     fclearerror
     %endif

    It is also possible to add an %else clause:

    %if ARCH_64
    -BS_SAFE_MUL(A, B, Fail, Dst) {
    -    Uint64 res = ($A) * ($B);
    -    if (res / $B != $A) {
    +BS_SAFE_MUL(A, B, Fail, Dst) {
    +    Uint64 res = ($A) * ($B);
    +    if (res / $B != $A) {
             $Fail;
    -    }
    +    }
         $Dst = res;
    -}
    +}
     %else
    -BS_SAFE_MUL(A, B, Fail, Dst) {
    -    Uint64 res = (Uint64)($A) * (Uint64)($B);
    -    if ((res >> (8*sizeof(Uint))) != 0) {
    +BS_SAFE_MUL(A, B, Fail, Dst) {
    +    Uint64 res = (Uint64)($A) * (Uint64)($B);
    +    if ((res >> (8*sizeof(Uint))) != 0) {
             $Fail;
    -    }
    +    }
         $Dst = res;
    -}
    +}
     %endif

    Symbols that are defined in directives

    The following symbols are always defined.

    • ARCH_64 - is 1 for a 64-bit machine, and 0 otherwise.
    • ARCH_32 - is 1 for 32-bit machine, and 0 otherwise.

    The Makefile for building the emulator currently defines the following symbols by using the -D option on the command line for beam_makeops.

    • USE_VM_PROBES - 1 if the runtime system is compiled to use VM @@ -680,7 +680,7 @@ a non-zero value, the matching of the rule will continue, otherwise the match will fail. Such guard functions are hereafter called predicates.

      The most commonly used guard constraints is equal(). It can be used -to remove a redundant move instructio like this:

      move R1 R2 | equal(R1, R2) => _

      or remove a redundant is_eq_exact instruction like this:

      is_eq_exact Lbl Src1 Src2 | equal(Src1, Src2) => _

      At the time of writing, all predicates are defined in files named +to remove a redundant move instructio like this:

      move R1 R2 | equal(R1, R2) => _

      or remove a redundant is_eq_exact instruction like this:

      is_eq_exact Lbl Src1 Src2 | equal(Src1, Src2) => _

      At the time of writing, all predicates are defined in files named predicates.tab in several directories. In predicates.tab directly in $ERL_TOP/erts/emulator/beam, predicates that are used by both the traditinal emulator and the JIT implementations are contained. @@ -696,33 +696,33 @@ internal loader data structures, but here is quick look at the implementation of a simple predicate called literal_is_map().

      Here is first an example how it is used:

      ismap Fail Lit=q | literal_is_map(Lit) =>

      If the Lit operand is a literal, then the literal_is_map() predicate is called to determine whether it is a map literal. -If it is, the instruction is not needed and can be removed.

      literal_is_map() is implemented like this (in emu/predicates.tab):

      pred.literal_is_map(Lit) {
      +If it is, the instruction is not needed and can be removed.

      literal_is_map() is implemented like this (in emu/predicates.tab):

      pred.literal_is_map(Lit) {
           Eterm term;
       
      -    ASSERT(Lit.type == TAG_q);
      -    term = beamfile_get_literal(&S->beam, Lit.val);
      -    return is_map(term);
      -}

      The pred. prefix tells beam_makeops that this function is a + ASSERT(Lit.type == TAG_q); + term = beamfile_get_literal(&S->beam, Lit.val); + return is_map(term); +}

      The pred. prefix tells beam_makeops that this function is a predicate. Without the prefix, it would have been interpreted as the implementation of an instruction (described in Defining the implementation).

      Predicate functions have a magic variabled called S, which is a pointer to a state struct. In the example, beamfile_get_literal(&S->beam, Lit.val); is used to retrieve the actual term for the literal.

      At the time of writing, the expanded C code generated by -beam_makeops looks like this:

      static int literal_is_map(LoaderState* S, BeamOpArg Lit) {
      +beam_makeops looks like this:

      static int literal_is_map(LoaderState* S, BeamOpArg Lit) {
         Eterm term;
       
      -  ASSERT(Lit.type == TAG_q);
      -  term = S->literals[Lit.val].term;
      -  return is_map(term);;
      -}

      Handling instructions with variable number of operands

      Some instructions, such as select_val/3, essentially has a variable + ASSERT(Lit.type == TAG_q); + term = S->literals[Lit.val].term; + return is_map(term);; +}

      Handling instructions with variable number of operands

      Some instructions, such as select_val/3, essentially has a variable number of operands. Such instructions have a {list,[...]} operand -as their last operand in the BEAM assembly code. For example:

      {select_val,{x,0},
      -            {f,1},
      -            {list,[{atom,b},{f,4},{atom,a},{f,5}]}}.

      The loader will convert a {list,[...]} operand to an u operand whose +as their last operand in the BEAM assembly code. For example:

      {select_val,{x,0},
      +            {f,1},
      +            {list,[{atom,b},{f,4},{atom,a},{f,5}]}}.

      The loader will convert a {list,[...]} operand to an u operand whose value is the number of elements in the list, followed by each element in the list. The instruction above would be translated to the following -generic instruction:

      {select_val,{x,0},{f,1},{u,4},{atom,b},{f,4},{atom,a},{f,5}}

      To match a variable number of arguments we need to use the special +generic instruction:

      {select_val,{x,0},{f,1},{u,4},{atom,b},{f,4},{atom,a},{f,5}}

      To match a variable number of arguments we need to use the special operand type * like this:

      select_val Src=aiq Fail=f Size=u List=* =>
      /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/beamasm.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1750))
      --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/beamasm.html	2026-06-04 19:05:01.798444339 +0000
      +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/beamasm.html	2026-06-04 19:05:01.798444339 +0000
      @@ -149,10 +149,10 @@
       used in BeamAsm are much simpler than the interpreter's, as most of the
       transformations for the interpreter are done only to eliminate the instruction
       dispatch overhead.

      Then each instruction is encoded using the C++ functions in the -jit/$ARCH/instr_*.cpp files. For example:

      void BeamModuleAssembler::emit_is_nonempty_list(const ArgVal &Fail, const ArgVal &Src) {
      -  a.test(getArgRef(Src), imm(_TAG_PRIMARY_MASK - TAG_PRIMARY_LIST));
      -  a.jne(labels[Fail.getLabel()]);
      -}

      asmjit provides a fairly straightforward +jit/$ARCH/instr_*.cpp files. For example:

      void BeamModuleAssembler::emit_is_nonempty_list(const ArgVal &Fail, const ArgVal &Src) {
      +  a.test(getArgRef(Src), imm(_TAG_PRIMARY_MASK - TAG_PRIMARY_LIST));
      +  a.jne(labels[Fail.getLabel()]);
      +}

      asmjit provides a fairly straightforward mapping from a C++ function call to the x86 assembly instruction. The above instruction tests if the value in the Src register is a non-empty list and if it is not then it jumps to the fail label.

      For comparison, the interpreter has 8 combinations and specializations of @@ -160,7 +160,7 @@ common patterns.

      The original register allocation done by the Erlang compiler is used to manage the liveness of values and the physical registers are statically allocated to keep the necessary process state. At the moment this is the static register -allocation on x86-64:

      rbx: ErtsSchedulerRegisters struct (contains x/float registers and some metadata)
      +allocation on x86-64:

      rbx: ErtsSchedulerRegisters struct (contains x/float registers and some metadata)
       rbp: Current frame pointer when `perf` support is enabled, otherwise this
            is an optional save slot for the Erlang stack pointer when executing C
            code.
      @@ -187,13 +187,13 @@
       used about double the amount of memory for code as the interpreter, while current
       versions use about 10% more. How was this achieved?

      In BeamAsm we heavily use shared code fragments to try to emit as much code as possible as global shared fragments instead of duplicating the code unnecessarily. -For instance, the return instruction looks something like this:

      Label yield = a.newLabel();
      +For instance, the return instruction looks something like this:

      Label yield = a.newLabel();
       
       /* Decrement reduction counter */
      -a.dec(FCALLS);
      +a.dec(FCALLS);
       /* If FCALLS < 0, jump to the yield-on-return fragment */
      -a.jl(resolve_fragment(ga->get_dispatch_return()));
      -a.ret();

      The code above is not exactly what is emitted, but close enough. The thing to note +a.jl(resolve_fragment(ga->get_dispatch_return())); +a.ret();

      The code above is not exactly what is emitted, but close enough. The thing to note is that the code for doing the context switch is never emitted. Instead, we jump to a global fragment that all return instructions share. This greatly reduces the amount of code that has to be emitted for each module.

      @@ -243,24 +243,24 @@

      As Erlang stacks can be very small, we have to switch over to a different stack when we need to execute C code (which may expect a much larger stack). This is -done through emit_enter_runtime and emit_leave_runtime, for example:

      mov_arg(ARG4, NumFree);
      +done through emit_enter_runtime and emit_leave_runtime, for example:

      mov_arg(ARG4, NumFree);
       
       /* Move to the C stack and swap out our current reductions, stack-, and
        * heap pointer to the process structure. */
      -emit_enter_runtime<Update::eReductions | Update::eStack | Update::eHeap>();
      +emit_enter_runtime<Update::eReductions | Update::eStack | Update::eHeap>();
       
      -a.mov(ARG1, c_p);
      -load_x_reg_array(ARG2);
      -make_move_patch(ARG3, lambdas[Fun.getValue()].patches);
      +a.mov(ARG1, c_p);
      +load_x_reg_array(ARG2);
      +make_move_patch(ARG3, lambdas[Fun.getValue()].patches);
       
       /* Call `new_fun`, asserting that we're on the C stack. */
      -runtime_call<4>(new_fun);
      +runtime_call<4>(new_fun);
       
       /* Move back to the C stack, and read the updated values from the process
        * structure */
      -emit_leave_runtime<Update::eReductions | Update::eStack | Update::eHeap>();
      +emit_leave_runtime<Update::eReductions | Update::eStack | Update::eHeap>();
       
      -a.mov(getXRef(0), RET);

      All combinations of the Update constants are legal, but the ones given to +a.mov(getXRef(0), RET);

      All combinations of the Update constants are legal, but the ones given to emit_leave_runtime must be the same as those given to emit_enter_runtime.

      @@ -271,7 +271,7 @@ any function call. In the interpreter, this is done by rewriting the loaded BEAM code, but this is more complicated in BeamAsm as we want to have a fast and compact way to do this. This is solved by emitting the code below at the -start of each function (x86 variant below):

        0x0: short jmp 6 (address 0x8)
      +start of each function (x86 variant below):

        0x0: short jmp 6 (address 0x8)
         0x2: nop
         0x3: relative near call to shared breakpoint fragment
         0x8: actual code for function

      When code starts to execute it will simply see the short jmp 6 instruction @@ -293,23 +293,23 @@ executable page and once with a writable page. Since they're backed by the same memory, writes to the writable page appear magically in the executable one.

      The erts_writable_code_ptr function can be used to get writable pointers -given a module instance, provided that it has been unsealed first:

      for (i = 0; i < n; i++) {
      +given a module instance, provided that it has been unsealed first:

      for (i = 0; i < n; i++) {
           const ErtsCodeInfo* ci_exec;
           ErtsCodeInfo* ci_rw;
           void *w_ptr;
       
      -    erts_unseal_module(&modp->curr);
      +    erts_unseal_module(&modp->curr);
       
      -    ci_exec = code_hdr->functions[i];
      -    w_ptr = erts_writable_code_ptr(&modp->curr, ci_exec);
      -    ci_rw = (ErtsCodeInfo*)w_ptr;
      -
      -    uninstall_breakpoint(ci_rw, ci_exec);
      -    consolidate_bp_data(modp, ci_rw, 1);
      -    ASSERT(ci_rw->gen_bp == NULL);
      +    ci_exec = code_hdr->functions[i];
      +    w_ptr = erts_writable_code_ptr(&modp->curr, ci_exec);
      +    ci_rw = (ErtsCodeInfo*)w_ptr;
      +
      +    uninstall_breakpoint(ci_rw, ci_exec);
      +    consolidate_bp_data(modp, ci_rw, 1);
      +    ASSERT(ci_rw->gen_bp == NULL);
       
      -    erts_seal_module(&modp->curr);
      -}

      Without the module instance there's no reliable way to figure out the writable + erts_seal_module(&modp->curr); +}

      Without the module instance there's no reliable way to figure out the writable address of a code page, and we rely on address space layout randomization (ASLR) to make it difficult to guess. On some platforms, security is further enhanced by protecting the writable area from writes until the module has been @@ -397,7 +397,7 @@ flamegraph.pl out.folded > out.svg

      We get a graph that would look something like this:

      Linux Perf FlameGraph: dialyzer PLT build

      You can view a larger version here. It contains the same information, but it is easier to share with others as it does not need the symbols in the executable.

      Using the same data we can also produce a graph where the scheduler profile data -has been merged by using sed:

      #href_anchor"p"># Strip [0-9]+_ and/or _[0-9]+ from all scheduler names
      +has been merged by using sed:

      #href_anchor"p"># Strip [0-9]+_ and/or _[0-9]+ from all scheduler names
       ## scheduler names changed in OTP26, hence two expressions
       sed -e 's/^[0-9]\+_//' -e 's/^erts_\([^_]\+\)_[0-9]\+/erts_\1/' out.folded > out.folded_sched
       ## Create the svg
      @@ -552,7 +552,7 @@
                 Erlang programming language
       
             

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/carriermigration.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (629)) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/carriermigration.html 2026-06-04 19:05:01.818444525 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/carriermigration.html 2026-06-04 19:05:01.818444525 +0000 @@ -407,7 +407,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/codeloading.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (562)) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/codeloading.html 2026-06-04 19:05:01.834444673 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/codeloading.html 2026-06-04 19:05:01.834444673 +0000 @@ -167,8 +167,8 @@ erts_try_seize_code_load_permission and erts_release_code_load_permission).

      The ability to prepare several modules in parallel is not currently used as almost all code loading is serialized by the code_server -process. The BIF interface is however prepared for this.

        erlang:prepare_loading(Module, Code) -> LoaderState
      -  erlang:finish_loading([LoaderState])

      The idea is that prepare_loading could be called in parallel for +process. The BIF interface is however prepared for this.

        erlang:prepare_loading(Module, Code) -> LoaderState
      +  erlang:finish_loading([LoaderState])

      The idea is that prepare_loading could be called in parallel for different modules and returns a "magic binary" containing the internal state of each prepared module. Function finish_loading could take a list of such states and do the finishing of all of them in one go.

      Currently we use the legacy BIF erlang:load_module which is now @@ -319,7 +319,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/communication.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/communication.html 2026-06-04 19:05:01.851444831 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/communication.html 2026-06-04 19:05:01.851444831 +0000 @@ -202,7 +202,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/counters.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (329)) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/counters.html 2026-06-04 19:05:01.871445016 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/counters.html 2026-06-04 19:05:01.871445016 +0000 @@ -513,7 +513,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/countinginstructions.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/countinginstructions.html 2026-06-04 19:05:01.888445174 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/countinginstructions.html 2026-06-04 19:05:01.889445183 +0000 @@ -220,7 +220,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/crash_dump.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1161)) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/crash_dump.html 2026-06-04 19:05:01.908445360 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/crash_dump.html 2026-06-04 19:05:01.908445360 +0000 @@ -405,13 +405,13 @@ interesting. One has to "guess" what is what, but as the information is symbolic, thorough reading of this information can be useful. As an example, we can find the state variable of the Erlang primitive loader online (5) and -(6) in the following example:

      (1)  3cac44   Return addr 0x13BF58 (<terminate process normally>)
      -(2)  y(0)     ["/view/siri_r10_dev/clearcase/otp/erts/lib/kernel/ebin",
      -(3)            "/view/siri_r10_dev/clearcase/otp/erts/lib/stdlib/ebin"]
      -(4)  y(1)     <0.1.0>
      -(5)  y(2)     {state,[],none,#Fun<erl_prim_loader.6.7085890>,undefined,#Fun<erl_prim_loader.7.9000327>,
      -(6)            #Fun<erl_prim_loader.8.116480692>,#Port<0.2>,infinity,#Fun<erl_prim_loader.9.10708760>}
      -(7)  y(3)     infinity

      When interpreting the data for a process, it is helpful to know that anonymous +(6) in the following example:

      (1)  3cac44   Return addr 0x13BF58 (<terminate process normally>)
      +(2)  y(0)     ["/view/siri_r10_dev/clearcase/otp/erts/lib/kernel/ebin",
      +(3)            "/view/siri_r10_dev/clearcase/otp/erts/lib/stdlib/ebin"]
      +(4)  y(1)     <0.1.0>
      +(5)  y(2)     {state,[],none,#Fun<erl_prim_loader.6.7085890>,undefined,#Fun<erl_prim_loader.7.9000327>,
      +(6)            #Fun<erl_prim_loader.8.116480692>,#Port<0.2>,infinity,#Fun<erl_prim_loader.9.10708760>}
      +(7)  y(3)     infinity

      When interpreting the data for a process, it is helpful to know that anonymous function objects (funs) are given the following:

      • A name constructed from the name of the function in which they are created
      • A number (starting with 0) indicating the number of that fun within that function

      @@ -477,7 +477,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/delayeddealloc.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/delayeddealloc.html 2026-06-04 19:05:01.925445517 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/delayeddealloc.html 2026-06-04 19:05:01.926445527 +0000 @@ -342,7 +342,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/driver.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (845)) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/driver.html 2026-06-04 19:05:01.957445814 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/driver.html 2026-06-04 19:05:01.957445814 +0000 @@ -180,12 +180,12 @@ terms, so binary_to_term is called in Erlang to convert the result to term form.

      The code is available in pg_sync.c in the sample directory of erts.

      The driver entry contains the functions that will be called by the emulator. In this example, only start, stop, and control are provided:

      /* Driver interface declarations */
      -static ErlDrvData start(ErlDrvPort port, char *command);
      -static void stop(ErlDrvData drv_data);
      -static int control(ErlDrvData drv_data, unsigned int command, char *buf,
      -                   int len, char **rbuf, int rlen);
      +static ErlDrvData start(ErlDrvPort port, char *command);
      +static void stop(ErlDrvData drv_data);
      +static int control(ErlDrvData drv_data, unsigned int command, char *buf,
      +                   int len, char **rbuf, int rlen);
       
      -static ErlDrvEntry pq_driver_entry = {
      +static ErlDrvEntry pq_driver_entry = {
           NULL,                        /* init */
           start,
           stop,
      @@ -202,10 +202,10 @@
           NULL,                        /* flush */
           NULL,                        /* call */
           NULL                         /* event */
      -};

      We have a structure to store state needed by the driver, in this case we only -need to keep the database connection:

      typedef struct our_data_s {
      +};

      We have a structure to store state needed by the driver, in this case we only +need to keep the database connection:

      typedef struct our_data_s {
           PGconn* conn;
      -} our_data_t;

      The control codes that we have defined are as follows:

      /* Keep the following definitions in alignment with the
      +} our_data_t;

      The control codes that we have defined are as follows:

      /* Keep the following definitions in alignment with the
        * defines in erl_pq_sync.erl
        */
       
      @@ -221,130 +221,130 @@
        * the driver entry.
        */
       
      -DRIVER_INIT(pq_drv)
      -{
      +DRIVER_INIT(pq_drv)
      +{
           return &pq_driver_entry;
      -}

      Here some initialization is done, start is called from open_port/2. The data +}

      Here some initialization is done, start is called from open_port/2. The data will be passed to control and stop.

      /* DRIVER INTERFACE */
      -static ErlDrvData start(ErlDrvPort port, char *command)
      -{
      +static ErlDrvData start(ErlDrvPort port, char *command)
      +{
           our_data_t* data;
       
      -    data = (our_data_t*)driver_alloc(sizeof(our_data_t));
      +    data = (our_data_t*)driver_alloc(sizeof(our_data_t));
           data->conn = NULL;
      -    set_port_control_flags(port, PORT_CONTROL_FLAG_BINARY);
      -    return (ErlDrvData)data;
      -}

      We call disconnect to log out from the database. (This should have been done -from Erlang, but just in case.)

      static int do_disconnect(our_data_t* data, ei_x_buff* x);
      -
      -static void stop(ErlDrvData drv_data)
      -{
      -    our_data_t* data = (our_data_t*)drv_data;
      -
      -    do_disconnect(data, NULL);
      -    driver_free(data);
      -}

      We use the binary format only to return data to the emulator; input data is a + set_port_control_flags(port, PORT_CONTROL_FLAG_BINARY); + return (ErlDrvData)data; +}

      We call disconnect to log out from the database. (This should have been done +from Erlang, but just in case.)

      static int do_disconnect(our_data_t* data, ei_x_buff* x);
      +
      +static void stop(ErlDrvData drv_data)
      +{
      +    our_data_t* data = (our_data_t*)drv_data;
      +
      +    do_disconnect(data, NULL);
      +    driver_free(data);
      +}

      We use the binary format only to return data to the emulator; input data is a string parameter for connect and select. The returned data consists of Erlang terms.

      The functions get_s and ei_x_to_new_binary are utilities that are used to make the code shorter. get_s duplicates the string and zero-terminates it, as the postgres client library wants that. ei_x_to_new_binary takes an ei_x_buff buffer, allocates a binary, and copies the data there. This binary is returned in *rbuf. (Notice that this binary is freed by the emulator, not -by us.)

      static char* get_s(const char* buf, int len);
      -static int do_connect(const char *s, our_data_t* data, ei_x_buff* x);
      -static int do_select(const char* s, our_data_t* data, ei_x_buff* x);
      +by us.)

      static char* get_s(const char* buf, int len);
      +static int do_connect(const char *s, our_data_t* data, ei_x_buff* x);
      +static int do_select(const char* s, our_data_t* data, ei_x_buff* x);
       
       /* As we are operating in binary mode, the return value from control
        * is irrelevant, as long as it is not negative.
        */
      -static int control(ErlDrvData drv_data, unsigned int command, char *buf,
      -                   int len, char **rbuf, int rlen)
      -{
      +static int control(ErlDrvData drv_data, unsigned int command, char *buf,
      +                   int len, char **rbuf, int rlen)
      +{
           int r;
           ei_x_buff x;
      -    our_data_t* data = (our_data_t*)drv_data;
      -    char* s = get_s(buf, len);
      -    ei_x_new_with_version(&x);
      -    switch (command) {
      -        case DRV_CONNECT:    r = do_connect(s, data, &x);  break;
      -        case DRV_DISCONNECT: r = do_disconnect(data, &x);  break;
      -        case DRV_SELECT:     r = do_select(s, data, &x);   break;
      +    our_data_t* data = (our_data_t*)drv_data;
      +    char* s = get_s(buf, len);
      +    ei_x_new_with_version(&x);
      +    switch (command) {
      +        case DRV_CONNECT:    r = do_connect(s, data, &x);  break;
      +        case DRV_DISCONNECT: r = do_disconnect(data, &x);  break;
      +        case DRV_SELECT:     r = do_select(s, data, &x);   break;
               default:             r = -1;        break;
      -    }
      -    *rbuf = (char*)ei_x_to_new_binary(&x);
      -    ei_x_free(&x);
      -    driver_free(s);
      +    }
      +    *rbuf = (char*)ei_x_to_new_binary(&x);
      +    ei_x_free(&x);
      +    driver_free(s);
           return r;
      -}

      do_connect is where we log in to the database. If the connection was +}

      do_connect is where we log in to the database. If the connection was successful, we store the connection handle in the driver data, and return 'ok'. Otherwise, we return the error message from postgres and store NULL in -the driver data.

      static int do_connect(const char *s, our_data_t* data, ei_x_buff* x)
      -{
      -    PGconn* conn = PQconnectdb(s);
      -    if (PQstatus(conn) != CONNECTION_OK) {
      -        encode_error(x, conn);
      -        PQfinish(conn);
      +the driver data.

      static int do_connect(const char *s, our_data_t* data, ei_x_buff* x)
      +{
      +    PGconn* conn = PQconnectdb(s);
      +    if (PQstatus(conn) != CONNECTION_OK) {
      +        encode_error(x, conn);
      +        PQfinish(conn);
               conn = NULL;
      -    } else {
      -        encode_ok(x);
      -    }
      +    } else {
      +        encode_ok(x);
      +    }
           data->conn = conn;
           return 0;
      -}

      If we are connected (and if the connection handle is not NULL), we log out +}

      If we are connected (and if the connection handle is not NULL), we log out from the database. We need to check if we should encode an 'ok', as we can get -here from function stop, which does not return data to the emulator:

      static int do_disconnect(our_data_t* data, ei_x_buff* x)
      -{
      -    if (data->conn == NULL)
      +here from function stop, which does not return data to the emulator:

      static int do_disconnect(our_data_t* data, ei_x_buff* x)
      +{
      +    if (data->conn == NULL)
               return 0;
      -    PQfinish(data->conn);
      +    PQfinish(data->conn);
           data->conn = NULL;
      -    if (x != NULL)
      -        encode_ok(x);
      +    if (x != NULL)
      +        encode_ok(x);
           return 0;
      -}

      We execute a query and encode the result. Encoding is done in another C module, -pg_encode.c, which is also provided as sample code.

      static int do_select(const char* s, our_data_t* data, ei_x_buff* x)
      -{
      -   PGresult* res = PQexec(data->conn, s);
      -    encode_result(x, res, data->conn);
      -    PQclear(res);
      +}

      We execute a query and encode the result. Encoding is done in another C module, +pg_encode.c, which is also provided as sample code.

      static int do_select(const char* s, our_data_t* data, ei_x_buff* x)
      +{
      +   PGresult* res = PQexec(data->conn, s);
      +    encode_result(x, res, data->conn);
      +    PQclear(res);
           return 0;
      -}

      Here we check the result from postgres. If it is data, we encode it as lists of +}

      Here we check the result from postgres. If it is data, we encode it as lists of lists with column data. Everything from postgres is C strings, so we use ei_x_encode_string to send the result as strings to Erlang. (The head of the -list contains the column names.)

      void encode_result(ei_x_buff* x, PGresult* res, PGconn* conn)
      -{
      +list contains the column names.)

      void encode_result(ei_x_buff* x, PGresult* res, PGconn* conn)
      +{
           int row, n_rows, col, n_cols;
      -    switch (PQresultStatus(res)) {
      +    switch (PQresultStatus(res)) {
           case PGRES_TUPLES_OK:
      -        n_rows = PQntuples(res);
      -        n_cols = PQnfields(res);
      -        ei_x_encode_tuple_header(x, 2);
      -        encode_ok(x);
      -        ei_x_encode_list_header(x, n_rows+1);
      /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/driver_entry.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (772))
      --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/driver_entry.html	2026-06-04 19:05:01.979446018 +0000
      +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/driver_entry.html	2026-06-04 19:05:01.979446018 +0000
      @@ -176,54 +176,54 @@
         
         Data Types
       

      -

      ErlDrvEntry

      typedef struct erl_drv_entry {
      -    int (*init)(void);          /* Called at system startup for statically
      +

      ErlDrvEntry

      typedef struct erl_drv_entry {
      +    int (*init)(void);          /* Called at system startup for statically
                                          linked drivers, and after loading for
                                          dynamically loaded drivers */
       #ifndef ERL_SYS_DRV
      -    ErlDrvData (*start)(ErlDrvPort port, char *command);
      +    ErlDrvData (*start)(ErlDrvPort port, char *command);
                                       /* Called when open_port/2 is invoked,
                                          return value -1 means failure */
       #else
      -    ErlDrvData (*start)(ErlDrvPort port, char *command, SysDriverOpts* opts);
      +    ErlDrvData (*start)(ErlDrvPort port, char *command, SysDriverOpts* opts);
                                       /* Special options, only for system driver */
       #endif
      -    void (*stop)(ErlDrvData drv_data);
      +    void (*stop)(ErlDrvData drv_data);
                                       /* Called when port is closed, and when the
                                          emulator is halted */
      -    void (*output)(ErlDrvData drv_data, char *buf, ErlDrvSizeT len);
      +    void (*output)(ErlDrvData drv_data, char *buf, ErlDrvSizeT len);
                                       /* Called when we have output from Erlang to
                                          the port */
      -    void (*ready_input)(ErlDrvData drv_data, ErlDrvEvent event);
      +    void (*ready_input)(ErlDrvData drv_data, ErlDrvEvent event);
                                       /* Called when we have input from one of
                                          the driver's handles */
      -    void (*ready_output)(ErlDrvData drv_data, ErlDrvEvent event);
      +    void (*ready_output)(ErlDrvData drv_data, ErlDrvEvent event);
                                       /* Called when output is possible to one of
                                          the driver's handles */
           char *driver_name;          /* Name supplied as command in
                                          erlang:open_port/2 */
      -    void (*finish)(void);       /* Called before unloading the driver -
      +    void (*finish)(void);       /* Called before unloading the driver -
                                          dynamic drivers only */
           void *handle;               /* Reserved, used by emulator internally */
      -    ErlDrvSSizeT (*control)(ErlDrvData drv_data, unsigned int command,
      +    ErlDrvSSizeT (*control)(ErlDrvData drv_data, unsigned int command,
                                   char *buf, ErlDrvSizeT len,
      -			    char **rbuf, ErlDrvSizeT rlen);
      +			    char **rbuf, ErlDrvSizeT rlen);
                                       /* "ioctl" for drivers - invoked by
                                          port_control/3 */
      -    void (*timeout)(ErlDrvData drv_data);
      +    void (*timeout)(ErlDrvData drv_data);
                                       /* Handling of time-out in driver */
      -    void (*outputv)(ErlDrvData drv_data, ErlIOVec *ev);
      +    void (*outputv)(ErlDrvData drv_data, ErlIOVec *ev);
                                       /* Called when we have output from Erlang
                                          to the port */
      -    void (*ready_async)(ErlDrvData drv_data, ErlDrvThreadData thread_data);
      -    void (*flush)(ErlDrvData drv_data);
      +    void (*ready_async)(ErlDrvData drv_data, ErlDrvThreadData thread_data);
      +    void (*flush)(ErlDrvData drv_data);
                                       /* Called when the port is about to be
                                          closed, and there is data in the
                                          driver queue that must be flushed
                                          before 'stop' can be called */
      -    ErlDrvSSizeT (*call)(ErlDrvData drv_data, unsigned int command,
      +    ErlDrvSSizeT (*call)(ErlDrvData drv_data, unsigned int command,
                                char *buf, ErlDrvSizeT len,
      -			 char **rbuf, ErlDrvSizeT rlen, unsigned int *flags);
      +			 char **rbuf, ErlDrvSizeT rlen, unsigned int *flags);
                                       /* Works mostly like 'control', a synchronous
                                          call into the driver */
           void* unused_event_callback;
      @@ -232,11 +232,11 @@
           int minor_version;          /* ERL_DRV_EXTENDED_MINOR_VERSION */
           int driver_flags;           /* ERL_DRV_FLAGs */
           void *handle2;              /* Reserved, used by emulator internally */
      -    void (*process_exit)(ErlDrvData drv_data, ErlDrvMonitor *monitor);
      +    void (*process_exit)(ErlDrvData drv_data, ErlDrvMonitor *monitor);
                                       /* Called when a process monitor fires */
      -    void (*stop_select)(ErlDrvEvent event, void* reserved);
      +    void (*stop_select)(ErlDrvEvent event, void* reserved);
                                       /* Called to close an event object */
      - } ErlDrvEntry;
      • int (*init)(void) - Called directly after the driver has been + } ErlDrvEntry;

      • int (*init)(void) - Called directly after the driver has been loaded by erl_ddll:load_driver/2 (actually when the driver is added to the driver list). The driver is to return 0, or, if the driver cannot initialize, -1.

      • ErlDrvData (*start)(ErlDrvPort port, char* command) - Called @@ -421,7 +421,7 @@ Erlang programming language

        -

        Copyright © 1996-2026 Ericsson AB

        +

        Copyright © 1996-2042 Ericsson AB

        /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/epmd_cmd.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (478)) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/epmd_cmd.html 2026-06-04 19:05:01.998446195 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/epmd_cmd.html 2026-06-04 19:05:01.998446195 +0000 @@ -305,7 +305,7 @@ Erlang programming language

        -

        Copyright © 1996-2026 Ericsson AB

        +

        Copyright © 1996-2042 Ericsson AB

        /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erl_cmd.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (663)) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erl_cmd.html 2026-06-04 19:05:02.028446473 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erl_cmd.html 2026-06-04 19:05:02.029446482 +0000 @@ -154,18 +154,18 @@ init process and can be retrieved by calling init:get_plain_arguments/0. Plain arguments can occur before the first flag, or after a -- flag. Also, the -extra flag causes everything that follows to become plain arguments.

      Examples:

      % erl +W w -sname arnie +R 9 -s my_init -extra +bertie
      -(arnie@host)1> init:get_argument(sname).
      -{ok,[["arnie"]]}
      -(arnie@host)2> init:get_plain_arguments().
      -["+bertie"]

      Here +W w and +R 9 are emulator flags. -s my_init is an init flag, +(arnie@host)1> init:get_argument(sname). +{ok,[["arnie"]]} +(arnie@host)2> init:get_plain_arguments(). +["+bertie"]

      Here +W w and +R 9 are emulator flags. -s my_init is an init flag, interpreted by init. -sname arnie is a user flag, stored by init. It is read by Kernel and causes the Erlang runtime system to become distributed. Finally, everything after -extra (that is, +bertie) is considered as plain arguments.

      % erl -myflag 1
      -1> init:get_argument(myflag).
      -{ok,[["1"]]}
      -2> init:get_plain_arguments().
      -[]

      Here the user flag -myflag 1 is passed to and stored by the init process. It +1> init:get_argument(myflag). +{ok,[["1"]]} +2> init:get_plain_arguments(). +[]

      Here the user flag -myflag 1 is passed to and stored by the init process. It is a user-defined flag, presumably used by some user-defined application.

      @@ -702,7 +702,7 @@ also balances scheduler utilization between schedulers.

    • +sct CpuTopology - Sets a user-defined CPU topology. The user-defined CPU topology overrides any automatically detected CPU topology. The CPU topology is used when -binding schedulers to logical processors.

      <Id> = integer(); when 0 =< <Id> =< 65535
      +binding schedulers to logical processors.

      <Id> = integer(); when 0 =< <Id> =< 65535
       <IdRange> = <Id>-<Id>
       <IdOrIdRange> = <Id> | <IdRange>
       <IdList> = <IdOrIdRange>,<IdOrIdRange> | <IdOrIdRange>
      @@ -735,22 +735,22 @@
       NUMA node. If <ProcessorIds> is omitted, its default position is before
       <NodeIds>. That is, the default is processor external NUMA nodes.

      If a list of identifiers is used in an <IdDefs>:

      • <LogicalIds> must be a list of identifiers.
      • At least one other identifier type besides <LogicalIds> must also have a list of identifiers.
      • All lists of identifiers must produce the same number of identifiers.

      A simple example. A single quad core processor can be described as follows:

      % erl +sct L0-3c0-3
      -1> erlang:system_info(cpu_topology).
      -[{processor,[{core,{logical,0}},
      -             {core,{logical,1}},
      -             {core,{logical,2}},
      -             {core,{logical,3}}]}]

      A more complicated example with two quad core processors, each processor in +1> erlang:system_info(cpu_topology). +[{processor,[{core,{logical,0}}, + {core,{logical,1}}, + {core,{logical,2}}, + {core,{logical,3}}]}]

      A more complicated example with two quad core processors, each processor in its own NUMA node. The ordering of logical processors is a bit weird. This to give a better example of identifier lists:

      % erl +sct L0-1,3-2c0-3p0N0:L7,4,6-5c0-3p1N1
      -1> erlang:system_info(cpu_topology).
      -[{node,[{processor,[{core,{logical,0}},
      -                    {core,{logical,1}},
      -                    {core,{logical,3}},
      -                    {core,{logical,2}}]}]},
      - {node,[{processor,[{core,{logical,7}},
      -                    {core,{logical,4}},
      -                    {core,{logical,6}},
      -                    {core,{logical,5}}]}]}]

      As long as real identifiers are correct, it is OK to pass a CPU topology +1> erlang:system_info(cpu_topology). +[{node,[{processor,[{core,{logical,0}}, + {core,{logical,1}}, + {core,{logical,3}}, + {core,{logical,2}}]}]}, + {node,[{processor,[{core,{logical,7}}, + {core,{logical,4}}, + {core,{logical,6}}, + {core,{logical,5}}]}]}]

      As long as real identifiers are correct, it is OK to pass a CPU topology that is not a correct description of the CPU topology. When used with care this can be very useful. This to trick the emulator to bind its schedulers as you want. For example, if you want to run multiple Erlang runtime systems @@ -925,10 +925,10 @@ user's home directory and then filename:basedir(user_config, "erlang").

      If an .erlang file is found, it is assumed to contain valid Erlang expressions. These expressions are evaluated as if they were input to the -shell.

      A typical .erlang file contains a set of search paths, for example:

      io:format("executing user profile in $HOME/.erlang\n",[]).
      -code:add_path("/home/calvin/test/ebin").
      -code:add_path("/home/hobbes/bigappl-1.2/ebin").
      -io:format(".erlang rc finished\n",[]).
    • user_default and shell_default - Functions in the shell that are not +shell.

      A typical .erlang file contains a set of search paths, for example:

      io:format("executing user profile in $HOME/.erlang\n",[]).
      +code:add_path("/home/calvin/test/ebin").
      +code:add_path("/home/hobbes/bigappl-1.2/ebin").
      +io:format(".erlang rc finished\n",[]).
    • user_default and shell_default - Functions in the shell that are not prefixed by a module name are assumed to be functional objects (funs), built-in functions (BIFs), or belong to the module user_default or shell_default.

      To include private shell commands, define them in a module user_default and @@ -990,7 +990,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erl_dist_protocol.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (2327)) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erl_dist_protocol.html 2026-06-04 19:05:02.054446714 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erl_dist_protocol.html 2026-06-04 19:05:02.062446788 +0000 @@ -256,7 +256,7 @@ client ->> EPMD: NAMES_REQ EPMD -->> client: NAMES_RESP
    1
    110

    Table: NAMES_REQ (110)

    The response for a NAMES_REQ is as follows:

    4
    EPMDPortNoNodeInfo*

    Table: NAMES_RESP

    NodeInfo is a string written for each active node. When all NodeInfo has -been written the connection is closed by the EPMD.

    NodeInfo is, as expressed in Erlang:

    io:format("name ~ts at port ~p~n", [NodeName, Port]).

    +been written the connection is closed by the EPMD.

    NodeInfo is, as expressed in Erlang:

    io:format("name ~ts at port ~p~n", [NodeName, Port]).

    @@ -271,9 +271,9 @@ client ->> EPMD: DUMP_REQ EPMD -->> client: DUMP_RESP

    1
    100

    Table: DUMP_REQ

    The response for a DUMP_REQ is as follows:

    4
    EPMDPortNoNodeInfo*

    Table: DUMP_RESP

    NodeInfo is a string written for each node kept in the EPMD. When all -NodeInfo has been written the connection is closed by the EPMD.

    NodeInfo is, as expressed in Erlang:

    io:format("active name     ~ts at port ~p, fd = ~p~n",
    -          [NodeName, Port, Fd]).

    or

    io:format("old/unused name ~ts at port ~p, fd = ~p ~n",
    -          [NodeName, Port, Fd]).

    +NodeInfo has been written the connection is closed by the EPMD.

    NodeInfo is, as expressed in Erlang:

    io:format("active name     ~ts at port ~p, fd = ~p~n",
    +          [NodeName, Port, Fd]).

    or

    io:format("old/unused name ~ts at port ~p, fd = ~p ~n",
    +          [NodeName, Port, Fd]).

    @@ -411,7 +411,7 @@ Semigraphic View

    -
    A (initiator)                                      B (acceptor)
    +
    A (initiator)                                      B (acceptor)
     
     TCP connect ------------------------------------>
                                                        TCP accept
    @@ -421,36 +421,36 @@
     
       <---------------------------------------------- send_status
     recv_status
    -(if status was 'alive'
    +(if status was 'alive'
      send_status - - - - - - - - - - - - - - - - - ->
    -                                                   recv_status)
    +                                                   recv_status)
     
    -                          (ChB)                      ChB = gen_challenge()
    +                          (ChB)                      ChB = gen_challenge()
       <---------------------------------------------- send_challenge
     recv_challenge
     
    -(if old send_name
    +(if old send_name
      send_complement - - - - - - - - - - - - - - - ->
    -                                                   recv_complement)
    +                                                   recv_complement)
     
    -ChA = gen_challenge(),
    -OCA = out_cookie(B),
    -DiA = gen_digest(ChB, OCA)
    -                          (ChA, DiA)
    +ChA = gen_challenge(),
    +OCA = out_cookie(B),
    +DiA = gen_digest(ChB, OCA)
    +                          (ChA, DiA)
     send_challenge_reply --------------------------->
                                                        recv_challenge_reply
    -                                                   ICB = in_cookie(A),
    +                                                   ICB = in_cookie(A),
                                                        check:
    -                                                   DiA == gen_digest (ChB, ICB)?
    +                                                   DiA == gen_digest (ChB, ICB)?
                                                        - if OK:
    -                                                    OCB = out_cookie(A),
    -                                                    DiB = gen_digest (ChA, OCB)
    -                          (DiB)
    +                                                    OCB = out_cookie(A),
    +                                                    DiB = gen_digest (ChA, OCB)
    +                          (DiB)
       <----------------------------------------------- send_challenge_ack
     recv_challenge_ack                                  DONE
    -ICA = in_cookie(B),                                - else:
    +ICA = in_cookie(B),                                - else:
     check:                                              CLOSE
    -DiB == gen_digest(ChA, ICA)?
    +DiB == gen_digest(ChA, ICA)?
     - if OK:
      DONE
     - else:
    @@ -766,7 +766,7 @@
               Erlang programming language
     
           

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erl_driver.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (815)) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erl_driver.html 2026-06-04 19:05:02.102447159 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erl_driver.html 2026-06-04 19:05:02.102447159 +0000 @@ -333,7 +333,7 @@
    • ErlDrvSizeT - An unsigned integer type to be used as size_t.

    • ErlDrvSSizeT - A signed integer type, the size of -ErlDrvSizeT.

    • ErlDrvSysInfo

      typedef struct ErlDrvSysInfo {
      +ErlDrvSizeT.

    • ErlDrvSysInfo

      typedef struct ErlDrvSysInfo {
          int driver_major_version;
          int driver_minor_version;
          char *erts_version;
      @@ -345,7 +345,7 @@
          int nif_major_version;
          int nif_minor_version;
          int dirty_scheduler_support;
      -} ErlDrvSysInfo;

      The ErlDrvSysInfo structure is used for storage of information about the +} ErlDrvSysInfo;

    The ErlDrvSysInfo structure is used for storage of information about the Erlang runtime system. driver_system_info writes the system information when passed a reference to a ErlDrvSysInfo structure. The fields @@ -401,12 +401,12 @@ aligned for storage of an array of doubles (usually 8-byte aligned).

  • ErlDrvData - A handle to driver-specific data, passed to the driver callbacks. It is a pointer, and is most often type cast to a specific pointer in the driver.

  • SysIOVec - A system I/O vector, as used by writev on Unix and -WSASend on Win32. It is used in ErlIOVec.

  • ErlIOVec

    typedef struct ErlIOVec {
    +WSASend on Win32. It is used in ErlIOVec.

  • ErlIOVec

    typedef struct ErlIOVec {
       int vsize;
       ErlDrvSizeT size;
       SysIOVec* iov;
       ErlDrvBinary** binv;
    -} ErlIOVec;

    The I/O vector used by the emulator and drivers is a list of binaries, with a +} ErlIOVec;

  • The I/O vector used by the emulator and drivers is a list of binaries, with a SysIOVec pointing to the buffers of the binaries. It is used in driver_outputv and the outputv driver callback. Also, the driver queue is an ErlIOVec.

  • ErlDrvMonitor - When a driver creates a monitor for a process, a @@ -485,8 +485,8 @@ add_driver_entry() -

    void add_driver_entry(ErlDrvEntry
    -        *de);

    Adds a driver entry to the list of drivers known by Erlang. The +

    void add_driver_entry(ErlDrvEntry
    +        *de);

    Adds a driver entry to the list of drivers known by Erlang. The init function of parameter de is called.

    Note

    To use this function for adding drivers residing in dynamically loaded code is dangerous. If the driver code for the added driver resides in the same dynamically loaded module (that is, .so file) as a normal dynamically loaded @@ -498,7 +498,7 @@ driver_alloc() -

    void * driver_alloc(ErlDrvSizeT size);

    Allocates a memory block of the size specified in size, and returns it. This +

    void * driver_alloc(ErlDrvSizeT size);

    Allocates a memory block of the size specified in size, and returns it. This fails only on out of memory, in which case NULL is returned. (This is most often a wrapper for malloc).

    Memory allocated must be explicitly freed with a corresponding call to driver_free (unless otherwise stated).

    This function is thread-safe.

    @@ -507,7 +507,7 @@ driver_alloc_binary()

    -
    ErlDrvBinary * driver_alloc_binary(ErlDrvSizeT size);

    Allocates a driver binary with a memory block of at least size bytes, and +

    ErlDrvBinary * driver_alloc_binary(ErlDrvSizeT size);

    Allocates a driver binary with a memory block of at least size bytes, and returns a pointer to it, or NULL on failure (out of memory). When a driver binary has been sent to the emulator, it must not be changed. Every allocated binary is to be freed by a corresponding call to @@ -521,9 +521,9 @@ driver_async() -

    long driver_async(ErlDrvPort port, unsigned
    -        int* key, void (*async_invoke)(void*), void* async_data, void
    -        (*async_free)(void*));

    Performs an asynchronous call. The function async_invoke is invoked in a +

    long driver_async(ErlDrvPort port, unsigned
    +        int* key, void (*async_invoke)(void*), void* async_data, void
    +        (*async_free)(void*));

    Performs an asynchronous call. The function async_invoke is invoked in a thread separate from the emulator thread. This enables the driver to perform time-consuming, blocking operations without blocking the emulator.

    The async thread pool size can be set with command-line argument +A in erl(1). If an async @@ -555,7 +555,7 @@ driver_async_port_key() -

    unsigned int driver_async_port_key(ErlDrvPort port);

    Calculates a key for later use in driver_async. +

    unsigned int driver_async_port_key(ErlDrvPort port);

    Calculates a key for later use in driver_async. The keys are evenly distributed so that a fair mapping between port IDs and async thread IDs is achieved.

    Note

    Before Erlang/OTP R16, the port ID could be used as a key with proper casting, but after the rewrite of the port subsystem, this is no longer the case. With @@ -566,7 +566,7 @@ driver_binary_dec_refc() -

    long driver_binary_dec_refc(ErlDrvBinary *bin);

    Decrements the reference count on bin and returns the reference count reached +

    long driver_binary_dec_refc(ErlDrvBinary *bin);

    Decrements the reference count on bin and returns the reference count reached after the decrement.

    This function is thread-safe.

    Note

    The reference count of driver binary is normally to be decremented by calling driver_free_binary.

    driver_binary_dec_refc does not free the binary if the reference count reaches zero. Only use driver_binary_dec_refc when you are sure not to @@ -576,21 +576,21 @@ driver_binary_get_refc() -

    long driver_binary_get_refc(ErlDrvBinary *bin);

    Returns the current reference count on bin.

    This function is thread-safe.

    +
    long driver_binary_get_refc(ErlDrvBinary *bin);

    Returns the current reference count on bin.

    This function is thread-safe.

    driver_binary_inc_refc()

    -
    long driver_binary_inc_refc(ErlDrvBinary *bin);

    Increments the reference count on bin and returns the reference count reached +

    long driver_binary_inc_refc(ErlDrvBinary *bin);

    Increments the reference count on bin and returns the reference count reached after the increment.

    This function is thread-safe.

    driver_caller()

    -
    ErlDrvTermData driver_caller(ErlDrvPort
    -        port);

    Returns the process ID of the process that made the current call to the driver. +

    ErlDrvTermData driver_caller(ErlDrvPort
    +        port);

    Returns the process ID of the process that made the current call to the driver. The process ID can be used with driver_send_term to send back data to the caller. driver_caller only returns valid data when currently executing in one @@ -603,14 +603,14 @@ driver_cancel_timer() -

    int driver_cancel_timer(ErlDrvPort port);

    Cancels a timer set with driver_set_timer.

    The return value is 0.

    +
    int driver_cancel_timer(ErlDrvPort port);

    Cancels a timer set with driver_set_timer.

    The return value is 0.

    driver_compare_monitors()

    -
    int driver_compare_monitors(const ErlDrvMonitor
    -        *monitor1, const ErlDrvMonitor *monitor2);

    Compares two ErlDrvMonitors. Can also be used to imply some artificial order +

    int driver_compare_monitors(const ErlDrvMonitor
    +        *monitor1, const ErlDrvMonitor *monitor2);

    Compares two ErlDrvMonitors. Can also be used to imply some artificial order on monitors, for whatever reason.

    Returns 0 if monitor1 and monitor2 are equal, < 0 if monitor1 < monitor2, and > 0 if monitor1 > monitor2.

    @@ -618,16 +618,16 @@ driver_connected()

    -
    ErlDrvTermData driver_connected(ErlDrvPort
    -        port);

    Returns the port owner process.

    Notice that this function is not thread-safe.

    +
    ErlDrvTermData driver_connected(ErlDrvPort
    +        port);

    Returns the port owner process.

    Notice that this function is not thread-safe.

    driver_create_port()

    -
    ErlDrvPort driver_create_port(ErlDrvPort port,
    +
    ErlDrvPort driver_create_port(ErlDrvPort port,
             ErlDrvTermData owner_pid, char* name,
    -        ErlDrvData drv_data);

    Creates a new port executing the same driver code as the port creating the new + ErlDrvData drv_data);

    Creates a new port executing the same driver code as the port creating the new port.

    • port - The port handle of the port (driver instance) creating the new port.

    • owner_pid - The process ID of the Erlang process to become owner of the new port. This process will be linked to the new port. You usually want to use @@ -648,15 +648,15 @@ driver_demonitor_process() -

      int driver_demonitor_process(ErlDrvPort port,
      -        const ErlDrvMonitor *monitor);

      Cancels a monitor created earlier.

      Returns 0 if a monitor was removed and > 0 if the monitor no longer exists.

      +
      int driver_demonitor_process(ErlDrvPort port,
      +        const ErlDrvMonitor *monitor);

      Cancels a monitor created earlier.

      Returns 0 if a monitor was removed and > 0 if the monitor no longer exists.

      driver_deq()

      -
      ErlDrvSizeT driver_deq(ErlDrvPort port,
      -        ErlDrvSizeT size);

      Dequeues data by moving the head pointer forward in the driver queue by size +

      ErlDrvSizeT driver_deq(ErlDrvPort port,
      +        ErlDrvSizeT size);

      Dequeues data by moving the head pointer forward in the driver queue by size bytes. The data in the queue is deallocated.

      Returns the number of bytes remaining in the queue on success, otherwise -1.

      This function can be called from any thread if a port data lock associated with the port is locked by the calling thread during the call.

      @@ -665,8 +665,8 @@ driver_enq()

      -
      int driver_enq(ErlDrvPort port, char* buf,
      -        ErlDrvSizeT len);

      Enqueues data in the driver queue. The data in buf is copied (len bytes) and +

      int driver_enq(ErlDrvPort port, char* buf,
      +        ErlDrvSizeT len);

      Enqueues data in the driver queue. The data in buf is copied (len bytes) and placed at the end of the driver queue. The driver queue is normally used in a FIFO way.

      The driver queue is available to queue output from the emulator to the driver (data from the driver to the emulator is queued by the emulator in normal Erlang @@ -681,8 +681,8 @@ driver_enq_bin() -

      int driver_enq_bin(ErlDrvPort port,
      -        ErlDrvBinary *bin, ErlDrvSizeT offset, ErlDrvSizeT len);

      Enqueues a driver binary in the driver queue. The data in bin at offset with +

      int driver_enq_bin(ErlDrvPort port,
      +        ErlDrvBinary *bin, ErlDrvSizeT offset, ErlDrvSizeT len);

      Enqueues a driver binary in the driver queue. The data in bin at offset with length len is placed at the end of the queue. This function is most often /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erl_ext_dist.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1873)) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erl_ext_dist.html 2026-06-04 19:05:02.126447382 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erl_ext_dist.html 2026-06-04 19:05:02.127447391 +0000 @@ -440,7 +440,7 @@ positive and 1 if it is negative. The digits are stored with the least significant byte stored first. To calculate the integer, the following formula can be used:

      B = 256
      -(d0*B^0 + d1*B^1 + d2*B^2 + ... d(N-1)*B^(n-1))

      +(d0*B^0 + d1*B^1 + d2*B^2 + ... d(N-1)*B^(n-1))

  • @@ -625,7 +625,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erl_nif.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1770)) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erl_nif.html 2026-06-04 19:05:02.178447864 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erl_nif.html 2026-06-04 19:05:02.178447864 +0000 @@ -155,29 +155,29 @@

    A minimal example of a NIF library can look as follows:

    /* niftest.c */
     #include <erl_nif.h>
     
    -static ERL_NIF_TERM hello(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
    -{
    -    return enif_make_string(env, "Hello world!", ERL_NIF_LATIN1);
    -}
    -
    -static ErlNifFunc nif_funcs[] =
    -{
    -    {"hello", 0, hello}
    -};
    +static ERL_NIF_TERM hello(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
    +{
    +    return enif_make_string(env, "Hello world!", ERL_NIF_LATIN1);
    +}
    +
    +static ErlNifFunc nif_funcs[] =
    +{
    +    {"hello", 0, hello}
    +};
     
    -ERL_NIF_INIT(niftest,nif_funcs,NULL,NULL,NULL,NULL)

    The Erlang module can look as follows:

    -module(niftest).
    +ERL_NIF_INIT(niftest,nif_funcs,NULL,NULL,NULL,NULL)

    The Erlang module can look as follows:

    -module(niftest).
     
    --export([init/0, hello/0]).
    +-export([init/0, hello/0]).
     
    --nifs([hello/0]).
    +-nifs([hello/0]).
     
    --on_load(init/0).
    +-on_load(init/0).
     
    -init() ->
    -      erlang:load_nif("./niftest", 0).
    +init() ->
    +      erlang:load_nif("./niftest", 0).
     
    -hello() ->
    -      erlang:nif_error("NIF library not loaded").

    Compile and test can look as follows (on Linux):

    $> gcc -fPIC -shared -o niftest.so niftest.c -I $ERL_ROOT/usr/include/
    +hello() ->
    +      erlang:nif_error("NIF library not loaded").

    Compile and test can look as follows (on Linux):

    $> gcc -fPIC -shared -o niftest.so niftest.c -I $ERL_ROOT/usr/include/
     $> erl
     
     1> c(niftest).
    @@ -223,21 +223,21 @@
     
     ERL_NIF_TERM world_atom;
     
    -static int load(ErlNifEnv* env, void** priv_data, ERL_NIF_TERM load_info)
    -{
    -    world_atom = enif_make_atom(env, "world");
    +static int load(ErlNifEnv* env, void** priv_data, ERL_NIF_TERM load_info)
    +{
    +    world_atom = enif_make_atom(env, "world");
         return 0;
    -}
    +}
     
    -static ERL_NIF_TERM hello(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
    -{
    -    ERL_NIF_TERM hello_string = enif_make_string(env, "Hello", ERL_NIF_LATIN1);
    -    return enif_make_tuple2(env, hello_string, world_atom);
    -}
    +static ERL_NIF_TERM hello(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
    +{
    +    ERL_NIF_TERM hello_string = enif_make_string(env, "Hello", ERL_NIF_LATIN1);
    +    return enif_make_tuple2(env, hello_string, world_atom);
    +}
     
    -static ErlNifFunc nif_funcs[] = { { "hello", 0, hello } };
    +static ErlNifFunc nif_funcs[] = { { "hello", 0, hello } };
     
    -ERL_NIF_INIT(niftest, nif_funcs, load, NULL, NULL, NULL)
  • Binaries - Terms of type binary are accessed with the help of struct type +ERL_NIF_INIT(niftest, nif_funcs, load, NULL, NULL, NULL)

  • Binaries - Terms of type binary are accessed with the help of struct type ErlNifBinary, which contains a pointer (data) to the raw binary data and the length (size) of the data in bytes. Both data and size are read-only and are only to be written using calls to API @@ -275,19 +275,19 @@ garbage collector or enif_release_resource). Resource types are uniquely identified by a supplied name string and the name of the implementing module.

    The following is a template example of how to create and return a resource object.

    ERL_NIF_TERM term;
    -MyStruct* obj = enif_alloc_resource(my_resource_type, sizeof(MyStruct));
    +MyStruct* obj = enif_alloc_resource(my_resource_type, sizeof(MyStruct));
     
     /* initialize struct ... */
     
    -term = enif_make_resource(env, obj);
    +term = enif_make_resource(env, obj);
     
    -if (keep_a_reference_of_our_own) {
    +if (keep_a_reference_of_our_own) {
         /* store &#href_anchor"w">
    -}
    -else {
    -    enif_release_resource(obj);
    +}
    +else {
    +    enif_release_resource(obj);
         /* resource now only owned by "Erlang" */
    -}
    +}
     return term;

    Notice that once enif_make_resource creates the term to return to Erlang, the code can choose to either keep its own native pointer to the allocated struct and release it later, or release it immediately and rely only on the @@ -339,50 +339,50 @@ libraries can however fail if deprecated features are used.

  • Time Measurement - Support for time measurement in NIF libraries:

  • I/O Queues
    The Erlang nif library contains function for easily working with I/O vectors as used by the unix system call writev. The I/O Queue is not thread safe, so -some other synchronization mechanism has to be used.

    Typical usage when writing to a file descriptor looks like this:

    int writeiovec(ErlNifEnv *env, ERL_NIF_TERM term, ERL_NIF_TERM *tail,
    -               ErlNifIOQueue *q, int fd) {
    +some other synchronization mechanism has to be used.

    Typical usage when writing to a file descriptor looks like this:

    int writeiovec(ErlNifEnv *env, ERL_NIF_TERM term, ERL_NIF_TERM *tail,
    +               ErlNifIOQueue *q, int fd) {
     
         ErlNifIOVec vec, *iovec = &vec;
         SysIOVec *sysiovec;
         int saved_errno;
         int iovcnt, n;
     
    -    if (!enif_inspect_iovec(env, 64, term, tail, &iovec))
    +    if (!enif_inspect_iovec(env, 64, term, tail, &iovec))
             return -2;
     
    -    if (enif_ioq_size(q) > 0) {
    +    if (enif_ioq_size(q) > 0) {
             /* If the I/O queue contains data we enqueue the iovec and
                then peek the data to write out of the queue. */
    -        if (!enif_ioq_enqv(q, iovec, 0))
    +        if (!enif_ioq_enqv(q, iovec, 0))
                 return -3;
     
    -        sysiovec = enif_ioq_peek(q, &iovcnt);
    -    } else {
    +        sysiovec = enif_ioq_peek(q, &iovcnt);
    +    } else {
             /* If the I/O queue is empty we skip the trip through it. */
             iovcnt = iovec->iovcnt;
             sysiovec = iovec->iov;
    -    }
    +    }
     
         /* Attempt to write the data */
    -    n = writev(fd, sysiovec, iovcnt);
    +    n = writev(fd, sysiovec, iovcnt);
         saved_errno = errno;
     
    -    if (enif_ioq_size(q) == 0) {
    +    if (enif_ioq_size(q) == 0) {
             /* If the I/O queue was initially empty we enqueue any
                remaining data into the queue for writing later. */
    -        if (n >= 0 && !enif_ioq_enqv(q, iovec, n))
    +        if (n >= 0 && !enif_ioq_enqv(q, iovec, n))
                 return -3;
    -    } else {
    +    } else {
             /* Dequeue any data that was written from the queue. */
    -        if (n > 0 && !enif_ioq_deq(q, n, NULL))
    +        if (n > 0 && !enif_ioq_deq(q, n, NULL))
                 return -4;
    -    }
    +    }
     
         /* return n, which is either number of bytes written or -1 if
            some error happened */
         errno = saved_errno;
         return n;
    -}
  • Long-running NIFs
    As mentioned in the warning text at the beginning of +}

  • Long-running NIFs
    As mentioned in the warning text at the beginning of this manual page, it is of vital importance that a native function returns relatively fast. It is difficult to give an exact maximum amount of time that a native function is allowed to work, but usually a well-behaving native @@ -512,12 +512,12 @@ with all its terms is valid until you explicitly invalidate it with enif_free_env or enif_send.

  • All contained terms of a list/tuple/map must belong to the same environment as the list/tuple/map itself. Terms can be copied between environments with -enif_make_copy.

  • ErlNifFunc

    typedef struct {
    +enif_make_copy.

  • ErlNifFunc

    typedef struct {
         const char* name;
         unsigned arity;
    -    ERL_NIF_TERM (*fptr)(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[]);
    +    ERL_NIF_TERM (*fptr)(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[]);
         unsigned flags;
    -} ErlNifFunc;

    Describes a NIF by its name, arity, and implementation.

    • fptr - A pointer to the function that implements the NIF.

    • argv - Contains the function arguments passed to the NIF.

    • argc - The array length, that is, the function arity. argv[N-1] thus +} ErlNifFunc;

  • Describes a NIF by its name, arity, and implementation.

    • fptr - A pointer to the function that implements the NIF.

    • argv - Contains the function arguments passed to the NIF.

    • argc - The array length, that is, the function arity. argv[N-1] thus denotes the Nth argument to the NIF. Notice that the argument argc allows for the same C function to implement several Erlang functions with different arity (but probably with the same name).

    • flags - Is 0 for a regular NIF (and so its value can be omitted for @@ -561,25 +561,25 @@ type. It can be copied, moved in memory, forgotten, and so on.

    • ErlNifResourceType - Each instance of ErlNifResourceType represents a class of memory-managed resource objects that can be garbage collected. Each resource type has a unique name and a -destructor function that is called when objects of its type are released.

    • ErlNifResourceTypeInit

      typedef struct {
      +destructor function that is called when objects of its type are released.

    • ErlNifResourceTypeInit

      typedef struct {
           ErlNifResourceDtor* dtor;       // #1 Destructor
           ErlNifResourceStop* stop;       // #2 Select stop
           ErlNifResourceDown* down;       // #3 Monitor down
      /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erl_prim_loader.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (588))
      --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erl_prim_loader.html	2026-06-04 19:05:02.202448087 +0000
      +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erl_prim_loader.html	2026-06-04 19:05:02.202448087 +0000
      @@ -412,7 +412,7 @@
       

      Retrieves information about a file.

      Returns {ok, FileInfo} if successful, otherwise error. FileInfo is a record file_info, defined in the Kernel include file file.hrl. Include the following directive in the module from which the -function is called:

      -include_lib("kernel/include/file.hrl").

      For more information about the record see file:read_file_info/2.

      Filename can also be a file in an archive, for example, +function is called:

      -include_lib("kernel/include/file.hrl").

      For more information about the record see file:read_file_info/2.

      Filename can also be a file in an archive, for example, $OTPROOT/lib/mnesia-4.4.7.ez/mnesia-4.4.7/ebin/mnesia. For information about archive files, see code.

      @@ -504,7 +504,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erl_tracer.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1889)) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erl_tracer.html 2026-06-04 19:05:02.231448356 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erl_tracer.html 2026-06-04 19:05:02.231448356 +0000 @@ -149,107 +149,107 @@ module, a much more lightweight message tracer is used, which only records who sent messages to who.

      The following is an example session using it on Linux:

      $ gcc -I erts-8.0/include/ -fPIC -shared -o erl_msg_tracer.so erl_msg_tracer.c
       $ erl
      -Erlang/OTP 19 [DEVELOPMENT] [erts-8.0] [source-ed2b56b] [64-bit] [smp:8:8] [async-threads:10] [hipe] [kernel-poll:false]
      +Erlang/OTP 19 [DEVELOPMENT] [erts-8.0] [source-ed2b56b] [64-bit] [smp:8:8] [async-threads:10] [hipe] [kernel-poll:false]
       
      -Eshell V8.0  (abort with ^G)
      -1> c(erl_msg_tracer), erl_msg_tracer:load().
      +Eshell V8.0  (abort with ^G)
      +1> c(erl_msg_tracer), erl_msg_tracer:load().
       ok
      -2> Tracer = spawn(fun F() -> receive M -> io:format("~p~n",[M]), F() end end).
      +2> Tracer = spawn(fun F() -> receive M -> io:format("~p~n",[M]), F() end end).
       <0.37.0>
      -3> erlang:trace(new, true, [send,{tracer, erl_msg_tracer, Tracer}]).
      +3> erlang:trace(new, true, [send,{tracer, erl_msg_tracer, Tracer}]).
       0
      -{trace,<0.39.0>,<0.27.0>}
      -4> {ok, D} = file:open("/tmp/tmp.data",[write]).
      -{trace,#Port<0.486>,<0.40.0>}
      -{trace,<0.40.0>,<0.21.0>}
      -{trace,#Port<0.487>,<0.4.0>}
      -{trace,#Port<0.488>,<0.4.0>}
      -{trace,#Port<0.489>,<0.4.0>}
      -{trace,#Port<0.490>,<0.4.0>}
      -{ok,<0.40.0>}
      -{trace,<0.41.0>,<0.27.0>}
      -5>

      erl_msg_tracer.erl:

      -module(erl_msg_tracer).
      +{trace,<0.39.0>,<0.27.0>}
      +4> {ok, D} = file:open("/tmp/tmp.data",[write]).
      +{trace,#Port<0.486>,<0.40.0>}
      +{trace,<0.40.0>,<0.21.0>}
      +{trace,#Port<0.487>,<0.4.0>}
      +{trace,#Port<0.488>,<0.4.0>}
      +{trace,#Port<0.489>,<0.4.0>}
      +{trace,#Port<0.490>,<0.4.0>}
      +{ok,<0.40.0>}
      +{trace,<0.41.0>,<0.27.0>}
      +5>

      erl_msg_tracer.erl:

      -module(erl_msg_tracer).
       
      --export([enabled/3, trace/5, load/0]).
      +-export([enabled/3, trace/5, load/0]).
       
      -load() ->
      -    erlang:load_nif("erl_msg_tracer", []).
      +load() ->
      +    erlang:load_nif("erl_msg_tracer", []).
       
      -enabled(_, _, _) ->
      +enabled(_, _, _) ->
           error.
       
      -trace(_, _, _, _, _) ->
      +trace(_, _, _, _, _) ->
           error.

      erl_msg_tracer.c:

      #include <erl_nif.h>
       
       /* NIF interface declarations */
      -static int load(ErlNifEnv* env, void** priv_data, ERL_NIF_TERM load_info);
      -static int upgrade(ErlNifEnv* env, void** priv_data, void** old_priv_data, ERL_NIF_TERM load_info);
      -static void unload(ErlNifEnv* env, void* priv_data);
      +static int load(ErlNifEnv* env, void** priv_data, ERL_NIF_TERM load_info);
      +static int upgrade(ErlNifEnv* env, void** priv_data, void** old_priv_data, ERL_NIF_TERM load_info);
      +static void unload(ErlNifEnv* env, void* priv_data);
       
       /* The NIFs: */
      -static ERL_NIF_TERM enabled(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[]);
      -static ERL_NIF_TERM trace(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[]);
      +static ERL_NIF_TERM enabled(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[]);
      +static ERL_NIF_TERM trace(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[]);
       
      -static ErlNifFunc nif_funcs[] = {
      -    {"enabled", 3, enabled},
      -    {"trace", 5, trace}
      -};
      +static ErlNifFunc nif_funcs[] = {
      +    {"enabled", 3, enabled},
      +    {"trace", 5, trace}
      +};
       
      -ERL_NIF_INIT(erl_msg_tracer, nif_funcs, load, NULL, upgrade, unload)
      +ERL_NIF_INIT(erl_msg_tracer, nif_funcs, load, NULL, upgrade, unload)
       
      -static int load(ErlNifEnv* env, void** priv_data, ERL_NIF_TERM load_info)
      -{
      +static int load(ErlNifEnv* env, void** priv_data, ERL_NIF_TERM load_info)
      +{
           *priv_data = NULL;
           return 0;
      -}
      +}
       
      -static void unload(ErlNifEnv* env, void* priv_data)
      -{
      +static void unload(ErlNifEnv* env, void* priv_data)
      +{
       
      -}
      +}
       
      -static int upgrade(ErlNifEnv* env, void** priv_data, void** old_priv_data,
      -		   ERL_NIF_TERM load_info)
      -{
      -    if (*old_priv_data != NULL || *priv_data != NULL) {
      +static int upgrade(ErlNifEnv* env, void** priv_data, void** old_priv_data,
      +		   ERL_NIF_TERM load_info)
      +{
      +    if (*old_priv_data != NULL || *priv_data != NULL) {
       	return -1; /* Don't know how to do that */
      -    }
      -    if (load(env, priv_data, load_info)) {
      +    }
      +    if (load(env, priv_data, load_info)) {
       	return -1;
      -    }
      +    }
           return 0;
      -}
      +}
       
       /*
        * argv[0]: TraceTag
        * argv[1]: TracerState
        * argv[2]: Tracee
        */
      -static ERL_NIF_TERM enabled(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
      -{
      +static ERL_NIF_TERM enabled(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
      +{
           ErlNifPid to_pid;
      -    if (enif_get_local_pid(env, argv[1], &to_pid))
      -        if (!enif_is_process_alive(env, &to_pid))
      -            if (enif_is_identical(enif_make_atom(env, "trace_status"), argv[0]))
      +    if (enif_get_local_pid(env, argv[1], &to_pid))
      +        if (!enif_is_process_alive(env, &to_pid))
      +            if (enif_is_identical(enif_make_atom(env, "trace_status"), argv[0]))
                       /* tracer is dead so we should remove this tracepoint */
      -                return enif_make_atom(env, "remove");
      +                return enif_make_atom(env, "remove");
                   else
      -                return enif_make_atom(env, "discard");
      +                return enif_make_atom(env, "discard");
       
           /* Only generate trace for when tracer != tracee */
      -    if (enif_is_identical(argv[1], argv[2]))
      -        return enif_make_atom(env, "discard");
      +    if (enif_is_identical(argv[1], argv[2]))
      +        return enif_make_atom(env, "discard");
       
           /* Only trigger trace messages on 'send' */
      -    if (enif_is_identical(enif_make_atom(env, "send"), argv[0]))
      -        return enif_make_atom(env, "trace");
      +    if (enif_is_identical(enif_make_atom(env, "send"), argv[0]))
      +        return enif_make_atom(env, "trace");
       
           /* Have to answer trace_status */
      -    if (enif_is_identical(enif_make_atom(env, "trace_status"), argv[0]))
      -        return enif_make_atom(env, "trace");
      +    if (enif_is_identical(enif_make_atom(env, "trace_status"), argv[0]))
      +        return enif_make_atom(env, "trace");
       
      -    return enif_make_atom(env, "discard");
      -}
      +    return enif_make_atom(env, "discard");
      +}
       
       /*
        * argv[0]: TraceTag, should only be 'send'
      @@ -258,20 +258,20 @@
        * argv[3]: Message
        * argv[4]: Options, map containing Recipient
        */
      -static ERL_NIF_TERM trace(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
      -{
      +static ERL_NIF_TERM trace(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
      +{
           ErlNifPid to_pid;
           ERL_NIF_TERM recipient, msg;
       
      -    if (enif_get_local_pid(env, argv[1], &to_pid)) {
      -      if (enif_get_map_value(env, argv[4], enif_make_atom(env, "extra"), &recipient)) {
      -        msg = enif_make_tuple3(env, enif_make_atom(env, "trace"), argv[2], recipient);
      -        enif_send(env, &to_pid, NULL, msg);
      -      }
      -    }
      +    if (enif_get_local_pid(env, argv[1], &to_pid)) {
      +      if (enif_get_map_value(env, argv[4], enif_make_atom(env, "extra"), &recipient)) {
      +        msg = enif_make_tuple3(env, enif_make_atom(env, "trace"), argv[2], recipient);
      +        enif_send(env, &to_pid, NULL, msg);
      +      }
      +    }
       
      -    return enif_make_atom(env, "ok");
      -}
      +
      return enif_make_atom(env, "ok"); +}
      /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erlang.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erlang.html 2026-06-04 19:05:02.403449951 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erlang.html 2026-06-04 19:05:02.405449970 +0000 @@ -7035,8 +7035,8 @@

      Continues computing the adler32 checksum by combining the previous checksum, -OldAdler, with the checksum of Data.

      The following code:

      X = erlang:adler32(Data1),
      -Y = erlang:adler32(X,Data2).

      assigns the same value to Y as this:

      Y = erlang:adler32([Data1,Data2]).
      +OldAdler, with the checksum of Data.

      The following code:

      X = erlang:adler32(Data1),
      +Y = erlang:adler32(X,Data2).

      assigns the same value to Y as this:

      Y = erlang:adler32([Data1,Data2]).
      @@ -7069,10 +7069,10 @@

      Combines two previously computed adler32 checksums.

      This computation requires the size of the data object for the second checksum -to be known.

      The following code:

      Y = erlang:adler32(Data1),
      -Z = erlang:adler32(Y,Data2).

      assigns the same value to Z as this:

      X = erlang:adler32(Data1),
      -Y = erlang:adler32(Data2),
      -Z = erlang:adler32_combine(X,Y,iolist_size(Data2)).
      +to be known.

      The following code:

      Y = erlang:adler32(Data1),
      +Z = erlang:adler32(Y,Data2).

      assigns the same value to Z as this:

      X = erlang:adler32(Data1),
      +Y = erlang:adler32(Data2),
      +Z = erlang:adler32_combine(X,Y,iolist_size(Data2)).
      @@ -7129,8 +7129,8 @@

      Continues computing the crc32 checksum by combining the previous checksum, -OldCrc, with the checksum of Data.

      The following code:

      X = erlang:crc32(Data1),
      -Y = erlang:crc32(X,Data2).

      assigns the same value to Y as this:

      Y = erlang:crc32([Data1,Data2]).
      +OldCrc, with the checksum of Data.

      The following code:

      X = erlang:crc32(Data1),
      +Y = erlang:crc32(X,Data2).

      assigns the same value to Y as this:

      Y = erlang:crc32([Data1,Data2]).
      @@ -7163,10 +7163,10 @@

      Combines two previously computed crc32 checksums.

      This computation requires the size of the data object for the second checksum -to be known.

      The following code:

      Y = erlang:crc32(Data1),
      -Z = erlang:crc32(Y,Data2).

      assigns the same value to Z as this:

      X = erlang:crc32(Data1),
      -Y = erlang:crc32(Data2),
      -Z = erlang:crc32_combine(X,Y,iolist_size(Data2)).
      +to be known.

      The following code:

      Y = erlang:crc32(Data1),
      +Z = erlang:crc32(Y,Data2).

      assigns the same value to Z as this:

      X = erlang:crc32(Data1),
      +Y = erlang:crc32(Data2),
      +Z = erlang:crc32_combine(X,Y,iolist_size(Data2)).
      @@ -8390,11 +8390,11 @@ in the result returned by nodes/0.

    • hidden - The node is connected to the node of the calling process through a hidden connection. That is, the node name would not appear in the result returned by nodes/0.

    • this - This is the node of the calling process.

    • known - The node is not connected but known to the node of the calling -process.

    Example:

    (a@localhost)1> nodes([this, connected], #{connection_id=>true, node_type=>true}).
    -[{c@localhost,#{connection_id => 13892108,node_type => hidden}},
    - {b@localhost,#{connection_id => 3067553,node_type => visible}},
    - {a@localhost,#{connection_id => undefined,node_type => this}}]
    -(a@localhost)2>
    +process.

    Example:

    (a@localhost)1> nodes([this, connected], #{connection_id=>true, node_type=>true}).
    +[{c@localhost,#{connection_id => 13892108,node_type => hidden}},
    + {b@localhost,#{connection_id => 3067553,node_type => visible}},
    + {a@localhost,#{connection_id => undefined,node_type => this}}]
    +(a@localhost)2>
    @@ -8504,9 +8504,9 @@

    Returns an integer or float that is the arithmetical absolute value of Float -or Int.

    For example:

    > abs(-3.33).
    +or Int.

    For example:

    > abs(-3.33).
     3.33
    -> abs(-3).
    +> abs(-3).
     3
    @@ -8538,8 +8538,8 @@

    Returns a new tuple that has one element more than Tuple1, and contains the elements in Tuple1 followed by Term as the last element.

    Semantically equivalent to list_to_tuple(tuple_to_list(Tuple1) ++ [Term]), but much -faster.

    For example:

    > erlang:append_element({one, two}, three).
    -{one,two,three}
    +faster.

    For example:

    > erlang:append_element({one, two}, three).
    +{one,two,three}
    @@ -8606,7 +8606,7 @@ representation. If Encoding is utf8 or unicode, the characters are encoded using UTF-8 where characters may require multiple bytes.

    Change

    As from Erlang/OTP 20, atoms can contain any Unicode character and atom_to_binary(Atom, latin1) may fail if the text -representation for Atom contains a Unicode character > 255.

    Example:

    > atom_to_binary('Erlang', latin1).
    +representation for Atom contains a Unicode character > 255.

    Example:

    > atom_to_binary('Erlang', latin1).
     <<"Erlang">>
    @@ -8638,9 +8638,9 @@

    Returns a list of unicode code points corresponding to the text representation -of Atom.

    For example:

    > atom_to_list('Erlang').
    -"Erlang"
    > atom_to_list('你好').
    -[20320,22909]

    See unicode for how to convert the resulting list to different formats.

    +of Atom.

    For example:

    > atom_to_list('Erlang').
    +"Erlang"
    > atom_to_list('你好').
    +[20320,22909]

    See unicode for how to convert the resulting list to different formats.

    @@ -8678,9 +8678,9 @@

    Extracts the part of the binary described by PosLen.

    Negative length can be used to extract bytes at the end of a binary.

    For example:

    1> Bin = <<1,2,3,4,5,6,7,8,9,10>>.
    -2> binary_part(Bin,{byte_size(Bin), -5}).
    +2> binary_part(Bin,{byte_size(Bin), -5}).
     <<6,7,8,9,10>>

    Failure: badarg if PosLen in any way references outside the binary.

    Start is zero-based, that is:

    1> Bin = <<1,2,3>>
    -2> binary_part(Bin,{0,2}).
    +2> binary_part(Bin,{0,2}).
     <<1,2>>

    For details about the PosLen semantics, see binary.

    @@ -8788,8 +8788,8 @@ garbage collected. Therefore, it is recommended to consider whether binary_to_existing_atom/2 is a better option than binary_to_atom/2. The default limits can be found -in Efficiency Guide (section System Limits).

    Examples:

    > binary_to_atom(<<"Erlang">>, latin1).
    -'Erlang'
    > binary_to_atom(<<1024/utf8>>, utf8).
    +in Efficiency Guide (section System Limits).

    Examples:

    > binary_to_atom(<<"Erlang">>, latin1).
    +'Erlang'
    > binary_to_atom(<<1024/utf8>>, utf8).
     'Ѐ'
    @@ -8902,7 +8902,7 @@ -

    Returns the float whose text representation is Binary.

    For example:

    > binary_to_float(<<"2.2017764e+0">>).
    +

    Returns the float whose text representation is Binary.

    For example:

    > binary_to_float(<<"2.2017764e+0">>).
     2.2017764

    The float string format is the same as the format for Erlang float literals except for that underscores are not permitted.

    Failure: badarg if Binary contains a bad representation of a float.

    @@ -8937,7 +8937,7 @@ -

    Returns an integer whose text representation is Binary.

    For example:

    > binary_to_integer(<<"123">>).
    +

    Returns an integer whose text representation is Binary.

    For example:

    > binary_to_integer(<<"123">>).
     123

    binary_to_integer/1 accepts the same string formats as list_to_integer/1.

    Failure: badarg if Binary contains a bad representation of an integer.

    @@ -8971,7 +8971,7 @@ -

    Returns an integer whose text representation in base Base is Binary.

    For example:

    > binary_to_integer(<<"3FF">>, 16).
    +

    Returns an integer whose text representation in base Base is Binary.

    For example:

    > binary_to_integer(<<"3FF">>, 16).
     1023

    binary_to_integer/2 accepts the same string formats as list_to_integer/2.

    Failure: badarg if Binary contains a bad representation of an integer.

    @@ -9070,9 +9070,9 @@

    Returns an Erlang term that is the result of decoding binary object Binary, which must be encoded according to the -Erlang external term format.

    > Bin = term_to_binary(hello).
    +Erlang external term format.

    > Bin = term_to_binary(hello).
     <<131,100,0,5,104,101,108,108,111>>
    -> hello = binary_to_term(Bin).
    +> hello = binary_to_term(Bin).
     hello

    Warning

    When decoding binaries from untrusted sources, the untrusted source may submit data in a way to create resources, such as atoms and remote references, that cannot be garbage collected and lead to Denial of Service attack. In such @@ -9121,11 +9121,11 @@ (as they are embedded in certain structures, such as process identifiers, refs, and funs), and creation of new external function references. None of those resources are garbage collected, so unchecked creation of them can -exhaust available memory.

    > binary_to_term(<<131,100,0,5,"hello">>, [safe]).
    +exhaust available memory.

    > binary_to_term(<<131,100,0,5,"hello">>, [safe]).
     ** exception error: bad argument
     > hello.
     hello
    -> binary_to_term(<<131,100,0,5,"hello">>, [safe]).
    +> binary_to_term(<<131,100,0,5,"hello">>, [safe]).
     hello

    Warning

    The safe option ensures the data is safely processed by the Erlang runtime but it does not guarantee the data is safe to your application. You must always validate data from untrusted sources. If the binary is stored or @@ -9133,10 +9133,10 @@ cryptographically signing it.

  • used - Changes the return value to {Term, Used} where Used is the number of bytes actually read from Binary.

    > Input = <<131,100,0,5,"hello","world">>.
     <<131,100,0,5,104,101,108,108,111,119,111,114,108,100>>
    -> {Term, Used} = binary_to_term(Input, [used]).
    -{hello, 9}
    -> split_binary(Input, Used).
    -{<<131,100,0,5,104,101,108,108,111>>, <<"world">>}
  • Failure: badarg if safe is specified and unsafe data is decoded.

    See also term_to_binary/1, binary_to_term/1, and list_to_existing_atom/1.

    /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erlc_cmd.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (918)) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erlc_cmd.html 2026-06-04 19:05:02.430450202 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erlc_cmd.html 2026-06-04 19:05:02.430450202 +0000 @@ -299,7 +299,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erlsrv_cmd.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (413)) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erlsrv_cmd.html 2026-06-04 19:05:02.449450378 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erlsrv_cmd.html 2026-06-04 19:05:02.449450378 +0000 @@ -315,28 +315,28 @@ ** A Console control handler that ignores the log off events, ** and lets the default handler take care of other events. */
    -BOOL WINAPI service_aware_handler(DWORD ctrl){ - if(ctrl == CTRL_LOGOFF_EVENT) +BOOL WINAPI service_aware_handler(DWORD ctrl){ + if(ctrl == CTRL_LOGOFF_EVENT) return TRUE; - if(ctrl == CTRL_SHUTDOWN_EVENT) + if(ctrl == CTRL_SHUTDOWN_EVENT) return TRUE; return FALSE; -} +} -void initialize_handler(void){ - char buffer[2]; +void initialize_handler(void){ + char buffer[2]; /* * We assume we are running as a service if this * environment variable is defined. */ - if(GetEnvironmentVariable("ERLSRV_SERVICE_NAME",buffer, - (DWORD) 2)){ + if(GetEnvironmentVariable("ERLSRV_SERVICE_NAME",buffer, + (DWORD) 2)){ /* ** Actually set the control handler */ - SetConsoleCtrlHandler(&service_aware_handler, TRUE); - } -}

    + SetConsoleCtrlHandler(&service_aware_handler, TRUE); + } +}

    @@ -405,7 +405,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erts_alloc.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1338)) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erts_alloc.html 2026-06-04 19:05:02.468450555 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/erts_alloc.html 2026-06-04 19:05:02.468450555 +0000 @@ -538,7 +538,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/escript_cmd.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (627)) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/escript_cmd.html 2026-06-04 19:05:02.486450721 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/escript_cmd.html 2026-06-04 19:05:02.486450721 +0000 @@ -131,7 +131,7 @@ Synopsis

    -
    script-name [arg1 arg2...]

    +
    script-name [arg1 arg2...]

    @@ -143,24 +143,24 @@ $ cat factorial

    #!/usr/bin/env escript
     %% -*- erlang -*-
     %%! -sname factorial -mnesia debug verbose
    -main([String]) ->
    +main([String]) ->
         try
    -        N = list_to_integer(String),
    -        F = fac(N),
    -        io:format("factorial ~w = ~w\n", [N,F])
    +        N = list_to_integer(String),
    +        F = fac(N),
    +        io:format("factorial ~w = ~w\n", [N,F])
         catch
             _:_ ->
    -            usage()
    +            usage()
         end;
    -main(_) ->
    -    usage().
    +main(_) ->
    +    usage().
     
    -usage() ->
    -    io:format("usage: factorial integer\n"),
    -    halt(1).
    +usage() ->
    +    io:format("usage: factorial integer\n"),
    +    halt(1).
     
    -fac(0) -> 1;
    -fac(N) -> N * fac(N-1).
    $ ./factorial 5
    +fac(0) -> 1;
    +fac(N) -> N * fac(N-1).
    $ ./factorial 5
     factorial 5 = 120
     $ ./factorial
     usage: factorial integer
    @@ -173,7 +173,7 @@
     If the directive is present, it must be located on the second line.

    If a comment selecting the encoding exists, it can be located on the second line.

    Note

    The encoding specified by the above mentioned comment applies to the script itself. The encoding of the I/O-server, however, must be set explicitly as -follows:

    io:setopts([{encoding, latin1}])

    The default encoding of the I/O-server for +follows:

    io:setopts([{encoding, latin1}])

    The default encoding of the I/O-server for standard_io is unicode if its supported. (see section Summary of Options) in @@ -192,7 +192,7 @@ script (the pathname is usually, but not always, absolute).

    If the file contains source code (as in the example above), it is processed by the epp preprocessor. This means that you, for example, can use predefined macros (such as ?MODULE) and include directives like the -include_lib -directive. For example, use

    -include_lib("kernel/include/file.hrl").

    to include the record definitions for the records used by function +directive. For example, use

    -include_lib("kernel/include/file.hrl").

    to include the record definitions for the records used by function file:read_link_info/1. You can also select encoding by including an encoding comment here, but if a valid encoding comment exists on the second line, it takes precedence.

    The script is checked for syntactic and semantic correctness before it is run. @@ -200,7 +200,7 @@ script will still be run. If there are errors, they are printed and the script will not be run and its exit status is 127.

    Both the module declaration and the export declaration of the main/1 function are optional.

    By default, the script will be compiled by the Erlang compiler.

    It is possible to force it to be interpreted by including the following line -somewhere in the script file:

    -mode(interpret).

    Execution of interpreted code is slower than compiled code, and some language +somewhere in the script file:

    -mode(interpret).

    Execution of interpreted code is slower than compiled code, and some language constructs will not work, but there is no requirement for the Erlang compiler application to be available.

    Change

    Before Erlang/OTP 27 the script would be interpreted by default.

    @@ -313,7 +313,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/garbagecollection.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (3699)) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/garbagecollection.html 2026-06-04 19:05:02.505450898 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/garbagecollection.html 2026-06-04 19:05:02.508450925 +0000 @@ -137,25 +137,25 @@ Creating Data

    -

    Terms are created on the heap by evaluating expressions. There are two major types of terms: immediate terms which require no heap space (small integers, atoms, pids, port ids etc) and cons or boxed terms (tuple, big num, binaries etc) that do require heap space. Immediate terms do not need any heap space because they are embedded into the containing structure.

    Let's look at an example that returns a tuple with the newly created data.

    data(Foo) ->
    -   Cons = [42|Foo],
    -   Literal = {text, "hello world!"},
    -   {tag, Cons, Literal}.

    In this example we first create a new cons cell with an integer and a tuple with some text. Then a tuple of size three wrapping the other values with an atom tag is created and returned.

    On the heap tuples require a word size for each of its elements as well as for the header. Cons cells always require two words. Adding these things together, we get seven words for the tuples and 26 words for the cons cells. The string "hello world!" is a list of cons cells and thus requires 24 words. The atom tag and the integer 42 do not require any additional heap memory since it is an immediate. Adding all the terms together, the heap space required in this example should be 33 words.

    Compiling this code to beam assembly (erlc -S) shows exactly what is happening.

    ...
    -{test_heap,6,1}.
    -{put_list,{integer,42},{x,0},{x,1}}.
    -{put_tuple,3,{x,0}}.
    -{put,{atom,tag}}.
    -{put,{x,1}}.
    -{put,{literal,{text,"hello world!"}}}.
    +

    Terms are created on the heap by evaluating expressions. There are two major types of terms: immediate terms which require no heap space (small integers, atoms, pids, port ids etc) and cons or boxed terms (tuple, big num, binaries etc) that do require heap space. Immediate terms do not need any heap space because they are embedded into the containing structure.

    Let's look at an example that returns a tuple with the newly created data.

    data(Foo) ->
    +   Cons = [42|Foo],
    +   Literal = {text, "hello world!"},
    +   {tag, Cons, Literal}.

    In this example we first create a new cons cell with an integer and a tuple with some text. Then a tuple of size three wrapping the other values with an atom tag is created and returned.

    On the heap tuples require a word size for each of its elements as well as for the header. Cons cells always require two words. Adding these things together, we get seven words for the tuples and 26 words for the cons cells. The string "hello world!" is a list of cons cells and thus requires 24 words. The atom tag and the integer 42 do not require any additional heap memory since it is an immediate. Adding all the terms together, the heap space required in this example should be 33 words.

    Compiling this code to beam assembly (erlc -S) shows exactly what is happening.

    ...
    +{test_heap,6,1}.
    +{put_list,{integer,42},{x,0},{x,1}}.
    +{put_tuple,3,{x,0}}.
    +{put,{atom,tag}}.
    +{put,{x,1}}.
    +{put,{literal,{text,"hello world!"}}}.
     return.

    Looking at the assembler code we can see three things: The heap requirement in this function turns out to be only six words, as seen by the {test_heap,6,1} instruction. All the allocations are combined to a single instruction. The bulk of the data {text, "hello world!"} is a literal. Literals, sometimes referred to as constants, are not allocated in the function since they are a part of the module and allocated at load time.

    If there is not enough space available on the heap to satisfy the test_heap instructions request for memory, then a garbage collection is initiated. It may happen immediately in the test_heap instruction, or it can be delayed until a later time depending on what state the process is in. If the garbage collection is delayed, any memory needed will be allocated in heap fragments. Heap fragments are extra memory blocks that are a part of the young heap, but are not allocated in the contiguous area where terms normally reside. See The young heap for more details.

    The collector

    -

    Erlang has a copying semi-space garbage collector. This means that when doing a garbage collection, the terms are copied from one distinct area, called the from space, to a new clean area, called the to space. The collector starts by scanning the root-set (stack, registers, etc).

    Garbage collection: initial values

    It follows all the pointers from the root-set to the heap and copies each term word by word to the to space.

    After the header word has been copied a move marker is destructively placed in it pointing to the term in the to space. Any other term that points to the already moved term will see this move marker and copy the referring pointer instead. For example, if the have the following Erlang code:

    foo(Arg) ->
    -    T = {test, Arg},
    -    {wrapper, T, T, T}.

    Only one copy of T exists on the heap and during the garbage collection only the first time T is encountered will it be copied.

    Garbage collection: root set scan

    After all terms referenced by the root-set have been copied, the collector scans the to space and copies all terms that these terms reference. When scanning, the collector steps through each term on the to space and any term still referencing the from space is copied over to the to space. Some terms contain non-term data (the payload of a on heap binary for instance). When encountered by the collector, these values are simply skipped.

    Garbage collection: heap scan

    Every term object we can reach is copied to the to space and stored on top off the scan stop line, and then the scan stop is moved to the end of the last object.

    Garbage collection: heap scan

    When scan stop marker catches up to the scan start marker, the garbage collection is done. At this point we can deallocate the entire from space and therefore reclaim the entire young heap.

    +

    Erlang has a copying semi-space garbage collector. This means that when doing a garbage collection, the terms are copied from one distinct area, called the from space, to a new clean area, called the to space. The collector starts by scanning the root-set (stack, registers, etc).

    Garbage collection: initial values

    It follows all the pointers from the root-set to the heap and copies each term word by word to the to space.

    After the header word has been copied a move marker is destructively placed in it pointing to the term in the to space. Any other term that points to the already moved term will see this move marker and copy the referring pointer instead. For example, if the have the following Erlang code:

    foo(Arg) ->
    +    T = {test, Arg},
    +    {wrapper, T, T, T}.

    Only one copy of T exists on the heap and during the garbage collection only the first time T is encountered will it be copied.

    Garbage collection: root set scan

    After all terms referenced by the root-set have been copied, the collector scans the to space and copies all terms that these terms reference. When scanning, the collector steps through each term on the to space and any term still referencing the from space is copied over to the to space. Some terms contain non-term data (the payload of a on heap binary for instance). When encountered by the collector, these values are simply skipped.

    Garbage collection: heap scan

    Every term object we can reach is copied to the to space and stored on top off the scan stop line, and then the scan stop is moved to the end of the last object.

    Garbage collection: heap scan

    When scan stop marker catches up to the scan start marker, the garbage collection is done. At this point we can deallocate the entire from space and therefore reclaim the entire young heap.

    @@ -179,11 +179,11 @@ Literals

    -

    When garbage collecting a heap (young or old) all literals are left in place and not copied. To figure out if a term should be copied or not when doing a garbage collection the following pseudo code is used:

    if (erts_is_literal(ptr) || (on_old_heap(ptr) && !fullsweep)) {
    +

    When garbage collecting a heap (young or old) all literals are left in place and not copied. To figure out if a term should be copied or not when doing a garbage collection the following pseudo code is used:

    if (erts_is_literal(ptr) || (on_old_heap(ptr) && !fullsweep)) {
       /* literal or non fullsweep - do not copy */
    -} else {
    -  copy(ptr);
    -}

    The erts_is_literal check works differently on different architectures and operating systems.

    On 64 bit systems that allow mapping of unreserved virtual memory areas (most operating systems except Windows), an area of size 1 GB (by default) is mapped and then all literals are placed within that area. Then all that has to be done to determine if something is a literal or not is two quick pointer checks. This system relies on the fact that a memory page that has not been touched yet does not take any actual space. So even if 1 GB of virtual memory is mapped, only the memory which is actually needed for literals is allocated in ram. The size of the literal area is configurable through the +MIscs erts_alloc option.

    On 32 bit systems, there is not enough virtual memory space to allocate 1 GB for just literals, so instead small 256 KB sized literal regions are created on demand and a card mark bit-array of the entire 32 bit memory space is then used to determine if a term is a literal or not. Since the total memory space is only 32 bits, the card mark bit-array is only 256 words large. On a 64 bit system the same bit-array would have to be 1 tera words large, so this technique is only viable on 32 bit systems. Doing lookups in the array is a little more expensive then just doing the pointer checks that can be done in 64 bit systems, but not extremely so.

    On 64 bit windows, on which erts_alloc cannot do unreserved virtual memory mappings, a special tag within the Erlang term object is used to determine if something is a literal or not. This is very cheap, however, the tag is only available on 64 bit machines, and it is possible to do a great deal of other nice optimizations with this tag in the future (like for instance a more compact list implementation) so it is not used on operating systems where it is not needed.

    This behaviour is different from how it worked prior to Erlang/OTP 19.0. Before 19.0 the literal check was done by checking if the pointer pointed to the young or old heap block. If it did not, then it was considered a literal. This lead to considerable overhead and strange memory usage scenarios, so it was removed in 19.0.

    +} else { + copy(ptr); +}

    The erts_is_literal check works differently on different architectures and operating systems.

    On 64 bit systems that allow mapping of unreserved virtual memory areas (most operating systems except Windows), an area of size 1 GB (by default) is mapped and then all literals are placed within that area. Then all that has to be done to determine if something is a literal or not is two quick pointer checks. This system relies on the fact that a memory page that has not been touched yet does not take any actual space. So even if 1 GB of virtual memory is mapped, only the memory which is actually needed for literals is allocated in ram. The size of the literal area is configurable through the +MIscs erts_alloc option.

    On 32 bit systems, there is not enough virtual memory space to allocate 1 GB for just literals, so instead small 256 KB sized literal regions are created on demand and a card mark bit-array of the entire 32 bit memory space is then used to determine if a term is a literal or not. Since the total memory space is only 32 bits, the card mark bit-array is only 256 words large. On a 64 bit system the same bit-array would have to be 1 tera words large, so this technique is only viable on 32 bit systems. Doing lookups in the array is a little more expensive then just doing the pointer checks that can be done in 64 bit systems, but not extremely so.

    On 64 bit windows, on which erts_alloc cannot do unreserved virtual memory mappings, a special tag within the Erlang term object is used to determine if something is a literal or not. This is very cheap, however, the tag is only available on 64 bit machines, and it is possible to do a great deal of other nice optimizations with this tag in the future (like for instance a more compact list implementation) so it is not used on operating systems where it is not needed.

    This behaviour is different from how it worked prior to Erlang/OTP 19.0. Before 19.0 the literal check was done by checking if the pointer pointed to the young or old heap block. If it did not, then it was considered a literal. This lead to considerable overhead and strange memory usage scenarios, so it was removed in 19.0.

    @@ -266,7 +266,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/inet_cfg.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (948)) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/inet_cfg.html 2026-06-04 19:05:02.529451120 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/inet_cfg.html 2026-06-04 19:05:02.530451130 +0000 @@ -165,11 +165,11 @@ The user configuration file is always examined last in the configuration process, making it possible for the user to override any default values or previously made settings. Call inet:get_rc() to view the state of the inet -configuration database.

    The valid configuration parameters are as follows:

    • {file, Format, File}.
      -  Format = atom()
      -  File = string()

      Specify a system file that Erlang is to read configuration data from. Format -tells the parser how the file is to be interpreted:

      • resolv (Unix resolv.conf)
      • host_conf_freebsd (FreeBSD host.conf)
      • host_conf_bsdos (BSDOS host.conf)
      • host_conf_linux (Linux host.conf)
      • nsswitch_conf (Unix nsswitch.conf)
      • hosts (Unix hosts)

      File is to specify the filename with full path.

    • {resolv_conf, File}.
      -  File = string()

      Specify a system file that Erlang is to read resolver configuration from for +configuration database.

      The valid configuration parameters are as follows:

      • {file, Format, File}.
        +  Format = atom()
        +  File = string()

        Specify a system file that Erlang is to read configuration data from. Format +tells the parser how the file is to be interpreted:

        • resolv (Unix resolv.conf)
        • host_conf_freebsd (FreeBSD host.conf)
        • host_conf_bsdos (BSDOS host.conf)
        • host_conf_linux (Linux host.conf)
        • nsswitch_conf (Unix nsswitch.conf)
        • hosts (Unix hosts)

        File is to specify the filename with full path.

      • {resolv_conf, File}.
        +  File = string()

        Specify a system file that Erlang is to read resolver configuration from for the internal DNS client inet_res, and monitor for changes, even if it does not exist. The path must be absolute.

        This can override the configuration parameters nameserver and search depending on the contents of the specified file. They can also change any time @@ -177,61 +177,61 @@ in the future. This emulates the old behavior of not configuring the DNS client when the node is started in short name distributed mode.

        If this parameter is not specified, it defaults to /etc/resolv.conf unless environment variable ERL_INET_ETC_DIR is set, which defines the directory -for this file to some maybe other than /etc.

      • {hosts_file, File}.
        -  File = string()

        Specify a system file that Erlang is to read resolver configuration from for +for this file to some maybe other than /etc.

      • {hosts_file, File}.
        +  File = string()

        Specify a system file that Erlang is to read resolver configuration from for the internal hosts file resolver, and monitor for changes, even if it does not exist. The path must be absolute.

        These host entries are searched after all added with {file, hosts, File} above or {host, IP, Aliases} below when lookup option file is used.

        If the file is specified as an empty string "", no file is read or monitored in the future. This emulates the old behavior of not configuring the DNS client when the node is started in short name distributed mode.

        If this parameter is not specified, it defaults to /etc/hosts unless environment variable ERL_INET_ETC_DIR is set, which defines the directory -for this file to some maybe other than /etc.

      • {registry, Type}.
        -  Type = atom()

        Specify a system registry that Erlang is to read configuration data from. -win32 is the only valid option.

      • {host, IP, Aliases}.
        -  IP = tuple()

        Aliases = [string()]

        Add host entry to the hosts table.

      • {domain, Domain}.
        -  Domain = string()

        Set domain name.

      • {nameserver, IP [,Port]}.
        -  IP = tuple()
        -  Port = integer()

        Add address (and port, if other than default) of the primary nameserver to use -for inet_res.

      • {alt_nameserver, IP [,Port]}.
        -  IP = tuple()
        -  Port = integer()

        Add address (and port, if other than default) of the secondary nameserver for -inet_res.

      • {search, Domains}.
        -  Domains = [string()]

        Add search domains for inet_res.

      • {lookup, Methods}.
        -  Methods = [atom()]

        Specify lookup methods and in which order to try them. The valid methods are +for this file to some maybe other than /etc.

      • {registry, Type}.
        +  Type = atom()

        Specify a system registry that Erlang is to read configuration data from. +win32 is the only valid option.

      • {host, IP, Aliases}.
        +  IP = tuple()

        Aliases = [string()]

        Add host entry to the hosts table.

      • {domain, Domain}.
        +  Domain = string()

        Set domain name.

      • {nameserver, IP [,Port]}.
        +  IP = tuple()
        +  Port = integer()

        Add address (and port, if other than default) of the primary nameserver to use +for inet_res.

      • {alt_nameserver, IP [,Port]}.
        +  IP = tuple()
        +  Port = integer()

        Add address (and port, if other than default) of the secondary nameserver for +inet_res.

      • {search, Domains}.
        +  Domains = [string()]

        Add search domains for inet_res.

      • {lookup, Methods}.
        +  Methods = [atom()]

        Specify lookup methods and in which order to try them. The valid methods are as follows:

        • native (use system calls)
        • file (use host data retrieved from system configuration files and/or the user configuration file)
        • dns (use the Erlang DNS client inet_res for nameserver queries)

        The lookup method string tries to parse the hostname as an IPv4 or IPv6 string and return the resulting IP address. It is automatically tried first when native is not in the Methods list. To skip it in this case, the pseudo lookup method nostring can be inserted anywhere in the Methods -list.

      • {cache_size, Size}.
        -  Size = integer()

        Set the resolver cache size for dns lookups. native lookups are not -cached. Defaults to 100 DNS records.

      • {cache_refresh, Time}.
        -  Time = integer()

        Set how often (in milliseconds) the resolver cache for inet_res is -refreshed (that is, expired DNS records are deleted). Defaults to 1 hour.

      • {timeout, Time}.
        -  Time = integer()

        Set the time to wait until retry (in milliseconds) for DNS queries made by -inet_res. Defaults to 2 seconds.

      • {retry, N}.
        -  N = integer()

        Set the number of DNS queries inet_res will try before giving up. Defaults -to 3.

      • {servfail_retry_timeout, Time}.
        -  Time = non_neg_integer()

        After all name servers have been tried, there is a timeout before the name +list.

      • {cache_size, Size}.
        +  Size = integer()

        Set the resolver cache size for dns lookups. native lookups are not +cached. Defaults to 100 DNS records.

      • {cache_refresh, Time}.
        +  Time = integer()

        Set how often (in milliseconds) the resolver cache for inet_res is +refreshed (that is, expired DNS records are deleted). Defaults to 1 hour.

      • {timeout, Time}.
        +  Time = integer()

        Set the time to wait until retry (in milliseconds) for DNS queries made by +inet_res. Defaults to 2 seconds.

      • {retry, N}.
        +  N = integer()

        Set the number of DNS queries inet_res will try before giving up. Defaults +to 3.

      • {servfail_retry_timeout, Time}.
        +  Time = non_neg_integer()

        After all name servers have been tried, there is a timeout before the name servers are tried again. This is to prevent the server from answering the query with what's in the servfail cache, inet_res. Defaults to 1500 milli -seconds .

      • {inet6, Bool}.
        +seconds .

      • {inet6, Bool}.
           Bool = true | false

        Tells the DNS client inet_res to look up IPv6 addresses. Defaults to -false.

      • {usevc, Bool}.
        +false.

      • {usevc, Bool}.
           Bool = true | false

        Tells the DNS client inet_res to use TCP (Virtual Circuit) instead of UDP. -Defaults to false.

      • {edns, Version}.
        +Defaults to false.

      • {edns, Version}.
           Version = false | 0

        Sets the EDNS version that inet_res will use. The only allowed version is -zero. Defaults to false, which means not to use EDNS.

      • {udp_payload_size, Size}.
        -  N = integer()

        Sets the allowed UDP payload size inet_res will advertise in EDNS queries. +zero. Defaults to false, which means not to use EDNS.

      • {udp_payload_size, Size}.
        +  N = integer()

        Sets the allowed UDP payload size inet_res will advertise in EDNS queries. Also sets the limit when the DNS query will be deemed too large for UDP forcing a TCP query instead; this is not entirely correct, as the advertised UDP payload size of the individual nameserver is what is to be used, but this simple strategy will do until a more intelligent (probing, caching) algorithm needs to be implemented. Default to 1280, which stems from the standard -Ethernet MTU size.

      • {udp, Module}.
        -  Module = atom()

        Tell Erlang to use another primitive UDP module than inet_udp.

      • {tcp, Module}.
        -  Module = atom()

        Tell Erlang to use another primitive TCP module than inet_tcp.

      • clear_hosts.

        Clear the hosts table.

      • clear_ns.

        Clear the list of recorded nameservers (primary and secondary).

      • clear_search.

        Clear the list of search domains.

      +Ethernet MTU size.

    • {udp, Module}.
      +  Module = atom()

      Tell Erlang to use another primitive UDP module than inet_udp.

    • {tcp, Module}.
      +  Module = atom()

      Tell Erlang to use another primitive TCP module than inet_tcp.

    • clear_hosts.

      Clear the hosts table.

    • clear_ns.

      Clear the list of recorded nameservers (primary and secondary).

    • clear_search.

      Clear the list of search domains.

    @@ -246,19 +246,19 @@ (in this example named erl_inetrc, stored in directory ./cfg_files) can then look as follows (Unix):

    %% -- ERLANG INET CONFIGURATION FILE --
     %% read the hosts file
    -{file, hosts, "/etc/hosts"}.
    +{file, hosts, "/etc/hosts"}.
     %% add a particular host
    -{host, {134,138,177,105}, ["finwe"]}.
    +{host, {134,138,177,105}, ["finwe"]}.
     %% do not monitor the hosts file
    -{hosts_file, ""}.
    +{hosts_file, ""}.
     %% read and monitor nameserver config from here
    -{resolv_conf, "/usr/local/etc/resolv.conf"}.
    +{resolv_conf, "/usr/local/etc/resolv.conf"}.
     %% enable EDNS
    -{edns,0}.
    +{edns,0}.
     %% disable caching
    -{cache_size, 0}.
    +{cache_size, 0}.
     %% specify lookup method
    -{lookup, [file, dns]}.

    And Erlang can, for example, be started as follows:

    % erl -sname my_node -kernel inetrc '"./cfg_files/erl_inetrc"'
    +{lookup, [file, dns]}.

    And Erlang can, for example, be started as follows:

    % erl -sname my_node -kernel inetrc '"./cfg_files/erl_inetrc"'
    @@ -305,7 +305,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/init.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (906)) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/init.html 2026-06-04 19:05:02.549451306 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/init.html 2026-06-04 19:05:02.549451306 +0000 @@ -161,8 +161,8 @@ initialization process.

  • -extra - Everything following -extra is considered plain arguments and can be retrieved using get_plain_arguments/0.

    Example:

    % erl -extra +A 1 --
     ...
    -1> init:get_plain_arguments().
    -["+A","1","--"]

    The -extra flag can be passed on the command line, through ERL_*FLAGS or +1> init:get_plain_arguments(). +["+A","1","--"]

  • The -extra flag can be passed on the command line, through ERL_*FLAGS or -args_file. It only effects the remaining command-line flags in the entity in which it is passed. If multiple -extra flags are passed they are concatenated using the same order rules as ERL_*FLAGS or -args_file in @@ -216,13 +216,13 @@

    % erl -- a b -children thomas claire -ages 7 3 -- x y
     ...
     
    -1> init:get_plain_arguments().
    -["a","b","x","y"]
    -2> init:get_argument(children).
    -{ok,[["thomas","claire"]]}
    -3> init:get_argument(ages).
    -{ok, [["7","3"]]}
    -4> init:get_argument(silly).
    +1> init:get_plain_arguments().
    +["a","b","x","y"]
    +2> init:get_argument(children).
    +{ok,[["thomas","claire"]]}
    +3> init:get_argument(ages).
    +{ok, [["7","3"]]}
    +4> init:get_argument(silly).
     error

    @@ -524,12 +524,12 @@

    Returns all values associated with the command-line user flag Flag.

    If Flag is provided several times, each Values is returned in preserved order. Example:

    % erl -a b c -a d
     ...
    -1> init:get_argument(a).
    -{ok,[["b","c"],["d"]]}

    The following flags are defined automatically and can be retrieved using this +1> init:get_argument(a). +{ok,[["b","c"],["d"]]}

    The following flags are defined automatically and can be retrieved using this function:

    Returns error if no value is associated with Flag.

    +{ok,[["/usr/local/otp/releases/otp_beam_solaris8_r10b_patched"]]}
  • progname - The name of the program which started Erlang:

    3> init:get_argument(progname).
    +{ok,[["erl"]]}
  • home - The home directory (on Unix, the value of $HOME):

    4> init:get_argument(home).
    +{ok,[["/home/harry"]]}
  • Returns error if no value is associated with Flag.

    @@ -827,7 +827,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/introduction.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/introduction.html 2026-06-04 19:05:02.567451473 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/introduction.html 2026-06-04 19:05:02.566451464 +0000 @@ -188,7 +188,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/match_spec.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (2186)) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/match_spec.html 2026-06-04 19:05:02.589451677 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/match_spec.html 2026-06-04 19:05:02.589451677 +0000 @@ -371,70 +371,70 @@ Tracing Examples -

    Match an argument list of three, where the first and third arguments are equal:

    [{['$1', '_', '$1'],
    -  [],
    -  []}]

    Match an argument list of three, where the second argument is a number > 3:

    [{['_', '$1', '_'],
    -  [{ '>', '$1', 3}],
    -  []}]

    Match an argument list of three, where the third argument is either a tuple +

    Match an argument list of three, where the first and third arguments are equal:

    [{['$1', '_', '$1'],
    +  [],
    +  []}]

    Match an argument list of three, where the second argument is a number > 3:

    [{['_', '$1', '_'],
    +  [{ '>', '$1', 3}],
    +  []}]

    Match an argument list of three, where the third argument is either a tuple containing argument one and two, or a list beginning with argument one and two -(that is, [a,b,[a,b,c]] or [a,b,{a,b}]):

    [{['$1', '$2', '$3'],
    -  [{'orelse',
    -      {'=:=', '$3', {{'$1','$2'}}},
    -      {'and',
    -        {'=:=', '$1', {hd, '$3'}},
    -        {'=:=', '$2', {hd, {tl, '$3'}}}}}],
    -  []}]

    The above problem can also be solved as follows:

    [{['$1', '$2', {'$1', '$2}], [], []},
    - {['$1', '$2', ['$1', '$2' | '_']], [], []}]

    Match two arguments, where the first is a tuple beginning with a list that in +(that is, [a,b,[a,b,c]] or [a,b,{a,b}]):

    [{['$1', '$2', '$3'],
    +  [{'orelse',
    +      {'=:=', '$3', {{'$1','$2'}}},
    +      {'and',
    +        {'=:=', '$1', {hd, '$3'}},
    +        {'=:=', '$2', {hd, {tl, '$3'}}}}}],
    +  []}]

    The above problem can also be solved as follows:

    [{['$1', '$2', {'$1', '$2}], [], []},
    + {['$1', '$2', ['$1', '$2' | '_']], [], []}]

    Match two arguments, where the first is a tuple beginning with a list that in turn begins with the second argument times two (that is, [{[4,x],y},2] or -[{[8], y, z},4]):

    [{['$1', '$2'],[{'=:=', {'*', 2, '$2'}, {hd, {element, 1, '$1'}}}],
    -  []}]

    Match three arguments. When all three are equal and are numbers, append the +[{[8], y, z},4]):

    [{['$1', '$2'],[{'=:=', {'*', 2, '$2'}, {hd, {element, 1, '$1'}}}],
    +  []}]

    Match three arguments. When all three are equal and are numbers, append the process dump to the trace message, otherwise let the trace message be "as is", -but set the sequential trace token label to 4711:

    [{['$1', '$1', '$1'],
    -  [{is_number, '$1'}],
    -  [{message, {process_dump}}]},
    - {'_', [], [{set_seq_token, label, 4711}]}]

    As can be noted above, the parameter list can be matched against a single +but set the sequential trace token label to 4711:

    [{['$1', '$1', '$1'],
    +  [{is_number, '$1'}],
    +  [{message, {process_dump}}]},
    + {'_', [], [{set_seq_token, label, 4711}]}]

    As can be noted above, the parameter list can be matched against a single MatchVariable or an '_'. To replace the whole parameter list with a single variable is a special case. In all other cases the MatchHead must be a -proper list.

    Generate a trace message only if the trace control word is set to 1:

    [{'_',
    -  [{'==',{get_tcw},{const, 1}}],
    -  []}]

    Generate a trace message only if there is a seq_trace token:

    [{'_',
    -  [{'==',{is_seq_trace},{const, 1}}],
    -  []}]

    Remove the 'silent' trace flag when the first argument is 'verbose', and add -it when it is 'silent':

    [{'$1',
    -  [{'==',{hd, '$1'},verbose}],
    -  [{trace, [silent],[]}]},
    - {'$1',
    -  [{'==',{hd, '$1'},silent}],
    -  [{trace, [],[silent]}]}]

    Add a return_trace message if the function is of arity 3:

    [{'$1',
    -  [{'==',{length, '$1'},3}],
    -  [{return_trace}]},
    - {'_',[],[]}]

    Generate a trace message only if the function is of arity 3 and the first -argument is 'trace':

    [{['trace','$2','$3'],
    -  [],
    -  []},
    - {'_',[],[]}]

    +proper list.

    Generate a trace message only if the trace control word is set to 1:

    [{'_',
    +  [{'==',{get_tcw},{const, 1}}],
    +  []}]

    Generate a trace message only if there is a seq_trace token:

    [{'_',
    +  [{'==',{is_seq_trace},{const, 1}}],
    +  []}]

    Remove the 'silent' trace flag when the first argument is 'verbose', and add +it when it is 'silent':

    [{'$1',
    +  [{'==',{hd, '$1'},verbose}],
    +  [{trace, [silent],[]}]},
    + {'$1',
    +  [{'==',{hd, '$1'},silent}],
    +  [{trace, [],[silent]}]}]

    Add a return_trace message if the function is of arity 3:

    [{'$1',
    +  [{'==',{length, '$1'},3}],
    +  [{return_trace}]},
    + {'_',[],[]}]

    Generate a trace message only if the function is of arity 3 and the first +argument is 'trace':

    [{['trace','$2','$3'],
    +  [],
    +  []},
    + {'_',[],[]}]

    ETS Examples

    Match all objects in an ETS table, where the first element is the atom -'strider' and the tuple arity is 3, and return the whole object:

    [{{strider,'_','_'},
    -  [],
    -  ['$_']}]

    Match all objects in an ETS table with arity > 1 and the first element is -'gandalf', and return element 2:

    [{'$1',
    -  [{'==', gandalf, {element, 1, '$1'}},{'>=',{size, '$1'},2}],
    -  [{element,2,'$1'}]}]

    In this example, if the first element had been the key, it is much more +'strider' and the tuple arity is 3, and return the whole object:

    [{{strider,'_','_'},
    +  [],
    +  ['$_']}]

    Match all objects in an ETS table with arity > 1 and the first element is +'gandalf', and return element 2:

    [{'$1',
    +  [{'==', gandalf, {element, 1, '$1'}},{'>=',{size, '$1'},2}],
    +  [{element,2,'$1'}]}]

    In this example, if the first element had been the key, it is much more efficient to match that key in the MatchHead part than in the MatchConditions part. The search space of the tables is restricted with regards to the MatchHead so that only objects with the matching key are searched.

    Match tuples of three elements, where the second element is either 'merry' or -'pippin', and return the whole objects:

    [{{'_',merry,'_'},
    -  [],
    -  ['$_']},
    - {{'_',pippin,'_'},
    -  [],
    -  ['$_']}]

    Function ets:test_ms/2 can be useful for testing complicated ETS matches.

    +'pippin', and return the whole objects:

    [{{'_',merry,'_'},
    +  [],
    +  ['$_']},
    + {{'_',pippin,'_'},
    +  [],
    +  ['$_']}]

    Function ets:test_ms/2 can be useful for testing complicated ETS matches.

    @@ -481,7 +481,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/notes.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (9882)) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/notes.html 2026-06-04 19:05:02.716452855 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/notes.html 2026-06-04 19:05:02.715452846 +0000 @@ -173,8 +173,8 @@ Fixed Bugs and Malfunctions -
    • The erl -man example has been corrected to not consider values set in ERL_ZFLAGS and stop parsing arguments when a -- is encountered.

      Own Id: OTP-19098 Aux Id: PR-8478

    • Compiler warnings for Windows I/O back-end have been silenced.

      Own Id: OTP-19113

    • Bugs related to return_to trace have been fixed. It did not work for more than once trace session and it did sometimes not trigger for exceptions.

      Own Id: OTP-19122

    • Potential deadlocks while writing a crash dump have been eliminated.

      Own Id: OTP-19133 Aux Id: PR-8521, GH-8498

    • When loading a damaged or too old BEAM file, the runtime system could crash.

      Own Id: OTP-19153 Aux Id: PR-8623

    • A scheduler thread could get stuck when deleting a memory allocator carrier when adjacent carriers were deleted and/or inserted simultaneously by other schedulers. This in turn could cause the other schedulers to get stuck as well.

      Own Id: OTP-19154 Aux Id: GH-8613, PR-8627

    • Statistics for number of carriers in a shared pool after calling instrument:allocations or instrument:carriers are now correct. Also, a potential bug in carrier block scanning was eliminated.

      Own Id: OTP-19166 Aux Id: PR-8636

    • A race in the kTLS flavour of SSL distribution has been fixed so that inet_drv.c doesn't read ahead too much data, which could cause the kTLS encryption to be activated too late when some encrypted data had already been read into the inet_drv.c buffer as unencrypted.

      Own Id: OTP-19175 Aux Id: GH-8561, PR-8690

    • Fixed an emulator crash relating to compressed ETS tables.

      Own Id: OTP-19176 Aux Id: PR-8683

    • A function (encode_sockaddr) was called with superfluous argument, on Windows, in the net nif.

      Own Id: OTP-19181

    • Fixed a crash that could happen on reallocation failure.

      Own Id: OTP-19192

    • Man pages are now available for erl, erlc, dialyzer, and all other programs that are included in Erlang/OTP.

      Own Id: OTP-19201 Aux Id: PR-8740

    • A previous correction in the Erlang/OTP 27.0.1 emergency patch had the unfortunate side effect of sometimes causing an unnecessary fullsweep (major) garbage collection instead of a generation (minor) garbage collection. This has been corrected.

      Own Id: OTP-19209 Aux Id: PR-8751, PR-8539

    • Fixed trace matchspec functions trace and enable_trace to use the session tracer when enabling trace flags on untraced processes.

      Own Id: OTP-19211 Aux Id: GH-8657

    • Fixed a typo in the type spec for erlang:garbage_collection_defaults/0.

      Own Id: OTP-19215 Aux Id: PR-8757

    • Corrected socket:ioctl for genaddr (SIOCGENADDR).

      Own Id: OTP-19216

    • The support for Transparent Huge Pages has been disabled on non-amd64 Linux systems.

      Own Id: OTP-19219 Aux Id: PR-8702

    • Fixed a race condition on Windows when upgrading from -noshell to a shell that would cause Erlang to crash with the error:

      {&#href_anchor"p">,
      -  'The I/O operation has been aborted because of either a thread exit or an application request.'}.

      Own Id: OTP-19220 Aux Id: PR-8774

    +
    • The erl -man example has been corrected to not consider values set in ERL_ZFLAGS and stop parsing arguments when a -- is encountered.

      Own Id: OTP-19098 Aux Id: PR-8478

    • Compiler warnings for Windows I/O back-end have been silenced.

      Own Id: OTP-19113

    • Bugs related to return_to trace have been fixed. It did not work for more than once trace session and it did sometimes not trigger for exceptions.

      Own Id: OTP-19122

    • Potential deadlocks while writing a crash dump have been eliminated.

      Own Id: OTP-19133 Aux Id: PR-8521, GH-8498

    • When loading a damaged or too old BEAM file, the runtime system could crash.

      Own Id: OTP-19153 Aux Id: PR-8623

    • A scheduler thread could get stuck when deleting a memory allocator carrier when adjacent carriers were deleted and/or inserted simultaneously by other schedulers. This in turn could cause the other schedulers to get stuck as well.

      Own Id: OTP-19154 Aux Id: GH-8613, PR-8627

    • Statistics for number of carriers in a shared pool after calling instrument:allocations or instrument:carriers are now correct. Also, a potential bug in carrier block scanning was eliminated.

      Own Id: OTP-19166 Aux Id: PR-8636

    • A race in the kTLS flavour of SSL distribution has been fixed so that inet_drv.c doesn't read ahead too much data, which could cause the kTLS encryption to be activated too late when some encrypted data had already been read into the inet_drv.c buffer as unencrypted.

      Own Id: OTP-19175 Aux Id: GH-8561, PR-8690

    • Fixed an emulator crash relating to compressed ETS tables.

      Own Id: OTP-19176 Aux Id: PR-8683

    • A function (encode_sockaddr) was called with superfluous argument, on Windows, in the net nif.

      Own Id: OTP-19181

    • Fixed a crash that could happen on reallocation failure.

      Own Id: OTP-19192

    • Man pages are now available for erl, erlc, dialyzer, and all other programs that are included in Erlang/OTP.

      Own Id: OTP-19201 Aux Id: PR-8740

    • A previous correction in the Erlang/OTP 27.0.1 emergency patch had the unfortunate side effect of sometimes causing an unnecessary fullsweep (major) garbage collection instead of a generation (minor) garbage collection. This has been corrected.

      Own Id: OTP-19209 Aux Id: PR-8751, PR-8539

    • Fixed trace matchspec functions trace and enable_trace to use the session tracer when enabling trace flags on untraced processes.

      Own Id: OTP-19211 Aux Id: GH-8657

    • Fixed a typo in the type spec for erlang:garbage_collection_defaults/0.

      Own Id: OTP-19215 Aux Id: PR-8757

    • Corrected socket:ioctl for genaddr (SIOCGENADDR).

      Own Id: OTP-19216

    • The support for Transparent Huge Pages has been disabled on non-amd64 Linux systems.

      Own Id: OTP-19219 Aux Id: PR-8702

    • Fixed a race condition on Windows when upgrading from -noshell to a shell that would cause Erlang to crash with the error:

      {&#href_anchor"p">,
      +  'The I/O operation has been aborted because of either a thread exit or an application request.'}.

      Own Id: OTP-19220 Aux Id: PR-8774

    @@ -211,17 +211,17 @@ Improvements and New Features

    -
    • Refactored how the JIT handles POSIX signals and how they affect thread stacks, allowing us to use the native stack register for Erlang stacks on more platforms.

      Notably, containers built on 64-bit x86 Alpine Linux images will now perform much better in sequential code. As an example, running dialyzer over the OTP code base finishes about 15% quicker.

      Own Id: OTP-18568 Aux Id: PR-7174

    • The instrument module can now track allocations on a per-process or per-port basis.

      Own Id: OTP-18577 Aux Id: PR-7236

    • The pid field returned from erlang:fun_info/1,2 is now always the pid for the init process of the local node, not the pid for the actual process that created the fun.

      POTENTIAL INCOMPATIBILITY

      Own Id: OTP-18594 Aux Id: PR-7274

    • By default, escripts will now be compiled instead of interpreted. That means that the compiler application must be installed.

      POTENTIAL INCOMPATIBILITY

      Own Id: OTP-18639 Aux Id: PR-7348

    • A binary returned from the socket receive functions is no longer created as a sub binary of an often large receive buffer binary (socket option {otp,rcvbuf}). This avoids space waste, trusting the allocators to implement reallocation efficiently.

      Own Id: OTP-18642 Aux Id: GH-6152, PR-7465

    • The default process limit has been raised to 1048576 processes.

      Own Id: OTP-18699 Aux Id: PR-7388

    • The erlang:system_monitor/2 functionality is now able to monitor long message queues in the system.

      Own Id: OTP-18709 Aux Id: PR-7651

    • The erl command now supports the -S flag, which is similar to the -run flag, except that it will pass all arguments up to end of the command line to the called function. (The -run flag will not pass arguments beginning with a hyphen.) Another difference is that -S will always call a function with one argument, passing an empty list if no arguments were given.

      Own Id: OTP-18744 Aux Id: PR-7470

    • When implementing an alternative carrier for the Erlang distribution, a separate input handler process may now be registered, using erlang:dist_ctrl_input_handler/2, also in the case when the distribution controller is a port.

      Own Id: OTP-18774 Aux Id: PR-7110

    • The call stack trace has now been added to the error reported by erlang:process_flag/2 when max_heap_size limit has been exceeded.

      Own Id: OTP-18779 Aux Id: PR-7592

    • -callback attributes have been added to erl_tracer.

      Own Id: OTP-18794 Aux Id: PR-7703

    • For inet_backend = socket, setting the active socket option alone, to once, true or N has been optimized, as well as the corresponding data delivery.

      Own Id: OTP-18835

    • New functions socket:sendv/* for sending I/O vectors have been added.

      Own Id: OTP-18845

    • Socket options that take string now also accept binaries.

      Own Id: OTP-18849 Aux Id: PR-6510

    • Native coverage support has been implemented in the JIT. It will automatically be used by the cover tool to reduce the execution overhead when running cover-compiled code.

      There are also new APIs to support native coverage without using the cover tool.

      To instrument code for native coverage it must be compiled with the line_coverage option.

      To enable native coverage in the runtime system, start it like so:

      $ erl +JPcover true

      There are also the following new functions for supporting native coverage:

      Own Id: OTP-18856 Aux Id: PR-7856

    • Changed the default value of the command line flag -code_path_choice to strict.

      Note that for application systems using archives, it is necessary to add the code_path_choice relaxed to the command line that invokes erl.

      Own Id: OTP-18894 Aux Id: PR-7243

    • Added module loading to erl -init_debug printouts.

      Own Id: OTP-18929 Aux Id: PR-8004

    • When the runtime system halts, it performs various flush operations before terminating. By default there is no limit on how much time the flush operations are allowed to take. A new halt flush timeout functionality has been introduced which can be used for limiting the amount of time that the flushing operations are allowed to take. For more information see the documentation of the flush_timeout option of the erlang:halt/2 BIF and the documentation of the erl +zhft <Timeout> command line flag.

      Own Id: OTP-18938 Aux Id: PR-8035, GH-7438

    • Optimized code loading by moving certain operations from the code server to the caller.

      Own Id: OTP-18941 Aux Id: PR-7981

    • Updated asmjit to version a465fe71ab3d0e224b2b4bd0fac69ae68ab9239d

      Own Id: OTP-18942

    • The deprecated functions in zlib have been removed. That includes inflateChunk/{1,2}, getBufSize/1, setBufSize/2, the CRC32 functions, and the Adler checksum functions.

      Own Id: OTP-18950

    • The documentation has been migrated to use Markdown and ExDoc.

      Own Id: OTP-18955 Aux Id: PR-8026

    • Safe destructive update of tuples has been implemented in the compiler and runtime system. This allows the VM to update tuples in-place when it is safe to do so, thus improving performance by doing less copying but also by producing less garbage.

      Example:

      -record(rec, {a,b,c}).
      +
      • Refactored how the JIT handles POSIX signals and how they affect thread stacks, allowing us to use the native stack register for Erlang stacks on more platforms.

        Notably, containers built on 64-bit x86 Alpine Linux images will now perform much better in sequential code. As an example, running dialyzer over the OTP code base finishes about 15% quicker.

        Own Id: OTP-18568 Aux Id: PR-7174

      • The instrument module can now track allocations on a per-process or per-port basis.

        Own Id: OTP-18577 Aux Id: PR-7236

      • The pid field returned from erlang:fun_info/1,2 is now always the pid for the init process of the local node, not the pid for the actual process that created the fun.

        POTENTIAL INCOMPATIBILITY

        Own Id: OTP-18594 Aux Id: PR-7274

      • By default, escripts will now be compiled instead of interpreted. That means that the compiler application must be installed.

        POTENTIAL INCOMPATIBILITY

        Own Id: OTP-18639 Aux Id: PR-7348

      • A binary returned from the socket receive functions is no longer created as a sub binary of an often large receive buffer binary (socket option {otp,rcvbuf}). This avoids space waste, trusting the allocators to implement reallocation efficiently.

        Own Id: OTP-18642 Aux Id: GH-6152, PR-7465

      • The default process limit has been raised to 1048576 processes.

        Own Id: OTP-18699 Aux Id: PR-7388

      • The erlang:system_monitor/2 functionality is now able to monitor long message queues in the system.

        Own Id: OTP-18709 Aux Id: PR-7651

      • The erl command now supports the -S flag, which is similar to the -run flag, except that it will pass all arguments up to end of the command line to the called function. (The -run flag will not pass arguments beginning with a hyphen.) Another difference is that -S will always call a function with one argument, passing an empty list if no arguments were given.

        Own Id: OTP-18744 Aux Id: PR-7470

      • When implementing an alternative carrier for the Erlang distribution, a separate input handler process may now be registered, using erlang:dist_ctrl_input_handler/2, also in the case when the distribution controller is a port.

        Own Id: OTP-18774 Aux Id: PR-7110

      • The call stack trace has now been added to the error reported by erlang:process_flag/2 when max_heap_size limit has been exceeded.

        Own Id: OTP-18779 Aux Id: PR-7592

      • -callback attributes have been added to erl_tracer.

        Own Id: OTP-18794 Aux Id: PR-7703

      • For inet_backend = socket, setting the active socket option alone, to once, true or N has been optimized, as well as the corresponding data delivery.

        Own Id: OTP-18835

      • New functions socket:sendv/* for sending I/O vectors have been added.

        Own Id: OTP-18845

      • Socket options that take string now also accept binaries.

        Own Id: OTP-18849 Aux Id: PR-6510

      • Native coverage support has been implemented in the JIT. It will automatically be used by the cover tool to reduce the execution overhead when running cover-compiled code.

        There are also new APIs to support native coverage without using the cover tool.

        To instrument code for native coverage it must be compiled with the line_coverage option.

        To enable native coverage in the runtime system, start it like so:

        $ erl +JPcover true

        There are also the following new functions for supporting native coverage:

        Own Id: OTP-18856 Aux Id: PR-7856

      • Changed the default value of the command line flag -code_path_choice to strict.

        Note that for application systems using archives, it is necessary to add the code_path_choice relaxed to the command line that invokes erl.

        Own Id: OTP-18894 Aux Id: PR-7243

      • Added module loading to erl -init_debug printouts.

        Own Id: OTP-18929 Aux Id: PR-8004

      • When the runtime system halts, it performs various flush operations before terminating. By default there is no limit on how much time the flush operations are allowed to take. A new halt flush timeout functionality has been introduced which can be used for limiting the amount of time that the flushing operations are allowed to take. For more information see the documentation of the flush_timeout option of the erlang:halt/2 BIF and the documentation of the erl +zhft <Timeout> command line flag.

        Own Id: OTP-18938 Aux Id: PR-8035, GH-7438

      • Optimized code loading by moving certain operations from the code server to the caller.

        Own Id: OTP-18941 Aux Id: PR-7981

      • Updated asmjit to version a465fe71ab3d0e224b2b4bd0fac69ae68ab9239d

        Own Id: OTP-18942

      • The deprecated functions in zlib have been removed. That includes inflateChunk/{1,2}, getBufSize/1, setBufSize/2, the CRC32 functions, and the Adler checksum functions.

        Own Id: OTP-18950

      • The documentation has been migrated to use Markdown and ExDoc.

        Own Id: OTP-18955 Aux Id: PR-8026

      • Safe destructive update of tuples has been implemented in the compiler and runtime system. This allows the VM to update tuples in-place when it is safe to do so, thus improving performance by doing less copying but also by producing less garbage.

        Example:

        -record(rec, {a,b,c}).
         
        -update(#href_anchor"ss">rec{a=needs_update,b=N}=R0) ->
        -    R = R0#rec{a=up_to_date},
        +update(#href_anchor"ss">rec{a=needs_update,b=N}=R0) ->
        +    R = R0#rec{a=up_to_date},
             if
                 N < 0 ->
        -            R#rec{c=negative};
        +            R#rec{c=negative};
                 N == 0 ->
        -            R#rec{c=zero};
        +            R#rec{c=zero};
                 N > 0 ->
        -            R#rec{c=positive}
        +            R#rec{c=positive}
             end.

        The record updates in each of the three clauses of the if can safely be done in-place, because variable R is not used again.

        Own Id: OTP-18972 Aux Id: PR-8090

      • The obsolete and undocumented support for opening a port to an external resource by passing an atom (or a string) as first argument to open_port(), implemented by the vanilla driver, @@ -3059,9 +3059,9 @@ has now been removed.

        * POTENTIAL INCOMPATIBILITY *

        Own Id: OTP-16329 Aux Id: OTP-15621

      • The return value when using the httph and httph_bin option to erlang:decode_packet/3 and inet:setopts/2 has been changed to also include the original header unmodified. See erlang:decode_packet/3. Example:

         >
        -      erlang:decode_packet(httph_bin,<<"HELLO:
        -      hi\r\n\r\n">>,[]).
        -      {ok,{http_header,0,<<"Hello">>,<<"HELLO">>,<<"hi">>},<<"\r\n">>}

        Own Id: OTP-16347 Aux Id: PR-2466

      • Ensure net_kernel:monitor_nodes/1 sends nodedown messages of a failed + erlang:decode_packet(httph_bin,<<"HELLO: + hi\r\n\r\n">>,[]). + {ok,{http_header,0,<<"Hello">>,<<"HELLO">>,<<"hi">>},<<"\r\n">>}

      Own Id: OTP-16347 Aux Id: PR-2466

    • Ensure net_kernel:monitor_nodes/1 sends nodedown messages of a failed connection before nodeup messages of a reestablished connection toward the same node.

      Own Id: OTP-16362

    • Update of sequential tracing to also support other information transfers than message passing.

      Own Id: OTP-16370 Aux Id: OTP-15251, OTP-15232

    • socket: It is now possible to create a socket from an already existing file @@ -10772,12 +10772,12 @@ viewed as two operations performed atomically. Asynchronously send an unlink signal or a demonitor signal, and ignore any future results of the link or monitor.

      NOTE: This change can cause some obscure code to fail which previously did -not. For example, the following code might hang:

                  Mon = erlang:monitor(process, Pid),
      +not. For example, the following code might hang:

                  Mon = erlang:monitor(process, Pid),
                   %% ...
      -            exit(Pid, bang),
      -            erlang:demonitor(Mon),
      +            exit(Pid, bang),
      +            erlang:demonitor(Mon),
                   receive
      -                {'DOWN', Mon , process, Pid, _} -> ok
      +                {'DOWN', Mon , process, Pid, _} -> ok
                   %% We were previously guaranteed to get a down message
                   %% (since we exited the process ourself), so we could
                   %% in this case leave out:
      @@ -11331,7 +11331,7 @@
                 Erlang programming language
       
             

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/persistent_term.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (609)) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/persistent_term.html 2026-06-04 19:05:02.744453115 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/persistent_term.html 2026-06-04 19:05:02.744453115 +0000 @@ -200,9 +200,9 @@

      The following example shows how lock contention for ETS tables can be minimized by having one ETS table for each scheduler. The table identifiers for the ETS tables are stored as a single persistent term:

          %% There is one ETS table for each scheduler.
      -    Sid = erlang:system_info(scheduler_id),
      -    Tid = element(Sid, persistent_term:get(?MODULE)),
      -    ets:update_counter(Tid, Key, 1).
      +
      Sid = erlang:system_info(scheduler_id), + Tid = element(Sid, persistent_term:get(?MODULE)), + ets:update_counter(Tid, Key, 1).
    @@ -613,7 +613,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/portsignals.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/portsignals.html 2026-06-04 19:05:02.762453282 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/portsignals.html 2026-06-04 19:05:02.763453291 +0000 @@ -403,7 +403,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/processmanagementoptimizations.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/processmanagementoptimizations.html 2026-06-04 19:05:02.779453439 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/processmanagementoptimizations.html 2026-06-04 19:05:02.779453439 +0000 @@ -324,7 +324,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/ptables.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/ptables.html 2026-06-04 19:05:02.796453597 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/ptables.html 2026-06-04 19:05:02.796453597 +0000 @@ -460,7 +460,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/run_erl_cmd.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (329)) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/run_erl_cmd.html 2026-06-04 19:05:02.813453755 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/run_erl_cmd.html 2026-06-04 19:05:02.813453755 +0000 @@ -251,7 +251,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/search.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/search.html 2026-06-04 19:05:02.829027863 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/search.html 2026-06-04 19:05:02.829027863 +0000 @@ -141,7 +141,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/start_cmd.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (354)) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/start_cmd.html 2026-06-04 19:05:02.844454042 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/start_cmd.html 2026-06-04 19:05:02.845454051 +0000 @@ -188,7 +188,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/start_erl_cmd.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (403)) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/start_erl_cmd.html 2026-06-04 19:05:02.861454200 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/start_erl_cmd.html 2026-06-04 19:05:02.862454209 +0000 @@ -234,7 +234,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/supercarrier.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (448)) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/supercarrier.html 2026-06-04 19:05:02.878454358 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/supercarrier.html 2026-06-04 19:05:02.878454358 +0000 @@ -229,12 +229,12 @@ and free entire pages and we don't want to waste an entire page just to hold the block header of the following pages.

    Instead we store the meta information about all the free segments in a dedicated area apart from the sa and sua areas. Every free segment is -represented by a descriptor struct (ErtsFreeSegDesc).

    typedef struct {
    +represented by a descriptor struct (ErtsFreeSegDesc).

    typedef struct {
         RBTNode snode;      /* node in 'stree' */
         RBTNode anode;      /* node in 'atree' */
         char* start;
         char* end;
    -}ErtsFreeSegDesc;

    To find the smallest free segment that will satisfy a carrier allocation +}ErtsFreeSegDesc;

    To find the smallest free segment that will satisfy a carrier allocation (best fit), the free segments are organized in a tree sorted by size (stree). We search in this tree at allocation. If no free segment of sufficient size was found, the area (sa or sua) is instead expanded. @@ -321,7 +321,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/threadprogress.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/threadprogress.html 2026-06-04 19:05:02.895454515 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/threadprogress.html 2026-06-04 19:05:02.895454515 +0000 @@ -426,7 +426,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/time_correction.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (2450)) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/time_correction.html 2026-06-04 19:05:02.917454720 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/time_correction.html 2026-06-04 19:05:02.917454720 +0000 @@ -547,9 +547,9 @@ the event occurs.

    Do

    Determine the order of events by saving a tuple containing monotonic time and a strictly monotonically increasing integer as -follows:

    Time = erlang:monotonic_time(),
    -UMI = erlang:unique_integer([monotonic]),
    -EventTag = {Time, UMI}

    These tuples are strictly monotonically ordered on the current runtime system +follows:

    Time = erlang:monotonic_time(),
    +UMI = erlang:unique_integer([monotonic]),
    +EventTag = {Time, UMI}

    These tuples are strictly monotonically ordered on the current runtime system instance according to creation time. It is important that the monotonic time is in the first element (the most significant element when comparing two-tuples). Using the monotonic time in the tuples, you can calculate time @@ -628,7 +628,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/tracing.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (352)) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/tracing.html 2026-06-04 19:05:02.934454877 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/tracing.html 2026-06-04 19:05:02.935454886 +0000 @@ -149,23 +149,23 @@ to inspecting the stack we can only say where we're going to return to, which is not quite the same thing.

    As an illustration, when the caller option is enabled all trace messages from bar/1 will say that they were called from foo/0, even though it -went through a bunch of other functions on the way:

    foo() ->
    -    lots(),
    +went through a bunch of other functions on the way:

    foo() ->
    +    lots(),
         ok.
     
    -lots() ->
    -    'of'().
    +lots() ->
    +    'of'().
     
    -'of'() ->
    -    indirections().
    +'of'() ->
    +    indirections().
     
    -indirections() ->
    -    bar(10).
    +indirections() ->
    +    bar(10).
     
    -bar(0) ->
    +bar(0) ->
         done;
    -bar(N) ->
    -    bar(N - 1).

    +bar(N) -> + bar(N - 1).

    @@ -390,7 +390,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/tty.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (6408)) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/tty.html 2026-06-04 19:05:02.952455044 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/tty.html 2026-06-04 19:05:02.952455044 +0000 @@ -195,7 +195,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/werl_cmd.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/werl_cmd.html 2026-06-04 19:05:02.969455202 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/werl_cmd.html 2026-06-04 19:05:02.969455202 +0000 @@ -200,7 +200,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/zlib.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (775)) --- old//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/zlib.html 2026-06-04 19:05:02.994455434 +0000 +++ new//usr/share/doc/packages/erlang27-doc/erts-15.1.3/doc/html/zlib.html 2026-06-04 19:05:02.995455443 +0000 @@ -133,18 +133,18 @@ data. The data format is described by RFC 1950, RFC 1951, and -RFC 1952.

    A typical (compress) usage is as follows:

    Z = zlib:open(),
    -ok = zlib:deflateInit(Z,default),
    +RFC 1952.

    A typical (compress) usage is as follows:

    Z = zlib:open(),
    +ok = zlib:deflateInit(Z,default),
     
    -Compress = fun(end_of_data, _Cont) -> [];
    -              (Data, Cont) ->
    -                 [zlib:deflate(Z, Data)|Cont(Read(),Cont)]
    +Compress = fun(end_of_data, _Cont) -> [];
    +              (Data, Cont) ->
    +                 [zlib:deflate(Z, Data)|Cont(Read(),Cont)]
                end,
    -Compressed = Compress(Read(),Compress),
    -Last = zlib:deflate(Z, [], finish),
    -ok = zlib:deflateEnd(Z),
    -zlib:close(Z),
    -list_to_binary([Compressed|Last])

    In all functions errors, {'EXIT',{Reason,Backtrace}}, can be thrown, where +Compressed = Compress(Read(),Compress), +Last = zlib:deflate(Z, [], finish), +ok = zlib:deflateEnd(Z), +zlib:close(Z), +list_to_binary([Compressed|Last])

    In all functions errors, {'EXIT',{Reason,Backtrace}}, can be thrown, where Reason describes the error.

    Typical Reasons:

    • badarg - Bad argument.

    • not_initialized - The stream hasn't been initialized, eg. if inflateInit/1 wasn't called prior to a call to inflate/2.

    • not_on_controlling_process - The stream was used by a process that doesn't control it. Use set_controlling_process/2 if you need to transfer a @@ -853,11 +853,11 @@ full too often can seriously degrade the compression.

      If Flush is set to finish, pending input is processed, pending output is flushed, and deflate/3 returns. Afterwards the only possible operations on the stream are deflateReset/1 or deflateEnd/1.

      Flush can be set to finish immediately after -deflateInit if all compression is to be done in one step.

      Example:

      zlib:deflateInit(Z),
      -B1 = zlib:deflate(Z,Data),
      -B2 = zlib:deflate(Z,<< >>,finish),
      -zlib:deflateEnd(Z),
      -list_to_binary([B1,B2])
      +deflateInit if all compression is to be done in one step.

      Example:

      zlib:deflateInit(Z),
      +B1 = zlib:deflate(Z,Data),
      +B2 = zlib:deflate(Z,<< >>,finish),
      +zlib:deflateEnd(Z),
      +list_to_binary([B1,B2])
      @@ -1409,20 +1409,20 @@ {'EXIT',{{need_dictionary,Adler},_StackTrace}} exception.

      The dictionary chosen by the compressor can be determined from the Adler value returned or thrown by the call to the inflate function. The compressor and decompressor must use the same dictionary (See deflateSetDictionary/2).

      After setting the dictionary the inflate operation should be retried without new -input.

      Example:

      deprecated_unpack(Z, Compressed, Dict) ->
      -     case catch zlib:inflate(Z, Compressed) of
      -          {'EXIT',{{need_dictionary,_DictID},_}} ->
      -                 ok = zlib:inflateSetDictionary(Z, Dict),
      -                 Uncompressed = zlib:inflate(Z, []);
      +input.

      Example:

      deprecated_unpack(Z, Compressed, Dict) ->
      +     case catch zlib:inflate(Z, Compressed) of
      +          {'EXIT',{{need_dictionary,_DictID},_}} ->
      +                 ok = zlib:inflateSetDictionary(Z, Dict),
      +                 Uncompressed = zlib:inflate(Z, []);
                 Uncompressed ->
                        Uncompressed
            end.
       
      -new_unpack(Z, Compressed, Dict) ->
      -    case zlib:inflate(Z, Compressed, [{exception_on_need_dict, false}]) of
      -        {need_dictionary, _DictId, Output} ->
      -            ok = zlib:inflateSetDictionary(Z, Dict),
      -            [Output | zlib:inflate(Z, [])];
      +new_unpack(Z, Compressed, Dict) ->
      +    case zlib:inflate(Z, Compressed, [{exception_on_need_dict, false}]) of
      +        {need_dictionary, _DictId, Output} ->
      +            ok = zlib:inflateSetDictionary(Z, Dict),
      +            [Output | zlib:inflate(Z, [])];
               Uncompressed ->
                   Uncompressed
           end.
      @@ -1498,18 +1498,18 @@ desired, and the function will return {finished, Output} once all queued data has been decompressed.

      This function can introduce some output latency (reading input without producing any output).

      If a preset dictionary is required for further decompression, this function -returns a need_dictionary tuple. See inflateSetDictionary/2) for details.

      Example:

      walk(Compressed, Handler) ->
      -    Z = zlib:open(),
      -    zlib:inflateInit(Z),
      -    loop(Z, Handler, zlib:safeInflate(Z, Compressed)),
      -    zlib:inflateEnd(Z),
      -    zlib:close(Z).
      -
      -loop(Z, Handler, {continue, Output}) ->
      -    Handler(Output),
      -    loop(Z, Handler, zlib:safeInflate(Z, []));
      -loop(Z, Handler, {finished, Output}) ->
      -    Handler(Output).
      +returns a need_dictionary tuple. See inflateSetDictionary/2) for details.

      Example:

      walk(Compressed, Handler) ->
      +    Z = zlib:open(),
      +    zlib:inflateInit(Z),
      +    loop(Z, Handler, zlib:safeInflate(Z, Compressed)),
      +    zlib:inflateEnd(Z),
      +    zlib:close(Z).
      +
      +loop(Z, Handler, {continue, Output}) ->
      +    Handler(Output),
      +    loop(Z, Handler, zlib:safeInflate(Z, []));
      +loop(Z, Handler, {finished, Output}) ->
      +    Handler(Output).
      @@ -1648,7 +1648,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/404.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/404.html 2026-06-04 19:05:03.014589881 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/404.html 2026-06-04 19:05:03.013986265 +0000 @@ -147,7 +147,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/api-reference.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/api-reference.html 2026-06-04 19:05:03.029455759 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/api-reference.html 2026-06-04 19:05:03.029455759 +0000 @@ -185,7 +185,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1.epub/OEBPS/asn1ct.xhtml differs (HTML document, ASCII text, with very long lines (1292)) --- old//usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1.epub/OEBPS/asn1ct.xhtml 2026-06-04 00:07:54.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1.epub/OEBPS/asn1ct.xhtml 2042-07-06 13:27:22.000000000 +0000 @@ -379,9 +379,9 @@ mostly work for old specifications based on the 1997 standard for ASN.1, but not for most modern-style applications. Another limitation is that the test functions may not work if options that change code generations strategies such -as the options macro_name_prefix and record_name_prefix have been used.

    • test/1 iterates over all types in Module.
    • test/2 tests type Type with a random value.
    • test/3 tests type Type with Value.

    Schematically, the following occurs for each type in the module:

    {ok, Value} = asn1ct:value(Module, Type),
    -{ok, Bytes} = Module:encode(Type, Value),
    -{ok, Value} = Module:decode(Type, Bytes).

    The test functions use the *.asn1db files for all included modules. If they +as the options macro_name_prefix and record_name_prefix have been used.

    • test/1 iterates over all types in Module.
    • test/2 tests type Type with a random value.
    • test/3 tests type Type with Value.

    Schematically, the following occurs for each type in the module:

    {ok, Value} = asn1ct:value(Module, Type),
    +{ok, Bytes} = Module:encode(Type, Value),
    +{ok, Value} = Module:decode(Type, Bytes).

    The test functions use the *.asn1db files for all included modules. If they are located in a different directory than the current working directory, use the include option to add paths. This is only needed when automatically generating values. For static values using Value no options are needed.

    /usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1.epub/OEBPS/asn1_getting_started.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (2578)) --- old//usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1.epub/OEBPS/asn1_getting_started.xhtml 2026-06-04 00:07:54.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1.epub/OEBPS/asn1_getting_started.xhtml 2042-07-06 13:27:22.000000000 +0000 @@ -38,37 +38,37 @@ the syntax is correct and that the text represents proper ASN.1 code before generating an abstract syntax tree. The code generator then uses the abstract syntax tree to generate code.

    The generated Erlang files are placed in the current directory or in the -directory specified with option {outdir,Dir}.

    The compiler can be called from the Erlang shell like this:

    1> asn1ct:compile("People", [ber]).
    -ok

    Option verbose can be added to get information about the generated files:

    2> asn1ct:compile("People", [ber,verbose]).
    +directory specified with option {outdir,Dir}.

    The compiler can be called from the Erlang shell like this:

    1> asn1ct:compile("People", [ber]).
    +ok

    Option verbose can be added to get information about the generated files:

    2> asn1ct:compile("People", [ber,verbose]).
     Erlang ASN.1 compiling "People.asn"
    ---{generated,"People.asn1db"}--
    ---{generated,"People.hrl"}--
    ---{generated,"People.erl"}--
    +--{generated,"People.asn1db"}--
    +--{generated,"People.hrl"}--
    +--{generated,"People.erl"}--
     ok

    ASN.1 module People is now accepted and the abstract syntax tree is saved in file People.asn1db. The generated Erlang code is compiled using the Erlang compiler and loaded into the Erlang runtime system. There is now an API for -encode/2 and decode/2 in module People, which is called like this:

    'People':encode(<Type name>, <Value>)

    or:

    'People':decode(<Type name>, <Value>)

    Assume that there is a network application that receives instances of the ASN.1 +encode/2 and decode/2 in module People, which is called like this:

    'People':encode(<Type name>, <Value>)

    or:

    'People':decode(<Type name>, <Value>)

    Assume that there is a network application that receives instances of the ASN.1 defined type Person, modifies, and sends them back again:

    receive
    -   {Port,{data,Bytes}} ->
    -       case 'People':decode('Person',Bytes) of
    -           {ok,P} ->
    -               {ok,Answer} = 'People':encode('Person',mk_answer(P)),
    -               Port ! {self(),{command,Answer}};
    -           {error,Reason} ->
    -               exit({error,Reason})
    +   {Port,{data,Bytes}} ->
    +       case 'People':decode('Person',Bytes) of
    +           {ok,P} ->
    +               {ok,Answer} = 'People':encode('Person',mk_answer(P)),
    +               Port ! {self(),{command,Answer}};
    +           {error,Reason} ->
    +               exit({error,Reason})
            end
         end,

    In this example, a series of bytes is received from an external source and the bytes are then decoded into a valid Erlang term. This was achieved with the call 'People':decode('Person',Bytes), which returned an Erlang value of the ASN.1 type Person. Then an answer was constructed and encoded using 'People':encode('Person',Answer), which takes an instance of a defined ASN.1 -type and transforms it to a binary according to the BER or PER encoding rules.

    The encoder and decoder can also be run from the shell:

    2> Rockstar = {'Person',"Some Name",roving,50}.
    -{'Person',"Some Name",roving,50}
    -3> {ok,Bin} = 'People':encode('Person',Rockstar).
    -{ok,<<243,17,19,9,83,111,109,101,32,78,97,109,101,2,1,2,
    -      2,1,50>>}
    -4> {ok,Person} = 'People':decode('Person',Bin).
    -{ok,{'Person',"Some Name",roving,50}}

    +type and transforms it to a binary according to the BER or PER encoding rules.

    The encoder and decoder can also be run from the shell:

    2> Rockstar = {'Person',"Some Name",roving,50}.
    +{'Person',"Some Name",roving,50}
    +3> {ok,Bin} = 'People':encode('Person',Rockstar).
    +{ok,<<243,17,19,9,83,111,109,101,32,78,97,109,101,2,1,2,
    +      2,1,50>>}
    +4> {ok,Person} = 'People':decode('Person',Bin).
    +{ok,{'Person',"Some Name",roving,50}}

    @@ -166,16 +166,16 @@ to manually add tags to certain constructs in order for the ASN.1 specification to be valid. Example of an old-style specification:

    Tags DEFINITIONS ::=
     BEGIN
    -  Afters ::= CHOICE { cheese [0] IA5String,
    -                      dessert [1] IA5String }
    +  Afters ::= CHOICE { cheese [0] IA5String,
    +                      dessert [1] IA5String }
     END

    Without the tags (the numbers in square brackets) the ASN.1 compiler refused to compile the file.

    In 1994 the global tagging mode AUTOMATIC TAGS was introduced. By putting AUTOMATIC TAGS in the module header, the ASN.1 compiler automatically adds tags when needed. The following is the same specification in AUTOMATIC TAGS mode:

    Tags DEFINITIONS AUTOMATIC TAGS ::=
     BEGIN
    -  Afters ::= CHOICE { cheese IA5String,
    -                      dessert IA5String }
    +  Afters ::= CHOICE { cheese IA5String,
    +                      dessert IA5String }
     END

    @@ -186,7 +186,7 @@ and how values are assigned in Erlang.

    ASN.1 has both primitive and constructed types:

    Primitive TypesConstructed Types
    BOOLEANSEQUENCE
    INTEGERSET
    REALCHOICE
    NULLSET OF and SEQUENCE OF
    ENUMERATEDANY
    BIT STRINGANY DEFINED BY
    OCTET STRINGEXTERNAL
    Character StringsEMBEDDED PDV
    OBJECT IDENTIFIERCHARACTER STRING
    Object Descriptor
    TIME Types

    Table: Supported ASN.1 Types

    Note

    The values of each ASN.1 type have their own representation in Erlang, as described in the following sections. Users must provide these values for encoding according to the representation, as shown in the following example:

    Operational ::= BOOLEAN --ASN.1 definition

    In Erlang code it can look as follows:

    Val = true,
    -{ok,Bytes} = MyModule:encode('Operational', Val),

    +{ok,Bytes} = MyModule:encode('Operational', Val),

    @@ -203,11 +203,11 @@

    An ASN.1 INTEGER is represented by an integer in Erlang.

    The concept of subtyping can be applied to integers and to other ASN.1 types. The details of subtyping are not explained here; for more information, see X.680. Various syntaxes are allowed when defining a type as an integer:

    T1 ::= INTEGER
    -T2 ::= INTEGER (-2..7)
    -T3 ::= INTEGER (0..MAX)
    -T4 ::= INTEGER (0<..MAX)
    -T5 ::= INTEGER (MIN<..-99)
    -T6 ::= INTEGER {red(0),blue(1),white(2)}

    The Erlang representation of an ASN.1 INTEGER is an integer or an atom if a +T2 ::= INTEGER (-2..7) +T3 ::= INTEGER (0..MAX) +T4 ::= INTEGER (0<..MAX) +T5 ::= INTEGER (MIN<..-99) +T6 ::= INTEGER {red(0),blue(1),white(2)}

    The Erlang representation of an ASN.1 INTEGER is an integer or an atom if a Named Number List (see T6 in the previous list) is specified.

    The following is an example of Erlang code that assigns values for the types in the previous list:

    T1value = 0,
     T2value = 6,
    @@ -254,7 +254,7 @@
     

    The type BIT STRING can be used to model information that is made up of arbitrary length series of bits. It is intended to be used for selection of flags, not for binary files.

    In ASN.1, BIT STRING definitions can look as follows:

    Bits1 ::= BIT STRING
    -Bits2 ::= BIT STRING {foo(0),bar(1),gnu(2),gnome(3),punk(14)}

    The following two notations are available for representation of BIT STRING +Bits2 ::= BIT STRING {foo(0),bar(1),gnu(2),gnome(3),punk(14)}

    The following two notations are available for representation of BIT STRING values in Erlang and as input to the encode functions:

    1. A bitstring. By default, a BIT STRING with no symbolic names is decoded to an Erlang bitstring.
    2. A list of atoms corresponding to atoms in the NamedBitList in the BIT STRING definition. A BIT STRING with symbolic names is always decoded @@ -282,7 +282,7 @@

      OCTET STRING is the simplest of all ASN.1 types. OCTET STRING only moves or transfers, for example, binary files or other unstructured information complying with two rules: the bytes consist of octets and encoding is not required.

      It is possible to have the following ASN.1 type definitions:

      O1 ::= OCTET STRING
      -O2 ::= OCTET STRING (SIZE(28))

      With the following example assignments in Erlang:

      O1Val = <<17,13,19,20,0,0,255,254>>,
      +O2 ::= OCTET STRING (SIZE(28))

      With the following example assignments in Erlang:

      O1Val = <<17,13,19,20,0,0,255,254>>,
       O2Val = <<"must be exactly 28 chars....">>,

      By default, an OCTET STRING is always represented as an Erlang binary. If the specification has been compiled with option legacy_erlang_types, the encode functions accept both lists and binaries, and the decode functions decode an @@ -303,11 +303,11 @@ of view, octets are very similar to character strings and are compiled in the same way.

      When PER is used, there is a significant difference in the encoding scheme for OCTET STRINGs and other strings. The constraints specified for a type -are especially important for PER, because they affect the encoding.

      Examples:

      Digs ::= NumericString (SIZE(1..3))
      -TextFile ::= IA5String (SIZE(0..64000))

      The corresponding Erlang assignments:

      DigsVal1 = "456",
      +are especially important for PER, because they affect the encoding.

      Examples:

      Digs ::= NumericString (SIZE(1..3))
      +TextFile ::= IA5String (SIZE(0..64000))

      The corresponding Erlang assignments:

      DigsVal1 = "456",
       DigsVal2 = "123",
       TextFileVal1 = "abc...xyz...",
      -TextFileVal2 = [88,76,55,44,99,121 .......... a lot of characters here ....]

      The Erlang representation for BMPString and UniversalString is either a list +TextFileVal2 = [88,76,55,44,99,121 .......... a lot of characters here ....]

      The Erlang representation for BMPString and UniversalString is either a list of ASCII values or a list of quadruples. The quadruple representation associates to the Unicode standard representation of characters. The ASCII characters are all represented by quadruples beginning with three zeros like {0,0,0,65} for @@ -316,26 +316,26 @@ in file PrimStrings.asn1:

      PrimStrings DEFINITIONS AUTOMATIC TAGS ::=
       BEGIN
          BMP ::= BMPString
      -END

      Encoding and decoding some strings:

      1> asn1ct:compile('PrimStrings', [ber]).
      +END

      Encoding and decoding some strings:

      1> asn1ct:compile('PrimStrings', [ber]).
       ok
      -2> {ok,Bytes1} = 'PrimStrings':encode('BMP', [{0,0,53,53},{0,0,45,56}]).
      -{ok,<<30,4,53,54,45,56>>}
      -3> 'PrimStrings':decode('BMP', Bytes1).
      -{ok,[{0,0,53,53},{0,0,45,56}]}
      -4> {ok,Bytes2} = 'PrimStrings':encode('BMP', [{0,0,53,53},{0,0,0,65}]).
      -{ok,<<30,4,53,53,0,65>>}
      -5> 'PrimStrings':decode('BMP', Bytes2).
      -{ok,[{0,0,53,53},65]}
      -6> {ok,Bytes3} = 'PrimStrings':encode('BMP', "BMP string").
      -{ok,<<30,20,0,66,0,77,0,80,0,32,0,115,0,116,0,114,0,105,0,110,0,103>>}
      -7> 'PrimStrings':decode('BMP', Bytes3).
      -{ok,"BMP string"}

      Type UTF8String is represented as a UTF-8 encoded binary in Erlang. Such +2> {ok,Bytes1} = 'PrimStrings':encode('BMP', [{0,0,53,53},{0,0,45,56}]). +{ok,<<30,4,53,54,45,56>>} +3> 'PrimStrings':decode('BMP', Bytes1). +{ok,[{0,0,53,53},{0,0,45,56}]} +4> {ok,Bytes2} = 'PrimStrings':encode('BMP', [{0,0,53,53},{0,0,0,65}]). +{ok,<<30,4,53,53,0,65>>} +5> 'PrimStrings':decode('BMP', Bytes2). +{ok,[{0,0,53,53},65]} +6> {ok,Bytes3} = 'PrimStrings':encode('BMP', "BMP string"). +{ok,<<30,20,0,66,0,77,0,80,0,32,0,115,0,116,0,114,0,105,0,110,0,103>>} +7> 'PrimStrings':decode('BMP', Bytes3). +{ok,"BMP string"}

    Type UTF8String is represented as a UTF-8 encoded binary in Erlang. Such binaries can be created directly using the binary syntax or by converting from a list of Unicode code points using function unicode:characters_to_binary/1.

    The following shows examples of how UTF-8 encoded binaries can be created and manipulated:

    1> Gs = "Мой маленький Гном".
    -[1052,1086,1081,32,1084,1072,1083,1077,1085,1100,1082,1080,
    - 1081,32,1043,1085,1086,1084]
    -2> Gbin = unicode:characters_to_binary(Gs).
    +[1052,1086,1081,32,1084,1072,1083,1077,1085,1100,1082,1080,
    + 1081,32,1043,1085,1086,1084]
    +2> Gbin = unicode:characters_to_binary(Gs).
     <<208,156,208,190,208,185,32,208,188,208,176,208,187,208,
       181,208,189,209,140,208,186,208,184,208,185,32,208,147,
       208,...>>
    @@ -343,22 +343,22 @@
     <<208,156,208,190,208,185,32,208,188,208,176,208,187,208,
       181,208,189,209,140,208,186,208,184,208,185,32,208,147,
       208,...>>
    -4> Gs = unicode:characters_to_list(Gbin).
    -[1052,1086,1081,32,1084,1072,1083,1077,1085,1100,1082,1080,
    - 1081,32,1043,1085,1086,1084]

    For details, see the unicode module in STDLIB.

    In the following example, this ASN.1 specification is used:

    UTF DEFINITIONS AUTOMATIC TAGS ::=
    +4> Gs = unicode:characters_to_list(Gbin).
    +[1052,1086,1081,32,1084,1072,1083,1077,1085,1100,1082,1080,
    + 1081,32,1043,1085,1086,1084]

    For details, see the unicode module in STDLIB.

    In the following example, this ASN.1 specification is used:

    UTF DEFINITIONS AUTOMATIC TAGS ::=
     BEGIN
        UTF ::= UTF8String
    -END

    Encoding and decoding a string with Unicode characters:

    5> asn1ct:compile('UTF', [ber]).
    +END

    Encoding and decoding a string with Unicode characters:

    5> asn1ct:compile('UTF', [ber]).
     ok
    -6> {ok,Bytes1} = 'UTF':encode('UTF', <<"Гном"/utf8>>).
    -{ok,<<12,8,208,147,208,189,208,190,208,188>>}
    /usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1.epub/OEBPS/asn1_spec.xhtml differs (HTML document, ASCII text, with very long lines (1074))
    --- old//usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1.epub/OEBPS/asn1_spec.xhtml	2026-06-04 00:07:54.000000000 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1.epub/OEBPS/asn1_spec.xhtml	2042-07-06 13:27:22.000000000 +0000
    @@ -60,37 +60,37 @@
     exclusive decode is enabled. This function decodes the parts that
     were left undecoded during the exclusive decode.

    Both functions are described in the following.

    If the exclusive decode function has, for example, the name decode_exclusive and an ASN.1 encoded message Bin is to be exclusive decoded, the call is as -follows:

    {ok,ExclMessage} = 'MyModule':decode_exclusive(Bin)

    The result ExclMessage has the same structure as a +follows:

    {ok,ExclMessage} = 'MyModule':decode_exclusive(Bin)

    The result ExclMessage has the same structure as a complete decode would have, except for the parts of the top type that were not decoded. The undecoded parts are on their places in the structure on format {TypeKey,UndecodedValue}.

    Each undecoded part that is to be decoded must be fed into function -decode_part/2 as follows:

    {ok,PartMessage} = 'MyModule':decode_part(TypeKey, UndecodedValue)

    +decode_part/2 as follows:

    {ok,PartMessage} = 'MyModule':decode_part(TypeKey, UndecodedValue)

    Writing an Exclusive Decode Instruction

    -

    This instruction is written in the configuration file in the following format:

    ExclusiveDecodeInstruction = {exclusive_decode,{ModuleName,DecodeInstructions}}.
    +

    This instruction is written in the configuration file in the following format:

    ExclusiveDecodeInstruction = {exclusive_decode,{ModuleName,DecodeInstructions}}.
     
    -ModuleName = atom()
    +ModuleName = atom()
     
    -DecodeInstructions = [DecodeInstruction]+
    +DecodeInstructions = [DecodeInstruction]+
     
    -DecodeInstruction = {ExclusiveDecodeFunctionName,TypeList}
    +DecodeInstruction = {ExclusiveDecodeFunctionName,TypeList}
     
    -ExclusiveDecodeFunctionName = atom()
    +ExclusiveDecodeFunctionName = atom()
     
    -TypeList = [TopType,ElementList]
    +TypeList = [TopType,ElementList]
     
    -ElementList = [Element]+
    +ElementList = [Element]+
     
    -Element = {Name,parts} |
    -          {Name,undecoded} |
    -          {Name,ElementList}
    +Element = {Name,parts} |
    +          {Name,undecoded} |
    +          {Name,ElementList}
     
    -TopType = atom()
    +TopType = atom()
     
    -Name = atom()

    The instruction must be a valid Erlang term terminated by a dot.

    In TypeList the path from the top type to each undecoded subcomponent is +Name = atom()

    The instruction must be a valid Erlang term terminated by a dot.

    In TypeList the path from the top type to each undecoded subcomponent is described. TopType is the name of a top-level type in the ASN.1 specification. The action for each component in ElementList is described by one of:

    • {Name,parts}
    • {Name,undecoded}
    • {Name,ElementList}

    The use and effect of the actions are as follows:

    • {Name,undecoded} - Leaves the element undecoded. The type of Name can be any ASN.1 type. The value of element Name is returned as a tuple (as @@ -156,78 +156,78 @@ ['Button',[{number,undecoded}]]}]}}.

    The following figure shows the bytes of a Window:status message. The components buttonList and actions are excluded from decode. Only state and enabled are decoded when decode__Window_exclusive is called.

    Bytes of a Window:status Message

    Here follows an example of how the module. Note that option no_ok_wrapper is -used to make the example more concise.

    1> asn1ct:compile('GUI', [ber,asn1config,no_ok_wrapper]).
    +used to make the example more concise.

    1> asn1ct:compile('GUI', [ber,asn1config,no_ok_wrapper]).
     ok
    -2> rr('GUI').
    -['Action','Button','Status']
    -3> ButtonMsg = #'Button'{number=123,on=true}.
    -#'Button'{number = 123,on = true}
    -4> ButtonBytes = 'GUI':encode('Button', ButtonMsg).
    +2> rr('GUI').
    +['Action','Button','Status']
    +3> ButtonMsg = #'Button'{number=123,on=true}.
    +#'Button'{number = 123,on = true}
    +4> ButtonBytes = 'GUI':encode('Button', ButtonMsg).
     <<48,6,128,1,123,129,1,255>>
    -5> ExclusiveMsgButton = 'GUI':decode_Button_exclusive(ButtonBytes).
    -#'Button'{number = {'Button_number',<<128,1,123>>},
    -          on = true}
    -6> {UndecKey,UndecBytes} = ExclusiveMsgButton#'Button'.number.
    -{'Button_number',<<128,1,123>>}
    -7> 'GUI':decode_part(UndecKey, UndecBytes).
    +5> ExclusiveMsgButton = 'GUI':decode_Button_exclusive(ButtonBytes).
    +#'Button'{number = {'Button_number',<<128,1,123>>},
    +          on = true}
    +6> {UndecKey,UndecBytes} = ExclusiveMsgButton#'Button'.number.
    +{'Button_number',<<128,1,123>>}
    +7> 'GUI':decode_part(UndecKey, UndecBytes).
     123
     8> WindowMsg =
    -{status,{'Status',35,
    -   [{'Button',3,true},
    -    {'Button',4,false},
    -    {'Button',5,true},
    -    {'Button',6,true},
    -    {'Button',7,false}],
    +{status,{'Status',35,
    +   [{'Button',3,true},
    +    {'Button',4,false},
    +    {'Button',5,true},
    +    {'Button',6,true},
    +    {'Button',7,false}],
        false,
    -   {possibleActions,[{'Action',16,{'Button',17,true}}]}}}.
    -{status,#'Status'{state = 35,
    -        buttonList = [#'Button'{number = 3,on = true},
    -                      #'Button'{number = 4,on = false},
    -                      #'Button'{number = 5,on = true},
    -                      #'Button'{number = 6,on = true},
    -                      #'Button'{number = 7,on = false}],
    +   {possibleActions,[{'Action',16,{'Button',17,true}}]}}}.
    +{status,#'Status'{state = 35,
    +        buttonList = [#'Button'{number = 3,on = true},
    +                      #'Button'{number = 4,on = false},
    +                      #'Button'{number = 5,on = true},
    +                      #'Button'{number = 6,on = true},
    +                      #'Button'{number = 7,on = false}],
             enabled = false,
    -        actions = {possibleActions,[#'Action'{number = 16,
    -                                              handle = #'Button'{number = 17,on = true}}]}}}
    -9> WindowBytes = 'GUI':encode('Window', WindowMsg).
    +        actions = {possibleActions,[#'Action'{number = 16,
    +                                              handle = #'Button'{number = 17,on = true}}]}}}
    +9> WindowBytes = 'GUI':encode('Window', WindowMsg).
     <<161,65,128,1,35,161,40,48,6,128,1,3,129,1,255,48,6,128,
       1,4,129,1,0,48,6,128,1,5,129,...>>
    -10> {status,#'Status'{buttonList={UndecWindowKey,UndecWindowParts}}} =
    -'GUI':decode_Window_exclusive(WindowBytes).
    -{status,#'Status'{state = 35,
    -                  buttonList = {'Status_buttonList',[<<48,6,128,1,3,129,1,
    +10> {status,#'Status'{buttonList={UndecWindowKey,UndecWindowParts}}} =
    +'GUI':decode_Window_exclusive(WindowBytes).
    +{status,#'Status'{state = 35,
    +                  buttonList = {'Status_buttonList',[<<48,6,128,1,3,129,1,
                                                            255>>,
                                                          <<48,6,128,1,4,129,1,0>>,
                                                          <<48,6,128,1,5,129,1,255>>,
                                                          <<48,6,128,1,6,129,1,255>>,
    -                                                     <<48,6,128,1,7,129,1,0>>]},
    +                                                     <<48,6,128,1,7,129,1,0>>]},
                       enabled = false,
    -                  actions = {'Status_actions',<<163,15,160,13,48,11,128,
    +                  actions = {'Status_actions',<<163,15,160,13,48,11,128,
                                                     1,16,161,6,128,1,17,129,
    -                                                1,255>>}}}
    -11> 'GUI':decode_part(UndecWindowKey, UndecWindowParts).
    -[#'Button'{number = 3,on = true},
    - #'Button'{number = 4,on = false},
    - #'Button'{number = 5,on = true},
    - #'Button'{number = 6,on = true},
    - #'Button'{number = 7,on = false}]
    -12> 'GUI':decode_part(UndecWindowKey, hd(UndecWindowParts)).
    -#'Button'{number = 3,on = true}
    -13> {status,#'Status'{actions={ChoiceKey,ChoiceUndec}}} = v(10).
    -{status,#'Status'{state = 35,
    -                  buttonList = {'Status_buttonList',[<<48,6,128,1,3,129,1,
    +                                                1,255>>}}}
    +11> 'GUI':decode_part(UndecWindowKey, UndecWindowParts).
    +[#'Button'{number = 3,on = true},
    + #'Button'{number = 4,on = false},
    + #'Button'{number = 5,on = true},
    + #'Button'{number = 6,on = true},
    + #'Button'{number = 7,on = false}]
    +12> 'GUI':decode_part(UndecWindowKey, hd(UndecWindowParts)).
    +#'Button'{number = 3,on = true}
    +13> {status,#'Status'{actions={ChoiceKey,ChoiceUndec}}} = v(10).
    +{status,#'Status'{state = 35,
    +                  buttonList = {'Status_buttonList',[<<48,6,128,1,3,129,1,
                                                            255>>,
                                                          <<48,6,128,1,4,129,1,0>>,
                                                          <<48,6,128,1,5,129,1,255>>,
                                                          <<48,6,128,1,6,129,1,255>>,
    -                                                     <<48,6,128,1,7,129,1,0>>]},
    +                                                     <<48,6,128,1,7,129,1,0>>]},
                       enabled = false,
    -                  actions = {'Status_actions',<<163,15,160,13,48,11,128,
    +                  actions = {'Status_actions',<<163,15,160,13,48,11,128,
                                                     1,16,161,6,128,1,17,129,
    -                                                1,255>>}}}
    -14> 'GUI':decode_part(ChoiceKey, ChoiceUndec).
    -{possibleActions,[#'Action'{number = 16,
    -                            handle = #'Button'{number = 17,on = true}}]}

    + 1,255>>}}} +14> 'GUI':decode_part(ChoiceKey, ChoiceUndec). +{possibleActions,[#'Action'{number = 16, + handle = #'Button'{number = 17,on = true}}]}

    @@ -264,23 +264,23 @@ Writing a Selective Decode Instruction

    One or more selective decode functions can be described in a configuration file. -Use the following notation:

    SelectiveDecodeInstruction = {selective_decode,{ModuleName,DecodeInstructions}}.
    +Use the following notation:

    SelectiveDecodeInstruction = {selective_decode,{ModuleName,DecodeInstructions}}.
     
    -ModuleName = atom()
    +ModuleName = atom()
     
    -DecodeInstructions = [DecodeInstruction]+
    +DecodeInstructions = [DecodeInstruction]+
     
    -DecodeInstruction = {SelectiveDecodeFunctionName,TypeList}
    +DecodeInstruction = {SelectiveDecodeFunctionName,TypeList}
    /usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1.epub/OEBPS/content.opf differs (XML 1.0 document, ASCII text)
    --- old//usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1.epub/OEBPS/content.opf	2026-06-04 00:07:54.000000000 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1.epub/OEBPS/content.opf	2042-07-06 13:27:22.000000000 +0000
    @@ -4,10 +4,10 @@
              version="3.0">
       
         asn1 - 5.3.1
    -    urn:uuid:788bcc32-b137-df5d-ef97-9c9c50d02eeb
    +    urn:uuid:999cf6cd-ae2e-88e7-5e3b-49fca680c2a3
         en
     
    -    2026-06-04T00:07:54Z
    +    2042-07-06T13:27:22Z
     
       
       
    /usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1_getting_started.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (2585))
    --- old//usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1_getting_started.html	2026-06-04 19:05:03.144456825 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1_getting_started.html	2026-06-04 19:05:03.144456825 +0000
    @@ -143,37 +143,37 @@
     the syntax is correct and that the text represents proper ASN.1 code before
     generating an abstract syntax tree. The code generator then uses the abstract
     syntax tree to generate code.

    The generated Erlang files are placed in the current directory or in the -directory specified with option {outdir,Dir}.

    The compiler can be called from the Erlang shell like this:

    1> asn1ct:compile("People", [ber]).
    -ok

    Option verbose can be added to get information about the generated files:

    2> asn1ct:compile("People", [ber,verbose]).
    +directory specified with option {outdir,Dir}.

    The compiler can be called from the Erlang shell like this:

    1> asn1ct:compile("People", [ber]).
    +ok

    Option verbose can be added to get information about the generated files:

    2> asn1ct:compile("People", [ber,verbose]).
     Erlang ASN.1 compiling "People.asn"
    ---{generated,"People.asn1db"}--
    ---{generated,"People.hrl"}--
    ---{generated,"People.erl"}--
    +--{generated,"People.asn1db"}--
    +--{generated,"People.hrl"}--
    +--{generated,"People.erl"}--
     ok

    ASN.1 module People is now accepted and the abstract syntax tree is saved in file People.asn1db. The generated Erlang code is compiled using the Erlang compiler and loaded into the Erlang runtime system. There is now an API for -encode/2 and decode/2 in module People, which is called like this:

    'People':encode(<Type name>, <Value>)

    or:

    'People':decode(<Type name>, <Value>)

    Assume that there is a network application that receives instances of the ASN.1 +encode/2 and decode/2 in module People, which is called like this:

    'People':encode(<Type name>, <Value>)

    or:

    'People':decode(<Type name>, <Value>)

    Assume that there is a network application that receives instances of the ASN.1 defined type Person, modifies, and sends them back again:

    receive
    -   {Port,{data,Bytes}} ->
    -       case 'People':decode('Person',Bytes) of
    -           {ok,P} ->
    -               {ok,Answer} = 'People':encode('Person',mk_answer(P)),
    -               Port ! {self(),{command,Answer}};
    -           {error,Reason} ->
    -               exit({error,Reason})
    +   {Port,{data,Bytes}} ->
    +       case 'People':decode('Person',Bytes) of
    +           {ok,P} ->
    +               {ok,Answer} = 'People':encode('Person',mk_answer(P)),
    +               Port ! {self(),{command,Answer}};
    +           {error,Reason} ->
    +               exit({error,Reason})
            end
         end,

    In this example, a series of bytes is received from an external source and the bytes are then decoded into a valid Erlang term. This was achieved with the call 'People':decode('Person',Bytes), which returned an Erlang value of the ASN.1 type Person. Then an answer was constructed and encoded using 'People':encode('Person',Answer), which takes an instance of a defined ASN.1 -type and transforms it to a binary according to the BER or PER encoding rules.

    The encoder and decoder can also be run from the shell:

    2> Rockstar = {'Person',"Some Name",roving,50}.
    -{'Person',"Some Name",roving,50}
    -3> {ok,Bin} = 'People':encode('Person',Rockstar).
    -{ok,<<243,17,19,9,83,111,109,101,32,78,97,109,101,2,1,2,
    -      2,1,50>>}
    -4> {ok,Person} = 'People':decode('Person',Bin).
    -{ok,{'Person',"Some Name",roving,50}}

    +type and transforms it to a binary according to the BER or PER encoding rules.

    The encoder and decoder can also be run from the shell:

    2> Rockstar = {'Person',"Some Name",roving,50}.
    +{'Person',"Some Name",roving,50}
    +3> {ok,Bin} = 'People':encode('Person',Rockstar).
    +{ok,<<243,17,19,9,83,111,109,101,32,78,97,109,101,2,1,2,
    +      2,1,50>>}
    +4> {ok,Person} = 'People':decode('Person',Bin).
    +{ok,{'Person',"Some Name",roving,50}}

    @@ -271,16 +271,16 @@ to manually add tags to certain constructs in order for the ASN.1 specification to be valid. Example of an old-style specification:

    Tags DEFINITIONS ::=
     BEGIN
    -  Afters ::= CHOICE { cheese [0] IA5String,
    -                      dessert [1] IA5String }
    +  Afters ::= CHOICE { cheese [0] IA5String,
    +                      dessert [1] IA5String }
     END

    Without the tags (the numbers in square brackets) the ASN.1 compiler refused to compile the file.

    In 1994 the global tagging mode AUTOMATIC TAGS was introduced. By putting AUTOMATIC TAGS in the module header, the ASN.1 compiler automatically adds tags when needed. The following is the same specification in AUTOMATIC TAGS mode:

    Tags DEFINITIONS AUTOMATIC TAGS ::=
     BEGIN
    -  Afters ::= CHOICE { cheese IA5String,
    -                      dessert IA5String }
    +  Afters ::= CHOICE { cheese IA5String,
    +                      dessert IA5String }
     END

    @@ -291,7 +291,7 @@ and how values are assigned in Erlang.

    ASN.1 has both primitive and constructed types:

    Primitive TypesConstructed Types
    BOOLEANSEQUENCE
    INTEGERSET
    REALCHOICE
    NULLSET OF and SEQUENCE OF
    ENUMERATEDANY
    BIT STRINGANY DEFINED BY
    OCTET STRINGEXTERNAL
    Character StringsEMBEDDED PDV
    OBJECT IDENTIFIERCHARACTER STRING
    Object Descriptor
    TIME Types

    Table: Supported ASN.1 Types

    Note

    The values of each ASN.1 type have their own representation in Erlang, as described in the following sections. Users must provide these values for encoding according to the representation, as shown in the following example:

    Operational ::= BOOLEAN --ASN.1 definition

    In Erlang code it can look as follows:

    Val = true,
    -{ok,Bytes} = MyModule:encode(&#href_anchor"p">, Val),

    +{ok,Bytes} = MyModule:encode(&#href_anchor"p">, Val),

    @@ -308,11 +308,11 @@

    An ASN.1 INTEGER is represented by an integer in Erlang.

    The concept of subtyping can be applied to integers and to other ASN.1 types. The details of subtyping are not explained here; for more information, see X.680. Various syntaxes are allowed when defining a type as an integer:

    T1 ::= INTEGER
    -T2 ::= INTEGER (-2..7)
    -T3 ::= INTEGER (0..MAX)
    -T4 ::= INTEGER (0<..MAX)
    -T5 ::= INTEGER (MIN<..-99)
    -T6 ::= INTEGER {red(0),blue(1),white(2)}

    The Erlang representation of an ASN.1 INTEGER is an integer or an atom if a +T2 ::= INTEGER (-2..7) +T3 ::= INTEGER (0..MAX) +T4 ::= INTEGER (0<..MAX) +T5 ::= INTEGER (MIN<..-99) +T6 ::= INTEGER {red(0),blue(1),white(2)}

    The Erlang representation of an ASN.1 INTEGER is an integer or an atom if a Named Number List (see T6 in the previous list) is specified.

    The following is an example of Erlang code that assigns values for the types in the previous list:

    T1value = 0,
     T2value = 6,
    @@ -359,7 +359,7 @@
     

    The type BIT STRING can be used to model information that is made up of arbitrary length series of bits. It is intended to be used for selection of flags, not for binary files.

    In ASN.1, BIT STRING definitions can look as follows:

    Bits1 ::= BIT STRING
    -Bits2 ::= BIT STRING {foo(0),bar(1),gnu(2),gnome(3),punk(14)}

    The following two notations are available for representation of BIT STRING +Bits2 ::= BIT STRING {foo(0),bar(1),gnu(2),gnome(3),punk(14)}

    The following two notations are available for representation of BIT STRING values in Erlang and as input to the encode functions:

    1. A bitstring. By default, a BIT STRING with no symbolic names is decoded to an Erlang bitstring.
    2. A list of atoms corresponding to atoms in the NamedBitList in the BIT STRING definition. A BIT STRING with symbolic names is always decoded @@ -387,7 +387,7 @@

      OCTET STRING is the simplest of all ASN.1 types. OCTET STRING only moves or transfers, for example, binary files or other unstructured information complying with two rules: the bytes consist of octets and encoding is not required.

      It is possible to have the following ASN.1 type definitions:

      O1 ::= OCTET STRING
      -O2 ::= OCTET STRING (SIZE(28))

      With the following example assignments in Erlang:

      O1Val = <<17,13,19,20,0,0,255,254>>,
      +O2 ::= OCTET STRING (SIZE(28))

      With the following example assignments in Erlang:

      O1Val = <<17,13,19,20,0,0,255,254>>,
       O2Val = <<"must be exactly 28 chars....">>,

      By default, an OCTET STRING is always represented as an Erlang binary. If the specification has been compiled with option legacy_erlang_types, the encode functions accept both lists and binaries, and the decode functions decode an @@ -408,11 +408,11 @@ of view, octets are very similar to character strings and are compiled in the same way.

      When PER is used, there is a significant difference in the encoding scheme for OCTET STRINGs and other strings. The constraints specified for a type -are especially important for PER, because they affect the encoding.

      Examples:

      Digs ::= NumericString (SIZE(1..3))
      -TextFile ::= IA5String (SIZE(0..64000))

      The corresponding Erlang assignments:

      DigsVal1 = "456",
      +are especially important for PER, because they affect the encoding.

      Examples:

      Digs ::= NumericString (SIZE(1..3))
      +TextFile ::= IA5String (SIZE(0..64000))

      The corresponding Erlang assignments:

      DigsVal1 = "456",
       DigsVal2 = "123",
       TextFileVal1 = "abc...xyz...",
      -TextFileVal2 = [88,76,55,44,99,121 .......... a lot of characters here ....]

      The Erlang representation for BMPString and UniversalString is either a list +TextFileVal2 = [88,76,55,44,99,121 .......... a lot of characters here ....]

      The Erlang representation for BMPString and UniversalString is either a list of ASCII values or a list of quadruples. The quadruple representation associates to the Unicode standard representation of characters. The ASCII characters are all represented by quadruples beginning with three zeros like {0,0,0,65} for @@ -421,26 +421,26 @@ in file PrimStrings.asn1:

      PrimStrings DEFINITIONS AUTOMATIC TAGS ::=
       BEGIN
          BMP ::= BMPString
      -END

      Encoding and decoding some strings:

      1> asn1ct:compile('PrimStrings', [ber]).
      +END

      Encoding and decoding some strings:

      1> asn1ct:compile('PrimStrings', [ber]).
       ok
      -2> {ok,Bytes1} = 'PrimStrings':encode('BMP', [{0,0,53,53},{0,0,45,56}]).
      -{ok,<<30,4,53,54,45,56>>}
      -3> 'PrimStrings':decode('BMP', Bytes1).
      -{ok,[{0,0,53,53},{0,0,45,56}]}
      -4> {ok,Bytes2} = 'PrimStrings':encode('BMP', [{0,0,53,53},{0,0,0,65}]).
      -{ok,<<30,4,53,53,0,65>>}
      -5> 'PrimStrings':decode('BMP', Bytes2).
      -{ok,[{0,0,53,53},65]}
      -6> {ok,Bytes3} = 'PrimStrings':encode('BMP', "BMP string").
      -{ok,<<30,20,0,66,0,77,0,80,0,32,0,115,0,116,0,114,0,105,0,110,0,103>>}
      -7> 'PrimStrings':decode('BMP', Bytes3).
      -{ok,"BMP string"}

      Type UTF8String is represented as a UTF-8 encoded binary in Erlang. Such +2> {ok,Bytes1} = 'PrimStrings':encode('BMP', [{0,0,53,53},{0,0,45,56}]). +{ok,<<30,4,53,54,45,56>>} +3> 'PrimStrings':decode('BMP', Bytes1). +{ok,[{0,0,53,53},{0,0,45,56}]} +4> {ok,Bytes2} = 'PrimStrings':encode('BMP', [{0,0,53,53},{0,0,0,65}]). +{ok,<<30,4,53,53,0,65>>} +5> 'PrimStrings':decode('BMP', Bytes2). +{ok,[{0,0,53,53},65]} +6> {ok,Bytes3} = 'PrimStrings':encode('BMP', "BMP string"). +{ok,<<30,20,0,66,0,77,0,80,0,32,0,115,0,116,0,114,0,105,0,110,0,103>>} +7> 'PrimStrings':decode('BMP', Bytes3). +{ok,"BMP string"}

    Type UTF8String is represented as a UTF-8 encoded binary in Erlang. Such binaries can be created directly using the binary syntax or by converting from a list of Unicode code points using function unicode:characters_to_binary/1.

    The following shows examples of how UTF-8 encoded binaries can be created and manipulated:

    1> Gs = "Мой маленький Гном".
    -[1052,1086,1081,32,1084,1072,1083,1077,1085,1100,1082,1080,
    - 1081,32,1043,1085,1086,1084]
    -2> Gbin = unicode:characters_to_binary(Gs).
    +[1052,1086,1081,32,1084,1072,1083,1077,1085,1100,1082,1080,
    + 1081,32,1043,1085,1086,1084]
    +2> Gbin = unicode:characters_to_binary(Gs).
     <<208,156,208,190,208,185,32,208,188,208,176,208,187,208,
       181,208,189,209,140,208,186,208,184,208,185,32,208,147,
       208,...>>
    @@ -448,22 +448,22 @@
     <<208,156,208,190,208,185,32,208,188,208,176,208,187,208,
       181,208,189,209,140,208,186,208,184,208,185,32,208,147,
       208,...>>
    -4> Gs = unicode:characters_to_list(Gbin).
    -[1052,1086,1081,32,1084,1072,1083,1077,1085,1100,1082,1080,
    - 1081,32,1043,1085,1086,1084]

    For details, see the unicode module in STDLIB.

    In the following example, this ASN.1 specification is used:

    UTF DEFINITIONS AUTOMATIC TAGS ::=
    +4> Gs = unicode:characters_to_list(Gbin).
    +[1052,1086,1081,32,1084,1072,1083,1077,1085,1100,1082,1080,
    + 1081,32,1043,1085,1086,1084]

    For details, see the unicode module in STDLIB.

    In the following example, this ASN.1 specification is used:

    UTF DEFINITIONS AUTOMATIC TAGS ::=
     BEGIN
        UTF ::= UTF8String
    -END

    Encoding and decoding a string with Unicode characters:

    5> asn1ct:compile(&#href_anchor"p">, [ber]).
    +END

    Encoding and decoding a string with Unicode characters:

    5> asn1ct:compile(&#href_anchor"p">, [ber]).
     ok
    -6> {ok,Bytes1} = 'UTF':encode('UTF', <<"Гном"/utf8>>).
    -{ok,<<12,8,208,147,208,189,208,190,208,188>>}
    /usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1_introduction.html differs (HTML document, Unicode text, UTF-8 text)
    --- old//usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1_introduction.html	2026-06-04 19:05:03.164457011 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1_introduction.html	2026-06-04 19:05:03.164457011 +0000
    @@ -203,7 +203,7 @@
               Erlang programming language
     
           

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1_overview.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1_overview.html 2026-06-04 19:05:03.180457159 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1_overview.html 2026-06-04 19:05:03.181457168 +0000 @@ -190,7 +190,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1_spec.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (955)) --- old//usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1_spec.html 2026-06-04 19:05:03.203457373 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1_spec.html 2026-06-04 19:05:03.203457373 +0000 @@ -165,37 +165,37 @@ exclusive decode is enabled. This function decodes the parts that were left undecoded during the exclusive decode.

    Both functions are described in the following.

    If the exclusive decode function has, for example, the name decode_exclusive and an ASN.1 encoded message Bin is to be exclusive decoded, the call is as -follows:

    {ok,ExclMessage} = 'MyModule':decode_exclusive(Bin)

    The result ExclMessage has the same structure as a +follows:

    {ok,ExclMessage} = 'MyModule':decode_exclusive(Bin)

    The result ExclMessage has the same structure as a complete decode would have, except for the parts of the top type that were not decoded. The undecoded parts are on their places in the structure on format {TypeKey,UndecodedValue}.

    Each undecoded part that is to be decoded must be fed into function -decode_part/2 as follows:

    {ok,PartMessage} = &#href_anchor"p">:decode_part(TypeKey, UndecodedValue)

    +decode_part/2 as follows:

    {ok,PartMessage} = &#href_anchor"p">:decode_part(TypeKey, UndecodedValue)

    Writing an Exclusive Decode Instruction

    -

    This instruction is written in the configuration file in the following format:

    ExclusiveDecodeInstruction = {exclusive_decode,{ModuleName,DecodeInstructions}}.
    +

    This instruction is written in the configuration file in the following format:

    ExclusiveDecodeInstruction = {exclusive_decode,{ModuleName,DecodeInstructions}}.
     
    -ModuleName = atom()
    +ModuleName = atom()
     
    -DecodeInstructions = [DecodeInstruction]+
    +DecodeInstructions = [DecodeInstruction]+
     
    -DecodeInstruction = {ExclusiveDecodeFunctionName,TypeList}
    +DecodeInstruction = {ExclusiveDecodeFunctionName,TypeList}
     
    -ExclusiveDecodeFunctionName = atom()
    +ExclusiveDecodeFunctionName = atom()
     
    -TypeList = [TopType,ElementList]
    +TypeList = [TopType,ElementList]
     
    -ElementList = [Element]+
    +ElementList = [Element]+
     
    -Element = {Name,parts} |
    -          {Name,undecoded} |
    -          {Name,ElementList}
    +Element = {Name,parts} |
    +          {Name,undecoded} |
    +          {Name,ElementList}
     
    -TopType = atom()
    +TopType = atom()
     
    -Name = atom()

    The instruction must be a valid Erlang term terminated by a dot.

    In TypeList the path from the top type to each undecoded subcomponent is +Name = atom()

    The instruction must be a valid Erlang term terminated by a dot.

    In TypeList the path from the top type to each undecoded subcomponent is described. TopType is the name of a top-level type in the ASN.1 specification. The action for each component in ElementList is described by one of:

    • {Name,parts}
    • {Name,undecoded}
    • {Name,ElementList}

    The use and effect of the actions are as follows:

    • {Name,undecoded} - Leaves the element undecoded. The type of Name can be any ASN.1 type. The value of element Name is returned as a tuple (as @@ -261,78 +261,78 @@ ['Button',[{number,undecoded}]]}]}}.

    The following figure shows the bytes of a Window:status message. The components buttonList and actions are excluded from decode. Only state and enabled are decoded when decode__Window_exclusive is called.

    Bytes of a Window:status Message

    Here follows an example of how the module. Note that option no_ok_wrapper is -used to make the example more concise.

    1> asn1ct:compile('GUI', [ber,asn1config,no_ok_wrapper]).
    +used to make the example more concise.

    1> asn1ct:compile('GUI', [ber,asn1config,no_ok_wrapper]).
     ok
    -2> rr('GUI').
    -['Action','Button','Status']
    -3> ButtonMsg = #'Button'{number=123,on=true}.
    -#'Button'{number = 123,on = true}
    -4> ButtonBytes = 'GUI':encode('Button', ButtonMsg).
    +2> rr('GUI').
    +['Action','Button','Status']
    +3> ButtonMsg = #'Button'{number=123,on=true}.
    +#'Button'{number = 123,on = true}
    +4> ButtonBytes = 'GUI':encode('Button', ButtonMsg).
     <<48,6,128,1,123,129,1,255>>
    -5> ExclusiveMsgButton = 'GUI':decode_Button_exclusive(ButtonBytes).
    -#'Button'{number = {'Button_number',<<128,1,123>>},
    -          on = true}
    -6> {UndecKey,UndecBytes} = ExclusiveMsgButton#'Button'.number.
    -{'Button_number',<<128,1,123>>}
    -7> 'GUI':decode_part(UndecKey, UndecBytes).
    +5> ExclusiveMsgButton = 'GUI':decode_Button_exclusive(ButtonBytes).
    +#'Button'{number = {'Button_number',<<128,1,123>>},
    +          on = true}
    +6> {UndecKey,UndecBytes} = ExclusiveMsgButton#'Button'.number.
    +{'Button_number',<<128,1,123>>}
    +7> 'GUI':decode_part(UndecKey, UndecBytes).
     123
     8> WindowMsg =
    -{status,{'Status',35,
    -   [{'Button',3,true},
    -    {'Button',4,false},
    -    {'Button',5,true},
    -    {'Button',6,true},
    -    {'Button',7,false}],
    +{status,{'Status',35,
    +   [{'Button',3,true},
    +    {'Button',4,false},
    +    {'Button',5,true},
    +    {'Button',6,true},
    +    {'Button',7,false}],
        false,
    -   {possibleActions,[{'Action',16,{'Button',17,true}}]}}}.
    -{status,#'Status'{state = 35,
    -        buttonList = [#'Button'{number = 3,on = true},
    -                      #'Button'{number = 4,on = false},
    -                      #'Button'{number = 5,on = true},
    -                      #'Button'{number = 6,on = true},
    -                      #'Button'{number = 7,on = false}],
    +   {possibleActions,[{'Action',16,{'Button',17,true}}]}}}.
    +{status,#'Status'{state = 35,
    +        buttonList = [#'Button'{number = 3,on = true},
    +                      #'Button'{number = 4,on = false},
    +                      #'Button'{number = 5,on = true},
    +                      #'Button'{number = 6,on = true},
    +                      #'Button'{number = 7,on = false}],
             enabled = false,
    -        actions = {possibleActions,[#'Action'{number = 16,
    -                                              handle = #'Button'{number = 17,on = true}}]}}}
    -9> WindowBytes = 'GUI':encode('Window', WindowMsg).
    +        actions = {possibleActions,[#'Action'{number = 16,
    +                                              handle = #'Button'{number = 17,on = true}}]}}}
    +9> WindowBytes = 'GUI':encode('Window', WindowMsg).
     <<161,65,128,1,35,161,40,48,6,128,1,3,129,1,255,48,6,128,
       1,4,129,1,0,48,6,128,1,5,129,...>>
    -10> {status,#'Status'{buttonList={UndecWindowKey,UndecWindowParts}}} =
    -'GUI':decode_Window_exclusive(WindowBytes).
    -{status,#'Status'{state = 35,
    -                  buttonList = {'Status_buttonList',[<<48,6,128,1,3,129,1,
    +10> {status,#'Status'{buttonList={UndecWindowKey,UndecWindowParts}}} =
    +'GUI':decode_Window_exclusive(WindowBytes).
    +{status,#'Status'{state = 35,
    +                  buttonList = {'Status_buttonList',[<<48,6,128,1,3,129,1,
                                                            255>>,
                                                          <<48,6,128,1,4,129,1,0>>,
                                                          <<48,6,128,1,5,129,1,255>>,
                                                          <<48,6,128,1,6,129,1,255>>,
    -                                                     <<48,6,128,1,7,129,1,0>>]},
    +                                                     <<48,6,128,1,7,129,1,0>>]},
                       enabled = false,
    -                  actions = {'Status_actions',<<163,15,160,13,48,11,128,
    +                  actions = {'Status_actions',<<163,15,160,13,48,11,128,
                                                     1,16,161,6,128,1,17,129,
    -                                                1,255>>}}}
    -11> 'GUI':decode_part(UndecWindowKey, UndecWindowParts).
    -[#'Button'{number = 3,on = true},
    - #'Button'{number = 4,on = false},
    - #'Button'{number = 5,on = true},
    - #'Button'{number = 6,on = true},
    - #'Button'{number = 7,on = false}]
    -12> 'GUI':decode_part(UndecWindowKey, hd(UndecWindowParts)).
    -#'Button'{number = 3,on = true}
    -13> {status,#'Status'{actions={ChoiceKey,ChoiceUndec}}} = v(10).
    -{status,#'Status'{state = 35,
    -                  buttonList = {'Status_buttonList',[<<48,6,128,1,3,129,1,
    +                                                1,255>>}}}
    +11> 'GUI':decode_part(UndecWindowKey, UndecWindowParts).
    +[#'Button'{number = 3,on = true},
    + #'Button'{number = 4,on = false},
    + #'Button'{number = 5,on = true},
    + #'Button'{number = 6,on = true},
    + #'Button'{number = 7,on = false}]
    +12> 'GUI':decode_part(UndecWindowKey, hd(UndecWindowParts)).
    +#'Button'{number = 3,on = true}
    +13> {status,#'Status'{actions={ChoiceKey,ChoiceUndec}}} = v(10).
    +{status,#'Status'{state = 35,
    +                  buttonList = {'Status_buttonList',[<<48,6,128,1,3,129,1,
                                                            255>>,
                                                          <<48,6,128,1,4,129,1,0>>,
                                                          <<48,6,128,1,5,129,1,255>>,
                                                          <<48,6,128,1,6,129,1,255>>,
    -                                                     <<48,6,128,1,7,129,1,0>>]},
    +                                                     <<48,6,128,1,7,129,1,0>>]},
                       enabled = false,
    -                  actions = {'Status_actions',<<163,15,160,13,48,11,128,
    +                  actions = {'Status_actions',<<163,15,160,13,48,11,128,
                                                     1,16,161,6,128,1,17,129,
    -                                                1,255>>}}}
    -14> 'GUI':decode_part(ChoiceKey, ChoiceUndec).
    -{possibleActions,[#'Action'{number = 16,
    -                            handle = #'Button'{number = 17,on = true}}]}

    + 1,255>>}}} +14> 'GUI':decode_part(ChoiceKey, ChoiceUndec). +{possibleActions,[#'Action'{number = 16, + handle = #'Button'{number = 17,on = true}}]}

    @@ -369,23 +369,23 @@ Writing a Selective Decode Instruction

    One or more selective decode functions can be described in a configuration file. -Use the following notation:

    SelectiveDecodeInstruction = {selective_decode,{ModuleName,DecodeInstructions}}.
    +Use the following notation:

    SelectiveDecodeInstruction = {selective_decode,{ModuleName,DecodeInstructions}}.
     
    -ModuleName = atom()
    +ModuleName = atom()
     
    -DecodeInstructions = [DecodeInstruction]+
    +DecodeInstructions = [DecodeInstruction]+
     
    -DecodeInstruction = {SelectiveDecodeFunctionName,TypeList}
    +DecodeInstruction = {SelectiveDecodeFunctionName,TypeList}
    /usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1ct.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1307))
    --- old//usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1ct.html	2026-06-04 19:05:03.226457586 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/asn1ct.html	2026-06-04 19:05:03.226457586 +0000
    @@ -495,9 +495,9 @@
     mostly work for old specifications based on the 1997 standard for ASN.1, but
     not for most modern-style applications. Another limitation is that the test
     functions may not work if options that change code generations strategies such
    -as the options macro_name_prefix and record_name_prefix have been used.

    • test/1 iterates over all types in Module.
    • test/2 tests type Type with a random value.
    • test/3 tests type Type with Value.

    Schematically, the following occurs for each type in the module:

    {ok, Value} = asn1ct:value(Module, Type),
    -{ok, Bytes} = Module:encode(Type, Value),
    -{ok, Value} = Module:decode(Type, Bytes).

    The test functions use the *.asn1db files for all included modules. If they +as the options macro_name_prefix and record_name_prefix have been used.

    • test/1 iterates over all types in Module.
    • test/2 tests type Type with a random value.
    • test/3 tests type Type with Value.

    Schematically, the following occurs for each type in the module:

    {ok, Value} = asn1ct:value(Module, Type),
    +{ok, Bytes} = Module:encode(Type, Value),
    +{ok, Value} = Module:decode(Type, Bytes).

    The test functions use the *.asn1db files for all included modules. If they are located in a different directory than the current working directory, use the include option to add paths. This is only needed when automatically generating values. For static values using Value no options are needed.

    @@ -564,7 +564,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/notes.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (831)) --- old//usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/notes.html 2026-06-04 19:05:03.252457827 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/notes.html 2026-06-04 19:05:03.252457827 +0000 @@ -1557,7 +1557,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/search.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/search.html 2026-06-04 19:05:03.268549037 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/asn1-5.3.1/doc/html/search.html 2026-06-04 19:05:03.267457966 +0000 @@ -145,7 +145,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/404.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/404.html 2026-06-04 19:05:03.283594192 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/404.html 2026-06-04 19:05:03.283594192 +0000 @@ -147,7 +147,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/api-reference.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/api-reference.html 2026-06-04 19:05:03.300458272 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/api-reference.html 2026-06-04 19:05:03.300458272 +0000 @@ -315,7 +315,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/basics_chapter.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (650)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/basics_chapter.html 2026-06-04 19:05:03.315458411 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/basics_chapter.html 2026-06-04 19:05:03.315458411 +0000 @@ -215,15 +215,15 @@ the reason for termination is. If you use Erlang pattern matching effectively, you can take advantage of this property. The result is concise and readable test case functions that look much more like scripts than actual programs. A simple -example:

    session(_Config) ->
    -    {started,ServerId} = my_server:start(),
    -    {clients,[]} = my_server:get_clients(ServerId),
    -    MyId = self(),
    -    connected = my_server:connect(ServerId, MyId),
    -    {clients,[MyId]} = my_server:get_clients(ServerId),
    -    disconnected = my_server:disconnect(ServerId, MyId),
    -    {clients,[]} = my_server:get_clients(ServerId),
    -    stopped = my_server:stop(ServerId).

    As a test suite runs, all information (including output to stdout) is recorded +example:

    session(_Config) ->
    +    {started,ServerId} = my_server:start(),
    +    {clients,[]} = my_server:get_clients(ServerId),
    +    MyId = self(),
    +    connected = my_server:connect(ServerId, MyId),
    +    {clients,[MyId]} = my_server:get_clients(ServerId),
    +    disconnected = my_server:disconnect(ServerId, MyId),
    +    {clients,[]} = my_server:get_clients(ServerId),
    +    stopped = my_server:stop(ServerId).

    As a test suite runs, all information (including output to stdout) is recorded in many different log files. A minimum of information is displayed in the user console (only start and stop information, plus a note for each failed test case).

    The result from each test case is recorded in a dedicated HTML log file, created @@ -303,7 +303,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/basics_chapter.xhtml differs (HTML document, ASCII text, with very long lines (650)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/basics_chapter.xhtml 2026-06-04 00:07:31.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/basics_chapter.xhtml 2042-07-06 13:26:59.000000000 +0000 @@ -110,15 +110,15 @@ the reason for termination is. If you use Erlang pattern matching effectively, you can take advantage of this property. The result is concise and readable test case functions that look much more like scripts than actual programs. A simple -example:

    session(_Config) ->
    -    {started,ServerId} = my_server:start(),
    -    {clients,[]} = my_server:get_clients(ServerId),
    -    MyId = self(),
    -    connected = my_server:connect(ServerId, MyId),
    -    {clients,[MyId]} = my_server:get_clients(ServerId),
    -    disconnected = my_server:disconnect(ServerId, MyId),
    -    {clients,[]} = my_server:get_clients(ServerId),
    -    stopped = my_server:stop(ServerId).

    As a test suite runs, all information (including output to stdout) is recorded +example:

    session(_Config) ->
    +    {started,ServerId} = my_server:start(),
    +    {clients,[]} = my_server:get_clients(ServerId),
    +    MyId = self(),
    +    connected = my_server:connect(ServerId, MyId),
    +    {clients,[MyId]} = my_server:get_clients(ServerId),
    +    disconnected = my_server:disconnect(ServerId, MyId),
    +    {clients,[]} = my_server:get_clients(ServerId),
    +    stopped = my_server:stop(ServerId).

    As a test suite runs, all information (including output to stdout) is recorded in many different log files. A minimum of information is displayed in the user console (only start and stop information, plus a note for each failed test case).

    The result from each test case is recorded in a dedicated HTML log file, created /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/config_file_chapter.xhtml differs (HTML document, ASCII text, with very long lines (1269)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/config_file_chapter.xhtml 2026-06-04 00:07:31.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/config_file_chapter.xhtml 2042-07-06 13:26:59.000000000 +0000 @@ -37,8 +37,8 @@ Syntax -

    A configuration file can contain any number of elements of the type:

    {CfgVarName,Value}.

    where

    CfgVarName = atom()
    -Value = term() | [{CfgVarName,Value}]

    +

    A configuration file can contain any number of elements of the type:

    {CfgVarName,Value}.

    where

    CfgVarName = atom()
    +Value = term() | [{CfgVarName,Value}]

    @@ -65,13 +65,13 @@ any number of alias names, but each name must be unique within the same test suite. The two main uses for alias names follows:

    • To identify connections (described later).
    • To help adapt configuration data to a test suite (or test case) and improve readability.

    To read the value of a configuration variable, use function -get_config/1,2,3.

    Example:

    suite() ->
    -    [{require, domain, 'CONN_SPEC_DNS_SUFFIX'}].
    +get_config/1,2,3.

    Example:

    suite() ->
    +    [{require, domain, 'CONN_SPEC_DNS_SUFFIX'}].
     
     ...
     
    -testcase(Config) ->
    -    Domain = ct:get_config(domain),
    +testcase(Config) ->
    +    Domain = ct:get_config(domain),
         ...

    @@ -156,11 +156,11 @@ </ftp_host> <lm_directory>"/test/loadmodules"</lm_directory> </config>

    Once read, this file produces the same configuration variables as the following -text file:

    {ftp_host, [{ftp,"targethost"},
    -            {username,"tester"},
    -            {password,"letmein"}]}.
    +text file:

    {ftp_host, [{ftp,"targethost"},
    +            {username,"tester"},
    +            {password,"letmein"}]}.
     
    -{lm_directory, "/test/loadmodules"}.

    +{lm_directory, "/test/loadmodules"}.

    @@ -179,55 +179,55 @@ data being reloaded during test execution. The input argument is the same as for function check_parameter/1.

    The return value is to be either of the following:

    • {ok, Config} - if the configuration variables are read successfully.
    • {error, {Error, ErrorDetails}} - if the callback module fails to proceed with the specified configuration parameters.

    Config is the proper Erlang key-value list, with possible key-value sublists -as values, like the earlier configuration file example:

    [{ftp_host, [{ftp, "targethost"}, {username, "tester"}, {password, "letmein"}]},
    - {lm_directory, "/test/loadmodules"}]

    +as values, like the earlier configuration file example:

    [{ftp_host, [{ftp, "targethost"}, {username, "tester"}, {password, "letmein"}]},
    + {lm_directory, "/test/loadmodules"}]

    Examples of Configuration Data Handling

    A configuration file for using the FTP client to access files on a remote host -can look as follows:

    {ftp_host, [{ftp,"targethost"},
    -            {username,"tester"},
    -            {password,"letmein"}]}.
    +can look as follows:

    {ftp_host, [{ftp,"targethost"},
    +            {username,"tester"},
    +            {password,"letmein"}]}.
     
    -{lm_directory, "/test/loadmodules"}.

    The XML version shown earlier can also be used, but it is to be explicitly +{lm_directory, "/test/loadmodules"}.

    The XML version shown earlier can also be used, but it is to be explicitly specified that the ct_config_xml callback module is to be used by Common Test.

    The following is an example of how to assert that the configuration data is -available and can be used for an FTP session:

    init_per_testcase(ftptest, Config) ->
    -    {ok,_} = ct_ftp:open(ftp),
    +available and can be used for an FTP session:

    init_per_testcase(ftptest, Config) ->
    +    {ok,_} = ct_ftp:open(ftp),
         Config.
     
    -end_per_testcase(ftptest, _Config) ->
    -    ct_ftp:close(ftp).
    +end_per_testcase(ftptest, _Config) ->
    +    ct_ftp:close(ftp).
     
    -ftptest() ->
    -    [{require,ftp,ftp_host},
    -     {require,lm_directory}].
    -
    -ftptest(Config) ->
    -    Remote = filename:join(ct:get_config(lm_directory), "loadmodX"),
    -    Local = filename:join(proplists:get_value(priv_dir,Config), "loadmodule"),
    -    ok = ct_ftp:recv(ftp, Remote, Local),
    +ftptest() ->
    +    [{require,ftp,ftp_host},
    +     {require,lm_directory}].
    +
    +ftptest(Config) ->
    +    Remote = filename:join(ct:get_config(lm_directory), "loadmodX"),
    +    Local = filename:join(proplists:get_value(priv_dir,Config), "loadmodule"),
    +    ok = ct_ftp:recv(ftp, Remote, Local),
         ...

    The following is an example of how the functions in the previous example can be -rewritten if it is necessary to open multiple connections to the FTP server:

    init_per_testcase(ftptest, Config) ->
    -    {ok,Handle1} = ct_ftp:open(ftp_host),
    -    {ok,Handle2} = ct_ftp:open(ftp_host),
    -    [{ftp_handles,[Handle1,Handle2]} | Config].
    -
    -end_per_testcase(ftptest, Config) ->
    -    lists:foreach(fun(Handle) -> ct_ftp:close(Handle) end,
    -                  proplists:get_value(ftp_handles,Config)).
    -
    -ftptest() ->
    -    [{require,ftp_host},
    -     {require,lm_directory}].
    -
    -ftptest(Config) ->
    -    Remote = filename:join(ct:get_config(lm_directory), "loadmodX"),
    -    Local = filename:join(proplists:get_value(priv_dir,Config), "loadmodule"),
    -    [Handle | MoreHandles] = proplists:get_value(ftp_handles,Config),
    -    ok = ct_ftp:recv(Handle, Remote, Local),
    +rewritten if it is necessary to open multiple connections to the FTP server:

    init_per_testcase(ftptest, Config) ->
    +    {ok,Handle1} = ct_ftp:open(ftp_host),
    +    {ok,Handle2} = ct_ftp:open(ftp_host),
    +    [{ftp_handles,[Handle1,Handle2]} | Config].
    +
    +end_per_testcase(ftptest, Config) ->
    +    lists:foreach(fun(Handle) -> ct_ftp:close(Handle) end,
    +                  proplists:get_value(ftp_handles,Config)).
    +
    +ftptest() ->
    +    [{require,ftp_host},
    +     {require,lm_directory}].
    +
    +ftptest(Config) ->
    +    Remote = filename:join(ct:get_config(lm_directory), "loadmodX"),
    +    Local = filename:join(proplists:get_value(priv_dir,Config), "loadmodule"),
    +    [Handle | MoreHandles] = proplists:get_value(ftp_handles,Config),
    +    ok = ct_ftp:recv(Handle, Remote, Local),
         ...

    @@ -235,86 +235,86 @@ Example of User-Specific Configuration Handler

    A simple configuration handling driver, asking an external server for -configuration data, can be implemented as follows:

    -module(config_driver).
    --export([read_config/1, check_parameter/1]).
    +configuration data, can be implemented as follows:

    -module(config_driver).
    +-export([read_config/1, check_parameter/1]).
     
    -read_config(ServerName)->
    -    ServerModule = list_to_atom(ServerName),
    -    ServerModule:start(),
    -    ServerModule:get_config().
    -
    -check_parameter(ServerName)->
    -    ServerModule = list_to_atom(ServerName),
    -    case code:is_loaded(ServerModule) of
    -        {file, _}->
    -            {ok, {config, ServerName}};
    +read_config(ServerName)->
    +    ServerModule = list_to_atom(ServerName),
    +    ServerModule:start(),
    +    ServerModule:get_config().
    +
    +check_parameter(ServerName)->
    +    ServerModule = list_to_atom(ServerName),
    +    case code:is_loaded(ServerModule) of
    +        {file, _}->
    +            {ok, {config, ServerName}};
             false->
    -            case code:load_file(ServerModule) of
    -                {module, ServerModule}->
    -                    {ok, {config, ServerName}};
    -                {error, nofile}->
    -                    {error, {wrong_config, "File not found: " ++ ServerName ++ ".beam"}}
    +            case code:load_file(ServerModule) of
    +                {module, ServerModule}->
    +                    {ok, {config, ServerName}};
    +                {error, nofile}->
    +                    {error, {wrong_config, "File not found: " ++ ServerName ++ ".beam"}}
                 end
         end.

    The configuration string for this driver can be config_server, if the config_server.erl module that follows is compiled and exists in the code path -during test execution:

    -module(config_server).
    --export([start/0, stop/0, init/1, get_config/0, loop/0]).
    +during test execution:

    -module(config_server).
    +-export([start/0, stop/0, init/1, get_config/0, loop/0]).
     
    --define(REGISTERED_NAME, ct_test_config_server).
    +-define(REGISTERED_NAME, ct_test_config_server).
     
    -start()->
    -    case whereis(?REGISTERED_NAME) of
    +start()->
    +    case whereis(?REGISTERED_NAME) of
             undefined->
    -            spawn(?MODULE, init, [?REGISTERED_NAME]),
    -            wait();
    +            spawn(?MODULE, init, [?REGISTERED_NAME]),
    +            wait();
             _Pid->
    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/content.opf differs (XML 1.0 document, ASCII text)
    --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/content.opf	2026-06-04 00:07:31.000000000 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/content.opf	2042-07-06 13:26:59.000000000 +0000
    @@ -4,10 +4,10 @@
              version="3.0">
       
         common_test - 1.27.4
    -    urn:uuid:09a21abf-5e10-f261-0a53-9104dc1fafdd
    +    urn:uuid:52531d90-bd53-8f3f-481d-22953d4dc554
         en
     
    -    2026-06-04T00:07:31Z
    +    2042-07-06T13:26:59Z
     
       
       
    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/cover_chapter.xhtml differs (HTML document, ASCII text, with very long lines (1159))
    --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/cover_chapter.xhtml	2026-06-04 00:07:31.000000000 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/cover_chapter.xhtml	2042-07-06 13:26:59.000000000 +0000
    @@ -96,44 +96,44 @@
     

    Here follows the general configuration terms that are allowed in a cover specification file:

    %% List of Nodes on which cover will be active during test.
     %% Nodes = [atom()]
    -{nodes, Nodes}.
    +{nodes, Nodes}.
     
     %% Files with previously exported cover data to include in analysis.
     %% CoverDataFiles = [string()]
    -{import, CoverDataFiles}.
    +{import, CoverDataFiles}.
     
     %% Cover data file to export from this session.
     %% CoverDataFile = string()
    -{export, CoverDataFile}.
    +{export, CoverDataFile}.
     
     %% Cover analysis level.
     %% Level = details | overview
    -{level, Level}.
    +{level, Level}.
     
     %% Directories to include in cover.
     %% Dirs = [string()]
    -{incl_dirs, Dirs}.
    +{incl_dirs, Dirs}.
     
     %% Directories, including subdirectories, to include.
    -{incl_dirs_r, Dirs}.
    +{incl_dirs_r, Dirs}.
     
     %% Specific modules to include in cover.
     %% Mods = [atom()]
    -{incl_mods, Mods}.
    +{incl_mods, Mods}.
     
     %% Directories to exclude in cover.
    -{excl_dirs, Dirs}.
    +{excl_dirs, Dirs}.
     
     %% Directories, including subdirectories, to exclude.
    -{excl_dirs_r, Dirs}.
    +{excl_dirs_r, Dirs}.
     
     %% Specific modules to exclude in cover.
    -{excl_mods, Mods}.
    +{excl_mods, Mods}.
     
     %% Cross cover compilation
     %% Tag = atom(), an identifier for a test run
     %% Mod = [atom()], modules to compile for accumulated analysis
    -{cross,[{Tag,Mods}]}.

    The terms incl_dirs_r and excl_dirs_r tell Common Test to search the +{cross,[{Tag,Mods}]}.

    The terms incl_dirs_r and excl_dirs_r tell Common Test to search the specified directories recursively and include or exclude any module found during the search. The terms incl_dirs and excl_dirs result in a non-recursive search for modules (that is, only modules found in the specified directories are @@ -148,7 +148,7 @@

    When using a cover specification in the testing of an OTP application itself, there is a special incl_app directive that includes the applications modules for -the cover compilation.

    {incl_app, AppName, Cover :: overview | details}.

    Note

    If you desire to also use some other general cover configuration together with +the cover compilation.

    {incl_app, AppName, Cover :: overview | details}.

    Note

    If you desire to also use some other general cover configuration together with this option you should insert the AppName in between the option and its value creating a three tuple.

    @@ -175,7 +175,7 @@ {cross,[{s1,[m1]}]}.

    Then m1 is cover compiled in test run s2, but not shown in the coverage log. Instead, if ct_cover:cross_cover_analyse/2 is called after both s1 and s2 test runs are completed, the accumulated result for m1 is available in the -cross cover log for test run s1.

    The call to the analyze function must be as follows:

    ct_cover:cross_cover_analyse(Level, [{s1,S1LogDir},{s2,S2LogDir}]).

    Here, S1LogDir and S2LogDir are the directories named <TestName>.logs for +cross cover log for test run s1.

    The call to the analyze function must be as follows:

    ct_cover:cross_cover_analyse(Level, [{s1,S1LogDir},{s2,S2LogDir}]).

    Here, S1LogDir and S2LogDir are the directories named <TestName>.logs for each test respectively.

    Notice the tags s1 and s2, which are used in the cover specification file and in the call to ct_cover:cross_cover_analyse/2. The purpose of these is only to map the modules specified in the cover specification to the log /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct_ftp.xhtml differs (HTML document, ASCII text, with very long lines (639)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct_ftp.xhtml 2026-06-04 00:07:31.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct_ftp.xhtml 2042-07-06 13:26:59.000000000 +0000 @@ -468,10 +468,10 @@

    Opens an FTP connection and sends a file to the remote host.

    LocalFile and RemoteFile must be absolute paths.

    If the target host is a "special" node, the FTP address must be specified in the -configuration file as follows:

    {node,[{ftp,IpAddr}]}.

    If the target host is something else, for example, a UNIX host, the -configuration file must also include the username and password (both strings):

    {unix,[{ftp,IpAddr},
    -       {username,Username},
    -       {password,Password}]}.

    See also ct:require/2.

    +configuration file as follows:

    {node,[{ftp,IpAddr}]}.

    If the target host is something else, for example, a UNIX host, the +configuration file must also include the username and password (both strings):

    {unix,[{ftp,IpAddr},
    +       {username,Username},
    +       {password,Password}]}.

    See also ct:require/2.

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct_hooks_chapter.xhtml differs (HTML document, ASCII text, with very long lines (2151)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct_hooks_chapter.xhtml 2026-06-04 00:07:31.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct_hooks_chapter.xhtml 2042-07-06 13:26:59.000000000 +0000 @@ -148,12 +148,12 @@ always a combination of a result for the suite/group/test and an updated CTHState.

    To let the test suite continue on executing, return the configuration list that you want the test to use as the result.

    All pre hooks, except pre_end_per_testcase/4, can skip or fail the test by -returning a tuple with skip or fail, and a reason as the result.

    Example:

    pre_init_per_suite(SuiteName, Config, CTHState) ->
    -  case db:connect() of
    -    {error,_Reason} ->
    -      {{fail, "Could not connect to DB"}, CTHState};
    -    {ok, Handle} ->
    -      {[{db_handle, Handle} | Config], CTHState#state{ handle = Handle }}
    +returning a tuple with skip or fail, and a reason as the result.

    Example:

    pre_init_per_suite(SuiteName, Config, CTHState) ->
    +  case db:connect() of
    +    {error,_Reason} ->
    +      {{fail, "Could not connect to DB"}, CTHState};
    +    {ok, Handle} ->
    +      {[{db_handle, Handle} | Config], CTHState#state{ handle = Handle }}
       end.

    Note

    If you use multiple CTHs, the first part of the return tuple is used as input for the next CTH. So in the previous example the next CTH can get {fail,Reason} as the second parameter. If you have many CTHs interacting, do @@ -175,18 +175,18 @@ affect the outcome of the test, return the Return data as it is given to the CTH. You can also modify the test result. By returning the Config list with element tc_status removed, you can recover from a test failure. As in all the -pre hooks, it is also possible to fail/skip the test case in the post hook.

    Example:

    post_end_per_testcase(_Suite, _TC, Config, {'EXIT',{_,_}}, CTHState) ->
    -  case db:check_consistency() of
    +pre hooks, it is also possible to fail/skip the test case in the post hook.

    Example:

    post_end_per_testcase(_Suite, _TC, Config, {'EXIT',{_,_}}, CTHState) ->
    +  case db:check_consistency() of
         true ->
           %% DB is good, pass the test.
    -      {proplists:delete(tc_status, Config), CTHState};
    +      {proplists:delete(tc_status, Config), CTHState};
         false ->
           %% DB is not good, mark as skipped instead of failing
    -      {{skip, "DB is inconsistent!"}, CTHState}
    +      {{skip, "DB is inconsistent!"}, CTHState}
       end;
    -post_end_per_testcase(_Suite, _TC, Config, Return, CTHState) ->
    +post_end_per_testcase(_Suite, _TC, Config, Return, CTHState) ->
       %% Do nothing if tc does not crash.
    -  {Return, CTHState}.

    Note

    Do recover from a testcase failure using CTHs only a last resort. If used + {Return, CTHState}.

    Note

    Do recover from a testcase failure using CTHs only a last resort. If used wrongly, it can be very difficult to determine which tests that pass or fail in a test run.

    @@ -235,80 +235,80 @@ %%% ct_run -suite example_SUITE -pa . -ct_hooks example_cth %%% %%% Note `-pa .`: the hook beam file must be in the code path when installing. --module(example_cth). +-module(example_cth). %% Mandatory Callbacks --export([init/2]). +-export([init/2]). %% Optional Callbacks --export([id/1]). +-export([id/1]). --export([pre_init_per_suite/3]). --export([post_end_per_suite/4]). +-export([pre_init_per_suite/3]). +-export([post_end_per_suite/4]). --export([pre_init_per_testcase/4]). --export([post_end_per_testcase/5]). +-export([pre_init_per_testcase/4]). +-export([post_end_per_testcase/5]). --export([on_tc_skip/4]). +-export([on_tc_skip/4]). --export([terminate/1]). +-export([terminate/1]). %% This hook state is threaded through all the callbacks. --record(state, {filename, total, suite_total, ts, tcs, data, skipped}). +-record(state, {filename, total, suite_total, ts, tcs, data, skipped}). %% This example hook prints its results to a file, see terminate/1. --record(test_run, {total, skipped, suites}). +-record(test_run, {total, skipped, suites}). %% Return a unique id for this CTH. %% Using the filename means the hook can be used with different %% log files to separate timing data within the same test run. %% See Installing a CTH for more information. -id(Opts) -> +id(Opts) -> %% the path is relative to the test run directory - proplists:get_value(filename, Opts, "example_cth.log"). + proplists:get_value(filename, Opts, "example_cth.log"). %% Always called before any other callback function. Use this to initiate %% any common state. -init(Id, _Opts) -> - {ok, #state{filename = Id, total = 0, data = []}}. +init(Id, _Opts) -> + {ok, #state{filename = Id, total = 0, data = []}}. %% Called before init_per_suite is called. -pre_init_per_suite(_Suite,Config,State) -> - {Config, State#state{suite_total = 0, tcs = []}}. +pre_init_per_suite(_Suite,Config,State) -> + {Config, State#state{suite_total = 0, tcs = []}}. %% Called after end_per_suite. -post_end_per_suite(Suite,_Config,Return,State) -> - Data = {suites, Suite, State#state.suite_total, - lists:reverse(State#state.tcs)}, - {Return, State#state{data = [Data | State#state.data], - total = State#state.total + State#state.suite_total}}. +post_end_per_suite(Suite,_Config,Return,State) -> + Data = {suites, Suite, State#state.suite_total, + lists:reverse(State#state.tcs)}, + {Return, State#state{data = [Data | State#state.data], + total = State#state.total + State#state.suite_total}}. %% Called before each init_per_testcase. -pre_init_per_testcase(_Suite,_TC,Config,State) -> - Now = erlang:monotonic_time(microsecond), - {Config, State#state{ts = Now, suite_total = State#state.suite_total + 1}}. +pre_init_per_testcase(_Suite,_TC,Config,State) -> + Now = erlang:monotonic_time(microsecond), + {Config, State#state{ts = Now, suite_total = State#state.suite_total + 1}}. %% Called after each end_per_testcase. -post_end_per_testcase(Suite,TC,_Config,Return,State) -> - Now = erlang:monotonic_time(microsecond), - TCInfo = {testcase, Suite, TC, Return, Now - State#state.ts}, - {Return, State#state{ts = undefined, tcs = [TCInfo | State#state.tcs]}}. +post_end_per_testcase(Suite,TC,_Config,Return,State) -> + Now = erlang:monotonic_time(microsecond), + TCInfo = {testcase, Suite, TC, Return, Now - State#state.ts}, + {Return, State#state{ts = undefined, tcs = [TCInfo | State#state.tcs]}}. %% Called when a test case is skipped by either user action %% or due to an init function failing. -on_tc_skip(_Suite, _TC, _Reason, State) -> - State#state{skipped = State#state.skipped + 1}. +on_tc_skip(_Suite, _TC, _Reason, State) -> + State#state{skipped = State#state.skipped + 1}. %% Called when the scope of the CTH is done. -terminate(State) -> +terminate(State) -> %% use append to avoid data loss if the path is reused - {ok, File} = file:open(State#state.filename, [write, append]), - io:format(File, "~p.~n", [results(State)]), - file:close(File), + {ok, File} = file:open(State#state.filename, [write, append]), + io:format(File, "~p.~n", [results(State)]), + file:close(File), ok. -results(State) -> - #state{skipped = Skipped, data = Data, total = Total} = State, - #test_run{total = Total, skipped = Skipped, suites = lists:reverse(Data)}.

    +results(State) -> + #state{skipped = Skipped, data = Data, total = Total} = State, + #test_run{total = Total, skipped = Skipped, suites = lists:reverse(Data)}.

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct_master_chapter.xhtml differs (HTML document, ASCII text, with very long lines (1303)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct_master_chapter.xhtml 2026-06-04 00:07:31.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct_master_chapter.xhtml 2042-07-06 13:26:59.000000000 +0000 @@ -51,7 +51,7 @@ of test specifications. If it is a list, the specifications are handled (and the corresponding tests executed) in sequence. An element in a TestSpecs list can also be list of test specifications. The specifications in such a list are -merged into one combined specification before test execution.

    Example:

    ct_master:run(["ts1","ts2",["ts3","ts4"]])

    Here, the tests specified by "ts1" run first, then the tests specified by "ts2", +merged into one combined specification before test execution.

    Example:

    ct_master:run(["ts1","ts2",["ts3","ts4"]])

    Here, the tests specified by "ts1" run first, then the tests specified by "ts2", and finally the tests specified by both "ts3" and "ts4".

    The InclNodes argument to run/3 is a list of node names. Function run/3 runs the tests in TestSpecs just like run/1, but also takes any test in TestSpecs, which is not explicitly tagged with a particular node name, and @@ -91,32 +91,32 @@ install an event handler).

    Consider the example in section Test Specifications in section Running Tests and Analysing Results, now extended with node information and -intended to be executed by Common Test Master:

    {define, 'Top', "/home/test"}.
    -{define, 'T1', "'Top'/t1"}.
    -{define, 'T2', "'Top'/t2"}.
    -{define, 'T3', "'Top'/t3"}.
    -{define, 'CfgFile', "config.cfg"}.
    -{define, 'Node', ct_node}.
    -
    -{node, node1, 'Node@host_x'}.
    -{node, node2, 'Node@host_y'}.
    -
    -{logdir, master, "'Top'/master_logs"}.
    -{logdir, "'Top'/logs"}.
    -
    -{config, node1, "'T1'/'CfgFile'"}.
    -{config, node2, "'T2'/'CfgFile'"}.
    -{config, "'T3'/'CfgFile'"}.
    -
    -{suites, node1, 'T1', all}.
    -{skip_suites, node1, 'T1', [t1B_SUITE,t1D_SUITE], "Not implemented"}.
    -{skip_cases, node1, 'T1', t1A_SUITE, [test3,test4], "Irrelevant"}.
    -{skip_cases, node1, 'T1', t1C_SUITE, [test1], "Ignore"}.
    +intended to be executed by Common Test Master:

    {define, 'Top', "/home/test"}.
    +{define, 'T1', "'Top'/t1"}.
    +{define, 'T2', "'Top'/t2"}.
    +{define, 'T3', "'Top'/t3"}.
    +{define, 'CfgFile', "config.cfg"}.
    +{define, 'Node', ct_node}.
    +
    +{node, node1, 'Node@host_x'}.
    +{node, node2, 'Node@host_y'}.
    +
    +{logdir, master, "'Top'/master_logs"}.
    +{logdir, "'Top'/logs"}.
    +
    +{config, node1, "'T1'/'CfgFile'"}.
    +{config, node2, "'T2'/'CfgFile'"}.
    +{config, "'T3'/'CfgFile'"}.
    +
    +{suites, node1, 'T1', all}.
    +{skip_suites, node1, 'T1', [t1B_SUITE,t1D_SUITE], "Not implemented"}.
    +{skip_cases, node1, 'T1', t1A_SUITE, [test3,test4], "Irrelevant"}.
    +{skip_cases, node1, 'T1', t1C_SUITE, [test1], "Ignore"}.
     
    -{suites, node2, 'T2', [t2B_SUITE,t2C_SUITE]}.
    -{cases, node2, 'T2', t2A_SUITE, [test4,test1,test7]}.
    +{suites, node2, 'T2', [t2B_SUITE,t2C_SUITE]}.
    +{cases, node2, 'T2', t2A_SUITE, [test4,test1,test7]}.
     
    -{skip_suites, 'T3', all, "Not implemented"}.

    This example specifies the same tests as the original example. But now if +{skip_suites, 'T3', all, "Not implemented"}.

    This example specifies the same tests as the original example. But now if started with a call to ct_master:run(TestSpecName), test t1 is executed on node ct_node@host_x (node1), test t2 on ct_node@host_y (node2) and test t3 on both node1 and node2. Configuration file t1 is only read on @@ -139,13 +139,13 @@ Automatic Startup of Test Target Nodes

    Initial actions can be started and performed automatically on test target nodes -using test specification term init.

    Two subterms are supported, node_start and eval.

    Example:

    {node, node1, node1@host1}.
    -{node, node2, node1@host2}.
    -{node, node3, node2@host2}.
    -{node, node4, node1@host3}.
    -{init, node1, [{node_start, [{callback_module, my_slave_callback}]}]}.
    -{init, [node2, node3], {node_start, [{username, "ct_user"}, {password, "ct_password"}]}}.
    -{init, node4, {eval, {module, function, []}}}.

    This test specification declares that node1@host1 is to be started using the +using test specification term init.

    Two subterms are supported, node_start and eval.

    Example:

    {node, node1, node1@host1}.
    +{node, node2, node1@host2}.
    +{node, node3, node2@host2}.
    +{node, node4, node1@host3}.
    +{init, node1, [{node_start, [{callback_module, my_slave_callback}]}]}.
    +{init, [node2, node3], {node_start, [{username, "ct_user"}, {password, "ct_password"}]}}.
    +{init, node4, {eval, {module, function, []}}}.

    This test specification declares that node1@host1 is to be started using the user callback function callback_module:my_slave_callback/0, and nodes node1@host2 and node2@host2 are to be started with the default callback module ct_slave. The specified username and password are used to log on to /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct_master.xhtml differs (HTML document, ASCII text, with very long lines (804)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct_master.xhtml 2026-06-04 00:07:31.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct_master.xhtml 2042-07-06 13:26:59.000000000 +0000 @@ -327,7 +327,7 @@

    Gets a reference to the Common Test master event manager. The reference can be -used to, for example, add a user-specific event handler while tests are running.

    Example:

    gen_event:add_handler(ct_master:get_event_mgr_ref(), my_ev_h, [])
    +used to, for example, add a user-specific event handler while tests are running.

    Example:

    gen_event:add_handler(ct_master:get_event_mgr_ref(), my_ev_h, [])
    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct_netconfc.xhtml differs (HTML document, ASCII text, with very long lines (1594)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct_netconfc.xhtml 2026-06-04 00:07:31.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct_netconfc.xhtml 2042-07-06 13:26:59.000000000 +0000 @@ -32,7 +32,7 @@ to the server.

    Alternately, open/1,2 can be used to establish a single session on a dedicated connection. (Or, equivalently, only_open/1,2 followed by hello/1-3.)

    Connect/session options can be specified in a configuration file with entries -like the following.

    {server_id(), [option()]}.

    The server_id/0 or an associated ct:target_name/0 can then be passed to +like the following.

    {server_id(), [option()]}.

    The server_id/0 or an associated ct:target_name/0 can then be passed to the aforementioned functions to use the referenced configuration.

    Signaling

    Protocol operations in the NETCONF protocol are realized as remote procedure calls (RPCs) from client to server and a corresponding reply from server to client. RPCs are sent using like-named functions (eg. @@ -45,8 +45,8 @@ in most cases since a non-response by the server or a missing message-id causes the call to hang indefinitely.

    Logging

    The NETCONF server uses error_logger for logging of NETCONF traffic. A special purpose error handler is implemented in ct_conn_log_h. To use this error -handler, add the cth_conn_log hook in the test suite, for example:

    suite() ->
    -    [{ct_hooks, [{cth_conn_log, [{ct:conn_log_mod(), ct:conn_log_options()}]}]}].

    conn_log_mod() is the name of the Common Test module implementing the +handler, add the cth_conn_log hook in the test suite, for example:

    suite() ->
    +    [{ct_hooks, [{cth_conn_log, [{ct:conn_log_mod(), ct:conn_log_options()}]}]}].

    conn_log_mod() is the name of the Common Test module implementing the connection protocol, for example, ct_netconfc.

    Hook option log_type specifies the type of logging:

    • raw - The sent and received NETCONF data is logged to a separate text file "as is" without any formatting. A link to the file is added to the test case HTML log.

    • pretty - The sent and received NETCONF data is logged to a separate text @@ -57,17 +57,17 @@ option hosts and list the names of the servers/connections to be used in the suite. The connections must be named for this to work, that is, they must be opened with open/2.

      Option hosts has no effect if log_type is set to html or silent.

      The hook options can also be specified in a configuration file with -configuration variable ct_conn_log:

      {ct_conn_log,[{ct:conn_log_mod(), ct:conn_log_options()}]}.

      For example:

      {ct_conn_log,[{ct_netconfc,[{log_type,pretty},
      -                            {hosts,[ct:key_or_name()]}]}]}

      Note

      Hook options specified in a configuration file overwrite the hard-coded hook +configuration variable ct_conn_log:

      {ct_conn_log,[{ct:conn_log_mod(), ct:conn_log_options()}]}.

      For example:

      {ct_conn_log,[{ct_netconfc,[{log_type,pretty},
      +                            {hosts,[ct:key_or_name()]}]}]}

      Note

      Hook options specified in a configuration file overwrite the hard-coded hook options in the test suite.

      Logging Example 1:

      The following ct_hooks statement causes pretty printing of NETCONF traffic to separate logs for the connections named nc_server1 and nc_server2. Any other -connections are logged to default NETCONF log.

      suite() ->
      -   [{ct_hooks, [{cth_conn_log, [{ct_netconfc,[{log_type,pretty}},
      -                                              {hosts,[nc_server1,nc_server2]}]}
      -                               ]}]}].

      Connections must be opened as follows:

      open(nc_server1,[...]),
      -open(nc_server2,[...]).

      Logging Example 2:

      The following configuration file causes raw logging of all NETCONF traffic in to -one single text file:

      {ct_conn_log,[{ct_netconfc,[{log_type,raw}]}]}.

      The ct_hooks statement must look as follows:

      suite() ->
      -    [{ct_hooks, [{cth_conn_log, []}]}].

      The same ct_hooks statement without the configuration file would cause HTML +connections are logged to default NETCONF log.

      suite() ->
      +   [{ct_hooks, [{cth_conn_log, [{ct_netconfc,[{log_type,pretty}},
      +                                              {hosts,[nc_server1,nc_server2]}]}
      +                               ]}]}].

      Connections must be opened as follows:

      open(nc_server1,[...]),
      +open(nc_server2,[...]).

      Logging Example 2:

      The following configuration file causes raw logging of all NETCONF traffic in to +one single text file:

      {ct_conn_log,[{ct_netconfc,[{log_type,raw}]}]}.

      The ct_hooks statement must look as follows:

      suite() ->
      +    [{ct_hooks, [{cth_conn_log, []}]}].

      The same ct_hooks statement without the configuration file would cause HTML logging of all NETCONF connections in to the test case HTML log.

    @@ -2052,8 +2052,8 @@

    Edits configuration data.

    By default only the running target is available, unless the server includes :candidate or :startup in its list of capabilities.

    OptParams can be used for specifying optional parameters (default-operation, test-option, or error-option) to be added to the edit-config request. The -value must be a list containing valid simple XML, for example:

    [{'default-operation', ["none"]},
    - {'error-option', ["rollback-on-error"]}]

    If OptParams is not given, the default value [] is used.

    +value must be a list containing valid simple XML, for example:

    [{'default-operation', ["none"]},
    + {'error-option', ["rollback-on-error"]}]

    If OptParams is not given, the default value [] is used.

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct_property_test_chapter.xhtml differs (HTML document, ASCII text, with very long lines (656)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct_property_test_chapter.xhtml 2026-06-04 00:07:31.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct_property_test_chapter.xhtml 2042-07-06 13:26:59.000000000 +0000 @@ -42,51 +42,51 @@ Introductory Example

    Assume that we want to test the lists:sort/1 function.

    We need a property to test the function. In normal way, we create -property_test/ct_prop.erl module in the test directory in our application:

    -module(ct_prop).
    --export([prop_sort/0]).
    +property_test/ct_prop.erl module in the test directory in our application:

    -module(ct_prop).
    +-export([prop_sort/0]).
     
     %%% This will include the .hrl file for the installed testing tool:
    --include_lib("common_test/include/ct_property_test.hrl").
    +-include_lib("common_test/include/ct_property_test.hrl").
     
     %%% The property we want to check:
     %%%   For all possibly unsorted lists,
     %%%   the result of lists:sort/1 is sorted.
    -prop_sort() ->
    -    ?FORALL(UnSorted, list(),
    -            is_sorted(lists:sort(UnSorted))
    -           ).
    +prop_sort() ->
    +    ?FORALL(UnSorted, list(),
    +            is_sorted(lists:sort(UnSorted))
    +           ).
     
     %%% Function to check that a list is sorted:
    -is_sorted([]) ->
    +is_sorted([]) ->
         true;
    -is_sorted([_]) ->
    +is_sorted([_]) ->
         true;
    -is_sorted([H1,H2|SortedTail]) when H1 =< H2 ->
    -    is_sorted([H2|SortedTail]);
    -is_sorted(_) ->
    -    false.

    We also need a CommonTest test suite:

    -module(ct_property_test_SUITE).
    --compile(export_all). % Only in tests!
    +is_sorted([H1,H2|SortedTail]) when H1 =< H2 ->
    +    is_sorted([H2|SortedTail]);
    +is_sorted(_) ->
    +    false.

    We also need a CommonTest test suite:

    -module(ct_property_test_SUITE).
    +-compile(export_all). % Only in tests!
     
    --include_lib("common_test/include/ct.hrl").
    +-include_lib("common_test/include/ct.hrl").
     
    -all() -> [prop_sort
    -         ].
    +all() -> [prop_sort
    +         ].
     
     %%% First prepare Config and compile the property tests for the found tool:
    -init_per_suite(Config) ->
    -    ct_property_test:init_per_suite(Config).
    +init_per_suite(Config) ->
    +    ct_property_test:init_per_suite(Config).
     
    -end_per_suite(Config) ->
    +end_per_suite(Config) ->
         Config.
     
     %%%================================================================
     %%% Test suites
     %%%
    -prop_sort(Config) ->
    -    ct_property_test:quickcheck(
    -      ct_prop:prop_sort(),
    +prop_sort(Config) ->
    +    ct_property_test:quickcheck(
    +      ct_prop:prop_sort(),
           Config
    -     ).

    We run it as usual, for example with ct_run in the OS shell:

    ..../test$ ct_run -suite ct_property_test_SUITE
    +     ).

    We run it as usual, for example with ct_run in the OS shell:

    ..../test$ ct_run -suite ct_property_test_SUITE
     .....
     Common Test: Running make in test directories...
     
    @@ -116,13 +116,13 @@
       A stateful testing example
     
     

    Assume a test that generates some parallel stateful commands, and runs 300 -tests:

    prop_parallel(Config) ->
    -    numtests(300,
    -             ?FORALL(Cmds, parallel_commands(?MODULE),
    +tests:

    prop_parallel(Config) ->
    +    numtests(300,
    +             ?FORALL(Cmds, parallel_commands(?MODULE),
                          begin
    -                         RunResult = run_parallel_commands(?MODULE, Cmds),
    -                         ct_property_test:present_result(?MODULE, Cmds, RunResult, Config)
    -                     end)).

    The ct_property_test:present_result/4 is a help function for printing some + RunResult = run_parallel_commands(?MODULE, Cmds), + ct_property_test:present_result(?MODULE, Cmds, RunResult, Config) + end)).

    The ct_property_test:present_result/4 is a help function for printing some statistics in the CommonTest log file.

    Our example test could for example be a simple test of an ftp server, where we perform get, put and delete requests, some of them in parallel. Per default, the result has three sections:

    *** User 2019-12-11 13:28:17.504 ***
    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct_property_test.xhtml differs (HTML document, ASCII text, with very long lines (850))
    --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct_property_test.xhtml	2026-06-04 00:07:31.000000000 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct_property_test.xhtml	2042-07-06 13:26:59.000000000 +0000
    @@ -30,30 +30,30 @@
     directory has a subdirectory property_test, where everything needed for the
     property tests are collected. The usual Erlang application directory structure
     is assumed.

    A typical Common Test test suite using ct_property_test is organized as -follows:

    -module(my_prop_test_SUITE).
    --compile(export_all).
    +follows:

    -module(my_prop_test_SUITE).
    +-compile(export_all).
     
    --include_lib("common_test/include/ct.hrl").
    +-include_lib("common_test/include/ct.hrl").
     
    -all() -> [prop_ftp_case].
    +all() -> [prop_ftp_case].
     
    -init_per_suite(Config) ->
    -    ct_property_test:init_per_suite(Config).
    +init_per_suite(Config) ->
    +    ct_property_test:init_per_suite(Config).
     
     %%%---- test case
    -prop_ftp_case(Config) ->
    -    ct_property_test:quickcheck(
    -      ftp_simple_client_server:prop_ftp(),
    +prop_ftp_case(Config) ->
    +    ct_property_test:quickcheck(
    +      ftp_simple_client_server:prop_ftp(),
           Config
    -     ).

    and the the property test module (in this example + ).

    and the the property test module (in this example ftp_simple_client_server.erl) as almost a usual property testing module (More -examples are in the User's Guide):

    -module(ftp_simple_client_server).
    --export([prop_ftp/0...]).
    +examples are in the User's Guide):

    -module(ftp_simple_client_server).
    +-export([prop_ftp/0...]).
     
    --include_lib("common_test/include/ct_property_test.hrl").
    +-include_lib("common_test/include/ct_property_test.hrl").
     
    -prop_ftp() ->
    -    ?FORALL( ....
    +
    prop_ftp() -> + ?FORALL( ....
    @@ -755,7 +755,7 @@ 'EQC', 'PROPER' or 'TRIQ' set, depending on which tool that is first found. This could make parts of the Erlang property tests code to be included or excluded with the macro directives -ifdef(Macro). or -ifndef(Macro)..

    The file(s) in the property_test subdirectory could, or should, include the -ct_property_test include file:

    -include_lib("common_test/include/ct_property_test.hrl").

    This included file will:

    • Include the correct tool's include file
    • Set the macro 'MOD_eqc' to the correct module name for the selected tool. +ct_property_test include file:

      -include_lib("common_test/include/ct_property_test.hrl").

      This included file will:

      • Include the correct tool's include file
      • Set the macro 'MOD_eqc' to the correct module name for the selected tool. That is, the macro 'MOD_eqc' is set to either eqc, proper or triq.
      @@ -866,8 +866,8 @@

      Presents the result of stateful (statem) property testing using the aggregate function in PropEr, QuickCheck or other similar property testing tool.

      It is assumed to be called inside the property called by quickcheck/2:

      ...
      -RunResult = run_parallel_commands(?MODULE, Cmds),
      -ct_property_test:present_result(?MODULE, Cmds, RunResult, Config)
      +RunResult = run_parallel_commands(?MODULE, Cmds),
      +ct_property_test:present_result(?MODULE, Cmds, RunResult, Config)
       ...

      See the User's Guide for an example of the usage and of the default printout.

      The StatisticsSpec is a list of the tuples:

      • {Title::string(), CollectFun::fun/1}
      • {Title::string(), FrequencyFun::/0, CollectFun::fun/1}

      Each tuple will produce one table in the order of their places in the list.

      • Title will be the title of one result table

      • CollectFun is called with one argument: the Cmds. It should return a list of the values to be counted. The following pre-defined functions exist:

        • ct_property_test:cmnd_names/1 returns a list of commands (function calls) @@ -877,15 +877,15 @@ about sequential and parallel parts from Tool:parallel_commands/1,2
      • FrequencyFun/0 returns a fun/1 which is supposed to take a list of items as input, and return an iolist which will be printed as the table. Per default, the number of each item is counted and the percentage is printed for each. The -list [a,b,a,a,c] could for example return

        ["a 60%\n","b 20%\n","c 20%\n"]

        which will be printed by the print_fun. The default print_fun will print +list [a,b,a,a,c] could for example return

        ["a 60%\n","b 20%\n","c 20%\n"]

        which will be printed by the print_fun. The default print_fun will print it as:

        a 60%
         b 20%
        -c 20%

      The default StatisticsSpec is:

      • For sequential commands:

        [{"Function calls", fun cmnd_names/1},
        - {"Length of command sequences", fun print_frequency_ranges/0,
        -                                                  fun num_calls/1}]
      • For parallel commands:

        [{"Distribution sequential/parallel", fun sequential_parallel/1},
        - {"Function calls", fun cmnd_names/1},
        - {"Length of command sequences", fun print_frequency_ranges/0,
        -                                                  fun num_calls/1}]
      +c 20%

    The default StatisticsSpec is:

    • For sequential commands:

      [{"Function calls", fun cmnd_names/1},
      + {"Length of command sequences", fun print_frequency_ranges/0,
      +                                                  fun num_calls/1}]
    • For parallel commands:

      [{"Distribution sequential/parallel", fun sequential_parallel/1},
      + {"Function calls", fun cmnd_names/1},
      + {"Length of command sequences", fun print_frequency_ranges/0,
      +                                                  fun num_calls/1}]
    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct_run_cmd.xhtml differs (HTML document, ASCII text, with very long lines (594)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct_run_cmd.xhtml 2026-06-04 00:07:31.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct_run_cmd.xhtml 2042-07-06 13:26:59.000000000 +0000 @@ -146,10 +146,10 @@ Run Common Test in Interactive Mode
     ct_run -shell
    -  [-config ConfigFile1 ConfigFile2 ... ConfigFileN]
    -  [-userconfig CallbackModule1 ConfigString1 and CallbackModule2
    -   ConfigString2 and .. and CallbackModuleN ConfigStringN]
    -  [-decrypt_key Key] | [-decrypt_file KeyFile]

    + [-config ConfigFile1 ConfigFile2 ... ConfigFileN] + [-userconfig CallbackModule1 ConfigString1 and CallbackModule2 + ConfigString2 and .. and CallbackModuleN ConfigStringN] + [-decrypt_key Key] | [-decrypt_file KeyFile]

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct_snmp.xhtml differs (HTML document, ASCII text, with very long lines (2283)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct_snmp.xhtml 2026-06-04 00:07:31.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct_snmp.xhtml 2042-07-06 13:26:59.000000000 +0000 @@ -45,15 +45,15 @@ Optional.

  • {agent_target_param_def, [term()] | {data_dir_file, rel_path()}} - Optional.

  • Parameter MgrAgentConfName in the functions is to be a name you allocate in your test suite using a require statement. Example (where -MgrAgentConfName = snmp_mgr_agent):

    suite() -> [{require, snmp_mgr_agent, snmp}].

    or

    ct:require(snmp_mgr_agent, snmp).

    Notice that USM users are needed for SNMPv3 configuration and are not to be +MgrAgentConfName = snmp_mgr_agent):

    suite() -> [{require, snmp_mgr_agent, snmp}].

    or

    ct:require(snmp_mgr_agent, snmp).

    Notice that USM users are needed for SNMPv3 configuration and are not to be confused with users.

    SNMP traps, inform, and report messages are handled by the user callback module. For details, see the SNMP application.

    It is recommended to use the .hrl files created by the Erlang/OTP MIB compiler to define the Object Identifiers (OIDs). For example, to get the Erlang node -name from erlNodeTable in the OTP-MIB:

    Oid = ?erlNodeEntry ++ [?erlNodeName, 1]

    Furthermore, values can be set for SNMP application configuration parameters, +name from erlNodeTable in the OTP-MIB:

    Oid = ?erlNodeEntry ++ [?erlNodeName, 1]

    Furthermore, values can be set for SNMP application configuration parameters, config, server, net_if, and so on (for a list of valid parameters and types, see the User's Guide for the SNMP application). -This is done by defining a configuration data variable on the following form:

    {snmp_app, [{manager, [snmp_app_manager_params()]},
    -            {agent, [snmp_app_agent_params()]}]}.

    A name for the data must be allocated in the suite using require (see the +This is done by defining a configuration data variable on the following form:

    {snmp_app, [{manager, [snmp_app_manager_params()]},
    +            {agent, [snmp_app_agent_params()]}]}.

    A name for the data must be allocated in the suite using require (see the example above). Pass this name as argument SnmpAppConfName to ct_snmp:start/3. ct_snmp specifies default values for some SNMP application configuration parameters (such as {verbosity,trace} for /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct_ssh.xhtml differs (HTML document, ASCII text, with very long lines (570)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct_ssh.xhtml 2026-06-04 00:07:31.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct_ssh.xhtml 2042-07-06 13:26:59.000000000 +0000 @@ -28,14 +28,14 @@ that have been started on existing SSH connections (that is, when the original connection type is ssh). Whenever the connection type is sftp, use the SSH connection reference only.

    The following options are valid for specifying an SSH/SFTP connection (that is, -can be used as configuration elements):

    [{ConnType, Addr},
    - {port, Port},
    - {user, UserName}
    - {password, Pwd}
    - {user_dir, String}
    - {public_key_alg, PubKeyAlg}
    - {connect_timeout, Timeout}
    - {key_cb, KeyCallbackMod}]

    ConnType = ssh | sftp.

    For other types, see ssh.

    All time-out parameters in ct_ssh functions are values in milliseconds.

    +can be used as configuration elements):

    [{ConnType, Addr},
    + {port, Port},
    + {user, UserName}
    + {password, Pwd}
    + {user_dir, String}
    + {public_key_alg, PubKeyAlg}
    + {connect_timeout, Timeout}
    + {key_cb, KeyCallbackMod}]

    ConnType = ssh | sftp.

    For other types, see ssh.

    All time-out parameters in ct_ssh functions are values in milliseconds.

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct_telnet.xhtml differs (HTML document, ASCII text, with very long lines (1874)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct_telnet.xhtml 2026-06-04 00:07:31.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct_telnet.xhtml 2042-07-06 13:26:59.000000000 +0000 @@ -31,14 +31,14 @@ true
  • Polling limit (max number of times to poll to get a remaining string terminated) = 0
  • Polling interval (sleep time between polls) = 1 second
  • The TCP_NODELAY option for the telnet socket is disabled (set to false) per default
  • These parameters can be modified by the user with the following configuration -term:

    {telnet_settings, [{connect_timeout,Millisec},
    -                   {command_timeout,Millisec},
    -                   {reconnection_attempts,N},
    -                   {reconnection_interval,Millisec},
    -                   {keep_alive,Bool},
    -                   {poll_limit,N},
    -                   {poll_interval,Millisec},
    -                   {tcp_nodelay,Bool}]}.

    Millisec = integer(), N = integer()

    Enter the telnet_settings term in a configuration file included in the test +term:

    {telnet_settings, [{connect_timeout,Millisec},
    +                   {command_timeout,Millisec},
    +                   {reconnection_attempts,N},
    +                   {reconnection_interval,Millisec},
    +                   {keep_alive,Bool},
    +                   {poll_limit,N},
    +                   {poll_interval,Millisec},
    +                   {tcp_nodelay,Bool}]}.

    Millisec = integer(), N = integer()

    Enter the telnet_settings term in a configuration file included in the test and ct_telnet retrieves the information automatically.

    keep_alive can be specified per connection, if necessary. For details, see unix_telnet.

    @@ -53,8 +53,8 @@ such as expect/3. However, ct_telnet can be configured to use a special purpose event handler, implemented in ct_conn_log_h, for logging all Telnet traffic. To use this handler, install a Common Test hook named -cth_conn_log. Example (using the test suite information function):

    suite() ->
    -    [{ct_hooks, [{cth_conn_log, [{conn_mod(),hook_options()}]}]}].

    conn_mod() is the name of the Common Test module implementing the connection +cth_conn_log. Example (using the test suite information function):

    suite() ->
    +    [{ct_hooks, [{cth_conn_log, [{conn_mod(),hook_options()}]}]}].

    conn_mod() is the name of the Common Test module implementing the connection protocol, that is, ct_telnet.

    The cth_conn_log hook performs unformatted logging of Telnet data to a separate text file. All Telnet communication is captured and printed, including any data sent from the server. The link to this text file is located at the top @@ -71,15 +71,15 @@ disabled, which results with no prefix data. If the value is set to full prefix contains timestamp and additonal information. If the value is set to short prefix includes only human readable timestamp.

    All cth_conn_log hook options described can also be specified in a -configuration file with configuration variable ct_conn_log.

    Example:

    {ct_conn_log, [{ct_telnet,[{log_type,raw},
    -                           {hosts,[key_or_name()]}]}]}

    Note

    Hook options specified in a configuration file overwrite any hard-coded hook +configuration file with configuration variable ct_conn_log.

    Example:

    {ct_conn_log, [{ct_telnet,[{log_type,raw},
    +                           {hosts,[key_or_name()]}]}]}

    Note

    Hook options specified in a configuration file overwrite any hard-coded hook options in the test suite.

    Logging Example:

    The following ct_hooks statement causes printing of Telnet traffic to separate logs for the connections server1 and server2. Traffic for any other -connections is logged in the default Telnet log.

    suite() ->
    -    [{ct_hooks,
    -      [{cth_conn_log, [{ct_telnet,[{hosts,[server1,server2]}]}]}]}].

    As previously explained, this specification can also be provided by an entry -like the following in a configuration file:

    {ct_conn_log, [{ct_telnet,[{hosts,[server1,server2]}]}]}.

    In this case the ct_hooks statement in the test suite can look as follows:

    suite() ->
    -    [{ct_hooks, [{cth_conn_log, []}]}].

    +connections is logged in the default Telnet log.

    suite() ->
    +    [{ct_hooks,
    +      [{cth_conn_log, [{ct_telnet,[{hosts,[server1,server2]}]}]}]}].

    As previously explained, this specification can also be provided by an entry +like the following in a configuration file:

    {ct_conn_log, [{ct_telnet,[{hosts,[server1,server2]}]}]}.

    In this case the ct_hooks statement in the test suite can look as follows:

    suite() ->
    +    [{ct_hooks, [{cth_conn_log, []}]}].

    @@ -772,9 +772,9 @@ instead of only one Match. Also HaltReason is returned.

  • sequence - All patterns must be matched in a sequence. A match is not concluded until all patterns are matched. This option can be interrupted by one or more HaltPatterns. MatchList is always returned, that is, a list of -Match instead of only one Match. Also HaltReason is returned.

  • Example 1:

    expect(Connection,[{abc,"ABC"},{xyz,"XYZ"}],[sequence,{halt,[{nnn,"NNN"}]}])

    First this tries to match "ABC", and then "XYZ", but if "NNN" appears, the +Match instead of only one Match. Also HaltReason is returned.

    Example 1:

    expect(Connection,[{abc,"ABC"},{xyz,"XYZ"}],[sequence,{halt,[{nnn,"NNN"}]}])

    First this tries to match "ABC", and then "XYZ", but if "NNN" appears, the function returns {error,{nnn,["NNN"]}}. If both "ABC" and "XYZ" are -matched, the function returns {ok,[AbcMatch,XyzMatch]}.

    Example 2:

    expect(Connection,[{abc,"ABC"},{xyz,"XYZ"}],[{repeat,2},{halt,[{nnn,"NNN"}]}])

    This tries to match "ABC" or "XYZ" twice. If "NNN" appears, the function +matched, the function returns {ok,[AbcMatch,XyzMatch]}.

    Example 2:

    expect(Connection,[{abc,"ABC"},{xyz,"XYZ"}],[{repeat,2},{halt,[{nnn,"NNN"}]}])

    This tries to match "ABC" or "XYZ" twice. If "NNN" appears, the function returns HaltReason = {nnn,["NNN"]}.

    Options repeat and sequence can be combined to match a sequence multiple times.

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct.xhtml differs (HTML document, ASCII text, with very long lines (384)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct.xhtml 2026-06-04 00:07:31.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/ct.xhtml 2042-07-06 13:26:59.000000000 +0000 @@ -1857,17 +1857,17 @@

    Reads configuration data values.

    Returns the matching values or configuration elements, given a configuration variable key or its associated name (if one has been specified with -ct:require/2 or a require statement).

    Example:

    Given the following configuration file:

    {unix,[{telnet,IpAddr},
    -       {user,[{username,Username},
    -              {password,Password}]}]}.

    Then:

    ct:get_config(unix,Default) -> [{telnet,IpAddr},
    - {user, [{username,Username}, {password,Password}]}]
    -ct:get_config({unix,telnet},Default) -> IpAddr
    -ct:get_config({unix,user,username},Default) -> Username
    -ct:get_config({unix,ftp},Default) -> Default
    -ct:get_config(unknownkey,Default) -> Default

    If a configuration variable key has been associated with a name (by +ct:require/2 or a require statement).

    Example:

    Given the following configuration file:

    {unix,[{telnet,IpAddr},
    +       {user,[{username,Username},
    +              {password,Password}]}]}.

    Then:

    ct:get_config(unix,Default) -> [{telnet,IpAddr},
    + {user, [{username,Username}, {password,Password}]}]
    +ct:get_config({unix,telnet},Default) -> IpAddr
    +ct:get_config({unix,user,username},Default) -> Username
    +ct:get_config({unix,ftp},Default) -> Default
    +ct:get_config(unknownkey,Default) -> Default

    If a configuration variable key has been associated with a name (by ct:require/2 or a require statement), the name can be used -instead of the key to read the value:

    ct:require(myuser,{unix,user}) -> ok.
    -ct:get_config(myuser,Default) -> [{username,Username}, {password,Password}]

    If a configuration variable is defined in multiple files, use option all to +instead of the key to read the value:

    ct:require(myuser,{unix,user}) -> ok.
    +ct:get_config(myuser,Default) -> [{username,Username}, {password,Password}]

    If a configuration variable is defined in multiple files, use option all to access all possible values. The values are returned in a list. The order of the elements corresponds to the order that the configuration files were specified at startup.

    If configuration elements (key-value tuples) are to be returned as result @@ -1905,7 +1905,7 @@

    Gets a reference to the Common Test event manager. The reference can be used -to, for example, add a user-specific event handler while tests are running.

    Example:

    gen_event:add_handler(ct:get_event_mgr_ref(), my_ev_h, [])
    +to, for example, add a user-specific event handler while tests are running.

    Example:

    gen_event:add_handler(ct:get_event_mgr_ref(), my_ev_h, [])
    @@ -2194,7 +2194,7 @@ -

    Installs configuration files and event handlers.

    Run this function once before the first test.

    Example:

    install([{config,["config_node.ctc","config_user.ctc"]}])

    This function is automatically run by program ct_run.

    +

    Installs configuration files and event handlers.

    Run this function once before the first test.

    Example:

    install([{config,["config_node.ctc","config_user.ctc"]}])

    This function is automatically run by program ct_run.

    @@ -3031,7 +3031,7 @@

    Checks if the required configuration is available. Arbitrarily deep tuples can be specified as Required. Only the last element of the tuple can be a list of -SubKeys.

    Example 1. Require the variable myvar:

    ok = ct:require(myvar).

    In this case the configuration file must at least contain:

    {myvar,Value}.

    Example 2. Require key myvar with subkeys sub1 and sub2:

    ok = ct:require({myvar,[sub1,sub2]}).

    In this case the configuration file must at least contain:

    {myvar,[{sub1,Value},{sub2,Value}]}.

    Example 3. Require key myvar with subkey sub1 with subsub1:

    ok = ct:require({myvar,sub1,sub2}).

    In this case the configuration file must at least contain:

    {myvar,[{sub1,[{sub2,Value}]}]}.

    See also ct:get_config/1, +SubKeys.

    Example 1. Require the variable myvar:

    ok = ct:require(myvar).

    In this case the configuration file must at least contain:

    {myvar,Value}.

    Example 2. Require key myvar with subkeys sub1 and sub2:

    ok = ct:require({myvar,[sub1,sub2]}).

    In this case the configuration file must at least contain:

    {myvar,[{sub1,Value},{sub2,Value}]}.

    Example 3. Require key myvar with subkey sub1 with subsub1:

    ok = ct:require({myvar,sub1,sub2}).

    In this case the configuration file must at least contain:

    {myvar,[{sub1,[{sub2,Value}]}]}.

    See also ct:get_config/1, ct:get_config/2, ct:get_config/3, ct:require/2.

    @@ -3073,8 +3073,8 @@ that the value of the element can be read with ct:get_config/1,2 provided Name is used instead of the whole Required term.

    Example:

    Require one node with a Telnet connection and an FTP connection. Name the node -a:

    ok = ct:require(a,{machine,node}).

    All references to this node can then use the node name. For example, a file over -FTP is fetched like follows:

    ok = ct:ftp_get(a,RemoteFile,LocalFile).

    For this to work, the configuration file must at least contain:

    {machine,[{node,[{telnet,IpAddr},{ftp,IpAddr}]}]}.

    Note

    The behavior of this function changed radically in Common Test 1.6.2. To +a:

    ok = ct:require(a,{machine,node}).

    All references to this node can then use the node name. For example, a file over +FTP is fetched like follows:

    ok = ct:ftp_get(a,RemoteFile,LocalFile).

    For this to work, the configuration file must at least contain:

    {machine,[{node,[{telnet,IpAddr},{ftp,IpAddr}]}]}.

    Note

    The behavior of this function changed radically in Common Test 1.6.2. To keep some backwards compatibility, it is still possible to do: ct:require(a,{node,[telnet,ftp]}). This associates the name a with the top-level node entry. For this to work, the configuration file must at least @@ -3449,12 +3449,12 @@ the Erlang shell. The interactive mode can also be started from the OS command line with ct_run -shell [-config File...].

    If any functions (for example, Telnet or FTP) using "required configuration data" are to be called from the Erlang shell, configuration data must first be -required with ct:require/2.

    Example:

    > ct:require(unix_telnet, unix).
    +required with ct:require/2.

    Example:

    > ct:require(unix_telnet, unix).
     ok
    -> ct_telnet:open(unix_telnet).
    -{ok,<0.105.0>}
    -> ct_telnet:cmd(unix_telnet, "ls .").
    -{ok,["ls","file1  ...",...]}
    +>
    ct_telnet:open(unix_telnet). +{ok,<0.105.0>} +> ct_telnet:cmd(unix_telnet, "ls ."). +{ok,["ls","file1 ...",...]}
    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/dependencies_chapter.xhtml differs (HTML document, ASCII text, with very long lines (1170)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/dependencies_chapter.xhtml 2026-06-04 00:07:31.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/dependencies_chapter.xhtml 2042-07-06 13:26:59.000000000 +0000 @@ -56,65 +56,65 @@ start and stop functionality separately.) The configuration can also be implemented as a common function, maybe grouped with the start function. Finally, the testing of connecting and disconnecting a client can be grouped -into one test case. The resulting suite can look as follows:

    -module(my_server_SUITE).
    --compile(export_all).
    --include_lib("ct.hrl").
    +into one test case. The resulting suite can look as follows:

    -module(my_server_SUITE).
    +-compile(export_all).
    +-include_lib("ct.hrl").
     
     %%% init and end functions...
     
    -suite() -> [{require,my_server_cfg}].
    +suite() -> [{require,my_server_cfg}].
     
    -init_per_testcase(start_and_stop, Config) ->
    +init_per_testcase(start_and_stop, Config) ->
         Config;
     
    -init_per_testcase(config, Config) ->
    -    [{server_pid,start_server()} | Config];
    +init_per_testcase(config, Config) ->
    +    [{server_pid,start_server()} | Config];
     
    -init_per_testcase(_, Config) ->
    -    ServerPid = start_server(),
    -    configure_server(),
    -    [{server_pid,ServerPid} | Config].
    +init_per_testcase(_, Config) ->
    +    ServerPid = start_server(),
    +    configure_server(),
    +    [{server_pid,ServerPid} | Config].
     
    -end_per_testcase(start_and_stop, _) ->
    +end_per_testcase(start_and_stop, _) ->
         ok;
     
    -end_per_testcase(_, Config) ->
    -    ServerPid = proplists:get_value(server_pid, Config),
    -    stop_server(ServerPid).
    +end_per_testcase(_, Config) ->
    +    ServerPid = proplists:get_value(server_pid, Config),
    +    stop_server(ServerPid).
     
     %%% test cases...
     
    -all() -> [start_and_stop, config, connect_and_disconnect].
    +all() -> [start_and_stop, config, connect_and_disconnect].
     
     %% test that starting and stopping works
    -start_and_stop(_) ->
    -    ServerPid = start_server(),
    -    stop_server(ServerPid).
    +start_and_stop(_) ->
    +    ServerPid = start_server(),
    +    stop_server(ServerPid).
     
     %% configuration test
    -config(Config) ->
    -    ServerPid = proplists:get_value(server_pid, Config),
    -    configure_server(ServerPid).
    +config(Config) ->
    +    ServerPid = proplists:get_value(server_pid, Config),
    +    configure_server(ServerPid).
     
     %% test connecting and disconnecting client
    -connect_and_disconnect(Config) ->
    -    ServerPid = proplists:get_value(server_pid, Config),
    -    {ok,SessionId} = my_server:connect(ServerPid),
    -    ok = my_server:disconnect(ServerPid, SessionId).
    +connect_and_disconnect(Config) ->
    +    ServerPid = proplists:get_value(server_pid, Config),
    +    {ok,SessionId} = my_server:connect(ServerPid),
    +    ok = my_server:disconnect(ServerPid, SessionId).
     
     %%% common functions...
     
    -start_server() ->
    -    {ok,ServerPid} = my_server:start(),
    +start_server() ->
    +    {ok,ServerPid} = my_server:start(),
         ServerPid.
     
    -stop_server(ServerPid) ->
    -    ok = my_server:stop(),
    +stop_server(ServerPid) ->
    +    ok = my_server:stop(),
         ok.
     
    -configure_server(ServerPid) ->
    -    ServerCfgData = ct:get_config(my_server_cfg),
    -    ok = my_server:configure(ServerPid, ServerCfgData),
    +configure_server(ServerPid) ->
    +    ServerCfgData = ct:get_config(my_server_cfg),
    +    ok = my_server:configure(ServerPid, ServerCfgData),
         ok.

    @@ -142,40 +142,40 @@ data is to be saved by finction end_per_suite and read by function init_per_suite in the suite that follows. When passing data between suites, Saver carries the name -of the test suite.

    Example:

    -module(server_b_SUITE).
    --compile(export_all).
    --include_lib("ct.hrl").
    +of the test suite.

    Example:

    -module(server_b_SUITE).
    +-compile(export_all).
    +-include_lib("ct.hrl").
     
     %%% init and end functions...
     
    -init_per_suite(Config) ->
    +init_per_suite(Config) ->
         %% read config saved by previous test suite
    -    {server_a_SUITE,OldConfig} = proplists:get_value(saved_config, Config),
    +    {server_a_SUITE,OldConfig} = proplists:get_value(saved_config, Config),
         %% extract server identity (comes from server_a_SUITE)
    -    ServerId = proplists:get_value(server_id, OldConfig),
    -    SessionId = connect_to_server(ServerId),
    -    [{ids,{ServerId,SessionId}} | Config].
    +    ServerId = proplists:get_value(server_id, OldConfig),
    +    SessionId = connect_to_server(ServerId),
    +    [{ids,{ServerId,SessionId}} | Config].
     
    -end_per_suite(Config) ->
    +end_per_suite(Config) ->
         %% save config for server_c_SUITE (session_id and server_id)
    -    {save_config,Config}
    +    {save_config,Config}
     
     %%% test cases...
     
    -all() -> [allocate, deallocate].
    +all() -> [allocate, deallocate].
     
    -allocate(Config) ->
    -    {ServerId,SessionId} = proplists:get_value(ids, Config),
    -    {ok,Handle} = allocate_resource(ServerId, SessionId),
    +allocate(Config) ->
    +    {ServerId,SessionId} = proplists:get_value(ids, Config),
    +    {ok,Handle} = allocate_resource(ServerId, SessionId),
         %% save handle for deallocation test
    -    NewConfig = [{handle,Handle}],
    -    {save_config,NewConfig}.
    +    NewConfig = [{handle,Handle}],
    +    {save_config,NewConfig}.
     
    -deallocate(Config) ->
    -    {ServerId,SessionId} = proplists:get_value(ids, Config),
    -    {allocate,OldConfig} = proplists:get_value(saved_config, Config),
    -    Handle = proplists:get_value(handle, OldConfig),
    -    ok = deallocate_resource(ServerId, SessionId, Handle).

    To save Config data from a test case that is to be skipped, return tuple +deallocate(Config) -> + {ServerId,SessionId} = proplists:get_value(ids, Config), + {allocate,OldConfig} = proplists:get_value(saved_config, Config), + Handle = proplists:get_value(handle, OldConfig), + ok = deallocate_resource(ServerId, SessionId, Handle).

    To save Config data from a test case that is to be skipped, return tuple {skip_and_save,Reason,ConfigList}.

    The result is that the test case is skipped with Reason printed to the log file (as described earlier) and ConfigList is saved for the next test case. ConfigList can be read using proplists:get_value(saved_config, Config), as @@ -195,22 +195,22 @@ property. Test case groups are defined through function groups/0 in the test suite (for details, see section Test Case Groups.

    For example, to ensure that if allocate in server_b_SUITE crashes, -deallocate is skipped, the following sequence can be defined:

    groups() -> [{alloc_and_dealloc, [sequence], [alloc,dealloc]}].

    Assume that the suite contains the test case get_resource_status that is -independent of the other two cases, then function all can look as follows:

    all() -> [{group,alloc_and_dealloc}, get_resource_status].

    If alloc succeeds, dealloc is also executed. If alloc fails however, +deallocate is skipped, the following sequence can be defined:

    groups() -> [{alloc_and_dealloc, [sequence], [alloc,dealloc]}].

    Assume that the suite contains the test case get_resource_status that is +independent of the other two cases, then function all can look as follows:

    all() -> [{group,alloc_and_dealloc}, get_resource_status].

    If alloc succeeds, dealloc is also executed. If alloc fails however, dealloc is not executed but marked as SKIPPED in the HTML log. get_resource_status runs no matter what happens to the alloc_and_dealloc cases.

    Test cases in a sequence are executed in order until all succeed or one fails. If one fails, all following cases in the sequence are skipped. The cases in the sequence that have succeeded up to that point are reported as successful in the -log. Any number of sequences can be specified.

    Example:

    groups() -> [{scenarioA, [sequence], [testA1, testA2]},
    -             {scenarioB, [sequence], [testB1, testB2, testB3]}].
    +log. Any number of sequences can be specified.

    Example:

    groups() -> [{scenarioA, [sequence], [testA1, testA2]},
    +             {scenarioB, [sequence], [testB1, testB2, testB3]}].
     
    -all() -> [test1,
    +all() -> [test1,
               test2,
    -          {group,scenarioA},
    +          {group,scenarioA},
               test3,
    -          {group,scenarioB},
    -          test4].

    A sequence group can have subgroups. Such subgroups can have any property, that + {group,scenarioB}, + test4].

    A sequence group can have subgroups. Such subgroups can have any property, that is, they are not required to also be sequences. If you want the status of the subgroup to affect the sequence on the level above, return {return_group_result,Status} from /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/event_handler_chapter.xhtml differs (HTML document, ASCII text, with very long lines (1529)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/event_handler_chapter.xhtml 2026-06-04 00:07:31.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/event_handler_chapter.xhtml 2042-07-06 13:26:59.000000000 +0000 @@ -63,12 +63,12 @@ ct_run -event_handler_init instead of -event_handler.

    Note

    All event handler modules must have gen_event behavior. These modules must be precompiled and their locations must be added explicitly to the Erlang code server search path (as in the previous example).

    An event_handler tuple in argument Opts has the following definition (see -ct:run_test/1):

    {event_handler,EventHandlers}
    +ct:run_test/1):

    {event_handler,EventHandlers}
     
    -EventHandlers = EH | [EH]
    -EH = atom() | {atom(),InitArgs} | {[atom()],InitArgs}
    -InitArgs = [term()]

    In the following example, two event handlers for the my_SUITE test are -installed:

    1> ct:run_test([{suite,"test/my_SUITE"},{event_handler,[my_evh1,{my_evh2,[node()]}]}]).

    Event handler my_evh1 is started with [] as argument to the init function. +EventHandlers = EH | [EH] +EH = atom() | {atom(),InitArgs} | {[atom()],InitArgs} +InitArgs = [term()]

    In the following example, two event handlers for the my_SUITE test are +installed:

    1> ct:run_test([{suite,"test/my_SUITE"},{event_handler,[my_evh1,{my_evh2,[node()]}]}]).

    Event handler my_evh1 is started with [] as argument to the init function. Event handler my_evh2 is started with the name of the current node in the init argument list.

    Event handlers can also be plugged in using one of the following test specification terms:

    • {event_handler, EventHandlers}
    • {event_handler, EventHandlers, InitArgs}
    • {event_handler, NodeRefs, EventHandlers}
    • {event_handler, NodeRefs, EventHandlers, InitArgs}

    EventHandlers is a list of module names. Before a test session starts, the /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/example_chapter.xhtml differs (HTML document, ASCII text, with very long lines (734)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/example_chapter.xhtml 2026-06-04 00:07:31.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/example_chapter.xhtml 2042-07-06 13:26:59.000000000 +0000 @@ -26,19 +26,19 @@ Test Suite Example

    -

    The following example test suite shows some tests of a database server:

    -module(db_data_type_SUITE).
    +

    The following example test suite shows some tests of a database server:

    -module(db_data_type_SUITE).
     
    --include_lib("common_test/include/ct.hrl").
    +-include_lib("common_test/include/ct.hrl").
     
     %% Test server callbacks
    --export([suite/0, all/0,
    +-export([suite/0, all/0,
              init_per_suite/1, end_per_suite/1,
    -         init_per_testcase/2, end_per_testcase/2]).
    +         init_per_testcase/2, end_per_testcase/2]).
     
     %% Test cases
    --export([string/1, integer/1]).
    +-export([string/1, integer/1]).
     
    --define(CONNECT_STR, "DSN=sqlserver;UID=alladin;PWD=sesame").
    +-define(CONNECT_STR, "DSN=sqlserver;UID=alladin;PWD=sesame").
     
     %%--------------------------------------------------------------------
     %% COMMON TEST CALLBACK FUNCTIONS
    @@ -53,8 +53,8 @@
     %% Description: Returns list of tuples to set default properties
     %%              for the suite.
     %%--------------------------------------------------------------------
    -suite() ->
    -    [{timetrap,{minutes,1}}].
    +suite() ->
    +    [{timetrap,{minutes,1}}].
     
     %%--------------------------------------------------------------------
     %% Function: init_per_suite(Config0) -> Config1
    @@ -64,10 +64,10 @@
     %%
     %% Description: Initialization before the suite.
     %%--------------------------------------------------------------------
    -init_per_suite(Config) ->
    -    {ok, Ref} = db:connect(?CONNECT_STR, []),
    -    TableName = db_lib:unique_table_name(),
    -    [{con_ref, Ref },{table_name, TableName}| Config].
    +init_per_suite(Config) ->
    +    {ok, Ref} = db:connect(?CONNECT_STR, []),
    +    TableName = db_lib:unique_table_name(),
    +    [{con_ref, Ref },{table_name, TableName}| Config].
     
     %%--------------------------------------------------------------------
     %% Function: end_per_suite(Config) -> term()
    @@ -77,9 +77,9 @@
     %%
     %% Description: Cleanup after the suite.
     %%--------------------------------------------------------------------
    -end_per_suite(Config) ->
    -    Ref = proplists:get_value(con_ref, Config),
    -    db:disconnect(Ref),
    +end_per_suite(Config) ->
    +    Ref = proplists:get_value(con_ref, Config),
    +    db:disconnect(Ref),
         ok.
     
     %%--------------------------------------------------------------------
    @@ -92,10 +92,10 @@
     %%
     %% Description: Initialization before each test case.
     %%--------------------------------------------------------------------
    -init_per_testcase(Case, Config) ->
    -    Ref = proplists:get_value(con_ref, Config),
    -    TableName = proplists:get_value(table_name, Config),
    -    ok = db:create_table(Ref, TableName, table_type(Case)),
    +init_per_testcase(Case, Config) ->
    +    Ref = proplists:get_value(con_ref, Config),
    +    TableName = proplists:get_value(table_name, Config),
    +    ok = db:create_table(Ref, TableName, table_type(Case)),
         Config.
     
     %%--------------------------------------------------------------------
    @@ -108,10 +108,10 @@
     %%
     %% Description: Cleanup after each test case.
     %%--------------------------------------------------------------------
    -end_per_testcase(_Case, Config) ->
    -    Ref = proplists:get_value(con_ref, Config),
    -    TableName = proplists:get_value(table_name, Config),
    -    ok = db:delete_table(Ref, TableName),
    +end_per_testcase(_Case, Config) ->
    +    Ref = proplists:get_value(con_ref, Config),
    +    TableName = proplists:get_value(table_name, Config),
    +    ok = db:delete_table(Ref, TableName),
         ok.
     
     %%--------------------------------------------------------------------
    @@ -126,28 +126,28 @@
     %% Description: Returns the list of groups and test cases that
     %%              are to be executed.
     %%--------------------------------------------------------------------
    -all() ->
    -    [string, integer].
    +all() ->
    +    [string, integer].
     
     
     %%--------------------------------------------------------------------
     %% TEST CASES
     %%--------------------------------------------------------------------
     
    -string(Config) ->
    -    insert_and_lookup(dummy_key, "Dummy string", Config).
    +string(Config) ->
    +    insert_and_lookup(dummy_key, "Dummy string", Config).
     
    -integer(Config) ->
    -    insert_and_lookup(dummy_key, 42, Config).
    +integer(Config) ->
    +    insert_and_lookup(dummy_key, 42, Config).
     
     
    -insert_and_lookup(Key, Value, Config) ->
    -    Ref = proplists:get_value(con_ref, Config),
    -    TableName = proplists:get_value(table_name, Config),
    -    ok = db:insert(Ref, TableName, Key, Value),
    -    [Value] = db:lookup(Ref, TableName, Key),
    -    ok = db:delete(Ref, TableName, Key),
    -    [] = db:lookup(Ref, TableName, Key),
    +insert_and_lookup(Key, Value, Config) ->
    +    Ref = proplists:get_value(con_ref, Config),
    +    TableName = proplists:get_value(table_name, Config),
    +    ok = db:insert(Ref, TableName, Key, Value),
    +    [Value] = db:lookup(Ref, TableName, Key),
    +    ok = db:delete(Ref, TableName, Key),
    +    [] = db:lookup(Ref, TableName, Key),
         ok.

    @@ -165,12 +165,12 @@ %%% %%% Created : %%%------------------------------------------------------------------- --module(example_SUITE). +-module(example_SUITE). %% Note: This directive should only be used in test suites. --compile(export_all). +-compile(export_all). --include_lib("common_test/include/ct.hrl"). +-include_lib("common_test/include/ct.hrl"). %%-------------------------------------------------------------------- %% COMMON TEST CALLBACK FUNCTIONS @@ -188,8 +188,8 @@ %% Note: The suite/0 function is only meant to be used to return %% default data values, not perform any other operations. %%-------------------------------------------------------------------- -suite() -> - [{timetrap,{minutes,10}}]. +suite() -> + [{timetrap,{minutes,10}}]. %%-------------------------------------------------------------------- %% Function: init_per_suite(Config0) -> @@ -205,7 +205,7 @@ %% Note: This function is free to add any key/value pairs to the Config %% variable, but should NOT alter/remove any existing entries. %%-------------------------------------------------------------------- -init_per_suite(Config) -> +init_per_suite(Config) -> Config. %%-------------------------------------------------------------------- @@ -216,7 +216,7 @@ %% %% Description: Cleanup after the suite. %%-------------------------------------------------------------------- -end_per_suite(_Config) -> +end_per_suite(_Config) -> ok. %%-------------------------------------------------------------------- @@ -232,7 +232,7 @@ %% %% Description: Initialization before each test case group. %%-------------------------------------------------------------------- -init_per_group(_GroupName, Config) -> +init_per_group(_GroupName, Config) -> Config. %%-------------------------------------------------------------------- @@ -246,7 +246,7 @@ %% %% Description: Cleanup after each test case group. %%-------------------------------------------------------------------- -end_per_group(_GroupName, _Config) -> +end_per_group(_GroupName, _Config) -> ok. /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/getting_started_chapter.xhtml differs (HTML document, ASCII text, with very long lines (1623)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/getting_started_chapter.xhtml 2026-06-04 00:07:31.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/getting_started_chapter.xhtml 2042-07-06 13:26:59.000000000 +0000 @@ -64,14 +64,14 @@ the test suite module implements callback functions (mandatory or optional) for various purposes, for example:

    • Init/end configuration function for the test suite
    • Init/end configuration function for a test case
    • Init/end configuration function for a test case group
    • Test cases

    The configuration functions are optional. The following example is a test suite without configuration functions, including one simple test case, to check that -module mymod exists (that is, can be successfully loaded by the code server):

    -module(my1st_SUITE).
    --compile(export_all).
    +module mymod exists (that is, can be successfully loaded by the code server):

    -module(my1st_SUITE).
    +-compile(export_all).
     
    -all() ->
    -    [mod_exists].
    +all() ->
    +    [mod_exists].
     
    -mod_exists(_) ->
    -    {module,mymod} = code:load_file(mymod).

    If the operation fails, a bad match error occurs that terminates the test case.

    +mod_exists(_) -> + {module,mymod} = code:load_file(mymod).

    If the operation fails, a bad match error occurs that terminates the test case.

    @@ -84,33 +84,33 @@ through configuration functions on "lower level"). The data flow looks as follows:

    Configuration Data Flow in a Suite

    The following example shows a test suite that uses configuration functions to open and close a log file for the test cases (an operation that is unnecessary -and irrelevant to perform by each test case):

    -module(check_log_SUITE).
    --export([all/0, init_per_suite/1, end_per_suite/1]).
    --export([check_restart_result/1, check_no_errors/1]).
    +and irrelevant to perform by each test case):

    -module(check_log_SUITE).
    +-export([all/0, init_per_suite/1, end_per_suite/1]).
    +-export([check_restart_result/1, check_no_errors/1]).
     
    --define(value(Key,Config), proplists:get_value(Key,Config)).
    +-define(value(Key,Config), proplists:get_value(Key,Config)).
     
    -all() -> [check_restart_result, check_no_errors].
    +all() -> [check_restart_result, check_no_errors].
     
    -init_per_suite(InitConfigData) ->
    -    [{logref,open_log()} | InitConfigData].
    +init_per_suite(InitConfigData) ->
    +    [{logref,open_log()} | InitConfigData].
     
    -end_per_suite(ConfigData) ->
    -    close_log(?value(logref, ConfigData)).
    +end_per_suite(ConfigData) ->
    +    close_log(?value(logref, ConfigData)).
     
    -check_restart_result(ConfigData) ->
    -    TestData = read_log(restart, ?value(logref, ConfigData)),
    -    {match,_Line} = search_for("restart successful", TestData).
    +check_restart_result(ConfigData) ->
    +    TestData = read_log(restart, ?value(logref, ConfigData)),
    +    {match,_Line} = search_for("restart successful", TestData).
     
    -check_no_errors(ConfigData) ->
    -    TestData = read_log(all, ?value(logref, ConfigData)),
    -    case search_for("error", TestData) of
    -        {match,Line} -> ct:fail({error_found_in_log,Line});
    +check_no_errors(ConfigData) ->
    +    TestData = read_log(all, ?value(logref, ConfigData)),
    +    case search_for("error", TestData) of
    +        {match,Line} -> ct:fail({error_found_in_log,Line});
             nomatch -> ok
         end.

    The test cases verify, by parsing a log file, that our SUT has performed a successful restart and that no unexpected errors are printed.

    To execute the test cases in the recent test suite, type the following on the UNIX/Linux command line (assuming that the suite module is in the current -working directory):

    $ ct_run -dir .

    or:

    $ ct_run -suite check_log_SUITE

    To use the Erlang shell to run our test, you can evaluate the following call:

    1> ct:run_test([{dir, "."}]).

    or:

    1> ct:run_test([{suite, "check_log_SUITE"}]).

    The result from running the test is printed in log files in HTML format (stored +working directory):

    $ ct_run -dir .

    or:

    $ ct_run -suite check_log_SUITE

    To use the Erlang shell to run our test, you can evaluate the following call:

    1> ct:run_test([{dir, "."}]).

    or:

    1> ct:run_test([{suite, "check_log_SUITE"}]).

    The result from running the test is printed in log files in HTML format (stored in unique log directories on a different level). The following illustration shows the log file structure:

    HTML Log File Structure

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/run_test_chapter.xhtml differs (HTML document, ASCII text, with very long lines (3302)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/run_test_chapter.xhtml 2026-06-04 00:07:31.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/run_test_chapter.xhtml 2042-07-06 13:26:59.000000000 +0000 @@ -174,7 +174,7 @@

    With the ct_run flag, or ct:run_test/1 option group, one or more test case groups can be specified, optionally in combination with specific test cases. The -syntax for specifying groups on the command line is as follows:

    $ ct_run -group <group_names_or_paths> [-case <cases>]

    The syntax in the Erlang shell is as follows:

    1> ct:run_test([{group,GroupsNamesOrPaths}, {case,Cases}]).

    Parameter group_names_or_paths specifies one or more group names and/or one or +syntax for specifying groups on the command line is as follows:

    $ ct_run -group <group_names_or_paths> [-case <cases>]

    The syntax in the Erlang shell is as follows:

    1> ct:run_test([{group,GroupsNamesOrPaths}, {case,Cases}]).

    Parameter group_names_or_paths specifies one or more group names and/or one or more group paths. At startup, Common Test searches for matching groups in the group definitions tree (that is, the list returned from Suite:groups/0; for details, see section Test Case Groups.

    Given a group name, say g, Common Test searches for all paths leading to @@ -206,30 +206,30 @@ paths if an incomplete group path is specified.

    Note

    Group names and group paths can be combined with parameter group_names_or_paths. Each element is treated as an individual specification in combination with parameter cases. The following examples illustrates -this.

    Examples:

    -module(x_SUITE).
    +this.

    Examples:

    -module(x_SUITE).
     ...
     %% The group definitions:
    -groups() ->
    -  [{top1,[],[tc11,tc12,
    -             {sub11,[],[tc12,tc13]},
    -             {sub12,[],[tc14,tc15,
    -       		 {sub121,[],[tc12,tc16]}]}]},
    -
    -   {top2,[],[{group,sub21},{group,sub22}]},
    -   {sub21,[],[tc21,{group,sub2X2}]},
    -   {sub22,[],[{group,sub221},tc21,tc22,{group,sub2X2}]},
    -   {sub221,[],[tc21,tc23]},
    -   {sub2X2,[],[tc21,tc24]}].

    The following executes two tests, one for all cases and all subgroups under -top1, and one for all under top2:

    $ ct_run -suite "x_SUITE" -group all
    1> ct:run_test([{suite,"x_SUITE"}, {group,all}]).

    Using -group top1 top2, or {group,[top1,top2]} gives the same result.

    The following executes one test for all cases and subgroups under top1:

    $ ct_run -suite "x_SUITE" -group top1
    1> ct:run_test([{suite,"x_SUITE"}, {group,[top1]}]).

    The following runs a test executing tc12 in top1 and any subgroup under -top1 where it can be found (sub11 and sub121):

    $ ct_run -suite "x_SUITE" -group top1 -case tc12
    1> ct:run_test([{suite,"x_SUITE"}, {group,[top1]}, {testcase,[tc12]}]).

    The following executes tc12 only in group top1:

    $ ct_run -suite "x_SUITE" -group [top1] -case tc12
    1> ct:run_test([{suite,"x_SUITE"}, {group,[[top1]]}, {testcase,[tc12]}]).

    The following searches top1 and all its subgroups for tc16 resulting in that -this test case executes in group sub121:

    $ ct_run -suite "x_SUITE" -group top1 -case tc16
    1> ct:run_test([{suite,"x_SUITE"}, {group,[top1]}, {testcase,[tc16]}]).

    Using the specific path -group [sub121] or {group,[[sub121]]} gives the same +groups() -> + [{top1,[],[tc11,tc12, + {sub11,[],[tc12,tc13]}, + {sub12,[],[tc14,tc15, + {sub121,[],[tc12,tc16]}]}]}, + + {top2,[],[{group,sub21},{group,sub22}]}, + {sub21,[],[tc21,{group,sub2X2}]}, + {sub22,[],[{group,sub221},tc21,tc22,{group,sub2X2}]}, + {sub221,[],[tc21,tc23]}, + {sub2X2,[],[tc21,tc24]}].

    The following executes two tests, one for all cases and all subgroups under +top1, and one for all under top2:

    $ ct_run -suite "x_SUITE" -group all
    1> ct:run_test([{suite,"x_SUITE"}, {group,all}]).

    Using -group top1 top2, or {group,[top1,top2]} gives the same result.

    The following executes one test for all cases and subgroups under top1:

    $ ct_run -suite "x_SUITE" -group top1
    1> ct:run_test([{suite,"x_SUITE"}, {group,[top1]}]).

    The following runs a test executing tc12 in top1 and any subgroup under +top1 where it can be found (sub11 and sub121):

    $ ct_run -suite "x_SUITE" -group top1 -case tc12
    1> ct:run_test([{suite,"x_SUITE"}, {group,[top1]}, {testcase,[tc12]}]).

    The following executes tc12 only in group top1:

    $ ct_run -suite "x_SUITE" -group [top1] -case tc12
    1> ct:run_test([{suite,"x_SUITE"}, {group,[[top1]]}, {testcase,[tc12]}]).

    The following searches top1 and all its subgroups for tc16 resulting in that +this test case executes in group sub121:

    $ ct_run -suite "x_SUITE" -group top1 -case tc16
    1> ct:run_test([{suite,"x_SUITE"}, {group,[top1]}, {testcase,[tc16]}]).

    Using the specific path -group [sub121] or {group,[[sub121]]} gives the same result in this example.

    The following executes two tests, one including all cases and subgroups under -sub12, and one with only the test cases in sub12:

    $ ct_run -suite "x_SUITE" -group sub12 [sub12]
    1> ct:run_test([{suite,"x_SUITE"}, {group,[sub12,[sub12]]}]).

    In the following example, Common Test finds and executes two tests, one for +sub12, and one with only the test cases in sub12:

    $ ct_run -suite "x_SUITE" -group sub12 [sub12]
    1> ct:run_test([{suite,"x_SUITE"}, {group,[sub12,[sub12]]}]).

    In the following example, Common Test finds and executes two tests, one for the path from top2 to sub2X2 through sub21, and one from top2 to -sub2X2 through sub22:

    $ ct_run -suite "x_SUITE" -group sub2X2
    1> ct:run_test([{suite,"x_SUITE"}, {group,[sub2X2]}]).

    In the following example, by specifying the unique path +sub2X2 through sub22:

    $ ct_run -suite "x_SUITE" -group sub2X2
    1> ct:run_test([{suite,"x_SUITE"}, {group,[sub2X2]}]).

    In the following example, by specifying the unique path top2 -> sub21 -> sub2X2, only one test is executed. The second possible path, -from top2 to sub2X2 (from the former example) is discarded:

    $ ct_run -suite "x_SUITE" -group [sub21,sub2X2]
    1> ct:run_test([{suite,"x_SUITE"}, {group,[[sub21,sub2X2]]}]).

    The following executes only the test cases for sub22 and in reverse order -compared to the group definition:

    $ ct_run -suite "x_SUITE" -group [sub22] -case tc22 tc21
    1> ct:run_test([{suite,"x_SUITE"}, {group,[[sub22]]}, {testcase,[tc22,tc21]}]).

    If a test case belonging to a group (according to the group definition) is +from top2 to sub2X2 (from the former example) is discarded:

    $ ct_run -suite "x_SUITE" -group [sub21,sub2X2]
    1> ct:run_test([{suite,"x_SUITE"}, {group,[[sub21,sub2X2]]}]).

    The following executes only the test cases for sub22 and in reverse order +compared to the group definition:

    $ ct_run -suite "x_SUITE" -group [sub22] -case tc22 tc21
    1> ct:run_test([{suite,"x_SUITE"}, {group,[[sub22]]}, {testcase,[tc22,tc21]}]).

    If a test case belonging to a group (according to the group definition) is executed without a group specification, that is, simply by (using the command line):

    $ ct_run -suite "my_SUITE" -case my_tc

    or (using the Erlang shell):

    1> ct:run_test([{suite,"my_SUITE"}, {testcase,my_tc}]).

    then Common Test ignores the group definition and executes the test case in the scope of the test suite only (no group configuration functions are called).

    The group specification feature, as presented in this section, can also be used @@ -257,12 +257,12 @@ configuration data with ct:require/1,2. This is equivalent to a require statement in the Test Suite Information Function or in the -Test Case Information Function.

    Example:

    1> ct:require(unix_telnet, unix).
    +Test Case Information Function.

    Example:

    1> ct:require(unix_telnet, unix).
     ok
    -2> ct_telnet:open(unix_telnet).
    -{ok,<0.105.0>}
    -4> ct_telnet:cmd(unix_telnet, "ls .").
    -{ok,["ls .","file1  ...",...]}

    Everything that Common Test normally prints in the test case logs, are in the +2> ct_telnet:open(unix_telnet). +{ok,<0.105.0>} +4> ct_telnet:cmd(unix_telnet, "ls ."). +{ok,["ls .","file1 ...",...]}

    Everything that Common Test normally prints in the test case logs, are in the interactive mode written to a log named ctlog.html in directory ct_run.<timestamp>. A link to this file is available in the file named last_interactive.html in the directory from which you execute ct_run. @@ -349,8 +349,8 @@ included specification can either be joined with the source specification or used to produce a separate test run (as with start flag/option join_specs above).

    Example:

    %% In specification file "a.spec"
    -{specs, join, ["b.spec", "c.spec"]}.
    -{specs, separate, ["d.spec", "e.spec"]}.
    +{specs, join, ["b.spec", "c.spec"]}.
    +{specs, separate, ["d.spec", "e.spec"]}.
     %% Config and test terms follow
     ...

    In this example, the test terms defined in files "b.spec" and "c.spec" are joined with the terms in source specification "a.spec" (if any). The inclusion @@ -412,154 +412,154 @@ available start flags (as most flags have a corresponding configuration term)

  • Logging (for terms verbosity, stylesheet, basic_html and esc_chars)
  • External Configuration Data (for terms config and userconfig)
  • Event Handling (for the -event_handler term)
  • Common Test Hooks (for term ct_hooks)
  • Configuration terms:

    {merge_tests, Bool}.
    +event_handler term)
  • Common Test Hooks (for term ct_hooks)
  • Configuration terms:

    {merge_tests, Bool}.
     
    -{define, Constant, Value}.
    +{define, Constant, Value}.
     
    -{specs, InclSpecsOption, TestSpecs}.
    +{specs, InclSpecsOption, TestSpecs}.
     
    -{node, NodeAlias, Node}.
    +{node, NodeAlias, Node}.
     
    -{init, InitOptions}.
    -{init, [NodeAlias], InitOptions}.
    +{init, InitOptions}.
    +{init, [NodeAlias], InitOptions}.
     
    -{label, Label}.
    -{label, NodeRefs, Label}.
    +{label, Label}.
    +{label, NodeRefs, Label}.
     
    -{verbosity, VerbosityLevels}.
    -{verbosity, NodeRefs, VerbosityLevels}.
    +{verbosity, VerbosityLevels}.
    +{verbosity, NodeRefs, VerbosityLevels}.
     
    -{stylesheet, CSSFile}.
    -{stylesheet, NodeRefs, CSSFile}.
    +{stylesheet, CSSFile}.
    +{stylesheet, NodeRefs, CSSFile}.
     
    -{silent_connections, ConnTypes}.
    -{silent_connections, NodeRefs, ConnTypes}.
    +{silent_connections, ConnTypes}.
    +{silent_connections, NodeRefs, ConnTypes}.
     
    -{multiply_timetraps, N}.
    -{multiply_timetraps, NodeRefs, N}.
    +{multiply_timetraps, N}.
    +{multiply_timetraps, NodeRefs, N}.
     
    -{scale_timetraps, Bool}.
    -{scale_timetraps, NodeRefs, Bool}.
    +{scale_timetraps, Bool}.
    +{scale_timetraps, NodeRefs, Bool}.
     
    -{cover, CoverSpecFile}.
    -{cover, NodeRefs, CoverSpecFile}.
    +{cover, CoverSpecFile}.
    +{cover, NodeRefs, CoverSpecFile}.
     
    -{cover_stop, Bool}.
    -{cover_stop, NodeRefs, Bool}.
    +{cover_stop, Bool}.
    +{cover_stop, NodeRefs, Bool}.
     
    -{include, IncludeDirs}.
    -{include, NodeRefs, IncludeDirs}.
    +{include, IncludeDirs}.
    +{include, NodeRefs, IncludeDirs}.
     
    -{auto_compile, Bool},
    -{auto_compile, NodeRefs, Bool},
    +{auto_compile, Bool},
    +{auto_compile, NodeRefs, Bool},
     
    -{abort_if_missing_suites, Bool},
    -{abort_if_missing_suites, NodeRefs, Bool},
    +{abort_if_missing_suites, Bool},
    +{abort_if_missing_suites, NodeRefs, Bool},
     
    -{config, ConfigFiles}.
    -{config, ConfigDir, ConfigBaseNames}.
    -{config, NodeRefs, ConfigFiles}.
    -{config, NodeRefs, ConfigDir, ConfigBaseNames}.
    +{config, ConfigFiles}.
    +{config, ConfigDir, ConfigBaseNames}.
    +{config, NodeRefs, ConfigFiles}.
    +{config, NodeRefs, ConfigDir, ConfigBaseNames}.
     
    -{userconfig, {CallbackModule, ConfigStrings}}.
    -{userconfig, NodeRefs, {CallbackModule, ConfigStrings}}.
    +{userconfig, {CallbackModule, ConfigStrings}}.
    +{userconfig, NodeRefs, {CallbackModule, ConfigStrings}}.
     
    -{logdir, LogDir}.
    -{logdir, NodeRefs, LogDir}.
    +{logdir, LogDir}.
    +{logdir, NodeRefs, LogDir}.
     
    -{logopts, LogOpts}.
    -{logopts, NodeRefs, LogOpts}.
    +{logopts, LogOpts}.
    +{logopts, NodeRefs, LogOpts}.
     
    -{create_priv_dir, PrivDirOption}.
    -{create_priv_dir, NodeRefs, PrivDirOption}.
    +{create_priv_dir, PrivDirOption}.
    +{create_priv_dir, NodeRefs, PrivDirOption}.
     
    -{event_handler, EventHandlers}.
    -{event_handler, NodeRefs, EventHandlers}.
    -{event_handler, EventHandlers, InitArgs}.
    -{event_handler, NodeRefs, EventHandlers, InitArgs}.
    +{event_handler, EventHandlers}.
    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/unix_telnet.xhtml differs (HTML document, ASCII text, with very long lines (1667))
    --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/unix_telnet.xhtml	2026-06-04 00:07:31.000000000 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/unix_telnet.xhtml	2042-07-06 13:26:59.000000000 +0000
    @@ -24,14 +24,14 @@
     
           

    Callback module for ct_telnet, for connecting to a Telnet server on a UNIX -host.

    It requires the following entry in the configuration file:

    {unix,[{telnet,HostNameOrIpAddress},
    -       {port,PortNum},                 % optional
    -       {username,UserName},
    -       {password,Password},
    -       {keep_alive,Bool}]}.            % optional

    To communicate through Telnet to the host specified by HostNameOrIpAddress, +host.

    It requires the following entry in the configuration file:

    {unix,[{telnet,HostNameOrIpAddress},
    +       {port,PortNum},                 % optional
    +       {username,UserName},
    +       {password,Password},
    +       {keep_alive,Bool}]}.            % optional

    To communicate through Telnet to the host specified by HostNameOrIpAddress, use the interface functions in ct_telnet, for example, open(Name) and cmd(Name,Cmd).

    Name is the name you allocated to the Unix host in your require statement, -for example:

    suite() -> [{require,Name,{unix,[telnet]}}].

    or

    ct:require(Name,{unix,[telnet]}).

    The "keep alive" activity (that is, that Common Test sends NOP to the server +for example:

    suite() -> [{require,Name,{unix,[telnet]}}].

    or

    ct:require(Name,{unix,[telnet]}).

    The "keep alive" activity (that is, that Common Test sends NOP to the server every 10 seconds if the connection is idle) can be enabled or disabled for one particular connection as described here. It can be disabled for all connections using telnet_settings (see ct_telnet).

    The {port,PortNum} tuple is optional and if omitted, default Telnet port 23 is /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/write_test_chapter.xhtml differs (HTML document, ASCII text, with very long lines (1666)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/write_test_chapter.xhtml 2026-06-04 00:07:31.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test.epub/OEBPS/write_test_chapter.xhtml 2042-07-06 13:26:59.000000000 +0000 @@ -161,29 +161,29 @@ system configuration files, the test case is skipped.

    A required variable can also be given a default value to be used if the variable is not found in any configuration file. To specify a default value, add a tuple on the form {default_config,ConfigVariableName,Value} to the -test case information list (the position in the list is irrelevant).

    Examples:

    testcase1() ->
    -    [{require, ftp},
    -     {default_config, ftp, [{ftp, "my_ftp_host"},
    -                            {username, "aladdin"},
    -                            {password, "sesame"}]}}].
    testcase2() ->
    -    [{require, unix_telnet, unix},
    -     {require, {unix, [telnet, username, password]}},
    -     {default_config, unix, [{telnet, "my_telnet_host"},
    -                             {username, "aladdin"},
    -                             {password, "sesame"}]}}].

    For more information about require, see section +test case information list (the position in the list is irrelevant).

    Examples:

    testcase1() ->
    +    [{require, ftp},
    +     {default_config, ftp, [{ftp, "my_ftp_host"},
    +                            {username, "aladdin"},
    +                            {password, "sesame"}]}}].
    testcase2() ->
    +    [{require, unix_telnet, unix},
    +     {require, {unix, [telnet, username, password]}},
    +     {default_config, unix, [{telnet, "my_telnet_host"},
    +                             {username, "aladdin"},
    +                             {password, "sesame"}]}}].

    For more information about require, see section Requiring and Reading Configuration Data in section External Configuration Data and function ct:require/1/2.

    Note

    Specifying a default value for a required variable can result in a test case always getting executed. This might not be a desired behavior.

    If timetrap or require, or both, is not set specifically for a particular test case, default values specified by function -suite/0 are used.

    Tags other than the earlier mentioned are ignored by the test server.

    An example of a test case information function follows:

    reboot_node() ->
    -    [
    -     {timetrap,{seconds,60}},
    -     {require,interfaces},
    -     {userdata,
    -         [{description,"System Upgrade: RpuAddition Normal RebootNode"},
    -          {fts,"http://someserver.ericsson.se/test_doc4711.pdf"}]}
    -    ].

    +suite/0 are used.

    Tags other than the earlier mentioned are ignored by the test server.

    An example of a test case information function follows:

    reboot_node() ->
    +    [
    +     {timetrap,{seconds,60}},
    +     {require,interfaces},
    +     {userdata,
    +         [{description,"System Upgrade: RpuAddition Normal RebootNode"},
    +          {fts,"http://someserver.ericsson.se/test_doc4711.pdf"}]}
    +    ].

    @@ -197,14 +197,14 @@ Test Case Information Function and Test Case Groups.

    The following options can also be specified with the suite information list:

    An example of the suite information function follows:

    suite() ->
    -    [
    -     {timetrap,{minutes,10}},
    -     {require,global_names},
    -     {userdata,[{info,"This suite tests database transactions."}]},
    -     {silent_connections,[telnet]},
    -     {stylesheet,"db_testing.css"}
    -    ].

    +Silent Connections

    An example of the suite information function follows:

    suite() ->
    +    [
    +     {timetrap,{minutes,10}},
    +     {require,global_names},
    +     {userdata,[{info,"This suite tests database transactions."}]},
    +     {silent_connections,[telnet]},
    +     {stylesheet,"db_testing.css"}
    +    ].

    @@ -226,20 +226,20 @@ TCRepeatProps = [{repeat,N} | {repeat_until_ok,N} | {repeat_until_fail,N}]

    GroupName is the name of the group and must be unique within the test suite module. Groups can be nested, by including a group definition within the GroupsAndTestCases list of another group. Properties is the list of -execution properties for the group. The possible values are as follows:

    Properties = [parallel | sequence | Shuffle | {GroupRepeatType,N}]
    -Shuffle = shuffle | {shuffle,Seed}
    -Seed = {integer(),integer(),integer()}
    +execution properties for the group. The possible values are as follows:

    Properties = [parallel | sequence | Shuffle | {GroupRepeatType,N}]
    +Shuffle = shuffle | {shuffle,Seed}
    +Seed = {integer(),integer(),integer()}
     GroupRepeatType = repeat | repeat_until_all_ok | repeat_until_all_fail |
                       repeat_until_any_ok | repeat_until_any_fail
    -N = integer() | forever

    Explanations:

    • parallel - Common Test executes all test cases in the group in +N = integer() | forever

    Explanations:

    • parallel - Common Test executes all test cases in the group in parallel.

    • sequence - The cases are executed in a sequence as described in section Sequences in section Dependencies Between Test Cases and Suites.

    • shuffle - The cases in the group are executed in random order.

    • repeat, repeat_until_* - Orders Common Test to repeat execution of all the cases in the group a given number of times, or until any, or all, cases -fail or succeed.

    Example:

    groups() -> [{group1, [parallel], [test1a,test1b]},
    -             {group2, [shuffle,sequence], [test2a,test2b,test2c]}].

    To specify in which order groups are to be executed (also with respect to test +fail or succeed.

    Example:

    groups() -> [{group1, [parallel], [test1a,test1b]},
    +             {group2, [shuffle,sequence], [test2a,test2b,test2c]}].

    To specify in which order groups are to be executed (also with respect to test cases that are not part of any group), add tuples on the form -{group,GroupName} to the all/0 list.

    Example:

    all() -> [testcase1, {group,group1}, {testcase,testcase2,[{repeat,10}]}, {group,group2}].

    Execution properties with a group tuple in all/0: +{group,GroupName} to the all/0 list.

    Example:

    all() -> [testcase1, {group,group1}, {testcase,testcase2,[{repeat,10}]}, {group,group2}].

    Execution properties with a group tuple in all/0: {group,GroupName,Properties} can also be specified. These properties override those specified in the group definition (see groups/0 earlier). This way, the same set of tests can be run, but with different properties, without having to @@ -248,33 +248,33 @@ SubGroups is a list of tuples, {GroupName,Properties} or {GroupName,Properties,SubGroups} representing the subgroups. Any subgroups defined in groups/0 for a group, that are not specified in the SubGroups -list, executes with their predefined properties.

    Example:

    groups() -> [{tests1, [], [{tests2, [], [t2a,t2b]},
    -                          {tests3, [], [t31,t3b]}]}].

    To execute group tests1 twice with different properties for tests2 each -time:

    all() ->
    -   [{group, tests1, default, [{tests2, [parallel]}]},
    -    {group, tests1, default, [{tests2, [shuffle,{repeat,10}]}]}].

    This is equivalent to the following specification:

    all() ->
    -   [{group, tests1, default, [{tests2, [parallel]},
    -                              {tests3, default}]},
    -    {group, tests1, default, [{tests2, [shuffle,{repeat,10}]},
    -                              {tests3, default}]}].

    Value default states that the predefined properties are to be used.

    The following example shows how to override properties in a scenario with deeply -nested groups:

    groups() ->
    -   [{tests1, [], [{group, tests2}]},
    -    {tests2, [], [{group, tests3}]},
    -    {tests3, [{repeat,2}], [t3a,t3b,t3c]}].
    +list, executes with their predefined properties.

    Example:

    groups() -> [{tests1, [], [{tests2, [], [t2a,t2b]},
    +                          {tests3, [], [t31,t3b]}]}].

    To execute group tests1 twice with different properties for tests2 each +time:

    all() ->
    +   [{group, tests1, default, [{tests2, [parallel]}]},
    +    {group, tests1, default, [{tests2, [shuffle,{repeat,10}]}]}].

    This is equivalent to the following specification:

    all() ->
    +   [{group, tests1, default, [{tests2, [parallel]},
    +                              {tests3, default}]},
    +    {group, tests1, default, [{tests2, [shuffle,{repeat,10}]},
    +                              {tests3, default}]}].

    Value default states that the predefined properties are to be used.

    The following example shows how to override properties in a scenario with deeply +nested groups:

    groups() ->
    +   [{tests1, [], [{group, tests2}]},
    +    {tests2, [], [{group, tests3}]},
    +    {tests3, [{repeat,2}], [t3a,t3b,t3c]}].
     
    -all() ->
    -   [{group, tests1, default,
    -     [{tests2, default,
    -       [{tests3, [parallel,{repeat,100}]}]}]}].

    For ease of readability, all syntax definitions can be replaced by a function -call whose return value should match the expected syntax case.

    Example:

    all() ->
    -   [{group, tests1, default, test_cases()},
    -    {group, tests1, default, [shuffle_test(),
    -                              {tests3, default}]}].
    -test_cases() ->
    -   [{tests2, [parallel]}, {tests3, default}].
    +all() ->
    +   [{group, tests1, default,
    +     [{tests2, default,
    +       [{tests3, [parallel,{repeat,100}]}]}]}].

    For ease of readability, all syntax definitions can be replaced by a function +call whose return value should match the expected syntax case.

    Example:

    all() ->
    +   [{group, tests1, default, test_cases()},
    +    {group, tests1, default, [shuffle_test(),
    +                              {tests3, default}]}].
    +test_cases() ->
    +   [{tests2, [parallel]}, {tests3, default}].
     
    -shuffle_test() ->
    -   {tests2, [shuffle,{repeat,10}]}.

    The described syntax can also be used in test specifications to change group +shuffle_test() -> + {tests2, [shuffle,{repeat,10}]}.

    The described syntax can also be used in test specifications to change group properties at the time of execution, without having to edit the test suite. For more information, see section Test Specifications in section @@ -300,13 +300,13 @@ bottom of the log for end_per_group/2.

    Test case groups can be nested so sets of groups can be configured with the same init_per_group/2 and end_per_group/2 functions. Nested groups can be defined by including a group definition, or a group name reference, in the test case -list of another group.

    Example:

    groups() -> [{group1, [shuffle], [test1a,
    -                                  {group2, [], [test2a,test2b]},
    -                                  test1b]},
    -             {group3, [], [{group,group4},
    -                           {group,group5}]},
    -             {group4, [parallel], [test4a,test4b]},
    -             {group5, [sequence], [test5a,test5b,test5c]}].

    In the previous example, if all/0 returns group name references in the order +list of another group.

    Example:

    groups() -> [{group1, [shuffle], [test1a,
    +                                  {group2, [], [test2a,test2b]},
    +                                  test1b]},
    +             {group3, [], [{group,group4},
    +                           {group,group5}]},
    +             {group4, [parallel], [test4a,test4b]},
    +             {group5, [sequence], [test5a,test5b,test5c]}].

    In the previous example, if all/0 returns group name references in the order [{group,group1},{group,group3}], the order of the configuration functions and test cases becomes the following (notice that init_per_testcase/2 and end_per_testcase/2: are also always called, but not included in this example @@ -379,25 +379,25 @@ account by Common Test when evaluating if execution of a group is to be repeated or not (unless the basic repeat property is used).

    The value of tc_group_properties is a list of status tuples, each with the key ok, skipped, and failed. The value of a status tuple is a list with names -of test cases that have been executed with the corresponding status as result.

    The following is an example of how to return the status from a group:

    end_per_group(_Group, Config) ->
    -    Status = proplists:get_value(tc_group_result, Config),
    -    case proplists:get_value(failed, Status) of
    -        [] ->                                   % no failed cases
    -            {return_group_result,ok};
    +of test cases that have been executed with the corresponding status as result.

    The following is an example of how to return the status from a group:

    end_per_group(_Group, Config) ->
    +    Status = proplists:get_value(tc_group_result, Config),
    +    case proplists:get_value(failed, Status) of
    +        [] ->                                   % no failed cases
    +            {return_group_result,ok};
             _Failed ->                              % one or more failed
    -            {return_group_result,failed}
    +            {return_group_result,failed}
         end.

    It is also possible, in end_per_group/2, to check the status of a subgroup (maybe to determine what status the current group is to return). This is as /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test_app.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (426)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test_app.html 2026-06-04 19:05:03.609461139 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/common_test_app.html 2026-06-04 19:05:03.609461139 +0000 @@ -183,7 +183,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/config_file_chapter.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1269)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/config_file_chapter.html 2026-06-04 19:05:03.630461334 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/config_file_chapter.html 2026-06-04 19:05:03.630461334 +0000 @@ -142,8 +142,8 @@ Syntax -

    A configuration file can contain any number of elements of the type:

    {CfgVarName,Value}.

    where

    CfgVarName = atom()
    -Value = term() | [{CfgVarName,Value}]

    +

    A configuration file can contain any number of elements of the type:

    {CfgVarName,Value}.

    where

    CfgVarName = atom()
    +Value = term() | [{CfgVarName,Value}]

    @@ -170,13 +170,13 @@ any number of alias names, but each name must be unique within the same test suite. The two main uses for alias names follows:

    • To identify connections (described later).
    • To help adapt configuration data to a test suite (or test case) and improve readability.

    To read the value of a configuration variable, use function -get_config/1,2,3.

    Example:

    suite() ->
    -    [{require, domain, 'CONN_SPEC_DNS_SUFFIX'}].
    +get_config/1,2,3.

    Example:

    suite() ->
    +    [{require, domain, 'CONN_SPEC_DNS_SUFFIX'}].
     
     ...
     
    -testcase(Config) ->
    -    Domain = ct:get_config(domain),
    +testcase(Config) ->
    +    Domain = ct:get_config(domain),
         ...

    @@ -261,11 +261,11 @@ </ftp_host> <lm_directory>"/test/loadmodules"</lm_directory> </config>

    Once read, this file produces the same configuration variables as the following -text file:

    {ftp_host, [{ftp,"targethost"},
    -            {username,"tester"},
    -            {password,"letmein"}]}.
    +text file:

    {ftp_host, [{ftp,"targethost"},
    +            {username,"tester"},
    +            {password,"letmein"}]}.
     
    -{lm_directory, "/test/loadmodules"}.

    +{lm_directory, "/test/loadmodules"}.

    @@ -284,55 +284,55 @@ data being reloaded during test execution. The input argument is the same as for function check_parameter/1.

    The return value is to be either of the following:

    • {ok, Config} - if the configuration variables are read successfully.
    • {error, {Error, ErrorDetails}} - if the callback module fails to proceed with the specified configuration parameters.

    Config is the proper Erlang key-value list, with possible key-value sublists -as values, like the earlier configuration file example:

    [{ftp_host, [{ftp, "targethost"}, {username, "tester"}, {password, "letmein"}]},
    - {lm_directory, "/test/loadmodules"}]

    +as values, like the earlier configuration file example:

    [{ftp_host, [{ftp, "targethost"}, {username, "tester"}, {password, "letmein"}]},
    + {lm_directory, "/test/loadmodules"}]

    Examples of Configuration Data Handling

    A configuration file for using the FTP client to access files on a remote host -can look as follows:

    {ftp_host, [{ftp,"targethost"},
    -            {username,"tester"},
    -            {password,"letmein"}]}.
    +can look as follows:

    {ftp_host, [{ftp,"targethost"},
    +            {username,"tester"},
    +            {password,"letmein"}]}.
     
    -{lm_directory, "/test/loadmodules"}.

    The XML version shown earlier can also be used, but it is to be explicitly +{lm_directory, "/test/loadmodules"}.

    The XML version shown earlier can also be used, but it is to be explicitly specified that the ct_config_xml callback module is to be used by Common Test.

    The following is an example of how to assert that the configuration data is -available and can be used for an FTP session:

    init_per_testcase(ftptest, Config) ->
    -    {ok,_} = ct_ftp:open(ftp),
    +available and can be used for an FTP session:

    init_per_testcase(ftptest, Config) ->
    +    {ok,_} = ct_ftp:open(ftp),
         Config.
     
    -end_per_testcase(ftptest, _Config) ->
    -    ct_ftp:close(ftp).
    +end_per_testcase(ftptest, _Config) ->
    +    ct_ftp:close(ftp).
     
    -ftptest() ->
    -    [{require,ftp,ftp_host},
    -     {require,lm_directory}].
    -
    -ftptest(Config) ->
    -    Remote = filename:join(ct:get_config(lm_directory), "loadmodX"),
    -    Local = filename:join(proplists:get_value(priv_dir,Config), "loadmodule"),
    -    ok = ct_ftp:recv(ftp, Remote, Local),
    +ftptest() ->
    +    [{require,ftp,ftp_host},
    +     {require,lm_directory}].
    +
    +ftptest(Config) ->
    +    Remote = filename:join(ct:get_config(lm_directory), "loadmodX"),
    +    Local = filename:join(proplists:get_value(priv_dir,Config), "loadmodule"),
    +    ok = ct_ftp:recv(ftp, Remote, Local),
         ...

    The following is an example of how the functions in the previous example can be -rewritten if it is necessary to open multiple connections to the FTP server:

    init_per_testcase(ftptest, Config) ->
    -    {ok,Handle1} = ct_ftp:open(ftp_host),
    -    {ok,Handle2} = ct_ftp:open(ftp_host),
    -    [{ftp_handles,[Handle1,Handle2]} | Config].
    -
    -end_per_testcase(ftptest, Config) ->
    -    lists:foreach(fun(Handle) -> ct_ftp:close(Handle) end,
    -                  proplists:get_value(ftp_handles,Config)).
    -
    -ftptest() ->
    -    [{require,ftp_host},
    -     {require,lm_directory}].
    -
    -ftptest(Config) ->
    -    Remote = filename:join(ct:get_config(lm_directory), "loadmodX"),
    -    Local = filename:join(proplists:get_value(priv_dir,Config), "loadmodule"),
    -    [Handle | MoreHandles] = proplists:get_value(ftp_handles,Config),
    -    ok = ct_ftp:recv(Handle, Remote, Local),
    +rewritten if it is necessary to open multiple connections to the FTP server:

    init_per_testcase(ftptest, Config) ->
    +    {ok,Handle1} = ct_ftp:open(ftp_host),
    +    {ok,Handle2} = ct_ftp:open(ftp_host),
    +    [{ftp_handles,[Handle1,Handle2]} | Config].
    +
    +end_per_testcase(ftptest, Config) ->
    +    lists:foreach(fun(Handle) -> ct_ftp:close(Handle) end,
    +                  proplists:get_value(ftp_handles,Config)).
    +
    +ftptest() ->
    +    [{require,ftp_host},
    +     {require,lm_directory}].
    +
    +ftptest(Config) ->
    +    Remote = filename:join(ct:get_config(lm_directory), "loadmodX"),
    +    Local = filename:join(proplists:get_value(priv_dir,Config), "loadmodule"),
    +    [Handle | MoreHandles] = proplists:get_value(ftp_handles,Config),
    +    ok = ct_ftp:recv(Handle, Remote, Local),
         ...

    @@ -340,86 +340,86 @@ Example of User-Specific Configuration Handler

    A simple configuration handling driver, asking an external server for -configuration data, can be implemented as follows:

    -module(config_driver).
    --export([read_config/1, check_parameter/1]).
    +configuration data, can be implemented as follows:

    -module(config_driver).
    +-export([read_config/1, check_parameter/1]).
     
    -read_config(ServerName)->
    -    ServerModule = list_to_atom(ServerName),
    -    ServerModule:start(),
    -    ServerModule:get_config().
    -
    -check_parameter(ServerName)->
    -    ServerModule = list_to_atom(ServerName),
    -    case code:is_loaded(ServerModule) of
    -        {file, _}->
    -            {ok, {config, ServerName}};
    +read_config(ServerName)->
    +    ServerModule = list_to_atom(ServerName),
    +    ServerModule:start(),
    +    ServerModule:get_config().
    +
    +check_parameter(ServerName)->
    +    ServerModule = list_to_atom(ServerName),
    +    case code:is_loaded(ServerModule) of
    +        {file, _}->
    +            {ok, {config, ServerName}};
             false->
    -            case code:load_file(ServerModule) of
    -                {module, ServerModule}->
    -                    {ok, {config, ServerName}};
    -                {error, nofile}->
    -                    {error, {wrong_config, "File not found: " ++ ServerName ++ ".beam"}}
    +            case code:load_file(ServerModule) of
    +                {module, ServerModule}->
    +                    {ok, {config, ServerName}};
    +                {error, nofile}->
    +                    {error, {wrong_config, "File not found: " ++ ServerName ++ ".beam"}}
                 end
         end.

    The configuration string for this driver can be config_server, if the config_server.erl module that follows is compiled and exists in the code path -during test execution:

    -module(config_server).
    --export([start/0, stop/0, init/1, get_config/0, loop/0]).
    +during test execution:

    -module(config_server).
    +-export([start/0, stop/0, init/1, get_config/0, loop/0]).
     
    --define(REGISTERED_NAME, ct_test_config_server).
    +-define(REGISTERED_NAME, ct_test_config_server).
     
    -start()->
    -    case whereis(?REGISTERED_NAME) of
    +start()->
    +    case whereis(?REGISTERED_NAME) of
             undefined->
    -            spawn(?MODULE, init, [?REGISTERED_NAME]),
    -            wait();
    +            spawn(?MODULE, init, [?REGISTERED_NAME]),
    +            wait();
             _Pid->
    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/cover_chapter.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1159))
    --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/cover_chapter.html	2026-06-04 19:05:03.647461491 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/cover_chapter.html	2026-06-04 19:05:03.648461500 +0000
    @@ -201,44 +201,44 @@
     

    Here follows the general configuration terms that are allowed in a cover specification file:

    %% List of Nodes on which cover will be active during test.
     %% Nodes = [atom()]
    -{nodes, Nodes}.
    +{nodes, Nodes}.
     
     %% Files with previously exported cover data to include in analysis.
     %% CoverDataFiles = [string()]
    -{import, CoverDataFiles}.
    +{import, CoverDataFiles}.
     
     %% Cover data file to export from this session.
     %% CoverDataFile = string()
    -{export, CoverDataFile}.
    +{export, CoverDataFile}.
     
     %% Cover analysis level.
     %% Level = details | overview
    -{level, Level}.
    +{level, Level}.
     
     %% Directories to include in cover.
     %% Dirs = [string()]
    -{incl_dirs, Dirs}.
    +{incl_dirs, Dirs}.
     
     %% Directories, including subdirectories, to include.
    -{incl_dirs_r, Dirs}.
    +{incl_dirs_r, Dirs}.
     
     %% Specific modules to include in cover.
     %% Mods = [atom()]
    -{incl_mods, Mods}.
    +{incl_mods, Mods}.
     
     %% Directories to exclude in cover.
    -{excl_dirs, Dirs}.
    +{excl_dirs, Dirs}.
     
     %% Directories, including subdirectories, to exclude.
    -{excl_dirs_r, Dirs}.
    +{excl_dirs_r, Dirs}.
     
     %% Specific modules to exclude in cover.
    -{excl_mods, Mods}.
    +{excl_mods, Mods}.
     
     %% Cross cover compilation
     %% Tag = atom(), an identifier for a test run
     %% Mod = [atom()], modules to compile for accumulated analysis
    -{cross,[{Tag,Mods}]}.

    The terms incl_dirs_r and excl_dirs_r tell Common Test to search the +{cross,[{Tag,Mods}]}.

    The terms incl_dirs_r and excl_dirs_r tell Common Test to search the specified directories recursively and include or exclude any module found during the search. The terms incl_dirs and excl_dirs result in a non-recursive search for modules (that is, only modules found in the specified directories are @@ -253,7 +253,7 @@

    When using a cover specification in the testing of an OTP application itself, there is a special incl_app directive that includes the applications modules for -the cover compilation.

    {incl_app, AppName, Cover :: overview | details}.

    Note

    If you desire to also use some other general cover configuration together with +the cover compilation.

    {incl_app, AppName, Cover :: overview | details}.

    Note

    If you desire to also use some other general cover configuration together with this option you should insert the AppName in between the option and its value creating a three tuple.

    @@ -280,7 +280,7 @@ {cross,[{s1,[m1]}]}.

    Then m1 is cover compiled in test run s2, but not shown in the coverage log. Instead, if ct_cover:cross_cover_analyse/2 is called after both s1 and s2 test runs are completed, the accumulated result for m1 is available in the -cross cover log for test run s1.

    The call to the analyze function must be as follows:

    ct_cover:cross_cover_analyse(Level, [{s1,S1LogDir},{s2,S2LogDir}]).

    Here, S1LogDir and S2LogDir are the directories named <TestName>.logs for +cross cover log for test run s1.

    The call to the analyze function must be as follows:

    ct_cover:cross_cover_analyse(Level, [{s1,S1LogDir},{s2,S2LogDir}]).

    Here, S1LogDir and S2LogDir are the directories named <TestName>.logs for each test respectively.

    Notice the tags s1 and s2, which are used in the cover specification file and in the call to ct_cover:cross_cover_analyse/2. The purpose of these is only to map the modules specified in the cover specification to the log @@ -353,7 +353,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (376)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct.html 2026-06-04 19:05:03.690461890 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct.html 2026-06-04 19:05:03.691461899 +0000 @@ -1978,17 +1978,17 @@

    Reads configuration data values.

    Returns the matching values or configuration elements, given a configuration variable key or its associated name (if one has been specified with -ct:require/2 or a require statement).

    Example:

    Given the following configuration file:

    {unix,[{telnet,IpAddr},
    -       {user,[{username,Username},
    -              {password,Password}]}]}.

    Then:

    ct:get_config(unix,Default) -> [{telnet,IpAddr},
    - {user, [{username,Username}, {password,Password}]}]
    -ct:get_config({unix,telnet},Default) -> IpAddr
    -ct:get_config({unix,user,username},Default) -> Username
    -ct:get_config({unix,ftp},Default) -> Default
    -ct:get_config(unknownkey,Default) -> Default

    If a configuration variable key has been associated with a name (by +ct:require/2 or a require statement).

    Example:

    Given the following configuration file:

    {unix,[{telnet,IpAddr},
    +       {user,[{username,Username},
    +              {password,Password}]}]}.

    Then:

    ct:get_config(unix,Default) -> [{telnet,IpAddr},
    + {user, [{username,Username}, {password,Password}]}]
    +ct:get_config({unix,telnet},Default) -> IpAddr
    +ct:get_config({unix,user,username},Default) -> Username
    +ct:get_config({unix,ftp},Default) -> Default
    +ct:get_config(unknownkey,Default) -> Default

    If a configuration variable key has been associated with a name (by ct:require/2 or a require statement), the name can be used -instead of the key to read the value:

    ct:require(myuser,{unix,user}) -> ok.
    -ct:get_config(myuser,Default) -> [{username,Username}, {password,Password}]

    If a configuration variable is defined in multiple files, use option all to +instead of the key to read the value:

    ct:require(myuser,{unix,user}) -> ok.
    +ct:get_config(myuser,Default) -> [{username,Username}, {password,Password}]

    If a configuration variable is defined in multiple files, use option all to access all possible values. The values are returned in a list. The order of the elements corresponds to the order that the configuration files were specified at startup.

    If configuration elements (key-value tuples) are to be returned as result @@ -2026,7 +2026,7 @@

    Gets a reference to the Common Test event manager. The reference can be used -to, for example, add a user-specific event handler while tests are running.

    Example:

    gen_event:add_handler(ct:get_event_mgr_ref(), my_ev_h, [])
    +to, for example, add a user-specific event handler while tests are running.

    Example:

    gen_event:add_handler(ct:get_event_mgr_ref(), my_ev_h, [])
    @@ -2315,7 +2315,7 @@ -

    Installs configuration files and event handlers.

    Run this function once before the first test.

    Example:

    install([{config,["config_node.ctc","config_user.ctc"]}])

    This function is automatically run by program ct_run.

    +

    Installs configuration files and event handlers.

    Run this function once before the first test.

    Example:

    install([{config,["config_node.ctc","config_user.ctc"]}])

    This function is automatically run by program ct_run.

    @@ -3152,7 +3152,7 @@

    Checks if the required configuration is available. Arbitrarily deep tuples can be specified as Required. Only the last element of the tuple can be a list of -SubKeys.

    Example 1. Require the variable myvar:

    ok = ct:require(myvar).

    In this case the configuration file must at least contain:

    {myvar,Value}.

    Example 2. Require key myvar with subkeys sub1 and sub2:

    ok = ct:require({myvar,[sub1,sub2]}).

    In this case the configuration file must at least contain:

    {myvar,[{sub1,Value},{sub2,Value}]}.

    Example 3. Require key myvar with subkey sub1 with subsub1:

    ok = ct:require({myvar,sub1,sub2}).

    In this case the configuration file must at least contain:

    {myvar,[{sub1,[{sub2,Value}]}]}.

    See also ct:get_config/1, +SubKeys.

    Example 1. Require the variable myvar:

    ok = ct:require(myvar).

    In this case the configuration file must at least contain:

    {myvar,Value}.

    Example 2. Require key myvar with subkeys sub1 and sub2:

    ok = ct:require({myvar,[sub1,sub2]}).

    In this case the configuration file must at least contain:

    {myvar,[{sub1,Value},{sub2,Value}]}.

    Example 3. Require key myvar with subkey sub1 with subsub1:

    ok = ct:require({myvar,sub1,sub2}).

    In this case the configuration file must at least contain:

    {myvar,[{sub1,[{sub2,Value}]}]}.

    See also ct:get_config/1, ct:get_config/2, ct:get_config/3, ct:require/2.

    @@ -3194,8 +3194,8 @@ that the value of the element can be read with ct:get_config/1,2 provided Name is used instead of the whole Required term.

    Example:

    Require one node with a Telnet connection and an FTP connection. Name the node -a:

    ok = ct:require(a,{machine,node}).

    All references to this node can then use the node name. For example, a file over -FTP is fetched like follows:

    ok = ct:ftp_get(a,RemoteFile,LocalFile).

    For this to work, the configuration file must at least contain:

    {machine,[{node,[{telnet,IpAddr},{ftp,IpAddr}]}]}.

    Note

    The behavior of this function changed radically in Common Test 1.6.2. To +a:

    ok = ct:require(a,{machine,node}).

    All references to this node can then use the node name. For example, a file over +FTP is fetched like follows:

    ok = ct:ftp_get(a,RemoteFile,LocalFile).

    For this to work, the configuration file must at least contain:

    {machine,[{node,[{telnet,IpAddr},{ftp,IpAddr}]}]}.

    Note

    The behavior of this function changed radically in Common Test 1.6.2. To keep some backwards compatibility, it is still possible to do: ct:require(a,{node,[telnet,ftp]}). This associates the name a with the top-level node entry. For this to work, the configuration file must at least @@ -3570,12 +3570,12 @@ the Erlang shell. The interactive mode can also be started from the OS command line with ct_run -shell [-config File...].

    If any functions (for example, Telnet or FTP) using "required configuration data" are to be called from the Erlang shell, configuration data must first be -required with ct:require/2.

    Example:

    > ct:require(unix_telnet, unix).
    +required with ct:require/2.

    Example:

    > ct:require(unix_telnet, unix).
     ok
    -> ct_telnet:open(unix_telnet).
    -{ok,<0.105.0>}
    -> ct_telnet:cmd(unix_telnet, "ls .").
    -{ok,["ls","file1  ...",...]}
    +>
    ct_telnet:open(unix_telnet). +{ok,<0.105.0>} +> ct_telnet:cmd(unix_telnet, "ls ."). +{ok,["ls","file1 ...",...]}
    @@ -3869,7 +3869,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_cover.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_cover.html 2026-06-04 19:05:03.708462057 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_cover.html 2026-06-04 19:05:03.709462066 +0000 @@ -317,7 +317,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_ftp.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (639)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_ftp.html 2026-06-04 19:05:03.728462243 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_ftp.html 2026-06-04 19:05:03.729462252 +0000 @@ -589,10 +589,10 @@

    Opens an FTP connection and sends a file to the remote host.

    LocalFile and RemoteFile must be absolute paths.

    If the target host is a "special" node, the FTP address must be specified in the -configuration file as follows:

    {node,[{ftp,IpAddr}]}.

    If the target host is something else, for example, a UNIX host, the -configuration file must also include the username and password (both strings):

    {unix,[{ftp,IpAddr},
    -       {username,Username},
    -       {password,Password}]}.

    See also ct:require/2.

    +configuration file as follows:

    {node,[{ftp,IpAddr}]}.

    If the target host is something else, for example, a UNIX host, the +configuration file must also include the username and password (both strings):

    {unix,[{ftp,IpAddr},
    +       {username,Username},
    +       {password,Password}]}.

    See also ct:require/2.

    @@ -774,7 +774,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_hooks.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (467)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_hooks.html 2026-06-04 19:05:03.757462511 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_hooks.html 2026-06-04 19:05:03.757462511 +0000 @@ -1401,7 +1401,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_hooks_chapter.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (2057)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_hooks_chapter.html 2026-06-04 19:05:03.780462725 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_hooks_chapter.html 2026-06-04 19:05:03.781462734 +0000 @@ -253,12 +253,12 @@ always a combination of a result for the suite/group/test and an updated CTHState.

    To let the test suite continue on executing, return the configuration list that you want the test to use as the result.

    All pre hooks, except pre_end_per_testcase/4, can skip or fail the test by -returning a tuple with skip or fail, and a reason as the result.

    Example:

    pre_init_per_suite(SuiteName, Config, CTHState) ->
    -  case db:connect() of
    -    {error,_Reason} ->
    -      {{fail, "Could not connect to DB"}, CTHState};
    -    {ok, Handle} ->
    -      {[{db_handle, Handle} | Config], CTHState#state{ handle = Handle }}
    +returning a tuple with skip or fail, and a reason as the result.

    Example:

    pre_init_per_suite(SuiteName, Config, CTHState) ->
    +  case db:connect() of
    +    {error,_Reason} ->
    +      {{fail, "Could not connect to DB"}, CTHState};
    +    {ok, Handle} ->
    +      {[{db_handle, Handle} | Config], CTHState#state{ handle = Handle }}
       end.

    Note

    If you use multiple CTHs, the first part of the return tuple is used as input for the next CTH. So in the previous example the next CTH can get {fail,Reason} as the second parameter. If you have many CTHs interacting, do @@ -280,18 +280,18 @@ affect the outcome of the test, return the Return data as it is given to the CTH. You can also modify the test result. By returning the Config list with element tc_status removed, you can recover from a test failure. As in all the -pre hooks, it is also possible to fail/skip the test case in the post hook.

    Example:

    post_end_per_testcase(_Suite, _TC, Config, {'EXIT',{_,_}}, CTHState) ->
    -  case db:check_consistency() of
    +pre hooks, it is also possible to fail/skip the test case in the post hook.

    Example:

    post_end_per_testcase(_Suite, _TC, Config, {'EXIT',{_,_}}, CTHState) ->
    +  case db:check_consistency() of
         true ->
           %% DB is good, pass the test.
    -      {proplists:delete(tc_status, Config), CTHState};
    +      {proplists:delete(tc_status, Config), CTHState};
         false ->
           %% DB is not good, mark as skipped instead of failing
    -      {{skip, "DB is inconsistent!"}, CTHState}
    +      {{skip, "DB is inconsistent!"}, CTHState}
       end;
    -post_end_per_testcase(_Suite, _TC, Config, Return, CTHState) ->
    +post_end_per_testcase(_Suite, _TC, Config, Return, CTHState) ->
       %% Do nothing if tc does not crash.
    -  {Return, CTHState}.

    Note

    Do recover from a testcase failure using CTHs only a last resort. If used + {Return, CTHState}.

    Note

    Do recover from a testcase failure using CTHs only a last resort. If used wrongly, it can be very difficult to determine which tests that pass or fail in a test run.

    @@ -340,80 +340,80 @@ %%% ct_run -suite example_SUITE -pa . -ct_hooks example_cth %%% %%% Note `-pa .`: the hook beam file must be in the code path when installing. --module(example_cth). +-module(example_cth). %% Mandatory Callbacks --export([init/2]). +-export([init/2]). %% Optional Callbacks --export([id/1]). +-export([id/1]). --export([pre_init_per_suite/3]). --export([post_end_per_suite/4]). +-export([pre_init_per_suite/3]). +-export([post_end_per_suite/4]). --export([pre_init_per_testcase/4]). --export([post_end_per_testcase/5]). +-export([pre_init_per_testcase/4]). +-export([post_end_per_testcase/5]). --export([on_tc_skip/4]). +-export([on_tc_skip/4]). --export([terminate/1]). +-export([terminate/1]). %% This hook state is threaded through all the callbacks. --record(state, {filename, total, suite_total, ts, tcs, data, skipped}). +-record(state, {filename, total, suite_total, ts, tcs, data, skipped}). %% This example hook prints its results to a file, see terminate/1. --record(test_run, {total, skipped, suites}). +-record(test_run, {total, skipped, suites}). %% Return a unique id for this CTH. %% Using the filename means the hook can be used with different %% log files to separate timing data within the same test run. %% See Installing a CTH for more information. -id(Opts) -> +id(Opts) -> %% the path is relative to the test run directory - proplists:get_value(filename, Opts, "example_cth.log"). + proplists:get_value(filename, Opts, "example_cth.log"). %% Always called before any other callback function. Use this to initiate %% any common state. -init(Id, _Opts) -> - {ok, #state{filename = Id, total = 0, data = []}}. +init(Id, _Opts) -> + {ok, #state{filename = Id, total = 0, data = []}}. %% Called before init_per_suite is called. -pre_init_per_suite(_Suite,Config,State) -> - {Config, State#state{suite_total = 0, tcs = []}}. +pre_init_per_suite(_Suite,Config,State) -> + {Config, State#state{suite_total = 0, tcs = []}}. %% Called after end_per_suite. -post_end_per_suite(Suite,_Config,Return,State) -> - Data = {suites, Suite, State#state.suite_total, - lists:reverse(State#state.tcs)}, - {Return, State#state{data = [Data | State#state.data], - total = State#state.total + State#state.suite_total}}. +post_end_per_suite(Suite,_Config,Return,State) -> + Data = {suites, Suite, State#state.suite_total, + lists:reverse(State#state.tcs)}, + {Return, State#state{data = [Data | State#state.data], + total = State#state.total + State#state.suite_total}}. %% Called before each init_per_testcase. -pre_init_per_testcase(_Suite,_TC,Config,State) -> - Now = erlang:monotonic_time(microsecond), - {Config, State#state{ts = Now, suite_total = State#state.suite_total + 1}}. +pre_init_per_testcase(_Suite,_TC,Config,State) -> + Now = erlang:monotonic_time(microsecond), + {Config, State#state{ts = Now, suite_total = State#state.suite_total + 1}}. %% Called after each end_per_testcase. -post_end_per_testcase(Suite,TC,_Config,Return,State) -> - Now = erlang:monotonic_time(microsecond), - TCInfo = {testcase, Suite, TC, Return, Now - State#state.ts}, - {Return, State#state{ts = undefined, tcs = [TCInfo | State#state.tcs]}}. +post_end_per_testcase(Suite,TC,_Config,Return,State) -> + Now = erlang:monotonic_time(microsecond), + TCInfo = {testcase, Suite, TC, Return, Now - State#state.ts}, + {Return, State#state{ts = undefined, tcs = [TCInfo | State#state.tcs]}}. %% Called when a test case is skipped by either user action %% or due to an init function failing. -on_tc_skip(_Suite, _TC, _Reason, State) -> - State#state{skipped = State#state.skipped + 1}. +on_tc_skip(_Suite, _TC, _Reason, State) -> + State#state{skipped = State#state.skipped + 1}. %% Called when the scope of the CTH is done. -terminate(State) -> +terminate(State) -> %% use append to avoid data loss if the path is reused - {ok, File} = file:open(State#state.filename, [write, append]), - io:format(File, "~p.~n", [results(State)]), - file:close(File), + {ok, File} = file:open(State#state.filename, [write, append]), + io:format(File, "~p.~n", [results(State)]), + file:close(File), ok. -results(State) -> - #state{skipped = Skipped, data = Data, total = Total} = State, - #test_run{total = Total, skipped = Skipped, suites = lists:reverse(Data)}.

    +results(State) -> + #state{skipped = Skipped, data = Data, total = Total} = State, + #test_run{total = Total, skipped = Skipped, suites = lists:reverse(Data)}.

    @@ -493,7 +493,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_master.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (804)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_master.html 2026-06-04 19:05:03.804462948 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_master.html 2026-06-04 19:05:03.804462948 +0000 @@ -448,7 +448,7 @@

    Gets a reference to the Common Test master event manager. The reference can be -used to, for example, add a user-specific event handler while tests are running.

    Example:

    gen_event:add_handler(ct_master:get_event_mgr_ref(), my_ev_h, [])
    +used to, for example, add a user-specific event handler while tests are running.

    Example:

    gen_event:add_handler(ct_master:get_event_mgr_ref(), my_ev_h, [])
    @@ -798,7 +798,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_master_chapter.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1303)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_master_chapter.html 2026-06-04 19:05:03.823463124 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_master_chapter.html 2026-06-04 19:05:03.823463124 +0000 @@ -156,7 +156,7 @@ of test specifications. If it is a list, the specifications are handled (and the corresponding tests executed) in sequence. An element in a TestSpecs list can also be list of test specifications. The specifications in such a list are -merged into one combined specification before test execution.

    Example:

    ct_master:run(["ts1","ts2",["ts3","ts4"]])

    Here, the tests specified by "ts1" run first, then the tests specified by "ts2", +merged into one combined specification before test execution.

    Example:

    ct_master:run(["ts1","ts2",["ts3","ts4"]])

    Here, the tests specified by "ts1" run first, then the tests specified by "ts2", and finally the tests specified by both "ts3" and "ts4".

    The InclNodes argument to run/3 is a list of node names. Function run/3 runs the tests in TestSpecs just like run/1, but also takes any test in TestSpecs, which is not explicitly tagged with a particular node name, and @@ -196,32 +196,32 @@ install an event handler).

    Consider the example in section Test Specifications in section Running Tests and Analysing Results, now extended with node information and -intended to be executed by Common Test Master:

    {define, 'Top', "/home/test"}.
    -{define, 'T1', "'Top'/t1"}.
    -{define, 'T2', "'Top'/t2"}.
    -{define, 'T3', "'Top'/t3"}.
    -{define, 'CfgFile', "config.cfg"}.
    -{define, 'Node', ct_node}.
    -
    -{node, node1, 'Node@host_x'}.
    -{node, node2, 'Node@host_y'}.
    -
    -{logdir, master, "'Top'/master_logs"}.
    -{logdir, "'Top'/logs"}.
    -
    -{config, node1, "'T1'/'CfgFile'"}.
    -{config, node2, "'T2'/'CfgFile'"}.
    -{config, "'T3'/'CfgFile'"}.
    -
    -{suites, node1, 'T1', all}.
    -{skip_suites, node1, 'T1', [t1B_SUITE,t1D_SUITE], "Not implemented"}.
    -{skip_cases, node1, 'T1', t1A_SUITE, [test3,test4], "Irrelevant"}.
    -{skip_cases, node1, 'T1', t1C_SUITE, [test1], "Ignore"}.
    +intended to be executed by Common Test Master:

    {define, 'Top', "/home/test"}.
    +{define, 'T1', "'Top'/t1"}.
    +{define, 'T2', "'Top'/t2"}.
    +{define, 'T3', "'Top'/t3"}.
    +{define, 'CfgFile', "config.cfg"}.
    +{define, 'Node', ct_node}.
    +
    +{node, node1, 'Node@host_x'}.
    +{node, node2, 'Node@host_y'}.
    +
    +{logdir, master, "'Top'/master_logs"}.
    +{logdir, "'Top'/logs"}.
    +
    +{config, node1, "'T1'/'CfgFile'"}.
    +{config, node2, "'T2'/'CfgFile'"}.
    +{config, "'T3'/'CfgFile'"}.
    +
    +{suites, node1, 'T1', all}.
    +{skip_suites, node1, 'T1', [t1B_SUITE,t1D_SUITE], "Not implemented"}.
    +{skip_cases, node1, 'T1', t1A_SUITE, [test3,test4], "Irrelevant"}.
    +{skip_cases, node1, 'T1', t1C_SUITE, [test1], "Ignore"}.
     
    -{suites, node2, 'T2', [t2B_SUITE,t2C_SUITE]}.
    -{cases, node2, 'T2', t2A_SUITE, [test4,test1,test7]}.
    +{suites, node2, 'T2', [t2B_SUITE,t2C_SUITE]}.
    +{cases, node2, 'T2', t2A_SUITE, [test4,test1,test7]}.
     
    -{skip_suites, 'T3', all, "Not implemented"}.

    This example specifies the same tests as the original example. But now if +{skip_suites, 'T3', all, "Not implemented"}.

    This example specifies the same tests as the original example. But now if started with a call to ct_master:run(TestSpecName), test t1 is executed on node ct_node@host_x (node1), test t2 on ct_node@host_y (node2) and test t3 on both node1 and node2. Configuration file t1 is only read on @@ -244,13 +244,13 @@ Automatic Startup of Test Target Nodes

    Initial actions can be started and performed automatically on test target nodes -using test specification term init.

    Two subterms are supported, node_start and eval.

    Example:

    {node, node1, node1@host1}.
    -{node, node2, node1@host2}.
    -{node, node3, node2@host2}.
    -{node, node4, node1@host3}.
    -{init, node1, [{node_start, [{callback_module, my_slave_callback}]}]}.
    -{init, [node2, node3], {node_start, [{username, "ct_user"}, {password, "ct_password"}]}}.
    -{init, node4, {eval, {module, function, []}}}.

    This test specification declares that node1@host1 is to be started using the +using test specification term init.

    Two subterms are supported, node_start and eval.

    Example:

    {node, node1, node1@host1}.
    +{node, node2, node1@host2}.
    +{node, node3, node2@host2}.
    +{node, node4, node1@host3}.
    +{init, node1, [{node_start, [{callback_module, my_slave_callback}]}]}.
    +{init, [node2, node3], {node_start, [{username, "ct_user"}, {password, "ct_password"}]}}.
    +{init, node4, {eval, {module, function, []}}}.

    This test specification declares that node1@host1 is to be started using the user callback function callback_module:my_slave_callback/0, and nodes node1@host2 and node2@host2 are to be started with the default callback module ct_slave. The specified username and password are used to log on to @@ -314,7 +314,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_netconfc.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1594)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_netconfc.html 2026-06-04 19:05:03.860463467 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_netconfc.html 2026-06-04 19:05:03.860463467 +0000 @@ -137,7 +137,7 @@ to the server.

    Alternately, open/1,2 can be used to establish a single session on a dedicated connection. (Or, equivalently, only_open/1,2 followed by hello/1-3.)

    Connect/session options can be specified in a configuration file with entries -like the following.

    {server_id(), [option()]}.

    The server_id/0 or an associated ct:target_name/0 can then be passed to +like the following.

    {server_id(), [option()]}.

    The server_id/0 or an associated ct:target_name/0 can then be passed to the aforementioned functions to use the referenced configuration.

    Signaling

    Protocol operations in the NETCONF protocol are realized as remote procedure calls (RPCs) from client to server and a corresponding reply from server to client. RPCs are sent using like-named functions (eg. @@ -150,8 +150,8 @@ in most cases since a non-response by the server or a missing message-id causes the call to hang indefinitely.

    Logging

    The NETCONF server uses error_logger for logging of NETCONF traffic. A special purpose error handler is implemented in ct_conn_log_h. To use this error -handler, add the cth_conn_log hook in the test suite, for example:

    suite() ->
    -    [{ct_hooks, [{cth_conn_log, [{ct:conn_log_mod(), ct:conn_log_options()}]}]}].

    conn_log_mod() is the name of the Common Test module implementing the +handler, add the cth_conn_log hook in the test suite, for example:

    suite() ->
    +    [{ct_hooks, [{cth_conn_log, [{ct:conn_log_mod(), ct:conn_log_options()}]}]}].

    conn_log_mod() is the name of the Common Test module implementing the connection protocol, for example, ct_netconfc.

    Hook option log_type specifies the type of logging:

    • raw - The sent and received NETCONF data is logged to a separate text file "as is" without any formatting. A link to the file is added to the test case HTML log.

    • pretty - The sent and received NETCONF data is logged to a separate text @@ -162,17 +162,17 @@ option hosts and list the names of the servers/connections to be used in the suite. The connections must be named for this to work, that is, they must be opened with open/2.

      Option hosts has no effect if log_type is set to html or silent.

      The hook options can also be specified in a configuration file with -configuration variable ct_conn_log:

      {ct_conn_log,[{ct:conn_log_mod(), ct:conn_log_options()}]}.

      For example:

      {ct_conn_log,[{ct_netconfc,[{log_type,pretty},
      -                            {hosts,[ct:key_or_name()]}]}]}

      Note

      Hook options specified in a configuration file overwrite the hard-coded hook +configuration variable ct_conn_log:

      {ct_conn_log,[{ct:conn_log_mod(), ct:conn_log_options()}]}.

      For example:

      {ct_conn_log,[{ct_netconfc,[{log_type,pretty},
      +                            {hosts,[ct:key_or_name()]}]}]}

      Note

      Hook options specified in a configuration file overwrite the hard-coded hook options in the test suite.

      Logging Example 1:

      The following ct_hooks statement causes pretty printing of NETCONF traffic to separate logs for the connections named nc_server1 and nc_server2. Any other -connections are logged to default NETCONF log.

      suite() ->
      -   [{ct_hooks, [{cth_conn_log, [{ct_netconfc,[{log_type,pretty}},
      -                                              {hosts,[nc_server1,nc_server2]}]}
      -                               ]}]}].

      Connections must be opened as follows:

      open(nc_server1,[...]),
      -open(nc_server2,[...]).

      Logging Example 2:

      The following configuration file causes raw logging of all NETCONF traffic in to -one single text file:

      {ct_conn_log,[{ct_netconfc,[{log_type,raw}]}]}.

      The ct_hooks statement must look as follows:

      suite() ->
      -    [{ct_hooks, [{cth_conn_log, []}]}].

      The same ct_hooks statement without the configuration file would cause HTML +connections are logged to default NETCONF log.

      suite() ->
      +   [{ct_hooks, [{cth_conn_log, [{ct_netconfc,[{log_type,pretty}},
      +                                              {hosts,[nc_server1,nc_server2]}]}
      +                               ]}]}].

      Connections must be opened as follows:

      open(nc_server1,[...]),
      +open(nc_server2,[...]).

      Logging Example 2:

      The following configuration file causes raw logging of all NETCONF traffic in to +one single text file:

      {ct_conn_log,[{ct_netconfc,[{log_type,raw}]}]}.

      The ct_hooks statement must look as follows:

      suite() ->
      +    [{ct_hooks, [{cth_conn_log, []}]}].

      The same ct_hooks statement without the configuration file would cause HTML logging of all NETCONF connections in to the test case HTML log.

      @@ -2173,8 +2173,8 @@

      Edits configuration data.

      By default only the running target is available, unless the server includes :candidate or :startup in its list of capabilities.

      OptParams can be used for specifying optional parameters (default-operation, test-option, or error-option) to be added to the edit-config request. The -value must be a list containing valid simple XML, for example:

      [{'default-operation', ["none"]},
      - {'error-option', ["rollback-on-error"]}]

      If OptParams is not given, the default value [] is used.

      +value must be a list containing valid simple XML, for example:

      [{'default-operation', ["none"]},
      + {'error-option', ["rollback-on-error"]}]

      If OptParams is not given, the default value [] is used.

      @@ -3296,7 +3296,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_property_test.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (850)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_property_test.html 2026-06-04 19:05:03.887463718 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_property_test.html 2026-06-04 19:05:03.887463718 +0000 @@ -135,30 +135,30 @@ directory has a subdirectory property_test, where everything needed for the property tests are collected. The usual Erlang application directory structure is assumed.

      A typical Common Test test suite using ct_property_test is organized as -follows:

      -module(my_prop_test_SUITE).
      --compile(export_all).
      +follows:

      -module(my_prop_test_SUITE).
      +-compile(export_all).
       
      --include_lib("common_test/include/ct.hrl").
      +-include_lib("common_test/include/ct.hrl").
       
      -all() -> [prop_ftp_case].
      +all() -> [prop_ftp_case].
       
      -init_per_suite(Config) ->
      -    ct_property_test:init_per_suite(Config).
      +init_per_suite(Config) ->
      +    ct_property_test:init_per_suite(Config).
       
       %%%---- test case
      -prop_ftp_case(Config) ->
      -    ct_property_test:quickcheck(
      -      ftp_simple_client_server:prop_ftp(),
      +prop_ftp_case(Config) ->
      +    ct_property_test:quickcheck(
      +      ftp_simple_client_server:prop_ftp(),
             Config
      -     ).

      and the the property test module (in this example + ).

      and the the property test module (in this example ftp_simple_client_server.erl) as almost a usual property testing module (More -examples are in the User's Guide):

      -module(ftp_simple_client_server).
      --export([prop_ftp/0...]).
      +examples are in the User's Guide):

      -module(ftp_simple_client_server).
      +-export([prop_ftp/0...]).
       
      --include_lib("common_test/include/ct_property_test.hrl").
      +-include_lib("common_test/include/ct_property_test.hrl").
       
      -prop_ftp() ->
      -    ?FORALL( ....
      +
      prop_ftp() -> + ?FORALL( ....
      @@ -876,7 +876,7 @@ 'EQC', 'PROPER' or 'TRIQ' set, depending on which tool that is first found. This could make parts of the Erlang property tests code to be included or excluded with the macro directives -ifdef(Macro). or -ifndef(Macro)..

      The file(s) in the property_test subdirectory could, or should, include the -ct_property_test include file:

      -include_lib("common_test/include/ct_property_test.hrl").

      This included file will:

      • Include the correct tool's include file
      • Set the macro 'MOD_eqc' to the correct module name for the selected tool. +ct_property_test include file:

        -include_lib("common_test/include/ct_property_test.hrl").

        This included file will:

        • Include the correct tool's include file
        • Set the macro 'MOD_eqc' to the correct module name for the selected tool. That is, the macro 'MOD_eqc' is set to either eqc, proper or triq.
        @@ -987,8 +987,8 @@

        Presents the result of stateful (statem) property testing using the aggregate function in PropEr, QuickCheck or other similar property testing tool.

        It is assumed to be called inside the property called by quickcheck/2:

        ...
        -RunResult = run_parallel_commands(?MODULE, Cmds),
        -ct_property_test:present_result(?MODULE, Cmds, RunResult, Config)
        +RunResult = run_parallel_commands(?MODULE, Cmds),
        +ct_property_test:present_result(?MODULE, Cmds, RunResult, Config)
         ...

        See the User's Guide for an example of the usage and of the default printout.

        The StatisticsSpec is a list of the tuples:

        • {Title::string(), CollectFun::fun/1}
        • {Title::string(), FrequencyFun::/0, CollectFun::fun/1}

        Each tuple will produce one table in the order of their places in the list.

        • Title will be the title of one result table

        • CollectFun is called with one argument: the Cmds. It should return a list of the values to be counted. The following pre-defined functions exist:

          • ct_property_test:cmnd_names/1 returns a list of commands (function calls) @@ -998,15 +998,15 @@ about sequential and parallel parts from Tool:parallel_commands/1,2
        • FrequencyFun/0 returns a fun/1 which is supposed to take a list of items as input, and return an iolist which will be printed as the table. Per default, the number of each item is counted and the percentage is printed for each. The -list [a,b,a,a,c] could for example return

          ["a 60%\n","b 20%\n","c 20%\n"]

          which will be printed by the print_fun. The default print_fun will print +list [a,b,a,a,c] could for example return

          ["a 60%\n","b 20%\n","c 20%\n"]

          which will be printed by the print_fun. The default print_fun will print it as:

          a 60%
           b 20%
          -c 20%

        The default StatisticsSpec is:

        • For sequential commands:

          [{"Function calls", fun cmnd_names/1},
          - {"Length of command sequences", fun print_frequency_ranges/0,
          -                                                  fun num_calls/1}]
        • For parallel commands:

          [{"Distribution sequential/parallel", fun sequential_parallel/1},
          - {"Function calls", fun cmnd_names/1},
          - {"Length of command sequences", fun print_frequency_ranges/0,
          -                                                  fun num_calls/1}]
        +c 20%

    The default StatisticsSpec is:

    • For sequential commands:

      [{"Function calls", fun cmnd_names/1},
      + {"Length of command sequences", fun print_frequency_ranges/0,
      +                                                  fun num_calls/1}]
    • For parallel commands:

      [{"Distribution sequential/parallel", fun sequential_parallel/1},
      + {"Function calls", fun cmnd_names/1},
      + {"Length of command sequences", fun print_frequency_ranges/0,
      +                                                  fun num_calls/1}]
    @@ -1099,7 +1099,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_property_test_chapter.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (656)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_property_test_chapter.html 2026-06-04 19:05:03.906463894 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_property_test_chapter.html 2026-06-04 19:05:03.906463894 +0000 @@ -147,51 +147,51 @@ Introductory Example

    Assume that we want to test the lists:sort/1 function.

    We need a property to test the function. In normal way, we create -property_test/ct_prop.erl module in the test directory in our application:

    -module(ct_prop).
    --export([prop_sort/0]).
    +property_test/ct_prop.erl module in the test directory in our application:

    -module(ct_prop).
    +-export([prop_sort/0]).
     
     %%% This will include the .hrl file for the installed testing tool:
    --include_lib("common_test/include/ct_property_test.hrl").
    +-include_lib("common_test/include/ct_property_test.hrl").
     
     %%% The property we want to check:
     %%%   For all possibly unsorted lists,
     %%%   the result of lists:sort/1 is sorted.
    -prop_sort() ->
    -    ?FORALL(UnSorted, list(),
    -            is_sorted(lists:sort(UnSorted))
    -           ).
    +prop_sort() ->
    +    ?FORALL(UnSorted, list(),
    +            is_sorted(lists:sort(UnSorted))
    +           ).
     
     %%% Function to check that a list is sorted:
    -is_sorted([]) ->
    +is_sorted([]) ->
         true;
    -is_sorted([_]) ->
    +is_sorted([_]) ->
         true;
    -is_sorted([H1,H2|SortedTail]) when H1 =< H2 ->
    -    is_sorted([H2|SortedTail]);
    -is_sorted(_) ->
    -    false.

    We also need a CommonTest test suite:

    -module(ct_property_test_SUITE).
    --compile(export_all). % Only in tests!
    +is_sorted([H1,H2|SortedTail]) when H1 =< H2 ->
    +    is_sorted([H2|SortedTail]);
    +is_sorted(_) ->
    +    false.

    We also need a CommonTest test suite:

    -module(ct_property_test_SUITE).
    +-compile(export_all). % Only in tests!
     
    --include_lib("common_test/include/ct.hrl").
    +-include_lib("common_test/include/ct.hrl").
     
    -all() -> [prop_sort
    -         ].
    +all() -> [prop_sort
    +         ].
     
     %%% First prepare Config and compile the property tests for the found tool:
    -init_per_suite(Config) ->
    -    ct_property_test:init_per_suite(Config).
    +init_per_suite(Config) ->
    +    ct_property_test:init_per_suite(Config).
     
    -end_per_suite(Config) ->
    +end_per_suite(Config) ->
         Config.
     
     %%%================================================================
     %%% Test suites
     %%%
    -prop_sort(Config) ->
    -    ct_property_test:quickcheck(
    -      ct_prop:prop_sort(),
    +prop_sort(Config) ->
    +    ct_property_test:quickcheck(
    +      ct_prop:prop_sort(),
           Config
    -     ).

    We run it as usual, for example with ct_run in the OS shell:

    ..../test$ ct_run -suite ct_property_test_SUITE
    +     ).

    We run it as usual, for example with ct_run in the OS shell:

    ..../test$ ct_run -suite ct_property_test_SUITE
     .....
     Common Test: Running make in test directories...
     
    @@ -221,13 +221,13 @@
       A stateful testing example
     
     

    Assume a test that generates some parallel stateful commands, and runs 300 -tests:

    prop_parallel(Config) ->
    -    numtests(300,
    -             ?FORALL(Cmds, parallel_commands(?MODULE),
    +tests:

    prop_parallel(Config) ->
    +    numtests(300,
    +             ?FORALL(Cmds, parallel_commands(?MODULE),
                          begin
    -                         RunResult = run_parallel_commands(?MODULE, Cmds),
    -                         ct_property_test:present_result(?MODULE, Cmds, RunResult, Config)
    -                     end)).

    The ct_property_test:present_result/4 is a help function for printing some + RunResult = run_parallel_commands(?MODULE, Cmds), + ct_property_test:present_result(?MODULE, Cmds, RunResult, Config) + end)).

    The ct_property_test:present_result/4 is a help function for printing some statistics in the CommonTest log file.

    Our example test could for example be a simple test of an ftp server, where we perform get, put and delete requests, some of them in parallel. Per default, the result has three sections:

    *** User 2019-12-11 13:28:17.504 ***
    @@ -330,7 +330,7 @@
               Erlang programming language
     
           

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_rpc.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (305)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_rpc.html 2026-06-04 19:05:03.926464079 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_rpc.html 2026-06-04 19:05:03.926464079 +0000 @@ -573,7 +573,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_run_cmd.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (594)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_run_cmd.html 2026-06-04 19:05:03.944464246 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_run_cmd.html 2026-06-04 19:05:03.944464246 +0000 @@ -251,10 +251,10 @@ Run Common Test in Interactive Mode
     ct_run -shell
    -  [-config ConfigFile1 ConfigFile2 ... ConfigFileN]
    -  [-userconfig CallbackModule1 ConfigString1 and CallbackModule2
    -   ConfigString2 and .. and CallbackModuleN ConfigStringN]
    -  [-decrypt_key Key] | [-decrypt_file KeyFile]

    + [-config ConfigFile1 ConfigFile2 ... ConfigFileN] + [-userconfig CallbackModule1 ConfigString1 and CallbackModule2 + ConfigString2 and .. and CallbackModuleN ConfigStringN] + [-decrypt_key Key] | [-decrypt_file KeyFile]

    @@ -309,7 +309,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_slave.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (340)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_slave.html 2026-06-04 19:05:03.964464432 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_slave.html 2026-06-04 19:05:03.963464423 +0000 @@ -567,7 +567,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_snmp.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (2283)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_snmp.html 2026-06-04 19:05:03.992464691 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_snmp.html 2026-06-04 19:05:03.993464701 +0000 @@ -150,15 +150,15 @@ Optional.

  • {agent_target_param_def, [term()] | {data_dir_file, rel_path()}} - Optional.

  • Parameter MgrAgentConfName in the functions is to be a name you allocate in your test suite using a require statement. Example (where -MgrAgentConfName = snmp_mgr_agent):

    suite() -> [{require, snmp_mgr_agent, snmp}].

    or

    ct:require(snmp_mgr_agent, snmp).

    Notice that USM users are needed for SNMPv3 configuration and are not to be +MgrAgentConfName = snmp_mgr_agent):

    suite() -> [{require, snmp_mgr_agent, snmp}].

    or

    ct:require(snmp_mgr_agent, snmp).

    Notice that USM users are needed for SNMPv3 configuration and are not to be confused with users.

    SNMP traps, inform, and report messages are handled by the user callback module. For details, see the SNMP application.

    It is recommended to use the .hrl files created by the Erlang/OTP MIB compiler to define the Object Identifiers (OIDs). For example, to get the Erlang node -name from erlNodeTable in the OTP-MIB:

    Oid = ?erlNodeEntry ++ [?erlNodeName, 1]

    Furthermore, values can be set for SNMP application configuration parameters, +name from erlNodeTable in the OTP-MIB:

    Oid = ?erlNodeEntry ++ [?erlNodeName, 1]

    Furthermore, values can be set for SNMP application configuration parameters, config, server, net_if, and so on (for a list of valid parameters and types, see the User's Guide for the SNMP application). -This is done by defining a configuration data variable on the following form:

    {snmp_app, [{manager, [snmp_app_manager_params()]},
    -            {agent, [snmp_app_agent_params()]}]}.

    A name for the data must be allocated in the suite using require (see the +This is done by defining a configuration data variable on the following form:

    {snmp_app, [{manager, [snmp_app_manager_params()]},
    +            {agent, [snmp_app_agent_params()]}]}.

    A name for the data must be allocated in the suite using require (see the example above). Pass this name as argument SnmpAppConfName to ct_snmp:start/3. ct_snmp specifies default values for some SNMP application configuration parameters (such as {verbosity,trace} for @@ -1930,7 +1930,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_ssh.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (576)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_ssh.html 2026-06-04 19:05:04.045465183 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_ssh.html 2026-06-04 19:05:04.044465174 +0000 @@ -133,14 +133,14 @@ that have been started on existing SSH connections (that is, when the original connection type is ssh). Whenever the connection type is sftp, use the SSH connection reference only.

    The following options are valid for specifying an SSH/SFTP connection (that is, -can be used as configuration elements):

    [{ConnType, Addr},
    - {port, Port},
    - {user, UserName}
    - {password, Pwd}
    - {user_dir, String}
    - {public_key_alg, PubKeyAlg}
    - {connect_timeout, Timeout}
    - {key_cb, KeyCallbackMod}]

    ConnType = ssh | sftp.

    For other types, see ssh.

    All time-out parameters in ct_ssh functions are values in milliseconds.

    +can be used as configuration elements):

    [{ConnType, Addr},
    + {port, Port},
    + {user, UserName}
    + {password, Pwd}
    + {user_dir, String}
    + {public_key_alg, PubKeyAlg}
    + {connect_timeout, Timeout}
    + {key_cb, KeyCallbackMod}]

    ConnType = ssh | sftp.

    For other types, see ssh.

    All time-out parameters in ct_ssh functions are values in milliseconds.

    @@ -3872,7 +3872,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_suite.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (328)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_suite.html 2026-06-04 19:05:04.075465461 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_suite.html 2026-06-04 19:05:04.075465461 +0000 @@ -1653,7 +1653,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_telnet.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1874)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_telnet.html 2026-06-04 19:05:04.101465703 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_telnet.html 2026-06-04 19:05:04.101465703 +0000 @@ -136,14 +136,14 @@ true
  • Polling limit (max number of times to poll to get a remaining string terminated) = 0
  • Polling interval (sleep time between polls) = 1 second
  • The TCP_NODELAY option for the telnet socket is disabled (set to false) per default
  • These parameters can be modified by the user with the following configuration -term:

    {telnet_settings, [{connect_timeout,Millisec},
    -                   {command_timeout,Millisec},
    -                   {reconnection_attempts,N},
    -                   {reconnection_interval,Millisec},
    -                   {keep_alive,Bool},
    -                   {poll_limit,N},
    -                   {poll_interval,Millisec},
    -                   {tcp_nodelay,Bool}]}.

    Millisec = integer(), N = integer()

    Enter the telnet_settings term in a configuration file included in the test +term:

    {telnet_settings, [{connect_timeout,Millisec},
    +                   {command_timeout,Millisec},
    +                   {reconnection_attempts,N},
    +                   {reconnection_interval,Millisec},
    +                   {keep_alive,Bool},
    +                   {poll_limit,N},
    +                   {poll_interval,Millisec},
    +                   {tcp_nodelay,Bool}]}.

    Millisec = integer(), N = integer()

    Enter the telnet_settings term in a configuration file included in the test and ct_telnet retrieves the information automatically.

    keep_alive can be specified per connection, if necessary. For details, see unix_telnet.

    @@ -158,8 +158,8 @@ such as expect/3. However, ct_telnet can be configured to use a special purpose event handler, implemented in ct_conn_log_h, for logging all Telnet traffic. To use this handler, install a Common Test hook named -cth_conn_log. Example (using the test suite information function):

    suite() ->
    -    [{ct_hooks, [{cth_conn_log, [{conn_mod(),hook_options()}]}]}].

    conn_mod() is the name of the Common Test module implementing the connection +cth_conn_log. Example (using the test suite information function):

    suite() ->
    +    [{ct_hooks, [{cth_conn_log, [{conn_mod(),hook_options()}]}]}].

    conn_mod() is the name of the Common Test module implementing the connection protocol, that is, ct_telnet.

    The cth_conn_log hook performs unformatted logging of Telnet data to a separate text file. All Telnet communication is captured and printed, including any data sent from the server. The link to this text file is located at the top @@ -176,15 +176,15 @@ disabled, which results with no prefix data. If the value is set to full prefix contains timestamp and additonal information. If the value is set to short prefix includes only human readable timestamp.

    All cth_conn_log hook options described can also be specified in a -configuration file with configuration variable ct_conn_log.

    Example:

    {ct_conn_log, [{ct_telnet,[{log_type,raw},
    -                           {hosts,[key_or_name()]}]}]}

    Note

    Hook options specified in a configuration file overwrite any hard-coded hook +configuration file with configuration variable ct_conn_log.

    Example:

    {ct_conn_log, [{ct_telnet,[{log_type,raw},
    +                           {hosts,[key_or_name()]}]}]}

    Note

    Hook options specified in a configuration file overwrite any hard-coded hook options in the test suite.

    Logging Example:

    The following ct_hooks statement causes printing of Telnet traffic to separate logs for the connections server1 and server2. Traffic for any other -connections is logged in the default Telnet log.

    suite() ->
    -    [{ct_hooks,
    -      [{cth_conn_log, [{ct_telnet,[{hosts,[server1,server2]}]}]}]}].

    As previously explained, this specification can also be provided by an entry -like the following in a configuration file:

    {ct_conn_log, [{ct_telnet,[{hosts,[server1,server2]}]}]}.

    In this case the ct_hooks statement in the test suite can look as follows:

    suite() ->
    -    [{ct_hooks, [{cth_conn_log, []}]}].

    +connections is logged in the default Telnet log.

    suite() ->
    +    [{ct_hooks,
    +      [{cth_conn_log, [{ct_telnet,[{hosts,[server1,server2]}]}]}]}].

    As previously explained, this specification can also be provided by an entry +like the following in a configuration file:

    {ct_conn_log, [{ct_telnet,[{hosts,[server1,server2]}]}]}.

    In this case the ct_hooks statement in the test suite can look as follows:

    suite() ->
    +    [{ct_hooks, [{cth_conn_log, []}]}].

    @@ -893,9 +893,9 @@ instead of only one Match. Also HaltReason is returned.

  • sequence - All patterns must be matched in a sequence. A match is not concluded until all patterns are matched. This option can be interrupted by one or more HaltPatterns. MatchList is always returned, that is, a list of -Match instead of only one Match. Also HaltReason is returned.

  • Example 1:

    expect(Connection,[{abc,"ABC"},{xyz,"XYZ"}],[sequence,{halt,[{nnn,"NNN"}]}])

    First this tries to match "ABC", and then "XYZ", but if "NNN" appears, the +Match instead of only one Match. Also HaltReason is returned.

    Example 1:

    expect(Connection,[{abc,"ABC"},{xyz,"XYZ"}],[sequence,{halt,[{nnn,"NNN"}]}])

    First this tries to match "ABC", and then "XYZ", but if "NNN" appears, the function returns {error,{nnn,["NNN"]}}. If both "ABC" and "XYZ" are -matched, the function returns {ok,[AbcMatch,XyzMatch]}.

    Example 2:

    expect(Connection,[{abc,"ABC"},{xyz,"XYZ"}],[{repeat,2},{halt,[{nnn,"NNN"}]}])

    This tries to match "ABC" or "XYZ" twice. If "NNN" appears, the function +matched, the function returns {ok,[AbcMatch,XyzMatch]}.

    Example 2:

    expect(Connection,[{abc,"ABC"},{xyz,"XYZ"}],[{repeat,2},{halt,[{nnn,"NNN"}]}])

    This tries to match "ABC" or "XYZ" twice. If "NNN" appears, the function returns HaltReason = {nnn,["NNN"]}.

    Options repeat and sequence can be combined to match a sequence multiple times.

    @@ -1235,7 +1235,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_testspec.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_testspec.html 2026-06-04 19:05:04.121465888 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/ct_testspec.html 2026-06-04 19:05:04.122465897 +0000 @@ -239,7 +239,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/dependencies_chapter.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1170)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/dependencies_chapter.html 2026-06-04 19:05:04.141466074 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/dependencies_chapter.html 2026-06-04 19:05:04.141466074 +0000 @@ -161,65 +161,65 @@ start and stop functionality separately.) The configuration can also be implemented as a common function, maybe grouped with the start function. Finally, the testing of connecting and disconnecting a client can be grouped -into one test case. The resulting suite can look as follows:

    -module(my_server_SUITE).
    --compile(export_all).
    --include_lib("ct.hrl").
    +into one test case. The resulting suite can look as follows:

    -module(my_server_SUITE).
    +-compile(export_all).
    +-include_lib("ct.hrl").
     
     %%% init and end functions...
     
    -suite() -> [{require,my_server_cfg}].
    +suite() -> [{require,my_server_cfg}].
     
    -init_per_testcase(start_and_stop, Config) ->
    +init_per_testcase(start_and_stop, Config) ->
         Config;
     
    -init_per_testcase(config, Config) ->
    -    [{server_pid,start_server()} | Config];
    +init_per_testcase(config, Config) ->
    +    [{server_pid,start_server()} | Config];
     
    -init_per_testcase(_, Config) ->
    -    ServerPid = start_server(),
    -    configure_server(),
    -    [{server_pid,ServerPid} | Config].
    +init_per_testcase(_, Config) ->
    +    ServerPid = start_server(),
    +    configure_server(),
    +    [{server_pid,ServerPid} | Config].
     
    -end_per_testcase(start_and_stop, _) ->
    +end_per_testcase(start_and_stop, _) ->
         ok;
     
    -end_per_testcase(_, Config) ->
    -    ServerPid = proplists:get_value(server_pid, Config),
    -    stop_server(ServerPid).
    +end_per_testcase(_, Config) ->
    +    ServerPid = proplists:get_value(server_pid, Config),
    +    stop_server(ServerPid).
     
     %%% test cases...
     
    -all() -> [start_and_stop, config, connect_and_disconnect].
    +all() -> [start_and_stop, config, connect_and_disconnect].
     
     %% test that starting and stopping works
    -start_and_stop(_) ->
    -    ServerPid = start_server(),
    -    stop_server(ServerPid).
    +start_and_stop(_) ->
    +    ServerPid = start_server(),
    +    stop_server(ServerPid).
     
     %% configuration test
    -config(Config) ->
    -    ServerPid = proplists:get_value(server_pid, Config),
    -    configure_server(ServerPid).
    +config(Config) ->
    +    ServerPid = proplists:get_value(server_pid, Config),
    +    configure_server(ServerPid).
     
     %% test connecting and disconnecting client
    -connect_and_disconnect(Config) ->
    -    ServerPid = proplists:get_value(server_pid, Config),
    -    {ok,SessionId} = my_server:connect(ServerPid),
    -    ok = my_server:disconnect(ServerPid, SessionId).
    +connect_and_disconnect(Config) ->
    +    ServerPid = proplists:get_value(server_pid, Config),
    +    {ok,SessionId} = my_server:connect(ServerPid),
    +    ok = my_server:disconnect(ServerPid, SessionId).
     
     %%% common functions...
     
    -start_server() ->
    -    {ok,ServerPid} = my_server:start(),
    +start_server() ->
    +    {ok,ServerPid} = my_server:start(),
         ServerPid.
     
    -stop_server(ServerPid) ->
    -    ok = my_server:stop(),
    +stop_server(ServerPid) ->
    +    ok = my_server:stop(),
         ok.
     
    -configure_server(ServerPid) ->
    -    ServerCfgData = ct:get_config(my_server_cfg),
    -    ok = my_server:configure(ServerPid, ServerCfgData),
    +configure_server(ServerPid) ->
    +    ServerCfgData = ct:get_config(my_server_cfg),
    +    ok = my_server:configure(ServerPid, ServerCfgData),
         ok.

    @@ -247,40 +247,40 @@ data is to be saved by finction end_per_suite and read by function init_per_suite in the suite that follows. When passing data between suites, Saver carries the name -of the test suite.

    Example:

    -module(server_b_SUITE).
    --compile(export_all).
    --include_lib("ct.hrl").
    +of the test suite.

    Example:

    -module(server_b_SUITE).
    +-compile(export_all).
    +-include_lib("ct.hrl").
     
     %%% init and end functions...
     
    -init_per_suite(Config) ->
    +init_per_suite(Config) ->
         %% read config saved by previous test suite
    -    {server_a_SUITE,OldConfig} = proplists:get_value(saved_config, Config),
    +    {server_a_SUITE,OldConfig} = proplists:get_value(saved_config, Config),
         %% extract server identity (comes from server_a_SUITE)
    -    ServerId = proplists:get_value(server_id, OldConfig),
    -    SessionId = connect_to_server(ServerId),
    -    [{ids,{ServerId,SessionId}} | Config].
    +    ServerId = proplists:get_value(server_id, OldConfig),
    +    SessionId = connect_to_server(ServerId),
    +    [{ids,{ServerId,SessionId}} | Config].
     
    -end_per_suite(Config) ->
    +end_per_suite(Config) ->
         %% save config for server_c_SUITE (session_id and server_id)
    -    {save_config,Config}
    +    {save_config,Config}
     
     %%% test cases...
     
    -all() -> [allocate, deallocate].
    +all() -> [allocate, deallocate].
     
    -allocate(Config) ->
    -    {ServerId,SessionId} = proplists:get_value(ids, Config),
    -    {ok,Handle} = allocate_resource(ServerId, SessionId),
    +allocate(Config) ->
    +    {ServerId,SessionId} = proplists:get_value(ids, Config),
    +    {ok,Handle} = allocate_resource(ServerId, SessionId),
         %% save handle for deallocation test
    -    NewConfig = [{handle,Handle}],
    -    {save_config,NewConfig}.
    +    NewConfig = [{handle,Handle}],
    +    {save_config,NewConfig}.
     
    -deallocate(Config) ->
    -    {ServerId,SessionId} = proplists:get_value(ids, Config),
    -    {allocate,OldConfig} = proplists:get_value(saved_config, Config),
    -    Handle = proplists:get_value(handle, OldConfig),
    -    ok = deallocate_resource(ServerId, SessionId, Handle).

    To save Config data from a test case that is to be skipped, return tuple +deallocate(Config) -> + {ServerId,SessionId} = proplists:get_value(ids, Config), + {allocate,OldConfig} = proplists:get_value(saved_config, Config), + Handle = proplists:get_value(handle, OldConfig), + ok = deallocate_resource(ServerId, SessionId, Handle).

    To save Config data from a test case that is to be skipped, return tuple {skip_and_save,Reason,ConfigList}.

    The result is that the test case is skipped with Reason printed to the log file (as described earlier) and ConfigList is saved for the next test case. ConfigList can be read using proplists:get_value(saved_config, Config), as @@ -300,22 +300,22 @@ property. Test case groups are defined through function groups/0 in the test suite (for details, see section Test Case Groups.

    For example, to ensure that if allocate in server_b_SUITE crashes, -deallocate is skipped, the following sequence can be defined:

    groups() -> [{alloc_and_dealloc, [sequence], [alloc,dealloc]}].

    Assume that the suite contains the test case get_resource_status that is -independent of the other two cases, then function all can look as follows:

    all() -> [{group,alloc_and_dealloc}, get_resource_status].

    If alloc succeeds, dealloc is also executed. If alloc fails however, +deallocate is skipped, the following sequence can be defined:

    groups() -> [{alloc_and_dealloc, [sequence], [alloc,dealloc]}].

    Assume that the suite contains the test case get_resource_status that is +independent of the other two cases, then function all can look as follows:

    all() -> [{group,alloc_and_dealloc}, get_resource_status].

    If alloc succeeds, dealloc is also executed. If alloc fails however, dealloc is not executed but marked as SKIPPED in the HTML log. get_resource_status runs no matter what happens to the alloc_and_dealloc cases.

    Test cases in a sequence are executed in order until all succeed or one fails. If one fails, all following cases in the sequence are skipped. The cases in the sequence that have succeeded up to that point are reported as successful in the -log. Any number of sequences can be specified.

    Example:

    groups() -> [{scenarioA, [sequence], [testA1, testA2]},
    -             {scenarioB, [sequence], [testB1, testB2, testB3]}].
    +log. Any number of sequences can be specified.

    Example:

    groups() -> [{scenarioA, [sequence], [testA1, testA2]},
    +             {scenarioB, [sequence], [testB1, testB2, testB3]}].
     
    -all() -> [test1,
    +all() -> [test1,
               test2,
    -          {group,scenarioA},
    +          {group,scenarioA},
               test3,
    -          {group,scenarioB},
    -          test4].

    A sequence group can have subgroups. Such subgroups can have any property, that + {group,scenarioB}, + test4].

    A sequence group can have subgroups. Such subgroups can have any property, that is, they are not required to also be sequences. If you want the status of the subgroup to affect the sequence on the level above, return {return_group_result,Status} from @@ -373,7 +373,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/event_handler_chapter.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1529)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/event_handler_chapter.html 2026-06-04 19:05:04.159466240 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/event_handler_chapter.html 2026-06-04 19:05:04.159466240 +0000 @@ -168,12 +168,12 @@ ct_run -event_handler_init instead of -event_handler.

    Note

    All event handler modules must have gen_event behavior. These modules must be precompiled and their locations must be added explicitly to the Erlang code server search path (as in the previous example).

    An event_handler tuple in argument Opts has the following definition (see -ct:run_test/1):

    {event_handler,EventHandlers}
    +ct:run_test/1):

    {event_handler,EventHandlers}
     
    -EventHandlers = EH | [EH]
    -EH = atom() | {atom(),InitArgs} | {[atom()],InitArgs}
    -InitArgs = [term()]

    In the following example, two event handlers for the my_SUITE test are -installed:

    1> ct:run_test([{suite,"test/my_SUITE"},{event_handler,[my_evh1,{my_evh2,[node()]}]}]).

    Event handler my_evh1 is started with [] as argument to the init function. +EventHandlers = EH | [EH] +EH = atom() | {atom(),InitArgs} | {[atom()],InitArgs} +InitArgs = [term()]

    In the following example, two event handlers for the my_SUITE test are +installed:

    1> ct:run_test([{suite,"test/my_SUITE"},{event_handler,[my_evh1,{my_evh2,[node()]}]}]).

    Event handler my_evh1 is started with [] as argument to the init function. Event handler my_evh2 is started with the name of the current node in the init argument list.

    Event handlers can also be plugged in using one of the following test specification terms:

    • {event_handler, EventHandlers}
    • {event_handler, EventHandlers, InitArgs}
    • {event_handler, NodeRefs, EventHandlers}
    • {event_handler, NodeRefs, EventHandlers, InitArgs}

    EventHandlers is a list of module names. Before a test session starts, the @@ -323,7 +323,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/example_chapter.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (734)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/example_chapter.html 2026-06-04 19:05:04.179466426 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/example_chapter.html 2026-06-04 19:05:04.180466435 +0000 @@ -131,19 +131,19 @@ Test Suite Example

    -

    The following example test suite shows some tests of a database server:

    -module(db_data_type_SUITE).
    +

    The following example test suite shows some tests of a database server:

    -module(db_data_type_SUITE).
     
    --include_lib("common_test/include/ct.hrl").
    +-include_lib("common_test/include/ct.hrl").
     
     %% Test server callbacks
    --export([suite/0, all/0,
    +-export([suite/0, all/0,
              init_per_suite/1, end_per_suite/1,
    -         init_per_testcase/2, end_per_testcase/2]).
    +         init_per_testcase/2, end_per_testcase/2]).
     
     %% Test cases
    --export([string/1, integer/1]).
    +-export([string/1, integer/1]).
     
    --define(CONNECT_STR, "DSN=sqlserver;UID=alladin;PWD=sesame").
    +-define(CONNECT_STR, "DSN=sqlserver;UID=alladin;PWD=sesame").
     
     %%--------------------------------------------------------------------
     %% COMMON TEST CALLBACK FUNCTIONS
    @@ -158,8 +158,8 @@
     %% Description: Returns list of tuples to set default properties
     %%              for the suite.
     %%--------------------------------------------------------------------
    -suite() ->
    -    [{timetrap,{minutes,1}}].
    +suite() ->
    +    [{timetrap,{minutes,1}}].
     
     %%--------------------------------------------------------------------
     %% Function: init_per_suite(Config0) -> Config1
    @@ -169,10 +169,10 @@
     %%
     %% Description: Initialization before the suite.
     %%--------------------------------------------------------------------
    -init_per_suite(Config) ->
    -    {ok, Ref} = db:connect(?CONNECT_STR, []),
    -    TableName = db_lib:unique_table_name(),
    -    [{con_ref, Ref },{table_name, TableName}| Config].
    +init_per_suite(Config) ->
    +    {ok, Ref} = db:connect(?CONNECT_STR, []),
    +    TableName = db_lib:unique_table_name(),
    +    [{con_ref, Ref },{table_name, TableName}| Config].
     
     %%--------------------------------------------------------------------
     %% Function: end_per_suite(Config) -> term()
    @@ -182,9 +182,9 @@
     %%
     %% Description: Cleanup after the suite.
     %%--------------------------------------------------------------------
    -end_per_suite(Config) ->
    -    Ref = proplists:get_value(con_ref, Config),
    -    db:disconnect(Ref),
    +end_per_suite(Config) ->
    +    Ref = proplists:get_value(con_ref, Config),
    +    db:disconnect(Ref),
         ok.
     
     %%--------------------------------------------------------------------
    @@ -197,10 +197,10 @@
     %%
     %% Description: Initialization before each test case.
     %%--------------------------------------------------------------------
    -init_per_testcase(Case, Config) ->
    -    Ref = proplists:get_value(con_ref, Config),
    -    TableName = proplists:get_value(table_name, Config),
    -    ok = db:create_table(Ref, TableName, table_type(Case)),
    +init_per_testcase(Case, Config) ->
    +    Ref = proplists:get_value(con_ref, Config),
    +    TableName = proplists:get_value(table_name, Config),
    +    ok = db:create_table(Ref, TableName, table_type(Case)),
         Config.
     
     %%--------------------------------------------------------------------
    @@ -213,10 +213,10 @@
     %%
     %% Description: Cleanup after each test case.
     %%--------------------------------------------------------------------
    -end_per_testcase(_Case, Config) ->
    -    Ref = proplists:get_value(con_ref, Config),
    -    TableName = proplists:get_value(table_name, Config),
    -    ok = db:delete_table(Ref, TableName),
    +end_per_testcase(_Case, Config) ->
    +    Ref = proplists:get_value(con_ref, Config),
    +    TableName = proplists:get_value(table_name, Config),
    +    ok = db:delete_table(Ref, TableName),
         ok.
     
     %%--------------------------------------------------------------------
    @@ -231,28 +231,28 @@
     %% Description: Returns the list of groups and test cases that
     %%              are to be executed.
     %%--------------------------------------------------------------------
    -all() ->
    -    [string, integer].
    +all() ->
    +    [string, integer].
     
     
     %%--------------------------------------------------------------------
     %% TEST CASES
     %%--------------------------------------------------------------------
     
    -string(Config) ->
    -    insert_and_lookup(dummy_key, "Dummy string", Config).
    +string(Config) ->
    +    insert_and_lookup(dummy_key, "Dummy string", Config).
     
    -integer(Config) ->
    -    insert_and_lookup(dummy_key, 42, Config).
    +integer(Config) ->
    +    insert_and_lookup(dummy_key, 42, Config).
     
     
    -insert_and_lookup(Key, Value, Config) ->
    -    Ref = proplists:get_value(con_ref, Config),
    -    TableName = proplists:get_value(table_name, Config),
    -    ok = db:insert(Ref, TableName, Key, Value),
    -    [Value] = db:lookup(Ref, TableName, Key),
    -    ok = db:delete(Ref, TableName, Key),
    -    [] = db:lookup(Ref, TableName, Key),
    +insert_and_lookup(Key, Value, Config) ->
    +    Ref = proplists:get_value(con_ref, Config),
    +    TableName = proplists:get_value(table_name, Config),
    +    ok = db:insert(Ref, TableName, Key, Value),
    +    [Value] = db:lookup(Ref, TableName, Key),
    +    ok = db:delete(Ref, TableName, Key),
    +    [] = db:lookup(Ref, TableName, Key),
         ok.

    @@ -270,12 +270,12 @@ %%% %%% Created : %%%------------------------------------------------------------------- --module(example_SUITE). +-module(example_SUITE). %% Note: This directive should only be used in test suites. --compile(export_all). +-compile(export_all). --include_lib("common_test/include/ct.hrl"). +-include_lib("common_test/include/ct.hrl"). %%-------------------------------------------------------------------- %% COMMON TEST CALLBACK FUNCTIONS @@ -293,8 +293,8 @@ %% Note: The suite/0 function is only meant to be used to return %% default data values, not perform any other operations. %%-------------------------------------------------------------------- -suite() -> - [{timetrap,{minutes,10}}]. +suite() -> + [{timetrap,{minutes,10}}]. %%-------------------------------------------------------------------- %% Function: init_per_suite(Config0) -> @@ -310,7 +310,7 @@ %% Note: This function is free to add any key/value pairs to the Config %% variable, but should NOT alter/remove any existing entries. %%-------------------------------------------------------------------- -init_per_suite(Config) -> +init_per_suite(Config) -> Config. %%-------------------------------------------------------------------- @@ -321,7 +321,7 @@ %% %% Description: Cleanup after the suite. %%-------------------------------------------------------------------- -end_per_suite(_Config) -> +end_per_suite(_Config) -> ok. %%-------------------------------------------------------------------- @@ -337,7 +337,7 @@ %% %% Description: Initialization before each test case group. %%-------------------------------------------------------------------- -init_per_group(_GroupName, Config) -> +init_per_group(_GroupName, Config) -> Config. %%-------------------------------------------------------------------- @@ -351,7 +351,7 @@ %% %% Description: Cleanup after each test case group. %%-------------------------------------------------------------------- -end_per_group(_GroupName, _Config) -> +end_per_group(_GroupName, _Config) -> ok. /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/getting_started_chapter.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1623)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/getting_started_chapter.html 2026-06-04 19:05:04.200466621 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/getting_started_chapter.html 2026-06-04 19:05:04.201466630 +0000 @@ -169,14 +169,14 @@ the test suite module implements callback functions (mandatory or optional) for various purposes, for example:

    • Init/end configuration function for the test suite
    • Init/end configuration function for a test case
    • Init/end configuration function for a test case group
    • Test cases

    The configuration functions are optional. The following example is a test suite without configuration functions, including one simple test case, to check that -module mymod exists (that is, can be successfully loaded by the code server):

    -module(my1st_SUITE).
    --compile(export_all).
    +module mymod exists (that is, can be successfully loaded by the code server):

    -module(my1st_SUITE).
    +-compile(export_all).
     
    -all() ->
    -    [mod_exists].
    +all() ->
    +    [mod_exists].
     
    -mod_exists(_) ->
    -    {module,mymod} = code:load_file(mymod).

    If the operation fails, a bad match error occurs that terminates the test case.

    +mod_exists(_) -> + {module,mymod} = code:load_file(mymod).

    If the operation fails, a bad match error occurs that terminates the test case.

    @@ -189,33 +189,33 @@ through configuration functions on "lower level"). The data flow looks as follows:

    Configuration Data Flow in a Suite

    The following example shows a test suite that uses configuration functions to open and close a log file for the test cases (an operation that is unnecessary -and irrelevant to perform by each test case):

    -module(check_log_SUITE).
    --export([all/0, init_per_suite/1, end_per_suite/1]).
    --export([check_restart_result/1, check_no_errors/1]).
    +and irrelevant to perform by each test case):

    -module(check_log_SUITE).
    +-export([all/0, init_per_suite/1, end_per_suite/1]).
    +-export([check_restart_result/1, check_no_errors/1]).
     
    --define(value(Key,Config), proplists:get_value(Key,Config)).
    +-define(value(Key,Config), proplists:get_value(Key,Config)).
     
    -all() -> [check_restart_result, check_no_errors].
    +all() -> [check_restart_result, check_no_errors].
     
    -init_per_suite(InitConfigData) ->
    -    [{logref,open_log()} | InitConfigData].
    +init_per_suite(InitConfigData) ->
    +    [{logref,open_log()} | InitConfigData].
     
    -end_per_suite(ConfigData) ->
    -    close_log(?value(logref, ConfigData)).
    +end_per_suite(ConfigData) ->
    +    close_log(?value(logref, ConfigData)).
     
    -check_restart_result(ConfigData) ->
    -    TestData = read_log(restart, ?value(logref, ConfigData)),
    -    {match,_Line} = search_for("restart successful", TestData).
    +check_restart_result(ConfigData) ->
    +    TestData = read_log(restart, ?value(logref, ConfigData)),
    +    {match,_Line} = search_for("restart successful", TestData).
     
    -check_no_errors(ConfigData) ->
    -    TestData = read_log(all, ?value(logref, ConfigData)),
    -    case search_for("error", TestData) of
    -        {match,Line} -> ct:fail({error_found_in_log,Line});
    +check_no_errors(ConfigData) ->
    +    TestData = read_log(all, ?value(logref, ConfigData)),
    +    case search_for("error", TestData) of
    +        {match,Line} -> ct:fail({error_found_in_log,Line});
             nomatch -> ok
         end.

    The test cases verify, by parsing a log file, that our SUT has performed a successful restart and that no unexpected errors are printed.

    To execute the test cases in the recent test suite, type the following on the UNIX/Linux command line (assuming that the suite module is in the current -working directory):

    $ ct_run -dir .

    or:

    $ ct_run -suite check_log_SUITE

    To use the Erlang shell to run our test, you can evaluate the following call:

    1> ct:run_test([{dir, "."}]).

    or:

    1> ct:run_test([{suite, "check_log_SUITE"}]).

    The result from running the test is printed in log files in HTML format (stored +working directory):

    $ ct_run -dir .

    or:

    $ ct_run -suite check_log_SUITE

    To use the Erlang shell to run our test, you can evaluate the following call:

    1> ct:run_test([{dir, "."}]).

    or:

    1> ct:run_test([{suite, "check_log_SUITE"}]).

    The result from running the test is printed in log files in HTML format (stored in unique log directories on a different level). The following illustration shows the log file structure:

    HTML Log File Structure

    @@ -297,7 +297,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/install_chapter.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/install_chapter.html 2026-06-04 19:05:04.218466788 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/install_chapter.html 2026-06-04 19:05:04.219466797 +0000 @@ -190,7 +190,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/introduction.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/introduction.html 2026-06-04 19:05:04.235466945 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/introduction.html 2026-06-04 19:05:04.235466945 +0000 @@ -204,7 +204,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/notes.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (2913)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/notes.html 2026-06-04 19:05:04.266467233 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/notes.html 2026-06-04 19:05:04.267467242 +0000 @@ -2714,7 +2714,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/run_test_chapter.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (3302)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/run_test_chapter.html 2026-06-04 19:05:04.304467586 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/run_test_chapter.html 2026-06-04 19:05:04.304467586 +0000 @@ -279,7 +279,7 @@

    With the ct_run flag, or ct:run_test/1 option group, one or more test case groups can be specified, optionally in combination with specific test cases. The -syntax for specifying groups on the command line is as follows:

    $ ct_run -group <group_names_or_paths> [-case <cases>]

    The syntax in the Erlang shell is as follows:

    1> ct:run_test([{group,GroupsNamesOrPaths}, {case,Cases}]).

    Parameter group_names_or_paths specifies one or more group names and/or one or +syntax for specifying groups on the command line is as follows:

    $ ct_run -group <group_names_or_paths> [-case <cases>]

    The syntax in the Erlang shell is as follows:

    1> ct:run_test([{group,GroupsNamesOrPaths}, {case,Cases}]).

    Parameter group_names_or_paths specifies one or more group names and/or one or more group paths. At startup, Common Test searches for matching groups in the group definitions tree (that is, the list returned from Suite:groups/0; for details, see section Test Case Groups.

    Given a group name, say g, Common Test searches for all paths leading to @@ -311,30 +311,30 @@ paths if an incomplete group path is specified.

    Note

    Group names and group paths can be combined with parameter group_names_or_paths. Each element is treated as an individual specification in combination with parameter cases. The following examples illustrates -this.

    Examples:

    -module(x_SUITE).
    +this.

    Examples:

    -module(x_SUITE).
     ...
     %% The group definitions:
    -groups() ->
    -  [{top1,[],[tc11,tc12,
    -             {sub11,[],[tc12,tc13]},
    -             {sub12,[],[tc14,tc15,
    -       		 {sub121,[],[tc12,tc16]}]}]},
    -
    -   {top2,[],[{group,sub21},{group,sub22}]},
    -   {sub21,[],[tc21,{group,sub2X2}]},
    -   {sub22,[],[{group,sub221},tc21,tc22,{group,sub2X2}]},
    -   {sub221,[],[tc21,tc23]},
    -   {sub2X2,[],[tc21,tc24]}].

    The following executes two tests, one for all cases and all subgroups under -top1, and one for all under top2:

    $ ct_run -suite "x_SUITE" -group all
    1> ct:run_test([{suite,"x_SUITE"}, {group,all}]).

    Using -group top1 top2, or {group,[top1,top2]} gives the same result.

    The following executes one test for all cases and subgroups under top1:

    $ ct_run -suite "x_SUITE" -group top1
    1> ct:run_test([{suite,"x_SUITE"}, {group,[top1]}]).

    The following runs a test executing tc12 in top1 and any subgroup under -top1 where it can be found (sub11 and sub121):

    $ ct_run -suite "x_SUITE" -group top1 -case tc12
    1> ct:run_test([{suite,"x_SUITE"}, {group,[top1]}, {testcase,[tc12]}]).

    The following executes tc12 only in group top1:

    $ ct_run -suite "x_SUITE" -group [top1] -case tc12
    1> ct:run_test([{suite,"x_SUITE"}, {group,[[top1]]}, {testcase,[tc12]}]).

    The following searches top1 and all its subgroups for tc16 resulting in that -this test case executes in group sub121:

    $ ct_run -suite "x_SUITE" -group top1 -case tc16
    1> ct:run_test([{suite,"x_SUITE"}, {group,[top1]}, {testcase,[tc16]}]).

    Using the specific path -group [sub121] or {group,[[sub121]]} gives the same +groups() -> + [{top1,[],[tc11,tc12, + {sub11,[],[tc12,tc13]}, + {sub12,[],[tc14,tc15, + {sub121,[],[tc12,tc16]}]}]}, + + {top2,[],[{group,sub21},{group,sub22}]}, + {sub21,[],[tc21,{group,sub2X2}]}, + {sub22,[],[{group,sub221},tc21,tc22,{group,sub2X2}]}, + {sub221,[],[tc21,tc23]}, + {sub2X2,[],[tc21,tc24]}].

    The following executes two tests, one for all cases and all subgroups under +top1, and one for all under top2:

    $ ct_run -suite "x_SUITE" -group all
    1> ct:run_test([{suite,"x_SUITE"}, {group,all}]).

    Using -group top1 top2, or {group,[top1,top2]} gives the same result.

    The following executes one test for all cases and subgroups under top1:

    $ ct_run -suite "x_SUITE" -group top1
    1> ct:run_test([{suite,"x_SUITE"}, {group,[top1]}]).

    The following runs a test executing tc12 in top1 and any subgroup under +top1 where it can be found (sub11 and sub121):

    $ ct_run -suite "x_SUITE" -group top1 -case tc12
    1> ct:run_test([{suite,"x_SUITE"}, {group,[top1]}, {testcase,[tc12]}]).

    The following executes tc12 only in group top1:

    $ ct_run -suite "x_SUITE" -group [top1] -case tc12
    1> ct:run_test([{suite,"x_SUITE"}, {group,[[top1]]}, {testcase,[tc12]}]).

    The following searches top1 and all its subgroups for tc16 resulting in that +this test case executes in group sub121:

    $ ct_run -suite "x_SUITE" -group top1 -case tc16
    1> ct:run_test([{suite,"x_SUITE"}, {group,[top1]}, {testcase,[tc16]}]).

    Using the specific path -group [sub121] or {group,[[sub121]]} gives the same result in this example.

    The following executes two tests, one including all cases and subgroups under -sub12, and one with only the test cases in sub12:

    $ ct_run -suite "x_SUITE" -group sub12 [sub12]
    1> ct:run_test([{suite,"x_SUITE"}, {group,[sub12,[sub12]]}]).

    In the following example, Common Test finds and executes two tests, one for +sub12, and one with only the test cases in sub12:

    $ ct_run -suite "x_SUITE" -group sub12 [sub12]
    1> ct:run_test([{suite,"x_SUITE"}, {group,[sub12,[sub12]]}]).

    In the following example, Common Test finds and executes two tests, one for the path from top2 to sub2X2 through sub21, and one from top2 to -sub2X2 through sub22:

    $ ct_run -suite "x_SUITE" -group sub2X2
    1> ct:run_test([{suite,"x_SUITE"}, {group,[sub2X2]}]).

    In the following example, by specifying the unique path +sub2X2 through sub22:

    $ ct_run -suite "x_SUITE" -group sub2X2
    1> ct:run_test([{suite,"x_SUITE"}, {group,[sub2X2]}]).

    In the following example, by specifying the unique path top2 -> sub21 -> sub2X2, only one test is executed. The second possible path, -from top2 to sub2X2 (from the former example) is discarded:

    $ ct_run -suite "x_SUITE" -group [sub21,sub2X2]
    1> ct:run_test([{suite,"x_SUITE"}, {group,[[sub21,sub2X2]]}]).

    The following executes only the test cases for sub22 and in reverse order -compared to the group definition:

    $ ct_run -suite "x_SUITE" -group [sub22] -case tc22 tc21
    1> ct:run_test([{suite,"x_SUITE"}, {group,[[sub22]]}, {testcase,[tc22,tc21]}]).

    If a test case belonging to a group (according to the group definition) is +from top2 to sub2X2 (from the former example) is discarded:

    $ ct_run -suite "x_SUITE" -group [sub21,sub2X2]
    1> ct:run_test([{suite,"x_SUITE"}, {group,[[sub21,sub2X2]]}]).

    The following executes only the test cases for sub22 and in reverse order +compared to the group definition:

    $ ct_run -suite "x_SUITE" -group [sub22] -case tc22 tc21
    1> ct:run_test([{suite,"x_SUITE"}, {group,[[sub22]]}, {testcase,[tc22,tc21]}]).

    If a test case belonging to a group (according to the group definition) is executed without a group specification, that is, simply by (using the command line):

    $ ct_run -suite "my_SUITE" -case my_tc

    or (using the Erlang shell):

    1> ct:run_test([{suite,"my_SUITE"}, {testcase,my_tc}]).

    then Common Test ignores the group definition and executes the test case in the scope of the test suite only (no group configuration functions are called).

    The group specification feature, as presented in this section, can also be used @@ -362,12 +362,12 @@ configuration data with ct:require/1,2. This is equivalent to a require statement in the Test Suite Information Function or in the -Test Case Information Function.

    Example:

    1> ct:require(unix_telnet, unix).
    +Test Case Information Function.

    Example:

    1> ct:require(unix_telnet, unix).
     ok
    -2> ct_telnet:open(unix_telnet).
    -{ok,<0.105.0>}
    -4> ct_telnet:cmd(unix_telnet, "ls .").
    -{ok,["ls .","file1  ...",...]}

    Everything that Common Test normally prints in the test case logs, are in the +2> ct_telnet:open(unix_telnet). +{ok,<0.105.0>} +4> ct_telnet:cmd(unix_telnet, "ls ."). +{ok,["ls .","file1 ...",...]}

    Everything that Common Test normally prints in the test case logs, are in the interactive mode written to a log named ctlog.html in directory ct_run.<timestamp>. A link to this file is available in the file named last_interactive.html in the directory from which you execute ct_run. @@ -454,8 +454,8 @@ included specification can either be joined with the source specification or used to produce a separate test run (as with start flag/option join_specs above).

    Example:

    %% In specification file "a.spec"
    -{specs, join, ["b.spec", "c.spec"]}.
    -{specs, separate, ["d.spec", "e.spec"]}.
    +{specs, join, ["b.spec", "c.spec"]}.
    +{specs, separate, ["d.spec", "e.spec"]}.
     %% Config and test terms follow
     ...

    In this example, the test terms defined in files "b.spec" and "c.spec" are joined with the terms in source specification "a.spec" (if any). The inclusion @@ -517,154 +517,154 @@ available start flags (as most flags have a corresponding configuration term)

  • Logging (for terms verbosity, stylesheet, basic_html and esc_chars)
  • External Configuration Data (for terms config and userconfig)
  • Event Handling (for the -event_handler term)
  • Common Test Hooks (for term ct_hooks)
  • Configuration terms:

    {merge_tests, Bool}.
    +event_handler term)
  • Common Test Hooks (for term ct_hooks)
  • Configuration terms:

    {merge_tests, Bool}.
     
    -{define, Constant, Value}.
    +{define, Constant, Value}.
     
    -{specs, InclSpecsOption, TestSpecs}.
    +{specs, InclSpecsOption, TestSpecs}.
     
    -{node, NodeAlias, Node}.
    +{node, NodeAlias, Node}.
     
    -{init, InitOptions}.
    -{init, [NodeAlias], InitOptions}.
    +{init, InitOptions}.
    +{init, [NodeAlias], InitOptions}.
     
    -{label, Label}.
    -{label, NodeRefs, Label}.
    +{label, Label}.
    +{label, NodeRefs, Label}.
     
    -{verbosity, VerbosityLevels}.
    -{verbosity, NodeRefs, VerbosityLevels}.
    +{verbosity, VerbosityLevels}.
    +{verbosity, NodeRefs, VerbosityLevels}.
     
    -{stylesheet, CSSFile}.
    -{stylesheet, NodeRefs, CSSFile}.
    +{stylesheet, CSSFile}.
    +{stylesheet, NodeRefs, CSSFile}.
     
    -{silent_connections, ConnTypes}.
    -{silent_connections, NodeRefs, ConnTypes}.
    +{silent_connections, ConnTypes}.
    +{silent_connections, NodeRefs, ConnTypes}.
     
    -{multiply_timetraps, N}.
    -{multiply_timetraps, NodeRefs, N}.
    +{multiply_timetraps, N}.
    +{multiply_timetraps, NodeRefs, N}.
     
    -{scale_timetraps, Bool}.
    -{scale_timetraps, NodeRefs, Bool}.
    +{scale_timetraps, Bool}.
    +{scale_timetraps, NodeRefs, Bool}.
     
    -{cover, CoverSpecFile}.
    -{cover, NodeRefs, CoverSpecFile}.
    +{cover, CoverSpecFile}.
    +{cover, NodeRefs, CoverSpecFile}.
     
    -{cover_stop, Bool}.
    -{cover_stop, NodeRefs, Bool}.
    +{cover_stop, Bool}.
    +{cover_stop, NodeRefs, Bool}.
     
    -{include, IncludeDirs}.
    -{include, NodeRefs, IncludeDirs}.
    +{include, IncludeDirs}.
    +{include, NodeRefs, IncludeDirs}.
     
    -{auto_compile, Bool},
    -{auto_compile, NodeRefs, Bool},
    +{auto_compile, Bool},
    +{auto_compile, NodeRefs, Bool},
     
    -{abort_if_missing_suites, Bool},
    -{abort_if_missing_suites, NodeRefs, Bool},
    +{abort_if_missing_suites, Bool},
    +{abort_if_missing_suites, NodeRefs, Bool},
     
    -{config, ConfigFiles}.
    -{config, ConfigDir, ConfigBaseNames}.
    -{config, NodeRefs, ConfigFiles}.
    -{config, NodeRefs, ConfigDir, ConfigBaseNames}.
    +{config, ConfigFiles}.
    +{config, ConfigDir, ConfigBaseNames}.
    +{config, NodeRefs, ConfigFiles}.
    +{config, NodeRefs, ConfigDir, ConfigBaseNames}.
     
    -{userconfig, {CallbackModule, ConfigStrings}}.
    -{userconfig, NodeRefs, {CallbackModule, ConfigStrings}}.
    +{userconfig, {CallbackModule, ConfigStrings}}.
    +{userconfig, NodeRefs, {CallbackModule, ConfigStrings}}.
     
    -{logdir, LogDir}.
    -{logdir, NodeRefs, LogDir}.
    +{logdir, LogDir}.
    +{logdir, NodeRefs, LogDir}.
     
    -{logopts, LogOpts}.
    -{logopts, NodeRefs, LogOpts}.
    +{logopts, LogOpts}.
    +{logopts, NodeRefs, LogOpts}.
     
    -{create_priv_dir, PrivDirOption}.
    -{create_priv_dir, NodeRefs, PrivDirOption}.
    +{create_priv_dir, PrivDirOption}.
    +{create_priv_dir, NodeRefs, PrivDirOption}.
     
    -{event_handler, EventHandlers}.
    -{event_handler, NodeRefs, EventHandlers}.
    -{event_handler, EventHandlers, InitArgs}.
    -{event_handler, NodeRefs, EventHandlers, InitArgs}.
    +{event_handler, EventHandlers}.
    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/search.html differs (HTML document, Unicode text, UTF-8 text)
    --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/search.html	2026-06-04 19:05:04.322467753 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/search.html	2026-06-04 19:05:04.323648181 +0000
    @@ -145,7 +145,7 @@
               Erlang programming language
     
           

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/test_structure_chapter.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/test_structure_chapter.html 2026-06-04 19:05:04.339467910 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/test_structure_chapter.html 2026-06-04 19:05:04.339467910 +0000 @@ -236,7 +236,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/unix_telnet.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1667)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/unix_telnet.html 2026-06-04 19:05:04.358468086 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/unix_telnet.html 2026-06-04 19:05:04.358468086 +0000 @@ -129,14 +129,14 @@

    Callback module for ct_telnet, for connecting to a Telnet server on a UNIX -host.

    It requires the following entry in the configuration file:

    {unix,[{telnet,HostNameOrIpAddress},
    -       {port,PortNum},                 % optional
    -       {username,UserName},
    -       {password,Password},
    -       {keep_alive,Bool}]}.            % optional

    To communicate through Telnet to the host specified by HostNameOrIpAddress, +host.

    It requires the following entry in the configuration file:

    {unix,[{telnet,HostNameOrIpAddress},
    +       {port,PortNum},                 % optional
    +       {username,UserName},
    +       {password,Password},
    +       {keep_alive,Bool}]}.            % optional

    To communicate through Telnet to the host specified by HostNameOrIpAddress, use the interface functions in ct_telnet, for example, open(Name) and cmd(Name,Cmd).

    Name is the name you allocated to the Unix host in your require statement, -for example:

    suite() -> [{require,Name,{unix,[telnet]}}].

    or

    ct:require(Name,{unix,[telnet]}).

    The "keep alive" activity (that is, that Common Test sends NOP to the server +for example:

    suite() -> [{require,Name,{unix,[telnet]}}].

    or

    ct:require(Name,{unix,[telnet]}).

    The "keep alive" activity (that is, that Common Test sends NOP to the server every 10 seconds if the connection is idle) can be enabled or disabled for one particular connection as described here. It can be disabled for all connections using telnet_settings (see ct_telnet).

    The {port,PortNum} tuple is optional and if omitted, default Telnet port 23 is @@ -296,7 +296,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/why_test_chapter.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/why_test_chapter.html 2026-06-04 19:05:04.378468272 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/why_test_chapter.html 2026-06-04 19:05:04.378468272 +0000 @@ -210,7 +210,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/write_test_chapter.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1666)) --- old//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/write_test_chapter.html 2026-06-04 19:05:04.404468513 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/common_test-1.27.4/doc/html/write_test_chapter.html 2026-06-04 19:05:04.405468523 +0000 @@ -266,29 +266,29 @@ system configuration files, the test case is skipped.

    A required variable can also be given a default value to be used if the variable is not found in any configuration file. To specify a default value, add a tuple on the form {default_config,ConfigVariableName,Value} to the -test case information list (the position in the list is irrelevant).

    Examples:

    testcase1() ->
    -    [{require, ftp},
    -     {default_config, ftp, [{ftp, "my_ftp_host"},
    -                            {username, "aladdin"},
    -                            {password, "sesame"}]}}].
    testcase2() ->
    -    [{require, unix_telnet, unix},
    -     {require, {unix, [telnet, username, password]}},
    -     {default_config, unix, [{telnet, "my_telnet_host"},
    -                             {username, "aladdin"},
    -                             {password, "sesame"}]}}].

    For more information about require, see section +test case information list (the position in the list is irrelevant).

    Examples:

    testcase1() ->
    +    [{require, ftp},
    +     {default_config, ftp, [{ftp, "my_ftp_host"},
    +                            {username, "aladdin"},
    +                            {password, "sesame"}]}}].
    testcase2() ->
    +    [{require, unix_telnet, unix},
    +     {require, {unix, [telnet, username, password]}},
    +     {default_config, unix, [{telnet, "my_telnet_host"},
    +                             {username, "aladdin"},
    +                             {password, "sesame"}]}}].

    For more information about require, see section Requiring and Reading Configuration Data in section External Configuration Data and function ct:require/1/2.

    Note

    Specifying a default value for a required variable can result in a test case always getting executed. This might not be a desired behavior.

    If timetrap or require, or both, is not set specifically for a particular test case, default values specified by function -suite/0 are used.

    Tags other than the earlier mentioned are ignored by the test server.

    An example of a test case information function follows:

    reboot_node() ->
    -    [
    -     {timetrap,{seconds,60}},
    -     {require,interfaces},
    -     {userdata,
    -         [{description,"System Upgrade: RpuAddition Normal RebootNode"},
    -          {fts,"http://someserver.ericsson.se/test_doc4711.pdf"}]}
    -    ].

    +suite/0 are used.

    Tags other than the earlier mentioned are ignored by the test server.

    An example of a test case information function follows:

    reboot_node() ->
    +    [
    +     {timetrap,{seconds,60}},
    +     {require,interfaces},
    +     {userdata,
    +         [{description,"System Upgrade: RpuAddition Normal RebootNode"},
    +          {fts,"http://someserver.ericsson.se/test_doc4711.pdf"}]}
    +    ].

    @@ -302,14 +302,14 @@ Test Case Information Function and Test Case Groups.

    The following options can also be specified with the suite information list:

    An example of the suite information function follows:

    suite() ->
    -    [
    -     {timetrap,{minutes,10}},
    -     {require,global_names},
    -     {userdata,[{info,"This suite tests database transactions."}]},
    -     {silent_connections,[telnet]},
    -     {stylesheet,"db_testing.css"}
    -    ].

    +Silent Connections

    An example of the suite information function follows:

    suite() ->
    +    [
    +     {timetrap,{minutes,10}},
    +     {require,global_names},
    +     {userdata,[{info,"This suite tests database transactions."}]},
    +     {silent_connections,[telnet]},
    +     {stylesheet,"db_testing.css"}
    +    ].

    @@ -331,20 +331,20 @@ TCRepeatProps = [{repeat,N} | {repeat_until_ok,N} | {repeat_until_fail,N}]

    GroupName is the name of the group and must be unique within the test suite module. Groups can be nested, by including a group definition within the GroupsAndTestCases list of another group. Properties is the list of -execution properties for the group. The possible values are as follows:

    Properties = [parallel | sequence | Shuffle | {GroupRepeatType,N}]
    -Shuffle = shuffle | {shuffle,Seed}
    -Seed = {integer(),integer(),integer()}
    +execution properties for the group. The possible values are as follows:

    Properties = [parallel | sequence | Shuffle | {GroupRepeatType,N}]
    +Shuffle = shuffle | {shuffle,Seed}
    +Seed = {integer(),integer(),integer()}
     GroupRepeatType = repeat | repeat_until_all_ok | repeat_until_all_fail |
                       repeat_until_any_ok | repeat_until_any_fail
    -N = integer() | forever

    Explanations:

    • parallel - Common Test executes all test cases in the group in +N = integer() | forever

    Explanations:

    • parallel - Common Test executes all test cases in the group in parallel.

    • sequence - The cases are executed in a sequence as described in section Sequences in section Dependencies Between Test Cases and Suites.

    • shuffle - The cases in the group are executed in random order.

    • repeat, repeat_until_* - Orders Common Test to repeat execution of all the cases in the group a given number of times, or until any, or all, cases -fail or succeed.

    Example:

    groups() -> [{group1, [parallel], [test1a,test1b]},
    -             {group2, [shuffle,sequence], [test2a,test2b,test2c]}].

    To specify in which order groups are to be executed (also with respect to test +fail or succeed.

    Example:

    groups() -> [{group1, [parallel], [test1a,test1b]},
    +             {group2, [shuffle,sequence], [test2a,test2b,test2c]}].

    To specify in which order groups are to be executed (also with respect to test cases that are not part of any group), add tuples on the form -{group,GroupName} to the all/0 list.

    Example:

    all() -> [testcase1, {group,group1}, {testcase,testcase2,[{repeat,10}]}, {group,group2}].

    Execution properties with a group tuple in all/0: +{group,GroupName} to the all/0 list.

    Example:

    all() -> [testcase1, {group,group1}, {testcase,testcase2,[{repeat,10}]}, {group,group2}].

    Execution properties with a group tuple in all/0: {group,GroupName,Properties} can also be specified. These properties override those specified in the group definition (see groups/0 earlier). This way, the same set of tests can be run, but with different properties, without having to @@ -353,33 +353,33 @@ SubGroups is a list of tuples, {GroupName,Properties} or {GroupName,Properties,SubGroups} representing the subgroups. Any subgroups defined in groups/0 for a group, that are not specified in the SubGroups -list, executes with their predefined properties.

    Example:

    groups() -> [{tests1, [], [{tests2, [], [t2a,t2b]},
    -                          {tests3, [], [t31,t3b]}]}].

    To execute group tests1 twice with different properties for tests2 each -time:

    all() ->
    -   [{group, tests1, default, [{tests2, [parallel]}]},
    -    {group, tests1, default, [{tests2, [shuffle,{repeat,10}]}]}].

    This is equivalent to the following specification:

    all() ->
    -   [{group, tests1, default, [{tests2, [parallel]},
    -                              {tests3, default}]},
    -    {group, tests1, default, [{tests2, [shuffle,{repeat,10}]},
    -                              {tests3, default}]}].

    Value default states that the predefined properties are to be used.

    The following example shows how to override properties in a scenario with deeply -nested groups:

    groups() ->
    -   [{tests1, [], [{group, tests2}]},
    -    {tests2, [], [{group, tests3}]},
    -    {tests3, [{repeat,2}], [t3a,t3b,t3c]}].
    -
    -all() ->
    -   [{group, tests1, default,
    -     [{tests2, default,
    -       [{tests3, [parallel,{repeat,100}]}]}]}].

    For ease of readability, all syntax definitions can be replaced by a function -call whose return value should match the expected syntax case.

    Example:

    all() ->
    -   [{group, tests1, default, test_cases()},
    -    {group, tests1, default, [shuffle_test(),
    -                              {tests3, default}]}].
    -test_cases() ->
    -   [{tests2, [parallel]}, {tests3, default}].
    +list, executes with their predefined properties.

    Example:

    groups() -> [{tests1, [], [{tests2, [], [t2a,t2b]},
    +                          {tests3, [], [t31,t3b]}]}].

    To execute group tests1 twice with different properties for tests2 each +time:

    all() ->
    +   [{group, tests1, default, [{tests2, [parallel]}]},
    +    {group, tests1, default, [{tests2, [shuffle,{repeat,10}]}]}].

    This is equivalent to the following specification:

    all() ->
    +   [{group, tests1, default, [{tests2, [parallel]},
    +                              {tests3, default}]},
    +    {group, tests1, default, [{tests2, [shuffle,{repeat,10}]},
    +                              {tests3, default}]}].

    Value default states that the predefined properties are to be used.

    The following example shows how to override properties in a scenario with deeply +nested groups:

    groups() ->
    +   [{tests1, [], [{group, tests2}]},
    +    {tests2, [], [{group, tests3}]},
    +    {tests3, [{repeat,2}], [t3a,t3b,t3c]}].
    +
    +all() ->
    +   [{group, tests1, default,
    +     [{tests2, default,
    +       [{tests3, [parallel,{repeat,100}]}]}]}].

    For ease of readability, all syntax definitions can be replaced by a function +call whose return value should match the expected syntax case.

    Example:

    all() ->
    +   [{group, tests1, default, test_cases()},
    +    {group, tests1, default, [shuffle_test(),
    +                              {tests3, default}]}].
    +test_cases() ->
    +   [{tests2, [parallel]}, {tests3, default}].
     
    -shuffle_test() ->
    -   {tests2, [shuffle,{repeat,10}]}.

    The described syntax can also be used in test specifications to change group +shuffle_test() -> + {tests2, [shuffle,{repeat,10}]}.

    The described syntax can also be used in test specifications to change group properties at the time of execution, without having to edit the test suite. For more information, see section Test Specifications in section @@ -405,13 +405,13 @@ bottom of the log for end_per_group/2.

    Test case groups can be nested so sets of groups can be configured with the same init_per_group/2 and end_per_group/2 functions. Nested groups can be defined by including a group definition, or a group name reference, in the test case -list of another group.

    Example:

    groups() -> [{group1, [shuffle], [test1a,
    -                                  {group2, [], [test2a,test2b]},
    -                                  test1b]},
    -             {group3, [], [{group,group4},
    -                           {group,group5}]},
    -             {group4, [parallel], [test4a,test4b]},
    -             {group5, [sequence], [test5a,test5b,test5c]}].

    In the previous example, if all/0 returns group name references in the order +list of another group.

    Example:

    groups() -> [{group1, [shuffle], [test1a,
    +                                  {group2, [], [test2a,test2b]},
    +                                  test1b]},
    +             {group3, [], [{group,group4},
    +                           {group,group5}]},
    +             {group4, [parallel], [test4a,test4b]},
    +             {group5, [sequence], [test5a,test5b,test5c]}].

    In the previous example, if all/0 returns group name references in the order [{group,group1},{group,group3}], the order of the configuration functions and test cases becomes the following (notice that init_per_testcase/2 and end_per_testcase/2: are also always called, but not included in this example @@ -484,25 +484,25 @@ account by Common Test when evaluating if execution of a group is to be repeated or not (unless the basic repeat property is used).

    The value of tc_group_properties is a list of status tuples, each with the key ok, skipped, and failed. The value of a status tuple is a list with names -of test cases that have been executed with the corresponding status as result.

    The following is an example of how to return the status from a group:

    end_per_group(_Group, Config) ->
    -    Status = proplists:get_value(tc_group_result, Config),
    -    case proplists:get_value(failed, Status) of
    -        [] ->                                   % no failed cases
    -            {return_group_result,ok};
    +of test cases that have been executed with the corresponding status as result.

    The following is an example of how to return the status from a group:

    end_per_group(_Group, Config) ->
    +    Status = proplists:get_value(tc_group_result, Config),
    +    case proplists:get_value(failed, Status) of
    +        [] ->                                   % no failed cases
    +            {return_group_result,ok};
             _Failed ->                              % one or more failed
    -            {return_group_result,failed}
    +            {return_group_result,failed}
         end.

    It is also possible, in end_per_group/2, to check the status of a subgroup /usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/404.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/404.html 2026-06-04 19:05:04.421468671 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/404.html 2026-06-04 19:05:04.422865557 +0000 @@ -147,7 +147,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/api-reference.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/api-reference.html 2026-06-04 19:05:04.439468838 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/api-reference.html 2026-06-04 19:05:04.439468838 +0000 @@ -212,7 +212,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/beam_ssa.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (551)) --- old//usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/beam_ssa.html 2026-06-04 19:05:04.457469005 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/beam_ssa.html 2026-06-04 19:05:04.458469014 +0000 @@ -188,8 +188,8 @@
    br ^common_end_of_catch common_end_of_catch: - @tmp = phi { @catched_val, ^landing_pad_block }, - { @successful_result, ^protected_blockN } + @tmp = phi { @catched_val, ^landing_pad_block }, + { @successful_result, ^protected_blockN } @result_of_catch_expr = catch_end @tag, @tmp

    Just as for a try-catch expression all code that can cause an exception in one of the protected blocks must have explicit control flow edges to the landing pad block.

    @@ -234,7 +234,7 @@ Variable Naming

    A variable name in BEAM SSA is either an atom or a non-negative -integer:

    atom() | non_neg_integer()

    In order to generate fresh unused variable names, all compiler +integer:

    atom() | non_neg_integer()

    In order to generate fresh unused variable names, all compiler transforms maintain a counter, the cnt-field in the b_function and opt_st records, which is incremented each time a new variable or label is created. In the following description the value of the @@ -292,7 +292,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/cerl.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/cerl.html 2026-06-04 19:05:04.546469830 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/cerl.html 2026-06-04 19:05:04.546469830 +0000 @@ -11556,7 +11556,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/cerl_clauses.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (369)) --- old//usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/cerl_clauses.html 2026-06-04 19:05:04.569470044 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/cerl_clauses.html 2026-06-04 19:05:04.570470053 +0000 @@ -676,7 +676,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/cerl_trees.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (503)) --- old//usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/cerl_trees.html 2026-06-04 19:05:04.592470257 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/cerl_trees.html 2026-06-04 19:05:04.591470248 +0000 @@ -733,7 +733,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/compile.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1506)) --- old//usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/compile.html 2026-06-04 19:05:04.623470545 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/compile.html 2026-06-04 19:05:04.622470535 +0000 @@ -153,7 +153,7 @@

    Options given in the compile() attribute in the source code take precedence over options given to the compiler, which in turn take precedence over options given in the environment.

    A later compiler option takes precedence over an earlier one in the -option list. Example:

    compile:file(something, [nowarn_missing_spec,warn_missing_spec]).

    Warnings will be emitted for functions without specifications, unless +option list. Example:

    compile:file(something, [nowarn_missing_spec,warn_missing_spec]).

    Warnings will be emitted for functions without specifications, unless the source code for module something contains a compile(nowarn_missing_spec) attribute.

    Change

    In Erlang/OTP 26 and earlier, the option order was the opposite of what is described here.

    @@ -177,14 +177,14 @@ which functions to inline, or {inline,[{Name,Arity},...]} to have the compiler inline all calls to the given functions. If the option is given inside a compile directive in an Erlang module, {Name,Arity} can be written as -Name/Arity.

    Example of explicit inlining:

    -compile({inline,[pi/0]}).
    +Name/Arity.

    Example of explicit inlining:

    -compile({inline,[pi/0]}).
     
    -pi() -> 3.1416.

    Example of implicit inlining:

    -compile(inline).

    The option {inline_size,Size} controls how large functions that are allowed to +pi() -> 3.1416.

    Example of implicit inlining:

    -compile(inline).

    The option {inline_size,Size} controls how large functions that are allowed to be inlined. Default is 24, which keeps the size of the inlined code roughly the same as the un-inlined version (only relatively small functions are inlined).

    Example:

    %% Aggressive inlining - will increase code size.
    --compile(inline).
    --compile({inline_size,100}).

    +-compile(inline). +-compile({inline_size,100}).

    @@ -932,10 +932,10 @@ function definitions. This is the preferred method of enabling and disabling features, since it is a local property of a module.

  • makedep - Produces a Makefile rule to track headers dependencies. No object file is produced.

    By default, this rule is written to <File>.Pbeam. However, if option -binary is set, nothing is written and the rule is returned in Binary.

    The output will be encoded in UTF-8.

    For example, if you have the following module:

    -module(module).
    +binary is set, nothing is written and the rule is returned in Binary.

    The output will be encoded in UTF-8.

    For example, if you have the following module:

    -module(module).
     
    --include_lib("eunit/include/eunit.hrl").
    --include("header.hrl").

    The Makefile rule generated by this option looks as follows:

    module.beam: module.erl \
    +-include_lib("eunit/include/eunit.hrl").
    +-include("header.hrl").

    The Makefile rule generated by this option looks as follows:

    module.beam: module.erl \
       /usr/local/lib/erlang/lib/eunit/include/eunit.hrl \
       header.hrl
  • makedep_side_effect - The dependencies are created as a side effect to the normal compilation process. This means that the object file will also be @@ -1001,7 +1001,7 @@ before Erlang/OTP R14A when calling a local function with the same name as an auto-imported BIF without module prefix.

    If the BIF is to be called, use the erlang module prefix in the call, not {no_auto_import,[{F,A}, ...]}.

    If this option is written in the source code, as a -compile directive, the -syntax F/A can be used instead of {F,A}. For example:

    -compile({no_auto_import,[error/1]}).
  • no_auto_import - Do not auto-import any functions from erlang module.

  • no_line_info - Omits line number information to produce a slightly +syntax F/A can be used instead of {F,A}. For example:

    -compile({no_auto_import,[error/1]}).
  • no_auto_import - Do not auto-import any functions from erlang module.

  • no_line_info - Omits line number information to produce a slightly smaller output file.

  • no_lint - Skips the pass that checks for errors and warnings. Only applicable together with the from_abstr option. This is mainly for implementations of other languages on top of Erlang, which have already done @@ -1371,7 +1371,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/compiler.epub/OEBPS/beam_ssa.xhtml differs (HTML document, ASCII text, with very long lines (551)) --- old//usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/compiler.epub/OEBPS/beam_ssa.xhtml 2026-06-04 00:07:24.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/compiler.epub/OEBPS/beam_ssa.xhtml 2042-07-06 13:26:52.000000000 +0000 @@ -83,8 +83,8 @@ br ^common_end_of_catch common_end_of_catch: - @tmp = phi { @catched_val, ^landing_pad_block }, - { @successful_result, ^protected_blockN } + @tmp = phi { @catched_val, ^landing_pad_block }, + { @successful_result, ^protected_blockN } @result_of_catch_expr = catch_end @tag, @tmp
  • Just as for a try-catch expression all code that can cause an exception in one of the protected blocks must have explicit control flow edges to the landing pad block.

    @@ -129,7 +129,7 @@ Variable Naming

    A variable name in BEAM SSA is either an atom or a non-negative -integer:

    atom() | non_neg_integer()

    In order to generate fresh unused variable names, all compiler +integer:

    atom() | non_neg_integer()

    In order to generate fresh unused variable names, all compiler transforms maintain a counter, the cnt-field in the b_function and opt_st records, which is incremented each time a new variable or label is created. In the following description the value of the /usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/compiler.epub/OEBPS/compile.xhtml differs (HTML document, ASCII text, with very long lines (1411)) --- old//usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/compiler.epub/OEBPS/compile.xhtml 2026-06-04 00:07:24.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/compiler.epub/OEBPS/compile.xhtml 2042-07-06 13:26:52.000000000 +0000 @@ -48,7 +48,7 @@

    Options given in the compile() attribute in the source code take precedence over options given to the compiler, which in turn take precedence over options given in the environment.

    A later compiler option takes precedence over an earlier one in the -option list. Example:

    compile:file(something, [nowarn_missing_spec,warn_missing_spec]).

    Warnings will be emitted for functions without specifications, unless +option list. Example:

    compile:file(something, [nowarn_missing_spec,warn_missing_spec]).

    Warnings will be emitted for functions without specifications, unless the source code for module something contains a compile(nowarn_missing_spec) attribute.

    Change

    In Erlang/OTP 26 and earlier, the option order was the opposite of what is described here.

    @@ -72,14 +72,14 @@ which functions to inline, or {inline,[{Name,Arity},...]} to have the compiler inline all calls to the given functions. If the option is given inside a compile directive in an Erlang module, {Name,Arity} can be written as -Name/Arity.

    Example of explicit inlining:

    -compile({inline,[pi/0]}).
    +Name/Arity.

    Example of explicit inlining:

    -compile({inline,[pi/0]}).
     
    -pi() -> 3.1416.

    Example of implicit inlining:

    -compile(inline).

    The option {inline_size,Size} controls how large functions that are allowed to +pi() -> 3.1416.

    Example of implicit inlining:

    -compile(inline).

    The option {inline_size,Size} controls how large functions that are allowed to be inlined. Default is 24, which keeps the size of the inlined code roughly the same as the un-inlined version (only relatively small functions are inlined).

    Example:

    %% Aggressive inlining - will increase code size.
    --compile(inline).
    --compile({inline_size,100}).

    +-compile(inline). +-compile({inline_size,100}).

    @@ -811,10 +811,10 @@ function definitions. This is the preferred method of enabling and disabling features, since it is a local property of a module.

  • makedep - Produces a Makefile rule to track headers dependencies. No object file is produced.

    By default, this rule is written to <File>.Pbeam. However, if option -binary is set, nothing is written and the rule is returned in Binary.

    The output will be encoded in UTF-8.

    For example, if you have the following module:

    -module(module).
    +binary is set, nothing is written and the rule is returned in Binary.

    The output will be encoded in UTF-8.

    For example, if you have the following module:

    -module(module).
     
    --include_lib("eunit/include/eunit.hrl").
    --include("header.hrl").

    The Makefile rule generated by this option looks as follows:

    module.beam: module.erl \
    +-include_lib("eunit/include/eunit.hrl").
    +-include("header.hrl").

    The Makefile rule generated by this option looks as follows:

    module.beam: module.erl \
       /usr/local/lib/erlang/lib/eunit/include/eunit.hrl \
       header.hrl
  • makedep_side_effect - The dependencies are created as a side effect to the normal compilation process. This means that the object file will also be @@ -880,7 +880,7 @@ before Erlang/OTP R14A when calling a local function with the same name as an auto-imported BIF without module prefix.

    If the BIF is to be called, use the erlang module prefix in the call, not {no_auto_import,[{F,A}, ...]}.

    If this option is written in the source code, as a -compile directive, the -syntax F/A can be used instead of {F,A}. For example:

    -compile({no_auto_import,[error/1]}).
  • no_auto_import - Do not auto-import any functions from erlang module.

  • no_line_info - Omits line number information to produce a slightly +syntax F/A can be used instead of {F,A}. For example:

    -compile({no_auto_import,[error/1]}).
  • no_auto_import - Do not auto-import any functions from erlang module.

  • no_line_info - Omits line number information to produce a slightly smaller output file.

  • no_lint - Skips the pass that checks for errors and warnings. Only applicable together with the from_abstr option. This is mainly for implementations of other languages on top of Erlang, which have already done /usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/compiler.epub/OEBPS/content.opf differs (XML 1.0 document, ASCII text) --- old//usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/compiler.epub/OEBPS/content.opf 2026-06-04 00:07:24.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/compiler.epub/OEBPS/content.opf 2042-07-06 13:26:52.000000000 +0000 @@ -4,10 +4,10 @@ version="3.0"> compiler - 8.5.3 - urn:uuid:9598b11e-505c-af5a-8f91-4bb1f359eb52 + urn:uuid:abc5bcc7-5b47-d584-a9e1-a980b0dc83ae en - 2026-06-04T00:07:24Z + 2042-07-06T13:26:52Z /usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/compiler.epub/OEBPS/notes.xhtml differs (HTML document, ASCII text, with very long lines (3131)) --- old//usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/compiler.epub/OEBPS/notes.xhtml 2026-06-04 00:07:24.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/compiler.epub/OEBPS/notes.xhtml 2042-07-06 13:26:52.000000000 +0000 @@ -68,13 +68,13 @@ Fixed Bugs and Malfunctions

  • -
    • Generators for binary comprehensions could be evaluated before it was known that they would be needed. That could result in a binary comprehensions failing if a generator that should not be evaluated until later failed.

      As an example, consider this module:

      -module(t).
      --export([f/0]).
      +
      • Generators for binary comprehensions could be evaluated before it was known that they would be needed. That could result in a binary comprehensions failing if a generator that should not be evaluated until later failed.

        As an example, consider this module:

        -module(t).
        +-export([f/0]).
         
        -f() ->
        -    <<0 || _ <- [], _ <- ok, false>>.

        In Erlang/OTP 26 it would fail like so:

        1> t:f().
        +f() ->
        +    <<0 || _ <- [], _ <- ok, false>>.

        In Erlang/OTP 26 it would fail like so:

        1> t:f().
         ** exception error: bad generator ok
        -     in function  t:f/0 (t.erl, line 6)

        In Erlang/OTP 27 it returns an empty binary:

        1> t:f().
        +     in function  t:f/0 (t.erl, line 6)

        In Erlang/OTP 27 it returns an empty binary:

        1> t:f().
         <<>>

        Own Id: OTP-18703 Aux Id: GH-7494, PR-7538

      • The documentation for the preprocessor now mentions that defined(Name) can be called in the condition for an -if or -elif directive to test whether Name is the name of a defined macro. (This feature was implemented in OTP 21.)

        If a function call in an -if or -elif with a name that is not the name of a guard BIF, there would not be a compilation error, but would instead cause the lines following the directive to be skipped. This has now been changed to be a compilation error.

        POTENTIAL INCOMPATIBILITY

        Own Id: OTP-18784 Aux Id: GH-7706, PR-7726

      @@ -82,39 +82,39 @@ Improvements and New Features

      Own Id: OTP-18680 Aux Id: PR-7491, PR-8086, ERIERL-967

    • Improved the performance of the alias analysis pass.

      Own Id: OTP-18714 Aux Id: PR-7528, GH-7432

    • -spec attributes are now used for documentation.

      Own Id: OTP-18801 Aux Id: PR-7739

    • Native coverage support has been implemented in the JIT. It will automatically be used by the cover tool to reduce the execution overhead when running cover-compiled code.

      There are also new APIs to support native coverage without using the cover tool.

      To instrument code for native coverage it must be compiled with the line_coverage option.

      To enable native coverage in the runtime system, start it like so:

      $ erl +JPcover true

      There are also the following new functions for supporting native coverage:

      Own Id: OTP-18856 Aux Id: PR-7856

    • EEP-59 - Documentation Attributes has been implemented.

      Documentation attributes can be used to document functions, types, callbacks, and modules. The keyword -moduledoc "Documentation here". is used to document modules, while -doc "Documentation here". can be used on top of functions, types, and callbacks to document them, respectively.

      • Types, callbacks, and function documentation can be set to hidden either via -doc false or -doc hidden. When documentation attributes mark a type as hidden, they will not be part of the documentation.

      • The documentation from moduledoc and doc gets added by default to the binary beam file, following the format of EEP-48.

      • Using the compiler flag warn_missing_doc will raise a warning when -doc attributes are missing in exported functions, types, and callbacks.

      • Using the compiler flag warn_missing_spec_documented will raise a warning when -spec attributes are missing in documented functions, types, and callbacks.

      • moduledocs and docs may refer to external files to be embedded, such as -doc {file, "README.md"}., which refers to the file README.md found in the current working directory.

      • The compiler warns about exported functions whose specs refer to hidden types. Thus, there will be warnings when a hidden type (meaning, the type is not part of the documentation) gets used in an exported function.

      Own Id: OTP-18916 Aux Id: PR-7936

    • The documentation has been migrated to use Markdown and ExDoc.

      Own Id: OTP-18955 Aux Id: PR-8026

    • The order in which the compiler looks up options has changed.

      When there is a conflict in the compiler options given in the -compile() attribute and options given to the compiler, the options given in the -compile() attribute overrides the option given to the compiler, which in turn overrides options given in the ERL_COMPILER_OPTIONS environment variable.

      Example:

      If some_module.erl has the following attribute:

      -compile([nowarn_missing_spec]).

      and the compiler is invoked like so:

      % erlc +warn_missing_spec some_module.erl

      no warnings will be issued for functions that do not have any specs.

      POTENTIAL INCOMPATIBILITY

      Own Id: OTP-18968 Aux Id: GH-6979, PR-8093

    • Safe destructive update of tuples has been implemented in the compiler and runtime system. This allows the VM to update tuples in-place when it is safe to do so, thus improving performance by doing less copying but also by producing less garbage.

      Example:

      -record(rec, {a,b,c}).
      +spec attributes are missing in documented functions, types, and callbacks.

    • moduledocs and docs may refer to external files to be embedded, such as -doc {file, "README.md"}., which refers to the file README.md found in the current working directory.

    • The compiler warns about exported functions whose specs refer to hidden types. Thus, there will be warnings when a hidden type (meaning, the type is not part of the documentation) gets used in an exported function.

    Own Id: OTP-18916 Aux Id: PR-7936

  • The documentation has been migrated to use Markdown and ExDoc.

    Own Id: OTP-18955 Aux Id: PR-8026

  • The order in which the compiler looks up options has changed.

    When there is a conflict in the compiler options given in the -compile() attribute and options given to the compiler, the options given in the -compile() attribute overrides the option given to the compiler, which in turn overrides options given in the ERL_COMPILER_OPTIONS environment variable.

    Example:

    If some_module.erl has the following attribute:

    -compile([nowarn_missing_spec]).

    and the compiler is invoked like so:

    % erlc +warn_missing_spec some_module.erl

    no warnings will be issued for functions that do not have any specs.

    POTENTIAL INCOMPATIBILITY

    Own Id: OTP-18968 Aux Id: GH-6979, PR-8093

  • Safe destructive update of tuples has been implemented in the compiler and runtime system. This allows the VM to update tuples in-place when it is safe to do so, thus improving performance by doing less copying but also by producing less garbage.

    Example:

    -record(rec, {a,b,c}).
     
    -update(#rec{a=needs_update,b=N}=R0) ->
    -    R = R0#rec{a=up_to_date},
    +update(#rec{a=needs_update,b=N}=R0) ->
    +    R = R0#rec{a=up_to_date},
         if
             N < 0 ->
    -            R#rec{c=negative};
    +            R#rec{c=negative};
             N == 0 ->
    -            R#rec{c=zero};
    +            R#rec{c=zero};
             N > 0 ->
    -            R#rec{c=positive}
    +            R#rec{c=positive}
         end.

    The record updates in each of the three clauses of the if can safely be done in-place, because variable R is not used again.

    Own Id: OTP-18972 Aux Id: PR-8090

  • Improved the match context reuse optimization slightly, allowing match contexts to be passed as-is to bit_size/1 and byte_size/1.

    Own Id: OTP-18987

  • erl_lint (and by extension the compiler) will now warn for code using deprecated callbacks.

    The only callback currenly deprecated is format_status/2 in gen_server, gen_event and gen_statem.

    You can use nowarn_deprecated_callback to silence the warning.

    Own Id: OTP-19010 Aux Id: PR-8205

  • /usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/compiler.epub/OEBPS/ssa_checks.xhtml differs (HTML document, ASCII text, with very long lines (1093)) --- old//usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/compiler.epub/OEBPS/ssa_checks.xhtml 2026-06-04 00:07:24.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/compiler.epub/OEBPS/ssa_checks.xhtml 2042-07-06 13:26:52.000000000 +0000 @@ -37,32 +37,32 @@

    SSA checks are embedded in the source code as comments starting with with one of %ssa%, %%ssa% or %%%ssa%. This is a short introduction the syntax, for the full syntax please refer to the -ssa_check_when_clause production in erl_parse.yrl.

    SSA checks can be placed inside any Erlang function, for example:

    t0() ->
    +ssa_check_when_clause production in erl_parse.yrl.

    SSA checks can be placed inside any Erlang function, for example:

    t0() ->
     %ssa% () when post_ssa_opt ->
     %ssa%   ret(#{}).
    -  #{}.

    will check that t0/0 returns the literal #{}. If we want to check -that a function returns its first formal parameter, we can write:

    t1(A, _B) ->
    +  #{}.

    will check that t0/0 returns the literal #{}. If we want to check +that a function returns its first formal parameter, we can write:

    t1(A, _B) ->
     %ssa% (X, _) when post_ssa_opt ->
     %ssa%   ret(X).
       A.

    Note how we match the first formal parameter using X. The reason for having our own formal parameters for the SSA check, is that we don't want to introduce new identifiers at the Erlang level to support SSA-level checks. Consider if t1/2 had been defined as t1([A|As], B) we would have had to introduce a new identifier for the aggregate -value [A|As].

    The full syntax for a SSA check clause is:

    <expected-result>? (<formals>) when <pipeline-location> -> <checks> '.'

    where <expected-result> can be one of pass (the check must +value [A|As].

    The full syntax for a SSA check clause is:

    <expected-result>? (<formals>) when <pipeline-location> -> <checks> '.'

    where <expected-result> can be one of pass (the check must succeed), fail and xfail (the check must fail). Omitting <expected-result> is parsed as an implicit pass.

    <formals> is a comma-separated list of variables.

    <pipeline-location> specifies when in the compiler pipeline to run the checks. For now the only supported value for <pipeline-location> is post_ssa_opt which runs the checks after the ssa_opt pass.

    <checks> is a comma-separated list of matches against the BEAM SSA -code. For non-flow-control operations the syntax is:

    <variable> = <operation> ( <arguments> ) <annotation>?

    where <operation> is the #b_set.op field from the internal SSA -representation. BIFs are written as bif:<atom>.

    <arguments> is a comma-separated list of variables or literals.

    For flow control operations and labels, the syntax is as follows:

    br(<bool>, <true-label>, <false-label>)
    +code. For non-flow-control operations the syntax is:

    <variable> = <operation> ( <arguments> ) <annotation>?

    where <operation> is the #b_set.op field from the internal SSA +representation. BIFs are written as bif:<atom>.

    <arguments> is a comma-separated list of variables or literals.

    For flow control operations and labels, the syntax is as follows:

    br(<bool>, <true-label>, <false-label>)
     
    -switch(<value>, <fail-label>, [{<label>,<value>},...])
    +switch(<value>, <fail-label>, [{<label>,<value>},...])
     
    -ret(<value>)
    +ret(<value>)
     
     label <value>

    where <value> is a literal or a variable.

    A check can also include an assertion on operation annotations. The assertion is written as a map-like pattern following the argument -list, for example:

    t0() ->
    +list, for example:

    t0() ->
     %ssa% () when post_ssa_opt ->
     %ssa% _ = call(fun return_int/0) { result_type => {t_integer,{17,17}},
     %ssa%                              location => {_,32} },
    @@ -70,9 +70,9 @@
     %ssa%    result_type => {t_tuple,2,true,#{1 => {t_integer,{1,1}},
     %ssa%                                     2 => {t_integer,{2,2}}}}
     %ssa% }.
    -    X = return_int(),
    -    Y = return_tuple(),
    -    {X, Y}.

    + X = return_int(), + Y = return_tuple(), + {X, Y}.

    /usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/notes.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (3131)) --- old//usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/notes.html 2026-06-04 19:05:04.761471825 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/notes.html 2026-06-04 19:05:04.761471825 +0000 @@ -173,13 +173,13 @@ Fixed Bugs and Malfunctions

    -
    • Generators for binary comprehensions could be evaluated before it was known that they would be needed. That could result in a binary comprehensions failing if a generator that should not be evaluated until later failed.

      As an example, consider this module:

      -module(t).
      --export([f/0]).
      +
      • Generators for binary comprehensions could be evaluated before it was known that they would be needed. That could result in a binary comprehensions failing if a generator that should not be evaluated until later failed.

        As an example, consider this module:

        -module(t).
        +-export([f/0]).
         
        -f() ->
        -    <<0 || _ <- [], _ <- ok, false>>.

        In Erlang/OTP 26 it would fail like so:

        1> t:f().
        +f() ->
        +    <<0 || _ <- [], _ <- ok, false>>.

        In Erlang/OTP 26 it would fail like so:

        1> t:f().
         ** exception error: bad generator ok
        -     in function  t:f/0 (t.erl, line 6)

        In Erlang/OTP 27 it returns an empty binary:

        1> t:f().
        +     in function  t:f/0 (t.erl, line 6)

        In Erlang/OTP 27 it returns an empty binary:

        1> t:f().
         <<>>

        Own Id: OTP-18703 Aux Id: GH-7494, PR-7538

      • The documentation for the preprocessor now mentions that defined(Name) can be called in the condition for an -if or -elif directive to test whether Name is the name of a defined macro. (This feature was implemented in OTP 21.)

        If a function call in an -if or -elif with a name that is not the name of a guard BIF, there would not be a compilation error, but would instead cause the lines following the directive to be skipped. This has now been changed to be a compilation error.

        POTENTIAL INCOMPATIBILITY

        Own Id: OTP-18784 Aux Id: GH-7706, PR-7726

      @@ -187,39 +187,39 @@ Improvements and New Features

      Own Id: OTP-18680 Aux Id: PR-7491, PR-8086, ERIERL-967

    • Improved the performance of the alias analysis pass.

      Own Id: OTP-18714 Aux Id: PR-7528, GH-7432

    • -spec attributes are now used for documentation.

      Own Id: OTP-18801 Aux Id: PR-7739

    • Native coverage support has been implemented in the JIT. It will automatically be used by the cover tool to reduce the execution overhead when running cover-compiled code.

      There are also new APIs to support native coverage without using the cover tool.

      To instrument code for native coverage it must be compiled with the line_coverage option.

      To enable native coverage in the runtime system, start it like so:

      $ erl +JPcover true

      There are also the following new functions for supporting native coverage:

      Own Id: OTP-18856 Aux Id: PR-7856

    • EEP-59 - Documentation Attributes has been implemented.

      Documentation attributes can be used to document functions, types, callbacks, and modules. The keyword -moduledoc "Documentation here". is used to document modules, while -doc "Documentation here". can be used on top of functions, types, and callbacks to document them, respectively.

      • Types, callbacks, and function documentation can be set to hidden either via -doc false or -doc hidden. When documentation attributes mark a type as hidden, they will not be part of the documentation.

      • The documentation from moduledoc and doc gets added by default to the binary beam file, following the format of EEP-48.

      • Using the compiler flag warn_missing_doc will raise a warning when -doc attributes are missing in exported functions, types, and callbacks.

      • Using the compiler flag warn_missing_spec_documented will raise a warning when -spec attributes are missing in documented functions, types, and callbacks.

      • moduledocs and docs may refer to external files to be embedded, such as -doc {file, "README.md"}., which refers to the file README.md found in the current working directory.

      • The compiler warns about exported functions whose specs refer to hidden types. Thus, there will be warnings when a hidden type (meaning, the type is not part of the documentation) gets used in an exported function.

      Own Id: OTP-18916 Aux Id: PR-7936

    • The documentation has been migrated to use Markdown and ExDoc.

      Own Id: OTP-18955 Aux Id: PR-8026

    • The order in which the compiler looks up options has changed.

      When there is a conflict in the compiler options given in the -compile() attribute and options given to the compiler, the options given in the -compile() attribute overrides the option given to the compiler, which in turn overrides options given in the ERL_COMPILER_OPTIONS environment variable.

      Example:

      If some_module.erl has the following attribute:

      -compile([nowarn_missing_spec]).

      and the compiler is invoked like so:

      % erlc +warn_missing_spec some_module.erl

      no warnings will be issued for functions that do not have any specs.

      POTENTIAL INCOMPATIBILITY

      Own Id: OTP-18968 Aux Id: GH-6979, PR-8093

    • Safe destructive update of tuples has been implemented in the compiler and runtime system. This allows the VM to update tuples in-place when it is safe to do so, thus improving performance by doing less copying but also by producing less garbage.

      Example:

      -record(rec, {a,b,c}).
      +spec attributes are missing in documented functions, types, and callbacks.

    • moduledocs and docs may refer to external files to be embedded, such as -doc {file, "README.md"}., which refers to the file README.md found in the current working directory.

    • The compiler warns about exported functions whose specs refer to hidden types. Thus, there will be warnings when a hidden type (meaning, the type is not part of the documentation) gets used in an exported function.

    Own Id: OTP-18916 Aux Id: PR-7936

  • The documentation has been migrated to use Markdown and ExDoc.

    Own Id: OTP-18955 Aux Id: PR-8026

  • The order in which the compiler looks up options has changed.

    When there is a conflict in the compiler options given in the -compile() attribute and options given to the compiler, the options given in the -compile() attribute overrides the option given to the compiler, which in turn overrides options given in the ERL_COMPILER_OPTIONS environment variable.

    Example:

    If some_module.erl has the following attribute:

    -compile([nowarn_missing_spec]).

    and the compiler is invoked like so:

    % erlc +warn_missing_spec some_module.erl

    no warnings will be issued for functions that do not have any specs.

    POTENTIAL INCOMPATIBILITY

    Own Id: OTP-18968 Aux Id: GH-6979, PR-8093

  • Safe destructive update of tuples has been implemented in the compiler and runtime system. This allows the VM to update tuples in-place when it is safe to do so, thus improving performance by doing less copying but also by producing less garbage.

    Example:

    -record(rec, {a,b,c}).
     
    -update(#href_anchor"ss">rec{a=needs_update,b=N}=R0) ->
    -    R = R0#rec{a=up_to_date},
    +update(#href_anchor"ss">rec{a=needs_update,b=N}=R0) ->
    +    R = R0#rec{a=up_to_date},
         if
             N < 0 ->
    -            R#rec{c=negative};
    +            R#rec{c=negative};
             N == 0 ->
    -            R#rec{c=zero};
    +            R#rec{c=zero};
             N > 0 ->
    -            R#rec{c=positive}
    +            R#rec{c=positive}
         end.

    The record updates in each of the three clauses of the if can safely be done in-place, because variable R is not used again.

    Own Id: OTP-18972 Aux Id: PR-8090

  • Improved the match context reuse optimization slightly, allowing match contexts to be passed as-is to bit_size/1 and byte_size/1.

    Own Id: OTP-18987

  • erl_lint (and by extension the compiler) will now warn for code using deprecated callbacks.

    The only callback currenly deprecated is format_status/2 in gen_server, gen_event and gen_statem.

    You can use nowarn_deprecated_callback to silence the warning.

    Own Id: OTP-19010 Aux Id: PR-8205

  • @@ -3132,7 +3132,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/search.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/search.html 2026-06-04 19:05:04.779667674 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/search.html 2026-06-04 19:05:04.778471983 +0000 @@ -145,7 +145,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/ssa_checks.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1093)) --- old//usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/ssa_checks.html 2026-06-04 19:05:04.794472131 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/compiler-8.5.3/doc/html/ssa_checks.html 2026-06-04 19:05:04.795472140 +0000 @@ -142,32 +142,32 @@

    SSA checks are embedded in the source code as comments starting with with one of %ssa%, %%ssa% or %%%ssa%. This is a short introduction the syntax, for the full syntax please refer to the -ssa_check_when_clause production in erl_parse.yrl.

    SSA checks can be placed inside any Erlang function, for example:

    t0() ->
    +ssa_check_when_clause production in erl_parse.yrl.

    SSA checks can be placed inside any Erlang function, for example:

    t0() ->
     %ssa% () when post_ssa_opt ->
     %ssa%   ret(#{}).
    -  #{}.

    will check that t0/0 returns the literal #{}. If we want to check -that a function returns its first formal parameter, we can write:

    t1(A, _B) ->
    +  #{}.

    will check that t0/0 returns the literal #{}. If we want to check +that a function returns its first formal parameter, we can write:

    t1(A, _B) ->
     %ssa% (X, _) when post_ssa_opt ->
     %ssa%   ret(X).
       A.

    Note how we match the first formal parameter using X. The reason for having our own formal parameters for the SSA check, is that we don't want to introduce new identifiers at the Erlang level to support SSA-level checks. Consider if t1/2 had been defined as t1([A|As], B) we would have had to introduce a new identifier for the aggregate -value [A|As].

    The full syntax for a SSA check clause is:

    <expected-result>? (<formals>) when <pipeline-location> -> <checks> '.'

    where <expected-result> can be one of pass (the check must +value [A|As].

    The full syntax for a SSA check clause is:

    <expected-result>? (<formals>) when <pipeline-location> -> <checks> '.'

    where <expected-result> can be one of pass (the check must succeed), fail and xfail (the check must fail). Omitting <expected-result> is parsed as an implicit pass.

    <formals> is a comma-separated list of variables.

    <pipeline-location> specifies when in the compiler pipeline to run the checks. For now the only supported value for <pipeline-location> is post_ssa_opt which runs the checks after the ssa_opt pass.

    <checks> is a comma-separated list of matches against the BEAM SSA -code. For non-flow-control operations the syntax is:

    <variable> = <operation> ( <arguments> ) <annotation>?

    where <operation> is the #b_set.op field from the internal SSA -representation. BIFs are written as bif:<atom>.

    <arguments> is a comma-separated list of variables or literals.

    For flow control operations and labels, the syntax is as follows:

    br(<bool>, <true-label>, <false-label>)
    +code. For non-flow-control operations the syntax is:

    <variable> = <operation> ( <arguments> ) <annotation>?

    where <operation> is the #b_set.op field from the internal SSA +representation. BIFs are written as bif:<atom>.

    <arguments> is a comma-separated list of variables or literals.

    For flow control operations and labels, the syntax is as follows:

    br(<bool>, <true-label>, <false-label>)
     
    -switch(<value>, <fail-label>, [{<label>,<value>},...])
    +switch(<value>, <fail-label>, [{<label>,<value>},...])
     
    -ret(<value>)
    +ret(<value>)
     
     label <value>

    where <value> is a literal or a variable.

    A check can also include an assertion on operation annotations. The assertion is written as a map-like pattern following the argument -list, for example:

    t0() ->
    +list, for example:

    t0() ->
     %ssa% () when post_ssa_opt ->
     %ssa% _ = call(fun return_int/0) { result_type => {t_integer,{17,17}},
     %ssa%                              location => {_,32} },
    @@ -175,9 +175,9 @@
     %ssa%    result_type => {t_tuple,2,true,#{1 => {t_integer,{1,1}},
     %ssa%                                     2 => {t_integer,{2,2}}}}
     %ssa% }.
    -    X = return_int(),
    -    Y = return_tuple(),
    -    {X, Y}.

    + X = return_int(), + Y = return_tuple(), + {X, Y}.

    @@ -250,7 +250,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/404.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/404.html 2026-06-04 19:05:04.811472289 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/404.html 2026-06-04 19:05:04.811472289 +0000 @@ -147,7 +147,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/algorithm_details.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (7159)) --- old//usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/algorithm_details.html 2026-06-04 19:05:04.830472465 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/algorithm_details.html 2026-06-04 19:05:04.830472465 +0000 @@ -319,7 +319,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/api-reference.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/api-reference.html 2026-06-04 19:05:04.846472613 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/api-reference.html 2026-06-04 19:05:04.846472613 +0000 @@ -185,7 +185,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/crypto.epub/OEBPS/content.opf differs (XML 1.0 document, ASCII text) --- old//usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/crypto.epub/OEBPS/content.opf 2026-06-04 00:08:25.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/crypto.epub/OEBPS/content.opf 2042-07-06 13:27:50.000000000 +0000 @@ -4,10 +4,10 @@ version="3.0"> crypto - 5.5.1 - urn:uuid:9abb6c36-4fb3-3344-b5c8-65b73a3b8150 + urn:uuid:f48b3cad-591c-db40-634f-ee4b21c4cddd en - 2026-06-04T00:08:25Z + 2042-07-06T13:27:50Z /usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/crypto.epub/OEBPS/crypto.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (1823)) --- old//usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/crypto.epub/OEBPS/crypto.xhtml 2026-06-04 00:08:25.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/crypto.epub/OEBPS/crypto.xhtml 2042-07-06 13:27:50.000000000 +0000 @@ -484,7 +484,7 @@ -
    rsa_public() = [E, N]
    rsa_private() = [E, N, D] | [E, N, D, P1, P2, E1, E2, C]

    Where E is the public exponent, N is public modulus and D is the private +

    rsa_public() = [E, N]
    rsa_private() = [E, N, D] | [E, N, D, P1, P2, E1, E2, C]

    Where E is the public exponent, N is public modulus and D is the private exponent. The longer key format contains redundant information that will make the calculation faster. P1 and P2 are first and second prime factors. E1 and E2 are first and second exponents. C is the CRT coefficient. The terminology is @@ -2983,7 +2983,7 @@

    -
    rsa_public() = [E, N]
    rsa_private() = [E, N, D] | [E, N, D, P1, P2, E1, E2, C]

    Where E is the public exponent, N is public modulus and D is the private +

    rsa_public() = [E, N]
    rsa_private() = [E, N, D] | [E, N, D, P1, P2, E1, E2, C]

    Where E is the public exponent, N is public modulus and D is the private exponent. The longer key format contains redundant information that will make the calculation faster. P1 and P2 are first and second prime factors. E1 and E2 are first and second exponents. C is the CRT coefficient. The terminology is @@ -5340,9 +5340,9 @@ BN_rand_range).

    Saves the state in the process dictionary before returning it as well. See also rand:seed/1 and rand_seed_s/0.

    When using the state object from this function the rand functions using it may raise exception error:low_entropy in case the random generator failed due -to lack of secure "randomness".

    Example

    _ = crypto:rand_seed(),
    -_IntegerValue = rand:uniform(42), % [1; 42]
    -_FloatValue = rand:uniform().     % [0.0; 1.0[
    +to lack of secure "randomness".

    Example

    _ = crypto:rand_seed(),
    +_IntegerValue = rand:uniform(42), % [1; 42]
    +_FloatValue = rand:uniform().     % [0.0; 1.0[
    @@ -5408,9 +5408,9 @@ generate cryptographically strong random numbers.

    Saves the state in the process dictionary before returning it as well. See also rand:seed/1 and rand_seed_alg_s/1.

    When using the state object from this function the rand functions using it may raise exception error:low_entropy in case the random generator failed due -to lack of secure "randomness".

    Example

    _ = crypto:rand_seed_alg(crypto_cache),
    -_IntegerValue = rand:uniform(42), % [1; 42]
    -_FloatValue = rand:uniform().     % [0.0; 1.0[
    +to lack of secure "randomness".

    Example

    _ = crypto:rand_seed_alg(crypto_cache),
    +_IntegerValue = rand:uniform(42), % [1; 42]
    +_FloatValue = rand:uniform().     % [0.0; 1.0[
    @@ -5442,12 +5442,12 @@

    Creates a state object for random number generation, in order to generate cryptographically unpredictable random numbers.

    Saves the state in the process dictionary before returning it as well. See also -rand_seed_alg_s/2.

    Example

    _ = crypto:rand_seed_alg(crypto_aes, "my seed"),
    -IntegerValue = rand:uniform(42), % [1; 42]
    -FloatValue = rand:uniform(),     % [0.0; 1.0[
    -_ = crypto:rand_seed_alg(crypto_aes, "my seed"),
    -IntegerValue = rand:uniform(42), % Same values
    -FloatValue = rand:uniform().     % again
    +rand_seed_alg_s/2.

    Example

    _ = crypto:rand_seed_alg(crypto_aes, "my seed"),
    +IntegerValue = rand:uniform(42), % [1; 42]
    +FloatValue = rand:uniform(),     % [0.0; 1.0[
    +_ = crypto:rand_seed_alg(crypto_aes, "my seed"),
    +IntegerValue = rand:uniform(42), % Same values
    +FloatValue = rand:uniform().     % again
    @@ -5939,12 +5939,12 @@
    -

    Get information about crypto and the OpenSSL backend.

    Returns a map with information about the compilation and linking of crypto.

    Example:

    1> crypto:info().
    -#{compile_type => normal,
    +

    Get information about crypto and the OpenSSL backend.

    Returns a map with information about the compilation and linking of crypto.

    Example:

    1> crypto:info().
    +#{compile_type => normal,
       cryptolib_version_compiled => "OpenSSL 3.0.0 7 sep 2021",
       cryptolib_version_linked => "OpenSSL 3.0.0 7 sep 2021",
       link_type => dynamic,
    -  otp_crypto_version => "5.0.2"}
    +  otp_crypto_version => "5.0.2"}
     2>

    More association types than documented may be present in the map.

    @@ -6011,8 +6011,8 @@

    Get the name and version of the libraries used by crypto.

    Name is the name of the library. VerNum is the numeric version according to the library's own versioning scheme. VerStr contains a text variant of the -version.

    > info_lib().
    -[{<<"OpenSSL">>,269484095,<<"OpenSSL 1.1.0c  10 Nov 2016"">>}]

    Note

    From OTP R16 the numeric version represents the version of the OpenSSL +version.

    > info_lib().
    +[{<<"OpenSSL">>,269484095,<<"OpenSSL 1.1.0c  10 Nov 2016"">>}]

    Note

    From OTP R16 the numeric version represents the version of the OpenSSL header files (openssl/opensslv.h) used when crypto was compiled. The text variant represents the libcrypto library used at runtime. In earlier OTP versions both numeric and text was taken from the library.

    /usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/crypto.epub/OEBPS/engine_keys.xhtml differs (HTML document, ASCII text, with very long lines (860)) --- old//usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/crypto.epub/OEBPS/engine_keys.xhtml 2026-06-04 00:08:25.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/crypto.epub/OEBPS/engine_keys.xhtml 2042-07-06 13:27:50.000000000 +0000 @@ -56,13 +56,13 @@ Sign with an engine stored private key

    This example shows how to construct a key reference that is used in a sign -operation. The actual key is stored in the engine that is loaded at prompt 1.

    1> {ok, EngineRef} = crypto:engine_load(....).
    +operation. The actual key is stored in the engine that is loaded at prompt 1.

    1> {ok, EngineRef} = crypto:engine_load(....).
     ...
    -{ok,#Ref<0.2399045421.3028942852.173962>}
    -2> PrivKey = #{engine => EngineRef,
    -               key_id => "id of the private key in Engine"}.
    +{ok,#Ref<0.2399045421.3028942852.173962>}
    +2> PrivKey = #{engine => EngineRef,
    +               key_id => "id of the private key in Engine"}.
     ...
    -3> Signature = crypto:sign(rsa, sha, <<"The message">>, PrivKey).
    +3> Signature = crypto:sign(rsa, sha, <<"The message">>, PrivKey).
     <<65,6,125,254,54,233,84,77,83,63,168,28,169,214,121,76,
       207,177,124,183,156,185,160,243,36,79,125,230,231,...>>

    @@ -72,10 +72,10 @@

    Here the signature and message in the last example is verifyed using the public key. The public key is stored in an engine, only to exemplify that it is -possible. The public key could of course be handled openly as usual.

    4> PublicKey = #{engine => EngineRef,
    -                 key_id => "id of the public key in Engine"}.
    +possible. The public key could of course be handled openly as usual.

    4> PublicKey = #{engine => EngineRef,
    +                 key_id => "id of the public key in Engine"}.
     ...
    -5> crypto:verify(rsa, sha, <<"The message">>, Signature, PublicKey).
    +5> crypto:verify(rsa, sha, <<"The message">>, Signature, PublicKey).
     true
     6>

    @@ -84,11 +84,11 @@ Using a password protected private key

    The same example as the first sign example, except that a password protects the -key down in the Engine.

    6> PrivKeyPwd = #{engine => EngineRef,
    +key down in the Engine.

    6> PrivKeyPwd = #{engine => EngineRef,
                       key_id => "id of the pwd protected private key in Engine",
    -		  password => "password"}.
    +		  password => "password"}.
     ...
    -7> crypto:sign(rsa, sha, <<"The message">>, PrivKeyPwd).
    +7> crypto:sign(rsa, sha, <<"The message">>, PrivKeyPwd).
     <<140,80,168,101,234,211,146,183,231,190,160,82,85,163,
       175,106,77,241,141,120,72,149,181,181,194,154,175,76,
       223,...>>
    /usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/crypto.epub/OEBPS/engine_load.xhtml differs (HTML document, ASCII text, with very long lines (1041))
    --- old//usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/crypto.epub/OEBPS/engine_load.xhtml	2026-06-04 00:08:25.000000000 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/crypto.epub/OEBPS/engine_load.xhtml	2042-07-06 13:27:50.000000000 +0000
    @@ -47,35 +47,35 @@
       Dynamically load an engine from default directory
     

    If the engine is located in the OpenSSL/LibreSSL installation engines -directory.

    1> {ok, Engine} = crypto:engine_load(<<"otp_test_engine">>, [], []).
    - {ok, #Ref}

    +directory.

    1> {ok, Engine} = crypto:engine_load(<<"otp_test_engine">>, [], []).
    + {ok, #Ref}

    Load an engine with the dynamic engine

    Load an engine with the help of the dynamic engine by giving the path to the -library.

     2> {ok, Engine} = crypto:engine_load(<<"dynamic">>,
    -                                      [{<<"SO_PATH">>,
    -                                        <<"/some/path/otp_test_engine.so">>},
    -                                       {<<"ID">>, <<"MD5">>},
    -                                       <<"LOAD">>],
    -                                      []).
    - {ok, #Ref}

    +library.

     2> {ok, Engine} = crypto:engine_load(<<"dynamic">>,
    +                                      [{<<"SO_PATH">>,
    +                                        <<"/some/path/otp_test_engine.so">>},
    +                                       {<<"ID">>, <<"MD5">>},
    +                                       <<"LOAD">>],
    +                                      []).
    + {ok, #Ref}

    Load an engine and replace some methods

    Load an engine with the help of the dynamic engine and just replace some engine -methods.

     3> {ok, Engine} = crypto:engine_load(<<"dynamic">>,
    -                                      [{<<"SO_PATH">>,
    -                                        <<"/some/path/otp_test_engine.so">>},
    -                                       {<<"ID">>, <<"MD5">>},
    -                                       <<"LOAD">>],
    -                                      []).
    -{ok, #Ref}
    -4> ok = crypto:engine_register(Engine, [engine_method_digests]).
    +methods.

     3> {ok, Engine} = crypto:engine_load(<<"dynamic">>,
    +                                      [{<<"SO_PATH">>,
    +                                        <<"/some/path/otp_test_engine.so">>},
    +                                       {<<"ID">>, <<"MD5">>},
    +                                       <<"LOAD">>],
    +                                      []).
    +{ok, #Ref}
    +4> ok = crypto:engine_register(Engine, [engine_method_digests]).
     ok

    @@ -84,19 +84,19 @@

    This function makes sure the engine is loaded just once and the ID is added to the internal engine list of OpenSSL. The following calls to the function will -check if the ID is loaded and then just get a new reference to the engine.

     5> {ok, Engine} = crypto:ensure_engine_loaded(<<"MD5">>,
    -                                               <<"/some/path/otp_test_engine.so">>).
    - {ok, #Ref}

    To remove the tag from the OpenSSL engine list use crypto:engine_remove/1.

     6> crypto:engine_remove(Engine).
    +check if the ID is loaded and then just get a new reference to the engine.

     5> {ok, Engine} = crypto:ensure_engine_loaded(<<"MD5">>,
    +                                               <<"/some/path/otp_test_engine.so">>).
    + {ok, #Ref}

    To remove the tag from the OpenSSL engine list use crypto:engine_remove/1.

     6> crypto:engine_remove(Engine).
      ok

    To unload it use crypto:engine_unload/1 which removes the references to the -engine.

     6> crypto:engine_unload(Engine).
    +engine.

     6> crypto:engine_unload(Engine).
      ok

    List all engines currently loaded

    -
     8> crypto:engine_list().
    -[<<"dynamic">>, <<"MD5">>]
    +
     8> crypto:engine_list().
    +[<<"dynamic">>, <<"MD5">>]
    /usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/crypto.epub/OEBPS/new_api.xhtml differs (HTML document, ASCII text, with very long lines (2413)) --- old//usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/crypto.epub/OEBPS/new_api.xhtml 2026-06-04 00:08:25.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/crypto.epub/OEBPS/new_api.xhtml 2042-07-06 13:27:50.000000000 +0000 @@ -87,41 +87,41 @@ initialises the crypto context. One or more calls crypto_update/2 does the actual encryption or decryption for each block.

    This example shows first the encryption of two blocks and then decryptions of the cipher text, but divided into three blocks just to show that it is possible -to divide the plain text and cipher text differently for some ciphers:

    	1> crypto:start().
    +to divide the plain text and cipher text differently for some ciphers:

    	1> crypto:start().
     	ok
     	2> Key = <<1:128>>.
     	<<0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1>>
     	3> IV = <<0:128>>.
     	<<0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0>>
    -	4> StateEnc = crypto:crypto_init(aes_128_ctr, Key, IV, true). % encrypt -> true
    +	4> StateEnc = crypto:crypto_init(aes_128_ctr, Key, IV, true). % encrypt -> true
     	#Ref<0.3768901617.1128660993.124047>
    -	5> crypto:crypto_update(StateEnc, <<"First bytes">>).
    +	5> crypto:crypto_update(StateEnc, <<"First bytes">>).
     	<<67,44,216,166,25,130,203,5,66,6,162>>
    -	6> crypto:crypto_update(StateEnc, <<"Second bytes">>).
    +	6> crypto:crypto_update(StateEnc, <<"Second bytes">>).
     	<<16,79,94,115,234,197,94,253,16,144,151,41>>
     	7>
    -	7> StateDec = crypto:crypto_init(aes_128_ctr, Key, IV, false). % decrypt -> false
    +	7> StateDec = crypto:crypto_init(aes_128_ctr, Key, IV, false). % decrypt -> false
     	#Ref<0.3768901617.1128660994.124255>
    -	8> crypto:crypto_update(StateDec, <<67,44,216,166,25,130,203>>).
    +	8> crypto:crypto_update(StateDec, <<67,44,216,166,25,130,203>>).
     	<<"First b">>
    -	9> crypto:crypto_update(StateDec, <<5,66,6,162,16,79,94,115,234,197,
    -        94,253,16,144,151>>).
    +	9> crypto:crypto_update(StateDec, <<5,66,6,162,16,79,94,115,234,197,
    +        94,253,16,144,151>>).
     	<<"ytesSecond byte">>
    -	10> crypto:crypto_update(StateDec, <<41>>).
    +	10> crypto:crypto_update(StateDec, <<41>>).
     	<<"s">>
     	11>

    Note that the internal data that the StateEnc and StateDec references are destructivly updated by the calls to crypto_update/2. This is to gain time in the calls of the nifs interfacing the cryptolib. In a loop where the state is saved in the loop's state, it also saves one update of the loop state per crypto operation.

    For example, a simple server receiving text parts to encrypt and send the result -back to the one who sent them (the Requester):

    	encode(Crypto, Key, IV) ->
    -	crypto_loop(crypto:crypto_init(Crypto, Key, IV, true)).
    +back to the one who sent them (the Requester):

    	encode(Crypto, Key, IV) ->
    +	crypto_loop(crypto:crypto_init(Crypto, Key, IV, true)).
     
    -	crypto_loop(State) ->
    +	crypto_loop(State) ->
     	receive
    -        {Text, Requester} ->
    -        Requester ! crypto:crypto_update(State, Text),
    -	loop(State)
    +        {Text, Requester} ->
    +        Requester ! crypto:crypto_update(State, Text),
    +	loop(State)
     	end.

    @@ -134,9 +134,9 @@ <<0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1>> 2> IV = <<0:128>>. <<0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0>> - 3> Txt = [<<"First bytes">>,<<"Second bytes">>]. - [<<"First bytes">>,<<"Second bytes">>] - 4> crypto:crypto_one_time(aes_128_ctr, Key, IV, Txt, true). + 3> Txt = [<<"First bytes">>,<<"Second bytes">>]. + [<<"First bytes">>,<<"Second bytes">>] + 4> crypto:crypto_one_time(aes_128_ctr, Key, IV, Txt, true). <<67,44,216,166,25,130,203,5,66,6,162,16,79,94,115,234, 197,94,253,16,144,151,41>> 5>

    The [<<"First bytes">>,<<"Second bytes">>] could of course have been one @@ -152,14 +152,14 @@ <<0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1>> 2> IV = <<0:128>>. <<0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0>> - 3> Txt = [<<"First bytes">>,<<"Second bytes">>]. - [<<"First bytes">>,<<"Second bytes">>] + 3> Txt = [<<"First bytes">>,<<"Second bytes">>]. + [<<"First bytes">>,<<"Second bytes">>] 4> AAD = <<"Some additional auth data">>. <<"Some additional auth data">> - 5> crypto:crypto_one_time_aead(aes_128_gcm, Key, IV, Txt, AAD, true). - {<<240,130,38,96,130,241,189,52,3,190,179,213,132,1,72, + 5> crypto:crypto_one_time_aead(aes_128_gcm, Key, IV, Txt, AAD, true). + {<<240,130,38,96,130,241,189,52,3,190,179,213,132,1,72, 192,103,176,90,104,15,71,158>>, - <<131,47,45,91,142,85,9,244,21,141,214,71,31,135,2,155>>} + <<131,47,45,91,142,85,9,244,21,141,214,71,31,135,2,155>>} 6>

    The [<<"First bytes">>,<<"Second bytes">>] could of course have been one single binary: <<"First bytesSecond bytes">>.

    @@ -169,21 +169,21 @@

    	1> Key = <<1:128>>.
     	<<0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1>>
    -	2> StateMac = crypto:mac_init(cmac, aes_128_cbc, Key).
    +	2> StateMac = crypto:mac_init(cmac, aes_128_cbc, Key).
     	#Ref<0.2424664121.2781478916.232610>
    -	3> crypto:mac_update(StateMac, <<"First bytes">>).
    +	3> crypto:mac_update(StateMac, <<"First bytes">>).
     	#Ref<0.2424664121.2781478916.232610>
    -	4> crypto:mac_update(StateMac, " ").
    +	4> crypto:mac_update(StateMac, " ").
     	#Ref<0.2424664121.2781478916.232610>
    -	5> crypto:mac_update(StateMac, <<"last bytes">>).
    +	5> crypto:mac_update(StateMac, <<"last bytes">>).
     	#Ref<0.2424664121.2781478916.232610>
    -	6> crypto:mac_final(StateMac).
    +	6> crypto:mac_final(StateMac).
     	<<68,191,219,128,84,77,11,193,197,238,107,6,214,141,160,
     	249>>
    -	7>

    and compare the result with a single calculation just for this example:

    	7> crypto:mac(cmac, aes_128_cbc, Key, "First bytes last bytes").
    +	7>

    and compare the result with a single calculation just for this example:

    	7> crypto:mac(cmac, aes_128_cbc, Key, "First bytes last bytes").
     	<<68,191,219,128,84,77,11,193,197,238,107,6,214,141,160,
     	249>>
    -	8> v(7) == v(6).
    +	8> v(7) == v(6).
     	true
     	9>

    /usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/crypto.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1823)) --- old//usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/crypto.html 2026-06-04 19:05:05.003474070 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/crypto.html 2026-06-04 19:05:05.004474079 +0000 @@ -595,7 +595,7 @@ -
    rsa_public() = [E, N]
    rsa_private() = [E, N, D] | [E, N, D, P1, P2, E1, E2, C]

    Where E is the public exponent, N is public modulus and D is the private +

    rsa_public() = [E, N]
    rsa_private() = [E, N, D] | [E, N, D, P1, P2, E1, E2, C]

    Where E is the public exponent, N is public modulus and D is the private exponent. The longer key format contains redundant information that will make the calculation faster. P1 and P2 are first and second prime factors. E1 and E2 are first and second exponents. C is the CRT coefficient. The terminology is @@ -3119,7 +3119,7 @@

    -
    rsa_public() = [E, N]
    rsa_private() = [E, N, D] | [E, N, D, P1, P2, E1, E2, C]

    Where E is the public exponent, N is public modulus and D is the private +

    rsa_public() = [E, N]
    rsa_private() = [E, N, D] | [E, N, D, P1, P2, E1, E2, C]

    Where E is the public exponent, N is public modulus and D is the private exponent. The longer key format contains redundant information that will make the calculation faster. P1 and P2 are first and second prime factors. E1 and E2 are first and second exponents. C is the CRT coefficient. The terminology is @@ -5536,9 +5536,9 @@ BN_rand_range).

    Saves the state in the process dictionary before returning it as well. See also rand:seed/1 and rand_seed_s/0.

    When using the state object from this function the rand functions using it may raise exception error:low_entropy in case the random generator failed due -to lack of secure "randomness".

    Example

    _ = crypto:rand_seed(),
    -_IntegerValue = rand:uniform(42), % [1; 42]
    -_FloatValue = rand:uniform().     % [0.0; 1.0[
    +to lack of secure "randomness".

    Example

    _ = crypto:rand_seed(),
    +_IntegerValue = rand:uniform(42), % [1; 42]
    +_FloatValue = rand:uniform().     % [0.0; 1.0[
    @@ -5604,9 +5604,9 @@ generate cryptographically strong random numbers.

    Saves the state in the process dictionary before returning it as well. See also rand:seed/1 and rand_seed_alg_s/1.

    When using the state object from this function the rand functions using it may raise exception error:low_entropy in case the random generator failed due -to lack of secure "randomness".

    Example

    _ = crypto:rand_seed_alg(crypto_cache),
    -_IntegerValue = rand:uniform(42), % [1; 42]
    -_FloatValue = rand:uniform().     % [0.0; 1.0[
    +to lack of secure "randomness".

    Example

    _ = crypto:rand_seed_alg(crypto_cache),
    +_IntegerValue = rand:uniform(42), % [1; 42]
    +_FloatValue = rand:uniform().     % [0.0; 1.0[
    @@ -5638,12 +5638,12 @@

    Creates a state object for random number generation, in order to generate cryptographically unpredictable random numbers.

    Saves the state in the process dictionary before returning it as well. See also -rand_seed_alg_s/2.

    Example

    _ = crypto:rand_seed_alg(crypto_aes, "my seed"),
    -IntegerValue = rand:uniform(42), % [1; 42]
    -FloatValue = rand:uniform(),     % [0.0; 1.0[
    -_ = crypto:rand_seed_alg(crypto_aes, "my seed"),
    -IntegerValue = rand:uniform(42), % Same values
    -FloatValue = rand:uniform().     % again
    +rand_seed_alg_s/2.

    Example

    _ = crypto:rand_seed_alg(crypto_aes, "my seed"),
    +IntegerValue = rand:uniform(42), % [1; 42]
    +FloatValue = rand:uniform(),     % [0.0; 1.0[
    +_ = crypto:rand_seed_alg(crypto_aes, "my seed"),
    +IntegerValue = rand:uniform(42), % Same values
    +FloatValue = rand:uniform().     % again
    @@ -6140,12 +6140,12 @@
    -

    Get information about crypto and the OpenSSL backend.

    Returns a map with information about the compilation and linking of crypto.

    Example:

    1> crypto:info().
    -#{compile_type => normal,
    +

    Get information about crypto and the OpenSSL backend.

    Returns a map with information about the compilation and linking of crypto.

    Example:

    1> crypto:info().
    +#{compile_type => normal,
       cryptolib_version_compiled => "OpenSSL 3.0.0 7 sep 2021",
       cryptolib_version_linked => "OpenSSL 3.0.0 7 sep 2021",
       link_type => dynamic,
    -  otp_crypto_version => "5.0.2"}
    +  otp_crypto_version => "5.0.2"}
     2>

    More association types than documented may be present in the map.

    @@ -6212,8 +6212,8 @@

    Get the name and version of the libraries used by crypto.

    Name is the name of the library. VerNum is the numeric version according to the library's own versioning scheme. VerStr contains a text variant of the -version.

    > info_lib().
    -[{<<"OpenSSL">>,269484095,<<"OpenSSL 1.1.0c  10 Nov 2016"">>}]

    Note

    From OTP R16 the numeric version represents the version of the OpenSSL +version.

    > info_lib().
    +[{<<"OpenSSL">>,269484095,<<"OpenSSL 1.1.0c  10 Nov 2016"">>}]

    Note

    From OTP R16 the numeric version represents the version of the OpenSSL header files (openssl/opensslv.h) used when crypto was compiled. The text variant represents the libcrypto library used at runtime. In earlier OTP versions both numeric and text was taken from the library.

    @@ -7154,7 +7154,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/crypto_app.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/crypto_app.html 2026-06-04 19:05:05.025474274 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/crypto_app.html 2026-06-04 19:05:05.028474302 +0000 @@ -225,7 +225,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    Missing in old package: /usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/dist/search_data-889ACB16.js Missing in old package: /usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/dist/search_data-889ACB16.js /usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/engine_keys.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (860)) --- old//usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/engine_keys.html 2026-06-04 19:05:05.051474515 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/engine_keys.html 2026-06-04 19:05:05.051474515 +0000 @@ -161,13 +161,13 @@ Sign with an engine stored private key

    This example shows how to construct a key reference that is used in a sign -operation. The actual key is stored in the engine that is loaded at prompt 1.

    1> {ok, EngineRef} = crypto:engine_load(....).
    +operation. The actual key is stored in the engine that is loaded at prompt 1.

    1> {ok, EngineRef} = crypto:engine_load(....).
     ...
    -{ok,#Ref<0.2399045421.3028942852.173962>}
    -2> PrivKey = #{engine => EngineRef,
    -               key_id => "id of the private key in Engine"}.
    +{ok,#Ref<0.2399045421.3028942852.173962>}
    +2> PrivKey = #{engine => EngineRef,
    +               key_id => "id of the private key in Engine"}.
     ...
    -3> Signature = crypto:sign(rsa, sha, <<"The message">>, PrivKey).
    +3> Signature = crypto:sign(rsa, sha, <<"The message">>, PrivKey).
     <<65,6,125,254,54,233,84,77,83,63,168,28,169,214,121,76,
       207,177,124,183,156,185,160,243,36,79,125,230,231,...>>

    @@ -177,10 +177,10 @@

    Here the signature and message in the last example is verifyed using the public key. The public key is stored in an engine, only to exemplify that it is -possible. The public key could of course be handled openly as usual.

    4> PublicKey = #{engine => EngineRef,
    -                 key_id => "id of the public key in Engine"}.
    +possible. The public key could of course be handled openly as usual.

    4> PublicKey = #{engine => EngineRef,
    +                 key_id => "id of the public key in Engine"}.
     ...
    -5> crypto:verify(rsa, sha, <<"The message">>, Signature, PublicKey).
    +5> crypto:verify(rsa, sha, <<"The message">>, Signature, PublicKey).
     true
     6>

    @@ -189,11 +189,11 @@ Using a password protected private key

    The same example as the first sign example, except that a password protects the -key down in the Engine.

    6> PrivKeyPwd = #{engine => EngineRef,
    +key down in the Engine.

    6> PrivKeyPwd = #{engine => EngineRef,
                       key_id => "id of the pwd protected private key in Engine",
    -		  password => "password"}.
    +		  password => "password"}.
     ...
    -7> crypto:sign(rsa, sha, <<"The message">>, PrivKeyPwd).
    +7> crypto:sign(rsa, sha, <<"The message">>, PrivKeyPwd).
     <<140,80,168,101,234,211,146,183,231,190,160,82,85,163,
       175,106,77,241,141,120,72,149,181,181,194,154,175,76,
       223,...>>
    @@ -248,7 +248,7 @@
               Erlang programming language
     
           

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/engine_load.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1041)) --- old//usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/engine_load.html 2026-06-04 19:05:05.069474682 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/engine_load.html 2026-06-04 19:05:05.070474691 +0000 @@ -152,35 +152,35 @@ Dynamically load an engine from default directory

    If the engine is located in the OpenSSL/LibreSSL installation engines -directory.

    1> {ok, Engine} = crypto:engine_load(<<"otp_test_engine">>, [], []).
    - {ok, #Ref}

    +directory.

    1> {ok, Engine} = crypto:engine_load(<<"otp_test_engine">>, [], []).
    + {ok, #Ref}

    Load an engine with the dynamic engine

    Load an engine with the help of the dynamic engine by giving the path to the -library.

     2> {ok, Engine} = crypto:engine_load(<<"dynamic">>,
    -                                      [{<<"SO_PATH">>,
    -                                        <<"/some/path/otp_test_engine.so">>},
    -                                       {<<"ID">>, <<"MD5">>},
    -                                       <<"LOAD">>],
    -                                      []).
    - {ok, #Ref}

    +library.

     2> {ok, Engine} = crypto:engine_load(<<"dynamic">>,
    +                                      [{<<"SO_PATH">>,
    +                                        <<"/some/path/otp_test_engine.so">>},
    +                                       {<<"ID">>, <<"MD5">>},
    +                                       <<"LOAD">>],
    +                                      []).
    + {ok, #Ref}

    Load an engine and replace some methods

    Load an engine with the help of the dynamic engine and just replace some engine -methods.

     3> {ok, Engine} = crypto:engine_load(<<"dynamic">>,
    -                                      [{<<"SO_PATH">>,
    -                                        <<"/some/path/otp_test_engine.so">>},
    -                                       {<<"ID">>, <<"MD5">>},
    -                                       <<"LOAD">>],
    -                                      []).
    -{ok, #Ref}
    -4> ok = crypto:engine_register(Engine, [engine_method_digests]).
    +methods.

     3> {ok, Engine} = crypto:engine_load(<<"dynamic">>,
    +                                      [{<<"SO_PATH">>,
    +                                        <<"/some/path/otp_test_engine.so">>},
    +                                       {<<"ID">>, <<"MD5">>},
    +                                       <<"LOAD">>],
    +                                      []).
    +{ok, #Ref}
    +4> ok = crypto:engine_register(Engine, [engine_method_digests]).
     ok

    @@ -189,19 +189,19 @@

    This function makes sure the engine is loaded just once and the ID is added to the internal engine list of OpenSSL. The following calls to the function will -check if the ID is loaded and then just get a new reference to the engine.

     5> {ok, Engine} = crypto:ensure_engine_loaded(<<"MD5">>,
    -                                               <<"/some/path/otp_test_engine.so">>).
    - {ok, #Ref}

    To remove the tag from the OpenSSL engine list use crypto:engine_remove/1.

     6> crypto:engine_remove(Engine).
    +check if the ID is loaded and then just get a new reference to the engine.

     5> {ok, Engine} = crypto:ensure_engine_loaded(<<"MD5">>,
    +                                               <<"/some/path/otp_test_engine.so">>).
    + {ok, #Ref}

    To remove the tag from the OpenSSL engine list use crypto:engine_remove/1.

     6> crypto:engine_remove(Engine).
      ok

    To unload it use crypto:engine_unload/1 which removes the references to the -engine.

     6> crypto:engine_unload(Engine).
    +engine.

     6> crypto:engine_unload(Engine).
      ok

    List all engines currently loaded

    -
     8> crypto:engine_list().
    -[<<"dynamic">>, <<"MD5">>]
    +
     8> crypto:engine_list().
    +[<<"dynamic">>, <<"MD5">>]
    @@ -252,7 +252,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/fips.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/fips.html 2026-06-04 19:05:05.088474858 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/fips.html 2026-06-04 19:05:05.088474858 +0000 @@ -293,7 +293,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/licenses.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/licenses.html 2026-06-04 19:05:05.103474997 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/licenses.html 2026-06-04 19:05:05.103474997 +0000 @@ -296,7 +296,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/new_api.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (2413)) --- old//usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/new_api.html 2026-06-04 19:05:05.121475164 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/new_api.html 2026-06-04 19:05:05.121475164 +0000 @@ -192,41 +192,41 @@ initialises the crypto context. One or more calls crypto_update/2 does the actual encryption or decryption for each block.

    This example shows first the encryption of two blocks and then decryptions of the cipher text, but divided into three blocks just to show that it is possible -to divide the plain text and cipher text differently for some ciphers:

    	1> crypto:start().
    +to divide the plain text and cipher text differently for some ciphers:

    	1> crypto:start().
     	ok
     	2> Key = <<1:128>>.
     	<<0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1>>
     	3> IV = <<0:128>>.
     	<<0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0>>
    -	4> StateEnc = crypto:crypto_init(aes_128_ctr, Key, IV, true). % encrypt -> true
    +	4> StateEnc = crypto:crypto_init(aes_128_ctr, Key, IV, true). % encrypt -> true
     	#Ref<0.3768901617.1128660993.124047>
    -	5> crypto:crypto_update(StateEnc, <<"First bytes">>).
    +	5> crypto:crypto_update(StateEnc, <<"First bytes">>).
     	<<67,44,216,166,25,130,203,5,66,6,162>>
    -	6> crypto:crypto_update(StateEnc, <<"Second bytes">>).
    +	6> crypto:crypto_update(StateEnc, <<"Second bytes">>).
     	<<16,79,94,115,234,197,94,253,16,144,151,41>>
     	7>
    -	7> StateDec = crypto:crypto_init(aes_128_ctr, Key, IV, false). % decrypt -> false
    +	7> StateDec = crypto:crypto_init(aes_128_ctr, Key, IV, false). % decrypt -> false
     	#Ref<0.3768901617.1128660994.124255>
    -	8> crypto:crypto_update(StateDec, <<67,44,216,166,25,130,203>>).
    +	8> crypto:crypto_update(StateDec, <<67,44,216,166,25,130,203>>).
     	<<"First b">>
    -	9> crypto:crypto_update(StateDec, <<5,66,6,162,16,79,94,115,234,197,
    -        94,253,16,144,151>>).
    +	9> crypto:crypto_update(StateDec, <<5,66,6,162,16,79,94,115,234,197,
    +        94,253,16,144,151>>).
     	<<"ytesSecond byte">>
    -	10> crypto:crypto_update(StateDec, <<41>>).
    +	10> crypto:crypto_update(StateDec, <<41>>).
     	<<"s">>
     	11>

    Note that the internal data that the StateEnc and StateDec references are destructivly updated by the calls to crypto_update/2. This is to gain time in the calls of the nifs interfacing the cryptolib. In a loop where the state is saved in the loop's state, it also saves one update of the loop state per crypto operation.

    For example, a simple server receiving text parts to encrypt and send the result -back to the one who sent them (the Requester):

    	encode(Crypto, Key, IV) ->
    -	crypto_loop(crypto:crypto_init(Crypto, Key, IV, true)).
    +back to the one who sent them (the Requester):

    	encode(Crypto, Key, IV) ->
    +	crypto_loop(crypto:crypto_init(Crypto, Key, IV, true)).
     
    -	crypto_loop(State) ->
    +	crypto_loop(State) ->
     	receive
    -        {Text, Requester} ->
    -        Requester ! crypto:crypto_update(State, Text),
    -	loop(State)
    +        {Text, Requester} ->
    +        Requester ! crypto:crypto_update(State, Text),
    +	loop(State)
     	end.

    @@ -239,9 +239,9 @@ <<0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1>> 2> IV = <<0:128>>. <<0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0>> - 3> Txt = [<<"First bytes">>,<<"Second bytes">>]. - [<<"First bytes">>,<<"Second bytes">>] - 4> crypto:crypto_one_time(aes_128_ctr, Key, IV, Txt, true). + 3> Txt = [<<"First bytes">>,<<"Second bytes">>]. + [<<"First bytes">>,<<"Second bytes">>] + 4> crypto:crypto_one_time(aes_128_ctr, Key, IV, Txt, true). <<67,44,216,166,25,130,203,5,66,6,162,16,79,94,115,234, 197,94,253,16,144,151,41>> 5>

    The [<<"First bytes">>,<<"Second bytes">>] could of course have been one @@ -257,14 +257,14 @@ <<0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1>> 2> IV = <<0:128>>. <<0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0>> - 3> Txt = [<<"First bytes">>,<<"Second bytes">>]. - [<<"First bytes">>,<<"Second bytes">>] + 3> Txt = [<<"First bytes">>,<<"Second bytes">>]. + [<<"First bytes">>,<<"Second bytes">>] 4> AAD = <<"Some additional auth data">>. <<"Some additional auth data">> - 5> crypto:crypto_one_time_aead(aes_128_gcm, Key, IV, Txt, AAD, true). - {<<240,130,38,96,130,241,189,52,3,190,179,213,132,1,72, + 5> crypto:crypto_one_time_aead(aes_128_gcm, Key, IV, Txt, AAD, true). + {<<240,130,38,96,130,241,189,52,3,190,179,213,132,1,72, 192,103,176,90,104,15,71,158>>, - <<131,47,45,91,142,85,9,244,21,141,214,71,31,135,2,155>>} + <<131,47,45,91,142,85,9,244,21,141,214,71,31,135,2,155>>} 6>

    The [<<"First bytes">>,<<"Second bytes">>] could of course have been one single binary: <<"First bytesSecond bytes">>.

    @@ -274,21 +274,21 @@

    	1> Key = <<1:128>>.
     	<<0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1>>
    -	2> StateMac = crypto:mac_init(cmac, aes_128_cbc, Key).
    +	2> StateMac = crypto:mac_init(cmac, aes_128_cbc, Key).
     	#Ref<0.2424664121.2781478916.232610>
    -	3> crypto:mac_update(StateMac, <<"First bytes">>).
    +	3> crypto:mac_update(StateMac, <<"First bytes">>).
     	#Ref<0.2424664121.2781478916.232610>
    -	4> crypto:mac_update(StateMac, " ").
    +	4> crypto:mac_update(StateMac, " ").
     	#Ref<0.2424664121.2781478916.232610>
    -	5> crypto:mac_update(StateMac, <<"last bytes">>).
    +	5> crypto:mac_update(StateMac, <<"last bytes">>).
     	#Ref<0.2424664121.2781478916.232610>
    -	6> crypto:mac_final(StateMac).
    +	6> crypto:mac_final(StateMac).
     	<<68,191,219,128,84,77,11,193,197,238,107,6,214,141,160,
     	249>>
    -	7>

    and compare the result with a single calculation just for this example:

    	7> crypto:mac(cmac, aes_128_cbc, Key, "First bytes last bytes").
    +	7>

    and compare the result with a single calculation just for this example:

    	7> crypto:mac(cmac, aes_128_cbc, Key, "First bytes last bytes").
     	<<68,191,219,128,84,77,11,193,197,238,107,6,214,141,160,
     	249>>
    -	8> v(7) == v(6).
    +	8> v(7) == v(6).
     	true
     	9>

    @@ -345,7 +345,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/notes.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1415)) --- old//usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/notes.html 2026-06-04 19:05:05.153475461 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/notes.html 2026-06-04 19:05:05.153475461 +0000 @@ -2185,7 +2185,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/search.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/search.html 2026-06-04 19:05:05.174034173 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/crypto-5.5.1/doc/html/search.html 2026-06-04 19:05:05.174034173 +0000 @@ -122,7 +122,7 @@
    - + /usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/404.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/404.html 2026-06-04 19:05:05.187475777 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/404.html 2026-06-04 19:05:05.188411722 +0000 @@ -147,7 +147,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/api-reference.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/api-reference.html 2026-06-04 19:05:05.202475916 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/api-reference.html 2026-06-04 19:05:05.203475925 +0000 @@ -203,7 +203,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/debugger.epub/OEBPS/content.opf differs (XML 1.0 document, ASCII text) --- old//usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/debugger.epub/OEBPS/content.opf 2026-06-04 00:08:20.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/debugger.epub/OEBPS/content.opf 2042-07-06 13:27:46.000000000 +0000 @@ -4,10 +4,10 @@ version="3.0"> debugger - 5.4 - urn:uuid:82a6208d-015d-0a19-d0c3-f9293435d423 + urn:uuid:fd7e41c8-6202-4d69-8938-01272745805e en - 2026-06-04T00:08:20Z + 2042-07-06T13:27:46Z /usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/debugger.epub/OEBPS/debugger_chapter.xhtml differs (HTML document, ASCII text, with very long lines (1407)) --- old//usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/debugger.epub/OEBPS/debugger_chapter.xhtml 2026-06-04 00:08:20.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/debugger.epub/OEBPS/debugger_chapter.xhtml 2042-07-06 13:27:46.000000000 +0000 @@ -59,12 +59,12 @@

    To have an effect, a breakpoint must be set at an executable line, which is a line of code containing an executable expression such as a matching or a function call. A blank line or a line containing a comment, function head, or -pattern in a case statement or receive statement is not executable.

    In the following example, lines 2, 4, 6, 8, and 11 are executable lines:

    1: is_loaded(Module,Compiled) ->
    -2:   case get_file(Module,Compiled) of
    -3:     {ok,File} ->
    -4:       case code:which(Module) of
    +pattern in a case statement or receive statement is not executable.

    In the following example, lines 2, 4, 6, 8, and 11 are executable lines:

    1: is_loaded(Module,Compiled) ->
    +2:   case get_file(Module,Compiled) of
    +3:     {ok,File} ->
    +4:       case code:which(Module) of
     5:         ?TAG ->
    -6:           {loaded,File};
    +6:           {loaded,File};
     7:         _ ->
     8:           unloaded
     9:       end;
    @@ -103,13 +103,13 @@
     returns unbound or {value,Value}.

    Conditional Break Dialog Window

    Right-click the Module entry to open a popup menu from which the appropriate module can be selected.

    Example:

    A conditional breakpoint calling c_test:c_break/1 is added at line 6 in module fact. Each time the breakpoint is reached, the function is called. When N is -equal to 3, the function returns true and the process stops.

    Extract from fact.erl:

    5. fac(0) -> 1;
    -6. fac(N) when N > 0, is_integer(N) -> N * fac(N-1).

    Definition of c_test:c_break/1:

    -module(c_test).
    --export([c_break/1]).
    +equal to 3, the function returns true and the process stops.

    Extract from fact.erl:

    5. fac(0) -> 1;
    +6. fac(N) when N > 0, is_integer(N) -> N * fac(N-1).

    Definition of c_test:c_break/1:

    -module(c_test).
    +-export([c_break/1]).
     
    -c_break(Bindings) ->
    -    case int:get_binding('N', Bindings) of
    -        {value, 3} ->
    +c_break(Bindings) ->
    +    case int:get_binding('N', Bindings) of
    +        {value, 3} ->
                 true;
             _ ->
                 false
    @@ -130,12 +130,12 @@
     

    The Erlang emulator keeps track of a stack trace, information about recent function calls. This information is used if an error occurs, for example:

    1> catch a+1.
    -{'EXIT',{badarith,[{erlang,'+',[a,1],[]},
    -                   {erl_eval,do_apply,6,[{file,"erl_eval.erl"},{line,573}]},
    -                   {erl_eval,expr,5,[{file,"erl_eval.erl"},{line,357}]},
    -                   {shell,exprs,7,[{file,"shell.erl"},{line,674}]},
    -                   {shell,eval_exprs,7,[{file,"shell.erl"},{line,629}]},
    -                   {shell,eval_loop,3,[{file,"shell.erl"},{line,614}]}]}}

    For details about the stack trace, see section +{'EXIT',{badarith,[{erlang,'+',[a,1],[]}, + {erl_eval,do_apply,6,[{file,"erl_eval.erl"},{line,573}]}, + {erl_eval,expr,5,[{file,"erl_eval.erl"},{line,357}]}, + {shell,exprs,7,[{file,"shell.erl"},{line,674}]}, + {shell,eval_exprs,7,[{file,"shell.erl"},{line,629}]}, + {shell,eval_loop,3,[{file,"shell.erl"},{line,614}]}]}}

    For details about the stack trace, see section Errors and Error Handling in the Erlang Reference Manual.

    Debugger emulates the stack trace by keeping track of recently called interpreted functions. (The real stack trace cannot be used, as it shows which /usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/debugger.epub/OEBPS/int.xhtml differs (HTML document, ASCII text, with very long lines (962)) --- old//usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/debugger.epub/OEBPS/int.xhtml 2026-06-04 00:08:20.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/debugger.epub/OEBPS/int.xhtml 2042-07-06 13:27:46.000000000 +0000 @@ -570,7 +570,7 @@

    Sets when and how to attach automatically to a process executing code in interpreted modules.

    By default when the interpreter is started, automatic attach is disabled.

    If Flags is an empty list, automatic attach is disabled.

    Otherwise Flags should be a list containing at least one of the following flags:

    • init - Attach when a process for the first time calls an interpreted -function.
    • break - Attach whenever a process reaches a breakpoint.
    • exit - Attach when a process terminates.

    When the specified event occurs, the function Function is called as:

    spawn(Module, Name, [Pid | Args])

    Pid is the pid of the process executing interpreted code.

    +function.
  • break - Attach whenever a process reaches a breakpoint.
  • exit - Attach when a process terminates.
  • When the specified event occurs, the function Function is called as:

    spawn(Module, Name, [Pid | Args])

    Pid is the pid of the process executing interpreted code.

    /usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/debugger.epub/OEBPS/i.xhtml differs (HTML document, ASCII text, with very long lines (374)) --- old//usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/debugger.epub/OEBPS/i.xhtml 2026-06-04 00:08:20.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/debugger.epub/OEBPS/i.xhtml 2042-07-06 13:27:46.000000000 +0000 @@ -29,9 +29,9 @@ interpreted processes and break points.

    It is possible to attach to interpreted processes by only giving the corresponding process identity. By default, an attachment window is displayed. Processes at other Erlang nodes can be attached manually or automatically.

    The functions in this module are defined in the Erlang shell. That is, -they can be called without the i: prefix. For example:

    1> ii(t).
    -{module,t}
    -2> iaa([init]).
    +they can be called without the i: prefix. For example:

    1> ii(t).
    +{module,t}
    +2> iaa([init]).
     true
    /usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/debugger.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (449)) --- old//usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/debugger.html 2026-06-04 19:05:05.308476899 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/debugger.html 2026-06-04 19:05:05.308476899 +0000 @@ -347,7 +347,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/debugger_chapter.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1407)) --- old//usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/debugger_chapter.html 2026-06-04 19:05:05.329477094 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/debugger_chapter.html 2026-06-04 19:05:05.330477103 +0000 @@ -164,12 +164,12 @@

    To have an effect, a breakpoint must be set at an executable line, which is a line of code containing an executable expression such as a matching or a function call. A blank line or a line containing a comment, function head, or -pattern in a case statement or receive statement is not executable.

    In the following example, lines 2, 4, 6, 8, and 11 are executable lines:

    1: is_loaded(Module,Compiled) ->
    -2:   case get_file(Module,Compiled) of
    -3:     {ok,File} ->
    -4:       case code:which(Module) of
    +pattern in a case statement or receive statement is not executable.

    In the following example, lines 2, 4, 6, 8, and 11 are executable lines:

    1: is_loaded(Module,Compiled) ->
    +2:   case get_file(Module,Compiled) of
    +3:     {ok,File} ->
    +4:       case code:which(Module) of
     5:         ?TAG ->
    -6:           {loaded,File};
    +6:           {loaded,File};
     7:         _ ->
     8:           unloaded
     9:       end;
    @@ -208,13 +208,13 @@
     returns unbound or {value,Value}.

    Conditional Break Dialog Window

    Right-click the Module entry to open a popup menu from which the appropriate module can be selected.

    Example:

    A conditional breakpoint calling c_test:c_break/1 is added at line 6 in module fact. Each time the breakpoint is reached, the function is called. When N is -equal to 3, the function returns true and the process stops.

    Extract from fact.erl:

    5. fac(0) -> 1;
    -6. fac(N) when N > 0, is_integer(N) -> N * fac(N-1).

    Definition of c_test:c_break/1:

    -module(c_test).
    --export([c_break/1]).
    -
    -c_break(Bindings) ->
    -    case int:get_binding('N', Bindings) of
    -        {value, 3} ->
    +equal to 3, the function returns true and the process stops.

    Extract from fact.erl:

    5. fac(0) -> 1;
    +6. fac(N) when N > 0, is_integer(N) -> N * fac(N-1).

    Definition of c_test:c_break/1:

    -module(c_test).
    +-export([c_break/1]).
    +
    +c_break(Bindings) ->
    +    case int:get_binding('N', Bindings) of
    +        {value, 3} ->
                 true;
             _ ->
                 false
    @@ -235,12 +235,12 @@
     
     

    The Erlang emulator keeps track of a stack trace, information about recent function calls. This information is used if an error occurs, for example:

    1> catch a+1.
    -{'EXIT',{badarith,[{erlang,'+',[a,1],[]},
    -                   {erl_eval,do_apply,6,[{file,"erl_eval.erl"},{line,573}]},
    -                   {erl_eval,expr,5,[{file,"erl_eval.erl"},{line,357}]},
    -                   {shell,exprs,7,[{file,"shell.erl"},{line,674}]},
    -                   {shell,eval_exprs,7,[{file,"shell.erl"},{line,629}]},
    -                   {shell,eval_loop,3,[{file,"shell.erl"},{line,614}]}]}}

    For details about the stack trace, see section +{'EXIT',{badarith,[{erlang,'+',[a,1],[]}, + {erl_eval,do_apply,6,[{file,"erl_eval.erl"},{line,573}]}, + {erl_eval,expr,5,[{file,"erl_eval.erl"},{line,357}]}, + {shell,exprs,7,[{file,"shell.erl"},{line,674}]}, + {shell,eval_exprs,7,[{file,"shell.erl"},{line,629}]}, + {shell,eval_loop,3,[{file,"shell.erl"},{line,614}]}]}}

    For details about the stack trace, see section Errors and Error Handling in the Erlang Reference Manual.

    Debugger emulates the stack trace by keeping track of recently called interpreted functions. (The real stack trace cannot be used, as it shows which @@ -547,7 +547,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    Missing in old package: /usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/dist/search_data-55C9925A.js Missing in old package: /usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/dist/search_data-55C9925A.js /usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/i.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (374)) --- old//usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/i.html 2026-06-04 19:05:05.356477344 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/i.html 2026-06-04 19:05:05.356477344 +0000 @@ -134,9 +134,9 @@ interpreted processes and break points.

    It is possible to attach to interpreted processes by only giving the corresponding process identity. By default, an attachment window is displayed. Processes at other Erlang nodes can be attached manually or automatically.

    The functions in this module are defined in the Erlang shell. That is, -they can be called without the i: prefix. For example:

    1> ii(t).
    -{module,t}
    -2> iaa([init]).
    +they can be called without the i: prefix. For example:

    1> ii(t).
    +{module,t}
    +2> iaa([init]).
     true
    @@ -1348,7 +1348,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/int.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (962)) --- old//usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/int.html 2026-06-04 19:05:05.380477567 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/int.html 2026-06-04 19:05:05.381477576 +0000 @@ -686,7 +686,7 @@

    Sets when and how to attach automatically to a process executing code in interpreted modules.

    By default when the interpreter is started, automatic attach is disabled.

    If Flags is an empty list, automatic attach is disabled.

    Otherwise Flags should be a list containing at least one of the following flags:

    • init - Attach when a process for the first time calls an interpreted -function.
    • break - Attach whenever a process reaches a breakpoint.
    • exit - Attach when a process terminates.

    When the specified event occurs, the function Function is called as:

    spawn(Module, Name, [Pid | Args])

    Pid is the pid of the process executing interpreted code.

    +function.
  • break - Attach whenever a process reaches a breakpoint.
  • exit - Attach when a process terminates.
  • When the specified event occurs, the function Function is called as:

    spawn(Module, Name, [Pid | Args])

    Pid is the pid of the process executing interpreted code.

    @@ -1459,7 +1459,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/introduction.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/introduction.html 2026-06-04 19:05:05.399477743 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/introduction.html 2026-06-04 19:05:05.399477743 +0000 @@ -192,7 +192,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/notes.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (645)) --- old//usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/notes.html 2026-06-04 19:05:05.420477938 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/notes.html 2026-06-04 19:05:05.421477947 +0000 @@ -963,7 +963,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/search.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/search.html 2026-06-04 19:05:05.437461971 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/debugger-5.4/doc/html/search.html 2026-06-04 19:05:05.436439151 +0000 @@ -122,7 +122,7 @@
    - + /usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/404.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/404.html 2026-06-04 19:05:05.451476916 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/404.html 2026-06-04 19:05:05.451893750 +0000 @@ -147,7 +147,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/api-reference.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/api-reference.html 2026-06-04 19:05:05.466478365 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/api-reference.html 2026-06-04 19:05:05.466478365 +0000 @@ -185,7 +185,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/dialyzer.epub/OEBPS/content.opf differs (XML 1.0 document, ASCII text) --- old//usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/dialyzer.epub/OEBPS/content.opf 2026-06-04 00:08:47.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/dialyzer.epub/OEBPS/content.opf 2042-07-06 13:28:11.000000000 +0000 @@ -4,10 +4,10 @@ version="3.0"> dialyzer - 5.2.1 - urn:uuid:9cd14b7d-0f10-5ece-83f5-381188a1f68f + urn:uuid:1fc477bb-41e4-0c57-6b57-5f0ea3f92895 en - 2026-06-04T00:08:47Z + 2042-07-06T13:28:11Z /usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/dialyzer.epub/OEBPS/dialyzer_chapter.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (1095)) --- old//usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/dialyzer.epub/OEBPS/dialyzer_chapter.xhtml 2026-06-04 00:08:47.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/dialyzer.epub/OEBPS/dialyzer_chapter.xhtml 2042-07-06 13:28:11.000000000 +0000 @@ -104,29 +104,29 @@ deduce). One implication of this is that if the user gives a spec for a function which overlaps with Dialyzer's inferred type, but is more restrictive, Dialyzer will trust those restrictions. This may then generate an error elsewhere that -follows from the erroneously restricted spec.

    Examples:

    Non-overlapping argument:

    -spec foo(boolean()) -> string().
    +follows from the erroneously restricted spec.

    Examples:

    Non-overlapping argument:

    -spec foo(boolean()) -> string().
     %% Dialyzer will infer: foo(integer()) -> string().
    -foo(N) ->
    -    integer_to_list(N).

    Since the type of the argument in the spec is different from the type that +foo(N) -> + integer_to_list(N).

    Since the type of the argument in the spec is different from the type that Dialyzer inferred, Dialyzer will generate the following warning:

    some_module.erl:7:2: Invalid type specification for function some_module:foo/1.
      The success typing is some_module:foo
    -          (integer()) -> string()
    +          (integer()) -> string()
      But the spec is some_module:foo
    -          (boolean()) -> string()
    - They do not overlap in the 1st argument

    Non-overlapping return:

    -spec bar(a | b) -> atom().
    +          (boolean()) -> string()
    + They do not overlap in the 1st argument

    Non-overlapping return:

    -spec bar(a | b) -> atom().
     %% Dialyzer will infer: bar(a | b) -> binary().
    -bar(a) -> <<"a">>;
    -bar(b) -> <<"b">>.

    Since the return value in the spec and the return value inferred by Dialyzer are +bar(a) -> <<"a">>; +bar(b) -> <<"b">>.

    Since the return value in the spec and the return value inferred by Dialyzer are different, Dialyzer will generate the following warning:

    some_module.erl:11:2: Invalid type specification for function some_module:bar/1.
      The success typing is some_module:bar
    -          ('a' | 'b') -> <<_:8>>
    +          ('a' | 'b') -> <<_:8>>
      But the spec is some_module:bar
    -          ('a' | 'b') -> atom()
    - The return types do not overlap

    Overlapping spec and inferred type:

    -spec baz(a | b) -> non_neg_integer().
    +          ('a' | 'b') -> atom()
    + The return types do not overlap

    Overlapping spec and inferred type:

    -spec baz(a | b) -> non_neg_integer().
     %% Dialyzer will infer: baz(b | c | d) -> -1 | 0 | 1.
    -baz(b) -> -1;
    -baz(c) -> 0;
    -baz(d) -> 1.

    Dialyzer will "trust" the spec and using the intersection of the spec and +baz(b) -> -1; +baz(c) -> 0; +baz(d) -> 1.

    Dialyzer will "trust" the spec and using the intersection of the spec and inferred type:

    baz(b) -> 0 | 1.

    Notice how the c and d from the argument to baz/1 and the -1 in the return from the inferred type were dropped once the spec and inferred type were intersected. This could result in warnings being emitted for later functions.

    For example, if baz/1 is called like this:

    call_baz1(A) ->
    /usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/dialyzer.epub/OEBPS/dialyzer.xhtml differs (HTML document, ASCII text, with very long lines (2451))
    --- old//usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/dialyzer.epub/OEBPS/dialyzer.xhtml	2026-06-04 00:08:47.000000000 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/dialyzer.epub/OEBPS/dialyzer.xhtml	2042-07-06 13:28:11.000000000 +0000
    @@ -165,13 +165,13 @@
     repeating options which would otherwise need to be given explicitly to Dialyzer
     on every invocation.

    The location of the configuration file can be set via the DIALYZER_CONFIG environment variable, and defaults to within the user_config from -filename:basedir/3.

    An example configuration file's contents might be:

          {incremental,
    -        {default_apps,[stdlib,kernel,erts]},
    -        {default_warning_apps,[stdlib]}
    -      }.
    -      {warnings, [no_improper_lists]}.
    -      {add_pathsa,["/users/samwise/potatoes/ebin"]}.
    -      {add_pathsz,["/users/smeagol/fish/ebin"]}.

    +filename:basedir/3.

    An example configuration file's contents might be:

          {incremental,
    +        {default_apps,[stdlib,kernel,erts]},
    +        {default_warning_apps,[stdlib]}
    +      }.
    +      {warnings, [no_improper_lists]}.
    +      {add_pathsa,["/users/samwise/potatoes/ebin"]}.
    +      {add_pathsz,["/users/smeagol/fish/ebin"]}.

    @@ -179,13 +179,13 @@

    Attribute -dialyzer() can be used for turning off warnings in a module by specifying functions or warning options. For example, to turn off all warnings -for the function f/0, include the following line:

    -dialyzer({nowarn_function, f/0}).

    To turn off warnings for improper lists, add the following line to the source +for the function f/0, include the following line:

    -dialyzer({nowarn_function, f/0}).

    To turn off warnings for improper lists, add the following line to the source file:

    -dialyzer(no_improper_lists).

    Attribute -dialyzer() is allowed after function declarations. Lists of warning -options or functions are allowed:

    -dialyzer([{nowarn_function, [f/0]}, no_improper_lists]).

    Warning options can be restricted to functions:

    -dialyzer({no_improper_lists, g/0}).
    -dialyzer({[no_return, no_match], [g/0, h/0]}).

    The warning option for underspecified functions, -Wunderspecs, can result in +options or functions are allowed:

    -dialyzer([{nowarn_function, [f/0]}, no_improper_lists]).

    Warning options can be restricted to functions:

    -dialyzer({no_improper_lists, g/0}).
    -dialyzer({[no_return, no_match], [g/0, h/0]}).

    The warning option for underspecified functions, -Wunderspecs, can result in useful warnings, but often functions with specifications that are strictly more allowing than the success typing cannot easily be modified to be less allowing. To turn off the warning for underspecified function f/0, include the following -line:

    -dialyzer({no_underspecs, f/0}).

    For help on the warning options, use dialyzer -Whelp. The options are also +line:

    -dialyzer({no_underspecs, f/0}).

    For help on the warning options, use dialyzer -Whelp. The options are also enumerated, see type warn_option/0.

    Attribute -dialyzer() can also be used for turning on warnings. For example, if a module has been fixed regarding unmatched returns, adding the following line can help in assuring that no new unmatched return warnings are introduced:

    -dialyzer(unmatched_returns).
    /usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/dialyzer.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (2451)) --- old//usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/dialyzer.html 2026-06-04 19:05:05.554479181 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/dialyzer.html 2026-06-04 19:05:05.554479181 +0000 @@ -270,13 +270,13 @@ repeating options which would otherwise need to be given explicitly to Dialyzer on every invocation.

    The location of the configuration file can be set via the DIALYZER_CONFIG environment variable, and defaults to within the user_config from -filename:basedir/3.

    An example configuration file's contents might be:

          {incremental,
    -        {default_apps,[stdlib,kernel,erts]},
    -        {default_warning_apps,[stdlib]}
    -      }.
    -      {warnings, [no_improper_lists]}.
    -      {add_pathsa,["/users/samwise/potatoes/ebin"]}.
    -      {add_pathsz,["/users/smeagol/fish/ebin"]}.

    +filename:basedir/3.

    An example configuration file's contents might be:

          {incremental,
    +        {default_apps,[stdlib,kernel,erts]},
    +        {default_warning_apps,[stdlib]}
    +      }.
    +      {warnings, [no_improper_lists]}.
    +      {add_pathsa,["/users/samwise/potatoes/ebin"]}.
    +      {add_pathsz,["/users/smeagol/fish/ebin"]}.

    @@ -284,13 +284,13 @@

    Attribute -dialyzer() can be used for turning off warnings in a module by specifying functions or warning options. For example, to turn off all warnings -for the function f/0, include the following line:

    -dialyzer({nowarn_function, f/0}).

    To turn off warnings for improper lists, add the following line to the source +for the function f/0, include the following line:

    -dialyzer({nowarn_function, f/0}).

    To turn off warnings for improper lists, add the following line to the source file:

    -dialyzer(no_improper_lists).

    Attribute -dialyzer() is allowed after function declarations. Lists of warning -options or functions are allowed:

    -dialyzer([{nowarn_function, [f/0]}, no_improper_lists]).

    Warning options can be restricted to functions:

    -dialyzer({no_improper_lists, g/0}).
    -dialyzer({[no_return, no_match], [g/0, h/0]}).

    The warning option for underspecified functions, -Wunderspecs, can result in +options or functions are allowed:

    -dialyzer([{nowarn_function, [f/0]}, no_improper_lists]).

    Warning options can be restricted to functions:

    -dialyzer({no_improper_lists, g/0}).
    -dialyzer({[no_return, no_match], [g/0, h/0]}).

    The warning option for underspecified functions, -Wunderspecs, can result in useful warnings, but often functions with specifications that are strictly more allowing than the success typing cannot easily be modified to be less allowing. To turn off the warning for underspecified function f/0, include the following -line:

    -dialyzer({no_underspecs, f/0}).

    For help on the warning options, use dialyzer -Whelp. The options are also +line:

    -dialyzer({no_underspecs, f/0}).

    For help on the warning options, use dialyzer -Whelp. The options are also enumerated, see type warn_option/0.

    Attribute -dialyzer() can also be used for turning on warnings. For example, if a module has been fixed regarding unmatched returns, adding the following line can help in assuring that no new unmatched return warnings are introduced:

    -dialyzer(unmatched_returns).
    @@ -882,7 +882,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/dialyzer_chapter.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1095)) --- old//usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/dialyzer_chapter.html 2026-06-04 19:05:05.573479357 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/dialyzer_chapter.html 2026-06-04 19:05:05.573479357 +0000 @@ -209,29 +209,29 @@ deduce). One implication of this is that if the user gives a spec for a function which overlaps with Dialyzer's inferred type, but is more restrictive, Dialyzer will trust those restrictions. This may then generate an error elsewhere that -follows from the erroneously restricted spec.

    Examples:

    Non-overlapping argument:

    -spec foo(boolean()) -> string().
    +follows from the erroneously restricted spec.

    Examples:

    Non-overlapping argument:

    -spec foo(boolean()) -> string().
     %% Dialyzer will infer: foo(integer()) -> string().
    -foo(N) ->
    -    integer_to_list(N).

    Since the type of the argument in the spec is different from the type that +foo(N) -> + integer_to_list(N).

    Since the type of the argument in the spec is different from the type that Dialyzer inferred, Dialyzer will generate the following warning:

    some_module.erl:7:2: Invalid type specification for function some_module:foo/1.
      The success typing is some_module:foo
    -          (integer()) -> string()
    +          (integer()) -> string()
      But the spec is some_module:foo
    -          (boolean()) -> string()
    - They do not overlap in the 1st argument

    Non-overlapping return:

    -spec bar(a | b) -> atom().
    +          (boolean()) -> string()
    + They do not overlap in the 1st argument

    Non-overlapping return:

    -spec bar(a | b) -> atom().
     %% Dialyzer will infer: bar(a | b) -> binary().
    -bar(a) -> <<"a">>;
    -bar(b) -> <<"b">>.

    Since the return value in the spec and the return value inferred by Dialyzer are +bar(a) -> <<"a">>; +bar(b) -> <<"b">>.

    Since the return value in the spec and the return value inferred by Dialyzer are different, Dialyzer will generate the following warning:

    some_module.erl:11:2: Invalid type specification for function some_module:bar/1.
      The success typing is some_module:bar
    -          ('a' | 'b') -> <<_:8>>
    +          ('a' | 'b') -> <<_:8>>
      But the spec is some_module:bar
    -          ('a' | 'b') -> atom()
    - The return types do not overlap

    Overlapping spec and inferred type:

    -spec baz(a | b) -> non_neg_integer().
    +          ('a' | 'b') -> atom()
    + The return types do not overlap

    Overlapping spec and inferred type:

    -spec baz(a | b) -> non_neg_integer().
     %% Dialyzer will infer: baz(b | c | d) -> -1 | 0 | 1.
    -baz(b) -> -1;
    -baz(c) -> 0;
    -baz(d) -> 1.

    Dialyzer will "trust" the spec and using the intersection of the spec and +baz(b) -> -1; +baz(c) -> 0; +baz(d) -> 1.

    Dialyzer will "trust" the spec and using the intersection of the spec and inferred type:

    baz(b) -> 0 | 1.

    Notice how the c and d from the argument to baz/1 and the -1 in the return from the inferred type were dropped once the spec and inferred type were intersected. This could result in warnings being emitted for later functions.

    For example, if baz/1 is called like this:

    call_baz1(A) ->
    @@ -306,7 +306,7 @@
               Erlang programming language
     
           

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/notes.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (750)) --- old//usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/notes.html 2026-06-04 19:05:05.604479645 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/notes.html 2026-06-04 19:05:05.604479645 +0000 @@ -1849,7 +1849,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/search.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/search.html 2026-06-04 19:05:05.622705246 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/search.html 2026-06-04 19:05:05.621800957 +0000 @@ -145,7 +145,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/typer_cmd.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (481)) --- old//usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/typer_cmd.html 2026-06-04 19:05:05.637479951 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/dialyzer-5.2.1/doc/html/typer_cmd.html 2026-06-04 19:05:05.639479969 +0000 @@ -200,7 +200,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/404.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/404.html 2026-06-04 19:05:05.654480108 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/404.html 2026-06-04 19:05:05.655480118 +0000 @@ -147,7 +147,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/api-reference.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/api-reference.html 2026-06-04 19:05:05.670480257 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/api-reference.html 2026-06-04 19:05:05.670480257 +0000 @@ -246,7 +246,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter.epub/OEBPS/content.opf differs (XML 1.0 document, ASCII text) --- old//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter.epub/OEBPS/content.opf 2026-06-04 00:08:37.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter.epub/OEBPS/content.opf 2042-07-06 13:28:02.000000000 +0000 @@ -4,10 +4,10 @@ version="3.0"> diameter - 2.4.1 - urn:uuid:e63d4f42-1cf0-b867-f51c-7cbdd6724ff6 + urn:uuid:5ef65a91-3534-4980-4afa-de827581e058 en - 2026-06-04T00:08:37Z + 2042-07-06T13:28:02Z /usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter.epub/OEBPS/diameter_app.xhtml differs (HTML document, ASCII text, with very long lines (944)) --- old//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter.epub/OEBPS/diameter_app.xhtml 2026-06-04 00:08:37.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter.epub/OEBPS/diameter_app.xhtml 2042-07-06 13:28:02.000000000 +0000 @@ -598,12 +598,12 @@ diameter:start_service/2) is determined by the Application Identifier in the header of the incoming request message, the selected module being the one whose corresponding dictionary declares itself as defining either the application in -question or the Relay application.

    The argument packet() has the following signature.

    #diameter_packet{header = #diameter_header{},
    -                 avps   = [#diameter_avp{}],
    -                 msg    = record() | undefined,
    -                 errors = [Unsigned32() | {Unsigned32(), #diameter_avp{}}],
    -                 bin    = binary(),
    -                 transport_data = term()}

    The msg field will be undefined in case the request has been received in the +question or the Relay application.

    The argument packet() has the following signature.

    #diameter_packet{header = #diameter_header{},
    +                 avps   = [#diameter_avp{}],
    +                 msg    = record() | undefined,
    +                 errors = [Unsigned32() | {Unsigned32(), #diameter_avp{}}],
    +                 bin    = binary(),
    +                 transport_data = term()}

    The msg field will be undefined in case the request has been received in the relay application. Otherwise it contains the record representing the request as outlined in diameter_dict(4).

    The errors field specifies any results codes identifying errors found while decoding the request. This is used to set Result-Code and/or Failed-AVP in a /usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter.epub/OEBPS/diameterc_cmd.xhtml differs (HTML document, ASCII text, with very long lines (460)) --- old//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter.epub/OEBPS/diameterc_cmd.xhtml 2026-06-04 00:08:37.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter.epub/OEBPS/diameterc_cmd.xhtml 2042-07-06 13:28:02.000000000 +0000 @@ -26,7 +26,7 @@ Synopsis -

    diameterc [<options>] <file>

    +
    diameterc [<options>] <file>

    /usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter.epub/OEBPS/diameter_codec.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (616)) --- old//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter.epub/OEBPS/diameter_codec.xhtml 2026-06-04 00:08:37.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter.epub/OEBPS/diameter_codec.xhtml 2042-07-06 13:28:02.000000000 +0000 @@ -34,7 +34,7 @@ results may differ from those returned by the functions documented here, depending on configuration.

    The header() and packet() records below are defined in diameter.hrl, -which can be included as follows.

    -include_lib("diameter/include/diameter.hrl").

    Application-specific records are defined in the hrl files resulting from +which can be included as follows.

    -include_lib("diameter/include/diameter.hrl").

    Application-specific records are defined in the hrl files resulting from dictionary file compilation.

    /usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter.epub/OEBPS/diameter_dict.xhtml differs (HTML document, ASCII text, with very long lines (795)) --- old//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter.epub/OEBPS/diameter_dict.xhtml 2026-06-04 00:08:37.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter.epub/OEBPS/diameter_dict.xhtml 2042-07-06 13:28:02.000000000 +0000 @@ -204,14 +204,14 @@ an incoming request.

    In cases in which there is a choice between string() and binary() types for OctetString() and derived types, the representation is determined by the value of diameter:service_opt() -string_decode.

    Basic AVP Data Formats

    OctetString() = string() | binary()
    -Integer32()   = -2147483647..2147483647
    -Integer64()   = -9223372036854775807..9223372036854775807
    -Unsigned32()  = 0..4294967295
    -Unsigned64()  = 0..18446744073709551615
    -Float32()     = '-infinity' | float() | infinity
    -Float64()     = '-infinity' | float() | infinity
    -Grouped()     = record()

    On encode, an OctetString() can be specified as an iolist(), excessively large +string_decode.

    Basic AVP Data Formats

    OctetString() = string() | binary()
    +Integer32()   = -2147483647..2147483647
    +Integer64()   = -9223372036854775807..9223372036854775807
    +Unsigned32()  = 0..4294967295
    +Unsigned64()  = 0..18446744073709551615
    +Float32()     = '-infinity' | float() | infinity
    +Float64()     = '-infinity' | float() | infinity
    +Grouped()     = record()

    On encode, an OctetString() can be specified as an iolist(), excessively large floats (in absolute value) are equivalent to infinity or '-infinity' and excessively large integers result in encode failure. The records for grouped AVPs are as discussed in the previous section.

    Derived AVP Data Formats

    Address() = OctetString()
    @@ -219,14 +219,14 @@
     while an IPv6 address is parsed in any of the formats specified by section 2.2
     of RFC 2373, "Text Representation of Addresses". An IPv4 tuple() has length 4
     and contains values of type 0..255. An IPv6 tuple() has length 8 and contains
    -values of type 0..65535. The tuple representation is used on decode.

    Time() = {date(), time()}
    +values of type 0..65535. The tuple representation is used on decode.

    Time() = {date(), time()}
     
     where
     
    -  date() = {Year, Month, Day}
    -  time() = {Hour, Minute, Second}
    +  date() = {Year, Month, Day}
    +  time() = {Hour, Minute, Second}
     
    -  Year   = integer()
    +  Year   = integer()
       Month  = 1..12
       Day    = 1..31
       Hour   = 0..23
    @@ -254,8 +254,8 @@
     diameter respectively. The grammar of an OctetString-valued DiameterURI() is as
     specified in section 4.3 of RFC 6733. The record representation is used on
     decode.

    Enumerated() = Integer32()

    On encode, values can be specified using the macros defined in a dictionary's -hrl file.

    IPFilterRule()  = OctetString()
    -QoSFilterRule() = OctetString()

    Values of these types are not currently parsed by diameter.

    +hrl file.

    IPFilterRule()  = OctetString()
    +QoSFilterRule() = OctetString()

    Values of these types are not currently parsed by diameter.

    /usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter.epub/OEBPS/diameter.xhtml differs (HTML document, ASCII text, with very long lines (1004)) --- old//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter.epub/OEBPS/diameter.xhtml 2026-06-04 00:08:37.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter.epub/OEBPS/diameter.xhtml 2042-07-06 13:28:02.000000000 +0000 @@ -124,14 +124,14 @@ containing only 0 (NO_INBAND_SECURITY). If 1 (TLS) is specified then TLS is selected if the CER/CEA received from the peer offers it.

  • {'Acct-Application-Id', [Unsigned32()]}

  • {'Vendor-Specific-Application-Id', [Grouped()]}

  • {'Firmware-Revision',Unsigned32()}

  • Note that each tuple communicates one or more AVP values. It is an error to specify duplicate tuples.

  • eval() = {M,F,A} | fun() | [eval() | A] - An expression that can be -evaluated as a function in the following sense.

    eval([{M,F,A} | T]) ->
    -    apply(M, F, T ++ A);
    -eval([[F|A] | T]) ->
    -    eval([F | T ++ A]);
    -eval([F|A]) ->
    -    apply(F, A);
    -eval(F) ->
    -    eval([F]).

    Applying an eval() E to an argument list A is meant +evaluated as a function in the following sense.

    eval([{M,F,A} | T]) ->
    +    apply(M, F, T ++ A);
    +eval([[F|A] | T]) ->
    +    eval([F | T ++ A]);
    +eval([F|A]) ->
    +    apply(F, A);
    +eval(F) ->
    +    eval([F]).

    Applying an eval() E to an argument list A is meant in the sense of eval([E|A]).

    Warning

    Beware of using fun expressions of the form fun Name/Arity in situations in which the fun is not short-lived and code is to be upgraded at runtime since any processes retaining such a fun will have a reference to old code. @@ -174,10 +174,10 @@ service_event() record. Can have one of the following types.

    • start

    • stop - The service is being started or stopped. No event precedes a start event. No event follows a stop event, and this event implies the -termination of all transport processes.

    • {up, Ref, Peer, Config, Pkt}

    • {up, Ref, Peer, Config}

    • {down, Ref, Peer, Config}

      Ref    = transport_ref()
      -Peer   = diameter_app:peer()
      -Config = {connect|listen, [transport_opt()]}
      -Pkt    = #diameter_packet{}

      The RFC 3539 watchdog state machine has transitioned into (up) or out of +termination of all transport processes.

    • {up, Ref, Peer, Config, Pkt}

    • {up, Ref, Peer, Config}

    • {down, Ref, Peer, Config}

      Ref    = transport_ref()
      +Peer   = diameter_app:peer()
      +Config = {connect|listen, [transport_opt()]}
      +Pkt    = #diameter_packet{}

      The RFC 3539 watchdog state machine has transitioned into (up) or out of (down) the OKAY state. If a #diameter_packet{} is present in an up event then there has been a capabilities exchange on a newly established transport connection and the record contains the received CER or CEA.

      Note that a single up or down event for a given peer corresponds to @@ -203,20 +203,20 @@ Pkt = #diameter_packet{}

  • An incoming CER contained errors and has been answered with the indicated result code. Caps contains values for the local node only. Pkt contains the CER in question.

  • {'CER', timeout} - An expected CER was not received within -capx_timeout of connection establishment.

  • {'CEA', Result, Caps, Pkt}

    Result = ResultCode | atom() | {capabilities_cb, CB, ResultCode|discard}
    -Caps = #diameter_caps{}
    -Pkt  = #diameter_packet{}
    -ResultCode = integer()

    An incoming CEA has been rejected for the indicated reason. An +capx_timeout of connection establishment.

  • {'CEA', Result, Caps, Pkt}

    Result = ResultCode | atom() | {capabilities_cb, CB, ResultCode|discard}
    +Caps = #diameter_caps{}
    +Pkt  = #diameter_packet{}
    +ResultCode = integer()

    An incoming CEA has been rejected for the indicated reason. An integer-valued Result indicates the result code sent by the peer. Caps contains pairs of values for the local node and remote peer. Pkt contains the CEA in question. In the case of rejection by a capabilities callback, the tuple contains the rejecting callback.

  • {'CEA', Caps, Pkt}

    Caps = #diameter_caps{}
     Pkt  = #diameter_packet{}

    An incoming CEA contained errors and has been rejected. Caps contains only values for the local node. Pkt contains the CEA in question.

  • {'CEA', timeout} - An expected CEA was not received within -capx_timeout of connection establishment.

  • {watchdog, Ref, PeerRef, {From, To}, Config}

    Ref = transport_ref()
    -PeerRef = diameter_app:peer_ref()
    +capx_timeout of connection establishment.

  • {watchdog, Ref, PeerRef, {From, To}, Config}

    Ref = transport_ref()
    +PeerRef = diameter_app:peer_ref()
     From, To = initial | okay | suspect | down | reopen
    -Config = {connect|listen, [transport_opt()]}

    An RFC 3539 watchdog state machine has changed state.

  • any/0 - For forward compatibility, a subscriber should be prepared +Config = {connect|listen, [transport_opt()]}

  • An RFC 3539 watchdog state machine has changed state.

  • any/0 - For forward compatibility, a subscriber should be prepared to receive info fields of forms other than the above.

  • service_name() = term() - Name of a service as passed to start_service/2 and with which the service is identified. There can be at most one service with a given name on a given node. Note that @@ -464,10 +464,10 @@ which a started transport process should be terminated if it has not yet established a connection. For example, the following options on a connecting transport request a connection with one peer over SCTP or another (typically -the same) over TCP.

    {transport_module, diameter_sctp}
    -{transport_config, SctpOpts, 5000}
    -{transport_module, diameter_tcp}
    -{transport_config, TcpOpts}

    To listen on both SCTP and TCP, define one transport for each.

  • {transport_module, atom()} - Module implementing +the same) over TCP.

    {transport_module, diameter_sctp}
    +{transport_config, SctpOpts, 5000}
    +{transport_module, diameter_tcp}
    +{transport_config, TcpOpts}

    To listen on both SCTP and TCP, define one transport for each.

  • {transport_module, atom()} - Module implementing a transport process as defined in diameter_transport. Defaults to diameter_tcp.

    Multiple transport_module and transport_config options are allowed. The @@ -2438,13 +2438,13 @@

    Remove previously added transports.

    Pred determines which transports to remove. An arity-3-valued Pred removes all transports for which Pred(Ref, Type, Opts) returns true, where Type and Opts are as passed to add_transport/2 and Ref is as returned by it. -The remaining forms are equivalent to an arity-3 fun as follows.

    Pred = fun(transport_ref(), list()):  fun(Ref, _, Opts) -> Pred(Ref, Opts) end
    -Pred = fun(list()):                   fun(_, _, Opts) -> Pred(Opts) end
    -Pred = transport_ref():               fun(Ref, _, _)  -> Pred == Ref end
    -Pred = list():                        fun(_, _, Opts) -> [] == Pred -- Opts end
    -Pred = true:                          fun(_, _, _) -> true end
    -Pred = false:                         fun(_, _, _) -> false end
    -Pred = {M,F,A}:  fun(Ref, Type, Opts) -> apply(M, F, [Ref, Type, Opts | A]) end

    Removing a transport causes the corresponding transport processes to be +The remaining forms are equivalent to an arity-3 fun as follows.

    Pred = fun(transport_ref(), list()):  fun(Ref, _, Opts) -> Pred(Ref, Opts) end
    +Pred = fun(list()):                   fun(_, _, Opts) -> Pred(Opts) end
    +Pred = transport_ref():               fun(Ref, _, _)  -> Pred == Ref end
    +Pred = list():                        fun(_, _, Opts) -> [] == Pred -- Opts end
    +Pred = true:                          fun(_, _, _) -> true end
    +Pred = false:                         fun(_, _, _) -> false end
    +Pred = {M,F,A}:  fun(Ref, Type, Opts) -> apply(M, F, [Ref, Type, Opts | A]) end

    Removing a transport causes the corresponding transport processes to be terminated. Whether or not a DPR message is sent to a peer is controlled by value of disconnect_cb configured on the transport.

    @@ -2488,52 +2488,52 @@ containing both configuration and information about established peer connections. An example return value with for a client service with Origin-Host "client.example.com" configured with a single transport connected -to "server.example.com" might look as follows.

    [[{ref,#Ref<0.0.0.93>},
    -  {type,connect},
    -  {options,[{transport_module,diameter_tcp},
    -            {transport_config,[{ip,{127,0,0,1}},
    -                               {raddr,{127,0,0,1}},
    -                               {rport,3868},
    -                               {reuseaddr,true}]}]},
    -  {watchdog,{<0.66.0>,-576460736368485571,okay}},
    -  {peer,{<0.67.0>,-576460736357885808}},
    -  {apps,[{0,common}]},
    -  {caps,[{origin_host,{"client.example.com","server.example.com"}},
    -         {origin_realm,{"example.com","example.com"}},
    -         {host_ip_address,{[{127,0,0,1}],[{127,0,0,1}]}},
    -         {vendor_id,{0,193}},
    -         {product_name,{"Client","Server"}},
    -         {origin_state_id,{[],[]}},
    -         {supported_vendor_id,{[],[]}},
    -         {auth_application_id,{[0],[0]}},
    -         {inband_security_id,{[],[0]}},
    -         {acct_application_id,{[],[]}},
    -         {vendor_specific_application_id,{[],[]}},
    -         {firmware_revision,{[],[]}},
    -         {avp,{[],[]}}]},
    -  {port,[{owner,<0.69.0>},
    -         {module,diameter_tcp},
    -         {socket,{{127,0,0,1},48758}},
    -         {peer,{{127,0,0,1},3868}},
    -         {statistics,[{recv_oct,656},
    -                      {recv_cnt,6},
    -                      {recv_max,148},
    -                      {recv_avg,109},
    -                      {recv_dvi,19},
    -                      {send_oct,836},
    -                      {send_cnt,6},
    -                      {send_max,184},
    -                      {send_avg,139},
    -                      {send_pend,0}]}]},
    -  {statistics,[{{{0,258,0},recv},3},
    -               {{{0,258,1},send},3},
    -               {{{0,258,0},recv,{'Result-Code',2001}},3},
    -               {{{0,257,0},recv},1},
    -               {{{0,257,1},send},1},
    -               {{{0,257,0},recv,{'Result-Code',2001}},1},
    -               {{{0,280,1},recv},2},
    -               {{{0,280,0},send},2},
    -               {{{0,280,0},send,{'Result-Code',2001}},2}]}]]

    Here ref is a transport_ref() and options +to "server.example.com" might look as follows.

    [[{ref,#Ref<0.0.0.93>},
    +  {type,connect},
    +  {options,[{transport_module,diameter_tcp},
    +            {transport_config,[{ip,{127,0,0,1}},
    +                               {raddr,{127,0,0,1}},
    +                               {rport,3868},
    +                               {reuseaddr,true}]}]},
    +  {watchdog,{<0.66.0>,-576460736368485571,okay}},
    +  {peer,{<0.67.0>,-576460736357885808}},
    +  {apps,[{0,common}]},
    +  {caps,[{origin_host,{"client.example.com","server.example.com"}},
    +         {origin_realm,{"example.com","example.com"}},
    +         {host_ip_address,{[{127,0,0,1}],[{127,0,0,1}]}},
    +         {vendor_id,{0,193}},
    +         {product_name,{"Client","Server"}},
    +         {origin_state_id,{[],[]}},
    +         {supported_vendor_id,{[],[]}},
    +         {auth_application_id,{[0],[0]}},
    +         {inband_security_id,{[],[0]}},
    +         {acct_application_id,{[],[]}},
    +         {vendor_specific_application_id,{[],[]}},
    +         {firmware_revision,{[],[]}},
    +         {avp,{[],[]}}]},
    +  {port,[{owner,<0.69.0>},
    +         {module,diameter_tcp},
    +         {socket,{{127,0,0,1},48758}},
    +         {peer,{{127,0,0,1},3868}},
    +         {statistics,[{recv_oct,656},
    +                      {recv_cnt,6},
    +                      {recv_max,148},
    +                      {recv_avg,109},
    +                      {recv_dvi,19},
    +                      {send_oct,836},
    +                      {send_cnt,6},
    +                      {send_max,184},
    +                      {send_avg,139},
    +                      {send_pend,0}]}]},
    +  {statistics,[{{{0,258,0},recv},3},
    +               {{{0,258,1},send},3},
    +               {{{0,258,0},recv,{'Result-Code',2001}},3},
    +               {{{0,257,0},recv},1},
    +               {{{0,257,1},send},1},
    +               {{{0,257,0},recv,{'Result-Code',2001}},1},
    +               {{{0,280,1},recv},2},
    +               {{{0,280,0},send},2},
    +               {{{0,280,0},send,{'Result-Code',2001}},2}]}]]

    Here ref is a transport_ref() and options /usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1002)) --- old//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter.html 2026-06-04 19:05:05.828481723 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter.html 2026-06-04 19:05:05.828481723 +0000 @@ -229,14 +229,14 @@ containing only 0 (NO_INBAND_SECURITY). If 1 (TLS) is specified then TLS is selected if the CER/CEA received from the peer offers it.

  • {'Acct-Application-Id', [Unsigned32()]}

  • {'Vendor-Specific-Application-Id', [Grouped()]}

  • {'Firmware-Revision',Unsigned32()}

  • Note that each tuple communicates one or more AVP values. It is an error to specify duplicate tuples.

  • eval() = {M,F,A} | fun() | [eval() | A] - An expression that can be -evaluated as a function in the following sense.

    eval([{M,F,A} | T]) ->
    -    apply(M, F, T ++ A);
    -eval([[F|A] | T]) ->
    -    eval([F | T ++ A]);
    -eval([F|A]) ->
    -    apply(F, A);
    -eval(F) ->
    -    eval([F]).

    Applying an eval() E to an argument list A is meant +evaluated as a function in the following sense.

    eval([{M,F,A} | T]) ->
    +    apply(M, F, T ++ A);
    +eval([[F|A] | T]) ->
    +    eval([F | T ++ A]);
    +eval([F|A]) ->
    +    apply(F, A);
    +eval(F) ->
    +    eval([F]).

    Applying an eval() E to an argument list A is meant in the sense of eval([E|A]).

    Warning

    Beware of using fun expressions of the form fun Name/Arity in situations in which the fun is not short-lived and code is to be upgraded at runtime since any processes retaining such a fun will have a reference to old code. @@ -279,10 +279,10 @@ service_event() record. Can have one of the following types.

    • start

    • stop - The service is being started or stopped. No event precedes a start event. No event follows a stop event, and this event implies the -termination of all transport processes.

    • {up, Ref, Peer, Config, Pkt}

    • {up, Ref, Peer, Config}

    • {down, Ref, Peer, Config}

      Ref    = transport_ref()
      -Peer   = diameter_app:peer()
      -Config = {connect|listen, [transport_opt()]}
      -Pkt    = #diameter_packet{}

      The RFC 3539 watchdog state machine has transitioned into (up) or out of +termination of all transport processes.

    • {up, Ref, Peer, Config, Pkt}

    • {up, Ref, Peer, Config}

    • {down, Ref, Peer, Config}

      Ref    = transport_ref()
      +Peer   = diameter_app:peer()
      +Config = {connect|listen, [transport_opt()]}
      +Pkt    = #diameter_packet{}

      The RFC 3539 watchdog state machine has transitioned into (up) or out of (down) the OKAY state. If a #diameter_packet{} is present in an up event then there has been a capabilities exchange on a newly established transport connection and the record contains the received CER or CEA.

      Note that a single up or down event for a given peer corresponds to @@ -308,20 +308,20 @@ Pkt = #diameter_packet{}

  • An incoming CER contained errors and has been answered with the indicated result code. Caps contains values for the local node only. Pkt contains the CER in question.

  • {'CER', timeout} - An expected CER was not received within -capx_timeout of connection establishment.

  • {'CEA', Result, Caps, Pkt}

    Result = ResultCode | atom() | {capabilities_cb, CB, ResultCode|discard}
    -Caps = #diameter_caps{}
    -Pkt  = #diameter_packet{}
    -ResultCode = integer()

    An incoming CEA has been rejected for the indicated reason. An +capx_timeout of connection establishment.

  • {'CEA', Result, Caps, Pkt}

    Result = ResultCode | atom() | {capabilities_cb, CB, ResultCode|discard}
    +Caps = #diameter_caps{}
    +Pkt  = #diameter_packet{}
    +ResultCode = integer()

    An incoming CEA has been rejected for the indicated reason. An integer-valued Result indicates the result code sent by the peer. Caps contains pairs of values for the local node and remote peer. Pkt contains the CEA in question. In the case of rejection by a capabilities callback, the tuple contains the rejecting callback.

  • {'CEA', Caps, Pkt}

    Caps = #diameter_caps{}
     Pkt  = #diameter_packet{}

    An incoming CEA contained errors and has been rejected. Caps contains only values for the local node. Pkt contains the CEA in question.

  • {'CEA', timeout} - An expected CEA was not received within -capx_timeout of connection establishment.

  • {watchdog, Ref, PeerRef, {From, To}, Config}

    Ref = transport_ref()
    -PeerRef = diameter_app:peer_ref()
    +capx_timeout of connection establishment.

  • {watchdog, Ref, PeerRef, {From, To}, Config}

    Ref = transport_ref()
    +PeerRef = diameter_app:peer_ref()
     From, To = initial | okay | suspect | down | reopen
    -Config = {connect|listen, [transport_opt()]}

    An RFC 3539 watchdog state machine has changed state.

  • any/0 - For forward compatibility, a subscriber should be prepared +Config = {connect|listen, [transport_opt()]}

  • An RFC 3539 watchdog state machine has changed state.

  • any/0 - For forward compatibility, a subscriber should be prepared to receive info fields of forms other than the above.

  • service_name() = term() - Name of a service as passed to start_service/2 and with which the service is identified. There can be at most one service with a given name on a given node. Note that @@ -569,10 +569,10 @@ which a started transport process should be terminated if it has not yet established a connection. For example, the following options on a connecting transport request a connection with one peer over SCTP or another (typically -the same) over TCP.

    {transport_module, diameter_sctp}
    -{transport_config, SctpOpts, 5000}
    -{transport_module, diameter_tcp}
    -{transport_config, TcpOpts}

    To listen on both SCTP and TCP, define one transport for each.

  • {transport_module, atom()} - Module implementing +the same) over TCP.

    {transport_module, diameter_sctp}
    +{transport_config, SctpOpts, 5000}
    +{transport_module, diameter_tcp}
    +{transport_config, TcpOpts}

    To listen on both SCTP and TCP, define one transport for each.

  • {transport_module, atom()} - Module implementing a transport process as defined in diameter_transport. Defaults to diameter_tcp.

    Multiple transport_module and transport_config options are allowed. The @@ -2559,13 +2559,13 @@

    Remove previously added transports.

    Pred determines which transports to remove. An arity-3-valued Pred removes all transports for which Pred(Ref, Type, Opts) returns true, where Type and Opts are as passed to add_transport/2 and Ref is as returned by it. -The remaining forms are equivalent to an arity-3 fun as follows.

    Pred = fun(transport_ref(), list()):  fun(Ref, _, Opts) -> Pred(Ref, Opts) end
    -Pred = fun(list()):                   fun(_, _, Opts) -> Pred(Opts) end
    -Pred = transport_ref():               fun(Ref, _, _)  -> Pred == Ref end
    -Pred = list():                        fun(_, _, Opts) -> [] == Pred -- Opts end
    -Pred = true:                          fun(_, _, _) -> true end
    -Pred = false:                         fun(_, _, _) -> false end
    -Pred = {M,F,A}:  fun(Ref, Type, Opts) -> apply(M, F, [Ref, Type, Opts | A]) end

    Removing a transport causes the corresponding transport processes to be +The remaining forms are equivalent to an arity-3 fun as follows.

    Pred = fun(transport_ref(), list()):  fun(Ref, _, Opts) -> Pred(Ref, Opts) end
    +Pred = fun(list()):                   fun(_, _, Opts) -> Pred(Opts) end
    +Pred = transport_ref():               fun(Ref, _, _)  -> Pred == Ref end
    +Pred = list():                        fun(_, _, Opts) -> [] == Pred -- Opts end
    +Pred = true:                          fun(_, _, _) -> true end
    +Pred = false:                         fun(_, _, _) -> false end
    +Pred = {M,F,A}:  fun(Ref, Type, Opts) -> apply(M, F, [Ref, Type, Opts | A]) end

    Removing a transport causes the corresponding transport processes to be terminated. Whether or not a DPR message is sent to a peer is controlled by value of disconnect_cb configured on the transport.

    @@ -2609,52 +2609,52 @@ containing both configuration and information about established peer connections. An example return value with for a client service with Origin-Host "client.example.com" configured with a single transport connected -to "server.example.com" might look as follows.

    [[{ref,#Ref<0.0.0.93>},
    -  {type,connect},
    -  {options,[{transport_module,diameter_tcp},
    -            {transport_config,[{ip,{127,0,0,1}},
    -                               {raddr,{127,0,0,1}},
    -                               {rport,3868},
    -                               {reuseaddr,true}]}]},
    -  {watchdog,{<0.66.0>,-576460736368485571,okay}},
    -  {peer,{<0.67.0>,-576460736357885808}},
    -  {apps,[{0,common}]},
    -  {caps,[{origin_host,{"client.example.com","server.example.com"}},
    -         {origin_realm,{"example.com","example.com"}},
    -         {host_ip_address,{[{127,0,0,1}],[{127,0,0,1}]}},
    -         {vendor_id,{0,193}},
    -         {product_name,{"Client","Server"}},
    -         {origin_state_id,{[],[]}},
    -         {supported_vendor_id,{[],[]}},
    -         {auth_application_id,{[0],[0]}},
    -         {inband_security_id,{[],[0]}},
    -         {acct_application_id,{[],[]}},
    -         {vendor_specific_application_id,{[],[]}},
    -         {firmware_revision,{[],[]}},
    -         {avp,{[],[]}}]},
    -  {port,[{owner,<0.69.0>},
    -         {module,diameter_tcp},
    -         {socket,{{127,0,0,1},48758}},
    -         {peer,{{127,0,0,1},3868}},
    -         {statistics,[{recv_oct,656},
    -                      {recv_cnt,6},
    -                      {recv_max,148},
    -                      {recv_avg,109},
    -                      {recv_dvi,19},
    -                      {send_oct,836},
    -                      {send_cnt,6},
    -                      {send_max,184},
    -                      {send_avg,139},
    -                      {send_pend,0}]}]},
    -  {statistics,[{{{0,258,0},recv},3},
    -               {{{0,258,1},send},3},
    -               {{{0,258,0},recv,{'Result-Code',2001}},3},
    -               {{{0,257,0},recv},1},
    -               {{{0,257,1},send},1},
    -               {{{0,257,0},recv,{'Result-Code',2001}},1},
    -               {{{0,280,1},recv},2},
    -               {{{0,280,0},send},2},
    -               {{{0,280,0},send,{'Result-Code',2001}},2}]}]]

    Here ref is a transport_ref() and options +to "server.example.com" might look as follows.

    [[{ref,#Ref<0.0.0.93>},
    +  {type,connect},
    +  {options,[{transport_module,diameter_tcp},
    +            {transport_config,[{ip,{127,0,0,1}},
    +                               {raddr,{127,0,0,1}},
    +                               {rport,3868},
    +                               {reuseaddr,true}]}]},
    +  {watchdog,{<0.66.0>,-576460736368485571,okay}},
    +  {peer,{<0.67.0>,-576460736357885808}},
    +  {apps,[{0,common}]},
    +  {caps,[{origin_host,{"client.example.com","server.example.com"}},
    +         {origin_realm,{"example.com","example.com"}},
    +         {host_ip_address,{[{127,0,0,1}],[{127,0,0,1}]}},
    +         {vendor_id,{0,193}},
    +         {product_name,{"Client","Server"}},
    +         {origin_state_id,{[],[]}},
    +         {supported_vendor_id,{[],[]}},
    +         {auth_application_id,{[0],[0]}},
    +         {inband_security_id,{[],[0]}},
    +         {acct_application_id,{[],[]}},
    +         {vendor_specific_application_id,{[],[]}},
    +         {firmware_revision,{[],[]}},
    +         {avp,{[],[]}}]},
    +  {port,[{owner,<0.69.0>},
    +         {module,diameter_tcp},
    +         {socket,{{127,0,0,1},48758}},
    +         {peer,{{127,0,0,1},3868}},
    +         {statistics,[{recv_oct,656},
    +                      {recv_cnt,6},
    +                      {recv_max,148},
    +                      {recv_avg,109},
    +                      {recv_dvi,19},
    +                      {send_oct,836},
    +                      {send_cnt,6},
    +                      {send_max,184},
    +                      {send_avg,139},
    +                      {send_pend,0}]}]},
    +  {statistics,[{{{0,258,0},recv},3},
    +               {{{0,258,1},send},3},
    +               {{{0,258,0},recv,{'Result-Code',2001}},3},
    +               {{{0,257,0},recv},1},
    +               {{{0,257,1},send},1},
    +               {{{0,257,0},recv,{'Result-Code',2001}},1},
    +               {{{0,280,1},recv},2},
    +               {{{0,280,0},send},2},
    +               {{{0,280,0},send,{'Result-Code',2001}},2}]}]]

    Here ref is a transport_ref() and options /usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_app.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (944)) --- old//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_app.html 2026-06-04 19:05:05.855481973 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_app.html 2026-06-04 19:05:05.855481973 +0000 @@ -719,12 +719,12 @@ diameter:start_service/2) is determined by the Application Identifier in the header of the incoming request message, the selected module being the one whose corresponding dictionary declares itself as defining either the application in -question or the Relay application.

    The argument packet() has the following signature.

    #diameter_packet{header = #diameter_header{},
    -                 avps   = [#diameter_avp{}],
    -                 msg    = record() | undefined,
    -                 errors = [Unsigned32() | {Unsigned32(), #diameter_avp{}}],
    -                 bin    = binary(),
    -                 transport_data = term()}

    The msg field will be undefined in case the request has been received in the +question or the Relay application.

    The argument packet() has the following signature.

    #diameter_packet{header = #diameter_header{},
    +                 avps   = [#diameter_avp{}],
    +                 msg    = record() | undefined,
    +                 errors = [Unsigned32() | {Unsigned32(), #diameter_avp{}}],
    +                 bin    = binary(),
    +                 transport_data = term()}

    The msg field will be undefined in case the request has been received in the relay application. Otherwise it contains the record representing the request as outlined in diameter_dict(4).

    The errors field specifies any results codes identifying errors found while decoding the request. This is used to set Result-Code and/or Failed-AVP in a @@ -1042,7 +1042,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_codec.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (616)) --- old//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_codec.html 2026-06-04 19:05:05.875482159 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_codec.html 2026-06-04 19:05:05.875482159 +0000 @@ -139,7 +139,7 @@ results may differ from those returned by the functions documented here, depending on configuration.

    The header() and packet() records below are defined in diameter.hrl, -which can be included as follows.

    -include_lib("diameter/include/diameter.hrl").

    Application-specific records are defined in the hrl files resulting from +which can be included as follows.

    -include_lib("diameter/include/diameter.hrl").

    Application-specific records are defined in the hrl files resulting from dictionary file compilation.

    @@ -561,7 +561,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_dict.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (795)) --- old//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_dict.html 2026-06-04 19:05:05.896482353 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_dict.html 2026-06-04 19:05:05.895482344 +0000 @@ -309,14 +309,14 @@ an incoming request.

    In cases in which there is a choice between string() and binary() types for OctetString() and derived types, the representation is determined by the value of diameter:service_opt() -string_decode.

    Basic AVP Data Formats

    OctetString() = string() | binary()
    -Integer32()   = -2147483647..2147483647
    -Integer64()   = -9223372036854775807..9223372036854775807
    -Unsigned32()  = 0..4294967295
    -Unsigned64()  = 0..18446744073709551615
    -Float32()     = '-infinity' | float() | infinity
    -Float64()     = '-infinity' | float() | infinity
    -Grouped()     = record()

    On encode, an OctetString() can be specified as an iolist(), excessively large +string_decode.

    Basic AVP Data Formats

    OctetString() = string() | binary()
    +Integer32()   = -2147483647..2147483647
    +Integer64()   = -9223372036854775807..9223372036854775807
    +Unsigned32()  = 0..4294967295
    +Unsigned64()  = 0..18446744073709551615
    +Float32()     = '-infinity' | float() | infinity
    +Float64()     = '-infinity' | float() | infinity
    +Grouped()     = record()

    On encode, an OctetString() can be specified as an iolist(), excessively large floats (in absolute value) are equivalent to infinity or '-infinity' and excessively large integers result in encode failure. The records for grouped AVPs are as discussed in the previous section.

    Derived AVP Data Formats

    Address() = OctetString()
    @@ -324,14 +324,14 @@
     while an IPv6 address is parsed in any of the formats specified by section 2.2
     of RFC 2373, "Text Representation of Addresses". An IPv4 tuple() has length 4
     and contains values of type 0..255. An IPv6 tuple() has length 8 and contains
    -values of type 0..65535. The tuple representation is used on decode.

    Time() = {date(), time()}
    +values of type 0..65535. The tuple representation is used on decode.

    Time() = {date(), time()}
     
     where
     
    -  date() = {Year, Month, Day}
    -  time() = {Hour, Minute, Second}
    +  date() = {Year, Month, Day}
    +  time() = {Hour, Minute, Second}
     
    -  Year   = integer()
    +  Year   = integer()
       Month  = 1..12
       Day    = 1..31
       Hour   = 0..23
    @@ -344,8 +344,8 @@
     UTF8String() can be specified as a binary, or as a nested list of binaries and
     codepoints.

    DiameterIdentity() = OctetString()

    A value must have length at least 1.

    DiameterURI() = OctetString()
                   | #href_anchor"" id="Enumerated">

    Enumerated() = Integer32()

    On encode, values can be specified using the macros defined in a dictionary's -hrl file.

    IPFilterRule()  = OctetString()
    -QoSFilterRule() = OctetString()

    Values of these types are not currently parsed by diameter.

    +hrl file.

    IPFilterRule()  = OctetString()
    +QoSFilterRule() = OctetString()

    Values of these types are not currently parsed by diameter.

    @@ -394,7 +394,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_examples.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_examples.html 2026-06-04 19:05:05.912482502 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_examples.html 2026-06-04 19:05:05.912482502 +0000 @@ -176,7 +176,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_intro.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_intro.html 2026-06-04 19:05:05.927482641 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_intro.html 2026-06-04 19:05:05.928482650 +0000 @@ -204,7 +204,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_make.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (360)) --- old//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_make.html 2026-06-04 19:05:05.946482817 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_make.html 2026-06-04 19:05:05.946482817 +0000 @@ -534,7 +534,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_sctp.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (418)) --- old//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_sctp.html 2026-06-04 19:05:05.966483003 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_sctp.html 2026-06-04 19:05:05.965482993 +0000 @@ -451,7 +451,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_service.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_service.html 2026-06-04 19:05:05.983483161 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_service.html 2026-06-04 19:05:05.983483161 +0000 @@ -270,7 +270,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_soc.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (41328)) --- old//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_soc.html 2026-06-04 19:05:06.009483402 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_soc.html 2026-06-04 19:05:06.009483402 +0000 @@ -190,7 +190,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_tcp.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (449)) --- old//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_tcp.html 2026-06-04 19:05:06.028483578 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_tcp.html 2026-06-04 19:05:06.028483578 +0000 @@ -486,7 +486,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_transport.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (336)) --- old//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_transport.html 2026-06-04 19:05:06.046483745 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_transport.html 2026-06-04 19:05:06.045483736 +0000 @@ -323,7 +323,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_using.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_using.html 2026-06-04 19:05:06.060483875 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameter_using.html 2026-06-04 19:05:06.060483875 +0000 @@ -176,7 +176,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameterc_cmd.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (460)) --- old//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameterc_cmd.html 2026-06-04 19:05:06.076484023 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/diameterc_cmd.html 2026-06-04 19:05:06.076484023 +0000 @@ -131,7 +131,7 @@ Synopsis

    -
    diameterc [<options>] <file>

    +
    diameterc [<options>] <file>

    @@ -202,7 +202,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/notes.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (936)) --- old//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/notes.html 2026-06-04 19:05:06.100484246 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/notes.html 2026-06-04 19:05:06.100484246 +0000 @@ -1350,7 +1350,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/search.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/search.html 2026-06-04 19:05:06.118484413 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/diameter-2.4.1/doc/html/search.html 2026-06-04 19:05:06.117484403 +0000 @@ -145,7 +145,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/404.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/404.html 2026-06-04 19:05:06.132536977 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/404.html 2026-06-04 19:05:06.132536977 +0000 @@ -143,7 +143,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/api-reference.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/api-reference.html 2026-06-04 19:05:06.146484672 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/api-reference.html 2026-06-04 19:05:06.147484682 +0000 @@ -262,7 +262,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/chapter.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (2449)) --- old//usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/chapter.html 2026-06-04 19:05:06.171484904 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/chapter.html 2026-06-04 19:05:06.171484904 +0000 @@ -829,7 +829,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/doc_storage.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (390)) --- old//usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/doc_storage.html 2026-06-04 19:05:06.191485090 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/doc_storage.html 2026-06-04 19:05:06.189485071 +0000 @@ -236,7 +236,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (2957)) --- old//usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc.html 2026-06-04 19:05:06.215485312 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc.html 2026-06-04 19:05:06.214485303 +0000 @@ -1407,7 +1407,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_cmd.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_cmd.html 2026-06-04 19:05:06.231485461 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_cmd.html 2026-06-04 19:05:06.232485470 +0000 @@ -187,7 +187,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_doclet.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1869)) --- old//usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_doclet.html 2026-06-04 19:05:06.248485619 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_doclet.html 2026-06-04 19:05:06.250485637 +0000 @@ -444,7 +444,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_doclet_chunks.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (447)) --- old//usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_doclet_chunks.html 2026-06-04 19:05:06.267485795 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_doclet_chunks.html 2026-06-04 19:05:06.267485795 +0000 @@ -218,7 +218,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_doclet_markdown.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1208)) --- old//usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_doclet_markdown.html 2026-06-04 19:05:06.283485943 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_doclet_markdown.html 2026-06-04 19:05:06.283485943 +0000 @@ -128,8 +128,8 @@
    -

    Doclet converting an edoc application to use EEP-59 and Markdown.

    This doclet has to be used together with edoc_layout_chunks.

    Example:

     1> edoc:application(example, [{preprocess, true}, {doclet, edoc_doclet_markdown},
    -       {layout, edoc_layout_chunks}]).

    It will convert the overview to Markdown and any module documentation to use -doc attributes and Markdown. Any XHTML tags in the edoc documentation that are not part of the tags supported by Erlang Documentation Format will be added as HTML tags in the Markdown.

    It does not delete the old edoc documentation.

    See also: edoc_layout_chunks.

    +

    Doclet converting an edoc application to use EEP-59 and Markdown.

    This doclet has to be used together with edoc_layout_chunks.

    Example:

     1> edoc:application(example, [{preprocess, true}, {doclet, edoc_doclet_markdown},
    +       {layout, edoc_layout_chunks}]).

    It will convert the overview to Markdown and any module documentation to use -doc attributes and Markdown. Any XHTML tags in the edoc documentation that are not part of the tags supported by Erlang Documentation Format will be added as HTML tags in the Markdown.

    It does not delete the old edoc documentation.

    See also: edoc_layout_chunks.

    @@ -219,7 +219,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_extract.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (997)) --- old//usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_extract.html 2026-06-04 19:05:06.302486119 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_extract.html 2026-06-04 19:05:06.303486129 +0000 @@ -653,7 +653,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_html_to_markdown.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (384)) --- old//usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_html_to_markdown.html 2026-06-04 19:05:06.318486268 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_html_to_markdown.html 2026-06-04 19:05:06.318486268 +0000 @@ -219,7 +219,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_layout.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1444)) --- old//usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_layout.html 2026-06-04 19:05:06.337486444 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_layout.html 2026-06-04 19:05:06.337486444 +0000 @@ -405,7 +405,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_layout_chunks.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (831)) --- old//usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_layout_chunks.html 2026-06-04 19:05:06.358486639 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_layout_chunks.html 2026-06-04 19:05:06.358486639 +0000 @@ -748,7 +748,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_lib.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (457)) --- old//usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_lib.html 2026-06-04 19:05:06.380486843 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_lib.html 2026-06-04 19:05:06.379486834 +0000 @@ -449,7 +449,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_run.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (660)) --- old//usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_run.html 2026-06-04 19:05:06.398487010 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/edoc_run.html 2026-06-04 19:05:06.398487010 +0000 @@ -358,7 +358,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/notes.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (971)) --- old//usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/notes.html 2026-06-04 19:05:06.420487214 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/notes.html 2026-06-04 19:05:06.420487214 +0000 @@ -856,7 +856,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/search.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/search.html 2026-06-04 19:05:06.435487353 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/edoc-1.3.2/doc/html/search.html 2026-06-04 19:05:06.436471935 +0000 @@ -141,7 +141,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/404.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/404.html 2026-06-04 19:05:06.451874763 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/404.html 2026-06-04 19:05:06.451874763 +0000 @@ -147,7 +147,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/api-reference.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/api-reference.html 2026-06-04 19:05:06.466487641 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/api-reference.html 2026-06-04 19:05:06.466487641 +0000 @@ -185,7 +185,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    Missing in old package: /usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/dist/search_data-FC950B1D.js Missing in old package: /usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/dist/search_data-FC950B1D.js /usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/eldap.epub/OEBPS/content.opf differs (XML 1.0 document, ASCII text) --- old//usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/eldap.epub/OEBPS/content.opf 2026-06-04 00:08:45.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/eldap.epub/OEBPS/content.opf 2042-07-06 13:28:09.000000000 +0000 @@ -4,10 +4,10 @@ version="3.0"> eldap - 1.2.13 - urn:uuid:fbafff52-46fe-fbfe-bf87-2cc16fd782ec + urn:uuid:b4a15f85-c134-da0d-d2e6-cf70ecc7d96e en - 2026-06-04T00:08:45Z + 2042-07-06T13:28:09Z /usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/eldap.epub/OEBPS/eldap.xhtml differs (HTML document, ASCII text, with very long lines (1144)) --- old//usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/eldap.epub/OEBPS/eldap.xhtml 2026-06-04 00:08:45.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/eldap.epub/OEBPS/eldap.xhtml 2042-07-06 13:28:09.000000000 +0000 @@ -856,13 +856,13 @@ -

    Add an entry. The entry must not exist.

      add(Handle,
    +

    Add an entry. The entry must not exist.

      add(Handle,
           "cn=Bill Valentine, ou=people, o=Example Org, dc=example, dc=com",
    -       [{"objectclass", ["person"]},
    -        {"cn", ["Bill Valentine"]},
    -        {"sn", ["Valentine"]},
    -        {"telephoneNumber", ["545 555 00"]}]
    -     )
    +
    [{"objectclass", ["person"]}, + {"cn", ["Bill Valentine"]}, + {"sn", ["Valentine"]}, + {"telephoneNumber", ["545 555 00"]}] + )
    @@ -1174,7 +1174,7 @@ -

    Creates an extensible match filter. For example,

      eldap:extensibleMatch("Bar", [{type,"sn"}, {matchingRule,"caseExactMatch"}]))

    creates a filter which performs a caseExactMatch on the attribute sn and +

    Creates an extensible match filter. For example,

      eldap:extensibleMatch("Bar", [{type,"sn"}, {matchingRule,"caseExactMatch"}]))

    creates a filter which performs a caseExactMatch on the attribute sn and matches with the value "Bar". The default value of dnAttributes is false.

    @@ -1392,9 +1392,9 @@ -

    Modify an entry.

      modify(Handle, "cn=Bill Valentine, ou=people, o=Example Org, dc=example, dc=com",
    -         [eldap:mod_replace("telephoneNumber", ["555 555 00"]),
    -	  eldap:mod_add("description", ["LDAP Hacker"]) ])
    +

    Modify an entry.

      modify(Handle, "cn=Bill Valentine, ou=people, o=Example Org, dc=example, dc=com",
    +         [eldap:mod_replace("telephoneNumber", ["555 555 00"]),
    +	  eldap:mod_add("description", ["LDAP Hacker"]) ])
    @@ -1715,8 +1715,8 @@

    paged_result_control(PageSize) -> {control, "1.2.840.113556.1.4.319", true, binary()}

    Paged results is an extension to the LDAP protocol specified by RFC2696

    This function creates a control with the specified page size for use in -search/3, for example:

    Control = eldap:paged_result_control(50),
    -{ok, SearchResults} = search(Handle, [{base, "dc=example, dc=com"}], [Control]),
    +search/3, for example:

    Control = eldap:paged_result_control(50),
    +{ok, SearchResults} = search(Handle, [{base, "dc=example, dc=com"}], [Control]),
    @@ -1750,12 +1750,12 @@

    paged_result_control(PageSize, Cookie) -> {control, "1.2.840.113556.1.4.319", true, binary()}

    Paged results is an extension to the LDAP protocol specified by RFC2696

    This function creates a control with the specified page size and cookie for use in search/3 to retrieve the next results page.

    For example:

    PageSize = 50,
    -Control1 = eldap:paged_result_control(PageSize),
    -{ok, SearchResults1} = search(Handle, [{base, "dc=example, dc=com"}], [Control1]),
    +Control1 = eldap:paged_result_control(PageSize),
    +{ok, SearchResults1} = search(Handle, [{base, "dc=example, dc=com"}], [Control1]),
     %% retrieve the returned cookie from the search results
    -{ok, Cookie1} = eldap:paged_result_cookie(SearchResults1),
    -Control2 = eldap:paged_result_control(PageSize, Cookie1),
    -{ok, SearchResults2} = eldap:search(Handle, [{base, "dc=example,dc=com"}], [Control2]),
    +{ok, Cookie1} = eldap:paged_result_cookie(SearchResults1),
    +Control2 = eldap:paged_result_control(PageSize, Cookie1),
    +{ok, SearchResults2} = eldap:search(Handle, [{base, "dc=example,dc=com"}], [Control2]),
     %% etc
    @@ -1875,8 +1875,8 @@

    Search the directory with the supplied the SearchOptions.

    The base and filter options must be supplied. Default values: scope is wholeSubtree/0, deref is -derefAlways/0, types_only is false and timeout is 0 (meaning infinity).

      Filter = eldap:substrings("cn", [{any,"V"}]),
    -  search(Handle, [{base, "dc=example, dc=com"}, {filter, Filter}, {attributes, ["cn"]}]),

    The timeout option in the SearchOptions is for the ldap server, while the +derefAlways/0, types_only is false and timeout is 0 (meaning infinity).

      Filter = eldap:substrings("cn", [{any,"V"}]),
    +  search(Handle, [{base, "dc=example, dc=com"}, {filter, Filter}, {attributes, ["cn"]}]),

    The timeout option in the SearchOptions is for the ldap server, while the timeout in eldap:open/2 is used for each individual request in the search operation.

    /usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/eldap.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1144)) --- old//usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/eldap.html 2026-06-04 19:05:06.554488457 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/eldap.html 2026-06-04 19:05:06.554488457 +0000 @@ -977,13 +977,13 @@ -

    Add an entry. The entry must not exist.

      add(Handle,
    +

    Add an entry. The entry must not exist.

      add(Handle,
           "cn=Bill Valentine, ou=people, o=Example Org, dc=example, dc=com",
    -       [{"objectclass", ["person"]},
    -        {"cn", ["Bill Valentine"]},
    -        {"sn", ["Valentine"]},
    -        {"telephoneNumber", ["545 555 00"]}]
    -     )
    +
    [{"objectclass", ["person"]}, + {"cn", ["Bill Valentine"]}, + {"sn", ["Valentine"]}, + {"telephoneNumber", ["545 555 00"]}] + )
    @@ -1295,7 +1295,7 @@ -

    Creates an extensible match filter. For example,

      eldap:extensibleMatch("Bar", [{type,"sn"}, {matchingRule,"caseExactMatch"}]))

    creates a filter which performs a caseExactMatch on the attribute sn and +

    Creates an extensible match filter. For example,

      eldap:extensibleMatch("Bar", [{type,"sn"}, {matchingRule,"caseExactMatch"}]))

    creates a filter which performs a caseExactMatch on the attribute sn and matches with the value "Bar". The default value of dnAttributes is false.

    @@ -1513,9 +1513,9 @@ -

    Modify an entry.

      modify(Handle, "cn=Bill Valentine, ou=people, o=Example Org, dc=example, dc=com",
    -         [eldap:mod_replace("telephoneNumber", ["555 555 00"]),
    -	  eldap:mod_add("description", ["LDAP Hacker"]) ])
    +

    Modify an entry.

      modify(Handle, "cn=Bill Valentine, ou=people, o=Example Org, dc=example, dc=com",
    +         [eldap:mod_replace("telephoneNumber", ["555 555 00"]),
    +	  eldap:mod_add("description", ["LDAP Hacker"]) ])
    @@ -1836,8 +1836,8 @@

    paged_result_control(PageSize) -> {control, "1.2.840.113556.1.4.319", true, binary()}

    Paged results is an extension to the LDAP protocol specified by RFC2696

    This function creates a control with the specified page size for use in -search/3, for example:

    Control = eldap:paged_result_control(50),
    -{ok, SearchResults} = search(Handle, [{base, "dc=example, dc=com"}], [Control]),
    +search/3, for example:

    Control = eldap:paged_result_control(50),
    +{ok, SearchResults} = search(Handle, [{base, "dc=example, dc=com"}], [Control]),
    @@ -1871,12 +1871,12 @@

    paged_result_control(PageSize, Cookie) -> {control, "1.2.840.113556.1.4.319", true, binary()}

    Paged results is an extension to the LDAP protocol specified by RFC2696

    This function creates a control with the specified page size and cookie for use in search/3 to retrieve the next results page.

    For example:

    PageSize = 50,
    -Control1 = eldap:paged_result_control(PageSize),
    -{ok, SearchResults1} = search(Handle, [{base, "dc=example, dc=com"}], [Control1]),
    +Control1 = eldap:paged_result_control(PageSize),
    +{ok, SearchResults1} = search(Handle, [{base, "dc=example, dc=com"}], [Control1]),
     %% retrieve the returned cookie from the search results
    -{ok, Cookie1} = eldap:paged_result_cookie(SearchResults1),
    -Control2 = eldap:paged_result_control(PageSize, Cookie1),
    -{ok, SearchResults2} = eldap:search(Handle, [{base, "dc=example,dc=com"}], [Control2]),
    +{ok, Cookie1} = eldap:paged_result_cookie(SearchResults1),
    +Control2 = eldap:paged_result_control(PageSize, Cookie1),
    +{ok, SearchResults2} = eldap:search(Handle, [{base, "dc=example,dc=com"}], [Control2]),
     %% etc
    @@ -1996,8 +1996,8 @@

    Search the directory with the supplied the SearchOptions.

    The base and filter options must be supplied. Default values: scope is wholeSubtree/0, deref is -derefAlways/0, types_only is false and timeout is 0 (meaning infinity).

      Filter = eldap:substrings("cn", [{any,"V"}]),
    -  search(Handle, [{base, "dc=example, dc=com"}, {filter, Filter}, {attributes, ["cn"]}]),

    The timeout option in the SearchOptions is for the ldap server, while the +derefAlways/0, types_only is false and timeout is 0 (meaning infinity).

      Filter = eldap:substrings("cn", [{any,"V"}]),
    +  search(Handle, [{base, "dc=example, dc=com"}, {filter, Filter}, {attributes, ["cn"]}]),

    The timeout option in the SearchOptions is for the ldap server, while the timeout in eldap:open/2 is used for each individual request in the search operation.

    @@ -2237,7 +2237,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/notes.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (395)) --- old//usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/notes.html 2026-06-04 19:05:06.574488643 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/notes.html 2026-06-04 19:05:06.576488661 +0000 @@ -503,7 +503,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/search.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/search.html 2026-06-04 19:05:06.594581758 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/eldap-1.2.13/doc/html/search.html 2026-06-04 19:05:06.594581758 +0000 @@ -122,7 +122,7 @@
    - + /usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/404.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/404.html 2026-06-04 19:05:06.609441191 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/404.html 2026-06-04 19:05:06.609441191 +0000 @@ -135,7 +135,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/ei.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (2983)) --- old//usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/ei.html 2026-06-04 19:05:06.637489227 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/ei.html 2026-06-04 19:05:06.637489227 +0000 @@ -151,30 +151,30 @@ Data Types

    -
    • ei_term

      typedef struct {
      +
      • ei_term

        typedef struct {
             char ei_type;
             int arity;
             int size;
        -    union {
        +    union {
           long i_val;
           double d_val;
        -  char atom_name[MAXATOMLEN_UTF8];
        +  char atom_name[MAXATOMLEN_UTF8];
           erlang_pid pid;
           erlang_port port;
           erlang_ref ref;
        -    } value;
        -} ei_term;

        Structure written by ei_decode_ei_term(). The + } value; +} ei_term;

      Structure written by ei_decode_ei_term(). The ei_type field is the type of the term which equals to what ei_get_type() sets *type to.

    • ei_x_buff - A dynamically resized buffer. It is a struct with two fields of interest for the user:

      • char *buff - Pointer to the dynamically allocated buffer.

      • int index - Offset to the next byte to write which also equals the amount of bytes currently written.

      An ei_x_buff is initialized by calling either ei_x_new() or ei_x_new_with_version(). The memory used by an initialized ei_x_buff is released by calling -ei_x_free().

    • erlang_char_encoding

      typedef enum {
      +ei_x_free().

    • erlang_char_encoding

      typedef enum {
           ERLANG_ASCII = 1,
           ERLANG_LATIN1 = 2,
           ERLANG_UTF8 = 4
      -} erlang_char_encoding;

      The character encodings used for atoms. ERLANG_ASCII represents 7-bit ASCII. +} erlang_char_encoding;

    The character encodings used for atoms. ERLANG_ASCII represents 7-bit ASCII. Latin-1 and UTF-8 are different extensions of 7-bit ASCII. All 7-bit ASCII characters are valid Latin-1 and UTF-8 characters. ASCII and Latin-1 both represent each character by one byte. An UTF-8 character can consist of 1-4 @@ -190,7 +190,7 @@ ei_cmp_pids()

    -
    int ei_cmp_pids(erlang_pid *a, erlang_pid *b);

    Compare two process identifiers. The comparison is done the same way as Erlang +

    int ei_cmp_pids(erlang_pid *a, erlang_pid *b);

    Compare two process identifiers. The comparison is done the same way as Erlang does.

    Returns 0 if a and b are equal. Returns a value less than 0 if a compares as less than b. Returns a value larger than 0 if a compares as larger than b.

    Available since OTP 23.0

    @@ -199,7 +199,7 @@ ei_cmp_ports()

    -
    int ei_cmp_ports(erlang_port *a, erlang_port *b);

    Compare two port identifiers. The comparison is done the same way as Erlang +

    int ei_cmp_ports(erlang_port *a, erlang_port *b);

    Compare two port identifiers. The comparison is done the same way as Erlang does.

    Returns 0 if a and b are equal. Returns a value less than 0 if a compares as less than b. Returns a value larger than 0 if a compares as larger than b.

    Available since OTP 23.0

    @@ -208,7 +208,7 @@ ei_cmp_refs()

    -
    int ei_cmp_refs(erlang_ref *a, erlang_ref *b);

    Compare two references. The comparison is done the same way as Erlang does.

    Returns 0 if a and b are equal. Returns a value less than 0 if a +

    int ei_cmp_refs(erlang_ref *a, erlang_ref *b);

    Compare two references. The comparison is done the same way as Erlang does.

    Returns 0 if a and b are equal. Returns a value less than 0 if a compares as less than b. Returns a value larger than 0 if a compares as larger than b.

    Available since OTP 23.0

    @@ -216,15 +216,15 @@ ei_decode_atom()

    -
    int ei_decode_atom(const char *buf, int *index, char *p);

    Decodes an atom from the binary format. The NULL-terminated name of the atom +

    int ei_decode_atom(const char *buf, int *index, char *p);

    Decodes an atom from the binary format. The NULL-terminated name of the atom is placed at p. At most MAXATOMLEN bytes can be placed in the buffer.

    ei_decode_atom_as()

    -
    int ei_decode_atom_as(const char *buf, int *index, char *p, int plen,
    -  erlang_char_encoding want, erlang_char_encoding* was, erlang_char_encoding* result);

    Decodes an atom from the binary format. The NULL-terminated name of the atom +

    int ei_decode_atom_as(const char *buf, int *index, char *p, int plen,
    +  erlang_char_encoding want, erlang_char_encoding* was, erlang_char_encoding* result);

    Decodes an atom from the binary format. The NULL-terminated name of the atom is placed in buffer at p of length plen bytes.

    The wanted string encoding is specified by want. The original encoding used in the binary format (Latin-1 or UTF-8) can be obtained from *was. The encoding of the resulting string (7-bit ASCII, @@ -239,7 +239,7 @@ ei_decode_bignum() -

    int ei_decode_bignum(const char *buf, int *index, mpz_t obj);

    Decodes an integer in the binary format to a GMP mpz_t integer. To use this +

    int ei_decode_bignum(const char *buf, int *index, mpz_t obj);

    Decodes an integer in the binary format to a GMP mpz_t integer. To use this function, the ei library must be configured and compiled to use the GMP library.

    @@ -247,7 +247,7 @@ ei_decode_binary()

    -
    int ei_decode_binary(const char *buf, int *index, void *p, long *len);

    Decodes a binary from the binary format. Parameter len is set to the actual +

    int ei_decode_binary(const char *buf, int *index, void *p, long *len);

    Decodes a binary from the binary format. Parameter len is set to the actual size of the binary. Notice that ei_decode_binary() assumes that there is enough room for the binary. The size required can be fetched by ei_get_type().

    @@ -256,8 +256,8 @@ ei_decode_bitstring()

    -
    int ei_decode_bitstring(const char *buf, int *index, const char **pp,
    -  unsigned int *bitoffsp, size_t *nbitsp);

    Decodes a bit string from the binary format.

    • pp - Either NULL or *pp returns a pointer to the first byte of the +

      int ei_decode_bitstring(const char *buf, int *index, const char **pp,
      +  unsigned int *bitoffsp, size_t *nbitsp);

      Decodes a bit string from the binary format.

      • pp - Either NULL or *pp returns a pointer to the first byte of the bit string. The returned bit string is readable as long as the buffer pointed to by buf is readable and not written to.

      • bitoffsp - Either NULL or *bitoffsp returns the number of unused bits in the first byte pointed to by *pp. The value of *bitoffsp is @@ -273,14 +273,14 @@ ei_decode_boolean() -

        int ei_decode_boolean(const char *buf, int *index, int *p);

        Decodes a boolean value from the binary format. A boolean is actually an atom, +

        int ei_decode_boolean(const char *buf, int *index, int *p);

        Decodes a boolean value from the binary format. A boolean is actually an atom, true decodes 1 and false decodes 0.

        ei_decode_char()

        -
        int ei_decode_char(const char *buf, int *index, char *p);

        Decodes a char (8-bit) integer between 0-255 from the binary format. For +

        int ei_decode_char(const char *buf, int *index, char *p);

        Decodes a char (8-bit) integer between 0-255 from the binary format. For historical reasons the returned integer is of type char. Your C code is to consider the returned value to be of type unsigned char even if the C compilers and system can define char to be signed.

        @@ -289,14 +289,14 @@ ei_decode_double()

        -
        int ei_decode_double(const char *buf, int *index, double *p);

        Decodes a double-precision (64-bit) floating point number from the binary +

        int ei_decode_double(const char *buf, int *index, double *p);

        Decodes a double-precision (64-bit) floating point number from the binary format.

        ei_decode_ei_term()

        -
        int ei_decode_ei_term(const char* buf, int* index, ei_term* term);

        Decodes any term, or at least tries to. If the term pointed at by *index in +

        int ei_decode_ei_term(const char* buf, int* index, ei_term* term);

        Decodes any term, or at least tries to. If the term pointed at by *index in buf fits in the term union, it is decoded, and the appropriate field in term->value is set, and *index is incremented by the term size.

        The function returns 1 on successful decoding, -1 on error, and 0 if the term seems alright, but does not fit in the term structure. If 1 is @@ -314,7 +314,7 @@ free_fun() -

        int ei_decode_fun(const char *buf, int *index, erlang_fun *p);
        void free_fun(erlang_fun* f);

        Decodes a fun from the binary format. Parameter p is to be NULL or point to +

        int ei_decode_fun(const char *buf, int *index, erlang_fun *p);
        void free_fun(erlang_fun* f);

        Decodes a fun from the binary format. Parameter p is to be NULL or point to an erlang_fun structure. This is the only decode function that allocates memory. When the erlang_fun is no longer needed, it is to be freed with free_fun. (This has to do with the arbitrary size of the environment for a @@ -324,7 +324,7 @@ ei_decode_iodata() -

        int ei_decode_iodata(const char *buf, int *index, int *size, char *outbuf);

        Decodes a term of the type iodata(). +

        int ei_decode_iodata(const char *buf, int *index, int *size, char *outbuf);

        Decodes a term of the type iodata(). The iodata/0 term will be flattened an written into the buffer pointed to by the outbuf argument. The byte size of the iodata is written into the integer variable pointed to by the size argument. Both size and outbuf can be set @@ -345,7 +345,7 @@ ei_decode_list_header() -

        int ei_decode_list_header(const char *buf, int *index, int *arity);

        Decodes a list header from the binary format. The number of elements is returned +

        int ei_decode_list_header(const char *buf, int *index, int *arity);

        Decodes a list header from the binary format. The number of elements is returned in arity. The arity+1 elements follow (the last one is the tail of the list, normally an empty list). If arity is 0, it is an empty list.

        Notice that lists are encoded as strings if they consist entirely of integers in the range 0..255. This function do not decode such strings, use @@ -355,21 +355,21 @@ ei_decode_long() -

        int ei_decode_long(const char *buf, int *index, long *p);

        Decodes a long integer from the binary format. If the code is 64 bits, the +

        int ei_decode_long(const char *buf, int *index, long *p);

        Decodes a long integer from the binary format. If the code is 64 bits, the function ei_decode_long() is the same as ei_decode_longlong().

        ei_decode_longlong()

        -
        int ei_decode_longlong(const char *buf, int *index, long long *p);

        Decodes a GCC long long or Visual C++ __int64 (64-bit) integer from the +

        int ei_decode_longlong(const char *buf, int *index, long long *p);

        Decodes a GCC long long or Visual C++ __int64 (64-bit) integer from the binary format.

        ei_decode_map_header()

        -
        int ei_decode_map_header(const char *buf, int *index, int *arity);

        Decodes a map header from the binary format. The number of key-value pairs is +

        int ei_decode_map_header(const char *buf, int *index, int *arity);

        Decodes a map header from the binary format. The number of key-value pairs is returned in *arity. Keys and values follow in this order: K1, V1, K2, V2, ..., Kn, Vn. This makes a total of arity*2 terms. If arity /usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/ei_connect.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (2659)) --- old//usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/ei_connect.html 2026-06-04 19:05:06.670489533 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/ei_connect.html 2026-06-04 19:05:06.670489533 +0000 @@ -241,36 +241,36 @@

        • ei_cnode - Opaque data type representing a C-node. A ei_cnode structure is initialized by calling -ei_connect_init() or friends.

        • ei_socket_callbacks

          typedef struct {
          +ei_connect_init() or friends.

        • ei_socket_callbacks

          typedef struct {
               int flags;
          -    int (*socket)(void **ctx, void *setup_ctx);
          -    int   (*close)(void *ctx);
          -    int (*listen)(void *ctx, void *addr, int *len, int backlog);
          -    int (*accept)(void **ctx, void *addr, int *len, unsigned tmo);
          -    int (*connect)(void *ctx, void *addr, int len, unsigned tmo);
          -    int (*writev)(void *ctx, const void *iov, int iovcnt, ssize_t *len, unsigned tmo);
          -    int (*write)(void *ctx, const char *buf, ssize_t *len, unsigned tmo);
          -    int (*read)(void *ctx, char *buf, ssize_t *len, unsigned tmo);
          -    int (*handshake_packet_header_size)(void *ctx, int *sz);
          -    int (*connect_handshake_complete)(void *ctx);
          -    int (*accept_handshake_complete)(void *ctx);
          -    int (*get_fd)(void *ctx, int *fd);
          -} ei_socket_callbacks;

          Callbacks functions for a + int (*socket)(void **ctx, void *setup_ctx); + int (*close)(void *ctx); + int (*listen)(void *ctx, void *addr, int *len, int backlog); + int (*accept)(void **ctx, void *addr, int *len, unsigned tmo); + int (*connect)(void *ctx, void *addr, int len, unsigned tmo); + int (*writev)(void *ctx, const void *iov, int iovcnt, ssize_t *len, unsigned tmo); + int (*write)(void *ctx, const char *buf, ssize_t *len, unsigned tmo); + int (*read)(void *ctx, char *buf, ssize_t *len, unsigned tmo); + int (*handshake_packet_header_size)(void *ctx, int *sz); + int (*connect_handshake_complete)(void *ctx); + int (*accept_handshake_complete)(void *ctx); + int (*get_fd)(void *ctx, int *fd); +} ei_socket_callbacks;

  • Callbacks functions for a User Supplied Socket Implementation. Documentation of each field can be -found in the User Supplied Socket Implementation section above.

  • ErlConnect

    typedef struct {
    -    char ipadr[4]; /* Ip v4 address in network byte order */
    -    char nodename[MAXNODELEN];
    -} ErlConnect;

    IP v4 address and nodename.

  • Erl_IpAddr

    typedef struct {
    +found in the User Supplied Socket Implementation section above.

  • ErlConnect

    typedef struct {
    +    char ipadr[4]; /* Ip v4 address in network byte order */
    +    char nodename[MAXNODELEN];
    +} ErlConnect;

    IP v4 address and nodename.

  • Erl_IpAddr

    typedef struct {
         unsigned s_addr; /* Ip v4 address in network byte order */
    -} Erl_IpAddr;

    IP v4 address.

  • erlang_msg

    typedef struct {
    +} Erl_IpAddr;

    IP v4 address.

  • erlang_msg

    typedef struct {
         long msgtype;
         erlang_pid from;
         erlang_pid to;
    -    char toname[MAXATOMLEN+1];
    -    char cookie[MAXATOMLEN+1];
    +    char toname[MAXATOMLEN+1];
    +    char cookie[MAXATOMLEN+1];
         erlang_trace token;
    -} erlang_msg;

    Information about a message received via +} erlang_msg;

  • Information about a message received via ei_receive_msg() or friends.

    @@ -295,15 +295,15 @@ ei_gethostbyname_r()

    -
    struct hostent * ei_gethostbyaddr(const char *addr, int len, int type);
    struct hostent * ei_gethostbyaddr_r(const char *addr, int length,  int type,
    -  struct hostent *hostp, char *buffer,   int buflen,  int *h_errnop);
    struct hostent * ei_gethostbyname(const char *name);
    struct hostent * ei_gethostbyname_r(const char *name,  struct hostent *hostp,
    -  char *buffer,  int buflen,  int *h_errnop);

    Convenience functions for some common name lookup functions.

    +
    struct hostent * ei_gethostbyaddr(const char *addr, int len, int type);
    struct hostent * ei_gethostbyaddr_r(const char *addr, int length,  int type,
    +  struct hostent *hostp, char *buffer,   int buflen,  int *h_errnop);
    struct hostent * ei_gethostbyname(const char *name);
    struct hostent * ei_gethostbyname_r(const char *name,  struct hostent *hostp,
    +  char *buffer,  int buflen,  int *h_errnop);

    Convenience functions for some common name lookup functions.

    ei_accept()

    -
    int ei_accept(ei_cnode *ec, int listensock, ErlConnect *conp);

    Used by a server process to accept a connection from a client process.

    • ec is the C-node structure.
    • listensock is an open socket descriptor on which listen() has previously +
      int ei_accept(ei_cnode *ec, int listensock, ErlConnect *conp);

      Used by a server process to accept a connection from a client process.

      • ec is the C-node structure.
      • listensock is an open socket descriptor on which listen() has previously been called.
      • conp is a pointer to an ErlConnect struct.

      On success, conp is filled in with the address and node name of the connecting client and a file descriptor is returned. On failure, ERL_ERROR is returned and erl_errno is set to EIO.

      @@ -312,14 +312,14 @@ ei_accept_tmo()

      -
      int ei_accept_tmo(ei_cnode *ec, int listensock, ErlConnect *conp, unsigned timeout_ms);

      Equivalent to ei_accept with an optional time-out argument, see the +

      int ei_accept_tmo(ei_cnode *ec, int listensock, ErlConnect *conp, unsigned timeout_ms);

      Equivalent to ei_accept with an optional time-out argument, see the description at the beginning of this manual page.

      ei_close_connection()

      -
      int ei_close_connection(int fd);

      Closes a previously opened connection or listen socket.

      Available since OTP 21.3

      +
      int ei_close_connection(int fd);

      Closes a previously opened connection or listen socket.

      Available since OTP 21.3

      @@ -343,7 +343,7 @@ ei_xconnect_host_port()

      -
      int ei_connect(ei_cnode* ec, char *nodename);
      int ei_xconnect(ei_cnode* ec, Erl_IpAddr adr, char *alivename);
      int ei_connect_host_port(ei_cnode* ec, char *hostname, int port);
      int ei_xconnect_host_port(ei_cnode* ec, Erl_IpAddr adr, int port);

      Sets up a connection to an Erlang node.

      ei_xconnect() requires the IP address of the remote host and the alive name of +

      int ei_connect(ei_cnode* ec, char *nodename);
      int ei_xconnect(ei_cnode* ec, Erl_IpAddr adr, char *alivename);
      int ei_connect_host_port(ei_cnode* ec, char *hostname, int port);
      int ei_xconnect_host_port(ei_cnode* ec, Erl_IpAddr adr, int port);

      Sets up a connection to an Erlang node.

      ei_xconnect() requires the IP address of the remote host and the alive name of the remote node to be specified. ei_connect() provides an alternative interface and determines the information from the node name provided. The ei_xconnect_host_port() function provides yet another alternative that will @@ -359,12 +359,12 @@ #define IP_ADDR "150.236.14.75" /*** Variant 1 ***/ -int fd = ei_connect(&ec, NODE); +int fd = ei_connect(&ec, NODE); /*** Variant 2 ***/ struct in_addr addr; -addr.s_addr = inet_addr(IP_ADDR); -fd = ei_xconnect(&ec, &addr, ALIVE);

    Available since OTP 23.0

    +addr.s_addr = inet_addr(IP_ADDR); +fd = ei_xconnect(&ec, &addr, ALIVE);

    Available since OTP 23.0

    @@ -388,11 +388,11 @@ ei_connect_xinit_ussi()

    -
    int ei_connect_init(ei_cnode* ec, const char* this_node_name, const char *cookie, unsigned creation);
    int ei_connect_init_ussi(ei_cnode* ec, const char* this_node_name, const char *cookie,
    -  unsigned creation, ei_socket_callbacks *cbs, int cbs_sz, void *setup_context);
    int ei_connect_xinit(ei_cnode* ec, const char *thishostname, const char *thisalivename,
    -  const char *thisnodename, Erl_IpAddr thisipaddr, const char *cookie, unsigned creation);
    int ei_connect_xinit_ussi(ei_cnode* ec, const char *thishostname, const char *thisalivename,
    +
    int ei_connect_init(ei_cnode* ec, const char* this_node_name, const char *cookie, unsigned creation);
    int ei_connect_init_ussi(ei_cnode* ec, const char* this_node_name, const char *cookie,
    +  unsigned creation, ei_socket_callbacks *cbs, int cbs_sz, void *setup_context);
    int ei_connect_xinit(ei_cnode* ec, const char *thishostname, const char *thisalivename,
    +  const char *thisnodename, Erl_IpAddr thisipaddr, const char *cookie, unsigned creation);
    int ei_connect_xinit_ussi(ei_cnode* ec, const char *thishostname, const char *thisalivename,
       const char *thisnodename, Erl_IpAddr thisipaddr, const char *cookie, unsigned creation,
    -  ei_socket_callbacks *cbs, int cbs_sz, void *setup_context);

    Initializes the ec structure, to identify the node name and cookie of the + ei_socket_callbacks *cbs, int cbs_sz, void *setup_context);

    Initializes the ec structure, to identify the node name and cookie of the server. One of them must be called before other functions that works on the ei_cnode type or a file descriptor associated with a connection to another node is used.

    • ec is a structure containing information about the C-node. It is used in @@ -415,20 +415,20 @@ see the relevant system documentation.

      These functions return a negative value indicating that an error occurred.

      Example 1:

      unsigned n = 0;
       struct in_addr addr;
       ei_cnode ec;
      -addr.s_addr = inet_addr("150.236.14.75");
      -if (ei_connect_xinit(&ec,
      +addr.s_addr = inet_addr("150.236.14.75");
      +if (ei_connect_xinit(&ec,
                            "chivas",
                            "madonna",
                            "madonna@chivas.du.etx.ericsson.se",
                            &addr;
                            "cookie...",
      -                     n++) < 0) {
      -    fprintf(stderr,"ERROR when initializing: %d",erl_errno);
      -    exit(-1);
      -}

      Example 2:

      if (ei_connect_init(&ec, "madonna", "cookie...", n++) < 0) {
      -    fprintf(stderr,"ERROR when initializing: %d",erl_errno);
      -    exit(-1);
      -}

      Available since OTP 21.3

      + n++) < 0) { + fprintf(stderr,"ERROR when initializing: %d",erl_errno); + exit(-1); +}

    Example 2:

    if (ei_connect_init(&ec, "madonna", "cookie...", n++) < 0) {
    +    fprintf(stderr,"ERROR when initializing: %d",erl_errno);
    +    exit(-1);
    +}

    Available since OTP 21.3

    @@ -452,7 +452,7 @@ ei_xconnect_host_port_tmo()

    -
    int ei_connect_tmo(ei_cnode* ec, char *nodename, unsigned timeout_ms);
    int ei_xconnect_tmo(ei_cnode* ec, Erl_IpAddr adr, char *alivename, unsigned timeout_ms);
    int ei_connect_host_port_tmo(ei_cnode* ec, char *hostname, int port, unsigned ms);
    int ei_xconnect_host_port_tmo(ei_cnode* ec, Erl_IpAddr adr, int port, unsigned ms);

    Equivalent to ei_connect, ei_xconnect, ei_connect_host_port and +

    int ei_connect_tmo(ei_cnode* ec, char *nodename, unsigned timeout_ms);
    int ei_xconnect_tmo(ei_cnode* ec, Erl_IpAddr adr, char *alivename, unsigned timeout_ms);
    int ei_connect_host_port_tmo(ei_cnode* ec, char *hostname, int port, unsigned ms);
    int ei_xconnect_host_port_tmo(ei_cnode* ec, Erl_IpAddr adr, int port, unsigned ms);

    Equivalent to ei_connect, ei_xconnect, ei_connect_host_port and ei_xconnect_host_port with an optional time-out argument, see the description at the beginning of this manual page.

    Available since OTP 23.0

    @@ -466,7 +466,7 @@ ei_set_tracelevel()

    -
    int ei_get_tracelevel(void);
    void ei_set_tracelevel(int level);

    Used to set tracing on the distribution. The levels are different verbosity +

    int ei_get_tracelevel(void);
    void ei_set_tracelevel(int level);

    Used to set tracing on the distribution. The levels are different verbosity levels. A higher level means more information. See also section Debug Information.

    These functions are not thread safe.

    Available since OTP R13B04

    @@ -480,7 +480,7 @@ ei_xlisten()

    -
    int ei_listen(ei_cnode *ec, int *port, int backlog);
    int ei_xlisten(ei_cnode *ec, Erl_IpAddr adr, int *port, int backlog);

    Used by a server process to setup a listen socket which later can be used for +

    int ei_listen(ei_cnode *ec, int *port, int backlog);
    int ei_xlisten(ei_cnode *ec, Erl_IpAddr adr, int *port, int backlog);

    Used by a server process to setup a listen socket which later can be used for accepting connections from client processes.

    • ec is the C-node structure.
    • adr is local interface to bind to.
    • port is a pointer to an integer containing the port number to bind to. If *port equals 0 when calling ei_listen(), the socket will be bound to an ephemeral port. On success, ei_listen() will update the value of *port to @@ -495,7 +495,7 @@ ei_make_pid() /usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/ei_global.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1537)) --- old//usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/ei_global.html 2026-06-04 19:05:06.692489737 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/ei_global.html 2026-06-04 19:05:06.692489737 +0000 @@ -132,7 +132,7 @@ ei_global_names() -
      char **ei_global_names(ei_cnode *ec, int fd, int *count);

      Retrieves a list of all known global names.

      • ec is the ei_cnode representing the current cnode.
      • fd is an open descriptor to an Erlang connection.
      • count is the address of an integer, or NULL. If count is not NULL, it +
        char **ei_global_names(ei_cnode *ec, int fd, int *count);

        Retrieves a list of all known global names.

        • ec is the ei_cnode representing the current cnode.
        • fd is an open descriptor to an Erlang connection.
        • count is the address of an integer, or NULL. If count is not NULL, it is set by the function to the number of names found.

        On success, the function returns an array of strings, each containing a single registered name, and sets count to the number of names found. The array is terminated by a single NULL pointer. On failure, the function returns NULL @@ -144,20 +144,20 @@ ei_global_register() -

        int ei_global_register(int fd, const char *name, erlang_pid *self);

        Registers a name in global.

        • fd is an open descriptor to an Erlang connection.
        • name is the name to register in global.
        • pid is the pid that is to be associated with name. This value is returned +
          int ei_global_register(int fd, const char *name, erlang_pid *self);

          Registers a name in global.

          • fd is an open descriptor to an Erlang connection.
          • name is the name to register in global.
          • pid is the pid that is to be associated with name. This value is returned by global when processes request the location of name.

          Returns 0 on success, otherwise -1.

          Available since OTP 23.0

          ei_global_unregister()

          -
          int ei_global_unregister(ei_cnode *ec, int fd, const char *name);

          Unregisters a name from global.

          • ec is the ei_cnode representing the current cnode.
          • fd is an open descriptor to an Erlang connection.
          • name is the name to unregister from global.

          Returns 0 on success, otherwise -1.

          Available since OTP 23.0

          +
          int ei_global_unregister(ei_cnode *ec, int fd, const char *name);

          Unregisters a name from global.

          • ec is the ei_cnode representing the current cnode.
          • fd is an open descriptor to an Erlang connection.
          • name is the name to unregister from global.

          Returns 0 on success, otherwise -1.

          Available since OTP 23.0

          ei_global_whereis()

          -
          int ei_global_whereis(ei_cnode *ec, int fd, const char *name, erlang_pid* pid, char *node);

          Looks up a name in global.

          • ec is the ei_cnode representing the current cnode.
          • fd is an open descriptor to an Erlang connection.
          • name is the name that is to be looked up in global.

          The pid parameter is a pointer to a erlang_pid that the function will update +

          int ei_global_whereis(ei_cnode *ec, int fd, const char *name, erlang_pid* pid, char *node);

          Looks up a name in global.

          • ec is the ei_cnode representing the current cnode.
          • fd is an open descriptor to an Erlang connection.
          • name is the name that is to be looked up in global.

          The pid parameter is a pointer to a erlang_pid that the function will update with the pid associated with the global name, if successful.

          If node is not NULL, it is a pointer to a buffer where the function can fill in the name of the node where name is found. node can be passed directly to ei_connect() if necessary.

          On success, the function returns 0, updates the erlang_pid pointed to by the @@ -204,7 +204,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/ei_users_guide.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (757)) --- old//usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/ei_users_guide.html 2026-06-04 19:05:06.712489923 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/ei_users_guide.html 2026-06-04 19:05:06.712489923 +0000 @@ -180,11 +180,11 @@ Erlang.

          The Erl_Interface library supports this activity. It has several C functions that create and manipulate Erlang data structures. The following example shows how to create and encode an Erlang tuple {tobbe,3928}:

          ei_x_buff buf;
          -ei_x_new(&buf);
          +ei_x_new(&buf);
           int i = 0;
          -ei_x_encode_tuple_header(&buf, 2);
          -ei_x_encode_atom(&buf, "tobbe");
          -ei_x_encode_long(&buf, 3928);

          For a complete description, see the ei module.

          +ei_x_encode_tuple_header(&buf, 2); +ei_x_encode_atom(&buf, "tobbe"); +ei_x_encode_long(&buf, 3928);

    For a complete description, see the ei module.

    @@ -193,18 +193,18 @@

    The previous example can be simplified by using the ei_x_format_wo_ver function to create an Erlang term:

    ei_x_buff buf;
    -ei_x_new(&buf);
    -ei_x_format_wo_ver(&buf, "{~a,~i}", "tobbe", 3928);

    For a complete description of the different format directives, see the the +ei_x_new(&buf); +ei_x_format_wo_ver(&buf, "{~a,~i}", "tobbe", 3928);

    For a complete description of the different format directives, see the the ei_x_format_wo_ver function.

    The following example is more complex:

    ei_x_buff buf;
     int i = 0;
    -ei_x_new(&buf);
    -ei_x_format_wo_ver(&buf,
    +ei_x_new(&buf);
    +ei_x_format_wo_ver(&buf,
                        "[{name,~a},{age,~i},{data,[{adr,~s,~i}]}]",
                        "madonna",
                        21,
    -                  "E-street", 42);
    -ei_print_term(stdout, buf.buff, &i);
    -ei_x_free(&buf);

    As in the previous examples, it is your responsibility to free the memory + "E-street", 42); +ei_print_term(stdout, buf.buff, &i); +ei_x_free(&buf);

    As in the previous examples, it is your responsibility to free the memory allocated for Erlang terms. In this example, ei_x_free() ensures that the data pointed to by buf is released.

    @@ -220,18 +220,18 @@ char *cookie="a secret cookie string"; /* An example */ const char* node_name = "einode@durin"; const char *cookie = NULL; -short creation = time(NULL) + 1; +short creation = time(NULL) + 1; ei_cnode ec; -ei_connect_init(&ec, +ei_connect_init(&ec, node_name, cookie, - creation);

    For more information, see the ei_connect module.

    After initialization, you set up the connection to the Erlang node. To specify + creation);

    For more information, see the ei_connect module.

    After initialization, you set up the connection to the Erlang node. To specify the Erlang node you want to connect to, use the ei_connect_*() family of functions. The following example sets up the connection and is to result in a valid socket file descriptor:

    int sockfd;
     const char* node_name = "einode@durin"; /* An example */
    -if ((sockfd = ei_connect(&ec, nodename)) < 0)
    -  fprintf(stderr, "ERROR: ei_connect failed");

    +if ((sockfd = ei_connect(&ec, nodename)) < 0) + fprintf(stderr, "ERROR: ei_connect failed");

    @@ -246,7 +246,7 @@ connection is first made to epmd and, if the node is known, a connection is then made to the Erlang node.

    C nodes can also register themselves with epmd if they want other nodes in the system to be able to find and connect to them.

    Before registering with epmd, you must first create a listen socket and bind -it to a port. Then:

    int pub = ei_publish(&ec, port);

    pub is a file descriptor now connected to epmd. epmd monitors the other +it to a port. Then:

    int pub = ei_publish(&ec, port);

    pub is a file descriptor now connected to epmd. epmd monitors the other end of the connection. If it detects that the connection has been closed, the node becomes unregistered. So, if you explicitly close the descriptor or if your node fails, it becomes unregistered from epmd.

    Notice that on some systems a failed node is not detected by this mechanism, as @@ -269,13 +269,13 @@

    In the following example, {Pid, hello_world} is sent to a registered process my_server:

    ei_x_buff buf;
    -ei_x_new_with_version(&buf);
    +ei_x_new_with_version(&buf);
     
    -ei_x_encode_tuple_header(&buf, 2);
    -ei_x_encode_pid(&buf, ei_self(ec));
    -ei_x_encode_atom(&buf, "Hello world");
    +ei_x_encode_tuple_header(&buf, 2);
    +ei_x_encode_pid(&buf, ei_self(ec));
    +ei_x_encode_atom(&buf, "Hello world");
     
    -ei_reg_send(&ec, fd, "my_server", buf.buff, buf.index);

    The first element of the tuple that is sent is your own pid. This enables +ei_reg_send(&ec, fd, "my_server", buf.buff, buf.index);

    The first element of the tuple that is sent is your own pid. This enables my_server to reply. For more information about the primitives, see the ei_connect module.

    @@ -289,24 +289,24 @@ int arity = 0; erlang_pid pid; ei_x_buff buf; -ei_x_new(&buf); -for (;;) { - int got = ei_xreceive_msg(fd, &msg, &x); - if (got == ERL_TICK) +ei_x_new(&buf); +for (;;) { + int got = ei_xreceive_msg(fd, &msg, &x); + if (got == ERL_TICK) continue; - if (got == ERL_ERROR) { - fprintf(stderr, "ei_xreceive_msg, got==%d", got); - exit(1); - } + if (got == ERL_ERROR) { + fprintf(stderr, "ei_xreceive_msg, got==%d", got); + exit(1); + } break; -} -ei_decode_version(buf.buff, &index, &version); -ei_decode_tuple_header(buf.buff, &index, &arity); -if (arity != 2) { - fprintf(stderr, "got wrong message"); - exit(1); -} -ei_decode_pid(buf.buff, &index, &pid);

    To provide robustness, a distributed Erlang node occasionally polls all its +} +ei_decode_version(buf.buff, &index, &version); +ei_decode_tuple_header(buf.buff, &index, &arity); +if (arity != 2) { + fprintf(stderr, "got wrong message"); + exit(1); +} +ei_decode_pid(buf.buff, &index, &pid);

    To provide robustness, a distributed Erlang node occasionally polls all its connected neighbors in an attempt to detect failed nodes or communication links. A node that receives such a message is expected to respond immediately with an ERL_TICK message. This is done automatically by ei_xreceive_msg(). However, @@ -324,19 +324,19 @@ a remote node and is called a remote procedure call.

    The following example checks if a specific Erlang process is alive:

    int index = 0, is_alive;
     ei_x_buff args, result;
     
    -ei_x_new(&result);
    -ei_x_new(&args);
    -ei_x_encode_list_header(&args, 1);
    -ei_x_encode_pid(&args, &check_pid);
    -ei_x_encode_empty_list(&args);
    -
    -if (ei_rpc(&ec, fd, "erlang", "is_process_alive",
    -           args.buff, args.index, &result) < 0)
    -    handle_error();
    -
    -if (ei_decode_version(result.buff, &index) < 0
    -    || ei_decode_bool(result.buff, &index, &is_alive) < 0)
    -    handle_error();

    For more information about ei_rpc() and its companions ei_rpc_to() and +ei_x_new(&result); +ei_x_new(&args); +ei_x_encode_list_header(&args, 1); +ei_x_encode_pid(&args, &check_pid); +ei_x_encode_empty_list(&args); + +if (ei_rpc(&ec, fd, "erlang", "is_process_alive", + args.buff, args.index, &result) < 0) + handle_error(); + +if (ei_decode_version(result.buff, &index) < 0 + || ei_decode_bool(result.buff, &index, &is_alive) < 0) + handle_error();

    For more information about ei_rpc() and its companions ei_rpc_to() and ei_rpc_from(), see the ei_connect module.

    @@ -353,32 +353,32 @@ int count; int i; -names = ei_global_names(&ec,fd,&count); +names = ei_global_names(&ec,fd,&count); -if (names) - for (i=0; i<count; i++) - printf("%s\n",names[i]); +if (names) + for (i=0; i<count; i++) + printf("%s\n",names[i]); -free(names);

    ei_global_names allocates and returns a buffer +free(names);

    ei_global_names allocates and returns a buffer containing all the names known to the global module in Kernel. count is initialized to indicate the number of names in the array. The array of strings in names is terminated by a NULL pointer, so it is not necessary to use count to determine when the last name is reached.

    It is the caller's responsibility to free the array. ei_global_names allocates the array and all the strings using a single call to malloc(), so free(names) is all that is necessary.

    To look up one of the names:

    ETERM *pid;
    -char node[256];
    +char node[256];
     erlang_pid the_pid;
     
    -if (ei_global_whereis(&ec,fd,"schedule",&the_pid,node) < 0)
    -   fprintf(stderr, "ei_global_whereis error\n");

    If "schedule" is known to the global module in Kernel, an Erlang pid is +if (ei_global_whereis(&ec,fd,"schedule",&the_pid,node) < 0) + fprintf(stderr, "ei_global_whereis error\n");

    If "schedule" is known to the global module in Kernel, an Erlang pid is /usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/erl_call_cmd.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (769)) --- old//usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/erl_call_cmd.html 2026-06-04 19:05:06.734490127 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/erl_call_cmd.html 2026-06-04 19:05:06.733490118 +0000 @@ -251,8 +251,8 @@ {<madonna@chivas.du.etx.ericsson.se,38,0>, []}]

    To forward standard output without printing the result term (again, the input ends with EOF (Control-D)):

    erl_call -s -e -sname madonna -fetch_stdout -no_result_term
    -io:format("Number of schedulers: ~p~n", [erlang:system_info(schedulers)]),
    -io:format("Number of logical cores: ~p~n", [erlang:system_info(logical_processors_available)]).
    +io:format("Number of schedulers: ~p~n", [erlang:system_info(schedulers)]),
    +io:format("Number of logical cores: ~p~n", [erlang:system_info(logical_processors_available)]).
     ^D
     Number of schedulers: 8
     Number of logical cores: 8
    @@ -306,7 +306,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/erl_interface.epub/OEBPS/content.opf differs (XML 1.0 document, ASCII text) --- old//usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/erl_interface.epub/OEBPS/content.opf 2026-06-04 00:07:53.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/erl_interface.epub/OEBPS/content.opf 2042-07-06 13:27:21.000000000 +0000 @@ -4,10 +4,10 @@ version="3.0"> erl_interface - 5.5.2 - urn:uuid:99b2da86-216b-87d0-ce41-83ce4112f2bc + urn:uuid:efb380b6-85d4-4116-90ab-61d9b6af7445 en - 2026-06-04T00:07:53Z + 2042-07-06T13:27:21Z /usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/erl_interface.epub/OEBPS/ei_connect.xhtml differs (HTML document, ASCII text, with very long lines (3202)) --- old//usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/erl_interface.epub/OEBPS/ei_connect.xhtml 2026-06-04 00:07:53.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/erl_interface-5.5.2/doc/html/erl_interface.epub/OEBPS/ei_connect.xhtml 2042-07-06 13:27:21.000000000 +0000 @@ -146,36 +146,36 @@
    • ei_cnode - Opaque data type representing a C-node. A ei_cnode structure is initialized by calling -ei_connect_init() or friends.

    • ei_socket_callbacks

      typedef struct {
      +ei_connect_init() or friends.

    • ei_socket_callbacks

      typedef struct {
           int flags;
      -    int (*socket)(void **ctx, void *setup_ctx);
      -    int   (*close)(void *ctx);
      -    int (*listen)(void *ctx, void *addr, int *len, int backlog);
      -    int (*accept)(void **ctx, void *addr, int *len, unsigned tmo);
      -    int (*connect)(void *ctx, void *addr, int len, unsigned tmo);
      -    int (*writev)(void *ctx, const void *iov, int iovcnt, ssize_t *len, unsigned tmo);
      -    int (*write)(void *ctx, const char *buf, ssize_t *len, unsigned tmo);
      -    int (*read)(void *ctx, char *buf, ssize_t *len, unsigned tmo);
      -    int (*handshake_packet_header_size)(void *ctx, int *sz);
      -    int (*connect_handshake_complete)(void *ctx);
      -    int (*accept_handshake_complete)(void *ctx);
      -    int (*get_fd)(void *ctx, int *fd);
      -} ei_socket_callbacks;

      Callbacks functions for a + int (*socket)(void **ctx, void *setup_ctx); + int (*close)(void *ctx); + int (*listen)(void *ctx, void *addr, int *len, int backlog); + int (*accept)(void **ctx, void *addr, int *len, unsigned tmo); + int (*connect)(void *ctx, void *addr, int len, unsigned tmo); + int (*writev)(void *ctx, const void *iov, int iovcnt, ssize_t *len, unsigned tmo); + int (*write)(void *ctx, const char *buf, ssize_t *len, unsigned tmo); + int (*read)(void *ctx, char *buf, ssize_t *len, unsigned tmo); + int (*handshake_packet_header_size)(void *ctx, int *sz); + int (*connect_handshake_complete)(void *ctx); + int (*accept_handshake_complete)(void *ctx); + int (*get_fd)(void *ctx, int *fd); +} ei_socket_callbacks;

    Callbacks functions for a User Supplied Socket Implementation. Documentation of each field can be -found in the User Supplied Socket Implementation section above.

  • ErlConnect

    typedef struct {
    -    char ipadr[4]; /* Ip v4 address in network byte order */
    -    char nodename[MAXNODELEN];
    -} ErlConnect;

    IP v4 address and nodename.

  • Erl_IpAddr

    typedef struct {
    +found in the User Supplied Socket Implementation section above.

  • ErlConnect

    typedef struct {
    +    char ipadr[4]; /* Ip v4 address in network byte order */
    +    char nodename[MAXNODELEN];
    +} ErlConnect;

    IP v4 address and nodename.

  • Erl_IpAddr

    typedef struct {
         unsigned s_addr; /* Ip v4 address in network byte order */
    -} Erl_IpAddr;

    IP v4 address.

  • erlang_msg

    typedef struct {
    +} Erl_IpAddr;

    IP v4 address.

  • erlang_msg

    typedef struct {
         long msgtype;
         erlang_pid from;
         erlang_pid to;
    -    char toname[MAXATOMLEN+1];
    -    char cookie[MAXATOMLEN+1];
    +    char toname[MAXATOMLEN+1];
    +    char cookie[MAXATOMLEN+1];
         erlang_trace token;
    -} erlang_msg;

    Information about a message received via +} erlang_msg;

  • Information about a message received via ei_receive_msg() or friends.

    @@ -200,15 +200,15 @@ ei_gethostbyname_r()

    -
    struct hostent * ei_gethostbyaddr(const char *addr, int len, int type);
    struct hostent * ei_gethostbyaddr_r(const char *addr, int length,  int type,
    -  struct hostent *hostp, char *buffer,   int buflen,  int *h_errnop);
    struct hostent * ei_gethostbyname(const char *name);
    struct hostent * ei_gethostbyname_r(const char *name,  struct hostent *hostp,
    -  char *buffer,  int buflen,  int *h_errnop);

    Convenience functions for some common name lookup functions.

    +
    struct hostent * ei_gethostbyaddr(const char *addr, int len, int type);
    struct hostent * ei_gethostbyaddr_r(const char *addr, int length,  int type,
    +  struct hostent *hostp, char *buffer,   int buflen,  int *h_errnop);
    struct hostent * ei_gethostbyname(const char *name);
    struct hostent * ei_gethostbyname_r(const char *name,  struct hostent *hostp,
    +  char *buffer,  int buflen,  int *h_errnop);

    Convenience functions for some common name lookup functions.

    ei_accept()

    -
    int ei_accept(ei_cnode *ec, int listensock, ErlConnect *conp);

    Used by a server process to accept a connection from a client process.

    • ec is the C-node structure.
    • listensock is an open socket descriptor on which listen() has previously +
      int ei_accept(ei_cnode *ec, int listensock, ErlConnect *conp);

      Used by a server process to accept a connection from a client process.

      • ec is the C-node structure.
      • listensock is an open socket descriptor on which listen() has previously been called.
      • conp is a pointer to an ErlConnect struct.

      On success, conp is filled in with the address and node name of the connecting client and a file descriptor is returned. On failure, ERL_ERROR is returned and erl_errno is set to EIO.

      @@ -217,14 +217,14 @@ ei_accept_tmo()

      -
      int ei_accept_tmo(ei_cnode *ec, int listensock, ErlConnect *conp, unsigned timeout_ms);

      Equivalent to ei_accept with an optional time-out argument, see the +

      int ei_accept_tmo(ei_cnode *ec, int listensock, ErlConnect *conp, unsigned timeout_ms);

      Equivalent to ei_accept with an optional time-out argument, see the description at the beginning of this manual page.

      ei_close_connection()

      -
      int ei_close_connection(int fd);

      Closes a previously opened connection or listen socket.

      Available since OTP 21.3

      +
      int ei_close_connection(int fd);

      Closes a previously opened connection or listen socket.

      Available since OTP 21.3

      @@ -248,7 +248,7 @@ ei_xconnect_host_port()

      -
      int ei_connect(ei_cnode* ec, char *nodename);
      int ei_xconnect(ei_cnode* ec, Erl_IpAddr adr, char *alivename);
      int ei_connect_host_port(ei_cnode* ec, char *hostname, int port);
      int ei_xconnect_host_port(ei_cnode* ec, Erl_IpAddr adr, int port);

      Sets up a connection to an Erlang node.

      ei_xconnect() requires the IP address of the remote host and the alive name of +

      int ei_connect(ei_cnode* ec, char *nodename);
      int ei_xconnect(ei_cnode* ec, Erl_IpAddr adr, char *alivename);
      int ei_connect_host_port(ei_cnode* ec, char *hostname, int port);
      int ei_xconnect_host_port(ei_cnode* ec, Erl_IpAddr adr, int port);

      Sets up a connection to an Erlang node.

      ei_xconnect() requires the IP address of the remote host and the alive name of the remote node to be specified. ei_connect() provides an alternative interface and determines the information from the node name provided. The ei_xconnect_host_port() function provides yet another alternative that will @@ -264,12 +264,12 @@ #define IP_ADDR "150.236.14.75" /*** Variant 1 ***/ -int fd = ei_connect(&ec, NODE); +int fd = ei_connect(&ec, NODE); /*** Variant 2 ***/ struct in_addr addr; -addr.s_addr = inet_addr(IP_ADDR); -fd = ei_xconnect(&ec, &addr, ALIVE);

    Available since OTP 23.0

    +addr.s_addr = inet_addr(IP_ADDR); +fd = ei_xconnect(&ec, &addr, ALIVE);

    Available since OTP 23.0

    @@ -293,11 +293,11 @@ ei_connect_xinit_ussi()

    -
    int ei_connect_init(ei_cnode* ec, const char* this_node_name, const char *cookie, unsigned creation);
    int ei_connect_init_ussi(ei_cnode* ec, const char* this_node_name, const char *cookie,
    -  unsigned creation, ei_socket_callbacks *cbs, int cbs_sz, void *setup_context);
    int ei_connect_xinit(ei_cnode* ec, const char *thishostname, const char *thisalivename,
    -  const char *thisnodename, Erl_IpAddr thisipaddr, const char *cookie, unsigned creation);
    int ei_connect_xinit_ussi(ei_cnode* ec, const char *thishostname, const char *thisalivename,
    +
    int ei_connect_init(ei_cnode* ec, const char* this_node_name, const char *cookie, unsigned creation);
    int ei_connect_init_ussi(ei_cnode* ec, const char* this_node_name, const char *cookie,
    +  unsigned creation, ei_socket_callbacks *cbs, int cbs_sz, void *setup_context);
    int ei_connect_xinit(ei_cnode* ec, const char *thishostname, const char *thisalivename,
    +  const char *thisnodename, Erl_IpAddr thisipaddr, const char *cookie, unsigned creation);
    int ei_connect_xinit_ussi(ei_cnode* ec, const char *thishostname, const char *thisalivename,
       const char *thisnodename, Erl_IpAddr thisipaddr, const char *cookie, unsigned creation,
    -  ei_socket_callbacks *cbs, int cbs_sz, void *setup_context);

    Initializes the ec structure, to identify the node name and cookie of the + ei_socket_callbacks *cbs, int cbs_sz, void *setup_context);

    Initializes the ec structure, to identify the node name and cookie of the server. One of them must be called before other functions that works on the ei_cnode type or a file descriptor associated with a connection to another node is used.

    @@ -331,7 +331,7 @@

    • {erl_script_alias, {URLPath, [AllowedModule]}}
      URLPath = string() and AllowedModule = atom(). erl_script_alias marks all URLs matching url-path as erl scheme scripts. A matching URL is mapped -into a specific module and function, for example:

      {erl_script_alias, {"/cgi-bin/example", [httpd_example]}}

      A request to http://your.server.org/cgi-bin/example/httpd_example:yahoo would +into a specific module and function, for example:

      {erl_script_alias, {"/cgi-bin/example", [httpd_example]}}

      A request to http://your.server.org/cgi-bin/example/httpd_example:yahoo would refer to httpd_example:yahoo/3 or, if that does not exist, httpd_example:yahoo/2 and http://your.server.org/cgi-bin/example/other:yahoo would not be allowed to execute.

    • {erl_script_nocache, boolean()}
      If erl_script_nocache is set to true, the server adds HTTP header fields @@ -381,7 +381,7 @@ Authentication Properties - Requires mod_auth -

      {directory, {path(), [{property(), term()}]}}

      The properties for directories are as follows:

      • {allow_from, all | [RegxpHostString]}
        Defines a set of hosts to be granted access to a given directory, for example:

        {allow_from, ["123.34.56.11", "150.100.23"]}

        The host 123.34.56.11 and all machines on the 150.100.23 subnet are +

        {directory, {path(), [{property(), term()}]}}

        The properties for directories are as follows:

        • {allow_from, all | [RegxpHostString]}
          Defines a set of hosts to be granted access to a given directory, for example:

          {allow_from, ["123.34.56.11", "150.100.23"]}

          The host 123.34.56.11 and all machines on the 150.100.23 subnet are allowed access.

        • {deny_from, all | [RegxpHostString]}
          Defines a set of hosts to be denied access to a given directory, for example:

          {deny_from, ["123.34.56.11", "150.100.23"]}

          The host 123.34.56.11 and all machines on the 150.100.23 subnet are not allowed access.

        • {auth_type, plain | dets | mnesia}
          Sets the type of authentication database that is used for the directory. The key difference between the different methods is that dynamic data can be saved @@ -416,7 +416,7 @@ Security Properties - Requires mod_security -

          {security_directory, {path(), [{property(), term()}]}}

          The properties for the security directories are as follows:

          • {data_file, path()}
            Name of the security data file. The filename can either be absolute or +

            {security_directory, {path(), [{property(), term()}]}}

            The properties for the security directories are as follows:

            • {data_file, path()}
              Name of the security data file. The filename can either be absolute or relative to the server_root. This file is used to store persistent data for module mod_security.

            • {max_retries, integer()}
              Specifies the maximum number of attempts to authenticate a user before the user is blocked out. If a user successfully authenticates while blocked, the @@ -433,10 +433,10 @@ Web server API data types -

              The Erlang web server API data types are as follows:

              ModData = #mod{}
              +

              The Erlang web server API data types are as follows:

              ModData = #mod{}
               
              --record(mod, {
              -    data = [],
              +-record(mod, {
              +    data = [],
                   socket_type = ip_comm,
                   socket,
                   config_db,
              @@ -445,10 +445,10 @@
                   request_uri,
                   http_version,
                   request_line,
              -    parsed_header = [],
              +    parsed_header = [],
                   entity_body,
                   connection
              -}).

              To access the record in your callback-module use:

              -include_lib("inets/include/httpd.hrl").

              The fields of record mod have the following meaning:

              • data - Type [{InteractionKey,InteractionValue}] is used to propagate +}).

              To access the record in your callback-module use:

              -include_lib("inets/include/httpd.hrl").

              The fields of record mod have the following meaning:

              • data - Type [{InteractionKey,InteractionValue}] is used to propagate data between modules. Depicted interaction_data() in function type declarations.

              • socket_type - socket_type() indicates whether it is an IP socket or an ssl socket.

              • socket - The socket, in format ip_comm or ssl, depending on @@ -1379,7 +1379,7 @@ Erlang programming language

                -

                Copyright © 1996-2026 Ericsson AB

                +

                Copyright © 1996-2042 Ericsson AB

                /usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/httpd_custom_api.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (320)) --- old//usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/httpd_custom_api.html 2026-06-04 19:05:07.774499774 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/httpd_custom_api.html 2026-06-04 19:05:07.774499774 +0000 @@ -319,7 +319,7 @@ Erlang programming language

                -

                Copyright © 1996-2026 Ericsson AB

                +

                Copyright © 1996-2042 Ericsson AB

                /usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/httpd_socket.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (312)) --- old//usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/httpd_socket.html 2026-06-04 19:05:07.792499941 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/httpd_socket.html 2026-06-04 19:05:07.792499941 +0000 @@ -321,7 +321,7 @@ Erlang programming language

                -

                Copyright © 1996-2026 Ericsson AB

                +

                Copyright © 1996-2042 Ericsson AB

                /usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/httpd_util.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (723)) --- old//usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/httpd_util.html 2026-06-04 19:05:07.814500145 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/httpd_util.html 2026-06-04 19:05:07.815500155 +0000 @@ -989,7 +989,7 @@ Erlang programming language

                -

                Copyright © 1996-2026 Ericsson AB

                +

                Copyright © 1996-2042 Ericsson AB

                /usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/inets.epub/OEBPS/content.opf differs (XML 1.0 document, ASCII text) --- old//usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/inets.epub/OEBPS/content.opf 2026-06-04 00:07:35.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/inets.epub/OEBPS/content.opf 2042-07-06 13:27:03.000000000 +0000 @@ -4,10 +4,10 @@ version="3.0"> inets - 9.3 - urn:uuid:f61277f7-ef5c-cabb-8ccb-8164a56669c2 + urn:uuid:0d00b89f-0546-a789-465d-e823b9107104 en - 2026-06-04T00:07:35Z + 2042-07-06T13:27:03Z /usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/inets.epub/OEBPS/http_client.xhtml differs (HTML document, ASCII text, with very long lines (2281)) --- old//usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/inets.epub/OEBPS/http_client.xhtml 2026-06-04 00:07:35.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/inets.epub/OEBPS/http_client.xhtml 2042-07-06 13:27:03.000000000 +0000 @@ -33,32 +33,32 @@ handle each request, unless a persistent connection can be used with or without pipelining. The client adds a host header and an empty te header if there are no such headers present in the request.

                The client supports IPv6 as long as the underlying mechanisms also do so.

                The following is to be put in the Erlang node application configuration file to -start a profile at application startup:

                [{inets, [{services, [{httpc, PropertyList}]}]}]

                For valid properties, see httpc.

                +start a profile at application startup:

                [{inets, [{services, [{httpc, PropertyList}]}]}]

                For valid properties, see httpc.

                Getting Started

                -

                Start Inets:

                1> inets:start().
                +

                Start Inets:

                1> inets:start().
                 ok

                The following calls use the default client profile. Use the proxy "www-proxy.mycompany.com:8000", except from requests to localhost. This -applies to all the following requests.

                Example:

                2> httpc:set_options([{proxy, {{"www-proxy.mycompany.com", 8000},
                -["localhost"]}}]).
                -ok

                The following is an ordinary synchronous request:

                3> {ok, {{Version, 200, ReasonPhrase}, Headers, Body}} =
                -.. httpc:request(get, {"http://www.erlang.org", []}, [], []).

                With all the default values presented, a get request can also be written as -follows:

                4> {ok, {{Version, 200, ReasonPhrase}, Headers, Body}} =
                -.. httpc:request("http://www.erlang.org").

                The following is a https request and with verification of the host:

                5> {ok, {{Version, 200, ReasonPhrase}, Headers, Body}} =
                -.. httpc:request(get, {"https://www.erlang.org", []}, [{ssl, httpc:ssl_verify_host_options(true)}], []).

                The following is an ordinary asynchronous request:

                6> {ok, RequestId} =
                -.. httpc:request(get, {"http://www.erlang.org", []}, [], [{sync, false}]).

                The result is sent to the calling process as {http, {ReqestId, Result}}.

                In this case, the calling process is the shell, so the following result is -received:

                7> receive {http, {RequestId, Result}} -> ok after 500 -> error end.
                -ok

                This sends a request with a specified connection header:

                8> {ok, {{NewVersion, 200, NewReasonPhrase}, NewHeaders, NewBody}} =
                -.. httpc:request(get, {"http://www.erlang.org", [{"connection", "close"}]},
                -.. [], []).

                This sends an HTTP request over a unix domain socket (experimental):

                9> httpc:set_options([{ipfamily, local}, {unix_socket,"/tmp/unix_socket/consul_http.sock"}]).
                -10> {ok, {{NewVersion, 200, NewReasonPhrase}, NewHeaders, NewBody}} =
                - .. httpc:request(put, {"http:///v1/kv/foo", [], [], "hello"}, [], []).

                Start an HTTP client profile:

                10> {ok, Pid} = inets:start(httpc, [{profile, foo}]).
                -{ok, <0.45.0>}

                The new profile has no proxy settings, so the connection is refused:

                11> httpc:request("http://www.erlang.org", foo).
                -{error, econnrefused}

                Stop the HTTP client profile:

                12> inets:stop(httpc, foo).
                -ok

                Alternative way to stop the HTTP client profile:

                13> inets:stop(httpc, Pid).
                +applies to all the following requests.

                Example:

                2> httpc:set_options([{proxy, {{"www-proxy.mycompany.com", 8000},
                +["localhost"]}}]).
                +ok

                The following is an ordinary synchronous request:

                3> {ok, {{Version, 200, ReasonPhrase}, Headers, Body}} =
                +.. httpc:request(get, {"http://www.erlang.org", []}, [], []).

                With all the default values presented, a get request can also be written as +follows:

                4> {ok, {{Version, 200, ReasonPhrase}, Headers, Body}} =
                +.. httpc:request("http://www.erlang.org").

                The following is a https request and with verification of the host:

                5> {ok, {{Version, 200, ReasonPhrase}, Headers, Body}} =
                +.. httpc:request(get, {"https://www.erlang.org", []}, [{ssl, httpc:ssl_verify_host_options(true)}], []).

                The following is an ordinary asynchronous request:

                6> {ok, RequestId} =
                +.. httpc:request(get, {"http://www.erlang.org", []}, [], [{sync, false}]).

                The result is sent to the calling process as {http, {ReqestId, Result}}.

                In this case, the calling process is the shell, so the following result is +received:

                7> receive {http, {RequestId, Result}} -> ok after 500 -> error end.
                +ok

                This sends a request with a specified connection header:

                8> {ok, {{NewVersion, 200, NewReasonPhrase}, NewHeaders, NewBody}} =
                +.. httpc:request(get, {"http://www.erlang.org", [{"connection", "close"}]},
                +.. [], []).

                This sends an HTTP request over a unix domain socket (experimental):

                9> httpc:set_options([{ipfamily, local}, {unix_socket,"/tmp/unix_socket/consul_http.sock"}]).
                +10> {ok, {{NewVersion, 200, NewReasonPhrase}, NewHeaders, NewBody}} =
                + .. httpc:request(put, {"http:///v1/kv/foo", [], [], "hello"}, [], []).

                Start an HTTP client profile:

                10> {ok, Pid} = inets:start(httpc, [{profile, foo}]).
                +{ok, <0.45.0>}

                The new profile has no proxy settings, so the connection is refused:

                11> httpc:request("http://www.erlang.org", foo).
                +{error, econnrefused}

                Stop the HTTP client profile:

                12> inets:stop(httpc, foo).
                +ok

                Alternative way to stop the HTTP client profile:

                13> inets:stop(httpc, Pid).
                 ok
                /usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/inets.epub/OEBPS/httpc.xhtml differs (HTML document, ASCII text, with very long lines (699)) --- old//usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/inets.epub/OEBPS/httpc.xhtml 2026-06-04 00:07:35.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/inets.epub/OEBPS/httpc.xhtml 2042-07-06 13:27:03.000000000 +0000 @@ -950,13 +950,13 @@ {http, ReplyInfo}.

              • function/1 - Information is delivered to the receiver through calls to the provided fun Receiver(ReplyInfo).

              • {Module, Function, Args} - Information is delivered to the receiver through calls to the callback function -apply(Module, Function, [ReplyInfo | Args]).

              In all of these cases, ReplyInfo has the following structure:

               {RequestId, saved_to_file}
              - {RequestId, {error, Reason}}
              - {RequestId, Result}
              - {RequestId, stream_start, Headers}
              - {RequestId, stream_start, Headers, HandlerPid}
              - {RequestId, stream, BinBodyPart}
              - {RequestId, stream_end, Headers}

              Default is the pid of the process calling the request function (self/0).

            • ipv6_host_with_brackets - Defines when parsing the Host-Port part of an +apply(Module, Function, [ReplyInfo | Args]).

            In all of these cases, ReplyInfo has the following structure:

             {RequestId, saved_to_file}
            + {RequestId, {error, Reason}}
            + {RequestId, Result}
            + {RequestId, stream_start, Headers}
            + {RequestId, stream_start, Headers, HandlerPid}
            + {RequestId, stream, BinBodyPart}
            + {RequestId, stream_end, Headers}

            Default is the pid of the process calling the request function (self/0).

          • ipv6_host_with_brackets - Defines when parsing the Host-Port part of an URI with an IPv6 address with brackets, if those brackets are to be retained (true) or stripped (false).

            Default is false.

          /usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/inets.epub/OEBPS/httpd.xhtml differs (HTML document, ASCII text, with very long lines (2234)) --- old//usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/inets.epub/OEBPS/httpd.xhtml 2026-06-04 00:07:35.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/inets-9.3/doc/html/inets.epub/OEBPS/httpd.xhtml 2042-07-06 13:27:03.000000000 +0000 @@ -131,36 +131,36 @@ level error under the hierarchical logger domain: [otp, inets, httpd, ServerID, error] The built in logger formatting function produces log entries from the error -reports:

          #{server_name => string()
          +reports:

          #{server_name => string()
             protocol => internal | 'TCP' | 'TLS' | 'HTTP',
             transport => "TCP" | "TLS", %% Present when protocol = 'HTTP'
          -  uri => string(), %% Present when protocol = 'HTTP' and URI is valid
          -  peer => inet:peername(),
          -  host => inet:hostname(),
          -  reason => term()
          -}

          An example of a log entry with only default settings of logger

          =ERROR REPORT==== 9-Oct-2019::09:33:27.350235 ===
          +  uri => string(), %% Present when protocol = 'HTTP' and URI is valid
          +  peer => inet:peername(),
          +  host => inet:hostname(),
          +  reason => term()
          +}

          An example of a log entry with only default settings of logger

          =ERROR REPORT==== 9-Oct-2019::09:33:27.350235 ===
              Server: My Server
            Protocol: HTTP
           Transport: TLS
                 URI: /not_there
                Host: 127.0.1.1:80
                Peer: 127.0.0.1:45253
          -   Reason: [{statuscode,404},{description,"Object Not Found"}]

          Using this option makes mod_log and mod_disk_log error logs redundant.

          Add the filter

          {fun logger_filters:domain/2,
          -    {log,equal,[otp,inets, httpd, ServerID, error]}

          to appropriate logger handler to handle the events. For example to write the + Reason: [{statuscode,404},{description,"Object Not Found"}]

          Using this option makes mod_log and mod_disk_log error logs redundant.

          Add the filter

          {fun logger_filters:domain/2,
          +    {log,equal,[otp,inets, httpd, ServerID, error]}

          to appropriate logger handler to handle the events. For example to write the error log from an httpd server with a ServerID of my_server to a file -you can use the following sys.config:

          [{kernel,
          - [{logger,
          -  [{handler, http_error_test, logger_std_h,
          -    #{config => #{ file => "log/http_error.log" },
          -      filters => [{inets_httpd, {fun logger_filters:domain/2,
          -                                 {log, equal,
          -                                  [otp, inets, httpd, my_server, error]
          -                                 }}}],
          -      filter_default => stop }}]}]}].

          or if you want to add it to the default logger via an API:

          logger:add_handler_filter(default,
          +you can use the following sys.config:

          [{kernel,
          + [{logger,
          +  [{handler, http_error_test, logger_std_h,
          +    #{config => #{ file => "log/http_error.log" },
          +      filters => [{inets_httpd, {fun logger_filters:domain/2,
          +                                 {log, equal,
          +                                  [otp, inets, httpd, my_server, error]
          +                                 }}}],
          +      filter_default => stop }}]}]}].

          or if you want to add it to the default logger via an API:

          logger:add_handler_filter(default,
                                     inets_httpd,
          -                          {fun logger_filters:domain/2,
          -                           {log, equal,
          -                            [otp, inets, httpd, my_server, error]}}).
      • {log_format, common | combined}
        Defines if access logs are to be written according to the common log format + {fun logger_filters:domain/2, + {log, equal, + [otp, inets, httpd, my_server, error]}}).

    • {log_format, common | combined}
      Defines if access logs are to be written according to the common log format or the extended common log format. The common format is one line looking like this: remotehost rfc931 authuser [date] "request" status bytes.

      Here:

      • remotehost - Remote.

      • rfc931 - The remote username of the client (RFC 931).

      • authuser - The username used for authentication.

      • [date] - Date and time of the request @@ -170,7 +170,7 @@ remotehost rfc931 authuser [date] "request" status bytes "referer" "user_agent"

        In addition to the earlier:

        • "referer" - The URL the client was on before requesting the URL (if it could not be determined, a minus sign is placed in this field).

        • "user_agent" - The software the client claims to be using (if it could not be determined, a minus sign is placed in this field).

        This affects the access logs written by mod_log and mod_disk_log.

      • {error_log_format, pretty | compact}
        Default is pretty. If the error log is meant to be read directly by a human, -pretty is the best option.

        pretty has a format corresponding to:

        io:format("[~s] ~s, reason: ~n ~p ~n~n", [Date, Msg, Reason]).

        compact has a format corresponding to:

        io:format("[~s] ~s, reason: ~w ~n", [Date, Msg, Reason]).

        This affects the error logs written by mod_log and mod_disk_log.

      +pretty is the best option.

      pretty has a format corresponding to:

      io:format("[~s] ~s, reason: ~n ~p ~n~n", [Date, Msg, Reason]).

      compact has a format corresponding to:

      io:format("[~s] ~s, reason: ~w ~n", [Date, Msg, Reason]).

      This affects the error logs written by mod_log and mod_disk_log.

    @@ -179,15 +179,15 @@
    • {alias, {Alias, RealName}}
      Alias = string() and RealName = string(). alias allows documents to be stored in the local file system instead of the document_root location. URLs with a path beginning with url-path is mapped to local files beginning with -directory-filename, for example:

      {alias, {"/image", "/ftp/pub/image"}}

      Access to http://your.server.org/image/foo.gif would refer to the file +directory-filename, for example:

      {alias, {"/image", "/ftp/pub/image"}}

      Access to http://your.server.org/image/foo.gif would refer to the file /ftp/pub/image/foo.gif.

    • {re_write, {Re, Replacement}}
      Re = string() and Replacement = string(). re_write allows documents to be stored in the local file system instead of the document_root location. URLs are rewritten by re:replace/3 to produce a path in the local -file-system, for example:

      {re_write, {"^/[~]([^/]+)(.*)$", "/home/\\1/public\\2"}}

      Access to http://your.server.org/~bob/foo.gif would refer to the file +file-system, for example:

      {re_write, {"^/[~]([^/]+)(.*)$", "/home/\\1/public\\2"}}

      Access to http://your.server.org/~bob/foo.gif would refer to the file /home/bob/public/foo.gif.

    • {directory_index, [string()]}
      directory_index specifies a list of resources to look for if a client requests a directory using a / at the end of the directory name. file depicts the name of a file in the directory. Several files can be given, in -which case the server returns the first it finds, for example:

      {directory_index, ["index.html", "welcome.html"]}

      Access to http://your.server.org/docs/ would return +which case the server returns the first it finds, for example:

      {directory_index, ["index.html", "welcome.html"]}

      Access to http://your.server.org/docs/ would return http://your.server.org/docs/index.html or http://your.server.org/docs/welcome.html if index.html does not exist.

    @@ -218,7 +218,7 @@ method. The method is either GET or POST, as defined in RFC 1945. It propagates the URL and file path of the requested document using the standard CGI PATH_INFO and -PATH_TRANSLATED environment variables.

    Example:

    {script, {"PUT", "/cgi-bin/put"}}

    +PATH_TRANSLATED environment variables.

    Example:

    {script, {"PUT", "/cgi-bin/put"}}

    @@ -226,7 +226,7 @@

    • {erl_script_alias, {URLPath, [AllowedModule]}}
      URLPath = string() and AllowedModule = atom(). erl_script_alias marks all URLs matching url-path as erl scheme scripts. A matching URL is mapped -into a specific module and function, for example:

      {erl_script_alias, {"/cgi-bin/example", [httpd_example]}}

      A request to http://your.server.org/cgi-bin/example/httpd_example:yahoo would +into a specific module and function, for example:

      {erl_script_alias, {"/cgi-bin/example", [httpd_example]}}

      A request to http://your.server.org/cgi-bin/example/httpd_example:yahoo would refer to httpd_example:yahoo/3 or, if that does not exist, httpd_example:yahoo/2 and http://your.server.org/cgi-bin/example/other:yahoo would not be allowed to execute.

    • {erl_script_nocache, boolean()}
      If erl_script_nocache is set to true, the server adds HTTP header fields @@ -276,7 +276,7 @@ Authentication Properties - Requires mod_auth

    -

    {directory, {path(), [{property(), term()}]}}

    The properties for directories are as follows:

  • {sctp_events, #sctp_event_subscribe{}}

    #sctp_event_subscribe{
             data_io_event          = true | false,
             association_event      = true | false,
             address_event          = true | false,
    @@ -183,42 +183,42 @@
             shutdown_event         = true | false,
             partial_delivery_event = true | false,
             adaptation_layer_event = true | false
    -}

    This option determines which SCTP Events that are to be +}

    This option determines which SCTP Events that are to be received (through recv/*) along with the data. The only exception is data_io_event, which enables or disables receiving of #sctp_sndrcvinfo{} ancillary data, not events. By default, all flags except adaptation_layer_event are enabled, although sctp_data_io_event and association_event are used by the driver -itself and not exported to the user level.

  • {sctp_delayed_ack_time, #sctp_assoc_value{}}

    #sctp_assoc_value{
    -      assoc_id    = assoc_id(),
    -      assoc_value = integer()
    -}

    Rarely used. Determines the ACK time (specified by assoc_value, in +itself and not exported to the user level.

  • {sctp_delayed_ack_time, #sctp_assoc_value{}}

    #sctp_assoc_value{
    +      assoc_id    = assoc_id(),
    +      assoc_value = integer()
    +}

    Rarely used. Determines the ACK time (specified by assoc_value, in milliseconds) for the specified association or the whole endpoint if -assoc_value = 0 (default).

  • {sctp_status, #sctp_status{}}

    #sctp_status{
    -      assoc_id            = assoc_id(),
    -      state               = atom(),
    -      rwnd                = integer(),
    -      unackdata           = integer(),
    -      penddata            = integer(),
    -      instrms             = integer(),
    -      outstrms            = integer(),
    -      fragmentation_point = integer(),
    -      primary             = #sctp_paddrinfo{}
    -}

    This option is read-only. It determines the status of the SCTP association +assoc_value = 0 (default).

  • {sctp_status, #sctp_status{}}

    #sctp_status{
    +      assoc_id            = assoc_id(),
    +      state               = atom(),
    +      rwnd                = integer(),
    +      unackdata           = integer(),
    +      penddata            = integer(),
    +      instrms             = integer(),
    /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/gen_tcp.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (898))
    --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/gen_tcp.xhtml	2026-06-04 00:07:21.000000000 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/gen_tcp.xhtml	2042-07-06 13:26:49.000000000 +0000
    @@ -25,27 +25,27 @@
           

    Interface to TCP/IP sockets.

    This module provides functions for communicating over TCP/IP protocol sockets.

    The following code fragment is a simple example of a client connecting to a -server at port 5678, transferring a binary, and closing the connection:

    client() ->
    +server at port 5678, transferring a binary, and closing the connection:

    client() ->
         SomeHostInNet = "localhost", % to make it runnable on one machine
    -    {ok, Sock} = gen_tcp:connect(SomeHostInNet, 5678,
    -                                 [binary, {packet, 0}]),
    -    ok = gen_tcp:send(Sock, "Some Data"),
    -    ok = gen_tcp:close(Sock).

    At the other end, a server is listening on port 5678, accepts the connection, -and receives the binary:

    server() ->
    -    {ok, LSock} = gen_tcp:listen(5678, [binary, {packet, 0},
    -                                        {active, false}]),
    -    {ok, Sock} = gen_tcp:accept(LSock),
    -    {ok, Bin} = do_recv(Sock, []),
    -    ok = gen_tcp:close(Sock),
    -    ok = gen_tcp:close(LSock),
    +    {ok, Sock} = gen_tcp:connect(SomeHostInNet, 5678,
    +                                 [binary, {packet, 0}]),
    +    ok = gen_tcp:send(Sock, "Some Data"),
    +    ok = gen_tcp:close(Sock).

    At the other end, a server is listening on port 5678, accepts the connection, +and receives the binary:

    server() ->
    +    {ok, LSock} = gen_tcp:listen(5678, [binary, {packet, 0},
    +                                        {active, false}]),
    +    {ok, Sock} = gen_tcp:accept(LSock),
    +    {ok, Bin} = do_recv(Sock, []),
    +    ok = gen_tcp:close(Sock),
    +    ok = gen_tcp:close(LSock),
         Bin.
     
    -do_recv(Sock, Bs) ->
    -    case gen_tcp:recv(Sock, 0) of
    -        {ok, B} ->
    -            do_recv(Sock, [Bs, B]);
    -        {error, closed} ->
    -            {ok, list_to_binary(Bs)}
    +do_recv(Sock, Bs) ->
    +    case gen_tcp:recv(Sock, 0) of
    +        {ok, B} ->
    +            do_recv(Sock, [Bs, B]);
    +        {error, closed} ->
    +            {ok, list_to_binary(Bs)}
         end.

    For more examples, see section Examples.

    Note

    Functions that create sockets can take an optional option; {inet_backend, Backend} that, if specified, has to be the first option. This selects the implementation backend towards the platform's socket API.

    This is a temporary option that will be ignored in a future release.

    The default is Backend = inet that selects the traditional inet_drv.c @@ -84,48 +84,48 @@ a single listening socket. Function start/2 takes the number of worker processes and the port number on which to listen for incoming connections. If LPort is specified as 0, an ephemeral port number is used, which is why the -start function returns the actual port number allocated:

    start(Num,LPort) ->
    -    case gen_tcp:listen(LPort,[{active, false},{packet,2}]) of
    -        {ok, ListenSock} ->
    -            start_servers(Num,ListenSock),
    -            {ok, Port} = inet:port(ListenSock),
    +start function returns the actual port number allocated:

    start(Num,LPort) ->
    +    case gen_tcp:listen(LPort,[{active, false},{packet,2}]) of
    +        {ok, ListenSock} ->
    +            start_servers(Num,ListenSock),
    +            {ok, Port} = inet:port(ListenSock),
                 Port;
    -        {error,Reason} ->
    -            {error,Reason}
    +        {error,Reason} ->
    +            {error,Reason}
         end.
     
    -start_servers(0,_) ->
    +start_servers(0,_) ->
         ok;
    -start_servers(Num,LS) ->
    -    spawn(?MODULE,server,[LS]),
    -    start_servers(Num-1,LS).
    +start_servers(Num,LS) ->
    +    spawn(?MODULE,server,[LS]),
    +    start_servers(Num-1,LS).
     
    -server(LS) ->
    -    case gen_tcp:accept(LS) of
    -        {ok,S} ->
    -            loop(S),
    -            server(LS);
    +server(LS) ->
    +    case gen_tcp:accept(LS) of
    +        {ok,S} ->
    +            loop(S),
    +            server(LS);
             Other ->
    -            io:format("accept returned ~w - goodbye!~n",[Other]),
    +            io:format("accept returned ~w - goodbye!~n",[Other]),
                 ok
         end.
     
    -loop(S) ->
    -    inet:setopts(S,[{active,once}]),
    +loop(S) ->
    +    inet:setopts(S,[{active,once}]),
         receive
    -        {tcp,S,Data} ->
    -            Answer = process(Data), % Not implemented in this example
    -            gen_tcp:send(S,Answer),
    -            loop(S);
    -        {tcp_closed,S} ->
    -            io:format("Socket ~w closed [~w]~n",[S,self()]),
    +        {tcp,S,Data} ->
    +            Answer = process(Data), % Not implemented in this example
    +            gen_tcp:send(S,Answer),
    +            loop(S);
    +        {tcp_closed,S} ->
    +            io:format("Socket ~w closed [~w]~n",[S,self()]),
                 ok
    -    end.

    Example of a simple client:

    client(PortNo,Message) ->
    -    {ok,Sock} = gen_tcp:connect("localhost",PortNo,[{active,false},
    -                                                    {packet,2}]),
    -    gen_tcp:send(Sock,Message),
    -    A = gen_tcp:recv(Sock,0),
    -    gen_tcp:close(Sock),
    +    end.

    Example of a simple client:

    client(PortNo,Message) ->
    +    {ok,Sock} = gen_tcp:connect("localhost",PortNo,[{active,false},
    +                                                    {packet,2}]),
    +    gen_tcp:send(Sock,Message),
    +    A = gen_tcp:recv(Sock,0),
    +    gen_tcp:close(Sock),
         A.

    The send call does not accept a time-out option because time-outs on send is handled through socket option send_timeout. The behavior of a send operation with no receiver is mainly defined by the underlying TCP stack and the network @@ -135,32 +135,32 @@ does not get any acknowledge for each message it sends, but has to rely on the send time-out option to detect that the other end is unresponsive. Option send_timeout can be used when connecting:

    ...
    -{ok,Sock} = gen_tcp:connect(HostAddress, Port,
    -                            [{active,false},
    -                             {send_timeout, 5000},
    -                             {packet,2}]),
    -                loop(Sock), % See below
    -...

    In the loop where requests are handled, send time-outs can now be detected:

    loop(Sock) ->
    +{ok,Sock} = gen_tcp:connect(HostAddress, Port,
    +                            [{active,false},
    +                             {send_timeout, 5000},
    +                             {packet,2}]),
    +                loop(Sock), % See below
    +...

    In the loop where requests are handled, send time-outs can now be detected:

    loop(Sock) ->
         receive
    -        {Client, send_data, Binary} ->
    -            case gen_tcp:send(Sock,[Binary]) of
    -                {error, timeout} ->
    -                    io:format("Send timeout, closing!~n",
    -                              []),
    -                    handle_send_timeout(), % Not implemented here
    -                    Client ! {self(),{error_sending, timeout}},
    +        {Client, send_data, Binary} ->
    +            case gen_tcp:send(Sock,[Binary]) of
    +                {error, timeout} ->
    +                    io:format("Send timeout, closing!~n",
    +                              []),
    +                    handle_send_timeout(), % Not implemented here
    +                    Client ! {self(),{error_sending, timeout}},
                         %% Usually, it's a good idea to give up in case of a
                         %% send timeout, as you never know how much actually
                         %% reached the server, maybe only a packet header?!
    -                    gen_tcp:close(Sock);
    -                {error, OtherSendError} ->
    -                    io:format("Some other error on socket (~p), closing",
    -                              [OtherSendError]),
    -                    Client ! {self(),{error_sending, OtherSendError}},
    -                    gen_tcp:close(Sock);
    +                    gen_tcp:close(Sock);
    +                {error, OtherSendError} ->
    +                    io:format("Some other error on socket (~p), closing",
    +                              [OtherSendError]),
    +                    Client ! {self(),{error_sending, OtherSendError}},
    +                    gen_tcp:close(Sock);
                     ok ->
    -                    Client ! {self(), data_sent},
    -                    loop(Sock)
    +                    Client ! {self(), data_sent},
    +                    loop(Sock)
                 end
         end.

    Usually it suffices to detect time-outs on receive, as most protocols include some sort of acknowledgment from the server, but if the protocol is strictly one /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/gen_udp.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (770)) --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/gen_udp.xhtml 2026-06-04 00:07:21.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/gen_udp.xhtml 2042-07-06 13:26:49.000000000 +0000 @@ -839,8 +839,8 @@ Leaves a multicast group.

  • option/0 - See inet:setopts/2.

  • UDP packets are sent with this socket using send(Socket, ...). When UDP packets arrive to the Socket's UDP port, and the socket is in an active mode, the packets are delivered as messages to the -controlling process (socket owner):

    {udp, Socket, PeerIP, PeerPort, Packet} % Without ancillary data
    -{udp, Socket, PeerIP, PeerPort, AncData, Packet} % With ancillary data

    PeerIP and PeerPort are the address from which Packet was sent. +controlling process (socket owner):

    {udp, Socket, PeerIP, PeerPort, Packet} % Without ancillary data
    +{udp, Socket, PeerIP, PeerPort, AncData, Packet} % With ancillary data

    PeerIP and PeerPort are the address from which Packet was sent. Packet is a list of bytes ([byte/0] if option list is active and a binary/0 if option binaryis active (they are mutually exclusive).

    The message contains an AncData field only if any of the socket @@ -848,8 +848,8 @@ recvtclass or recvttl are active.

    When a socket in {active, N} mode (see inet:setopts/2 for details), transitions to passive ({active, false}) mode (N counts down to 0), -the controlling process is notified by a message on this form:

    {udp_passive, Socket}

    If the OS protocol stack reports an error for the socket, the following -message is sent to the controlling process:

    {udp_error, Socket, Reason}

    Reason is mostly a POSIX Error Code.

    If the socket is in passive mode (not in an active mode), received data +the controlling process is notified by a message on this form:

    {udp_passive, Socket}

    If the OS protocol stack reports an error for the socket, the following +message is sent to the controlling process:

    {udp_error, Socket, Reason}

    Reason is mostly a POSIX Error Code.

    If the socket is in passive mode (not in an active mode), received data can be retrieved with therecv/2,3](recv/2) calls. Note that incoming UDP packets that are longer than the receive buffer option specifies can be truncated without warning.

    The default value for the receive buffer option is {recbuf, 8192}.

    /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/global_group.xhtml differs (HTML document, ASCII text, with very long lines (727)) --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/global_group.xhtml 2026-06-04 00:07:21.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/global_group.xhtml 2042-07-06 13:26:49.000000000 +0000 @@ -27,7 +27,7 @@ groups. Each global group has its own global namespace, see global.

    The main advantage of dividing systems into global groups is that the background load decreases while the number of nodes to be updated is reduced when manipulating globally registered names.

    The Kernel configuration parameter global_groups -defines the global groups:

    {global_groups, [GroupTuple :: group_tuple()]}

    For the processes and nodes to run smoothly using the global group +defines the global groups:

    {global_groups, [GroupTuple :: group_tuple()]}

    For the processes and nodes to run smoothly using the global group functionality, the following criteria must be met:

    • An instance of the global group server, global_group, must be running on each node. The processes are automatically started and synchronized when a node is started.
    • All involved nodes must agree on the global group definition, otherwise the /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/inet_res.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (1007)) --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/inet_res.xhtml 2026-06-04 00:07:21.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/inet_res.xhtml 2042-07-06 13:26:49.000000000 +0000 @@ -74,15 +74,15 @@ Example

      This access functions example shows how lookup/3 can be implemented using -resolve/3 from outside the module:

      example_lookup(Name, Class, Type) ->
      -    case inet_res:resolve(Name, Class, Type) of
      -        {ok,Msg} ->
      -            [inet_dns:rr(RR, data)
      -             || RR <- inet_dns:msg(Msg, anlist),
      -                 inet_dns:rr(RR, type) =:= Type,
      -                 inet_dns:rr(RR, class) =:= Class];
      -        {error,_} ->
      -            []
      +resolve/3 from outside the module:

      example_lookup(Name, Class, Type) ->
      +    case inet_res:resolve(Name, Class, Type) of
      +        {ok,Msg} ->
      +            [inet_dns:rr(RR, data)
      +             || RR <- inet_dns:msg(Msg, anlist),
      +                 inet_dns:rr(RR, type) =:= Type,
      +                 inet_dns:rr(RR, class) =:= Class];
      +        {error,_} ->
      +            []
            end.
      @@ -478,57 +478,57 @@

      A DNS message.

      This is the start of a hierarchy of opaque data structures that can be examined with access functions in inet_dns, which return lists of {Field,Value} tuples. The arity 2 functions return the value -for a specified field.

      dns_msg() = DnsMsg
      -    inet_dns:msg(DnsMsg) ->
      -        [ {header, dns_header()}
      -        | {qdlist, dns_query()}
      -        | {anlist, dns_rr()}
      -        | {nslist, dns_rr()}
      -        | {arlist, dns_rr()} ]
      -    inet_dns:msg(DnsMsg, header) -> dns_header() % for example
      -    inet_dns:msg(DnsMsg, Field) -> Value
      -
      -dns_header() = DnsHeader
      -    inet_dns:header(DnsHeader) ->
      -        [ {id, integer()}
      -        | {qr, boolean()}
      -        | {opcode, query | iquery | status | integer()}
      -        | {aa, boolean()}
      -        | {tc, boolean()}
      -        | {rd, boolean()}
      -        | {ra, boolean()}
      -        | {pr, boolean()}
      -        | {rcode, integer(0..16)} ]
      -    inet_dns:header(DnsHeader, Field) -> Value
      -
      -query_type() = axfr | mailb | maila | any | dns_rr_type()
      -
      -dns_query() = DnsQuery
      -    inet_dns:dns_query(DnsQuery) ->
      -        [ {domain, dns_name()}
      -        | {type, query_type()}
      -        | {class, dns_class()} ]
      -    inet_dns:dns_query(DnsQuery, Field) -> Value
      -
      -dns_rr() = DnsRr
      -    inet_dns:rr(DnsRr) -> DnsRrFields | DnsRrOptFields
      -    DnsRrFields = [ {domain, dns_name()}
      -                  | {type, dns_rr_type()}
      -                  | {class, dns_class()}
      -                  | {ttl, integer()}
      -                  | {data, dns_data()} ]
      -    DnsRrOptFields = [ {domain, dns_name()}
      -                     | {type, opt}
      -                     | {udp_payload_size, integer()}
      -                     | {ext_rcode, integer()}
      -                     | {version, integer()}
      -                     | {z, integer()}
      -                     | {data, dns_data()} ]
      -    inet_dns:rr(DnsRr, Field) -> Value

      There is an information function for the types above:

      inet_dns:record_type(dns_msg()) -> msg;
      -inet_dns:record_type(dns_header()) -> header;
      -inet_dns:record_type(dns_query()) -> dns_query;
      -inet_dns:record_type(dns_rr()) -> rr;
      -inet_dns:record_type(_) -> undefined.

      So, inet_dns:(inet_dns:record_type(X))(X) converts any of these data +for a specified field.

      dns_msg() = DnsMsg
      +    inet_dns:msg(DnsMsg) ->
      +        [ {header, dns_header()}
      +        | {qdlist, dns_query()}
      +        | {anlist, dns_rr()}
      +        | {nslist, dns_rr()}
      +        | {arlist, dns_rr()} ]
      +    inet_dns:msg(DnsMsg, header) -> dns_header() % for example
      +    inet_dns:msg(DnsMsg, Field) -> Value
      +
      +dns_header() = DnsHeader
      +    inet_dns:header(DnsHeader) ->
      +        [ {id, integer()}
      +        | {qr, boolean()}
      +        | {opcode, query | iquery | status | integer()}
      +        | {aa, boolean()}
      +        | {tc, boolean()}
      +        | {rd, boolean()}
      +        | {ra, boolean()}
      +        | {pr, boolean()}
      +        | {rcode, integer(0..16)} ]
      +    inet_dns:header(DnsHeader, Field) -> Value
      +
      +query_type() = axfr | mailb | maila | any | dns_rr_type()
      +
      +dns_query() = DnsQuery
      +    inet_dns:dns_query(DnsQuery) ->
      +        [ {domain, dns_name()}
      +        | {type, query_type()}
      +        | {class, dns_class()} ]
      +    inet_dns:dns_query(DnsQuery, Field) -> Value
      +
      +dns_rr() = DnsRr
      +    inet_dns:rr(DnsRr) -> DnsRrFields | DnsRrOptFields
      +    DnsRrFields = [ {domain, dns_name()}
      +                  | {type, dns_rr_type()}
      +                  | {class, dns_class()}
      +                  | {ttl, integer()}
      +                  | {data, dns_data()} ]
      +    DnsRrOptFields = [ {domain, dns_name()}
      +                     | {type, opt}
      +                     | {udp_payload_size, integer()}
      +                     | {ext_rcode, integer()}
      +                     | {version, integer()}
      +                     | {z, integer()}
      +                     | {data, dns_data()} ]
      +    inet_dns:rr(DnsRr, Field) -> Value

      There is an information function for the types above:

      inet_dns:record_type(dns_msg()) -> msg;
      +inet_dns:record_type(dns_header()) -> header;
      +inet_dns:record_type(dns_query()) -> dns_query;
      +inet_dns:record_type(dns_rr()) -> rr;
      +inet_dns:record_type(_) -> undefined.

      So, inet_dns:(inet_dns:record_type(X))(X) converts any of these data structures into a {Field,Value} list.

      /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/inet.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (9617)) --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/inet.xhtml 2026-06-04 00:07:21.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/inet.xhtml 2042-07-06 13:26:49.000000000 +0000 @@ -46,19 +46,19 @@ or as a tuple {150, 236, 20, 73}.

      IPv4 address examples:

      Address          ip_address()
       -------          ------------
       127.0.0.1        {127,0,0,1}
      -192.168.42.2     {192,168,42,2}

      IPv6 address examples:

      Address          ip_address()
      +192.168.42.2     {192,168,42,2}

      IPv6 address examples:

      Address          ip_address()
       -------          ------------
      -::1             {0,0,0,0,0,0,0,1}
      -::192.168.42.2  {0,0,0,0,0,0,(192 bsl 8) bor 168,(42 bsl 8) bor 2}
      +::1             {0,0,0,0,0,0,0,1}
      +::192.168.42.2  {0,0,0,0,0,0,(192 bsl 8) bor 168,(42 bsl 8) bor 2}
       ::FFFF:192.168.42.2
      -                {0,0,0,0,0,16#FFFF,(192 bsl 8) bor 168,(42 bsl 8) bor 2}
      +                {0,0,0,0,0,16#FFFF,(192 bsl 8) bor 168,(42 bsl 8) bor 2}
       3ffe:b80:1f8d:2:204:acff:fe17:bf38
      -                {16#3ffe,16#b80,16#1f8d,16#2,16#204,16#acff,16#fe17,16#bf38}
      +                {16#3ffe,16#b80,16#1f8d,16#2,16#204,16#acff,16#fe17,16#bf38}
       fe80::204:acff:fe17:bf38
      -                {16#fe80,0,0,0,16#204,16#acff,16#fe17,16#bf38}

      Function parse_address/1 can be useful:

      1> inet:parse_address("192.168.42.2").
      -{ok,{192,168,42,2}}
      -2> inet:parse_address("::FFFF:192.168.42.2").
      -{ok,{0,0,0,0,0,65535,49320,10754}}

      + {16#fe80,0,0,0,16#204,16#acff,16#fe17,16#bf38}

      Function parse_address/1 can be useful:

      1> inet:parse_address("192.168.42.2").
      +{ok,{192,168,42,2}}
      +2> inet:parse_address("::FFFF:192.168.42.2").
      +{ok,{0,0,0,0,0,65535,49320,10754}}

      @@ -849,7 +849,7 @@

      A record describing a host; name and address.

      Corresponds to the C: struct hostent as returned by for example -gethostbyname(3).

      The record is defined in the Kernel include file "inet.hrl".

      Add the following directive to the module:

      -include_lib("kernel/include/inet.hrl").
      +gethostbyname(3).

      The record is defined in the Kernel include file "inet.hrl".

      Add the following directive to the module:

      -include_lib("kernel/include/inet.hrl").
      @@ -2001,8 +2001,8 @@ this information, you need to know the following:

      • The numeric value of protocol level IPPROTO_TCP
      • The numeric value of option TCP_INFO
      • The size of struct tcp_info
      • The size and offset of the specific field

      By inspecting the headers or writing a small C program, it is found that IPPROTO_TCP is 6, TCP_INFO is 11, the structure size is 92 (bytes), the offset of tcpi_sacked is 28 bytes, and the value is a 32-bit integer. The -following code can be used to retrieve the value:

      get_tcpi_sacked(Sock) ->
      -    {ok,[{raw,_,_,Info}]} = inet:getopts(Sock,[{raw,6,11,92}]),
      +following code can be used to retrieve the value:

      get_tcpi_sacked(Sock) ->
      +    {ok,[{raw,_,_,Info}]} = inet:getopts(Sock,[{raw,6,11,92}]),
           <<_:28/binary,TcpiSacked:32/native,_/binary>> = Info,
           TcpiSacked.

      Preferably, you would check the machine type, the operating system, and the Kernel version before executing anything similar to this code.

      @@ -2354,7 +2354,7 @@

      Start a socket monitor.

      If the Socket to monitor doesn't exist or when the monitor is triggered, -a 'DOWN' message is sent that has the following pattern:

      	    {'DOWN', MonitorRef, Type, Object, Info}
      • MonitorRef - The return value from this function.

      • Type - The type of socket, can be one of the following +a 'DOWN' message is sent that has the following pattern:

        	    {'DOWN', MonitorRef, Type, Object, Info}
        • MonitorRef - The return value from this function.

        • Type - The type of socket, can be one of the following atom/0s: port or socket.

        • Object - The monitored entity, the socket, which triggered the event.

        • Info - Either the termination reason of the socket or nosock (the Socket did not exist when this function was called).

        Making several calls to inet:monitor/1 for the same Socket is not an error; one monitor is created per call.

        The monitor is triggered when the socket is closed in any way such as /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/logger_chapter.xhtml differs (HTML document, ASCII text, with very long lines (1531)) --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/logger_chapter.xhtml 2026-06-04 00:07:21.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/logger_chapter.xhtml 2042-07-06 13:26:49.000000000 +0000 @@ -85,7 +85,7 @@

        The API for logging consists of a set of macros, and a set of functions on the form logger:Level/1,2,3, which are all shortcuts for logger:log(Level,Arg1[,Arg2[,Arg3]]).

        The macros are defined in logger.hrl, which is included in a module with the -directive

        -include_lib("kernel/include/logger.hrl").

        The difference between using the macros and the exported functions is that +directive

        -include_lib("kernel/include/logger.hrl").

        The difference between using the macros and the exported functions is that macros add location (originator) information to the metadata, and performs lazy evaluation by wrapping the logger call in a case statement, so it is only evaluated if the log level of the event passes the primary log level check.

        @@ -107,23 +107,23 @@

        The log message contains the information to be logged. The message can consist of a format string and arguments (given as two separate parameters in the Logger -API), a string or a report.

        Example, format string and arguments:

        logger:error("The file does not exist: ~ts",[Filename])

        Example, string:

        logger:notice("Something strange happened!")

        A report, which is either a map or a key-value list, is the preferred way to log +API), a string or a report.

        Example, format string and arguments:

        logger:error("The file does not exist: ~ts",[Filename])

        Example, string:

        logger:notice("Something strange happened!")

        A report, which is either a map or a key-value list, is the preferred way to log using Logger as it makes it possible for different backends to filter and format -the log event as it needs to.

        Example, report:

        ?LOG_ERROR(#{ user => joe, filename => Filename, reason => enoent })

        Reports can be accompanied by a report callback specified in the log event's +the log event as it needs to.

        Example, report:

        ?LOG_ERROR(#{ user => joe, filename => Filename, reason => enoent })

        Reports can be accompanied by a report callback specified in the log event's metadata. The report callback is a convenience function that the formatter can use to convert the report to a format string and arguments, or directly to a string. The formatter can also use its own conversion function, if no callback is provided, or if a customized formatting is desired.

        The report callback must be a fun with one or two arguments. If it takes one argument, this is the report itself, and the fun returns a format string and -arguments:

        fun((logger:report()) -> {io:format(),[term()]})

        If it takes two arguments, the first is the report, and the second is a map -containing extra data that allows direct conversion to a string:

        fun((logger:report(),logger:report_cb_config()) -> unicode:chardata())

        The fun must obey the depth and chars_limit parameters provided in the +arguments:

        fun((logger:report()) -> {io:format(),[term()]})

        If it takes two arguments, the first is the report, and the second is a map +containing extra data that allows direct conversion to a string:

        fun((logger:report(),logger:report_cb_config()) -> unicode:chardata())

        The fun must obey the depth and chars_limit parameters provided in the second argument, as the formatter cannot do anything useful of these parameters with the returned string. The extra data also contains a field named single_line, indicating if the printed log message may contain line breaks or not. This variant is used when the formatting of the report depends on the size -or single line parameters.

        Example, report, and metadata with report callback:

        logger:debug(#{got => connection_request, id => Id, state => State},
        -             #{report_cb => fun(R) -> {"~p",[R]} end})

        The log message can also be provided through a fun for lazy evaluation. The fun +or single line parameters.

        Example, report, and metadata with report callback:

        logger:debug(#{got => connection_request, id => Id, state => State},
        +             #{report_cb => fun(R) -> {"~p",[R]} end})

        The log message can also be provided through a fun for lazy evaluation. The fun is only evaluated if the primary log level check passes, and is therefore recommended if it is expensive to generate the message. The lazy fun must return a string, a report, or a tuple with format string and arguments.

        @@ -311,14 +311,14 @@ allows another application to add its own default handler.

        Only one entry of this type is allowed.

      • {handler, HandlerId, Module, HandlerConfig} - If HandlerId is default, then this entry modifies the default handler, equivalent to calling

                logger:remove_handler(default)
        -

        followed by

                logger:add_handler(default, Module, HandlerConfig)
        +

        followed by

                logger:add_handler(default, Module, HandlerConfig)
         

        For all other values of HandlerId, this entry adds a new handler, -equivalent to calling

                logger:add_handler(HandlerId, Module, HandlerConfig)
        +equivalent to calling

                logger:add_handler(HandlerId, Module, HandlerConfig)
         

        Multiple entries of this type are allowed.

      • {filters, FilterDefault, [Filter]} - Adds the specified primary -filters.

        • FilterDefault = log | stop

        • Filter = {FilterId, {FilterFun, FilterConfig}}

        Equivalent to calling

                logger:add_primary_filter(FilterId, {FilterFun, FilterConfig})
        +filters.

        • FilterDefault = log | stop

        • Filter = {FilterId, {FilterFun, FilterConfig}}

        Equivalent to calling

                logger:add_primary_filter(FilterId, {FilterFun, FilterConfig})
         

        for each Filter.

        FilterDefault specifies the behaviour if all primary filters return ignore, see section Filters.

        Only one entry of this type is allowed.

      • {module_level, Level, [Module]} - Sets module log level for the given -modules. Equivalent to calling

                logger:set_module_level(Module, Level)

        for each Module.

        Multiple entries of this type are allowed.

      • {proxy, ProxyConfig} - Sets the proxy configuration, equivalent to +modules. Equivalent to calling

                logger:set_module_level(Module, Level)

        for each Module.

        Multiple entries of this type are allowed.

      • {proxy, ProxyConfig} - Sets the proxy configuration, equivalent to calling

                logger:set_proxy_config(ProxyConfig)
         

        Only one entry of this type is allowed.

      See section Configuration Examples for examples using the logger parameter for system configuration.

    • logger_metadata = map() - Specifies the primary @@ -341,31 +341,31 @@ file. See the config(4) manual page for more information about this file.

      Each of the following examples shows a simple system configuration file that configures Logger according to the description.

      Modify the default handler to print to a file instead of -standard_io:

      [{kernel,
      -  [{logger,
      -    [{handler, default, logger_std_h,  % {handler, HandlerId, Module,
      -      #{config => #{file => "log/erlang.log"}}}  % Config}
      -    ]}]}].

      Modify the default handler to print each log event as a single line:

      [{kernel,
      -  [{logger,
      -    [{handler, default, logger_std_h,
      -      #{formatter => {logger_formatter, #{single_line => true}}}}
      -    ]}]}].

      Modify the default handler to print the pid of the logging process for each log -event:

      [{kernel,
      -  [{logger,
      -    [{handler, default, logger_std_h,
      -      #{formatter => {logger_formatter,
      -                        #{template => [time," ",pid," ",msg,"\n"]}}}}
      -    ]}]}].

      Modify the default handler to only print errors and more severe log events to +standard_io:

      [{kernel,
      +  [{logger,
      +    [{handler, default, logger_std_h,  % {handler, HandlerId, Module,
      +      #{config => #{file => "log/erlang.log"}}}  % Config}
      +    ]}]}].

      Modify the default handler to print each log event as a single line:

      [{kernel,
      +  [{logger,
      +    [{handler, default, logger_std_h,
      +      #{formatter => {logger_formatter, #{single_line => true}}}}
      +    ]}]}].

      Modify the default handler to print the pid of the logging process for each log +event:

      [{kernel,
      +  [{logger,
      +    [{handler, default, logger_std_h,
      +      #{formatter => {logger_formatter,
      +                        #{template => [time," ",pid," ",msg,"\n"]}}}}
      +    ]}]}].

      Modify the default handler to only print errors and more severe log events to "log/erlang.log", and add another handler to print all log events to -"log/debug.log".

      [{kernel,
      -  [{logger,
      -    [{handler, default, logger_std_h,
      -      #{level => error,
      -        config => #{file => "log/erlang.log"}}},
      -     {handler, info, logger_std_h,
      -      #{level => debug,
      -        config => #{file => "log/debug.log"}}}
      -    ]}]}].

      +"log/debug.log".

      [{kernel,
      +  [{logger,
      +    [{handler, default, logger_std_h,
      +      #{level => error,
      +        config => #{file => "log/erlang.log"}}},
      +     {handler, info, logger_std_h,
      +      #{level => debug,
      +        config => #{file => "log/debug.log"}}}
      +    ]}]}].

      @@ -406,9 +406,9 @@ This field can be used by filters to stop or allow the log events.

      See section SASL User's Guide for more information about the old SASL error logging functionality.

    • Legacy Event Handlers
      To use event handlers written for error_logger, just add your event handler with

      error_logger:add_report_handler/1,2.

      This automatically starts the error logger event manager, and adds -error_logger as a handler to Logger, with the following configuration:

      #{level => info,
      +error_logger as a handler to Logger, with the following configuration:

      #{level => info,
         filter_default => log,
      -  filters => []}.

      Note

      This handler ignores events that do not originate from the error_logger + filters => []}.

      Note

      This handler ignores events that do not originate from the error_logger API, or from within OTP. This means that if your code uses the Logger API for logging, then your log events will be discarded by this handler.

      The handler is not overload protected.

    @@ -434,19 +434,19 @@ level notice or more severe, are logged to the terminal via the default handler. To also log info events, you can either change the primary log level to info:

    1> logger:set_primary_config(level, info).
    -ok

    or set the level for one or a few modules only:

    2> logger:set_module_level(mymodule, info).
    +ok

    or set the level for one or a few modules only:

    2> logger:set_module_level(mymodule, info).
     ok

    This allows info events to pass through to the default handler, and be printed to the terminal as well. If there are many info events, it can be useful to print these to a file instead.

    First, set the log level of the default handler to notice, preventing it from -printing info events to the terminal:

    3> logger:set_handler_config(default, level, notice).
    +printing info events to the terminal:

    3> logger:set_handler_config(default, level, notice).
     ok

    Then, add a new handler which prints to file. You can use the handler module -logger_std_h, and configure it to log to file:

    4> Config = #{config => #{file => "./info.log"}, level => info}.
    -#{config => #{file => "./info.log"},level => info}
    -5> logger:add_handler(myhandler, logger_std_h, Config).
    +logger_std_h, and configure it to log to file:

    4> Config = #{config => #{file => "./info.log"}, level => info}.
    +#{config => #{file => "./info.log"},level => info}
    +5> logger:add_handler(myhandler, logger_std_h, Config).
     ok

    Since filter_default defaults to log, this handler now receives all log events. If you want info events only in the file, you must add a filter to stop -all non-info events. The built-in filter logger_filters:level/2 can do this:

    6> logger:add_handler_filter(myhandler, stop_non_info,
    -                             {fun logger_filters:level/2, {stop, neq, info}}).
    +all non-info events. The built-in filter logger_filters:level/2 can do this:

    6> logger:add_handler_filter(myhandler, stop_non_info,
    +                             {fun logger_filters:level/2, {stop, neq, info}}).
     ok

    See section Filters for more information about the filters and the filter_default configuration parameter.

    @@ -471,48 +471,48 @@ database.

    When logger:get_config/0 or logger:get_handler_config/0,1 is called, Logger calls HModule:filter_config(Config). This function must return the -handler configuration where internal data is removed.

    A simple handler that prints to the terminal can be implemented as follows:

    -module(myhandler1).
    --export([log/2]).
    +handler configuration where internal data is removed.

    A simple handler that prints to the terminal can be implemented as follows:

    -module(myhandler1).
    +-export([log/2]).
     
    -log(LogEvent, #{formatter := {FModule, FConfig}}) ->
    -    io:put_chars(FModule:format(LogEvent, FConfig)).

    Notice that the above handler does not have any overload protection, and all log +log(LogEvent, #{formatter := {FModule, FConfig}}) -> + io:put_chars(FModule:format(LogEvent, FConfig)).

    Notice that the above handler does not have any overload protection, and all log events are printed directly from the client process.

    For information and examples of overload protection, please refer to section Protecting the Handler from Overload, and the implementation of logger_std_h and logger_disk_log_h .

    The following is a simpler example of a handler which logs to a file through one -single process:

    -module(myhandler2).
    --export([adding_handler/1, removing_handler/1, log/2]).
    --export([init/1, handle_call/3, handle_cast/2, terminate/2]).
    +single process:

    -module(myhandler2).
    +-export([adding_handler/1, removing_handler/1, log/2]).
    +-export([init/1, handle_call/3, handle_cast/2, terminate/2]).
     
    -adding_handler(Config) ->
    -    MyConfig = maps:get(config,Config,#{file => "myhandler2.log"}),
    -    {ok, Pid} = gen_server:start(?MODULE, MyConfig, []),
    -    {ok, Config#{config => MyConfig#{pid => Pid}}}.
    +adding_handler(Config) ->
    +    MyConfig = maps:get(config,Config,#{file => "myhandler2.log"}),
    +    {ok, Pid} = gen_server:start(?MODULE, MyConfig, []),
    +    {ok, Config#{config => MyConfig#{pid => Pid}}}.
     
    -removing_handler(#{config := #{pid := Pid}}) ->
    -    gen_server:stop(Pid).
    +removing_handler(#{config := #{pid := Pid}}) ->
    +    gen_server:stop(Pid).
     
    -log(LogEvent,#{config := #{pid := Pid}} = Config) ->
    -    gen_server:cast(Pid, {log, LogEvent, Config}).
    +log(LogEvent,#{config := #{pid := Pid}} = Config) ->
    +    gen_server:cast(Pid, {log, LogEvent, Config}).
     
    -init(#{file := File}) ->
    -    {ok, Fd} = file:open(File, [append, {encoding, utf8}]),
    /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/logger_cookbook.xhtml differs (HTML document, ASCII text, with very long lines (1412))
    --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/logger_cookbook.xhtml	2026-06-04 00:07:21.000000000 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/logger_cookbook.xhtml	2042-07-06 13:26:49.000000000 +0000
    @@ -39,19 +39,19 @@
       
       Print the primary Logger configurations.
     

    -
    1> logger:i(primary).
    +
    1> logger:i(primary).
     Primary configuration:
         Level: notice
         Filter Default: log
         Filters:
    -        (none)

    It is also possible to fetch the configuration using + (none)

    It is also possible to fetch the configuration using logger:get_primary_config().

    See also

    -
    2> logger:i(handlers).
    +
    2> logger:i(handlers).
     Handler configuration:
         Id: default
             Module: logger_std_h
    @@ -68,10 +68,10 @@
                     Arg: stop
                 Id: domain
                     Fun: fun logger_filters:domain/2
    -                Arg: {log,super,[otp,sasl]}
    +                Arg: {log,super,[otp,sasl]}
                 Id: no_domain
                     Fun: fun logger_filters:domain/2
    -                Arg: {log,undefined,[]}
    +                Arg: {log,undefined,[]}
             Handler Config:
                 burst_limit_enable: true
                 burst_limit_max_count: 500
    @@ -110,7 +110,7 @@
     =PROGRESS REPORT==== 4-Nov-2019::16:33:11.746546 ===
         application: stdlib
         started_at: nonode@nohost
    -Eshell V10.5.3  (abort with ^G)
    +Eshell V10.5.3  (abort with ^G)
     1>

    @@ -128,17 +128,17 @@

    Since single line logging is the default of the built-in formatter you only have to provide the empty map as the configuration. The example below uses the sys.config to change the formatter configuration.

    $ cat sys.config
    -[{kernel,
    -  [{logger,
    -    [{handler, default, logger_std_h,
    -      #{ formatter => {logger_formatter, #{ }}}}]}]}].
    +[{kernel,
    +  [{logger,
    +    [{handler, default, logger_std_h,
    +      #{ formatter => {logger_formatter, #{ }}}}]}]}].
     $ erl -config sys
    -Eshell V10.5.1  (abort with ^G)
    -1> logger:error("Oh noes, an error").
    +Eshell V10.5.1  (abort with ^G)
    +1> logger:error("Oh noes, an error").
     1962-10-03T11:07:47.466763-04:00 error: Oh noes, an error

    However, if you just want to change it for the current session you can also do -that.

    1> logger:set_handler_config(default, formatter, {logger_formatter, #{}}).
    +that.

    1> logger:set_handler_config(default, formatter, {logger_formatter, #{}}).
     ok
    -2> logger:error("Oh noes, another error").
    +2> logger:error("Oh noes, another error").
     1962-10-04T15:34:02.648713-04:00 error: Oh noes, another error

    See also

    @@ -146,14 +146,14 @@ Add file and line number to log entries

    You can change what is printed to the log by using the formatter template:

    $ cat sys.config
    -[{kernel,
    -  [{logger,
    -    [{handler, default, logger_std_h,
    -      #{ formatter => {logger_formatter,
    -        #{ template => [time," ", file,":",line," ",level,": ",msg,"\n"] }}}}]}]}].
    +[{kernel,
    +  [{logger,
    +    [{handler, default, logger_std_h,
    +      #{ formatter => {logger_formatter,
    +        #{ template => [time," ", file,":",line," ",level,": ",msg,"\n"] }}}}]}]}].
     $ erl -config sys
    -Eshell V10.5.1  (abort with ^G)
    -1> logger:error("Oh noes, more errors",#{ file => "shell.erl", line => 1 }).
    +Eshell V10.5.1  (abort with ^G)
    +1> logger:error("Oh noes, more errors",#{ file => "shell.erl", line => 1 }).
     1962-10-05T07:37:44.104241+02:00 shell.erl:1 error: Oh noes, more errors

    Note that file and line have to be added in the metadata by the caller of logger:log/3 as otherwise Logger will not know from where it was called. The file and line number are automatically added if you use the ?LOG_ERROR macros @@ -170,18 +170,18 @@ Print logs to a file

    Instead of printing the logs to stdout we print them to a rotating file log.

    $ cat sys.config
    -[{kernel,
    -  [{logger,
    -    [{handler, default, logger_std_h,
    -      #{ config => #{ file => "log/erlang.log",
    +[{kernel,
    +  [{logger,
    +    [{handler, default, logger_std_h,
    +      #{ config => #{ file => "log/erlang.log",
                           max_no_bytes => 4096,
    -                      max_no_files => 5},
    -         formatter => {logger_formatter, #{}}}}]}]}].
    +                      max_no_files => 5},
    +         formatter => {logger_formatter, #{}}}}]}]}].
     $ erl -config sys
    -Eshell V10.5.1  (abort with ^G)
    -1> logger:error("Oh noes, even more errors").
    +Eshell V10.5.1  (abort with ^G)
    +1> logger:error("Oh noes, even more errors").
     ok
    -2> erlang:halt().
    +2> erlang:halt().
     $ cat log/erlang.log
     2019-10-07T11:47:16.837958+02:00 error: Oh noes, even more errors

    See also

    @@ -191,24 +191,24 @@

    Add a handler that prints debug log events to a file, while the default handler prints only up to notice level events to standard out.

    $ cat sys.config
    -[{kernel,
    -  [{logger_level, all},
    -   {logger,
    -    [{handler, default, logger_std_h,
    -      #{ level => notice }},
    -     {handler, debug, logger_std_h,
    -      #{ filters => [{debug,{fun logger_filters:level/2, {stop, neq, debug}}}],
    -         config => #{ file => "log/debug.log" } }}
    -    ]}]}].
    +[{kernel,
    +  [{logger_level, all},
    +   {logger,
    +    [{handler, default, logger_std_h,
    +      #{ level => notice }},
    +     {handler, debug, logger_std_h,
    +      #{ filters => [{debug,{fun logger_filters:level/2, {stop, neq, debug}}}],
    +         config => #{ file => "log/debug.log" } }}
    +    ]}]}].
     $ erl -config sys
    -Eshell V10.5.1  (abort with ^G)
    -1> logger:error("Oh noes, even more errors").
    +Eshell V10.5.1  (abort with ^G)
    +1> logger:error("Oh noes, even more errors").
     =ERROR REPORT==== 9-Oct-2019::14:40:54.784162 ===
     Oh noes, even more errors
     ok
    -2> logger:debug("A debug event").
    +2> logger:debug("A debug event").
     ok
    -3> erlang:halt().
    +3> erlang:halt().
     $ cat log/debug.log
     2019-10-09T14:41:03.680541+02:00 debug: A debug event

    In the configuration above we first raise the primary log level to max in order for the debug log events to get to the handlers. Then we configure the default @@ -216,13 +216,13 @@ is all. Then the debug handler is configured with a filter to stop any log message that is not a debug level message.

    It is also possible to do the same changes in an already running system using the logger module. Then you do like this:

    $ erl
    -1> logger:set_handler_config(default, level, notice).
    +1> logger:set_handler_config(default, level, notice).
     ok
    -2> logger:add_handler(debug, logger_std_h, #{
    -  filters => [{debug,{fun logger_filters:level/2, {stop, neq, debug}}}],
    -  config => #{ file => "log/debug.log" } }).
    +2> logger:add_handler(debug, logger_std_h, #{
    +  filters => [{debug,{fun logger_filters:level/2, {stop, neq, debug}}}],
    +  config => #{ file => "log/debug.log" } }).
     ok
    -3> logger:set_primary_config(level, all).
    +3> logger:set_primary_config(level, all).
     ok

    It is important that you do not raise the primary log level before adjusting the default handler's level as otherwise your standard out may be flooded by debug log messages.

    See also

    @@ -238,7 +238,7 @@ What to log and how

    The simplest way to log something is by using the Logger macros and give a -report to the macro. For example if you want to log an error:

    ?LOG_ERROR(#{ what => http_error, status => 418, src => ClientIP, dst => ServerIP }).

    This will print the following in the default log:

    =ERROR REPORT==== 10-Oct-2019::12:13:10.089073 ===
    +report to the macro. For example if you want to log an error:

    ?LOG_ERROR(#{ what => http_error, status => 418, src => ClientIP, dst => ServerIP }).

    This will print the following in the default log:

    =ERROR REPORT==== 10-Oct-2019::12:13:10.089073 ===
         dst: {8,8,4,4}
         src: {8,8,8,8}
         status: 418
    @@ -250,14 +250,14 @@
     

    If you want to do structured logging, but still want to have some control of how the final log message is formatted you can give a report_cb as part of the -metadata with your log event.

    ReportCB = fun(#{ what := What, status := Status, src := Src, dst := Dst }) ->
    -                   {ok, #hostent{ h_name = SrcName }} = inet:gethostbyaddr(Src),
    -                   {ok, #hostent{ h_name = DstName }} = inet:gethostbyaddr(Dst),
    -                   {"What: ~p~nStatus: ~p~nSrc: ~s (~s)~nDst: ~s (~s)~n",
    -                    [What, Status, inet:ntoa(Src), SrcName, inet:ntoa(Dst), DstName]}
    +metadata with your log event.

    ReportCB = fun(#{ what := What, status := Status, src := Src, dst := Dst }) ->
    +                   {ok, #hostent{ h_name = SrcName }} = inet:gethostbyaddr(Src),
    /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/logger_disk_log_h.xhtml differs (HTML document, ASCII text, with very long lines (463))
    --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/logger_disk_log_h.xhtml	2026-06-04 00:07:21.000000000 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/logger_disk_log_h.xhtml	2042-07-06 13:26:49.000000000 +0000
    @@ -59,12 +59,12 @@
     and the disk_log handler, and are documented in the
     User's Guide.

    Notice that when changing the configuration of the handler in runtime, the disk_log options (file, type, max_no_files, max_no_bytes) must not be -modified.

    Example of adding a disk_log handler:

    logger:add_handler(my_disk_log_h, logger_disk_log_h,
    -                   #{config => #{file => "./my_disk_log",
    +modified.

    Example of adding a disk_log handler:

    logger:add_handler(my_disk_log_h, logger_disk_log_h,
    +                   #{config => #{file => "./my_disk_log",
                                      type => wrap,
                                      max_no_files => 4,
                                      max_no_bytes => 10000,
    -                                 filesync_repeat_interval => 1000}}).

    To use the disk_log handler instead of the default standard handler when + filesync_repeat_interval => 1000}}).

    To use the disk_log handler instead of the default standard handler when starting an Erlang node, change the Kernel default logger to use logger_disk_log_h. Example:

    erl -kernel logger '[{handler,default,logger_disk_log_h,
                           #{config => #{file => "./system_disk_log"}}}]'

    /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/logger_filters.xhtml differs (HTML document, ASCII text, with very long lines (1103)) --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/logger_filters.xhtml 2026-06-04 00:07:21.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/logger_filters.xhtml 2042-07-06 13:26:49.000000000 +0000 @@ -135,8 +135,8 @@ events from, for example, a specific functional area. This allows filtering or other specialized treatment in a Logger handler.

    A domain field must be a list of atoms, creating smaller and more specialized domains as the list grows longer. The greatest domain is [], which comprises -all possible domains.

    For example, consider the following domains:

    D1 = [otp]
    -D2 = [otp, sasl]

    D1 is the greatest of the two, and is said to be a super-domain of D2. D2 +all possible domains.

    For example, consider the following domains:

    D1 = [otp]
    +D2 = [otp, sasl]

    D1 is the greatest of the two, and is said to be a super-domain of D2. D2 is a sub-domain D1. Both D1 and D2 are sub-domains of [].

    The above domains are used for logs originating from Erlang/OTP. D1 specifies that the log event comes from Erlang/OTP in general, and D2 indicates that the log event is a so called SASL report.

    The Extra parameter to the domain/2 function is specified when @@ -151,11 +151,11 @@ filter matches and Action is stop, the log event is stopped.

    If the filter does not match, it returns ignore, meaning that other filters, or the value of the configuration parameter filter_default, decide if the event is allowed or not.

    Log events that do not contain any domain field, match only when Compare is -equal to undefined or not_equal.

    Example: stop all events with domain [otp, sasl | _]

    1> logger:set_handler_config(h1, filter_default, log). % this is the default
    +equal to undefined or not_equal.

    Example: stop all events with domain [otp, sasl | _]

    1> logger:set_handler_config(h1, filter_default, log). % this is the default
     ok
    -2> Filter = {fun logger_filters:domain/2, {stop, sub, [otp, sasl]}}.
    +2> Filter = {fun logger_filters:domain/2, {stop, sub, [otp, sasl]}}.
     ...
    -3> logger:add_handler_filter(h1, no_sasl, Filter).
    +3> logger:add_handler_filter(h1, no_sasl, Filter).
     ok
    @@ -200,9 +200,9 @@ filter matches if the value of Operator is:

    • neq - and the compare function returns lt or gt.

    • eq - and the compare function returns eq.

    • lt - and the compare function returns lt.

    • gt - and the compare function returns gt.

    • lteq - and the compare function returns lt or eq.

    • gteq - and the compare function returns gt or eq.

    If the filter matches and Action is log, the log event is allowed. If the filter matches and Action is stop, the log event is stopped.

    If the filter does not match, it returns ignore, meaning that other filters, or the value of the configuration parameter filter_default, will decide if the -event is allowed or not.

    Example: only allow debug level log events

    logger:set_handler_config(h1, filter_default, stop).
    -Filter = {fun logger_filters:level/2, {log, eq, debug}}.
    -logger:add_handler_filter(h1, debug_only, Filter).
    +event is allowed or not.

    Example: only allow debug level log events

    logger:set_handler_config(h1, filter_default, stop).
    +Filter = {fun logger_filters:level/2, {log, eq, debug}}.
    +logger:add_handler_filter(h1, debug_only, Filter).
     ok
    /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/logger_std_h.xhtml differs (HTML document, ASCII text, with very long lines (610)) --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/logger_std_h.xhtml 2026-06-04 00:07:21.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/logger_std_h.xhtml 2042-07-06 13:26:49.000000000 +0000 @@ -80,9 +80,9 @@ protection behaviour. The same parameters are used both in the standard handler and the disk_log handler, and are documented in the User's Guide.

    Notice that if changing the configuration of the handler in runtime, the type, -file, or modes parameters must not be modified.

    Example of adding a standard handler:

    logger:add_handler(my_standard_h, logger_std_h,
    -                   #{config => #{file => "./system_info.log",
    -                                 filesync_repeat_interval => 1000}}).

    To set the default handler, that starts initially with the Kernel application, +file, or modes parameters must not be modified.

    Example of adding a standard handler:

    logger:add_handler(my_standard_h, logger_std_h,
    +                   #{config => #{file => "./system_info.log",
    +                                 filesync_repeat_interval => 1000}}).

    To set the default handler, that starts initially with the Kernel application, to log to file instead of standard_io, change the Kernel default logger configuration. Example:

    erl -kernel logger '[{handler,default,logger_std_h,
                           #{config => #{file => "./log.log"}}}]'

    An example of how to replace the standard handler with a disk_log handler at /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/logger.xhtml differs (HTML document, ASCII text, with very long lines (1841)) --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/logger.xhtml 2026-06-04 00:07:21.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/logger.xhtml 2042-07-06 13:26:49.000000000 +0000 @@ -25,18 +25,18 @@

    API module for Logger, the standard logging facility in Erlang/OTP.

    This module implements the main API for logging in Erlang/OTP. To create a log event, use the API functions or the log -macros, for example:

    ?LOG_ERROR("error happened because: ~p", [Reason]).   % With macro
    -logger:error("error happened because: ~p", [Reason]). % Without macro

    To configure the Logger backend, use +macros, for example:

    ?LOG_ERROR("error happened because: ~p", [Reason]).   % With macro
    +logger:error("error happened because: ~p", [Reason]). % Without macro

    To configure the Logger backend, use Kernel configuration parameters or configuration functions in the Logger API.

    By default, the Kernel application installs one log handler at system start. This handler is named default. It receives and processes standard log events produced by the Erlang runtime system, standard behaviours and different Erlang/OTP applications. The log events are by default printed to the terminal.

    If you want your systems logs to be printed to a file instead, you must configure the default handler to do so. The simplest way is to include the -following in your sys.config:

    [{kernel,
    -  [{logger,
    -    [{handler, default, logger_std_h,
    -      #{config => #{file => "path/to/file.log"}}}]}]}].

    For more information about:

    Equivalent to log(Level, FormatOrFun, Args, #{}) if called as log(Level, FormatOrFun, Args).

    @@ -2310,12 +2310,12 @@ useful in scenarios when the message/metadata is very expensive to compute. This is because the fun is only evaluated when the message/metadata is actually needed, which may be not at all if the log event is not to be logged. Examples:

    %% A plain string with expensive metadata
    -1> logger:info(fun([]) -> {"Hello World", #{ meta => expensive() }} end,[]).
    +1> logger:info(fun([]) -> {"Hello World", #{ meta => expensive() }} end,[]).
     %% An expensive report
    -2> logger:debug(fun(What) -> #{ what => What, cause => expensive() } end,roof).
    +2> logger:debug(fun(What) -> #{ what => What, cause => expensive() } end,roof).
     %% A plain string with expensive metadata and normal metadata
    -3> logger:debug(fun([]) -> {"Hello World", #{ meta => expensive() }} end,[],
    -               #{ meta => data }).

    When metadata is given both as an argument and returned from the fun they are +3> logger:debug(fun([]) -> {"Hello World", #{ meta => expensive() }} end,[], + #{ meta => data }).

    When metadata is given both as an argument and returned from the fun they are merged. If equal keys exists the values are taken from the metadata returned by the fun.

    @@ -2633,26 +2633,26 @@ consistent no matter which handler the system uses. Normal usage is to add a call to logger:add_handlers/1 just after the processes that the handler needs are started, and pass the application's logger configuration as the argument. -For example:

    -behaviour(application).
    -start(_, []) ->
    -    case supervisor:start_link({local, my_sup}, my_sup, []) of
    -        {ok, Pid} ->
    -            ok = logger:add_handlers(my_app),
    -            {ok, Pid, []};
    +For example:

    -behaviour(application).
    +start(_, []) ->
    +    case supervisor:start_link({local, my_sup}, my_sup, []) of
    +        {ok, Pid} ->
    +            ok = logger:add_handlers(my_app),
    +            {ok, Pid, []};
             Error -> Error
          end.

    This reads the logger configuration parameter from the my_app application and starts the configured handlers. The contents of the configuration use the same rules as the logger handler configuration.

    If the handler is meant to replace the default handler, the Kernel's default handler have to be disabled before the new handler is added. A sys.config file -that disables the Kernel handler and adds a custom handler could look like this:

    [{kernel,
    -  [{logger,
    +that disables the Kernel handler and adds a custom handler could look like this:

    [{kernel,
    +  [{logger,
         %% Disable the default Kernel handler
    -    [{handler, default, undefined}]}]},
    - {my_app,
    -  [{logger,
    +    [{handler, default, undefined}]}]},
    + {my_app,
    +  [{logger,
         %% Enable this handler as the default
    -    [{handler, default, my_handler, #{}}]}]}].
    +
    [{handler, default, my_handler, #{}}]}]}].
    @@ -3607,8 +3607,8 @@ -

    Update the formatter configuration for the specified handler.

    The new configuration is merged with the existing formatter configuration.

    To overwrite the existing configuration without any merge, use

    set_handler_config(HandlerId, formatter,
    -	      {FormatterModule, FormatterConfig}).
    +

    Update the formatter configuration for the specified handler.

    The new configuration is merged with the existing formatter configuration.

    To overwrite the existing configuration without any merge, use

    set_handler_config(HandlerId, formatter,
    +	      {FormatterModule, FormatterConfig}).
    @@ -3671,8 +3671,8 @@

    Update configuration data for the specified handler. This function behaves as if -it was implemented as follows:

    {ok, {_, Old}} = logger:get_handler_config(HandlerId),
    -logger:set_handler_config(HandlerId, maps:merge(Old, Config)).

    To overwrite the existing configuration without any merge, use +it was implemented as follows:

    {ok, {_, Old}} = logger:get_handler_config(HandlerId),
    +logger:set_handler_config(HandlerId, maps:merge(Old, Config)).

    To overwrite the existing configuration without any merge, use set_handler_config/2 .

    @@ -3765,8 +3765,8 @@

    Update primary configuration data for Logger. This function behaves as if it was -implemented as follows:

    Old = logger:get_primary_config(),
    -logger:set_primary_config(maps:merge(Old, Config)).

    To overwrite the existing configuration without any merge, use +implemented as follows:

    Old = logger:get_primary_config(),
    +logger:set_primary_config(maps:merge(Old, Config)).

    To overwrite the existing configuration without any merge, use set_primary_config/1 .

    @@ -3798,7 +3798,7 @@

    Set or update metadata to use when logging from current process

    If process metadata exists for the current process, this function behaves as if -it was implemented as follows:

    logger:set_process_metadata(maps:merge(logger:get_process_metadata(), Meta)).

    If no process metadata exists, the function behaves as +it was implemented as follows:

    logger:set_process_metadata(maps:merge(logger:get_process_metadata(), Meta)).

    If no process metadata exists, the function behaves as set_process_metadata/1 .

    @@ -3830,8 +3830,8 @@

    Update configuration data for the Logger proxy. This function behaves as if it -was implemented as follows:

    Old = logger:get_proxy_config(),
    -logger:set_proxy_config(maps:merge(Old, Config)).

    To overwrite the existing configuration without any merge, use +was implemented as follows:

    Old = logger:get_proxy_config(),
    +logger:set_proxy_config(maps:merge(Old, Config)).

    To overwrite the existing configuration without any merge, use set_proxy_config/1 .

    For more information about the proxy, see section Logger Proxy in the Kernel User's Guide.

    /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/net_adm.xhtml differs (HTML document, ASCII text, with very long lines (671)) --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/net_adm.xhtml 2026-06-04 00:07:21.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/net_adm.xhtml 2042-07-06 13:26:49.000000000 +0000 @@ -370,8 +370,8 @@

    Returns the names and associated port numbers of the Erlang nodes that epmd -registered at the specified host.

    Similar to epmd -names, see erts:epmd.

    Returns {error, address} if epmd is not operational.

    Example:

    (arne@dunn)1> net_adm:names().
    -{ok,[{"arne",40262}]}
    +registered at the specified host.

    Similar to epmd -names, see erts:epmd.

    Returns {error, address} if epmd is not operational.

    Example:

    (arne@dunn)1> net_adm:names().
    +{ok,[{"arne",40262}]}
    /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/net_kernel.xhtml differs (HTML document, ASCII text, with very long lines (1008)) --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/net_kernel.xhtml 2026-06-04 00:07:21.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/net_kernel.xhtml 2042-07-06 13:26:49.000000000 +0000 @@ -27,9 +27,9 @@ operational for distributed Erlang to work. The purpose of this process is to implement parts of the BIFs spawn/4 and spawn_link/4, and to provide monitoring of the network.

    An Erlang node is started using command-line flag -name or -sname:

    $ erl -sname foobar

    It is also possible to call net_kernel:start(foobar, #{}) -directly from the normal Erlang shell prompt:

    1> net_kernel:start(foobar, #{name_domain => shortnames}).
    -{ok,<0.64.0>}
    -(foobar@gringotts)2>

    If the node is started with command-line flag -sname, the node name is +directly from the normal Erlang shell prompt:

    1> net_kernel:start(foobar, #{name_domain => shortnames}).
    +{ok,<0.64.0>}
    +(foobar@gringotts)2>

    If the node is started with command-line flag -sname, the node name is foobar@Host, where Host is the short name of the host (not the fully qualified domain name). If started with flag -name, the node name is foobar@Host, where Host is the fully qualified domain name. For more @@ -547,13 +547,13 @@ delivered before a nodeup message due to a new connection to the same node. Prior to OTP 23.0, this was not guaranteed to be the case.

    The format of the node status change messages depends on Options. If Options is the empty list or if net_kernel:monitor_nodes/1 is called, the format is as -follows:

    {nodeup, Node} | {nodedown, Node}
    -  Node = node()

    When Options is the empty map or empty list, the caller will only subscribe +follows:

    {nodeup, Node} | {nodedown, Node}
    +  Node = node()

    When Options is the empty map or empty list, the caller will only subscribe for status change messages for visible nodes. That is, only nodes that appear in the result of erlang:nodes/0.

    If Options equals anything other than the empty list, the format of the status -change messages is as follows:

    {nodeup, Node, Info} | {nodedown, Node, Info}
    -  Node = node()
    -  Info = #{Tag => Val} | [{Tag, Val}]

    Info is either a map or a list of 2-tuples. Its content depends on Options. +change messages is as follows:

    {nodeup, Node, Info} | {nodedown, Node, Info}
    +  Node = node()
    +  Info = #{Tag => Val} | [{Tag, Val}]

    Info is either a map or a list of 2-tuples. Its content depends on Options. If Options is a map, Info will also be a map. If Options is a list, Info will also be a list.

    When Options is a map, currently the following associations are allowed:

    • connection_id => boolean() - If the value of the association equals true, a connection_id => ConnectionId association will be included in the @@ -587,23 +587,23 @@ {node_type, visible} tuple will be included in the Info list.

    • nodedown_reason - The tuple {nodedown_reason, Reason} will be included in the Info list for nodedown messages.

      See the documentation of the nodedown_reason => boolean() association -above for information about possible Reason values.

    Example:

    (a@localhost)1> net_kernel:monitor_nodes(true, #{connection_id=>true, node_type=>all, nodedown_reason=>true}).
    +above for information about possible Reason values.

    Example:

    (a@localhost)1> net_kernel:monitor_nodes(true, #{connection_id=>true, node_type=>all, nodedown_reason=>true}).
     ok
    -(a@localhost)2> flush().
    -Shell got {nodeup,b@localhost,
    -                  #{connection_id => 3067552,node_type => visible}}
    -Shell got {nodeup,c@localhost,
    -                  #{connection_id => 13892107,node_type => hidden}}
    -Shell got {nodedown,b@localhost,
    -                    #{connection_id => 3067552,node_type => visible,
    -                      nodedown_reason => connection_closed}}
    -Shell got {nodedown,c@localhost,
    -                    #{connection_id => 13892107,node_type => hidden,
    -                      nodedown_reason => net_tick_timeout}}
    -Shell got {nodeup,b@localhost,
    -                  #{connection_id => 3067553,node_type => visible}}
    +(a@localhost)2> flush().
    +Shell got {nodeup,b@localhost,
    +                  #{connection_id => 3067552,node_type => visible}}
    +Shell got {nodeup,c@localhost,
    +                  #{connection_id => 13892107,node_type => hidden}}
    +Shell got {nodedown,b@localhost,
    +                    #{connection_id => 3067552,node_type => visible,
    +                      nodedown_reason => connection_closed}}
    +Shell got {nodedown,c@localhost,
    +                    #{connection_id => 13892107,node_type => hidden,
    +                      nodedown_reason => net_tick_timeout}}
    +Shell got {nodeup,b@localhost,
    +                  #{connection_id => 3067553,node_type => visible}}
     ok
    -(a@localhost)3>
    +
    (a@localhost)3>
    /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/net.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (573)) --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/net.xhtml 2026-06-04 00:07:21.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/net.xhtml 2042-07-06 13:26:49.000000000 +0000 @@ -449,13 +449,13 @@

    Interface address filtering selector function/0.

    For each ifaddrs entry, return either true to keep the entry or false to discard the entry.

    For example, to get an interface list which only contains -non-loopback inet interfaces:

    net:getifaddrs(
    -    fun (#{ addr  := #{family := inet},
    -            flags := Flags}) ->
    -          not lists:member(loopback, Flags);
    -        (_) ->
    +non-loopback inet interfaces:

    net:getifaddrs(
    +    fun (#{ addr  := #{family := inet},
    +            flags := Flags}) ->
    +          not lists:member(loopback, Flags);
    +        (_) ->
               false
    -    end).
    +
    end).
    /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/notes.xhtml differs (HTML document, ASCII text, with very long lines (6253)) --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/notes.xhtml 2026-06-04 00:07:21.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/notes.xhtml 2042-07-06 13:26:49.000000000 +0000 @@ -3857,12 +3857,12 @@ viewed as two operations performed atomically. Asynchronously send an unlink signal or a demonitor signal, and ignore any future results of the link or monitor.

    NOTE: This change can cause some obscure code to fail which previously did -not. For example, the following code might hang:

                Mon = erlang:monitor(process, Pid),
    +not. For example, the following code might hang:

                Mon = erlang:monitor(process, Pid),
                 %% ...
    -            exit(Pid, bang),
    -            erlang:demonitor(Mon),
    +            exit(Pid, bang),
    +            erlang:demonitor(Mon),
                 receive
    -                {'DOWN', Mon, process, Pid, _} -> ok
    +                {'DOWN', Mon, process, Pid, _} -> ok
                 %% We were previously guaranteed to get a down message
                 %% (since we exited the process ourself), so we could
                 %% in this case leave out:
    /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/os.xhtml differs (HTML document, ASCII text, with very long lines (1354))
    --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/os.xhtml	2026-06-04 00:07:21.000000000 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/os.xhtml	2042-07-06 13:26:49.000000000 +0000
    @@ -535,13 +535,13 @@
           
     
     

    Executes Command in a command shell of the target OS, captures the standard -output and standard error of the command, and returns this result as a string.

    Examples:

    LsOut = os:cmd("ls"), % on unix platform
    -DirOut = os:cmd("dir"), % on Win32 platform

    Notice that in some cases, standard output of a command when called from another +output and standard error of the command, and returns this result as a string.

    Examples:

    LsOut = os:cmd("ls"), % on unix platform
    +DirOut = os:cmd("dir"), % on Win32 platform

    Notice that in some cases, standard output of a command when called from another program can differ, compared with the standard output of the command when called directly from an OS command shell.

    The possible options are:

    • max_size - The maximum size of the data returned by the os:cmd call. This option is a safety feature that should be used when the command executed -can return a very large, possibly infinite, result.

      > os:cmd("cat /dev/zero", #{ max_size => 20 }).
      -[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
    +can return a very large, possibly infinite, result.

    > os:cmd("cat /dev/zero", #{ max_size => 20 }).
    +[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
    @@ -831,7 +831,7 @@ resolution timestamp.

    This counter is read directly from the hardware or operating system with the same guarantees. This means that two consecutive calls to the function are not guaranteed to be monotonic, though it most likely will be. The performance -counter will be converted to the resolution passed as an argument.

    1> T1 = os:perf_counter(1000),receive after 10000 -> ok end,T2 = os:perf_counter(1000).
    +counter will be converted to the resolution passed as an argument.

    1> T1 = os:perf_counter(1000),receive after 10000 -> ok end,T2 = os:perf_counter(1000).
     176525861
     2> T2 - T1.
     10004
    @@ -1002,16 +1002,16 @@ allows you to log time stamps in high resolution and consistent with the time in the rest of the OS.

    Example of code formatting a string in format "DD Mon YYYY HH:MM:SS.mmmmmm", where DD is the day of month, Mon is the textual month name, YYYY is the year, -HH:MM:SS is the time, and mmmmmm is the microseconds in six positions:

    -module(print_time).
    --export([format_utc_timestamp/0]).
    -format_utc_timestamp() ->
    -    TS = {_,_,Micro} = os:timestamp(),
    -    {{Year,Month,Day},{Hour,Minute,Second}} =
    -calendar:now_to_universal_time(TS),
    -    Mstr = element(Month,{"Jan","Feb","Mar","Apr","May","Jun","Jul",
    -    "Aug","Sep","Oct","Nov","Dec"}),
    -    io_lib:format("~2w ~s ~4w ~2w:~2..0w:~2..0w.~6..0w",
    -    [Day,Mstr,Year,Hour,Minute,Second,Micro]).

    This module can be used as follows:

    1> io:format("~s~n",[print_time:format_utc_timestamp()]).
    +HH:MM:SS is the time, and mmmmmm is the microseconds in six positions:

    -module(print_time).
    +-export([format_utc_timestamp/0]).
    +format_utc_timestamp() ->
    +    TS = {_,_,Micro} = os:timestamp(),
    +    {{Year,Month,Day},{Hour,Minute,Second}} =
    +calendar:now_to_universal_time(TS),
    +    Mstr = element(Month,{"Jan","Feb","Mar","Apr","May","Jun","Jul",
    +    "Aug","Sep","Oct","Nov","Dec"}),
    +    io_lib:format("~2w ~s ~4w ~2w:~2..0w:~2..0w.~6..0w",
    +    [Day,Mstr,Year,Hour,Minute,Second,Micro]).

    This module can be used as follows:

    1> io:format("~s~n",[print_time:format_utc_timestamp()]).
     29 Apr 2009  9:55:30.051711

    OS system time can also be retrieved by system_time/0 and system_time/1.

    /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/pg.xhtml differs (HTML document, ASCII text, with very long lines (1156)) --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/pg.xhtml 2026-06-04 00:07:21.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/pg.xhtml 2042-07-06 13:26:49.000000000 +0000 @@ -749,7 +749,7 @@

    Subscribes the caller to updates from the specified scope.

    Returns content of the entire scope and a reference to match the upcoming notifications.

    Whenever any group membership changes, an update message is sent to the -subscriber:

    {Ref, join, Group, [JoinPid1, JoinPid2]}
    {Ref, leave, Group, [LeavePid1]}
    +subscriber:

    {Ref, join, Group, [JoinPid1, JoinPid2]}
    {Ref, leave, Group, [LeavePid1]}
    /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/rpc.xhtml differs (HTML document, ASCII text, with very long lines (954)) --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/rpc.xhtml 2026-06-04 00:07:21.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/rpc.xhtml 2042-07-06 13:26:49.000000000 +0000 @@ -958,10 +958,10 @@ return values, or {badrpc, Reason} for failing calls. Timeout is a time (integer) in milliseconds, or infinity.

    The following example is useful when new object code is to be loaded on all nodes in the network, and indicates some side effects that RPCs can produce:

    %% Find object code for module Mod
    -{Mod, Bin, File} = code:get_object_code(Mod),
    +{Mod, Bin, File} = code:get_object_code(Mod),
     
     %% and load it on all nodes including this one
    -{ResL, _} = rpc:multicall(code, load_binary, [Mod, File, Bin]),
    +{ResL, _} = rpc:multicall(code, load_binary, [Mod, File, Bin]),
     
     %% and then maybe check the ResL list.

    Note

    If you want the ability to distinguish between results, you may want to consider using the erpc:multicall() function from the /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/seq_trace.xhtml differs (HTML document, ASCII text, with very long lines (839)) --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/seq_trace.xhtml 2026-06-04 00:07:21.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/seq_trace.xhtml 2042-07-06 13:26:49.000000000 +0000 @@ -36,9 +36,9 @@ Trace Messages Sent to the System Tracer

    The format of the messages is one of the following, depending on if flag -timestamp of the trace token is set to true or false:

    {seq_trace, Label, SeqTraceInfo, TimeStamp}

    or

    {seq_trace, Label, SeqTraceInfo}

    Where:

    Label = int()
    -TimeStamp = {Seconds, Milliseconds, Microseconds}
    -  Seconds = Milliseconds = Microseconds = int()

    SeqTraceInfo can have the following formats:

    • {send, Serial, From, To, Message} - Used when a process From with its +timestamp of the trace token is set to true or false:

      {seq_trace, Label, SeqTraceInfo, TimeStamp}

      or

      {seq_trace, Label, SeqTraceInfo}

      Where:

      Label = int()
      +TimeStamp = {Seconds, Milliseconds, Microseconds}
      +  Seconds = Milliseconds = Microseconds = int()

      SeqTraceInfo can have the following formats:

      • {send, Serial, From, To, Message} - Used when a process From with its trace token flag send set to true has sent information. To may be a process identifier, a registered name on a node represented as {NameAtom, NodeAtom}, or a node name represented as an atom. From may be a @@ -182,68 +182,68 @@ Example of Use

        This example gives a rough idea of how the new primitives can be used and what -kind of output it produces.

        Assume that you have an initiating process with Pid == <0.30.0> like this:

        -module(seqex).
        --compile(export_all).
        +kind of output it produces.

        Assume that you have an initiating process with Pid == <0.30.0> like this:

        -module(seqex).
        +-compile(export_all).
         
        -loop(Port) ->
        +loop(Port) ->
             receive
        -        {Port,Message} ->
        -            seq_trace:set_token(label,17),
        -            seq_trace:set_token('receive',true),
        -            seq_trace:set_token(print,true),
        -            seq_trace:print(17,"**** Trace Started ****"),
        -            call_server ! {self(),the_message};
        -        {ack,Ack} ->
        +        {Port,Message} ->
        +            seq_trace:set_token(label,17),
        +            seq_trace:set_token('receive',true),
        +            seq_trace:set_token(print,true),
        +            seq_trace:print(17,"**** Trace Started ****"),
        +            call_server ! {self(),the_message};
        +        {ack,Ack} ->
                     ok
             end,
        -    loop(Port).

        And a registered process call_server with Pid == <0.31.0> like this:

        loop() ->
        +    loop(Port).

        And a registered process call_server with Pid == <0.31.0> like this:

        loop() ->
             receive
        -        {PortController,Message} ->
        -            Ack = {received, Message},
        -            seq_trace:print(17,"We are here now"),
        -            PortController ! {ack,Ack}
        +        {PortController,Message} ->
        +            Ack = {received, Message},
        +            seq_trace:print(17,"We are here now"),
        +            PortController ! {ack,Ack}
             end,
        -    loop().

        A possible output from the system's sequential_tracer can be like this:

        17:<0.30.0> Info {0,1} WITH
        +    loop().

        A possible output from the system's sequential_tracer can be like this:

        17:<0.30.0> Info {0,1} WITH
         "**** Trace Started ****"
        -17:<0.31.0> Received {0,2} FROM <0.30.0> WITH
        -{<0.30.0>,the_message}
        -17:<0.31.0> Info {2,3} WITH
        +17:<0.31.0> Received {0,2} FROM <0.30.0> WITH
        +{<0.30.0>,the_message}
        +17:<0.31.0> Info {2,3} WITH
         "We are here now"
        -17:<0.30.0> Received {2,4} FROM <0.31.0> WITH
        -{ack,{received,the_message}}

        The implementation of a system tracer process that produces this printout can -look like this:

        tracer() ->
        +17:<0.30.0> Received {2,4} FROM <0.31.0> WITH
        +{ack,{received,the_message}}

        The implementation of a system tracer process that produces this printout can +look like this:

        tracer() ->
             receive
        -        {seq_trace,Label,TraceInfo} ->
        -           print_trace(Label,TraceInfo,false);
        -        {seq_trace,Label,TraceInfo,Ts} ->
        -           print_trace(Label,TraceInfo,Ts);
        +        {seq_trace,Label,TraceInfo} ->
        +           print_trace(Label,TraceInfo,false);
        +        {seq_trace,Label,TraceInfo,Ts} ->
        +           print_trace(Label,TraceInfo,Ts);
                 _Other -> ignore
             end,
        -    tracer().
        +    tracer().
         
        -print_trace(Label,TraceInfo,false) ->
        -    io:format("~p:",[Label]),
        -    print_trace(TraceInfo);
        -print_trace(Label,TraceInfo,Ts) ->
        -    io:format("~p ~p:",[Label,Ts]),
        -    print_trace(TraceInfo).
        -
        -print_trace({print,Serial,From,_,Info}) ->
        -    io:format("~p Info ~p WITH~n~p~n", [From,Serial,Info]);
        -print_trace({'receive',Serial,From,To,Message}) ->
        -    io:format("~p Received ~p FROM ~p WITH~n~p~n",
        -              [To,Serial,From,Message]);
        -print_trace({send,Serial,From,To,Message}) ->
        -    io:format("~p Sent ~p TO ~p WITH~n~p~n",
        -              [From,Serial,To,Message]).

        The code that creates a process that runs this tracer function and sets that -process as the system tracer can look like this:

        start() ->
        -    Pid = spawn(?MODULE,tracer,[]),
        -    seq_trace:set_system_tracer(Pid), % set Pid as the system tracer
        -    ok.

        With a function like test/0, the whole example can be started:

        test() ->
        -    P = spawn(?MODULE, loop, [port]),
        -    register(call_server, spawn(?MODULE, loop, [])),
        -    start(),
        -    P ! {port,message}.
        +
        print_trace(Label,TraceInfo,false) -> + io:format("~p:",[Label]), + print_trace(TraceInfo); +print_trace(Label,TraceInfo,Ts) -> + io:format("~p ~p:",[Label,Ts]), + print_trace(TraceInfo). + +print_trace({print,Serial,From,_,Info}) -> + io:format("~p Info ~p WITH~n~p~n", [From,Serial,Info]); +print_trace({'receive',Serial,From,To,Message}) -> + io:format("~p Received ~p FROM ~p WITH~n~p~n", + [To,Serial,From,Message]); +print_trace({send,Serial,From,To,Message}) -> + io:format("~p Sent ~p TO ~p WITH~n~p~n", + [From,Serial,To,Message]).

        The code that creates a process that runs this tracer function and sets that +process as the system tracer can look like this:

        start() ->
        +    Pid = spawn(?MODULE,tracer,[]),
        +    seq_trace:set_system_tracer(Pid), % set Pid as the system tracer
        +    ok.

        With a function like test/0, the whole example can be started:

        test() ->
        +    P = spawn(?MODULE, loop, [port]),
        +    register(call_server, spawn(?MODULE, loop, [])),
        +    start(),
        +    P ! {port,message}.
        @@ -816,11 +816,11 @@ tracing is disabled, otherwise Token should be an Erlang term returned from get_token/0 or set_token/1. set_token/1 can be used to temporarily exclude message passing from the trace by setting the -trace token to empty like this:

        OldToken = seq_trace:set_token([]), % set to empty and save
        +trace token to empty like this:

        OldToken = seq_trace:set_token([]), % set to empty and save
                                             % old value
         % do something that should not be part of the trace
        -io:format("Exclude the signalling caused by this~n"),
        -seq_trace:set_token(OldToken), % activate the trace token again
        +io:format("Exclude the signalling caused by this~n"),
        +seq_trace:set_token(OldToken), % activate the trace token again
         ...

        Returns the previous value of the trace token.

        /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/socket_usage.xhtml differs (HTML document, ASCII text, with very long lines (1001)) --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/socket_usage.xhtml 2026-06-04 00:07:21.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/socket_usage.xhtml 2042-07-06 13:26:49.000000000 +0000 @@ -81,47 +81,47 @@ Example

        This example is intended to show how to create a simple (echo) server -(and client).

        -module(example).
        +(and client).

        -module(example).
         
        --export([client/2, client/3]).
        --export([server/0, server/1, server/2]).
        +-export([client/2, client/3]).
        +-export([server/0, server/1, server/2]).
         
         
         %% ======================================================================
         
         %% === Client ===
         
        -client(#{family := Family} = ServerSockAddr, Msg)
        -  when is_list(Msg) orelse is_binary(Msg) ->
        -    {ok, Sock} = socket:open(Family, stream, default),
        -    ok         = maybe_bind(Sock, Family),
        -    ok         = socket:connect(Sock, ServerSockAddr),
        -    client_exchange(Sock, Msg);
        +client(#{family := Family} = ServerSockAddr, Msg)
        +  when is_list(Msg) orelse is_binary(Msg) ->
        +    {ok, Sock} = socket:open(Family, stream, default),
        +    ok         = maybe_bind(Sock, Family),
        +    ok         = socket:connect(Sock, ServerSockAddr),
        +    client_exchange(Sock, Msg);
         
        -client(ServerPort, Msg)
        -  when is_integer(ServerPort) andalso (ServerPort > 0) ->
        +client(ServerPort, Msg)
        +  when is_integer(ServerPort) andalso (ServerPort > 0) ->
             Family   = inet, % Default
        -    Addr     = get_local_addr(Family), % Pick an address
        -    SockAddr = #{family => Family,
        +    Addr     = get_local_addr(Family), % Pick an address
        +    SockAddr = #{family => Family,
         		 addr   => Addr,
        -		 port   => ServerPort},
        -    client(SockAddr, Msg).
        +		 port   => ServerPort},
        +    client(SockAddr, Msg).
         
        -client(ServerPort, ServerAddr, Msg)
        -  when is_integer(ServerPort) andalso (ServerPort > 0) andalso
        -       is_tuple(ServerAddr) ->
        -    Family   = which_family(ServerAddr),
        -    SockAddr = #{family => Family,
        +client(ServerPort, ServerAddr, Msg)
        +  when is_integer(ServerPort) andalso (ServerPort > 0) andalso
        +       is_tuple(ServerAddr) ->
        +    Family   = which_family(ServerAddr),
        +    SockAddr = #{family => Family,
         		 addr   => ServerAddr,
        -		 port   => ServerPort},
        -    client(SockAddr, Msg).
        +		 port   => ServerPort},
        +    client(SockAddr, Msg).
         
         %% Send the message to the (echo) server and wait for the echo to come back.
        -client_exchange(Sock, Msg) when is_list(Msg) ->
        -    client_exchange(Sock, list_to_binary(Msg));
        -client_exchange(Sock, Msg) when is_binary(Msg) ->
        -    ok = socket:send(Sock, Msg, infinity),
        -    {ok, Msg} = socket:recv(Sock, byte_size(Msg), infinity),
        +client_exchange(Sock, Msg) when is_list(Msg) ->
        +    client_exchange(Sock, list_to_binary(Msg));
        +client_exchange(Sock, Msg) when is_binary(Msg) ->
        +    ok = socket:send(Sock, Msg, infinity),
        +    {ok, Msg} = socket:recv(Sock, byte_size(Msg), infinity),
             ok.
         
         
        @@ -129,188 +129,188 @@
         
         %% === Server ===
         
        -server() ->
        +server() ->
             %% Make system choose port (and address)
        -    server(0).
        +    server(0).
         
         %% This function return the port and address that it actually uses,
         %% in case server/0 or server/1 (with a port number) was used to start it.
         
        -server(#{family := Family, addr := Addr, port := _} = SockAddr) ->
        -    {ok, Sock} = socket:open(Family, stream, tcp),
        -    ok         = socket:bind(Sock, SockAddr),
        -    ok         = socket:listen(Sock),
        -    {ok, #{port := Port}} = socket:sockname(Sock),
        -    Acceptor = start_acceptor(Sock),
        -    {ok, {Port, Addr, Acceptor}};
        +server(#{family := Family, addr := Addr, port := _} = SockAddr) ->
        +    {ok, Sock} = socket:open(Family, stream, tcp),
        +    ok         = socket:bind(Sock, SockAddr),
        +    ok         = socket:listen(Sock),
        +    {ok, #{port := Port}} = socket:sockname(Sock),
        +    Acceptor = start_acceptor(Sock),
        +    {ok, {Port, Addr, Acceptor}};
         
        -server(Port) when is_integer(Port) ->
        +server(Port) when is_integer(Port) ->
             Family   = inet, % Default
        -    Addr     = get_local_addr(Family), % Pick an address
        -    SockAddr = #{family => Family,
        +    Addr     = get_local_addr(Family), % Pick an address
        +    SockAddr = #{family => Family,
         		 addr   => Addr,
        -		 port   => Port},
        -    server(SockAddr).
        +		 port   => Port},
        +    server(SockAddr).
         
        -server(Port, Addr)
        -  when is_integer(Port) andalso (Port >= 0) andalso
        -       is_tuple(Addr) ->
        -    Family   = which_family(Addr),
        -    SockAddr = #{family => Family,
        +server(Port, Addr)
        +  when is_integer(Port) andalso (Port >= 0) andalso
        +       is_tuple(Addr) ->
        +    Family   = which_family(Addr),
        +    SockAddr = #{family => Family,
         		 addr   => Addr,
        -		 port   => Port},
        -    server(SockAddr).
        +		 port   => Port},
        +    server(SockAddr).
         
         
         %% --- Echo Server - Acceptor ---
         
        -start_acceptor(LSock) ->
        -    Self = self(),
        -    {Pid, MRef} = spawn_monitor(fun() -> acceptor_init(Self, LSock) end),
        -    receive
        -	{'DOWN', MRef, process, Pid, Info} ->
        -	    erlang:error({failed_starting_acceptor, Info});
        -	{Pid, started} ->
        +start_acceptor(LSock) ->
        +    Self = self(),
        +    {Pid, MRef} = spawn_monitor(fun() -> acceptor_init(Self, LSock) end),
        +    receive
        +	{'DOWN', MRef, process, Pid, Info} ->
        +	    erlang:error({failed_starting_acceptor, Info});
        +	{Pid, started} ->
         	    %% Transfer ownership
        -	    socket:setopt(LSock, otp, owner, Pid),
        -	    Pid ! {self(), continue},
        -	    erlang:demonitor(MRef),
        +	    socket:setopt(LSock, otp, owner, Pid),
        +	    Pid ! {self(), continue},
        +	    erlang:demonitor(MRef),
         	    Pid
             end.
             
        -acceptor_init(Parent, LSock) ->
        -    Parent ! {self(), started},
        +acceptor_init(Parent, LSock) ->
        +    Parent ! {self(), started},
             receive
        -	{Parent, continue} ->
        +	{Parent, continue} ->
         	    ok
             end,
        -    acceptor_loop(LSock).
        +    acceptor_loop(LSock).
         
        -acceptor_loop(LSock) ->
        -    case socket:accept(LSock, infinity) of
        -	{ok, ASock} ->
        -	    start_handler(ASock),
        -	    acceptor_loop(LSock);
        -	{error, Reason} ->
        -	    erlang:error({accept_failed, Reason})
        +acceptor_loop(LSock) ->
        +    case socket:accept(LSock, infinity) of
        +	{ok, ASock} ->
        +	    start_handler(ASock),
        +	    acceptor_loop(LSock);
        +	{error, Reason} ->
        +	    erlang:error({accept_failed, Reason})
             end.
         
         
         %% --- Echo Server - Handler ---
         
        -start_handler(Sock) ->
        -    Self = self(),
        -    {Pid, MRef} = spawn_monitor(fun() -> handler_init(Self, Sock) end),
        -    receive
        -	{'DOWN', MRef, process, Pid, Info} ->
        -	    erlang:error({failed_starting_handler, Info});
        -	{Pid, started} ->
        +start_handler(Sock) ->
        /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/socket.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (957))
        --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/socket.xhtml	2026-06-04 00:07:21.000000000 +0000
        +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/socket.xhtml	2042-07-06 13:26:49.000000000 +0000
        @@ -67,8 +67,8 @@
         completion_info/0 and the received completion message.

        The compiler may then optimize a following receive statement to only scan the messages that arrive after the reference/0 is created. If the message queue is large this is a big optimization.

        The reference/0 has to be unique for the call.

        Repeating an Operation on a select Systems

        Onselect systems, if a call would be repeated before the select -message has been received it replaces the call in progress:

            {select, {select_info, Handle}} = socket:accept(LSock, nowait),
        -    {error, timeout} = socket:accept(LSock, 500),
        +message has been received it replaces the call in progress:

            {select, {select_info, Handle}} = socket:accept(LSock, nowait),
        +    {error, timeout} = socket:accept(LSock, 500),
             :

        Above, Handle is no longer valid once the second accept/2, call has been made (the first call is automatically canceled). After the second accept/2 call returns {error, timeout}, @@ -101,28 +101,28 @@ Examples -

        client(SAddr, SPort) ->
        -   {ok, Sock} = socket:open(inet, stream, tcp),
        -   ok = socket:connect(Sock, #{family => inet,
        +
        client(SAddr, SPort) ->
        +   {ok, Sock} = socket:open(inet, stream, tcp),
        +   ok = socket:connect(Sock, #{family => inet,
                                        addr   => SAddr,
        -                               port   => SPort}),
        +                               port   => SPort}),
            Msg = <<"hello">>,
        -   ok = socket:send(Sock, Msg),
        -   ok = socket:shutdown(Sock, write),
        -   {ok, Msg} = socket:recv(Sock),
        -   ok = socket:close(Sock).
        -
        -server(Addr, Port) ->
        -   {ok, LSock} = socket:open(inet, stream, tcp),
        -   ok = socket:bind(LSock, #{family => inet,
        +   ok = socket:send(Sock, Msg),
        +   ok = socket:shutdown(Sock, write),
        +   {ok, Msg} = socket:recv(Sock),
        +   ok = socket:close(Sock).
        +
        +server(Addr, Port) ->
        +   {ok, LSock} = socket:open(inet, stream, tcp),
        +   ok = socket:bind(LSock, #{family => inet,
                                      port   => Port,
        -                             addr   => Addr}),
        -   ok = socket:listen(LSock),
        -   {ok, Sock} = socket:accept(LSock),
        -   {ok, Msg} = socket:recv(Sock),
        -   ok = socket:send(Sock, Msg),
        -   ok = socket:close(Sock),
        -   ok = socket:close(LSock).
        +
        addr => Addr}), + ok = socket:listen(LSock), + {ok, Sock} = socket:accept(LSock), + {ok, Msg} = socket:recv(Sock), + ok = socket:send(Sock, Msg), + ok = socket:close(Sock), + ok = socket:close(LSock).
        @@ -4674,7 +4674,7 @@ (since OTP 26.1).

        Result; a boolean/0.

      • tcp_info - Get miscellaneous TCP related information for a connected socket (since OTP 26.1).

        Result; a map/0 with information items as key-value pairs.

      Note

      Not all requests are supported by all platforms. To see if a ioctl request is supported on the current platform:

            Request = nread,
      -      true = socket:is_supported(ioctl_requests, Request),
      +      true = socket:is_supported(ioctl_requests, Request),
             :
      @@ -4838,7 +4838,7 @@

      Check if a socket feature is supported.

      Returns true if supports/0 has a {Key1, true} tuple or a {Key1, list()} tuple in its returned list, -otherwise false (also for unknown keys).

      Example:

      true = socket:is_supported(local),
      +otherwise false (also for unknown keys).

      Example:

      true = socket:is_supported(local),
      @@ -4869,7 +4869,7 @@

      Check if a socket feature is supported.

      Returns true if supports(Key1) has a {Key2, true} tuple -in its returned list, otherwise false (also for unknown keys).

      Example:

      true = socket:is_supported(msg_flags, errqueue),
      +in its returned list, otherwise false (also for unknown keys).

      Example:

      true = socket:is_supported(msg_flags, errqueue),
      @@ -4967,7 +4967,7 @@

      Start a socket monitor.

      If the Socket doesn't exist or when later the monitor is triggered, a 'DOWN' message is sent to the process that called monitor/1 -with the following pattern:

      	    {'DOWN', MonitorRef, socket, Socket, Info}

      Info is the termination reason of the socket or nosock if +with the following pattern:

      	    {'DOWN', MonitorRef, socket, Socket, Info}

      Info is the termination reason of the socket or nosock if Socket did not exist when the monitor was started.

      Making several calls to socket:monitor/1 for the same Socket is not an error; each call creates an independent monitor instance.

      /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/trace.xhtml differs (HTML document, ASCII text, with very long lines (4890)) --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/trace.xhtml 2026-06-04 00:07:21.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/kernel.epub/OEBPS/trace.xhtml 2042-07-06 13:26:49.000000000 +0000 @@ -41,23 +41,23 @@ messages. Several sessions can exist at the same time without interfering with each other. When a trace session is destroyed, all its trace settings are automatically cleaned up.

      Example:

      %% Create a tracer process that will receive the trace events
      -1> Tracer = spawn(fun F() -> receive M -> io:format("~p~n",[M]), F() end end).
      +1> Tracer = spawn(fun F() -> receive M -> io:format("~p~n",[M]), F() end end).
       <0.91.0>
       %% Create a session using the Tracer
      -2> Session = trace:session_create(my_session, Tracer, []).
      -{#Ref<0.1543805153.1548353537.92331>,{my_session, 0}}
      +2> Session = trace:session_create(my_session, Tracer, []).
      +{#Ref<0.1543805153.1548353537.92331>,{my_session, 0}}
       %% Setup call tracing on self()
      -3> trace:process(Session, self(), true, [call]).
      +3> trace:process(Session, self(), true, [call]).
       1
       %% Setup call tracing on lists:seq/2
      -4> trace:function(Session, {lists,seq,2}, [], []).
      +4> trace:function(Session, {lists,seq,2}, [], []).
       1
       %% Call the traced function
      -5> lists:seq(1, 10).
      -{trace,<0.89.0>,call,{lists,seq,[1,10]}} % The trace message
      -[1,2,3,4,5,6,7,8,9,10] % The return value
      +5> lists:seq(1, 10).
      +{trace,<0.89.0>,call,{lists,seq,[1,10]}} % The trace message
      +[1,2,3,4,5,6,7,8,9,10] % The return value
       %% Cleanup the trace session
      -6> trace:session_destroy(Session).
      +6> trace:session_destroy(Session).
       ok

      @@ -1201,9 +1201,9 @@ Match Specifications in Erlang in the User's Guide for the ERTS application.

    • true - Enable tracing for all received messages (to 'receive' traced processes). Any match specification is removed. This is the default.

    • false - Disable tracing for all received messages. Any match -specification is removed.

    Argument FlagList must be [] for receive tracing.

    The return value is always 1.

    Examples:

    Only trace messages from a specific process Pid:

    > trace:recv(Session, [{['_',Pid, '_'],[],[]}], []).
    -1

    Only trace messages matching {reply, _}:

    > trace:recv(Session, [{['_','_', {reply,'_'}],[],[]}], []).
    -1

    Only trace messages from other nodes:

    > trace:recv(Session, [{['$1', '_', '_'],[{'=/=','$1',{node}}],[]}], []).
    +specification is removed.

    Argument FlagList must be [] for receive tracing.

    The return value is always 1.

    Examples:

    Only trace messages from a specific process Pid:

    > trace:recv(Session, [{['_',Pid, '_'],[],[]}], []).
    +1

    Only trace messages matching {reply, _}:

    > trace:recv(Session, [{['_','_', {reply,'_'}],[],[]}], []).
    +1

    Only trace messages from other nodes:

    > trace:recv(Session, [{['$1', '_', '_'],[{'=/=','$1',{node}}],[]}], []).
     1

    Note

    A match specification for 'receive' trace can use all guard and body functions except caller, is_seq_trace, get_seq_token, set_seq_token, enable_trace, disable_trace, trace, silent, and process_dump.

    Fails by raising an error exception with an error reason of:

    • badarg - If an argument is invalid.

    • system_limit - If a match specification passed as argument has excessive @@ -1254,10 +1254,10 @@ Match Specifications in Erlang in the User's Guide for the ERTS application.

    • true - Enable tracing for all sent messages (from send traced processes). Any match specification is removed.

    • false - Disable tracing for all sent messages. Any match specification -is removed.

    Argument FlagList must be [].

    The return value is always 1.

    Examples:

    Only trace messages to a specific process Pid:

    > trace:send(Session, [{[Pid, '_'],[],[]}], []).
    -1

    Only trace messages matching {reply, _}:

    > trace:send(Session, [{['_', {reply,'_'}],[],[]}], []).
    -1

    Only trace messages sent to the sender itself:

    > trace:send(Session, [{['$1', '_'],[{'=:=','$1',{self}}],[]}], []).
    -1

    Only trace messages sent to other nodes:

    > trace:send(Session, [{['$1', '_'],[{'=/=',{node,'$1'},{node}}],[]}], []).
    +is removed.

    Argument FlagList must be [].

    The return value is always 1.

    Examples:

    Only trace messages to a specific process Pid:

    > trace:send(Session, [{[Pid, '_'],[],[]}], []).
    +1

    Only trace messages matching {reply, _}:

    > trace:send(Session, [{['_', {reply,'_'}],[],[]}], []).
    +1

    Only trace messages sent to the sender itself:

    > trace:send(Session, [{['$1', '_'],[{'=:=','$1',{self}}],[]}], []).
    +1

    Only trace messages sent to other nodes:

    > trace:send(Session, [{['$1', '_'],[{'=/=',{node,'$1'},{node}}],[]}], []).
     1

    Note

    A match specification for send trace can use all guard and body functions except caller.

    Fails by raising an error exception with an error reason of:

    Equivalent to log(Level, FormatOrFun, Args, #{}) if called as log(Level, FormatOrFun, Args).

    @@ -2431,12 +2431,12 @@ useful in scenarios when the message/metadata is very expensive to compute. This is because the fun is only evaluated when the message/metadata is actually needed, which may be not at all if the log event is not to be logged. Examples:

    %% A plain string with expensive metadata
    -1> logger:info(fun([]) -> {"Hello World", #{ meta => expensive() }} end,[]).
    +1> logger:info(fun([]) -> {"Hello World", #{ meta => expensive() }} end,[]).
     %% An expensive report
    -2> logger:debug(fun(What) -> #{ what => What, cause => expensive() } end,roof).
    +2> logger:debug(fun(What) -> #{ what => What, cause => expensive() } end,roof).
     %% A plain string with expensive metadata and normal metadata
    -3> logger:debug(fun([]) -> {"Hello World", #{ meta => expensive() }} end,[],
    -               #{ meta => data }).

    When metadata is given both as an argument and returned from the fun they are +3> logger:debug(fun([]) -> {"Hello World", #{ meta => expensive() }} end,[], + #{ meta => data }).

    When metadata is given both as an argument and returned from the fun they are merged. If equal keys exists the values are taken from the metadata returned by the fun.

    @@ -2759,26 +2759,26 @@ consistent no matter which handler the system uses. Normal usage is to add a call to logger:add_handlers/1 just after the processes that the handler needs are started, and pass the application's logger configuration as the argument. -For example:

    -behaviour(application).
    -start(_, []) ->
    -    case supervisor:start_link({local, my_sup}, my_sup, []) of
    -        {ok, Pid} ->
    -            ok = logger:add_handlers(my_app),
    -            {ok, Pid, []};
    +For example:

    -behaviour(application).
    +start(_, []) ->
    +    case supervisor:start_link({local, my_sup}, my_sup, []) of
    +        {ok, Pid} ->
    +            ok = logger:add_handlers(my_app),
    +            {ok, Pid, []};
             Error -> Error
          end.

    This reads the logger configuration parameter from the my_app application and starts the configured handlers. The contents of the configuration use the same rules as the logger handler configuration.

    If the handler is meant to replace the default handler, the Kernel's default handler have to be disabled before the new handler is added. A sys.config file -that disables the Kernel handler and adds a custom handler could look like this:

    [{kernel,
    -  [{logger,
    +that disables the Kernel handler and adds a custom handler could look like this:

    [{kernel,
    +  [{logger,
         %% Disable the default Kernel handler
    -    [{handler, default, undefined}]}]},
    - {my_app,
    -  [{logger,
    +    [{handler, default, undefined}]}]},
    + {my_app,
    +  [{logger,
         %% Enable this handler as the default
    -    [{handler, default, my_handler, #{}}]}]}].
    +
    [{handler, default, my_handler, #{}}]}]}].
    @@ -3733,8 +3733,8 @@ -

    Update the formatter configuration for the specified handler.

    The new configuration is merged with the existing formatter configuration.

    To overwrite the existing configuration without any merge, use

    set_handler_config(HandlerId, formatter,
    -	      {FormatterModule, FormatterConfig}).
    +

    Update the formatter configuration for the specified handler.

    The new configuration is merged with the existing formatter configuration.

    To overwrite the existing configuration without any merge, use

    set_handler_config(HandlerId, formatter,
    +	      {FormatterModule, FormatterConfig}).
    @@ -3797,8 +3797,8 @@

    Update configuration data for the specified handler. This function behaves as if -it was implemented as follows:

    {ok, {_, Old}} = logger:get_handler_config(HandlerId),
    -logger:set_handler_config(HandlerId, maps:merge(Old, Config)).

    To overwrite the existing configuration without any merge, use +it was implemented as follows:

    {ok, {_, Old}} = logger:get_handler_config(HandlerId),
    +logger:set_handler_config(HandlerId, maps:merge(Old, Config)).

    To overwrite the existing configuration without any merge, use set_handler_config/2 .

    @@ -3891,8 +3891,8 @@

    Update primary configuration data for Logger. This function behaves as if it was -implemented as follows:

    Old = logger:get_primary_config(),
    -logger:set_primary_config(maps:merge(Old, Config)).

    To overwrite the existing configuration without any merge, use +implemented as follows:

    Old = logger:get_primary_config(),
    +logger:set_primary_config(maps:merge(Old, Config)).

    To overwrite the existing configuration without any merge, use set_primary_config/1 .

    @@ -3924,7 +3924,7 @@

    Set or update metadata to use when logging from current process

    If process metadata exists for the current process, this function behaves as if -it was implemented as follows:

    logger:set_process_metadata(maps:merge(logger:get_process_metadata(), Meta)).

    If no process metadata exists, the function behaves as +it was implemented as follows:

    logger:set_process_metadata(maps:merge(logger:get_process_metadata(), Meta)).

    If no process metadata exists, the function behaves as set_process_metadata/1 .

    @@ -3956,8 +3956,8 @@

    Update configuration data for the Logger proxy. This function behaves as if it -was implemented as follows:

    Old = logger:get_proxy_config(),
    -logger:set_proxy_config(maps:merge(Old, Config)).

    To overwrite the existing configuration without any merge, use +was implemented as follows:

    Old = logger:get_proxy_config(),
    +logger:set_proxy_config(maps:merge(Old, Config)).

    To overwrite the existing configuration without any merge, use set_proxy_config/1 .

    For more information about the proxy, see section Logger Proxy in the Kernel User's Guide.

    @@ -4135,7 +4135,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger_chapter.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1531)) --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger_chapter.html 2026-06-04 19:05:11.021529894 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger_chapter.html 2026-06-04 19:05:11.021529894 +0000 @@ -190,7 +190,7 @@

    The API for logging consists of a set of macros, and a set of functions on the form logger:Level/1,2,3, which are all shortcuts for logger:log(Level,Arg1[,Arg2[,Arg3]]).

    The macros are defined in logger.hrl, which is included in a module with the -directive

    -include_lib("kernel/include/logger.hrl").

    The difference between using the macros and the exported functions is that +directive

    -include_lib("kernel/include/logger.hrl").

    The difference between using the macros and the exported functions is that macros add location (originator) information to the metadata, and performs lazy evaluation by wrapping the logger call in a case statement, so it is only evaluated if the log level of the event passes the primary log level check.

    @@ -212,23 +212,23 @@

    The log message contains the information to be logged. The message can consist of a format string and arguments (given as two separate parameters in the Logger -API), a string or a report.

    Example, format string and arguments:

    logger:error("The file does not exist: ~ts",[Filename])

    Example, string:

    logger:notice("Something strange happened!")

    A report, which is either a map or a key-value list, is the preferred way to log +API), a string or a report.

    Example, format string and arguments:

    logger:error("The file does not exist: ~ts",[Filename])

    Example, string:

    logger:notice("Something strange happened!")

    A report, which is either a map or a key-value list, is the preferred way to log using Logger as it makes it possible for different backends to filter and format -the log event as it needs to.

    Example, report:

    ?LOG_ERROR(#{ user => joe, filename => Filename, reason => enoent })

    Reports can be accompanied by a report callback specified in the log event's +the log event as it needs to.

    Example, report:

    ?LOG_ERROR(#{ user => joe, filename => Filename, reason => enoent })

    Reports can be accompanied by a report callback specified in the log event's metadata. The report callback is a convenience function that the formatter can use to convert the report to a format string and arguments, or directly to a string. The formatter can also use its own conversion function, if no callback is provided, or if a customized formatting is desired.

    The report callback must be a fun with one or two arguments. If it takes one argument, this is the report itself, and the fun returns a format string and -arguments:

    fun((logger:report()) -> {io:format(),[term()]})

    If it takes two arguments, the first is the report, and the second is a map -containing extra data that allows direct conversion to a string:

    fun((logger:report(),logger:report_cb_config()) -> unicode:chardata())

    The fun must obey the depth and chars_limit parameters provided in the +arguments:

    fun((logger:report()) -> {io:format(),[term()]})

    If it takes two arguments, the first is the report, and the second is a map +containing extra data that allows direct conversion to a string:

    fun((logger:report(),logger:report_cb_config()) -> unicode:chardata())

    The fun must obey the depth and chars_limit parameters provided in the second argument, as the formatter cannot do anything useful of these parameters with the returned string. The extra data also contains a field named single_line, indicating if the printed log message may contain line breaks or not. This variant is used when the formatting of the report depends on the size -or single line parameters.

    Example, report, and metadata with report callback:

    logger:debug(#{got => connection_request, id => Id, state => State},
    -             #{report_cb => fun(R) -> {"~p",[R]} end})

    The log message can also be provided through a fun for lazy evaluation. The fun +or single line parameters.

    Example, report, and metadata with report callback:

    logger:debug(#{got => connection_request, id => Id, state => State},
    +             #{report_cb => fun(R) -> {"~p",[R]} end})

    The log message can also be provided through a fun for lazy evaluation. The fun is only evaluated if the primary log level check passes, and is therefore recommended if it is expensive to generate the message. The lazy fun must return a string, a report, or a tuple with format string and arguments.

    @@ -416,14 +416,14 @@ allows another application to add its own default handler.

    Only one entry of this type is allowed.

  • {handler, HandlerId, Module, HandlerConfig} - If HandlerId is default, then this entry modifies the default handler, equivalent to calling

            logger:remove_handler(default)
    -

    followed by

            logger:add_handler(default, Module, HandlerConfig)
    +

    followed by

            logger:add_handler(default, Module, HandlerConfig)
     

    For all other values of HandlerId, this entry adds a new handler, -equivalent to calling

            logger:add_handler(HandlerId, Module, HandlerConfig)
    +equivalent to calling

            logger:add_handler(HandlerId, Module, HandlerConfig)
     

    Multiple entries of this type are allowed.

  • {filters, FilterDefault, [Filter]} - Adds the specified primary -filters.

    • FilterDefault = log | stop

    • Filter = {FilterId, {FilterFun, FilterConfig}}

    Equivalent to calling

            logger:add_primary_filter(FilterId, {FilterFun, FilterConfig})
    +filters.

    • FilterDefault = log | stop

    • Filter = {FilterId, {FilterFun, FilterConfig}}

    Equivalent to calling

            logger:add_primary_filter(FilterId, {FilterFun, FilterConfig})
     

    for each Filter.

    FilterDefault specifies the behaviour if all primary filters return ignore, see section Filters.

    Only one entry of this type is allowed.

  • {module_level, Level, [Module]} - Sets module log level for the given -modules. Equivalent to calling

            logger:set_module_level(Module, Level)

    for each Module.

    Multiple entries of this type are allowed.

  • {proxy, ProxyConfig} - Sets the proxy configuration, equivalent to +modules. Equivalent to calling

            logger:set_module_level(Module, Level)

    for each Module.

    Multiple entries of this type are allowed.

  • {proxy, ProxyConfig} - Sets the proxy configuration, equivalent to calling

            logger:set_proxy_config(ProxyConfig)
     

    Only one entry of this type is allowed.

  • See section Configuration Examples for examples using the logger parameter for system configuration.

  • logger_metadata = map() - Specifies the primary @@ -446,31 +446,31 @@ file. See the config(4) manual page for more information about this file.

    Each of the following examples shows a simple system configuration file that configures Logger according to the description.

    Modify the default handler to print to a file instead of -standard_io:

    [{kernel,
    -  [{logger,
    -    [{handler, default, logger_std_h,  % {handler, HandlerId, Module,
    -      #{config => #{file => "log/erlang.log"}}}  % Config}
    -    ]}]}].

    Modify the default handler to print each log event as a single line:

    [{kernel,
    -  [{logger,
    -    [{handler, default, logger_std_h,
    -      #{formatter => {logger_formatter, #{single_line => true}}}}
    -    ]}]}].

    Modify the default handler to print the pid of the logging process for each log -event:

    [{kernel,
    -  [{logger,
    -    [{handler, default, logger_std_h,
    -      #{formatter => {logger_formatter,
    -                        #{template => [time," ",pid," ",msg,"\n"]}}}}
    -    ]}]}].

    Modify the default handler to only print errors and more severe log events to +standard_io:

    [{kernel,
    +  [{logger,
    +    [{handler, default, logger_std_h,  % {handler, HandlerId, Module,
    +      #{config => #{file => "log/erlang.log"}}}  % Config}
    +    ]}]}].

    Modify the default handler to print each log event as a single line:

    [{kernel,
    +  [{logger,
    +    [{handler, default, logger_std_h,
    +      #{formatter => {logger_formatter, #{single_line => true}}}}
    +    ]}]}].

    Modify the default handler to print the pid of the logging process for each log +event:

    [{kernel,
    +  [{logger,
    +    [{handler, default, logger_std_h,
    +      #{formatter => {logger_formatter,
    +                        #{template => [time," ",pid," ",msg,"\n"]}}}}
    +    ]}]}].

    Modify the default handler to only print errors and more severe log events to "log/erlang.log", and add another handler to print all log events to -"log/debug.log".

    [{kernel,
    -  [{logger,
    -    [{handler, default, logger_std_h,
    -      #{level => error,
    -        config => #{file => "log/erlang.log"}}},
    -     {handler, info, logger_std_h,
    -      #{level => debug,
    -        config => #{file => "log/debug.log"}}}
    -    ]}]}].

    +"log/debug.log".

    [{kernel,
    +  [{logger,
    +    [{handler, default, logger_std_h,
    +      #{level => error,
    +        config => #{file => "log/erlang.log"}}},
    +     {handler, info, logger_std_h,
    +      #{level => debug,
    +        config => #{file => "log/debug.log"}}}
    +    ]}]}].

    @@ -511,9 +511,9 @@ This field can be used by filters to stop or allow the log events.

    See section SASL User's Guide for more information about the old SASL error logging functionality.

  • Legacy Event Handlers
    To use event handlers written for error_logger, just add your event handler with

    error_logger:add_report_handler/1,2.

    This automatically starts the error logger event manager, and adds -error_logger as a handler to Logger, with the following configuration:

    #href_anchor"ss">level => info,
    +error_logger as a handler to Logger, with the following configuration:

    #href_anchor"ss">level => info,
       filter_default => log,
    -  filters => []}.

    Note

    This handler ignores events that do not originate from the error_logger + filters => []}.

    Note

    This handler ignores events that do not originate from the error_logger API, or from within OTP. This means that if your code uses the Logger API for logging, then your log events will be discarded by this handler.

    The handler is not overload protected.

  • @@ -539,19 +539,19 @@ level notice or more severe, are logged to the terminal via the default handler. To also log info events, you can either change the primary log level to info:

    1> logger:set_primary_config(level, info).
    -ok

    or set the level for one or a few modules only:

    2> logger:set_module_level(mymodule, info).
    +ok

    or set the level for one or a few modules only:

    2> logger:set_module_level(mymodule, info).
     ok

    This allows info events to pass through to the default handler, and be printed to the terminal as well. If there are many info events, it can be useful to print these to a file instead.

    First, set the log level of the default handler to notice, preventing it from -printing info events to the terminal:

    3> logger:set_handler_config(default, level, notice).
    +printing info events to the terminal:

    3> logger:set_handler_config(default, level, notice).
     ok

    Then, add a new handler which prints to file. You can use the handler module -logger_std_h, and configure it to log to file:

    4> Config = #href_anchor"ss">config => #{file => "./info.log"}, level => info}.
    -#{config => #{file => "./info.log"},level => info}
    -5> logger:add_handler(myhandler, logger_std_h, Config).
    +logger_std_h, and configure it to log to file:

    4> Config = #href_anchor"ss">config => #{file => "./info.log"}, level => info}.
    +#{config => #{file => "./info.log"},level => info}
    +5> logger:add_handler(myhandler, logger_std_h, Config).
     ok

    Since filter_default defaults to log, this handler now receives all log events. If you want info events only in the file, you must add a filter to stop -all non-info events. The built-in filter logger_filters:level/2 can do this:

    6> logger:add_handler_filter(myhandler, stop_non_info,
    -                             {fun logger_filters:level/2, {stop, neq, info}}).
    +all non-info events. The built-in filter logger_filters:level/2 can do this:

    6> logger:add_handler_filter(myhandler, stop_non_info,
    +                             {fun logger_filters:level/2, {stop, neq, info}}).
     ok

    See section Filters for more information about the filters and the filter_default configuration parameter.

    @@ -576,48 +576,48 @@ database.

    When logger:get_config/0 or logger:get_handler_config/0,1 is called, Logger calls HModule:filter_config(Config). This function must return the -handler configuration where internal data is removed.

    A simple handler that prints to the terminal can be implemented as follows:

    -module(myhandler1).
    --export([log/2]).
    +handler configuration where internal data is removed.

    A simple handler that prints to the terminal can be implemented as follows:

    -module(myhandler1).
    +-export([log/2]).
     
    -log(LogEvent, #{formatter := {FModule, FConfig}}) ->
    -    io:put_chars(FModule:format(LogEvent, FConfig)).

    Notice that the above handler does not have any overload protection, and all log +log(LogEvent, #{formatter := {FModule, FConfig}}) -> + io:put_chars(FModule:format(LogEvent, FConfig)).

    Notice that the above handler does not have any overload protection, and all log events are printed directly from the client process.

    For information and examples of overload protection, please refer to section Protecting the Handler from Overload, and the implementation of logger_std_h and logger_disk_log_h .

    The following is a simpler example of a handler which logs to a file through one -single process:

    -module(myhandler2).
    --export([adding_handler/1, removing_handler/1, log/2]).
    --export([init/1, handle_call/3, handle_cast/2, terminate/2]).
    -
    -adding_handler(Config) ->
    -    MyConfig = maps:get(config,Config,#href_anchor"ss">file => "myhandler2.log"}),
    -    {ok, Pid} = gen_server:start(?MODULE, MyConfig, []),
    -    {ok, Config#{config => MyConfig#{pid => Pid}}}.
    -
    -removing_handler(#{config := #{pid := Pid}}) ->
    -    gen_server:stop(Pid).
    -
    -log(LogEvent,#{config := #{pid := Pid}} = Config) ->
    -    gen_server:cast(Pid, {log, LogEvent, Config}).
    -
    -init(#{file := File}) ->
    -    {ok, Fd} = file:open(File, [append, {encoding, utf8}]),
    -    {ok, #{file => File, fd => Fd}}.
    -
    -handle_call(_, _, State) ->
    -    {reply, {error, bad_request}, State}.
    -
    -handle_cast({log, LogEvent, Config}, #{fd := Fd} = State) ->
    -    do_log(Fd, LogEvent, Config),
    -    {noreply, State}.
    +single process:

    -module(myhandler2).
    +-export([adding_handler/1, removing_handler/1, log/2]).
    +-export([init/1, handle_call/3, handle_cast/2, terminate/2]).
    /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger_cookbook.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1412))
    --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger_cookbook.html	2026-06-04 19:05:11.045530117 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger_cookbook.html	2026-06-04 19:05:11.045530117 +0000
    @@ -144,19 +144,19 @@
       
       Print the primary Logger configurations.
     

    -
    1> logger:i(primary).
    +
    1> logger:i(primary).
     Primary configuration:
         Level: notice
         Filter Default: log
         Filters:
    -        (none)

    It is also possible to fetch the configuration using + (none)

    It is also possible to fetch the configuration using logger:get_primary_config().

    See also

    -
    2> logger:i(handlers).
    +
    2> logger:i(handlers).
     Handler configuration:
         Id: default
             Module: logger_std_h
    @@ -173,10 +173,10 @@
                     Arg: stop
                 Id: domain
                     Fun: fun logger_filters:domain/2
    -                Arg: {log,super,[otp,sasl]}
    +                Arg: {log,super,[otp,sasl]}
                 Id: no_domain
                     Fun: fun logger_filters:domain/2
    -                Arg: {log,undefined,[]}
    +                Arg: {log,undefined,[]}
             Handler Config:
                 burst_limit_enable: true
                 burst_limit_max_count: 500
    @@ -215,7 +215,7 @@
     =PROGRESS REPORT==== 4-Nov-2019::16:33:11.746546 ===
         application: stdlib
         started_at: nonode@nohost
    -Eshell V10.5.3  (abort with ^G)
    +Eshell V10.5.3  (abort with ^G)
     1>

    @@ -233,17 +233,17 @@

    Since single line logging is the default of the built-in formatter you only have to provide the empty map as the configuration. The example below uses the sys.config to change the formatter configuration.

    $ cat sys.config
    -[{kernel,
    -  [{logger,
    -    [{handler, default, logger_std_h,
    -      #{ formatter => {logger_formatter, #{ }}}}]}]}].
    +[{kernel,
    +  [{logger,
    +    [{handler, default, logger_std_h,
    +      #{ formatter => {logger_formatter, #{ }}}}]}]}].
     $ erl -config sys
    -Eshell V10.5.1  (abort with ^G)
    -1> logger:error("Oh noes, an error").
    +Eshell V10.5.1  (abort with ^G)
    +1> logger:error("Oh noes, an error").
     1962-10-03T11:07:47.466763-04:00 error: Oh noes, an error

    However, if you just want to change it for the current session you can also do -that.

    1> logger:set_handler_config(default, formatter, {logger_formatter, #{}}).
    +that.

    1> logger:set_handler_config(default, formatter, {logger_formatter, #{}}).
     ok
    -2> logger:error("Oh noes, another error").
    +2> logger:error("Oh noes, another error").
     1962-10-04T15:34:02.648713-04:00 error: Oh noes, another error

    See also

    @@ -251,14 +251,14 @@ Add file and line number to log entries

    You can change what is printed to the log by using the formatter template:

    $ cat sys.config
    -[{kernel,
    -  [{logger,
    -    [{handler, default, logger_std_h,
    -      #{ formatter => {logger_formatter,
    -        #{ template => [time," ", file,":",line," ",level,": ",msg,"\n"] }}}}]}]}].
    +[{kernel,
    +  [{logger,
    +    [{handler, default, logger_std_h,
    +      #{ formatter => {logger_formatter,
    +        #{ template => [time," ", file,":",line," ",level,": ",msg,"\n"] }}}}]}]}].
     $ erl -config sys
    -Eshell V10.5.1  (abort with ^G)
    -1> logger:error("Oh noes, more errors",#{ file => "shell.erl", line => 1 }).
    +Eshell V10.5.1  (abort with ^G)
    +1> logger:error("Oh noes, more errors",#{ file => "shell.erl", line => 1 }).
     1962-10-05T07:37:44.104241+02:00 shell.erl:1 error: Oh noes, more errors

    Note that file and line have to be added in the metadata by the caller of logger:log/3 as otherwise Logger will not know from where it was called. The file and line number are automatically added if you use the ?LOG_ERROR macros @@ -275,18 +275,18 @@ Print logs to a file

    Instead of printing the logs to stdout we print them to a rotating file log.

    $ cat sys.config
    -[{kernel,
    -  [{logger,
    -    [{handler, default, logger_std_h,
    -      #{ config => #{ file => "log/erlang.log",
    +[{kernel,
    +  [{logger,
    +    [{handler, default, logger_std_h,
    +      #{ config => #{ file => "log/erlang.log",
                           max_no_bytes => 4096,
    -                      max_no_files => 5},
    -         formatter => {logger_formatter, #{}}}}]}]}].
    +                      max_no_files => 5},
    +         formatter => {logger_formatter, #{}}}}]}]}].
     $ erl -config sys
    -Eshell V10.5.1  (abort with ^G)
    -1> logger:error("Oh noes, even more errors").
    +Eshell V10.5.1  (abort with ^G)
    +1> logger:error("Oh noes, even more errors").
     ok
    -2> erlang:halt().
    +2> erlang:halt().
     $ cat log/erlang.log
     2019-10-07T11:47:16.837958+02:00 error: Oh noes, even more errors

    See also

    @@ -296,24 +296,24 @@

    Add a handler that prints debug log events to a file, while the default handler prints only up to notice level events to standard out.

    $ cat sys.config
    -[{kernel,
    -  [{logger_level, all},
    -   {logger,
    -    [{handler, default, logger_std_h,
    -      #{ level => notice }},
    -     {handler, debug, logger_std_h,
    -      #{ filters => [{debug,{fun logger_filters:level/2, {stop, neq, debug}}}],
    -         config => #{ file => "log/debug.log" } }}
    -    ]}]}].
    +[{kernel,
    +  [{logger_level, all},
    +   {logger,
    +    [{handler, default, logger_std_h,
    +      #{ level => notice }},
    +     {handler, debug, logger_std_h,
    +      #{ filters => [{debug,{fun logger_filters:level/2, {stop, neq, debug}}}],
    +         config => #{ file => "log/debug.log" } }}
    +    ]}]}].
     $ erl -config sys
    -Eshell V10.5.1  (abort with ^G)
    -1> logger:error("Oh noes, even more errors").
    +Eshell V10.5.1  (abort with ^G)
    +1> logger:error("Oh noes, even more errors").
     =ERROR REPORT==== 9-Oct-2019::14:40:54.784162 ===
     Oh noes, even more errors
     ok
    -2> logger:debug("A debug event").
    +2> logger:debug("A debug event").
     ok
    -3> erlang:halt().
    +3> erlang:halt().
     $ cat log/debug.log
     2019-10-09T14:41:03.680541+02:00 debug: A debug event

    In the configuration above we first raise the primary log level to max in order for the debug log events to get to the handlers. Then we configure the default @@ -321,13 +321,13 @@ is all. Then the debug handler is configured with a filter to stop any log message that is not a debug level message.

    It is also possible to do the same changes in an already running system using the logger module. Then you do like this:

    $ erl
    -1> logger:set_handler_config(default, level, notice).
    +1> logger:set_handler_config(default, level, notice).
     ok
    -2> logger:add_handler(debug, logger_std_h, #{
    -  filters => [{debug,{fun logger_filters:level/2, {stop, neq, debug}}}],
    -  config => #{ file => "log/debug.log" } }).
    +2> logger:add_handler(debug, logger_std_h, #{
    +  filters => [{debug,{fun logger_filters:level/2, {stop, neq, debug}}}],
    +  config => #{ file => "log/debug.log" } }).
     ok
    -3> logger:set_primary_config(level, all).
    +3> logger:set_primary_config(level, all).
     ok

    It is important that you do not raise the primary log level before adjusting the default handler's level as otherwise your standard out may be flooded by debug log messages.

    See also

    @@ -343,7 +343,7 @@ What to log and how

    The simplest way to log something is by using the Logger macros and give a -report to the macro. For example if you want to log an error:

    ?LOG_ERROR(#{ what => http_error, status => 418, src => ClientIP, dst => ServerIP }).

    This will print the following in the default log:

    =ERROR REPORT==== 10-Oct-2019::12:13:10.089073 ===
    +report to the macro. For example if you want to log an error:

    ?LOG_ERROR(#{ what => http_error, status => 418, src => ClientIP, dst => ServerIP }).

    This will print the following in the default log:

    =ERROR REPORT==== 10-Oct-2019::12:13:10.089073 ===
         dst: {8,8,4,4}
         src: {8,8,8,8}
         status: 418
    @@ -355,14 +355,14 @@
     

    If you want to do structured logging, but still want to have some control of how the final log message is formatted you can give a report_cb as part of the -metadata with your log event.

    ReportCB = fun(#{ what := What, status := Status, src := Src, dst := Dst }) ->
    -                   {ok, #hostent{ h_name = SrcName }} = inet:gethostbyaddr(Src),
    -                   {ok, #hostent{ h_name = DstName }} = inet:gethostbyaddr(Dst),
    -                   {"What: ~p~nStatus: ~p~nSrc: ~s (~s)~nDst: ~s (~s)~n",
    -                    [What, Status, inet:ntoa(Src), SrcName, inet:ntoa(Dst), DstName]}
    +metadata with your log event.

    ReportCB = fun(#{ what := What, status := Status, src := Src, dst := Dst }) ->
    +                   {ok, #hostent{ h_name = SrcName }} = inet:gethostbyaddr(Src),
    /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger_disk_log_h.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (463))
    --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger_disk_log_h.html	2026-06-04 19:05:11.064530293 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger_disk_log_h.html	2026-06-04 19:05:11.064530293 +0000
    @@ -164,12 +164,12 @@
     and the disk_log handler, and are documented in the
     User's Guide.

    Notice that when changing the configuration of the handler in runtime, the disk_log options (file, type, max_no_files, max_no_bytes) must not be -modified.

    Example of adding a disk_log handler:

    logger:add_handler(my_disk_log_h, logger_disk_log_h,
    -                   #{config => #{file => "./my_disk_log",
    +modified.

    Example of adding a disk_log handler:

    logger:add_handler(my_disk_log_h, logger_disk_log_h,
    +                   #{config => #{file => "./my_disk_log",
                                      type => wrap,
                                      max_no_files => 4,
                                      max_no_bytes => 10000,
    -                                 filesync_repeat_interval => 1000}}).

    To use the disk_log handler instead of the default standard handler when + filesync_repeat_interval => 1000}}).

    To use the disk_log handler instead of the default standard handler when starting an Erlang node, change the Kernel default logger to use logger_disk_log_h. Example:

    erl -kernel logger '[{handler,default,logger_disk_log_h,
                           #{config => #{file => "./system_disk_log"}}}]'

    @@ -275,7 +275,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger_filters.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1103)) --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger_filters.html 2026-06-04 19:05:11.084530479 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger_filters.html 2026-06-04 19:05:11.084530479 +0000 @@ -251,8 +251,8 @@ events from, for example, a specific functional area. This allows filtering or other specialized treatment in a Logger handler.

    A domain field must be a list of atoms, creating smaller and more specialized domains as the list grows longer. The greatest domain is [], which comprises -all possible domains.

    For example, consider the following domains:

    D1 = [otp]
    -D2 = [otp, sasl]

    D1 is the greatest of the two, and is said to be a super-domain of D2. D2 +all possible domains.

    For example, consider the following domains:

    D1 = [otp]
    +D2 = [otp, sasl]

    D1 is the greatest of the two, and is said to be a super-domain of D2. D2 is a sub-domain D1. Both D1 and D2 are sub-domains of [].

    The above domains are used for logs originating from Erlang/OTP. D1 specifies that the log event comes from Erlang/OTP in general, and D2 indicates that the log event is a so called SASL report.

    The Extra parameter to the domain/2 function is specified when @@ -267,11 +267,11 @@ filter matches and Action is stop, the log event is stopped.

    If the filter does not match, it returns ignore, meaning that other filters, or the value of the configuration parameter filter_default, decide if the event is allowed or not.

    Log events that do not contain any domain field, match only when Compare is -equal to undefined or not_equal.

    Example: stop all events with domain [otp, sasl | _]

    1> logger:set_handler_config(h1, filter_default, log). % this is the default
    +equal to undefined or not_equal.

    Example: stop all events with domain [otp, sasl | _]

    1> logger:set_handler_config(h1, filter_default, log). % this is the default
     ok
    -2> Filter = {fun logger_filters:domain/2, {stop, sub, [otp, sasl]}}.
    +2> Filter = {fun logger_filters:domain/2, {stop, sub, [otp, sasl]}}.
     ...
    -3> logger:add_handler_filter(h1, no_sasl, Filter).
    +3> logger:add_handler_filter(h1, no_sasl, Filter).
     ok
    @@ -316,9 +316,9 @@ filter matches if the value of Operator is:

    • neq - and the compare function returns lt or gt.

    • eq - and the compare function returns eq.

    • lt - and the compare function returns lt.

    • gt - and the compare function returns gt.

    • lteq - and the compare function returns lt or eq.

    • gteq - and the compare function returns gt or eq.

    If the filter matches and Action is log, the log event is allowed. If the filter matches and Action is stop, the log event is stopped.

    If the filter does not match, it returns ignore, meaning that other filters, or the value of the configuration parameter filter_default, will decide if the -event is allowed or not.

    Example: only allow debug level log events

    logger:set_handler_config(h1, filter_default, stop).
    -Filter = {fun logger_filters:level/2, {log, eq, debug}}.
    -logger:add_handler_filter(h1, debug_only, Filter).
    +event is allowed or not.

    Example: only allow debug level log events

    logger:set_handler_config(h1, filter_default, stop).
    +Filter = {fun logger_filters:level/2, {log, eq, debug}}.
    +logger:add_handler_filter(h1, debug_only, Filter).
     ok
    @@ -414,7 +414,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger_formatter.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (774)) --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger_formatter.html 2026-06-04 19:05:11.104530664 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger_formatter.html 2026-06-04 19:05:11.104530664 +0000 @@ -625,7 +625,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger_handler.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (434)) --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger_handler.html 2026-06-04 19:05:11.123530840 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger_handler.html 2026-06-04 19:05:11.123530840 +0000 @@ -600,7 +600,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger_std_h.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (618)) --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger_std_h.html 2026-06-04 19:05:11.141531007 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/logger_std_h.html 2026-06-04 19:05:11.141531007 +0000 @@ -185,9 +185,9 @@ protection behaviour. The same parameters are used both in the standard handler and the disk_log handler, and are documented in the User's Guide.

    Notice that if changing the configuration of the handler in runtime, the type, -file, or modes parameters must not be modified.

    Example of adding a standard handler:

    logger:add_handler(my_standard_h, logger_std_h,
    -                   #{config => #{file => "./system_info.log",
    -                                 filesync_repeat_interval => 1000}}).

    To set the default handler, that starts initially with the Kernel application, +file, or modes parameters must not be modified.

    Example of adding a standard handler:

    logger:add_handler(my_standard_h, logger_std_h,
    +                   #{config => #{file => "./system_info.log",
    +                                 filesync_repeat_interval => 1000}}).

    To set the default handler, that starts initially with the Kernel application, to log to file instead of standard_io, change the Kernel default logger configuration. Example:

    erl -kernel logger '[{handler,default,logger_std_h,
                           #{config => #{file => "./log.log"}}}]'

    An example of how to replace the standard handler with a disk_log handler at @@ -294,7 +294,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/net.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (573)) --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/net.html 2026-06-04 19:05:11.167531248 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/net.html 2026-06-04 19:05:11.167531248 +0000 @@ -565,13 +565,13 @@

    Interface address filtering selector function/0.

    For each ifaddrs entry, return either true to keep the entry or false to discard the entry.

    For example, to get an interface list which only contains -non-loopback inet interfaces:

    net:getifaddrs(
    -    fun (#{ addr  := #{family := inet},
    -            flags := Flags}) ->
    -          not lists:member(loopback, Flags);
    -        (_) ->
    +non-loopback inet interfaces:

    net:getifaddrs(
    +    fun (#{ addr  := #{family := inet},
    +            flags := Flags}) ->
    +          not lists:member(loopback, Flags);
    +        (_) ->
               false
    -    end).
    +
    end).
    @@ -1410,7 +1410,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/net_adm.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (670)) --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/net_adm.html 2026-06-04 19:05:11.189531453 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/net_adm.html 2026-06-04 19:05:11.189531453 +0000 @@ -491,8 +491,8 @@

    Returns the names and associated port numbers of the Erlang nodes that epmd -registered at the specified host.

    Similar to epmd -names, see erts:epmd.

    Returns {error, address} if epmd is not operational.

    Example:

    (arne@dunn)1> net_adm:names().
    -{ok,[{"arne",40262}]}
    +registered at the specified host.

    Similar to epmd -names, see erts:epmd.

    Returns {error, address} if epmd is not operational.

    Example:

    (arne@dunn)1> net_adm:names().
    +{ok,[{"arne",40262}]}
    @@ -668,7 +668,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/net_kernel.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1008)) --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/net_kernel.html 2026-06-04 19:05:11.213531675 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/net_kernel.html 2026-06-04 19:05:11.213531675 +0000 @@ -132,9 +132,9 @@ operational for distributed Erlang to work. The purpose of this process is to implement parts of the BIFs spawn/4 and spawn_link/4, and to provide monitoring of the network.

    An Erlang node is started using command-line flag -name or -sname:

    $ erl -sname foobar

    It is also possible to call net_kernel:start(foobar, #{}) -directly from the normal Erlang shell prompt:

    1> net_kernel:start(foobar, #{name_domain => shortnames}).
    -{ok,<0.64.0>}
    -(foobar@gringotts)2>

    If the node is started with command-line flag -sname, the node name is +directly from the normal Erlang shell prompt:

    1> net_kernel:start(foobar, #{name_domain => shortnames}).
    +{ok,<0.64.0>}
    +(foobar@gringotts)2>

    If the node is started with command-line flag -sname, the node name is foobar@Host, where Host is the short name of the host (not the fully qualified domain name). If started with flag -name, the node name is foobar@Host, where Host is the fully qualified domain name. For more @@ -668,13 +668,13 @@ delivered before a nodeup message due to a new connection to the same node. Prior to OTP 23.0, this was not guaranteed to be the case.

    The format of the node status change messages depends on Options. If Options is the empty list or if net_kernel:monitor_nodes/1 is called, the format is as -follows:

    {nodeup, Node} | {nodedown, Node}
    -  Node = node()

    When Options is the empty map or empty list, the caller will only subscribe +follows:

    {nodeup, Node} | {nodedown, Node}
    +  Node = node()

    When Options is the empty map or empty list, the caller will only subscribe for status change messages for visible nodes. That is, only nodes that appear in the result of erlang:nodes/0.

    If Options equals anything other than the empty list, the format of the status -change messages is as follows:

    {nodeup, Node, Info} | {nodedown, Node, Info}
    -  Node = node()
    -  Info = #{Tag => Val} | [{Tag, Val}]

    Info is either a map or a list of 2-tuples. Its content depends on Options. +change messages is as follows:

    {nodeup, Node, Info} | {nodedown, Node, Info}
    +  Node = node()
    +  Info = #{Tag => Val} | [{Tag, Val}]

    Info is either a map or a list of 2-tuples. Its content depends on Options. If Options is a map, Info will also be a map. If Options is a list, Info will also be a list.

    When Options is a map, currently the following associations are allowed:

    • connection_id => boolean() - If the value of the association equals true, a connection_id => ConnectionId association will be included in the @@ -708,23 +708,23 @@ {node_type, visible} tuple will be included in the Info list.

    • nodedown_reason - The tuple {nodedown_reason, Reason} will be included in the Info list for nodedown messages.

      See the documentation of the nodedown_reason => boolean() association -above for information about possible Reason values.

    Example:

    (a@localhost)1> net_kernel:monitor_nodes(true, #{connection_id=>true, node_type=>all, nodedown_reason=>true}).
    +above for information about possible Reason values.

    Example:

    (a@localhost)1> net_kernel:monitor_nodes(true, #{connection_id=>true, node_type=>all, nodedown_reason=>true}).
     ok
    -(a@localhost)2> flush().
    -Shell got {nodeup,b@localhost,
    -                  #{connection_id => 3067552,node_type => visible}}
    -Shell got {nodeup,c@localhost,
    -                  #{connection_id => 13892107,node_type => hidden}}
    -Shell got {nodedown,b@localhost,
    -                    #{connection_id => 3067552,node_type => visible,
    -                      nodedown_reason => connection_closed}}
    -Shell got {nodedown,c@localhost,
    -                    #{connection_id => 13892107,node_type => hidden,
    -                      nodedown_reason => net_tick_timeout}}
    -Shell got {nodeup,b@localhost,
    -                  #{connection_id => 3067553,node_type => visible}}
    +(a@localhost)2> flush().
    +Shell got {nodeup,b@localhost,
    +                  #{connection_id => 3067552,node_type => visible}}
    +Shell got {nodeup,c@localhost,
    +                  #{connection_id => 13892107,node_type => hidden}}
    +Shell got {nodedown,b@localhost,
    +                    #{connection_id => 3067552,node_type => visible,
    +                      nodedown_reason => connection_closed}}
    +Shell got {nodedown,c@localhost,
    +                    #{connection_id => 13892107,node_type => hidden,
    +                      nodedown_reason => net_tick_timeout}}
    +Shell got {nodeup,b@localhost,
    +                  #{connection_id => 3067553,node_type => visible}}
     ok
    -(a@localhost)3>
    +
    (a@localhost)3>
    @@ -1014,7 +1014,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/notes.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (6200)) --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/notes.html 2026-06-04 19:05:11.272532223 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/notes.html 2026-06-04 19:05:11.272532223 +0000 @@ -3961,12 +3961,12 @@ viewed as two operations performed atomically. Asynchronously send an unlink signal or a demonitor signal, and ignore any future results of the link or monitor.

    NOTE: This change can cause some obscure code to fail which previously did -not. For example, the following code might hang:

                Mon = erlang:monitor(process, Pid),
    +not. For example, the following code might hang:

                Mon = erlang:monitor(process, Pid),
                 %% ...
    -            exit(Pid, bang),
    -            erlang:demonitor(Mon),
    +            exit(Pid, bang),
    +            erlang:demonitor(Mon),
                 receive
    -                {'DOWN', Mon, process, Pid, _} -> ok
    +                {'DOWN', Mon, process, Pid, _} -> ok
                 %% We were previously guaranteed to get a down message
                 %% (since we exited the process ourself), so we could
                 %% in this case leave out:
    @@ -4393,7 +4393,7 @@
               Erlang programming language
     
           

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/os.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1354)) --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/os.html 2026-06-04 19:05:11.301532492 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/os.html 2026-06-04 19:05:11.302532501 +0000 @@ -656,13 +656,13 @@

    Executes Command in a command shell of the target OS, captures the standard -output and standard error of the command, and returns this result as a string.

    Examples:

    LsOut = os:cmd("ls"), % on unix platform
    -DirOut = os:cmd("dir"), % on Win32 platform

    Notice that in some cases, standard output of a command when called from another +output and standard error of the command, and returns this result as a string.

    Examples:

    LsOut = os:cmd("ls"), % on unix platform
    +DirOut = os:cmd("dir"), % on Win32 platform

    Notice that in some cases, standard output of a command when called from another program can differ, compared with the standard output of the command when called directly from an OS command shell.

    The possible options are:

    • max_size - The maximum size of the data returned by the os:cmd call. This option is a safety feature that should be used when the command executed -can return a very large, possibly infinite, result.

      > os:cmd("cat /dev/zero", #{ max_size => 20 }).
      -[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
    +can return a very large, possibly infinite, result.

    > os:cmd("cat /dev/zero", #{ max_size => 20 }).
    +[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
    @@ -952,7 +952,7 @@ resolution timestamp.

    This counter is read directly from the hardware or operating system with the same guarantees. This means that two consecutive calls to the function are not guaranteed to be monotonic, though it most likely will be. The performance -counter will be converted to the resolution passed as an argument.

    1> T1 = os:perf_counter(1000),receive after 10000 -> ok end,T2 = os:perf_counter(1000).
    +counter will be converted to the resolution passed as an argument.

    1> T1 = os:perf_counter(1000),receive after 10000 -> ok end,T2 = os:perf_counter(1000).
     176525861
     2> T2 - T1.
     10004
    @@ -1123,16 +1123,16 @@ allows you to log time stamps in high resolution and consistent with the time in the rest of the OS.

    Example of code formatting a string in format "DD Mon YYYY HH:MM:SS.mmmmmm", where DD is the day of month, Mon is the textual month name, YYYY is the year, -HH:MM:SS is the time, and mmmmmm is the microseconds in six positions:

    -module(print_time).
    --export([format_utc_timestamp/0]).
    -format_utc_timestamp() ->
    -    TS = {_,_,Micro} = os:timestamp(),
    -    {{Year,Month,Day},{Hour,Minute,Second}} =
    -calendar:now_to_universal_time(TS),
    -    Mstr = element(Month,{"Jan","Feb","Mar","Apr","May","Jun","Jul",
    -    "Aug","Sep","Oct","Nov","Dec"}),
    -    io_lib:format("~2w ~s ~4w ~2w:~2..0w:~2..0w.~6..0w",
    -    [Day,Mstr,Year,Hour,Minute,Second,Micro]).

    This module can be used as follows:

    1> io:format("~s~n",[print_time:format_utc_timestamp()]).
    +HH:MM:SS is the time, and mmmmmm is the microseconds in six positions:

    -module(print_time).
    +-export([format_utc_timestamp/0]).
    +format_utc_timestamp() ->
    +    TS = {_,_,Micro} = os:timestamp(),
    +    {{Year,Month,Day},{Hour,Minute,Second}} =
    +calendar:now_to_universal_time(TS),
    +    Mstr = element(Month,{"Jan","Feb","Mar","Apr","May","Jun","Jul",
    +    "Aug","Sep","Oct","Nov","Dec"}),
    +    io_lib:format("~2w ~s ~4w ~2w:~2..0w:~2..0w.~6..0w",
    +    [Day,Mstr,Year,Hour,Minute,Second,Micro]).

    This module can be used as follows:

    1> io:format("~s~n",[print_time:format_utc_timestamp()]).
     29 Apr 2009  9:55:30.051711

    OS system time can also be retrieved by system_time/0 and system_time/1.

    @@ -1260,7 +1260,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/pg.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1156)) --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/pg.html 2026-06-04 19:05:11.326532723 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/pg.html 2026-06-04 19:05:11.326532723 +0000 @@ -870,7 +870,7 @@

    Subscribes the caller to updates from the specified scope.

    Returns content of the entire scope and a reference to match the upcoming notifications.

    Whenever any group membership changes, an update message is sent to the -subscriber:

    {Ref, join, Group, [JoinPid1, JoinPid2]}
    {Ref, leave, Group, [LeavePid1]}
    +subscriber:

    {Ref, join, Group, [JoinPid1, JoinPid2]}
    {Ref, leave, Group, [LeavePid1]}
    @@ -1051,7 +1051,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/rpc.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (954)) --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/rpc.html 2026-06-04 19:05:11.354532983 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/rpc.html 2026-06-04 19:05:11.354532983 +0000 @@ -1079,10 +1079,10 @@ return values, or {badrpc, Reason} for failing calls. Timeout is a time (integer) in milliseconds, or infinity.

    The following example is useful when new object code is to be loaded on all nodes in the network, and indicates some side effects that RPCs can produce:

    %% Find object code for module Mod
    -{Mod, Bin, File} = code:get_object_code(Mod),
    +{Mod, Bin, File} = code:get_object_code(Mod),
     
     %% and load it on all nodes including this one
    -{ResL, _} = rpc:multicall(code, load_binary, [Mod, File, Bin]),
    +{ResL, _} = rpc:multicall(code, load_binary, [Mod, File, Bin]),
     
     %% and then maybe check the ResL list.

    Note

    If you want the ability to distinguish between results, you may want to consider using the erpc:multicall() function from the @@ -1452,7 +1452,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/search.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/search.html 2026-06-04 19:05:11.372432115 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/search.html 2026-06-04 19:05:11.372533150 +0000 @@ -145,7 +145,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/seq_trace.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (839)) --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/seq_trace.html 2026-06-04 19:05:11.395533363 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/seq_trace.html 2026-06-04 19:05:11.396533373 +0000 @@ -141,9 +141,9 @@ Trace Messages Sent to the System Tracer

    The format of the messages is one of the following, depending on if flag -timestamp of the trace token is set to true or false:

    {seq_trace, Label, SeqTraceInfo, TimeStamp}

    or

    {seq_trace, Label, SeqTraceInfo}

    Where:

    Label = int()
    -TimeStamp = {Seconds, Milliseconds, Microseconds}
    -  Seconds = Milliseconds = Microseconds = int()

    SeqTraceInfo can have the following formats:

    • {send, Serial, From, To, Message} - Used when a process From with its +timestamp of the trace token is set to true or false:

      {seq_trace, Label, SeqTraceInfo, TimeStamp}

      or

      {seq_trace, Label, SeqTraceInfo}

      Where:

      Label = int()
      +TimeStamp = {Seconds, Milliseconds, Microseconds}
      +  Seconds = Milliseconds = Microseconds = int()

      SeqTraceInfo can have the following formats:

      • {send, Serial, From, To, Message} - Used when a process From with its trace token flag send set to true has sent information. To may be a process identifier, a registered name on a node represented as {NameAtom, NodeAtom}, or a node name represented as an atom. From may be a @@ -287,68 +287,68 @@ Example of Use

        This example gives a rough idea of how the new primitives can be used and what -kind of output it produces.

        Assume that you have an initiating process with Pid == <0.30.0> like this:

        -module(seqex).
        --compile(export_all).
        +kind of output it produces.

        Assume that you have an initiating process with Pid == <0.30.0> like this:

        -module(seqex).
        +-compile(export_all).
         
        -loop(Port) ->
        +loop(Port) ->
             receive
        -        {Port,Message} ->
        -            seq_trace:set_token(label,17),
        -            seq_trace:set_token('receive',true),
        -            seq_trace:set_token(print,true),
        -            seq_trace:print(17,"**** Trace Started ****"),
        -            call_server ! {self(),the_message};
        -        {ack,Ack} ->
        +        {Port,Message} ->
        +            seq_trace:set_token(label,17),
        +            seq_trace:set_token('receive',true),
        +            seq_trace:set_token(print,true),
        +            seq_trace:print(17,"**** Trace Started ****"),
        +            call_server ! {self(),the_message};
        +        {ack,Ack} ->
                     ok
             end,
        -    loop(Port).

        And a registered process call_server with Pid == <0.31.0> like this:

        loop() ->
        +    loop(Port).

        And a registered process call_server with Pid == <0.31.0> like this:

        loop() ->
             receive
        -        {PortController,Message} ->
        -            Ack = {received, Message},
        -            seq_trace:print(17,"We are here now"),
        -            PortController ! {ack,Ack}
        +        {PortController,Message} ->
        +            Ack = {received, Message},
        +            seq_trace:print(17,"We are here now"),
        +            PortController ! {ack,Ack}
             end,
        -    loop().

        A possible output from the system's sequential_tracer can be like this:

        17:<0.30.0> Info {0,1} WITH
        +    loop().

        A possible output from the system's sequential_tracer can be like this:

        17:<0.30.0> Info {0,1} WITH
         "**** Trace Started ****"
        -17:<0.31.0> Received {0,2} FROM <0.30.0> WITH
        -{<0.30.0>,the_message}
        -17:<0.31.0> Info {2,3} WITH
        +17:<0.31.0> Received {0,2} FROM <0.30.0> WITH
        +{<0.30.0>,the_message}
        +17:<0.31.0> Info {2,3} WITH
         "We are here now"
        -17:<0.30.0> Received {2,4} FROM <0.31.0> WITH
        -{ack,{received,the_message}}

        The implementation of a system tracer process that produces this printout can -look like this:

        tracer() ->
        +17:<0.30.0> Received {2,4} FROM <0.31.0> WITH
        +{ack,{received,the_message}}

        The implementation of a system tracer process that produces this printout can +look like this:

        tracer() ->
             receive
        -        {seq_trace,Label,TraceInfo} ->
        -           print_trace(Label,TraceInfo,false);
        -        {seq_trace,Label,TraceInfo,Ts} ->
        -           print_trace(Label,TraceInfo,Ts);
        +        {seq_trace,Label,TraceInfo} ->
        +           print_trace(Label,TraceInfo,false);
        +        {seq_trace,Label,TraceInfo,Ts} ->
        +           print_trace(Label,TraceInfo,Ts);
                 _Other -> ignore
             end,
        -    tracer().
        +    tracer().
         
        -print_trace(Label,TraceInfo,false) ->
        -    io:format("~p:",[Label]),
        -    print_trace(TraceInfo);
        -print_trace(Label,TraceInfo,Ts) ->
        -    io:format("~p ~p:",[Label,Ts]),
        -    print_trace(TraceInfo).
        -
        -print_trace({print,Serial,From,_,Info}) ->
        -    io:format("~p Info ~p WITH~n~p~n", [From,Serial,Info]);
        -print_trace({'receive',Serial,From,To,Message}) ->
        -    io:format("~p Received ~p FROM ~p WITH~n~p~n",
        -              [To,Serial,From,Message]);
        -print_trace({send,Serial,From,To,Message}) ->
        -    io:format("~p Sent ~p TO ~p WITH~n~p~n",
        -              [From,Serial,To,Message]).

        The code that creates a process that runs this tracer function and sets that -process as the system tracer can look like this:

        start() ->
        -    Pid = spawn(?MODULE,tracer,[]),
        -    seq_trace:set_system_tracer(Pid), % set Pid as the system tracer
        -    ok.

        With a function like test/0, the whole example can be started:

        test() ->
        -    P = spawn(?MODULE, loop, [port]),
        -    register(call_server, spawn(?MODULE, loop, [])),
        -    start(),
        -    P ! {port,message}.
        +
        print_trace(Label,TraceInfo,false) -> + io:format("~p:",[Label]), + print_trace(TraceInfo); +print_trace(Label,TraceInfo,Ts) -> + io:format("~p ~p:",[Label,Ts]), + print_trace(TraceInfo). + +print_trace({print,Serial,From,_,Info}) -> + io:format("~p Info ~p WITH~n~p~n", [From,Serial,Info]); +print_trace({'receive',Serial,From,To,Message}) -> + io:format("~p Received ~p FROM ~p WITH~n~p~n", + [To,Serial,From,Message]); +print_trace({send,Serial,From,To,Message}) -> + io:format("~p Sent ~p TO ~p WITH~n~p~n", + [From,Serial,To,Message]).

        The code that creates a process that runs this tracer function and sets that +process as the system tracer can look like this:

        start() ->
        +    Pid = spawn(?MODULE,tracer,[]),
        +    seq_trace:set_system_tracer(Pid), % set Pid as the system tracer
        +    ok.

        With a function like test/0, the whole example can be started:

        test() ->
        +    P = spawn(?MODULE, loop, [port]),
        +    register(call_server, spawn(?MODULE, loop, [])),
        +    start(),
        +    P ! {port,message}.
        @@ -937,11 +937,11 @@ tracing is disabled, otherwise Token should be an Erlang term returned from get_token/0 or set_token/1. set_token/1 can be used to temporarily exclude message passing from the trace by setting the -trace token to empty like this:

        OldToken = seq_trace:set_token([]), % set to empty and save
        +trace token to empty like this:

        OldToken = seq_trace:set_token([]), % set to empty and save
                                             % old value
         % do something that should not be part of the trace
        -io:format("Exclude the signalling caused by this~n"),
        -seq_trace:set_token(OldToken), % activate the trace token again
        +io:format("Exclude the signalling caused by this~n"),
        +seq_trace:set_token(OldToken), % activate the trace token again
         ...

        Returns the previous value of the trace token.

        @@ -1033,7 +1033,7 @@ Erlang programming language

        -

        Copyright © 1996-2026 Ericsson AB

        +

        Copyright © 1996-2042 Ericsson AB

        /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/socket.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (948)) --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/socket.html 2026-06-04 19:05:11.469534050 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/socket.html 2026-06-04 19:05:11.470534059 +0000 @@ -172,8 +172,8 @@ completion_info/0 and the received completion message.

        The compiler may then optimize a following receive statement to only scan the messages that arrive after the reference/0 is created. If the message queue is large this is a big optimization.

        The reference/0 has to be unique for the call.

        Repeating an Operation on a select Systems

        Onselect systems, if a call would be repeated before the select -message has been received it replaces the call in progress:

            {select, {select_info, Handle}} = socket:accept(LSock, nowait),
        -    {error, timeout} = socket:accept(LSock, 500),
        +message has been received it replaces the call in progress:

            {select, {select_info, Handle}} = socket:accept(LSock, nowait),
        +    {error, timeout} = socket:accept(LSock, 500),
             :

        Above, Handle is no longer valid once the second accept/2, call has been made (the first call is automatically canceled). After the second accept/2 call returns {error, timeout}, @@ -206,28 +206,28 @@ Examples -

        client(SAddr, SPort) ->
        -   {ok, Sock} = socket:open(inet, stream, tcp),
        -   ok = socket:connect(Sock, #{family => inet,
        +
        client(SAddr, SPort) ->
        +   {ok, Sock} = socket:open(inet, stream, tcp),
        +   ok = socket:connect(Sock, #{family => inet,
                                        addr   => SAddr,
        -                               port   => SPort}),
        +                               port   => SPort}),
            Msg = <<"hello">>,
        -   ok = socket:send(Sock, Msg),
        -   ok = socket:shutdown(Sock, write),
        -   {ok, Msg} = socket:recv(Sock),
        -   ok = socket:close(Sock).
        -
        -server(Addr, Port) ->
        -   {ok, LSock} = socket:open(inet, stream, tcp),
        -   ok = socket:bind(LSock, #{family => inet,
        +   ok = socket:send(Sock, Msg),
        +   ok = socket:shutdown(Sock, write),
        +   {ok, Msg} = socket:recv(Sock),
        +   ok = socket:close(Sock).
        +
        +server(Addr, Port) ->
        +   {ok, LSock} = socket:open(inet, stream, tcp),
        +   ok = socket:bind(LSock, #{family => inet,
                                      port   => Port,
        -                             addr   => Addr}),
        -   ok = socket:listen(LSock),
        -   {ok, Sock} = socket:accept(LSock),
        -   {ok, Msg} = socket:recv(Sock),
        -   ok = socket:send(Sock, Msg),
        -   ok = socket:close(Sock),
        -   ok = socket:close(LSock).
        +
        addr => Addr}), + ok = socket:listen(LSock), + {ok, Sock} = socket:accept(LSock), + {ok, Msg} = socket:recv(Sock), + ok = socket:send(Sock, Msg), + ok = socket:close(Sock), + ok = socket:close(LSock).
        @@ -4795,7 +4795,7 @@ (since OTP 26.1).

        Result; a boolean/0.

      • tcp_info - Get miscellaneous TCP related information for a connected socket (since OTP 26.1).

        Result; a map/0 with information items as key-value pairs.

      Note

      Not all requests are supported by all platforms. To see if a ioctl request is supported on the current platform:

            Request = nread,
      -      true = socket:is_supported(ioctl_requests, Request),
      +      true = socket:is_supported(ioctl_requests, Request),
             :
      @@ -4959,7 +4959,7 @@

      Check if a socket feature is supported.

      Returns true if supports/0 has a {Key1, true} tuple or a {Key1, list()} tuple in its returned list, -otherwise false (also for unknown keys).

      Example:

      true = socket:is_supported(local),
      +otherwise false (also for unknown keys).

      Example:

      true = socket:is_supported(local),
      @@ -4990,7 +4990,7 @@

      Check if a socket feature is supported.

      Returns true if supports(Key1) has a {Key2, true} tuple -in its returned list, otherwise false (also for unknown keys).

      Example:

      true = socket:is_supported(msg_flags, errqueue),
      +in its returned list, otherwise false (also for unknown keys).

      Example:

      true = socket:is_supported(msg_flags, errqueue),
      @@ -5088,7 +5088,7 @@

      Start a socket monitor.

      If the Socket doesn't exist or when later the monitor is triggered, a 'DOWN' message is sent to the process that called monitor/1 -with the following pattern:

      	    {'DOWN', MonitorRef, socket, Socket, Info}

      Info is the termination reason of the socket or nosock if +with the following pattern:

      	    {'DOWN', MonitorRef, socket, Socket, Info}

      Info is the termination reason of the socket or nosock if Socket did not exist when the monitor was started.

      Making several calls to socket:monitor/1 for the same Socket is not an error; each call creates an independent monitor instance.

      @@ -7226,7 +7226,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/socket_usage.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1001)) --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/socket_usage.html 2026-06-04 19:05:11.497534310 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/socket_usage.html 2026-06-04 19:05:11.504534375 +0000 @@ -186,47 +186,47 @@ Example

      This example is intended to show how to create a simple (echo) server -(and client).

      -module(example).
      +(and client).

      -module(example).
       
      --export([client/2, client/3]).
      --export([server/0, server/1, server/2]).
      +-export([client/2, client/3]).
      +-export([server/0, server/1, server/2]).
       
       
       %% ======================================================================
       
       %% === Client ===
       
      -client(#{family := Family} = ServerSockAddr, Msg)
      -  when is_list(Msg) orelse is_binary(Msg) ->
      -    {ok, Sock} = socket:open(Family, stream, default),
      -    ok         = maybe_bind(Sock, Family),
      -    ok         = socket:connect(Sock, ServerSockAddr),
      -    client_exchange(Sock, Msg);
      +client(#{family := Family} = ServerSockAddr, Msg)
      +  when is_list(Msg) orelse is_binary(Msg) ->
      +    {ok, Sock} = socket:open(Family, stream, default),
      +    ok         = maybe_bind(Sock, Family),
      +    ok         = socket:connect(Sock, ServerSockAddr),
      +    client_exchange(Sock, Msg);
       
      -client(ServerPort, Msg)
      -  when is_integer(ServerPort) andalso (ServerPort > 0) ->
      +client(ServerPort, Msg)
      +  when is_integer(ServerPort) andalso (ServerPort > 0) ->
           Family   = inet, % Default
      -    Addr     = get_local_addr(Family), % Pick an address
      -    SockAddr = #{family => Family,
      +    Addr     = get_local_addr(Family), % Pick an address
      +    SockAddr = #{family => Family,
       		 addr   => Addr,
      -		 port   => ServerPort},
      -    client(SockAddr, Msg).
      +		 port   => ServerPort},
      +    client(SockAddr, Msg).
       
      -client(ServerPort, ServerAddr, Msg)
      -  when is_integer(ServerPort) andalso (ServerPort > 0) andalso
      -       is_tuple(ServerAddr) ->
      -    Family   = which_family(ServerAddr),
      -    SockAddr = #{family => Family,
      +client(ServerPort, ServerAddr, Msg)
      +  when is_integer(ServerPort) andalso (ServerPort > 0) andalso
      +       is_tuple(ServerAddr) ->
      +    Family   = which_family(ServerAddr),
      +    SockAddr = #{family => Family,
       		 addr   => ServerAddr,
      -		 port   => ServerPort},
      -    client(SockAddr, Msg).
      +		 port   => ServerPort},
      +    client(SockAddr, Msg).
       
       %% Send the message to the (echo) server and wait for the echo to come back.
      -client_exchange(Sock, Msg) when is_list(Msg) ->
      -    client_exchange(Sock, list_to_binary(Msg));
      -client_exchange(Sock, Msg) when is_binary(Msg) ->
      -    ok = socket:send(Sock, Msg, infinity),
      -    {ok, Msg} = socket:recv(Sock, byte_size(Msg), infinity),
      +client_exchange(Sock, Msg) when is_list(Msg) ->
      +    client_exchange(Sock, list_to_binary(Msg));
      +client_exchange(Sock, Msg) when is_binary(Msg) ->
      +    ok = socket:send(Sock, Msg, infinity),
      +    {ok, Msg} = socket:recv(Sock, byte_size(Msg), infinity),
           ok.
       
       
      @@ -234,188 +234,188 @@
       
       %% === Server ===
       
      -server() ->
      +server() ->
           %% Make system choose port (and address)
      -    server(0).
      +    server(0).
       
       %% This function return the port and address that it actually uses,
       %% in case server/0 or server/1 (with a port number) was used to start it.
       
      -server(#{family := Family, addr := Addr, port := _} = SockAddr) ->
      -    {ok, Sock} = socket:open(Family, stream, tcp),
      -    ok         = socket:bind(Sock, SockAddr),
      -    ok         = socket:listen(Sock),
      -    {ok, #{port := Port}} = socket:sockname(Sock),
      -    Acceptor = start_acceptor(Sock),
      -    {ok, {Port, Addr, Acceptor}};
      +server(#{family := Family, addr := Addr, port := _} = SockAddr) ->
      +    {ok, Sock} = socket:open(Family, stream, tcp),
      +    ok         = socket:bind(Sock, SockAddr),
      +    ok         = socket:listen(Sock),
      +    {ok, #{port := Port}} = socket:sockname(Sock),
      +    Acceptor = start_acceptor(Sock),
      +    {ok, {Port, Addr, Acceptor}};
       
      -server(Port) when is_integer(Port) ->
      +server(Port) when is_integer(Port) ->
           Family   = inet, % Default
      -    Addr     = get_local_addr(Family), % Pick an address
      -    SockAddr = #{family => Family,
      +    Addr     = get_local_addr(Family), % Pick an address
      +    SockAddr = #{family => Family,
       		 addr   => Addr,
      -		 port   => Port},
      -    server(SockAddr).
      +		 port   => Port},
      +    server(SockAddr).
       
      -server(Port, Addr)
      -  when is_integer(Port) andalso (Port >= 0) andalso
      -       is_tuple(Addr) ->
      -    Family   = which_family(Addr),
      -    SockAddr = #{family => Family,
      +server(Port, Addr)
      +  when is_integer(Port) andalso (Port >= 0) andalso
      +       is_tuple(Addr) ->
      +    Family   = which_family(Addr),
      +    SockAddr = #{family => Family,
       		 addr   => Addr,
      -		 port   => Port},
      -    server(SockAddr).
      +		 port   => Port},
      +    server(SockAddr).
       
       
       %% --- Echo Server - Acceptor ---
       
      -start_acceptor(LSock) ->
      -    Self = self(),
      -    {Pid, MRef} = spawn_monitor(fun() -> acceptor_init(Self, LSock) end),
      +start_acceptor(LSock) ->
      +    Self = self(),
      +    {Pid, MRef} = spawn_monitor(fun() -> acceptor_init(Self, LSock) end),
           receive
      -	{'DOWN', MRef, process, Pid, Info} ->
      -	    erlang:error({failed_starting_acceptor, Info});
      -	{Pid, started} ->
      +	{'DOWN', MRef, process, Pid, Info} ->
      +	    erlang:error({failed_starting_acceptor, Info});
      +	{Pid, started} ->
       	    %% Transfer ownership
      -	    socket:setopt(LSock, otp, owner, Pid),
      -	    Pid ! {self(), continue},
      -	    erlang:demonitor(MRef),
      +	    socket:setopt(LSock, otp, owner, Pid),
      +	    Pid ! {self(), continue},
      +	    erlang:demonitor(MRef),
       	    Pid
           end.
           
      -acceptor_init(Parent, LSock) ->
      -    Parent ! {self(), started},
      +acceptor_init(Parent, LSock) ->
      +    Parent ! {self(), started},
           receive
      -	{Parent, continue} ->
      +	{Parent, continue} ->
       	    ok
           end,
      -    acceptor_loop(LSock).
      +    acceptor_loop(LSock).
       
      -acceptor_loop(LSock) ->
      -    case socket:accept(LSock, infinity) of
      -	{ok, ASock} ->
      -	    start_handler(ASock),
      -	    acceptor_loop(LSock);
      -	{error, Reason} ->
      -	    erlang:error({accept_failed, Reason})
      +acceptor_loop(LSock) ->
      +    case socket:accept(LSock, infinity) of
      +	{ok, ASock} ->
      +	    start_handler(ASock),
      +	    acceptor_loop(LSock);
      +	{error, Reason} ->
      +	    erlang:error({accept_failed, Reason})
           end.
       
       
       %% --- Echo Server - Handler ---
       
      -start_handler(Sock) ->
      -    Self = self(),
      -    {Pid, MRef} = spawn_monitor(fun() -> handler_init(Self, Sock) end),
      +start_handler(Sock) ->
      +    Self = self(),
      +    {Pid, MRef} = spawn_monitor(fun() -> handler_init(Self, Sock) end),
           receive
      -	{'DOWN', MRef, process, Pid, Info} ->
      -	    erlang:error({failed_starting_handler, Info});
      /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/trace.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (4986))
      --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/trace.html	2026-06-04 19:05:11.539534699 +0000
      +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/trace.html	2026-06-04 19:05:11.539534699 +0000
      @@ -146,23 +146,23 @@
       messages. Several sessions can exist at the same time without interfering with
       each other. When a trace session is destroyed, all its trace settings are
       automatically cleaned up.

      Example:

      %% Create a tracer process that will receive the trace events
      -1> Tracer = spawn(fun F() -> receive M -> io:format("~p~n",[M]), F() end end).
      +1> Tracer = spawn(fun F() -> receive M -> io:format("~p~n",[M]), F() end end).
       <0.91.0>
       %% Create a session using the Tracer
      -2> Session = trace:session_create(my_session, Tracer, []).
      -{#Ref<0.1543805153.1548353537.92331>,{my_session, 0}}
      +2> Session = trace:session_create(my_session, Tracer, []).
      +{#Ref<0.1543805153.1548353537.92331>,{my_session, 0}}
       %% Setup call tracing on self()
      -3> trace:process(Session, self(), true, [call]).
      +3> trace:process(Session, self(), true, [call]).
       1
       %% Setup call tracing on lists:seq/2
      -4> trace:function(Session, {lists,seq,2}, [], []).
      +4> trace:function(Session, {lists,seq,2}, [], []).
       1
       %% Call the traced function
      -5> lists:seq(1, 10).
      -{trace,<0.89.0>,call,{lists,seq,[1,10]}} % The trace message
      -[1,2,3,4,5,6,7,8,9,10] % The return value
      +5> lists:seq(1, 10).
      +{trace,<0.89.0>,call,{lists,seq,[1,10]}} % The trace message
      +[1,2,3,4,5,6,7,8,9,10] % The return value
       %% Cleanup the trace session
      -6> trace:session_destroy(Session).
      +6> trace:session_destroy(Session).
       ok

      @@ -1322,9 +1322,9 @@ Match Specifications in Erlang in the User's Guide for the ERTS application.

    • true - Enable tracing for all received messages (to 'receive' traced processes). Any match specification is removed. This is the default.

    • false - Disable tracing for all received messages. Any match -specification is removed.

    Argument FlagList must be [] for receive tracing.

    The return value is always 1.

    Examples:

    Only trace messages from a specific process Pid:

    > trace:recv(Session, [{[&#href_anchor"p">,Pid, '_'],[],[]}], []).
    -1

    Only trace messages matching {reply, _}:

    > trace:recv(Session, [{['_','_', {reply,'_'}],[],[]}], []).
    -1

    Only trace messages from other nodes:

    > trace:recv(Session, [{['$1', '_', '_'],[{'=/=','$1',{node}}],[]}], []).
    +specification is removed.

    Argument FlagList must be [] for receive tracing.

    The return value is always 1.

    Examples:

    Only trace messages from a specific process Pid:

    > trace:recv(Session, [{[&#href_anchor"p">,Pid, '_'],[],[]}], []).
    +1

    Only trace messages matching {reply, _}:

    > trace:recv(Session, [{['_','_', {reply,'_'}],[],[]}], []).
    +1

    Only trace messages from other nodes:

    > trace:recv(Session, [{['$1', '_', '_'],[{'=/=','$1',{node}}],[]}], []).
     1

    Note

    A match specification for 'receive' trace can use all guard and body functions except caller, is_seq_trace, get_seq_token, set_seq_token, enable_trace, disable_trace, trace, silent, and process_dump.

    Fails by raising an error exception with an error reason of:

    • badarg - If an argument is invalid.

    • system_limit - If a match specification passed as argument has excessive @@ -1375,10 +1375,10 @@ Match Specifications in Erlang in the User's Guide for the ERTS application.

    • true - Enable tracing for all sent messages (from send traced processes). Any match specification is removed.

    • false - Disable tracing for all sent messages. Any match specification -is removed.

    Argument FlagList must be [].

    The return value is always 1.

    Examples:

    Only trace messages to a specific process Pid:

    > trace:send(Session, [{[Pid, &#href_anchor"p" data-group-id="7020274813-4">],[],[]}], []).
    -1

    Only trace messages matching {reply, _}:

    > trace:send(Session, [{['_', {reply,'_'}],[],[]}], []).
    -1

    Only trace messages sent to the sender itself:

    > trace:send(Session, [{['$1', '_'],[{'=:=','$1',{self}}],[]}], []).
    -1

    Only trace messages sent to other nodes:

    > trace:send(Session, [{['$1', '_'],[{'=/=',{node,'$1'},{node}}],[]}], []).
    +is removed.

    Argument FlagList must be [].

    The return value is always 1.

    Examples:

    Only trace messages to a specific process Pid:

    > trace:send(Session, [{[Pid, &#href_anchor"p" data-group-id="1372407283-4">],[],[]}], []).
    +1

    Only trace messages matching {reply, _}:

    > trace:send(Session, [{['_', {reply,'_'}],[],[]}], []).
    +1

    Only trace messages sent to the sender itself:

    > trace:send(Session, [{['$1', '_'],[{'=:=','$1',{self}}],[]}], []).
    +1

    Only trace messages sent to other nodes:

    > trace:send(Session, [{['$1', '_'],[{'=/=',{node,'$1'},{node}}],[]}], []).
     1

    Note

    A match specification for send trace can use all guard and body functions except caller.

    Fails by raising an error exception with an error reason of:

    • badarg - If an argument is invalid.

    • system_limit - If a match specification passed as argument has excessive nesting which causes scheduler stack exhaustion for the scheduler that the @@ -1524,7 +1524,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/wrap_log_reader.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (396)) --- old//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/wrap_log_reader.html 2026-06-04 19:05:11.560534894 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/kernel-10.1.2/doc/html/wrap_log_reader.html 2026-06-04 19:05:11.560534894 +0000 @@ -550,7 +550,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/404.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/404.html 2026-06-04 19:05:11.578533200 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/404.html 2026-06-04 19:05:11.578535061 +0000 @@ -147,7 +147,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/api-reference.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/api-reference.html 2026-06-04 19:05:11.595535219 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/api-reference.html 2026-06-04 19:05:11.595535219 +0000 @@ -302,7 +302,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      Missing in old package: /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/dist/search_data-2DB78EC4.js Missing in old package: /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/dist/search_data-2DB78EC4.js /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco.epub/OEBPS/content.opf differs (XML 1.0 document, ASCII text) --- old//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco.epub/OEBPS/content.opf 2026-06-04 00:08:40.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco.epub/OEBPS/content.opf 2042-07-06 13:28:05.000000000 +0000 @@ -4,10 +4,10 @@ version="3.0"> megaco - 4.6 - urn:uuid:7ad9ff71-acf1-01a1-08b2-9f7e16a88e47 + urn:uuid:11ae1bbc-24c8-ac14-bd67-af6c2219ed77 en - 2026-06-04T00:08:40Z + 2042-07-06T13:28:05Z /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco.epub/OEBPS/megaco_debug.xhtml differs (HTML document, ASCII text, with very long lines (1148)) --- old//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco.epub/OEBPS/megaco_debug.xhtml 2026-06-04 00:08:40.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco.epub/OEBPS/megaco_debug.xhtml 2042-07-06 13:28:05.000000000 +0000 @@ -67,12 +67,12 @@ can be expected by the different codecs provided by the megaco application.

      The measurement is done by iterating over the decode/encode function for approx 2 seconds per message and counting the number of decodes/encodes.

      Is best run by modifying the meas.sh.skel skeleton script provided by the tool.

      To run it manually do the following:

              % erl -pa <path-megaco-ebin-dir> -pa <path-to-meas-module-dir>
      -        Erlang (BEAM) emulator version 5.6 [source]
      +        Erlang (BEAM) emulator version 5.6 [source]
       
      -        Eshell V12.2  (abort with ^G)
      -        1> megaco_codec_meas:start().
      +        Eshell V12.2  (abort with ^G)
      +        1> megaco_codec_meas:start().
               ...
      -        2> halt().

      or to make it even easier, assuming a measure shall be done on all the codecs + 2> halt().

    or to make it even easier, assuming a measure shall be done on all the codecs (as above):

            % erl -noshell -pa <path-megaco-ebin-dir> \\
                   -pa <path-to-meas-module-dir> \\
                   -s megaco_codec_meas -s init stop

    When run as above (this will take some time), the measurement process is done @@ -94,10 +94,10 @@ value.

    Both these tools use the message package (time_test.msgs) provided with the tool(s), although it can run on any message package as long as it has the same structure.

    Message package file

    This is simply an erlang compatible text-file with the following structure: -{codec_name(), messages_list()}.

    codec_name() = pretty | compact | ber | per | erlang      (how the messages are encoded)
    -messages_list() = [{message_name(), message()}]
    -message_name() = atom()
    -message() = binary()

    The codec name is the name of the codec with which all messages in the +{codec_name(), messages_list()}.

    codec_name() = pretty | compact | ber | per | erlang      (how the messages are encoded)
    +messages_list() = [{message_name(), message()}]
    +message_name() = atom()
    +message() = binary()

    The codec name is the name of the codec with which all messages in the message_list() has been encoded.

    This file can be exported to a file structure by calling the export_messages function. This can be usefull if a measurement shall be done with an external tool. Exporting the /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco.epub/OEBPS/megaco_encode.xhtml differs (HTML document, ASCII text, with very long lines (783)) --- old//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco.epub/OEBPS/megaco_encode.xhtml 2026-06-04 00:08:40.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco.epub/OEBPS/megaco_encode.xhtml 2042-07-06 13:28:05.000000000 +0000 @@ -53,75 +53,75 @@ format using long keywords and an indentation style like the text examples in the Megaco/H.248 specification).

    Here follows an example of a text message to give a feeling of the difference between the pretty and compact versions of text messages. First the pretty, well -indented version with long keywords:

       MEGACO/1 [124.124.124.222]
    -   Transaction = 9998 {
    -           Context = - {
    -                   ServiceChange = ROOT {
    -                           Services {
    +indented version with long keywords:

       MEGACO/1 [124.124.124.222]
    +   Transaction = 9998 {
    +           Context = - {
    +                   ServiceChange = ROOT {
    +                           Services {
                                        Method = Restart,
                                        ServiceChangeAddress = 55555,
                                        Profile = ResGW/1,
                                        Reason = "901 Cold Boot"
    -                           }
    -                   }
    -           }
    -   }

    Then the compact version without indentation and with short keywords:

    
    +                           }
    +                   }
    +           }
    +   }

    Then the compact version without indentation and with short keywords:

    
        !/1 [124.124.124.222]
        T=9998{C=-{SC=ROOT{SV{MT=RS,AD=55555,PF=ResGW/1,RE="901 Cold Boot"}}}}

    And the programmers view of the same message. First a list of ActionRequest records are constructed and then it is sent with one of the send functions in -the API:

      Prof = #'ServiceChangeProfile'{profileName = "resgw", version = 1},
    -  Parm = #'ServiceChangeParm'{serviceChangeMethod  = restart,
    -                              serviceChangeAddress = {portNumber, 55555},
    +the API:

      Prof = #'ServiceChangeProfile'{profileName = "resgw", version = 1},
    +  Parm = #'ServiceChangeParm'{serviceChangeMethod  = restart,
    +                              serviceChangeAddress = {portNumber, 55555},
                                   serviceChangeReason  = "901 Cold Boot",
    -                              serviceChangeProfile = Prof},
    -  Req = #'ServiceChangeRequest'{terminationID = [?megaco_root_termination_id],
    -                                serviceChangeParms = Parm},
    -  Actions = [#'ActionRequest'{contextId = ?megaco_null_context_id,
    -                              commandRequests = {serviceChangeReq, Req}}],
    -  megaco:call(ConnHandle, Actions, Config).

    And finally a print-out of the entire internal form:

      {'MegacoMessage',
    +                              serviceChangeProfile = Prof},
    +  Req = #'ServiceChangeRequest'{terminationID = [?megaco_root_termination_id],
    +                                serviceChangeParms = Parm},
    +  Actions = [#'ActionRequest'{contextId = ?megaco_null_context_id,
    +                              commandRequests = {serviceChangeReq, Req}}],
    +  megaco:call(ConnHandle, Actions, Config).

    And finally a print-out of the entire internal form:

      {'MegacoMessage',
        asn1_NOVALUE,
    -   {'Message',
    +   {'Message',
         1,
    -    {ip4Address,{'IP4Address', [124,124,124,222], asn1_NOVALUE}},
    -    {transactions,
    -     [
    -      {transactionRequest,
    -       {'TransactionRequest',
    +    {ip4Address,{'IP4Address', [124,124,124,222], asn1_NOVALUE}},
    +    {transactions,
    +     [
    +      {transactionRequest,
    +       {'TransactionRequest',
              9998,
    -         [{'ActionRequest',
    +         [{'ActionRequest',
                0,
                asn1_NOVALUE,
                asn1_NOVALUE,
    -           [
    -            {'CommandRequest',
    -             {serviceChangeReq,
    -              {'ServiceChangeRequest',
    -               [
    -                {megaco_term_id, false, ["root"]}],
    -                {'ServiceChangeParm',
    +           [
    +            {'CommandRequest',
    +             {serviceChangeReq,
    +              {'ServiceChangeRequest',
    +               [
    +                {megaco_term_id, false, ["root"]}],
    +                {'ServiceChangeParm',
                      restart,
    -                 {portNumber, 55555},
    +                 {portNumber, 55555},
                      asn1_NOVALUE,
    -                 {'ServiceChangeProfile', "resgw", version = 1},
    +                 {'ServiceChangeProfile', "resgw", version = 1},
                      "901 MG Cold Boot",
                      asn1_NOVALUE,
                      asn1_NOVALUE,
                      asn1_NOVALUE
    -                }
    -              }
    -             },
    +                }
    +              }
    +             },
                  asn1_NOVALUE,
                  asn1_NOVALUE
    -            }
    -           ]
    -          }
    -         ]
    -       }
    -      }
    -     ]
    -    }
    -   }
    -  }

    The following encoding modules are provided:

    • megaco_pretty_text_encoder - encodes messages into pretty text format, decodes + } + ] + } + ] + } + } + ] + } + } + }

    The following encoding modules are provided:

    • megaco_pretty_text_encoder - encodes messages into pretty text format, decodes both pretty as well as compact text.
    • megaco_compact_text_encoder - encodes messages into compact text format, decodes both pretty as well as compact text.
    • megaco_binary_encoder - encode/decode ASN.1 BER messages. This encoder implements the fastest of the BER encoders/decoders. Recommended binary codec.
    • megaco_ber_encoder - encode/decode ASN.1 BER messages.
    • megaco_per_encoder - encode/decode ASN.1 PER messages. N.B. that this format /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco.epub/OEBPS/megaco_examples.xhtml differs (HTML document, ASCII text, with very long lines (558)) --- old//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco.epub/OEBPS/megaco_examples.xhtml 2026-06-04 00:08:40.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco.epub/OEBPS/megaco_examples.xhtml 2042-07-06 13:28:05.000000000 +0000 @@ -54,10 +54,10 @@ erl -pa ../../../megaco/ebin -s megaco_filter -s megaco megaco_simple_mg:start().

    or simply 'gmake mg'.

    If you "only" want to start a single MG which tries to connect an MG on a host named "baidarka", you may use one of these functions (instead of the -megaco_simple_mg:start/0 above):

          megaco_simple_mg:start_tcp_text("baidarka", []).
    -      megaco_simple_mg:start_tcp_binary("baidarka", []).
    -      megaco_simple_mg:start_udp_text("baidarka", []).
    -      megaco_simple_mg:start_udp_binary("baidarka", []).

    The -s megaco_filter option to erl implies, the event tracing mechanism to be +megaco_simple_mg:start/0 above):

          megaco_simple_mg:start_tcp_text("baidarka", []).
    +      megaco_simple_mg:start_tcp_binary("baidarka", []).
    +      megaco_simple_mg:start_udp_text("baidarka", []).
    +      megaco_simple_mg:start_udp_binary("baidarka", []).

    The -s megaco_filter option to erl implies, the event tracing mechanism to be enabled and an interactive sequence chart tool to be started. This may be quite useful in order to visualize how your MG interacts with the Megaco/H.248 protocol stack.

    The event traces may alternatively be directed to a file for later analyze. By /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco.epub/OEBPS/megaco_performance.xhtml differs (HTML document, ASCII text, with very long lines (2969)) --- old//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco.epub/OEBPS/megaco_performance.xhtml 2026-06-04 00:08:40.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco.epub/OEBPS/megaco_performance.xhtml 2042-07-06 13:28:05.000000000 +0000 @@ -57,19 +57,19 @@ built-in functions.

    The actual encoded messages have been collected in one directory per encoding type, containing one file per encoded message.

    Here follows an example of a text message to give a feeling of the difference between the pretty and compact versions of text messages. First the pretty -printed, well indented version with long keywords:

    MEGACO/1 [124.124.124.222]
    -  Transaction = 9998 {
    -    Context = - {
    -      ServiceChange = ROOT {
    -        Services {
    +printed, well indented version with long keywords:

    MEGACO/1 [124.124.124.222]
    +  Transaction = 9998 {
    +    Context = - {
    +      ServiceChange = ROOT {
    +        Services {
               Method = Restart,
               ServiceChangeAddress = 55555,
               Profile = ResGW/1,
               Reason = "901 MG Cold Boot"
    -        }
    -      }
    -    }
    -  }

    Then the compact text version without indentation and with short keywords:

    !/1 [124.124.124.222] T=9998{
    +        }
    +      }
    +    }
    +  }

    Then the compact text version without indentation and with short keywords:

    !/1 [124.124.124.222] T=9998{
       C=-{SC=ROOT{SV{MT=RS,AD=55555,PF=ResGW/1,RE="901 MG Cold Boot"}}}}

    /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco.epub/OEBPS/megaco_user.xhtml differs (HTML document, ASCII text, with very long lines (1117)) --- old//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco.epub/OEBPS/megaco_user.xhtml 2026-06-04 00:08:40.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco.epub/OEBPS/megaco_user.xhtml 2042-07-06 13:28:05.000000000 +0000 @@ -28,7 +28,7 @@ list of the callback functions. For example, the handle_connect function takes by default two arguments:

            handle_connect(Handle, Version)

    but if the user_args parameter is set to a longer list, such as [SomePid,SomeTableRef], the callback function is expected to have these (in -this case two) extra arguments last in the argument list:

            handle_connect(Handle, Version, SomePid, SomeTableRef)

    Note

    Must of the functions below has an optional Extra argument (e.g. +this case two) extra arguments last in the argument list:

            handle_connect(Handle, Version, SomePid, SomeTableRef)

    Note

    Must of the functions below has an optional Extra argument (e.g. handle_unexpected_trans/4). The functions which takes this argument will be called if and only if one of the functions receive_message/5 or @@ -39,10 +39,10 @@ DATA TYPES

    -
    action_request() = #'ActionRequest'{}
    -action_reply() = #'ActionReply'{}
    -error_desc() = #'ErrorDescriptor'{}
    -segment_no() = integer()
    conn_handle() = #megaco_conn_handle{}

    The record initially returned by megaco:connect/4,5. It identifies a "virtual" +

    action_request() = #'ActionRequest'{}
    +action_reply() = #'ActionReply'{}
    +error_desc() = #'ErrorDescriptor'{}
    +segment_no() = integer()
    conn_handle() = #megaco_conn_handle{}

    The record initially returned by megaco:connect/4,5. It identifies a "virtual" connection and may be reused after a reconnect (disconnect + connect).

    protocol_version() = integer()

    Is the actual protocol version. In most cases the protocol version is retrieved from the processed message, but there are exceptions:

    In these cases, the ProtocolVersion default version is obtained from the static /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco.epub/OEBPS/megaco.xhtml differs (HTML document, ASCII text, with very long lines (1038)) --- old//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco.epub/OEBPS/megaco.xhtml 2026-06-04 00:08:40.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco.epub/OEBPS/megaco.xhtml 2042-07-06 13:28:05.000000000 +0000 @@ -3084,7 +3084,7 @@

    Utility function to produce a formated printout of the versions info generated by the versions1 and versions2 functions.

    The function print_version_info/0 uses the result of function version1/0 as -VersionInfo.

    Example:

               {ok, V} = megaco:versions1(), megaco:format_versions(V).

    +VersionInfo.

    Example:

               {ok, V} = megaco:versions1(), megaco:format_versions(V).

    /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1035)) --- old//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco.html 2026-06-04 19:05:11.789537018 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco.html 2026-06-04 19:05:11.789537018 +0000 @@ -3201,7 +3201,7 @@

    Utility function to produce a formated printout of the versions info generated by the versions1 and versions2 functions.

    The function print_version_info/0 uses the result of function version1/0 as -VersionInfo.

    Example:

               {ok, V} = megaco:versions1(), megaco:format_versions(V).

    +VersionInfo.

    Example:

               {ok, V} = megaco:versions1(), megaco:format_versions(V).

    @@ -4103,7 +4103,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_architecture.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (377)) --- old//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_architecture.html 2026-06-04 19:05:11.810537213 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_architecture.html 2026-06-04 19:05:11.812537232 +0000 @@ -259,7 +259,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_codec_meas.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_codec_meas.html 2026-06-04 19:05:11.833537427 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_codec_meas.html 2026-06-04 19:05:11.832537417 +0000 @@ -250,7 +250,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_codec_mstone1.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_codec_mstone1.html 2026-06-04 19:05:11.851537593 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_codec_mstone1.html 2026-06-04 19:05:11.851537593 +0000 @@ -587,7 +587,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_codec_mstone2.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_codec_mstone2.html 2026-06-04 19:05:11.866537733 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_codec_mstone2.html 2026-06-04 19:05:11.866537733 +0000 @@ -254,7 +254,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_codec_transform.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_codec_transform.html 2026-06-04 19:05:11.882537881 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_codec_transform.html 2026-06-04 19:05:11.883537890 +0000 @@ -254,7 +254,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_debug.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1148)) --- old//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_debug.html 2026-06-04 19:05:11.898538029 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_debug.html 2026-06-04 19:05:11.898538029 +0000 @@ -172,12 +172,12 @@ can be expected by the different codecs provided by the megaco application.

    The measurement is done by iterating over the decode/encode function for approx 2 seconds per message and counting the number of decodes/encodes.

    Is best run by modifying the meas.sh.skel skeleton script provided by the tool.

    To run it manually do the following:

            % erl -pa <path-megaco-ebin-dir> -pa <path-to-meas-module-dir>
    -        Erlang (BEAM) emulator version 5.6 [source]
    +        Erlang (BEAM) emulator version 5.6 [source]
     
    -        Eshell V12.2  (abort with ^G)
    -        1> megaco_codec_meas:start().
    +        Eshell V12.2  (abort with ^G)
    +        1> megaco_codec_meas:start().
             ...
    -        2> halt().

    or to make it even easier, assuming a measure shall be done on all the codecs + 2> halt().

    or to make it even easier, assuming a measure shall be done on all the codecs (as above):

            % erl -noshell -pa <path-megaco-ebin-dir> \\
                   -pa <path-to-meas-module-dir> \\
                   -s megaco_codec_meas -s init stop

    When run as above (this will take some time), the measurement process is done @@ -199,10 +199,10 @@ value.

    Both these tools use the message package (time_test.msgs) provided with the tool(s), although it can run on any message package as long as it has the same structure.

    Message package file

    This is simply an erlang compatible text-file with the following structure: -{codec_name(), messages_list()}.

    codec_name() = pretty | compact | ber | per | erlang      (how the messages are encoded)
    -messages_list() = [{message_name(), message()}]
    -message_name() = atom()
    -message() = binary()

    The codec name is the name of the codec with which all messages in the +{codec_name(), messages_list()}.

    codec_name() = pretty | compact | ber | per | erlang      (how the messages are encoded)
    +messages_list() = [{message_name(), message()}]
    +message_name() = atom()
    +message() = binary()

    The codec name is the name of the codec with which all messages in the message_list() has been encoded.

    This file can be exported to a file structure by calling the export_messages function. This can be usefull if a measurement shall be done with an external tool. Exporting the @@ -266,7 +266,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_digit_map.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_digit_map.html 2026-06-04 19:05:11.917538206 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_digit_map.html 2026-06-04 19:05:11.917538206 +0000 @@ -508,7 +508,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_edist_compress.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_edist_compress.html 2026-06-04 19:05:11.933538354 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_edist_compress.html 2026-06-04 19:05:11.933538354 +0000 @@ -281,7 +281,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_encode.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (783)) --- old//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_encode.html 2026-06-04 19:05:11.950538512 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_encode.html 2026-06-04 19:05:11.950538512 +0000 @@ -158,75 +158,75 @@ format using long keywords and an indentation style like the text examples in the Megaco/H.248 specification).

    Here follows an example of a text message to give a feeling of the difference between the pretty and compact versions of text messages. First the pretty, well -indented version with long keywords:

       MEGACO/1 [124.124.124.222]
    -   Transaction = 9998 {
    -           Context = - {
    -                   ServiceChange = ROOT {
    -                           Services {
    +indented version with long keywords:

       MEGACO/1 [124.124.124.222]
    +   Transaction = 9998 {
    +           Context = - {
    +                   ServiceChange = ROOT {
    +                           Services {
                                        Method = Restart,
                                        ServiceChangeAddress = 55555,
                                        Profile = ResGW/1,
                                        Reason = "901 Cold Boot"
    -                           }
    -                   }
    -           }
    -   }

    Then the compact version without indentation and with short keywords:

    
    +                           }
    +                   }
    +           }
    +   }

    Then the compact version without indentation and with short keywords:

    
        !/1 [124.124.124.222]
        T=9998{C=-{SC=ROOT{SV{MT=RS,AD=55555,PF=ResGW/1,RE="901 Cold Boot"}}}}

    And the programmers view of the same message. First a list of ActionRequest records are constructed and then it is sent with one of the send functions in -the API:

      Prof = #'ServiceChangeProfile'{profileName = "resgw", version = 1},
    -  Parm = #'ServiceChangeParm'{serviceChangeMethod  = restart,
    -                              serviceChangeAddress = {portNumber, 55555},
    +the API:

      Prof = #'ServiceChangeProfile'{profileName = "resgw", version = 1},
    +  Parm = #'ServiceChangeParm'{serviceChangeMethod  = restart,
    +                              serviceChangeAddress = {portNumber, 55555},
                                   serviceChangeReason  = "901 Cold Boot",
    -                              serviceChangeProfile = Prof},
    -  Req = #'ServiceChangeRequest'{terminationID = [?megaco_root_termination_id],
    -                                serviceChangeParms = Parm},
    -  Actions = [#'ActionRequest'{contextId = ?megaco_null_context_id,
    -                              commandRequests = {serviceChangeReq, Req}}],
    -  megaco:call(ConnHandle, Actions, Config).

    And finally a print-out of the entire internal form:

      {'MegacoMessage',
    +                              serviceChangeProfile = Prof},
    +  Req = #'ServiceChangeRequest'{terminationID = [?megaco_root_termination_id],
    +                                serviceChangeParms = Parm},
    +  Actions = [#'ActionRequest'{contextId = ?megaco_null_context_id,
    +                              commandRequests = {serviceChangeReq, Req}}],
    +  megaco:call(ConnHandle, Actions, Config).

    And finally a print-out of the entire internal form:

      {'MegacoMessage',
        asn1_NOVALUE,
    -   {'Message',
    +   {'Message',
         1,
    -    {ip4Address,{'IP4Address', [124,124,124,222], asn1_NOVALUE}},
    -    {transactions,
    -     [
    -      {transactionRequest,
    -       {'TransactionRequest',
    +    {ip4Address,{'IP4Address', [124,124,124,222], asn1_NOVALUE}},
    +    {transactions,
    +     [
    +      {transactionRequest,
    +       {'TransactionRequest',
              9998,
    -         [{'ActionRequest',
    +         [{'ActionRequest',
                0,
                asn1_NOVALUE,
                asn1_NOVALUE,
    -           [
    -            {'CommandRequest',
    -             {serviceChangeReq,
    -              {'ServiceChangeRequest',
    -               [
    -                {megaco_term_id, false, ["root"]}],
    -                {'ServiceChangeParm',
    +           [
    +            {'CommandRequest',
    +             {serviceChangeReq,
    +              {'ServiceChangeRequest',
    +               [
    +                {megaco_term_id, false, ["root"]}],
    +                {'ServiceChangeParm',
                      restart,
    -                 {portNumber, 55555},
    +                 {portNumber, 55555},
                      asn1_NOVALUE,
    -                 {'ServiceChangeProfile', "resgw", version = 1},
    +                 {'ServiceChangeProfile', "resgw", version = 1},
                      "901 MG Cold Boot",
                      asn1_NOVALUE,
                      asn1_NOVALUE,
                      asn1_NOVALUE
    -                }
    -              }
    -             },
    +                }
    +              }
    +             },
                  asn1_NOVALUE,
                  asn1_NOVALUE
    -            }
    -           ]
    -          }
    -         ]
    -       }
    -      }
    -     ]
    -    }
    -   }
    -  }

    The following encoding modules are provided:

    • megaco_pretty_text_encoder - encodes messages into pretty text format, decodes + } + ] + } + ] + } + } + ] + } + } + }

    The following encoding modules are provided:

    • megaco_pretty_text_encoder - encodes messages into pretty text format, decodes both pretty as well as compact text.
    • megaco_compact_text_encoder - encodes messages into compact text format, decodes both pretty as well as compact text.
    • megaco_binary_encoder - encode/decode ASN.1 BER messages. This encoder implements the fastest of the BER encoders/decoders. Recommended binary codec.
    • megaco_ber_encoder - encode/decode ASN.1 BER messages.
    • megaco_per_encoder - encode/decode ASN.1 PER messages. N.B. that this format @@ -357,7 +357,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_encoder.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (795)) --- old//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_encoder.html 2026-06-04 19:05:11.974538734 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_encoder.html 2026-06-04 19:05:11.974538734 +0000 @@ -1404,7 +1404,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_examples.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (558)) --- old//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_examples.html 2026-06-04 19:05:11.992538902 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_examples.html 2026-06-04 19:05:11.993538911 +0000 @@ -159,10 +159,10 @@ erl -pa ../../../megaco/ebin -s megaco_filter -s megaco megaco_simple_mg:start().

    or simply 'gmake mg'.

    If you "only" want to start a single MG which tries to connect an MG on a host named "baidarka", you may use one of these functions (instead of the -megaco_simple_mg:start/0 above):

          megaco_simple_mg:start_tcp_text("baidarka", []).
    -      megaco_simple_mg:start_tcp_binary("baidarka", []).
    -      megaco_simple_mg:start_udp_text("baidarka", []).
    -      megaco_simple_mg:start_udp_binary("baidarka", []).

    The -s megaco_filter option to erl implies, the event tracing mechanism to be +megaco_simple_mg:start/0 above):

          megaco_simple_mg:start_tcp_text("baidarka", []).
    +      megaco_simple_mg:start_tcp_binary("baidarka", []).
    +      megaco_simple_mg:start_udp_text("baidarka", []).
    +      megaco_simple_mg:start_udp_binary("baidarka", []).

    The -s megaco_filter option to erl implies, the event tracing mechanism to be enabled and an interactive sequence chart tool to be started. This may be quite useful in order to visualize how your MG interacts with the Megaco/H.248 protocol stack.

    The event traces may alternatively be directed to a file for later analyze. By @@ -218,7 +218,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_flex_scanner.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (341)) --- old//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_flex_scanner.html 2026-06-04 19:05:12.011539078 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_flex_scanner.html 2026-06-04 19:05:12.012539087 +0000 @@ -451,7 +451,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_intro.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (786)) --- old//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_intro.html 2026-06-04 19:05:12.028539235 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_intro.html 2026-06-04 19:05:12.028539235 +0000 @@ -214,7 +214,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_mib.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_mib.html 2026-06-04 19:05:12.044539384 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_mib.html 2026-06-04 19:05:12.044539384 +0000 @@ -206,7 +206,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_performance.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (2969)) --- old//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_performance.html 2026-06-04 19:05:12.060539532 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_performance.html 2026-06-04 19:05:12.061539542 +0000 @@ -162,19 +162,19 @@ built-in functions.

    The actual encoded messages have been collected in one directory per encoding type, containing one file per encoded message.

    Here follows an example of a text message to give a feeling of the difference between the pretty and compact versions of text messages. First the pretty -printed, well indented version with long keywords:

    MEGACO/1 [124.124.124.222]
    -  Transaction = 9998 {
    -    Context = - {
    -      ServiceChange = ROOT {
    -        Services {
    +printed, well indented version with long keywords:

    MEGACO/1 [124.124.124.222]
    +  Transaction = 9998 {
    +    Context = - {
    +      ServiceChange = ROOT {
    +        Services {
               Method = Restart,
               ServiceChangeAddress = 55555,
               Profile = ResGW/1,
               Reason = "901 MG Cold Boot"
    -        }
    -      }
    -    }
    -  }

    Then the compact text version without indentation and with short keywords:

    !/1 [124.124.124.222] T=9998{
    +        }
    +      }
    +    }
    +  }

    Then the compact text version without indentation and with short keywords:

    !/1 [124.124.124.222] T=9998{
       C=-{SC=ROOT{SV{MT=RS,AD=55555,PF=ResGW/1,RE="901 MG Cold Boot"}}}}

    @@ -257,7 +257,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_run.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (585)) --- old//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_run.html 2026-06-04 19:05:12.079539708 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_run.html 2026-06-04 19:05:12.082539736 +0000 @@ -335,7 +335,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_sdp.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (375)) --- old//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_sdp.html 2026-06-04 19:05:12.103539931 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_sdp.html 2026-06-04 19:05:12.103539931 +0000 @@ -1240,7 +1240,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_tcp.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (450)) --- old//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_tcp.html 2026-06-04 19:05:12.122540107 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_tcp.html 2026-06-04 19:05:12.122540107 +0000 @@ -861,7 +861,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_transport.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (393)) --- old//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_transport.html 2026-06-04 19:05:12.138540256 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_transport.html 2026-06-04 19:05:12.138540256 +0000 @@ -340,7 +340,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_transport_mechanisms.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (569)) --- old//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_transport_mechanisms.html 2026-06-04 19:05:12.153540395 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_transport_mechanisms.html 2026-06-04 19:05:12.153540395 +0000 @@ -191,7 +191,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_udp.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (460)) --- old//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_udp.html 2026-06-04 19:05:12.173540581 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_udp.html 2026-06-04 19:05:12.174540590 +0000 @@ -891,7 +891,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_user.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1092)) --- old//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_user.html 2026-06-04 19:05:12.201540840 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/megaco_user.html 2026-06-04 19:05:12.202540850 +0000 @@ -133,7 +133,7 @@ list of the callback functions. For example, the handle_connect function takes by default two arguments:

            handle_connect(Handle, Version)

    but if the user_args parameter is set to a longer list, such as [SomePid,SomeTableRef], the callback function is expected to have these (in -this case two) extra arguments last in the argument list:

            handle_connect(Handle, Version, SomePid, SomeTableRef)

    Note

    Must of the functions below has an optional Extra argument (e.g. +this case two) extra arguments last in the argument list:

            handle_connect(Handle, Version, SomePid, SomeTableRef)

    Note

    Must of the functions below has an optional Extra argument (e.g. handle_unexpected_trans/4). The functions which takes this argument will be called if and only if one of the functions receive_message/5 or @@ -144,10 +144,10 @@ DATA TYPES

    -
    action_request() = #'ActionRequest'{}
    -action_reply() = #'ActionReply'{}
    -error_desc() = #'ErrorDescriptor'{}
    -segment_no() = integer()
    conn_handle() = #megaco_conn_handle{}

    The record initially returned by megaco:connect/4,5. It identifies a "virtual" +

    action_request() = #'ActionRequest'{}
    +action_reply() = #'ActionReply'{}
    +error_desc() = #'ErrorDescriptor'{}
    +segment_no() = integer()
    conn_handle() = #megaco_conn_handle{}

    The record initially returned by megaco:connect/4,5. It identifies a "virtual" connection and may be reused after a reconnect (disconnect + connect).

    protocol_version() = integer()

    Is the actual protocol version. In most cases the protocol version is retrieved from the processed message, but there are exceptions:

    In these cases, the ProtocolVersion default version is obtained from the static @@ -1555,7 +1555,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/notes.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (601)) --- old//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/notes.html 2026-06-04 19:05:12.225541063 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/notes.html 2026-06-04 19:05:12.225541063 +0000 @@ -984,7 +984,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/search.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/search.html 2026-06-04 19:05:12.243541230 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/megaco-4.6/doc/html/search.html 2026-06-04 19:05:12.245775318 +0000 @@ -122,7 +122,7 @@
    - + /usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/404.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/404.html 2026-06-04 19:05:12.260426659 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/404.html 2026-06-04 19:05:12.260426659 +0000 @@ -147,7 +147,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/api-reference.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/api-reference.html 2026-06-04 19:05:12.275541527 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/api-reference.html 2026-06-04 19:05:12.275541527 +0000 @@ -203,7 +203,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.epub/OEBPS/content.opf differs (XML 1.0 document, ASCII text) --- old//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.epub/OEBPS/content.opf 2026-06-04 00:08:23.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.epub/OEBPS/content.opf 2042-07-06 13:27:49.000000000 +0000 @@ -4,10 +4,10 @@ version="3.0"> mnesia - 4.23.2 - urn:uuid:65fcd04d-6e43-d963-1fb3-2c9df2a5632a + urn:uuid:b57ad304-786e-e6fe-6da9-44db4bcfa7d8 en - 2026-06-04T00:08:23Z + 2042-07-06T13:27:49Z /usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.epub/OEBPS/mnesia_app_a.xhtml differs (HTML document, ASCII text, with very long lines (953)) --- old//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.epub/OEBPS/mnesia_app_a.xhtml 2026-06-04 00:08:23.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.epub/OEBPS/mnesia_app_a.xhtml 2042-07-06 13:27:49.000000000 +0000 @@ -54,11 +54,11 @@
    %% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% --module(mnesia_backup). +-module(mnesia_backup). --include_lib("kernel/include/file.hrl"). +-include_lib("kernel/include/file.hrl"). --export([ +-export([ %% Write access open_write/1, write/2, @@ -69,105 +69,105 @@ open_read/1, read/1, close_read/1 - ]). + ]). %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %% Backup callback interface --record(backup, {tmp_file, file, file_desc}). +-record(backup, {tmp_file, file, file_desc}). %% Opens backup media for write %% %% Returns {ok, OpaqueData} or {error, Reason} -open_write(OpaqueData) -> +open_write(OpaqueData) -> File = OpaqueData, - Tmp = lists:concat([File,".BUPTMP"]), - file:delete(Tmp), - case disk_log:open([{name, make_ref()}, - {file, Tmp}, - {repair, false}, - {linkto, self()}]) of - {ok, Fd} -> - {ok, #backup{tmp_file = Tmp, file = File, file_desc = Fd}}; - {error, Reason} -> - {error, Reason} + Tmp = lists:concat([File,".BUPTMP"]), + file:delete(Tmp), + case disk_log:open([{name, make_ref()}, + {file, Tmp}, + {repair, false}, + {linkto, self()}]) of + {ok, Fd} -> + {ok, #backup{tmp_file = Tmp, file = File, file_desc = Fd}}; + {error, Reason} -> + {error, Reason} end. %% Writes BackupItems to the backup media %% %% Returns {ok, OpaqueData} or {error, Reason} -write(OpaqueData, BackupItems) -> +write(OpaqueData, BackupItems) -> B = OpaqueData, - case disk_log:log_terms(B#backup.file_desc, BackupItems) of + case disk_log:log_terms(B#backup.file_desc, BackupItems) of ok -> - {ok, B}; - {error, Reason} -> - abort_write(B), - {error, Reason} + {ok, B}; + {error, Reason} -> + abort_write(B), + {error, Reason} end. %% Closes the backup media after a successful backup %% %% Returns {ok, ReturnValueToUser} or {error, Reason} -commit_write(OpaqueData) -> +commit_write(OpaqueData) -> B = OpaqueData, - case disk_log:sync(B#backup.file_desc) of + case disk_log:sync(B#backup.file_desc) of ok -> - case disk_log:close(B#backup.file_desc) of + case disk_log:close(B#backup.file_desc) of ok -> - file:delete(B#backup.file), - case file:rename(B#backup.tmp_file, B#backup.file) of + file:delete(B#backup.file), + case file:rename(B#backup.tmp_file, B#backup.file) of ok -> - {ok, B#backup.file}; - {error, Reason} -> - {error, Reason} + {ok, B#backup.file}; + {error, Reason} -> + {error, Reason} end; - {error, Reason} -> - {error, Reason} + {error, Reason} -> + {error, Reason} end; - {error, Reason} -> - {error, Reason} + {error, Reason} -> + {error, Reason} end. %% Closes the backup media after an interrupted backup %% %% Returns {ok, ReturnValueToUser} or {error, Reason} -abort_write(BackupRef) -> - Res = disk_log:close(BackupRef#backup.file_desc), - file:delete(BackupRef#backup.tmp_file), +abort_write(BackupRef) -> + Res = disk_log:close(BackupRef#backup.file_desc), + file:delete(BackupRef#backup.tmp_file), case Res of ok -> - {ok, BackupRef#backup.file}; - {error, Reason} -> - {error, Reason} + {ok, BackupRef#backup.file}; + {error, Reason} -> + {error, Reason} end. %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %% Restore callback interface --record(restore, {file, file_desc, cont}). +-record(restore, {file, file_desc, cont}). %% Opens backup media for read %% %% Returns {ok, OpaqueData} or {error, Reason} -open_read(OpaqueData) -> +open_read(OpaqueData) -> File = OpaqueData, - case file:read_file_info(File) of - {error, Reason} -> - {error, Reason}; + case file:read_file_info(File) of + {error, Reason} -> + {error, Reason}; _FileInfo -> %% file exists - case disk_log:open([{file, File}, - {name, make_ref()}, - {repair, false}, - {mode, read_only}, - {linkto, self()}]) of - {ok, Fd} -> - {ok, #restore{file = File, file_desc = Fd, cont = start}}; - {repaired, Fd, _, {badbytes, 0}} -> - {ok, #restore{file = File, file_desc = Fd, cont = start}}; - {repaired, Fd, _, _} -> - {ok, #restore{file = File, file_desc = Fd, cont = start}}; - {error, Reason} -> - {error, Reason} + case disk_log:open([{file, File}, + {name, make_ref()}, + {repair, false}, + {mode, read_only}, + {linkto, self()}]) of + {ok, Fd} -> + {ok, #restore{file = File, file_desc = Fd, cont = start}}; + {repaired, Fd, _, {badbytes, 0}} -> + {ok, #restore{file = File, file_desc = Fd, cont = start}}; + {repaired, Fd, _, _} -> + {ok, #restore{file = File, file_desc = Fd, cont = start}}; + {error, Reason} -> + {error, Reason} end end. @@ -176,30 +176,30 @@ %% Returns {ok, OpaqueData, BackupItems} or {error, Reason} %% %% BackupItems == [] is interpreted as eof -read(OpaqueData) -> +read(OpaqueData) -> R = OpaqueData, Fd = R#restore.file_desc, - case disk_log:chunk(Fd, R#restore.cont) of - {error, Reason} -> - {error, {"Possibly truncated", Reason}}; + case disk_log:chunk(Fd, R#restore.cont) of + {error, Reason} -> + {error, {"Possibly truncated", Reason}}; eof -> - {ok, R, []}; - {Cont, []} -> - read(R#restore{cont = Cont}); - {Cont, BackupItems, _BadBytes} -> - {ok, R#restore{cont = Cont}, BackupItems}; - {Cont, BackupItems} -> - {ok, R#restore{cont = Cont}, BackupItems} /usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.epub/OEBPS/mnesia_app_b.xhtml differs (HTML document, ASCII text, with very long lines (960)) --- old//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.epub/OEBPS/mnesia_app_b.xhtml 2026-06-04 00:08:23.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.epub/OEBPS/mnesia_app_b.xhtml 2042-07-06 13:27:49.000000000 +0000 @@ -26,10 +26,10 @@ mnesia_access Callback Behavior -
    -module(mnesia_frag).
    +
    -module(mnesia_frag).
     
     %% Callback functions when accessed within an activity
    --export([
    +-export([
     	 lock/4,
     	 write/5, delete/5, delete_object/5,
     	 read/5, match_object/5, all_keys/4,
    @@ -38,230 +38,230 @@
     	 foldl/6, foldr/6, table_info/4,
     	 first/3, next/4, prev/4, last/3,
     	 clear_table/4
    -       ]).
    %% Callback functions which provides transparent
    +       ]).
    %% Callback functions which provides transparent
     %% access of fragmented tables from any activity
     %% access context.
     
    -lock(ActivityId, Opaque, {table , Tab}, LockKind) ->
    -    case frag_names(Tab) of
    -	[Tab] ->
    -	    mnesia:lock(ActivityId, Opaque, {table, Tab}, LockKind);
    +lock(ActivityId, Opaque, {table , Tab}, LockKind) ->
    +    case frag_names(Tab) of
    +	[Tab] ->
    +	    mnesia:lock(ActivityId, Opaque, {table, Tab}, LockKind);
     	Frags ->
    -	    DeepNs = [mnesia:lock(ActivityId, Opaque, {table, F}, LockKind) ||
    -			 F <- Frags],
    -	    mnesia_lib:uniq(lists:append(DeepNs))
    +	    DeepNs = [mnesia:lock(ActivityId, Opaque, {table, F}, LockKind) ||
    +			 F <- Frags],
    +	    mnesia_lib:uniq(lists:append(DeepNs))
         end;
     
    -lock(ActivityId, Opaque, LockItem, LockKind) ->
    -    mnesia:lock(ActivityId, Opaque, LockItem, LockKind).
    +lock(ActivityId, Opaque, LockItem, LockKind) ->
    +    mnesia:lock(ActivityId, Opaque, LockItem, LockKind).
     
    -write(ActivityId, Opaque, Tab, Rec, LockKind) ->
    -    Frag = record_to_frag_name(Tab, Rec),
    -    mnesia:write(ActivityId, Opaque, Frag, Rec, LockKind).
    +write(ActivityId, Opaque, Tab, Rec, LockKind) ->
    +    Frag = record_to_frag_name(Tab, Rec),
    +    mnesia:write(ActivityId, Opaque, Frag, Rec, LockKind).
     
    -delete(ActivityId, Opaque, Tab, Key, LockKind) ->
    -    Frag = key_to_frag_name(Tab, Key),
    -    mnesia:delete(ActivityId, Opaque, Frag, Key, LockKind).
    +delete(ActivityId, Opaque, Tab, Key, LockKind) ->
    +    Frag = key_to_frag_name(Tab, Key),
    +    mnesia:delete(ActivityId, Opaque, Frag, Key, LockKind).
     
    -delete_object(ActivityId, Opaque, Tab, Rec, LockKind) ->
    -    Frag = record_to_frag_name(Tab, Rec),
    -    mnesia:delete_object(ActivityId, Opaque, Frag, Rec, LockKind).
    +delete_object(ActivityId, Opaque, Tab, Rec, LockKind) ->
    +    Frag = record_to_frag_name(Tab, Rec),
    +    mnesia:delete_object(ActivityId, Opaque, Frag, Rec, LockKind).
     
    -read(ActivityId, Opaque, Tab, Key, LockKind) ->
    -    Frag = key_to_frag_name(Tab, Key),
    -    mnesia:read(ActivityId, Opaque, Frag, Key, LockKind).
    +read(ActivityId, Opaque, Tab, Key, LockKind) ->
    +    Frag = key_to_frag_name(Tab, Key),
    +    mnesia:read(ActivityId, Opaque, Frag, Key, LockKind).
     
    -match_object(ActivityId, Opaque, Tab, HeadPat, LockKind) ->
    -    MatchSpec = [{HeadPat, [], ['$_']}],
    -    select(ActivityId, Opaque, Tab, MatchSpec, LockKind).
    +match_object(ActivityId, Opaque, Tab, HeadPat, LockKind) ->
    +    MatchSpec = [{HeadPat, [], ['$_']}],
    +    select(ActivityId, Opaque, Tab, MatchSpec, LockKind).
     
    -select(ActivityId, Opaque, Tab, MatchSpec, LockKind) ->
    -    do_select(ActivityId, Opaque, Tab, MatchSpec, LockKind).
    +select(ActivityId, Opaque, Tab, MatchSpec, LockKind) ->
    +    do_select(ActivityId, Opaque, Tab, MatchSpec, LockKind).
     
     
    -select(ActivityId, Opaque, Tab, MatchSpec, Limit, LockKind) ->
    -    init_select(ActivityId, Opaque, Tab, MatchSpec, Limit, LockKind).
    +select(ActivityId, Opaque, Tab, MatchSpec, Limit, LockKind) ->
    +    init_select(ActivityId, Opaque, Tab, MatchSpec, Limit, LockKind).
     
     
    -all_keys(ActivityId, Opaque, Tab, LockKind) ->
    -    Match = [mnesia:all_keys(ActivityId, Opaque, Frag, LockKind)
    -	     || Frag <- frag_names(Tab)],
    -    lists:append(Match).
    +all_keys(ActivityId, Opaque, Tab, LockKind) ->
    +    Match = [mnesia:all_keys(ActivityId, Opaque, Frag, LockKind)
    +	     || Frag <- frag_names(Tab)],
    +    lists:append(Match).
     
    -clear_table(ActivityId, Opaque, Tab, Obj) ->
    -    [mnesia:clear_table(ActivityId, Opaque, Frag, Obj)  || Frag <- frag_names(Tab)],
    +clear_table(ActivityId, Opaque, Tab, Obj) ->
    +    [mnesia:clear_table(ActivityId, Opaque, Frag, Obj)  || Frag <- frag_names(Tab)],
         ok.
     
    -index_match_object(ActivityId, Opaque, Tab, Pat, Attr, LockKind) ->
    +index_match_object(ActivityId, Opaque, Tab, Pat, Attr, LockKind) ->
         Match =
    -	[mnesia:index_match_object(ActivityId, Opaque, Frag, Pat, Attr, LockKind)
    -	 || Frag <- frag_names(Tab)],
    -    lists:append(Match).
    +	[mnesia:index_match_object(ActivityId, Opaque, Frag, Pat, Attr, LockKind)
    +	 || Frag <- frag_names(Tab)],
    +    lists:append(Match).
     
    -index_read(ActivityId, Opaque, Tab, Key, Attr, LockKind) ->
    +index_read(ActivityId, Opaque, Tab, Key, Attr, LockKind) ->
         Match =
    -	[mnesia:index_read(ActivityId, Opaque, Frag, Key, Attr, LockKind)
    -	     || Frag <- frag_names(Tab)],
    -    lists:append(Match).
    -
    -foldl(ActivityId, Opaque, Fun, Acc, Tab, LockKind) ->
    -    Fun2 = fun(Frag, A) ->
    -		   mnesia:foldl(ActivityId, Opaque, Fun, A, Frag, LockKind)
    +	[mnesia:index_read(ActivityId, Opaque, Frag, Key, Attr, LockKind)
    +	     || Frag <- frag_names(Tab)],
    +    lists:append(Match).
    +
    +foldl(ActivityId, Opaque, Fun, Acc, Tab, LockKind) ->
    +    Fun2 = fun(Frag, A) ->
    +		   mnesia:foldl(ActivityId, Opaque, Fun, A, Frag, LockKind)
     	   end,
    -    lists:foldl(Fun2, Acc, frag_names(Tab)).
    +    lists:foldl(Fun2, Acc, frag_names(Tab)).
     
    -foldr(ActivityId, Opaque, Fun, Acc, Tab, LockKind) ->
    -    Fun2 = fun(Frag, A) ->
    -		   mnesia:foldr(ActivityId, Opaque, Fun, A, Frag, LockKind)
    +foldr(ActivityId, Opaque, Fun, Acc, Tab, LockKind) ->
    +    Fun2 = fun(Frag, A) ->
    +		   mnesia:foldr(ActivityId, Opaque, Fun, A, Frag, LockKind)
     	   end,
    -    lists:foldr(Fun2, Acc, frag_names(Tab)).
    +    lists:foldr(Fun2, Acc, frag_names(Tab)).
     
    -table_info(ActivityId, Opaque, {Tab, Key}, Item) ->
    -    Frag = key_to_frag_name(Tab, Key),
    -    table_info2(ActivityId, Opaque, Tab, Frag, Item);
    -table_info(ActivityId, Opaque, Tab, Item) ->
    -    table_info2(ActivityId, Opaque, Tab, Tab, Item).
    +table_info(ActivityId, Opaque, {Tab, Key}, Item) ->
    +    Frag = key_to_frag_name(Tab, Key),
    +    table_info2(ActivityId, Opaque, Tab, Frag, Item);
    +table_info(ActivityId, Opaque, Tab, Item) ->
    +    table_info2(ActivityId, Opaque, Tab, Tab, Item).
     
    -table_info2(ActivityId, Opaque, Tab, Frag, Item) ->
    +table_info2(ActivityId, Opaque, Tab, Frag, Item) ->
         case Item of
     	size ->
    -	    SumFun = fun({_, Size}, Acc) -> Acc + Size end,
    -	    lists:foldl(SumFun, 0, frag_size(ActivityId, Opaque, Tab));
    +	    SumFun = fun({_, Size}, Acc) -> Acc + Size end,
    +	    lists:foldl(SumFun, 0, frag_size(ActivityId, Opaque, Tab));
     	memory ->
    -	    SumFun = fun({_, Size}, Acc) -> Acc + Size end,
    -	    lists:foldl(SumFun, 0, frag_memory(ActivityId, Opaque, Tab));
    +	    SumFun = fun({_, Size}, Acc) -> Acc + Size end,
    +	    lists:foldl(SumFun, 0, frag_memory(ActivityId, Opaque, Tab));
     	base_table ->
    -	    lookup_prop(Tab, base_table);
    +	    lookup_prop(Tab, base_table);
     	node_pool ->
    -	    lookup_prop(Tab, node_pool);
    +	    lookup_prop(Tab, node_pool);
     	n_fragments ->
    -	    FH = lookup_frag_hash(Tab),
    +	    FH = lookup_frag_hash(Tab),
     	    FH#frag_state.n_fragments;
     	foreign_key ->
    -	    FH = lookup_frag_hash(Tab),
    +	    FH = lookup_frag_hash(Tab),
     	    FH#frag_state.foreign_key;
     	foreigners ->
    -	    lookup_foreigners(Tab);
    +	    lookup_foreigners(Tab);
     	n_ram_copies ->
    -	    length(val({Tab, ram_copies}));
    +	    length(val({Tab, ram_copies}));
     	n_disc_copies ->
    -	    length(val({Tab, disc_copies}));
    +	    length(val({Tab, disc_copies}));
     	n_disc_only_copies ->
    -	    length(val({Tab, disc_only_copies}));
    +	    length(val({Tab, disc_only_copies}));
     	n_external_copies ->
    /usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.epub/OEBPS/mnesia_app_c.xhtml differs (HTML document, ASCII text, with very long lines (1056))
    --- old//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.epub/OEBPS/mnesia_app_c.xhtml	2026-06-04 00:08:23.000000000 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.epub/OEBPS/mnesia_app_c.xhtml	2042-07-06 13:27:49.000000000 +0000
    @@ -26,136 +26,136 @@
       
       mnesia_frag_hash Callback Behavior
     
    -
    -module(mnesia_frag_hash).
    --compile([{nowarn_deprecated_function, [{erlang,phash,2}]}]).
    +
    -module(mnesia_frag_hash).
    +-compile([{nowarn_deprecated_function, [{erlang,phash,2}]}]).
     
     %% Fragmented Table Hashing callback functions
    --export([
    +-export([
     	 init_state/2,
     	 add_frag/1,
     	 del_frag/1,
     	 key_to_frag_number/2,
     	 match_spec_to_frag_numbers/2
    -	]).
    -record(hash_state,
    -	{n_fragments,
    +	]).
    -record(hash_state,
    +	{n_fragments,
     	 next_n_to_split,
     	 n_doubles,
    -	 function}).
    +	 function}).
     
     %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
    --spec init_state(Tab, State) -> NewState when
    -      Tab :: atom(),
    -      State :: term(),
    -      NewState :: term().
    -init_state(_Tab, State) when State == undefined ->
    -    #hash_state{n_fragments     = 1,
    +-spec init_state(Tab, State) -> NewState when
    +      Tab :: atom(),
    +      State :: term(),
    +      NewState :: term().
    +init_state(_Tab, State) when State == undefined ->
    +    #hash_state{n_fragments     = 1,
     		next_n_to_split = 1,
     		n_doubles       = 0,
    -		function        = phash2}.
    +		function        = phash2}.
     
    -convert_old_state({hash_state, N, P, L}) ->
    -    #hash_state{n_fragments     = N,
    +convert_old_state({hash_state, N, P, L}) ->
    +    #hash_state{n_fragments     = N,
     		next_n_to_split = P,
     		n_doubles       = L,
    -		function        = phash}.
    +		function        = phash}.
     
     %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
     
    --spec add_frag(State :: term()) -> {NewState, IterFrags, AdditionalLockFrags} when
    -      NewState :: term(),
    -      IterFrags :: [integer()],
    -      AdditionalLockFrags :: [integer()].
    -add_frag(#hash_state{next_n_to_split = SplitN, n_doubles = L, n_fragments = N} = State) ->
    +-spec add_frag(State :: term()) -> {NewState, IterFrags, AdditionalLockFrags} when
    +      NewState :: term(),
    +      IterFrags :: [integer()],
    +      AdditionalLockFrags :: [integer()].
    +add_frag(#hash_state{next_n_to_split = SplitN, n_doubles = L, n_fragments = N} = State) ->
         P = SplitN + 1,
         NewN = N + 1,
    -    State2 = case power2(L) + 1 of
    +    State2 = case power2(L) + 1 of
     		 P2 when P2 == P ->
    -		     State#hash_state{n_fragments      = NewN,
    +		     State#hash_state{n_fragments      = NewN,
     				      n_doubles        = L + 1,
    -				      next_n_to_split = 1};
    +				      next_n_to_split = 1};
     		 _ ->
    -		     State#hash_state{n_fragments     = NewN,
    -				      next_n_to_split = P}
    +		     State#hash_state{n_fragments     = NewN,
    +				      next_n_to_split = P}
     	     end,
    -    {State2, [SplitN], [NewN]};
    -add_frag(OldState) ->
    -    State = convert_old_state(OldState),
    -    add_frag(State).
    +    {State2, [SplitN], [NewN]};
    +add_frag(OldState) ->
    +    State = convert_old_state(OldState),
    +    add_frag(State).
     
     %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
     
    --spec del_frag(State :: term()) -> {NewState, IterFrags, AdditionalLockFrags} when
    -      NewState :: term(),
    -      IterFrags :: [integer()],
    -      AdditionalLockFrags :: [integer()].
    -del_frag(#hash_state{next_n_to_split = SplitN, n_doubles = L, n_fragments = N} = State) ->
    +-spec del_frag(State :: term()) -> {NewState, IterFrags, AdditionalLockFrags} when
    +      NewState :: term(),
    +      IterFrags :: [integer()],
    +      AdditionalLockFrags :: [integer()].
    +del_frag(#hash_state{next_n_to_split = SplitN, n_doubles = L, n_fragments = N} = State) ->
         P = SplitN - 1,
         if
     	P < 1 ->
     	    L2 = L - 1,
    -	    MergeN = power2(L2),
    -	    State2 = State#hash_state{n_fragments     = N - 1,
    +	    MergeN = power2(L2),
    +	    State2 = State#hash_state{n_fragments     = N - 1,
     				      next_n_to_split = MergeN,
    -				      n_doubles       = L2},
    -	    {State2, [N], [MergeN]};
    +				      n_doubles       = L2},
    +	    {State2, [N], [MergeN]};
     	true ->
     	    MergeN = P,
    -	    State2 = State#hash_state{n_fragments     = N - 1,
    -				      next_n_to_split = MergeN},
    -	    {State2, [N], [MergeN]}
    +	    State2 = State#hash_state{n_fragments     = N - 1,
    +				      next_n_to_split = MergeN},
    +	    {State2, [N], [MergeN]}
     	end;
    -del_frag(OldState) ->
    -    State = convert_old_state(OldState),
    -    del_frag(State).
    +del_frag(OldState) ->
    +    State = convert_old_state(OldState),
    +    del_frag(State).
     
     %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
    --spec key_to_frag_number(State, Key) -> Fragnum when
    -      State :: term(),
    -      Key :: term(),
    -      Fragnum :: integer().
    -key_to_frag_number(#hash_state{function = phash, n_fragments = N, n_doubles = L}, Key) ->
    -    A = erlang:phash(Key, power2(L + 1)),
    +-spec key_to_frag_number(State, Key) -> Fragnum when
    +      State :: term(),
    +      Key :: term(),
    +      Fragnum :: integer().
    +key_to_frag_number(#hash_state{function = phash, n_fragments = N, n_doubles = L}, Key) ->
    +    A = erlang:phash(Key, power2(L + 1)),
         if
     	A > N ->
    -	    A - power2(L);
    +	    A - power2(L);
     	true ->
     	    A
         end;
    -key_to_frag_number(#hash_state{function = phash2, n_fragments = N, n_doubles = L}, Key) ->
    -    A = erlang:phash2(Key, power2(L + 1)) + 1,
    +key_to_frag_number(#hash_state{function = phash2, n_fragments = N, n_doubles = L}, Key) ->
    +    A = erlang:phash2(Key, power2(L + 1)) + 1,
         if
     	A > N ->
    -	    A - power2(L);
    +	    A - power2(L);
     	true ->
     	    A
         end;
    -key_to_frag_number(OldState, Key) ->
    -    State = convert_old_state(OldState),
    -    key_to_frag_number(State, Key).
    +key_to_frag_number(OldState, Key) ->
    +    State = convert_old_state(OldState),
    +    key_to_frag_number(State, Key).
     
     %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
    --spec match_spec_to_frag_numbers(State, MatchSpec) -> Fragnums when
    -      State :: term(),
    -      MatchSpec :: ets:match_spec(),
    -      Fragnums :: [integer()].
    -match_spec_to_frag_numbers(#hash_state{n_fragments = N} = State, MatchSpec) ->
    +-spec match_spec_to_frag_numbers(State, MatchSpec) -> Fragnums when
    +      State :: term(),
    +      MatchSpec :: ets:match_spec(),
    +      Fragnums :: [integer()].
    +match_spec_to_frag_numbers(#hash_state{n_fragments = N} = State, MatchSpec) ->
         case MatchSpec of
    -	[{HeadPat, _, _}] when is_tuple(HeadPat), tuple_size(HeadPat) > 2 ->
    -	    KeyPat = element(2, HeadPat),
    -	    case has_var(KeyPat) of
    +	[{HeadPat, _, _}] when is_tuple(HeadPat), tuple_size(HeadPat) > 2 ->
    +	    KeyPat = element(2, HeadPat),
    +	    case has_var(KeyPat) of
     		false ->
    -		    [key_to_frag_number(State, KeyPat)];
    +		    [key_to_frag_number(State, KeyPat)];
     		true ->
    -		    lists:seq(1, N)
    +		    lists:seq(1, N)
     	    end;
     	_ ->
    -	    lists:seq(1, N)
    +	    lists:seq(1, N)
         end;
    /usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.epub/OEBPS/mnesia_chap2.xhtml differs (HTML document, ASCII text, with very long lines (931))
    --- old//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.epub/OEBPS/mnesia_chap2.xhtml	2026-06-04 00:08:23.000000000 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.epub/OEBPS/mnesia_chap2.xhtml	2042-07-06 13:27:49.000000000 +0000
    @@ -32,21 +32,21 @@
     
     

    This section provides a simplified demonstration of a Mnesia system startup. The dialogue from the Erlang shell is as follows:

    unix> erl -mnesia dir '"/tmp/funky"'
    -Erlang (BEAM) emulator version 4.9
    +Erlang (BEAM) emulator version 4.9
     
    -Eshell V4.9  (abort with ^G)
    +Eshell V4.9  (abort with ^G)
     1>
    -1> mnesia:create_schema([node()]).
    +1> mnesia:create_schema([node()]).
     ok
    -2> mnesia:start().
    +2> mnesia:start().
     ok
    -3> mnesia:create_table(funky, []).
    -{atomic,ok}
    -4> mnesia:info().
    +3> mnesia:create_table(funky, []).
    +{atomic,ok}
    +4> mnesia:info().
     ---> Processes holding locks <---
     ---> Processes waiting for locks <---
    ----> Pending (remote) transactions <---
    ----> Active (local) transactions <---
    +---> Pending (remote) transactions <---
    +---> Active (local) transactions <---
     ---> Uncertain transactions <---
     ---> Active tables <---
     funky          : with 0 records occupying 269 words of mem
    @@ -54,17 +54,17 @@
     ===> System info in version "1.0", debug level = none <===
     opt_disc. Directory "/tmp/funky" is used.
     use fall-back at restart = false
    -running db nodes = [nonode@nohost]
    -stopped db nodes = []
    -remote           = []
    -ram_copies       = [funky]
    -disc_copies      = [schema]
    -disc_only_copies = []
    -[{nonode@nohost,disc_copies}] = [schema]
    -[{nonode@nohost,ram_copies}] = [funky]
    +running db nodes = [nonode@nohost]
    +stopped db nodes = []
    +remote           = []
    +ram_copies       = [funky]
    +disc_copies      = [schema]
    +disc_only_copies = []
    +[{nonode@nohost,disc_copies}] = [schema]
    +[{nonode@nohost,ram_copies}] = [funky]
     1 transactions committed, 0 aborted, 0 restarted, 1 logged to disc
     0 held locks, 0 in queue; 0 local transactions, 0 remote
    -0 transactions waits for other nodes: []
    +0 transactions waits for other nodes: []
     ok

    In this example, the following actions are performed:

    • Step 1: The Erlang system is started from the UNIX prompt with a flag -mnesia dir '"/tmp/funky"', which indicates in which directory to store the data.
    • Step 2: A new empty schema is initialized on the local node by evaluating @@ -124,28 +124,28 @@ Defining Structure and Content

      First the record definitions are entered into a text file named company.hrl. -This file defines the following structure for the example database:

      -record(employee, {emp_no,
      +This file defines the following structure for the example database:

      -record(employee, {emp_no,
                          name,
                          salary,
                          sex,
                          phone,
      -                   room_no}).
      +                   room_no}).
       
      --record(dept, {id,
      -               name}).
      +-record(dept, {id,
      +               name}).
       
      --record(project, {name,
      -                  number}).
      +-record(project, {name,
      +                  number}).
       
       
      --record(manager, {emp,
      -                  dept}).
      +-record(manager, {emp,
      +                  dept}).
       
      --record(at_dep, {emp,
      -                 dept_id}).
      +-record(at_dep, {emp,
      +                 dept_id}).
       
      --record(in_proj, {emp,
      -                  proj_name}).

      The structure defines six tables in the database. In Mnesia, the function +-record(in_proj, {emp, + proj_name}).

      The structure defines six tables in the database. In Mnesia, the function mnesia:create_table(Name, ArgList) creates tables. Name is the table name.

      Note

      The current version of Mnesia does not require that the name of the table is the same as the record name, see @@ -162,28 +162,28 @@

      The following shell interaction starts Mnesia and initializes the schema for the Company database:

      % erl -mnesia dir '"/ldisc/scratch/Mnesia.Company"'
      -Erlang (BEAM) emulator version 4.9
      +Erlang (BEAM) emulator version 4.9
       
      -Eshell V4.9  (abort with ^G)
      -1> mnesia:create_schema([node()]).
      +Eshell V4.9  (abort with ^G)
      +1> mnesia:create_schema([node()]).
       ok
      -2> mnesia:start().
      -ok

      The following program module creates and populates previously defined tables:

      -include_lib("stdlib/include/qlc.hrl").
      --include("company.hrl").
      -
      -init() ->
      -    mnesia:create_table(employee,
      -                        [{attributes, record_info(fields, employee)}]),
      -    mnesia:create_table(dept,
      -                        [{attributes, record_info(fields, dept)}]),
      -    mnesia:create_table(project,
      -                        [{attributes, record_info(fields, project)}]),
      -    mnesia:create_table(manager, [{type, bag},
      -                                  {attributes, record_info(fields, manager)}]),
      -    mnesia:create_table(at_dep,
      -                         [{attributes, record_info(fields, at_dep)}]),
      -    mnesia:create_table(in_proj, [{type, bag},
      -                                  {attributes, record_info(fields, in_proj)}]).

      +2> mnesia:start(). +ok

    The following program module creates and populates previously defined tables:

    -include_lib("stdlib/include/qlc.hrl").
    +-include("company.hrl").
    +
    +init() ->
    +    mnesia:create_table(employee,
    +                        [{attributes, record_info(fields, employee)}]),
    +    mnesia:create_table(dept,
    +                        [{attributes, record_info(fields, dept)}]),
    +    mnesia:create_table(project,
    +                        [{attributes, record_info(fields, project)}]),
    +    mnesia:create_table(manager, [{type, bag},
    +                                  {attributes, record_info(fields, manager)}]),
    +    mnesia:create_table(at_dep,
    +                         [{attributes, record_info(fields, at_dep)}]),
    +    mnesia:create_table(in_proj, [{type, bag},
    +                                  {attributes, record_info(fields, in_proj)}]).

    @@ -197,13 +197,13 @@ the format mnesia:create_schema(DiscNodeList) and initiates a new schema. In this example, a non-distributed system using only one node is created. Schemas are fully explained in Define a Schema.
  • mnesia:start(). This function starts Mnesia and is fully -explained in Start Mnesia.
  • Continuing the dialogue with the Erlang shell produces the following:

    3> company:init().
    -{atomic,ok}
    -4> mnesia:info().
    +explained in Start Mnesia.

    Continuing the dialogue with the Erlang shell produces the following:

    3> company:init().
    +{atomic,ok}
    +4> mnesia:info().
     ---> Processes holding locks <---
     ---> Processes waiting for locks <---
    ----> Pending (remote) transactions <---
    ----> Active (local) transactions <---
    +---> Pending (remote) transactions <---
    +---> Active (local) transactions <---
     ---> Uncertain transactions <---
     ---> Active tables <---
     in_proj        : with 0 records occuping 269 words of mem
    @@ -216,19 +216,19 @@
     ===> System info in version "1.0", debug level = none <===
     opt_disc. Directory "/ldisc/scratch/Mnesia.Company" is used.
     use fall-back at restart = false
    -running db nodes = [nonode@nohost]
    -stopped db nodes = []
    -remote           = []
    +running db nodes = [nonode@nohost]
    +stopped db nodes = []
    +remote           = []
     ram_copies       =
    -    [at_dep,dept,employee,in_proj,manager,project]
    -disc_copies      = [schema]
    -disc_only_copies = []
    -[{nonode@nohost,disc_copies}] = [schema]
    -[{nonode@nohost,ram_copies}] =
    -    [employee,dept,project,manager,at_dep,in_proj]
    +    [at_dep,dept,employee,in_proj,manager,project]
    +disc_copies      = [schema]
    +disc_only_copies = []
    +[{nonode@nohost,disc_copies}] = [schema]
    +[{nonode@nohost,ram_copies}] =
    +    [employee,dept,project,manager,at_dep,in_proj]
     6 transactions committed, 0 aborted, 0 restarted, 6 logged to disc
     0 held locks, 0 in queue; 0 local transactions, 0 remote
    -0 transactions waits for other nodes: []
    +0 transactions waits for other nodes: []
     ok

    A set of tables is created. The function mnesia:create_table(Name, ArgList) creates the required database tables. The options available with ArgList are explained in @@ -242,32 +242,32 @@ /usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.epub/OEBPS/mnesia_chap3.xhtml differs (HTML document, ASCII text, with very long lines (1223)) --- old//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.epub/OEBPS/mnesia_chap3.xhtml 2026-06-04 00:08:23.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.epub/OEBPS/mnesia_chap3.xhtml 2042-07-06 13:27:49.000000000 +0000 @@ -70,18 +70,18 @@ changes the format on all records in table Tab. It applies argument Fun to all records in the table. Fun must be a function that takes a record of the old type, and returns the record of the new type. The table key must not be -changed.

    Example:

    -record(old, {key, val}).
    --record(new, {key, val, extra}).
    +changed.

    Example:

    -record(old, {key, val}).
    +-record(new, {key, val, extra}).
     
     Transformer =
    -   fun(X) when record(X, old) ->
    -      #new{key = X#old.key,
    +   fun(X) when record(X, old) ->
    +      #new{key = X#old.key,
                val = X#old.val,
    -           extra = 42}
    +           extra = 42}
        end,
    -{atomic, ok} = mnesia:transform_table(foo, Transformer,
    -                                      record_info(fields, new),
    -                                      new),

    Argument Fun can also be the atom ignore, which indicates that only the +{atomic, ok} = mnesia:transform_table(foo, Transformer, + record_info(fields, new), + new),

    Argument Fun can also be the atom ignore, which indicates that only the metadata about the table is updated. Use of ignore is not recommended (as it creates inconsistencies between the metadata and the actual data) but it is included as a possibility for the user do to an own (offline) transform.

  • mnesia:change_table_copy_type(Tab, Node, ToType) @@ -133,29 +133,29 @@ when starting the Erlang shell or in the application script. Previously, the following example was used to create the directory for the Company database:

    % erl -mnesia dir '"/ldisc/scratch/Mnesia.Company"'
  • If no command-line flag is entered, the Mnesia directory becomes the current working directory on the node where the Erlang shell is started.

  • To start the Company database and get it running on the two specified nodes, -enter the following commands:

    1. On the node a@gin:
     gin % erl -sname a  -mnesia dir '"/ldisc/scratch/Mnesia.company"'
    1. On the node b@skeppet:
    skeppet % erl -sname b -mnesia dir '"/ldisc/scratch/Mnesia.company"'
    1. On one of the two nodes:
    (a@gin)1> mnesia:create_schema([a@gin, b@skeppet]).
    1. The function mnesia:start() is called on both nodes.
    2. To initialize the database, execute the following code on one of the two -nodes:
    dist_init() ->
    -    mnesia:create_table(employee,
    -                         [{ram_copies, [a@gin, b@skeppet]},
    -                          {attributes, record_info(fields,
    -						   employee)}]),
    -    mnesia:create_table(dept,
    -                         [{ram_copies, [a@gin, b@skeppet]},
    -                          {attributes, record_info(fields, dept)}]),
    -    mnesia:create_table(project,
    -                         [{ram_copies, [a@gin, b@skeppet]},
    -                          {attributes, record_info(fields, project)}]),
    -    mnesia:create_table(manager, [{type, bag},
    -                                  {ram_copies, [a@gin, b@skeppet]},
    -                                  {attributes, record_info(fields,
    -							   manager)}]),
    -    mnesia:create_table(at_dep,
    -                         [{ram_copies, [a@gin, b@skeppet]},
    -                          {attributes, record_info(fields, at_dep)}]),
    -    mnesia:create_table(in_proj,
    -                        [{type, bag},
    -                         {ram_copies, [a@gin, b@skeppet]},
    -                         {attributes, record_info(fields, in_proj)}]).

    As illustrated, the two directories reside on different nodes, because +enter the following commands:

    1. On the node a@gin:
     gin % erl -sname a  -mnesia dir '"/ldisc/scratch/Mnesia.company"'
    1. On the node b@skeppet:
    skeppet % erl -sname b -mnesia dir '"/ldisc/scratch/Mnesia.company"'
    1. On one of the two nodes:
    (a@gin)1> mnesia:create_schema([a@gin, b@skeppet]).
    1. The function mnesia:start() is called on both nodes.
    2. To initialize the database, execute the following code on one of the two +nodes:
    dist_init() ->
    +    mnesia:create_table(employee,
    +                         [{ram_copies, [a@gin, b@skeppet]},
    +                          {attributes, record_info(fields,
    +						   employee)}]),
    +    mnesia:create_table(dept,
    +                         [{ram_copies, [a@gin, b@skeppet]},
    +                          {attributes, record_info(fields, dept)}]),
    +    mnesia:create_table(project,
    +                         [{ram_copies, [a@gin, b@skeppet]},
    +                          {attributes, record_info(fields, project)}]),
    +    mnesia:create_table(manager, [{type, bag},
    +                                  {ram_copies, [a@gin, b@skeppet]},
    +                                  {attributes, record_info(fields,
    +							   manager)}]),
    +    mnesia:create_table(at_dep,
    +                         [{ram_copies, [a@gin, b@skeppet]},
    +                          {attributes, record_info(fields, at_dep)}]),
    +    mnesia:create_table(in_proj,
    +                        [{type, bag},
    +                         {ram_copies, [a@gin, b@skeppet]},
    +                         {attributes, record_info(fields, in_proj)}]).

    As illustrated, the two directories reside on different nodes, because /ldisc/scratch (the "local" disc) exists on the two different nodes.

    By executing these commands, two Erlang nodes are configured to run the Company database, and therefore, initialize the database. This is required only once when setting up. The next time the system is started, @@ -172,7 +172,7 @@ Startup Procedure

    -

    Start Mnesia by calling the following function:

    mnesia:start().

    This function initiates the DBMS locally.

    The choice of configuration alters the location and load order of the tables. +

    Start Mnesia by calling the following function:

    mnesia:start().

    This function initiates the DBMS locally.

    The choice of configuration alters the location and load order of the tables. The alternatives are as follows:

    1. Tables that are only stored locally are initialized from the local Mnesia directory.
    2. Replicated tables that reside locally as well as somewhere else are either initiated from disc or by copying the entire table from the other node, @@ -195,9 +195,9 @@ from disc at a faster rate. The function forces tables to be loaded from disc regardless of the network situation.

      Thus, it can be assumed that if an application wants to use tables a and b, the application must perform some action similar to following before it can use -the tables:

      case mnesia:wait_for_tables([a, b], 20000) of
      -  {timeout, RemainingTabs} ->
      -    panic(RemainingTabs);
      +the tables:

      case mnesia:wait_for_tables([a, b], 20000) of
      +  {timeout, RemainingTabs} ->
      +    panic(RemainingTabs);
         ok ->
           synced
       end.

      Warning

      When tables are forcefully loaded from the local disc, all operations that @@ -223,13 +223,13 @@ key, whereas a table of type bag can have an arbitrary number of records per key. The key for each record is always the first attribute of the record.

      The following example illustrates the difference between type set and -bag:

       f() ->
      -    F = fun() ->
      -          mnesia:write({foo, 1, 2}),
      -          mnesia:write({foo, 1, 3}),
      -          mnesia:read({foo, 1})
      +bag:

       f() ->
      +    F = fun() ->
      +          mnesia:write({foo, 1, 2}),
      +          mnesia:write({foo, 1, 3}),
      +          mnesia:read({foo, 1})
               end,
      -    mnesia:transaction(F).

      This transaction returns the list [{foo,1,3}] if table foo is of type + mnesia:transaction(F).

      This transaction returns the list [{foo,1,3}] if table foo is of type set. However, the list [{foo,1,2}, {foo,1,3}] is returned if the table is of type bag.

      Mnesia tables can never contain duplicates of the same record in the same table. Duplicate records have attributes with the same contents and key.

    3. {disc_copies, NodeList}, where NodeList is a list of the nodes where @@ -273,11 +273,11 @@ table. All records stored in the table must have this name as their first element. record_name defaults to the name of the table. For more information, see -Record Names versus Table Names.

    4. As an example, consider the following record definition:

      -record(funky, {x, y}).

      The following call would create a table that is replicated on two nodes, has an -extra index on attribute y, and is of type bag.

      mnesia:create_table(funky, [{disc_copies, [N1, N2]}, {index, [y]},
      -                            {type, bag}, {attributes, record_info(fields, funky)}]).

      Whereas a call to the following default code values would return a table with a +Record Names versus Table Names.

      As an example, consider the following record definition:

      -record(funky, {x, y}).

      The following call would create a table that is replicated on two nodes, has an +extra index on attribute y, and is of type bag.

      mnesia:create_table(funky, [{disc_copies, [N1, N2]}, {index, [y]},
      +                            {type, bag}, {attributes, record_info(fields, funky)}]).

      Whereas a call to the following default code values would return a table with a RAM copy on the local node, no extra indexes, and the attributes defaulted to -the list [key,val].

      mnesia:create_table(stuff, [])
      +the list [key,val].

      mnesia:create_table(stuff, [])
      /usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.epub/OEBPS/mnesia_chap4.xhtml differs (HTML document, ASCII text, with very long lines (1903)) --- old//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.epub/OEBPS/mnesia_chap4.xhtml 2026-06-04 00:08:23.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.epub/OEBPS/mnesia_chap4.xhtml 2042-07-06 13:27:49.000000000 +0000 @@ -40,14 +40,14 @@ and delete Mnesia records. The Fun is evaluated as a transaction that either commits or terminates. If a transaction succeeds in executing the Fun, it replicates the action on all nodes involved, or terminates if an error occurs.

      The following example shows a transaction that raises the salary of certain -employee numbers:

      raise(Eno, Raise) ->
      -    F = fun() ->
      -                [E] = mnesia:read(employee, Eno, write),
      +employee numbers:

      raise(Eno, Raise) ->
      +    F = fun() ->
      +                [E] = mnesia:read(employee, Eno, write),
                       Salary = E#employee.salary + Raise,
      -                New = E#employee{salary = Salary},
      -                mnesia:write(New)
      +                New = E#employee{salary = Salary},
      +                mnesia:write(New)
               end,
      -    mnesia:transaction(F).

      The function raise/2 contains a Fun made up of four code lines. This Fun is + mnesia:transaction(F).

      The function raise/2 contains a Fun made up of four code lines. This Fun is called by the statement mnesia:transaction(F) and returns a value.

      The Mnesia transaction system facilitates the construction of reliable, distributed systems by providing the following important properties:

      • The transaction handler ensures that a Fun, which is placed inside a transaction, does not interfere with operations embedded in other transactions @@ -141,15 +141,15 @@ The Fun in the transaction is evaluated once more.

        It is therefore important that the code inside the Fun given to mnesia:transaction/1 is pure. Some strange results can occur if, for example, messages are sent by the transaction Fun. The following example illustrates this -situation:

        bad_raise(Eno, Raise) ->
        -    F = fun() ->
        -                [E] = mnesia:read({employee, Eno}),
        +situation:

        bad_raise(Eno, Raise) ->
        +    F = fun() ->
        +                [E] = mnesia:read({employee, Eno}),
                         Salary = E#employee.salary + Raise,
        -                New = E#employee{salary = Salary},
        -                io:format("Trying to write ... ~n", []),
        -                mnesia:write(New)
        +                New = E#employee{salary = Salary},
        +                io:format("Trying to write ... ~n", []),
        +                mnesia:write(New)
                 end,
        -    mnesia:transaction(F).

        This transaction can write the text "Trying to write ... " 1000 times to the + mnesia:transaction(F).

        This transaction can write the text "Trying to write ... " 1000 times to the terminal. However, Mnesia guarantees that each transaction will eventually run. As a result, Mnesia is not only deadlock free, but also livelock free.

        The Mnesia programmer cannot prioritize one particular transaction to execute before other transactions that are waiting to execute. As a result, the Mnesia @@ -196,13 +196,13 @@ fails. Such applications can benefit from using sticky locks instead of the normal locking scheme.

        A sticky lock is a lock that stays in place at a node, after the transaction that first acquired the lock has terminated. To illustrate this, assume that the -following transaction is executed:

        F = fun() ->
        -      mnesia:write(#foo{a = kalle})
        +following transaction is executed:

        F = fun() ->
        +      mnesia:write(#foo{a = kalle})
             end,
        -mnesia:transaction(F).

        The foo table is replicated on the two nodes N1 and N2.

        Normal locking requires the following:

        • One network RPC (two messages) to acquire the write lock
        • Three network messages to execute the two-phase commit protocol

        If sticky locks are used, the code must first be changed as follows:

        F = fun() ->
        -      mnesia:s_write(#foo{a = kalle})
        +mnesia:transaction(F).

        The foo table is replicated on the two nodes N1 and N2.

        Normal locking requires the following:

        • One network RPC (two messages) to acquire the write lock
        • Three network messages to execute the two-phase commit protocol

        If sticky locks are used, the code must first be changed as follows:

        F = fun() ->
        +      mnesia:s_write(#foo{a = kalle})
             end,
        -mnesia:transaction(F).

        This code uses the function s_write/1 instead of the +mnesia:transaction(F).

        This code uses the function s_write/1 instead of the function write/1 The function s_write/1 sets a sticky lock instead of a normal lock. If the table is not replicated, sticky locks have no special effect. If the table is replicated, and a sticky lock is set on node @@ -228,8 +228,8 @@ following two functions are used to set explicit table locks for read and write operations:

        Alternative syntax for acquisition of table locks is as follows:

        mnesia:lock({table, Tab}, read)
        -mnesia:lock({table, Tab}, write)

        The matching operations in Mnesia can either lock the entire table or only a +on table Tab.

      Alternative syntax for acquisition of table locks is as follows:

      mnesia:lock({table, Tab}, read)
      +mnesia:lock({table, Tab}, write)

      The matching operations in Mnesia can either lock the entire table or only a single record (when the key is bound in the pattern).

      @@ -320,78 +320,78 @@ necessarily have to be the same as the table name, although this is the case in most of the examples in this User's Guide. If a table is created without property record_name, the following code ensures that all records in the -tables have the same name as the table:

      mnesia:create_table(subscriber, [])

      However, if the table is created with an explicit record name as argument, as +tables have the same name as the table:

      mnesia:create_table(subscriber, [])

      However, if the table is created with an explicit record name as argument, as shown in the following example, subscriber records can be stored in both of the -tables regardless of the table names:

      TabDef = [{record_name, subscriber}],
      -mnesia:create_table(my_subscriber, TabDef),
      -mnesia:create_table(your_subscriber, TabDef).

      To access such tables, simplified access functions (as described earlier) cannot +tables regardless of the table names:

      TabDef = [{record_name, subscriber}],
      +mnesia:create_table(my_subscriber, TabDef),
      +mnesia:create_table(your_subscriber, TabDef).

      To access such tables, simplified access functions (as described earlier) cannot be used. For example, writing a subscriber record into a table requires the function mnesia:write/3 instead of the simplified functions mnesia:write/1 -and mnesia:s_write/1:

      mnesia:write(subscriber, #subscriber{}, write)
      -mnesia:write(my_subscriber, #subscriber{}, sticky_write)
      -mnesia:write(your_subscriber, #subscriber{}, write)

      The following simple code illustrates the relationship between the simplified +and mnesia:s_write/1:

      mnesia:write(subscriber, #subscriber{}, write)
      +mnesia:write(my_subscriber, #subscriber{}, sticky_write)
      +mnesia:write(your_subscriber, #subscriber{}, write)

      The following simple code illustrates the relationship between the simplified access functions used in most of the examples and their more flexible -counterparts:

      mnesia:dirty_write(Record) ->
      -  Tab = element(1, Record),
      -  mnesia:dirty_write(Tab, Record).
      +counterparts:

      mnesia:dirty_write(Record) ->
      +  Tab = element(1, Record),
      +  mnesia:dirty_write(Tab, Record).
       
      -mnesia:dirty_delete({Tab, Key}) ->
      -  mnesia:dirty_delete(Tab, Key).
      +mnesia:dirty_delete({Tab, Key}) ->
      +  mnesia:dirty_delete(Tab, Key).
       
      -mnesia:dirty_delete_object(Record) ->
      -  Tab = element(1, Record),
      -  mnesia:dirty_delete_object(Tab, Record)
      +mnesia:dirty_delete_object(Record) ->
      +  Tab = element(1, Record),
      +  mnesia:dirty_delete_object(Tab, Record)
       
      -mnesia:dirty_update_counter({Tab, Key}, Incr) ->
      -  mnesia:dirty_update_counter(Tab, Key, Incr).
      +mnesia:dirty_update_counter({Tab, Key}, Incr) ->
      +  mnesia:dirty_update_counter(Tab, Key, Incr).
       
      -mnesia:dirty_read({Tab, Key}) ->
      -  Tab = element(1, Record),
      -  mnesia:dirty_read(Tab, Key).
      +mnesia:dirty_read({Tab, Key}) ->
      +  Tab = element(1, Record),
      +  mnesia:dirty_read(Tab, Key).
       
      -mnesia:dirty_match_object(Pattern) ->
      -  Tab = element(1, Pattern),
      -  mnesia:dirty_match_object(Tab, Pattern).
      +mnesia:dirty_match_object(Pattern) ->
      +  Tab = element(1, Pattern),
      +  mnesia:dirty_match_object(Tab, Pattern).
       
      -mnesia:dirty_index_match_object(Pattern, Attr)
      -  Tab = element(1, Pattern),
      -  mnesia:dirty_index_match_object(Tab, Pattern, Attr).
      +mnesia:dirty_index_match_object(Pattern, Attr)
      +  Tab = element(1, Pattern),
      +  mnesia:dirty_index_match_object(Tab, Pattern, Attr).
       
      -mnesia:write(Record) ->
      -  Tab = element(1, Record),
      -  mnesia:write(Tab, Record, write).
      +mnesia:write(Record) ->
      +  Tab = element(1, Record),
      +  mnesia:write(Tab, Record, write).
       
      -mnesia:s_write(Record) ->
      -  Tab = element(1, Record),
      -  mnesia:write(Tab, Record, sticky_write).
      +mnesia:s_write(Record) ->
      +  Tab = element(1, Record),
      +  mnesia:write(Tab, Record, sticky_write).
       
      -mnesia:delete({Tab, Key}) ->
      -  mnesia:delete(Tab, Key, write).
      +mnesia:delete({Tab, Key}) ->
      +  mnesia:delete(Tab, Key, write).
       
      -mnesia:s_delete({Tab, Key}) ->
      -  mnesia:delete(Tab, Key, sticky_write).
      +mnesia:s_delete({Tab, Key}) ->
      +  mnesia:delete(Tab, Key, sticky_write).
       
      -mnesia:delete_object(Record) ->
      -  Tab = element(1, Record),
      -  mnesia:delete_object(Tab, Record, write).
      +mnesia:delete_object(Record) ->
      +  Tab = element(1, Record),
      +  mnesia:delete_object(Tab, Record, write).
       
      -mnesia:s_delete_object(Record) ->
      -  Tab = element(1, Record),
      -  mnesia:delete_object(Tab, Record, sticky_write).
      +mnesia:s_delete_object(Record) ->
      +  Tab = element(1, Record),
      +  mnesia:delete_object(Tab, Record, sticky_write).
       
      -mnesia:read({Tab, Key}) ->
      -  mnesia:read(Tab, Key, read).
      +mnesia:read({Tab, Key}) ->
      +  mnesia:read(Tab, Key, read).
       
      -mnesia:wread({Tab, Key}) ->
      -  mnesia:read(Tab, Key, write).
      +mnesia:wread({Tab, Key}) ->
      +  mnesia:read(Tab, Key, write).
       
      -mnesia:match_object(Pattern) ->
      -  Tab = element(1, Pattern),
      -  mnesia:match_object(Tab, Pattern, read).
      +mnesia:match_object(Pattern) ->
      +  Tab = element(1, Pattern),
      +  mnesia:match_object(Tab, Pattern, read).
       
      -mnesia:index_match_object(Pattern, Attr) ->
      -  Tab = element(1, Pattern),
      /usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.epub/OEBPS/mnesia_chap5.xhtml differs (HTML document, ASCII text, with very long lines (1275))
      --- old//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.epub/OEBPS/mnesia_chap5.xhtml	2026-06-04 00:08:23.000000000 +0000
      +++ new//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.epub/OEBPS/mnesia_chap5.xhtml	2042-07-06 13:27:49.000000000 +0000
      @@ -62,9 +62,9 @@
       whether the data resides on the local node or on a remote node.

      Notice that the program runs slower if the data is located on a remote node.

    5. The database can be reconfigured, and tables can be moved between nodes. These operations do not affect the user programs.

    6. It has previously been shown that each table has a number of system attributes, such as index and type.

      Table attributes are specified when the table is created. For example, the -following function creates a table with two RAM replicas:

      mnesia:create_table(foo,
      -                    [{ram_copies, [N1, N2]},
      -                     {attributes, record_info(fields, foo)}]).

      Tables can also have the following properties, where each attribute has a list +following function creates a table with two RAM replicas:

      mnesia:create_table(foo,
      +                    [{ram_copies, [N1, N2]},
      +                     {attributes, record_info(fields, foo)}]).

      Tables can also have the following properties, where each attribute has a list of Erlang nodes as its value:

      • ram_copies. The value of the node list is a list of Erlang nodes, and a RAM replica of the table resides on each node in the list.

        Notice that no disc operations are performed when a program executes write operations to these replicas. However, if permanent RAM replicas are required, @@ -117,52 +117,52 @@ searched for matching records.

        Notice that in ordered_set tables, the records are ordered per fragment, and the order is undefined in results returned by select and match_object, as well as first, next, prev and last.

        The following code illustrates how a Mnesia table is converted to be a -fragmented table and how more fragments are added later:

        Eshell V4.7.3.3  (abort with ^G)
        -(a@sam)1> mnesia:start().
        +fragmented table and how more fragments are added later:

        Eshell V4.7.3.3  (abort with ^G)
        +(a@sam)1> mnesia:start().
         ok
        -(a@sam)2> mnesia:system_info(running_db_nodes).
        -[b@sam,c@sam,a@sam]
        +(a@sam)2> mnesia:system_info(running_db_nodes).
        +[b@sam,c@sam,a@sam]
         (a@sam)3> Tab = dictionary.
         dictionary
        -(a@sam)4> mnesia:create_table(Tab, [{ram_copies, [a@sam, b@sam]}]).
        -{atomic,ok}
        -(a@sam)5> Write = fun(Keys) -> [mnesia:write({Tab,K,-K}) || K <- Keys], ok end.
        +(a@sam)4> mnesia:create_table(Tab, [{ram_copies, [a@sam, b@sam]}]).
        +{atomic,ok}
        +(a@sam)5> Write = fun(Keys) -> [mnesia:write({Tab,K,-K}) || K <- Keys], ok end.
         #Fun<erl_eval>
        -(a@sam)6> mnesia:activity(sync_dirty, Write, [lists:seq(1, 256)], mnesia_frag).
        +(a@sam)6> mnesia:activity(sync_dirty, Write, [lists:seq(1, 256)], mnesia_frag).
         ok
        -(a@sam)7> mnesia:change_table_frag(Tab, {activate, []}).
        -{atomic,ok}
        -(a@sam)8> mnesia:table_info(Tab, frag_properties).
        -[{base_table,dictionary},
        - {foreign_key,undefined},
        - {n_doubles,0},
        - {n_fragments,1},
        - {next_n_to_split,1},
        - {node_pool,[a@sam,b@sam,c@sam]}]
        -(a@sam)9> Info = fun(Item) -> mnesia:table_info(Tab, Item) end.
        +(a@sam)7> mnesia:change_table_frag(Tab, {activate, []}).
        +{atomic,ok}
        +(a@sam)8> mnesia:table_info(Tab, frag_properties).
        +[{base_table,dictionary},
        + {foreign_key,undefined},
        + {n_doubles,0},
        + {n_fragments,1},
        + {next_n_to_split,1},
        + {node_pool,[a@sam,b@sam,c@sam]}]
        +(a@sam)9> Info = fun(Item) -> mnesia:table_info(Tab, Item) end.
         #Fun<erl_eval>
        -(a@sam)10> Dist = mnesia:activity(sync_dirty, Info, [frag_dist], mnesia_frag).
        -[{c@sam,0},{a@sam,1},{b@sam,1}]
        -(a@sam)11> mnesia:change_table_frag(Tab, {add_frag, Dist}).
        -{atomic,ok}
        -(a@sam)12> Dist2 = mnesia:activity(sync_dirty, Info, [frag_dist], mnesia_frag).
        -[{b@sam,1},{c@sam,1},{a@sam,2}]
        -(a@sam)13> mnesia:change_table_frag(Tab, {add_frag, Dist2}).
        -{atomic,ok}
        -(a@sam)14> Dist3 = mnesia:activity(sync_dirty, Info, [frag_dist], mnesia_frag).
        -[{a@sam,2},{b@sam,2},{c@sam,2}]
        -(a@sam)15> mnesia:change_table_frag(Tab, {add_frag, Dist3}).
        -{atomic,ok}
        -(a@sam)16> Read = fun(Key) -> mnesia:read({Tab, Key}) end.
        +(a@sam)10> Dist = mnesia:activity(sync_dirty, Info, [frag_dist], mnesia_frag).
        +[{c@sam,0},{a@sam,1},{b@sam,1}]
        +(a@sam)11> mnesia:change_table_frag(Tab, {add_frag, Dist}).
        +{atomic,ok}
        +(a@sam)12> Dist2 = mnesia:activity(sync_dirty, Info, [frag_dist], mnesia_frag).
        +[{b@sam,1},{c@sam,1},{a@sam,2}]
        +(a@sam)13> mnesia:change_table_frag(Tab, {add_frag, Dist2}).
        +{atomic,ok}
        +(a@sam)14> Dist3 = mnesia:activity(sync_dirty, Info, [frag_dist], mnesia_frag).
        +[{a@sam,2},{b@sam,2},{c@sam,2}]
        +(a@sam)15> mnesia:change_table_frag(Tab, {add_frag, Dist3}).
        +{atomic,ok}
        +(a@sam)16> Read = fun(Key) -> mnesia:read({Tab, Key}) end.
         #Fun<erl_eval>
        -(a@sam)17> mnesia:activity(transaction, Read, [12], mnesia_frag).
        -[{dictionary,12,-12}]
        -(a@sam)18> mnesia:activity(sync_dirty, Info, [frag_size], mnesia_frag).
        -[{dictionary,64},
        - {dictionary_frag2,64},
        - {dictionary_frag3,64},
        - {dictionary_frag4,64}]
        -(a@sam)19>

        +(a@sam)17> mnesia:activity(transaction, Read, [12], mnesia_frag). +[{dictionary,12,-12}] +(a@sam)18> mnesia:activity(sync_dirty, Info, [frag_size], mnesia_frag). +[{dictionary,64}, + {dictionary_frag2,64}, + {dictionary_frag3,64}, + {dictionary_frag4,64}] +(a@sam)19>

        @@ -204,64 +204,64 @@ This property can explicitly be set at table creation. Default is mnesia_frag_hash.

      • {hash_state, Term} - Enables a table-specific parameterization of a generic hash module. This property can explicitly be set at table creation. -Default is undefined.

        Eshell V4.7.3.3  (abort with ^G)
        -(a@sam)1> mnesia:start().
        +Default is undefined.

        Eshell V4.7.3.3  (abort with ^G)
        +(a@sam)1> mnesia:start().
         ok
        -(a@sam)2> PrimProps = [{n_fragments, 7}, {node_pool, [node()]}].
        -[{n_fragments,7},{node_pool,[a@sam]}]
        -(a@sam)3> mnesia:create_table(prim_dict,
        -                              [{frag_properties, PrimProps},
        -                               {attributes,[prim_key,prim_val]}]).
        -{atomic,ok}
        -(a@sam)4> SecProps = [{foreign_key, {prim_dict, sec_val}}].
        -[{foreign_key,{prim_dict,sec_val}}]
        -(a@sam)5> mnesia:create_table(sec_dict,
        -                              [{frag_properties, SecProps},
        -(a@sam)5>                      {attributes, [sec_key, sec_val]}]).
        -{atomic,ok}
        -(a@sam)6> Write = fun(Rec) -> mnesia:write(Rec) end.
        +(a@sam)2> PrimProps = [{n_fragments, 7}, {node_pool, [node()]}].
        +[{n_fragments,7},{node_pool,[a@sam]}]
        +(a@sam)3> mnesia:create_table(prim_dict,
        +                              [{frag_properties, PrimProps},
        +                               {attributes,[prim_key,prim_val]}]).
        +{atomic,ok}
        +(a@sam)4> SecProps = [{foreign_key, {prim_dict, sec_val}}].
        +[{foreign_key,{prim_dict,sec_val}}]
        +(a@sam)5> mnesia:create_table(sec_dict,
        +                              [{frag_properties, SecProps},
        +(a@sam)5>                      {attributes, [sec_key, sec_val]}]).
        +{atomic,ok}
        +(a@sam)6> Write = fun(Rec) -> mnesia:write(Rec) end.
         #Fun<erl_eval>
         (a@sam)7> PrimKey = 11.
         11
         (a@sam)8> SecKey = 42.
         42
        -(a@sam)9> mnesia:activity(sync_dirty, Write,
        -                          [{prim_dict, PrimKey, -11}], mnesia_frag).
        +(a@sam)9> mnesia:activity(sync_dirty, Write,
        +                          [{prim_dict, PrimKey, -11}], mnesia_frag).
         ok
        -(a@sam)10> mnesia:activity(sync_dirty, Write,
        -                           [{sec_dict, SecKey, PrimKey}], mnesia_frag).
        +(a@sam)10> mnesia:activity(sync_dirty, Write,
        +                           [{sec_dict, SecKey, PrimKey}], mnesia_frag).
         ok
        -(a@sam)11> mnesia:change_table_frag(prim_dict, {add_frag, [node()]}).
        -{atomic,ok}
        -(a@sam)12> SecRead = fun(PrimKey, SecKey) ->
        -               mnesia:read({sec_dict, PrimKey}, SecKey, read) end.
        +(a@sam)11> mnesia:change_table_frag(prim_dict, {add_frag, [node()]}).
        +{atomic,ok}
        +(a@sam)12> SecRead = fun(PrimKey, SecKey) ->
        +               mnesia:read({sec_dict, PrimKey}, SecKey, read) end.
         #Fun<erl_eval>
        -(a@sam)13> mnesia:activity(transaction, SecRead,
        -                           [PrimKey, SecKey], mnesia_frag).
        -[{sec_dict,42,11}]
        -(a@sam)14> Info = fun(Tab, Item) -> mnesia:table_info(Tab, Item) end.
        +(a@sam)13> mnesia:activity(transaction, SecRead,
        +                           [PrimKey, SecKey], mnesia_frag).
        +[{sec_dict,42,11}]
        +(a@sam)14> Info = fun(Tab, Item) -> mnesia:table_info(Tab, Item) end.
         #Fun<erl_eval>
        -(a@sam)15> mnesia:activity(sync_dirty, Info,
        -                           [prim_dict, frag_size], mnesia_frag).
        -[{prim_dict,0},
        - {prim_dict_frag2,0},
        - {prim_dict_frag3,0},
        - {prim_dict_frag4,1},
        - {prim_dict_frag5,0},
        - {prim_dict_frag6,0},
        - {prim_dict_frag7,0},
        - {prim_dict_frag8,0}]
        -(a@sam)16> mnesia:activity(sync_dirty, Info,
        -                           [sec_dict, frag_size], mnesia_frag).
        -[{sec_dict,0},
        - {sec_dict_frag2,0},
        - {sec_dict_frag3,0},
        - {sec_dict_frag4,1},
        - {sec_dict_frag5,0},
        - {sec_dict_frag6,0},
        - {sec_dict_frag7,0},
        - {sec_dict_frag8,0}]
        -(a@sam)17>

      +(a@sam)15> mnesia:activity(sync_dirty, Info, + [prim_dict, frag_size], mnesia_frag). +[{prim_dict,0}, + {prim_dict_frag2,0}, /usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.epub/OEBPS/mnesia_chap7.xhtml differs (HTML document, ASCII text, with very long lines (1110)) --- old//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.epub/OEBPS/mnesia_chap7.xhtml 2026-06-04 00:08:23.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.epub/OEBPS/mnesia_chap7.xhtml 2042-07-06 13:27:49.000000000 +0000 @@ -128,26 +128,26 @@ for starting Mnesia:

      • An Erlang session must be started and a Mnesia directory must be specified for the database.
      • A database schema must be initiated, using the function mnesia:create_schema/1.

      The following example shows how these tasks are performed:

      Step 1: Start an Erlang session and specify a Mnesia directory for the -database:

      % erl -sname klacke -mnesia dir '"/ldisc/scratch/klacke"'
      Erlang (BEAM) emulator version 4.9
      +database:

      % erl -sname klacke -mnesia dir '"/ldisc/scratch/klacke"'
      Erlang (BEAM) emulator version 4.9
       
      -Eshell V4.9  (abort with ^G)
      -(klacke@gin)1> mnesia:create_schema([node()]).
      +Eshell V4.9  (abort with ^G)
      +(klacke@gin)1> mnesia:create_schema([node()]).
       ok
      -(klacke@gin)2>
      +(klacke@gin)2>
       ^Z
       Suspended

      Step 2: You can inspect the Mnesia directory to see what files have been created:

      % ls -l /ldisc/scratch/klacke
       -rw-rw-r--   1 klacke   staff       247 Aug 12 15:06 FALLBACK.BUP

      The response shows that the file FALLBACK.BUP has been created. This is called a backup file, and it contains an initial schema. If more than one node in the function mnesia:create_schema/1 had been specified, identical backup files -would have been created on all nodes.

      Step 3: Start Mnesia:

      (klacke@gin)3>mnesia:start( ).
      +would have been created on all nodes.

      Step 3: Start Mnesia:

      (klacke@gin)3>mnesia:start( ).
       ok

      Step 4: You can see the following listing in the Mnesia directory:

      -rw-rw-r--   1 klacke   staff         86 May 26 19:03 LATEST.LOG
       -rw-rw-r--   1 klacke   staff      34507 May 26 19:03 schema.DAT

      The schema in the backup file FALLBACK.BUP has been used to generate the file schema.DAT. Since there are no other disc resident tables than the schema, no other data files were created. The file FALLBACK.BUP was removed after the successful "restoration". You also see some files that are for internal use by -Mnesia.

      Step 5: Create a table:

      (klacke@gin)4> mnesia:create_table(foo,[{disc_copies, [node()]}]).
      -{atomic,ok}

      Step 6: You can see the following listing in the Mnesia directory:

      % ls -l /ldisc/scratch/klacke
      +Mnesia.

      Step 5: Create a table:

      (klacke@gin)4> mnesia:create_table(foo,[{disc_copies, [node()]}]).
      +{atomic,ok}

      Step 6: You can see the following listing in the Mnesia directory:

      % ls -l /ldisc/scratch/klacke
       -rw-rw-r-- 1 klacke staff    86 May 26 19:07 LATEST.LOG
       -rw-rw-r-- 1 klacke staff    94 May 26 19:07 foo.DCD
       -rw-rw-r-- 1 klacke staff  6679 May 26 19:07 schema.DAT

      The file foo.DCD has been created. This file will eventually store all data @@ -191,11 +191,11 @@ the Mnesia data files. For example, dets contains the function dets:traverse/2, which can be used to view the contents of a Mnesia DAT file. However, this can only be done when Mnesia is not running. So, to view -the schema file, do as follows;

      {ok, N} = dets:open_file(schema, [{file, "./schema.DAT"},{repair,false},
      -{keypos, 2}]),
      -F = fun(X) -> io:format("~p~n", [X]), continue end,
      -dets:traverse(N, F),
      -dets:close(N).

      Warning

      The DAT files must always be opened with option {repair, false}. This +the schema file, do as follows;

      {ok, N} = dets:open_file(schema, [{file, "./schema.DAT"},{repair,false},
      +{keypos, 2}]),
      +F = fun(X) -> io:format("~p~n", [X]), continue end,
      +dets:traverse(N, F),
      +dets:close(N).

      Warning

      The DAT files must always be opened with option {repair, false}. This ensures that these files are not automatically repaired. Without this option, the database can become inconsistent, because Mnesia can believe that the files were properly closed. For information about configuration parameter @@ -429,40 +429,40 @@ located first in the backup.

      The schema itself is a table and is possibly included in the backup. Each node where the schema table resides is regarded as a db_node.

      The following example shows how mnesia:traverse_backup can be used to rename a -db_node in a backup file:

      change_node_name(Mod, From, To, Source, Target) ->
      +db_node in a backup file:

      change_node_name(Mod, From, To, Source, Target) ->
           Switch =
      -        fun(Node) when Node == From -> To;
      -           (Node) when Node == To -> throw({error, already_exists});
      -           (Node) -> Node
      +        fun(Node) when Node == From -> To;
      +           (Node) when Node == To -> throw({error, already_exists});
      +           (Node) -> Node
               end,
           Convert =
      -        fun({schema, db_nodes, Nodes}, Acc) ->
      -                {[{schema, db_nodes, lists:map(Switch,Nodes)}], Acc};
      -           ({schema, version, Version}, Acc) ->
      -                {[{schema, version, Version}], Acc};
      -           ({schema, cookie, Cookie}, Acc) ->
      -                {[{schema, cookie, Cookie}], Acc};
      -           ({schema, Tab, CreateList}, Acc) ->
      -                Keys = [ram_copies, disc_copies, disc_only_copies],
      +        fun({schema, db_nodes, Nodes}, Acc) ->
      +                {[{schema, db_nodes, lists:map(Switch,Nodes)}], Acc};
      +           ({schema, version, Version}, Acc) ->
      +                {[{schema, version, Version}], Acc};
      +           ({schema, cookie, Cookie}, Acc) ->
      +                {[{schema, cookie, Cookie}], Acc};
      +           ({schema, Tab, CreateList}, Acc) ->
      +                Keys = [ram_copies, disc_copies, disc_only_copies],
                       OptSwitch =
      -                    fun({Key, Val}) ->
      -                            case lists:member(Key, Keys) of
      -                                true -> {Key, lists:map(Switch, Val)};
      -                                false-> {Key, Val}
      +                    fun({Key, Val}) ->
      +                            case lists:member(Key, Keys) of
      +                                true -> {Key, lists:map(Switch, Val)};
      +                                false-> {Key, Val}
                                   end
                           end,
      -                {[{schema, Tab, lists:map(OptSwitch, CreateList)}], Acc};
      -           (Other, Acc) ->
      -                {[Other], Acc}
      +                {[{schema, Tab, lists:map(OptSwitch, CreateList)}], Acc};
      +           (Other, Acc) ->
      +                {[Other], Acc}
               end,
      -    mnesia:traverse_backup(Source, Mod, Target, Mod, Convert, switched).
      +    mnesia:traverse_backup(Source, Mod, Target, Mod, Convert, switched).
       
      -view(Source, Mod) ->
      -    View = fun(Item, Acc) ->
      -                   io:format("~p.~n",[Item]),
      -                   {[Item], Acc + 1}
      +view(Source, Mod) ->
      +    View = fun(Item, Acc) ->
      +                   io:format("~p.~n",[Item]),
      +                   {[Item], Acc + 1}
                  end,
      -    mnesia:traverse_backup(Source, Mod, dummy, read_only, View, 0).

      + mnesia:traverse_backup(Source, Mod, dummy, read_only, View, 0).

      /usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.epub/OEBPS/mnesia_registry.xhtml differs (HTML document, ASCII text, with very long lines (966)) --- old//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.epub/OEBPS/mnesia_registry.xhtml 2026-06-04 00:08:23.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.epub/OEBPS/mnesia_registry.xhtml 2042-07-06 13:27:49.000000000 +0000 @@ -142,8 +142,8 @@

      Warning

      This function is deprecated. Do not use it.

      A wrapper function for mnesia:create_table/2, which creates a table (if there is no existing table) with an appropriate set of attributes. The attributes and TabDef are forwarded to mnesia:create_table/2. For example, if the table -is to reside as disc_only_copies on all nodes, a call looks as follows:

                TabDef = [{{disc_only_copies, node()|nodes()]}],
      -          mnesia_registry:create_table(my_reg, TabDef)
      +is to reside as disc_only_copies on all nodes, a call looks as follows:

                TabDef = [{{disc_only_copies, node()|nodes()]}],
      +          mnesia_registry:create_table(my_reg, TabDef)
      /usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.epub/OEBPS/mnesia.xhtml differs (HTML document, ASCII text, with very long lines (531)) --- old//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.epub/OEBPS/mnesia.xhtml 2026-06-04 00:08:23.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.epub/OEBPS/mnesia.xhtml 2042-07-06 13:27:49.000000000 +0000 @@ -61,11 +61,11 @@ specifies the types of the SNMP keys.

    7. attributes. The names of the attributes for the records that are inserted in the table.

    8. For information about the complete set of table properties and their details, see mnesia:create_table/2.

      This Reference Manual uses a table of persons to illustrate various examples. -The following record definition is assumed:

      -record(person, {name,
      +The following record definition is assumed:

      -record(person, {name,
                        age = 0,
                        address = unknown,
                        salary = 0,
      -                 children = []}),

      The first record attribute is the primary key, or key for short.

      The function descriptions are sorted in alphabetical order. It is recommended to + children = []}),

      The first record attribute is the primary key, or key for short.

      The function descriptions are sorted in alphabetical order. It is recommended to start to read about mnesia:create_table/2, mnesia:lock/2, and mnesia:activity/4 before you continue and learn about the rest.

      Writing or deleting in transaction-context creates a local copy of each modified record during the transaction. During iteration, that is, mnesia:foldl/4, @@ -2744,7 +2744,7 @@ -

      Change the storage type of a table.

      For example:

      mnesia:change_table_copy_type(person, node(), disc_copies)

      Transforms the person table from a RAM table into a disc-based table at +

      Change the storage type of a table.

      For example:

      mnesia:change_table_copy_type(person, node(), disc_copies)

      Transforms the person table from a RAM table into a disc-based table at Node.

      This function can also be used to change the storage type of the table named schema. The schema table can only have ram_copies or disc_copies as the storage type. If the storage type of the schema is ram_copies, no other table @@ -2995,22 +2995,22 @@ back end storage. Backend can currently be ets or dets. Properties is a list of options sent to the back end storage during table creation. Properties cannot contain properties already used by Mnesia, such as type -or named_table.

      For example:

      mnesia:create_table(table, [{ram_copies, [node()]}, {disc_only_copies, nodes()},
      -       {storage_properties,
      -        [{ets, [compressed]}, {dets, [{auto_save, 5000}]} ]}])
    9. {type, Type}, where Type must be either of the atoms set, ordered_set, +or named_table.

      For example:

      mnesia:create_table(table, [{ram_copies, [node()]}, {disc_only_copies, nodes()},
      +       {storage_properties,
      +        [{ets, [compressed]}, {dets, [{auto_save, 5000}]} ]}])
    10. {type, Type}, where Type must be either of the atoms set, ordered_set, or bag. Default is set. In a set, all records have unique keys. In a bag, several records can have the same key, but the record content is unique. If a non-unique record is stored, the old conflicting records are overwritten.

      Notice that currently ordered_set is not supported for disc_only_copies.

    11. {local_content, Bool}, where Bool is true or false. Default is false.

    12. For example, the following call creates the person table (defined earlier) and -replicates it on two nodes:

      mnesia:create_table(person,
      -    [{ram_copies, [N1, N2]},
      -     {attributes, record_info(fields, person)}]).

      If it is required that Mnesia must build and maintain an extra index table on +replicates it on two nodes:

      mnesia:create_table(person,
      +    [{ram_copies, [N1, N2]},
      +     {attributes, record_info(fields, person)}]).

      If it is required that Mnesia must build and maintain an extra index table on attribute address of all the person records that are inserted in the table, -the following code would be issued:

      mnesia:create_table(person,
      -    [{ram_copies, [N1, N2]},
      -     {index, [address]},
      -     {attributes, record_info(fields, person)}]).

      The specification of index and attributes can be hard-coded as +the following code would be issued:

      mnesia:create_table(person,
      +    [{ram_copies, [N1, N2]},
      +     {index, [address]},
      +     {attributes, record_info(fields, person)}]).

      The specification of index and attributes can be hard-coded as {index, [2]} and {attributes, [name, age, address, salary, children]}, respectively.

      mnesia:create_table/2 writes records into the table schema. This function, and all other schema manipulation functions, are implemented with the normal @@ -5260,10 +5260,10 @@ argument. Default is read. The return value depends on MatchSpec.

      Notice that for best performance, select is to be used before any modifying operations are done on that table in the same transaction. That is, do not use write or delete before a select.

      In its simplest forms, the match_spec look as follows:

      • MatchSpec = [MatchFunction]
      • MatchFunction = {MatchHead, [Guard], [Result]}
      • MatchHead = tuple() | record()

      • Guard = {"Guardtest name", ...}
      • Result = "Term construct"

      For a complete description of select, see the ERTS -User's Guide and the ets manual page in STDLIB.

      For example, to find the names of all male persons older than 30 in table Tab:

      MatchHead = #person{name='$1', sex=male, age='$2', _='_'},
      -Guard = {'>', '$2', 30},
      +User's Guide and the ets manual page in STDLIB.

      For example, to find the names of all male persons older than 30 in table Tab:

      MatchHead = #person{name='$1', sex=male, age='$2', _='_'},
      +Guard = {'>', '$2', 30},
       Result = '$1',
      -mnesia:select(Tab,[{MatchHead, [Guard], [Result]}]),
      +
      mnesia:select(Tab,[{MatchHead, [Guard], [Result]}]),
      @@ -5558,9 +5558,9 @@ specified as a tuple of atoms describing the types. The only significant type is fix_string. This means that a string has a fixed size.

      For example, the following causes table person to be ordered as an SNMP table:

      mnesia:snmp_open_table(person, [{key, string}])

      Consider the following schema for a table of company employees. Each employee is identified by department number and name. The other table column stores the -telephone number:

      mnesia:create_table(employee,
      -    [{snmp, [{key, {integer, string}}]},
      -     {attributes, record_info(fields, employees)}]),

      The corresponding SNMP table would have three columns: department, name, and +telephone number:

      mnesia:create_table(employee,
      +    [{snmp, [{key, {integer, string}}]},
      +     {attributes, record_info(fields, employees)}]),

      The corresponding SNMP table would have three columns: department, name, and telno.

      An option is to have table columns that are not visible through the SNMP protocol. These columns must be the last columns of the table. In the previous example, the SNMP table could have columns department and name only. The @@ -6163,17 +6163,17 @@ transaction is terminated and the function transaction/1 returns the tuple {aborted, Reason}.

      If all is going well, {atomic, ResultOfFun} is returned, where ResultOfFun is the value of the last expression in Fun.

      A function that adds a family to the database can be written as follows if there -is a structure {family, Father, Mother, ChildrenList}:

      add_family({family, F, M, Children}) ->
      -    ChildOids = lists:map(fun oid/1, Children),
      -    Trans = fun() ->
      -        mnesia:write(F#person{children = ChildOids}),
      -        mnesia:write(M#person{children = ChildOids}),
      -        Write = fun(Child) -> mnesia:write(Child) end,
      -        lists:foreach(Write, Children)
      +is a structure {family, Father, Mother, ChildrenList}:

      add_family({family, F, M, Children}) ->
      +    ChildOids = lists:map(fun oid/1, Children),
      +    Trans = fun() ->
      +        mnesia:write(F#person{children = ChildOids}),
      +        mnesia:write(M#person{children = ChildOids}),
      +        Write = fun(Child) -> mnesia:write(Child) end,
      +        lists:foreach(Write, Children)
           end,
      -    mnesia:transaction(Trans).
      +    mnesia:transaction(Trans).
       
      -oid(Rec) -> {element(1, Rec), element(2, Rec)}.

      This code adds a set of people to the database. Running this code within one +oid(Rec) -> {element(1, Rec), element(2, Rec)}.

      This code adds a set of people to the database. Running this code within one transaction ensures that either the whole family is added to the database, or the whole transaction terminates. For example, if the last child is badly formatted, or the executing process terminates because of an 'EXIT' signal @@ -6181,17 +6181,17 @@ where half a family is added can never occur.

      It is also useful to update the database within a transaction if several processes concurrently update the same records. For example, the function raise(Name, Amount), which adds Amount to the salary field of a person, is -to be implemented as follows:

      raise(Name, Amount) ->
      -    mnesia:transaction(fun() ->
      -        case mnesia:wread({person, Name}) of
      -            [P] ->
      +to be implemented as follows:

      raise(Name, Amount) ->
      +    mnesia:transaction(fun() ->
      +        case mnesia:wread({person, Name}) of
      +            [P] ->
                       Salary = Amount + P#person.salary,
      -                P2 = P#person{salary = Salary},
      -                mnesia:write(P2);
      +                P2 = P#person{salary = Salary},
      +                mnesia:write(P2);
                   _ ->
      -                mnesia:abort("No such person")
      +                mnesia:abort("No such person")
               end
      -    end).

      When this function executes within a transaction, several processes running on + end).

      When this function executes within a transaction, several processes running on different nodes can concurrently execute the function raise/2 without interfering with each other.

      Since Mnesia detects deadlocks, a transaction can be restarted any number of times and therefore the Fun shall not have any side effects such as waiting /usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (531)) --- old//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.html 2026-06-04 19:05:12.490543521 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia.html 2026-06-04 19:05:12.490543521 +0000 @@ -166,11 +166,11 @@ specifies the types of the SNMP keys.

    13. attributes. The names of the attributes for the records that are inserted in the table.

    14. For information about the complete set of table properties and their details, see mnesia:create_table/2.

      This Reference Manual uses a table of persons to illustrate various examples. -The following record definition is assumed:

      -record(person, {name,
      +The following record definition is assumed:

      -record(person, {name,
                        age = 0,
                        address = unknown,
                        salary = 0,
      -                 children = []}),

      The first record attribute is the primary key, or key for short.

      The function descriptions are sorted in alphabetical order. It is recommended to + children = []}),

      The first record attribute is the primary key, or key for short.

      The function descriptions are sorted in alphabetical order. It is recommended to start to read about mnesia:create_table/2, mnesia:lock/2, and mnesia:activity/4 before you continue and learn about the rest.

      Writing or deleting in transaction-context creates a local copy of each modified record during the transaction. During iteration, that is, mnesia:foldl/4, @@ -2865,7 +2865,7 @@ -

      Change the storage type of a table.

      For example:

      mnesia:change_table_copy_type(person, node(), disc_copies)

      Transforms the person table from a RAM table into a disc-based table at +

      Change the storage type of a table.

      For example:

      mnesia:change_table_copy_type(person, node(), disc_copies)

      Transforms the person table from a RAM table into a disc-based table at Node.

      This function can also be used to change the storage type of the table named schema. The schema table can only have ram_copies or disc_copies as the storage type. If the storage type of the schema is ram_copies, no other table @@ -3116,22 +3116,22 @@ back end storage. Backend can currently be ets or dets. Properties is a list of options sent to the back end storage during table creation. Properties cannot contain properties already used by Mnesia, such as type -or named_table.

      For example:

      mnesia:create_table(table, [{ram_copies, [node()]}, {disc_only_copies, nodes()},
      -       {storage_properties,
      -        [{ets, [compressed]}, {dets, [{auto_save, 5000}]} ]}])
    15. {type, Type}, where Type must be either of the atoms set, ordered_set, +or named_table.

      For example:

      mnesia:create_table(table, [{ram_copies, [node()]}, {disc_only_copies, nodes()},
      +       {storage_properties,
      +        [{ets, [compressed]}, {dets, [{auto_save, 5000}]} ]}])
    16. {type, Type}, where Type must be either of the atoms set, ordered_set, or bag. Default is set. In a set, all records have unique keys. In a bag, several records can have the same key, but the record content is unique. If a non-unique record is stored, the old conflicting records are overwritten.

      Notice that currently ordered_set is not supported for disc_only_copies.

    17. {local_content, Bool}, where Bool is true or false. Default is false.

    18. For example, the following call creates the person table (defined earlier) and -replicates it on two nodes:

      mnesia:create_table(person,
      -    [{ram_copies, [N1, N2]},
      -     {attributes, record_info(fields, person)}]).

      If it is required that Mnesia must build and maintain an extra index table on +replicates it on two nodes:

      mnesia:create_table(person,
      +    [{ram_copies, [N1, N2]},
      +     {attributes, record_info(fields, person)}]).

      If it is required that Mnesia must build and maintain an extra index table on attribute address of all the person records that are inserted in the table, -the following code would be issued:

      mnesia:create_table(person,
      -    [{ram_copies, [N1, N2]},
      -     {index, [address]},
      -     {attributes, record_info(fields, person)}]).

      The specification of index and attributes can be hard-coded as +the following code would be issued:

      mnesia:create_table(person,
      +    [{ram_copies, [N1, N2]},
      +     {index, [address]},
      +     {attributes, record_info(fields, person)}]).

      The specification of index and attributes can be hard-coded as {index, [2]} and {attributes, [name, age, address, salary, children]}, respectively.

      mnesia:create_table/2 writes records into the table schema. This function, and all other schema manipulation functions, are implemented with the normal @@ -5381,10 +5381,10 @@ argument. Default is read. The return value depends on MatchSpec.

      Notice that for best performance, select is to be used before any modifying operations are done on that table in the same transaction. That is, do not use write or delete before a select.

      In its simplest forms, the match_spec look as follows:

      • MatchSpec = [MatchFunction]
      • MatchFunction = {MatchHead, [Guard], [Result]}
      • MatchHead = tuple() | record()

      • Guard = {"Guardtest name", ...}
      • Result = "Term construct"

      For a complete description of select, see the ERTS -User's Guide and the ets manual page in STDLIB.

      For example, to find the names of all male persons older than 30 in table Tab:

      MatchHead = #href_anchor"ss">person{name='$1', sex=male, age='$2', _='_'},
      -Guard = {'>', '$2', 30},
      +User's Guide and the ets manual page in STDLIB.

      For example, to find the names of all male persons older than 30 in table Tab:

      MatchHead = #href_anchor"ss">person{name='$1', sex=male, age='$2', _='_'},
      +Guard = {'>', '$2', 30},
       Result = '$1',
      -mnesia:select(Tab,[{MatchHead, [Guard], [Result]}]),
      +
      mnesia:select(Tab,[{MatchHead, [Guard], [Result]}]),
      @@ -5679,9 +5679,9 @@ specified as a tuple of atoms describing the types. The only significant type is fix_string. This means that a string has a fixed size.

      For example, the following causes table person to be ordered as an SNMP table:

      mnesia:snmp_open_table(person, [{key, string}])

      Consider the following schema for a table of company employees. Each employee is identified by department number and name. The other table column stores the -telephone number:

      mnesia:create_table(employee,
      -    [{snmp, [{key, {integer, string}}]},
      -     {attributes, record_info(fields, employees)}]),

      The corresponding SNMP table would have three columns: department, name, and +telephone number:

      mnesia:create_table(employee,
      +    [{snmp, [{key, {integer, string}}]},
      +     {attributes, record_info(fields, employees)}]),

      The corresponding SNMP table would have three columns: department, name, and telno.

      An option is to have table columns that are not visible through the SNMP protocol. These columns must be the last columns of the table. In the previous example, the SNMP table could have columns department and name only. The @@ -6284,17 +6284,17 @@ transaction is terminated and the function transaction/1 returns the tuple {aborted, Reason}.

      If all is going well, {atomic, ResultOfFun} is returned, where ResultOfFun is the value of the last expression in Fun.

      A function that adds a family to the database can be written as follows if there -is a structure {family, Father, Mother, ChildrenList}:

      add_family({family, F, M, Children}) ->
      -    ChildOids = lists:map(fun oid/1, Children),
      -    Trans = fun() ->
      -        mnesia:write(F#person{children = ChildOids}),
      -        mnesia:write(M#person{children = ChildOids}),
      -        Write = fun(Child) -> mnesia:write(Child) end,
      -        lists:foreach(Write, Children)
      +is a structure {family, Father, Mother, ChildrenList}:

      add_family({family, F, M, Children}) ->
      +    ChildOids = lists:map(fun oid/1, Children),
      +    Trans = fun() ->
      +        mnesia:write(F#person{children = ChildOids}),
      +        mnesia:write(M#person{children = ChildOids}),
      +        Write = fun(Child) -> mnesia:write(Child) end,
      +        lists:foreach(Write, Children)
           end,
      -    mnesia:transaction(Trans).
      +    mnesia:transaction(Trans).
       
      -oid(Rec) -> {element(1, Rec), element(2, Rec)}.

      This code adds a set of people to the database. Running this code within one +oid(Rec) -> {element(1, Rec), element(2, Rec)}.

      This code adds a set of people to the database. Running this code within one transaction ensures that either the whole family is added to the database, or the whole transaction terminates. For example, if the last child is badly formatted, or the executing process terminates because of an 'EXIT' signal @@ -6302,17 +6302,17 @@ where half a family is added can never occur.

      It is also useful to update the database within a transaction if several processes concurrently update the same records. For example, the function raise(Name, Amount), which adds Amount to the salary field of a person, is -to be implemented as follows:

      raise(Name, Amount) ->
      -    mnesia:transaction(fun() ->
      -        case mnesia:wread({person, Name}) of
      -            [P] ->
      +to be implemented as follows:

      raise(Name, Amount) ->
      +    mnesia:transaction(fun() ->
      +        case mnesia:wread({person, Name}) of
      +            [P] ->
                       Salary = Amount + P#person.salary,
      -                P2 = P#person{salary = Salary},
      -                mnesia:write(P2);
      +                P2 = P#person{salary = Salary},
      +                mnesia:write(P2);
                   _ ->
      -                mnesia:abort("No such person")
      +                mnesia:abort("No such person")
               end
      -    end).

      When this function executes within a transaction, several processes running on + end).

      When this function executes within a transaction, several processes running on different nodes can concurrently execute the function raise/2 without interfering with each other.

      Since Mnesia detects deadlocks, a transaction can be restarted any number of times and therefore the Fun shall not have any side effects such as waiting @@ -6721,7 +6721,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_app_a.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (953)) --- old//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_app_a.html 2026-06-04 19:05:12.512543725 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_app_a.html 2026-06-04 19:05:12.512543725 +0000 @@ -159,11 +159,11 @@ %% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% --module(mnesia_backup). +-module(mnesia_backup). --include_lib("kernel/include/file.hrl"). +-include_lib("kernel/include/file.hrl"). --export([ +-export([ %% Write access open_write/1, write/2, @@ -174,105 +174,105 @@ open_read/1, read/1, close_read/1 - ]). + ]). %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %% Backup callback interface --record(backup, {tmp_file, file, file_desc}). +-record(backup, {tmp_file, file, file_desc}). %% Opens backup media for write %% %% Returns {ok, OpaqueData} or {error, Reason} -open_write(OpaqueData) -> +open_write(OpaqueData) -> File = OpaqueData, - Tmp = lists:concat([File,".BUPTMP"]), - file:delete(Tmp), - case disk_log:open([{name, make_ref()}, - {file, Tmp}, - {repair, false}, - {linkto, self()}]) of - {ok, Fd} -> - {ok, #backup{tmp_file = Tmp, file = File, file_desc = Fd}}; - {error, Reason} -> - {error, Reason} + Tmp = lists:concat([File,".BUPTMP"]), + file:delete(Tmp), + case disk_log:open([{name, make_ref()}, + {file, Tmp}, + {repair, false}, + {linkto, self()}]) of + {ok, Fd} -> + {ok, #backup{tmp_file = Tmp, file = File, file_desc = Fd}}; + {error, Reason} -> + {error, Reason} end. %% Writes BackupItems to the backup media %% %% Returns {ok, OpaqueData} or {error, Reason} -write(OpaqueData, BackupItems) -> +write(OpaqueData, BackupItems) -> B = OpaqueData, - case disk_log:log_terms(B#backup.file_desc, BackupItems) of + case disk_log:log_terms(B#backup.file_desc, BackupItems) of ok -> - {ok, B}; - {error, Reason} -> - abort_write(B), - {error, Reason} + {ok, B}; + {error, Reason} -> + abort_write(B), + {error, Reason} end. %% Closes the backup media after a successful backup %% %% Returns {ok, ReturnValueToUser} or {error, Reason} -commit_write(OpaqueData) -> +commit_write(OpaqueData) -> B = OpaqueData, - case disk_log:sync(B#backup.file_desc) of + case disk_log:sync(B#backup.file_desc) of ok -> - case disk_log:close(B#backup.file_desc) of + case disk_log:close(B#backup.file_desc) of ok -> - file:delete(B#backup.file), - case file:rename(B#backup.tmp_file, B#backup.file) of + file:delete(B#backup.file), + case file:rename(B#backup.tmp_file, B#backup.file) of ok -> - {ok, B#backup.file}; - {error, Reason} -> - {error, Reason} + {ok, B#backup.file}; + {error, Reason} -> + {error, Reason} end; - {error, Reason} -> - {error, Reason} + {error, Reason} -> + {error, Reason} end; - {error, Reason} -> - {error, Reason} + {error, Reason} -> + {error, Reason} end. %% Closes the backup media after an interrupted backup %% %% Returns {ok, ReturnValueToUser} or {error, Reason} -abort_write(BackupRef) -> - Res = disk_log:close(BackupRef#backup.file_desc), - file:delete(BackupRef#backup.tmp_file), +abort_write(BackupRef) -> + Res = disk_log:close(BackupRef#backup.file_desc), + file:delete(BackupRef#backup.tmp_file), case Res of ok -> - {ok, BackupRef#backup.file}; - {error, Reason} -> - {error, Reason} + {ok, BackupRef#backup.file}; + {error, Reason} -> + {error, Reason} end. %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %% Restore callback interface --record(restore, {file, file_desc, cont}). +-record(restore, {file, file_desc, cont}). %% Opens backup media for read %% %% Returns {ok, OpaqueData} or {error, Reason} -open_read(OpaqueData) -> +open_read(OpaqueData) -> File = OpaqueData, - case file:read_file_info(File) of - {error, Reason} -> - {error, Reason}; + case file:read_file_info(File) of + {error, Reason} -> + {error, Reason}; _FileInfo -> %% file exists - case disk_log:open([{file, File}, - {name, make_ref()}, - {repair, false}, - {mode, read_only}, - {linkto, self()}]) of - {ok, Fd} -> - {ok, #restore{file = File, file_desc = Fd, cont = start}}; - {repaired, Fd, _, {badbytes, 0}} -> - {ok, #restore{file = File, file_desc = Fd, cont = start}}; - {repaired, Fd, _, _} -> - {ok, #restore{file = File, file_desc = Fd, cont = start}}; - {error, Reason} -> - {error, Reason} + case disk_log:open([{file, File}, + {name, make_ref()}, + {repair, false}, + {mode, read_only}, + {linkto, self()}]) of + {ok, Fd} -> + {ok, #restore{file = File, file_desc = Fd, cont = start}}; + {repaired, Fd, _, {badbytes, 0}} -> + {ok, #restore{file = File, file_desc = Fd, cont = start}}; + {repaired, Fd, _, _} -> + {ok, #restore{file = File, file_desc = Fd, cont = start}}; + {error, Reason} -> + {error, Reason} end end. @@ -281,30 +281,30 @@ %% Returns {ok, OpaqueData, BackupItems} or {error, Reason} %% %% BackupItems == [] is interpreted as eof -read(OpaqueData) -> +read(OpaqueData) -> R = OpaqueData, Fd = R#restore.file_desc, - case disk_log:chunk(Fd, R#restore.cont) of - {error, Reason} -> - {error, {"Possibly truncated", Reason}}; + case disk_log:chunk(Fd, R#restore.cont) of + {error, Reason} -> + {error, {"Possibly truncated", Reason}}; eof -> - {ok, R, []}; - {Cont, []} -> - read(R#restore{cont = Cont}); - {Cont, BackupItems, _BadBytes} -> - {ok, R#restore{cont = Cont}, BackupItems}; - {Cont, BackupItems} -> - {ok, R#restore{cont = Cont}, BackupItems} /usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_app_b.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (960)) --- old//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_app_b.html 2026-06-04 19:05:12.535543938 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_app_b.html 2026-06-04 19:05:12.535543938 +0000 @@ -131,10 +131,10 @@ mnesia_access Callback Behavior

      -
      -module(mnesia_frag).
      +
      -module(mnesia_frag).
       
       %% Callback functions when accessed within an activity
      --export([
      +-export([
       	 lock/4,
       	 write/5, delete/5, delete_object/5,
       	 read/5, match_object/5, all_keys/4,
      @@ -143,230 +143,230 @@
       	 foldl/6, foldr/6, table_info/4,
       	 first/3, next/4, prev/4, last/3,
       	 clear_table/4
      -       ]).
      %% Callback functions which provides transparent
      +       ]).
      %% Callback functions which provides transparent
       %% access of fragmented tables from any activity
       %% access context.
       
      -lock(ActivityId, Opaque, {table , Tab}, LockKind) ->
      -    case frag_names(Tab) of
      -	[Tab] ->
      -	    mnesia:lock(ActivityId, Opaque, {table, Tab}, LockKind);
      +lock(ActivityId, Opaque, {table , Tab}, LockKind) ->
      +    case frag_names(Tab) of
      +	[Tab] ->
      +	    mnesia:lock(ActivityId, Opaque, {table, Tab}, LockKind);
       	Frags ->
      -	    DeepNs = [mnesia:lock(ActivityId, Opaque, {table, F}, LockKind) ||
      -			 F <- Frags],
      -	    mnesia_lib:uniq(lists:append(DeepNs))
      +	    DeepNs = [mnesia:lock(ActivityId, Opaque, {table, F}, LockKind) ||
      +			 F <- Frags],
      +	    mnesia_lib:uniq(lists:append(DeepNs))
           end;
       
      -lock(ActivityId, Opaque, LockItem, LockKind) ->
      -    mnesia:lock(ActivityId, Opaque, LockItem, LockKind).
      +lock(ActivityId, Opaque, LockItem, LockKind) ->
      +    mnesia:lock(ActivityId, Opaque, LockItem, LockKind).
       
      -write(ActivityId, Opaque, Tab, Rec, LockKind) ->
      -    Frag = record_to_frag_name(Tab, Rec),
      -    mnesia:write(ActivityId, Opaque, Frag, Rec, LockKind).
      +write(ActivityId, Opaque, Tab, Rec, LockKind) ->
      +    Frag = record_to_frag_name(Tab, Rec),
      +    mnesia:write(ActivityId, Opaque, Frag, Rec, LockKind).
       
      -delete(ActivityId, Opaque, Tab, Key, LockKind) ->
      -    Frag = key_to_frag_name(Tab, Key),
      -    mnesia:delete(ActivityId, Opaque, Frag, Key, LockKind).
      +delete(ActivityId, Opaque, Tab, Key, LockKind) ->
      +    Frag = key_to_frag_name(Tab, Key),
      +    mnesia:delete(ActivityId, Opaque, Frag, Key, LockKind).
       
      -delete_object(ActivityId, Opaque, Tab, Rec, LockKind) ->
      -    Frag = record_to_frag_name(Tab, Rec),
      -    mnesia:delete_object(ActivityId, Opaque, Frag, Rec, LockKind).
      +delete_object(ActivityId, Opaque, Tab, Rec, LockKind) ->
      +    Frag = record_to_frag_name(Tab, Rec),
      +    mnesia:delete_object(ActivityId, Opaque, Frag, Rec, LockKind).
       
      -read(ActivityId, Opaque, Tab, Key, LockKind) ->
      -    Frag = key_to_frag_name(Tab, Key),
      -    mnesia:read(ActivityId, Opaque, Frag, Key, LockKind).
      +read(ActivityId, Opaque, Tab, Key, LockKind) ->
      +    Frag = key_to_frag_name(Tab, Key),
      +    mnesia:read(ActivityId, Opaque, Frag, Key, LockKind).
       
      -match_object(ActivityId, Opaque, Tab, HeadPat, LockKind) ->
      -    MatchSpec = [{HeadPat, [], ['$_']}],
      -    select(ActivityId, Opaque, Tab, MatchSpec, LockKind).
      +match_object(ActivityId, Opaque, Tab, HeadPat, LockKind) ->
      +    MatchSpec = [{HeadPat, [], ['$_']}],
      +    select(ActivityId, Opaque, Tab, MatchSpec, LockKind).
       
      -select(ActivityId, Opaque, Tab, MatchSpec, LockKind) ->
      -    do_select(ActivityId, Opaque, Tab, MatchSpec, LockKind).
      +select(ActivityId, Opaque, Tab, MatchSpec, LockKind) ->
      +    do_select(ActivityId, Opaque, Tab, MatchSpec, LockKind).
       
       
      -select(ActivityId, Opaque, Tab, MatchSpec, Limit, LockKind) ->
      -    init_select(ActivityId, Opaque, Tab, MatchSpec, Limit, LockKind).
      +select(ActivityId, Opaque, Tab, MatchSpec, Limit, LockKind) ->
      +    init_select(ActivityId, Opaque, Tab, MatchSpec, Limit, LockKind).
       
       
      -all_keys(ActivityId, Opaque, Tab, LockKind) ->
      -    Match = [mnesia:all_keys(ActivityId, Opaque, Frag, LockKind)
      -	     || Frag <- frag_names(Tab)],
      -    lists:append(Match).
      +all_keys(ActivityId, Opaque, Tab, LockKind) ->
      +    Match = [mnesia:all_keys(ActivityId, Opaque, Frag, LockKind)
      +	     || Frag <- frag_names(Tab)],
      +    lists:append(Match).
       
      -clear_table(ActivityId, Opaque, Tab, Obj) ->
      -    [mnesia:clear_table(ActivityId, Opaque, Frag, Obj)  || Frag <- frag_names(Tab)],
      +clear_table(ActivityId, Opaque, Tab, Obj) ->
      +    [mnesia:clear_table(ActivityId, Opaque, Frag, Obj)  || Frag <- frag_names(Tab)],
           ok.
       
      -index_match_object(ActivityId, Opaque, Tab, Pat, Attr, LockKind) ->
      +index_match_object(ActivityId, Opaque, Tab, Pat, Attr, LockKind) ->
           Match =
      -	[mnesia:index_match_object(ActivityId, Opaque, Frag, Pat, Attr, LockKind)
      -	 || Frag <- frag_names(Tab)],
      -    lists:append(Match).
      +	[mnesia:index_match_object(ActivityId, Opaque, Frag, Pat, Attr, LockKind)
      +	 || Frag <- frag_names(Tab)],
      +    lists:append(Match).
       
      -index_read(ActivityId, Opaque, Tab, Key, Attr, LockKind) ->
      +index_read(ActivityId, Opaque, Tab, Key, Attr, LockKind) ->
           Match =
      -	[mnesia:index_read(ActivityId, Opaque, Frag, Key, Attr, LockKind)
      -	     || Frag <- frag_names(Tab)],
      -    lists:append(Match).
      -
      -foldl(ActivityId, Opaque, Fun, Acc, Tab, LockKind) ->
      -    Fun2 = fun(Frag, A) ->
      -		   mnesia:foldl(ActivityId, Opaque, Fun, A, Frag, LockKind)
      +	[mnesia:index_read(ActivityId, Opaque, Frag, Key, Attr, LockKind)
      +	     || Frag <- frag_names(Tab)],
      +    lists:append(Match).
      +
      +foldl(ActivityId, Opaque, Fun, Acc, Tab, LockKind) ->
      +    Fun2 = fun(Frag, A) ->
      +		   mnesia:foldl(ActivityId, Opaque, Fun, A, Frag, LockKind)
       	   end,
      -    lists:foldl(Fun2, Acc, frag_names(Tab)).
      +    lists:foldl(Fun2, Acc, frag_names(Tab)).
       
      -foldr(ActivityId, Opaque, Fun, Acc, Tab, LockKind) ->
      -    Fun2 = fun(Frag, A) ->
      -		   mnesia:foldr(ActivityId, Opaque, Fun, A, Frag, LockKind)
      +foldr(ActivityId, Opaque, Fun, Acc, Tab, LockKind) ->
      +    Fun2 = fun(Frag, A) ->
      +		   mnesia:foldr(ActivityId, Opaque, Fun, A, Frag, LockKind)
       	   end,
      -    lists:foldr(Fun2, Acc, frag_names(Tab)).
      +    lists:foldr(Fun2, Acc, frag_names(Tab)).
       
      -table_info(ActivityId, Opaque, {Tab, Key}, Item) ->
      -    Frag = key_to_frag_name(Tab, Key),
      -    table_info2(ActivityId, Opaque, Tab, Frag, Item);
      -table_info(ActivityId, Opaque, Tab, Item) ->
      -    table_info2(ActivityId, Opaque, Tab, Tab, Item).
      +table_info(ActivityId, Opaque, {Tab, Key}, Item) ->
      +    Frag = key_to_frag_name(Tab, Key),
      +    table_info2(ActivityId, Opaque, Tab, Frag, Item);
      +table_info(ActivityId, Opaque, Tab, Item) ->
      +    table_info2(ActivityId, Opaque, Tab, Tab, Item).
       
      -table_info2(ActivityId, Opaque, Tab, Frag, Item) ->
      +table_info2(ActivityId, Opaque, Tab, Frag, Item) ->
           case Item of
       	size ->
      -	    SumFun = fun({_, Size}, Acc) -> Acc + Size end,
      -	    lists:foldl(SumFun, 0, frag_size(ActivityId, Opaque, Tab));
      +	    SumFun = fun({_, Size}, Acc) -> Acc + Size end,
      +	    lists:foldl(SumFun, 0, frag_size(ActivityId, Opaque, Tab));
       	memory ->
      -	    SumFun = fun({_, Size}, Acc) -> Acc + Size end,
      -	    lists:foldl(SumFun, 0, frag_memory(ActivityId, Opaque, Tab));
      +	    SumFun = fun({_, Size}, Acc) -> Acc + Size end,
      +	    lists:foldl(SumFun, 0, frag_memory(ActivityId, Opaque, Tab));
       	base_table ->
      -	    lookup_prop(Tab, base_table);
      +	    lookup_prop(Tab, base_table);
       	node_pool ->
      -	    lookup_prop(Tab, node_pool);
      +	    lookup_prop(Tab, node_pool);
       	n_fragments ->
      -	    FH = lookup_frag_hash(Tab),
      +	    FH = lookup_frag_hash(Tab),
       	    FH#frag_state.n_fragments;
       	foreign_key ->
      -	    FH = lookup_frag_hash(Tab),
      +	    FH = lookup_frag_hash(Tab),
       	    FH#frag_state.foreign_key;
       	foreigners ->
      -	    lookup_foreigners(Tab);
      +	    lookup_foreigners(Tab);
       	n_ram_copies ->
      -	    length(val({Tab, ram_copies}));
      +	    length(val({Tab, ram_copies}));
       	n_disc_copies ->
      -	    length(val({Tab, disc_copies}));
      +	    length(val({Tab, disc_copies}));
       	n_disc_only_copies ->
      -	    length(val({Tab, disc_only_copies}));
      +	    length(val({Tab, disc_only_copies}));
       	n_external_copies ->
      /usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_app_c.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1056))
      --- old//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_app_c.html	2026-06-04 19:05:12.559544161 +0000
      +++ new//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_app_c.html	2026-06-04 19:05:12.559544161 +0000
      @@ -131,136 +131,136 @@
         
         mnesia_frag_hash Callback Behavior
       

      -
      -module(mnesia_frag_hash).
      --compile([{nowarn_deprecated_function, [{erlang,phash,2}]}]).
      +
      -module(mnesia_frag_hash).
      +-compile([{nowarn_deprecated_function, [{erlang,phash,2}]}]).
       
       %% Fragmented Table Hashing callback functions
      --export([
      +-export([
       	 init_state/2,
       	 add_frag/1,
       	 del_frag/1,
       	 key_to_frag_number/2,
       	 match_spec_to_frag_numbers/2
      -	]).
      -record(hash_state,
      -	{n_fragments,
      +	]).
      -record(hash_state,
      +	{n_fragments,
       	 next_n_to_split,
       	 n_doubles,
      -	 function}).
      +	 function}).
       
       %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
      --spec init_state(Tab, State) -> NewState when
      -      Tab :: atom(),
      -      State :: term(),
      -      NewState :: term().
      -init_state(_Tab, State) when State == undefined ->
      -    #hash_state{n_fragments     = 1,
      +-spec init_state(Tab, State) -> NewState when
      +      Tab :: atom(),
      +      State :: term(),
      +      NewState :: term().
      +init_state(_Tab, State) when State == undefined ->
      +    #hash_state{n_fragments     = 1,
       		next_n_to_split = 1,
       		n_doubles       = 0,
      -		function        = phash2}.
      +		function        = phash2}.
       
      -convert_old_state({hash_state, N, P, L}) ->
      -    #hash_state{n_fragments     = N,
      +convert_old_state({hash_state, N, P, L}) ->
      +    #hash_state{n_fragments     = N,
       		next_n_to_split = P,
       		n_doubles       = L,
      -		function        = phash}.
      +		function        = phash}.
       
       %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
       
      --spec add_frag(State :: term()) -> {NewState, IterFrags, AdditionalLockFrags} when
      -      NewState :: term(),
      -      IterFrags :: [integer()],
      -      AdditionalLockFrags :: [integer()].
      -add_frag(#hash_state{next_n_to_split = SplitN, n_doubles = L, n_fragments = N} = State) ->
      +-spec add_frag(State :: term()) -> {NewState, IterFrags, AdditionalLockFrags} when
      +      NewState :: term(),
      +      IterFrags :: [integer()],
      +      AdditionalLockFrags :: [integer()].
      +add_frag(#hash_state{next_n_to_split = SplitN, n_doubles = L, n_fragments = N} = State) ->
           P = SplitN + 1,
           NewN = N + 1,
      -    State2 = case power2(L) + 1 of
      +    State2 = case power2(L) + 1 of
       		 P2 when P2 == P ->
      -		     State#hash_state{n_fragments      = NewN,
      +		     State#hash_state{n_fragments      = NewN,
       				      n_doubles        = L + 1,
      -				      next_n_to_split = 1};
      +				      next_n_to_split = 1};
       		 _ ->
      -		     State#hash_state{n_fragments     = NewN,
      -				      next_n_to_split = P}
      +		     State#hash_state{n_fragments     = NewN,
      +				      next_n_to_split = P}
       	     end,
      -    {State2, [SplitN], [NewN]};
      -add_frag(OldState) ->
      -    State = convert_old_state(OldState),
      -    add_frag(State).
      +    {State2, [SplitN], [NewN]};
      +add_frag(OldState) ->
      +    State = convert_old_state(OldState),
      +    add_frag(State).
       
       %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
       
      --spec del_frag(State :: term()) -> {NewState, IterFrags, AdditionalLockFrags} when
      -      NewState :: term(),
      -      IterFrags :: [integer()],
      -      AdditionalLockFrags :: [integer()].
      -del_frag(#hash_state{next_n_to_split = SplitN, n_doubles = L, n_fragments = N} = State) ->
      +-spec del_frag(State :: term()) -> {NewState, IterFrags, AdditionalLockFrags} when
      +      NewState :: term(),
      +      IterFrags :: [integer()],
      +      AdditionalLockFrags :: [integer()].
      +del_frag(#hash_state{next_n_to_split = SplitN, n_doubles = L, n_fragments = N} = State) ->
           P = SplitN - 1,
           if
       	P < 1 ->
       	    L2 = L - 1,
      -	    MergeN = power2(L2),
      -	    State2 = State#hash_state{n_fragments     = N - 1,
      +	    MergeN = power2(L2),
      +	    State2 = State#hash_state{n_fragments     = N - 1,
       				      next_n_to_split = MergeN,
      -				      n_doubles       = L2},
      -	    {State2, [N], [MergeN]};
      +				      n_doubles       = L2},
      +	    {State2, [N], [MergeN]};
       	true ->
       	    MergeN = P,
      -	    State2 = State#hash_state{n_fragments     = N - 1,
      -				      next_n_to_split = MergeN},
      -	    {State2, [N], [MergeN]}
      +	    State2 = State#hash_state{n_fragments     = N - 1,
      +				      next_n_to_split = MergeN},
      +	    {State2, [N], [MergeN]}
       	end;
      -del_frag(OldState) ->
      -    State = convert_old_state(OldState),
      -    del_frag(State).
      +del_frag(OldState) ->
      +    State = convert_old_state(OldState),
      +    del_frag(State).
       
       %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
      --spec key_to_frag_number(State, Key) -> Fragnum when
      -      State :: term(),
      -      Key :: term(),
      -      Fragnum :: integer().
      -key_to_frag_number(#hash_state{function = phash, n_fragments = N, n_doubles = L}, Key) ->
      -    A = erlang:phash(Key, power2(L + 1)),
      +-spec key_to_frag_number(State, Key) -> Fragnum when
      +      State :: term(),
      +      Key :: term(),
      +      Fragnum :: integer().
      +key_to_frag_number(#hash_state{function = phash, n_fragments = N, n_doubles = L}, Key) ->
      +    A = erlang:phash(Key, power2(L + 1)),
           if
       	A > N ->
      -	    A - power2(L);
      +	    A - power2(L);
       	true ->
       	    A
           end;
      -key_to_frag_number(#hash_state{function = phash2, n_fragments = N, n_doubles = L}, Key) ->
      -    A = erlang:phash2(Key, power2(L + 1)) + 1,
      +key_to_frag_number(#hash_state{function = phash2, n_fragments = N, n_doubles = L}, Key) ->
      +    A = erlang:phash2(Key, power2(L + 1)) + 1,
           if
       	A > N ->
      -	    A - power2(L);
      +	    A - power2(L);
       	true ->
       	    A
           end;
      -key_to_frag_number(OldState, Key) ->
      -    State = convert_old_state(OldState),
      -    key_to_frag_number(State, Key).
      +key_to_frag_number(OldState, Key) ->
      +    State = convert_old_state(OldState),
      +    key_to_frag_number(State, Key).
       
       %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
      --spec match_spec_to_frag_numbers(State, MatchSpec) -> Fragnums when
      -      State :: term(),
      -      MatchSpec :: ets:match_spec(),
      -      Fragnums :: [integer()].
      -match_spec_to_frag_numbers(#hash_state{n_fragments = N} = State, MatchSpec) ->
      +-spec match_spec_to_frag_numbers(State, MatchSpec) -> Fragnums when
      +      State :: term(),
      +      MatchSpec :: ets:match_spec(),
      +      Fragnums :: [integer()].
      +match_spec_to_frag_numbers(#hash_state{n_fragments = N} = State, MatchSpec) ->
           case MatchSpec of
      -	[{HeadPat, _, _}] when is_tuple(HeadPat), tuple_size(HeadPat) > 2 ->
      -	    KeyPat = element(2, HeadPat),
      -	    case has_var(KeyPat) of
      +	[{HeadPat, _, _}] when is_tuple(HeadPat), tuple_size(HeadPat) > 2 ->
      +	    KeyPat = element(2, HeadPat),
      +	    case has_var(KeyPat) of
       		false ->
      -		    [key_to_frag_number(State, KeyPat)];
      +		    [key_to_frag_number(State, KeyPat)];
       		true ->
      -		    lists:seq(1, N)
      +		    lists:seq(1, N)
       	    end;
       	_ ->
      -	    lists:seq(1, N)
      +	    lists:seq(1, N)
           end;
      /usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_chap1.html differs (HTML document, Unicode text, UTF-8 text)
      --- old//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_chap1.html	2026-06-04 19:05:12.580544356 +0000
      +++ new//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_chap1.html	2026-06-04 19:05:12.579544347 +0000
      @@ -213,7 +213,7 @@
                 Erlang programming language
       
             

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_chap2.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (931)) --- old//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_chap2.html 2026-06-04 19:05:12.605544588 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_chap2.html 2026-06-04 19:05:12.611544643 +0000 @@ -137,21 +137,21 @@

      This section provides a simplified demonstration of a Mnesia system startup. The dialogue from the Erlang shell is as follows:

      unix> erl -mnesia dir '"/tmp/funky"'
      -Erlang (BEAM) emulator version 4.9
      +Erlang (BEAM) emulator version 4.9
       
      -Eshell V4.9  (abort with ^G)
      +Eshell V4.9  (abort with ^G)
       1>
      -1> mnesia:create_schema([node()]).
      +1> mnesia:create_schema([node()]).
       ok
      -2> mnesia:start().
      +2> mnesia:start().
       ok
      -3> mnesia:create_table(funky, []).
      -{atomic,ok}
      -4> mnesia:info().
      +3> mnesia:create_table(funky, []).
      +{atomic,ok}
      +4> mnesia:info().
       ---> Processes holding locks <---
       ---> Processes waiting for locks <---
      ----> Pending (remote) transactions <---
      ----> Active (local) transactions <---
      +---> Pending (remote) transactions <---
      +---> Active (local) transactions <---
       ---> Uncertain transactions <---
       ---> Active tables <---
       funky          : with 0 records occupying 269 words of mem
      @@ -159,17 +159,17 @@
       ===> System info in version "1.0", debug level = none <===
       opt_disc. Directory "/tmp/funky" is used.
       use fall-back at restart = false
      -running db nodes = [nonode@nohost]
      -stopped db nodes = []
      -remote           = []
      -ram_copies       = [funky]
      -disc_copies      = [schema]
      -disc_only_copies = []
      -[{nonode@nohost,disc_copies}] = [schema]
      -[{nonode@nohost,ram_copies}] = [funky]
      +running db nodes = [nonode@nohost]
      +stopped db nodes = []
      +remote           = []
      +ram_copies       = [funky]
      +disc_copies      = [schema]
      +disc_only_copies = []
      +[{nonode@nohost,disc_copies}] = [schema]
      +[{nonode@nohost,ram_copies}] = [funky]
       1 transactions committed, 0 aborted, 0 restarted, 1 logged to disc
       0 held locks, 0 in queue; 0 local transactions, 0 remote
      -0 transactions waits for other nodes: []
      +0 transactions waits for other nodes: []
       ok

      In this example, the following actions are performed:

      • Step 1: The Erlang system is started from the UNIX prompt with a flag -mnesia dir '"/tmp/funky"', which indicates in which directory to store the data.
      • Step 2: A new empty schema is initialized on the local node by evaluating @@ -229,28 +229,28 @@ Defining Structure and Content

        First the record definitions are entered into a text file named company.hrl. -This file defines the following structure for the example database:

        -record(employee, {emp_no,
        +This file defines the following structure for the example database:

        -record(employee, {emp_no,
                            name,
                            salary,
                            sex,
                            phone,
        -                   room_no}).
        +                   room_no}).
         
        --record(dept, {id,
        -               name}).
        +-record(dept, {id,
        +               name}).
         
        --record(project, {name,
        -                  number}).
        +-record(project, {name,
        +                  number}).
         
         
        --record(manager, {emp,
        -                  dept}).
        +-record(manager, {emp,
        +                  dept}).
         
        --record(at_dep, {emp,
        -                 dept_id}).
        +-record(at_dep, {emp,
        +                 dept_id}).
         
        --record(in_proj, {emp,
        -                  proj_name}).

        The structure defines six tables in the database. In Mnesia, the function +-record(in_proj, {emp, + proj_name}).

        The structure defines six tables in the database. In Mnesia, the function mnesia:create_table(Name, ArgList) creates tables. Name is the table name.

        Note

        The current version of Mnesia does not require that the name of the table is the same as the record name, see @@ -267,28 +267,28 @@

        The following shell interaction starts Mnesia and initializes the schema for the Company database:

        % erl -mnesia dir '"/ldisc/scratch/Mnesia.Company"'
        -Erlang (BEAM) emulator version 4.9
        +Erlang (BEAM) emulator version 4.9
         
        -Eshell V4.9  (abort with ^G)
        -1> mnesia:create_schema([node()]).
        +Eshell V4.9  (abort with ^G)
        +1> mnesia:create_schema([node()]).
         ok
        -2> mnesia:start().
        -ok

        The following program module creates and populates previously defined tables:

        -include_lib("stdlib/include/qlc.hrl").
        --include("company.hrl").
        -
        -init() ->
        -    mnesia:create_table(employee,
        -                        [{attributes, record_info(fields, employee)}]),
        -    mnesia:create_table(dept,
        -                        [{attributes, record_info(fields, dept)}]),
        -    mnesia:create_table(project,
        -                        [{attributes, record_info(fields, project)}]),
        -    mnesia:create_table(manager, [{type, bag},
        -                                  {attributes, record_info(fields, manager)}]),
        -    mnesia:create_table(at_dep,
        -                         [{attributes, record_info(fields, at_dep)}]),
        -    mnesia:create_table(in_proj, [{type, bag},
        -                                  {attributes, record_info(fields, in_proj)}]).

        +2> mnesia:start(). +ok

    The following program module creates and populates previously defined tables:

    -include_lib("stdlib/include/qlc.hrl").
    +-include("company.hrl").
    +
    +init() ->
    +    mnesia:create_table(employee,
    +                        [{attributes, record_info(fields, employee)}]),
    +    mnesia:create_table(dept,
    +                        [{attributes, record_info(fields, dept)}]),
    +    mnesia:create_table(project,
    +                        [{attributes, record_info(fields, project)}]),
    +    mnesia:create_table(manager, [{type, bag},
    +                                  {attributes, record_info(fields, manager)}]),
    +    mnesia:create_table(at_dep,
    +                         [{attributes, record_info(fields, at_dep)}]),
    +    mnesia:create_table(in_proj, [{type, bag},
    +                                  {attributes, record_info(fields, in_proj)}]).

    @@ -302,13 +302,13 @@ the format mnesia:create_schema(DiscNodeList) and initiates a new schema. In this example, a non-distributed system using only one node is created. Schemas are fully explained in Define a Schema.
  • mnesia:start(). This function starts Mnesia and is fully -explained in Start Mnesia.
  • Continuing the dialogue with the Erlang shell produces the following:

    3> company:init().
    -{atomic,ok}
    -4> mnesia:info().
    +explained in Start Mnesia.

    Continuing the dialogue with the Erlang shell produces the following:

    3> company:init().
    +{atomic,ok}
    +4> mnesia:info().
     ---> Processes holding locks <---
     ---> Processes waiting for locks <---
    ----> Pending (remote) transactions <---
    ----> Active (local) transactions <---
    +---> Pending (remote) transactions <---
    +---> Active (local) transactions <---
     ---> Uncertain transactions <---
     ---> Active tables <---
     in_proj        : with 0 records occuping 269 words of mem
    @@ -321,19 +321,19 @@
     ===> System info in version "1.0", debug level = none <===
     opt_disc. Directory "/ldisc/scratch/Mnesia.Company" is used.
     use fall-back at restart = false
    -running db nodes = [nonode@nohost]
    -stopped db nodes = []
    -remote           = []
    +running db nodes = [nonode@nohost]
    +stopped db nodes = []
    +remote           = []
     ram_copies       =
    -    [at_dep,dept,employee,in_proj,manager,project]
    -disc_copies      = [schema]
    -disc_only_copies = []
    -[{nonode@nohost,disc_copies}] = [schema]
    -[{nonode@nohost,ram_copies}] =
    -    [employee,dept,project,manager,at_dep,in_proj]
    +    [at_dep,dept,employee,in_proj,manager,project]
    +disc_copies      = [schema]
    +disc_only_copies = []
    +[{nonode@nohost,disc_copies}] = [schema]
    +[{nonode@nohost,ram_copies}] =
    +    [employee,dept,project,manager,at_dep,in_proj]
     6 transactions committed, 0 aborted, 0 restarted, 6 logged to disc
     0 held locks, 0 in queue; 0 local transactions, 0 remote
    -0 transactions waits for other nodes: []
    +0 transactions waits for other nodes: []
     ok

    A set of tables is created. The function mnesia:create_table(Name, ArgList) creates the required database tables. The options available with ArgList are explained in @@ -347,32 +347,32 @@ /usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_chap3.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1223)) --- old//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_chap3.html 2026-06-04 19:05:12.634544857 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_chap3.html 2026-06-04 19:05:12.633544847 +0000 @@ -175,18 +175,18 @@ changes the format on all records in table Tab. It applies argument Fun to all records in the table. Fun must be a function that takes a record of the old type, and returns the record of the new type. The table key must not be -changed.

    Example:

    -record(old, {key, val}).
    --record(new, {key, val, extra}).
    +changed.

    Example:

    -record(old, {key, val}).
    +-record(new, {key, val, extra}).
     
     Transformer =
    -   fun(X) when record(X, old) ->
    -      #new{key = X#old.key,
    +   fun(X) when record(X, old) ->
    +      #new{key = X#old.key,
                val = X#old.val,
    -           extra = 42}
    +           extra = 42}
        end,
    -{atomic, ok} = mnesia:transform_table(foo, Transformer,
    -                                      record_info(fields, new),
    -                                      new),

    Argument Fun can also be the atom ignore, which indicates that only the +{atomic, ok} = mnesia:transform_table(foo, Transformer, + record_info(fields, new), + new),

    Argument Fun can also be the atom ignore, which indicates that only the metadata about the table is updated. Use of ignore is not recommended (as it creates inconsistencies between the metadata and the actual data) but it is included as a possibility for the user do to an own (offline) transform.

  • mnesia:change_table_copy_type(Tab, Node, ToType) @@ -238,29 +238,29 @@ when starting the Erlang shell or in the application script. Previously, the following example was used to create the directory for the Company database:

    % erl -mnesia dir '"/ldisc/scratch/Mnesia.Company"'
  • If no command-line flag is entered, the Mnesia directory becomes the current working directory on the node where the Erlang shell is started.

  • To start the Company database and get it running on the two specified nodes, -enter the following commands:

    1. On the node a@gin:
     gin % erl -sname a  -mnesia dir '"/ldisc/scratch/Mnesia.company"'
    1. On the node b@skeppet:
    skeppet % erl -sname b -mnesia dir '"/ldisc/scratch/Mnesia.company"'
    1. On one of the two nodes:
    (a@gin)1> mnesia:create_schema([a@gin, b@skeppet]).
    1. The function mnesia:start() is called on both nodes.
    2. To initialize the database, execute the following code on one of the two -nodes:
    dist_init() ->
    -    mnesia:create_table(employee,
    -                         [{ram_copies, [a@gin, b@skeppet]},
    -                          {attributes, record_info(fields,
    -						   employee)}]),
    -    mnesia:create_table(dept,
    -                         [{ram_copies, [a@gin, b@skeppet]},
    -                          {attributes, record_info(fields, dept)}]),
    -    mnesia:create_table(project,
    -                         [{ram_copies, [a@gin, b@skeppet]},
    -                          {attributes, record_info(fields, project)}]),
    -    mnesia:create_table(manager, [{type, bag},
    -                                  {ram_copies, [a@gin, b@skeppet]},
    -                                  {attributes, record_info(fields,
    -							   manager)}]),
    -    mnesia:create_table(at_dep,
    -                         [{ram_copies, [a@gin, b@skeppet]},
    -                          {attributes, record_info(fields, at_dep)}]),
    -    mnesia:create_table(in_proj,
    -                        [{type, bag},
    -                         {ram_copies, [a@gin, b@skeppet]},
    -                         {attributes, record_info(fields, in_proj)}]).

    As illustrated, the two directories reside on different nodes, because +enter the following commands:

    1. On the node a@gin:
     gin % erl -sname a  -mnesia dir '"/ldisc/scratch/Mnesia.company"'
    1. On the node b@skeppet:
    skeppet % erl -sname b -mnesia dir '"/ldisc/scratch/Mnesia.company"'
    1. On one of the two nodes:
    (a@gin)1> mnesia:create_schema([a@gin, b@skeppet]).
    1. The function mnesia:start() is called on both nodes.
    2. To initialize the database, execute the following code on one of the two +nodes:
    dist_init() ->
    +    mnesia:create_table(employee,
    +                         [{ram_copies, [a@gin, b@skeppet]},
    +                          {attributes, record_info(fields,
    +						   employee)}]),
    +    mnesia:create_table(dept,
    +                         [{ram_copies, [a@gin, b@skeppet]},
    +                          {attributes, record_info(fields, dept)}]),
    +    mnesia:create_table(project,
    +                         [{ram_copies, [a@gin, b@skeppet]},
    +                          {attributes, record_info(fields, project)}]),
    +    mnesia:create_table(manager, [{type, bag},
    +                                  {ram_copies, [a@gin, b@skeppet]},
    +                                  {attributes, record_info(fields,
    +							   manager)}]),
    +    mnesia:create_table(at_dep,
    +                         [{ram_copies, [a@gin, b@skeppet]},
    +                          {attributes, record_info(fields, at_dep)}]),
    +    mnesia:create_table(in_proj,
    +                        [{type, bag},
    +                         {ram_copies, [a@gin, b@skeppet]},
    +                         {attributes, record_info(fields, in_proj)}]).

    As illustrated, the two directories reside on different nodes, because /ldisc/scratch (the "local" disc) exists on the two different nodes.

    By executing these commands, two Erlang nodes are configured to run the Company database, and therefore, initialize the database. This is required only once when setting up. The next time the system is started, @@ -277,7 +277,7 @@ Startup Procedure

    -

    Start Mnesia by calling the following function:

    mnesia:start().

    This function initiates the DBMS locally.

    The choice of configuration alters the location and load order of the tables. +

    Start Mnesia by calling the following function:

    mnesia:start().

    This function initiates the DBMS locally.

    The choice of configuration alters the location and load order of the tables. The alternatives are as follows:

    1. Tables that are only stored locally are initialized from the local Mnesia directory.
    2. Replicated tables that reside locally as well as somewhere else are either initiated from disc or by copying the entire table from the other node, @@ -300,9 +300,9 @@ from disc at a faster rate. The function forces tables to be loaded from disc regardless of the network situation.

      Thus, it can be assumed that if an application wants to use tables a and b, the application must perform some action similar to following before it can use -the tables:

      case mnesia:wait_for_tables([a, b], 20000) of
      -  {timeout, RemainingTabs} ->
      -    panic(RemainingTabs);
      +the tables:

      case mnesia:wait_for_tables([a, b], 20000) of
      +  {timeout, RemainingTabs} ->
      +    panic(RemainingTabs);
         ok ->
           synced
       end.

      Warning

      When tables are forcefully loaded from the local disc, all operations that @@ -328,13 +328,13 @@ key, whereas a table of type bag can have an arbitrary number of records per key. The key for each record is always the first attribute of the record.

      The following example illustrates the difference between type set and -bag:

       f() ->
      -    F = fun() ->
      -          mnesia:write({foo, 1, 2}),
      -          mnesia:write({foo, 1, 3}),
      -          mnesia:read({foo, 1})
      +bag:

       f() ->
      +    F = fun() ->
      +          mnesia:write({foo, 1, 2}),
      +          mnesia:write({foo, 1, 3}),
      +          mnesia:read({foo, 1})
               end,
      -    mnesia:transaction(F).

      This transaction returns the list [{foo,1,3}] if table foo is of type + mnesia:transaction(F).

      This transaction returns the list [{foo,1,3}] if table foo is of type set. However, the list [{foo,1,2}, {foo,1,3}] is returned if the table is of type bag.

      Mnesia tables can never contain duplicates of the same record in the same table. Duplicate records have attributes with the same contents and key.

    3. {disc_copies, NodeList}, where NodeList is a list of the nodes where @@ -378,11 +378,11 @@ table. All records stored in the table must have this name as their first element. record_name defaults to the name of the table. For more information, see -Record Names versus Table Names.

    4. As an example, consider the following record definition:

      -record(funky, {x, y}).

      The following call would create a table that is replicated on two nodes, has an -extra index on attribute y, and is of type bag.

      mnesia:create_table(funky, [{disc_copies, [N1, N2]}, {index, [y]},
      -                            {type, bag}, {attributes, record_info(fields, funky)}]).

      Whereas a call to the following default code values would return a table with a +Record Names versus Table Names.

      As an example, consider the following record definition:

      -record(funky, {x, y}).

      The following call would create a table that is replicated on two nodes, has an +extra index on attribute y, and is of type bag.

      mnesia:create_table(funky, [{disc_copies, [N1, N2]}, {index, [y]},
      +                            {type, bag}, {attributes, record_info(fields, funky)}]).

      Whereas a call to the following default code values would return a table with a RAM copy on the local node, no extra indexes, and the attributes defaulted to -the list [key,val].

      mnesia:create_table(stuff, [])
      +the list [key,val].

      mnesia:create_table(stuff, [])
      @@ -433,7 +433,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_chap4.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1020)) --- old//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_chap4.html 2026-06-04 19:05:12.662545117 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_chap4.html 2026-06-04 19:05:12.662545117 +0000 @@ -145,14 +145,14 @@ and delete Mnesia records. The Fun is evaluated as a transaction that either commits or terminates. If a transaction succeeds in executing the Fun, it replicates the action on all nodes involved, or terminates if an error occurs.

      The following example shows a transaction that raises the salary of certain -employee numbers:

      raise(Eno, Raise) ->
      -    F = fun() ->
      -                [E] = mnesia:read(employee, Eno, write),
      +employee numbers:

      raise(Eno, Raise) ->
      +    F = fun() ->
      +                [E] = mnesia:read(employee, Eno, write),
                       Salary = E#employee.salary + Raise,
      -                New = E#employee{salary = Salary},
      -                mnesia:write(New)
      +                New = E#employee{salary = Salary},
      +                mnesia:write(New)
               end,
      -    mnesia:transaction(F).

      The function raise/2 contains a Fun made up of four code lines. This Fun is + mnesia:transaction(F).

      The function raise/2 contains a Fun made up of four code lines. This Fun is called by the statement mnesia:transaction(F) and returns a value.

      The Mnesia transaction system facilitates the construction of reliable, distributed systems by providing the following important properties:

      • The transaction handler ensures that a Fun, which is placed inside a transaction, does not interfere with operations embedded in other transactions @@ -246,15 +246,15 @@ The Fun in the transaction is evaluated once more.

        It is therefore important that the code inside the Fun given to mnesia:transaction/1 is pure. Some strange results can occur if, for example, messages are sent by the transaction Fun. The following example illustrates this -situation:

        bad_raise(Eno, Raise) ->
        -    F = fun() ->
        -                [E] = mnesia:read({employee, Eno}),
        +situation:

        bad_raise(Eno, Raise) ->
        +    F = fun() ->
        +                [E] = mnesia:read({employee, Eno}),
                         Salary = E#employee.salary + Raise,
        -                New = E#employee{salary = Salary},
        -                io:format("Trying to write ... ~n", []),
        -                mnesia:write(New)
        +                New = E#employee{salary = Salary},
        +                io:format("Trying to write ... ~n", []),
        +                mnesia:write(New)
                 end,
        -    mnesia:transaction(F).

        This transaction can write the text "Trying to write ... " 1000 times to the + mnesia:transaction(F).

        This transaction can write the text "Trying to write ... " 1000 times to the terminal. However, Mnesia guarantees that each transaction will eventually run. As a result, Mnesia is not only deadlock free, but also livelock free.

        The Mnesia programmer cannot prioritize one particular transaction to execute before other transactions that are waiting to execute. As a result, the Mnesia @@ -301,13 +301,13 @@ fails. Such applications can benefit from using sticky locks instead of the normal locking scheme.

        A sticky lock is a lock that stays in place at a node, after the transaction that first acquired the lock has terminated. To illustrate this, assume that the -following transaction is executed:

        F = fun() ->
        -      mnesia:write(#foo{a = kalle})
        +following transaction is executed:

        F = fun() ->
        +      mnesia:write(#foo{a = kalle})
             end,
        -mnesia:transaction(F).

        The foo table is replicated on the two nodes N1 and N2.

        Normal locking requires the following:

        • One network RPC (two messages) to acquire the write lock
        • Three network messages to execute the two-phase commit protocol

        If sticky locks are used, the code must first be changed as follows:

        F = fun() ->
        -      mnesia:s_write(#foo{a = kalle})
        +mnesia:transaction(F).

        The foo table is replicated on the two nodes N1 and N2.

        Normal locking requires the following:

        • One network RPC (two messages) to acquire the write lock
        • Three network messages to execute the two-phase commit protocol

        If sticky locks are used, the code must first be changed as follows:

        F = fun() ->
        +      mnesia:s_write(#foo{a = kalle})
             end,
        -mnesia:transaction(F).

        This code uses the function s_write/1 instead of the +mnesia:transaction(F).

        This code uses the function s_write/1 instead of the function write/1 The function s_write/1 sets a sticky lock instead of a normal lock. If the table is not replicated, sticky locks have no special effect. If the table is replicated, and a sticky lock is set on node @@ -333,8 +333,8 @@ following two functions are used to set explicit table locks for read and write operations:

        Alternative syntax for acquisition of table locks is as follows:

        mnesia:lock({table, Tab}, read)
        -mnesia:lock({table, Tab}, write)

        The matching operations in Mnesia can either lock the entire table or only a +on table Tab.

      Alternative syntax for acquisition of table locks is as follows:

      mnesia:lock({table, Tab}, read)
      +mnesia:lock({table, Tab}, write)

      The matching operations in Mnesia can either lock the entire table or only a single record (when the key is bound in the pattern).

      @@ -425,78 +425,78 @@ necessarily have to be the same as the table name, although this is the case in most of the examples in this User's Guide. If a table is created without property record_name, the following code ensures that all records in the -tables have the same name as the table:

      mnesia:create_table(subscriber, [])

      However, if the table is created with an explicit record name as argument, as +tables have the same name as the table:

      mnesia:create_table(subscriber, [])

      However, if the table is created with an explicit record name as argument, as shown in the following example, subscriber records can be stored in both of the -tables regardless of the table names:

      TabDef = [{record_name, subscriber}],
      -mnesia:create_table(my_subscriber, TabDef),
      -mnesia:create_table(your_subscriber, TabDef).

      To access such tables, simplified access functions (as described earlier) cannot +tables regardless of the table names:

      TabDef = [{record_name, subscriber}],
      +mnesia:create_table(my_subscriber, TabDef),
      +mnesia:create_table(your_subscriber, TabDef).

      To access such tables, simplified access functions (as described earlier) cannot be used. For example, writing a subscriber record into a table requires the function mnesia:write/3 instead of the simplified functions mnesia:write/1 -and mnesia:s_write/1:

      mnesia:write(subscriber, #subscriber{}, write)
      -mnesia:write(my_subscriber, #subscriber{}, sticky_write)
      -mnesia:write(your_subscriber, #subscriber{}, write)

      The following simple code illustrates the relationship between the simplified +and mnesia:s_write/1:

      mnesia:write(subscriber, #subscriber{}, write)
      +mnesia:write(my_subscriber, #subscriber{}, sticky_write)
      +mnesia:write(your_subscriber, #subscriber{}, write)

      The following simple code illustrates the relationship between the simplified access functions used in most of the examples and their more flexible -counterparts:

      mnesia:dirty_write(Record) ->
      -  Tab = element(1, Record),
      -  mnesia:dirty_write(Tab, Record).
      +counterparts:

      mnesia:dirty_write(Record) ->
      +  Tab = element(1, Record),
      +  mnesia:dirty_write(Tab, Record).
       
      -mnesia:dirty_delete({Tab, Key}) ->
      -  mnesia:dirty_delete(Tab, Key).
      +mnesia:dirty_delete({Tab, Key}) ->
      +  mnesia:dirty_delete(Tab, Key).
       
      -mnesia:dirty_delete_object(Record) ->
      -  Tab = element(1, Record),
      -  mnesia:dirty_delete_object(Tab, Record)
      +mnesia:dirty_delete_object(Record) ->
      +  Tab = element(1, Record),
      +  mnesia:dirty_delete_object(Tab, Record)
       
      -mnesia:dirty_update_counter({Tab, Key}, Incr) ->
      -  mnesia:dirty_update_counter(Tab, Key, Incr).
      +mnesia:dirty_update_counter({Tab, Key}, Incr) ->
      +  mnesia:dirty_update_counter(Tab, Key, Incr).
       
      -mnesia:dirty_read({Tab, Key}) ->
      -  Tab = element(1, Record),
      -  mnesia:dirty_read(Tab, Key).
      +mnesia:dirty_read({Tab, Key}) ->
      +  Tab = element(1, Record),
      +  mnesia:dirty_read(Tab, Key).
       
      -mnesia:dirty_match_object(Pattern) ->
      -  Tab = element(1, Pattern),
      -  mnesia:dirty_match_object(Tab, Pattern).
      +mnesia:dirty_match_object(Pattern) ->
      +  Tab = element(1, Pattern),
      +  mnesia:dirty_match_object(Tab, Pattern).
       
      -mnesia:dirty_index_match_object(Pattern, Attr)
      -  Tab = element(1, Pattern),
      -  mnesia:dirty_index_match_object(Tab, Pattern, Attr).
      +mnesia:dirty_index_match_object(Pattern, Attr)
      +  Tab = element(1, Pattern),
      +  mnesia:dirty_index_match_object(Tab, Pattern, Attr).
       
      -mnesia:write(Record) ->
      -  Tab = element(1, Record),
      -  mnesia:write(Tab, Record, write).
      +mnesia:write(Record) ->
      +  Tab = element(1, Record),
      +  mnesia:write(Tab, Record, write).
       
      -mnesia:s_write(Record) ->
      -  Tab = element(1, Record),
      -  mnesia:write(Tab, Record, sticky_write).
      +mnesia:s_write(Record) ->
      +  Tab = element(1, Record),
      +  mnesia:write(Tab, Record, sticky_write).
       
      -mnesia:delete({Tab, Key}) ->
      -  mnesia:delete(Tab, Key, write).
      +mnesia:delete({Tab, Key}) ->
      +  mnesia:delete(Tab, Key, write).
       
      -mnesia:s_delete({Tab, Key}) ->
      -  mnesia:delete(Tab, Key, sticky_write).
      +mnesia:s_delete({Tab, Key}) ->
      +  mnesia:delete(Tab, Key, sticky_write).
       
      -mnesia:delete_object(Record) ->
      -  Tab = element(1, Record),
      -  mnesia:delete_object(Tab, Record, write).
      +mnesia:delete_object(Record) ->
      +  Tab = element(1, Record),
      +  mnesia:delete_object(Tab, Record, write).
       
      -mnesia:s_delete_object(Record) ->
      -  Tab = element(1, Record),
      -  mnesia:delete_object(Tab, Record, sticky_write).
      +mnesia:s_delete_object(Record) ->
      +  Tab = element(1, Record),
      +  mnesia:delete_object(Tab, Record, sticky_write).
       
      -mnesia:read({Tab, Key}) ->
      -  mnesia:read(Tab, Key, read).
      +mnesia:read({Tab, Key}) ->
      +  mnesia:read(Tab, Key, read).
       
      -mnesia:wread({Tab, Key}) ->
      -  mnesia:read(Tab, Key, write).
      +mnesia:wread({Tab, Key}) ->
      +  mnesia:read(Tab, Key, write).
       
      -mnesia:match_object(Pattern) ->
      -  Tab = element(1, Pattern),
      -  mnesia:match_object(Tab, Pattern, read).
      +mnesia:match_object(Pattern) ->
      +  Tab = element(1, Pattern),
      +  mnesia:match_object(Tab, Pattern, read).
       
      -mnesia:index_match_object(Pattern, Attr) ->
      -  Tab = element(1, Pattern),
      /usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_chap5.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1275))
      --- old//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_chap5.html	2026-06-04 19:05:12.694545413 +0000
      +++ new//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_chap5.html	2026-06-04 19:05:12.694545413 +0000
      @@ -167,9 +167,9 @@
       whether the data resides on the local node or on a remote node.

      Notice that the program runs slower if the data is located on a remote node.

    5. The database can be reconfigured, and tables can be moved between nodes. These operations do not affect the user programs.

    6. It has previously been shown that each table has a number of system attributes, such as index and type.

      Table attributes are specified when the table is created. For example, the -following function creates a table with two RAM replicas:

      mnesia:create_table(foo,
      -                    [{ram_copies, [N1, N2]},
      -                     {attributes, record_info(fields, foo)}]).

      Tables can also have the following properties, where each attribute has a list +following function creates a table with two RAM replicas:

      mnesia:create_table(foo,
      +                    [{ram_copies, [N1, N2]},
      +                     {attributes, record_info(fields, foo)}]).

      Tables can also have the following properties, where each attribute has a list of Erlang nodes as its value:

      • ram_copies. The value of the node list is a list of Erlang nodes, and a RAM replica of the table resides on each node in the list.

        Notice that no disc operations are performed when a program executes write operations to these replicas. However, if permanent RAM replicas are required, @@ -222,52 +222,52 @@ searched for matching records.

        Notice that in ordered_set tables, the records are ordered per fragment, and the order is undefined in results returned by select and match_object, as well as first, next, prev and last.

        The following code illustrates how a Mnesia table is converted to be a -fragmented table and how more fragments are added later:

        Eshell V4.7.3.3  (abort with ^G)
        -(a@sam)1> mnesia:start().
        +fragmented table and how more fragments are added later:

        Eshell V4.7.3.3  (abort with ^G)
        +(a@sam)1> mnesia:start().
         ok
        -(a@sam)2> mnesia:system_info(running_db_nodes).
        -[b@sam,c@sam,a@sam]
        +(a@sam)2> mnesia:system_info(running_db_nodes).
        +[b@sam,c@sam,a@sam]
         (a@sam)3> Tab = dictionary.
         dictionary
        -(a@sam)4> mnesia:create_table(Tab, [{ram_copies, [a@sam, b@sam]}]).
        -{atomic,ok}
        -(a@sam)5> Write = fun(Keys) -> [mnesia:write({Tab,K,-K}) || K <- Keys], ok end.
        +(a@sam)4> mnesia:create_table(Tab, [{ram_copies, [a@sam, b@sam]}]).
        +{atomic,ok}
        +(a@sam)5> Write = fun(Keys) -> [mnesia:write({Tab,K,-K}) || K <- Keys], ok end.
         #Fun<erl_eval>
        -(a@sam)6> mnesia:activity(sync_dirty, Write, [lists:seq(1, 256)], mnesia_frag).
        +(a@sam)6> mnesia:activity(sync_dirty, Write, [lists:seq(1, 256)], mnesia_frag).
         ok
        -(a@sam)7> mnesia:change_table_frag(Tab, {activate, []}).
        -{atomic,ok}
        -(a@sam)8> mnesia:table_info(Tab, frag_properties).
        -[{base_table,dictionary},
        - {foreign_key,undefined},
        - {n_doubles,0},
        - {n_fragments,1},
        - {next_n_to_split,1},
        - {node_pool,[a@sam,b@sam,c@sam]}]
        -(a@sam)9> Info = fun(Item) -> mnesia:table_info(Tab, Item) end.
        +(a@sam)7> mnesia:change_table_frag(Tab, {activate, []}).
        +{atomic,ok}
        +(a@sam)8> mnesia:table_info(Tab, frag_properties).
        +[{base_table,dictionary},
        + {foreign_key,undefined},
        + {n_doubles,0},
        + {n_fragments,1},
        + {next_n_to_split,1},
        + {node_pool,[a@sam,b@sam,c@sam]}]
        +(a@sam)9> Info = fun(Item) -> mnesia:table_info(Tab, Item) end.
         #Fun<erl_eval>
        -(a@sam)10> Dist = mnesia:activity(sync_dirty, Info, [frag_dist], mnesia_frag).
        -[{c@sam,0},{a@sam,1},{b@sam,1}]
        -(a@sam)11> mnesia:change_table_frag(Tab, {add_frag, Dist}).
        -{atomic,ok}
        -(a@sam)12> Dist2 = mnesia:activity(sync_dirty, Info, [frag_dist], mnesia_frag).
        -[{b@sam,1},{c@sam,1},{a@sam,2}]
        -(a@sam)13> mnesia:change_table_frag(Tab, {add_frag, Dist2}).
        -{atomic,ok}
        -(a@sam)14> Dist3 = mnesia:activity(sync_dirty, Info, [frag_dist], mnesia_frag).
        -[{a@sam,2},{b@sam,2},{c@sam,2}]
        -(a@sam)15> mnesia:change_table_frag(Tab, {add_frag, Dist3}).
        -{atomic,ok}
        -(a@sam)16> Read = fun(Key) -> mnesia:read({Tab, Key}) end.
        +(a@sam)10> Dist = mnesia:activity(sync_dirty, Info, [frag_dist], mnesia_frag).
        +[{c@sam,0},{a@sam,1},{b@sam,1}]
        +(a@sam)11> mnesia:change_table_frag(Tab, {add_frag, Dist}).
        +{atomic,ok}
        +(a@sam)12> Dist2 = mnesia:activity(sync_dirty, Info, [frag_dist], mnesia_frag).
        +[{b@sam,1},{c@sam,1},{a@sam,2}]
        +(a@sam)13> mnesia:change_table_frag(Tab, {add_frag, Dist2}).
        +{atomic,ok}
        +(a@sam)14> Dist3 = mnesia:activity(sync_dirty, Info, [frag_dist], mnesia_frag).
        +[{a@sam,2},{b@sam,2},{c@sam,2}]
        +(a@sam)15> mnesia:change_table_frag(Tab, {add_frag, Dist3}).
        +{atomic,ok}
        +(a@sam)16> Read = fun(Key) -> mnesia:read({Tab, Key}) end.
         #Fun<erl_eval>
        -(a@sam)17> mnesia:activity(transaction, Read, [12], mnesia_frag).
        -[{dictionary,12,-12}]
        -(a@sam)18> mnesia:activity(sync_dirty, Info, [frag_size], mnesia_frag).
        -[{dictionary,64},
        - {dictionary_frag2,64},
        - {dictionary_frag3,64},
        - {dictionary_frag4,64}]
        -(a@sam)19>

        +(a@sam)17> mnesia:activity(transaction, Read, [12], mnesia_frag). +[{dictionary,12,-12}] +(a@sam)18> mnesia:activity(sync_dirty, Info, [frag_size], mnesia_frag). +[{dictionary,64}, + {dictionary_frag2,64}, + {dictionary_frag3,64}, + {dictionary_frag4,64}] +(a@sam)19>

        @@ -309,64 +309,64 @@ This property can explicitly be set at table creation. Default is mnesia_frag_hash.

      • {hash_state, Term} - Enables a table-specific parameterization of a generic hash module. This property can explicitly be set at table creation. -Default is undefined.

        Eshell V4.7.3.3  (abort with ^G)
        -(a@sam)1> mnesia:start().
        +Default is undefined.

        Eshell V4.7.3.3  (abort with ^G)
        +(a@sam)1> mnesia:start().
         ok
        -(a@sam)2> PrimProps = [{n_fragments, 7}, {node_pool, [node()]}].
        -[{n_fragments,7},{node_pool,[a@sam]}]
        -(a@sam)3> mnesia:create_table(prim_dict,
        -                              [{frag_properties, PrimProps},
        -                               {attributes,[prim_key,prim_val]}]).
        -{atomic,ok}
        -(a@sam)4> SecProps = [{foreign_key, {prim_dict, sec_val}}].
        -[{foreign_key,{prim_dict,sec_val}}]
        -(a@sam)5> mnesia:create_table(sec_dict,
        -                              [{frag_properties, SecProps},
        -(a@sam)5>                      {attributes, [sec_key, sec_val]}]).
        -{atomic,ok}
        -(a@sam)6> Write = fun(Rec) -> mnesia:write(Rec) end.
        +(a@sam)2> PrimProps = [{n_fragments, 7}, {node_pool, [node()]}].
        +[{n_fragments,7},{node_pool,[a@sam]}]
        +(a@sam)3> mnesia:create_table(prim_dict,
        +                              [{frag_properties, PrimProps},
        +                               {attributes,[prim_key,prim_val]}]).
        +{atomic,ok}
        +(a@sam)4> SecProps = [{foreign_key, {prim_dict, sec_val}}].
        +[{foreign_key,{prim_dict,sec_val}}]
        +(a@sam)5> mnesia:create_table(sec_dict,
        +                              [{frag_properties, SecProps},
        +(a@sam)5>                      {attributes, [sec_key, sec_val]}]).
        +{atomic,ok}
        +(a@sam)6> Write = fun(Rec) -> mnesia:write(Rec) end.
         #href_anchor"n">Fun<erl_eval>
         (a@sam)7> PrimKey = 11.
         11
         (a@sam)8> SecKey = 42.
         42
        -(a@sam)9> mnesia:activity(sync_dirty, Write,
        -                          [{prim_dict, PrimKey, -11}], mnesia_frag).
        +(a@sam)9> mnesia:activity(sync_dirty, Write,
        +                          [{prim_dict, PrimKey, -11}], mnesia_frag).
         ok
        -(a@sam)10> mnesia:activity(sync_dirty, Write,
        -                           [{sec_dict, SecKey, PrimKey}], mnesia_frag).
        +(a@sam)10> mnesia:activity(sync_dirty, Write,
        +                           [{sec_dict, SecKey, PrimKey}], mnesia_frag).
         ok
        -(a@sam)11> mnesia:change_table_frag(prim_dict, {add_frag, [node()]}).
        -{atomic,ok}
        -(a@sam)12> SecRead = fun(PrimKey, SecKey) ->
        -               mnesia:read({sec_dict, PrimKey}, SecKey, read) end.
        +(a@sam)11> mnesia:change_table_frag(prim_dict, {add_frag, [node()]}).
        +{atomic,ok}
        +(a@sam)12> SecRead = fun(PrimKey, SecKey) ->
        +               mnesia:read({sec_dict, PrimKey}, SecKey, read) end.
         #Fun<erl_eval>
        -(a@sam)13> mnesia:activity(transaction, SecRead,
        -                           [PrimKey, SecKey], mnesia_frag).
        -[{sec_dict,42,11}]
        -(a@sam)14> Info = fun(Tab, Item) -> mnesia:table_info(Tab, Item) end.
        +(a@sam)13> mnesia:activity(transaction, SecRead,
        +                           [PrimKey, SecKey], mnesia_frag).
        +[{sec_dict,42,11}]
        +(a@sam)14> Info = fun(Tab, Item) -> mnesia:table_info(Tab, Item) end.
         #Fun<erl_eval>
        -(a@sam)15> mnesia:activity(sync_dirty, Info,
        -                           [prim_dict, frag_size], mnesia_frag).
        -[{prim_dict,0},
        - {prim_dict_frag2,0},
        - {prim_dict_frag3,0},
        - {prim_dict_frag4,1},
        - {prim_dict_frag5,0},
        - {prim_dict_frag6,0},
        - {prim_dict_frag7,0},
        - {prim_dict_frag8,0}]
        -(a@sam)16> mnesia:activity(sync_dirty, Info,
        -                           [sec_dict, frag_size], mnesia_frag).
        -[{sec_dict,0},
        - {sec_dict_frag2,0},
        - {sec_dict_frag3,0},
        - {sec_dict_frag4,1},
        - {sec_dict_frag5,0},
        - {sec_dict_frag6,0},
        - {sec_dict_frag7,0},
        - {sec_dict_frag8,0}]
        -(a@sam)17>

      +(a@sam)15> mnesia:activity(sync_dirty, Info, + [prim_dict, frag_size], mnesia_frag). +[{prim_dict,0}, + {prim_dict_frag2,0}, /usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_chap7.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1110)) --- old//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_chap7.html 2026-06-04 19:05:12.718545636 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_chap7.html 2026-06-04 19:05:12.718545636 +0000 @@ -233,26 +233,26 @@ for starting Mnesia:

      • An Erlang session must be started and a Mnesia directory must be specified for the database.
      • A database schema must be initiated, using the function mnesia:create_schema/1.

      The following example shows how these tasks are performed:

      Step 1: Start an Erlang session and specify a Mnesia directory for the -database:

      % erl -sname klacke -mnesia dir '"/ldisc/scratch/klacke"'
      Erlang (BEAM) emulator version 4.9
      +database:

      % erl -sname klacke -mnesia dir '"/ldisc/scratch/klacke"'
      Erlang (BEAM) emulator version 4.9
       
      -Eshell V4.9  (abort with ^G)
      -(klacke@gin)1> mnesia:create_schema([node()]).
      +Eshell V4.9  (abort with ^G)
      +(klacke@gin)1> mnesia:create_schema([node()]).
       ok
      -(klacke@gin)2>
      +(klacke@gin)2>
       ^Z
       Suspended

      Step 2: You can inspect the Mnesia directory to see what files have been created:

      % ls -l /ldisc/scratch/klacke
       -rw-rw-r--   1 klacke   staff       247 Aug 12 15:06 FALLBACK.BUP

      The response shows that the file FALLBACK.BUP has been created. This is called a backup file, and it contains an initial schema. If more than one node in the function mnesia:create_schema/1 had been specified, identical backup files -would have been created on all nodes.

      Step 3: Start Mnesia:

      (klacke@gin)3>mnesia:start( ).
      +would have been created on all nodes.

      Step 3: Start Mnesia:

      (klacke@gin)3>mnesia:start( ).
       ok

      Step 4: You can see the following listing in the Mnesia directory:

      -rw-rw-r--   1 klacke   staff         86 May 26 19:03 LATEST.LOG
       -rw-rw-r--   1 klacke   staff      34507 May 26 19:03 schema.DAT

      The schema in the backup file FALLBACK.BUP has been used to generate the file schema.DAT. Since there are no other disc resident tables than the schema, no other data files were created. The file FALLBACK.BUP was removed after the successful "restoration". You also see some files that are for internal use by -Mnesia.

      Step 5: Create a table:

      (klacke@gin)4> mnesia:create_table(foo,[{disc_copies, [node()]}]).
      -{atomic,ok}

      Step 6: You can see the following listing in the Mnesia directory:

      % ls -l /ldisc/scratch/klacke
      +Mnesia.

      Step 5: Create a table:

      (klacke@gin)4> mnesia:create_table(foo,[{disc_copies, [node()]}]).
      +{atomic,ok}

      Step 6: You can see the following listing in the Mnesia directory:

      % ls -l /ldisc/scratch/klacke
       -rw-rw-r-- 1 klacke staff    86 May 26 19:07 LATEST.LOG
       -rw-rw-r-- 1 klacke staff    94 May 26 19:07 foo.DCD
       -rw-rw-r-- 1 klacke staff  6679 May 26 19:07 schema.DAT

      The file foo.DCD has been created. This file will eventually store all data @@ -296,11 +296,11 @@ the Mnesia data files. For example, dets contains the function dets:traverse/2, which can be used to view the contents of a Mnesia DAT file. However, this can only be done when Mnesia is not running. So, to view -the schema file, do as follows;

      {ok, N} = dets:open_file(schema, [{file, "./schema.DAT"},{repair,false},
      -{keypos, 2}]),
      -F = fun(X) -> io:format("~p~n", [X]), continue end,
      -dets:traverse(N, F),
      -dets:close(N).

      Warning

      The DAT files must always be opened with option {repair, false}. This +the schema file, do as follows;

      {ok, N} = dets:open_file(schema, [{file, "./schema.DAT"},{repair,false},
      +{keypos, 2}]),
      +F = fun(X) -> io:format("~p~n", [X]), continue end,
      +dets:traverse(N, F),
      +dets:close(N).

      Warning

      The DAT files must always be opened with option {repair, false}. This ensures that these files are not automatically repaired. Without this option, the database can become inconsistent, because Mnesia can believe that the files were properly closed. For information about configuration parameter @@ -534,40 +534,40 @@ located first in the backup.

      The schema itself is a table and is possibly included in the backup. Each node where the schema table resides is regarded as a db_node.

      The following example shows how mnesia:traverse_backup can be used to rename a -db_node in a backup file:

      change_node_name(Mod, From, To, Source, Target) ->
      +db_node in a backup file:

      change_node_name(Mod, From, To, Source, Target) ->
           Switch =
      -        fun(Node) when Node == From -> To;
      -           (Node) when Node == To -> throw({error, already_exists});
      -           (Node) -> Node
      +        fun(Node) when Node == From -> To;
      +           (Node) when Node == To -> throw({error, already_exists});
      +           (Node) -> Node
               end,
           Convert =
      -        fun({schema, db_nodes, Nodes}, Acc) ->
      -                {[{schema, db_nodes, lists:map(Switch,Nodes)}], Acc};
      -           ({schema, version, Version}, Acc) ->
      -                {[{schema, version, Version}], Acc};
      -           ({schema, cookie, Cookie}, Acc) ->
      -                {[{schema, cookie, Cookie}], Acc};
      -           ({schema, Tab, CreateList}, Acc) ->
      -                Keys = [ram_copies, disc_copies, disc_only_copies],
      +        fun({schema, db_nodes, Nodes}, Acc) ->
      +                {[{schema, db_nodes, lists:map(Switch,Nodes)}], Acc};
      +           ({schema, version, Version}, Acc) ->
      +                {[{schema, version, Version}], Acc};
      +           ({schema, cookie, Cookie}, Acc) ->
      +                {[{schema, cookie, Cookie}], Acc};
      +           ({schema, Tab, CreateList}, Acc) ->
      +                Keys = [ram_copies, disc_copies, disc_only_copies],
                       OptSwitch =
      -                    fun({Key, Val}) ->
      -                            case lists:member(Key, Keys) of
      -                                true -> {Key, lists:map(Switch, Val)};
      -                                false-> {Key, Val}
      +                    fun({Key, Val}) ->
      +                            case lists:member(Key, Keys) of
      +                                true -> {Key, lists:map(Switch, Val)};
      +                                false-> {Key, Val}
                                   end
                           end,
      -                {[{schema, Tab, lists:map(OptSwitch, CreateList)}], Acc};
      -           (Other, Acc) ->
      -                {[Other], Acc}
      +                {[{schema, Tab, lists:map(OptSwitch, CreateList)}], Acc};
      +           (Other, Acc) ->
      +                {[Other], Acc}
               end,
      -    mnesia:traverse_backup(Source, Mod, Target, Mod, Convert, switched).
      +    mnesia:traverse_backup(Source, Mod, Target, Mod, Convert, switched).
       
      -view(Source, Mod) ->
      -    View = fun(Item, Acc) ->
      -                   io:format("~p.~n",[Item]),
      -                   {[Item], Acc + 1}
      +view(Source, Mod) ->
      +    View = fun(Item, Acc) ->
      +                   io:format("~p.~n",[Item]),
      +                   {[Item], Acc + 1}
                  end,
      -    mnesia:traverse_backup(Source, Mod, dummy, read_only, View, 0).

      + mnesia:traverse_backup(Source, Mod, dummy, read_only, View, 0).

      @@ -710,7 +710,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_chap8.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_chap8.html 2026-06-04 19:05:12.735545794 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_chap8.html 2026-06-04 19:05:12.735545794 +0000 @@ -191,7 +191,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_frag_hash.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (377)) --- old//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_frag_hash.html 2026-06-04 19:05:12.752545951 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_frag_hash.html 2026-06-04 19:05:12.752545951 +0000 @@ -413,7 +413,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_overview.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (386)) --- old//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_overview.html 2026-06-04 19:05:12.768546100 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_overview.html 2026-06-04 19:05:12.770546118 +0000 @@ -243,7 +243,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_registry.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (966)) --- old//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_registry.html 2026-06-04 19:05:12.786546267 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/mnesia_registry.html 2026-06-04 19:05:12.787546276 +0000 @@ -258,8 +258,8 @@

      Warning

      This function is deprecated. Do not use it.

      A wrapper function for mnesia:create_table/2, which creates a table (if there is no existing table) with an appropriate set of attributes. The attributes and TabDef are forwarded to mnesia:create_table/2. For example, if the table -is to reside as disc_only_copies on all nodes, a call looks as follows:

                TabDef = [{{disc_only_copies, node()|nodes()]}],
      -          mnesia_registry:create_table(my_reg, TabDef)
      +is to reside as disc_only_copies on all nodes, a call looks as follows:

                TabDef = [{{disc_only_copies, node()|nodes()]}],
      +          mnesia_registry:create_table(my_reg, TabDef)
      @@ -288,7 +288,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/notes.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (395)) --- old//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/notes.html 2026-06-04 19:05:12.812546508 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/notes.html 2026-06-04 19:05:12.813546517 +0000 @@ -1491,7 +1491,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/search.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/search.html 2026-06-04 19:05:12.831489800 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/mnesia-4.23.2/doc/html/search.html 2026-06-04 19:05:12.831489800 +0000 @@ -145,7 +145,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/404.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/404.html 2026-06-04 19:05:12.846764307 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/404.html 2026-06-04 19:05:12.846764307 +0000 @@ -147,7 +147,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/api-reference.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/api-reference.html 2026-06-04 19:05:12.861546962 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/api-reference.html 2026-06-04 19:05:12.861546962 +0000 @@ -213,7 +213,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/cdv_cmd.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/cdv_cmd.html 2026-06-04 19:05:12.877547111 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/cdv_cmd.html 2026-06-04 19:05:12.877547111 +0000 @@ -182,7 +182,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/crashdump_ug.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (513)) --- old//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/crashdump_ug.html 2026-06-04 19:05:12.896547287 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/crashdump_ug.html 2026-06-04 19:05:12.899547315 +0000 @@ -371,7 +371,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/crashdump_viewer.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/crashdump_viewer.html 2026-06-04 19:05:12.918547491 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/crashdump_viewer.html 2026-06-04 19:05:12.918547491 +0000 @@ -303,7 +303,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/etop.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (657)) --- old//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/etop.html 2026-06-04 19:05:12.936547658 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/etop.html 2026-06-04 19:05:12.936547658 +0000 @@ -434,7 +434,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/etop_ug.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (569)) --- old//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/etop_ug.html 2026-06-04 19:05:12.952547807 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/etop_ug.html 2026-06-04 19:05:12.953547816 +0000 @@ -273,7 +273,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/introduction_ug.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/introduction_ug.html 2026-06-04 19:05:12.969547964 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/introduction_ug.html 2026-06-04 19:05:12.970547974 +0000 @@ -189,7 +189,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/notes.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1381)) --- old//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/notes.html 2026-06-04 19:05:12.992548178 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/notes.html 2026-06-04 19:05:12.992548178 +0000 @@ -1150,7 +1150,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/observer.epub/OEBPS/content.opf differs (XML 1.0 document, ASCII text) --- old//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/observer.epub/OEBPS/content.opf 2026-06-04 00:08:34.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/observer.epub/OEBPS/content.opf 2042-07-06 13:27:59.000000000 +0000 @@ -4,10 +4,10 @@ version="3.0"> observer - 2.16 - urn:uuid:e4d67a4e-24ed-86e9-c23d-3bc952cdde36 + urn:uuid:0def9578-d7f7-6fe3-2928-b6d26704c92d en - 2026-06-04T00:08:34Z + 2042-07-06T13:27:59Z /usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/observer.epub/OEBPS/ttb_ug.xhtml differs (HTML document, ASCII text, with very long lines (1157)) --- old//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/observer.epub/OEBPS/ttb_ug.xhtml 2026-06-04 00:08:34.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/observer.epub/OEBPS/ttb_ug.xhtml 2042-07-06 13:27:59.000000000 +0000 @@ -67,56 +67,56 @@ Tracing Local Node from Erlang Shell

      -

      The following small module is used in the subsequent example:

      -module(m).
      --export([f/0]).
      -f() ->
      +

      The following small module is used in the subsequent example:

      -module(m).
      +-export([f/0]).
      +f() ->
          receive
      -      From when is_pid(From) ->
      -         Now = erlang:now(),
      -         From ! {self(),Now}
      +      From when is_pid(From) ->
      +         Now = erlang:now(),
      +         From ! {self(),Now}
          end.

      The following example shows the basic use of ttb from the Erlang shell. Default options are used both for starting the tracer and for formatting (the custom fetch directory is however provided). This gives a trace log named Node-ttb in the newly created directory, where Node is the node name. The default handler prints the formatted trace messages in the shell:

      (tiger@durin)47> %% First I spawn a process running my test function
      -(tiger@durin)47> Pid = spawn(m,f,[]).
      +(tiger@durin)47> Pid = spawn(m,f,[]).
       <0.125.0>
      -(tiger@durin)48>
      +(tiger@durin)48>
       (tiger@durin)48> %% Then I start a tracer...
      -(tiger@durin)48> ttb:tracer().
      -{ok,[tiger@durin]}
      -(tiger@durin)49>
      +(tiger@durin)48> ttb:tracer().
      +{ok,[tiger@durin]}
      +(tiger@durin)49>
       (tiger@durin)49> %% and activate the new process for tracing
       (tiger@durin)49> %% function calls and sent messages.
      -(tiger@durin)49> ttb:p(Pid,[call,send]).
      -{ok,[{<0.125.0>,[{matched,tiger@durin,1}]}]}
      -(tiger@durin)50>
      +(tiger@durin)49> ttb:p(Pid,[call,send]).
      +{ok,[{<0.125.0>,[{matched,tiger@durin,1}]}]}
      +(tiger@durin)50>
       (tiger@durin)50> %% Here I set a trace pattern on erlang:now/0
       (tiger@durin)50> %% The trace pattern is a simple match spec
       (tiger@durin)50> %% indicating that the return value should be
       (tiger@durin)50> %% traced. Refer to the reference_manual for
       (tiger@durin)50> %% the full list of match spec shortcuts
       (tiger@durin)50> %% available.
      -(tiger@durin)51> ttb:tp(erlang,now,return).
      -{ok,[{matched,tiger@durin,1},{saved,1}]}
      -(tiger@durin)52>
      +(tiger@durin)51> ttb:tp(erlang,now,return).
      +{ok,[{matched,tiger@durin,1},{saved,1}]}
      +(tiger@durin)52>
       (tiger@durin)52> %% I run my test (i.e. send a message to
       (tiger@durin)52> %% my new process)
      -(tiger@durin)52> Pid ! self().
      +(tiger@durin)52> Pid ! self().
       <0.72.0>
      -(tiger@durin)53>
      +(tiger@durin)53>
       (tiger@durin)53> %% And then I have to stop ttb in order to flush
       (tiger@durin)53> %% the trace port buffer
      -(tiger@durin)53> ttb:stop([return, {fetch_dir, "fetch"}]).
      -{stopped, "fetch"}
      -(tiger@durin)54>
      +(tiger@durin)53> ttb:stop([return, {fetch_dir, "fetch"}]).
      +{stopped, "fetch"}
      +(tiger@durin)54>
       (tiger@durin)54> %% Finally I format my trace log
      -(tiger@durin)54> ttb:format("fetch").
      -({<0.125.0>,{m,f,0},tiger@durin}) call erlang:now()
      -({<0.125.0>,{m,f,0},tiger@durin}) returned from erlang:now/0 ->
      -{1031,133451,667611}
      -({<0.125.0>,{m,f,0},tiger@durin}) <0.72.0> !
      -{<0.125.0>,{1031,133451,667611}}
      +(tiger@durin)54> ttb:format("fetch").
      +({<0.125.0>,{m,f,0},tiger@durin}) call erlang:now()
      +({<0.125.0>,{m,f,0},tiger@durin}) returned from erlang:now/0 ->
      +{1031,133451,667611}
      +({<0.125.0>,{m,f,0},tiger@durin}) <0.72.0> !
      +{<0.125.0>,{1031,133451,667611}}
       ok

      @@ -124,65 +124,65 @@ Build Your Own Tool

      The following example shows a simple tool for "debug tracing", that is, tracing -of function calls with return values:

      -module(mydebug).
      --export([start/0,trc/1,stop/0,format/1]).
      --export([print/4]).
      +of function calls with return values:

      -module(mydebug).
      +-export([start/0,trc/1,stop/0,format/1]).
      +-export([print/4]).
       %% Include ms_transform.hrl so that I can use dbg:fun2ms/2 to
       %% generate match specifications.
      --include_lib("stdlib/include/ms_transform.hrl").
      +-include_lib("stdlib/include/ms_transform.hrl").
       %%% -------------Tool API-------------
       %%% ----------------------------------
       %%% Star the "mydebug" tool
      -start() ->
      +start() ->
           %% The options specify that the binary log shall be named
           %% <Node>-debug_log and that the print/4 function in this
           %% module shall be used as format handler
      -    ttb:tracer(all,[{file,"debug_log"},{handler,{{?MODULE,print},0}}]),
      +    ttb:tracer(all,[{file,"debug_log"},{handler,{{?MODULE,print},0}}]),
           %% All processes (existing and new) shall trace function calls
           %% We want trace messages to be sorted upon format, which requires
           %% timestamp flag. The flag is however enabled by default in ttb.
      -    ttb:p(all,call).
      +    ttb:p(all,call).
       
       %%% Set trace pattern on function(s)
      -trc(M) when is_atom(M) ->
      -    trc({M,'_','_'});
      -trc({M,F}) when is_atom(M), is_atom(F) ->
      -    trc({M,F,'_'});
      -trc({M,F,_A}=MFA) when is_atom(M), is_atom(F) ->
      +trc(M) when is_atom(M) ->
      +    trc({M,'_','_'});
      +trc({M,F}) when is_atom(M), is_atom(F) ->
      +    trc({M,F,'_'});
      +trc({M,F,_A}=MFA) when is_atom(M), is_atom(F) ->
           %% This match spec shortcut specifies that return values shall
           %% be traced.
      -    MatchSpec = dbg:fun2ms(fun(_) -> return_trace() end),
      -    ttb:tpl(MFA,MatchSpec).
      +    MatchSpec = dbg:fun2ms(fun(_) -> return_trace() end),
      +    ttb:tpl(MFA,MatchSpec).
       
       %%% Format a binary trace log
      -format(Dir) ->
      -    ttb:format(Dir).
      +format(Dir) ->
      +    ttb:format(Dir).
       
       %%% Stop the "mydebug" tool
      -stop() ->
      -    ttb:stop(return).
      +stop() ->
      +    ttb:stop(return).
       
       %%% --------Internal functions--------
       %%% ----------------------------------
       %%% Format handler
      -print(_Out,end_of_trace,_TI,N) ->
      +print(_Out,end_of_trace,_TI,N) ->
           N;
      -print(Out,Trace,_TI,N) ->
      -    do_print(Out,Trace,N),
      +print(Out,Trace,_TI,N) ->
      +    do_print(Out,Trace,N),
           N+1.
       
      -do_print(Out,{trace_ts,P,call,{M,F,A},Ts},N) ->
      -    io:format(Out,
      +do_print(Out,{trace_ts,P,call,{M,F,A},Ts},N) ->
      +    io:format(Out,
                     "~w: ~w, ~w:~n"
                     "Call      : ~w:~w/~w~n"
                     "Arguments :~p~n~n",
      -              [N,Ts,P,M,F,length(A),A]);
      -do_print(Out,{trace_ts,P,return_from,{M,F,A},R,Ts},N) ->
      -    io:format(Out,
      +              [N,Ts,P,M,F,length(A),A]);
      +do_print(Out,{trace_ts,P,return_from,{M,F,A},R,Ts},N) ->
      +    io:format(Out,
                     "~w: ~w, ~w:~n"
                     "Return from  : ~w:~w/~w~n"
                     "Return value :~p~n~n",
      -              [N,Ts,P,M,F,A,R]).

      To distinguish trace logs produced with this tool from other logs, option file + [N,Ts,P,M,F,A,R]).

      To distinguish trace logs produced with this tool from other logs, option file is used in tracer/2. The logs are therefore fetched to a directory named ttb_upload_debug_log-YYYYMMDD-HHMMSS

      By using option handler when starting the tracer, the information about how to format the file is stored in the trace information file (.ti). This is not @@ -214,9 +214,9 @@

      If the traced node is diskless, ttb must be started from a trace control node with disk access, and option file must be specified to function tracer/2 -with value {local, File}, for example:

      (trace_control@durin)1> ttb:tracer(mynode@diskless,
      -                                   {file,{local,{wrap,"mytrace"}}}).
      -{ok,[mynode@diskless]}

      +with value {local, File}, for example:

      (trace_control@durin)1> ttb:tracer(mynode@diskless,
      +                                   {file,{local,{wrap,"mytrace"}}}).
      +{ok,[mynode@diskless]}

      @@ -236,10 +236,10 @@ Opts as argument.

      The timer is started with ttb:p/2, so any trace patterns must be set up in advance. ttb:start_trace/4 always sets up all patterns before invoking ttb:p/2.

      The following example shows how to set up a trace that is automatically stopped -and formatted after 5 seconds:

      (tiger@durin)1> ttb:start_trace([node()],
      -                                [{erlang, now,[]}],
      -                                {all, call},
      /usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/observer.epub/OEBPS/ttb.xhtml differs (HTML document, ASCII text, with very long lines (518))
      --- old//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/observer.epub/OEBPS/ttb.xhtml	2026-06-04 00:08:34.000000000 +0000
      +++ new//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/observer.epub/OEBPS/ttb.xhtml	2042-07-06 13:27:59.000000000 +0000
      @@ -1787,13 +1787,13 @@
       is "contaminated" with token seq_trace.

      If Flags = all, all possible flags are set.

      The possible values for SeqTraceFlag are available in seq_trace.

      For a description of the match_spec() syntax, see section Match Specifications in Erlang in ERTS, which explains the general match specification "language".

      Note

      The system tracer for sequential tracing is automatically initiated by ttb -when a trace port is started with ttb:tracer/0,1,2.

      An example of how to use function seq_trigger_ms/0,1 follows:

      (tiger@durin)5> ttb:tracer().
      -{ok,[tiger@durin]}
      -(tiger@durin)6> ttb:p(all,call).
      -{ok,{[all],[call]}}
      -(tiger@durin)7> ttb:tp(mod,func,ttb:seq_trigger_ms()).
      -{ok,[{matched,1},{saved,1}]}
      -(tiger@durin)8>

      Whenever mod:func(...) is called after this, token seq_trace is set on the +when a trace port is started with ttb:tracer/0,1,2.

      An example of how to use function seq_trigger_ms/0,1 follows:

      (tiger@durin)5> ttb:tracer().
      +{ok,[tiger@durin]}
      +(tiger@durin)6> ttb:p(all,call).
      +{ok,{[all],[call]}}
      +(tiger@durin)7> ttb:tp(mod,func,ttb:seq_trigger_ms()).
      +{ok,[{matched,1},{saved,1}]}
      +(tiger@durin)8>

      Whenever mod:func(...) is called after this, token seq_trace is set on the executing process.

      @@ -1832,14 +1832,14 @@

      start_trace(Nodes, Patterns, FlagSpec, Opts) -> Result

      This function is a shortcut allowing to start a trace with one command. Each tuple in Patterns is converted to a list, which in turn is passed to -ttb:tpl/2,3,4.

      The call:

      > ttb:start_trace([Node, OtherNode],
      -                  [{mod, foo, []}, {mod, bar, 2}],
      -                  {all, call},
      -                  [{file, File}, {handler,{fun myhandler/4, S}}]).

      is equivalent to:

      > ttb:start_trace([Node, OtherNode],
      -                  [{file, File}, {handler,{fun myhandler/4, S}}]),
      -ttb:tpl(mod, foo, []),
      -ttb:tpl(mod, bar, 2, []),
      -ttb:p(all, call).
      +ttb:tpl/2,3,4.

      The call:

      > ttb:start_trace([Node, OtherNode],
      +                  [{mod, foo, []}, {mod, bar, 2}],
      +                  {all, call},
      +                  [{file, File}, {handler,{fun myhandler/4, S}}]).

      is equivalent to:

      > ttb:start_trace([Node, OtherNode],
      +                  [{file, File}, {handler,{fun myhandler/4, S}}]),
      +ttb:tpl(mod, foo, []),
      +ttb:tpl(mod, bar, 2, []),
      +ttb:p(all, call).
      /usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/observer.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (335)) --- old//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/observer.html 2026-06-04 19:05:13.103549207 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/observer.html 2026-06-04 19:05:13.103549207 +0000 @@ -389,7 +389,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/observer_app.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/observer_app.html 2026-06-04 19:05:13.119549356 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/observer_app.html 2026-06-04 19:05:13.120549365 +0000 @@ -189,7 +189,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/observer_ug.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1006)) --- old//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/observer_ug.html 2026-06-04 19:05:13.138549532 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/observer_ug.html 2026-06-04 19:05:13.138549532 +0000 @@ -335,7 +335,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/search.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/search.html 2026-06-04 19:05:13.154589563 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/search.html 2026-06-04 19:05:13.154589563 +0000 @@ -145,7 +145,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/ttb.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (527)) --- old//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/ttb.html 2026-06-04 19:05:13.186549977 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/ttb.html 2026-06-04 19:05:13.186549977 +0000 @@ -1908,13 +1908,13 @@ is "contaminated" with token seq_trace.

      If Flags = all, all possible flags are set.

      The possible values for SeqTraceFlag are available in seq_trace.

      For a description of the match_spec() syntax, see section Match Specifications in Erlang in ERTS, which explains the general match specification "language".

      Note

      The system tracer for sequential tracing is automatically initiated by ttb -when a trace port is started with ttb:tracer/0,1,2.

      An example of how to use function seq_trigger_ms/0,1 follows:

      (tiger@durin)5> ttb:tracer().
      -{ok,[tiger@durin]}
      -(tiger@durin)6> ttb:p(all,call).
      -{ok,{[all],[call]}}
      -(tiger@durin)7> ttb:tp(mod,func,ttb:seq_trigger_ms()).
      -{ok,[{matched,1},{saved,1}]}
      -(tiger@durin)8>

      Whenever mod:func(...) is called after this, token seq_trace is set on the +when a trace port is started with ttb:tracer/0,1,2.

      An example of how to use function seq_trigger_ms/0,1 follows:

      (tiger@durin)5> ttb:tracer().
      +{ok,[tiger@durin]}
      +(tiger@durin)6> ttb:p(all,call).
      +{ok,{[all],[call]}}
      +(tiger@durin)7> ttb:tp(mod,func,ttb:seq_trigger_ms()).
      +{ok,[{matched,1},{saved,1}]}
      +(tiger@durin)8>

      Whenever mod:func(...) is called after this, token seq_trace is set on the executing process.

      @@ -1953,14 +1953,14 @@

      start_trace(Nodes, Patterns, FlagSpec, Opts) -> Result

      This function is a shortcut allowing to start a trace with one command. Each tuple in Patterns is converted to a list, which in turn is passed to -ttb:tpl/2,3,4.

      The call:

      > ttb:start_trace([Node, OtherNode],
      -                  [{mod, foo, []}, {mod, bar, 2}],
      -                  {all, call},
      -                  [{file, File}, {handler,{fun myhandler/4, S}}]).

      is equivalent to:

      > ttb:start_trace([Node, OtherNode],
      -                  [{file, File}, {handler,{fun myhandler/4, S}}]),
      -ttb:tpl(mod, foo, []),
      -ttb:tpl(mod, bar, 2, []),
      -ttb:p(all, call).
      +ttb:tpl/2,3,4.

      The call:

      > ttb:start_trace([Node, OtherNode],
      +                  [{mod, foo, []}, {mod, bar, 2}],
      +                  {all, call},
      +                  [{file, File}, {handler,{fun myhandler/4, S}}]).

      is equivalent to:

      > ttb:start_trace([Node, OtherNode],
      +                  [{file, File}, {handler,{fun myhandler/4, S}}]),
      +ttb:tpl(mod, foo, []),
      +ttb:tpl(mod, bar, 2, []),
      +ttb:p(all, call).
      @@ -2532,7 +2532,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/ttb_ug.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1157)) --- old//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/ttb_ug.html 2026-06-04 19:05:13.217550265 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/observer-2.16/doc/html/ttb_ug.html 2026-06-04 19:05:13.216550256 +0000 @@ -172,56 +172,56 @@ Tracing Local Node from Erlang Shell

      -

      The following small module is used in the subsequent example:

      -module(m).
      --export([f/0]).
      -f() ->
      +

      The following small module is used in the subsequent example:

      -module(m).
      +-export([f/0]).
      +f() ->
          receive
      -      From when is_pid(From) ->
      -         Now = erlang:now(),
      -         From ! {self(),Now}
      +      From when is_pid(From) ->
      +         Now = erlang:now(),
      +         From ! {self(),Now}
          end.

      The following example shows the basic use of ttb from the Erlang shell. Default options are used both for starting the tracer and for formatting (the custom fetch directory is however provided). This gives a trace log named Node-ttb in the newly created directory, where Node is the node name. The default handler prints the formatted trace messages in the shell:

      (tiger@durin)47> %% First I spawn a process running my test function
      -(tiger@durin)47> Pid = spawn(m,f,[]).
      +(tiger@durin)47> Pid = spawn(m,f,[]).
       <0.125.0>
      -(tiger@durin)48>
      +(tiger@durin)48>
       (tiger@durin)48> %% Then I start a tracer...
      -(tiger@durin)48> ttb:tracer().
      -{ok,[tiger@durin]}
      -(tiger@durin)49>
      +(tiger@durin)48> ttb:tracer().
      +{ok,[tiger@durin]}
      +(tiger@durin)49>
       (tiger@durin)49> %% and activate the new process for tracing
       (tiger@durin)49> %% function calls and sent messages.
      -(tiger@durin)49> ttb:p(Pid,[call,send]).
      -{ok,[{<0.125.0>,[{matched,tiger@durin,1}]}]}
      -(tiger@durin)50>
      +(tiger@durin)49> ttb:p(Pid,[call,send]).
      +{ok,[{<0.125.0>,[{matched,tiger@durin,1}]}]}
      +(tiger@durin)50>
       (tiger@durin)50> %% Here I set a trace pattern on erlang:now/0
       (tiger@durin)50> %% The trace pattern is a simple match spec
       (tiger@durin)50> %% indicating that the return value should be
       (tiger@durin)50> %% traced. Refer to the reference_manual for
       (tiger@durin)50> %% the full list of match spec shortcuts
       (tiger@durin)50> %% available.
      -(tiger@durin)51> ttb:tp(erlang,now,return).
      -{ok,[{matched,tiger@durin,1},{saved,1}]}
      -(tiger@durin)52>
      +(tiger@durin)51> ttb:tp(erlang,now,return).
      +{ok,[{matched,tiger@durin,1},{saved,1}]}
      +(tiger@durin)52>
       (tiger@durin)52> %% I run my test (i.e. send a message to
       (tiger@durin)52> %% my new process)
      -(tiger@durin)52> Pid ! self().
      +(tiger@durin)52> Pid ! self().
       <0.72.0>
      -(tiger@durin)53>
      +(tiger@durin)53>
       (tiger@durin)53> %% And then I have to stop ttb in order to flush
       (tiger@durin)53> %% the trace port buffer
      -(tiger@durin)53> ttb:stop([return, {fetch_dir, "fetch"}]).
      -{stopped, "fetch"}
      -(tiger@durin)54>
      +(tiger@durin)53> ttb:stop([return, {fetch_dir, "fetch"}]).
      +{stopped, "fetch"}
      +(tiger@durin)54>
       (tiger@durin)54> %% Finally I format my trace log
      -(tiger@durin)54> ttb:format("fetch").
      -({<0.125.0>,{m,f,0},tiger@durin}) call erlang:now()
      -({<0.125.0>,{m,f,0},tiger@durin}) returned from erlang:now/0 ->
      -{1031,133451,667611}
      -({<0.125.0>,{m,f,0},tiger@durin}) <0.72.0> !
      -{<0.125.0>,{1031,133451,667611}}
      +(tiger@durin)54> ttb:format("fetch").
      +({<0.125.0>,{m,f,0},tiger@durin}) call erlang:now()
      +({<0.125.0>,{m,f,0},tiger@durin}) returned from erlang:now/0 ->
      +{1031,133451,667611}
      +({<0.125.0>,{m,f,0},tiger@durin}) <0.72.0> !
      +{<0.125.0>,{1031,133451,667611}}
       ok

      @@ -229,65 +229,65 @@ Build Your Own Tool

      The following example shows a simple tool for "debug tracing", that is, tracing -of function calls with return values:

      -module(mydebug).
      --export([start/0,trc/1,stop/0,format/1]).
      --export([print/4]).
      +of function calls with return values:

      -module(mydebug).
      +-export([start/0,trc/1,stop/0,format/1]).
      +-export([print/4]).
       %% Include ms_transform.hrl so that I can use dbg:fun2ms/2 to
       %% generate match specifications.
      --include_lib("stdlib/include/ms_transform.hrl").
      +-include_lib("stdlib/include/ms_transform.hrl").
       %%% -------------Tool API-------------
       %%% ----------------------------------
       %%% Star the "mydebug" tool
      -start() ->
      +start() ->
           %% The options specify that the binary log shall be named
           %% <Node>-debug_log and that the print/4 function in this
           %% module shall be used as format handler
      -    ttb:tracer(all,[{file,"debug_log"},{handler,{{?MODULE,print},0}}]),
      +    ttb:tracer(all,[{file,"debug_log"},{handler,{{?MODULE,print},0}}]),
           %% All processes (existing and new) shall trace function calls
           %% We want trace messages to be sorted upon format, which requires
           %% timestamp flag. The flag is however enabled by default in ttb.
      -    ttb:p(all,call).
      +    ttb:p(all,call).
       
       %%% Set trace pattern on function(s)
      -trc(M) when is_atom(M) ->
      -    trc({M,'_','_'});
      -trc({M,F}) when is_atom(M), is_atom(F) ->
      -    trc({M,F,'_'});
      -trc({M,F,_A}=MFA) when is_atom(M), is_atom(F) ->
      +trc(M) when is_atom(M) ->
      +    trc({M,'_','_'});
      +trc({M,F}) when is_atom(M), is_atom(F) ->
      +    trc({M,F,'_'});
      +trc({M,F,_A}=MFA) when is_atom(M), is_atom(F) ->
           %% This match spec shortcut specifies that return values shall
           %% be traced.
      -    MatchSpec = dbg:fun2ms(fun(_) -> return_trace() end),
      -    ttb:tpl(MFA,MatchSpec).
      +    MatchSpec = dbg:fun2ms(fun(_) -> return_trace() end),
      +    ttb:tpl(MFA,MatchSpec).
       
       %%% Format a binary trace log
      -format(Dir) ->
      -    ttb:format(Dir).
      +format(Dir) ->
      +    ttb:format(Dir).
       
       %%% Stop the "mydebug" tool
      -stop() ->
      -    ttb:stop(return).
      +stop() ->
      +    ttb:stop(return).
       
       %%% --------Internal functions--------
       %%% ----------------------------------
       %%% Format handler
      -print(_Out,end_of_trace,_TI,N) ->
      +print(_Out,end_of_trace,_TI,N) ->
           N;
      -print(Out,Trace,_TI,N) ->
      -    do_print(Out,Trace,N),
      +print(Out,Trace,_TI,N) ->
      +    do_print(Out,Trace,N),
           N+1.
       
      -do_print(Out,{trace_ts,P,call,{M,F,A},Ts},N) ->
      -    io:format(Out,
      +do_print(Out,{trace_ts,P,call,{M,F,A},Ts},N) ->
      +    io:format(Out,
                     "~w: ~w, ~w:~n"
                     "Call      : ~w:~w/~w~n"
                     "Arguments :~p~n~n",
      -              [N,Ts,P,M,F,length(A),A]);
      -do_print(Out,{trace_ts,P,return_from,{M,F,A},R,Ts},N) ->
      -    io:format(Out,
      +              [N,Ts,P,M,F,length(A),A]);
      +do_print(Out,{trace_ts,P,return_from,{M,F,A},R,Ts},N) ->
      +    io:format(Out,
                     "~w: ~w, ~w:~n"
                     "Return from  : ~w:~w/~w~n"
                     "Return value :~p~n~n",
      -              [N,Ts,P,M,F,A,R]).

      To distinguish trace logs produced with this tool from other logs, option file + [N,Ts,P,M,F,A,R]).

      To distinguish trace logs produced with this tool from other logs, option file is used in tracer/2. The logs are therefore fetched to a directory named ttb_upload_debug_log-YYYYMMDD-HHMMSS

      By using option handler when starting the tracer, the information about how to format the file is stored in the trace information file (.ti). This is not @@ -319,9 +319,9 @@

      If the traced node is diskless, ttb must be started from a trace control node with disk access, and option file must be specified to function tracer/2 -with value {local, File}, for example:

      (trace_control@durin)1> ttb:tracer(mynode@diskless,
      -                                   {file,{local,{wrap,"mytrace"}}}).
      -{ok,[mynode@diskless]}

      +with value {local, File}, for example:

      (trace_control@durin)1> ttb:tracer(mynode@diskless,
      +                                   {file,{local,{wrap,"mytrace"}}}).
      +{ok,[mynode@diskless]}

      @@ -341,10 +341,10 @@ Opts as argument.

      The timer is started with ttb:p/2, so any trace patterns must be set up in advance. ttb:start_trace/4 always sets up all patterns before invoking ttb:p/2.

      The following example shows how to set up a trace that is automatically stopped -and formatted after 5 seconds:

      (tiger@durin)1> ttb:start_trace([node()],
      -                                [{erlang, now,[]}],
      -                                {all, call},
      /usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/404.html differs (HTML document, Unicode text, UTF-8 text)
      --- old//usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/404.html	2026-06-04 19:05:13.232550404 +0000
      +++ new//usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/404.html	2026-06-04 19:05:13.234789495 +0000
      @@ -147,7 +147,7 @@
                 Erlang programming language
       
             

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/api-reference.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/api-reference.html 2026-06-04 19:05:13.249550562 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/api-reference.html 2026-06-04 19:05:13.251550580 +0000 @@ -185,7 +185,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/databases.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (2117)) --- old//usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/databases.html 2026-06-04 19:05:13.273550784 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/databases.html 2026-06-04 19:05:13.273550784 +0000 @@ -272,7 +272,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/error_handling.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/error_handling.html 2026-06-04 19:05:13.288550923 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/error_handling.html 2026-06-04 19:05:13.288550923 +0000 @@ -271,7 +271,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/getting_started.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1738)) --- old//usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/getting_started.html 2026-06-04 19:05:13.311551137 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/getting_started.html 2026-06-04 19:05:13.311551137 +0000 @@ -157,77 +157,77 @@ relevance to anything that exist in reality, it is just a simple example. The example was created using sqlserver 7.0 with servicepack 1 as database and the ODBC driver for sqlserver with version 2000.80.194.00.

       1 > odbc:start().
      -      ok

      Connect to the database

       2 > {ok, Ref} = odbc:connect("DSN=sql-server;UID=aladdin;PWD=sesame", []).
      -      {ok,<0.342.0>}

      Create a table

       3 > odbc:sql_query(Ref, "CREATE TABLE EMPLOYEE (NR integer,
      +      ok

      Connect to the database

       2 > {ok, Ref} = odbc:connect("DSN=sql-server;UID=aladdin;PWD=sesame", []).
      +      {ok,<0.342.0>}

      Create a table

       3 > odbc:sql_query(Ref, "CREATE TABLE EMPLOYEE (NR integer,
             FIRSTNAME  char varying(20), LASTNAME  char varying(20), GENDER char(1),
             PRIMARY KEY(NR))").
             {updated,undefined}

      Insert some data

       4 > odbc:sql_query(Ref, "INSERT INTO EMPLOYEE VALUES(1, 'Jane', 'Doe', 'F')").
             {updated,1}

      Check what data types the database assigned for the columns. Hopefully this is not a surprise, some times it can be! These are the data types that you should -use if you want to do a parameterized query.

       5 > odbc:describe_table(Ref, "EMPLOYEE").
      -      {ok, [{"NR", sql_integer},
      -            {"FIRSTNAME", {sql_varchar, 20}},
      -            {"LASTNAME", {sql_varchar, 20}}
      -            {"GENDER", {sql_char, 1}}]}

      Use a parameterized query to insert many rows in one go.

       6 > odbc:param_query(Ref,"INSERT INTO EMPLOYEE (NR, FIRSTNAME, "
      +use if you want to do a parameterized query.

       5 > odbc:describe_table(Ref, "EMPLOYEE").
      +      {ok, [{"NR", sql_integer},
      +            {"FIRSTNAME", {sql_varchar, 20}},
      +            {"LASTNAME", {sql_varchar, 20}}
      +            {"GENDER", {sql_char, 1}}]}

      Use a parameterized query to insert many rows in one go.

       6 > odbc:param_query(Ref,"INSERT INTO EMPLOYEE (NR, FIRSTNAME, "
                         "LASTNAME, GENDER) VALUES(?, ?, ?, ?)",
      -                   [{sql_integer,[2,3,4,5,6,7,8]},
      -                    {{sql_varchar, 20},
      -                             ["John", "Monica", "Ross", "Rachel",
      -                             "Piper", "Prue", "Louise"]},
      -                   {{sql_varchar, 20},
      -                             ["Doe","Geller","Geller", "Green",
      -                              "Halliwell", "Halliwell", "Lane"]},
      -                   {{sql_char, 1}, ["M","F","M","F","F","F","F"]}]).
      -      {updated, 7}

      Fetch all data in the table employee

       7> odbc:sql_query(Ref, "SELECT * FROM EMPLOYEE").
      -    {selected,["NR","FIRSTNAME","LASTNAME","GENDER"],
      -          [{1,"Jane","Doe","F"},
      -           {2,"John","Doe","M"},
      -           {3,"Monica","Geller","F"},
      -           {4,"Ross","Geller","M"},
      -           {5,"Rachel","Green","F"},
      -           {6,"Piper","Halliwell","F"},
      -           {7,"Prue","Halliwell","F"},
      -           {8,"Louise","Lane","F"}]]}

      Associate a result set containing the whole table EMPLOYEE to the connection. -The number of rows in the result set is returned.

       8 > odbc:select_count(Ref, "SELECT * FROM EMPLOYEE").
      -      {ok,8}

      You can always traverse the result set sequential by using next

       9 > odbc:next(Ref).
      -      {selected,["NR","FIRSTNAME","LASTNAME","GENDER"],[{1,"Jane","Doe","F"}]}
       10 > odbc:next(Ref).
      -      {selected,["NR","FIRSTNAME","LASTNAME","GENDER"],[{2,"John","Doe","M"}]}

      If your driver supports scrollable cursors you have a little more freedom, and -can do things like this.

       11 > odbc:last(Ref).
      -      {selected,["NR","FIRSTNAME","LASTNAME","GENDER"],[{8,"Louise","Lane","F"}]}
       12 > odbc:prev(Ref).
      -      {selected,["NR","FIRSTNAME","LASTNAME","GENDER"],[{7,"Prue","Halliwell","F"}]}
       13 > odbc:first(Ref).
      -      {selected,["NR","FIRSTNAME","LASTNAME","GENDER"],[{1,"Jane","Doe","F"}]}
       14 > odbc:next(Ref).
      -      {selected,["NR","FIRSTNAME","LASTNAME","GENDER"],[{2,"John","Doe","M"}]}

      Fetch the fields FIRSTNAMEand NRfor all female employees

       15 > odbc:sql_query(Ref, "SELECT FIRSTNAME, NR FROM EMPLOYEE WHERE GENDER = &#href_anchor"p" data-group-id="2999355622-1">).
      -     {selected,["FIRSTNAME","NR"],
      -          [{"Jane",1},
      -           {"Monica",3},
      -           {"Rachel",5},
      -           {"Piper",6},
      -           {"Prue",7},
      -           {"Louise",8}]}

      Fetch the fields FIRSTNAMEand NRfor all female employees and sort them on -the field FIRSTNAME.

       16 > odbc:sql_query(Ref, "SELECT FIRSTNAME, NR FROM EMPLOYEE WHERE GENDER = 'F'
      -      ORDER BY FIRSTNAME").
      -    {selected,["FIRSTNAME","NR"],
      -          [{"Jane",1},
      -           {"Louise",8},
      -           {"Monica",3},
      -           {"Piper",6},
      -           {"Prue",7},
      -           {"Rachel",5}]}

      Associate a result set that contains the fields FIRSTNAME and NRfor all + [{sql_integer,[2,3,4,5,6,7,8]}, + {{sql_varchar, 20}, + ["John", "Monica", "Ross", "Rachel", + "Piper", "Prue", "Louise"]}, + {{sql_varchar, 20}, + ["Doe","Geller","Geller", "Green", + "Halliwell", "Halliwell", "Lane"]}, + {{sql_char, 1}, ["M","F","M","F","F","F","F"]}]). + {updated, 7}

      Fetch all data in the table employee

       7> odbc:sql_query(Ref, "SELECT * FROM EMPLOYEE").
      +    {selected,["NR","FIRSTNAME","LASTNAME","GENDER"],
      +          [{1,"Jane","Doe","F"},
      +           {2,"John","Doe","M"},
      +           {3,"Monica","Geller","F"},
      +           {4,"Ross","Geller","M"},
      +           {5,"Rachel","Green","F"},
      +           {6,"Piper","Halliwell","F"},
      +           {7,"Prue","Halliwell","F"},
      +           {8,"Louise","Lane","F"}]]}

      Associate a result set containing the whole table EMPLOYEE to the connection. +The number of rows in the result set is returned.

       8 > odbc:select_count(Ref, "SELECT * FROM EMPLOYEE").
      +      {ok,8}

      You can always traverse the result set sequential by using next

       9 > odbc:next(Ref).
      +      {selected,["NR","FIRSTNAME","LASTNAME","GENDER"],[{1,"Jane","Doe","F"}]}
       10 > odbc:next(Ref).
      +      {selected,["NR","FIRSTNAME","LASTNAME","GENDER"],[{2,"John","Doe","M"}]}

      If your driver supports scrollable cursors you have a little more freedom, and +can do things like this.

       11 > odbc:last(Ref).
      +      {selected,["NR","FIRSTNAME","LASTNAME","GENDER"],[{8,"Louise","Lane","F"}]}
       12 > odbc:prev(Ref).
      +      {selected,["NR","FIRSTNAME","LASTNAME","GENDER"],[{7,"Prue","Halliwell","F"}]}
       13 > odbc:first(Ref).
      +      {selected,["NR","FIRSTNAME","LASTNAME","GENDER"],[{1,"Jane","Doe","F"}]}
       14 > odbc:next(Ref).
      +      {selected,["NR","FIRSTNAME","LASTNAME","GENDER"],[{2,"John","Doe","M"}]}

      Fetch the fields FIRSTNAMEand NRfor all female employees

       15 > odbc:sql_query(Ref, "SELECT FIRSTNAME, NR FROM EMPLOYEE WHERE GENDER = &#href_anchor"p" data-group-id="7263337983-1">).
      +     {selected,["FIRSTNAME","NR"],
      +          [{"Jane",1},
      +           {"Monica",3},
      +           {"Rachel",5},
      +           {"Piper",6},
      +           {"Prue",7},
      +           {"Louise",8}]}

      Fetch the fields FIRSTNAMEand NRfor all female employees and sort them on +the field FIRSTNAME.

       16 > odbc:sql_query(Ref, "SELECT FIRSTNAME, NR FROM EMPLOYEE WHERE GENDER = 'F'
      +      ORDER BY FIRSTNAME").
      +    {selected,["FIRSTNAME","NR"],
      +          [{"Jane",1},
      +           {"Louise",8},
      +           {"Monica",3},
      +           {"Piper",6},
      +           {"Prue",7},
      +           {"Rachel",5}]}

      Associate a result set that contains the fields FIRSTNAME and NRfor all female employees to the connection. The number of rows in the result set is -returned.

       17 > odbc:select_count(Ref, "SELECT FIRSTNAME, NR FROM EMPLOYEE WHERE GENDER = 'F'").
      -      {ok,6}

      A few more ways of retrieving parts of the result set when the driver supports +returned.

       17 > odbc:select_count(Ref, "SELECT FIRSTNAME, NR FROM EMPLOYEE WHERE GENDER = 'F'").
      +      {ok,6}

      A few more ways of retrieving parts of the result set when the driver supports scrollable cursors. Note that next will work even without support for scrollable -cursors.

       18 > odbc:select(Ref, {relative, 2}, 3).
      -    {selected,["FIRSTNAME","NR"],[{"Monica",3},{"Rachel",5},{"Piper",6}]}
       19 > odbc:select(Ref, next, 2).
      -      {selected,["FIRSTNAME","NR"],[{"Prue",7},{"Louise",8}]}
       20 > odbc:select(Ref, {absolute, 1}, 2).
      -      {selected,["FIRSTNAME","NR"],[{"Jane",1},{"Monica",3}]}
       21 > odbc:select(Ref, next, 2).
      -    {selected,["FIRSTNAME","NR"],[{"Rachel",5},{"Piper",6}]}
       22 > odbc:select(Ref, {absolute, 1}, 4).
      -      {selected,["FIRSTNAME","NR"],
      -                [{"Jane",1},{"Monica",3},{"Rachel",5},{"Piper",6}]}

      Select, using a parameterized query.

       23 > odbc:param_query(Ref, "SELECT * FROM EMPLOYEE WHERE GENDER=?",
      -      [{{sql_char, 1}, ["M"]}]).
      -      {selected,["NR","FIRSTNAME","LASTNAME","GENDER"],
      -                [{2,"John", "Doe", "M"},{4,"Ross","Geller","M"}]}

      Delete the table EMPLOYEE.

       24 > odbc:sql_query(Ref, "DROP TABLE EMPLOYEE").
      -      {updated,undefined}

      Shut down the connection.

       25 > odbc:disconnect(Ref).
      +cursors.

       18 > odbc:select(Ref, {relative, 2}, 3).
      +    {selected,["FIRSTNAME","NR"],[{"Monica",3},{"Rachel",5},{"Piper",6}]}
       19 > odbc:select(Ref, next, 2).
      +      {selected,["FIRSTNAME","NR"],[{"Prue",7},{"Louise",8}]}
       20 > odbc:select(Ref, {absolute, 1}, 2).
      +      {selected,["FIRSTNAME","NR"],[{"Jane",1},{"Monica",3}]}
       21 > odbc:select(Ref, next, 2).
      +    {selected,["FIRSTNAME","NR"],[{"Rachel",5},{"Piper",6}]}
       22 > odbc:select(Ref, {absolute, 1}, 4).
      +      {selected,["FIRSTNAME","NR"],
      +                [{"Jane",1},{"Monica",3},{"Rachel",5},{"Piper",6}]}

      Select, using a parameterized query.

       23 > odbc:param_query(Ref, "SELECT * FROM EMPLOYEE WHERE GENDER=?",
      +      [{{sql_char, 1}, ["M"]}]).
      +      {selected,["NR","FIRSTNAME","LASTNAME","GENDER"],
      +                [{2,"John", "Doe", "M"},{4,"Ross","Geller","M"}]}

      Delete the table EMPLOYEE.

       24 > odbc:sql_query(Ref, "DROP TABLE EMPLOYEE").
      +      {updated,undefined}

      Shut down the connection.

       25 > odbc:disconnect(Ref).
             ok

      Shut down the application.

       26 > odbc:stop().
           =INFO REPORT==== 7-Jan-2004::17:00:59 ===
           application: odbc
      @@ -285,7 +285,7 @@
                 Erlang programming language
       
             

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/introduction.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/introduction.html 2026-06-04 19:05:13.330551313 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/introduction.html 2026-06-04 19:05:13.330551313 +0000 @@ -207,7 +207,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/notes.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (436)) --- old//usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/notes.html 2026-06-04 19:05:13.352551517 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/notes.html 2026-06-04 19:05:13.353551526 +0000 @@ -1056,7 +1056,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/odbc.epub/OEBPS/content.opf differs (XML 1.0 document, ASCII text) --- old//usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/odbc.epub/OEBPS/content.opf 2026-06-04 00:08:35.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/odbc.epub/OEBPS/content.opf 2042-07-06 13:28:00.000000000 +0000 @@ -4,10 +4,10 @@ version="3.0"> odbc - 2.15 - urn:uuid:457b8949-d8e2-5186-d59e-6db768f504c8 + urn:uuid:fd34d21a-c29c-e49d-78c5-174049b29ab1 en - 2026-06-04T00:08:35Z + 2042-07-06T13:28:00Z /usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/odbc.epub/OEBPS/getting_started.xhtml differs (HTML document, ASCII text, with very long lines (1738)) --- old//usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/odbc.epub/OEBPS/getting_started.xhtml 2026-06-04 00:08:35.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/odbc.epub/OEBPS/getting_started.xhtml 2042-07-06 13:28:00.000000000 +0000 @@ -52,77 +52,77 @@ relevance to anything that exist in reality, it is just a simple example. The example was created using sqlserver 7.0 with servicepack 1 as database and the ODBC driver for sqlserver with version 2000.80.194.00.

       1 > odbc:start().
      -      ok

      Connect to the database

       2 > {ok, Ref} = odbc:connect("DSN=sql-server;UID=aladdin;PWD=sesame", []).
      -      {ok,<0.342.0>}

      Create a table

       3 > odbc:sql_query(Ref, "CREATE TABLE EMPLOYEE (NR integer,
      +      ok

      Connect to the database

       2 > {ok, Ref} = odbc:connect("DSN=sql-server;UID=aladdin;PWD=sesame", []).
      +      {ok,<0.342.0>}

      Create a table

       3 > odbc:sql_query(Ref, "CREATE TABLE EMPLOYEE (NR integer,
             FIRSTNAME  char varying(20), LASTNAME  char varying(20), GENDER char(1),
             PRIMARY KEY(NR))").
             {updated,undefined}

      Insert some data

       4 > odbc:sql_query(Ref, "INSERT INTO EMPLOYEE VALUES(1, 'Jane', 'Doe', 'F')").
             {updated,1}

      Check what data types the database assigned for the columns. Hopefully this is not a surprise, some times it can be! These are the data types that you should -use if you want to do a parameterized query.

       5 > odbc:describe_table(Ref, "EMPLOYEE").
      -      {ok, [{"NR", sql_integer},
      -            {"FIRSTNAME", {sql_varchar, 20}},
      -            {"LASTNAME", {sql_varchar, 20}}
      -            {"GENDER", {sql_char, 1}}]}

      Use a parameterized query to insert many rows in one go.

       6 > odbc:param_query(Ref,"INSERT INTO EMPLOYEE (NR, FIRSTNAME, "
      +use if you want to do a parameterized query.

       5 > odbc:describe_table(Ref, "EMPLOYEE").
      +      {ok, [{"NR", sql_integer},
      +            {"FIRSTNAME", {sql_varchar, 20}},
      +            {"LASTNAME", {sql_varchar, 20}}
      +            {"GENDER", {sql_char, 1}}]}

      Use a parameterized query to insert many rows in one go.

       6 > odbc:param_query(Ref,"INSERT INTO EMPLOYEE (NR, FIRSTNAME, "
                         "LASTNAME, GENDER) VALUES(?, ?, ?, ?)",
      -                   [{sql_integer,[2,3,4,5,6,7,8]},
      -                    {{sql_varchar, 20},
      -                             ["John", "Monica", "Ross", "Rachel",
      -                             "Piper", "Prue", "Louise"]},
      -                   {{sql_varchar, 20},
      -                             ["Doe","Geller","Geller", "Green",
      -                              "Halliwell", "Halliwell", "Lane"]},
      -                   {{sql_char, 1}, ["M","F","M","F","F","F","F"]}]).
      -      {updated, 7}

      Fetch all data in the table employee

       7> odbc:sql_query(Ref, "SELECT * FROM EMPLOYEE").
      -    {selected,["NR","FIRSTNAME","LASTNAME","GENDER"],
      -          [{1,"Jane","Doe","F"},
      -           {2,"John","Doe","M"},
      -           {3,"Monica","Geller","F"},
      -           {4,"Ross","Geller","M"},
      -           {5,"Rachel","Green","F"},
      -           {6,"Piper","Halliwell","F"},
      -           {7,"Prue","Halliwell","F"},
      -           {8,"Louise","Lane","F"}]]}

      Associate a result set containing the whole table EMPLOYEE to the connection. -The number of rows in the result set is returned.

       8 > odbc:select_count(Ref, "SELECT * FROM EMPLOYEE").
      -      {ok,8}

      You can always traverse the result set sequential by using next

       9 > odbc:next(Ref).
      -      {selected,["NR","FIRSTNAME","LASTNAME","GENDER"],[{1,"Jane","Doe","F"}]}
       10 > odbc:next(Ref).
      -      {selected,["NR","FIRSTNAME","LASTNAME","GENDER"],[{2,"John","Doe","M"}]}

      If your driver supports scrollable cursors you have a little more freedom, and -can do things like this.

       11 > odbc:last(Ref).
      -      {selected,["NR","FIRSTNAME","LASTNAME","GENDER"],[{8,"Louise","Lane","F"}]}
       12 > odbc:prev(Ref).
      -      {selected,["NR","FIRSTNAME","LASTNAME","GENDER"],[{7,"Prue","Halliwell","F"}]}
       13 > odbc:first(Ref).
      -      {selected,["NR","FIRSTNAME","LASTNAME","GENDER"],[{1,"Jane","Doe","F"}]}
       14 > odbc:next(Ref).
      -      {selected,["NR","FIRSTNAME","LASTNAME","GENDER"],[{2,"John","Doe","M"}]}

      Fetch the fields FIRSTNAMEand NRfor all female employees

       15 > odbc:sql_query(Ref, "SELECT FIRSTNAME, NR FROM EMPLOYEE WHERE GENDER = 'F'").
      -     {selected,["FIRSTNAME","NR"],
      -          [{"Jane",1},
      -           {"Monica",3},
      -           {"Rachel",5},
      -           {"Piper",6},
      -           {"Prue",7},
      -           {"Louise",8}]}

      Fetch the fields FIRSTNAMEand NRfor all female employees and sort them on -the field FIRSTNAME.

       16 > odbc:sql_query(Ref, "SELECT FIRSTNAME, NR FROM EMPLOYEE WHERE GENDER = 'F'
      -      ORDER BY FIRSTNAME").
      -    {selected,["FIRSTNAME","NR"],
      -          [{"Jane",1},
      -           {"Louise",8},
      -           {"Monica",3},
      -           {"Piper",6},
      -           {"Prue",7},
      -           {"Rachel",5}]}

      Associate a result set that contains the fields FIRSTNAME and NRfor all + [{sql_integer,[2,3,4,5,6,7,8]}, + {{sql_varchar, 20}, + ["John", "Monica", "Ross", "Rachel", + "Piper", "Prue", "Louise"]}, + {{sql_varchar, 20}, + ["Doe","Geller","Geller", "Green", + "Halliwell", "Halliwell", "Lane"]}, + {{sql_char, 1}, ["M","F","M","F","F","F","F"]}]). + {updated, 7}

      Fetch all data in the table employee

       7> odbc:sql_query(Ref, "SELECT * FROM EMPLOYEE").
      +    {selected,["NR","FIRSTNAME","LASTNAME","GENDER"],
      +          [{1,"Jane","Doe","F"},
      +           {2,"John","Doe","M"},
      +           {3,"Monica","Geller","F"},
      +           {4,"Ross","Geller","M"},
      +           {5,"Rachel","Green","F"},
      +           {6,"Piper","Halliwell","F"},
      +           {7,"Prue","Halliwell","F"},
      +           {8,"Louise","Lane","F"}]]}

      Associate a result set containing the whole table EMPLOYEE to the connection. +The number of rows in the result set is returned.

       8 > odbc:select_count(Ref, "SELECT * FROM EMPLOYEE").
      +      {ok,8}

      You can always traverse the result set sequential by using next

       9 > odbc:next(Ref).
      +      {selected,["NR","FIRSTNAME","LASTNAME","GENDER"],[{1,"Jane","Doe","F"}]}
       10 > odbc:next(Ref).
      +      {selected,["NR","FIRSTNAME","LASTNAME","GENDER"],[{2,"John","Doe","M"}]}

      If your driver supports scrollable cursors you have a little more freedom, and +can do things like this.

       11 > odbc:last(Ref).
      +      {selected,["NR","FIRSTNAME","LASTNAME","GENDER"],[{8,"Louise","Lane","F"}]}
       12 > odbc:prev(Ref).
      +      {selected,["NR","FIRSTNAME","LASTNAME","GENDER"],[{7,"Prue","Halliwell","F"}]}
       13 > odbc:first(Ref).
      +      {selected,["NR","FIRSTNAME","LASTNAME","GENDER"],[{1,"Jane","Doe","F"}]}
       14 > odbc:next(Ref).
      +      {selected,["NR","FIRSTNAME","LASTNAME","GENDER"],[{2,"John","Doe","M"}]}

      Fetch the fields FIRSTNAMEand NRfor all female employees

       15 > odbc:sql_query(Ref, "SELECT FIRSTNAME, NR FROM EMPLOYEE WHERE GENDER = 'F'").
      +     {selected,["FIRSTNAME","NR"],
      +          [{"Jane",1},
      +           {"Monica",3},
      +           {"Rachel",5},
      +           {"Piper",6},
      +           {"Prue",7},
      +           {"Louise",8}]}

      Fetch the fields FIRSTNAMEand NRfor all female employees and sort them on +the field FIRSTNAME.

       16 > odbc:sql_query(Ref, "SELECT FIRSTNAME, NR FROM EMPLOYEE WHERE GENDER = 'F'
      +      ORDER BY FIRSTNAME").
      +    {selected,["FIRSTNAME","NR"],
      +          [{"Jane",1},
      +           {"Louise",8},
      +           {"Monica",3},
      +           {"Piper",6},
      +           {"Prue",7},
      +           {"Rachel",5}]}

      Associate a result set that contains the fields FIRSTNAME and NRfor all female employees to the connection. The number of rows in the result set is -returned.

       17 > odbc:select_count(Ref, "SELECT FIRSTNAME, NR FROM EMPLOYEE WHERE GENDER = 'F'").
      -      {ok,6}

      A few more ways of retrieving parts of the result set when the driver supports +returned.

       17 > odbc:select_count(Ref, "SELECT FIRSTNAME, NR FROM EMPLOYEE WHERE GENDER = 'F'").
      +      {ok,6}

      A few more ways of retrieving parts of the result set when the driver supports scrollable cursors. Note that next will work even without support for scrollable -cursors.

       18 > odbc:select(Ref, {relative, 2}, 3).
      -    {selected,["FIRSTNAME","NR"],[{"Monica",3},{"Rachel",5},{"Piper",6}]}
       19 > odbc:select(Ref, next, 2).
      -      {selected,["FIRSTNAME","NR"],[{"Prue",7},{"Louise",8}]}
       20 > odbc:select(Ref, {absolute, 1}, 2).
      -      {selected,["FIRSTNAME","NR"],[{"Jane",1},{"Monica",3}]}
       21 > odbc:select(Ref, next, 2).
      -    {selected,["FIRSTNAME","NR"],[{"Rachel",5},{"Piper",6}]}
       22 > odbc:select(Ref, {absolute, 1}, 4).
      -      {selected,["FIRSTNAME","NR"],
      -                [{"Jane",1},{"Monica",3},{"Rachel",5},{"Piper",6}]}

      Select, using a parameterized query.

       23 > odbc:param_query(Ref, "SELECT * FROM EMPLOYEE WHERE GENDER=?",
      -      [{{sql_char, 1}, ["M"]}]).
      -      {selected,["NR","FIRSTNAME","LASTNAME","GENDER"],
      -                [{2,"John", "Doe", "M"},{4,"Ross","Geller","M"}]}

      Delete the table EMPLOYEE.

       24 > odbc:sql_query(Ref, "DROP TABLE EMPLOYEE").
      -      {updated,undefined}

      Shut down the connection.

       25 > odbc:disconnect(Ref).
      +cursors.

       18 > odbc:select(Ref, {relative, 2}, 3).
      +    {selected,["FIRSTNAME","NR"],[{"Monica",3},{"Rachel",5},{"Piper",6}]}
       19 > odbc:select(Ref, next, 2).
      +      {selected,["FIRSTNAME","NR"],[{"Prue",7},{"Louise",8}]}
       20 > odbc:select(Ref, {absolute, 1}, 2).
      +      {selected,["FIRSTNAME","NR"],[{"Jane",1},{"Monica",3}]}
       21 > odbc:select(Ref, next, 2).
      +    {selected,["FIRSTNAME","NR"],[{"Rachel",5},{"Piper",6}]}
       22 > odbc:select(Ref, {absolute, 1}, 4).
      +      {selected,["FIRSTNAME","NR"],
      +                [{"Jane",1},{"Monica",3},{"Rachel",5},{"Piper",6}]}

      Select, using a parameterized query.

       23 > odbc:param_query(Ref, "SELECT * FROM EMPLOYEE WHERE GENDER=?",
      +      [{{sql_char, 1}, ["M"]}]).
      +      {selected,["NR","FIRSTNAME","LASTNAME","GENDER"],
      +                [{2,"John", "Doe", "M"},{4,"Ross","Geller","M"}]}

      Delete the table EMPLOYEE.

       24 > odbc:sql_query(Ref, "DROP TABLE EMPLOYEE").
      +      {updated,undefined}

      Shut down the connection.

       25 > odbc:disconnect(Ref).
             ok

      Shut down the application.

       26 > odbc:stop().
           =INFO REPORT==== 7-Jan-2004::17:00:59 ===
           application: odbc
      /usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/odbc.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (336))
      --- old//usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/odbc.html	2026-06-04 19:05:13.446552389 +0000
      +++ new//usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/odbc.html	2026-06-04 19:05:13.446552389 +0000
      @@ -1847,7 +1847,7 @@
                 Erlang programming language
       
             

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/search.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/search.html 2026-06-04 19:05:13.462603310 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/odbc-2.15/doc/html/search.html 2026-06-04 19:05:13.462603310 +0000 @@ -145,7 +145,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/404.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/404.html 2026-06-04 19:05:13.478913467 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/404.html 2026-06-04 19:05:13.478913467 +0000 @@ -147,7 +147,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/api-reference.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/api-reference.html 2026-06-04 19:05:13.495552844 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/api-reference.html 2026-06-04 19:05:13.495552844 +0000 @@ -221,7 +221,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/cpu_sup.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (545)) --- old//usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/cpu_sup.html 2026-06-04 19:05:13.515553029 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/cpu_sup.html 2026-06-04 19:05:13.517553048 +0000 @@ -645,7 +645,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/disksup.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (368)) --- old//usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/disksup.html 2026-06-04 19:05:13.538553242 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/disksup.html 2026-06-04 19:05:13.537553233 +0000 @@ -575,7 +575,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/memsup.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/memsup.html 2026-06-04 19:05:13.557553419 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/memsup.html 2026-06-04 19:05:13.557553419 +0000 @@ -697,7 +697,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/notes.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (457)) --- old//usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/notes.html 2026-06-04 19:05:13.579553623 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/notes.html 2026-06-04 19:05:13.579553623 +0000 @@ -1027,7 +1027,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/nteventlog.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (309)) --- old//usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/nteventlog.html 2026-06-04 19:05:13.599553809 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/nteventlog.html 2026-06-04 19:05:13.599553809 +0000 @@ -341,7 +341,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/os_mon.epub/OEBPS/content.opf differs (XML 1.0 document, ASCII text) --- old//usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/os_mon.epub/OEBPS/content.opf 2026-06-04 00:08:26.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/os_mon.epub/OEBPS/content.opf 2042-07-06 13:27:51.000000000 +0000 @@ -4,10 +4,10 @@ version="3.0"> os_mon - 2.10 - urn:uuid:9abc2af6-6b3f-a6e7-b9c6-e24d3499e702 + urn:uuid:278915ed-c54d-18be-ebdf-ae6268f4b7e4 en - 2026-06-04T00:08:26Z + 2042-07-06T13:27:51Z /usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/os_mon_app.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (610)) --- old//usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/os_mon_app.html 2026-06-04 19:05:13.675554514 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/os_mon_app.html 2026-06-04 19:05:13.676554523 +0000 @@ -207,7 +207,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/os_sup.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (512)) --- old//usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/os_sup.html 2026-06-04 19:05:13.697554717 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/os_sup.html 2026-06-04 19:05:13.697554717 +0000 @@ -422,7 +422,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/search.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/search.html 2026-06-04 19:05:13.713562897 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/os_mon-2.10/doc/html/search.html 2026-06-04 19:05:13.713562897 +0000 @@ -145,7 +145,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/404.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/404.html 2026-06-04 19:05:13.729422300 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/404.html 2026-06-04 19:05:13.729422300 +0000 @@ -147,7 +147,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/api-reference.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/api-reference.html 2026-06-04 19:05:13.743555144 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/api-reference.html 2026-06-04 19:05:13.744555154 +0000 @@ -194,7 +194,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      Missing in old package: /usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/dist/search_data-8BDC4DA6.js Missing in old package: /usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/dist/search_data-8BDC4DA6.js /usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/leex.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (2158)) --- old//usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/leex.html 2026-06-04 19:05:13.767555367 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/leex.html 2026-06-04 19:05:13.767555367 +0000 @@ -173,13 +173,13 @@ next token. Note that pushing back a newline will mean the line numbering will no longer be correct.

      Note

      Pushing back characters gives you unexpected possibilities to cause the scanner to loop!

      The following example would match a simple Erlang integer or float and return a -token which could be sent to the Erlang parser:

      D = [0-9]
      +token which could be sent to the Erlang parser:

      D = [0-9]
       
      -{D}+ :
      -  {token,{integer,TokenLine,list_to_integer(TokenChars)}}.
      +{D}+ :
      +  {token,{integer,TokenLine,list_to_integer(TokenChars)}}.
       
      -{D}+\.{D}+((E|e)(\+|\-)?{D}+)? :
      -  {token,{float,TokenLine,list_to_float(TokenChars)}}.

      The Erlang code in the Erlang code. section is written into the output file +{D}+\.{D}+((E|e)(\+|\-)?{D}+)? : + {token,{float,TokenLine,list_to_float(TokenChars)}}.

      The Erlang code in the Erlang code. section is written into the output file directly after the module declaration and predefined exports declaration, making it possible to add extra exports, define imports, and other attributes, which are visible in the whole file.

      @@ -731,7 +731,7 @@ the token. This is continued until a token has been scanned. Cont is initially [].

      It is not designed to be called directly by an application, but is used through the I/O system where it can typically be called in an -application by:

      io:request(InFile, {get_until,unicode,Prompt,Module,token,[Loc]})
      +application by:

      io:request(InFile, {get_until,unicode,Prompt,Module,token,[Loc]})
         -> TokenRet
      @@ -820,7 +820,7 @@ like Erlang where there is an explicit end token, '.'. If no end token is found then the whole file will be scanned and returned. If an error occurs then all tokens up to and including the next end token will be skipped.

      It is not designed to be called directly by an application, but used through the -I/O system where it can typically be called in an application by:

      io:request(InFile, {get_until,unicode,Prompt,Module,tokens,[Loc]})
      +I/O system where it can typically be called in an application by:

      io:request(InFile, {get_until,unicode,Prompt,Module,tokens,[Loc]})
         -> TokensRet
      @@ -996,7 +996,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/notes.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (762)) --- old//usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/notes.html 2026-06-04 19:05:13.788555562 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/notes.html 2026-06-04 19:05:13.787555552 +0000 @@ -734,7 +734,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/parsetools.epub/OEBPS/content.opf differs (XML 1.0 document, ASCII text) --- old//usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/parsetools.epub/OEBPS/content.opf 2026-06-04 00:07:36.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/parsetools.epub/OEBPS/content.opf 2042-07-06 13:27:04.000000000 +0000 @@ -4,10 +4,10 @@ version="3.0"> parsetools - 2.6 - urn:uuid:de9028ee-25d6-0bbd-a22b-7b064dcbdb58 + urn:uuid:72482fda-c515-25c6-83c1-7d35f99194e9 en - 2026-06-04T00:07:36Z + 2042-07-06T13:27:04Z /usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/parsetools.epub/OEBPS/leex.xhtml differs (HTML document, ASCII text, with very long lines (2158)) --- old//usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/parsetools.epub/OEBPS/leex.xhtml 2026-06-04 00:07:36.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/parsetools.epub/OEBPS/leex.xhtml 2042-07-06 13:27:04.000000000 +0000 @@ -68,13 +68,13 @@ next token. Note that pushing back a newline will mean the line numbering will no longer be correct.

      Note

      Pushing back characters gives you unexpected possibilities to cause the scanner to loop!

      The following example would match a simple Erlang integer or float and return a -token which could be sent to the Erlang parser:

      D = [0-9]
      +token which could be sent to the Erlang parser:

      D = [0-9]
       
      -{D}+ :
      -  {token,{integer,TokenLine,list_to_integer(TokenChars)}}.
      +{D}+ :
      +  {token,{integer,TokenLine,list_to_integer(TokenChars)}}.
       
      -{D}+\.{D}+((E|e)(\+|\-)?{D}+)? :
      -  {token,{float,TokenLine,list_to_float(TokenChars)}}.

      The Erlang code in the Erlang code. section is written into the output file +{D}+\.{D}+((E|e)(\+|\-)?{D}+)? : + {token,{float,TokenLine,list_to_float(TokenChars)}}.

      The Erlang code in the Erlang code. section is written into the output file directly after the module declaration and predefined exports declaration, making it possible to add extra exports, define imports, and other attributes, which are visible in the whole file.

      @@ -610,7 +610,7 @@ the token. This is continued until a token has been scanned. Cont is initially [].

      It is not designed to be called directly by an application, but is used through the I/O system where it can typically be called in an -application by:

      io:request(InFile, {get_until,unicode,Prompt,Module,token,[Loc]})
      +application by:

      io:request(InFile, {get_until,unicode,Prompt,Module,token,[Loc]})
         -> TokenRet
      @@ -699,7 +699,7 @@ like Erlang where there is an explicit end token, '.'. If no end token is found then the whole file will be scanned and returned. If an error occurs then all tokens up to and including the next end token will be skipped.

      It is not designed to be called directly by an application, but used through the -I/O system where it can typically be called in an application by:

      io:request(InFile, {get_until,unicode,Prompt,Module,tokens,[Loc]})
      +I/O system where it can typically be called in an application by:

      io:request(InFile, {get_until,unicode,Prompt,Module,tokens,[Loc]})
         -> TokensRet
      /usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/parsetools.epub/OEBPS/yecc.xhtml differs (HTML document, ASCII text, with very long lines (1506)) --- old//usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/parsetools.epub/OEBPS/yecc.xhtml 2026-06-04 00:07:36.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/parsetools.epub/OEBPS/yecc.xhtml 2042-07-06 13:27:04.000000000 +0000 @@ -57,8 +57,8 @@ distinguished from all the terminal and non-terminal categories of the syntax rules. The Endsymbol can be declared in the grammar file.

      The simplest case is to segment the input string into a list of identifiers (atoms) and use those atoms both as categories and values of the tokens. For -example, the input string aaa bbb 777, X may be scanned (tokenized) as:

      [{aaa, 1}, {bbb, 1}, {777, 1}, {',' , 1}, {'X', 1},
      - {'$end', 1}].

      This assumes that this is the first line of the input text, and that '$end' is +example, the input string aaa bbb 777, X may be scanned (tokenized) as:

      [{aaa, 1}, {bbb, 1}, {777, 1}, {',' , 1}, {'X', 1},
      + {'$end', 1}].

      This assumes that this is the first line of the input text, and that '$end' is the distinguished end_of_input symbol.

      The Erlang scanner in the io module can be used as a starting point when writing a new scanner. Study yeccscan.erl in order to see how a filter can be added on top of io:scan_erl_form/3 to provide a scanner for Yecc that @@ -128,8 +128,8 @@ element -> atom. element -> list.

      This grammar can be used to generate a parser which parses list expressions, such as (), (a), (peter charles), (a (b c) d (())), ... provided that your -scanner tokenizes, for example, the input (peter charles) as follows:

      [{'(', 1} , {atom, 1, peter}, {atom, 1, charles}, {')', 1},
      - {'$end', 1}]

      When a grammar rule is used by the parser to parse (part of) the input string as +scanner tokenizes, for example, the input (peter charles) as follows:

      [{'(', 1} , {atom, 1, peter}, {atom, 1, charles}, {')', 1},
      + {'$end', 1}]

      When a grammar rule is used by the parser to parse (part of) the input string as a grammatical phrase, the associated code is evaluated, and the value of the last expression becomes the value of the parsed phrase. This value may be used by the parser later to build structures that are values of higher phrases of @@ -141,8 +141,8 @@ element -> atom : '$1'. element -> list : '$1'.

      With this code added to the grammar rules, the parser produces the following value (structure) when parsing the input string (a b c).. This still assumes -that this was the first input line that the scanner tokenized:

      {cons, {atom, 1, a}, {cons, {atom, 1, b},
      -                            {cons, {atom, 1, c}, nil}}}

      The associated code contains pseudo variables '$1', '$2', +that this was the first input line that the scanner tokenized:

      {cons, {atom, 1, a}, {cons, {atom, 1, b},
      +                            {cons, {atom, 1, c}, nil}}}

      The associated code contains pseudo variables '$1', '$2', '$3', and so on. which refer to (are bound to) the values associated previously by the parser with the symbols of the right-hand side of the rule. When these symbols are terminal categories, the @@ -165,12 +165,12 @@ Generating a Parser

      -

      To call the parser generator, use the following command:

      yecc:file(Grammarfile).

      An error message from Yecc will be shown if the grammar is not of the LALR type +

      To call the parser generator, use the following command:

      yecc:file(Grammarfile).

      An error message from Yecc will be shown if the grammar is not of the LALR type (for example too ambiguous). Shift/reduce conflicts are resolved in favor of shifting if there are no operator precedence declarations. Refer to the yacc documentation on the use of operator precedence.

      The output file contains Erlang source code for a parser module with module name equal to the Parserfile parameter. After compilation, the parser can be called -as follows (the module name is assumed to be myparser):

      myparser:parse(myscanner:scan(Inport))

      The call format can be different if a customized prologue file has been included +as follows (the module name is assumed to be myparser):

      myparser:parse(myscanner:scan(Inport))

      The call format can be different if a customized prologue file has been included when generating the parser instead of the default file lib/parsetools/include/yeccpre.hrl.

      With the standard prologue, this call will return either {ok, Result}, where Result is a structure that the Erlang code of the grammar file has built, or @@ -179,15 +179,15 @@ the screen. The user will have to do this either by printing the returned error messages, or by inserting tests and print instructions in the Erlang code associated with the syntax rules of the grammar file.

      It is also possible to make the parser ask for more input tokens when needed if -the following call format is used:

      myparser:parse_and_scan({Function, Args})
      -myparser:parse_and_scan({Mod, Tokenizer, Args})

      The tokenizer Function is either a fun or a tuple {Mod, Tokenizer}. The call +the following call format is used:

      myparser:parse_and_scan({Function, Args})
      +myparser:parse_and_scan({Mod, Tokenizer, Args})

      The tokenizer Function is either a fun or a tuple {Mod, Tokenizer}. The call apply(Function, Args) or apply({Mod, Tokenizer}, Args) is executed whenever a new token is needed. This, for example, makes it possible to parse from a file, token by token.

      The tokenizer used above has to be implemented so as to return one of the -following:

      {ok, Tokens, EndPosition}
      -{eof, EndPosition}
      -{error, Error_description, EndPosition}

      This conforms to the format used by the scanner in the Erlang io library +following:

      {ok, Tokens, EndPosition}
      +{eof, EndPosition}
      +{error, Error_description, EndPosition}

      This conforms to the format used by the scanner in the Erlang io library module.

      If {eof, EndPosition} is returned immediately, the call to parse_and_scan/1 returns {ok, eof}. If {eof, EndPosition} is returned before the parser expects end of input, parse_and_scan/1 will, of course, return an error @@ -237,36 +237,36 @@ Endsymbol '$end'. grammar -> declaration : '$1'. grammar -> rule : '$1'. -declaration -> symbol symbols dot: {'$1', '$2'}. -rule -> head '->' symbols attached_code dot: {rule, ['$1' | '$3'], - '$4'}. +declaration -> symbol symbols dot: {'$1', '$2'}. +rule -> head '->' symbols attached_code dot: {rule, ['$1' | '$3'], + '$4'}. head -> symbol : '$1'. -symbols -> symbol : ['$1']. -symbols -> symbol symbols : ['$1' | '$2']. -attached_code -> ':' tokens : {erlang_code, '$2'}. -attached_code -> '$empty' : {erlang_code, - [{atom, 0, '$undefined'}]}. -tokens -> token : ['$1']. -tokens -> token tokens : ['$1' | '$2']. -symbol -> var : value_of('$1'). -symbol -> atom : value_of('$1'). -symbol -> integer : value_of('$1'). -symbol -> reserved_word : value_of('$1'). +symbols -> symbol : ['$1']. +symbols -> symbol symbols : ['$1' | '$2']. +attached_code -> ':' tokens : {erlang_code, '$2'}. +attached_code -> '$empty' : {erlang_code, + [{atom, 0, '$undefined'}]}. +tokens -> token : ['$1']. +tokens -> token tokens : ['$1' | '$2']. +symbol -> var : value_of('$1'). +symbol -> atom : value_of('$1'). +symbol -> integer : value_of('$1'). +symbol -> reserved_word : value_of('$1'). token -> var : '$1'. token -> atom : '$1'. token -> float : '$1'. token -> integer : '$1'. token -> string : '$1'. token -> char : '$1'. -token -> reserved_symbol : {value_of('$1'), line_of('$1')}. -token -> reserved_word : {value_of('$1'), line_of('$1')}. -token -> '->' : {'->', line_of('$1')}. -token -> ':' : {':', line_of('$1')}. +token -> reserved_symbol : {value_of('$1'), line_of('$1')}. +token -> reserved_word : {value_of('$1'), line_of('$1')}. +token -> '->' : {'->', line_of('$1')}. +token -> ':' : {':', line_of('$1')}. Erlang code. -value_of(Token) -> - element(3, Token). -line_of(Token) -> - element(2, Token).

      Note

      The symbols '->', and ':' have to be treated in a special way, as they are +value_of(Token) -> + element(3, Token). +line_of(Token) -> + element(2, Token).

      Note

      The symbols '->', and ':' have to be treated in a special way, as they are meta symbols of the grammar notation, as well as terminal symbols of the Yecc grammar.

      5. The file erl_parse.yrl in the lib/stdlib/src directory contains the grammar for Erlang.

      Note

      Syntactic tests are used in the code associated with some rules, and an error /usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/search.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/search.html 2026-06-04 19:05:13.865912105 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/search.html 2026-06-04 19:05:13.865912105 +0000 @@ -122,7 +122,7 @@

      - + /usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/yecc.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1506)) --- old//usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/yecc.html 2026-06-04 19:05:13.886556471 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/parsetools-2.6/doc/html/yecc.html 2026-06-04 19:05:13.886556471 +0000 @@ -162,8 +162,8 @@ distinguished from all the terminal and non-terminal categories of the syntax rules. The Endsymbol can be declared in the grammar file.

      The simplest case is to segment the input string into a list of identifiers (atoms) and use those atoms both as categories and values of the tokens. For -example, the input string aaa bbb 777, X may be scanned (tokenized) as:

      [{aaa, 1}, {bbb, 1}, {777, 1}, {',' , 1}, {'X', 1},
      - {'$end', 1}].

      This assumes that this is the first line of the input text, and that '$end' is +example, the input string aaa bbb 777, X may be scanned (tokenized) as:

      [{aaa, 1}, {bbb, 1}, {777, 1}, {',' , 1}, {'X', 1},
      + {'$end', 1}].

      This assumes that this is the first line of the input text, and that '$end' is the distinguished end_of_input symbol.

      The Erlang scanner in the io module can be used as a starting point when writing a new scanner. Study yeccscan.erl in order to see how a filter can be added on top of io:scan_erl_form/3 to provide a scanner for Yecc that @@ -233,8 +233,8 @@ element -> atom. element -> list.

      This grammar can be used to generate a parser which parses list expressions, such as (), (a), (peter charles), (a (b c) d (())), ... provided that your -scanner tokenizes, for example, the input (peter charles) as follows:

      [{'(', 1} , {atom, 1, peter}, {atom, 1, charles}, {')', 1},
      - {'$end', 1}]

      When a grammar rule is used by the parser to parse (part of) the input string as +scanner tokenizes, for example, the input (peter charles) as follows:

      [{'(', 1} , {atom, 1, peter}, {atom, 1, charles}, {')', 1},
      + {'$end', 1}]

      When a grammar rule is used by the parser to parse (part of) the input string as a grammatical phrase, the associated code is evaluated, and the value of the last expression becomes the value of the parsed phrase. This value may be used by the parser later to build structures that are values of higher phrases of @@ -246,8 +246,8 @@ element -> atom : '$1'. element -> list : '$1'.

      With this code added to the grammar rules, the parser produces the following value (structure) when parsing the input string (a b c).. This still assumes -that this was the first input line that the scanner tokenized:

      {cons, {atom, 1, a}, {cons, {atom, 1, b},
      -                            {cons, {atom, 1, c}, nil}}}

      The associated code contains pseudo variables '$1', '$2', +that this was the first input line that the scanner tokenized:

      {cons, {atom, 1, a}, {cons, {atom, 1, b},
      +                            {cons, {atom, 1, c}, nil}}}

      The associated code contains pseudo variables '$1', '$2', '$3', and so on. which refer to (are bound to) the values associated previously by the parser with the symbols of the right-hand side of the rule. When these symbols are terminal categories, the @@ -270,12 +270,12 @@ Generating a Parser

      -

      To call the parser generator, use the following command:

      yecc:file(Grammarfile).

      An error message from Yecc will be shown if the grammar is not of the LALR type +

      To call the parser generator, use the following command:

      yecc:file(Grammarfile).

      An error message from Yecc will be shown if the grammar is not of the LALR type (for example too ambiguous). Shift/reduce conflicts are resolved in favor of shifting if there are no operator precedence declarations. Refer to the yacc documentation on the use of operator precedence.

      The output file contains Erlang source code for a parser module with module name equal to the Parserfile parameter. After compilation, the parser can be called -as follows (the module name is assumed to be myparser):

      myparser:parse(myscanner:scan(Inport))

      The call format can be different if a customized prologue file has been included +as follows (the module name is assumed to be myparser):

      myparser:parse(myscanner:scan(Inport))

      The call format can be different if a customized prologue file has been included when generating the parser instead of the default file lib/parsetools/include/yeccpre.hrl.

      With the standard prologue, this call will return either {ok, Result}, where Result is a structure that the Erlang code of the grammar file has built, or @@ -284,15 +284,15 @@ the screen. The user will have to do this either by printing the returned error messages, or by inserting tests and print instructions in the Erlang code associated with the syntax rules of the grammar file.

      It is also possible to make the parser ask for more input tokens when needed if -the following call format is used:

      myparser:parse_and_scan({Function, Args})
      -myparser:parse_and_scan({Mod, Tokenizer, Args})

      The tokenizer Function is either a fun or a tuple {Mod, Tokenizer}. The call +the following call format is used:

      myparser:parse_and_scan({Function, Args})
      +myparser:parse_and_scan({Mod, Tokenizer, Args})

      The tokenizer Function is either a fun or a tuple {Mod, Tokenizer}. The call apply(Function, Args) or apply({Mod, Tokenizer}, Args) is executed whenever a new token is needed. This, for example, makes it possible to parse from a file, token by token.

      The tokenizer used above has to be implemented so as to return one of the -following:

      {ok, Tokens, EndPosition}
      -{eof, EndPosition}
      -{error, Error_description, EndPosition}

      This conforms to the format used by the scanner in the Erlang io library +following:

      {ok, Tokens, EndPosition}
      +{eof, EndPosition}
      +{error, Error_description, EndPosition}

      This conforms to the format used by the scanner in the Erlang io library module.

      If {eof, EndPosition} is returned immediately, the call to parse_and_scan/1 returns {ok, eof}. If {eof, EndPosition} is returned before the parser expects end of input, parse_and_scan/1 will, of course, return an error @@ -342,36 +342,36 @@ Endsymbol '$end'. grammar -> declaration : '$1'. grammar -> rule : '$1'. -declaration -> symbol symbols dot: {'$1', '$2'}. -rule -> head '->' symbols attached_code dot: {rule, ['$1' | '$3'], - '$4'}. +declaration -> symbol symbols dot: {'$1', '$2'}. +rule -> head '->' symbols attached_code dot: {rule, ['$1' | '$3'], + '$4'}. head -> symbol : '$1'. -symbols -> symbol : ['$1']. -symbols -> symbol symbols : ['$1' | '$2']. -attached_code -> ':' tokens : {erlang_code, '$2'}. -attached_code -> '$empty' : {erlang_code, - [{atom, 0, '$undefined'}]}. -tokens -> token : ['$1']. -tokens -> token tokens : ['$1' | '$2']. -symbol -> var : value_of('$1'). -symbol -> atom : value_of('$1'). -symbol -> integer : value_of('$1'). -symbol -> reserved_word : value_of('$1'). +symbols -> symbol : ['$1']. +symbols -> symbol symbols : ['$1' | '$2']. +attached_code -> ':' tokens : {erlang_code, '$2'}. +attached_code -> '$empty' : {erlang_code, + [{atom, 0, '$undefined'}]}. +tokens -> token : ['$1']. +tokens -> token tokens : ['$1' | '$2']. +symbol -> var : value_of('$1'). +symbol -> atom : value_of('$1'). +symbol -> integer : value_of('$1'). +symbol -> reserved_word : value_of('$1'). token -> var : '$1'. token -> atom : '$1'. token -> float : '$1'. token -> integer : '$1'. token -> string : '$1'. token -> char : '$1'. -token -> reserved_symbol : {value_of('$1'), line_of('$1')}. -token -> reserved_word : {value_of('$1'), line_of('$1')}. -token -> '->' : {'->', line_of('$1')}. -token -> ':' : {':', line_of('$1')}. +token -> reserved_symbol : {value_of('$1'), line_of('$1')}. +token -> reserved_word : {value_of('$1'), line_of('$1')}. +token -> '->' : {'->', line_of('$1')}. +token -> ':' : {':', line_of('$1')}. Erlang code. -value_of(Token) -> - element(3, Token). -line_of(Token) -> - element(2, Token).

    Note

    The symbols '->', and ':' have to be treated in a special way, as they are +value_of(Token) -> + element(3, Token). +line_of(Token) -> + element(2, Token).

    Note

    The symbols '->', and ':' have to be treated in a special way, as they are meta symbols of the grammar notation, as well as terminal symbols of the Yecc grammar.

    5. The file erl_parse.yrl in the lib/stdlib/src directory contains the grammar for Erlang.

    Note

    Syntactic tests are used in the code associated with some rules, and an error @@ -889,7 +889,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/404.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/404.html 2026-06-04 19:05:13.904672668 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/404.html 2026-06-04 19:05:13.904672668 +0000 @@ -147,7 +147,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/api-reference.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/api-reference.html 2026-06-04 19:05:13.919556777 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/api-reference.html 2026-06-04 19:05:13.919556777 +0000 @@ -185,7 +185,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/notes.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1583)) --- old//usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/notes.html 2026-06-04 19:05:13.943557000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/notes.html 2026-06-04 19:05:13.943557000 +0000 @@ -1376,7 +1376,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/public_key.epub/OEBPS/content.opf differs (XML 1.0 document, ASCII text) --- old//usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/public_key.epub/OEBPS/content.opf 2026-06-04 00:08:30.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/public_key.epub/OEBPS/content.opf 2042-07-06 13:27:55.000000000 +0000 @@ -4,10 +4,10 @@ version="3.0"> public_key - 1.16.4 - urn:uuid:fb60dc06-f1b8-07d0-1d61-6c3ca6a64ee1 + urn:uuid:b08b4094-7e39-7dea-57d8-d5dd1a136adf en - 2026-06-04T00:08:30Z + 2042-07-06T13:27:55Z /usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/public_key.epub/OEBPS/public_key_records.xhtml differs (HTML document, ASCII text, with very long lines (2715)) --- old//usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/public_key.epub/OEBPS/public_key_records.xhtml 2026-06-04 00:08:30.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/public_key.epub/OEBPS/public_key_records.xhtml 2042-07-06 13:27:55.000000000 +0000 @@ -24,7 +24,7 @@ used to handle public key infrastructure. The scope is to describe the data types of each component, not the semantics. For information on the semantics, refer to the relevant standards and RFCs linked in the sections below.

    Use the following include directive to get access to the records and constant -macros described in the following sections:

     -include_lib("public_key/include/public_key.hrl").

    +macros described in the following sections:

     -include_lib("public_key/include/public_key.hrl").

    @@ -32,48 +32,48 @@

    Common non-standard Erlang data types used to describe the record fields in the following sections and which are not defined in the Public Key -Reference Manual follows here:

    time() = utc_time() | general_time()
    +Reference Manual follows here:

    time() = utc_time() | general_time()
     
    -utc_time()  = {utcTime, "YYMMDDHHMMSSZ"}
    +utc_time()  = {utcTime, "YYMMDDHHMMSSZ"}
     
    -general_time() = {generalTime, "YYYYMMDDHHMMSSZ"}
    +general_time() = {generalTime, "YYYYMMDDHHMMSSZ"}
     
    -general_name() = {rfc822Name, string()} |
    +general_name() = {rfc822Name, string()} |
     
    -                 {dNSName, string()} |
    +                 {dNSName, string()} |
     
    -                 {x400Address, string() |
    +                 {x400Address, string() |
     
    -                 {directoryName, {rdnSequence, [#'AttributeTypeAndValue'{}]}} |
    +                 {directoryName, {rdnSequence, [#'AttributeTypeAndValue'{}]}} |
     
    -                 {ediPartyName, special_string()} |
    +                 {ediPartyName, special_string()} |
     
    -                 {ediPartyName, special_string(), special_string()} |
    +                 {ediPartyName, special_string(), special_string()} |
     
    -                 {uniformResourceIdentifier, string()} |
    +                 {uniformResourceIdentifier, string()} |
     
    -                 {iPAddress, string()} |
    +                 {iPAddress, string()} |
     
    -                 {registeredId, oid()} |
    +                 {registeredId, oid()} |
     
    -                 {otherName, term()}
    +                 {otherName, term()}
     
    -special_string() = {teletexString, string()} |
    +special_string() = {teletexString, string()} |
      
    -                   {printableString, string()} |
    +                   {printableString, string()} |
     
    -                   {universalString, string()} |
    +                   {universalString, string()} |
     
    -                   {utf8String, binary()} |
    +                   {utf8String, binary()} |
     
    -                   {bmpString, string()}
    +                   {bmpString, string()}
     
    -dist_reason() = unused | keyCompromise | cACompromise | affiliationChanged |
    +dist_reason() = unused | keyCompromise | cACompromise | affiliationChanged |
                     cessationOfOperation | certificateHold | privilegeWithdrawn | aACompromise
     
    -OID_macro() = ?OID_name()
    +OID_macro() = ?OID_name()
     
    -OID_name() = atom()

    +OID_name() = atom()

    @@ -81,12 +81,12 @@

    Erlang representation of Rivest-Shamir-Adleman cryptosystem (RSA) -keys follows:

    #'RSAPublicKey'{
    +keys follows:

    #'RSAPublicKey'{
        modulus,       % pos_integer()
        publicExponent % pos_integer()
    -  }.
    +  }.
     
    -#'RSAPrivateKey'{
    +#'RSAPrivateKey'{
        version,         % two-prime | multi
        modulus,         % pos_integer()
        publicExponent,  % pos_integer()
    @@ -97,50 +97,50 @@
        exponent2,       % pos_integer()
        coefficient,     % pos_integer()
        otherPrimeInfos  % [#OtherPrimeInfo{}] | asn1_NOVALUE
    -  }.
    +  }.
     
    -#'OtherPrimeInfo'{
    +#'OtherPrimeInfo'{
        prime,           % pos_integer()
        exponent,        % pos_integer()
        coefficient      % pos_integer()
    -  }.
    +  }.
     
    -#'RSASSA-PSS-params'{
    +#'RSASSA-PSS-params'{
        hashAlgorithm,     % #'HashAlgorithm'{}},
        maskGenAlgorithm,  % #'MaskGenAlgorithm'{}},
        saltLength,        % pos_integer(),
        trailerField,      % pos_integer()
    -  }.
    +  }.
     
    -#'HashAlgorithm'{
    +#'HashAlgorithm'{
        algorithm,  % oid()
        parameters  % defaults to asn1_NOVALUE
    -  }.
    +  }.
     
    -#'MaskGenAlgorithm'{
    +#'MaskGenAlgorithm'{
        algorithm,  % oid()
        parameters, % defaults to asn1_NOVALUE
    -  }.

    + }.

    DSA

    Erlang representation of -Digital Signature Algorithm (DSA) keys

    #'DSAPrivateKey'{
    +Digital Signature Algorithm (DSA) keys

    #'DSAPrivateKey'{
        version,      % pos_integer()
        p,            % pos_integer()
        q,            % pos_integer()
        g,            % pos_integer()
        y,            % pos_integer()
        x             % pos_integer()
    -  }.
    +  }.
     
    -#'Dss-Parms'{
    +#'Dss-Parms'{
        p,         % pos_integer()
        q,         % pos_integer()
        g          % pos_integer()
    -  }.

    + }.

    @@ -151,38 +151,38 @@ and Edwards-Curve Digital Signature Algorithm (EDDSA) where parameters in the private key will be -{namedCurve, ?'id-Ed25519' | ?'id-Ed448'}.

    #'ECPrivateKey'{
    +{namedCurve, ?'id-Ed25519' | ?'id-Ed448'}.

    #'ECPrivateKey'{
        version,       % pos_integer()
        privateKey,    % binary()
        parameters,    % {ecParameters, #'ECParameters'{}} |
                       % {namedCurve, Oid::tuple()} |
                       % {implicitlyCA, 'NULL'}
        publicKey      % bitstring()
    -  }.
    +  }.
     
    -#'ECParameters'{
    +#'ECParameters'{
        version,    % pos_integer()
        fieldID,    % #'FieldID'{}
        curve,      % #'Curve'{}
        base,       % binary()
        order,      % pos_integer()
        cofactor    % pos_integer()
    -  }.
    +  }.
     
    -#'Curve'{
    +#'Curve'{
        a,        % binary()
        b,        % binary()
        seed      % bitstring() - optional
    -  }.
    +  }.
     
    -#'FieldID'{
    +#'FieldID'{
        fieldType,    % oid()
        parameters    % Depending on fieldType
    -  }.
    /usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/public_key.epub/OEBPS/public_key.xhtml differs (HTML document, ASCII text, with very long lines (403))
    --- old//usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/public_key.epub/OEBPS/public_key.xhtml	2026-06-04 00:08:30.000000000 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/public_key.epub/OEBPS/public_key.xhtml	2042-07-06 13:27:55.000000000 +0000
    @@ -3147,22 +3147,22 @@
     or also by the user when the option policy_set is provided to this
     function. The qualifiers convey information about the valid policy and
     is intended as information to end users.

    Available options:

    • {verify_fun, {fun(), UserState::term()} - The fun must be -defined as:

      fun(OtpCert :: #'OTPCertificate'{},
      -    Event :: {bad_cert, Reason :: bad_cert_reason() | {revoked, atom()}} |
      -             {extension, #'Extension'{}},
      -    UserState :: term()) ->
      -  {valid, UserState :: term()} |
      -  {valid_peer, UserState :: term()} |
      -  {fail, Reason :: term()} |
      -  {unknown, UserState :: term()}.

      or as:

      fun(OtpCert :: #'OTPCertificate'{},
      -    DerCert :: der_encoded(),
      -    Event :: {bad_cert, Reason :: bad_cert_reason() | {revoked, atom()}} |
      -             {extension, #'Extension'{}},
      -    UserState :: term()) ->
      -  {valid, UserState :: term()} |
      -  {valid_peer, UserState :: term()} |
      -  {fail, Reason :: term()} |
      -  {unknown, UserState :: term()}.

      The verify callback can have 3 or 4 arguments in case the DER encoded +defined as:

      fun(OtpCert :: #'OTPCertificate'{},
      +    Event :: {bad_cert, Reason :: bad_cert_reason() | {revoked, atom()}} |
      +             {extension, #'Extension'{}},
      +    UserState :: term()) ->
      +  {valid, UserState :: term()} |
      +  {valid_peer, UserState :: term()} |
      +  {fail, Reason :: term()} |
      +  {unknown, UserState :: term()}.

      or as:

      fun(OtpCert :: #'OTPCertificate'{},
      +    DerCert :: der_encoded(),
      +    Event :: {bad_cert, Reason :: bad_cert_reason() | {revoked, atom()}} |
      +             {extension, #'Extension'{}},
      +    UserState :: term()) ->
      +  {valid, UserState :: term()} |
      +  {valid_peer, UserState :: term()} |
      +  {fail, Reason :: term()} |
      +  {unknown, UserState :: term()}.

      The verify callback can have 3 or 4 arguments in case the DER encoded version is needed by the callback.

      If the verify callback fun returns {fail, Reason}, the verification process is immediately stopped. If the verify callback fun returns {valid, UserState}, the verification process is continued. This can be used @@ -3334,9 +3334,9 @@ about hostname verification. The User's Guide and code examples describes this -function more detailed.

      The option funs are described here:

      • match_fun

        fun(ReferenceId::ReferenceId() | FQDN::string(),
        -    PresentedId::{dNSName,string()} | {uniformResourceIdentifier,string() |
        -                 {iPAddress,list(byte())} | {OtherId::atom()|oid(),term()}})

        This function replaces the default host name matching rules. The fun should +function more detailed.

        The option funs are described here:

        • match_fun

          fun(ReferenceId::ReferenceId() | FQDN::string(),
          +    PresentedId::{dNSName,string()} | {uniformResourceIdentifier,string() |
          +                 {iPAddress,list(byte())} | {OtherId::atom()|oid(),term()}})

          This function replaces the default host name matching rules. The fun should return a boolean to tell if the Reference ID and Presented ID matches or not. The match fun can also return a third value, value, the atom default, if the default matching rules shall apply. This makes it possible to augment the @@ -3531,14 +3531,14 @@

          Performs CRL validation. It is intended to be called from the verify fun of -pkix_path_validation/3 .

          Available options:

          • {update_crl, fun()} - The fun has the following type specification:

             fun(#'DistributionPoint'{}, #'CertificateList'{}) ->
            -        #'CertificateList'{}

            The fun uses the information in the distribution point to access the latest +pkix_path_validation/3 .

            Available options:

            • {update_crl, fun()} - The fun has the following type specification:

               fun(#'DistributionPoint'{}, #'CertificateList'{}) ->
              +        #'CertificateList'{}

              The fun uses the information in the distribution point to access the latest possible version of the CRL. If this fun is not specified, Public Key uses the default implementation:

               fun(_DP, CRL) -> CRL end
            • {issuer_fun, {fun(), UserState::term()}} - The fun has the following type -specification:

              fun(#'DistributionPoint'{}, #'CertificateList'{},
              -    {rdnSequence,[#'AttributeTypeAndValue'{}]}, UserState::term()) ->
              -  {ok, #'OTPCertificate'{}, [der_encoded]}

              The fun returns the root certificate and certificate chain that has signed the -CRL.

               fun(DP, CRL, Issuer, UserState) -> {ok, RootCert, CertChain}
            • {undetermined_details, boolean()} - Defaults to false. When revocation +specification:

              fun(#'DistributionPoint'{}, #'CertificateList'{},
              +    {rdnSequence,[#'AttributeTypeAndValue'{}]}, UserState::term()) ->
              +  {ok, #'OTPCertificate'{}, [der_encoded]}

              The fun returns the root certificate and certificate chain that has signed the +CRL.

               fun(DP, CRL, Issuer, UserState) -> {ok, RootCert, CertChain}
            • {undetermined_details, boolean()} - Defaults to false. When revocation status cannot be determined, and this option is set to true, details of why no CRLs where accepted are included in the return value.

            @@ -3876,18 +3876,18 @@ generating an ECDSA key. Note this could fail if Erlang/OTP is compiled with a very old cryptolib.

          • {validity, {From::erlang:timestamp(), To::erlang:timestamp()}} - The validity period of the certificate.

          • {extensions, [#'Extension'{}]} - Extensions to include in the -certificate.

            Default extensions included in CA certificates if not otherwise specified are:

            [#'Extension'{extnID = ?'id-ce-keyUsage',
            -              extnValue = [keyCertSign, cRLSign],
            -              critical = false},
            -#'Extension'{extnID = ?'id-ce-basicConstraints',
            -             extnValue = #'BasicConstraints'{cA = true},
            -             critical = true}]

            Default extensions included in the server peer cert if not otherwise specified -are:

            [#'Extension'{extnID = ?'id-ce-keyUsage',
            -              extnValue = [digitalSignature, keyAgreement],
            -              critical = false},
            -#'Extension'{extnID = ?'id-ce-subjectAltName',
            -             extnValue = [{dNSName, Hostname}],
            -             critical = false}]

            Hostname is the result of calling net_adm:localhost() in the Erlang node where +certificate.

            Default extensions included in CA certificates if not otherwise specified are:

            [#'Extension'{extnID = ?'id-ce-keyUsage',
            +              extnValue = [keyCertSign, cRLSign],
            +              critical = false},
            +#'Extension'{extnID = ?'id-ce-basicConstraints',
            +             extnValue = #'BasicConstraints'{cA = true},
            +             critical = true}]

            Default extensions included in the server peer cert if not otherwise specified +are:

            [#'Extension'{extnID = ?'id-ce-keyUsage',
            +              extnValue = [digitalSignature, keyAgreement],
            +              critical = false},
            +#'Extension'{extnID = ?'id-ce-subjectAltName',
            +             extnValue = [{dNSName, Hostname}],
            +             critical = false}]

            Hostname is the result of calling net_adm:localhost() in the Erlang node where this function is called.

          Note

          Note that the generated certificates and keys does not provide a formally correct PKIX-trust-chain and they cannot be used to achieve real security. This function is provided for testing purposes only.

          /usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/public_key.epub/OEBPS/using_public_key.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (1122)) --- old//usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/public_key.epub/OEBPS/using_public_key.xhtml 2026-06-04 00:08:30.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/public_key.epub/OEBPS/using_public_key.xhtml 2042-07-06 13:27:55.000000000 +0000 @@ -43,30 +43,30 @@ DSA Private Key

    -

    A DSA private key can look as follows:

    Note

    File handling is not done by the Public Key application.

    1> {ok, PemBin} = file:read_file("dsa.pem").
    -{ok,<<"-----BEGIN DSA PRIVATE KEY-----\nMIIBuw"...>>}

    The following PEM file has only one entry, a private DSA key:

    2>[DSAEntry] =  public_key:pem_decode(PemBin).
    -[{'DSAPrivateKey',<<48,130,1,187,2,1,0,2,129,129,0,183,
    +

    A DSA private key can look as follows:

    Note

    File handling is not done by the Public Key application.

    1> {ok, PemBin} = file:read_file("dsa.pem").
    +{ok,<<"-----BEGIN DSA PRIVATE KEY-----\nMIIBuw"...>>}

    The following PEM file has only one entry, a private DSA key:

    2>[DSAEntry] =  public_key:pem_decode(PemBin).
    +[{'DSAPrivateKey',<<48,130,1,187,2,1,0,2,129,129,0,183,
                         179,230,217,37,99,144,157,21,228,204,
                         162,207,61,246,...>>,
    -                    not_encrypted}]
    3> Key = public_key:pem_entry_decode(DSAEntry).
    -#'DSAPrivateKey'{version = 0,
    +                    not_encrypted}]
    3> Key = public_key:pem_entry_decode(DSAEntry).
    +#'DSAPrivateKey'{version = 0,
                      p = 12900045185019966618...6593,
                      q = 1216700114794736143432235288305776850295620488937,
                      g = 10442040227452349332...47213,
                      y = 87256807980030509074...403143,
    -                 x = 510968529856012146351317363807366575075645839654}

    + x = 510968529856012146351317363807366575075645839654}

    RSA Private Key with Password

    -

    An RSA private key encrypted with a password can look as follows:

    1> {ok, PemBin} = file:read_file("rsa.pem").
    -{ok,<<"Bag Attribute"...>>}

    The following PEM file has only one entry, a private RSA key:

    2>[RSAEntry] = public_key:pem_decode(PemBin).
    -[{'RSAPrivateKey',<<224,108,117,203,152,40,15,77,128,126,
    +

    An RSA private key encrypted with a password can look as follows:

    1> {ok, PemBin} = file:read_file("rsa.pem").
    +{ok,<<"Bag Attribute"...>>}

    The following PEM file has only one entry, a private RSA key:

    2>[RSAEntry] = public_key:pem_decode(PemBin).
    +[{'RSAPrivateKey',<<224,108,117,203,152,40,15,77,128,126,
                         221,195,154,249,85,208,202,251,109,
                         119,120,57,29,89,19,9,...>>,
    -                  {"DES-EDE3-CBC",<<"kÙeø¼pµL">>}}]

    In this following example, the password is "abcd1234":

    3> Key = public_key:pem_entry_decode(RSAEntry, "abcd1234").
    -#'RSAPrivateKey'{version = 'two-prime',
    +                  {"DES-EDE3-CBC",<<"kÙeø¼pµL">>}}]

    In this following example, the password is "abcd1234":

    3> Key = public_key:pem_entry_decode(RSAEntry, "abcd1234").
    +#'RSAPrivateKey'{version = 'two-prime',
                      modulus = 1112355156729921663373...2737107,
                      publicExponent = 65537,
                      privateExponent = 58064406231183...2239766033,
    @@ -75,201 +75,201 @@
                      exponent1 = 77928819327425934607...22152984217,
                      exponent2 = 36287623121853605733...20588523793,
                      coefficient = 924840412626098444...41820968343,
    -                 otherPrimeInfos = asn1_NOVALUE}

    + otherPrimeInfos = asn1_NOVALUE}

    X509 Certificates

    -

    The following is an example of X509 certificates:

    1> {ok, PemBin} = file:read_file("cacerts.pem").
    -{ok,<<"-----BEGIN CERTIFICATE-----\nMIIC7jCCAl"...>>}

    The following file includes two certificates:

    2> [CertEntry1, CertEntry2] = public_key:pem_decode(PemBin).
    -[{'Certificate',<<48,130,2,238,48,130,2,87,160,3,2,1,2,2,
    +

    The following is an example of X509 certificates:

    1> {ok, PemBin} = file:read_file("cacerts.pem").
    +{ok,<<"-----BEGIN CERTIFICATE-----\nMIIC7jCCAl"...>>}

    The following file includes two certificates:

    2> [CertEntry1, CertEntry2] = public_key:pem_decode(PemBin).
    +[{'Certificate',<<48,130,2,238,48,130,2,87,160,3,2,1,2,2,
                       9,0,230,145,97,214,191,2,120,150,48,13,
                       ...>>,
    -                not_encrypted},
    - {'Certificate',<<48,130,3,200,48,130,3,49,160,3,2,1,2,2,1,
    +                not_encrypted},
    + {'Certificate',<<48,130,3,200,48,130,3,49,160,3,2,1,2,2,1,
                       1,48,13,6,9,42,134,72,134,247,...>>,
    -                not_encrypted}]

    Certificates can be decoded as usual:

    2> Cert = public_key:pem_entry_decode(CertEntry1).
    -#'Certificate'{
    +                not_encrypted}]

    Certificates can be decoded as usual:

    2> Cert = public_key:pem_entry_decode(CertEntry1).
    +#'Certificate'{
         tbsCertificate =
    -        #'TBSCertificate'{
    +        #'TBSCertificate'{
                 version = v3,serialNumber = 16614168075301976214,
                 signature =
    -                #'AlgorithmIdentifier'{
    -                    algorithm = {1,2,840,113549,1,1,5},
    -                    parameters = <<5,0>>},
    +                #'AlgorithmIdentifier'{
    +                    algorithm = {1,2,840,113549,1,1,5},
    +                    parameters = <<5,0>>},
                 issuer =
    -                {rdnSequence,
    -                    [[#'AttributeTypeAndValue'{
    -                          type = {2,5,4,3},
    -                          value = <<19,8,101,114,108,97,110,103,67,65>>}],
    -                     [#'AttributeTypeAndValue'{
    -                          type = {2,5,4,11},
    -                          value = <<19,10,69,114,108,97,110,103,32,79,84,80>>}],
    -                     [#'AttributeTypeAndValue'{
    -                          type = {2,5,4,10},
    -                          value = <<19,11,69,114,105,99,115,115,111,110,32,65,66>>}],
    -                     [#'AttributeTypeAndValue'{
    -                          type = {2,5,4,7},
    -                          value = <<19,9,83,116,111,99,107,104,111,108,109>>}],
    -                     [#'AttributeTypeAndValue'{
    -                          type = {2,5,4,6},
    -                          value = <<19,2,83,69>>}],
    -                     [#'AttributeTypeAndValue'{
    -                          type = {1,2,840,113549,1,9,1},
    -                          value = <<22,22,112,101,116,101,114,64,101,114,...>>}]]},
    +                {rdnSequence,
    +                    [[#'AttributeTypeAndValue'{
    +                          type = {2,5,4,3},
    +                          value = <<19,8,101,114,108,97,110,103,67,65>>}],
    +                     [#'AttributeTypeAndValue'{
    +                          type = {2,5,4,11},
    +                          value = <<19,10,69,114,108,97,110,103,32,79,84,80>>}],
    +                     [#'AttributeTypeAndValue'{
    +                          type = {2,5,4,10},
    +                          value = <<19,11,69,114,105,99,115,115,111,110,32,65,66>>}],
    +                     [#'AttributeTypeAndValue'{
    +                          type = {2,5,4,7},
    +                          value = <<19,9,83,116,111,99,107,104,111,108,109>>}],
    +                     [#'AttributeTypeAndValue'{
    +                          type = {2,5,4,6},
    +                          value = <<19,2,83,69>>}],
    +                     [#'AttributeTypeAndValue'{
    +                          type = {1,2,840,113549,1,9,1},
    +                          value = <<22,22,112,101,116,101,114,64,101,114,...>>}]]},
                 validity =
    -                #'Validity'{
    -                    notBefore = {utcTime,"080109082929Z"},
    -                    notAfter = {utcTime,"080208082929Z"}},
    +                #'Validity'{
    +                    notBefore = {utcTime,"080109082929Z"},
    +                    notAfter = {utcTime,"080208082929Z"}},
                 subject =
    -                {rdnSequence,
    -                    [[#'AttributeTypeAndValue'{
    -                          type = {2,5,4,3},
    -                          value = <<19,8,101,114,108,97,110,103,67,65>>}],
    -                     [#'AttributeTypeAndValue'{
    -                          type = {2,5,4,11},
    -                          value = <<19,10,69,114,108,97,110,103,32,79,84,80>>}],
    -                     [#'AttributeTypeAndValue'{
    -                          type = {2,5,4,10},
    -                          value = <<19,11,69,114,105,99,115,115,111,110,32,...>>}],
    -                     [#'AttributeTypeAndValue'{
    -                          type = {2,5,4,7},
    -                          value = <<19,9,83,116,111,99,107,104,111,108,...>>}],
    -                     [#'AttributeTypeAndValue'{
    -                          type = {2,5,4,6},
    -                          value = <<19,2,83,69>>}],
    -                     [#'AttributeTypeAndValue'{
    -                          type = {1,2,840,113549,1,9,1},
    -                          value = <<22,22,112,101,116,101,114,64,...>>}]]},
    +                {rdnSequence,
    +                    [[#'AttributeTypeAndValue'{
    +                          type = {2,5,4,3},
    +                          value = <<19,8,101,114,108,97,110,103,67,65>>}],
    +                     [#'AttributeTypeAndValue'{
    +                          type = {2,5,4,11},
    +                          value = <<19,10,69,114,108,97,110,103,32,79,84,80>>}],
    +                     [#'AttributeTypeAndValue'{
    +                          type = {2,5,4,10},
    +                          value = <<19,11,69,114,105,99,115,115,111,110,32,...>>}],
    +                     [#'AttributeTypeAndValue'{
    +                          type = {2,5,4,7},
    +                          value = <<19,9,83,116,111,99,107,104,111,108,...>>}],
    +                     [#'AttributeTypeAndValue'{
    +                          type = {2,5,4,6},
    +                          value = <<19,2,83,69>>}],
    +                     [#'AttributeTypeAndValue'{
    +                          type = {1,2,840,113549,1,9,1},
    +                          value = <<22,22,112,101,116,101,114,64,...>>}]]},
                 subjectPublicKeyInfo =
    -                #'SubjectPublicKeyInfo'{
    +                #'SubjectPublicKeyInfo'{
                         algorithm =
    -                        #'AlgorithmIdentifier'{
    -                            algorithm = {1,2,840,113549,1,1,1},
    -                            parameters = <<5,0>>},
    +                        #'AlgorithmIdentifier'{
    +                            algorithm = {1,2,840,113549,1,1,1},
    +                            parameters = <<5,0>>},
                         subjectPublicKey =
    -                        {0,<<48,129,137,2,129,129,0,203,209,187,77,73,231,90,...>>}},
    +                        {0,<<48,129,137,2,129,129,0,203,209,187,77,73,231,90,...>>}},
                 issuerUniqueID = asn1_NOVALUE,
                 subjectUniqueID = asn1_NOVALUE,
                 extensions =
    -                [#'Extension'{
    -                     extnID = {2,5,29,19},
    +                [#'Extension'{
    +                     extnID = {2,5,29,19},
                          critical = true,
    -                     extnValue = [48,3,1,1,255]},
    -                 #'Extension'{
    -                     extnID = {2,5,29,15},
    +                     extnValue = [48,3,1,1,255]},
    +                 #'Extension'{
    +                     extnID = {2,5,29,15},
                          critical = false,
    -                     extnValue = [3,2,1,6]},
    -                 #'Extension'{
    -                     extnID = {2,5,29,14},
    +                     extnValue = [3,2,1,6]},
    /usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/public_key.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (405))
    --- old//usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/public_key.html	2026-06-04 19:05:14.066558140 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/public_key.html	2026-06-04 19:05:14.066558140 +0000
    @@ -3308,22 +3308,22 @@
     or also by the user when the option policy_set is provided to this
     function. The qualifiers convey information about the valid policy and
     is intended as information to end users.

    Available options:

    • {verify_fun, {fun(), UserState::term()} - The fun must be -defined as:

      fun(OtpCert :: #'OTPCertificate'{},
      -    Event :: {bad_cert, Reason :: bad_cert_reason() | {revoked, atom()}} |
      -             {extension, #'Extension'{}},
      -    UserState :: term()) ->
      -  {valid, UserState :: term()} |
      -  {valid_peer, UserState :: term()} |
      -  {fail, Reason :: term()} |
      -  {unknown, UserState :: term()}.

      or as:

      fun(OtpCert :: #'OTPCertificate'{},
      -    DerCert :: der_encoded(),
      -    Event :: {bad_cert, Reason :: bad_cert_reason() | {revoked, atom()}} |
      -             {extension, #'Extension'{}},
      -    UserState :: term()) ->
      -  {valid, UserState :: term()} |
      -  {valid_peer, UserState :: term()} |
      -  {fail, Reason :: term()} |
      -  {unknown, UserState :: term()}.

      The verify callback can have 3 or 4 arguments in case the DER encoded +defined as:

      fun(OtpCert :: #'OTPCertificate'{},
      +    Event :: {bad_cert, Reason :: bad_cert_reason() | {revoked, atom()}} |
      +             {extension, #'Extension'{}},
      +    UserState :: term()) ->
      +  {valid, UserState :: term()} |
      +  {valid_peer, UserState :: term()} |
      +  {fail, Reason :: term()} |
      +  {unknown, UserState :: term()}.

      or as:

      fun(OtpCert :: #'OTPCertificate'{},
      +    DerCert :: der_encoded(),
      +    Event :: {bad_cert, Reason :: bad_cert_reason() | {revoked, atom()}} |
      +             {extension, #'Extension'{}},
      +    UserState :: term()) ->
      +  {valid, UserState :: term()} |
      +  {valid_peer, UserState :: term()} |
      +  {fail, Reason :: term()} |
      +  {unknown, UserState :: term()}.

      The verify callback can have 3 or 4 arguments in case the DER encoded version is needed by the callback.

      If the verify callback fun returns {fail, Reason}, the verification process is immediately stopped. If the verify callback fun returns {valid, UserState}, the verification process is continued. This can be used @@ -3495,9 +3495,9 @@ about hostname verification. The User's Guide and code examples describes this -function more detailed.

      The option funs are described here:

      • match_fun

        fun(ReferenceId::ReferenceId() | FQDN::string(),
        -    PresentedId::{dNSName,string()} | {uniformResourceIdentifier,string() |
        -                 {iPAddress,list(byte())} | {OtherId::atom()|oid(),term()}})

        This function replaces the default host name matching rules. The fun should +function more detailed.

        The option funs are described here:

        • match_fun

          fun(ReferenceId::ReferenceId() | FQDN::string(),
          +    PresentedId::{dNSName,string()} | {uniformResourceIdentifier,string() |
          +                 {iPAddress,list(byte())} | {OtherId::atom()|oid(),term()}})

          This function replaces the default host name matching rules. The fun should return a boolean to tell if the Reference ID and Presented ID matches or not. The match fun can also return a third value, value, the atom default, if the default matching rules shall apply. This makes it possible to augment the @@ -3697,14 +3697,14 @@

          Performs CRL validation. It is intended to be called from the verify fun of -pkix_path_validation/3 .

          Available options:

          • {update_crl, fun()} - The fun has the following type specification:

             fun(#'DistributionPoint'{}, #'CertificateList'{}) ->
            -        #'CertificateList'{}

            The fun uses the information in the distribution point to access the latest +pkix_path_validation/3 .

            Available options:

            • {update_crl, fun()} - The fun has the following type specification:

               fun(#'DistributionPoint'{}, #'CertificateList'{}) ->
              +        #'CertificateList'{}

              The fun uses the information in the distribution point to access the latest possible version of the CRL. If this fun is not specified, Public Key uses the default implementation:

               fun(_DP, CRL) -> CRL end
            • {issuer_fun, {fun(), UserState::term()}} - The fun has the following type -specification:

              fun(#'DistributionPoint'{}, #'CertificateList'{},
              -    {rdnSequence,[#'AttributeTypeAndValue'{}]}, UserState::term()) ->
              -  {ok, #'OTPCertificate'{}, [der_encoded]}

              The fun returns the root certificate and certificate chain that has signed the -CRL.

               fun(DP, CRL, Issuer, UserState) -> {ok, RootCert, CertChain}
            • {undetermined_details, boolean()} - Defaults to false. When revocation +specification:

              fun(#'DistributionPoint'{}, #'CertificateList'{},
              +    {rdnSequence,[#'AttributeTypeAndValue'{}]}, UserState::term()) ->
              +  {ok, #'OTPCertificate'{}, [der_encoded]}

              The fun returns the root certificate and certificate chain that has signed the +CRL.

               fun(DP, CRL, Issuer, UserState) -> {ok, RootCert, CertChain}
            • {undetermined_details, boolean()} - Defaults to false. When revocation status cannot be determined, and this option is set to true, details of why no CRLs where accepted are included in the return value.

            @@ -4052,18 +4052,18 @@ generating an ECDSA key. Note this could fail if Erlang/OTP is compiled with a very old cryptolib.

          • {validity, {From::erlang:timestamp(), To::erlang:timestamp()}} - The validity period of the certificate.

          • {extensions, [#'Extension'{}]} - Extensions to include in the -certificate.

            Default extensions included in CA certificates if not otherwise specified are:

            [#'Extension'{extnID = ?'id-ce-keyUsage',
            -              extnValue = [keyCertSign, cRLSign],
            -              critical = false},
            -#'Extension'{extnID = ?'id-ce-basicConstraints',
            -             extnValue = #'BasicConstraints'{cA = true},
            -             critical = true}]

            Default extensions included in the server peer cert if not otherwise specified -are:

            [#'Extension'{extnID = ?'id-ce-keyUsage',
            -              extnValue = [digitalSignature, keyAgreement],
            -              critical = false},
            -#'Extension'{extnID = ?'id-ce-subjectAltName',
            -             extnValue = [{dNSName, Hostname}],
            -             critical = false}]

            Hostname is the result of calling net_adm:localhost() in the Erlang node where +certificate.

            Default extensions included in CA certificates if not otherwise specified are:

            [#'Extension'{extnID = ?'id-ce-keyUsage',
            +              extnValue = [keyCertSign, cRLSign],
            +              critical = false},
            +#'Extension'{extnID = ?'id-ce-basicConstraints',
            +             extnValue = #'BasicConstraints'{cA = true},
            +             critical = true}]

            Default extensions included in the server peer cert if not otherwise specified +are:

            [#'Extension'{extnID = ?'id-ce-keyUsage',
            +              extnValue = [digitalSignature, keyAgreement],
            +              critical = false},
            +#'Extension'{extnID = ?'id-ce-subjectAltName',
            +             extnValue = [{dNSName, Hostname}],
            +             critical = false}]

            Hostname is the result of calling net_adm:localhost() in the Erlang node where this function is called.

          Note

          Note that the generated certificates and keys does not provide a formally correct PKIX-trust-chain and they cannot be used to achieve real security. This function is provided for testing purposes only.

          @@ -4415,7 +4415,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/public_key_app.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/public_key_app.html 2026-06-04 19:05:14.089558354 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/public_key_app.html 2026-06-04 19:05:14.088558345 +0000 @@ -225,7 +225,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/public_key_records.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (2715)) --- old//usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/public_key_records.html 2026-06-04 19:05:14.113558576 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/public_key_records.html 2026-06-04 19:05:14.113558576 +0000 @@ -129,7 +129,7 @@ used to handle public key infrastructure. The scope is to describe the data types of each component, not the semantics. For information on the semantics, refer to the relevant standards and RFCs linked in the sections below.

          Use the following include directive to get access to the records and constant -macros described in the following sections:

           -include_lib("public_key/include/public_key.hrl").

          +macros described in the following sections:

           -include_lib("public_key/include/public_key.hrl").

          @@ -137,48 +137,48 @@

          Common non-standard Erlang data types used to describe the record fields in the following sections and which are not defined in the Public Key -Reference Manual follows here:

          time() = utc_time() | general_time()
          +Reference Manual follows here:

          time() = utc_time() | general_time()
           
          -utc_time()  = {utcTime, "YYMMDDHHMMSSZ"}
          +utc_time()  = {utcTime, "YYMMDDHHMMSSZ"}
           
          -general_time() = {generalTime, "YYYYMMDDHHMMSSZ"}
          +general_time() = {generalTime, "YYYYMMDDHHMMSSZ"}
           
          -general_name() = {rfc822Name, string()} |
          +general_name() = {rfc822Name, string()} |
           
          -                 {dNSName, string()} |
          +                 {dNSName, string()} |
           
          -                 {x400Address, string() |
          +                 {x400Address, string() |
           
          -                 {directoryName, {rdnSequence, [#href_anchor"ss">'AttributeTypeAndValue'{}]}} |
          +                 {directoryName, {rdnSequence, [#href_anchor"ss">'AttributeTypeAndValue'{}]}} |
           
          -                 {ediPartyName, special_string()} |
          +                 {ediPartyName, special_string()} |
           
          -                 {ediPartyName, special_string(), special_string()} |
          +                 {ediPartyName, special_string(), special_string()} |
           
          -                 {uniformResourceIdentifier, string()} |
          +                 {uniformResourceIdentifier, string()} |
           
          -                 {iPAddress, string()} |
          +                 {iPAddress, string()} |
           
          -                 {registeredId, oid()} |
          +                 {registeredId, oid()} |
           
          -                 {otherName, term()}
          +                 {otherName, term()}
           
          -special_string() = {teletexString, string()} |
          +special_string() = {teletexString, string()} |
            
          -                   {printableString, string()} |
          +                   {printableString, string()} |
           
          -                   {universalString, string()} |
          +                   {universalString, string()} |
           
          -                   {utf8String, binary()} |
          +                   {utf8String, binary()} |
           
          -                   {bmpString, string()}
          +                   {bmpString, string()}
           
          -dist_reason() = unused | keyCompromise | cACompromise | affiliationChanged |
          +dist_reason() = unused | keyCompromise | cACompromise | affiliationChanged |
                           cessationOfOperation | certificateHold | privilegeWithdrawn | aACompromise
           
          -OID_macro() = ?OID_name()
          +OID_macro() = ?OID_name()
           
          -OID_name() = atom()

          +OID_name() = atom()

          @@ -186,12 +186,12 @@

          Erlang representation of Rivest-Shamir-Adleman cryptosystem (RSA) -keys follows:

          #href_anchor"ss">'RSAPublicKey'{
          +keys follows:

          #href_anchor"ss">'RSAPublicKey'{
              modulus,       % pos_integer()
              publicExponent % pos_integer()
          -  }.
          +  }.
           
          -#'RSAPrivateKey'{
          +#'RSAPrivateKey'{
              version,         % two-prime | multi
              modulus,         % pos_integer()
              publicExponent,  % pos_integer()
          @@ -202,50 +202,50 @@
              exponent2,       % pos_integer()
              coefficient,     % pos_integer()
              otherPrimeInfos  % [#OtherPrimeInfo{}] | asn1_NOVALUE
          -  }.
          +  }.
           
          -#'OtherPrimeInfo'{
          +#'OtherPrimeInfo'{
              prime,           % pos_integer()
              exponent,        % pos_integer()
              coefficient      % pos_integer()
          -  }.
          +  }.
           
          -#'RSASSA-PSS-params'{
          +#'RSASSA-PSS-params'{
              hashAlgorithm,     % #'HashAlgorithm'{}},
              maskGenAlgorithm,  % #'MaskGenAlgorithm'{}},
              saltLength,        % pos_integer(),
              trailerField,      % pos_integer()
          -  }.
          +  }.
           
          -#'HashAlgorithm'{
          +#'HashAlgorithm'{
              algorithm,  % oid()
              parameters  % defaults to asn1_NOVALUE
          -  }.
          +  }.
           
          -#'MaskGenAlgorithm'{
          +#'MaskGenAlgorithm'{
              algorithm,  % oid()
              parameters, % defaults to asn1_NOVALUE
          -  }.

          + }.

          DSA

          Erlang representation of -Digital Signature Algorithm (DSA) keys

          #href_anchor"ss">'DSAPrivateKey'{
          +Digital Signature Algorithm (DSA) keys

          #href_anchor"ss">'DSAPrivateKey'{
              version,      % pos_integer()
              p,            % pos_integer()
              q,            % pos_integer()
              g,            % pos_integer()
              y,            % pos_integer()
              x             % pos_integer()
          -  }.
          +  }.
           
          -#'Dss-Parms'{
          +#'Dss-Parms'{
              p,         % pos_integer()
              q,         % pos_integer()
              g          % pos_integer()
          -  }.

          + }.

          @@ -256,38 +256,38 @@ and Edwards-Curve Digital Signature Algorithm (EDDSA) where parameters in the private key will be -{namedCurve, ?'id-Ed25519' | ?'id-Ed448'}.

          #href_anchor"ss">'ECPrivateKey'{
          +{namedCurve, ?'id-Ed25519' | ?'id-Ed448'}.

          #href_anchor"ss">'ECPrivateKey'{
              version,       % pos_integer()
              privateKey,    % binary()
              parameters,    % {ecParameters, #'ECParameters'{}} |
                             % {namedCurve, Oid::tuple()} |
                             % {implicitlyCA, 'NULL'}
              publicKey      % bitstring()
          -  }.
          +  }.
           
          -#'ECParameters'{
          +#'ECParameters'{
              version,    % pos_integer()
              fieldID,    % #'FieldID'{}
              curve,      % #'Curve'{}
              base,       % binary()
              order,      % pos_integer()
              cofactor    % pos_integer()
          -  }.
          +  }.
           
          -#'Curve'{
          +#'Curve'{
              a,        % binary()
              b,        % binary()
              seed      % bitstring() - optional
          -  }.
          +  }.
           
          -#'FieldID'{
          +#'FieldID'{
              fieldType,    % oid()
              parameters    % Depending on fieldType
          -  }.
          /usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/search.html differs (HTML document, Unicode text, UTF-8 text)
          --- old//usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/search.html	2026-06-04 19:05:14.131547164 +0000
          +++ new//usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/search.html	2026-06-04 19:05:14.132983868 +0000
          @@ -145,7 +145,7 @@
                     Erlang programming language
           
                 

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/using_public_key.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1122)) --- old//usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/using_public_key.html 2026-06-04 19:05:14.160559013 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/public_key-1.16.4/doc/html/using_public_key.html 2026-06-04 19:05:14.160559013 +0000 @@ -148,30 +148,30 @@ DSA Private Key

          -

          A DSA private key can look as follows:

          Note

          File handling is not done by the Public Key application.

          1> {ok, PemBin} = file:read_file("dsa.pem").
          -{ok,<<"-----BEGIN DSA PRIVATE KEY-----\nMIIBuw"...>>}

          The following PEM file has only one entry, a private DSA key:

          2>[DSAEntry] =  public_key:pem_decode(PemBin).
          -[{'DSAPrivateKey',<<48,130,1,187,2,1,0,2,129,129,0,183,
          +

          A DSA private key can look as follows:

          Note

          File handling is not done by the Public Key application.

          1> {ok, PemBin} = file:read_file("dsa.pem").
          +{ok,<<"-----BEGIN DSA PRIVATE KEY-----\nMIIBuw"...>>}

          The following PEM file has only one entry, a private DSA key:

          2>[DSAEntry] =  public_key:pem_decode(PemBin).
          +[{'DSAPrivateKey',<<48,130,1,187,2,1,0,2,129,129,0,183,
                               179,230,217,37,99,144,157,21,228,204,
                               162,207,61,246,...>>,
          -                    not_encrypted}]
          3> Key = public_key:pem_entry_decode(DSAEntry).
          -#'DSAPrivateKey'{version = 0,
          +                    not_encrypted}]
          3> Key = public_key:pem_entry_decode(DSAEntry).
          +#'DSAPrivateKey'{version = 0,
                            p = 12900045185019966618...6593,
                            q = 1216700114794736143432235288305776850295620488937,
                            g = 10442040227452349332...47213,
                            y = 87256807980030509074...403143,
          -                 x = 510968529856012146351317363807366575075645839654}

          + x = 510968529856012146351317363807366575075645839654}

          RSA Private Key with Password

          -

          An RSA private key encrypted with a password can look as follows:

          1> {ok, PemBin} = file:read_file("rsa.pem").
          -{ok,<<"Bag Attribute"...>>}

          The following PEM file has only one entry, a private RSA key:

          2>[RSAEntry] = public_key:pem_decode(PemBin).
          -[{'RSAPrivateKey',<<224,108,117,203,152,40,15,77,128,126,
          +

          An RSA private key encrypted with a password can look as follows:

          1> {ok, PemBin} = file:read_file("rsa.pem").
          +{ok,<<"Bag Attribute"...>>}

          The following PEM file has only one entry, a private RSA key:

          2>[RSAEntry] = public_key:pem_decode(PemBin).
          +[{'RSAPrivateKey',<<224,108,117,203,152,40,15,77,128,126,
                               221,195,154,249,85,208,202,251,109,
                               119,120,57,29,89,19,9,...>>,
          -                  {"DES-EDE3-CBC",<<"kÙeø¼pµL">>}}]

          In this following example, the password is "abcd1234":

          3> Key = public_key:pem_entry_decode(RSAEntry, "abcd1234").
          -#'RSAPrivateKey'{version = 'two-prime',
          +                  {"DES-EDE3-CBC",<<"kÙeø¼pµL">>}}]

          In this following example, the password is "abcd1234":

          3> Key = public_key:pem_entry_decode(RSAEntry, "abcd1234").
          +#'RSAPrivateKey'{version = 'two-prime',
                            modulus = 1112355156729921663373...2737107,
                            publicExponent = 65537,
                            privateExponent = 58064406231183...2239766033,
          @@ -180,201 +180,201 @@
                            exponent1 = 77928819327425934607...22152984217,
                            exponent2 = 36287623121853605733...20588523793,
                            coefficient = 924840412626098444...41820968343,
          -                 otherPrimeInfos = asn1_NOVALUE}

          + otherPrimeInfos = asn1_NOVALUE}

          X509 Certificates

          -

          The following is an example of X509 certificates:

          1> {ok, PemBin} = file:read_file("cacerts.pem").
          -{ok,<<"-----BEGIN CERTIFICATE-----\nMIIC7jCCAl"...>>}

          The following file includes two certificates:

          2> [CertEntry1, CertEntry2] = public_key:pem_decode(PemBin).
          -[{'Certificate',<<48,130,2,238,48,130,2,87,160,3,2,1,2,2,
          +

          The following is an example of X509 certificates:

          1> {ok, PemBin} = file:read_file("cacerts.pem").
          +{ok,<<"-----BEGIN CERTIFICATE-----\nMIIC7jCCAl"...>>}

          The following file includes two certificates:

          2> [CertEntry1, CertEntry2] = public_key:pem_decode(PemBin).
          +[{'Certificate',<<48,130,2,238,48,130,2,87,160,3,2,1,2,2,
                             9,0,230,145,97,214,191,2,120,150,48,13,
                             ...>>,
          -                not_encrypted},
          - {'Certificate',<<48,130,3,200,48,130,3,49,160,3,2,1,2,2,1,
          +                not_encrypted},
          + {'Certificate',<<48,130,3,200,48,130,3,49,160,3,2,1,2,2,1,
                             1,48,13,6,9,42,134,72,134,247,...>>,
          -                not_encrypted}]

          Certificates can be decoded as usual:

          2> Cert = public_key:pem_entry_decode(CertEntry1).
          -#'Certificate'{
          +                not_encrypted}]

          Certificates can be decoded as usual:

          2> Cert = public_key:pem_entry_decode(CertEntry1).
          +#'Certificate'{
               tbsCertificate =
          -        #'TBSCertificate'{
          +        #'TBSCertificate'{
                       version = v3,serialNumber = 16614168075301976214,
                       signature =
          -                #'AlgorithmIdentifier'{
          -                    algorithm = {1,2,840,113549,1,1,5},
          -                    parameters = <<5,0>>},
          +                #'AlgorithmIdentifier'{
          +                    algorithm = {1,2,840,113549,1,1,5},
          +                    parameters = <<5,0>>},
                       issuer =
          -                {rdnSequence,
          -                    [[#'AttributeTypeAndValue'{
          -                          type = {2,5,4,3},
          -                          value = <<19,8,101,114,108,97,110,103,67,65>>}],
          -                     [#'AttributeTypeAndValue'{
          -                          type = {2,5,4,11},
          -                          value = <<19,10,69,114,108,97,110,103,32,79,84,80>>}],
          -                     [#'AttributeTypeAndValue'{
          -                          type = {2,5,4,10},
          -                          value = <<19,11,69,114,105,99,115,115,111,110,32,65,66>>}],
          -                     [#'AttributeTypeAndValue'{
          -                          type = {2,5,4,7},
          -                          value = <<19,9,83,116,111,99,107,104,111,108,109>>}],
          -                     [#'AttributeTypeAndValue'{
          -                          type = {2,5,4,6},
          -                          value = <<19,2,83,69>>}],
          -                     [#'AttributeTypeAndValue'{
          -                          type = {1,2,840,113549,1,9,1},
          -                          value = <<22,22,112,101,116,101,114,64,101,114,...>>}]]},
          +                {rdnSequence,
          +                    [[#'AttributeTypeAndValue'{
          +                          type = {2,5,4,3},
          +                          value = <<19,8,101,114,108,97,110,103,67,65>>}],
          +                     [#'AttributeTypeAndValue'{
          +                          type = {2,5,4,11},
          +                          value = <<19,10,69,114,108,97,110,103,32,79,84,80>>}],
          +                     [#'AttributeTypeAndValue'{
          +                          type = {2,5,4,10},
          +                          value = <<19,11,69,114,105,99,115,115,111,110,32,65,66>>}],
          +                     [#'AttributeTypeAndValue'{
          +                          type = {2,5,4,7},
          +                          value = <<19,9,83,116,111,99,107,104,111,108,109>>}],
          +                     [#'AttributeTypeAndValue'{
          +                          type = {2,5,4,6},
          +                          value = <<19,2,83,69>>}],
          +                     [#'AttributeTypeAndValue'{
          +                          type = {1,2,840,113549,1,9,1},
          +                          value = <<22,22,112,101,116,101,114,64,101,114,...>>}]]},
                       validity =
          -                #'Validity'{
          -                    notBefore = {utcTime,"080109082929Z"},
          -                    notAfter = {utcTime,"080208082929Z"}},
          +                #'Validity'{
          +                    notBefore = {utcTime,"080109082929Z"},
          +                    notAfter = {utcTime,"080208082929Z"}},
                       subject =
          -                {rdnSequence,
          -                    [[#'AttributeTypeAndValue'{
          -                          type = {2,5,4,3},
          -                          value = <<19,8,101,114,108,97,110,103,67,65>>}],
          -                     [#'AttributeTypeAndValue'{
          -                          type = {2,5,4,11},
          -                          value = <<19,10,69,114,108,97,110,103,32,79,84,80>>}],
          -                     [#'AttributeTypeAndValue'{
          -                          type = {2,5,4,10},
          -                          value = <<19,11,69,114,105,99,115,115,111,110,32,...>>}],
          -                     [#'AttributeTypeAndValue'{
          -                          type = {2,5,4,7},
          -                          value = <<19,9,83,116,111,99,107,104,111,108,...>>}],
          -                     [#'AttributeTypeAndValue'{
          -                          type = {2,5,4,6},
          -                          value = <<19,2,83,69>>}],
          -                     [#'AttributeTypeAndValue'{
          -                          type = {1,2,840,113549,1,9,1},
          -                          value = <<22,22,112,101,116,101,114,64,...>>}]]},
          +                {rdnSequence,
          +                    [[#'AttributeTypeAndValue'{
          +                          type = {2,5,4,3},
          +                          value = <<19,8,101,114,108,97,110,103,67,65>>}],
          +                     [#'AttributeTypeAndValue'{
          +                          type = {2,5,4,11},
          +                          value = <<19,10,69,114,108,97,110,103,32,79,84,80>>}],
          +                     [#'AttributeTypeAndValue'{
          +                          type = {2,5,4,10},
          +                          value = <<19,11,69,114,105,99,115,115,111,110,32,...>>}],
          +                     [#'AttributeTypeAndValue'{
          +                          type = {2,5,4,7},
          +                          value = <<19,9,83,116,111,99,107,104,111,108,...>>}],
          +                     [#'AttributeTypeAndValue'{
          +                          type = {2,5,4,6},
          +                          value = <<19,2,83,69>>}],
          +                     [#'AttributeTypeAndValue'{
          +                          type = {1,2,840,113549,1,9,1},
          +                          value = <<22,22,112,101,116,101,114,64,...>>}]]},
                       subjectPublicKeyInfo =
          -                #'SubjectPublicKeyInfo'{
          +                #'SubjectPublicKeyInfo'{
                               algorithm =
          -                        #'AlgorithmIdentifier'{
          -                            algorithm = {1,2,840,113549,1,1,1},
          -                            parameters = <<5,0>>},
          +                        #'AlgorithmIdentifier'{
          +                            algorithm = {1,2,840,113549,1,1,1},
          +                            parameters = <<5,0>>},
                               subjectPublicKey =
          -                        {0,<<48,129,137,2,129,129,0,203,209,187,77,73,231,90,...>>}},
          +                        {0,<<48,129,137,2,129,129,0,203,209,187,77,73,231,90,...>>}},
                       issuerUniqueID = asn1_NOVALUE,
                       subjectUniqueID = asn1_NOVALUE,
                       extensions =
          -                [#'Extension'{
          -                     extnID = {2,5,29,19},
          +                [#'Extension'{
          +                     extnID = {2,5,29,19},
                                critical = true,
          -                     extnValue = [48,3,1,1,255]},
          -                 #'Extension'{
          -                     extnID = {2,5,29,15},
          +                     extnValue = [48,3,1,1,255]},
          +                 #'Extension'{
          +                     extnID = {2,5,29,15},
                                critical = false,
          -                     extnValue = [3,2,1,6]},
          -                 #'Extension'{
          -                     extnID = {2,5,29,14},
          +                     extnValue = [3,2,1,6]},
          /usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/404.html differs (HTML document, Unicode text, UTF-8 text)
          --- old//usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/404.html	2026-06-04 19:05:14.178559179 +0000
          +++ new//usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/404.html	2026-06-04 19:05:14.179417365 +0000
          @@ -147,7 +147,7 @@
                     Erlang programming language
           
                 

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/api-reference.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/api-reference.html 2026-06-04 19:05:14.196559346 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/api-reference.html 2026-06-04 19:05:14.195559337 +0000 @@ -185,7 +185,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/notes.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (395)) --- old//usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/notes.html 2026-06-04 19:05:14.218559550 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/notes.html 2026-06-04 19:05:14.219559560 +0000 @@ -782,7 +782,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/reltool.epub/OEBPS/content.opf differs (XML 1.0 document, ASCII text) --- old//usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/reltool.epub/OEBPS/content.opf 2026-06-04 00:08:21.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/reltool.epub/OEBPS/content.opf 2042-07-06 13:27:47.000000000 +0000 @@ -4,10 +4,10 @@ version="3.0"> reltool - 1.0.1 - urn:uuid:84d32cde-c73c-3487-e561-d97818c6bdab + urn:uuid:a752e375-7cbb-e5ac-5753-b3921c6e8c63 en - 2026-06-04T00:08:21Z + 2042-07-06T13:27:46Z /usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/reltool.epub/OEBPS/reltool_examples.xhtml differs (HTML document, ASCII text, with very long lines (1754)) --- old//usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/reltool.epub/OEBPS/reltool_examples.xhtml 2026-06-04 00:08:21.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/reltool.epub/OEBPS/reltool_examples.xhtml 2042-07-06 13:27:47.000000000 +0000 @@ -30,500 +30,500 @@ via the GUI frontend process. When the GUI is started, a server process will automatically be started. The GUI process is started with reltool:start/0, reltool:start/1 or reltool:start_link/1. The pid of its server can be -obtained with reltool:get_server/1

          Erlang/OTP 20 [erts-9.0] [source-c13b302] [64-bit] [smp:4:4] [ds:4:4:10] [async-threads:10]
          -[hipe] [kernel-poll:false]
          -Eshell V9.0  (abort with ^G)
          +obtained with reltool:get_server/1

          Erlang/OTP 20 [erts-9.0] [source-c13b302] [64-bit] [smp:4:4] [ds:4:4:10] [async-threads:10]
          +[hipe] [kernel-poll:false]
          +Eshell V9.0  (abort with ^G)
           1>
          -1> {ok, Win} = reltool:start([]).
          -{ok,<0.36.01>}
          -2> {ok, Server} = reltool:get_server(Win).
          -{ok,<0.37.01>}
          -3> reltool:get_config(Server).
          -{ok,{sys,[]}}
          +1> {ok, Win} = reltool:start([]).
          +{ok,<0.36.01>}
          +2> {ok, Server} = reltool:get_server(Win).
          +{ok,<0.37.01>}
          +3> reltool:get_config(Server).
          +{ok,{sys,[]}}
           4>
          -4> {ok, Server2} = reltool:start_server([]).
          -{ok,<0.6535.01>}
          -5> reltool:get_config(Server2).
          -{ok,{sys,[]}}
          -6> reltool:stop(Server2).
          +4> {ok, Server2} = reltool:start_server([]).
          +{ok,<0.6535.01>}
          +5> reltool:get_config(Server2).
          +{ok,{sys,[]}}
          +6> reltool:stop(Server2).
           ok

          Inspecting the configuration

          -
          Erlang/OTP 20 [erts-9.0] [source-c13b302] [64-bit] [smp:4:4] [ds:4:4:10] [async-threads:10]
          -[hipe] [kernel-poll:false]
          -Eshell V9.0  (abort with ^G)
          +
          Erlang/OTP 20 [erts-9.0] [source-c13b302] [64-bit] [smp:4:4] [ds:4:4:10] [async-threads:10]
          +[hipe] [kernel-poll:false]
          +Eshell V9.0  (abort with ^G)
           1>
          -1> Config = {sys, [{escript, "examples/display_args", [{incl_cond, include}]},
          -		   {app, inets, [{incl_cond, include}]},
          -		   {app, mnesia, [{incl_cond, exclude}]},
          -		   {app, ssl, [{incl_cond, exclude}]},
          -		   {app, runtime_tools, [{incl_cond, exclude}]},
          -		   {app, syntax_tools, [{incl_cond, exclude}]}]}.
          -{sys,[{escript,"examples/display_args",[{incl_cond,include}]},
          -      {app,inets,[{incl_cond,include}]},
          -      {app,mnesia,[{incl_cond,exclude}]},
          -      {app,ssl,[{incl_cond,exclude}]},
          -      {app,runtime_tools,[{incl_cond,exclude}]},
          -      {app,syntax_tools,[{incl_cond,exclude}]}]}
          +1> Config = {sys, [{escript, "examples/display_args", [{incl_cond, include}]},
          +		   {app, inets, [{incl_cond, include}]},
          +		   {app, mnesia, [{incl_cond, exclude}]},
          +		   {app, ssl, [{incl_cond, exclude}]},
          +		   {app, runtime_tools, [{incl_cond, exclude}]},
          +		   {app, syntax_tools, [{incl_cond, exclude}]}]}.
          +{sys,[{escript,"examples/display_args",[{incl_cond,include}]},
          +      {app,inets,[{incl_cond,include}]},
          +      {app,mnesia,[{incl_cond,exclude}]},
          +      {app,ssl,[{incl_cond,exclude}]},
          +      {app,runtime_tools,[{incl_cond,exclude}]},
          +      {app,syntax_tools,[{incl_cond,exclude}]}]}
           2>
          -2> {ok, Server} = reltool:start_server([Config]).
          -{ok,<0.66.0>}
          +2> {ok, Server} = reltool:start_server([Config]).
          +{ok,<0.66.0>}
           3>
          -3> reltool:get_config(Server).
          -{ok,{sys,[{escript,"/usr/local/lib/erlang/lib/reltool-0.7.3/examples/display_args",
          -                   [{incl_cond,include}]},
          -          {app,inets,[{incl_cond,include}]},
          -          {app,mnesia,[{incl_cond,exclude}]},
          -          {app,runtime_tools,[{incl_cond,exclude}]},
          -          {app,ssl,[{incl_cond,exclude}]},
          -          {app,syntax_tools,[{incl_cond,exclude}]}]}}
          +3> reltool:get_config(Server).
          +{ok,{sys,[{escript,"/usr/local/lib/erlang/lib/reltool-0.7.3/examples/display_args",
          +                   [{incl_cond,include}]},
          +          {app,inets,[{incl_cond,include}]},
          +          {app,mnesia,[{incl_cond,exclude}]},
          +          {app,runtime_tools,[{incl_cond,exclude}]},
          +          {app,ssl,[{incl_cond,exclude}]},
          +          {app,syntax_tools,[{incl_cond,exclude}]}]}}
           4>
          -4> reltool:get_config(Server, false, false).
          -{ok,{sys,[{escript,"/usr/local/lib/erlang/lib/reltool-0.7.3/examples/display_args",
          -                   [{incl_cond,include}]},
          -          {app,inets,[{incl_cond,include}]},
          -          {app,mnesia,[{incl_cond,exclude}]},
          -          {app,runtime_tools,[{incl_cond,exclude}]},
          -          {app,ssl,[{incl_cond,exclude}]},
          -          {app,syntax_tools,[{incl_cond,exclude}]}]}}
          +4> reltool:get_config(Server, false, false).
          +{ok,{sys,[{escript,"/usr/local/lib/erlang/lib/reltool-0.7.3/examples/display_args",
          +                   [{incl_cond,include}]},
          +          {app,inets,[{incl_cond,include}]},
          +          {app,mnesia,[{incl_cond,exclude}]},
          +          {app,runtime_tools,[{incl_cond,exclude}]},
          +          {app,ssl,[{incl_cond,exclude}]},
          +          {app,syntax_tools,[{incl_cond,exclude}]}]}}
           5>
          -5> reltool:get_config(Server, true, false).
          -{ok,{sys,[{root_dir,"/usr/local/lib/erlang"},
          -          {lib_dirs,[]},
          -          {escript,"/usr/local/lib/erlang/lib/reltool-0.7.3/examples/display_args",
          -                   [{incl_cond,include}]},
          -          {mod_cond,all},
          -          {incl_cond,derived},
          -          {app,inets,
          -               [{incl_cond,include},{vsn,undefined},{lib_dir,undefined}]},
          -          {app,mnesia,[{incl_cond,exclude}]},
          -          {app,runtime_tools,[{incl_cond,exclude}]},
          -          {app,ssl,[{incl_cond,exclude}]},
          -          {app,syntax_tools,[{incl_cond,exclude}]},
          -          {boot_rel,"start_clean"},
          -          {rel,"start_clean","1.0",[]},
          -          {rel,"start_sasl","1.0",[sasl]},
          -          {emu_name,"beam"},
          -          {relocatable,true},
          -          {profile,development},
          -          {incl_sys_filters,[".*"]},
          -          {excl_sys_filters,[]},
          -          {incl_app_filters,[".*"]},
          -          {excl_app_filters,[]},
          -          {rel_app_type,...},
          -          {...}|...]}}
          +5> reltool:get_config(Server, true, false).
          +{ok,{sys,[{root_dir,"/usr/local/lib/erlang"},
          +          {lib_dirs,[]},
          +          {escript,"/usr/local/lib/erlang/lib/reltool-0.7.3/examples/display_args",
          +                   [{incl_cond,include}]},
          +          {mod_cond,all},
          +          {incl_cond,derived},
          +          {app,inets,
          +               [{incl_cond,include},{vsn,undefined},{lib_dir,undefined}]},
          +          {app,mnesia,[{incl_cond,exclude}]},
          +          {app,runtime_tools,[{incl_cond,exclude}]},
          +          {app,ssl,[{incl_cond,exclude}]},
          +          {app,syntax_tools,[{incl_cond,exclude}]},
          +          {boot_rel,"start_clean"},
          +          {rel,"start_clean","1.0",[]},
          +          {rel,"start_sasl","1.0",[sasl]},
          +          {emu_name,"beam"},
          +          {relocatable,true},
          +          {profile,development},
          +          {incl_sys_filters,[".*"]},
          +          {excl_sys_filters,[]},
          +          {incl_app_filters,[".*"]},
          +          {excl_app_filters,[]},
          +          {rel_app_type,...},
          +          {...}|...]}}
           6>
          -6> reltool:get_config(Server, true, true).
          -{ok,{sys,[{root_dir,"/usr/local/lib/erlang"},
          -          {lib_dirs,[]},
          -          {escript,"/usr/local/lib/erlang/lib/reltool-0.7.3/examples/display_args",
          -                   [{incl_cond,include}]},
          -          {mod_cond,all},
          -          {incl_cond,derived},
          -          {erts,[{app,erts,
          -                      [{vsn,"10.0"},
          -                       {lib_dir,"/usr/local/lib/erlang/lib/erts-10.0"},
          -                       {mod,erl_prim_loader,[]},
          -                       {mod,erl_tracer,[]},
          -                       {mod,erlang,[]},
          -                       {mod,erts_code_purger,[]},
          -                       {mod,erts_dirty_process_signal_handler,[]},
          -                       {mod,erts_internal,[]},
          -                       {mod,erts_literal_area_collector,[]},
          -                       {mod,init,[]},
          -                       {mod,erl_init,...},
          -                       {mod,...},
          -                       {...}|...]}]},
          -          {app,compiler,
          -               [{vsn,"7.0.4"},
          -                {lib_dir,"/usr/local/lib/erlang/lib/compiler-7.0.4"},
          -                {mod,beam_a,[]},
          -                {mod,beam_asm,[]},
          -                {mod,beam_block,[]},
          -                {mod,beam_bs,[]},
          -                {mod,beam_bsm,[]},
          -                {mod,beam_clean,[]},
          -                {mod,beam_dead,[]},
          -                {mod,beam_dict,[]},
          -                {mod,beam_disasm,[]},
          -                {mod,beam_except,[]},
          -                {mod,beam_flatten,...},
          -                {mod,...},
          /usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/reltool.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (396))
          --- old//usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/reltool.html	2026-06-04 19:05:14.311560413 +0000
          +++ new//usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/reltool.html	2026-06-04 19:05:14.312560423 +0000
          @@ -2881,7 +2881,7 @@
                     Erlang programming language
           
                 

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/reltool_examples.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1752)) --- old//usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/reltool_examples.html 2026-06-04 19:05:14.344560719 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/reltool_examples.html 2026-06-04 19:05:14.344560719 +0000 @@ -135,500 +135,500 @@ via the GUI frontend process. When the GUI is started, a server process will automatically be started. The GUI process is started with reltool:start/0, reltool:start/1 or reltool:start_link/1. The pid of its server can be -obtained with reltool:get_server/1

          Erlang/OTP 20 [erts-9.0] [source-c13b302] [64-bit] [smp:4:4] [ds:4:4:10] [async-threads:10]
          -[hipe] [kernel-poll:false]
          -Eshell V9.0  (abort with ^G)
          +obtained with reltool:get_server/1

          Erlang/OTP 20 [erts-9.0] [source-c13b302] [64-bit] [smp:4:4] [ds:4:4:10] [async-threads:10]
          +[hipe] [kernel-poll:false]
          +Eshell V9.0  (abort with ^G)
           1>
          -1> {ok, Win} = reltool:start([]).
          -{ok,<0.36.01>}
          -2> {ok, Server} = reltool:get_server(Win).
          -{ok,<0.37.01>}
          -3> reltool:get_config(Server).
          -{ok,{sys,[]}}
          +1> {ok, Win} = reltool:start([]).
          +{ok,<0.36.01>}
          +2> {ok, Server} = reltool:get_server(Win).
          +{ok,<0.37.01>}
          +3> reltool:get_config(Server).
          +{ok,{sys,[]}}
           4>
          -4> {ok, Server2} = reltool:start_server([]).
          -{ok,<0.6535.01>}
          -5> reltool:get_config(Server2).
          -{ok,{sys,[]}}
          -6> reltool:stop(Server2).
          +4> {ok, Server2} = reltool:start_server([]).
          +{ok,<0.6535.01>}
          +5> reltool:get_config(Server2).
          +{ok,{sys,[]}}
          +6> reltool:stop(Server2).
           ok

          Inspecting the configuration

          -
          Erlang/OTP 20 [erts-9.0] [source-c13b302] [64-bit] [smp:4:4] [ds:4:4:10] [async-threads:10]
          -[hipe] [kernel-poll:false]
          -Eshell V9.0  (abort with ^G)
          +
          Erlang/OTP 20 [erts-9.0] [source-c13b302] [64-bit] [smp:4:4] [ds:4:4:10] [async-threads:10]
          +[hipe] [kernel-poll:false]
          +Eshell V9.0  (abort with ^G)
           1>
          -1> Config = {sys, [{escript, "examples/display_args", [{incl_cond, include}]},
          -		   {app, inets, [{incl_cond, include}]},
          -		   {app, mnesia, [{incl_cond, exclude}]},
          -		   {app, ssl, [{incl_cond, exclude}]},
          -		   {app, runtime_tools, [{incl_cond, exclude}]},
          -		   {app, syntax_tools, [{incl_cond, exclude}]}]}.
          -{sys,[{escript,"examples/display_args",[{incl_cond,include}]},
          -      {app,inets,[{incl_cond,include}]},
          -      {app,mnesia,[{incl_cond,exclude}]},
          -      {app,ssl,[{incl_cond,exclude}]},
          -      {app,runtime_tools,[{incl_cond,exclude}]},
          -      {app,syntax_tools,[{incl_cond,exclude}]}]}
          +1> Config = {sys, [{escript, "examples/display_args", [{incl_cond, include}]},
          +		   {app, inets, [{incl_cond, include}]},
          +		   {app, mnesia, [{incl_cond, exclude}]},
          +		   {app, ssl, [{incl_cond, exclude}]},
          +		   {app, runtime_tools, [{incl_cond, exclude}]},
          +		   {app, syntax_tools, [{incl_cond, exclude}]}]}.
          +{sys,[{escript,"examples/display_args",[{incl_cond,include}]},
          +      {app,inets,[{incl_cond,include}]},
          +      {app,mnesia,[{incl_cond,exclude}]},
          +      {app,ssl,[{incl_cond,exclude}]},
          +      {app,runtime_tools,[{incl_cond,exclude}]},
          +      {app,syntax_tools,[{incl_cond,exclude}]}]}
           2>
          -2> {ok, Server} = reltool:start_server([Config]).
          -{ok,<0.66.0>}
          +2> {ok, Server} = reltool:start_server([Config]).
          +{ok,<0.66.0>}
           3>
          -3> reltool:get_config(Server).
          -{ok,{sys,[{escript,"/usr/local/lib/erlang/lib/reltool-0.7.3/examples/display_args",
          -                   [{incl_cond,include}]},
          -          {app,inets,[{incl_cond,include}]},
          -          {app,mnesia,[{incl_cond,exclude}]},
          -          {app,runtime_tools,[{incl_cond,exclude}]},
          -          {app,ssl,[{incl_cond,exclude}]},
          -          {app,syntax_tools,[{incl_cond,exclude}]}]}}
          +3> reltool:get_config(Server).
          +{ok,{sys,[{escript,"/usr/local/lib/erlang/lib/reltool-0.7.3/examples/display_args",
          +                   [{incl_cond,include}]},
          +          {app,inets,[{incl_cond,include}]},
          +          {app,mnesia,[{incl_cond,exclude}]},
          +          {app,runtime_tools,[{incl_cond,exclude}]},
          +          {app,ssl,[{incl_cond,exclude}]},
          +          {app,syntax_tools,[{incl_cond,exclude}]}]}}
           4>
          -4> reltool:get_config(Server, false, false).
          -{ok,{sys,[{escript,"/usr/local/lib/erlang/lib/reltool-0.7.3/examples/display_args",
          -                   [{incl_cond,include}]},
          -          {app,inets,[{incl_cond,include}]},
          -          {app,mnesia,[{incl_cond,exclude}]},
          -          {app,runtime_tools,[{incl_cond,exclude}]},
          -          {app,ssl,[{incl_cond,exclude}]},
          -          {app,syntax_tools,[{incl_cond,exclude}]}]}}
          +4> reltool:get_config(Server, false, false).
          +{ok,{sys,[{escript,"/usr/local/lib/erlang/lib/reltool-0.7.3/examples/display_args",
          +                   [{incl_cond,include}]},
          +          {app,inets,[{incl_cond,include}]},
          +          {app,mnesia,[{incl_cond,exclude}]},
          +          {app,runtime_tools,[{incl_cond,exclude}]},
          +          {app,ssl,[{incl_cond,exclude}]},
          +          {app,syntax_tools,[{incl_cond,exclude}]}]}}
           5>
          -5> reltool:get_config(Server, true, false).
          -{ok,{sys,[{root_dir,"/usr/local/lib/erlang"},
          -          {lib_dirs,[]},
          -          {escript,"/usr/local/lib/erlang/lib/reltool-0.7.3/examples/display_args",
          -                   [{incl_cond,include}]},
          -          {mod_cond,all},
          -          {incl_cond,derived},
          -          {app,inets,
          -               [{incl_cond,include},{vsn,undefined},{lib_dir,undefined}]},
          -          {app,mnesia,[{incl_cond,exclude}]},
          -          {app,runtime_tools,[{incl_cond,exclude}]},
          -          {app,ssl,[{incl_cond,exclude}]},
          -          {app,syntax_tools,[{incl_cond,exclude}]},
          -          {boot_rel,"start_clean"},
          -          {rel,"start_clean","1.0",[]},
          -          {rel,"start_sasl","1.0",[sasl]},
          -          {emu_name,"beam"},
          -          {relocatable,true},
          -          {profile,development},
          -          {incl_sys_filters,[".*"]},
          -          {excl_sys_filters,[]},
          -          {incl_app_filters,[".*"]},
          -          {excl_app_filters,[]},
          -          {rel_app_type,...},
          -          {...}|...]}}
          +5> reltool:get_config(Server, true, false).
          +{ok,{sys,[{root_dir,"/usr/local/lib/erlang"},
          +          {lib_dirs,[]},
          +          {escript,"/usr/local/lib/erlang/lib/reltool-0.7.3/examples/display_args",
          +                   [{incl_cond,include}]},
          +          {mod_cond,all},
          +          {incl_cond,derived},
          +          {app,inets,
          +               [{incl_cond,include},{vsn,undefined},{lib_dir,undefined}]},
          +          {app,mnesia,[{incl_cond,exclude}]},
          +          {app,runtime_tools,[{incl_cond,exclude}]},
          +          {app,ssl,[{incl_cond,exclude}]},
          +          {app,syntax_tools,[{incl_cond,exclude}]},
          +          {boot_rel,"start_clean"},
          +          {rel,"start_clean","1.0",[]},
          +          {rel,"start_sasl","1.0",[sasl]},
          +          {emu_name,"beam"},
          +          {relocatable,true},
          +          {profile,development},
          +          {incl_sys_filters,[".*"]},
          +          {excl_sys_filters,[]},
          +          {incl_app_filters,[".*"]},
          +          {excl_app_filters,[]},
          +          {rel_app_type,...},
          +          {...}|...]}}
           6>
          -6> reltool:get_config(Server, true, true).
          -{ok,{sys,[{root_dir,"/usr/local/lib/erlang"},
          -          {lib_dirs,[]},
          -          {escript,"/usr/local/lib/erlang/lib/reltool-0.7.3/examples/display_args",
          -                   [{incl_cond,include}]},
          -          {mod_cond,all},
          -          {incl_cond,derived},
          -          {erts,[{app,erts,
          -                      [{vsn,"10.0"},
          -                       {lib_dir,"/usr/local/lib/erlang/lib/erts-10.0"},
          -                       {mod,erl_prim_loader,[]},
          -                       {mod,erl_tracer,[]},
          -                       {mod,erlang,[]},
          -                       {mod,erts_code_purger,[]},
          -                       {mod,erts_dirty_process_signal_handler,[]},
          -                       {mod,erts_internal,[]},
          -                       {mod,erts_literal_area_collector,[]},
          -                       {mod,init,[]},
          -                       {mod,erl_init,...},
          -                       {mod,...},
          -                       {...}|...]}]},
          -          {app,compiler,
          -               [{vsn,"7.0.4"},
          -                {lib_dir,"/usr/local/lib/erlang/lib/compiler-7.0.4"},
          -                {mod,beam_a,[]},
          -                {mod,beam_asm,[]},
          -                {mod,beam_block,[]},
          -                {mod,beam_bs,[]},
          -                {mod,beam_bsm,[]},
          -                {mod,beam_clean,[]},
          -                {mod,beam_dead,[]},
          -                {mod,beam_dict,[]},
          -                {mod,beam_disasm,[]},
          -                {mod,beam_except,[]},
          -                {mod,beam_flatten,...},
          -                {mod,...},
          /usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/reltool_intro.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (446))
          --- old//usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/reltool_intro.html	2026-06-04 19:05:14.365560914 +0000
          +++ new//usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/reltool_intro.html	2026-06-04 19:05:14.366560923 +0000
          @@ -212,7 +212,7 @@
                     Erlang programming language
           
                 

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/reltool_usage.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (410)) --- old//usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/reltool_usage.html 2026-06-04 19:05:14.383561081 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/reltool_usage.html 2026-06-04 19:05:14.383561081 +0000 @@ -382,7 +382,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/search.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/search.html 2026-06-04 19:05:14.399654107 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/reltool-1.0.1/doc/html/search.html 2026-06-04 19:05:14.401009680 +0000 @@ -145,7 +145,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/404.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/404.html 2026-06-04 19:05:14.413991055 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/404.html 2026-06-04 19:05:14.413991055 +0000 @@ -147,7 +147,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/api-reference.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/api-reference.html 2026-06-04 19:05:14.429561508 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/api-reference.html 2026-06-04 19:05:14.429561508 +0000 @@ -230,7 +230,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/dbg.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1564)) --- old//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/dbg.html 2026-06-04 19:05:14.477561953 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/dbg.html 2026-06-04 19:05:14.476561944 +0000 @@ -131,16 +131,16 @@

          The Text Based Trace Facility

          This module implements a text based interface to the trace:process/4, trace:port/4, and trace:function/4 BIFs, simplifying tracing of functions, processes, ports, and messages.

          To quickly get started on tracing function calls you can use the -following code in the Erlang shell:

          1> dbg:tracer().  % Start the default trace message receiver
          -{ok,<0.90.0>}
          -2> dbg:p(all, c). % Set upp call tracing on all processes
          -{ok,[{matched,nonode@nohost,49}]}
          -3> dbg:tp(lists, seq, cx). %  Set up call and exception tracing on lists:seq/2,3
          -{ok,[{matched,nonode@nohost,2},{saved,cx}]}
          -4> lists:seq(1, 10).
          -(<0.88.0>) call lists:seq(1,10) ({erl_eval,do_apply,7,{"erl_eval.erl",904}})
          -[1,2,3,4,5,6,7,8,9,10]
          -(<0.88.0>) returned from lists:seq/2 -> [1,2,3,4,5,6,7,8,9,10]

          The utilities are also suitable to use in system testing on large systems, where +following code in the Erlang shell:

          1> dbg:tracer().  % Start the default trace message receiver
          +{ok,<0.90.0>}
          +2> dbg:p(all, c). % Set upp call tracing on all processes
          +{ok,[{matched,nonode@nohost,49}]}
          +3> dbg:tp(lists, seq, cx). %  Set up call and exception tracing on lists:seq/2,3
          +{ok,[{matched,nonode@nohost,2},{saved,cx}]}
          +4> lists:seq(1, 10).
          +(<0.88.0>) call lists:seq(1,10) ({erl_eval,do_apply,7,{"erl_eval.erl",904}})
          +[1,2,3,4,5,6,7,8,9,10]
          +(<0.88.0>) returned from lists:seq/2 -> [1,2,3,4,5,6,7,8,9,10]

          The utilities are also suitable to use in system testing on large systems, where other tools have too severe impact on the system performance. Some primitive support for sequential tracing is also included; see the advanced topics section.

          @@ -152,36 +152,36 @@

          To trace a call to a function with minimal fuss, call dbg:c(Module, Name, Arguments). dbg:c/3 starts a temporary trace receiver, enables all trace flags, and calls the designated function from a temporary process. For example, here is how to trace a call -to application:which_applications/0:

          1> dbg:c(application, which_applications, []).
          -(<0.92.0>) <0.45.0> ! {'$gen_call',{<0.92.0>,
          -                                    [alias|
          -                                     #Ref<0.0.11779.270031856.1478295555.230456>]},
          -                                   which_applications} (Timestamp: {1710,
          +to application:which_applications/0:

          1> dbg:c(application, which_applications, []).
          +(<0.92.0>) <0.45.0> ! {'$gen_call',{<0.92.0>,
          +                                    [alias|
          +                                     #Ref<0.0.11779.270031856.1478295555.230456>]},
          +                                   which_applications} (Timestamp: {1710,
                                                                               847802,
          -                                                                    479222})
          -(<0.92.0>) out {gen,do_call,4} (Timestamp: {1710,847802,479231})
          -(<0.92.0>) in {gen,do_call,4} (Timestamp: {1710,847802,479271})
          -(<0.92.0>) << {[alias|#Ref<0.0.11779.270031856.1478295555.230456>],
          -               [{stdlib,"ERTS  CXC 138 10","5.2.1"},
          -                {kernel,"ERTS  CXC 138 10","9.2.2"}]} (Timestamp: {1710,
          +                                                                    479222})
          +(<0.92.0>) out {gen,do_call,4} (Timestamp: {1710,847802,479231})
          +(<0.92.0>) in {gen,do_call,4} (Timestamp: {1710,847802,479271})
          +(<0.92.0>) << {[alias|#Ref<0.0.11779.270031856.1478295555.230456>],
          +               [{stdlib,"ERTS  CXC 138 10","5.2.1"},
          +                {kernel,"ERTS  CXC 138 10","9.2.2"}]} (Timestamp: {1710,
                                                                              847802,
          -                                                                   479274})
          -[{stdlib,"ERTS  CXC 138 10","5.2.1"},
          - {kernel,"ERTS  CXC 138 10","9.2.2"}]

          Four trace events are generated:

          • A send event (!) for the sending of a request from the current process + 479274}) +[{stdlib,"ERTS CXC 138 10","5.2.1"}, + {kernel,"ERTS CXC 138 10","9.2.2"}]

          Four trace events are generated:

          • A send event (!) for the sending of a request from the current process to the application_controller process.
          • A schedule-out event (out) when the current process schedules out while waiting in a receive for the reply to arrive.
          • A schedule-in event (in) when the current process is scheduled in when reply has arrived.
          • A receive event (<<) when the current process retrieves the reply from the application_controller process.

          The dbg:c/4 function has a fourth argument for specifying the trace flags. -Here is how to only show message sending and receiving:

          2> dbg:c(application, which_applications, [], m).
          -(<0.96.0>) <0.45.0> ! {'$gen_call',{<0.96.0>,
          -                                    [alias|
          -                                     #Ref<0.0.12291.270031856.1478295555.230496>]},
          -                                   which_applications}
          -(<0.96.0>) << {[alias|#Ref<0.0.12291.270031856.1478295555.230496>],
          -               [{stdlib,"ERTS  CXC 138 10","5.2.1"},
          -                {kernel,"ERTS  CXC 138 10","9.2.2"}]}
          -[{stdlib,"ERTS  CXC 138 10","5.2.1"},
          - {kernel,"ERTS  CXC 138 10","9.2.2"}]

          +Here is how to only show message sending and receiving:

          2> dbg:c(application, which_applications, [], m).
          +(<0.96.0>) <0.45.0> ! {'$gen_call',{<0.96.0>,
          +                                    [alias|
          +                                     #Ref<0.0.12291.270031856.1478295555.230496>]},
          +                                   which_applications}
          +(<0.96.0>) << {[alias|#Ref<0.0.12291.270031856.1478295555.230496>],
          +               [{stdlib,"ERTS  CXC 138 10","5.2.1"},
          +                {kernel,"ERTS  CXC 138 10","9.2.2"}]}
          +[{stdlib,"ERTS  CXC 138 10","5.2.1"},
          + {kernel,"ERTS  CXC 138 10","9.2.2"}]

          @@ -189,35 +189,35 @@

          Another way of tracing from the shell is to explicitly start a tracer and set the trace flags of your choice on the processes you want to trace. -For example, here is how to trace messages and process events:

          1> Pid = spawn(fun() -> receive {From,Msg} -> From ! Msg end end).
          +For example, here is how to trace messages and process events:

          1> Pid = spawn(fun() -> receive {From,Msg} -> From ! Msg end end).
           <0.90.0>
          -2> dbg:tracer().
          -{ok,<0.92.0>}
          -3> dbg:p(Pid, [m,procs]).
          -{ok,[{matched,nonode@nohost,1}]}
          -4> Pid ! {self(),hello}.
          -(<0.90.0>) << {<0.88.0>,hello}
          -{<0.88.0>,hello}
          -(<0.90.0>) <0.88.0> ! hello
          -(<0.90.0>) exit normal
          -5> flush().
          +2> dbg:tracer().
          +{ok,<0.92.0>}
          +3> dbg:p(Pid, [m,procs]).
          +{ok,[{matched,nonode@nohost,1}]}
          +4> Pid ! {self(),hello}.
          +(<0.90.0>) << {<0.88.0>,hello}
          +{<0.88.0>,hello}
          +(<0.90.0>) <0.88.0> ! hello
          +(<0.90.0>) exit normal
          +5> flush().
           Shell got hello
           ok

          In order to trace functions call, in addition to enabling the call trace flag for the process, it is also necessary to set a trace pattern for the functions -to trace.

          Example:

          1> dbg:tracer().
          -{ok,<0.90.0>}
          -2> dbg:p(all, call).
          -{ok,[{matched,nonode@nohost,49}]}
          -3> dbg:tp(lists, last, 1, []).
          -{ok,[{matched,nonode@nohost,1}]}
          -4> lists:last([a,b,c,d,e]).
          -(<0.88.0>) call lists:last([a,b,c,d,e])
          +to trace.

          Example:

          1> dbg:tracer().
          +{ok,<0.90.0>}
          +2> dbg:p(all, call).
          +{ok,[{matched,nonode@nohost,49}]}
          +3> dbg:tp(lists, last, 1, []).
          +{ok,[{matched,nonode@nohost,1}]}
          +4> lists:last([a,b,c,d,e]).
          +(<0.88.0>) call lists:last([a,b,c,d,e])
           e
          -5> dbg:tp(lists, last, 1, [{'_',[],[{return_trace}]}]).
          -{ok,[{matched,nonode@nohost,1},{saved,1}]}
          -6> lists:last([a,b,c,d,e]).
          -(<0.88.0>) call lists:last([a,b,c,d,e])
          -(<0.88.0>) returned from lists:last/1 -> e
          +5> dbg:tp(lists, last, 1, [{'_',[],[{return_trace}]}]).
          +{ok,[{matched,nonode@nohost,1},{saved,1}]}
          +6> lists:last([a,b,c,d,e]).
          +(<0.88.0>) call lists:last([a,b,c,d,e])
          +(<0.88.0>) returned from lists:last/1 -> e
           e

          @@ -231,21 +231,21 @@ seq_trace and the same tracer function for both types of tracing can be used. The seq_trace messages can also be sent to a trace port for further analysis.

          As a match specification can turn on sequential tracing, the combination of dbg and seq_trace can be powerful. This brief example shows a session -where sequential tracing is used to trace the dbg module and the trace itself:

          1> dbg:tracer().
          -{ok,<0.30.0>}
          -2> {ok, Tracer} = dbg:get_tracer().
          -{ok,<0.31.0>}
          -3> seq_trace:set_system_tracer(Tracer).
          +where sequential tracing is used to trace the dbg module and the trace itself:

          1> dbg:tracer().
          +{ok,<0.30.0>}
          +2> {ok, Tracer} = dbg:get_tracer().
          +{ok,<0.31.0>}
          +3> seq_trace:set_system_tracer(Tracer).
           false
          -4> dbg:tp(dbg, get_tracer, 0, [{[],[],[{set_seq_token, send, true}]}]).
          -{ok,[{matched,nonode@nohost,1},{saved,1}]}
          -5> dbg:p(all,call).
          -{ok,[{matched,nonode@nohost,22}]}
          -6> dbg:get_tracer(), seq_trace:set_token([]).
          -(<0.25.0>) call dbg:get_tracer()
          -SeqTrace [0]: (<0.25.0>) <0.30.0> ! {<0.25.0>,get_tracer} [Serial: {2,4}]
          -SeqTrace [0]: (<0.30.0>) <0.25.0> ! {dbg,{ok,<0.31.0>}} [Serial: {4,5}]
          -{1,0,5,<0.30.0>,4}

          This session sets the system_tracer to the same process as the +4> dbg:tp(dbg, get_tracer, 0, [{[],[],[{set_seq_token, send, true}]}]). +{ok,[{matched,nonode@nohost,1},{saved,1}]} +5> dbg:p(all,call). +{ok,[{matched,nonode@nohost,22}]} +6> dbg:get_tracer(), seq_trace:set_token([]). +(<0.25.0>) call dbg:get_tracer() +SeqTrace [0]: (<0.25.0>) <0.30.0> ! {<0.25.0>,get_tracer} [Serial: {2,4}] +SeqTrace [0]: (<0.30.0>) <0.25.0> ! {dbg,{ok,<0.31.0>}} [Serial: {4,5}] +{1,0,5,<0.30.0>,4}

          This session sets the system_tracer to the same process as the ordinary tracer process (i. e. <0.31.0>) and sets the trace pattern for the function dbg:get_tracer to one that has the action of setting a sequential token. When the function is called by a traced @@ -267,20 +267,20 @@ trace handler prints to the tty using an io function such as format/2. Note that when dbg:p(all, call) is called, IO processes are also traced. Here is an example:

          %% Using a default line editing shell
          -1> dbg:tracer(process, {fun(Msg,_) -> io:format("~p~n", [Msg]), 0 end, 0}).
          -{ok,<0.37.0>}
          -2> dbg:p(all, [call]).
          -{ok,[{matched,nonode@nohost,25}]}
          -3> dbg:tp(mymod,[{'_',[],[]}]).
          -{ok,[{matched,nonode@nohost,0},{saved,1}]}
          +1> dbg:tracer(process, {fun(Msg,_) -> io:format("~p~n", [Msg]), 0 end, 0}).
          +{ok,<0.37.0>}
          +2> dbg:p(all, [call]).
          +{ok,[{matched,nonode@nohost,25}]}
          /usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/dtrace.html differs (HTML document, Unicode text, UTF-8 text)
          --- old//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/dtrace.html	2026-06-04 19:05:14.497562139 +0000
          +++ new//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/dtrace.html	2026-06-04 19:05:14.498562148 +0000
          @@ -221,7 +221,7 @@
                     Erlang programming language
           
                 

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/dyntrace.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (738)) --- old//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/dyntrace.html 2026-06-04 19:05:14.520562352 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/dyntrace.html 2026-06-04 19:05:14.520562352 +0000 @@ -857,14 +857,14 @@

          Restores the previous state of user tags and their spreading as it was before a call to spread_tag/1.

          Note that the restoring is not limited to the same process; one can utilize this to turn off spreding in one process and restore it in a -newly created process that is is actually going to send messages:

          f() ->
          -    TagData = dyntrace:spread_tag(false),
          -    spawn(fun() ->
          -             dyntrace:restore_tag(TagData),
          -             do_something()
          -          end),
          -    do_something_else(),
          -    dyntrace:restore_tag(TagData).

          Correctly handling user tags and their spreading might take some effort, as +newly created process that is is actually going to send messages:

          f() ->
          +    TagData = dyntrace:spread_tag(false),
          +    spawn(fun() ->
          +             dyntrace:restore_tag(TagData),
          +             do_something()
          +          end),
          +    do_something_else(),
          +    dyntrace:restore_tag(TagData).

          Correctly handling user tags and their spreading might take some effort, as Erlang programs tend to send and receive messages so that sometimes the user tag gets lost due to various things, like double receives or communication with a port (ports do not handle user tags, in the same way as they do not handle @@ -911,12 +911,12 @@ later call to restore_tag/1.

          The file module already spreads tags, so there is no need to manually call this function to get user tags spread to the efile driver through that module.

          The most use of this function would be if one, for example, uses the io module to communicate with an I/O-server for a regular file, such as in the following -example:

          f() ->
          -   {ok, F} = file:open("test.tst", [write]),
          -   Saved = dyntrace:spread_tag(true),
          -   io:format(F, "Hello world!", []),
          -   dyntrace:restore_tag(Saved),
          -   file:close(F).

          In this example, any user tag set in the calling process will be spread to the +example:

          f() ->
          +   {ok, F} = file:open("test.tst", [write]),
          +   Saved = dyntrace:spread_tag(true),
          +   io:format(F, "Hello world!", []),
          +   dyntrace:restore_tag(Saved),
          +   file:close(F).

          In this example, any user tag set in the calling process will be spread to the I/O-server when the io:format/3 call is done.

          @@ -946,7 +946,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/instrument.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1679)) --- old//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/instrument.html 2026-06-04 19:05:14.543562565 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/instrument.html 2026-06-04 19:05:14.543562565 +0000 @@ -355,8 +355,8 @@ the one before it.

          The upper bound of the first interval is provided by the function that returned the histogram, and the last interval has no upper bound.

          For example, the histogram below has 40 (message) blocks between 128-256 bytes in size, 78 blocks between 256-512 bytes,2 blocks between 512-1024 bytes, and 2 -blocks between 1-2KB.

          > instrument:allocations(#{ histogram_start => 128, histogram_width => 15 }).
          -{ok, {128, 0, #{ message => {0,40,78,2,2,0,0,0,0,0,0,0,0,0,0}, ... } }}
          +blocks between 1-2KB.

          > instrument:allocations(#{ histogram_start => 128, histogram_width => 15 }).
          +{ok, {128, 0, #{ message => {0,40,78,2,2,0,0,0,0,0,0,0,0,0,0}, ... } }}
          @@ -496,30 +496,30 @@ block size histograms. Defaults to 128.

        • histogram_width - The number of intervals in the allocated block size histograms. Defaults to 18.

        • flags - Controls how to group the output, for example showing allocations on a per-process basis (when possible) rather than only a -NIF/driver-basis. Defaults to [].

        Example:

        > instrument:allocations(#{ histogram_start => 128, histogram_width => 15 }).
        -{ok,{128,0,
        -     #{udp_inet =>
        -           #{driver_event_state => {0,0,0,0,0,0,0,0,0,1,0,0,0,0,0}},
        +NIF/driver-basis. Defaults to [].

      Example:

      > instrument:allocations(#{ histogram_start => 128, histogram_width => 15 }).
      +{ok,{128,0,
      +     #{udp_inet =>
      +           #{driver_event_state => {0,0,0,0,0,0,0,0,0,1,0,0,0,0,0}},
              system =>
      -           #{heap => {0,0,0,0,20,4,2,2,2,3,0,1,0,0,1},
      -             db_term => {271,3,1,52,80,1,0,0,0,0,0,0,0,0,0},
      -             code => {0,0,0,5,3,6,11,22,19,20,10,2,1,0,0},
      -             binary => {18,0,0,0,7,0,0,1,0,0,0,0,0,0,0},
      -             message => {0,40,78,2,2,0,0,0,0,0,0,0,0,0,0},
      -             ... }
      +           #{heap => {0,0,0,0,20,4,2,2,2,3,0,1,0,0,1},
      +             db_term => {271,3,1,52,80,1,0,0,0,0,0,0,0,0,0},
      +             code => {0,0,0,5,3,6,11,22,19,20,10,2,1,0,0},
      +             binary => {18,0,0,0,7,0,0,1,0,0,0,0,0,0,0},
      +             message => {0,40,78,2,2,0,0,0,0,0,0,0,0,0,0},
      +             ... }
              spawn_forker =>
      -           #{driver_select_data_state =>
      -                 {1,0,0,0,0,0,0,0,0,0,0,0,0,0,0}},
      -       ram_file_drv => #{drv_binary => {0,0,0,0,0,0,1,0,0,0,0,0,0,0,0}},
      +           #{driver_select_data_state =>
      +                 {1,0,0,0,0,0,0,0,0,0,0,0,0,0,0}},
      +       ram_file_drv => #{drv_binary => {0,0,0,0,0,0,1,0,0,0,0,0,0,0,0}},
              prim_file =>
      -           #{process_specific_data => {2,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
      -             nif_trap_export_entry => {0,4,0,0,0,0,0,0,0,0,0,0,0,0,0},
      -             monitor_extended => {0,1,0,0,0,0,0,0,0,0,0,0,0,0,0},
      -             drv_binary => {0,0,0,0,0,0,1,0,3,5,0,0,0,1,0},
      -             binary => {0,4,0,0,0,0,0,0,0,0,0,0,0,0,0}},
      +           #{process_specific_data => {2,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
      +             nif_trap_export_entry => {0,4,0,0,0,0,0,0,0,0,0,0,0,0,0},
      +             monitor_extended => {0,1,0,0,0,0,0,0,0,0,0,0,0,0,0},
      +             drv_binary => {0,0,0,0,0,0,1,0,3,5,0,0,0,1,0},
      +             binary => {0,4,0,0,0,0,0,0,0,0,0,0,0,0,0}},
              prim_buffer =>
      -           #{nif_internal => {0,4,0,0,0,0,0,0,0,0,0,0,0,0,0},
      -             binary => {0,4,0,0,0,0,0,0,0,0,0,0,0,0,0}}}}}
      + #{nif_internal => {0,4,0,0,0,0,0,0,0,0,0,0,0,0,0}, + binary => {0,4,0,0,0,0,0,0,0,0,0,0,0,0,0}}}}}
    @@ -596,15 +596,15 @@ tied to any particular scheduler. Defaults to all schedulers and the global instance.

  • histogram_start - The upper bound of the first interval in the free block size histograms. Defaults to 512.

  • histogram_width - The number of intervals in the free block size -histograms. Defaults to 14.

  • Example:

    > instrument:carriers(#{ histogram_start => 512, histogram_width => 8 }).
    -{ok,{512,
    -     [{driver_alloc,false,262144,0,
    -                    [{driver_alloc,1,32784}],
    -                    {0,0,0,0,0,0,0,1}},
    -      {binary_alloc,false,32768,0,
    -                    [{binary_alloc,15,4304}],
    -                    {3,0,0,0,1,0,0,0}},
    -      {...}|...]}}
    +histograms. Defaults to 14.

    Example:

    > instrument:carriers(#{ histogram_start => 512, histogram_width => 8 }).
    +{ok,{512,
    +     [{driver_alloc,false,262144,0,
    +                    [{driver_alloc,1,32784}],
    +                    {0,0,0,0,0,0,0,1}},
    +      {binary_alloc,false,32768,0,
    +                    [{binary_alloc,15,4304}],
    +                    {3,0,0,0,1,0,0,0}},
    +      {...}|...]}}
    @@ -633,7 +633,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/lttng.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (21072)) --- old//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/lttng.html 2026-06-04 19:05:14.564562760 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/lttng.html 2026-06-04 19:05:14.564562760 +0000 @@ -150,42 +150,42 @@ Dyntrace Tracepoints

    All tracepoints are in the domain of org_erlang_dyntrace

    All Erlang types are the string equivalent in LTTng.

    process_spawn

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • parent : string :: Process ID. Ex. "<0.131.0>"
    • entry : string :: Code Location. Ex. "lists:sort/1"

    Available through erlang:trace/3 with trace flag procs and -{tracer,dyntrace,[]} as tracer module.

    Example:

    process_spawn: { cpu_id = 3 }, { pid = "<0.131.0>", parent = "<0.130.0>", entry = "erlang:apply/2" }

    process_link

    • to : string :: Process ID or Port ID. Ex. "<0.131.0>"
    • from : string :: Process ID or Port ID. Ex. "<0.131.0>"
    • type : string :: "link" | "unlink"

    Available through erlang:trace/3 with trace flag procs and +{tracer,dyntrace,[]} as tracer module.

    Example:

    process_spawn: { cpu_id = 3 }, { pid = "<0.131.0>", parent = "<0.130.0>", entry = "erlang:apply/2" }

    process_link

    • to : string :: Process ID or Port ID. Ex. "<0.131.0>"
    • from : string :: Process ID or Port ID. Ex. "<0.131.0>"
    • type : string :: "link" | "unlink"

    Available through erlang:trace/3 with trace flag procs and {tracer,dyntrace,[]} as tracer module.

    Example:

    process_link: { cpu_id = 3 }, { from = "<0.130.0>", to = "<0.131.0>", type = "link" }

    process_exit

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • reason : string :: Exit reason. Ex. "normal"

    Available through erlang:trace/3 with trace flag procs and -{tracer,dyntrace,[]} as tracer module.

    Example:

    process_exit: { cpu_id = 3 }, { pid = "<0.130.0>", reason = "normal" }

    process_register

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • name : string :: Registered name. Ex. "logger"
    • type : string :: "register" | "unregister"

    Example:

    process_register: { cpu_id = 0 }, { pid = "<0.128.0>", name = "dyntrace_lttng_SUITE" type = "register" }

    process_scheduled

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • entry : string :: Code Location. Ex. "lists:sort/1"
    • type : string :: +{tracer,dyntrace,[]} as tracer module.

      Example:

      process_exit: { cpu_id = 3 }, { pid = "<0.130.0>", reason = "normal" }

      process_register

      • pid : string :: Process ID. Ex. "<0.131.0>"
      • name : string :: Registered name. Ex. "logger"
      • type : string :: "register" | "unregister"

      Example:

      process_register: { cpu_id = 0 }, { pid = "<0.128.0>", name = "dyntrace_lttng_SUITE" type = "register" }

      process_scheduled

      • pid : string :: Process ID. Ex. "<0.131.0>"
      • entry : string :: Code Location. Ex. "lists:sort/1"
      • type : string :: "in" | "out" | "in_exiting" | "out_exiting" | "out_exited"

      Available through erlang:trace/3 with trace flag running and -{tracer,dyntrace,[]} as tracer module.

      Example:

      process_scheduled: { cpu_id = 0 }, { pid = "<0.136.0>", entry = "erlang:apply/2", type = "in" }

      port_open

      • pid : string :: Process ID. Ex. "<0.131.0>"
      • driver : string :: Driver name. Ex. "tcp_inet"
      • port : string :: Port ID. Ex. "#Port<0.1031>"

      Available through erlang:trace/3 with trace flag ports and +{tracer,dyntrace,[]} as tracer module.

      Example:

      process_scheduled: { cpu_id = 0 }, { pid = "<0.136.0>", entry = "erlang:apply/2", type = "in" }

      port_open

      • pid : string :: Process ID. Ex. "<0.131.0>"
      • driver : string :: Driver name. Ex. "tcp_inet"
      • port : string :: Port ID. Ex. "#Port<0.1031>"

      Available through erlang:trace/3 with trace flag ports and {tracer,dyntrace,[]} as tracer module.

      Example:

      port_open: { cpu_id = 5 }, { pid = "<0.131.0>", driver = "'/bin/sh -s unix:cmd'", port = "#Port<0.1887>" }

      port_exit

      • port : string :: Port ID. Ex. "#Port<0.1031>"
      • reason : string :: Exit reason. Ex. "normal"

      Available through erlang:trace/3 with trace flag ports and {tracer,dyntrace,[]} as tracer module.

      Example:

      port_exit: { cpu_id = 5 }, { port = "#Port<0.1887>", reason = "normal" }

      port_link

      • to : string :: Process ID. Ex. "<0.131.0>"
      • from : string :: Process ID. Ex. "<0.131.0>"
      • type : string :: "link" | "unlink"

      Available through erlang:trace/3 with trace flag ports and -{tracer,dyntrace,[]} as tracer module.

      Example:

      port_link: { cpu_id = 5 }, { from = "#Port<0.1887>", to = "<0.131.0>", type = "unlink" }

      port_scheduled

      Available through erlang:trace/3 with trace flag running and +{tracer,dyntrace,[]} as tracer module.

      Example:

      port_link: { cpu_id = 5 }, { from = "#Port<0.1887>", to = "<0.131.0>", type = "unlink" }

      port_scheduled

      Available through erlang:trace/3 with trace flag running and {tracer,dyntrace,[]} as tracer module.

      • port : string :: Port ID. Ex. "#Port<0.1031>"
      • entry : string :: Callback. Ex. "open"
      • type : string :: -"in" | "out" | "in_exiting" | "out_exiting" | "out_exited"

      Example:

      port_scheduled: { cpu_id = 5 }, { pid = "#Port<0.1905>", entry = "close", type = "out" }

      Available through erlang:trace/3 with trace flag running and +"in" | "out" | "in_exiting" | "out_exiting" | "out_exited"

    Example:

    port_scheduled: { cpu_id = 5 }, { pid = "#Port<0.1905>", entry = "close", type = "out" }

    Available through erlang:trace/3 with trace flag running and {tracer,dyntrace,[]} as tracer module.

    function_call

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • entry : string :: Code Location. Ex. "lists:sort/1"
    • depth : integer :: Stack depth. Ex. 0

    Available through erlang:trace/3 with trace flag call and -{tracer,dyntrace,[]} as tracer module.

    Example:

    function_call: { cpu_id = 5 }, { pid = "<0.145.0>", entry = "dyntrace_lttng_SUITE:'-t_call/1-fun-1-'/0", depth = 0 }

    function_return

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • entry : string :: Code Location. Ex. "lists:sort/1"
    • depth : integer :: Stack depth. Ex. 0

    Available through erlang:trace/3 with trace flag call or return_to and -{tracer,dyntrace,[]} as tracer module.

    Example:

    function_return: { cpu_id = 5 }, { pid = "<0.145.0>", entry = "dyntrace_lttng_SUITE:waiter/0", depth = 0 }

    function_exception

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • entry : string :: Code Location. Ex. "lists:sort/1"
    • class : string :: Error reason. Ex. "error"

    Available through erlang:trace/3 with trace flag call and -{tracer,dyntrace,[]} as tracer module.

    Example:

    function_exception: { cpu_id = 5 }, { pid = "<0.144.0>", entry = "t:call_exc/1", class = "error" }

    message_send

    • from : string :: Process ID or Port ID. Ex. "<0.131.0>"
    • to : string :: Process ID or Port ID. Ex. "<0.131.0>"
    • message : string :: Message sent. Ex. "{<0.162.0>,ok}"

    Available through erlang:trace/3 with trace flag send and +{tracer,dyntrace,[]} as tracer module.

    Example:

    function_call: { cpu_id = 5 }, { pid = "<0.145.0>", entry = "dyntrace_lttng_SUITE:'-t_call/1-fun-1-'/0", depth = 0 }

    function_return

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • entry : string :: Code Location. Ex. "lists:sort/1"
    • depth : integer :: Stack depth. Ex. 0

    Available through erlang:trace/3 with trace flag call or return_to and +{tracer,dyntrace,[]} as tracer module.

    Example:

    function_return: { cpu_id = 5 }, { pid = "<0.145.0>", entry = "dyntrace_lttng_SUITE:waiter/0", depth = 0 }

    function_exception

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • entry : string :: Code Location. Ex. "lists:sort/1"
    • class : string :: Error reason. Ex. "error"

    Available through erlang:trace/3 with trace flag call and +{tracer,dyntrace,[]} as tracer module.

    Example:

    function_exception: { cpu_id = 5 }, { pid = "<0.144.0>", entry = "t:call_exc/1", class = "error" }

    message_send

    • from : string :: Process ID or Port ID. Ex. "<0.131.0>"
    • to : string :: Process ID or Port ID. Ex. "<0.131.0>"
    • message : string :: Message sent. Ex. "{<0.162.0>,ok}"

    Available through erlang:trace/3 with trace flag send and {tracer,dyntrace,[]} as tracer module.

    Example:

    message_send: { cpu_id = 3 }, { from = "#Port<0.1938>", to = "<0.160.0>", message = "{#Port<0.1938>,eof}" }

    message_receive

    • to : string :: Process ID or Port ID. Ex. "<0.131.0>"
    • message : string :: Message received. Ex. "{<0.162.0>,ok}"

    Available through erlang:trace/3 with trace flag 'receive' and {tracer,dyntrace,[]} as tracer module.

    Example:

    message_receive: { cpu_id = 7 }, { to = "<0.167.0>", message = "{<0.165.0>,ok}" }

    gc_minor_start

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • need : integer :: Heap need. Ex. 2
    • heap : integer :: Young heap word size. Ex. 233
    • old_heap : integer :: Old heap word size. Ex. 233

    Available through erlang:trace/3 with trace flag garbage_collection and -{tracer,dyntrace,[]} as tracer module.

    Example:

    gc_minor_start: { cpu_id = 0 }, { pid = "<0.172.0>", need = 0, heap = 610, old_heap = 0 }

    gc_minor_end

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • reclaimed : integer :: Heap reclaimed. Ex. 2
    • heap : integer :: Young heap word size. Ex. 233
    • old_heap : integer :: Old heap word size. Ex. 233

    Available through erlang:trace/3 with trace flag garbage_collection and -{tracer,dyntrace,[]} as tracer module.

    Example:

    gc_minor_end: { cpu_id = 0 }, { pid = "<0.172.0>", reclaimed = 120, heap = 1598, old_heap = 1598 }

    gc_major_start

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • need : integer :: Heap need. Ex. 2
    • heap : integer :: Young heap word size. Ex. 233
    • old_heap : integer :: Old heap word size. Ex. 233

    Available through erlang:trace/3 with trace flag garbage_collection and -{tracer,dyntrace,[]} as tracer module.

    Example:

    gc_major_start: { cpu_id = 0 }, { pid = "<0.172.0>", need = 8, heap = 2586, old_heap = 1598 }

    gc_major_end

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • reclaimed : integer :: Heap reclaimed. Ex. 2
    • heap : integer :: Young heap word size. Ex. 233
    • old_heap : integer :: Old heap word size. Ex. 233

    Available through erlang:trace/3 with trace flag garbage_collection and +{tracer,dyntrace,[]} as tracer module.

    Example:

    gc_minor_start: { cpu_id = 0 }, { pid = "<0.172.0>", need = 0, heap = 610, old_heap = 0 }

    gc_minor_end

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • reclaimed : integer :: Heap reclaimed. Ex. 2
    • heap : integer :: Young heap word size. Ex. 233
    • old_heap : integer :: Old heap word size. Ex. 233

    Available through erlang:trace/3 with trace flag garbage_collection and +{tracer,dyntrace,[]} as tracer module.

    Example:

    gc_minor_end: { cpu_id = 0 }, { pid = "<0.172.0>", reclaimed = 120, heap = 1598, old_heap = 1598 }

    gc_major_start

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • need : integer :: Heap need. Ex. 2
    • heap : integer :: Young heap word size. Ex. 233
    • old_heap : integer :: Old heap word size. Ex. 233

    Available through erlang:trace/3 with trace flag garbage_collection and +{tracer,dyntrace,[]} as tracer module.

    Example:

    gc_major_start: { cpu_id = 0 }, { pid = "<0.172.0>", need = 8, heap = 2586, old_heap = 1598 }

    gc_major_end

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • reclaimed : integer :: Heap reclaimed. Ex. 2
    • heap : integer :: Young heap word size. Ex. 233
    • old_heap : integer :: Old heap word size. Ex. 233

    Available through erlang:trace/3 with trace flag garbage_collection and {tracer,dyntrace,[]} as tracer module.

    Example:

    gc_major_end: { cpu_id = 0 }, { pid = "<0.172.0>", reclaimed = 240, heap = 4185, old_heap = 0 }

    BEAM Tracepoints

    -

    All tracepoints are in the domain of org_erlang_otp

    All Erlang types are the string equivalent in LTTng.

    driver_init

    • driver : string :: Driver name. Ex. "tcp_inet"
    • major : integer :: Major version. Ex. 3
    • minor : integer :: Minor version. Ex. 1
    • flags : integer :: Flags. Ex. 1

    Example:

    driver_init: { cpu_id = 2 }, { driver = "caller_drv", major = 3, minor = 3, flags = 1 }

    driver_start

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • driver : string :: Driver name. Ex. "tcp_inet"
    • port : string :: Port ID. Ex. "#Port<0.1031>"

    Example:

    driver_start: { cpu_id = 2 }, { pid = "<0.198.0>", driver = "caller_drv", port = "#Port<0.3676>" }

    driver_output

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • port : string :: Port ID. Ex. "#Port<0.1031>"
    • driver : string :: Driver name. Ex. "tcp_inet"
    • bytes : integer :: Size of data returned. Ex. 82

    Example:

    driver_output: { cpu_id = 2 }, { pid = "<0.198.0>", port = "#Port<0.3677>", driver = "/bin/sh -s unix:cmd", bytes = 36 }

    driver_outputv

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • port : string :: Port ID. Ex. "#Port<0.1031>"
    • driver : string :: Driver name. Ex. "tcp_inet"
    • bytes : integer :: Size of data returned. Ex. 82

    Example:

    driver_outputv: { cpu_id = 5 }, { pid = "<0.194.0>", port = "#Port<0.3663>", driver = "tcp_inet", bytes = 3 }

    driver_ready_input

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • port : string :: Port ID. Ex. "#Port<0.1031>"
    • driver : string :: Driver name. Ex. "tcp_inet"

    Example:

    driver_ready_input: { cpu_id = 5 }, { pid = "<0.189.0>", port = "#Port<0.3637>", driver = "inet_gethost 4 " }

    driver_ready_output

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • port : string :: Port ID. Ex. "#Port<0.1031>"
    • driver : string :: Driver name. Ex. "tcp_inet"

    Example:

    driver_ready_output: { cpu_id = 5 }, { pid = "<0.194.0>", port = "#Port<0.3663>", driver = "tcp_inet" }

    driver_timeout

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • port : string :: Port ID. Ex. "#Port<0.1031>"
    • driver : string :: Driver name. Ex. "tcp_inet"

    Example:

    driver_timeout: { cpu_id = 5 }, { pid = "<0.196.0>", port = "#Port<0.3664>", driver = "tcp_inet" }

    driver_stop_select

    • driver : string :: Driver name. Ex. "tcp_inet"

    Example:

    driver_stop_select: { cpu_id = 5 }, { driver = "unknown" }

    driver_flush

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • port : string :: Port ID. Ex. "#Port<0.1031>"
    • driver : string :: Driver name. Ex. "tcp_inet"

    Example:

    driver_flush: { cpu_id = 7 }, { pid = "<0.204.0>", port = "#Port<0.3686>", driver = "tcp_inet" }

    driver_stop

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • port : string :: Port ID. Ex. "#Port<0.1031>"
    • driver : string :: Driver name. Ex. "tcp_inet"

    Example:

    driver_stop: { cpu_id = 5 }, { pid = "[]", port = "#Port<0.3673>", driver = "tcp_inet" }

    driver_process_exit

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • port : string :: Port ID. Ex. "#Port<0.1031>"
    • driver : string :: Driver name. Ex. "tcp_inet"

    driver_ready_async

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • port : string :: Port ID. Ex. "#Port<0.1031>"
    • driver : string :: Driver name. Ex. "tcp_inet"

    Example:

    driver_ready_async: { cpu_id = 3 }, { pid = "<0.181.0>", port = "#Port<0.3622>", driver = "tcp_inet" }

    driver_call

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • port : string :: Port ID. Ex. "#Port<0.1031>"
    • driver : string :: Driver name. Ex. "tcp_inet"
    • command : integer :: Command integer. Ex. 1
    • bytes : integer :: Size of data returned. Ex. 82

    Example:

    driver_call: { cpu_id = 2 }, { pid = "<0.202.0>", port = "#Port<0.3676>", driver = "caller_drv", command = 0, bytes = 2 }

    driver_control

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • port : string :: Port ID. Ex. "#Port<0.1031>"
    • driver : string :: Driver name. Ex. "tcp_inet"
    • command : integer :: Command integer. Ex. 1
    • bytes : integer :: Size of data returned. Ex. 82

    Example:

    driver_control: { cpu_id = 3 }, { pid = "<0.32767.8191>", port = "#Port<0.0>", driver = "forker", command = 83, bytes = 32 }

    carrier_create

    • type : string :: Carrier type. Ex. "ets_alloc"
    • instance : integer :: Allocator instance. Ex. 1
    • size : integer :: Carrier size. Ex. 262144
    • mbc_carriers : integer :: Number of multiblock carriers in instance. Ex. 3
    • mbc_carriers_size : integer :: Total size of multiblock blocks carriers in +

      All tracepoints are in the domain of org_erlang_otp

      All Erlang types are the string equivalent in LTTng.

      driver_init

      • driver : string :: Driver name. Ex. "tcp_inet"
      • major : integer :: Major version. Ex. 3
      • minor : integer :: Minor version. Ex. 1
      • flags : integer :: Flags. Ex. 1

      Example:

      driver_init: { cpu_id = 2 }, { driver = "caller_drv", major = 3, minor = 3, flags = 1 }

      driver_start

      • pid : string :: Process ID. Ex. "<0.131.0>"
      • driver : string :: Driver name. Ex. "tcp_inet"
      • port : string :: Port ID. Ex. "#Port<0.1031>"

      Example:

      driver_start: { cpu_id = 2 }, { pid = "<0.198.0>", driver = "caller_drv", port = "#Port<0.3676>" }

      driver_output

      • pid : string :: Process ID. Ex. "<0.131.0>"
      • port : string :: Port ID. Ex. "#Port<0.1031>"
      • driver : string :: Driver name. Ex. "tcp_inet"
      • bytes : integer :: Size of data returned. Ex. 82

      Example:

      driver_output: { cpu_id = 2 }, { pid = "<0.198.0>", port = "#Port<0.3677>", driver = "/bin/sh -s unix:cmd", bytes = 36 }

      driver_outputv

      • pid : string :: Process ID. Ex. "<0.131.0>"
      • port : string :: Port ID. Ex. "#Port<0.1031>"
      • driver : string :: Driver name. Ex. "tcp_inet"
      • bytes : integer :: Size of data returned. Ex. 82

      Example:

      driver_outputv: { cpu_id = 5 }, { pid = "<0.194.0>", port = "#Port<0.3663>", driver = "tcp_inet", bytes = 3 }

      driver_ready_input

      • pid : string :: Process ID. Ex. "<0.131.0>"
      • port : string :: Port ID. Ex. "#Port<0.1031>"
      • driver : string :: Driver name. Ex. "tcp_inet"

      Example:

      driver_ready_input: { cpu_id = 5 }, { pid = "<0.189.0>", port = "#Port<0.3637>", driver = "inet_gethost 4 " }

      driver_ready_output

      • pid : string :: Process ID. Ex. "<0.131.0>"
      • port : string :: Port ID. Ex. "#Port<0.1031>"
      • driver : string :: Driver name. Ex. "tcp_inet"

      Example:

      driver_ready_output: { cpu_id = 5 }, { pid = "<0.194.0>", port = "#Port<0.3663>", driver = "tcp_inet" }

      driver_timeout

      • pid : string :: Process ID. Ex. "<0.131.0>"
      • port : string :: Port ID. Ex. "#Port<0.1031>"
      • driver : string :: Driver name. Ex. "tcp_inet"

      Example:

      driver_timeout: { cpu_id = 5 }, { pid = "<0.196.0>", port = "#Port<0.3664>", driver = "tcp_inet" }

      driver_stop_select

      • driver : string :: Driver name. Ex. "tcp_inet"

      Example:

      driver_stop_select: { cpu_id = 5 }, { driver = "unknown" }

      driver_flush

      • pid : string :: Process ID. Ex. "<0.131.0>"
      • port : string :: Port ID. Ex. "#Port<0.1031>"
      • driver : string :: Driver name. Ex. "tcp_inet"

      Example:

      driver_flush: { cpu_id = 7 }, { pid = "<0.204.0>", port = "#Port<0.3686>", driver = "tcp_inet" }

      driver_stop

      • pid : string :: Process ID. Ex. "<0.131.0>"
      • port : string :: Port ID. Ex. "#Port<0.1031>"
      • driver : string :: Driver name. Ex. "tcp_inet"

      Example:

      driver_stop: { cpu_id = 5 }, { pid = "[]", port = "#Port<0.3673>", driver = "tcp_inet" }

      driver_process_exit

      • pid : string :: Process ID. Ex. "<0.131.0>"
      • port : string :: Port ID. Ex. "#Port<0.1031>"
      • driver : string :: Driver name. Ex. "tcp_inet"

      driver_ready_async

      • pid : string :: Process ID. Ex. "<0.131.0>"
      • port : string :: Port ID. Ex. "#Port<0.1031>"
      • driver : string :: Driver name. Ex. "tcp_inet"

      Example:

      driver_ready_async: { cpu_id = 3 }, { pid = "<0.181.0>", port = "#Port<0.3622>", driver = "tcp_inet" }

      driver_call

      • pid : string :: Process ID. Ex. "<0.131.0>"
      • port : string :: Port ID. Ex. "#Port<0.1031>"
      • driver : string :: Driver name. Ex. "tcp_inet"
      • command : integer :: Command integer. Ex. 1
      • bytes : integer :: Size of data returned. Ex. 82

      Example:

      driver_call: { cpu_id = 2 }, { pid = "<0.202.0>", port = "#Port<0.3676>", driver = "caller_drv", command = 0, bytes = 2 }

      driver_control

      • pid : string :: Process ID. Ex. "<0.131.0>"
      • port : string :: Port ID. Ex. "#Port<0.1031>"
      • driver : string :: Driver name. Ex. "tcp_inet"
      • command : integer :: Command integer. Ex. 1
      • bytes : integer :: Size of data returned. Ex. 82

      Example:

      driver_control: { cpu_id = 3 }, { pid = "<0.32767.8191>", port = "#Port<0.0>", driver = "forker", command = 83, bytes = 32 }

      carrier_create

      • type : string :: Carrier type. Ex. "ets_alloc"
      • instance : integer :: Allocator instance. Ex. 1
      • size : integer :: Carrier size. Ex. 262144
      • mbc_carriers : integer :: Number of multiblock carriers in instance. Ex. 3
      • mbc_carriers_size : integer :: Total size of multiblock blocks carriers in instance. Ex. 1343488
      • mbc_blocks : integer :: Number of multiblock blocks in instance. Ex. 122
      • mbc_blocks_size : integer :: Total size of all multiblock blocks in instance. Ex. 285296
      • sbc_carriers : integer :: Number of singleblock carriers in instance. Ex. 1
      • sbc_carriers_size : integer :: Total size of singleblock blocks carriers in instance. Ex. 1343488
      • sbc_blocks : integer :: Number of singleblocks in instance. Ex. 1
      • sbc_blocks_size : integer :: Total size of all singleblock blocks in -instance. Ex. 285296

      Example:

      carrier_create: { cpu_id = 2 }, { type = "ets_alloc", instance = 7, size = 2097152, mbc_carriers = 4, mbc_carriers_size = 3440640, mbc_blocks = 526, mbc_blocks_size = 1278576, sbc_carriers = 0, sbc_carriers_size = 0, sbc_blocks = 0, sbc_blocks_size = 0 }

      carrier_destroy

      • type : string :: Carrier type. Ex. "ets_alloc"
      • instance : integer :: Allocator instance. Ex. 1
      • size : integer :: Carrier size. Ex. 262144
      • mbc_carriers : integer :: Number of multiblock carriers in instance. Ex. 3
      • mbc_carriers_size : integer :: Total size of multiblock blocks carriers in +instance. Ex. 285296

      Example:

      carrier_create: { cpu_id = 2 }, { type = "ets_alloc", instance = 7, size = 2097152, mbc_carriers = 4, mbc_carriers_size = 3440640, mbc_blocks = 526, mbc_blocks_size = 1278576, sbc_carriers = 0, sbc_carriers_size = 0, sbc_blocks = 0, sbc_blocks_size = 0 }

      carrier_destroy

      • type : string :: Carrier type. Ex. "ets_alloc"
      • instance : integer :: Allocator instance. Ex. 1
      • size : integer :: Carrier size. Ex. 262144
      • mbc_carriers : integer :: Number of multiblock carriers in instance. Ex. 3
      • mbc_carriers_size : integer :: Total size of multiblock blocks carriers in instance. Ex. 1343488
      • mbc_blocks : integer :: Number of multiblock blocks in instance. Ex. 122
      • mbc_blocks_size : integer :: Total size of all multiblock blocks in instance. Ex. 285296
      • sbc_carriers : integer :: Number of singleblock carriers in instance. Ex. 1
      • sbc_carriers_size : integer :: Total size of singleblock blocks carriers in instance. Ex. 1343488
      • sbc_blocks : integer :: Number of singleblocks in instance. Ex. 1
      • sbc_blocks_size : integer :: Total size of all singleblock blocks in -instance. Ex. 285296

      Example:

      carrier_destroy: { cpu_id = 6 }, { type = "ets_alloc", instance = 7, size = 262144, mbc_carriers = 3, mbc_carriers_size = 3178496, mbc_blocks = 925, mbc_blocks_size = 2305336, sbc_carriers = 0, sbc_carriers_size = 0, sbc_blocks = 0, sbc_blocks_size = 0 }

      carrier_pool_put

      • type : string :: Carrier type. Ex. "ets_alloc"
      • instance : integer :: Allocator instance. Ex. 1
      • size : integer :: Carrier size. Ex. 262144

      Example:

      carrier_pool_put: { cpu_id = 3 }, { type = "ets_alloc", instance = 5, size = 1048576 }

      carrier_pool_get

      • type : string :: Carrier type. Ex. "ets_alloc"
      • instance : integer :: Allocator instance. Ex. 1
      • size : integer :: Carrier size. Ex. 262144

      Example:

      carrier_pool_get: { cpu_id = 7 }, { type = "ets_alloc", instance = 4, size = 3208 }

      +instance. Ex. 285296

    Example:

    carrier_destroy: { cpu_id = 6 }, { type = "ets_alloc", instance = 7, size = 262144, mbc_carriers = 3, mbc_carriers_size = 3178496, mbc_blocks = 925, mbc_blocks_size = 2305336, sbc_carriers = 0, sbc_carriers_size = 0, sbc_blocks = 0, sbc_blocks_size = 0 }

    carrier_pool_put

    • type : string :: Carrier type. Ex. "ets_alloc"
    • instance : integer :: Allocator instance. Ex. 1
    • size : integer :: Carrier size. Ex. 262144

    Example:

    carrier_pool_put: { cpu_id = 3 }, { type = "ets_alloc", instance = 5, size = 1048576 }

    carrier_pool_get

    • type : string :: Carrier type. Ex. "ets_alloc"
    • instance : integer :: Allocator instance. Ex. 1
    • size : integer :: Carrier size. Ex. 262144

    Example:

    carrier_pool_get: { cpu_id = 7 }, { type = "ets_alloc", instance = 4, size = 3208 }

    @@ -198,10 +198,10 @@ Erlang/OTP 19 [erts-8.0] [source-4d7b24d] [64-bit] [smp:8:8] [async-threads:10] [hipe] [kernel-poll:false] [lttng] Eshell V8.0 (abort with ^G) -1>

    Load the dyntrace module.

    1> l(dyntrace).
    -{module,dyntrace}

    All tracepoints via dyntrace are now visible and can be listed through +1>

    Load the dyntrace module.

    1> l(dyntrace).
    +{module,dyntrace}

    All tracepoints via dyntrace are now visible and can be listed through lttng list -u.

    Enable the process_register LTTng tracepoint for Erlang.

    $ lttng enable-event -u org_erlang_dyntrace:process_register
    -UST event org_erlang_dyntrace:process_register created in channel channel0

    Enable process tracing for new processes and use dyntrace as tracer backend.

    2> erlang:trace(new,true,[procs,{tracer,dyntrace,[]}]).
    +UST event org_erlang_dyntrace:process_register created in channel channel0

    Enable process tracing for new processes and use dyntrace as tracer backend.

    2> erlang:trace(new,true,[procs,{tracer,dyntrace,[]}]).
     0

    Start LTTng tracing.

    $ lttng start
     Tracing started for session erlang-demo

    Start the os_mon application in Erlang.

    3> application:ensure_all_started(os_mon).
     {ok,[sasl,os_mon]}

    Stop LTTng tracing and view the result.

    $ lttng stop
    @@ -275,7 +275,7 @@
               Erlang programming language
     
           

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/msacc.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1991)) --- old//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/msacc.html 2026-06-04 19:05:14.593563029 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/msacc.html 2026-06-04 19:05:14.593563029 +0000 @@ -131,9 +131,9 @@

    Convenience functions for microstate accounting

    This module implements some convenience functions for analyzing microstate accounting data. For details about how to use the basic API and what the different states represent, see -erlang:statistics(microstate_accounting).

    Basic Scenario

    1> msacc:start(1000).
    +erlang:statistics(microstate_accounting).

    Basic Scenario

    1> msacc:start(1000).
     ok
    -2> msacc:print().
    +2> msacc:print().
     Average thread real-time    : 1000513 us
     Accumulated system run-time :    2213 us
     Average scheduler run-time  :    1076 us
    @@ -141,11 +141,11 @@
             Thread      aux check_io emulator       gc    other     port    sleep
     
     Stats per thread:
    -     async( 0)    0.00%    0.00%    0.00%    0.00%    0.00%    0.00%  100.00%
    -     async( 1)    0.00%    0.00%    0.00%    0.00%    0.00%    0.00%  100.00%
    -       aux( 1)    0.00%    0.00%    0.00%    0.00%    0.00%    0.00%   99.99%
    - scheduler( 1)    0.00%    0.03%    0.13%    0.00%    0.01%    0.00%   99.82%
    - scheduler( 2)    0.00%    0.00%    0.00%    0.00%    0.03%    0.00%   99.97%
    +     async( 0)    0.00%    0.00%    0.00%    0.00%    0.00%    0.00%  100.00%
    +     async( 1)    0.00%    0.00%    0.00%    0.00%    0.00%    0.00%  100.00%
    +       aux( 1)    0.00%    0.00%    0.00%    0.00%    0.00%    0.00%   99.99%
    + scheduler( 1)    0.00%    0.03%    0.13%    0.00%    0.01%    0.00%   99.82%
    + scheduler( 2)    0.00%    0.00%    0.00%    0.00%    0.03%    0.00%   99.97%
     
     Stats per type:
              async    0.00%    0.00%    0.00%    0.00%    0.00%    0.00%  100.00%
    @@ -945,7 +945,7 @@
     this can be verbose. See the top of this reference manual for a brief
     description of what the fields mean.

    It is possible to print more specific types of statistics by first manipulating the DataOrStats using stats/2. For instance if you want to print the -percentage of run-time for each thread you can do:

    msacc:print(msacc:stats(runtime, msacc:stats())).

    If you want to only print run-time per thread type you can do:

    msacc:print(msacc:stats(type, msacc:stats(runtime, msacc:stats()))).

    Options

    • system - Print percentage of time spent in each state out of system time +percentage of run-time for each thread you can do:

      msacc:print(msacc:stats(runtime, msacc:stats())).

      If you want to only print run-time per thread type you can do:

      msacc:print(msacc:stats(type, msacc:stats(runtime, msacc:stats()))).

      Options

      • system - Print percentage of time spent in each state out of system time as well as thread time. Default: false.
      @@ -1236,7 +1236,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/notes.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1680)) --- old//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/notes.html 2026-06-04 19:05:14.619563270 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/notes.html 2026-06-04 19:05:14.619563270 +0000 @@ -1279,7 +1279,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/runtime_tools.epub/OEBPS/content.opf differs (XML 1.0 document, ASCII text) --- old//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/runtime_tools.epub/OEBPS/content.opf 2026-06-04 00:07:32.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/runtime_tools.epub/OEBPS/content.opf 2042-07-06 13:27:00.000000000 +0000 @@ -4,10 +4,10 @@ version="3.0"> runtime_tools - 2.1.1 - urn:uuid:9ec2903c-7674-6ec0-e461-794311c2560b + urn:uuid:a502ec0a-6ef9-60c3-f6f6-06bd4515f6c3 en - 2026-06-04T00:07:32Z + 2042-07-06T13:27:00Z /usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/runtime_tools.epub/OEBPS/dbg.xhtml differs (HTML document, ASCII text, with very long lines (1564)) --- old//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/runtime_tools.epub/OEBPS/dbg.xhtml 2026-06-04 00:07:32.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/runtime_tools.epub/OEBPS/dbg.xhtml 2042-07-06 13:27:00.000000000 +0000 @@ -26,16 +26,16 @@

      The Text Based Trace Facility

      This module implements a text based interface to the trace:process/4, trace:port/4, and trace:function/4 BIFs, simplifying tracing of functions, processes, ports, and messages.

      To quickly get started on tracing function calls you can use the -following code in the Erlang shell:

      1> dbg:tracer().  % Start the default trace message receiver
      -{ok,<0.90.0>}
      -2> dbg:p(all, c). % Set upp call tracing on all processes
      -{ok,[{matched,nonode@nohost,49}]}
      -3> dbg:tp(lists, seq, cx). %  Set up call and exception tracing on lists:seq/2,3
      -{ok,[{matched,nonode@nohost,2},{saved,cx}]}
      -4> lists:seq(1, 10).
      -(<0.88.0>) call lists:seq(1,10) ({erl_eval,do_apply,7,{"erl_eval.erl",904}})
      -[1,2,3,4,5,6,7,8,9,10]
      -(<0.88.0>) returned from lists:seq/2 -> [1,2,3,4,5,6,7,8,9,10]

      The utilities are also suitable to use in system testing on large systems, where +following code in the Erlang shell:

      1> dbg:tracer().  % Start the default trace message receiver
      +{ok,<0.90.0>}
      +2> dbg:p(all, c). % Set upp call tracing on all processes
      +{ok,[{matched,nonode@nohost,49}]}
      +3> dbg:tp(lists, seq, cx). %  Set up call and exception tracing on lists:seq/2,3
      +{ok,[{matched,nonode@nohost,2},{saved,cx}]}
      +4> lists:seq(1, 10).
      +(<0.88.0>) call lists:seq(1,10) ({erl_eval,do_apply,7,{"erl_eval.erl",904}})
      +[1,2,3,4,5,6,7,8,9,10]
      +(<0.88.0>) returned from lists:seq/2 -> [1,2,3,4,5,6,7,8,9,10]

      The utilities are also suitable to use in system testing on large systems, where other tools have too severe impact on the system performance. Some primitive support for sequential tracing is also included; see the advanced topics section.

      @@ -47,36 +47,36 @@

      To trace a call to a function with minimal fuss, call dbg:c(Module, Name, Arguments). dbg:c/3 starts a temporary trace receiver, enables all trace flags, and calls the designated function from a temporary process. For example, here is how to trace a call -to application:which_applications/0:

      1> dbg:c(application, which_applications, []).
      -(<0.92.0>) <0.45.0> ! {'$gen_call',{<0.92.0>,
      -                                    [alias|
      -                                     #Ref<0.0.11779.270031856.1478295555.230456>]},
      -                                   which_applications} (Timestamp: {1710,
      +to application:which_applications/0:

      1> dbg:c(application, which_applications, []).
      +(<0.92.0>) <0.45.0> ! {'$gen_call',{<0.92.0>,
      +                                    [alias|
      +                                     #Ref<0.0.11779.270031856.1478295555.230456>]},
      +                                   which_applications} (Timestamp: {1710,
                                                                           847802,
      -                                                                    479222})
      -(<0.92.0>) out {gen,do_call,4} (Timestamp: {1710,847802,479231})
      -(<0.92.0>) in {gen,do_call,4} (Timestamp: {1710,847802,479271})
      -(<0.92.0>) << {[alias|#Ref<0.0.11779.270031856.1478295555.230456>],
      -               [{stdlib,"ERTS  CXC 138 10","5.2.1"},
      -                {kernel,"ERTS  CXC 138 10","9.2.2"}]} (Timestamp: {1710,
      +                                                                    479222})
      +(<0.92.0>) out {gen,do_call,4} (Timestamp: {1710,847802,479231})
      +(<0.92.0>) in {gen,do_call,4} (Timestamp: {1710,847802,479271})
      +(<0.92.0>) << {[alias|#Ref<0.0.11779.270031856.1478295555.230456>],
      +               [{stdlib,"ERTS  CXC 138 10","5.2.1"},
      +                {kernel,"ERTS  CXC 138 10","9.2.2"}]} (Timestamp: {1710,
                                                                          847802,
      -                                                                   479274})
      -[{stdlib,"ERTS  CXC 138 10","5.2.1"},
      - {kernel,"ERTS  CXC 138 10","9.2.2"}]

      Four trace events are generated:

      • A send event (!) for the sending of a request from the current process + 479274}) +[{stdlib,"ERTS CXC 138 10","5.2.1"}, + {kernel,"ERTS CXC 138 10","9.2.2"}]

      Four trace events are generated:

      • A send event (!) for the sending of a request from the current process to the application_controller process.
      • A schedule-out event (out) when the current process schedules out while waiting in a receive for the reply to arrive.
      • A schedule-in event (in) when the current process is scheduled in when reply has arrived.
      • A receive event (<<) when the current process retrieves the reply from the application_controller process.

      The dbg:c/4 function has a fourth argument for specifying the trace flags. -Here is how to only show message sending and receiving:

      2> dbg:c(application, which_applications, [], m).
      -(<0.96.0>) <0.45.0> ! {'$gen_call',{<0.96.0>,
      -                                    [alias|
      -                                     #Ref<0.0.12291.270031856.1478295555.230496>]},
      -                                   which_applications}
      -(<0.96.0>) << {[alias|#Ref<0.0.12291.270031856.1478295555.230496>],
      -               [{stdlib,"ERTS  CXC 138 10","5.2.1"},
      -                {kernel,"ERTS  CXC 138 10","9.2.2"}]}
      -[{stdlib,"ERTS  CXC 138 10","5.2.1"},
      - {kernel,"ERTS  CXC 138 10","9.2.2"}]

      +Here is how to only show message sending and receiving:

      2> dbg:c(application, which_applications, [], m).
      +(<0.96.0>) <0.45.0> ! {'$gen_call',{<0.96.0>,
      +                                    [alias|
      +                                     #Ref<0.0.12291.270031856.1478295555.230496>]},
      +                                   which_applications}
      +(<0.96.0>) << {[alias|#Ref<0.0.12291.270031856.1478295555.230496>],
      +               [{stdlib,"ERTS  CXC 138 10","5.2.1"},
      +                {kernel,"ERTS  CXC 138 10","9.2.2"}]}
      +[{stdlib,"ERTS  CXC 138 10","5.2.1"},
      + {kernel,"ERTS  CXC 138 10","9.2.2"}]

      @@ -84,35 +84,35 @@

      Another way of tracing from the shell is to explicitly start a tracer and set the trace flags of your choice on the processes you want to trace. -For example, here is how to trace messages and process events:

      1> Pid = spawn(fun() -> receive {From,Msg} -> From ! Msg end end).
      +For example, here is how to trace messages and process events:

      1> Pid = spawn(fun() -> receive {From,Msg} -> From ! Msg end end).
       <0.90.0>
      -2> dbg:tracer().
      -{ok,<0.92.0>}
      -3> dbg:p(Pid, [m,procs]).
      -{ok,[{matched,nonode@nohost,1}]}
      -4> Pid ! {self(),hello}.
      -(<0.90.0>) << {<0.88.0>,hello}
      -{<0.88.0>,hello}
      -(<0.90.0>) <0.88.0> ! hello
      -(<0.90.0>) exit normal
      -5> flush().
      +2> dbg:tracer().
      +{ok,<0.92.0>}
      +3> dbg:p(Pid, [m,procs]).
      +{ok,[{matched,nonode@nohost,1}]}
      +4> Pid ! {self(),hello}.
      +(<0.90.0>) << {<0.88.0>,hello}
      +{<0.88.0>,hello}
      +(<0.90.0>) <0.88.0> ! hello
      +(<0.90.0>) exit normal
      +5> flush().
       Shell got hello
       ok

      In order to trace functions call, in addition to enabling the call trace flag for the process, it is also necessary to set a trace pattern for the functions -to trace.

      Example:

      1> dbg:tracer().
      -{ok,<0.90.0>}
      -2> dbg:p(all, call).
      -{ok,[{matched,nonode@nohost,49}]}
      -3> dbg:tp(lists, last, 1, []).
      -{ok,[{matched,nonode@nohost,1}]}
      -4> lists:last([a,b,c,d,e]).
      -(<0.88.0>) call lists:last([a,b,c,d,e])
      +to trace.

      Example:

      1> dbg:tracer().
      +{ok,<0.90.0>}
      +2> dbg:p(all, call).
      +{ok,[{matched,nonode@nohost,49}]}
      +3> dbg:tp(lists, last, 1, []).
      +{ok,[{matched,nonode@nohost,1}]}
      +4> lists:last([a,b,c,d,e]).
      +(<0.88.0>) call lists:last([a,b,c,d,e])
       e
      -5> dbg:tp(lists, last, 1, [{'_',[],[{return_trace}]}]).
      -{ok,[{matched,nonode@nohost,1},{saved,1}]}
      -6> lists:last([a,b,c,d,e]).
      -(<0.88.0>) call lists:last([a,b,c,d,e])
      -(<0.88.0>) returned from lists:last/1 -> e
      +5> dbg:tp(lists, last, 1, [{'_',[],[{return_trace}]}]).
      +{ok,[{matched,nonode@nohost,1},{saved,1}]}
      +6> lists:last([a,b,c,d,e]).
      +(<0.88.0>) call lists:last([a,b,c,d,e])
      +(<0.88.0>) returned from lists:last/1 -> e
       e

      @@ -126,21 +126,21 @@ seq_trace and the same tracer function for both types of tracing can be used. The seq_trace messages can also be sent to a trace port for further analysis.

      As a match specification can turn on sequential tracing, the combination of dbg and seq_trace can be powerful. This brief example shows a session -where sequential tracing is used to trace the dbg module and the trace itself:

      1> dbg:tracer().
      -{ok,<0.30.0>}
      -2> {ok, Tracer} = dbg:get_tracer().
      -{ok,<0.31.0>}
      -3> seq_trace:set_system_tracer(Tracer).
      +where sequential tracing is used to trace the dbg module and the trace itself:

      1> dbg:tracer().
      +{ok,<0.30.0>}
      +2> {ok, Tracer} = dbg:get_tracer().
      +{ok,<0.31.0>}
      +3> seq_trace:set_system_tracer(Tracer).
       false
      -4> dbg:tp(dbg, get_tracer, 0, [{[],[],[{set_seq_token, send, true}]}]).
      -{ok,[{matched,nonode@nohost,1},{saved,1}]}
      -5> dbg:p(all,call).
      -{ok,[{matched,nonode@nohost,22}]}
      -6> dbg:get_tracer(), seq_trace:set_token([]).
      -(<0.25.0>) call dbg:get_tracer()
      -SeqTrace [0]: (<0.25.0>) <0.30.0> ! {<0.25.0>,get_tracer} [Serial: {2,4}]
      -SeqTrace [0]: (<0.30.0>) <0.25.0> ! {dbg,{ok,<0.31.0>}} [Serial: {4,5}]
      -{1,0,5,<0.30.0>,4}

      This session sets the system_tracer to the same process as the +4> dbg:tp(dbg, get_tracer, 0, [{[],[],[{set_seq_token, send, true}]}]). +{ok,[{matched,nonode@nohost,1},{saved,1}]} +5> dbg:p(all,call). +{ok,[{matched,nonode@nohost,22}]} +6> dbg:get_tracer(), seq_trace:set_token([]). +(<0.25.0>) call dbg:get_tracer() +SeqTrace [0]: (<0.25.0>) <0.30.0> ! {<0.25.0>,get_tracer} [Serial: {2,4}] +SeqTrace [0]: (<0.30.0>) <0.25.0> ! {dbg,{ok,<0.31.0>}} [Serial: {4,5}] +{1,0,5,<0.30.0>,4}

      This session sets the system_tracer to the same process as the ordinary tracer process (i. e. <0.31.0>) and sets the trace pattern for the function dbg:get_tracer to one that has the action of setting a sequential token. When the function is called by a traced @@ -162,20 +162,20 @@ trace handler prints to the tty using an io function such as format/2. Note that when dbg:p(all, call) is called, IO processes are also traced. Here is an example:

      %% Using a default line editing shell
      -1> dbg:tracer(process, {fun(Msg,_) -> io:format("~p~n", [Msg]), 0 end, 0}).
      -{ok,<0.37.0>}
      -2> dbg:p(all, [call]).
      -{ok,[{matched,nonode@nohost,25}]}
      -3> dbg:tp(mymod,[{'_',[],[]}]).
      -{ok,[{matched,nonode@nohost,0},{saved,1}]}
      +1> dbg:tracer(process, {fun(Msg,_) -> io:format("~p~n", [Msg]), 0 end, 0}).
      +{ok,<0.37.0>}
      +2> dbg:p(all, [call]).
      +{ok,[{matched,nonode@nohost,25}]}
      /usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/runtime_tools.epub/OEBPS/dyntrace.xhtml differs (HTML document, ASCII text, with very long lines (738))
      --- old//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/runtime_tools.epub/OEBPS/dyntrace.xhtml	2026-06-04 00:07:32.000000000 +0000
      +++ new//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/runtime_tools.epub/OEBPS/dyntrace.xhtml	2042-07-06 13:27:00.000000000 +0000
      @@ -736,14 +736,14 @@
       

      Restores the previous state of user tags and their spreading as it was before a call to spread_tag/1.

      Note that the restoring is not limited to the same process; one can utilize this to turn off spreding in one process and restore it in a -newly created process that is is actually going to send messages:

      f() ->
      -    TagData = dyntrace:spread_tag(false),
      -    spawn(fun() ->
      -             dyntrace:restore_tag(TagData),
      -             do_something()
      -          end),
      -    do_something_else(),
      -    dyntrace:restore_tag(TagData).

      Correctly handling user tags and their spreading might take some effort, as +newly created process that is is actually going to send messages:

      f() ->
      +    TagData = dyntrace:spread_tag(false),
      +    spawn(fun() ->
      +             dyntrace:restore_tag(TagData),
      +             do_something()
      +          end),
      +    do_something_else(),
      +    dyntrace:restore_tag(TagData).

      Correctly handling user tags and their spreading might take some effort, as Erlang programs tend to send and receive messages so that sometimes the user tag gets lost due to various things, like double receives or communication with a port (ports do not handle user tags, in the same way as they do not handle @@ -790,12 +790,12 @@ later call to restore_tag/1.

      The file module already spreads tags, so there is no need to manually call this function to get user tags spread to the efile driver through that module.

      The most use of this function would be if one, for example, uses the io module to communicate with an I/O-server for a regular file, such as in the following -example:

      f() ->
      -   {ok, F} = file:open("test.tst", [write]),
      -   Saved = dyntrace:spread_tag(true),
      -   io:format(F, "Hello world!", []),
      -   dyntrace:restore_tag(Saved),
      -   file:close(F).

      In this example, any user tag set in the calling process will be spread to the +example:

      f() ->
      +   {ok, F} = file:open("test.tst", [write]),
      +   Saved = dyntrace:spread_tag(true),
      +   io:format(F, "Hello world!", []),
      +   dyntrace:restore_tag(Saved),
      +   file:close(F).

      In this example, any user tag set in the calling process will be spread to the I/O-server when the io:format/3 call is done.

      /usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/runtime_tools.epub/OEBPS/instrument.xhtml differs (HTML document, ASCII text, with very long lines (1679)) --- old//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/runtime_tools.epub/OEBPS/instrument.xhtml 2026-06-04 00:07:32.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/runtime_tools.epub/OEBPS/instrument.xhtml 2042-07-06 13:27:00.000000000 +0000 @@ -239,8 +239,8 @@ the one before it.

      The upper bound of the first interval is provided by the function that returned the histogram, and the last interval has no upper bound.

      For example, the histogram below has 40 (message) blocks between 128-256 bytes in size, 78 blocks between 256-512 bytes,2 blocks between 512-1024 bytes, and 2 -blocks between 1-2KB.

      > instrument:allocations(#{ histogram_start => 128, histogram_width => 15 }).
      -{ok, {128, 0, #{ message => {0,40,78,2,2,0,0,0,0,0,0,0,0,0,0}, ... } }}
      +blocks between 1-2KB.

      > instrument:allocations(#{ histogram_start => 128, histogram_width => 15 }).
      +{ok, {128, 0, #{ message => {0,40,78,2,2,0,0,0,0,0,0,0,0,0,0}, ... } }}
      @@ -375,30 +375,30 @@ block size histograms. Defaults to 128.

    • histogram_width - The number of intervals in the allocated block size histograms. Defaults to 18.

    • flags - Controls how to group the output, for example showing allocations on a per-process basis (when possible) rather than only a -NIF/driver-basis. Defaults to [].

    Example:

    > instrument:allocations(#{ histogram_start => 128, histogram_width => 15 }).
    -{ok,{128,0,
    -     #{udp_inet =>
    -           #{driver_event_state => {0,0,0,0,0,0,0,0,0,1,0,0,0,0,0}},
    +NIF/driver-basis. Defaults to [].

    Example:

    > instrument:allocations(#{ histogram_start => 128, histogram_width => 15 }).
    +{ok,{128,0,
    +     #{udp_inet =>
    +           #{driver_event_state => {0,0,0,0,0,0,0,0,0,1,0,0,0,0,0}},
            system =>
    -           #{heap => {0,0,0,0,20,4,2,2,2,3,0,1,0,0,1},
    -             db_term => {271,3,1,52,80,1,0,0,0,0,0,0,0,0,0},
    -             code => {0,0,0,5,3,6,11,22,19,20,10,2,1,0,0},
    -             binary => {18,0,0,0,7,0,0,1,0,0,0,0,0,0,0},
    -             message => {0,40,78,2,2,0,0,0,0,0,0,0,0,0,0},
    -             ... }
    +           #{heap => {0,0,0,0,20,4,2,2,2,3,0,1,0,0,1},
    +             db_term => {271,3,1,52,80,1,0,0,0,0,0,0,0,0,0},
    +             code => {0,0,0,5,3,6,11,22,19,20,10,2,1,0,0},
    +             binary => {18,0,0,0,7,0,0,1,0,0,0,0,0,0,0},
    +             message => {0,40,78,2,2,0,0,0,0,0,0,0,0,0,0},
    +             ... }
            spawn_forker =>
    -           #{driver_select_data_state =>
    -                 {1,0,0,0,0,0,0,0,0,0,0,0,0,0,0}},
    -       ram_file_drv => #{drv_binary => {0,0,0,0,0,0,1,0,0,0,0,0,0,0,0}},
    +           #{driver_select_data_state =>
    +                 {1,0,0,0,0,0,0,0,0,0,0,0,0,0,0}},
    +       ram_file_drv => #{drv_binary => {0,0,0,0,0,0,1,0,0,0,0,0,0,0,0}},
            prim_file =>
    -           #{process_specific_data => {2,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
    -             nif_trap_export_entry => {0,4,0,0,0,0,0,0,0,0,0,0,0,0,0},
    -             monitor_extended => {0,1,0,0,0,0,0,0,0,0,0,0,0,0,0},
    -             drv_binary => {0,0,0,0,0,0,1,0,3,5,0,0,0,1,0},
    -             binary => {0,4,0,0,0,0,0,0,0,0,0,0,0,0,0}},
    +           #{process_specific_data => {2,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
    +             nif_trap_export_entry => {0,4,0,0,0,0,0,0,0,0,0,0,0,0,0},
    +             monitor_extended => {0,1,0,0,0,0,0,0,0,0,0,0,0,0,0},
    +             drv_binary => {0,0,0,0,0,0,1,0,3,5,0,0,0,1,0},
    +             binary => {0,4,0,0,0,0,0,0,0,0,0,0,0,0,0}},
            prim_buffer =>
    -           #{nif_internal => {0,4,0,0,0,0,0,0,0,0,0,0,0,0,0},
    -             binary => {0,4,0,0,0,0,0,0,0,0,0,0,0,0,0}}}}}
    +
    #{nif_internal => {0,4,0,0,0,0,0,0,0,0,0,0,0,0,0}, + binary => {0,4,0,0,0,0,0,0,0,0,0,0,0,0,0}}}}}
    @@ -475,15 +475,15 @@ tied to any particular scheduler. Defaults to all schedulers and the global instance.

  • histogram_start - The upper bound of the first interval in the free block size histograms. Defaults to 512.

  • histogram_width - The number of intervals in the free block size -histograms. Defaults to 14.

  • Example:

    > instrument:carriers(#{ histogram_start => 512, histogram_width => 8 }).
    -{ok,{512,
    -     [{driver_alloc,false,262144,0,
    -                    [{driver_alloc,1,32784}],
    -                    {0,0,0,0,0,0,0,1}},
    -      {binary_alloc,false,32768,0,
    -                    [{binary_alloc,15,4304}],
    -                    {3,0,0,0,1,0,0,0}},
    -      {...}|...]}}
    +histograms. Defaults to 14.

    Example:

    > instrument:carriers(#{ histogram_start => 512, histogram_width => 8 }).
    +{ok,{512,
    +     [{driver_alloc,false,262144,0,
    +                    [{driver_alloc,1,32784}],
    +                    {0,0,0,0,0,0,0,1}},
    +      {binary_alloc,false,32768,0,
    +                    [{binary_alloc,15,4304}],
    +                    {3,0,0,0,1,0,0,0}},
    +      {...}|...]}}
    /usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/runtime_tools.epub/OEBPS/lttng.xhtml differs (HTML document, ASCII text, with very long lines (21072)) --- old//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/runtime_tools.epub/OEBPS/lttng.xhtml 2026-06-04 00:07:32.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/runtime_tools.epub/OEBPS/lttng.xhtml 2042-07-06 13:27:00.000000000 +0000 @@ -45,42 +45,42 @@ Dyntrace Tracepoints

    All tracepoints are in the domain of org_erlang_dyntrace

    All Erlang types are the string equivalent in LTTng.

    process_spawn

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • parent : string :: Process ID. Ex. "<0.131.0>"
    • entry : string :: Code Location. Ex. "lists:sort/1"

    Available through erlang:trace/3 with trace flag procs and -{tracer,dyntrace,[]} as tracer module.

    Example:

    process_spawn: { cpu_id = 3 }, { pid = "<0.131.0>", parent = "<0.130.0>", entry = "erlang:apply/2" }

    process_link

    • to : string :: Process ID or Port ID. Ex. "<0.131.0>"
    • from : string :: Process ID or Port ID. Ex. "<0.131.0>"
    • type : string :: "link" | "unlink"

    Available through erlang:trace/3 with trace flag procs and +{tracer,dyntrace,[]} as tracer module.

    Example:

    process_spawn: { cpu_id = 3 }, { pid = "<0.131.0>", parent = "<0.130.0>", entry = "erlang:apply/2" }

    process_link

    • to : string :: Process ID or Port ID. Ex. "<0.131.0>"
    • from : string :: Process ID or Port ID. Ex. "<0.131.0>"
    • type : string :: "link" | "unlink"

    Available through erlang:trace/3 with trace flag procs and {tracer,dyntrace,[]} as tracer module.

    Example:

    process_link: { cpu_id = 3 }, { from = "<0.130.0>", to = "<0.131.0>", type = "link" }

    process_exit

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • reason : string :: Exit reason. Ex. "normal"

    Available through erlang:trace/3 with trace flag procs and -{tracer,dyntrace,[]} as tracer module.

    Example:

    process_exit: { cpu_id = 3 }, { pid = "<0.130.0>", reason = "normal" }

    process_register

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • name : string :: Registered name. Ex. "logger"
    • type : string :: "register" | "unregister"

    Example:

    process_register: { cpu_id = 0 }, { pid = "<0.128.0>", name = "dyntrace_lttng_SUITE" type = "register" }

    process_scheduled

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • entry : string :: Code Location. Ex. "lists:sort/1"
    • type : string :: +{tracer,dyntrace,[]} as tracer module.

      Example:

      process_exit: { cpu_id = 3 }, { pid = "<0.130.0>", reason = "normal" }

      process_register

      • pid : string :: Process ID. Ex. "<0.131.0>"
      • name : string :: Registered name. Ex. "logger"
      • type : string :: "register" | "unregister"

      Example:

      process_register: { cpu_id = 0 }, { pid = "<0.128.0>", name = "dyntrace_lttng_SUITE" type = "register" }

      process_scheduled

      • pid : string :: Process ID. Ex. "<0.131.0>"
      • entry : string :: Code Location. Ex. "lists:sort/1"
      • type : string :: "in" | "out" | "in_exiting" | "out_exiting" | "out_exited"

      Available through erlang:trace/3 with trace flag running and -{tracer,dyntrace,[]} as tracer module.

      Example:

      process_scheduled: { cpu_id = 0 }, { pid = "<0.136.0>", entry = "erlang:apply/2", type = "in" }

      port_open

      • pid : string :: Process ID. Ex. "<0.131.0>"
      • driver : string :: Driver name. Ex. "tcp_inet"
      • port : string :: Port ID. Ex. "#Port<0.1031>"

      Available through erlang:trace/3 with trace flag ports and +{tracer,dyntrace,[]} as tracer module.

      Example:

      process_scheduled: { cpu_id = 0 }, { pid = "<0.136.0>", entry = "erlang:apply/2", type = "in" }

      port_open

      • pid : string :: Process ID. Ex. "<0.131.0>"
      • driver : string :: Driver name. Ex. "tcp_inet"
      • port : string :: Port ID. Ex. "#Port<0.1031>"

      Available through erlang:trace/3 with trace flag ports and {tracer,dyntrace,[]} as tracer module.

      Example:

      port_open: { cpu_id = 5 }, { pid = "<0.131.0>", driver = "'/bin/sh -s unix:cmd'", port = "#Port<0.1887>" }

      port_exit

      • port : string :: Port ID. Ex. "#Port<0.1031>"
      • reason : string :: Exit reason. Ex. "normal"

      Available through erlang:trace/3 with trace flag ports and {tracer,dyntrace,[]} as tracer module.

      Example:

      port_exit: { cpu_id = 5 }, { port = "#Port<0.1887>", reason = "normal" }

      port_link

      • to : string :: Process ID. Ex. "<0.131.0>"
      • from : string :: Process ID. Ex. "<0.131.0>"
      • type : string :: "link" | "unlink"

      Available through erlang:trace/3 with trace flag ports and -{tracer,dyntrace,[]} as tracer module.

      Example:

      port_link: { cpu_id = 5 }, { from = "#Port<0.1887>", to = "<0.131.0>", type = "unlink" }

      port_scheduled

      Available through erlang:trace/3 with trace flag running and +{tracer,dyntrace,[]} as tracer module.

      Example:

      port_link: { cpu_id = 5 }, { from = "#Port<0.1887>", to = "<0.131.0>", type = "unlink" }

      port_scheduled

      Available through erlang:trace/3 with trace flag running and {tracer,dyntrace,[]} as tracer module.

      • port : string :: Port ID. Ex. "#Port<0.1031>"
      • entry : string :: Callback. Ex. "open"
      • type : string :: -"in" | "out" | "in_exiting" | "out_exiting" | "out_exited"

      Example:

      port_scheduled: { cpu_id = 5 }, { pid = "#Port<0.1905>", entry = "close", type = "out" }

      Available through erlang:trace/3 with trace flag running and +"in" | "out" | "in_exiting" | "out_exiting" | "out_exited"

    Example:

    port_scheduled: { cpu_id = 5 }, { pid = "#Port<0.1905>", entry = "close", type = "out" }

    Available through erlang:trace/3 with trace flag running and {tracer,dyntrace,[]} as tracer module.

    function_call

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • entry : string :: Code Location. Ex. "lists:sort/1"
    • depth : integer :: Stack depth. Ex. 0

    Available through erlang:trace/3 with trace flag call and -{tracer,dyntrace,[]} as tracer module.

    Example:

    function_call: { cpu_id = 5 }, { pid = "<0.145.0>", entry = "dyntrace_lttng_SUITE:'-t_call/1-fun-1-'/0", depth = 0 }

    function_return

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • entry : string :: Code Location. Ex. "lists:sort/1"
    • depth : integer :: Stack depth. Ex. 0

    Available through erlang:trace/3 with trace flag call or return_to and -{tracer,dyntrace,[]} as tracer module.

    Example:

    function_return: { cpu_id = 5 }, { pid = "<0.145.0>", entry = "dyntrace_lttng_SUITE:waiter/0", depth = 0 }

    function_exception

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • entry : string :: Code Location. Ex. "lists:sort/1"
    • class : string :: Error reason. Ex. "error"

    Available through erlang:trace/3 with trace flag call and -{tracer,dyntrace,[]} as tracer module.

    Example:

    function_exception: { cpu_id = 5 }, { pid = "<0.144.0>", entry = "t:call_exc/1", class = "error" }

    message_send

    • from : string :: Process ID or Port ID. Ex. "<0.131.0>"
    • to : string :: Process ID or Port ID. Ex. "<0.131.0>"
    • message : string :: Message sent. Ex. "{<0.162.0>,ok}"

    Available through erlang:trace/3 with trace flag send and +{tracer,dyntrace,[]} as tracer module.

    Example:

    function_call: { cpu_id = 5 }, { pid = "<0.145.0>", entry = "dyntrace_lttng_SUITE:'-t_call/1-fun-1-'/0", depth = 0 }

    function_return

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • entry : string :: Code Location. Ex. "lists:sort/1"
    • depth : integer :: Stack depth. Ex. 0

    Available through erlang:trace/3 with trace flag call or return_to and +{tracer,dyntrace,[]} as tracer module.

    Example:

    function_return: { cpu_id = 5 }, { pid = "<0.145.0>", entry = "dyntrace_lttng_SUITE:waiter/0", depth = 0 }

    function_exception

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • entry : string :: Code Location. Ex. "lists:sort/1"
    • class : string :: Error reason. Ex. "error"

    Available through erlang:trace/3 with trace flag call and +{tracer,dyntrace,[]} as tracer module.

    Example:

    function_exception: { cpu_id = 5 }, { pid = "<0.144.0>", entry = "t:call_exc/1", class = "error" }

    message_send

    • from : string :: Process ID or Port ID. Ex. "<0.131.0>"
    • to : string :: Process ID or Port ID. Ex. "<0.131.0>"
    • message : string :: Message sent. Ex. "{<0.162.0>,ok}"

    Available through erlang:trace/3 with trace flag send and {tracer,dyntrace,[]} as tracer module.

    Example:

    message_send: { cpu_id = 3 }, { from = "#Port<0.1938>", to = "<0.160.0>", message = "{#Port<0.1938>,eof}" }

    message_receive

    • to : string :: Process ID or Port ID. Ex. "<0.131.0>"
    • message : string :: Message received. Ex. "{<0.162.0>,ok}"

    Available through erlang:trace/3 with trace flag 'receive' and {tracer,dyntrace,[]} as tracer module.

    Example:

    message_receive: { cpu_id = 7 }, { to = "<0.167.0>", message = "{<0.165.0>,ok}" }

    gc_minor_start

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • need : integer :: Heap need. Ex. 2
    • heap : integer :: Young heap word size. Ex. 233
    • old_heap : integer :: Old heap word size. Ex. 233

    Available through erlang:trace/3 with trace flag garbage_collection and -{tracer,dyntrace,[]} as tracer module.

    Example:

    gc_minor_start: { cpu_id = 0 }, { pid = "<0.172.0>", need = 0, heap = 610, old_heap = 0 }

    gc_minor_end

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • reclaimed : integer :: Heap reclaimed. Ex. 2
    • heap : integer :: Young heap word size. Ex. 233
    • old_heap : integer :: Old heap word size. Ex. 233

    Available through erlang:trace/3 with trace flag garbage_collection and -{tracer,dyntrace,[]} as tracer module.

    Example:

    gc_minor_end: { cpu_id = 0 }, { pid = "<0.172.0>", reclaimed = 120, heap = 1598, old_heap = 1598 }

    gc_major_start

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • need : integer :: Heap need. Ex. 2
    • heap : integer :: Young heap word size. Ex. 233
    • old_heap : integer :: Old heap word size. Ex. 233

    Available through erlang:trace/3 with trace flag garbage_collection and -{tracer,dyntrace,[]} as tracer module.

    Example:

    gc_major_start: { cpu_id = 0 }, { pid = "<0.172.0>", need = 8, heap = 2586, old_heap = 1598 }

    gc_major_end

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • reclaimed : integer :: Heap reclaimed. Ex. 2
    • heap : integer :: Young heap word size. Ex. 233
    • old_heap : integer :: Old heap word size. Ex. 233

    Available through erlang:trace/3 with trace flag garbage_collection and +{tracer,dyntrace,[]} as tracer module.

    Example:

    gc_minor_start: { cpu_id = 0 }, { pid = "<0.172.0>", need = 0, heap = 610, old_heap = 0 }

    gc_minor_end

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • reclaimed : integer :: Heap reclaimed. Ex. 2
    • heap : integer :: Young heap word size. Ex. 233
    • old_heap : integer :: Old heap word size. Ex. 233

    Available through erlang:trace/3 with trace flag garbage_collection and +{tracer,dyntrace,[]} as tracer module.

    Example:

    gc_minor_end: { cpu_id = 0 }, { pid = "<0.172.0>", reclaimed = 120, heap = 1598, old_heap = 1598 }

    gc_major_start

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • need : integer :: Heap need. Ex. 2
    • heap : integer :: Young heap word size. Ex. 233
    • old_heap : integer :: Old heap word size. Ex. 233

    Available through erlang:trace/3 with trace flag garbage_collection and +{tracer,dyntrace,[]} as tracer module.

    Example:

    gc_major_start: { cpu_id = 0 }, { pid = "<0.172.0>", need = 8, heap = 2586, old_heap = 1598 }

    gc_major_end

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • reclaimed : integer :: Heap reclaimed. Ex. 2
    • heap : integer :: Young heap word size. Ex. 233
    • old_heap : integer :: Old heap word size. Ex. 233

    Available through erlang:trace/3 with trace flag garbage_collection and {tracer,dyntrace,[]} as tracer module.

    Example:

    gc_major_end: { cpu_id = 0 }, { pid = "<0.172.0>", reclaimed = 240, heap = 4185, old_heap = 0 }

    BEAM Tracepoints

    -

    All tracepoints are in the domain of org_erlang_otp

    All Erlang types are the string equivalent in LTTng.

    driver_init

    • driver : string :: Driver name. Ex. "tcp_inet"
    • major : integer :: Major version. Ex. 3
    • minor : integer :: Minor version. Ex. 1
    • flags : integer :: Flags. Ex. 1

    Example:

    driver_init: { cpu_id = 2 }, { driver = "caller_drv", major = 3, minor = 3, flags = 1 }

    driver_start

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • driver : string :: Driver name. Ex. "tcp_inet"
    • port : string :: Port ID. Ex. "#Port<0.1031>"

    Example:

    driver_start: { cpu_id = 2 }, { pid = "<0.198.0>", driver = "caller_drv", port = "#Port<0.3676>" }

    driver_output

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • port : string :: Port ID. Ex. "#Port<0.1031>"
    • driver : string :: Driver name. Ex. "tcp_inet"
    • bytes : integer :: Size of data returned. Ex. 82

    Example:

    driver_output: { cpu_id = 2 }, { pid = "<0.198.0>", port = "#Port<0.3677>", driver = "/bin/sh -s unix:cmd", bytes = 36 }

    driver_outputv

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • port : string :: Port ID. Ex. "#Port<0.1031>"
    • driver : string :: Driver name. Ex. "tcp_inet"
    • bytes : integer :: Size of data returned. Ex. 82

    Example:

    driver_outputv: { cpu_id = 5 }, { pid = "<0.194.0>", port = "#Port<0.3663>", driver = "tcp_inet", bytes = 3 }

    driver_ready_input

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • port : string :: Port ID. Ex. "#Port<0.1031>"
    • driver : string :: Driver name. Ex. "tcp_inet"

    Example:

    driver_ready_input: { cpu_id = 5 }, { pid = "<0.189.0>", port = "#Port<0.3637>", driver = "inet_gethost 4 " }

    driver_ready_output

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • port : string :: Port ID. Ex. "#Port<0.1031>"
    • driver : string :: Driver name. Ex. "tcp_inet"

    Example:

    driver_ready_output: { cpu_id = 5 }, { pid = "<0.194.0>", port = "#Port<0.3663>", driver = "tcp_inet" }

    driver_timeout

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • port : string :: Port ID. Ex. "#Port<0.1031>"
    • driver : string :: Driver name. Ex. "tcp_inet"

    Example:

    driver_timeout: { cpu_id = 5 }, { pid = "<0.196.0>", port = "#Port<0.3664>", driver = "tcp_inet" }

    driver_stop_select

    • driver : string :: Driver name. Ex. "tcp_inet"

    Example:

    driver_stop_select: { cpu_id = 5 }, { driver = "unknown" }

    driver_flush

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • port : string :: Port ID. Ex. "#Port<0.1031>"
    • driver : string :: Driver name. Ex. "tcp_inet"

    Example:

    driver_flush: { cpu_id = 7 }, { pid = "<0.204.0>", port = "#Port<0.3686>", driver = "tcp_inet" }

    driver_stop

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • port : string :: Port ID. Ex. "#Port<0.1031>"
    • driver : string :: Driver name. Ex. "tcp_inet"

    Example:

    driver_stop: { cpu_id = 5 }, { pid = "[]", port = "#Port<0.3673>", driver = "tcp_inet" }

    driver_process_exit

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • port : string :: Port ID. Ex. "#Port<0.1031>"
    • driver : string :: Driver name. Ex. "tcp_inet"

    driver_ready_async

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • port : string :: Port ID. Ex. "#Port<0.1031>"
    • driver : string :: Driver name. Ex. "tcp_inet"

    Example:

    driver_ready_async: { cpu_id = 3 }, { pid = "<0.181.0>", port = "#Port<0.3622>", driver = "tcp_inet" }

    driver_call

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • port : string :: Port ID. Ex. "#Port<0.1031>"
    • driver : string :: Driver name. Ex. "tcp_inet"
    • command : integer :: Command integer. Ex. 1
    • bytes : integer :: Size of data returned. Ex. 82

    Example:

    driver_call: { cpu_id = 2 }, { pid = "<0.202.0>", port = "#Port<0.3676>", driver = "caller_drv", command = 0, bytes = 2 }

    driver_control

    • pid : string :: Process ID. Ex. "<0.131.0>"
    • port : string :: Port ID. Ex. "#Port<0.1031>"
    • driver : string :: Driver name. Ex. "tcp_inet"
    • command : integer :: Command integer. Ex. 1
    • bytes : integer :: Size of data returned. Ex. 82

    Example:

    driver_control: { cpu_id = 3 }, { pid = "<0.32767.8191>", port = "#Port<0.0>", driver = "forker", command = 83, bytes = 32 }

    carrier_create

    • type : string :: Carrier type. Ex. "ets_alloc"
    • instance : integer :: Allocator instance. Ex. 1
    • size : integer :: Carrier size. Ex. 262144
    • mbc_carriers : integer :: Number of multiblock carriers in instance. Ex. 3
    • mbc_carriers_size : integer :: Total size of multiblock blocks carriers in +

      All tracepoints are in the domain of org_erlang_otp

      All Erlang types are the string equivalent in LTTng.

      driver_init

      • driver : string :: Driver name. Ex. "tcp_inet"
      • major : integer :: Major version. Ex. 3
      • minor : integer :: Minor version. Ex. 1
      • flags : integer :: Flags. Ex. 1

      Example:

      driver_init: { cpu_id = 2 }, { driver = "caller_drv", major = 3, minor = 3, flags = 1 }

      driver_start

      • pid : string :: Process ID. Ex. "<0.131.0>"
      • driver : string :: Driver name. Ex. "tcp_inet"
      • port : string :: Port ID. Ex. "#Port<0.1031>"

      Example:

      driver_start: { cpu_id = 2 }, { pid = "<0.198.0>", driver = "caller_drv", port = "#Port<0.3676>" }

      driver_output

      • pid : string :: Process ID. Ex. "<0.131.0>"
      • port : string :: Port ID. Ex. "#Port<0.1031>"
      • driver : string :: Driver name. Ex. "tcp_inet"
      • bytes : integer :: Size of data returned. Ex. 82

      Example:

      driver_output: { cpu_id = 2 }, { pid = "<0.198.0>", port = "#Port<0.3677>", driver = "/bin/sh -s unix:cmd", bytes = 36 }

      driver_outputv

      • pid : string :: Process ID. Ex. "<0.131.0>"
      • port : string :: Port ID. Ex. "#Port<0.1031>"
      • driver : string :: Driver name. Ex. "tcp_inet"
      • bytes : integer :: Size of data returned. Ex. 82

      Example:

      driver_outputv: { cpu_id = 5 }, { pid = "<0.194.0>", port = "#Port<0.3663>", driver = "tcp_inet", bytes = 3 }

      driver_ready_input

      • pid : string :: Process ID. Ex. "<0.131.0>"
      • port : string :: Port ID. Ex. "#Port<0.1031>"
      • driver : string :: Driver name. Ex. "tcp_inet"

      Example:

      driver_ready_input: { cpu_id = 5 }, { pid = "<0.189.0>", port = "#Port<0.3637>", driver = "inet_gethost 4 " }

      driver_ready_output

      • pid : string :: Process ID. Ex. "<0.131.0>"
      • port : string :: Port ID. Ex. "#Port<0.1031>"
      • driver : string :: Driver name. Ex. "tcp_inet"

      Example:

      driver_ready_output: { cpu_id = 5 }, { pid = "<0.194.0>", port = "#Port<0.3663>", driver = "tcp_inet" }

      driver_timeout

      • pid : string :: Process ID. Ex. "<0.131.0>"
      • port : string :: Port ID. Ex. "#Port<0.1031>"
      • driver : string :: Driver name. Ex. "tcp_inet"

      Example:

      driver_timeout: { cpu_id = 5 }, { pid = "<0.196.0>", port = "#Port<0.3664>", driver = "tcp_inet" }

      driver_stop_select

      • driver : string :: Driver name. Ex. "tcp_inet"

      Example:

      driver_stop_select: { cpu_id = 5 }, { driver = "unknown" }

      driver_flush

      • pid : string :: Process ID. Ex. "<0.131.0>"
      • port : string :: Port ID. Ex. "#Port<0.1031>"
      • driver : string :: Driver name. Ex. "tcp_inet"

      Example:

      driver_flush: { cpu_id = 7 }, { pid = "<0.204.0>", port = "#Port<0.3686>", driver = "tcp_inet" }

      driver_stop

      • pid : string :: Process ID. Ex. "<0.131.0>"
      • port : string :: Port ID. Ex. "#Port<0.1031>"
      • driver : string :: Driver name. Ex. "tcp_inet"

      Example:

      driver_stop: { cpu_id = 5 }, { pid = "[]", port = "#Port<0.3673>", driver = "tcp_inet" }

      driver_process_exit

      • pid : string :: Process ID. Ex. "<0.131.0>"
      • port : string :: Port ID. Ex. "#Port<0.1031>"
      • driver : string :: Driver name. Ex. "tcp_inet"

      driver_ready_async

      • pid : string :: Process ID. Ex. "<0.131.0>"
      • port : string :: Port ID. Ex. "#Port<0.1031>"
      • driver : string :: Driver name. Ex. "tcp_inet"

      Example:

      driver_ready_async: { cpu_id = 3 }, { pid = "<0.181.0>", port = "#Port<0.3622>", driver = "tcp_inet" }

      driver_call

      • pid : string :: Process ID. Ex. "<0.131.0>"
      • port : string :: Port ID. Ex. "#Port<0.1031>"
      • driver : string :: Driver name. Ex. "tcp_inet"
      • command : integer :: Command integer. Ex. 1
      • bytes : integer :: Size of data returned. Ex. 82

      Example:

      driver_call: { cpu_id = 2 }, { pid = "<0.202.0>", port = "#Port<0.3676>", driver = "caller_drv", command = 0, bytes = 2 }

      driver_control

      • pid : string :: Process ID. Ex. "<0.131.0>"
      • port : string :: Port ID. Ex. "#Port<0.1031>"
      • driver : string :: Driver name. Ex. "tcp_inet"
      • command : integer :: Command integer. Ex. 1
      • bytes : integer :: Size of data returned. Ex. 82

      Example:

      driver_control: { cpu_id = 3 }, { pid = "<0.32767.8191>", port = "#Port<0.0>", driver = "forker", command = 83, bytes = 32 }

      carrier_create

      • type : string :: Carrier type. Ex. "ets_alloc"
      • instance : integer :: Allocator instance. Ex. 1
      • size : integer :: Carrier size. Ex. 262144
      • mbc_carriers : integer :: Number of multiblock carriers in instance. Ex. 3
      • mbc_carriers_size : integer :: Total size of multiblock blocks carriers in instance. Ex. 1343488
      • mbc_blocks : integer :: Number of multiblock blocks in instance. Ex. 122
      • mbc_blocks_size : integer :: Total size of all multiblock blocks in instance. Ex. 285296
      • sbc_carriers : integer :: Number of singleblock carriers in instance. Ex. 1
      • sbc_carriers_size : integer :: Total size of singleblock blocks carriers in instance. Ex. 1343488
      • sbc_blocks : integer :: Number of singleblocks in instance. Ex. 1
      • sbc_blocks_size : integer :: Total size of all singleblock blocks in -instance. Ex. 285296

      Example:

      carrier_create: { cpu_id = 2 }, { type = "ets_alloc", instance = 7, size = 2097152, mbc_carriers = 4, mbc_carriers_size = 3440640, mbc_blocks = 526, mbc_blocks_size = 1278576, sbc_carriers = 0, sbc_carriers_size = 0, sbc_blocks = 0, sbc_blocks_size = 0 }

      carrier_destroy

      • type : string :: Carrier type. Ex. "ets_alloc"
      • instance : integer :: Allocator instance. Ex. 1
      • size : integer :: Carrier size. Ex. 262144
      • mbc_carriers : integer :: Number of multiblock carriers in instance. Ex. 3
      • mbc_carriers_size : integer :: Total size of multiblock blocks carriers in +instance. Ex. 285296

      Example:

      carrier_create: { cpu_id = 2 }, { type = "ets_alloc", instance = 7, size = 2097152, mbc_carriers = 4, mbc_carriers_size = 3440640, mbc_blocks = 526, mbc_blocks_size = 1278576, sbc_carriers = 0, sbc_carriers_size = 0, sbc_blocks = 0, sbc_blocks_size = 0 }

      carrier_destroy

      • type : string :: Carrier type. Ex. "ets_alloc"
      • instance : integer :: Allocator instance. Ex. 1
      • size : integer :: Carrier size. Ex. 262144
      • mbc_carriers : integer :: Number of multiblock carriers in instance. Ex. 3
      • mbc_carriers_size : integer :: Total size of multiblock blocks carriers in instance. Ex. 1343488
      • mbc_blocks : integer :: Number of multiblock blocks in instance. Ex. 122
      • mbc_blocks_size : integer :: Total size of all multiblock blocks in instance. Ex. 285296
      • sbc_carriers : integer :: Number of singleblock carriers in instance. Ex. 1
      • sbc_carriers_size : integer :: Total size of singleblock blocks carriers in instance. Ex. 1343488
      • sbc_blocks : integer :: Number of singleblocks in instance. Ex. 1
      • sbc_blocks_size : integer :: Total size of all singleblock blocks in -instance. Ex. 285296

      Example:

      carrier_destroy: { cpu_id = 6 }, { type = "ets_alloc", instance = 7, size = 262144, mbc_carriers = 3, mbc_carriers_size = 3178496, mbc_blocks = 925, mbc_blocks_size = 2305336, sbc_carriers = 0, sbc_carriers_size = 0, sbc_blocks = 0, sbc_blocks_size = 0 }

      carrier_pool_put

      • type : string :: Carrier type. Ex. "ets_alloc"
      • instance : integer :: Allocator instance. Ex. 1
      • size : integer :: Carrier size. Ex. 262144

      Example:

      carrier_pool_put: { cpu_id = 3 }, { type = "ets_alloc", instance = 5, size = 1048576 }

      carrier_pool_get

      • type : string :: Carrier type. Ex. "ets_alloc"
      • instance : integer :: Allocator instance. Ex. 1
      • size : integer :: Carrier size. Ex. 262144

      Example:

      carrier_pool_get: { cpu_id = 7 }, { type = "ets_alloc", instance = 4, size = 3208 }

      +instance. Ex. 285296

    Example:

    carrier_destroy: { cpu_id = 6 }, { type = "ets_alloc", instance = 7, size = 262144, mbc_carriers = 3, mbc_carriers_size = 3178496, mbc_blocks = 925, mbc_blocks_size = 2305336, sbc_carriers = 0, sbc_carriers_size = 0, sbc_blocks = 0, sbc_blocks_size = 0 }

    carrier_pool_put

    • type : string :: Carrier type. Ex. "ets_alloc"
    • instance : integer :: Allocator instance. Ex. 1
    • size : integer :: Carrier size. Ex. 262144

    Example:

    carrier_pool_put: { cpu_id = 3 }, { type = "ets_alloc", instance = 5, size = 1048576 }

    carrier_pool_get

    • type : string :: Carrier type. Ex. "ets_alloc"
    • instance : integer :: Allocator instance. Ex. 1
    • size : integer :: Carrier size. Ex. 262144

    Example:

    carrier_pool_get: { cpu_id = 7 }, { type = "ets_alloc", instance = 4, size = 3208 }

    @@ -93,10 +93,10 @@ Erlang/OTP 19 [erts-8.0] [source-4d7b24d] [64-bit] [smp:8:8] [async-threads:10] [hipe] [kernel-poll:false] [lttng] Eshell V8.0 (abort with ^G) -1>

    Load the dyntrace module.

    1> l(dyntrace).
    -{module,dyntrace}

    All tracepoints via dyntrace are now visible and can be listed through +1>

    Load the dyntrace module.

    1> l(dyntrace).
    +{module,dyntrace}

    All tracepoints via dyntrace are now visible and can be listed through lttng list -u.

    Enable the process_register LTTng tracepoint for Erlang.

    $ lttng enable-event -u org_erlang_dyntrace:process_register
    -UST event org_erlang_dyntrace:process_register created in channel channel0

    Enable process tracing for new processes and use dyntrace as tracer backend.

    2> erlang:trace(new,true,[procs,{tracer,dyntrace,[]}]).
    +UST event org_erlang_dyntrace:process_register created in channel channel0

    Enable process tracing for new processes and use dyntrace as tracer backend.

    2> erlang:trace(new,true,[procs,{tracer,dyntrace,[]}]).
     0

    Start LTTng tracing.

    $ lttng start
     Tracing started for session erlang-demo

    Start the os_mon application in Erlang.

    3> application:ensure_all_started(os_mon).
     {ok,[sasl,os_mon]}

    Stop LTTng tracing and view the result.

    $ lttng stop
    /usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/runtime_tools.epub/OEBPS/msacc.xhtml differs (HTML document, ASCII text, with very long lines (1991))
    --- old//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/runtime_tools.epub/OEBPS/msacc.xhtml	2026-06-04 00:07:32.000000000 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/runtime_tools.epub/OEBPS/msacc.xhtml	2042-07-06 13:27:00.000000000 +0000
    @@ -26,9 +26,9 @@
     

    Convenience functions for microstate accounting

    This module implements some convenience functions for analyzing microstate accounting data. For details about how to use the basic API and what the different states represent, see -erlang:statistics(microstate_accounting).

    Basic Scenario

    1> msacc:start(1000).
    +erlang:statistics(microstate_accounting).

    Basic Scenario

    1> msacc:start(1000).
     ok
    -2> msacc:print().
    +2> msacc:print().
     Average thread real-time    : 1000513 us
     Accumulated system run-time :    2213 us
     Average scheduler run-time  :    1076 us
    @@ -36,11 +36,11 @@
             Thread      aux check_io emulator       gc    other     port    sleep
     
     Stats per thread:
    -     async( 0)    0.00%    0.00%    0.00%    0.00%    0.00%    0.00%  100.00%
    -     async( 1)    0.00%    0.00%    0.00%    0.00%    0.00%    0.00%  100.00%
    -       aux( 1)    0.00%    0.00%    0.00%    0.00%    0.00%    0.00%   99.99%
    - scheduler( 1)    0.00%    0.03%    0.13%    0.00%    0.01%    0.00%   99.82%
    - scheduler( 2)    0.00%    0.00%    0.00%    0.00%    0.03%    0.00%   99.97%
    +     async( 0)    0.00%    0.00%    0.00%    0.00%    0.00%    0.00%  100.00%
    +     async( 1)    0.00%    0.00%    0.00%    0.00%    0.00%    0.00%  100.00%
    +       aux( 1)    0.00%    0.00%    0.00%    0.00%    0.00%    0.00%   99.99%
    + scheduler( 1)    0.00%    0.03%    0.13%    0.00%    0.01%    0.00%   99.82%
    + scheduler( 2)    0.00%    0.00%    0.00%    0.00%    0.03%    0.00%   99.97%
     
     Stats per type:
              async    0.00%    0.00%    0.00%    0.00%    0.00%    0.00%  100.00%
    @@ -824,7 +824,7 @@
     this can be verbose. See the top of this reference manual for a brief
     description of what the fields mean.

    It is possible to print more specific types of statistics by first manipulating the DataOrStats using stats/2. For instance if you want to print the -percentage of run-time for each thread you can do:

    msacc:print(msacc:stats(runtime, msacc:stats())).

    If you want to only print run-time per thread type you can do:

    msacc:print(msacc:stats(type, msacc:stats(runtime, msacc:stats()))).

    Options

    • system - Print percentage of time spent in each state out of system time +percentage of run-time for each thread you can do:

      msacc:print(msacc:stats(runtime, msacc:stats())).

      If you want to only print run-time per thread type you can do:

      msacc:print(msacc:stats(type, msacc:stats(runtime, msacc:stats()))).

      Options

      • system - Print percentage of time spent in each state out of system time as well as thread time. Default: false.
      /usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/runtime_tools.epub/OEBPS/scheduler.xhtml differs (HTML document, ASCII text, with very long lines (669)) --- old//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/runtime_tools.epub/OEBPS/scheduler.xhtml 2026-06-04 00:07:32.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/runtime_tools.epub/OEBPS/scheduler.xhtml 2042-07-06 13:27:00.000000000 +0000 @@ -492,7 +492,7 @@ scheduler_wall_time.

      Calculate scheduler utilizations for the time interval from when Sample was taken and "now". The same as calling scheduler:utilization(Sample, scheduler:sample_all()).

      Note

      This function is not recommended as it's so easy to get invalid results -without noticing. In particular do not do this:

      scheduler:utilization(scheduler:sample()). % DO NOT DO THIS!

      The above example takes two samples in rapid succession and calculates the +without noticing. In particular do not do this:

      scheduler:utilization(scheduler:sample()). % DO NOT DO THIS!

      The above example takes two samples in rapid succession and calculates the scheduler utilization between them. The resulting values will probably be more misleading than informative.

      Instead use scheduler:utilization/2 and call get_sample/0 to get samples with some time in between.

      /usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/runtime_tools_app.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/runtime_tools_app.html 2026-06-04 19:05:14.749564476 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/runtime_tools_app.html 2026-06-04 19:05:14.749564476 +0000 @@ -195,7 +195,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/scheduler.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (669)) --- old//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/scheduler.html 2026-06-04 19:05:14.768564652 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/scheduler.html 2026-06-04 19:05:14.768564652 +0000 @@ -613,7 +613,7 @@ scheduler_wall_time.

      Calculate scheduler utilizations for the time interval from when Sample was taken and "now". The same as calling scheduler:utilization(Sample, scheduler:sample_all()).

      Note

      This function is not recommended as it's so easy to get invalid results -without noticing. In particular do not do this:

      scheduler:utilization(scheduler:sample()). % DO NOT DO THIS!

      The above example takes two samples in rapid succession and calculates the +without noticing. In particular do not do this:

      scheduler:utilization(scheduler:sample()). % DO NOT DO THIS!

      The above example takes two samples in rapid succession and calculates the scheduler utilization between them. The resulting values will probably be more misleading than informative.

      Instead use scheduler:utilization/2 and call get_sample/0 to get samples with some time in between.

      @@ -681,7 +681,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/search.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/search.html 2026-06-04 19:05:14.785564810 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/search.html 2026-06-04 19:05:14.784564801 +0000 @@ -145,7 +145,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/system_information.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/system_information.html 2026-06-04 19:05:14.799564940 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/system_information.html 2026-06-04 19:05:14.799564940 +0000 @@ -298,7 +298,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/systemtap.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (577)) --- old//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/systemtap.html 2026-06-04 19:05:14.814565079 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/runtime_tools-2.1.1/doc/html/systemtap.html 2026-06-04 19:05:14.814565079 +0000 @@ -213,7 +213,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/404.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/404.html 2026-06-04 19:05:14.830952472 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/404.html 2026-06-04 19:05:14.830952472 +0000 @@ -147,7 +147,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/alarm_handler.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/alarm_handler.html 2026-06-04 19:05:14.848565394 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/alarm_handler.html 2026-06-04 19:05:14.848565394 +0000 @@ -418,7 +418,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/api-reference.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/api-reference.html 2026-06-04 19:05:14.864565543 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/api-reference.html 2026-06-04 19:05:14.865565552 +0000 @@ -212,7 +212,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/appup.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (777)) --- old//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/appup.html 2026-06-04 19:05:14.884565728 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/appup.html 2026-06-04 19:05:14.884565728 +0000 @@ -143,9 +143,9 @@ Application is the application name. The file is to be located in the ebin directory for the application.

      The .appup file contains one single Erlang term, which defines the instructions used to upgrade or downgrade the application. The file has the -following syntax:

      {Vsn,
      -  [{UpFromVsn, Instructions}, ...],
      -  [{DownToVsn, Instructions}, ...]}.
      • Vsn = string() - Current application version.

      • UpFromVsn = string() | binary() - An earlier application version to +following syntax:

        {Vsn,
        +  [{UpFromVsn, Instructions}, ...],
        +  [{DownToVsn, Instructions}, ...]}.
        • Vsn = string() - Current application version.

        • UpFromVsn = string() | binary() - An earlier application version to upgrade from. If it is a string, it is interpreted as a specific version number. If it is a binary, it is interpreted as a regular expression that can match multiple version numbers.

        • DownToVsn = string() | binary() - An earlier application version to @@ -221,21 +221,21 @@ version. For static modules, the new version is loaded before the process is asked to change code, both in the case of upgrading and downgrading. Callback modules are dynamic.

        update with argument supervisor is used when changing the start -specification of a supervisor.

        {load_module, Mod}
        -{load_module, Mod, DepMods}
        -{load_module, Mod, PrePurge, PostPurge, DepMods}
        -  Mod = atom()
        +specification of a supervisor.

        {load_module, Mod}
        +{load_module, Mod, DepMods}
        +{load_module, Mod, PrePurge, PostPurge, DepMods}
        +  Mod = atom()
           PrePurge = PostPurge = soft_purge | brutal_purge
        -  DepMods = [Mod]

        Simple code replacement of the module Mod.

        For a description of PrePurge and PostPurge, see update above.

        DepMods defaults to [] and defines which other modules Mod is dependent + DepMods = [Mod]

        Simple code replacement of the module Mod.

        For a description of PrePurge and PostPurge, see update above.

        DepMods defaults to [] and defines which other modules Mod is dependent on. In the relup file, instructions for loading these modules come before the -instruction for loading Mod when upgrading, and conversely when downgrading.

        {add_module, Mod}
        -{add_module, Mod, DepMods}
        -  Mod = atom()
        -  DepMods = [Mod]

        Loads a new module Mod.

        DepMods defaults to [] and defines which other modules Mod is dependent +instruction for loading Mod when upgrading, and conversely when downgrading.

        {add_module, Mod}
        +{add_module, Mod, DepMods}
        +  Mod = atom()
        +  DepMods = [Mod]

        Loads a new module Mod.

        DepMods defaults to [] and defines which other modules Mod is dependent on. In the relup file, instructions related to these modules come before the -instruction for loading Mod when upgrading, and conversely when downgrading.

        {delete_module, Mod}
        -{delete_module, Mod, DepMods}
        -  Mod = atom()

        Deletes a module Mod using the low-level instructions remove and purge.

        DepMods defaults to [] and defines which other modules Mod is dependent +instruction for loading Mod when upgrading, and conversely when downgrading.

        {delete_module, Mod}
        +{delete_module, Mod, DepMods}
        +  Mod = atom()

        Deletes a module Mod using the low-level instructions remove and purge.

        DepMods defaults to [] and defines which other modules Mod is dependent on. In the relup file, instructions related to these modules come before the instruction for removing Mod when upgrading, and conversely when downgrading.

        {add_application, Application}
         {add_application, Application, Type}
        @@ -262,9 +262,9 @@
           
           Low-Level Instructions
         
        -
        {load_object_code, {App, Vsn, [Mod]}}
        -  App = Mod = atom()
        -  Vsn = string()

        Reads each Mod from directory App-Vsn/ebin as a binary. It does not load the +

        {load_object_code, {App, Vsn, [Mod]}}
        +  App = Mod = atom()
        +  Vsn = string()

        Reads each Mod from directory App-Vsn/ebin as a binary. It does not load the modules. The instruction is to be placed first in the script to read all new code from the file to make the suspend-load-resume cycle less time-consuming.

        point_of_no_return

        If a crash occurs after this instruction, the system cannot recover and is restarted from the old release version. The instruction must only occur once in @@ -278,38 +278,38 @@ PrePurge = PostPurge = soft_purge | brutal_purge

        Makes the current version of Mod old. PrePurge is ignored. For a description of PostPurge, see the high-level instruction update earlier.

        {purge, [Mod]}
           Mod = atom()

        Purges each module Mod, that is, removes the old code. Notice that any process -executing purged code is killed.

        {suspend, [Mod | {Mod, Timeout}]}
        -  Mod = atom()
        -  Timeout = int()>0 | default | infinity

        Tries to suspend all processes using a module Mod. If a process does not +executing purged code is killed.

        {suspend, [Mod | {Mod, Timeout}]}
        +  Mod = atom()
        +  Timeout = int()>0 | default | infinity

        Tries to suspend all processes using a module Mod. If a process does not respond, it is ignored. This can cause the process to die, either because it crashes when it spontaneously switches to new code, or as a result of a purge operation. If no Timeout is specified or default is specified, the default value for sys:suspend is used.

        {resume, [Mod]}
        -  Mod = atom()

        Resumes all suspended processes using a module Mod.

        {code_change, [{Mod, Extra}]}
        -{code_change, Mode, [{Mod, Extra}]}
        -  Mod = atom()
        +  Mod = atom()

        Resumes all suspended processes using a module Mod.

        {code_change, [{Mod, Extra}]}
        +{code_change, Mode, [{Mod, Extra}]}
        +  Mod = atom()
           Mode = up | down
        -  Extra = term()

        Mode defaults to up and specifies if it is an upgrade or downgrade. This + Extra = term()

    Mode defaults to up and specifies if it is an upgrade or downgrade. This instruction sends a code_change system message to all processes using a module Mod by calling function sys:change_code, passing term Extra as argument.

    {stop, [Mod]}
       Mod = atom()

    Stops all processes using a module Mod by calling supervisor:terminate_child/2. This instruction is useful when the simplest way -to change code is to stop and restart the processes that run the code.

    {start, [Mod]}
    -  Mod = atom()

    Starts all stopped processes using a module Mod by calling -supervisor:restart_child/2.

    {sync_nodes, Id, [Node]}
    -{sync_nodes, Id, {M, F, A}}
    -  Id = term()
    -  Node = node()
    -  M = F = atom()
    -  A = [term()]

    apply(M, F, A) must return a list of nodes.

    This instruction synchronizes the release installation with other nodes. Each +to change code is to stop and restart the processes that run the code.

    {start, [Mod]}
    +  Mod = atom()

    Starts all stopped processes using a module Mod by calling +supervisor:restart_child/2.

    {sync_nodes, Id, [Node]}
    +{sync_nodes, Id, {M, F, A}}
    +  Id = term()
    +  Node = node()
    +  M = F = atom()
    +  A = [term()]

    apply(M, F, A) must return a list of nodes.

    This instruction synchronizes the release installation with other nodes. Each Node must evaluate this command with the same Id. The local node waits for all other nodes to evaluate the instruction before execution continues. If a node goes down, it is considered to be an unrecoverable error, and the local node is restarted from the old release. There is no time-out for this -instruction, which means that it can hang forever.

    {apply, {M, F, A}}
    -  M = F = atom()
    -  A = [term()]

    Evaluates apply(M, F, A).

    If the instruction appears before instruction point_of_no_return, a failure is +instruction, which means that it can hang forever.

    {apply, {M, F, A}}
    +  M = F = atom()
    +  A = [term()]

    Evaluates apply(M, F, A).

    If the instruction appears before instruction point_of_no_return, a failure is caught. release_handler:install_release/1 then returns {error,{'EXIT',Reason}}, unless {error,Error} is thrown or returned. Then it returns {error,Error}.

    If the instruction appears after instruction point_of_no_return and the @@ -395,7 +395,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    Missing in old package: /usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/dist/search_data-12AAC588.js Missing in old package: /usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/dist/search_data-12AAC588.js /usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/error_logging.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1022)) --- old//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/error_logging.html 2026-06-04 19:05:14.906565933 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/error_logging.html 2026-06-04 19:05:14.906565933 +0000 @@ -308,42 +308,42 @@ Show Reports

    Use function rb:show(Number) to show details of a specific -report:

    7> rb:show(4).
    +report:

    7> rb:show(4).
     
     PROGRESS REPORT  <0.20.0>                                   1996-10-16 16:16:36
     ===============================================================================
    -supervisor                                                     {local,sasl_sup}
    +supervisor                                                     {local,sasl_sup}
     started
    -[{pid,<0.24.0>},
    -{name,release_handler},
    -{mfa,{release_handler,start_link,[]}},
    -{restart_type,permanent},
    -{shutdown,2000},
    -{child_type,worker}]
    +[{pid,<0.24.0>},
    +{name,release_handler},
    +{mfa,{release_handler,start_link,[]}},
    +{restart_type,permanent},
    +{shutdown,2000},
    +{child_type,worker}]
     
     ok
    -8> rb:show(9).
    +8> rb:show(9).
     
     CRASH REPORT  <0.24.0>                                      1996-10-16 16:16:21
     ===============================================================================
     Crashing process
     pid                                                                 <0.24.0>
     registered_name                                              release_handler
    -error_info                             {undef,{release_handler,mbj_func,[]}}
    +error_info                             {undef,{release_handler,mbj_func,[]}}
     initial_call
    -{gen,init_it,
    -[gen_server,
    +{gen,init_it,
    +[gen_server,
     <0.20.0>,
     <0.20.0>,
    -{erlang,register},
    +{erlang,register},
     release_handler,
     release_handler,
    -[],
    -[]]}
    -ancestors                                                [sasl_sup,<0.18.0>]
    -messages                                                                  []
    -links                                                    [<0.23.0>,<0.20.0>]
    -dictionary                                                                []
    +[],
    +[]]}
    +ancestors                                                [sasl_sup,<0.18.0>]
    +messages                                                                  []
    +links                                                    [<0.23.0>,<0.20.0>]
    +dictionary                                                                []
     trap_exit                                                              false
     status                                                               running
     heap_size                                                                610
    @@ -485,7 +485,7 @@
               Erlang programming language
     
           

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/notes.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (382)) --- old//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/notes.html 2026-06-04 19:05:14.930566155 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/notes.html 2026-06-04 19:05:14.931566164 +0000 @@ -1163,7 +1163,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/rb.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (647)) --- old//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/rb.html 2026-06-04 19:05:14.954566378 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/rb.html 2026-06-04 19:05:14.964566470 +0000 @@ -1113,7 +1113,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/rel.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1220)) --- old//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/rel.html 2026-06-04 19:05:14.984566656 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/rel.html 2026-06-04 19:05:14.985566665 +0000 @@ -140,11 +140,11 @@ File Syntax

    The release resource file is to be called Name.rel.

    The .rel file contains one single Erlang term, which is called a release -specification. The file has the following syntax:

    {release, {RelName,Vsn}, {erts, EVsn},
    -  [{Application, AppVsn} |
    -   {Application, AppVsn, Type} |
    -   {Application, AppVsn, IncApps} |
    -   {Application, AppVsn, Type, IncApps}]}.
    • RelName = string() - Release name.

    • Vsn = string() - Release version.

    • EVsn = string() - ERTS version the release is intended for.

    • Application = atom() - Name of an application included in the release.

    • AppVsn = string() - Version of an application included in the release.

    • Type = permanent | transient | temporary | load | none - Start type of +specification. The file has the following syntax:

      {release, {RelName,Vsn}, {erts, EVsn},
      +  [{Application, AppVsn} |
      +   {Application, AppVsn, Type} |
      +   {Application, AppVsn, IncApps} |
      +   {Application, AppVsn, Type, IncApps}]}.
      • RelName = string() - Release name.

      • Vsn = string() - Release version.

      • EVsn = string() - ERTS version the release is intended for.

      • Application = atom() - Name of an application included in the release.

      • AppVsn = string() - Version of an application included in the release.

      • Type = permanent | transient | temporary | load | none - Start type of an application included in the release.

        If Type = permanent | transient | temporary, the application is loaded and started in the corresponding way, see application.

        If Type = load, the application is only loaded.

        If Type = none, the application is not loaded and not started, although the code for its modules is loaded.

        Defaults to permanent

      • IncApps = [atom()] - A list of applications that are included by an @@ -208,7 +208,7 @@ Erlang programming language

        -

        Copyright © 1996-2026 Ericsson AB

        +

        Copyright © 1996-2042 Ericsson AB

        /usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/release_handler.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (437)) --- old//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/release_handler.html 2026-06-04 19:05:15.014566934 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/release_handler.html 2026-06-04 19:05:15.014566934 +0000 @@ -1084,8 +1084,8 @@ create_RELEASES/4 or set_unpacked/2.

        Example:

        In the current version CurVsn of a release, the application directory of myapp is $ROOT/lib/myapp-1.0. A new version NewVsn is unpacked outside the release handler and the release handler is informed about this with a call -as follows:

        release_handler:set_unpacked(RelFile, [{myapp,"1.0","/home/user"},...]).
        -=> {ok,NewVsn}

        If NewVsn is installed with option {update_paths,true}, then +as follows:

        release_handler:set_unpacked(RelFile, [{myapp,"1.0","/home/user"},...]).
        +=> {ok,NewVsn}

        If NewVsn is installed with option {update_paths,true}, then code:lib_dir(myapp) returns /home/user/myapp-1.0.

      Note

      Installing a new release can be time consuming if there are many processes in the system. The reason is that each process must be checked for references to old code before a module can be purged. This check can lead to garbage @@ -1386,7 +1386,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/relup.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (980)) --- old//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/relup.html 2026-06-04 19:05:15.033567111 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/relup.html 2026-06-04 19:05:15.033567111 +0000 @@ -143,9 +143,9 @@

      In a target system, the release upgrade file is to be located in directory $ROOT/releases/Vsn.

      The relup file contains one single Erlang term, which defines the instructions -used to upgrade the release. The file has the following syntax:

      {Vsn,
      -  [{UpFromVsn, Descr, Instructions}, ...],
      -  [{DownToVsn, Descr, Instructions}, ...]}.
      • Vsn = string() - Current release version.

      • UpFromVsn = string() - Earlier version of the release to upgrade from.

      • Descr = term() - A user-defined parameter passed from the function +used to upgrade the release. The file has the following syntax:

        {Vsn,
        +  [{UpFromVsn, Descr, Instructions}, ...],
        +  [{DownToVsn, Descr, Instructions}, ...]}.
        • Vsn = string() - Current release version.

        • UpFromVsn = string() - Earlier version of the release to upgrade from.

        • Descr = term() - A user-defined parameter passed from the function systools:make_relup/3,4. It is used in the return value of release_handler:install_release/1,2.

        • Instructions - A list of low-level release upgrade instructions, see @@ -210,7 +210,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/sasl.epub/OEBPS/appup.xhtml differs (HTML document, ASCII text, with very long lines (777)) --- old//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/sasl.epub/OEBPS/appup.xhtml 2026-06-04 00:07:11.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/sasl.epub/OEBPS/appup.xhtml 2042-07-06 13:26:39.000000000 +0000 @@ -38,9 +38,9 @@ Application is the application name. The file is to be located in the ebin directory for the application.

          The .appup file contains one single Erlang term, which defines the instructions used to upgrade or downgrade the application. The file has the -following syntax:

          {Vsn,
          -  [{UpFromVsn, Instructions}, ...],
          -  [{DownToVsn, Instructions}, ...]}.
          • Vsn = string() - Current application version.

          • UpFromVsn = string() | binary() - An earlier application version to +following syntax:

            {Vsn,
            +  [{UpFromVsn, Instructions}, ...],
            +  [{DownToVsn, Instructions}, ...]}.
            • Vsn = string() - Current application version.

            • UpFromVsn = string() | binary() - An earlier application version to upgrade from. If it is a string, it is interpreted as a specific version number. If it is a binary, it is interpreted as a regular expression that can match multiple version numbers.

            • DownToVsn = string() | binary() - An earlier application version to @@ -116,21 +116,21 @@ version. For static modules, the new version is loaded before the process is asked to change code, both in the case of upgrading and downgrading. Callback modules are dynamic.

            update with argument supervisor is used when changing the start -specification of a supervisor.

            {load_module, Mod}
            -{load_module, Mod, DepMods}
            -{load_module, Mod, PrePurge, PostPurge, DepMods}
            -  Mod = atom()
            +specification of a supervisor.

            {load_module, Mod}
            +{load_module, Mod, DepMods}
            +{load_module, Mod, PrePurge, PostPurge, DepMods}
            +  Mod = atom()
               PrePurge = PostPurge = soft_purge | brutal_purge
            -  DepMods = [Mod]

            Simple code replacement of the module Mod.

            For a description of PrePurge and PostPurge, see update above.

            DepMods defaults to [] and defines which other modules Mod is dependent + DepMods = [Mod]

            Simple code replacement of the module Mod.

            For a description of PrePurge and PostPurge, see update above.

            DepMods defaults to [] and defines which other modules Mod is dependent on. In the relup file, instructions for loading these modules come before the -instruction for loading Mod when upgrading, and conversely when downgrading.

            {add_module, Mod}
            -{add_module, Mod, DepMods}
            -  Mod = atom()
            -  DepMods = [Mod]

            Loads a new module Mod.

            DepMods defaults to [] and defines which other modules Mod is dependent +instruction for loading Mod when upgrading, and conversely when downgrading.

            {add_module, Mod}
            +{add_module, Mod, DepMods}
            +  Mod = atom()
            +  DepMods = [Mod]

            Loads a new module Mod.

            DepMods defaults to [] and defines which other modules Mod is dependent on. In the relup file, instructions related to these modules come before the -instruction for loading Mod when upgrading, and conversely when downgrading.

            {delete_module, Mod}
            -{delete_module, Mod, DepMods}
            -  Mod = atom()

            Deletes a module Mod using the low-level instructions remove and purge.

            DepMods defaults to [] and defines which other modules Mod is dependent +instruction for loading Mod when upgrading, and conversely when downgrading.

            {delete_module, Mod}
            +{delete_module, Mod, DepMods}
            +  Mod = atom()

            Deletes a module Mod using the low-level instructions remove and purge.

            DepMods defaults to [] and defines which other modules Mod is dependent on. In the relup file, instructions related to these modules come before the instruction for removing Mod when upgrading, and conversely when downgrading.

            {add_application, Application}
             {add_application, Application, Type}
            @@ -157,9 +157,9 @@
               
               Low-Level Instructions
             
            -
            {load_object_code, {App, Vsn, [Mod]}}
            -  App = Mod = atom()
            -  Vsn = string()

            Reads each Mod from directory App-Vsn/ebin as a binary. It does not load the +

            {load_object_code, {App, Vsn, [Mod]}}
            +  App = Mod = atom()
            +  Vsn = string()

            Reads each Mod from directory App-Vsn/ebin as a binary. It does not load the modules. The instruction is to be placed first in the script to read all new code from the file to make the suspend-load-resume cycle less time-consuming.

            point_of_no_return

            If a crash occurs after this instruction, the system cannot recover and is restarted from the old release version. The instruction must only occur once in @@ -173,38 +173,38 @@ PrePurge = PostPurge = soft_purge | brutal_purge

            Makes the current version of Mod old. PrePurge is ignored. For a description of PostPurge, see the high-level instruction update earlier.

            {purge, [Mod]}
               Mod = atom()

            Purges each module Mod, that is, removes the old code. Notice that any process -executing purged code is killed.

            {suspend, [Mod | {Mod, Timeout}]}
            -  Mod = atom()
            -  Timeout = int()>0 | default | infinity

            Tries to suspend all processes using a module Mod. If a process does not +executing purged code is killed.

            {suspend, [Mod | {Mod, Timeout}]}
            +  Mod = atom()
            +  Timeout = int()>0 | default | infinity

            Tries to suspend all processes using a module Mod. If a process does not respond, it is ignored. This can cause the process to die, either because it crashes when it spontaneously switches to new code, or as a result of a purge operation. If no Timeout is specified or default is specified, the default value for sys:suspend is used.

            {resume, [Mod]}
            -  Mod = atom()

            Resumes all suspended processes using a module Mod.

            {code_change, [{Mod, Extra}]}
            -{code_change, Mode, [{Mod, Extra}]}
            -  Mod = atom()
            +  Mod = atom()

            Resumes all suspended processes using a module Mod.

            {code_change, [{Mod, Extra}]}
            +{code_change, Mode, [{Mod, Extra}]}
            +  Mod = atom()
               Mode = up | down
            -  Extra = term()

            Mode defaults to up and specifies if it is an upgrade or downgrade. This + Extra = term()

    Mode defaults to up and specifies if it is an upgrade or downgrade. This instruction sends a code_change system message to all processes using a module Mod by calling function sys:change_code, passing term Extra as argument.

    {stop, [Mod]}
       Mod = atom()

    Stops all processes using a module Mod by calling supervisor:terminate_child/2. This instruction is useful when the simplest way -to change code is to stop and restart the processes that run the code.

    {start, [Mod]}
    -  Mod = atom()

    Starts all stopped processes using a module Mod by calling -supervisor:restart_child/2.

    {sync_nodes, Id, [Node]}
    -{sync_nodes, Id, {M, F, A}}
    -  Id = term()
    -  Node = node()
    -  M = F = atom()
    -  A = [term()]

    apply(M, F, A) must return a list of nodes.

    This instruction synchronizes the release installation with other nodes. Each +to change code is to stop and restart the processes that run the code.

    {start, [Mod]}
    +  Mod = atom()

    Starts all stopped processes using a module Mod by calling +supervisor:restart_child/2.

    {sync_nodes, Id, [Node]}
    +{sync_nodes, Id, {M, F, A}}
    +  Id = term()
    +  Node = node()
    +  M = F = atom()
    +  A = [term()]

    apply(M, F, A) must return a list of nodes.

    This instruction synchronizes the release installation with other nodes. Each Node must evaluate this command with the same Id. The local node waits for all other nodes to evaluate the instruction before execution continues. If a node goes down, it is considered to be an unrecoverable error, and the local node is restarted from the old release. There is no time-out for this -instruction, which means that it can hang forever.

    {apply, {M, F, A}}
    -  M = F = atom()
    -  A = [term()]

    Evaluates apply(M, F, A).

    If the instruction appears before instruction point_of_no_return, a failure is +instruction, which means that it can hang forever.

    {apply, {M, F, A}}
    +  M = F = atom()
    +  A = [term()]

    Evaluates apply(M, F, A).

    If the instruction appears before instruction point_of_no_return, a failure is caught. release_handler:install_release/1 then returns {error,{'EXIT',Reason}}, unless {error,Error} is thrown or returned. Then it returns {error,Error}.

    If the instruction appears after instruction point_of_no_return and the /usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/sasl.epub/OEBPS/content.opf differs (XML 1.0 document, ASCII text) --- old//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/sasl.epub/OEBPS/content.opf 2026-06-04 00:07:11.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/sasl.epub/OEBPS/content.opf 2042-07-06 13:26:39.000000000 +0000 @@ -4,10 +4,10 @@ version="3.0"> sasl - 4.2.2 - urn:uuid:e6032f26-6046-fde8-999c-aff5a395e727 + urn:uuid:51afcfa1-479a-8115-4e46-422bfc42259d en - 2026-06-04T00:07:11Z + 2042-07-06T13:26:39Z /usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/sasl.epub/OEBPS/error_logging.xhtml differs (HTML document, ASCII text, with very long lines (1022)) --- old//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/sasl.epub/OEBPS/error_logging.xhtml 2026-06-04 00:07:11.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/sasl.epub/OEBPS/error_logging.xhtml 2042-07-06 13:26:39.000000000 +0000 @@ -203,42 +203,42 @@ Show Reports

    Use function rb:show(Number) to show details of a specific -report:

    7> rb:show(4).
    +report:

    7> rb:show(4).
     
     PROGRESS REPORT  <0.20.0>                                   1996-10-16 16:16:36
     ===============================================================================
    -supervisor                                                     {local,sasl_sup}
    +supervisor                                                     {local,sasl_sup}
     started
    -[{pid,<0.24.0>},
    -{name,release_handler},
    -{mfa,{release_handler,start_link,[]}},
    -{restart_type,permanent},
    -{shutdown,2000},
    -{child_type,worker}]
    +[{pid,<0.24.0>},
    +{name,release_handler},
    +{mfa,{release_handler,start_link,[]}},
    +{restart_type,permanent},
    +{shutdown,2000},
    +{child_type,worker}]
     
     ok
    -8> rb:show(9).
    +8> rb:show(9).
     
     CRASH REPORT  <0.24.0>                                      1996-10-16 16:16:21
     ===============================================================================
     Crashing process
     pid                                                                 <0.24.0>
     registered_name                                              release_handler
    -error_info                             {undef,{release_handler,mbj_func,[]}}
    +error_info                             {undef,{release_handler,mbj_func,[]}}
     initial_call
    -{gen,init_it,
    -[gen_server,
    +{gen,init_it,
    +[gen_server,
     <0.20.0>,
     <0.20.0>,
    -{erlang,register},
    +{erlang,register},
     release_handler,
     release_handler,
    -[],
    -[]]}
    -ancestors                                                [sasl_sup,<0.18.0>]
    -messages                                                                  []
    -links                                                    [<0.23.0>,<0.20.0>]
    -dictionary                                                                []
    +[],
    +[]]}
    +ancestors                                                [sasl_sup,<0.18.0>]
    +messages                                                                  []
    +links                                                    [<0.23.0>,<0.20.0>]
    +dictionary                                                                []
     trap_exit                                                              false
     status                                                               running
     heap_size                                                                610
    /usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/sasl.epub/OEBPS/release_handler.xhtml differs (HTML document, ASCII text, with very long lines (854))
    --- old//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/sasl.epub/OEBPS/release_handler.xhtml	2026-06-04 00:07:11.000000000 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/sasl.epub/OEBPS/release_handler.xhtml	2042-07-06 13:26:39.000000000 +0000
    @@ -963,8 +963,8 @@
     create_RELEASES/4 or set_unpacked/2.

    Example:

    In the current version CurVsn of a release, the application directory of myapp is $ROOT/lib/myapp-1.0. A new version NewVsn is unpacked outside the release handler and the release handler is informed about this with a call -as follows:

    release_handler:set_unpacked(RelFile, [{myapp,"1.0","/home/user"},...]).
    -=> {ok,NewVsn}

    If NewVsn is installed with option {update_paths,true}, then +as follows:

    release_handler:set_unpacked(RelFile, [{myapp,"1.0","/home/user"},...]).
    +=> {ok,NewVsn}

    If NewVsn is installed with option {update_paths,true}, then code:lib_dir(myapp) returns /home/user/myapp-1.0.

    Note

    Installing a new release can be time consuming if there are many processes in the system. The reason is that each process must be checked for references to old code before a module can be purged. This check can lead to garbage /usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/sasl.epub/OEBPS/relup.xhtml differs (HTML document, ASCII text, with very long lines (980)) --- old//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/sasl.epub/OEBPS/relup.xhtml 2026-06-04 00:07:11.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/sasl.epub/OEBPS/relup.xhtml 2042-07-06 13:26:39.000000000 +0000 @@ -38,9 +38,9 @@

    In a target system, the release upgrade file is to be located in directory $ROOT/releases/Vsn.

    The relup file contains one single Erlang term, which defines the instructions -used to upgrade the release. The file has the following syntax:

    {Vsn,
    -  [{UpFromVsn, Descr, Instructions}, ...],
    -  [{DownToVsn, Descr, Instructions}, ...]}.
    • Vsn = string() - Current release version.

    • UpFromVsn = string() - Earlier version of the release to upgrade from.

    • Descr = term() - A user-defined parameter passed from the function +used to upgrade the release. The file has the following syntax:

      {Vsn,
      +  [{UpFromVsn, Descr, Instructions}, ...],
      +  [{DownToVsn, Descr, Instructions}, ...]}.
      • Vsn = string() - Current release version.

      • UpFromVsn = string() - Earlier version of the release to upgrade from.

      • Descr = term() - A user-defined parameter passed from the function systools:make_relup/3,4. It is used in the return value of release_handler:install_release/1,2.

      • Instructions - A list of low-level release upgrade instructions, see /usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/sasl.epub/OEBPS/rel.xhtml differs (HTML document, ASCII text, with very long lines (1220)) --- old//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/sasl.epub/OEBPS/rel.xhtml 2026-06-04 00:07:11.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/sasl.epub/OEBPS/rel.xhtml 2042-07-06 13:26:39.000000000 +0000 @@ -35,11 +35,11 @@ File Syntax

        The release resource file is to be called Name.rel.

        The .rel file contains one single Erlang term, which is called a release -specification. The file has the following syntax:

        {release, {RelName,Vsn}, {erts, EVsn},
        -  [{Application, AppVsn} |
        -   {Application, AppVsn, Type} |
        -   {Application, AppVsn, IncApps} |
        -   {Application, AppVsn, Type, IncApps}]}.
        • RelName = string() - Release name.

        • Vsn = string() - Release version.

        • EVsn = string() - ERTS version the release is intended for.

        • Application = atom() - Name of an application included in the release.

        • AppVsn = string() - Version of an application included in the release.

        • Type = permanent | transient | temporary | load | none - Start type of +specification. The file has the following syntax:

          {release, {RelName,Vsn}, {erts, EVsn},
          +  [{Application, AppVsn} |
          +   {Application, AppVsn, Type} |
          +   {Application, AppVsn, IncApps} |
          +   {Application, AppVsn, Type, IncApps}]}.
          • RelName = string() - Release name.

          • Vsn = string() - Release version.

          • EVsn = string() - ERTS version the release is intended for.

          • Application = atom() - Name of an application included in the release.

          • AppVsn = string() - Version of an application included in the release.

          • Type = permanent | transient | temporary | load | none - Start type of an application included in the release.

            If Type = permanent | transient | temporary, the application is loaded and started in the corresponding way, see application.

            If Type = load, the application is only loaded.

            If Type = none, the application is not loaded and not started, although the code for its modules is loaded.

            Defaults to permanent

          • IncApps = [atom()] - A list of applications that are included by an /usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/sasl.epub/OEBPS/script.xhtml differs (HTML document, ASCII text, with very long lines (714)) --- old//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/sasl.epub/OEBPS/script.xhtml 2026-06-04 00:07:11.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/sasl.epub/OEBPS/script.xhtml 2042-07-06 13:26:39.000000000 +0000 @@ -37,20 +37,20 @@ File Syntax

            The boot script is stored in a file with extension .script. The file has the -following syntax:

            {script, {Name, Vsn},
            - [
            -  {progress, loading},
            -  {preLoaded, [Mod1, Mod2, ...]},
            -  {path, [Dir1,"$ROOT/Dir",...]}.
            -  {primLoad, [Mod1, Mod2, ...]},
            +following syntax:

            {script, {Name, Vsn},
            + [
            +  {progress, loading},
            +  {preLoaded, [Mod1, Mod2, ...]},
            +  {path, [Dir1,"$ROOT/Dir",...]}.
            +  {primLoad, [Mod1, Mod2, ...]},
               ...
            -  {kernel_load_completed},
            -  {progress, loaded},
            -  {kernelProcess, Name, {Mod, Func, Args}},
            +  {kernel_load_completed},
            +  {progress, loaded},
            +  {kernelProcess, Name, {Mod, Func, Args}},
               ...
            -  {apply, {Mod, Func, Args}},
            +  {apply, {Mod, Func, Args}},
               ...
            -  {progress, started}]}.
            • Name = string() - Defines the system name.

            • Vsn = string() - Defines the system version.

            • {progress, Term} - Sets the "progress" of the initialization program. + {progress, started}]}.

            • Name = string() - Defines the system name.

            • Vsn = string() - Defines the system version.

            • {progress, Term} - Sets the "progress" of the initialization program. The init:get_status/0 function returns the current value of the progress, which is {InternalStatus,Term}.

            • {path, [Dir]} - Dir is a string. This argument sets the load path of the system to [Dir]. The load path used to load modules is obtained from the /usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/sasl_app.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (450)) --- old//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/sasl_app.html 2026-06-04 19:05:15.164568326 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/sasl_app.html 2026-06-04 19:05:15.164568326 +0000 @@ -265,7 +265,7 @@ Erlang programming language

              -

              Copyright © 1996-2026 Ericsson AB

              +

              Copyright © 1996-2042 Ericsson AB

              /usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/sasl_intro.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/sasl_intro.html 2026-06-04 19:05:15.181568484 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/sasl_intro.html 2026-06-04 19:05:15.180568474 +0000 @@ -192,7 +192,7 @@ Erlang programming language

              -

              Copyright © 1996-2026 Ericsson AB

              +

              Copyright © 1996-2042 Ericsson AB

              /usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/script.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (714)) --- old//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/script.html 2026-06-04 19:05:15.202568678 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/script.html 2026-06-04 19:05:15.202568678 +0000 @@ -142,20 +142,20 @@ File Syntax

              The boot script is stored in a file with extension .script. The file has the -following syntax:

              {script, {Name, Vsn},
              - [
              -  {progress, loading},
              -  {preLoaded, [Mod1, Mod2, ...]},
              -  {path, [Dir1,"$ROOT/Dir",...]}.
              -  {primLoad, [Mod1, Mod2, ...]},
              +following syntax:

              {script, {Name, Vsn},
              + [
              +  {progress, loading},
              +  {preLoaded, [Mod1, Mod2, ...]},
              +  {path, [Dir1,"$ROOT/Dir",...]}.
              +  {primLoad, [Mod1, Mod2, ...]},
                 ...
              -  {kernel_load_completed},
              -  {progress, loaded},
              -  {kernelProcess, Name, {Mod, Func, Args}},
              +  {kernel_load_completed},
              +  {progress, loaded},
              +  {kernelProcess, Name, {Mod, Func, Args}},
                 ...
              -  {apply, {Mod, Func, Args}},
              +  {apply, {Mod, Func, Args}},
                 ...
              -  {progress, started}]}.
              • Name = string() - Defines the system name.

              • Vsn = string() - Defines the system version.

              • {progress, Term} - Sets the "progress" of the initialization program. + {progress, started}]}.

              • Name = string() - Defines the system name.

              • Vsn = string() - Defines the system version.

              • {progress, Term} - Sets the "progress" of the initialization program. The init:get_status/0 function returns the current value of the progress, which is {InternalStatus,Term}.

              • {path, [Dir]} - Dir is a string. This argument sets the load path of the system to [Dir]. The load path used to load modules is obtained from the @@ -234,7 +234,7 @@ Erlang programming language

                -

                Copyright © 1996-2026 Ericsson AB

                +

                Copyright © 1996-2042 Ericsson AB

                /usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/search.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/search.html 2026-06-04 19:05:15.220971249 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/search.html 2026-06-04 19:05:15.220971249 +0000 @@ -122,7 +122,7 @@
                - + /usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/systools.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (310)) --- old//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/systools.html 2026-06-04 19:05:15.243569059 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/sasl-4.2.2/doc/html/systools.html 2026-06-04 19:05:15.244569068 +0000 @@ -674,7 +674,7 @@ Erlang programming language

                -

                Copyright © 1996-2026 Ericsson AB

                +

                Copyright © 1996-2042 Ericsson AB

                /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/404.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/404.html 2026-06-04 19:05:15.261487609 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/404.html 2026-06-04 19:05:15.261487609 +0000 @@ -147,7 +147,7 @@ Erlang programming language

                -

                Copyright © 1996-2026 Ericsson AB

                +

                Copyright © 1996-2042 Ericsson AB

                /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/api-reference.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/api-reference.html 2026-06-04 19:05:15.280569402 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/api-reference.html 2026-06-04 19:05:15.280569402 +0000 @@ -482,7 +482,7 @@ Erlang programming language

                -

                Copyright © 1996-2026 Ericsson AB

                +

                Copyright © 1996-2042 Ericsson AB

                /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/notes.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1437)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/notes.html 2026-06-04 19:05:15.300569587 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/notes.html 2026-06-04 19:05:15.300569587 +0000 @@ -1094,7 +1094,7 @@ Erlang programming language

                -

                Copyright © 1996-2026 Ericsson AB

                +

                Copyright © 1996-2042 Ericsson AB

                /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/search.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/search.html 2026-06-04 19:05:15.316569736 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/search.html 2026-06-04 19:05:15.316569736 +0000 @@ -145,7 +145,7 @@ Erlang programming language

                -

                Copyright © 1996-2026 Ericsson AB

                +

                Copyright © 1996-2042 Ericsson AB

                /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/content.opf differs (XML 1.0 document, ASCII text) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/content.opf 2026-06-04 00:07:51.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/content.opf 2042-07-06 13:27:19.000000000 +0000 @@ -4,10 +4,10 @@ version="3.0"> snmp - 5.17 - urn:uuid:8e8fe983-94f0-d628-30f3-46243c671523 + urn:uuid:0e30601a-ffb4-171e-9c59-b58d2a517058 en - 2026-06-04T00:07:51Z + 2042-07-06T13:27:19Z /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_advanced_agent.xhtml differs (HTML document, ASCII text, with very long lines (878)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_advanced_agent.xhtml 2026-06-04 00:07:51.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_advanced_agent.xhtml 2042-07-06 13:27:19.000000000 +0000 @@ -224,16 +224,16 @@ empName DisplayString, empTelNo DisplayString, empStatus RowStatus - }

    The corresponding Mnesia table is specified as follows:

    mnesia:create_table([{name, employees},
    -                     {snmp, [{key, {integer, string}}]},
    -                     {attributes, [key, telno, row_status]}]).

    Note

    In the Mnesia tables, the two key columns are stored as a tuple with two + }

    The corresponding Mnesia table is specified as follows:

    mnesia:create_table([{name, employees},
    +                     {snmp, [{key, {integer, string}}]},
    +                     {attributes, [key, telno, row_status]}]).

    Note

    In the Mnesia tables, the two key columns are stored as a tuple with two elements. Therefore, the arity of the table is 3.

    Instrumentation Functions

    -

    The MIB table shown in the previous section can be compiled as follows:

    1> snmpc:compile("EmpMIB", [{db, mnesia}]).

    This is all that has to be done! Now the manager can read, add, and modify +

    The MIB table shown in the previous section can be compiled as follows:

    1> snmpc:compile("EmpMIB", [{db, mnesia}]).

    This is all that has to be done! Now the manager can read, add, and modify rows. Also, you can use the ordinary Mnesia API to access the table from your programs. The only explicit action is to create the Mnesia table, an action the user has to perform in order to create the required table schemas.

    @@ -245,11 +245,11 @@

    It is often necessary to take some specific action when a table is modified. This is accomplished with an instrumentation function. It executes some specific code when the table is set, and passes all other requests down to the -pre-defined function.

    The following example illustrates this idea:

    emp_table(set, RowIndex, Cols) ->
    -    notify_internal_resources(RowIndex, Cols),
    -    snmp_generic:table_func(set, RowIndex, Cols, {empTable, mnesia});
    -emp_table(Op, RowIndex, Cols) ->
    -    snmp_generic:table_func(Op, RowIndex, Cols, {empTable, mnesia}).

    The default instrumentation functions are defined in the module snmp_generic. +pre-defined function.

    The following example illustrates this idea:

    emp_table(set, RowIndex, Cols) ->
    +    notify_internal_resources(RowIndex, Cols),
    +    snmp_generic:table_func(set, RowIndex, Cols, {empTable, mnesia});
    +emp_table(Op, RowIndex, Cols) ->
    +    snmp_generic:table_func(Op, RowIndex, Cols, {empTable, mnesia}).

    The default instrumentation functions are defined in the module snmp_generic. Refer to the Reference Manual, section SNMP, module snmp_generic for details.

    @@ -262,28 +262,28 @@ that the agent does not know about. This situation is handled by adding values for the internal columns in the set function.

    To illustrate this, suppose we extend our Mnesia empTable with one internal column. We create it as before, but with an arity of 4, by adding another -attribute.

    mnesia:create_table([{name, employees},
    -                     {snmp, [{key, {integer, string}}]},
    -                     {attributes, {key, telno, row_status, internal_col}}]).

    The last column is the internal column. When performing a set operation, which +attribute.

    mnesia:create_table([{name, employees},
    +                     {snmp, [{key, {integer, string}}]},
    +                     {attributes, {key, telno, row_status, internal_col}}]).

    The last column is the internal column. When performing a set operation, which creates a row, we must give a value to the internal column. The instrumentation -functions will now look as follows:

    -define(createAndGo, 4).
    --define(createAndWait, 5).
    +functions will now look as follows:

    -define(createAndGo, 4).
    +-define(createAndWait, 5).
     
    -emp_table(set, RowIndex, Cols) ->
    -  notify_internal_resources(RowIndex, Cols),
    +emp_table(set, RowIndex, Cols) ->
    +  notify_internal_resources(RowIndex, Cols),
       NewCols =
    -    case is_row_created(empTable, Cols) of
    -      true -> Cols ++ [{4, "internal"}]; % add internal column
    +    case is_row_created(empTable, Cols) of
    +      true -> Cols ++ [{4, "internal"}]; % add internal column
           false -> Cols                      % keep original cols
       end,
    -  snmp_generic:table_func(set, RowIndex, NewCols, {empTable, mnesia});
    -emp_table(Op, RowIndex, Cols) ->
    -  snmp_generic:table_func(Op, RowIndex, Cols, {empTable, mnesia}).
    +  snmp_generic:table_func(set, RowIndex, NewCols, {empTable, mnesia});
    +emp_table(Op, RowIndex, Cols) ->
    +  snmp_generic:table_func(Op, RowIndex, Cols, {empTable, mnesia}).
     
    -is_row_created(Name, Cols) ->
    -  case snmp_generic:get_status_col(Name, Cols) of
    -    {ok, ?createAndGo} -> true;
    -    {ok, ?createAndWait} -> true;
    +is_row_created(Name, Cols) ->
    +  case snmp_generic:get_status_col(Name, Cols) of
    +    {ok, ?createAndGo} -> true;
    +    {ok, ?createAndWait} -> true;
         _ -> false
       end.

    If a row is created, we always set the internal column to "internal".

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_agent_config_files.xhtml differs (HTML document, ASCII text, with very long lines (1549)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_agent_config_files.xhtml 2026-06-04 00:07:51.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_agent_config_files.xhtml 2042-07-06 13:27:19.000000000 +0000 @@ -45,19 +45,19 @@

    The agent information should be stored in a file called agent.conf.

    Each entry is a tuple of size two:

    {AgentVariable, Value}.

    • AgentVariable is one of the variables in SNMP-FRAMEWORK-MIB or one of the internal variables intAgentUDPPort, which defines which UDP port the agent listens to, or intAgentTransports, which defines the transport domains and -addresses of the agent.
    • Value is the value for the variable.

    The following example shows an agent.conf file:

    {intAgentUDPPort, 4000}.
    -{intAgentTransports,
    - [{transportDomainUdpIpv4, {141,213,11,24}},
    -  {transportDomainUdpIpv6, {0,0,0,0,0,0,0,1}}]}.
    -{snmpEngineID, "mbj's engine"}.
    -{snmpEngineMaxMessageSize, 484}.

    These are the supported entries and their value types:

          {snmpEngine,               string()}.                     % Mandatory
    -      {snmpEngineMaxMessageSize, snmp_framework_mib:max_message_size()}.  % Mandatory
    -      {intAgentUDPPort,          inet:port_number()}.                      % Optional
    -      {intAgentTransports,       [snmpa_conf:intAgentTransport()]}.   % Mandatory

    If a "traditional" transport is specified (without explicit Kind, handling +addresses of the agent.

  • Value is the value for the variable.
  • The following example shows an agent.conf file:

    {intAgentUDPPort, 4000}.
    +{intAgentTransports,
    + [{transportDomainUdpIpv4, {141,213,11,24}},
    +  {transportDomainUdpIpv6, {0,0,0,0,0,0,0,1}}]}.
    +{snmpEngineID, "mbj's engine"}.
    +{snmpEngineMaxMessageSize, 484}.

    These are the supported entries and their value types:

          {snmpEngine,               string()}.                     % Mandatory
    +      {snmpEngineMaxMessageSize, snmp_framework_mib:max_message_size()}.  % Mandatory
    +      {intAgentUDPPort,          inet:port_number()}.                      % Optional
    +      {intAgentTransports,       [snmpa_conf:intAgentTransport()]}.   % Mandatory

    If a "traditional" transport is specified (without explicit Kind, handling both requests and traps) for a transport domain, its not possible to also specify a transport (for that domain) with a specific Kind. This is for -example, not allowed:

     [{transportDomainUdpIpv4, {{141,213,11,24}, 4000}},
    -  {transportDomainUdpIpv4, {{141,213,11,24}, 4001}, trap_sender}].

    Note that only one transport per kind for each transport domain can be +example, not allowed:

     [{transportDomainUdpIpv4, {{141,213,11,24}, 4000}},
    +  {transportDomainUdpIpv4, {{141,213,11,24}, 4001}, trap_sender}].

    Note that only one transport per kind for each transport domain can be configured.

    PortInfo system is used to indicate that the 'system' should choose (the way port number '0' (zero) is normally used). Port info '0' (zero) cannot be used for this, since it is (internally) used to represent the 'default' port number.

    In the traditional transport entries, when the Addr value does not contain a @@ -83,12 +83,12 @@ System Information

    The system information should be stored in a file called standard.conf.

    Each entry is a tuple of size two:

    {SystemVariable, Value}.

    • SystemVariable is one of the variables in the system group, or -snmpEnableAuthenTraps.
    • Value is the value for the variable.

    The following example shows a valid standard.conf file:

    {sysDescr, "Erlang SNMP agent"}.
    -{sysObjectID, [1,2,3]}.
    -{sysContact, "(mbj,eklas)@erlang.ericsson.se"}.
    -{sysName, "test"}.
    -{sysServices, 72}.
    -{snmpEnableAuthenTraps, enabled}.

    A value must be provided for all variables, which lack default values in the +snmpEnableAuthenTraps.

  • Value is the value for the variable.
  • The following example shows a valid standard.conf file:

    {sysDescr, "Erlang SNMP agent"}.
    +{sysObjectID, [1,2,3]}.
    +{sysContact, "(mbj,eklas)@erlang.ericsson.se"}.
    +{sysName, "test"}.
    +{sysServices, 72}.
    +{snmpEnableAuthenTraps, enabled}.

    A value must be provided for all variables, which lack default values in the MIB.

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_agent_funct_descr.xhtml differs (HTML document, ASCII text, with very long lines (773)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_agent_funct_descr.xhtml 2026-06-04 00:07:51.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_agent_funct_descr.xhtml 2042-07-06 13:27:19.000000000 +0000 @@ -203,7 +203,7 @@ MIBs are always available in all contexts.

    The ASN.1 code, the Erlang source code, and the generated .hrl files for them are provided in the distribution and are placed in the directories mibs, src, and include, respectively, in the snmp application.

    The .hrl files are generated with snmpc:mib_to_hrl/1. Include these files in -your code as in the following example:

    -include_lib("snmp/include/SNMPv2-MIB.hrl").

    The initial values for the managed objects defined in these tables, are read at +your code as in the following example:

    -include_lib("snmp/include/SNMPv2-MIB.hrl").

    The initial values for the managed objects defined in these tables, are read at start-up from a set of configuration files. These are described in Configuration Files.

    @@ -364,9 +364,9 @@

    Notifications are defined in SMIv1 with the TRAP-TYPE macro in the definition of an MIB (see RFC1215). The corresponding macro in SMIv2 is NOTIFICATION-TYPE. When an application decides to send a notification, it calls one of the -following functions:

    snmpa:send_notification(Agent, Notification, Receiver
    -                       [, NotifyName, ContextName, Varbinds])
    -snmpa:send_trap(Agent, Notification, Community [, Receiver, Varbinds])

    providing the registered name or process identifier of the agent where the MIB, +following functions:

    snmpa:send_notification(Agent, Notification, Receiver
    +                       [, NotifyName, ContextName, Varbinds])
    +snmpa:send_trap(Agent, Notification, Community [, Receiver, Varbinds])

    providing the registered name or process identifier of the agent where the MIB, which defines the notification is loaded and the symbolic name of the notification.

    If the send_notification/3,4 function is used, all management targets are selected, as defined in RFC2273. The Receiver parameter defines where the /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_app_b.xhtml differs (HTML document, ASCII text, with very long lines (501)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_app_b.xhtml 2026-06-04 00:07:51.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_app_b.xhtml 2042-07-06 13:27:19.000000000 +0000 @@ -481,23 +481,23 @@ immediately removed." - SYNTAX INTEGER { + SYNTAX INTEGER { -- the following two values are states: -- these values may be read or written - active(1), - notInService(2), + active(1), + notInService(2), -- the following value is a state: -- this value may be read, but not written - notReady(3), + notReady(3), -- the following three values are -- actions: these values may be written, -- but are never read - createAndGo(4), - createAndWait(5), - destroy(6) - }

    + createAndGo(4), + createAndWait(5), + destroy(6) + }

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_app.xhtml differs (HTML document, ASCII text, with very long lines (984)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_app.xhtml 2026-06-04 00:07:51.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_app.xhtml 2042-07-06 13:27:19.000000000 +0000 @@ -35,51 +35,51 @@

    The following configuration parameters are defined for the SNMP application. Refer to application(3) for more information about configuration parameters.

    The snmp part of the config file specifying the configuration parameters is -basically the following tuple:

          {snmp, snmp_components_config()}

    A minimal config file for starting a node with both a manager and an agent:

          [{snmp,
    -        [{agent, [{db_dir, "/tmp/snmp/agent/db"},
    -                  {config, [{dir, "/tmp/snmp/agent/conf"}]}]},
    -         {manager, [{config, [{dir, "/tmp/snmp/manager/conf"},
    -                              {db_dir, "/tmp/snmp/manager/db"}]}]}]}
    -        ]
    +basically the following tuple:

          {snmp, snmp_components_config()}

    A minimal config file for starting a node with both a manager and an agent:

          [{snmp,
    +        [{agent, [{db_dir, "/tmp/snmp/agent/db"},
    +                  {config, [{dir, "/tmp/snmp/agent/conf"}]}]},
    +         {manager, [{config, [{dir, "/tmp/snmp/manager/conf"},
    +                              {db_dir, "/tmp/snmp/manager/db"}]}]}]}
    +        ]
            }
           ].

    Each snmp component has its own set of configuration parameters, even though -some of the types are common to both components.

          snmp_components_config() -> [snmp_component_config()]
    -      snmp_component_config() -> {agent, agent_options()} | {manager, manager_options()}
    -      agent_options() = [agent_option()]
    -      agent_option() = {restart_type,     restart_type()}     |
    -                       {agent_type,       agent_type()}       |
    -                       {agent_verbosity,  verbosity()}        |
    -                       {discovery,        agent_discovery()}  |
    -                       {versions,         versions()}         |
    -                       {gb_max_vbs,       gb_max_vbs()}       |
    -                       {priority,         priority()}         |
    -                       {multi_threaded,   multi_threaded()}   |
    -                       {db_dir,           db_dir()}           |
    -                       {db_init_error,    db_init_error()}    |
    -                       {local_db,         local_db()}         |
    -                       {net_if,           agent_net_if()}     |
    -                       {mibs,             mibs()}             |
    -                       {mib_storage,      mib_storage()}      |
    -                       {mib_server,       mib_server()}       |
    -                       {audit_trail_log,  audit_trail_log()}  |
    -                       {error_report_mod, error_report_mod()} |
    -                       {note_store,       note_store()}       |
    -                       {symbolic_store,   symbolic_store()}   |
    -                       {target_cache,     target_cache()}     |
    -                       {config,           agent_config()}
    -      manager_options() = [manager_option()]
    -      manager_option() = {restart_type,             restart_type()}    |
    -                         {net_if,                   manager_net_if()}  |
    -                         {server,                   server()}          |
    -                         {note_store,               note_store()}      |
    -                         {config,                   manager_config()}  |
    -                         {inform_request_behaviour, manager_irb()}     |
    -                         {mibs,                     manager_mibs()}    |
    -                         {priority,                 priority()}        |
    -                         {audit_trail_log,          audit_trail_log()} |
    -                         {versions,                 versions()}        |
    -                         {def_user_mod,             def_user_module()  |
    -                         {def_user_data,            def_user_data()}

    Agent specific config options and types:

    • agent_type() = master | sub <optional> - If master, +some of the types are common to both components.

            snmp_components_config() -> [snmp_component_config()]
      +      snmp_component_config() -> {agent, agent_options()} | {manager, manager_options()}
      +      agent_options() = [agent_option()]
      +      agent_option() = {restart_type,     restart_type()}     |
      +                       {agent_type,       agent_type()}       |
      +                       {agent_verbosity,  verbosity()}        |
      +                       {discovery,        agent_discovery()}  |
      +                       {versions,         versions()}         |
      +                       {gb_max_vbs,       gb_max_vbs()}       |
      +                       {priority,         priority()}         |
      +                       {multi_threaded,   multi_threaded()}   |
      +                       {db_dir,           db_dir()}           |
      +                       {db_init_error,    db_init_error()}    |
      +                       {local_db,         local_db()}         |
      +                       {net_if,           agent_net_if()}     |
      +                       {mibs,             mibs()}             |
      +                       {mib_storage,      mib_storage()}      |
      +                       {mib_server,       mib_server()}       |
      +                       {audit_trail_log,  audit_trail_log()}  |
      +                       {error_report_mod, error_report_mod()} |
      +                       {note_store,       note_store()}       |
      +                       {symbolic_store,   symbolic_store()}   |
      +                       {target_cache,     target_cache()}     |
      +                       {config,           agent_config()}
      +      manager_options() = [manager_option()]
      +      manager_option() = {restart_type,             restart_type()}    |
      +                         {net_if,                   manager_net_if()}  |
      +                         {server,                   server()}          |
      +                         {note_store,               note_store()}      |
      +                         {config,                   manager_config()}  |
      +                         {inform_request_behaviour, manager_irb()}     |
      +                         {mibs,                     manager_mibs()}    |
      +                         {priority,                 priority()}        |
      +                         {audit_trail_log,          audit_trail_log()} |
      +                         {versions,                 versions()}        |
      +                         {def_user_mod,             def_user_module()  |
      +                         {def_user_data,            def_user_data()}

      Agent specific config options and types:

      • agent_type() = master | sub <optional> - If master, one master agent is started. Otherwise, no agents are started.

        Default is master.

      • agent_discovery() = [agent_discovery_opt()] <optional> - agent_discovery_opt() = {terminating, agent_terminating_discovery_opts()} | {originating, agent_originating_discovery_opts()}

        The terminating options effects discovery initiated by a manager.

        The originating options effects discovery initiated by this agent.

        For defaults see the options in agent_discovery_opt().

      • agent_terminating_discovery_opts() = [agent_terminating_discovery_opt()] <optional> - agent_terminating_discovery_opt() = {enable, boolean()} | {stage2, discovery | plain} | {trigger_username, string()}

        These are options effecting discovery terminating in this agent (i.e. /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmpa.xhtml differs (HTML document, ASCII text, with very long lines (345)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmpa.xhtml 2026-06-04 00:07:51.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmpa.xhtml 2042-07-06 13:27:19.000000000 +0000 @@ -3215,8 +3215,8 @@

        Load a single Mib into an agent. The MibName is the name of the Mib, -including the path to where the compiled mib is found. For example:

                  Dir = code:priv_dir(my_app) ++ "/mibs/",
        -          snmpa:load_mib(snmp_master_agent, Dir ++ "MY-MIB").
        +including the path to where the compiled mib is found. For example:

                  Dir = code:priv_dir(my_app) ++ "/mibs/",
        +          snmpa:load_mib(snmp_master_agent, Dir ++ "MY-MIB").
        @@ -3332,8 +3332,8 @@

        Load Mibs into an agent. If the agent cannot load all MIBs (the default value of the Force argument is false), it will indicate where loading was aborted. The MibName is the name of the Mib, including the path to where the compiled -mib is found. For example,

                  Dir = code:priv_dir(my_app) ++ "/mibs/",
        -          snmpa:load_mibs(snmp_master_agent, [Dir ++ "MY-MIB"]).

        If Force = true then the agent will continue attempting to load each mib even +mib is found. For example,

                  Dir = code:priv_dir(my_app) ++ "/mibs/",
        +          snmpa:load_mibs(snmp_master_agent, [Dir ++ "MY-MIB"]).

        If Force = true then the agent will continue attempting to load each mib even after failing to load a previous mib. Use with care.

        @@ -4444,8 +4444,8 @@

        Registers a sub-agent under a sub-tree of another agent.

        It is easy to make mistakes when registering sub-agents and this activity should be done carefully. For example, a strange behaviour would result from the -following configuration:

        snmp_agent:register_subagent(MAPid,[1,2,3,4],SA1),
        -snmp_agent:register_subagent(SA1,[1,2,3], SA2).

        SA2 will not get requests starting with object identifier [1,2,3] since +following configuration:

        snmp_agent:register_subagent(MAPid,[1,2,3,4],SA1),
        +snmp_agent:register_subagent(SA1,[1,2,3], SA2).

        SA2 will not get requests starting with object identifier [1,2,3] since SA1 does not.

        @@ -4890,20 +4890,20 @@ Addresses and if there are no targets for which an Inform-Request is sent, Addresses is the empty list [].

        The receiver will first be sent the snmp_targets message, and then for each address in Addresses list, one of the two snmp_notification messages.

      • {Mod, Func, Args} - The info will be delivered via the function call:

        Mod:Func([Msg | Args])

        where Msg has the same content and purpose as the messages descrived above.

      Address is a management target address and Addresses is a list of management -target addresses. They are defined as followes:

              Addresses  = [address()]
      -        Address    = address()
      -        address()  = v1_address() | v3_address()
      -        v1_address() = {TDomain, TAddress}
      -        v3_address() = {{TDomain, TAddress}, V3MsgData}
      -        TDomain    = tdoamin()
      -        TAddress   = taddress()
      -        tdomain()  = The oid of snmpUDPDomain
      +target addresses. They are defined as followes:

              Addresses  = [address()]
      +        Address    = address()
      +        address()  = v1_address() | v3_address()
      +        v1_address() = {TDomain, TAddress}
      +        v3_address() = {{TDomain, TAddress}, V3MsgData}
      +        TDomain    = tdoamin()
      +        TAddress   = taddress()
      +        tdomain()  = The oid of snmpUDPDomain
                            This is the only supported transport domain.
      -        taddress() = [A1, A2, A3, A4, P1, P3]
      +        taddress() = [A1, A2, A3, A4, P1, P3]
                            The 4 first bytes makes up the IP-address and the last 2,
                            the UDP-port number.
      -        V3MsgData  = v3_msg_data()
      -        v3_msg_data() = term()

      If Receiver is a notification_delivery_info/0 record, then the information + V3MsgData = v3_msg_data() + v3_msg_data() = term()

      If Receiver is a notification_delivery_info/0 record, then the information about the notification delivery will be delivered to the receiver via the callback functions defined by the snmpa_notification_delivery_info_receiver behaviour according to the content of the notification_delivery_info/0 /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmpc_cmd.xhtml differs (HTML document, ASCII text, with very long lines (985)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmpc_cmd.xhtml 2026-06-04 00:07:51.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmpc_cmd.xhtml 2042-07-06 13:27:19.000000000 +0000 @@ -26,7 +26,7 @@ Synopsis -

      snmpc [options] file.mib | file.bin

      +
      snmpc [options] file.mib | file.bin

      /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_config.xhtml differs (HTML document, ASCII text, with very long lines (850)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_config.xhtml 2026-06-04 00:07:51.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_config.xhtml 2042-07-06 13:27:19.000000000 +0000 @@ -40,41 +40,41 @@ more information).

    • the database directory stores the internal database files.

    The agent and manager uses (application) configuration parameters to find out where these directories are located. The parameters should be defined in an Erlang system configuration file. The following configuration parameters are -defined for the SNMP application:

          agent_options() = [agent_option()]
    -      agent_option() = {restart_type,     restart_type()}     |
    -                       {agent_type,       agent_type()}       |
    -                       {agent_verbosity,  verbosity()}        |
    -                       {versions,         versions()}         |
    -                       {discovery,        agent_discovery()}  |
    -                       {gb_max_vbs,       gb_max_vbs()}       |
    -                       {priority,         priority()}         |
    -                       {multi_threaded,   multi_threaded()}   |
    -                       {db_dir,           db_dir()}           |
    -                       {db_init_error,    db_init_error()}    |
    -                       {local_db,         local_db()}         |
    -                       {net_if,           agent_net_if()}     |
    -                       {mibs,             mibs()}             |
    -                       {mib_storage,      mib_storage()}      |
    -                       {mib_server,       mib_server()}       |
    -                       {audit_trail_log,  audit_trail_log()}  |
    -                       {error_report_mod, error_report_mod()} |
    -                       {note_store,       note_store()}       |
    -                       {symbolic_store,   symbolic_store()}   |
    -                       {target_cache,     target_cache()}     |
    -                       {config,           agent_config()}
    -      manager_options() = [manager_option()]
    -      manager_option() = {restart_type,             restart_type()}    |
    -                         {net_if,                   manager_net_if()}  |
    -                         {server,                   server()}          |
    -                         {note_store,               note_store()}      |
    -                         {config,                   manager_config()}  |
    -                         {inform_request_behaviour, manager_irb()}     |
    -                         {mibs,                     manager_mibs()}    |
    -                         {priority,                 priority()}        |
    -                         {audit_trail_log,          audit_trail_log()} |
    -                         {versions,                 versions()}        |
    -                         {def_user_mod,             def_user_module()  |
    -                         {def_user_data,            def_user_data()}

    Agent specific config options and types:

    • agent_type() = master | sub <optional> - If master, +defined for the SNMP application:

            agent_options() = [agent_option()]
      +      agent_option() = {restart_type,     restart_type()}     |
      +                       {agent_type,       agent_type()}       |
      +                       {agent_verbosity,  verbosity()}        |
      +                       {versions,         versions()}         |
      +                       {discovery,        agent_discovery()}  |
      +                       {gb_max_vbs,       gb_max_vbs()}       |
      +                       {priority,         priority()}         |
      +                       {multi_threaded,   multi_threaded()}   |
      +                       {db_dir,           db_dir()}           |
      +                       {db_init_error,    db_init_error()}    |
      +                       {local_db,         local_db()}         |
      +                       {net_if,           agent_net_if()}     |
      +                       {mibs,             mibs()}             |
      +                       {mib_storage,      mib_storage()}      |
      +                       {mib_server,       mib_server()}       |
      +                       {audit_trail_log,  audit_trail_log()}  |
      +                       {error_report_mod, error_report_mod()} |
      +                       {note_store,       note_store()}       |
      +                       {symbolic_store,   symbolic_store()}   |
      +                       {target_cache,     target_cache()}     |
      +                       {config,           agent_config()}
      +      manager_options() = [manager_option()]
      +      manager_option() = {restart_type,             restart_type()}    |
      +                         {net_if,                   manager_net_if()}  |
      +                         {server,                   server()}          |
      +                         {note_store,               note_store()}      |
      +                         {config,                   manager_config()}  |
      +                         {inform_request_behaviour, manager_irb()}     |
      +                         {mibs,                     manager_mibs()}    |
      +                         {priority,                 priority()}        |
      +                         {audit_trail_log,          audit_trail_log()} |
      +                         {versions,                 versions()}        |
      +                         {def_user_mod,             def_user_module()  |
      +                         {def_user_data,            def_user_data()}

      Agent specific config options and types:

      • agent_type() = master | sub <optional> - If master, one master agent is started. Otherwise, no agents are started.

        Default is master.

      • agent_discovery() = [agent_discovery_opt()] <optional> - agent_discovery_opt() = {terminating, agent_terminating_discovery_opts()} | {originating, agent_originating_discovery_opts()}

        The terminating options effects discovery initiated by a manager.

        The originating options effects discovery initiated by this agent.

        For defaults see the options in agent_discovery_opt().

      • agent_terminating_discovery_opts() = [agent_terminating_discovery_opt()] <optional> - agent_terminating_discovery_opt() = {enable, boolean()} | {stage2, discovery | plain} | {trigger_username, string()}

        These are options effecting discovery terminating in this agent (i.e. @@ -451,34 +451,34 @@ configuration parameters. The verbosity itself has several _levels: silence | info | log | debug | trace. For the lowest verbosity silence, nothing is printed. The higher the verbosity, the -more is printed. Default value is always silence.

        3> snmpa:verbosity(master_agent, log).
        +more is printed. Default value is always silence.

        3> snmpa:verbosity(master_agent, log).
         ok
        -5> snmpa:verbosity(net_if, log).
        +5> snmpa:verbosity(net_if, log).
         ok
         6>
         %% Example of output from the agent when a get-next-request arrives:
         ** SNMP NET-IF LOG:
        -   got packet from {147,12,12,12}:5000
        +   got packet from {147,12,12,12}:5000
         
         ** SNMP NET-IF MPD LOG:
            v1, community: all-rights
         
         ** SNMP NET-IF LOG:
        -   got pdu from {147,12,12,12}:5000 {pdu, 'get-next-request',
        +   got pdu from {147,12,12,12}:5000 {pdu, 'get-next-request',
                                                   62612569,noError,0,
        -                                          [{varbind,[1,1],'NULL','NULL',1}]}
        +                                          [{varbind,[1,1],'NULL','NULL',1}]}
         
         ** SNMP MASTER-AGENT LOG:
        -   apply: snmp_generic,variable_func,[get,{sysDescr,persistent}]
        +   apply: snmp_generic,variable_func,[get,{sysDescr,persistent}]
         
         ** SNMP MASTER-AGENT LOG:
        -   returned: {value,"Erlang SNMP agent"}
        +   returned: {value,"Erlang SNMP agent"}
         
         ** SNMP NET-IF LOG:
        -   reply pdu: {pdu,'get-response',62612569,noError,0,
        -                   [{varbind,[1,3,6,1,2,1,1,1,0],
        +   reply pdu: {pdu,'get-response',62612569,noError,0,
        +                   [{varbind,[1,3,6,1,2,1,1,1,0],
                                      'OCTET STRING',
        -                             "Erlang SNMP agent",1}]}
        +                             "Erlang SNMP agent",1}]}
         
         ** SNMP NET-IF INFO: time in agent: 19711 mysec

        Other useful function(s) for debugging the agent are:

        • snmpa:info/0,1 - info is used to retrieve a list of miscellaneous agent information.

        • snmpa:which_aliasnames/0 - /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_generic.xhtml differs (HTML document, ASCII text, with very long lines (1644)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_generic.xhtml 2026-06-04 00:07:51.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_generic.xhtml 2042-07-06 13:27:19.000000000 +0000 @@ -35,9 +35,9 @@ | MIB | +---------------+ | - Association file (associates a MIB object with + Association file (associates a MIB object with | snmp_generic:table_funct - | snmp_generic:variable_func) + | snmp_generic:variable_func) +--------------------------------------+ | snmp_generic | Support for get-next, | | RowStatus operations @@ -45,7 +45,7 @@ | snmpa_local_db | Mnesia | Database +--------------+-------+---------------+ | dets | ets | -| (persistent) | | +| (persistent) | | +--------------+-------+

        Each function takes the argument NameDb, which is a tuple {Name, Db}, to identify which database the functions should use. Name is the symbolic name of the managed object as defined in the MIB, and Db is either volatile, @@ -57,41 +57,41 @@ this. Specifically, if variables are stored in Mnesia, the table snmp_variables must be created by the programmer. The record definition for this table is defined in the file snmp/include/snmp_types.hrl.

        If an instrumentation function in the association file for a variable myVar -does not have a name when compiling an MIB, the compiler generates an entry.

        {myVar, {snmp_generic, variable_func, [{myVar, Db]}}.

        And for a table:

        {myTable, {snmp_generic, table_func, [{myTable, Db]}}.

        +does not have a name when compiling an MIB, the compiler generates an entry.

        {myVar, {snmp_generic, variable_func, [{myVar, Db]}}.

        And for a table:

        {myTable, {snmp_generic, table_func, [{myTable, Db]}}.

        Example

        The following example shows an implementation of a table which is stored in -Mnesia, but with some checks performed at set-request operations.

        myTable_func(new, NameDb) ->   % pass unchanged
        -  snmp_generic:table_func(new, NameDb).
        +Mnesia, but with some checks performed at set-request operations.

        myTable_func(new, NameDb) ->   % pass unchanged
        +  snmp_generic:table_func(new, NameDb).
         
        -myTable_func(delete, NameDb) ->   % pass unchanged
        -  snmp_generic:table_func(delete, NameDb).
        +myTable_func(delete, NameDb) ->   % pass unchanged
        +  snmp_generic:table_func(delete, NameDb).
         
         %% change row
        -myTable_func(is_set_ok, RowIndex, Cols, NameDb) ->
        -  case snmp_generic:table_func(is_set_ok, RowIndex,
        -                               Cols, NameDb) of
        -    {noError, 0} ->
        -      myApplication:is_set_ok(RowIndex, Cols);
        +myTable_func(is_set_ok, RowIndex, Cols, NameDb) ->
        +  case snmp_generic:table_func(is_set_ok, RowIndex,
        +                               Cols, NameDb) of
        +    {noError, 0} ->
        +      myApplication:is_set_ok(RowIndex, Cols);
             Err ->
               Err
           end;
         
        -myTable_func(set, RowIndex, Cols, NameDb) ->
        -  case snmp_generic:table_func(set, RowIndex, Cols,
        -                               NameDb),
        -    {noError, 0} ->
        +myTable_func(set, RowIndex, Cols, NameDb) ->
        +  case snmp_generic:table_func(set, RowIndex, Cols,
        +                               NameDb),
        +    {noError, 0} ->
               % Now the row is updated, tell the application
        -      myApplication:update(RowIndex, Cols);
        +      myApplication:update(RowIndex, Cols);
             Err ->
               Err
           end;
         
        -myTable_func(Op, RowIndex, Cols, NameDb) ->   % pass unchanged
        -  snmp_generic:table_func(Op, RowIndex, Cols, NameDb).

        The .funcs file would look like:

        {myTable, {myModule, myTable_func, [{myTable, mnesia}]}}.
        +
        myTable_func(Op, RowIndex, Cols, NameDb) -> % pass unchanged + snmp_generic:table_func(Op, RowIndex, Cols, NameDb).

        The .funcs file would look like:

        {myTable, {myModule, myTable_func, [{myTable, mnesia}]}}.
        /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_impl_example_agent.xhtml differs (HTML document, ASCII text, with very long lines (1539)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_impl_example_agent.xhtml 2026-06-04 00:07:51.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_impl_example_agent.xhtml 2042-07-06 13:27:19.000000000 +0000 @@ -125,54 +125,54 @@ the default implementation of it. Recall that MIBs imported by "EX1-MIB.mib" must be present and compiled in the current directory ("./STANDARD-MIB.bin","./RFC1213-MIB.bin") when compiling.

        unix> erl -config ./sys
        -1> application:start(snmp).
        +1> application:start(snmp).
         ok
        -2> snmpc:compile("EX1-MIB").
        +2> snmpc:compile("EX1-MIB").
         No accessfunction for 'friendsTable', using default.
         No accessfunction for 'myName', using default.
        -{ok, "EX1-MIB.bin"}
        -3> snmpa:load_mibs(snmp_master_agent, ["EX1-MIB"]).
        +{ok, "EX1-MIB.bin"}
        +3> snmpa:load_mibs(snmp_master_agent, ["EX1-MIB"]).
         ok

        This MIB is now loaded into the agent, and a manager can ask questions. As an example of this, we start another Erlang system and the simple Erlang manager in -the toolkit:

        1> snmp_test_mgr:start_link([{agent,"dront.ericsson.se"},{community,"all-rights"},
        +the toolkit:

        1> snmp_test_mgr:start_link([{agent,"dront.ericsson.se"},{community,"all-rights"},
          %% making it understand symbolic names: {mibs,["EX1-MIB","STANDARD-MIB"]}]).
        -{ok, <0.89.0>}
        +{ok, <0.89.0>}
         %% a get-next request with one OID.
        -2> snmp_test_mgr:gn([[1,3,6,1,3,7]]).
        +2> snmp_test_mgr:gn([[1,3,6,1,3,7]]).
         ok
         * Got PDU:
        -[myName,0] = []
        +[myName,0] = []
         %% A set-request (now using symbolic names for convenience)
        -3> snmp_test_mgr:s([{[myName,0], "Martin"}]).
        +3> snmp_test_mgr:s([{[myName,0], "Martin"}]).
         ok
         * Got PDU:
        -[myName,0] = "Martin"
        +[myName,0] = "Martin"
         %% Try the same get-next request again
        -4> snmp_test_mgr:gn([[1,3,6,1,3,7]]).
        +4> snmp_test_mgr:gn([[1,3,6,1,3,7]]).
         ok
         * Got PDU:
        -[myName,0] = "Martin"
        +[myName,0] = "Martin"
         %% ... and we got the new value.
         %% you can event do row operations. How to add a row:
        -5> snmp_test_mgr:s([{[fName,0], "Martin"}, {[fAddress,0],"home"}, {[fStatus,0],4}]).
        +5> snmp_test_mgr:s([{[fName,0], "Martin"}, {[fAddress,0],"home"}, {[fStatus,0],4}]).
          %% createAndGo
         ok
         * Got PDU:
        -[fName,0] = "Martin"
        -[fAddress,0] = "home"
        -[fStatus,0] = 4
        -6> snmp_test_mgr:gn([[myName,0]]).
        +[fName,0] = "Martin"
        +[fAddress,0] = "home"
        +[fStatus,0] = 4
        +6> snmp_test_mgr:gn([[myName,0]]).
         ok
         * Got PDU:
        -[fName,0] = "Martin"
        -7> snmp_test_mgr:gn().
        +[fName,0] = "Martin"
        +7> snmp_test_mgr:gn().
         ok
         * Got PDU:
        -[fAddress,0] = "home"
        -8> snmp_test_mgr:gn().
        +[fAddress,0] = "home"
        +8> snmp_test_mgr:gn().
         ok
         * Got PDU:
        -[fStatus,0] = 1
        +[fStatus,0] = 1
         9>

        @@ -190,55 +190,55 @@ Code

        -
        -module(ex1).
        --author('dummy@flop.org').
        +
        -module(ex1).
        +-author('dummy@flop.org').
         %% External exports
        --export([start/0, my_name/1, my_name/2, friends_table/3]).
        +-export([start/0, my_name/1, my_name/2, friends_table/3]).
         %% Internal exports
        --export([init/0]).
        --define(status_col, 4).
        --define(active, 1).
        --define(notInService, 2).
        --define(notReady, 3).
        --define(createAndGo, 4).   % Action; written, not read
        --define(createAndWait, 5). % Action; written, not read
        --define(destroy, 6).       % Action; written, not read
        -start() ->
        -    spawn(ex1, init, []).
        +-export([init/0]).
        +-define(status_col, 4).
        +-define(active, 1).
        +-define(notInService, 2).
        +-define(notReady, 3).
        +-define(createAndGo, 4).   % Action; written, not read
        +-define(createAndWait, 5). % Action; written, not read
        +-define(destroy, 6).       % Action; written, not read
        +start() ->
        +    spawn(ex1, init, []).
         %%----------------------------------------------------------------
         %% Instrumentation function for variable myName.
         %% Returns: (get) {value, Name}
         %%          (set) noError
         %%----------------------------------------------------------------
        -my_name(get) ->
        -    ex1_server ! {self(), get_my_name},
        -    Name = wait_answer(),
        -    {value, Name}.
        -my_name(set, NewName) ->
        -    ex1_server ! {self(), {set_my_name, NewName}},
        +my_name(get) ->
        +    ex1_server ! {self(), get_my_name},
        +    Name = wait_answer(),
        +    {value, Name}.
        +my_name(set, NewName) ->
        +    ex1_server ! {self(), {set_my_name, NewName}},
             noError.
         %%----------------------------------------------------------------
         %% Instrumentation function for table friendsTable.
         %%----------------------------------------------------------------
        -friends_table(get, RowIndex, Cols) ->
        -    case get_row(RowIndex) of
        -   {ok, Row} ->
        -        get_cols(Cols, Row);
        +friends_table(get, RowIndex, Cols) ->
        +    case get_row(RowIndex) of
        +   {ok, Row} ->
        +        get_cols(Cols, Row);
            _  ->
        -        {noValue, noSuchInstance}
        +        {noValue, noSuchInstance}
             end;
        -friends_table(get_next, RowIndex, Cols) ->
        -    case get_next_row(RowIndex) of
        -   {ok, Row} ->
        -        get_next_cols(Cols, Row);
        +friends_table(get_next, RowIndex, Cols) ->
        +    case get_next_row(RowIndex) of
        +   {ok, Row} ->
        +        get_next_cols(Cols, Row);
            _  ->
        -       case get_next_row([]) of
        -     {ok, Row} ->
        +       case get_next_row([]) of
        +     {ok, Row} ->
                  % Get next cols from first row.
        -         NewCols = add_one_to_cols(Cols),
        -         get_next_cols(NewCols, Row);
        +         NewCols = add_one_to_cols(Cols),
        +         get_next_cols(NewCols, Row);
              _  ->
        -        end_of_table(Cols)
        +        end_of_table(Cols)
                 end
             end;
         %%----------------------------------------------------------------
        @@ -249,158 +249,158 @@
         %%    *) Otherwise, error (for simplicity).
         %% Otherwise, row is modified; check that row exists.
         %%----------------------------------------------------------------
        -friends_table(is_set_ok, RowIndex, Cols) ->
        +friends_table(is_set_ok, RowIndex, Cols) ->
             RowExists =
        -   case get_row(RowIndex) of
        -        {ok, _Row} -> true;
        +   case get_row(RowIndex) of
        +        {ok, _Row} -> true;
                _ -> false
            end,
        -    case is_row_status_col_changed(Cols) of
        -   {true, ?destroy} when RowExists == true ->
        -        {noError, 0};
        -   {true, ?createAndGo} when RowExists == false,
        -                                 length(Cols) == 3 ->
        -        {noError, 0};
        -   {true, _} ->
        -       {inconsistentValue, ?status_col};
        +    case is_row_status_col_changed(Cols) of
        +   {true, ?destroy} when RowExists == true ->
        +        {noError, 0};
        +   {true, ?createAndGo} when RowExists == false,
        +                                 length(Cols) == 3 ->
        +        {noError, 0};
        +   {true, _} ->
        +       {inconsistentValue, ?status_col};
            false when RowExists == true ->
        -        {noError, 0};
        +        {noError, 0};
        /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_index.xhtml differs (HTML document, ASCII text, with very long lines (807))
        --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_index.xhtml	2026-06-04 00:07:51.000000000 +0000
        +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_index.xhtml	2042-07-06 13:27:19.000000000 +0000
        @@ -30,13 +30,13 @@
         actual implementation of the table. The SNMP ordering, that is implementation of
         GET NEXT, is implemented in this module.

        For example, suppose there is an SNMP table, which is best implemented in Erlang as one process per SNMP table row. Suppose further that the INDEX in the SNMP -table is an OCTET STRING. The index structure would be created as follows:

        snmp_index:new(string)

        For each new process we create, we insert an item in an snmp_index structure:

        new_process(Name, SnmpIndex) ->
        -  Pid = start_process(),
        +table is an OCTET STRING. The index structure would be created as follows:

        snmp_index:new(string)

        For each new process we create, we insert an item in an snmp_index structure:

        new_process(Name, SnmpIndex) ->
        +  Pid = start_process(),
           NewSnmpIndex =
        -    snmp_index:insert(SnmpIndex, Name, Pid),
        +    snmp_index:insert(SnmpIndex, Name, Pid),
           <...>

        With this structure, we can now map an OBJECT IDENTIFIER in e.g. a GET NEXT -request, to the correct process:

        get_next_pid(Oid, SnmpIndex) ->
        -  {ok, {_, Pid}} = snmp_index:get_next(SnmpIndex, Oid),
        +request, to the correct process:

        get_next_pid(Oid, SnmpIndex) ->
        +  {ok, {_, Pid}} = snmp_index:get_next(SnmpIndex, Oid),
           Pid.

        /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_instr_functions.xhtml differs (HTML document, ASCII text, with very long lines (1719)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_instr_functions.xhtml 2026-06-04 00:07:51.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_instr_functions.xhtml 2042-07-06 13:27:19.000000000 +0000 @@ -48,8 +48,8 @@ New / Delete Operations

        -

        For scalar variables:

        variable_access(new [, ExtraArg1, ...])
        -variable_access(delete [, ExtraArg1, ...])

        For tables:

        table_access(new [, ExtraArg1, ...])
        +

        For scalar variables:

        variable_access(new [, ExtraArg1, ...])
        +variable_access(delete [, ExtraArg1, ...])

        For tables:

        table_access(new [, ExtraArg1, ...])
         table_access(delete [, ExtraArg1, ...])

        These functions are called for each object in an MIB when the MIB is unloaded or loaded, respectively.

        @@ -109,9 +109,9 @@ value 1, and [3, 5] is the list of requested columns. The function should now return the lexicographically next elements:

        [{[3, 1, 2], d}, {[5, 1, 2], f}]

        This is illustrated in the following table:

        GetNext from [3,1,1] and [5,1,1].

        The manager now issues the following getNext request:

        getNext{ myTable.myTableEntry.3.2.1,
                  myTable.myTableEntry.5.2.1 }

        This is transformed into one call to my_table:

        my_table(get_next, [2, 1], [3, 5])

        The function should now return:

        [{[4, 1, 1], b}, endOfTable]

        This is illustrated in the following table:

        GetNext from [3,2,1] and [5,2,1].

        The manager now issues the following getNext request:

        getNext{ myTable.myTableEntry.3.1.2,
        -         myTable.myTableEntry.4.1.2 }

        This will be transform into one call to my_table:

        my_table(get_next, [1, 2], [3, 4])

        The function should now return:

        [{[3, 2, 1], g}, {[5, 1, 1], c}]

        This is illustrated in the following table:

        GetNext from [3,1,2] and [4,1,2].

        The manager now issues the following getNext request:

        getNext{ myTable.myTableEntry,
        -         myTable.myTableEntry.1.3.2 }

        This will be transform into two calls to my_table:

        my_table(get_next, [], [0]) and
        -my_table(get_next, [3, 2], [1])

        The function should now return:

        [{[3, 1, 1], a}] and
        +         myTable.myTableEntry.4.1.2 }

        This will be transform into one call to my_table:

        my_table(get_next, [1, 2], [3, 4])

        The function should now return:

        [{[3, 2, 1], g}, {[5, 1, 1], c}]

        This is illustrated in the following table:

        GetNext from [3,1,2] and [4,1,2].

        The manager now issues the following getNext request:

        getNext{ myTable.myTableEntry,
        +         myTable.myTableEntry.1.3.2 }

        This will be transform into two calls to my_table:

        my_table(get_next, [], [0]) and
        +my_table(get_next, [3, 2], [1])

        The function should now return:

        [{[3, 1, 1], a}] and
         [{[3, 1, 1], a}]

        In both cases, the first accessible element in the table should be returned. As the key columns are not accessible, this means that the third column is the first row.

        Note

        Normally, the functions described above behave exactly as shown, but they are @@ -128,17 +128,17 @@ variables for a device, ipAdr and name with object identifiers 1.1.23.4 and 1.1.7 respectively. To access these variables, one could implement the two Erlang functions ip_access and name_access, which will be in the MIB. The -functions could be specified in a text file as follows:

        {ipAdr, {my_module, ip_access, []}}.
        +functions could be specified in a text file as follows:

        {ipAdr, {my_module, ip_access, []}}.
         % Or using the oid syntax for 'name'
        -{[1,1,7], {my_module, name_access, []}}.

        The ExtraArgument parameter is the empty list. For example, when the agent +{[1,1,7], {my_module, name_access, []}}.

        The ExtraArgument parameter is the empty list. For example, when the agent receives a get-request for the ipAdr variable, a call will be made to ip_access(get). The value returned by this function is the answer to the get-request.

        If ip_access and name_access are implemented similarly, we could write a -generic_access function using the ListOfExtraArguments:

        {ipAdr, {my_module, generic_access, ['IPADR']}}.
        +generic_access function using the ListOfExtraArguments:

        {ipAdr, {my_module, generic_access, ['IPADR']}}.
         % The mnemonic 'name' is more convenient than 1.1.7
        -{name, {my_module, generic_access, ['NAME']}}.

        When the agent receives the same get-request as above, a call will be made to -generic_access(get,'IPADR').

        Yet another possibility, closer to the hardware, could be:

        {ipAdr, {my_module, generic_access, [16#2543]}}.
        -{name, {my_module, generic_access, [16#A2B3]}}.

        +{name, {my_module, generic_access, ['NAME']}}.

        When the agent receives the same get-request as above, a call will be made to +generic_access(get,'IPADR').

        Yet another possibility, closer to the hardware, could be:

        {ipAdr, {my_module, generic_access, [16#2543]}}.
        +{name, {my_module, generic_access, [16#A2B3]}}.

        /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_manager_config_files.xhtml differs (HTML document, ASCII text, with very long lines (1067)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_manager_config_files.xhtml 2026-06-04 00:07:51.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_manager_config_files.xhtml 2042-07-06 13:27:19.000000000 +0000 @@ -44,10 +44,10 @@ every transport.

      • engine_id - The SnmpEngineID as defined in SNMP-FRAMEWORK-MIB. Mandatory.

      • max_message_size - The snmpEngineMaxMessageSize as defined in SNMP-FRAMEWORK-MIB. Mandatory.

    • Value is the value for the variable.

    The legacy and intermediate variables address and domain are still supported -so old configurations will work.

    The following example shows a manager.conf file:

    {transports,       [{transportDomainUdpIpv4, {{141,213,11,24}, 5000}},
    -                    {transportDomainUdpIpv6, {{0,0,0,0,0,0,0,1}, 5000}}]}.
    -{engine_id,        "mgrEngine"}.
    -{max_message_size, 484}.

    The value of engine_id is a string, which should have a very specific +so old configurations will work.

    The following example shows a manager.conf file:

    {transports,       [{transportDomainUdpIpv4, {{141,213,11,24}, 5000}},
    +                    {transportDomainUdpIpv6, {{0,0,0,0,0,0,0,1}, 5000}}]}.
    +{engine_id,        "mgrEngine"}.
    +{max_message_size, 484}.

    The value of engine_id is a string, which should have a very specific structure. See RFC 2271/2571 for details.

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_mib_compiler.xhtml differs (HTML document, ASCII text, with very long lines (774)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_mib_compiler.xhtml 2026-06-04 00:07:51.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_mib_compiler.xhtml 2042-07-06 13:27:19.000000000 +0000 @@ -36,7 +36,7 @@ association file, it gives a warning message and uses default instrumentation functions. (See Default Instrumentation for more details).

    The MIB compiler is started with a call to snmpc:compile(<mibname>). For -example:

    snmpc:compile("RFC1213-MIB").

    The output is a new file which is called <mibname>.bin.

    The MIB compiler understands both SMIv1 and SMIv2 MIBs. It uses the +example:

    snmpc:compile("RFC1213-MIB").

    The output is a new file which is called <mibname>.bin.

    The MIB compiler understands both SMIv1 and SMIv2 MIBs. It uses the MODULE-IDENTITY statement to determinate if the MIB is written in SMI version 1 or 2.

    @@ -48,10 +48,10 @@ compiled file and not the ASN.1 (source) file. A MIB must be recompiled to make changes visible to other MIBs importing it.

    The compiled files of the imported MIBs must be present in the current directory, or a directory in the current path. The path is supplied with the -{i, Path} option, for example:

    snmpc:compile("MY-MIB",
    -       [{i, ["friend_mibs/", "../standard_mibs/"]}]).

    It is also possible to import MIBs from OTP applications in an "include_lib" -like fashion with the il option. Example:

    snmpc:compile("MY-MIB",
    -       [{il, ["snmp/priv/mibs/", "myapp/priv/mibs/"]}]).

    finds the latest version of the snmp and myapp applications in the OTP +{i, Path} option, for example:

    snmpc:compile("MY-MIB",
    +       [{i, ["friend_mibs/", "../standard_mibs/"]}]).

    It is also possible to import MIBs from OTP applications in an "include_lib" +like fashion with the il option. Example:

    snmpc:compile("MY-MIB",
    +       [{il, ["snmp/priv/mibs/", "myapp/priv/mibs/"]}]).

    finds the latest version of the snmp and myapp applications in the OTP system and uses the expanded paths as include paths.

    Note that an SMIv2 MIB can import an SMIv1 MIB and vice versa.

    The following MIBs are built-ins of the Erlang SNMP compiler: SNMPv2-SMI, RFC-1215, RFC-1212, SNMPv2-TC, SNMPv2-CONF, and RFC1155-SMI. They cannot therefore be compiled separately.

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmpm.xhtml differs (HTML document, ASCII text, with very long lines (1951)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmpm.xhtml 2026-06-04 00:07:51.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmpm.xhtml 2042-07-06 13:27:19.000000000 +0000 @@ -1887,8 +1887,8 @@

    Load a Mib into the manager. The MibName is the name of the Mib, including -the path to where the compiled mib is found. For example,

              Dir = code:priv_dir(my_app) ++ "/mibs/",
    -          snmpm:load_mib(Dir ++ "MY-MIB").
    +the path to where the compiled mib is found. For example,

              Dir = code:priv_dir(my_app) ++ "/mibs/",
    +          snmpm:load_mib(Dir ++ "MY-MIB").
    @@ -3467,8 +3467,8 @@

    Unload a Mib from the manager. The MibName is the name of the Mib, including -the path to where the compiled mib is found. For example,

              Dir = code:priv_dir(my_app) ++ "/mibs/",
    -          snmpm:unload_mib(Dir ++ "MY-MIB").
    +the path to where the compiled mib is found. For example,

              Dir = code:priv_dir(my_app) ++ "/mibs/",
    +          snmpm:unload_mib(Dir ++ "MY-MIB").
    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_pdus.xhtml differs (HTML document, ASCII text, with very long lines (395)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_pdus.xhtml 2026-06-04 00:07:51.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp_pdus.xhtml 2042-07-06 13:27:19.000000000 +0000 @@ -29,8 +29,8 @@ Erlang record representations and vice versa. The record definitions can be found in the file snmp/include/snmp_types.hrl. If snmpv3 is used, the module that includes snmp_types.hrl must define the constant SNMP_USE_V3 before the -header file is included. Example:

    -define(SNMP_USE_V3, true).
    --include_lib("snmp/include/snmp_types.hrl").

    Encoding and decoding must be done explicitly when writing your own Net if +header file is included. Example:

    -define(SNMP_USE_V3, true).
    +-include_lib("snmp/include/snmp_types.hrl").

    Encoding and decoding must be done explicitly when writing your own Net if process.

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp.xhtml differs (HTML document, ASCII text, with very long lines (382)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp.xhtml 2026-06-04 00:07:51.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.epub/OEBPS/snmp.xhtml 2042-07-06 13:27:19.000000000 +0000 @@ -3222,8 +3222,8 @@

    Utility function(s) to produce a formatted printout of the versions info -generated by the versions1 function

    This is the same as doing, e.g.:

               {ok, V} = snmp:versions1(),
    -           snmp:print_versions(V).
    +generated by the versions1 function

    This is the same as doing, e.g.:

               {ok, V} = snmp:versions1(),
    +           snmp:print_versions(V).
    @@ -3421,17 +3421,17 @@

    This function is used to set up trace on function(s) for the given module or modules.

    The example below sets up trace on the exported functions (default) of module snmp_generic and all functions of module snmp_generic_mnesia. With return -values (which is default) and timestamps in both cases (which is also default):

    	  snmp:enable_trace(),
    -	  snmp:set_trace([snmp_generic,
    -                          {snmp_generic_mnesia, [{scope, all_functions}]}]),
    +values (which is default) and timestamps in both cases (which is also default):

    	  snmp:enable_trace(),
    +	  snmp:set_trace([snmp_generic,
    +                          {snmp_generic_mnesia, [{scope, all_functions}]}]),
     	  .
     	  .
     	  .
    -          snmp:set_trace(snmp_generic, disable),
    +          snmp:set_trace(snmp_generic, disable),
     	  .
     	  .
     	  .
    -	  snmp:disable_trace(),
    +
    snmp:disable_trace(),
    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (394)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.html 2026-06-04 19:05:15.656572890 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp.html 2026-06-04 19:05:15.656572890 +0000 @@ -3343,8 +3343,8 @@

    Utility function(s) to produce a formatted printout of the versions info -generated by the versions1 function

    This is the same as doing, e.g.:

               {ok, V} = snmp:versions1(),
    -           snmp:print_versions(V).
    +generated by the versions1 function

    This is the same as doing, e.g.:

               {ok, V} = snmp:versions1(),
    +           snmp:print_versions(V).
    @@ -3542,17 +3542,17 @@

    This function is used to set up trace on function(s) for the given module or modules.

    The example below sets up trace on the exported functions (default) of module snmp_generic and all functions of module snmp_generic_mnesia. With return -values (which is default) and timestamps in both cases (which is also default):

    	  snmp:enable_trace(),
    -	  snmp:set_trace([snmp_generic,
    -                          {snmp_generic_mnesia, [{scope, all_functions}]}]),
    +values (which is default) and timestamps in both cases (which is also default):

    	  snmp:enable_trace(),
    +	  snmp:set_trace([snmp_generic,
    +                          {snmp_generic_mnesia, [{scope, all_functions}]}]),
     	  .
     	  .
     	  .
    -          snmp:set_trace(snmp_generic, disable),
    +          snmp:set_trace(snmp_generic, disable),
     	  .
     	  .
     	  .
    -	  snmp:disable_trace(),
    +
    snmp:disable_trace(),
    @@ -3946,7 +3946,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_advanced_agent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (878)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_advanced_agent.html 2026-06-04 19:05:15.676573075 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_advanced_agent.html 2026-06-04 19:05:15.676573075 +0000 @@ -329,16 +329,16 @@ empName DisplayString, empTelNo DisplayString, empStatus RowStatus - }

    The corresponding Mnesia table is specified as follows:

    mnesia:create_table([{name, employees},
    -                     {snmp, [{key, {integer, string}}]},
    -                     {attributes, [key, telno, row_status]}]).

    Note

    In the Mnesia tables, the two key columns are stored as a tuple with two + }

    The corresponding Mnesia table is specified as follows:

    mnesia:create_table([{name, employees},
    +                     {snmp, [{key, {integer, string}}]},
    +                     {attributes, [key, telno, row_status]}]).

    Note

    In the Mnesia tables, the two key columns are stored as a tuple with two elements. Therefore, the arity of the table is 3.

    Instrumentation Functions

    -

    The MIB table shown in the previous section can be compiled as follows:

    1> snmpc:compile("EmpMIB", [{db, mnesia}]).

    This is all that has to be done! Now the manager can read, add, and modify +

    The MIB table shown in the previous section can be compiled as follows:

    1> snmpc:compile("EmpMIB", [{db, mnesia}]).

    This is all that has to be done! Now the manager can read, add, and modify rows. Also, you can use the ordinary Mnesia API to access the table from your programs. The only explicit action is to create the Mnesia table, an action the user has to perform in order to create the required table schemas.

    @@ -350,11 +350,11 @@

    It is often necessary to take some specific action when a table is modified. This is accomplished with an instrumentation function. It executes some specific code when the table is set, and passes all other requests down to the -pre-defined function.

    The following example illustrates this idea:

    emp_table(set, RowIndex, Cols) ->
    -    notify_internal_resources(RowIndex, Cols),
    -    snmp_generic:table_func(set, RowIndex, Cols, {empTable, mnesia});
    -emp_table(Op, RowIndex, Cols) ->
    -    snmp_generic:table_func(Op, RowIndex, Cols, {empTable, mnesia}).

    The default instrumentation functions are defined in the module snmp_generic. +pre-defined function.

    The following example illustrates this idea:

    emp_table(set, RowIndex, Cols) ->
    +    notify_internal_resources(RowIndex, Cols),
    +    snmp_generic:table_func(set, RowIndex, Cols, {empTable, mnesia});
    +emp_table(Op, RowIndex, Cols) ->
    +    snmp_generic:table_func(Op, RowIndex, Cols, {empTable, mnesia}).

    The default instrumentation functions are defined in the module snmp_generic. Refer to the Reference Manual, section SNMP, module snmp_generic for details.

    @@ -367,28 +367,28 @@ that the agent does not know about. This situation is handled by adding values for the internal columns in the set function.

    To illustrate this, suppose we extend our Mnesia empTable with one internal column. We create it as before, but with an arity of 4, by adding another -attribute.

    mnesia:create_table([{name, employees},
    -                     {snmp, [{key, {integer, string}}]},
    -                     {attributes, {key, telno, row_status, internal_col}}]).

    The last column is the internal column. When performing a set operation, which +attribute.

    mnesia:create_table([{name, employees},
    +                     {snmp, [{key, {integer, string}}]},
    +                     {attributes, {key, telno, row_status, internal_col}}]).

    The last column is the internal column. When performing a set operation, which creates a row, we must give a value to the internal column. The instrumentation -functions will now look as follows:

    -define(createAndGo, 4).
    --define(createAndWait, 5).
    +functions will now look as follows:

    -define(createAndGo, 4).
    +-define(createAndWait, 5).
     
    -emp_table(set, RowIndex, Cols) ->
    -  notify_internal_resources(RowIndex, Cols),
    +emp_table(set, RowIndex, Cols) ->
    +  notify_internal_resources(RowIndex, Cols),
       NewCols =
    -    case is_row_created(empTable, Cols) of
    -      true -> Cols ++ [{4, "internal"}]; % add internal column
    +    case is_row_created(empTable, Cols) of
    +      true -> Cols ++ [{4, "internal"}]; % add internal column
           false -> Cols                      % keep original cols
       end,
    -  snmp_generic:table_func(set, RowIndex, NewCols, {empTable, mnesia});
    -emp_table(Op, RowIndex, Cols) ->
    -  snmp_generic:table_func(Op, RowIndex, Cols, {empTable, mnesia}).
    -
    -is_row_created(Name, Cols) ->
    -  case snmp_generic:get_status_col(Name, Cols) of
    -    {ok, ?createAndGo} -> true;
    -    {ok, ?createAndWait} -> true;
    +  snmp_generic:table_func(set, RowIndex, NewCols, {empTable, mnesia});
    +emp_table(Op, RowIndex, Cols) ->
    +  snmp_generic:table_func(Op, RowIndex, Cols, {empTable, mnesia}).
    +
    +is_row_created(Name, Cols) ->
    +  case snmp_generic:get_status_col(Name, Cols) of
    +    {ok, ?createAndGo} -> true;
    +    {ok, ?createAndWait} -> true;
         _ -> false
       end.

    If a row is created, we always set the internal column to "internal".

    @@ -457,7 +457,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_agent_config_files.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1549)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_agent_config_files.html 2026-06-04 19:05:15.695573252 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_agent_config_files.html 2026-06-04 19:05:15.695573252 +0000 @@ -150,19 +150,19 @@

    The agent information should be stored in a file called agent.conf.

    Each entry is a tuple of size two:

    {AgentVariable, Value}.

    • AgentVariable is one of the variables in SNMP-FRAMEWORK-MIB or one of the internal variables intAgentUDPPort, which defines which UDP port the agent listens to, or intAgentTransports, which defines the transport domains and -addresses of the agent.
    • Value is the value for the variable.

    The following example shows an agent.conf file:

    {intAgentUDPPort, 4000}.
    -{intAgentTransports,
    - [{transportDomainUdpIpv4, {141,213,11,24}},
    -  {transportDomainUdpIpv6, {0,0,0,0,0,0,0,1}}]}.
    -{snmpEngineID, "mbj's engine"}.
    -{snmpEngineMaxMessageSize, 484}.

    These are the supported entries and their value types:

          {snmpEngine,               string()}.                     % Mandatory
    -      {snmpEngineMaxMessageSize, snmp_framework_mib:max_message_size()}.  % Mandatory
    -      {intAgentUDPPort,          inet:port_number()}.                      % Optional
    -      {intAgentTransports,       [snmpa_conf:intAgentTransport()]}.   % Mandatory

    If a "traditional" transport is specified (without explicit Kind, handling +addresses of the agent.

  • Value is the value for the variable.
  • The following example shows an agent.conf file:

    {intAgentUDPPort, 4000}.
    +{intAgentTransports,
    + [{transportDomainUdpIpv4, {141,213,11,24}},
    +  {transportDomainUdpIpv6, {0,0,0,0,0,0,0,1}}]}.
    +{snmpEngineID, "mbj's engine"}.
    +{snmpEngineMaxMessageSize, 484}.

    These are the supported entries and their value types:

          {snmpEngine,               string()}.                     % Mandatory
    +      {snmpEngineMaxMessageSize, snmp_framework_mib:max_message_size()}.  % Mandatory
    +      {intAgentUDPPort,          inet:port_number()}.                      % Optional
    +      {intAgentTransports,       [snmpa_conf:intAgentTransport()]}.   % Mandatory

    If a "traditional" transport is specified (without explicit Kind, handling both requests and traps) for a transport domain, its not possible to also specify a transport (for that domain) with a specific Kind. This is for -example, not allowed:

     [{transportDomainUdpIpv4, {{141,213,11,24}, 4000}},
    -  {transportDomainUdpIpv4, {{141,213,11,24}, 4001}, trap_sender}].

    Note that only one transport per kind for each transport domain can be +example, not allowed:

     [{transportDomainUdpIpv4, {{141,213,11,24}, 4000}},
    +  {transportDomainUdpIpv4, {{141,213,11,24}, 4001}, trap_sender}].

    Note that only one transport per kind for each transport domain can be configured.

    PortInfo system is used to indicate that the 'system' should choose (the way port number '0' (zero) is normally used). Port info '0' (zero) cannot be used for this, since it is (internally) used to represent the 'default' port number.

    In the traditional transport entries, when the Addr value does not contain a @@ -188,12 +188,12 @@ System Information

    The system information should be stored in a file called standard.conf.

    Each entry is a tuple of size two:

    {SystemVariable, Value}.

    • SystemVariable is one of the variables in the system group, or -snmpEnableAuthenTraps.
    • Value is the value for the variable.

    The following example shows a valid standard.conf file:

    {sysDescr, "Erlang SNMP agent"}.
    -{sysObjectID, [1,2,3]}.
    -{sysContact, "(mbj,eklas)@erlang.ericsson.se"}.
    -{sysName, "test"}.
    -{sysServices, 72}.
    -{snmpEnableAuthenTraps, enabled}.

    A value must be provided for all variables, which lack default values in the +snmpEnableAuthenTraps.

  • Value is the value for the variable.
  • The following example shows a valid standard.conf file:

    {sysDescr, "Erlang SNMP agent"}.
    +{sysObjectID, [1,2,3]}.
    +{sysContact, "(mbj,eklas)@erlang.ericsson.se"}.
    +{sysName, "test"}.
    +{sysServices, 72}.
    +{snmpEnableAuthenTraps, enabled}.

    A value must be provided for all variables, which lack default values in the MIB.

    @@ -311,7 +311,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_agent_funct_descr.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (773)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_agent_funct_descr.html 2026-06-04 19:05:15.718573465 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_agent_funct_descr.html 2026-06-04 19:05:15.719573474 +0000 @@ -308,7 +308,7 @@ MIBs are always available in all contexts.

    The ASN.1 code, the Erlang source code, and the generated .hrl files for them are provided in the distribution and are placed in the directories mibs, src, and include, respectively, in the snmp application.

    The .hrl files are generated with snmpc:mib_to_hrl/1. Include these files in -your code as in the following example:

    -include_lib("snmp/include/SNMPv2-MIB.hrl").

    The initial values for the managed objects defined in these tables, are read at +your code as in the following example:

    -include_lib("snmp/include/SNMPv2-MIB.hrl").

    The initial values for the managed objects defined in these tables, are read at start-up from a set of configuration files. These are described in Configuration Files.

    @@ -469,9 +469,9 @@

    Notifications are defined in SMIv1 with the TRAP-TYPE macro in the definition of an MIB (see RFC1215). The corresponding macro in SMIv2 is NOTIFICATION-TYPE. When an application decides to send a notification, it calls one of the -following functions:

    snmpa:send_notification(Agent, Notification, Receiver
    -                       [, NotifyName, ContextName, Varbinds])
    -snmpa:send_trap(Agent, Notification, Community [, Receiver, Varbinds])

    providing the registered name or process identifier of the agent where the MIB, +following functions:

    snmpa:send_notification(Agent, Notification, Receiver
    +                       [, NotifyName, ContextName, Varbinds])
    +snmpa:send_trap(Agent, Notification, Community [, Receiver, Varbinds])

    providing the registered name or process identifier of the agent where the MIB, which defines the notification is loaded and the symbolic name of the notification.

    If the send_notification/3,4 function is used, all management targets are selected, as defined in RFC2273. The Receiver parameter defines where the @@ -615,7 +615,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_agent_netif.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (513)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_agent_netif.html 2026-06-04 19:05:15.737573641 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_agent_netif.html 2026-06-04 19:05:15.737573641 +0000 @@ -267,7 +267,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_app.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (984)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_app.html 2026-06-04 19:05:15.763573882 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_app.html 2026-06-04 19:05:15.763573882 +0000 @@ -140,51 +140,51 @@

    The following configuration parameters are defined for the SNMP application. Refer to application(3) for more information about configuration parameters.

    The snmp part of the config file specifying the configuration parameters is -basically the following tuple:

          {snmp, snmp_components_config()}

    A minimal config file for starting a node with both a manager and an agent:

          [{snmp,
    -        [{agent, [{db_dir, "/tmp/snmp/agent/db"},
    -                  {config, [{dir, "/tmp/snmp/agent/conf"}]}]},
    -         {manager, [{config, [{dir, "/tmp/snmp/manager/conf"},
    -                              {db_dir, "/tmp/snmp/manager/db"}]}]}]}
    -        ]
    +basically the following tuple:

          {snmp, snmp_components_config()}

    A minimal config file for starting a node with both a manager and an agent:

          [{snmp,
    +        [{agent, [{db_dir, "/tmp/snmp/agent/db"},
    +                  {config, [{dir, "/tmp/snmp/agent/conf"}]}]},
    +         {manager, [{config, [{dir, "/tmp/snmp/manager/conf"},
    +                              {db_dir, "/tmp/snmp/manager/db"}]}]}]}
    +        ]
            }
           ].

    Each snmp component has its own set of configuration parameters, even though -some of the types are common to both components.

          snmp_components_config() -> [snmp_component_config()]
    -      snmp_component_config() -> {agent, agent_options()} | {manager, manager_options()}
    -      agent_options() = [agent_option()]
    -      agent_option() = {restart_type,     restart_type()}     |
    -                       {agent_type,       agent_type()}       |
    -                       {agent_verbosity,  verbosity()}        |
    -                       {discovery,        agent_discovery()}  |
    -                       {versions,         versions()}         |
    -                       {gb_max_vbs,       gb_max_vbs()}       |
    -                       {priority,         priority()}         |
    -                       {multi_threaded,   multi_threaded()}   |
    -                       {db_dir,           db_dir()}           |
    -                       {db_init_error,    db_init_error()}    |
    -                       {local_db,         local_db()}         |
    -                       {net_if,           agent_net_if()}     |
    -                       {mibs,             mibs()}             |
    -                       {mib_storage,      mib_storage()}      |
    -                       {mib_server,       mib_server()}       |
    -                       {audit_trail_log,  audit_trail_log()}  |
    -                       {error_report_mod, error_report_mod()} |
    -                       {note_store,       note_store()}       |
    -                       {symbolic_store,   symbolic_store()}   |
    -                       {target_cache,     target_cache()}     |
    -                       {config,           agent_config()}
    -      manager_options() = [manager_option()]
    -      manager_option() = {restart_type,             restart_type()}    |
    -                         {net_if,                   manager_net_if()}  |
    -                         {server,                   server()}          |
    -                         {note_store,               note_store()}      |
    -                         {config,                   manager_config()}  |
    -                         {inform_request_behaviour, manager_irb()}     |
    -                         {mibs,                     manager_mibs()}    |
    -                         {priority,                 priority()}        |
    -                         {audit_trail_log,          audit_trail_log()} |
    -                         {versions,                 versions()}        |
    -                         {def_user_mod,             def_user_module()  |
    -                         {def_user_data,            def_user_data()}

    Agent specific config options and types:

    • agent_type() = master | sub <optional> - If master, +some of the types are common to both components.

            snmp_components_config() -> [snmp_component_config()]
      +      snmp_component_config() -> {agent, agent_options()} | {manager, manager_options()}
      +      agent_options() = [agent_option()]
      +      agent_option() = {restart_type,     restart_type()}     |
      +                       {agent_type,       agent_type()}       |
      +                       {agent_verbosity,  verbosity()}        |
      +                       {discovery,        agent_discovery()}  |
      +                       {versions,         versions()}         |
      +                       {gb_max_vbs,       gb_max_vbs()}       |
      +                       {priority,         priority()}         |
      +                       {multi_threaded,   multi_threaded()}   |
      +                       {db_dir,           db_dir()}           |
      +                       {db_init_error,    db_init_error()}    |
      +                       {local_db,         local_db()}         |
      +                       {net_if,           agent_net_if()}     |
      +                       {mibs,             mibs()}             |
      +                       {mib_storage,      mib_storage()}      |
      +                       {mib_server,       mib_server()}       |
      +                       {audit_trail_log,  audit_trail_log()}  |
      +                       {error_report_mod, error_report_mod()} |
      +                       {note_store,       note_store()}       |
      +                       {symbolic_store,   symbolic_store()}   |
      +                       {target_cache,     target_cache()}     |
      +                       {config,           agent_config()}
      +      manager_options() = [manager_option()]
      +      manager_option() = {restart_type,             restart_type()}    |
      +                         {net_if,                   manager_net_if()}  |
      +                         {server,                   server()}          |
      +                         {note_store,               note_store()}      |
      +                         {config,                   manager_config()}  |
      +                         {inform_request_behaviour, manager_irb()}     |
      +                         {mibs,                     manager_mibs()}    |
      +                         {priority,                 priority()}        |
      +                         {audit_trail_log,          audit_trail_log()} |
      +                         {versions,                 versions()}        |
      +                         {def_user_mod,             def_user_module()  |
      +                         {def_user_data,            def_user_data()}

      Agent specific config options and types:

      • agent_type() = master | sub <optional> - If master, one master agent is started. Otherwise, no agents are started.

        Default is master.

      • agent_discovery() = [agent_discovery_opt()] <optional> - agent_discovery_opt() = {terminating, agent_terminating_discovery_opts()} | {originating, agent_originating_discovery_opts()}

        The terminating options effects discovery initiated by a manager.

        The originating options effects discovery initiated by this agent.

        For defaults see the options in agent_discovery_opt().

      • agent_terminating_discovery_opts() = [agent_terminating_discovery_opt()] <optional> - agent_terminating_discovery_opt() = {enable, boolean()} | {stage2, discovery | plain} | {trigger_username, string()}

        These are options effecting discovery terminating in this agent (i.e. @@ -425,7 +425,7 @@ Erlang programming language

        -

        Copyright © 1996-2026 Ericsson AB

        +

        Copyright © 1996-2042 Ericsson AB

        /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_app_a.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1676)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_app_a.html 2026-06-04 19:05:15.781574049 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_app_a.html 2026-06-04 19:05:15.781574049 +0000 @@ -183,7 +183,7 @@ Erlang programming language

        -

        Copyright © 1996-2026 Ericsson AB

        +

        Copyright © 1996-2042 Ericsson AB

        /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_app_b.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (501)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_app_b.html 2026-06-04 19:05:15.801574235 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_app_b.html 2026-06-04 19:05:15.802574244 +0000 @@ -586,23 +586,23 @@ immediately removed." - SYNTAX INTEGER { + SYNTAX INTEGER { -- the following two values are states: -- these values may be read or written - active(1), - notInService(2), + active(1), + notInService(2), -- the following value is a state: -- this value may be read, but not written - notReady(3), + notReady(3), -- the following three values are -- actions: these values may be written, -- but are never read - createAndGo(4), - createAndWait(5), - destroy(6) - }
    + createAndGo(4), + createAndWait(5), + destroy(6) + }
    @@ -653,7 +653,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_app_c.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (330)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_app_c.html 2026-06-04 19:05:15.821574420 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_app_c.html 2026-06-04 19:05:15.820574411 +0000 @@ -190,7 +190,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_audit_trail_log.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_audit_trail_log.html 2026-06-04 19:05:15.837574569 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_audit_trail_log.html 2026-06-04 19:05:15.837574569 +0000 @@ -202,7 +202,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_community_mib.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_community_mib.html 2026-06-04 19:05:15.856574745 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_community_mib.html 2026-06-04 19:05:15.856574745 +0000 @@ -619,7 +619,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_config.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (850)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_config.html 2026-06-04 19:05:15.885575014 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_config.html 2026-06-04 19:05:15.885575014 +0000 @@ -145,41 +145,41 @@ more information).
  • the database directory stores the internal database files.
  • The agent and manager uses (application) configuration parameters to find out where these directories are located. The parameters should be defined in an Erlang system configuration file. The following configuration parameters are -defined for the SNMP application:

          agent_options() = [agent_option()]
    -      agent_option() = {restart_type,     restart_type()}     |
    -                       {agent_type,       agent_type()}       |
    -                       {agent_verbosity,  verbosity()}        |
    -                       {versions,         versions()}         |
    -                       {discovery,        agent_discovery()}  |
    -                       {gb_max_vbs,       gb_max_vbs()}       |
    -                       {priority,         priority()}         |
    -                       {multi_threaded,   multi_threaded()}   |
    -                       {db_dir,           db_dir()}           |
    -                       {db_init_error,    db_init_error()}    |
    -                       {local_db,         local_db()}         |
    -                       {net_if,           agent_net_if()}     |
    -                       {mibs,             mibs()}             |
    -                       {mib_storage,      mib_storage()}      |
    -                       {mib_server,       mib_server()}       |
    -                       {audit_trail_log,  audit_trail_log()}  |
    -                       {error_report_mod, error_report_mod()} |
    -                       {note_store,       note_store()}       |
    -                       {symbolic_store,   symbolic_store()}   |
    -                       {target_cache,     target_cache()}     |
    -                       {config,           agent_config()}
    -      manager_options() = [manager_option()]
    -      manager_option() = {restart_type,             restart_type()}    |
    -                         {net_if,                   manager_net_if()}  |
    -                         {server,                   server()}          |
    -                         {note_store,               note_store()}      |
    -                         {config,                   manager_config()}  |
    -                         {inform_request_behaviour, manager_irb()}     |
    -                         {mibs,                     manager_mibs()}    |
    -                         {priority,                 priority()}        |
    -                         {audit_trail_log,          audit_trail_log()} |
    -                         {versions,                 versions()}        |
    -                         {def_user_mod,             def_user_module()  |
    -                         {def_user_data,            def_user_data()}

    Agent specific config options and types:

    • agent_type() = master | sub <optional> - If master, +defined for the SNMP application:

            agent_options() = [agent_option()]
      +      agent_option() = {restart_type,     restart_type()}     |
      +                       {agent_type,       agent_type()}       |
      +                       {agent_verbosity,  verbosity()}        |
      +                       {versions,         versions()}         |
      +                       {discovery,        agent_discovery()}  |
      +                       {gb_max_vbs,       gb_max_vbs()}       |
      +                       {priority,         priority()}         |
      +                       {multi_threaded,   multi_threaded()}   |
      +                       {db_dir,           db_dir()}           |
      +                       {db_init_error,    db_init_error()}    |
      +                       {local_db,         local_db()}         |
      +                       {net_if,           agent_net_if()}     |
      +                       {mibs,             mibs()}             |
      +                       {mib_storage,      mib_storage()}      |
      +                       {mib_server,       mib_server()}       |
      +                       {audit_trail_log,  audit_trail_log()}  |
      +                       {error_report_mod, error_report_mod()} |
      +                       {note_store,       note_store()}       |
      +                       {symbolic_store,   symbolic_store()}   |
      +                       {target_cache,     target_cache()}     |
      +                       {config,           agent_config()}
      +      manager_options() = [manager_option()]
      +      manager_option() = {restart_type,             restart_type()}    |
      +                         {net_if,                   manager_net_if()}  |
      +                         {server,                   server()}          |
      +                         {note_store,               note_store()}      |
      +                         {config,                   manager_config()}  |
      +                         {inform_request_behaviour, manager_irb()}     |
      +                         {mibs,                     manager_mibs()}    |
      +                         {priority,                 priority()}        |
      +                         {audit_trail_log,          audit_trail_log()} |
      +                         {versions,                 versions()}        |
      +                         {def_user_mod,             def_user_module()  |
      +                         {def_user_data,            def_user_data()}

      Agent specific config options and types:

      • agent_type() = master | sub <optional> - If master, one master agent is started. Otherwise, no agents are started.

        Default is master.

      • agent_discovery() = [agent_discovery_opt()] <optional> - agent_discovery_opt() = {terminating, agent_terminating_discovery_opts()} | {originating, agent_originating_discovery_opts()}

        The terminating options effects discovery initiated by a manager.

        The originating options effects discovery initiated by this agent.

        For defaults see the options in agent_discovery_opt().

      • agent_terminating_discovery_opts() = [agent_terminating_discovery_opt()] <optional> - agent_terminating_discovery_opt() = {enable, boolean()} | {stage2, discovery | plain} | {trigger_username, string()}

        These are options effecting discovery terminating in this agent (i.e. @@ -556,34 +556,34 @@ configuration parameters. The verbosity itself has several _levels: silence | info | log | debug | trace. For the lowest verbosity silence, nothing is printed. The higher the verbosity, the -more is printed. Default value is always silence.

        3> snmpa:verbosity(master_agent, log).
        +more is printed. Default value is always silence.

        3> snmpa:verbosity(master_agent, log).
         ok
        -5> snmpa:verbosity(net_if, log).
        +5> snmpa:verbosity(net_if, log).
         ok
         6>
         %% Example of output from the agent when a get-next-request arrives:
         ** SNMP NET-IF LOG:
        -   got packet from {147,12,12,12}:5000
        +   got packet from {147,12,12,12}:5000
         
         ** SNMP NET-IF MPD LOG:
            v1, community: all-rights
         
         ** SNMP NET-IF LOG:
        -   got pdu from {147,12,12,12}:5000 {pdu, 'get-next-request',
        +   got pdu from {147,12,12,12}:5000 {pdu, 'get-next-request',
                                                   62612569,noError,0,
        -                                          [{varbind,[1,1],'NULL','NULL',1}]}
        +                                          [{varbind,[1,1],'NULL','NULL',1}]}
         
         ** SNMP MASTER-AGENT LOG:
        -   apply: snmp_generic,variable_func,[get,{sysDescr,persistent}]
        +   apply: snmp_generic,variable_func,[get,{sysDescr,persistent}]
         
         ** SNMP MASTER-AGENT LOG:
        -   returned: {value,"Erlang SNMP agent"}
        +   returned: {value,"Erlang SNMP agent"}
         
         ** SNMP NET-IF LOG:
        -   reply pdu: {pdu,'get-response',62612569,noError,0,
        -                   [{varbind,[1,3,6,1,2,1,1,1,0],
        +   reply pdu: {pdu,'get-response',62612569,noError,0,
        +                   [{varbind,[1,3,6,1,2,1,1,1,0],
                                      'OCTET STRING',
        -                             "Erlang SNMP agent",1}]}
        +                             "Erlang SNMP agent",1}]}
         
         ** SNMP NET-IF INFO: time in agent: 19711 mysec

        Other useful function(s) for debugging the agent are:

        • snmpa:info/0,1 - info is used to retrieve a list of miscellaneous agent information.

        • snmpa:which_aliasnames/0 - @@ -650,7 +650,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_def_instr_functions.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (449)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_def_instr_functions.html 2026-06-04 19:05:15.903575181 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_def_instr_functions.html 2026-06-04 19:05:15.904575190 +0000 @@ -368,7 +368,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_framework_mib.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_framework_mib.html 2026-06-04 19:05:15.922575357 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_framework_mib.html 2026-06-04 19:05:15.922575357 +0000 @@ -618,7 +618,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_generic.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1644)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_generic.html 2026-06-04 19:05:15.946575580 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_generic.html 2026-06-04 19:05:15.946575580 +0000 @@ -140,9 +140,9 @@ | MIB | +---------------+ | - Association file (associates a MIB object with + Association file (associates a MIB object with | snmp_generic:table_funct - | snmp_generic:variable_func) + | snmp_generic:variable_func) +--------------------------------------+ | snmp_generic | Support for get-next, | | RowStatus operations @@ -150,7 +150,7 @@ | snmpa_local_db | Mnesia | Database +--------------+-------+---------------+ | dets | ets | -| (persistent) | | +| (persistent) | | +--------------+-------+

        Each function takes the argument NameDb, which is a tuple {Name, Db}, to identify which database the functions should use. Name is the symbolic name of the managed object as defined in the MIB, and Db is either volatile, @@ -162,41 +162,41 @@ this. Specifically, if variables are stored in Mnesia, the table snmp_variables must be created by the programmer. The record definition for this table is defined in the file snmp/include/snmp_types.hrl.

        If an instrumentation function in the association file for a variable myVar -does not have a name when compiling an MIB, the compiler generates an entry.

        {myVar, {snmp_generic, variable_func, [{myVar, Db]}}.

        And for a table:

        {myTable, {snmp_generic, table_func, [{myTable, Db]}}.

        +does not have a name when compiling an MIB, the compiler generates an entry.

        {myVar, {snmp_generic, variable_func, [{myVar, Db]}}.

        And for a table:

        {myTable, {snmp_generic, table_func, [{myTable, Db]}}.

        Example

        The following example shows an implementation of a table which is stored in -Mnesia, but with some checks performed at set-request operations.

        myTable_func(new, NameDb) ->   % pass unchanged
        -  snmp_generic:table_func(new, NameDb).
        +Mnesia, but with some checks performed at set-request operations.

        myTable_func(new, NameDb) ->   % pass unchanged
        +  snmp_generic:table_func(new, NameDb).
         
        -myTable_func(delete, NameDb) ->   % pass unchanged
        -  snmp_generic:table_func(delete, NameDb).
        +myTable_func(delete, NameDb) ->   % pass unchanged
        +  snmp_generic:table_func(delete, NameDb).
         
         %% change row
        -myTable_func(is_set_ok, RowIndex, Cols, NameDb) ->
        -  case snmp_generic:table_func(is_set_ok, RowIndex,
        -                               Cols, NameDb) of
        -    {noError, 0} ->
        -      myApplication:is_set_ok(RowIndex, Cols);
        +myTable_func(is_set_ok, RowIndex, Cols, NameDb) ->
        +  case snmp_generic:table_func(is_set_ok, RowIndex,
        +                               Cols, NameDb) of
        +    {noError, 0} ->
        +      myApplication:is_set_ok(RowIndex, Cols);
             Err ->
               Err
           end;
         
        -myTable_func(set, RowIndex, Cols, NameDb) ->
        -  case snmp_generic:table_func(set, RowIndex, Cols,
        -                               NameDb),
        -    {noError, 0} ->
        +myTable_func(set, RowIndex, Cols, NameDb) ->
        +  case snmp_generic:table_func(set, RowIndex, Cols,
        +                               NameDb),
        +    {noError, 0} ->
               % Now the row is updated, tell the application
        -      myApplication:update(RowIndex, Cols);
        +      myApplication:update(RowIndex, Cols);
             Err ->
               Err
           end;
         
        -myTable_func(Op, RowIndex, Cols, NameDb) ->   % pass unchanged
        -  snmp_generic:table_func(Op, RowIndex, Cols, NameDb).

        The .funcs file would look like:

        {myTable, {myModule, myTable_func, [{myTable, mnesia}]}}.
        +
        myTable_func(Op, RowIndex, Cols, NameDb) -> % pass unchanged + snmp_generic:table_func(Op, RowIndex, Cols, NameDb).

        The .funcs file would look like:

        {myTable, {myModule, myTable_func, [{myTable, mnesia}]}}.
        @@ -963,7 +963,7 @@ Erlang programming language

        -

        Copyright © 1996-2026 Ericsson AB

        +

        Copyright © 1996-2042 Ericsson AB

        /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_impl_example_agent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1539)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_impl_example_agent.html 2026-06-04 19:05:15.972575821 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_impl_example_agent.html 2026-06-04 19:05:15.972575821 +0000 @@ -230,54 +230,54 @@ the default implementation of it. Recall that MIBs imported by "EX1-MIB.mib" must be present and compiled in the current directory ("./STANDARD-MIB.bin","./RFC1213-MIB.bin") when compiling.

        unix> erl -config ./sys
        -1> application:start(snmp).
        +1> application:start(snmp).
         ok
        -2> snmpc:compile("EX1-MIB").
        +2> snmpc:compile("EX1-MIB").
         No accessfunction for 'friendsTable', using default.
         No accessfunction for 'myName', using default.
        -{ok, "EX1-MIB.bin"}
        -3> snmpa:load_mibs(snmp_master_agent, ["EX1-MIB"]).
        +{ok, "EX1-MIB.bin"}
        +3> snmpa:load_mibs(snmp_master_agent, ["EX1-MIB"]).
         ok

        This MIB is now loaded into the agent, and a manager can ask questions. As an example of this, we start another Erlang system and the simple Erlang manager in -the toolkit:

        1> snmp_test_mgr:start_link([{agent,"dront.ericsson.se"},{community,"all-rights"},
        +the toolkit:

        1> snmp_test_mgr:start_link([{agent,"dront.ericsson.se"},{community,"all-rights"},
          %% making it understand symbolic names: {mibs,["EX1-MIB","STANDARD-MIB"]}]).
        -{ok, <0.89.0>}
        +{ok, <0.89.0>}
         %% a get-next request with one OID.
        -2> snmp_test_mgr:gn([[1,3,6,1,3,7]]).
        +2> snmp_test_mgr:gn([[1,3,6,1,3,7]]).
         ok
         * Got PDU:
        -[myName,0] = []
        +[myName,0] = []
         %% A set-request (now using symbolic names for convenience)
        -3> snmp_test_mgr:s([{[myName,0], "Martin"}]).
        +3> snmp_test_mgr:s([{[myName,0], "Martin"}]).
         ok
         * Got PDU:
        -[myName,0] = "Martin"
        +[myName,0] = "Martin"
         %% Try the same get-next request again
        -4> snmp_test_mgr:gn([[1,3,6,1,3,7]]).
        +4> snmp_test_mgr:gn([[1,3,6,1,3,7]]).
         ok
         * Got PDU:
        -[myName,0] = "Martin"
        +[myName,0] = "Martin"
         %% ... and we got the new value.
         %% you can event do row operations. How to add a row:
        -5> snmp_test_mgr:s([{[fName,0], "Martin"}, {[fAddress,0],"home"}, {[fStatus,0],4}]).
        +5> snmp_test_mgr:s([{[fName,0], "Martin"}, {[fAddress,0],"home"}, {[fStatus,0],4}]).
          %% createAndGo
         ok
         * Got PDU:
        -[fName,0] = "Martin"
        -[fAddress,0] = "home"
        -[fStatus,0] = 4
        -6> snmp_test_mgr:gn([[myName,0]]).
        +[fName,0] = "Martin"
        +[fAddress,0] = "home"
        +[fStatus,0] = 4
        +6> snmp_test_mgr:gn([[myName,0]]).
         ok
         * Got PDU:
        -[fName,0] = "Martin"
        -7> snmp_test_mgr:gn().
        +[fName,0] = "Martin"
        +7> snmp_test_mgr:gn().
         ok
         * Got PDU:
        -[fAddress,0] = "home"
        -8> snmp_test_mgr:gn().
        +[fAddress,0] = "home"
        +8> snmp_test_mgr:gn().
         ok
         * Got PDU:
        -[fStatus,0] = 1
        +[fStatus,0] = 1
         9>

        @@ -295,55 +295,55 @@ Code

        -
        -module(ex1).
        --author('dummy@flop.org').
        +
        -module(ex1).
        +-author('dummy@flop.org').
         %% External exports
        --export([start/0, my_name/1, my_name/2, friends_table/3]).
        +-export([start/0, my_name/1, my_name/2, friends_table/3]).
         %% Internal exports
        --export([init/0]).
        --define(status_col, 4).
        --define(active, 1).
        --define(notInService, 2).
        --define(notReady, 3).
        --define(createAndGo, 4).   % Action; written, not read
        --define(createAndWait, 5). % Action; written, not read
        --define(destroy, 6).       % Action; written, not read
        -start() ->
        -    spawn(ex1, init, []).
        +-export([init/0]).
        +-define(status_col, 4).
        +-define(active, 1).
        +-define(notInService, 2).
        +-define(notReady, 3).
        +-define(createAndGo, 4).   % Action; written, not read
        +-define(createAndWait, 5). % Action; written, not read
        +-define(destroy, 6).       % Action; written, not read
        +start() ->
        +    spawn(ex1, init, []).
         %%----------------------------------------------------------------
         %% Instrumentation function for variable myName.
         %% Returns: (get) {value, Name}
         %%          (set) noError
         %%----------------------------------------------------------------
        -my_name(get) ->
        -    ex1_server ! {self(), get_my_name},
        -    Name = wait_answer(),
        -    {value, Name}.
        -my_name(set, NewName) ->
        -    ex1_server ! {self(), {set_my_name, NewName}},
        +my_name(get) ->
        +    ex1_server ! {self(), get_my_name},
        +    Name = wait_answer(),
        +    {value, Name}.
        +my_name(set, NewName) ->
        +    ex1_server ! {self(), {set_my_name, NewName}},
             noError.
         %%----------------------------------------------------------------
         %% Instrumentation function for table friendsTable.
         %%----------------------------------------------------------------
        -friends_table(get, RowIndex, Cols) ->
        -    case get_row(RowIndex) of
        -   {ok, Row} ->
        -        get_cols(Cols, Row);
        +friends_table(get, RowIndex, Cols) ->
        +    case get_row(RowIndex) of
        +   {ok, Row} ->
        +        get_cols(Cols, Row);
            _  ->
        -        {noValue, noSuchInstance}
        +        {noValue, noSuchInstance}
             end;
        -friends_table(get_next, RowIndex, Cols) ->
        -    case get_next_row(RowIndex) of
        -   {ok, Row} ->
        -        get_next_cols(Cols, Row);
        +friends_table(get_next, RowIndex, Cols) ->
        +    case get_next_row(RowIndex) of
        +   {ok, Row} ->
        +        get_next_cols(Cols, Row);
            _  ->
        -       case get_next_row([]) of
        -     {ok, Row} ->
        +       case get_next_row([]) of
        +     {ok, Row} ->
                  % Get next cols from first row.
        -         NewCols = add_one_to_cols(Cols),
        -         get_next_cols(NewCols, Row);
        +         NewCols = add_one_to_cols(Cols),
        +         get_next_cols(NewCols, Row);
              _  ->
        -        end_of_table(Cols)
        +        end_of_table(Cols)
                 end
             end;
         %%----------------------------------------------------------------
        @@ -354,158 +354,158 @@
         %%    *) Otherwise, error (for simplicity).
         %% Otherwise, row is modified; check that row exists.
         %%----------------------------------------------------------------
        -friends_table(is_set_ok, RowIndex, Cols) ->
        +friends_table(is_set_ok, RowIndex, Cols) ->
             RowExists =
        -   case get_row(RowIndex) of
        -        {ok, _Row} -> true;
        +   case get_row(RowIndex) of
        +        {ok, _Row} -> true;
                _ -> false
            end,
        -    case is_row_status_col_changed(Cols) of
        -   {true, ?destroy} when RowExists == true ->
        -        {noError, 0};
        -   {true, ?createAndGo} when RowExists == false,
        -                                 length(Cols) == 3 ->
        -        {noError, 0};
        -   {true, _} ->
        -       {inconsistentValue, ?status_col};
        +    case is_row_status_col_changed(Cols) of
        +   {true, ?destroy} when RowExists == true ->
        +        {noError, 0};
        +   {true, ?createAndGo} when RowExists == false,
        +                                 length(Cols) == 3 ->
        +        {noError, 0};
        +   {true, _} ->
        +       {inconsistentValue, ?status_col};
            false when RowExists == true ->
        -        {noError, 0};
        +        {noError, 0};
        /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_impl_example_manager.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (517))
        --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_impl_example_manager.html	2026-06-04 19:05:15.991575997 +0000
        +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_impl_example_manager.html	2026-06-04 19:05:15.991575997 +0000
        @@ -193,7 +193,7 @@
                   Erlang programming language
         
               

        -

        Copyright © 1996-2026 Ericsson AB

        +

        Copyright © 1996-2042 Ericsson AB

        /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_index.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (807)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_index.html 2026-06-04 19:05:16.013576201 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_index.html 2026-06-04 19:05:16.014576211 +0000 @@ -135,13 +135,13 @@ actual implementation of the table. The SNMP ordering, that is implementation of GET NEXT, is implemented in this module.

        For example, suppose there is an SNMP table, which is best implemented in Erlang as one process per SNMP table row. Suppose further that the INDEX in the SNMP -table is an OCTET STRING. The index structure would be created as follows:

        snmp_index:new(string)

        For each new process we create, we insert an item in an snmp_index structure:

        new_process(Name, SnmpIndex) ->
        -  Pid = start_process(),
        +table is an OCTET STRING. The index structure would be created as follows:

        snmp_index:new(string)

        For each new process we create, we insert an item in an snmp_index structure:

        new_process(Name, SnmpIndex) ->
        +  Pid = start_process(),
           NewSnmpIndex =
        -    snmp_index:insert(SnmpIndex, Name, Pid),
        +    snmp_index:insert(SnmpIndex, Name, Pid),
           <...>

        With this structure, we can now map an OBJECT IDENTIFIER in e.g. a GET NEXT -request, to the correct process:

        get_next_pid(Oid, SnmpIndex) ->
        -  {ok, {_, Pid}} = snmp_index:get_next(SnmpIndex, Oid),
        +request, to the correct process:

        get_next_pid(Oid, SnmpIndex) ->
        +  {ok, {_, Pid}} = snmp_index:get_next(SnmpIndex, Oid),
           Pid.

        @@ -795,7 +795,7 @@ Erlang programming language

        -

        Copyright © 1996-2026 Ericsson AB

        +

        Copyright © 1996-2042 Ericsson AB

        /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_instr_functions.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1719)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_instr_functions.html 2026-06-04 19:05:16.033576387 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_instr_functions.html 2026-06-04 19:05:16.033576387 +0000 @@ -153,8 +153,8 @@ New / Delete Operations

        -

        For scalar variables:

        variable_access(new [, ExtraArg1, ...])
        -variable_access(delete [, ExtraArg1, ...])

        For tables:

        table_access(new [, ExtraArg1, ...])
        +

        For scalar variables:

        variable_access(new [, ExtraArg1, ...])
        +variable_access(delete [, ExtraArg1, ...])

        For tables:

        table_access(new [, ExtraArg1, ...])
         table_access(delete [, ExtraArg1, ...])

        These functions are called for each object in an MIB when the MIB is unloaded or loaded, respectively.

        @@ -214,9 +214,9 @@ value 1, and [3, 5] is the list of requested columns. The function should now return the lexicographically next elements:

        [{[3, 1, 2], d}, {[5, 1, 2], f}]

        This is illustrated in the following table:

        GetNext from [3,1,1] and [5,1,1].

        The manager now issues the following getNext request:

        getNext{ myTable.myTableEntry.3.2.1,
                  myTable.myTableEntry.5.2.1 }

        This is transformed into one call to my_table:

        my_table(get_next, [2, 1], [3, 5])

        The function should now return:

        [{[4, 1, 1], b}, endOfTable]

        This is illustrated in the following table:

        GetNext from [3,2,1] and [5,2,1].

        The manager now issues the following getNext request:

        getNext{ myTable.myTableEntry.3.1.2,
        -         myTable.myTableEntry.4.1.2 }

        This will be transform into one call to my_table:

        my_table(get_next, [1, 2], [3, 4])

        The function should now return:

        [{[3, 2, 1], g}, {[5, 1, 1], c}]

        This is illustrated in the following table:

        GetNext from [3,1,2] and [4,1,2].

        The manager now issues the following getNext request:

        getNext{ myTable.myTableEntry,
        -         myTable.myTableEntry.1.3.2 }

        This will be transform into two calls to my_table:

        my_table(get_next, [], [0]) and
        -my_table(get_next, [3, 2], [1])

        The function should now return:

        [{[3, 1, 1], a}] and
        +         myTable.myTableEntry.4.1.2 }

        This will be transform into one call to my_table:

        my_table(get_next, [1, 2], [3, 4])

        The function should now return:

        [{[3, 2, 1], g}, {[5, 1, 1], c}]

        This is illustrated in the following table:

        GetNext from [3,1,2] and [4,1,2].

        The manager now issues the following getNext request:

        getNext{ myTable.myTableEntry,
        +         myTable.myTableEntry.1.3.2 }

        This will be transform into two calls to my_table:

        my_table(get_next, [], [0]) and
        +my_table(get_next, [3, 2], [1])

        The function should now return:

        [{[3, 1, 1], a}] and
         [{[3, 1, 1], a}]

        In both cases, the first accessible element in the table should be returned. As the key columns are not accessible, this means that the third column is the first row.

        Note

        Normally, the functions described above behave exactly as shown, but they are @@ -233,17 +233,17 @@ variables for a device, ipAdr and name with object identifiers 1.1.23.4 and 1.1.7 respectively. To access these variables, one could implement the two Erlang functions ip_access and name_access, which will be in the MIB. The -functions could be specified in a text file as follows:

        {ipAdr, {my_module, ip_access, []}}.
        +functions could be specified in a text file as follows:

        {ipAdr, {my_module, ip_access, []}}.
         % Or using the oid syntax for 'name'
        -{[1,1,7], {my_module, name_access, []}}.

        The ExtraArgument parameter is the empty list. For example, when the agent +{[1,1,7], {my_module, name_access, []}}.

        The ExtraArgument parameter is the empty list. For example, when the agent receives a get-request for the ipAdr variable, a call will be made to ip_access(get). The value returned by this function is the answer to the get-request.

        If ip_access and name_access are implemented similarly, we could write a -generic_access function using the ListOfExtraArguments:

        {ipAdr, {my_module, generic_access, ['IPADR']}}.
        +generic_access function using the ListOfExtraArguments:

        {ipAdr, {my_module, generic_access, ['IPADR']}}.
         % The mnemonic 'name' is more convenient than 1.1.7
        -{name, {my_module, generic_access, ['NAME']}}.

        When the agent receives the same get-request as above, a call will be made to -generic_access(get,'IPADR').

        Yet another possibility, closer to the hardware, could be:

        {ipAdr, {my_module, generic_access, [16#2543]}}.
        -{name, {my_module, generic_access, [16#A2B3]}}.

        +{name, {my_module, generic_access, ['NAME']}}.

        When the agent receives the same get-request as above, a call will be made to +generic_access(get,'IPADR').

        Yet another possibility, closer to the hardware, could be:

        {ipAdr, {my_module, generic_access, [16#2543]}}.
        +{name, {my_module, generic_access, [16#A2B3]}}.

        @@ -349,7 +349,7 @@ Erlang programming language

        -

        Copyright © 1996-2026 Ericsson AB

        +

        Copyright © 1996-2042 Ericsson AB

        /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_intro.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (563)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_intro.html 2026-06-04 19:05:16.050576544 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_intro.html 2026-06-04 19:05:16.050576544 +0000 @@ -257,7 +257,7 @@ Erlang programming language

        -

        Copyright © 1996-2026 Ericsson AB

        +

        Copyright © 1996-2042 Ericsson AB

        /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_manager_config_files.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1067)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_manager_config_files.html 2026-06-04 19:05:16.068576712 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_manager_config_files.html 2026-06-04 19:05:16.068576712 +0000 @@ -149,10 +149,10 @@ every transport.

      • engine_id - The SnmpEngineID as defined in SNMP-FRAMEWORK-MIB. Mandatory.

      • max_message_size - The snmpEngineMaxMessageSize as defined in SNMP-FRAMEWORK-MIB. Mandatory.

    • Value is the value for the variable.

    The legacy and intermediate variables address and domain are still supported -so old configurations will work.

    The following example shows a manager.conf file:

    {transports,       [{transportDomainUdpIpv4, {{141,213,11,24}, 5000}},
    -                    {transportDomainUdpIpv6, {{0,0,0,0,0,0,0,1}, 5000}}]}.
    -{engine_id,        "mgrEngine"}.
    -{max_message_size, 484}.

    The value of engine_id is a string, which should have a very specific +so old configurations will work.

    The following example shows a manager.conf file:

    {transports,       [{transportDomainUdpIpv4, {{141,213,11,24}, 5000}},
    +                    {transportDomainUdpIpv6, {{0,0,0,0,0,0,0,1}, 5000}}]}.
    +{engine_id,        "mgrEngine"}.
    +{max_message_size, 484}.

    The value of engine_id is a string, which should have a very specific structure. See RFC 2271/2571 for details.

    @@ -247,7 +247,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_manager_funct_descr.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (356)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_manager_funct_descr.html 2026-06-04 19:05:16.085576869 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_manager_funct_descr.html 2026-06-04 19:05:16.085576869 +0000 @@ -213,7 +213,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_manager_netif.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (440)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_manager_netif.html 2026-06-04 19:05:16.102577027 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_manager_netif.html 2026-06-04 19:05:16.102577027 +0000 @@ -255,7 +255,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_mib_compiler.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (774)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_mib_compiler.html 2026-06-04 19:05:16.117577166 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_mib_compiler.html 2026-06-04 19:05:16.117577166 +0000 @@ -141,7 +141,7 @@ association file, it gives a warning message and uses default instrumentation functions. (See Default Instrumentation for more details).

    The MIB compiler is started with a call to snmpc:compile(<mibname>). For -example:

    snmpc:compile("RFC1213-MIB").

    The output is a new file which is called <mibname>.bin.

    The MIB compiler understands both SMIv1 and SMIv2 MIBs. It uses the +example:

    snmpc:compile("RFC1213-MIB").

    The output is a new file which is called <mibname>.bin.

    The MIB compiler understands both SMIv1 and SMIv2 MIBs. It uses the MODULE-IDENTITY statement to determinate if the MIB is written in SMI version 1 or 2.

    @@ -153,10 +153,10 @@ compiled file and not the ASN.1 (source) file. A MIB must be recompiled to make changes visible to other MIBs importing it.

    The compiled files of the imported MIBs must be present in the current directory, or a directory in the current path. The path is supplied with the -{i, Path} option, for example:

    snmpc:compile("MY-MIB",
    -       [{i, ["friend_mibs/", "../standard_mibs/"]}]).

    It is also possible to import MIBs from OTP applications in an "include_lib" -like fashion with the il option. Example:

    snmpc:compile("MY-MIB",
    -       [{il, ["snmp/priv/mibs/", "myapp/priv/mibs/"]}]).

    finds the latest version of the snmp and myapp applications in the OTP +{i, Path} option, for example:

    snmpc:compile("MY-MIB",
    +       [{i, ["friend_mibs/", "../standard_mibs/"]}]).

    It is also possible to import MIBs from OTP applications in an "include_lib" +like fashion with the il option. Example:

    snmpc:compile("MY-MIB",
    +       [{il, ["snmp/priv/mibs/", "myapp/priv/mibs/"]}]).

    finds the latest version of the snmp and myapp applications in the OTP system and uses the expanded paths as include paths.

    Note that an SMIv2 MIB can import an SMIv1 MIB and vice versa.

    The following MIBs are built-ins of the Erlang SNMP compiler: SNMPv2-SMI, RFC-1215, RFC-1212, SNMPv2-TC, SNMPv2-CONF, and RFC1155-SMI. They cannot therefore be compiled separately.

    @@ -266,7 +266,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_notification_mib.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_notification_mib.html 2026-06-04 19:05:16.135577333 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_notification_mib.html 2026-06-04 19:05:16.135577333 +0000 @@ -486,7 +486,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_pdus.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (395)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_pdus.html 2026-06-04 19:05:16.159577556 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_pdus.html 2026-06-04 19:05:16.159577556 +0000 @@ -134,8 +134,8 @@ Erlang record representations and vice versa. The record definitions can be found in the file snmp/include/snmp_types.hrl. If snmpv3 is used, the module that includes snmp_types.hrl must define the constant SNMP_USE_V3 before the -header file is included. Example:

    -define(SNMP_USE_V3, true).
    --include_lib("snmp/include/snmp_types.hrl").

    Encoding and decoding must be done explicitly when writing your own Net if +header file is included. Example:

    -define(SNMP_USE_V3, true).
    +-include_lib("snmp/include/snmp_types.hrl").

    Encoding and decoding must be done explicitly when writing your own Net if process.

    @@ -1053,7 +1053,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_standard_mib.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (315)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_standard_mib.html 2026-06-04 19:05:16.177577723 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_standard_mib.html 2026-06-04 19:05:16.177577723 +0000 @@ -426,7 +426,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_target_mib.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_target_mib.html 2026-06-04 19:05:16.200577936 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_target_mib.html 2026-06-04 19:05:16.200577936 +0000 @@ -818,7 +818,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_user_based_sm_mib.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_user_based_sm_mib.html 2026-06-04 19:05:16.220578122 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_user_based_sm_mib.html 2026-06-04 19:05:16.220578122 +0000 @@ -769,7 +769,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_view_based_acm_mib.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (302)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_view_based_acm_mib.html 2026-06-04 19:05:16.245578353 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmp_view_based_acm_mib.html 2026-06-04 19:05:16.245578353 +0000 @@ -1094,7 +1094,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (349)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa.html 2026-06-04 19:05:16.304578901 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa.html 2026-06-04 19:05:16.304578901 +0000 @@ -3336,8 +3336,8 @@

    Load a single Mib into an agent. The MibName is the name of the Mib, -including the path to where the compiled mib is found. For example:

              Dir = code:priv_dir(my_app) ++ "/mibs/",
    -          snmpa:load_mib(snmp_master_agent, Dir ++ "MY-MIB").
    +including the path to where the compiled mib is found. For example:

              Dir = code:priv_dir(my_app) ++ "/mibs/",
    +          snmpa:load_mib(snmp_master_agent, Dir ++ "MY-MIB").
    @@ -3453,8 +3453,8 @@

    Load Mibs into an agent. If the agent cannot load all MIBs (the default value of the Force argument is false), it will indicate where loading was aborted. The MibName is the name of the Mib, including the path to where the compiled -mib is found. For example,

              Dir = code:priv_dir(my_app) ++ "/mibs/",
    -          snmpa:load_mibs(snmp_master_agent, [Dir ++ "MY-MIB"]).

    If Force = true then the agent will continue attempting to load each mib even +mib is found. For example,

              Dir = code:priv_dir(my_app) ++ "/mibs/",
    +          snmpa:load_mibs(snmp_master_agent, [Dir ++ "MY-MIB"]).

    If Force = true then the agent will continue attempting to load each mib even after failing to load a previous mib. Use with care.

    @@ -4565,8 +4565,8 @@

    Registers a sub-agent under a sub-tree of another agent.

    It is easy to make mistakes when registering sub-agents and this activity should be done carefully. For example, a strange behaviour would result from the -following configuration:

    snmp_agent:register_subagent(MAPid,[1,2,3,4],SA1),
    -snmp_agent:register_subagent(SA1,[1,2,3], SA2).

    SA2 will not get requests starting with object identifier [1,2,3] since +following configuration:

    snmp_agent:register_subagent(MAPid,[1,2,3,4],SA1),
    +snmp_agent:register_subagent(SA1,[1,2,3], SA2).

    SA2 will not get requests starting with object identifier [1,2,3] since SA1 does not.

    @@ -5011,20 +5011,20 @@ Addresses and if there are no targets for which an Inform-Request is sent, Addresses is the empty list [].

    The receiver will first be sent the snmp_targets message, and then for each address in Addresses list, one of the two snmp_notification messages.

  • {Mod, Func, Args} - The info will be delivered via the function call:

    Mod:Func([Msg | Args])

    where Msg has the same content and purpose as the messages descrived above.

  • Address is a management target address and Addresses is a list of management -target addresses. They are defined as followes:

            Addresses  = [address()]
    -        Address    = address()
    -        address()  = v1_address() | v3_address()
    -        v1_address() = {TDomain, TAddress}
    -        v3_address() = {{TDomain, TAddress}, V3MsgData}
    -        TDomain    = tdoamin()
    -        TAddress   = taddress()
    -        tdomain()  = The oid of snmpUDPDomain
    +target addresses. They are defined as followes:

            Addresses  = [address()]
    +        Address    = address()
    +        address()  = v1_address() | v3_address()
    +        v1_address() = {TDomain, TAddress}
    +        v3_address() = {{TDomain, TAddress}, V3MsgData}
    +        TDomain    = tdoamin()
    +        TAddress   = taddress()
    +        tdomain()  = The oid of snmpUDPDomain
                          This is the only supported transport domain.
    -        taddress() = [A1, A2, A3, A4, P1, P3]
    +        taddress() = [A1, A2, A3, A4, P1, P3]
                          The 4 first bytes makes up the IP-address and the last 2,
                          the UDP-port number.
    -        V3MsgData  = v3_msg_data()
    -        v3_msg_data() = term()

    If Receiver is a notification_delivery_info/0 record, then the information + V3MsgData = v3_msg_data() + v3_msg_data() = term()

    If Receiver is a notification_delivery_info/0 record, then the information about the notification delivery will be delivered to the receiver via the callback functions defined by the snmpa_notification_delivery_info_receiver behaviour according to the content of the notification_delivery_info/0 @@ -6066,7 +6066,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_conf.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (426)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_conf.html 2026-06-04 19:05:16.347579300 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_conf.html 2026-06-04 19:05:16.348579309 +0000 @@ -3807,7 +3807,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_discovery_handler.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (388)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_discovery_handler.html 2026-06-04 19:05:16.369579504 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_discovery_handler.html 2026-06-04 19:05:16.367579485 +0000 @@ -244,7 +244,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_error.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (331)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_error.html 2026-06-04 19:05:16.385579652 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_error.html 2026-06-04 19:05:16.386579661 +0000 @@ -269,7 +269,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_error_io.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (331)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_error_io.html 2026-06-04 19:05:16.403579819 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_error_io.html 2026-06-04 19:05:16.403579819 +0000 @@ -269,7 +269,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_error_logger.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (331)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_error_logger.html 2026-06-04 19:05:16.419579968 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_error_logger.html 2026-06-04 19:05:16.420579977 +0000 @@ -276,7 +276,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_error_report.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (337)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_error_report.html 2026-06-04 19:05:16.436580125 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_error_report.html 2026-06-04 19:05:16.436580125 +0000 @@ -265,7 +265,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_local_db.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (352)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_local_db.html 2026-06-04 19:05:16.455580302 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_local_db.html 2026-06-04 19:05:16.456580311 +0000 @@ -739,7 +739,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_mib_data.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1005)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_mib_data.html 2026-06-04 19:05:16.478580515 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_mib_data.html 2026-06-04 19:05:16.478580515 +0000 @@ -1142,7 +1142,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_mib_storage.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (847)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_mib_storage.html 2026-06-04 19:05:16.498580700 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_mib_storage.html 2026-06-04 19:05:16.499580710 +0000 @@ -847,7 +847,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_mpd.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_mpd.html 2026-06-04 19:05:16.521580914 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_mpd.html 2026-06-04 19:05:16.521580914 +0000 @@ -1017,7 +1017,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_network_interface.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (523)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_network_interface.html 2026-06-04 19:05:16.542581108 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_network_interface.html 2026-06-04 19:05:16.541581099 +0000 @@ -492,7 +492,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_network_interface_filter.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (382)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_network_interface_filter.html 2026-06-04 19:05:16.561581285 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_network_interface_filter.html 2026-06-04 19:05:16.561581285 +0000 @@ -504,7 +504,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_notification_delivery_info_receiver.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (403)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_notification_delivery_info_receiver.html 2026-06-04 19:05:16.578581442 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_notification_delivery_info_receiver.html 2026-06-04 19:05:16.579581452 +0000 @@ -424,7 +424,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_notification_filter.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_notification_filter.html 2026-06-04 19:05:16.596581609 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_notification_filter.html 2026-06-04 19:05:16.596581609 +0000 @@ -329,7 +329,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_supervisor.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (309)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_supervisor.html 2026-06-04 19:05:16.613581767 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpa_supervisor.html 2026-06-04 19:05:16.614581776 +0000 @@ -372,7 +372,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpc.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (382)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpc.html 2026-06-04 19:05:16.636581981 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpc.html 2026-06-04 19:05:16.636581981 +0000 @@ -411,7 +411,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpc_cmd.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (985)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpc_cmd.html 2026-06-04 19:05:16.654582147 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpc_cmd.html 2026-06-04 19:05:16.655582157 +0000 @@ -131,7 +131,7 @@ Synopsis

    -
    snmpc [options] file.mib | file.bin

    +
    snmpc [options] file.mib | file.bin

    @@ -215,7 +215,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpm.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1936)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpm.html 2026-06-04 19:05:16.699582565 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpm.html 2026-06-04 19:05:16.700582574 +0000 @@ -2008,8 +2008,8 @@

    Load a Mib into the manager. The MibName is the name of the Mib, including -the path to where the compiled mib is found. For example,

              Dir = code:priv_dir(my_app) ++ "/mibs/",
    -          snmpm:load_mib(Dir ++ "MY-MIB").
    +the path to where the compiled mib is found. For example,

              Dir = code:priv_dir(my_app) ++ "/mibs/",
    +          snmpm:load_mib(Dir ++ "MY-MIB").
    @@ -3588,8 +3588,8 @@

    Unload a Mib from the manager. The MibName is the name of the Mib, including -the path to where the compiled mib is found. For example,

              Dir = code:priv_dir(my_app) ++ "/mibs/",
    -          snmpm:unload_mib(Dir ++ "MY-MIB").
    +the path to where the compiled mib is found. For example,

              Dir = code:priv_dir(my_app) ++ "/mibs/",
    +          snmpm:unload_mib(Dir ++ "MY-MIB").
    @@ -4057,7 +4057,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpm_conf.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpm_conf.html 2026-06-04 19:05:16.727582824 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpm_conf.html 2026-06-04 19:05:16.727582824 +0000 @@ -1368,7 +1368,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpm_mpd.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (518)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpm_mpd.html 2026-06-04 19:05:16.746583001 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpm_mpd.html 2026-06-04 19:05:16.746583001 +0000 @@ -647,7 +647,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpm_network_interface.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (982)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpm_network_interface.html 2026-06-04 19:05:16.766583186 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpm_network_interface.html 2026-06-04 19:05:16.766583186 +0000 @@ -574,7 +574,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpm_network_interface_filter.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (490)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpm_network_interface_filter.html 2026-06-04 19:05:16.784583353 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpm_network_interface_filter.html 2026-06-04 19:05:16.784583353 +0000 @@ -496,7 +496,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpm_user.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (794)) --- old//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpm_user.html 2026-06-04 19:05:16.803583529 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/snmp-5.17/doc/html/snmpm_user.html 2026-06-04 19:05:16.804583539 +0000 @@ -719,7 +719,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/404.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/404.html 2026-06-04 19:05:16.820832371 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/404.html 2026-06-04 19:05:16.821285975 +0000 @@ -147,7 +147,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/api-reference.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/api-reference.html 2026-06-04 19:05:16.836583836 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/api-reference.html 2026-06-04 19:05:16.836583836 +0000 @@ -277,7 +277,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/configurations.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1406)) --- old//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/configurations.html 2026-06-04 19:05:16.857584031 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/configurations.html 2026-06-04 19:05:16.857584031 +0000 @@ -142,23 +142,23 @@ Options configuration

    There are from OTP-23.0 two main ways to set an option:

    • Like before, in the Options parameter in the Erlang code in a call to for -example ssh:daemon/3 or ssh:connect/3 or any of their variants. Example:

      ssh:connect(22, [{user,"foo"}])
    • In OTP Configuration Parameters:

      • In the erl command line:

        erl -ssh user \"foo\"
      • In the ssh.app file, in the env part

        {application, ssh,
        - [{description, "SSH-2 for Erlang/OTP"},
        -  {vsn, "4.9"},
        -  {modules, [ssh,
        +example ssh:daemon/3 or ssh:connect/3 or any of their variants. Example:

        ssh:connect(22, [{user,"foo"}])
      • In OTP Configuration Parameters:

        • In the erl command line:

          erl -ssh user \"foo\"
        • In the ssh.app file, in the env part

          {application, ssh,
          + [{description, "SSH-2 for Erlang/OTP"},
          +  {vsn, "4.9"},
          +  {modules, [ssh,
                   ...
          -         ssh_xfer]},
          -  {registered, []},
          -  {applications, [kernel, stdlib, crypto, public_key]},
          -  {env, [{user, "bar"]}, % <<<<<<<<<<<<<<<<<<<<<<<<<<<<<< HERE
          -  {mod, {ssh_app, []}},
          -       ...
        • In a .config file:

          erl -config ex1

          where ex1.config contains:

          [
          -{ssh, [{user, "foo"}]}
          -].

        If the option is intended only for a server or for a client, it may be set in -this way:

        [
        -{ssh, [{server_options,[{user, "foo"}]},
        -       {client_options,[{user, "bar"}]}
        -].

        A server (daemon) will use the user name foo, and a client will use the name + ssh_xfer]}, + {registered, []}, + {applications, [kernel, stdlib, crypto, public_key]}, + {env, [{user, "bar"]}, % <<<<<<<<<<<<<<<<<<<<<<<<<<<<<< HERE + {mod, {ssh_app, []}}, + ...

  • In a .config file:

    erl -config ex1

    where ex1.config contains:

    [
    +{ssh, [{user, "foo"}]}
    +].
  • If the option is intended only for a server or for a client, it may be set in +this way:

    [
    +{ssh, [{server_options,[{user, "foo"}]},
    +       {client_options,[{user, "bar"}]}
    +].

    A server (daemon) will use the user name foo, and a client will use the name bar.

    @@ -229,17 +229,17 @@ 'hmac-sha1']}]}, {compression,[{client2server,[none,'zlib@openssh.com']}, {server2client,[none,'zlib@openssh.com']}]}]

    Note that the algorithms in the file ex2.config is not yet applied. They will -be when we start ssh:

    2> ssh:start().
    +be when we start ssh:

    2> ssh:start().
     ok
    -3> ssh:default_algorithms().
    -[{kex,['ecdh-sha2-nistp384']},
    - {public_key,['ssh-rsa']},
    - {cipher,[{client2server,['aes192-ctr']},
    -          {server2client,['aes192-ctr']}]},
    - {mac,[{client2server,['hmac-sha1']},
    -       {server2client,['hmac-sha1']}]},
    - {compression,[{client2server,[none,'zlib@openssh.com']},
    -               {server2client,[none,'zlib@openssh.com']}]}]
    +3> ssh:default_algorithms().
    +[{kex,['ecdh-sha2-nistp384']},
    + {public_key,['ssh-rsa']},
    + {cipher,[{client2server,['aes192-ctr']},
    +          {server2client,['aes192-ctr']}]},
    + {mac,[{client2server,['hmac-sha1']},
    +       {server2client,['hmac-sha1']}]},
    + {compression,[{client2server,[none,'zlib@openssh.com']},
    +               {server2client,[none,'zlib@openssh.com']}]}]
     4>

    We see that the algorithm set is changed to the one in the ex2.config. Since compression is not specified in the file, the hard-coded default is still used for that entry.

    Establishing a connection (ssh:connect et al) or starting a daemon (ssh:daemon)

    Both when the client establishes a connection with ssh:connect or other @@ -252,65 +252,65 @@ modify_algorithms on all levels in order starting with level 0 are applied.

    We continue the example above by connecting to a server and modifying the kex algorithm set. We remove the only one ('ecdh-sha2-nistp384') and add -'curve25519-sha256@libssh.org' by appending it to the now empty list:

    4> {ok,C} = ssh:connect(loopback, 22,
    -                        [{modify_algorithms,
    -                                 [{rm,
    -                                     [ {kex,['ecdh-sha2-nistp384']} ]
    -				  },
    -                                  {append,
    -			             [ {kex,['curve25519-sha256@libssh.org']} ]
    -				  }
    -				 ]
    -	                 }
    -                        ]).
    -{ok,>0.118.0>}

    We check which algorithms are negotiated by the client and the server, and note -that the (only) kex algorithm 'curve25519-sha256@libssh.org' was selected:

    5> ssh:connection_info(C, algorithms).
    -{algorithms,[{kex,'curve25519-sha256@libssh.org'},
    -             {hkey,'ssh-rsa'},
    -             {send_mac,'hmac-sha1'},
    -             {recv_mac,'hmac-sha1'},
    -             {encrypt,'aes192-ctr'},
    -             {decrypt,'aes192-ctr'},
    -             {compress,none},
    -             {decompress,none},
    -             {send_ext_info,false},
    -             {recv_ext_info,true}]}

    Example of modify_algorithms handling

    We will now check if the +'curve25519-sha256@libssh.org' by appending it to the now empty list:

    4> {ok,C} = ssh:connect(loopback, 22,
    +                        [{modify_algorithms,
    +                                 [{rm,
    +                                     [ {kex,['ecdh-sha2-nistp384']} ]
    +				  },
    +                                  {append,
    +			             [ {kex,['curve25519-sha256@libssh.org']} ]
    +				  }
    +				 ]
    +	                 }
    +                        ]).
    +{ok,>0.118.0>}

    We check which algorithms are negotiated by the client and the server, and note +that the (only) kex algorithm 'curve25519-sha256@libssh.org' was selected:

    5> ssh:connection_info(C, algorithms).
    +{algorithms,[{kex,'curve25519-sha256@libssh.org'},
    +             {hkey,'ssh-rsa'},
    +             {send_mac,'hmac-sha1'},
    +             {recv_mac,'hmac-sha1'},
    +             {encrypt,'aes192-ctr'},
    +             {decrypt,'aes192-ctr'},
    +             {compress,none},
    +             {decompress,none},
    +             {send_ext_info,false},
    +             {recv_ext_info,true}]}

    Example of modify_algorithms handling

    We will now check if the modify_algorithms on a lower level is applied to a preferred_algorithms on a higher level. We will do that by enabling the ssh-dss algorithm that is supported, -but not in the default set.

    The config file ex3.config has the contents:

    [
    - {ssh, [{modify_algorithms,
    -         [ {prepend, [{public_key, ['ssh-dss']}]} ]
    -        }]}
    -].

    A newly started erlang shell shows that no 'ssh-dss' is present in the -public_key entry:

    1> proplists:get_value(public_key, ssh:default_algorithms()).
    -['ecdsa-sha2-nistp384','ecdsa-sha2-nistp521',
    +but not in the default set.

    The config file ex3.config has the contents:

    [
    + {ssh, [{modify_algorithms,
    +         [ {prepend, [{public_key, ['ssh-dss']}]} ]
    +        }]}
    +].

    A newly started erlang shell shows that no 'ssh-dss' is present in the +public_key entry:

    1> proplists:get_value(public_key, ssh:default_algorithms()).
    +['ecdsa-sha2-nistp384','ecdsa-sha2-nistp521',
      'ecdsa-sha2-nistp256','ssh-ed25519','ssh-ed448',
    - 'rsa-sha2-256','rsa-sha2-512','ssh-rsa']
    -2>

    A call to ssh:connect/3 removes all algorithms but one of each type:

    2> ssh:start().
    + 'rsa-sha2-256','rsa-sha2-512','ssh-rsa']
    +2>

    A call to ssh:connect/3 removes all algorithms but one of each type:

    2> ssh:start().
     ok
    -3> {ok,C} = ssh:connect(loopback, 22,
    -                        [{preferred_algorithms,
    -                         [{public_key, ['ecdsa-sha2-nistp256']},
    -			  {kex, ['ecdh-sha2-nistp256']},
    -		          {cipher, ['chacha20-poly1305@openssh.com']},
    -			  {mac, ['hmac-sha2-256']},
    -			  {compression, [none]}
    -			  ]}
    -			 ]).
    -{ok,<0.101.0>}
    -4> ssh:connection_info(C,algorithms).
    -{algorithms,[{kex,'ecdh-sha2-nistp256'},
    -             {hkey,'ssh-dss'},
    -             {send_mac,'chacha20-poly1305@openssh.com'},
    -             {recv_mac,'chacha20-poly1305@openssh.com'},
    -             {encrypt,'chacha20-poly1305@openssh.com'},
    -             {decrypt,'chacha20-poly1305@openssh.com'},
    -             {compress,none},
    -             {decompress,none},
    -             {send_ext_info,false},
    -             {recv_ext_info,true}]}
    +3> {ok,C} = ssh:connect(loopback, 22,
    +                        [{preferred_algorithms,
    +                         [{public_key, ['ecdsa-sha2-nistp256']},
    +			  {kex, ['ecdh-sha2-nistp256']},
    +		          {cipher, ['chacha20-poly1305@openssh.com']},
    +			  {mac, ['hmac-sha2-256']},
    +			  {compression, [none]}
    +			  ]}
    +			 ]).
    +{ok,<0.101.0>}
    +4> ssh:connection_info(C,algorithms).
    +{algorithms,[{kex,'ecdh-sha2-nistp256'},
    +             {hkey,'ssh-dss'},
    +             {send_mac,'chacha20-poly1305@openssh.com'},
    +             {recv_mac,'chacha20-poly1305@openssh.com'},
    +             {encrypt,'chacha20-poly1305@openssh.com'},
    +             {decrypt,'chacha20-poly1305@openssh.com'},
    +             {compress,none},
    +             {decompress,none},
    +             {send_ext_info,false},
    +             {recv_ext_info,true}]}
     5>

    But 'ssh-dss' is selected although the call inserted only 'ecdsa-sha2-nistp256' as acceptable.

    This example showed that we could augment the set of algorithms with a config-file without the need to change the actual call.

    For demonstration purposes we used prepend instead of append. This forces @@ -367,7 +367,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/configure_algos.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (722)) --- old//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/configure_algos.html 2026-06-04 19:05:16.884584281 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/configure_algos.html 2026-06-04 19:05:16.883584272 +0000 @@ -172,29 +172,29 @@ supported by the:

    • crypto app,
    • The cryptolib OTP is linked with, usually the one the OS uses, probably OpenSSL,
    • and finally what the SSH app implements

    Due to this, it impossible to list in documentation what algorithms that are available in a certain installation.

    There is an important command to list the actual algorithms and their ordering: -ssh:default_algorithms/0.

    0> ssh:default_algorithms().
    -[{kex,['ecdh-sha2-nistp384','ecdh-sha2-nistp521',
    +ssh:default_algorithms/0.

    0> ssh:default_algorithms().
    +[{kex,['ecdh-sha2-nistp384','ecdh-sha2-nistp521',
            'ecdh-sha2-nistp256','diffie-hellman-group-exchange-sha256',
            'diffie-hellman-group16-sha512',
            'diffie-hellman-group18-sha512',
            'diffie-hellman-group14-sha256',
            'diffie-hellman-group14-sha1',
    -       'diffie-hellman-group-exchange-sha1']},
    - {public_key,['ecdsa-sha2-nistp384','ecdsa-sha2-nistp521',
    +       'diffie-hellman-group-exchange-sha1']},
    + {public_key,['ecdsa-sha2-nistp384','ecdsa-sha2-nistp521',
                   'ecdsa-sha2-nistp256','ssh-rsa','rsa-sha2-256',
    -              'rsa-sha2-512','ssh-dss']},
    - {cipher,[{client2server,['aes256-gcm@openssh.com',
    +              'rsa-sha2-512','ssh-dss']},
    + {cipher,[{client2server,['aes256-gcm@openssh.com',
                               'aes256-ctr','aes192-ctr','aes128-gcm@openssh.com',
    -                          'aes128-ctr','aes128-cbc','3des-cbc']},
    -          {server2client,['aes256-gcm@openssh.com','aes256-ctr',
    +                          'aes128-ctr','aes128-cbc','3des-cbc']},
    +          {server2client,['aes256-gcm@openssh.com','aes256-ctr',
                               'aes192-ctr','aes128-gcm@openssh.com','aes128-ctr',
    -                          'aes128-cbc','3des-cbc']}]},
    - {mac,[{client2server,['hmac-sha2-256','hmac-sha2-512',
    -                       'hmac-sha1']},
    -       {server2client,['hmac-sha2-256','hmac-sha2-512',
    -                       'hmac-sha1']}]},
    - {compression,[{client2server,[none,'zlib@openssh.com']},
    -               {server2client,[none,'zlib@openssh.com']}]}]

    To change the algorithm list, there are two options which can be used in + 'aes128-cbc','3des-cbc']}]}, + {mac,[{client2server,['hmac-sha2-256','hmac-sha2-512', + 'hmac-sha1']}, + {server2client,['hmac-sha2-256','hmac-sha2-512', + 'hmac-sha1']}]}, + {compression,[{client2server,[none,'zlib@openssh.com']}, + {server2client,[none,'zlib@openssh.com']}]}]

    To change the algorithm list, there are two options which can be used in ssh:connect/2,3,4 and ssh:daemon/2,3. The options could of course be used in all other functions that initiates connections.

    The options are @@ -217,28 +217,28 @@ Example 1

    Replace the kex algorithms list with the single algorithm -'diffie-hellman-group14-sha256':

    1> ssh:chk_algos_opts(
    -               [{preferred_algorithms,
    -                     [{kex, ['diffie-hellman-group14-sha256']}
    -                     ]
    -                }
    -              ]).
    -[{kex,['diffie-hellman-group14-sha256']},
    - {public_key,['ecdsa-sha2-nistp384','ecdsa-sha2-nistp521',
    +'diffie-hellman-group14-sha256':

    1> ssh:chk_algos_opts(
    +               [{preferred_algorithms,
    +                     [{kex, ['diffie-hellman-group14-sha256']}
    +                     ]
    +                }
    +              ]).
    +[{kex,['diffie-hellman-group14-sha256']},
    + {public_key,['ecdsa-sha2-nistp384','ecdsa-sha2-nistp521',
                   'ecdsa-sha2-nistp256','ssh-rsa','rsa-sha2-256',
    -              'rsa-sha2-512','ssh-dss']},
    - {cipher,[{client2server,['aes256-gcm@openssh.com',
    +              'rsa-sha2-512','ssh-dss']},
    + {cipher,[{client2server,['aes256-gcm@openssh.com',
                               'aes256-ctr','aes192-ctr','aes128-gcm@openssh.com',
    -                          'aes128-ctr','aes128-cbc','3des-cbc']},
    -          {server2client,['aes256-gcm@openssh.com','aes256-ctr',
    +                          'aes128-ctr','aes128-cbc','3des-cbc']},
    +          {server2client,['aes256-gcm@openssh.com','aes256-ctr',
                               'aes192-ctr','aes128-gcm@openssh.com','aes128-ctr',
    -                          'aes128-cbc','3des-cbc']}]},
    - {mac,[{client2server,['hmac-sha2-256','hmac-sha2-512',
    -                       'hmac-sha1']},
    -       {server2client,['hmac-sha2-256','hmac-sha2-512',
    -                       'hmac-sha1']}]},
    - {compression,[{client2server,[none,'zlib@openssh.com']},
    -               {server2client,[none,'zlib@openssh.com']}]}]

    Note that the unmentioned lists (public_key, cipher, mac and + 'aes128-cbc','3des-cbc']}]}, + {mac,[{client2server,['hmac-sha2-256','hmac-sha2-512', + 'hmac-sha1']}, + {server2client,['hmac-sha2-256','hmac-sha2-512', + 'hmac-sha1']}]}, + {compression,[{client2server,[none,'zlib@openssh.com']}, + {server2client,[none,'zlib@openssh.com']}]}]

    Note that the unmentioned lists (public_key, cipher, mac and compression) are unchanged.

    @@ -246,30 +246,30 @@ Example 2

    In the lists that are divided in two for the two directions (for example cipher) it is -possible to change both directions at once:

    2> ssh:chk_algos_opts(
    -               [{preferred_algorithms,
    -                     [{cipher,['aes128-ctr']}
    -                     ]
    -                }
    -              ]).
    -[{kex,['ecdh-sha2-nistp384','ecdh-sha2-nistp521',
    +possible to change both directions at once:

    2> ssh:chk_algos_opts(
    +               [{preferred_algorithms,
    +                     [{cipher,['aes128-ctr']}
    +                     ]
    +                }
    +              ]).
    +[{kex,['ecdh-sha2-nistp384','ecdh-sha2-nistp521',
            'ecdh-sha2-nistp256','diffie-hellman-group-exchange-sha256',
            'diffie-hellman-group16-sha512',
            'diffie-hellman-group18-sha512',
            'diffie-hellman-group14-sha256',
            'diffie-hellman-group14-sha1',
    -       'diffie-hellman-group-exchange-sha1']},
    - {public_key,['ecdsa-sha2-nistp384','ecdsa-sha2-nistp521',
    +       'diffie-hellman-group-exchange-sha1']},
    + {public_key,['ecdsa-sha2-nistp384','ecdsa-sha2-nistp521',
                   'ecdsa-sha2-nistp256','ssh-rsa','rsa-sha2-256',
    -              'rsa-sha2-512','ssh-dss']},
    - {cipher,[{client2server,['aes128-ctr']},
    -          {server2client,['aes128-ctr']}]},
    - {mac,[{client2server,['hmac-sha2-256','hmac-sha2-512',
    -                       'hmac-sha1']},
    -       {server2client,['hmac-sha2-256','hmac-sha2-512',
    -                       'hmac-sha1']}]},
    - {compression,[{client2server,[none,'zlib@openssh.com']},
    -               {server2client,[none,'zlib@openssh.com']}]}]

    Note that both lists in cipher has been changed to the provided value + 'rsa-sha2-512','ssh-dss']}, + {cipher,[{client2server,['aes128-ctr']}, + {server2client,['aes128-ctr']}]}, + {mac,[{client2server,['hmac-sha2-256','hmac-sha2-512', + 'hmac-sha1']}, + {server2client,['hmac-sha2-256','hmac-sha2-512', + 'hmac-sha1']}]}, + {compression,[{client2server,[none,'zlib@openssh.com']}, + {server2client,[none,'zlib@openssh.com']}]}]

    Note that both lists in cipher has been changed to the provided value ('aes128-ctr').

    @@ -277,56 +277,56 @@ Example 3

    In the lists that are divided in two for the two directions (for example cipher) it is -possible to change only one of the directions:

    3> ssh:chk_algos_opts(
    -               [{preferred_algorithms,
    -                     [{cipher,[{client2server,['aes128-ctr']}]}
    -                     ]
    -                }
    -              ]).
    -[{kex,['ecdh-sha2-nistp384','ecdh-sha2-nistp521',
    +possible to change only one of the directions:

    3> ssh:chk_algos_opts(
    +               [{preferred_algorithms,
    +                     [{cipher,[{client2server,['aes128-ctr']}]}
    +                     ]
    +                }
    +              ]).
    +[{kex,['ecdh-sha2-nistp384','ecdh-sha2-nistp521',
            'ecdh-sha2-nistp256','diffie-hellman-group-exchange-sha256',
            'diffie-hellman-group16-sha512',
            'diffie-hellman-group18-sha512',
            'diffie-hellman-group14-sha256',
            'diffie-hellman-group14-sha1',
    -       'diffie-hellman-group-exchange-sha1']},
    - {public_key,['ecdsa-sha2-nistp384','ecdsa-sha2-nistp521',
    +       'diffie-hellman-group-exchange-sha1']},
    + {public_key,['ecdsa-sha2-nistp384','ecdsa-sha2-nistp521',
                   'ecdsa-sha2-nistp256','ssh-rsa','rsa-sha2-256',
    -              'rsa-sha2-512','ssh-dss']},
    - {cipher,[{client2server,['aes128-ctr']},
    -          {server2client,['aes256-gcm@openssh.com','aes256-ctr',
    +              'rsa-sha2-512','ssh-dss']},
    + {cipher,[{client2server,['aes128-ctr']},
    +          {server2client,['aes256-gcm@openssh.com','aes256-ctr',
                               'aes192-ctr','aes128-gcm@openssh.com','aes128-ctr',
    -                          'aes128-cbc','3des-cbc']}]},
    - {mac,[{client2server,['hmac-sha2-256','hmac-sha2-512',
    -                       'hmac-sha1']},
    -       {server2client,['hmac-sha2-256','hmac-sha2-512',
    -                       'hmac-sha1']}]},
    - {compression,[{client2server,[none,'zlib@openssh.com']},
    -               {server2client,[none,'zlib@openssh.com']}]}]

    + 'aes128-cbc','3des-cbc']}]}, + {mac,[{client2server,['hmac-sha2-256','hmac-sha2-512', + 'hmac-sha1']}, + {server2client,['hmac-sha2-256','hmac-sha2-512', + 'hmac-sha1']}]}, + {compression,[{client2server,[none,'zlib@openssh.com']}, + {server2client,[none,'zlib@openssh.com']}]}]

    Example 4

    -

    It is of course possible to change more than one list:

    4> ssh:chk_algos_opts(
    -               [{preferred_algorithms,
    /usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/hardening.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1015))
    --- old//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/hardening.html	2026-06-04 19:05:16.905584476 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/hardening.html	2026-06-04 19:05:16.906584485 +0000
    @@ -228,16 +228,16 @@
     could be replaced with a pwdfun plugin. The arity
     four variant (pwdfun_4()) can also be used for
     introducing delays after failed password checking attempts. Here is a simple
    -example of such a pwdfun:

    fun(User, Password, _PeerAddress, State) ->
    -        case lists:member({User,Password}, my_user_pwds()) of
    +example of such a pwdfun:

    fun(User, Password, _PeerAddress, State) ->
    +        case lists:member({User,Password}, my_user_pwds()) of
                 true ->
    -                {true, undefined}; % Reset delay time
    +                {true, undefined}; % Reset delay time
                 false when State == undefined ->
    -                timer:sleep(1000),
    -                {false, 2000}; % Next delay is 2000 ms
    -            false when is_integer(State) ->
    -                timer:sleep(State),
    -                {false, 2*State} % Double the delay for each failure
    +                timer:sleep(1000),
    +                {false, 2000}; % Next delay is 2000 ms
    +            false when is_integer(State) ->
    +                timer:sleep(State),
    +                {false, 2*State} % Double the delay for each failure
             end
     end.

    If a public key is used for logging in, there is normally no checking of the user name. It could be enabled by setting the option @@ -306,7 +306,7 @@ exploiting known faults or peculiarities learned by reading the public code.

    Each SSH client or daemon presents themselves to each other with brand and version. This may look like

    SSH-2.0-Erlang/4.10

    or

    SSH-2.0-OpenSSH_7.6p1 Ubuntu-4ubuntu0.3

    This brand and version may be changed with the option id_string. We start a daemon with that -option:

    	ssh:daemon(1234, [{id_string,"hi there"}, ... ]).

    and the daemon will present itself as:

    SSH-2.0-hi there

    It is possible to replace the string with one randomly generated for each +option:

    	ssh:daemon(1234, [{id_string,"hi there"}, ... ]).

    and the daemon will present itself as:

    SSH-2.0-hi there

    It is possible to replace the string with one randomly generated for each connection attempt. See the reference manual for id_string.

    @@ -331,10 +331,10 @@ Root Directory Isolation

    The root option restricts SFTP users to a -specific directory tree, preventing access to files outside that directory.

    Example:

    ssh:daemon(Port, [
    -    {subsystems, [ssh_sftpd:subsystem_spec([{root, "/home/sftpuser"}])]},
    +specific directory tree, preventing access to files outside that directory.

    Example:

    ssh:daemon(Port, [
    +    {subsystems, [ssh_sftpd:subsystem_spec([{root, "/home/sftpuser"}])]},
         ...
    -]).

    Important: The root option is configured per daemon, not per user. All +]).

    Important: The root option is configured per daemon, not per user. All users connecting to the same daemon share the same root directory. For per-user isolation, consider running separate daemon instances on different ports or using OS-level mechanisms (PAM chroot, containers, file permissions).

    Defense-in-depth: For high-security deployments, combine the root option @@ -381,7 +381,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/introduction.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (580)) --- old//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/introduction.html 2026-06-04 19:05:16.924584652 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/introduction.html 2026-06-04 19:05:16.924584652 +0000 @@ -272,7 +272,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/notes.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1733)) --- old//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/notes.html 2026-06-04 19:05:16.966585042 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/notes.html 2026-06-04 19:05:16.965585032 +0000 @@ -3473,7 +3473,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/search.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/search.html 2026-06-04 19:05:16.984044043 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/search.html 2026-06-04 19:05:16.984044043 +0000 @@ -145,7 +145,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh.epub/OEBPS/configurations.xhtml differs (HTML document, ASCII text, with very long lines (1397)) --- old//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh.epub/OEBPS/configurations.xhtml 2026-06-04 00:08:44.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh.epub/OEBPS/configurations.xhtml 2042-07-06 13:28:08.000000000 +0000 @@ -37,23 +37,23 @@ Options configuration

    There are from OTP-23.0 two main ways to set an option:

    • Like before, in the Options parameter in the Erlang code in a call to for -example ssh:daemon/3 or ssh:connect/3 or any of their variants. Example:

      ssh:connect(22, [{user,"foo"}])
    • In OTP Configuration Parameters:

      • In the erl command line:

        erl -ssh user \"foo\"
      • In the ssh.app file, in the env part

        {application, ssh,
        - [{description, "SSH-2 for Erlang/OTP"},
        -  {vsn, "4.9"},
        -  {modules, [ssh,
        +example ssh:daemon/3 or ssh:connect/3 or any of their variants. Example:

        ssh:connect(22, [{user,"foo"}])
      • In OTP Configuration Parameters:

        • In the erl command line:

          erl -ssh user \"foo\"
        • In the ssh.app file, in the env part

          {application, ssh,
          + [{description, "SSH-2 for Erlang/OTP"},
          +  {vsn, "4.9"},
          +  {modules, [ssh,
                   ...
          -         ssh_xfer]},
          -  {registered, []},
          -  {applications, [kernel, stdlib, crypto, public_key]},
          -  {env, [{user, "bar"]}, % <<<<<<<<<<<<<<<<<<<<<<<<<<<<<< HERE
          -  {mod, {ssh_app, []}},
          -       ...
        • In a .config file:

          erl -config ex1

          where ex1.config contains:

          [
          -{ssh, [{user, "foo"}]}
          -].

        If the option is intended only for a server or for a client, it may be set in -this way:

        [
        -{ssh, [{server_options,[{user, "foo"}]},
        -       {client_options,[{user, "bar"}]}
        -].

        A server (daemon) will use the user name foo, and a client will use the name + ssh_xfer]}, + {registered, []}, + {applications, [kernel, stdlib, crypto, public_key]}, + {env, [{user, "bar"]}, % <<<<<<<<<<<<<<<<<<<<<<<<<<<<<< HERE + {mod, {ssh_app, []}}, + ...

  • In a .config file:

    erl -config ex1

    where ex1.config contains:

    [
    +{ssh, [{user, "foo"}]}
    +].
  • If the option is intended only for a server or for a client, it may be set in +this way:

    [
    +{ssh, [{server_options,[{user, "foo"}]},
    +       {client_options,[{user, "bar"}]}
    +].

    A server (daemon) will use the user name foo, and a client will use the name bar.

    @@ -124,17 +124,17 @@ 'hmac-sha1']}]}, {compression,[{client2server,[none,'zlib@openssh.com']}, {server2client,[none,'zlib@openssh.com']}]}]

    Note that the algorithms in the file ex2.config is not yet applied. They will -be when we start ssh:

    2> ssh:start().
    +be when we start ssh:

    2> ssh:start().
     ok
    -3> ssh:default_algorithms().
    -[{kex,['ecdh-sha2-nistp384']},
    - {public_key,['ssh-rsa']},
    - {cipher,[{client2server,['aes192-ctr']},
    -          {server2client,['aes192-ctr']}]},
    - {mac,[{client2server,['hmac-sha1']},
    -       {server2client,['hmac-sha1']}]},
    - {compression,[{client2server,[none,'zlib@openssh.com']},
    -               {server2client,[none,'zlib@openssh.com']}]}]
    +3> ssh:default_algorithms().
    +[{kex,['ecdh-sha2-nistp384']},
    + {public_key,['ssh-rsa']},
    + {cipher,[{client2server,['aes192-ctr']},
    +          {server2client,['aes192-ctr']}]},
    + {mac,[{client2server,['hmac-sha1']},
    +       {server2client,['hmac-sha1']}]},
    + {compression,[{client2server,[none,'zlib@openssh.com']},
    +               {server2client,[none,'zlib@openssh.com']}]}]
     4>

    We see that the algorithm set is changed to the one in the ex2.config. Since compression is not specified in the file, the hard-coded default is still used for that entry.

    Establishing a connection (ssh:connect et al) or starting a daemon (ssh:daemon)

    Both when the client establishes a connection with ssh:connect or other @@ -147,65 +147,65 @@ modify_algorithms on all levels in order starting with level 0 are applied.

    We continue the example above by connecting to a server and modifying the kex algorithm set. We remove the only one ('ecdh-sha2-nistp384') and add -'curve25519-sha256@libssh.org' by appending it to the now empty list:

    4> {ok,C} = ssh:connect(loopback, 22,
    -                        [{modify_algorithms,
    -                                 [{rm,
    -                                     [ {kex,['ecdh-sha2-nistp384']} ]
    -				  },
    -                                  {append,
    -			             [ {kex,['curve25519-sha256@libssh.org']} ]
    -				  }
    -				 ]
    -	                 }
    -                        ]).
    -{ok,>0.118.0>}

    We check which algorithms are negotiated by the client and the server, and note -that the (only) kex algorithm 'curve25519-sha256@libssh.org' was selected:

    5> ssh:connection_info(C, algorithms).
    -{algorithms,[{kex,'curve25519-sha256@libssh.org'},
    -             {hkey,'ssh-rsa'},
    -             {send_mac,'hmac-sha1'},
    -             {recv_mac,'hmac-sha1'},
    -             {encrypt,'aes192-ctr'},
    -             {decrypt,'aes192-ctr'},
    -             {compress,none},
    -             {decompress,none},
    -             {send_ext_info,false},
    -             {recv_ext_info,true}]}

    Example of modify_algorithms handling

    We will now check if the +'curve25519-sha256@libssh.org' by appending it to the now empty list:

    4> {ok,C} = ssh:connect(loopback, 22,
    +                        [{modify_algorithms,
    +                                 [{rm,
    +                                     [ {kex,['ecdh-sha2-nistp384']} ]
    +				  },
    +                                  {append,
    +			             [ {kex,['curve25519-sha256@libssh.org']} ]
    +				  }
    +				 ]
    +	                 }
    +                        ]).
    +{ok,>0.118.0>}

    We check which algorithms are negotiated by the client and the server, and note +that the (only) kex algorithm 'curve25519-sha256@libssh.org' was selected:

    5> ssh:connection_info(C, algorithms).
    +{algorithms,[{kex,'curve25519-sha256@libssh.org'},
    +             {hkey,'ssh-rsa'},
    +             {send_mac,'hmac-sha1'},
    +             {recv_mac,'hmac-sha1'},
    +             {encrypt,'aes192-ctr'},
    +             {decrypt,'aes192-ctr'},
    +             {compress,none},
    +             {decompress,none},
    +             {send_ext_info,false},
    +             {recv_ext_info,true}]}

    Example of modify_algorithms handling

    We will now check if the modify_algorithms on a lower level is applied to a preferred_algorithms on a higher level. We will do that by enabling the ssh-dss algorithm that is supported, -but not in the default set.

    The config file ex3.config has the contents:

    [
    - {ssh, [{modify_algorithms,
    -         [ {prepend, [{public_key, ['ssh-dss']}]} ]
    -        }]}
    -].

    A newly started erlang shell shows that no 'ssh-dss' is present in the -public_key entry:

    1> proplists:get_value(public_key, ssh:default_algorithms()).
    -['ecdsa-sha2-nistp384','ecdsa-sha2-nistp521',
    +but not in the default set.

    The config file ex3.config has the contents:

    [
    + {ssh, [{modify_algorithms,
    +         [ {prepend, [{public_key, ['ssh-dss']}]} ]
    +        }]}
    +].

    A newly started erlang shell shows that no 'ssh-dss' is present in the +public_key entry:

    1> proplists:get_value(public_key, ssh:default_algorithms()).
    +['ecdsa-sha2-nistp384','ecdsa-sha2-nistp521',
      'ecdsa-sha2-nistp256','ssh-ed25519','ssh-ed448',
    - 'rsa-sha2-256','rsa-sha2-512','ssh-rsa']
    -2>

    A call to ssh:connect/3 removes all algorithms but one of each type:

    2> ssh:start().
    + 'rsa-sha2-256','rsa-sha2-512','ssh-rsa']
    +2>

    A call to ssh:connect/3 removes all algorithms but one of each type:

    2> ssh:start().
     ok
    -3> {ok,C} = ssh:connect(loopback, 22,
    -                        [{preferred_algorithms,
    -                         [{public_key, ['ecdsa-sha2-nistp256']},
    -			  {kex, ['ecdh-sha2-nistp256']},
    -		          {cipher, ['chacha20-poly1305@openssh.com']},
    -			  {mac, ['hmac-sha2-256']},
    -			  {compression, [none]}
    -			  ]}
    -			 ]).
    -{ok,<0.101.0>}
    -4> ssh:connection_info(C,algorithms).
    -{algorithms,[{kex,'ecdh-sha2-nistp256'},
    -             {hkey,'ssh-dss'},
    -             {send_mac,'chacha20-poly1305@openssh.com'},
    -             {recv_mac,'chacha20-poly1305@openssh.com'},
    -             {encrypt,'chacha20-poly1305@openssh.com'},
    -             {decrypt,'chacha20-poly1305@openssh.com'},
    -             {compress,none},
    -             {decompress,none},
    -             {send_ext_info,false},
    -             {recv_ext_info,true}]}
    +3> {ok,C} = ssh:connect(loopback, 22,
    +                        [{preferred_algorithms,
    +                         [{public_key, ['ecdsa-sha2-nistp256']},
    +			  {kex, ['ecdh-sha2-nistp256']},
    +		          {cipher, ['chacha20-poly1305@openssh.com']},
    +			  {mac, ['hmac-sha2-256']},
    +			  {compression, [none]}
    +			  ]}
    +			 ]).
    +{ok,<0.101.0>}
    +4> ssh:connection_info(C,algorithms).
    +{algorithms,[{kex,'ecdh-sha2-nistp256'},
    +             {hkey,'ssh-dss'},
    +             {send_mac,'chacha20-poly1305@openssh.com'},
    +             {recv_mac,'chacha20-poly1305@openssh.com'},
    +             {encrypt,'chacha20-poly1305@openssh.com'},
    +             {decrypt,'chacha20-poly1305@openssh.com'},
    +             {compress,none},
    +             {decompress,none},
    +             {send_ext_info,false},
    +             {recv_ext_info,true}]}
     5>

    But 'ssh-dss' is selected although the call inserted only 'ecdsa-sha2-nistp256' as acceptable.

    This example showed that we could augment the set of algorithms with a config-file without the need to change the actual call.

    For demonstration purposes we used prepend instead of append. This forces /usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh.epub/OEBPS/configure_algos.xhtml differs (HTML document, ASCII text, with very long lines (722)) --- old//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh.epub/OEBPS/configure_algos.xhtml 2026-06-04 00:08:44.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh.epub/OEBPS/configure_algos.xhtml 2042-07-06 13:28:08.000000000 +0000 @@ -67,29 +67,29 @@ supported by the:

    • crypto app,
    • The cryptolib OTP is linked with, usually the one the OS uses, probably OpenSSL,
    • and finally what the SSH app implements

    Due to this, it impossible to list in documentation what algorithms that are available in a certain installation.

    There is an important command to list the actual algorithms and their ordering: -ssh:default_algorithms/0.

    0> ssh:default_algorithms().
    -[{kex,['ecdh-sha2-nistp384','ecdh-sha2-nistp521',
    +ssh:default_algorithms/0.

    0> ssh:default_algorithms().
    +[{kex,['ecdh-sha2-nistp384','ecdh-sha2-nistp521',
            'ecdh-sha2-nistp256','diffie-hellman-group-exchange-sha256',
            'diffie-hellman-group16-sha512',
            'diffie-hellman-group18-sha512',
            'diffie-hellman-group14-sha256',
            'diffie-hellman-group14-sha1',
    -       'diffie-hellman-group-exchange-sha1']},
    - {public_key,['ecdsa-sha2-nistp384','ecdsa-sha2-nistp521',
    +       'diffie-hellman-group-exchange-sha1']},
    + {public_key,['ecdsa-sha2-nistp384','ecdsa-sha2-nistp521',
                   'ecdsa-sha2-nistp256','ssh-rsa','rsa-sha2-256',
    -              'rsa-sha2-512','ssh-dss']},
    - {cipher,[{client2server,['aes256-gcm@openssh.com',
    +              'rsa-sha2-512','ssh-dss']},
    + {cipher,[{client2server,['aes256-gcm@openssh.com',
                               'aes256-ctr','aes192-ctr','aes128-gcm@openssh.com',
    -                          'aes128-ctr','aes128-cbc','3des-cbc']},
    -          {server2client,['aes256-gcm@openssh.com','aes256-ctr',
    +                          'aes128-ctr','aes128-cbc','3des-cbc']},
    +          {server2client,['aes256-gcm@openssh.com','aes256-ctr',
                               'aes192-ctr','aes128-gcm@openssh.com','aes128-ctr',
    -                          'aes128-cbc','3des-cbc']}]},
    - {mac,[{client2server,['hmac-sha2-256','hmac-sha2-512',
    -                       'hmac-sha1']},
    -       {server2client,['hmac-sha2-256','hmac-sha2-512',
    -                       'hmac-sha1']}]},
    - {compression,[{client2server,[none,'zlib@openssh.com']},
    -               {server2client,[none,'zlib@openssh.com']}]}]

    To change the algorithm list, there are two options which can be used in + 'aes128-cbc','3des-cbc']}]}, + {mac,[{client2server,['hmac-sha2-256','hmac-sha2-512', + 'hmac-sha1']}, + {server2client,['hmac-sha2-256','hmac-sha2-512', + 'hmac-sha1']}]}, + {compression,[{client2server,[none,'zlib@openssh.com']}, + {server2client,[none,'zlib@openssh.com']}]}]

    To change the algorithm list, there are two options which can be used in ssh:connect/2,3,4 and ssh:daemon/2,3. The options could of course be used in all other functions that initiates connections.

    The options are @@ -112,28 +112,28 @@ Example 1

    Replace the kex algorithms list with the single algorithm -'diffie-hellman-group14-sha256':

    1> ssh:chk_algos_opts(
    -               [{preferred_algorithms,
    -                     [{kex, ['diffie-hellman-group14-sha256']}
    -                     ]
    -                }
    -              ]).
    -[{kex,['diffie-hellman-group14-sha256']},
    - {public_key,['ecdsa-sha2-nistp384','ecdsa-sha2-nistp521',
    +'diffie-hellman-group14-sha256':

    1> ssh:chk_algos_opts(
    +               [{preferred_algorithms,
    +                     [{kex, ['diffie-hellman-group14-sha256']}
    +                     ]
    +                }
    +              ]).
    +[{kex,['diffie-hellman-group14-sha256']},
    + {public_key,['ecdsa-sha2-nistp384','ecdsa-sha2-nistp521',
                   'ecdsa-sha2-nistp256','ssh-rsa','rsa-sha2-256',
    -              'rsa-sha2-512','ssh-dss']},
    - {cipher,[{client2server,['aes256-gcm@openssh.com',
    +              'rsa-sha2-512','ssh-dss']},
    + {cipher,[{client2server,['aes256-gcm@openssh.com',
                               'aes256-ctr','aes192-ctr','aes128-gcm@openssh.com',
    -                          'aes128-ctr','aes128-cbc','3des-cbc']},
    -          {server2client,['aes256-gcm@openssh.com','aes256-ctr',
    +                          'aes128-ctr','aes128-cbc','3des-cbc']},
    +          {server2client,['aes256-gcm@openssh.com','aes256-ctr',
                               'aes192-ctr','aes128-gcm@openssh.com','aes128-ctr',
    -                          'aes128-cbc','3des-cbc']}]},
    - {mac,[{client2server,['hmac-sha2-256','hmac-sha2-512',
    -                       'hmac-sha1']},
    -       {server2client,['hmac-sha2-256','hmac-sha2-512',
    -                       'hmac-sha1']}]},
    - {compression,[{client2server,[none,'zlib@openssh.com']},
    -               {server2client,[none,'zlib@openssh.com']}]}]

    Note that the unmentioned lists (public_key, cipher, mac and + 'aes128-cbc','3des-cbc']}]}, + {mac,[{client2server,['hmac-sha2-256','hmac-sha2-512', + 'hmac-sha1']}, + {server2client,['hmac-sha2-256','hmac-sha2-512', + 'hmac-sha1']}]}, + {compression,[{client2server,[none,'zlib@openssh.com']}, + {server2client,[none,'zlib@openssh.com']}]}]

    Note that the unmentioned lists (public_key, cipher, mac and compression) are unchanged.

    @@ -141,30 +141,30 @@ Example 2

    In the lists that are divided in two for the two directions (for example cipher) it is -possible to change both directions at once:

    2> ssh:chk_algos_opts(
    -               [{preferred_algorithms,
    -                     [{cipher,['aes128-ctr']}
    -                     ]
    -                }
    -              ]).
    -[{kex,['ecdh-sha2-nistp384','ecdh-sha2-nistp521',
    +possible to change both directions at once:

    2> ssh:chk_algos_opts(
    +               [{preferred_algorithms,
    +                     [{cipher,['aes128-ctr']}
    +                     ]
    +                }
    +              ]).
    +[{kex,['ecdh-sha2-nistp384','ecdh-sha2-nistp521',
            'ecdh-sha2-nistp256','diffie-hellman-group-exchange-sha256',
            'diffie-hellman-group16-sha512',
            'diffie-hellman-group18-sha512',
            'diffie-hellman-group14-sha256',
            'diffie-hellman-group14-sha1',
    -       'diffie-hellman-group-exchange-sha1']},
    - {public_key,['ecdsa-sha2-nistp384','ecdsa-sha2-nistp521',
    +       'diffie-hellman-group-exchange-sha1']},
    + {public_key,['ecdsa-sha2-nistp384','ecdsa-sha2-nistp521',
                   'ecdsa-sha2-nistp256','ssh-rsa','rsa-sha2-256',
    -              'rsa-sha2-512','ssh-dss']},
    - {cipher,[{client2server,['aes128-ctr']},
    -          {server2client,['aes128-ctr']}]},
    - {mac,[{client2server,['hmac-sha2-256','hmac-sha2-512',
    -                       'hmac-sha1']},
    -       {server2client,['hmac-sha2-256','hmac-sha2-512',
    -                       'hmac-sha1']}]},
    - {compression,[{client2server,[none,'zlib@openssh.com']},
    -               {server2client,[none,'zlib@openssh.com']}]}]

    Note that both lists in cipher has been changed to the provided value + 'rsa-sha2-512','ssh-dss']}, + {cipher,[{client2server,['aes128-ctr']}, + {server2client,['aes128-ctr']}]}, + {mac,[{client2server,['hmac-sha2-256','hmac-sha2-512', + 'hmac-sha1']}, + {server2client,['hmac-sha2-256','hmac-sha2-512', + 'hmac-sha1']}]}, + {compression,[{client2server,[none,'zlib@openssh.com']}, + {server2client,[none,'zlib@openssh.com']}]}]

    Note that both lists in cipher has been changed to the provided value ('aes128-ctr').

    @@ -172,56 +172,56 @@ Example 3

    In the lists that are divided in two for the two directions (for example cipher) it is -possible to change only one of the directions:

    3> ssh:chk_algos_opts(
    -               [{preferred_algorithms,
    -                     [{cipher,[{client2server,['aes128-ctr']}]}
    -                     ]
    -                }
    -              ]).
    -[{kex,['ecdh-sha2-nistp384','ecdh-sha2-nistp521',
    +possible to change only one of the directions:

    3> ssh:chk_algos_opts(
    +               [{preferred_algorithms,
    +                     [{cipher,[{client2server,['aes128-ctr']}]}
    +                     ]
    +                }
    +              ]).
    +[{kex,['ecdh-sha2-nistp384','ecdh-sha2-nistp521',
            'ecdh-sha2-nistp256','diffie-hellman-group-exchange-sha256',
            'diffie-hellman-group16-sha512',
            'diffie-hellman-group18-sha512',
            'diffie-hellman-group14-sha256',
            'diffie-hellman-group14-sha1',
    -       'diffie-hellman-group-exchange-sha1']},
    - {public_key,['ecdsa-sha2-nistp384','ecdsa-sha2-nistp521',
    +       'diffie-hellman-group-exchange-sha1']},
    + {public_key,['ecdsa-sha2-nistp384','ecdsa-sha2-nistp521',
                   'ecdsa-sha2-nistp256','ssh-rsa','rsa-sha2-256',
    -              'rsa-sha2-512','ssh-dss']},
    - {cipher,[{client2server,['aes128-ctr']},
    -          {server2client,['aes256-gcm@openssh.com','aes256-ctr',
    +              'rsa-sha2-512','ssh-dss']},
    + {cipher,[{client2server,['aes128-ctr']},
    +          {server2client,['aes256-gcm@openssh.com','aes256-ctr',
                               'aes192-ctr','aes128-gcm@openssh.com','aes128-ctr',
    -                          'aes128-cbc','3des-cbc']}]},
    - {mac,[{client2server,['hmac-sha2-256','hmac-sha2-512',
    -                       'hmac-sha1']},
    -       {server2client,['hmac-sha2-256','hmac-sha2-512',
    -                       'hmac-sha1']}]},
    - {compression,[{client2server,[none,'zlib@openssh.com']},
    -               {server2client,[none,'zlib@openssh.com']}]}]

    + 'aes128-cbc','3des-cbc']}]}, + {mac,[{client2server,['hmac-sha2-256','hmac-sha2-512', + 'hmac-sha1']}, + {server2client,['hmac-sha2-256','hmac-sha2-512', + 'hmac-sha1']}]}, + {compression,[{client2server,[none,'zlib@openssh.com']}, + {server2client,[none,'zlib@openssh.com']}]}]

    Example 4

    -

    It is of course possible to change more than one list:

    4> ssh:chk_algos_opts(
    -               [{preferred_algorithms,
    /usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh.epub/OEBPS/content.opf differs (XML 1.0 document, ASCII text)
    --- old//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh.epub/OEBPS/content.opf	2026-06-04 00:08:44.000000000 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh.epub/OEBPS/content.opf	2042-07-06 13:28:08.000000000 +0000
    @@ -4,10 +4,10 @@
              version="3.0">
       
         ssh - 5.2.11.4
    -    urn:uuid:9f6deea7-3c13-d596-e885-38c2a3ea9919
    +    urn:uuid:5997b6c9-91ec-dae3-fd32-24eb52f8518c
         en
     
    -    2026-06-04T00:08:44Z
    +    2042-07-06T13:28:08Z
     
       
       
    /usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh.epub/OEBPS/hardening.xhtml differs (HTML document, ASCII text, with very long lines (1015))
    --- old//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh.epub/OEBPS/hardening.xhtml	2026-06-04 00:08:44.000000000 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh.epub/OEBPS/hardening.xhtml	2042-07-06 13:28:08.000000000 +0000
    @@ -123,16 +123,16 @@
     could be replaced with a pwdfun plugin. The arity
     four variant (pwdfun_4()) can also be used for
     introducing delays after failed password checking attempts. Here is a simple
    -example of such a pwdfun:

    fun(User, Password, _PeerAddress, State) ->
    -        case lists:member({User,Password}, my_user_pwds()) of
    +example of such a pwdfun:

    fun(User, Password, _PeerAddress, State) ->
    +        case lists:member({User,Password}, my_user_pwds()) of
                 true ->
    -                {true, undefined}; % Reset delay time
    +                {true, undefined}; % Reset delay time
                 false when State == undefined ->
    -                timer:sleep(1000),
    -                {false, 2000}; % Next delay is 2000 ms
    -            false when is_integer(State) ->
    -                timer:sleep(State),
    -                {false, 2*State} % Double the delay for each failure
    +                timer:sleep(1000),
    +                {false, 2000}; % Next delay is 2000 ms
    +            false when is_integer(State) ->
    +                timer:sleep(State),
    +                {false, 2*State} % Double the delay for each failure
             end
     end.

    If a public key is used for logging in, there is normally no checking of the user name. It could be enabled by setting the option @@ -201,7 +201,7 @@ exploiting known faults or peculiarities learned by reading the public code.

    Each SSH client or daemon presents themselves to each other with brand and version. This may look like

    SSH-2.0-Erlang/4.10

    or

    SSH-2.0-OpenSSH_7.6p1 Ubuntu-4ubuntu0.3

    This brand and version may be changed with the option id_string. We start a daemon with that -option:

    	ssh:daemon(1234, [{id_string,"hi there"}, ... ]).

    and the daemon will present itself as:

    SSH-2.0-hi there

    It is possible to replace the string with one randomly generated for each +option:

    	ssh:daemon(1234, [{id_string,"hi there"}, ... ]).

    and the daemon will present itself as:

    SSH-2.0-hi there

    It is possible to replace the string with one randomly generated for each connection attempt. See the reference manual for id_string.

    @@ -226,10 +226,10 @@ Root Directory Isolation

    The root option restricts SFTP users to a -specific directory tree, preventing access to files outside that directory.

    Example:

    ssh:daemon(Port, [
    -    {subsystems, [ssh_sftpd:subsystem_spec([{root, "/home/sftpuser"}])]},
    +specific directory tree, preventing access to files outside that directory.

    Example:

    ssh:daemon(Port, [
    +    {subsystems, [ssh_sftpd:subsystem_spec([{root, "/home/sftpuser"}])]},
         ...
    -]).

    Important: The root option is configured per daemon, not per user. All +]).

    Important: The root option is configured per daemon, not per user. All users connecting to the same daemon share the same root directory. For per-user isolation, consider running separate daemon instances on different ports or using OS-level mechanisms (PAM chroot, containers, file permissions).

    Defense-in-depth: For high-security deployments, combine the root option /usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh.epub/OEBPS/ssh_agent.xhtml differs (HTML document, ASCII text, with very long lines (933)) --- old//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh.epub/OEBPS/ssh_agent.xhtml 2026-06-04 00:08:44.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh.epub/OEBPS/ssh_agent.xhtml 2042-07-06 13:28:08.000000000 +0000 @@ -30,11 +30,11 @@ authentication.

    Ssh_agent implements the ssh_client_key_api, to allow it to be used by setting the option key_cb when starting a client (with for example ssh:connect, -ssh:shell ).

          {key_cb, {ssh_agent, []}}

    The agent communication is established through a UNIX domain socket. By default, +ssh:shell ).

          {key_cb, {ssh_agent, []}}

    The agent communication is established through a UNIX domain socket. By default, the socket path will be fetched from the SSH_AUTH_SOCK environment variable, which is the default socket path in the agent implementation of OpenSSH.

    In order to set a different socket path the socket_path -option can be set.

          {key_cb, {ssh_agent, [{socket_path, SocketPath}]}}

    Note

    The functions are Callbacks for the SSH app. They are not intended to be +option can be set.

          {key_cb, {ssh_agent, [{socket_path, SocketPath}]}}

    Note

    The functions are Callbacks for the SSH app. They are not intended to be called from the user's code!

    /usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh.epub/OEBPS/ssh.xhtml differs (HTML document, ASCII text, with very long lines (471)) --- old//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh.epub/OEBPS/ssh.xhtml 2026-06-04 00:08:44.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh.epub/OEBPS/ssh.xhtml 2042-07-06 13:28:08.000000000 +0000 @@ -3363,14 +3363,14 @@

    List of algorithms to use in the algorithm negotiation. The default algs_list/0 can be obtained from default_algorithms/0.

    If an alg_entry() is missing in the algs_list(), the default value is used for -that entry.

    Here is an example of this option:

    	  {preferred_algorithms,
    -	  [{public_key,['ssh-rsa','ssh-dss']},
    -	  {cipher,[{client2server,['aes128-ctr']},
    -          {server2client,['aes128-cbc','3des-cbc']}]},
    -	  {mac,['hmac-sha2-256','hmac-sha1']},
    -	  {compression,[none,zlib]}
    -	  ]
    -	  }

    The example specifies different algorithms in the two directions (client2server +that entry.

    Here is an example of this option:

    	  {preferred_algorithms,
    +	  [{public_key,['ssh-rsa','ssh-dss']},
    +	  {cipher,[{client2server,['aes128-ctr']},
    +          {server2client,['aes128-cbc','3des-cbc']}]},
    +	  {mac,['hmac-sha2-256','hmac-sha1']},
    +	  {compression,[none,zlib]}
    +	  ]
    +	  }

    The example specifies different algorithms in the two directions (client2server and server2client), for cipher but specifies the same algorithms for mac and compression in both directions. The kex (key exchange) is implicit but public_key is set explicitly.

    For background and more examples see the @@ -5198,21 +5198,21 @@

    hostkey_fingerprint([DigestType], HostKey) -> [string()]hostkey_fingerprint(DigestType, HostKey) -> string()

    Calculates a ssh fingerprint from a public host key as openssh does.

    The algorithm in hostkey_fingerprint/1 is md5 to be compatible with older ssh-keygen commands. The string from the second variant is -prepended by the algorithm name in uppercase as in newer ssh-keygen commands.

    Examples:

     2> ssh:hostkey_fingerprint(Key).
    +prepended by the algorithm name in uppercase as in newer ssh-keygen commands.

    Examples:

     2> ssh:hostkey_fingerprint(Key).
      "f5:64:a6:c1:5a:cb:9f:0a:10:46:a2:5c:3e:2f:57:84"
     
    - 3> ssh:hostkey_fingerprint(md5,Key).
    + 3> ssh:hostkey_fingerprint(md5,Key).
      "MD5:f5:64:a6:c1:5a:cb:9f:0a:10:46:a2:5c:3e:2f:57:84"
     
    - 4> ssh:hostkey_fingerprint(sha,Key).
    + 4> ssh:hostkey_fingerprint(sha,Key).
      "SHA1:bSLY/C4QXLDL/Iwmhyg0PGW9UbY"
     
    - 5> ssh:hostkey_fingerprint(sha256,Key).
    + 5> ssh:hostkey_fingerprint(sha256,Key).
      "SHA256:aZGXhabfbf4oxglxltItWeHU7ub3Dc31NcNw2cMJePQ"
     
    - 6> ssh:hostkey_fingerprint([sha,sha256],Key).
    - ["SHA1:bSLY/C4QXLDL/Iwmhyg0PGW9UbY",
    -  "SHA256:aZGXhabfbf4oxglxltItWeHU7ub3Dc31NcNw2cMJePQ"]
    +
    6> ssh:hostkey_fingerprint([sha,sha256],Key). + ["SHA1:bSLY/C4QXLDL/Iwmhyg0PGW9UbY", + "SHA256:aZGXhabfbf4oxglxltItWeHU7ub3Dc31NcNw2cMJePQ"]
    /usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh.epub/OEBPS/using_ssh.xhtml differs (HTML document, ASCII text, with very long lines (956)) --- old//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh.epub/OEBPS/using_ssh.xhtml 2026-06-04 00:08:44.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh.epub/OEBPS/using_ssh.xhtml 2042-07-06 13:28:08.000000000 +0000 @@ -35,9 +35,9 @@ Using the Erlang ssh Terminal Client

    The user otptest, which has bash as default shell, uses the ssh:shell/1 -client to connect to the OpenSSH daemon running on a host called ssh.example.com:

    1> ssh:start().
    +client to connect to the OpenSSH daemon running on a host called ssh.example.com:

    1> ssh:start().
     ok
    -2> {ok, S} = ssh:shell("ssh.example.com").
    +2> {ok, S} = ssh:shell("ssh.example.com").
     otptest@ssh.example.com:> pwd
     /home/otptest
     otptest@ssh.example.com:> exit
    @@ -56,11 +56,11 @@
     [...]
     $bash> ssh-keygen -t rsa -f /tmp/otptest_user/.ssh/id_rsa
     [...]

    Step 2. Create the file /tmp/otptest_user/.ssh/authorized_keys and add the -content of /tmp/otptest_user/.ssh/id_rsa.pub.

    Step 3. Start the Erlang ssh daemon:

    1> ssh:start().
    +content of /tmp/otptest_user/.ssh/id_rsa.pub.

    Step 3. Start the Erlang ssh daemon:

    1> ssh:start().
     ok
    -2> {ok, Sshd} = ssh:daemon(8989, [{system_dir, "/tmp/ssh_daemon"},
    -                                  {user_dir, "/tmp/otptest_user/.ssh"}]).
    -{ok,<0.54.0>}
    +2> {ok, Sshd} = ssh:daemon(8989, [{system_dir, "/tmp/ssh_daemon"},
    +                                  {user_dir, "/tmp/otptest_user/.ssh"}]).
    +{ok,<0.54.0>}
     3>

    Step 4. Use the OpenSSH client from a shell to connect to the Erlang ssh daemon:

    $bash> ssh ssh.example.com -p 8989  -i /tmp/otptest_user/.ssh/id_rsa \
                       -o UserKnownHostsFile=/tmp/otptest_user/.ssh/known_hosts
    @@ -71,10 +71,10 @@
     Eshell V5.10  (abort with ^G)
     1>

    There are two ways of shutting down an ssh daemon, see Step 5a and Step 5b.

    Step 5a. Shut down the Erlang ssh daemon so that it stops the listener but -leaves existing connections, started by the listener, operational:

    3> ssh:stop_listener(Sshd).
    +leaves existing connections, started by the listener, operational:

    3> ssh:stop_listener(Sshd).
     ok
     4>

    Step 5b. Shut down the Erlang ssh daemon so that it stops the listener and -all connections started by the listener:

    3> ssh:stop_daemon(Sshd).
    +all connections started by the listener:

    3> ssh:stop_daemon(Sshd).
     ok
     4>

    @@ -90,35 +90,35 @@

    In the following example, the Erlang shell is the client process that receives the channel replies as Erlang messages.

    Do an one-time execution of a remote OS command ("pwd") over ssh to the ssh -server of the OS at the host "ssh.example.com":

    1> ssh:start().
    +server of the OS at the host "ssh.example.com":

    1> ssh:start().
     ok
    -2> {ok, ConnectionRef} = ssh:connect("ssh.example.com", 22, []).
    -{ok,<0.57.0>}
    -3> {ok, ChannelId} = ssh_connection:session_channel(ConnectionRef, infinity).
    -{ok,0}
    -4> success = ssh_connection:exec(ConnectionRef, ChannelId, "pwd", infinity).
    -5> flush(). % Get all pending messages. NOTE: ordering may vary!
    -Shell got {ssh_cm,<0.57.0>,{data,0,0,<<"/home/otptest\n">>}}
    -Shell got {ssh_cm,<0.57.0>,{eof,0}}
    -Shell got {ssh_cm,<0.57.0>,{exit_status,0,0}}
    -Shell got {ssh_cm,<0.57.0>,{closed,0}}
    +2> {ok, ConnectionRef} = ssh:connect("ssh.example.com", 22, []).
    +{ok,<0.57.0>}
    +3> {ok, ChannelId} = ssh_connection:session_channel(ConnectionRef, infinity).
    +{ok,0}
    +4> success = ssh_connection:exec(ConnectionRef, ChannelId, "pwd", infinity).
    +5> flush(). % Get all pending messages. NOTE: ordering may vary!
    +Shell got {ssh_cm,<0.57.0>,{data,0,0,<<"/home/otptest\n">>}}
    +Shell got {ssh_cm,<0.57.0>,{eof,0}}
    +Shell got {ssh_cm,<0.57.0>,{exit_status,0,0}}
    +Shell got {ssh_cm,<0.57.0>,{closed,0}}
     ok
    -6> ssh:connection_info(ConnectionRef, channels).
    -{channels,[]}
    +6> ssh:connection_info(ConnectionRef, channels).
    +{channels,[]}
     7>

    See ssh_connection and ssh_connection:exec/4 for finding documentation of the channel messages.

    To collect the channel messages in a program, use receive...end instead of flush/1:

    5> receive
    -5>     {ssh_cm, ConnectionRef, {data, ChannelId, Type, Result}} when Type == 0 ->
    -5>         {ok,Result}
    -5>     {ssh_cm, ConnectionRef, {data, ChannelId, Type, Result}} when Type == 1 ->
    -5>         {error,Result}
    +5>     {ssh_cm, ConnectionRef, {data, ChannelId, Type, Result}} when Type == 0 ->
    +5>         {ok,Result}
    +5>     {ssh_cm, ConnectionRef, {data, ChannelId, Type, Result}} when Type == 1 ->
    +5>         {error,Result}
     5> end.
    -{ok,<<"/home/otptest\n">>}
    +{ok,<<"/home/otptest\n">>}
     6>

    Note that only the exec channel is closed after the one-time execution. The connection is still up and can handle previously opened channels. It is also possible to open a new channel:

    % try to open a new channel to check if the ConnectionRef is still open
    -7> {ok, NewChannelId} = ssh_connection:session_channel(ConnectionRef, infinity).
    -{ok,1}
    +7> {ok, NewChannelId} = ssh_connection:session_channel(ConnectionRef, infinity).
    +{ok,1}
     8>

    To close the connection, call the function ssh:close(ConnectionRef). As an alternative, set the option {idle_time, 1} when opening the @@ -133,23 +133,23 @@ "command" must be as if entered into the erlang shell, that is a sequence of Erlang expressions ended by a period (.). Variables bound in that sequence will keep their bindings throughout the expression -sequence. The bindings are disposed when the result is returned.

    Here is an example of a suitable expression sequence:

    A=1, B=2, 3 == (A + B).

    It evaluates to true if submitted to the Erlang daemon started in +sequence. The bindings are disposed when the result is returned.

    Here is an example of a suitable expression sequence:

    A=1, B=2, 3 == (A + B).

    It evaluates to true if submitted to the Erlang daemon started in Step 3 above:

    $bash> ssh ssh.example.com -p 8989 "A=1, B=2, 3 == (A + B)."
     true
     $bash>

    The same example but now using the Erlang ssh client to contact the Erlang -server:

    1> {ok, ConnectionRef} = ssh:connect("ssh.example.com", 8989, []).
    -{ok,<0.216.0>}
    -2> {ok, ChannelId} = ssh_connection:session_channel(ConnectionRef, infinity).
    -{ok,0}
    -3> success = ssh_connection:exec(ConnectionRef, ChannelId,
    +server:

    1> {ok, ConnectionRef} = ssh:connect("ssh.example.com", 8989, []).
    +{ok,<0.216.0>}
    +2> {ok, ChannelId} = ssh_connection:session_channel(ConnectionRef, infinity).
    +{ok,0}
    +3> success = ssh_connection:exec(ConnectionRef, ChannelId,
                                      "A=1, B=2, 3 == (A + B).",
    -                                 infinity).
    +                                 infinity).
     success
    -4> flush().
    -Shell got {ssh_cm,<0.216.0>,{data,0,0,<<"true">>}}
    -Shell got {ssh_cm,<0.216.0>,{exit_status,0,0}}
    -Shell got {ssh_cm,<0.216.0>,{eof,0}}
    -Shell got {ssh_cm,<0.216.0>,{closed,0}}
    +4> flush().
    +Shell got {ssh_cm,<0.216.0>,{data,0,0,<<"true">>}}
    +Shell got {ssh_cm,<0.216.0>,{exit_status,0,0}}
    +Shell got {ssh_cm,<0.216.0>,{eof,0}}
    +Shell got {ssh_cm,<0.216.0>,{closed,0}}
     ok
     5>

    Note that Erlang shell specific functions and control sequences like for example h(). are not supported.

    @@ -170,36 +170,36 @@ write something: [a,b,c]. {ok,[a,b,c]} $bash>

    The same example but using the Erlang ssh client:

    
    -Eshell V10.5.2  (abort with ^G)
    -1> ssh:start().
    +Eshell V10.5.2  (abort with ^G)
    +1> ssh:start().
     ok
    -2> {ok, ConnectionRef} = ssh:connect(loopback, 8989, []).
    -{ok,<0.92.0>}
    -3> {ok, ChannelId} = ssh_connection:session_channel(ConnectionRef, infinity).
    -{ok,0}
    -4> success = ssh_connection:exec(ConnectionRef, ChannelId,
    +2> {ok, ConnectionRef} = ssh:connect(loopback, 8989, []).
    +{ok,<0.92.0>}
    +3> {ok, ChannelId} = ssh_connection:session_channel(ConnectionRef, infinity).
    +{ok,0}
    +4> success = ssh_connection:exec(ConnectionRef, ChannelId,
                                      "io:read(\"write something: \").",
    -                                 infinity).
    +                                 infinity).
     success
    -5> flush().
    -Shell got {ssh_cm,<0.92.0>,{data,0,0,<<"write something: ">>}}
    +5> flush().
    +Shell got {ssh_cm,<0.92.0>,{data,0,0,<<"write something: ">>}}
     ok
     % All data is sent as binaries with string contents:
    -6> ok = ssh_connection:send(ConnectionRef, ChannelId, <<"[a,b,c].">>).
    +6> ok = ssh_connection:send(ConnectionRef, ChannelId, <<"[a,b,c].">>).
     ok
    -7> flush().
    +7> flush().
     ok
     %% Nothing is received, because the io:read/1
     %% requires the input line to end with a newline.
     
     %% Send a newline (it could have been included in the last send):
    -8> ssh_connection:send(ConnectionRef, ChannelId, <<"\n">>).
    +8> ssh_connection:send(ConnectionRef, ChannelId, <<"\n">>).
     ok
    -9> flush().
    -Shell got {ssh_cm,<0.92.0>,{data,0,0,<<"{ok,[a,b,c]}">>}}
    -Shell got {ssh_cm,<0.92.0>,{exit_status,0,0}}
    -Shell got {ssh_cm,<0.92.0>,{eof,0}}
    -Shell got {ssh_cm,<0.92.0>,{closed,0}}
    +9> flush().
    +Shell got {ssh_cm,<0.92.0>,{data,0,0,<<"{ok,[a,b,c]}">>}}
    +Shell got {ssh_cm,<0.92.0>,{exit_status,0,0}}
    +Shell got {ssh_cm,<0.92.0>,{eof,0}}
    +Shell got {ssh_cm,<0.92.0>,{closed,0}}
     ok
     10>

    @@ -216,44 +216,44 @@ ssh:daemon/2,3 and exec_daemon_option() for details.

    Examples of the two ways to configure the exec evaluator:

    1. Disable one-time execution.
      To modify the daemon start example above to reject one-time execution requests, we change Step 3 by adding the -option {exec, disabled} to:
    1> ssh:start().
    +option {exec, disabled} to:
    1> ssh:start().
     ok
    -2> {ok, Sshd} = ssh:daemon(8989, [{system_dir, "/tmp/ssh_daemon"},
    -                                  {user_dir, "/tmp/otptest_user/.ssh"},
    -                                  {exec, disabled}
    /usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (471))
    --- old//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh.html	2026-06-04 19:05:17.169586925 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh.html	2026-06-04 19:05:17.169586925 +0000
    @@ -3489,14 +3489,14 @@
     
     

    List of algorithms to use in the algorithm negotiation. The default algs_list/0 can be obtained from default_algorithms/0.

    If an alg_entry() is missing in the algs_list(), the default value is used for -that entry.

    Here is an example of this option:

    	  {preferred_algorithms,
    -	  [{public_key,['ssh-rsa','ssh-dss']},
    -	  {cipher,[{client2server,['aes128-ctr']},
    -          {server2client,['aes128-cbc','3des-cbc']}]},
    -	  {mac,['hmac-sha2-256','hmac-sha1']},
    -	  {compression,[none,zlib]}
    -	  ]
    -	  }

    The example specifies different algorithms in the two directions (client2server +that entry.

    Here is an example of this option:

    	  {preferred_algorithms,
    +	  [{public_key,['ssh-rsa','ssh-dss']},
    +	  {cipher,[{client2server,['aes128-ctr']},
    +          {server2client,['aes128-cbc','3des-cbc']}]},
    +	  {mac,['hmac-sha2-256','hmac-sha1']},
    +	  {compression,[none,zlib]}
    +	  ]
    +	  }

    The example specifies different algorithms in the two directions (client2server and server2client), for cipher but specifies the same algorithms for mac and compression in both directions. The kex (key exchange) is implicit but public_key is set explicitly.

    For background and more examples see the @@ -5339,21 +5339,21 @@

    hostkey_fingerprint([DigestType], HostKey) -> [string()]hostkey_fingerprint(DigestType, HostKey) -> string()

    Calculates a ssh fingerprint from a public host key as openssh does.

    The algorithm in hostkey_fingerprint/1 is md5 to be compatible with older ssh-keygen commands. The string from the second variant is -prepended by the algorithm name in uppercase as in newer ssh-keygen commands.

    Examples:

     2> ssh:hostkey_fingerprint(Key).
    +prepended by the algorithm name in uppercase as in newer ssh-keygen commands.

    Examples:

     2> ssh:hostkey_fingerprint(Key).
      "f5:64:a6:c1:5a:cb:9f:0a:10:46:a2:5c:3e:2f:57:84"
     
    - 3> ssh:hostkey_fingerprint(md5,Key).
    + 3> ssh:hostkey_fingerprint(md5,Key).
      "MD5:f5:64:a6:c1:5a:cb:9f:0a:10:46:a2:5c:3e:2f:57:84"
     
    - 4> ssh:hostkey_fingerprint(sha,Key).
    + 4> ssh:hostkey_fingerprint(sha,Key).
      "SHA1:bSLY/C4QXLDL/Iwmhyg0PGW9UbY"
     
    - 5> ssh:hostkey_fingerprint(sha256,Key).
    + 5> ssh:hostkey_fingerprint(sha256,Key).
      "SHA256:aZGXhabfbf4oxglxltItWeHU7ub3Dc31NcNw2cMJePQ"
     
    - 6> ssh:hostkey_fingerprint([sha,sha256],Key).
    - ["SHA1:bSLY/C4QXLDL/Iwmhyg0PGW9UbY",
    -  "SHA256:aZGXhabfbf4oxglxltItWeHU7ub3Dc31NcNw2cMJePQ"]
    +
    6> ssh:hostkey_fingerprint([sha,sha256],Key). + ["SHA1:bSLY/C4QXLDL/Iwmhyg0PGW9UbY", + "SHA256:aZGXhabfbf4oxglxltItWeHU7ub3Dc31NcNw2cMJePQ"]

    @@ -5936,7 +5936,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_agent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (933)) --- old//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_agent.html 2026-06-04 19:05:17.195587166 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_agent.html 2026-06-04 19:05:17.194587157 +0000 @@ -135,11 +135,11 @@ authentication.

    Ssh_agent implements the ssh_client_key_api, to allow it to be used by setting the option key_cb when starting a client (with for example ssh:connect, -ssh:shell ).

          {key_cb, {ssh_agent, []}}

    The agent communication is established through a UNIX domain socket. By default, +ssh:shell ).

          {key_cb, {ssh_agent, []}}

    The agent communication is established through a UNIX domain socket. By default, the socket path will be fetched from the SSH_AUTH_SOCK environment variable, which is the default socket path in the agent implementation of OpenSSH.

    In order to set a different socket path the socket_path -option can be set.

          {key_cb, {ssh_agent, [{socket_path, SocketPath}]}}

    Note

    The functions are Callbacks for the SSH app. They are not intended to be +option can be set.

          {key_cb, {ssh_agent, [{socket_path, SocketPath}]}}

    Note

    The functions are Callbacks for the SSH app. They are not intended to be called from the user's code!

    @@ -567,7 +567,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_app.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (757)) --- old//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_app.html 2026-06-04 19:05:17.215587351 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_app.html 2026-06-04 19:05:17.215587351 +0000 @@ -353,7 +353,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_client_channel.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (457)) --- old//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_client_channel.html 2026-06-04 19:05:17.237587556 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_client_channel.html 2026-06-04 19:05:17.237587556 +0000 @@ -992,7 +992,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_client_key_api.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (468)) --- old//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_client_key_api.html 2026-06-04 19:05:17.259587759 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_client_key_api.html 2026-06-04 19:05:17.261587778 +0000 @@ -541,7 +541,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_connection.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (611)) --- old//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_connection.html 2026-06-04 19:05:17.288588028 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_connection.html 2026-06-04 19:05:17.288588028 +0000 @@ -2015,7 +2015,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_file.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (909)) --- old//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_file.html 2026-06-04 19:05:17.313588261 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_file.html 2026-06-04 19:05:17.313588261 +0000 @@ -1040,7 +1040,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_server_channel.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (457)) --- old//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_server_channel.html 2026-06-04 19:05:17.334588455 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_server_channel.html 2026-06-04 19:05:17.334588455 +0000 @@ -387,7 +387,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_server_key_api.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_server_key_api.html 2026-06-04 19:05:17.354588641 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_server_key_api.html 2026-06-04 19:05:17.355588650 +0000 @@ -331,7 +331,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_sftp.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (338)) --- old//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_sftp.html 2026-06-04 19:05:17.390588975 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_sftp.html 2026-06-04 19:05:17.391588984 +0000 @@ -2920,7 +2920,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_sftpd.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_sftpd.html 2026-06-04 19:05:17.411589169 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/ssh_sftpd.html 2026-06-04 19:05:17.411589169 +0000 @@ -255,7 +255,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/terminology.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (316)) --- old//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/terminology.html 2026-06-04 19:05:17.428589327 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/terminology.html 2026-06-04 19:05:17.428589327 +0000 @@ -247,7 +247,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/using_ssh.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (956)) --- old//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/using_ssh.html 2026-06-04 19:05:17.455589578 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/ssh-5.2.11.4/doc/html/using_ssh.html 2026-06-04 19:05:17.455589578 +0000 @@ -140,9 +140,9 @@ Using the Erlang ssh Terminal Client

    The user otptest, which has bash as default shell, uses the ssh:shell/1 -client to connect to the OpenSSH daemon running on a host called ssh.example.com:

    1> ssh:start().
    +client to connect to the OpenSSH daemon running on a host called ssh.example.com:

    1> ssh:start().
     ok
    -2> {ok, S} = ssh:shell("ssh.example.com").
    +2> {ok, S} = ssh:shell("ssh.example.com").
     otptest@ssh.example.com:> pwd
     /home/otptest
     otptest@ssh.example.com:> exit
    @@ -161,11 +161,11 @@
     [...]
     $bash> ssh-keygen -t rsa -f /tmp/otptest_user/.ssh/id_rsa
     [...]

    Step 2. Create the file /tmp/otptest_user/.ssh/authorized_keys and add the -content of /tmp/otptest_user/.ssh/id_rsa.pub.

    Step 3. Start the Erlang ssh daemon:

    1> ssh:start().
    +content of /tmp/otptest_user/.ssh/id_rsa.pub.

    Step 3. Start the Erlang ssh daemon:

    1> ssh:start().
     ok
    -2> {ok, Sshd} = ssh:daemon(8989, [{system_dir, "/tmp/ssh_daemon"},
    -                                  {user_dir, "/tmp/otptest_user/.ssh"}]).
    -{ok,<0.54.0>}
    +2> {ok, Sshd} = ssh:daemon(8989, [{system_dir, "/tmp/ssh_daemon"},
    +                                  {user_dir, "/tmp/otptest_user/.ssh"}]).
    +{ok,<0.54.0>}
     3>

    Step 4. Use the OpenSSH client from a shell to connect to the Erlang ssh daemon:

    $bash> ssh ssh.example.com -p 8989  -i /tmp/otptest_user/.ssh/id_rsa \
                       -o UserKnownHostsFile=/tmp/otptest_user/.ssh/known_hosts
    @@ -176,10 +176,10 @@
     Eshell V5.10  (abort with ^G)
     1>

    There are two ways of shutting down an ssh daemon, see Step 5a and Step 5b.

    Step 5a. Shut down the Erlang ssh daemon so that it stops the listener but -leaves existing connections, started by the listener, operational:

    3> ssh:stop_listener(Sshd).
    +leaves existing connections, started by the listener, operational:

    3> ssh:stop_listener(Sshd).
     ok
     4>

    Step 5b. Shut down the Erlang ssh daemon so that it stops the listener and -all connections started by the listener:

    3> ssh:stop_daemon(Sshd).
    +all connections started by the listener:

    3> ssh:stop_daemon(Sshd).
     ok
     4>

    @@ -195,35 +195,35 @@

    In the following example, the Erlang shell is the client process that receives the channel replies as Erlang messages.

    Do an one-time execution of a remote OS command ("pwd") over ssh to the ssh -server of the OS at the host "ssh.example.com":

    1> ssh:start().
    +server of the OS at the host "ssh.example.com":

    1> ssh:start().
     ok
    -2> {ok, ConnectionRef} = ssh:connect("ssh.example.com", 22, []).
    -{ok,<0.57.0>}
    -3> {ok, ChannelId} = ssh_connection:session_channel(ConnectionRef, infinity).
    -{ok,0}
    -4> success = ssh_connection:exec(ConnectionRef, ChannelId, "pwd", infinity).
    -5> flush(). % Get all pending messages. NOTE: ordering may vary!
    -Shell got {ssh_cm,<0.57.0>,{data,0,0,<<"/home/otptest\n">>}}
    -Shell got {ssh_cm,<0.57.0>,{eof,0}}
    -Shell got {ssh_cm,<0.57.0>,{exit_status,0,0}}
    -Shell got {ssh_cm,<0.57.0>,{closed,0}}
    +2> {ok, ConnectionRef} = ssh:connect("ssh.example.com", 22, []).
    +{ok,<0.57.0>}
    +3> {ok, ChannelId} = ssh_connection:session_channel(ConnectionRef, infinity).
    +{ok,0}
    +4> success = ssh_connection:exec(ConnectionRef, ChannelId, "pwd", infinity).
    +5> flush(). % Get all pending messages. NOTE: ordering may vary!
    +Shell got {ssh_cm,<0.57.0>,{data,0,0,<<"/home/otptest\n">>}}
    +Shell got {ssh_cm,<0.57.0>,{eof,0}}
    +Shell got {ssh_cm,<0.57.0>,{exit_status,0,0}}
    +Shell got {ssh_cm,<0.57.0>,{closed,0}}
     ok
    -6> ssh:connection_info(ConnectionRef, channels).
    -{channels,[]}
    +6> ssh:connection_info(ConnectionRef, channels).
    +{channels,[]}
     7>

    See ssh_connection and ssh_connection:exec/4 for finding documentation of the channel messages.

    To collect the channel messages in a program, use receive...end instead of flush/1:

    5> receive
    -5>     {ssh_cm, ConnectionRef, {data, ChannelId, Type, Result}} when Type == 0 ->
    -5>         {ok,Result}
    -5>     {ssh_cm, ConnectionRef, {data, ChannelId, Type, Result}} when Type == 1 ->
    -5>         {error,Result}
    +5>     {ssh_cm, ConnectionRef, {data, ChannelId, Type, Result}} when Type == 0 ->
    +5>         {ok,Result}
    +5>     {ssh_cm, ConnectionRef, {data, ChannelId, Type, Result}} when Type == 1 ->
    +5>         {error,Result}
     5> end.
    -{ok,<<"/home/otptest\n">>}
    +{ok,<<"/home/otptest\n">>}
     6>

    Note that only the exec channel is closed after the one-time execution. The connection is still up and can handle previously opened channels. It is also possible to open a new channel:

    % try to open a new channel to check if the ConnectionRef is still open
    -7> {ok, NewChannelId} = ssh_connection:session_channel(ConnectionRef, infinity).
    -{ok,1}
    +7> {ok, NewChannelId} = ssh_connection:session_channel(ConnectionRef, infinity).
    +{ok,1}
     8>

    To close the connection, call the function ssh:close(ConnectionRef). As an alternative, set the option {idle_time, 1} when opening the @@ -238,23 +238,23 @@ "command" must be as if entered into the erlang shell, that is a sequence of Erlang expressions ended by a period (.). Variables bound in that sequence will keep their bindings throughout the expression -sequence. The bindings are disposed when the result is returned.

    Here is an example of a suitable expression sequence:

    A=1, B=2, 3 == (A + B).

    It evaluates to true if submitted to the Erlang daemon started in +sequence. The bindings are disposed when the result is returned.

    Here is an example of a suitable expression sequence:

    A=1, B=2, 3 == (A + B).

    It evaluates to true if submitted to the Erlang daemon started in Step 3 above:

    $bash> ssh ssh.example.com -p 8989 "A=1, B=2, 3 == (A + B)."
     true
     $bash>

    The same example but now using the Erlang ssh client to contact the Erlang -server:

    1> {ok, ConnectionRef} = ssh:connect("ssh.example.com", 8989, []).
    -{ok,<0.216.0>}
    -2> {ok, ChannelId} = ssh_connection:session_channel(ConnectionRef, infinity).
    -{ok,0}
    -3> success = ssh_connection:exec(ConnectionRef, ChannelId,
    +server:

    1> {ok, ConnectionRef} = ssh:connect("ssh.example.com", 8989, []).
    +{ok,<0.216.0>}
    +2> {ok, ChannelId} = ssh_connection:session_channel(ConnectionRef, infinity).
    +{ok,0}
    +3> success = ssh_connection:exec(ConnectionRef, ChannelId,
                                      "A=1, B=2, 3 == (A + B).",
    -                                 infinity).
    +                                 infinity).
     success
    -4> flush().
    -Shell got {ssh_cm,<0.216.0>,{data,0,0,<<"true">>}}
    -Shell got {ssh_cm,<0.216.0>,{exit_status,0,0}}
    -Shell got {ssh_cm,<0.216.0>,{eof,0}}
    -Shell got {ssh_cm,<0.216.0>,{closed,0}}
    +4> flush().
    +Shell got {ssh_cm,<0.216.0>,{data,0,0,<<"true">>}}
    +Shell got {ssh_cm,<0.216.0>,{exit_status,0,0}}
    +Shell got {ssh_cm,<0.216.0>,{eof,0}}
    +Shell got {ssh_cm,<0.216.0>,{closed,0}}
     ok
     5>

    Note that Erlang shell specific functions and control sequences like for example h(). are not supported.

    @@ -275,36 +275,36 @@ write something: [a,b,c]. {ok,[a,b,c]} $bash>

    The same example but using the Erlang ssh client:

    
    -Eshell V10.5.2  (abort with ^G)
    -1> ssh:start().
    +Eshell V10.5.2  (abort with ^G)
    +1> ssh:start().
     ok
    -2> {ok, ConnectionRef} = ssh:connect(loopback, 8989, []).
    -{ok,<0.92.0>}
    -3> {ok, ChannelId} = ssh_connection:session_channel(ConnectionRef, infinity).
    -{ok,0}
    -4> success = ssh_connection:exec(ConnectionRef, ChannelId,
    +2> {ok, ConnectionRef} = ssh:connect(loopback, 8989, []).
    +{ok,<0.92.0>}
    +3> {ok, ChannelId} = ssh_connection:session_channel(ConnectionRef, infinity).
    +{ok,0}
    +4> success = ssh_connection:exec(ConnectionRef, ChannelId,
                                      "io:read(\"write something: \").",
    -                                 infinity).
    +                                 infinity).
     success
    -5> flush().
    -Shell got {ssh_cm,<0.92.0>,{data,0,0,<<"write something: ">>}}
    +5> flush().
    +Shell got {ssh_cm,<0.92.0>,{data,0,0,<<"write something: ">>}}
     ok
     % All data is sent as binaries with string contents:
    -6> ok = ssh_connection:send(ConnectionRef, ChannelId, <<"[a,b,c].">>).
    +6> ok = ssh_connection:send(ConnectionRef, ChannelId, <<"[a,b,c].">>).
     ok
    -7> flush().
    +7> flush().
     ok
     %% Nothing is received, because the io:read/1
     %% requires the input line to end with a newline.
     
     %% Send a newline (it could have been included in the last send):
    -8> ssh_connection:send(ConnectionRef, ChannelId, <<"\n">>).
    +8> ssh_connection:send(ConnectionRef, ChannelId, <<"\n">>).
     ok
    -9> flush().
    -Shell got {ssh_cm,<0.92.0>,{data,0,0,<<"{ok,[a,b,c]}">>}}
    -Shell got {ssh_cm,<0.92.0>,{exit_status,0,0}}
    -Shell got {ssh_cm,<0.92.0>,{eof,0}}
    -Shell got {ssh_cm,<0.92.0>,{closed,0}}
    +9> flush().
    +Shell got {ssh_cm,<0.92.0>,{data,0,0,<<"{ok,[a,b,c]}">>}}
    +Shell got {ssh_cm,<0.92.0>,{exit_status,0,0}}
    +Shell got {ssh_cm,<0.92.0>,{eof,0}}
    +Shell got {ssh_cm,<0.92.0>,{closed,0}}
     ok
     10>

    @@ -321,44 +321,44 @@ ssh:daemon/2,3 and exec_daemon_option() for details.

    Examples of the two ways to configure the exec evaluator:

    1. Disable one-time execution.
      To modify the daemon start example above to reject one-time execution requests, we change Step 3 by adding the -option {exec, disabled} to:
    1> ssh:start().
    +option {exec, disabled} to:
    1> ssh:start().
     ok
    -2> {ok, Sshd} = ssh:daemon(8989, [{system_dir, "/tmp/ssh_daemon"},
    -                                  {user_dir, "/tmp/otptest_user/.ssh"},
    -                                  {exec, disabled}
    /usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/404.html differs (HTML document, Unicode text, UTF-8 text)
    --- old//usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/404.html	2026-06-04 19:05:17.473986573 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/404.html	2026-06-04 19:05:17.473986573 +0000
    @@ -147,7 +147,7 @@
               Erlang programming language
     
           

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/api-reference.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/api-reference.html 2026-06-04 19:05:17.490589902 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/api-reference.html 2026-06-04 19:05:17.489589893 +0000 @@ -213,7 +213,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/notes.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (2379)) --- old//usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/notes.html 2026-06-04 19:05:17.532590292 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/notes.html 2026-06-04 19:05:17.533590301 +0000 @@ -3381,7 +3381,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/search.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/search.html 2026-06-04 19:05:17.552942363 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/search.html 2026-06-04 19:05:17.552942363 +0000 @@ -145,7 +145,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/ssl.epub/OEBPS/content.opf differs (XML 1.0 document, ASCII text) --- old//usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/ssl.epub/OEBPS/content.opf 2026-06-04 00:08:33.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/ssl.epub/OEBPS/content.opf 2042-07-06 13:27:57.000000000 +0000 @@ -4,10 +4,10 @@ version="3.0"> ssl - 11.2.5 - urn:uuid:ec72e6ce-cb9c-7d18-c16d-78908bd84244 + urn:uuid:5198387e-a253-73d1-0694-23d7876a740f en - 2026-06-04T00:08:33Z + 2042-07-06T13:27:57Z /usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/ssl.epub/OEBPS/ssl_distribution.xhtml differs (HTML document, ASCII text, with very long lines (944)) --- old//usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/ssl.epub/OEBPS/ssl_distribution.xhtml 2026-06-04 00:08:33.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/ssl.epub/OEBPS/ssl_distribution.xhtml 2042-07-06 13:27:57.000000000 +0000 @@ -42,14 +42,14 @@ applications. Such a script is located in the bin directory of the Erlang distribution. The source for the script is found under the Erlang installation top directory under releases/<OTP version>/start_clean.rel.

    Do the following:

    • Copy that script to another location (and preferably another name).
    • Add the applications Crypto, Public Key, and SSL with their current version -numbers after the STDLIB application.

    The following shows an example .rel file with TLS added:

          {release, {"OTP  APN 181 01","R15A"}, {erts, "5.9"},
    -      [{kernel,"2.15"},
    -      {stdlib,"1.18"},
    -      {crypto, "2.0.3"},
    -      {public_key, "0.12"},
    -      {asn1, "4.0"},
    -      {ssl, "5.0"}
    -      ]}.

    The version numbers differ in your system. Whenever one of the applications +numbers after the STDLIB application.

    The following shows an example .rel file with TLS added:

          {release, {"OTP  APN 181 01","R15A"}, {erts, "5.9"},
    +      [{kernel,"2.15"},
    +      {stdlib,"1.18"},
    +      {crypto, "2.0.3"},
    +      {public_key, "0.12"},
    +      {asn1, "4.0"},
    +      {ssl, "5.0"}
    +      ]}.

    The version numbers differ in your system. Whenever one of the applications included in the script is upgraded, change the script.

    Do the following:

    • Build the boot script.

      Assuming the .rel file is stored in a file start_ssl.rel in the current directory, a boot script can be built as follows:

       1> systools:make_script("start_ssl",[]).

    There is now a start_ssl.boot file in the current directory.

    Do the following:

    • Test the boot script. To do this, start Erlang with the -boot command-line parameter specifying this boot script (with its full path, but without the @@ -96,10 +96,10 @@ so beware!

    For TLS to work, at least a public key and a certificate must be specified for the server side and the client needs to specify CAs that it trusts (client certification is optional and requires more configuration).

    In the following example (to keep it simple), the PEM file "/home/me/ssl/erlserver.pem" -contains both the server certificate and its private key .

    Create a file named for example "/home/me/ssl/ssl_test@myhost.conf":

    [{server,
    -  [{certfile, "/home/me/ssl/erlserver.pem"}]},
    - {client,
    -  [{cacertfile, "/home/me/ssl/client_trusted.pem"}]}].

    And then start the node like this (line breaks in the command are for +contains both the server certificate and its private key .

    Create a file named for example "/home/me/ssl/ssl_test@myhost.conf":

    [{server,
    +  [{certfile, "/home/me/ssl/erlserver.pem"}]},
    + {client,
    +  [{cacertfile, "/home/me/ssl/client_trusted.pem"}]}].

    And then start the node like this (line breaks in the command are for readability, and shall not be there when typed):

    $ erl -boot /home/me/ssl/start_ssl -proto_dist inet_tls
       -ssl_dist_optfile "/home/me/ssl/ssl_test@myhost.conf"
       -sname ssl_test

    The options in the {server, Opts} tuple are used when calling @@ -169,19 +169,19 @@ -ssl_dist_opt server_secure_renegotiate true client_secure_renegotiate true" $ export ERL_FLAGS $ erl -sname ssl_test -Erlang (BEAM) emulator version 5.0 [source] +Erlang (BEAM) emulator version 5.0 [source] -Eshell V5.0 (abort with ^G) -(ssl_test@myhost)1> init:get_arguments(). -[{root,["/usr/local/erlang"]}, - {progname,["erl "]}, - {sname,["ssl_test"]}, - {boot,["/home/me/ssl/start_ssl"]}, - {proto_dist,["inet_tls"]}, - {ssl_dist_opt,["server_certfile","/home/me/ssl/erlserver.pem"]}, - {ssl_dist_opt,["server_secure_renegotiate","true", - "client_secure_renegotiate","true"] - {home,["/home/me"]}]

    The init:get_arguments() call verifies that the correct arguments are supplied +Eshell V5.0 (abort with ^G) +(ssl_test@myhost)1> init:get_arguments(). +[{root,["/usr/local/erlang"]}, + {progname,["erl "]}, + {sname,["ssl_test"]}, + {boot,["/home/me/ssl/start_ssl"]}, + {proto_dist,["inet_tls"]}, + {ssl_dist_opt,["server_certfile","/home/me/ssl/erlserver.pem"]}, + {ssl_dist_opt,["server_secure_renegotiate","true", + "client_secure_renegotiate","true"] + {home,["/home/me"]}]

    The init:get_arguments() call verifies that the correct arguments are supplied to the emulator.

    /usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/ssl.epub/OEBPS/ssl.xhtml differs (HTML document, ASCII text, with very long lines (1029)) --- old//usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/ssl.epub/OEBPS/ssl.xhtml 2026-06-04 00:08:33.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/ssl.epub/OEBPS/ssl.xhtml 2042-07-06 13:27:57.000000000 +0000 @@ -26,9 +26,9 @@

    Interface functions for TLS (Transport Layer Security) and DTLS (Datagram Transport Layer Security).

    Note

    The application's name is still SSL because the first versions of the TLS protocol were named SSL (Secure Socket Layer). However, no version -of the old SSL protocol is supported by this application.

    Example:

    1> ssl:start(), ssl:connect("google.com", 443, [{verify, verify_peer},
    -    {cacerts, public_key:cacerts_get()}]).
    -{ok,{sslsocket, [...]}}

    See Examples for detailed usage and more examples of +of the old SSL protocol is supported by this application.

    Example:

    1> ssl:start(), ssl:connect("google.com", 443, [{verify, verify_peer},
    +    {cacerts, public_key:cacerts_get()}]).
    +{ok,{sslsocket, [...]}}

    See Examples for detailed usage and more examples of this API.

    Special Erlang node configuration for the application can be found in SSL Application.

    @@ -2410,26 +2410,26 @@ signature schemes supplied by the signature_algs_cert option.

    The TLS-1.2 default is Default_TLS_12_Alg_Pairs interleaved with rsa_pss_schemes since ssl-11.0 (Erlang/OTP 25). pss_pss is -preferred over pss_rsae, which in turn is preferred over rsa.

    The list for Default_TLS_12_Alg_Pairs is defined as follows:

    [
    -{sha512, ecdsa},
    -{sha512, rsa},
    -{sha384, ecdsa},
    -{sha384, rsa},
    -{sha256, ecdsa},
    -{sha256, rsa}
    -]

    Change

    • Support for {md5, rsa} was removed from the TLS-1.2 default in +preferred over pss_rsae, which in turn is preferred over rsa.

      The list for Default_TLS_12_Alg_Pairs is defined as follows:

      [
      +{sha512, ecdsa},
      +{sha512, rsa},
      +{sha384, ecdsa},
      +{sha384, rsa},
      +{sha256, ecdsa},
      +{sha256, rsa}
      +]

      Change

      • Support for {md5, rsa} was removed from the TLS-1.2 default in ssl-8.0 (Erlang/OTP 22).
      • Support for {sha, _} (SHA1) and {sha224, _} was removed -from the TLS-1.2 default in ssl-11.0 (Erlang/OTP 26).

      The list for rsa_pss_schemes is defined as follows:

      [rsa_pss_pss_sha512,
      +from the TLS-1.2 default in ssl-11.0 (Erlang/OTP 26).

    The list for rsa_pss_schemes is defined as follows:

    [rsa_pss_pss_sha512,
     rsa_pss_pss_sha384,
     rsa_pss_pss_sha256,
     rsa_pss_rsae_sha512,
     rsa_pss_rsae_sha384,
    -rsa_pss_rsae_sha256]

    The list of TLS_13_Legacy_Schemes is defined as follows:

    [
    +rsa_pss_rsae_sha256]

    The list of TLS_13_Legacy_Schemes is defined as follows:

    [
     %% Legacy algorithms only applicable to certificate signatures
     rsa_pkcs1_sha512, %% Corresponds to {sha512, rsa}
     rsa_pkcs1_sha384, %% Corresponds to {sha384, rsa}
     rsa_pkcs1_sha256, %% Corresponds to {sha256, rsa}
    -]

    The list of Default_TLS_13_Schemes is defined as follows:

    [
    +]

    The list of Default_TLS_13_Schemes is defined as follows:

    [
     %% EDDSA
     eddsa_ed25519,
     eddsa_ed448
    @@ -2514,8 +2514,8 @@
     
           
     
    -

    Claim an intermediate CA in the chain as trusted.

    fun(Chain::[public_key:der_encoded()]) ->
    -      {trusted_ca, DerCert::public_key:der_encoded()} | unknown_ca.

    TLS then uses public_key:pkix_path_validation/3 with the selected CA +

    Claim an intermediate CA in the chain as trusted.

    fun(Chain::[public_key:der_encoded()]) ->
    +      {trusted_ca, DerCert::public_key:der_encoded()} | unknown_ca.

    TLS then uses public_key:pkix_path_validation/3 with the selected CA as the trusted anchor and verifies the rest of the chain.

    @@ -2957,7 +2957,7 @@ being sent and disables the hostname verification check.

  • {customize_hostname_check, HostNameCheckOpts} - Customization option

    Customizes the hostname verification of the peer certificate, as various protocols that use TLS, such as HTTP or LDAP, may require different approaches. For example, here is how to use standard hostname checking for HTTPS implemented in -Public_Key:

    {customize_hostname_check, [{match_fun, public_key:pkix_verify_hostname_match_fun(https)}]}

    For futher description of the customize options, see +Public_Key:

    {customize_hostname_check, [{match_fun, public_key:pkix_verify_hostname_match_fun(https)}]}

    For futher description of the customize options, see public_key:pkix_verify_hostname/3.

  • {client_certificate_authorities, UseCertAuth} - Inter-op hint option

    If UseCertAuth is set to true, sends the certificate authorities extension in the TLS-1.3 client hello. The default is false. Note that setting UseCertAuth to true can result in a significant @@ -3101,7 +3101,7 @@

    Options only relevant for TLS-1.3.

    • {session_tickets, SessionTickets} - Use of session tickets

      Configures the session ticket functionality. Allowed values are disabled, manual, and auto. If it is set to manual the client will send the ticket -information to user process in a 3-tuple:

      {ssl, session_ticket, {SNI, TicketData}}

      where SNI is the ServerNameIndication and TicketData is the extended ticket +information to user process in a 3-tuple:

      {ssl, session_ticket, {SNI, TicketData}}

      where SNI is the ServerNameIndication and TicketData is the extended ticket data that can be used in subsequent session resumptions.

      If it is set to auto, the client automatically handles received tickets and tries to use them when making new TLS connections (session resumption with pre-shared keys).

      Ticket lifetime, the number of tickets sent by the server, and the @@ -3111,7 +3111,7 @@ mandatory option in manual mode ({session_tickets, manual}).

      Note

      Session tickets are only sent to the user if option session_tickets is set to manual

      This option is supported by TLS-1.3. See also SSL User's Guide, Session Tickets and Session Resumption in TLS 1.3.

    • {early_data, EarlyData}

      Configures the early data to be sent by the client.

      To verify that the server has the intention to process the early -data, the following tuple is sent to the user process:

      {ssl, SslSocket, {early_data, Result}}

      where Result is either accepted or rejected.

      Warning

      It is the responsibility of the user to handle rejected EarlyData and to +data, the following tuple is sent to the user process:

      {ssl, SslSocket, {early_data, Result}}

      where Result is either accepted or rejected.

      Warning

      It is the responsibility of the user to handle rejected EarlyData and to resend when appropriate.

    • {middlebox_comp_mode, MiddleBoxMode}

      Configures the middlebox compatibility mode for a TLS-1.3 connection.

      A significant number of middleboxes misbehave when a TLS-1.3 connection is negotiated. Implementations can increase the chance of making connections through those middleboxes by adapting the TLS-1.3 @@ -3519,20 +3519,20 @@ peer certificate in a valid certification path. So, if depth is 0 the PEER must be signed by the trusted ROOT-CA directly; if 1 the path can be PEER, CA, ROOT-CA; if 2 the path can be PEER, CA, CA, ROOT-CA, and so on. The default -value is 10. Used to mitigate DoS attack possibilities.

    • {verify_fun, Verify} - Customize certificate path validation

      The verification fun is to be defined as follows:

      fun(OtpCert :: #'OTPCertificate'{},
      -    Event, InitialUserState :: term()) ->
      -  {valid, UserState :: term()} |
      -  {fail, Reason :: term()} | {unknown, UserState :: term()}.
      -
      -fun(OtpCert :: #'OTPCertificate'{}, DerCert :: public_key:der_encoded(),
      -    Event, InitialUserState :: term()) ->
      -  {valid, UserState :: term()} |
      -  {fail, Reason :: term()} | {unknown, UserState :: term()}.
      +value is 10. Used to mitigate DoS attack possibilities.

    • {verify_fun, Verify} - Customize certificate path validation

      The verification fun is to be defined as follows:

      fun(OtpCert :: #'OTPCertificate'{},
      +    Event, InitialUserState :: term()) ->
      +  {valid, UserState :: term()} |
      +  {fail, Reason :: term()} | {unknown, UserState :: term()}.
      +
      +fun(OtpCert :: #'OTPCertificate'{}, DerCert :: public_key:der_encoded(),
      +    Event, InitialUserState :: term()) ->
      +  {valid, UserState :: term()} |
      +  {fail, Reason :: term()} | {unknown, UserState :: term()}.
       
       Types:
      -      Event = {bad_cert, Reason :: atom() |
      -              {revoked, atom()}} |
      -      {extension, #'Extension'{}} |
      +      Event = {bad_cert, Reason :: atom() |
      +              {revoked, atom()}} |
      +      {extension, #'Extension'{}} |
                     valid |
                     valid_peer

      The verification fun is called during the X.509-path validation when an error occurs or an extension unknown to the SSL application is @@ -3549,25 +3549,25 @@ handshake does not terminate regardless of verification failures, and the connection is established.

    • If called with an extension unknown to the user application, the fun is to return {unknown, UserState}.

    Note that if the fun returns unknown for an extension marked as critical, -validation will fail.

    Default option verify_fun in verify_peer mode:

    {fun(_, _, {bad_cert, _} = Reason, _) ->
    -   {fail, Reason};
    -    (_, _, {extension, _}, UserState) ->
    -   {unknown, UserState};
    -    (_, _, valid, UserState) ->
    -   {valid, UserState};
    -    (_, _, valid_peer, UserState) ->
    -       {valid, UserState}
    - end, []}

    Default option verify_fun in mode verify_none:

     {fun(_, _, {bad_cert, _}, UserState) ->
    -   {valid, UserState};
    -    (_, _, {extension, #'Extension'{critical = true}}, UserState) ->
    -   {valid, UserState};
    -    (_, _, {extension, _}, UserState) ->
    -   {unknown, UserState};
    -    (_, _, valid, UserState) ->
    -   {valid, UserState};
    -    (_, _, valid_peer, UserState) ->
    -       {valid, UserState}
    - end, []}

    The possible path validation errors are given in the form {bad_cert, Reason}, +validation will fail.

    Default option verify_fun in verify_peer mode:

    {fun(_, _, {bad_cert, _} = Reason, _) ->
    +   {fail, Reason};
    +    (_, _, {extension, _}, UserState) ->
    +   {unknown, UserState};
    +    (_, _, valid, UserState) ->
    +   {valid, UserState};
    +    (_, _, valid_peer, UserState) ->
    +       {valid, UserState}
    + end, []}

    Default option verify_fun in mode verify_none:

     {fun(_, _, {bad_cert, _}, UserState) ->
    +   {valid, UserState};
    +    (_, _, {extension, #'Extension'{critical = true}}, UserState) ->
    +   {valid, UserState};
    +    (_, _, {extension, _}, UserState) ->
    +   {unknown, UserState};
    +    (_, _, valid, UserState) ->
    +   {valid, UserState};
    +    (_, _, valid_peer, UserState) ->
    +       {valid, UserState}
    + end, []}

    The possible path validation errors are given in the form {bad_cert, Reason}, where Reason is:

  • The init:get_arguments() call verifies that the correct arguments are supplied +Eshell V5.0 (abort with ^G) +(ssl_test@myhost)1> init:get_arguments(). +[{root,["/usr/local/erlang"]}, + {progname,["erl "]}, + {sname,["ssl_test"]}, + {boot,["/home/me/ssl/start_ssl"]}, + {proto_dist,["inet_tls"]}, + {ssl_dist_opt,["server_certfile","/home/me/ssl/erlserver.pem"]}, + {ssl_dist_opt,["server_secure_renegotiate","true", + "client_secure_renegotiate","true"] + {home,["/home/me"]}]

    The init:get_arguments() call verifies that the correct arguments are supplied to the emulator.

    @@ -338,7 +338,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/ssl_protocol.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/ssl_protocol.html 2026-06-04 19:05:17.806592834 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/ssl_protocol.html 2026-06-04 19:05:17.807592843 +0000 @@ -279,7 +279,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/ssl_session_cache_api.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/ssl_session_cache_api.html 2026-06-04 19:05:17.826593019 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/ssl_session_cache_api.html 2026-06-04 19:05:17.826593019 +0000 @@ -723,7 +723,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/standards_compliance.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (55562)) --- old//usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/standards_compliance.html 2026-06-04 19:05:17.849593233 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/standards_compliance.html 2026-06-04 19:05:17.849593233 +0000 @@ -260,7 +260,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/using_ssl.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (2124)) --- old//usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/using_ssl.html 2026-06-04 19:05:17.880593520 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/ssl-11.2.5/doc/html/using_ssl.html 2026-06-04 19:05:17.882593539 +0000 @@ -149,38 +149,38 @@ Basic Client -
     1 > ssl:start(), ssl:connect("google.com", 443, [{verify, verify_peer},
    -                                                 {cacerts, public_key:cacerts_get()}]).
    -   {ok,{sslsocket, [...]}}

    +
     1 > ssl:start(), ssl:connect("google.com", 443, [{verify, verify_peer},
    +                                                 {cacerts, public_key:cacerts_get()}]).
    +   {ok,{sslsocket, [...]}}

    Basic Connection

    -

    Step 1: Start the server side:

    1 server> ssl:start().
    +

    Step 1: Start the server side:

    1 server> ssl:start().
     ok

    Step 2: with alternative certificates, in this example the EDDSA certificate will be preferred if TLS-1.3 is negotiated and the RSA certificate will always -be used for TLS-1.2 as it does not support the EDDSA algorithm:

    2 server> {ok, ListenSocket} =
    -ssl:listen(9999, [{certs_keys, [#{certfile => "eddsacert.pem",
    -                                  keyfile => "eddsakey.pem"},
    -                                #{certfile => "rsacert.pem",
    +be used for TLS-1.2 as it does not support the EDDSA algorithm:

    2 server> {ok, ListenSocket} =
    +ssl:listen(9999, [{certs_keys, [#{certfile => "eddsacert.pem",
    +                                  keyfile => "eddsakey.pem"},
    +                                #{certfile => "rsacert.pem",
                                       keyfile => "rsakey.pem",
    -                                  password => "foobar"}
    -                               ]},{reuseaddr, true}]).
    -{ok,{sslsocket, [...]}}

    Step 3: Do a transport accept on the TLS listen socket:

    3 server> {ok, TLSTransportSocket} = ssl:transport_accept(ListenSocket).
    -{ok,{sslsocket, [...]}}

    Note

    ssl:transport_accept/1 and ssl:handshake/2 are separate functions so that the + password => "foobar"} + ]},{reuseaddr, true}]). +{ok,{sslsocket, [...]}}

    Step 3: Do a transport accept on the TLS listen socket:

    3 server> {ok, TLSTransportSocket} = ssl:transport_accept(ListenSocket).
    +{ok,{sslsocket, [...]}}

    Note

    ssl:transport_accept/1 and ssl:handshake/2 are separate functions so that the handshake part can be called in a new erlang process dedicated to handling the -connection

    Step 4: Start the client side:

    1 client> ssl:start().
    +connection

    Step 4: Start the client side:

    1 client> ssl:start().
     ok

    Be sure to configure trusted certificates to use for server certificate -verification.

    2 client> {ok, Socket} = ssl:connect("localhost", 9999,
    -      [{verify, verify_peer},
    -      {cacertfile, "cacerts.pem"}, {active, once}], infinity).
    -{ok,{sslsocket, [...]}}

    Step 5: Do the TLS handshake:

    4 server> {ok, Socket} = ssl:handshake(TLSTransportSocket).
    -{ok,{sslsocket, [...]}}

    Note

    A real server should use ssl:handshake/2 that has a timeout to avoid DoS -attacks. In the example the timeout defaults to infinty.

    Step 6: Send a message over TLS:

    5 server> ssl:send(Socket, "foo").
    +verification.

    2 client> {ok, Socket} = ssl:connect("localhost", 9999,
    +      [{verify, verify_peer},
    +      {cacertfile, "cacerts.pem"}, {active, once}], infinity).
    +{ok,{sslsocket, [...]}}

    Step 5: Do the TLS handshake:

    4 server> {ok, Socket} = ssl:handshake(TLSTransportSocket).
    +{ok,{sslsocket, [...]}}

    Note

    A real server should use ssl:handshake/2 that has a timeout to avoid DoS +attacks. In the example the timeout defaults to infinty.

    Step 6: Send a message over TLS:

    5 server> ssl:send(Socket, "foo").
     ok

    Step 7: Flush the shell message queue to see that the message sent on the -server side is recived by the client side:

    3 client> flush().
    -Shell got {ssl,{sslsocket,[...]},"foo"}
    +server side is recived by the client side:

    3 client> flush().
    +Shell got {ssl,{sslsocket,[...]},"foo"}
     ok

    @@ -192,27 +192,27 @@ communication channel by using TLS. Note that the client and server need to agree to do the upgrade in the protocol doing the communication. This is concept is often referenced as STARTLS and used in many protocols such as SMTP, -FTPS and HTTPS via a proxy.

    Warning

    Maximum security recommendations are however moving away from such solutions.

    To upgrade to a TLS connection:

    Step 1: Start the server side:

    1 server> ssl:start().
    +FTPS and HTTPS via a proxy.

    Warning

    Maximum security recommendations are however moving away from such solutions.

    To upgrade to a TLS connection:

    Step 1: Start the server side:

    1 server> ssl:start().
       ok

    Step 2: Create a normal TCP listen socket and ensure active is set to false and not set to any active mode otherwise TLS handshake messages can be -delivered to the wrong process.

    2 server> {ok, ListenSocket} = gen_tcp:listen(9999, [{reuseaddr, true},
    -  {active, false}]).
    -  {ok, #Port<0.475>}

    Step 3: Accept client connection:

    3 server> {ok, Socket} = gen_tcp:accept(ListenSocket).
    -  {ok, #Port<0.476>}

    Step 4: Start the client side:

    1 client> ssl:start().
    -  ok
    2 client> {ok, Socket} = gen_tcp:connect("localhost", 9999,  [], infinity).

    Step 5: Do the TLS handshake:

    4 server> {ok, TLSSocket} = ssl:handshake(Socket, [{verify, verify_peer},
    -  {fail_if_no_peer_cert, true},
    -  {cacertfile, "cacerts.pem"},
    -  {certs_keys, [#{certfile => "cert.pem", keyfile => "key.pem"}]}]).
    -  {ok,{sslsocket,[...]}}

    Step 6: Upgrade to a TLS connection. The client and server must agree upon the +delivered to the wrong process.

    2 server> {ok, ListenSocket} = gen_tcp:listen(9999, [{reuseaddr, true},
    +  {active, false}]).
    +  {ok, #Port<0.475>}

    Step 3: Accept client connection:

    3 server> {ok, Socket} = gen_tcp:accept(ListenSocket).
    +  {ok, #Port<0.476>}

    Step 4: Start the client side:

    1 client> ssl:start().
    +  ok
    2 client> {ok, Socket} = gen_tcp:connect("localhost", 9999,  [], infinity).

    Step 5: Do the TLS handshake:

    4 server> {ok, TLSSocket} = ssl:handshake(Socket, [{verify, verify_peer},
    +  {fail_if_no_peer_cert, true},
    +  {cacertfile, "cacerts.pem"},
    +  {certs_keys, [#{certfile => "cert.pem", keyfile => "key.pem"}]}]).
    +  {ok,{sslsocket,[...]}}

    Step 6: Upgrade to a TLS connection. The client and server must agree upon the upgrade. The server must be prepared to be a TLS server before the client can do -a successful connect.

    3 client>{ok, TLSSocket} = ssl:connect(Socket, [{verify, verify_peer},
    -  {cacertfile, "cacerts.pem"},
    -  {certs_keys, [#{certfile => "cert.pem", keyfile => "key.pem"}]}], infinity).
    -{ok,{sslsocket,[...]}}

    Step 7: Send a message over TLS:

    4 client> ssl:send(TLSSocket, "foo").
    -      ok

    Step 8: Set active once on the TLS socket:

    5 server> ssl:setopts(TLSSocket, [{active, once}]).
    +a successful connect.

    3 client>{ok, TLSSocket} = ssl:connect(Socket, [{verify, verify_peer},
    +  {cacertfile, "cacerts.pem"},
    +  {certs_keys, [#{certfile => "cert.pem", keyfile => "key.pem"}]}], infinity).
    +{ok,{sslsocket,[...]}}

    Step 7: Send a message over TLS:

    4 client> ssl:send(TLSSocket, "foo").
    +      ok

    Step 8: Set active once on the TLS socket:

    5 server> ssl:setopts(TLSSocket, [{active, once}]).
           ok

    Step 9: Flush the shell message queue to see that the message sent on the -client side is recived by the server side:

    5 server> flush().
    -      Shell got {ssl,{sslsocket,[...]},"foo"}
    +client side is recived by the server side:

    5 server> flush().
    +      Shell got {ssl,{sslsocket,[...]},"foo"}
           ok

    @@ -220,34 +220,34 @@ Customizing cipher suites

    Fetch default cipher suite list for a TLS/DTLS version. Change default to all to -get all possible cipher suites.

    1>  Default = ssl:cipher_suites(default, 'tlsv1.2').
    -    [#{cipher => aes_256_gcm,key_exchange => ecdhe_ecdsa,
    -    mac => aead,prf => sha384}, ....]

    In OTP 20 it is desirable to remove all cipher suites that uses rsa key exchange +get all possible cipher suites.

    1>  Default = ssl:cipher_suites(default, 'tlsv1.2').
    +    [#{cipher => aes_256_gcm,key_exchange => ecdhe_ecdsa,
    +    mac => aead,prf => sha384}, ....]

    In OTP 20 it is desirable to remove all cipher suites that uses rsa key exchange (removed from default in 21)

    2> NoRSA =
    -    ssl:filter_cipher_suites(Default,
    -                             [{key_exchange, fun(rsa) -> false;
    -                                                (_) -> true
    -                                             end}]).
    -    [...]

    Pick just a few suites

     3> Suites =
    - ssl:filter_cipher_suites(Default,
    -                             [{key_exchange, fun(ecdh_ecdsa) -> true;
    -                                                (_) -> false
    -                                             end},
    -                              {cipher, fun(aes_128_cbc) -> true;
    -                                          (_) ->false
    -                                       end}]).
    -
    -[#{cipher => aes_128_cbc,key_exchange => ecdh_ecdsa,
    -   mac => sha256,prf => sha256},
    - #{cipher => aes_128_cbc,key_exchange => ecdh_ecdsa,mac => sha,
    -   prf => default_prf}]

    Make some particular suites the most preferred, or least preferred by changing -prepend to append.

     4>ssl:prepend_cipher_suites(Suites, Default).
    -  [#{cipher => aes_128_cbc,key_exchange => ecdh_ecdsa,
    -     mac => sha256,prf => sha256},
    -   #{cipher => aes_128_cbc,key_exchange => ecdh_ecdsa,mac => sha,
    -     prf => default_prf},
    -   #{cipher => aes_256_cbc,key_exchange => ecdhe_ecdsa,
    -     mac => sha384,prf => sha384}, ...]

    + ssl:filter_cipher_suites(Default, + [{key_exchange, fun(rsa) -> false; + (_) -> true + end}]). + [...]

    Pick just a few suites

     3> Suites =
    + ssl:filter_cipher_suites(Default,
    +                             [{key_exchange, fun(ecdh_ecdsa) -> true;
    +                                                (_) -> false
    +                                             end},
    +                              {cipher, fun(aes_128_cbc) -> true;
    +                                          (_) ->false
    +                                       end}]).
    +
    +[#{cipher => aes_128_cbc,key_exchange => ecdh_ecdsa,
    +   mac => sha256,prf => sha256},
    + #{cipher => aes_128_cbc,key_exchange => ecdh_ecdsa,mac => sha,
    +   prf => default_prf}]

    Make some particular suites the most preferred, or least preferred by changing +prepend to append.

     4>ssl:prepend_cipher_suites(Suites, Default).
    +  [#{cipher => aes_128_cbc,key_exchange => ecdh_ecdsa,
    +     mac => sha256,prf => sha256},
    +   #{cipher => aes_128_cbc,key_exchange => ecdh_ecdsa,mac => sha,
    +     prf => default_prf},
    +   #{cipher => aes_256_cbc,key_exchange => ecdhe_ecdsa,
    +     mac => sha384,prf => sha384}, ...]

    @@ -265,9 +265,9 @@ suite that is chosen, which is not the case in TLS-1.3.

    Using the function ssl:signature_algs/2 will let you inspect different aspects of possible configurations for your system. For example if TLS-1.3 and TLS-1.2 is supported the default signature_algorithm list in OTP-26 and cryptolib from -OpenSSL 3.0.2 would look like:

     1>  ssl:signature_algs(default, 'tlsv1.3').
    +OpenSSL 3.0.2 would look like:

     1>  ssl:signature_algs(default, 'tlsv1.3').
      %% TLS-1.3 schemes
    - [eddsa_ed25519,eddsa_ed448,ecdsa_secp521r1_sha512,
    + [eddsa_ed25519,eddsa_ed448,ecdsa_secp521r1_sha512,
       ecdsa_secp384r1_sha384,ecdsa_secp256r1_sha256,
       rsa_pss_pss_sha512,rsa_pss_pss_sha384,rsa_pss_pss_sha256,
       rsa_pss_rsae_sha512,rsa_pss_rsae_sha384,rsa_pss_rsae_sha256,
    @@ -275,12 +275,12 @@
       %% (would have a tuple name in TLS-1.2 only configuration)
       rsa_pkcs1_sha512,rsa_pkcs1_sha384,rsa_pkcs1_sha256
       %% TLS 1.2 algorithms
    -  {sha512,ecdsa},
    -  {sha384,ecdsa},
    -  {sha256,ecdsa}]

    If you want to add support for non default supported algorithms you should + {sha512,ecdsa}, + {sha384,ecdsa}, + {sha256,ecdsa}]

    If you want to add support for non default supported algorithms you should append them to the default list as the configuration is in prefered order, -something like this:

        MySignatureAlgs = ssl:signature_algs(default, 'tlsv1.3') ++ [{sha, rsa}, {sha, dsa}],
    -    ssl:connect(Host,Port,[{signature_algs, MySignatureAlgs,...]}),
    +something like this:

        MySignatureAlgs = ssl:signature_algs(default, 'tlsv1.3') ++ [{sha, rsa}, {sha, dsa}],
    +    ssl:connect(Host,Port,[{signature_algs, MySignatureAlgs,...]}),
         ...

    See also ssl:signature_algs/2 and sign_algo()

    @@ -288,20 +288,20 @@ /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/404.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/404.html 2026-06-04 19:05:17.900586582 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/404.html 2026-06-04 19:05:17.900586582 +0000 @@ -147,7 +147,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/api-reference.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/api-reference.html 2026-06-04 19:05:17.935594030 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/api-reference.html 2026-06-04 19:05:17.936594039 +0000 @@ -827,7 +827,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/argparse.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1338)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/argparse.html 2026-06-04 19:05:17.965594309 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/argparse.html 2026-06-04 19:05:17.966594318 +0000 @@ -146,20 +146,20 @@

    argparse is designed to work with escript. The example below is a fully functioning Erlang program accepting two command line arguments and printing their product.

    #href_anchor"w">
    -main(Args) ->
    -    argparse:run(Args, cli(), #{progname => mul}).
    +main(Args) ->
    +    argparse:run(Args, cli(), #{progname => mul}).
     
    -cli() ->
    -    #{
    -        arguments => [
    -            #{name => left, type => integer},
    -            #{name => right, type => integer}
    -        ],
    +cli() ->
    +    #{
    +        arguments => [
    +            #{name => left, type => integer},
    +            #{name => right, type => integer}
    +        ],
             handler =>
    -            fun (#{left := Left, right := Right}) ->
    -                io:format("~b~n", [Left * Right])
    +            fun (#{left := Left, right := Right}) ->
    +                io:format("~b~n", [Left * Right])
                 end
    -    }.

    Running this script with no arguments results in an error, accompanied by the + }.

    Running this script with no arguments results in an error, accompanied by the usage information.

    The cli function defines a single command with embedded handler accepting a map. Keys of the map are argument names as defined by the argument field of the command, left and right in the example. Values are taken from the @@ -173,25 +173,25 @@

    A command may contain nested commands, forming a hierarchy. Arguments defined at the upper level command are automatically added to all nested commands. Nested -commands example (assuming progname is nested):

    cli() ->
    -  #{
    +commands example (assuming progname is nested):

    cli() ->
    +  #{
         %% top level argument applicable to all commands
    -    arguments => [#{name => top}],
    -      commands => #{
    -        "first" => #{
    +    arguments => [#{name => top}],
    +      commands => #{
    +        "first" => #{
               %% argument applicable to "first" command and
               %%  all commands nested into "first"
    -          arguments => [#{name => mid}],
    -          commands => #{
    -            "second" => #{
    +          arguments => [#{name => mid}],
    +          commands => #{
    +            "second" => #{
                   %% argument only applicable for "second" command
    -              arguments => [#{name => bottom}],
    -              handler => fun (A) -> io:format("~p~n", [A]) end
    -          }
    -        }
    -      }
    -    }
    -  }.

    In the example above, a 3-level hierarchy is defined. First is the script itself + arguments => [#{name => bottom}], + handler => fun (A) -> io:format("~p~n", [A]) end + } + } + } + } + }.

    In the example above, a 3-level hierarchy is defined. First is the script itself (nested), accepting the only argument top. Since it has no associated handler, run/3 will not accept user input omitting nested command selection. For this example, user has to supply 5 arguments in the command line, two being @@ -209,14 +209,14 @@ on all operating systems). Both options and positional arguments have 1 or more associated values. See argument specification to find more details about supported combinations.

    In the user input, short options may be concatenated with their values. Long -options support values separated by =. Consider this definition:

    cli() ->
    -  #{
    -    arguments => [
    -      #{name => long, long => "-long"},
    -      #{name => short, short => $s}
    -    ],
    -    handler => fun (Args) -> io:format("~p~n", [Args]) end
    -  }.

    Running ./args --long=VALUE prints #{long => "VALUE"}, running +options support values separated by =. Consider this definition:

    cli() ->
    +  #{
    +    arguments => [
    +      #{name => long, long => "-long"},
    +      #{name => short, short => $s}
    +    ],
    +    handler => fun (Args) -> io:format("~p~n", [Args]) end
    +  }.

    Running ./args --long=VALUE prints #{long => "VALUE"}, running ./args -sVALUE prints #{short => "VALUE"}

    argparse supports boolean flags concatenation: it is possible to shorten -r -f -v to -rfv.

    Shortened option names are not supported: it is not possible to use --my-argum instead of --my-argument-name even when such option can be unambiguously @@ -607,111 +607,111 @@ which case resulting argument map will either contain the default value, or not have the key at all.

    • name - Sets the argument name in the parsed argument map. If help is not defined, name is also used to generate the default usage message.

    • short - Defines a short (single character) form of an optional argument.

      %% Define a command accepting argument named myarg, with short form $a:
      -1> Cmd = #{arguments => [#{name => myarg, short => $a}]}.
      +1> Cmd = #{arguments => [#{name => myarg, short => $a}]}.
       %% Parse command line "-a str":
      -2> {ok, ArgMap, _, _} = argparse:parse(["-a", "str"], Cmd), ArgMap.
      +2> {ok, ArgMap, _, _} = argparse:parse(["-a", "str"], Cmd), ArgMap.
       
      -#{myarg => "str"}
      +#{myarg => "str"}
       
       %% Option value can be concatenated with the switch: "-astr"
      -3> {ok, ArgMap, _, _} = argparse:parse(["-astr"], Cmd), ArgMap.
      +3> {ok, ArgMap, _, _} = argparse:parse(["-astr"], Cmd), ArgMap.
       
      -#{myarg => "str"}

      By default all options expect a single value following the option switch. The -only exception is an option of a boolean type.

    • long - Defines a long form of an optional argument.

      1> Cmd = #{arguments => [#{name => myarg, long => "name"}]}.
      +#{myarg => "str"}

      By default all options expect a single value following the option switch. The +only exception is an option of a boolean type.

    • long - Defines a long form of an optional argument.

      1> Cmd = #{arguments => [#{name => myarg, long => "name"}]}.
       %% Parse command line "-name Erlang":
      -2> {ok, ArgMap, _, _} = argparse:parse(["-name", "Erlang"], Cmd), ArgMap.
      +2> {ok, ArgMap, _, _} = argparse:parse(["-name", "Erlang"], Cmd), ArgMap.
       
      -#{myarg => "Erlang"}
      +#{myarg => "Erlang"}
       %% Or use "=" to separate the switch and the value:
      -3> {ok, ArgMap, _, _} = argparse:parse(["-name=Erlang"], Cmd), ArgMap.
      +3> {ok, ArgMap, _, _} = argparse:parse(["-name=Erlang"], Cmd), ArgMap.
       
      -#{myarg => "Erlang"}

      If neither short not long is defined, the argument is treated as +#{myarg => "Erlang"}

    If neither short not long is defined, the argument is treated as positional.

  • required - Forces the parser to expect the argument to be present in the command line. By default, all positional argument are required, and all options are not.

  • default - Specifies the default value to put in the parsed argument map -if the value is not supplied in the command line.

    1> argparse:parse([], #{arguments => [#{name => myarg, short => $m}]}).
    +if the value is not supplied in the command line.

    1> argparse:parse([], #{arguments => [#{name => myarg, short => $m}]}).
     
    -{ok,#{}, ...
    -2> argparse:parse([], #{arguments => [#{name => myarg, short => $m, default => "def"}]}).
    +{ok,#{}, ...
    +2> argparse:parse([], #{arguments => [#{name => myarg, short => $m, default => "def"}]}).
     
    -{ok,#{myarg => "def"}, ...
  • type - Defines type conversion and validation routine. The default is +{ok,#{myarg => "def"}, ...

  • type - Defines type conversion and validation routine. The default is string, assuming no conversion.

  • nargs - Defines the number of following arguments to consume from the command line. By default, the parser consumes the next argument and converts it into an Erlang term according to the specified type.

    • pos_integer/0 - Consume exactly this number of positional arguments, fail if there is not enough. Value in the argument map contains a list of exactly this length. Example, defining a positional argument expecting 3 -integer values:

      1> Cmd = #{arguments => [#{name => ints, type => integer, nargs => 3}]},
      -argparse:parse(["1", "2", "3"], Cmd).
      +integer values:

      1> Cmd = #{arguments => [#{name => ints, type => integer, nargs => 3}]},
      +argparse:parse(["1", "2", "3"], Cmd).
       
      -{ok, #{ints => [1, 2, 3]}, ...

      Another example defining an option accepted as -env and expecting two -string arguments:

      1> Cmd = #{arguments => [#{name => env, long => "env", nargs => 2}]},
      -argparse:parse(["-env", "key", "value"], Cmd).
      +{ok, #{ints => [1, 2, 3]}, ...

      Another example defining an option accepted as -env and expecting two +string arguments:

      1> Cmd = #{arguments => [#{name => env, long => "env", nargs => 2}]},
      +argparse:parse(["-env", "key", "value"], Cmd).
       
      -{ok, #{env => ["key", "value"]}, ...
    • list - Consume all following arguments until hitting the next option +{ok, #{env => ["key", "value"]}, ...

  • list - Consume all following arguments until hitting the next option (starting with an option prefix). May result in an empty list added to the -arguments map.

    1> Cmd = #{arguments => [
    -  #{name => nodes, long => "nodes", nargs => list},
    -  #{name => verbose, short => $v, type => boolean}
    -]},
    -argparse:parse(["-nodes", "one", "two", "-v"], Cmd).
    +arguments map.

    1> Cmd = #{arguments => [
    +  #{name => nodes, long => "nodes", nargs => list},
    +  #{name => verbose, short => $v, type => boolean}
    +]},
    +argparse:parse(["-nodes", "one", "two", "-v"], Cmd).
     
    -{ok, #{nodes => ["one", "two"], verbose => true}, ...
  • nonempty_list - Same as list, but expects at least one argument. +{ok, #{nodes => ["one", "two"], verbose => true}, ...

  • nonempty_list - Same as list, but expects at least one argument. Returns an error if the following command line argument is an option switch (starting with the prefix).

  • 'maybe' - Consumes the next argument from the command line, if it does not start with an option prefix. Otherwise, adds a default value to the -arguments map.

    1> Cmd = #{arguments => [
    -  #{name => level, short => $l, nargs => 'maybe', default => "error"},
    -  #{name => verbose, short => $v, type => boolean}
    -]},
    -argparse:parse(["-l", "info", "-v"], Cmd).
    +arguments map.

    1> Cmd = #{arguments => [
    +  #{name => level, short => $l, nargs => 'maybe', default => "error"},
    +  #{name => verbose, short => $v, type => boolean}
    +]},
    +argparse:parse(["-l", "info", "-v"], Cmd).
     
    -{ok,#{level => "info",verbose => true}, ...
    +{ok,#{level => "info",verbose => true}, ...
     
     %% When "info" is omitted, argument maps receives the default "error"
    -2> argparse:parse(["-l", "-v"], Cmd).
    +2> argparse:parse(["-l", "-v"], Cmd).
     
    -{ok,#{level => "error",verbose => true}, ...
  • {'maybe', term()} - Consumes the next argument from the command line, +{ok,#{level => "error",verbose => true}, ...

  • {'maybe', term()} - Consumes the next argument from the command line, /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/array.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (2403)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/array.html 2026-06-04 19:05:17.997594606 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/array.html 2026-06-04 19:05:17.997594606 +0000 @@ -136,14 +136,14 @@ reset/2). If you need to differentiate between unset and set entries, ensure that the default value cannot be confused with the values of set entries.

    The array never shrinks automatically. If an index I has been used to set an entry successfully, all indices in the range [0,I] stay accessible unless the -array size is explicitly changed by calling resize/2.

    Examples:

    Create a fixed-size array with entries 0-9 set to undefined:

    A0 = array:new(10).
    -10 = array:size(A0).

    Create an extendible array and set entry 17 to true, causing the array to grow -automatically:

    A1 = array:set(17, true, array:new()).
    -18 = array:size(A1).

    Read back a stored value:

    true = array:get(17, A1).

    Accessing an unset entry returns default value:

    undefined = array:get(3, A1)

    Accessing an entry beyond the last set entry also returns the default value, if -the array does not have fixed size:

    undefined = array:get(18, A1).

    "Sparse" functions ignore default-valued entries:

    A2 = array:set(4, false, A1).
    -[{4, false}, {17, true}] = array:sparse_to_orddict(A2).

    An extendible array can be made fixed-size later:

    A3 = array:fix(A2).

    A fixed-size array does not grow automatically and does not allow accesses -beyond the last set entry:

    {'EXIT',{badarg,_}} = (catch array:set(18, true, A3)).
    -{'EXIT',{badarg,_}} = (catch array:get(18, A3)).
    +array size is explicitly changed by calling resize/2.

    Examples:

    Create a fixed-size array with entries 0-9 set to undefined:

    A0 = array:new(10).
    +10 = array:size(A0).

    Create an extendible array and set entry 17 to true, causing the array to grow +automatically:

    A1 = array:set(17, true, array:new()).
    +18 = array:size(A1).

    Read back a stored value:

    true = array:get(17, A1).

    Accessing an unset entry returns default value:

    undefined = array:get(3, A1)

    Accessing an entry beyond the last set entry also returns the default value, if +the array does not have fixed size:

    undefined = array:get(18, A1).

    "Sparse" functions ignore default-valued entries:

    A2 = array:set(4, false, A1).
    +[{4, false}, {17, true}] = array:sparse_to_orddict(A2).

    An extendible array can be made fixed-size later:

    A3 = array:fix(A2).

    A fixed-size array does not grow automatically and does not allow accesses +beyond the last set entry:

    {'EXIT',{badarg,_}} = (catch array:set(18, true, A3)).
    +{'EXIT',{badarg,_}} = (catch array:get(18, A3)).
    @@ -1184,7 +1184,7 @@ array size; this also implies {fixed, true}. If N is not a non-negative integer, the call fails with reason badarg.

  • fixed or {fixed, true} - Creates a fixed-size array. See also fix/1.

  • {fixed, false} - Creates an extendible (non-fixed-size) array.

  • {default, Value} - Sets the default value for the array to Value.

  • Options are processed in the order they occur in the list, that is, later options have higher precedence.

    The default value is used as the value of uninitialized entries, and cannot be -changed once the array has been created.

    Examples:

    array:new(100)

    creates a fixed-size array of size 100.

    array:new({default,0})

    creates an empty, extendible array whose default value is 0.

    array:new([{size,10},{fixed,false},{default,-1}])

    creates an extendible array with initial size 10 whose default value is -1.

    See also fix/1, from_list/2, get/2, new/0, new/2, set/3.

    +changed once the array has been created.

    Examples:

    array:new(100)

    creates a fixed-size array of size 100.

    array:new({default,0})

    creates an empty, extendible array whose default value is 0.

    array:new([{size,10},{fixed,false},{default,-1}])

    creates an extendible array with initial size 10 whose default value is -1.

    See also fix/1, from_list/2, get/2, new/0, new/2, set/3.

    @@ -1217,7 +1217,7 @@ Options override parameter Size.

    If Options is a list, this is equivalent to new([{size, Size} | Options]), otherwise it is equivalent to new([{size, Size} | [Options]]). However, using this function -directly is more efficient.

    Example:

    array:new(100, {default,0})

    creates a fixed-size array of size 100, whose default value is 0.

    See also new/1.

    +directly is more efficient.

    Example:

    array:new(100, {default,0})

    creates a fixed-size array of size 100, whose default value is 0.

    See also new/1.

    @@ -1659,7 +1659,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/assert_hrl.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1299)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/assert_hrl.html 2026-06-04 19:05:18.015594772 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/assert_hrl.html 2026-06-04 19:05:18.015594772 +0000 @@ -132,7 +132,7 @@ Description

    The include file assert.hrl provides macros for inserting assertions in your -program code.

    Include the following directive in the module from which the function is called:

    -include_lib("stdlib/include/assert.hrl").

    When an assertion succeeds, the assert macro yields the atom ok. When an +program code.

    Include the following directive in the module from which the function is called:

    -include_lib("stdlib/include/assert.hrl").

    When an assertion succeeds, the assert macro yields the atom ok. When an assertion fails, an exception of type error is generated. The associated error term has the form {Macro, Info}. Macro is the macro name, for example, assertEqual. Info is a list of tagged values, such as @@ -160,7 +160,7 @@

    • assert(BoolExpr)

    • assert(BoolExpr, Comment) - Tests that BoolExpr completes normally returning true.

    • assertNot(BoolExpr)

    • assertNot(BoolExpr, Comment) - Tests that BoolExpr completes normally returning false.

    • assertMatch(GuardedPattern, Expr)

    • assertMatch(GuardedPattern, Expr, Comment) - Tests that Expr completes -normally yielding a value that matches GuardedPattern, for example:

      ?assertMatch({bork, _}, f())

      Notice that a guard when ... can be included:

      ?assertMatch({bork, X} when X > 0, f())
    • assertNotMatch(GuardedPattern, Expr)

    • assertNotMatch(GuardedPattern, Expr, Comment) - Tests that Expr +normally yielding a value that matches GuardedPattern, for example:

      ?assertMatch({bork, _}, f())

      Notice that a guard when ... can be included:

      ?assertMatch({bork, X} when X > 0, f())
    • assertNotMatch(GuardedPattern, Expr)

    • assertNotMatch(GuardedPattern, Expr, Comment) - Tests that Expr completes normally yielding a value that does not match GuardedPattern.

      As in assertMatch, GuardedPattern can have a when part.

    • assertEqual(ExpectedValue, Expr)

    • assertEqual(ExpectedValue, Expr, Comment) - Tests that Expr completes normally yielding a value that is exactly equal to ExpectedValue.

    • assertNotEqual(ExpectedValue, Expr)

    • assertNotEqual(ExpectedValue, Expr, Comment) - Tests that Expr completes normally yielding a value that is not exactly equal to @@ -222,7 +222,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/base64.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (627)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/base64.html 2026-06-04 19:05:18.038594986 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/base64.html 2026-06-04 19:05:18.038594986 +0000 @@ -671,15 +671,15 @@

      Decodes a base64 string encoded using the standard alphabet according to RFC 4648 Section 4 to plain ASCII.

      The function will strips away any whitespace characters and check for the -the correct number of = padding characters at the end of the encoded string.

      See decode_options/0 for details on which options can be passed.

      Example:

      1> base64:decode("AQIDBA==").
      +the correct number of = padding characters at the end of the encoded string.

      See decode_options/0 for details on which options can be passed.

      Example:

      1> base64:decode("AQIDBA==").
       <<1,2,3,4>>
      -2> base64:decode("AQ ID BA==").
      +2> base64:decode("AQ ID BA==").
       <<1,2,3,4>>
      -3> base64:decode("AQIDBA=").
      +3> base64:decode("AQIDBA=").
       ** exception error: missing_padding
            in function  base64:decode_list/7 (base64.erl, line 734)
               *** data to decode is missing final = padding characters, if this is intended, use the `padding => false` option
      -4> base64:decode("AQIDBA=", #{ padding => false }).
      +4> base64:decode("AQIDBA=", #{ padding => false }).
       <<1,2,3,4>>
    @@ -934,9 +934,9 @@

    Decodes a base64 "mime" string encoded using the standard alphabet according to RFC 4648 Section 4 to plain ASCII.

    The function will strips away any illegal characters. It does not check for the -the correct number of = padding characters at the end of the encoded string.

    See decode_options/0 for details on which options can be passed.

    Example:

    1> base64:mime_decode("AQIDBA==").
    +the correct number of = padding characters at the end of the encoded string.

    See decode_options/0 for details on which options can be passed.

    Example:

    1> base64:mime_decode("AQIDBA==").
     <<1,2,3,4>>
    -2> base64:mime_decode("AQIDB=A=").
    +2> base64:mime_decode("AQIDB=A=").
     <<1,2,3,4>>
    @@ -1033,7 +1033,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/beam_lib.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1372)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/beam_lib.html 2026-06-04 19:05:18.069595273 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/beam_lib.html 2026-06-04 19:05:18.069595273 +0000 @@ -151,8 +151,8 @@ Reconstruct Source Code

    The following example shows how to reconstruct Erlang source code from the debug -information in a BEAM file Beam:

    {ok,{_,[{abstract_code,{_,AC}}]}} = beam_lib:chunks(Beam,[abstract_code]).
    -io:fwrite("~s~n", [erl_prettypr:format(erl_syntax:form_list(AC))]).

    +information in a BEAM file Beam:

    {ok,{_,[{abstract_code,{_,AC}}]}} = beam_lib:chunks(Beam,[abstract_code]).
    +io:fwrite("~s~n", [erl_prettypr:format(erl_syntax:form_list(AC))]).

    @@ -182,13 +182,13 @@ user's home directory and then filename:basedir(user_config, "erlang"). If the file is found and contains a key, beam_lib implicitly creates a crypto key fun -and registers it.

    File .erlang.crypt is to contain a single list of tuples:

    {debug_info, Mode, Module, Key}

    Mode is the type of crypto algorithm; currently, the only allowed value is +and registers it.

    File .erlang.crypt is to contain a single list of tuples:

    {debug_info, Mode, Module, Key}

    Mode is the type of crypto algorithm; currently, the only allowed value is des3_cbc. Module is either an atom, in which case Key is only used for the module Module, or [], in which case Key is used for all modules. Key is the non-empty key string.

    Key in the first tuple where both Mode and Module match is used.

    The following is an example of an .erlang.crypt file that returns the same key -for all modules:

    [{debug_info, des3_cbc, [], "%>7}|pc/DM6Cga*68$Mw]L#&_Gejr]G^"}].

    The following is a slightly more complicated example of an .erlang.crypt -providing one key for module t and another key for all other modules:

    [{debug_info, des3_cbc, t, "My KEY"},
    - {debug_info, des3_cbc, [], "%>7}|pc/DM6Cga*68$Mw]L#&_Gejr]G^"}].

    Note

    Do not use any of the keys in these examples. Use your own keys.

    +for all modules:

    [{debug_info, des3_cbc, [], "%>7}|pc/DM6Cga*68$Mw]L#&_Gejr]G^"}].

    The following is a slightly more complicated example of an .erlang.crypt +providing one key for module t and another key for all other modules:

    [{debug_info, des3_cbc, t, "My KEY"},
    + {debug_info, des3_cbc, [], "%>7}|pc/DM6Cga*68$Mw]L#&_Gejr]G^"}].

    Note

    Do not use any of the keys in these examples. Use your own keys.

    @@ -1556,11 +1556,11 @@

    Registers an unary fun that is called if beam_lib must read an debug_info chunk that has been encrypted. The fun is held in a process that is started by the function.

    If a fun is already registered when attempting to register a fun, -{error, exists} is returned.

    The fun must handle the following arguments:

    CryptoKeyFun(init) -> ok | {ok, NewCryptoKeyFun} | {error, Term}

    Called when the fun is registered, in the process that holds the fun. Here the +{error, exists} is returned.

    The fun must handle the following arguments:

    CryptoKeyFun(init) -> ok | {ok, NewCryptoKeyFun} | {error, Term}

    Called when the fun is registered, in the process that holds the fun. Here the crypto key fun can do any necessary initializations. If {ok, NewCryptoKeyFun} is returned, NewCryptoKeyFun is registered instead of CryptoKeyFun. If {error, Term} is returned, the registration is aborted and -crypto_key_fun/1 also returns {error, Term}.

    CryptoKeyFun({debug_info, Mode, Module, Filename}) -> Key

    Called when the key is needed for module Module in the file named Filename. +crypto_key_fun/1 also returns {error, Term}.

    CryptoKeyFun({debug_info, Mode, Module, Filename}) -> Key

    Called when the key is needed for module Module in the file named Filename. Mode is the type of crypto algorithm; currently, the only possible value is des3_cbc. The call is to fail (raise an exception) if no key is available.

    CryptoKeyFun(clear) -> term()

    Called before the fun is unregistered. Here any cleaning up can be done. The return value is not important, but is passed back to the caller of @@ -1927,14 +1927,14 @@ -vsn(Vsn).

    If this attribute is not specified, the version defaults to the checksum of the module. Notice that if version Vsn is not a list, it is made into one, that is {ok,{Module,[Vsn]}} is returned. If there are many -vsn -module attributes, the result is the concatenated list of versions.

    Examples:

    1> beam_lib:version(a). % -vsn(1).
    -{ok,{a,[1]}}
    -2> beam_lib:version(b). % -vsn([1]).
    -{ok,{b,[1]}}
    -3> beam_lib:version(c). % -vsn([1]). -vsn(2).
    -{ok,{c,[1,2]}}
    -4> beam_lib:version(d). % no -vsn attribute
    -{ok,{d,[275613208176997377698094100858909383631]}}
    +module attributes, the result is the concatenated list of versions.

    Examples:

    1> beam_lib:version(a). % -vsn(1).
    +{ok,{a,[1]}}
    +2> beam_lib:version(b). % -vsn([1]).
    +{ok,{b,[1]}}
    +3> beam_lib:version(c). % -vsn([1]). -vsn(2).
    +{ok,{c,[1,2]}}
    +4> beam_lib:version(d). % no -vsn attribute
    +{ok,{d,[275613208176997377698094100858909383631]}}
    @@ -1963,7 +1963,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/binary.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1041)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/binary.html 2026-06-04 19:05:18.100595561 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/binary.html 2026-06-04 19:05:18.100595561 +0000 @@ -643,7 +643,7 @@ -

    Converts Subject to a list of byte/0s, each representing the value of one byte.

    Example:

    1> binary:bin_to_list(<<"erlang">>).
    +

    Converts Subject to a list of byte/0s, each representing the value of one byte.

    Example:

    1> binary:bin_to_list(<<"erlang">>).
     "erlang"
     %% or [101,114,108,97,110,103] in list notation.
    @@ -709,7 +709,7 @@

    Converts Subject to a list of byte/0s, each representing the value of one byte. PosLen or alternatively Pos and Len denote which part of the Subject binary to convert. By default, the entire Subject binary is -converted.

    Example:

    1> binary:bin_to_list(<<"erlang">>, {1,3}).
    +converted.

    Example:

    1> binary:bin_to_list(<<"erlang">>, {1,3}).
     "rla"
     %% or [114,108,97] in list notation.

    If PosLen or alternatively Pos and Len in any way reference outside the binary, a badarg exception is raised.

    @@ -851,7 +851,7 @@ -

    Decodes a hex encoded binary into a binary.

    Example

    1> binary:decode_hex(<<"66">>).
    +

    Decodes a hex encoded binary into a binary.

    Example

    1> binary:decode_hex(<<"66">>).
     <<"f">>
    @@ -917,11 +917,11 @@

    Converts the binary digit representation, in big endian or little endian, of a -positive integer in Subject to an Erlang integer/0.

    Example:

    1> binary:decode_unsigned(<<169,138,199>>).
    +positive integer in Subject to an Erlang integer/0.

    Example:

    1> binary:decode_unsigned(<<169,138,199>>).
     11111111
    -2> binary:decode_unsigned(<<169,138,199>>, big).
    +2> binary:decode_unsigned(<<169,138,199>>, big).
     11111111
    -3> binary:decode_unsigned(<<169,138,199>>, little).
    +3> binary:decode_unsigned(<<169,138,199>>, little).
     13077161
    @@ -984,13 +984,13 @@

    Encodes a binary into a hex encoded binary using the specified case for the -hexadecimal digits "a" to "f".

    The default case is uppercase.

    Example:

    1> binary:encode_hex(<<"f">>).
    +hexadecimal digits "a" to "f".

    The default case is uppercase.

    Example:

    1> binary:encode_hex(<<"f">>).
     <<"66">>
    -2> binary:encode_hex(<<"/">>).
    +2> binary:encode_hex(<<"/">>).
     <<"2F">>
    -3> binary:encode_hex(<<"/">>, lowercase).
    +3> binary:encode_hex(<<"/">>, lowercase).
     <<"2f">>
    -4> binary:encode_hex(<<"/">>, uppercase).
    +4> binary:encode_hex(<<"/">>, uppercase).
     <<"2F">>
    @@ -1053,11 +1053,11 @@

    Converts a positive integer to the smallest possible representation in a binary -digit representation, either big endian or little endian.

    Example:

    1> binary:encode_unsigned(11111111).
    +digit representation, either big endian or little endian.

    Example:

    1> binary:encode_unsigned(11111111).
     <<169,138,199>>
    -2> binary:encode_unsigned(11111111, big).
    +2> binary:encode_unsigned(11111111, big).
     <<169,138,199>>
    -2> binary:encode_unsigned(11111111, little).
    +2> binary:encode_unsigned(11111111, little).
     <<199,138,169>>
    @@ -1181,9 +1181,9 @@

    Returns the length of the longest common prefix of the binaries in list -Binaries.

    Example:

    1> binary:longest_common_prefix([<<"erlang">>, <<"ergonomy">>]).
    +Binaries.

    Example:

    1> binary:longest_common_prefix([<<"erlang">>, <<"ergonomy">>]).
     2
    -2> binary:longest_common_prefix([<<"erlang">>, <<"perl">>]).
    +2> binary:longest_common_prefix([<<"erlang">>, <<"perl">>]).
     0

    If Binaries is not a flat non-empty list of binaries, a badarg exception is raised.

    @@ -1216,9 +1216,9 @@

    Returns the length of the longest common suffix of the binaries in list -Binaries.

    Example:

    1> binary:longest_common_suffix([<<"erlang">>, <<"fang">>]).
    +Binaries.

    Example:

    1> binary:longest_common_suffix([<<"erlang">>, <<"fang">>]).
     3
    -2> binary:longest_common_suffix([<<"erlang">>, <<"perl">>]).
    +2> binary:longest_common_suffix([<<"erlang">>, <<"perl">>]).
     0

    If Binaries is not a flat non-empty list of binaries, a badarg exception is raised.

    @@ -1294,8 +1294,8 @@

    Searches for the first occurrence of Pattern in Subject and returns the position and length.

    The function returns {Pos, Length} for the binary in Pattern, starting at -the lowest position in Subject.

    Example:

    1> binary:match(<<"abcde">>, [<<"bcde">>, <<"cd">>],[]).
    -{1,4}

    Even though <<"cd">> ends before <<"bcde">>, <<"bcde">> begins first and +the lowest position in Subject.

    Example:

    1> binary:match(<<"abcde">>, [<<"bcde">>, <<"cd">>],[]).
    +{1,4}

    Even though <<"cd">> ends before <<"bcde">>, <<"bcde">> begins first and is therefore the first match. If two overlapping matches begin at the same position, the longest is returned.

    Summary of the options:

    • {scope, {Start, Length}} - Only the specified part is searched. Return values still have offsets from the beginning of Subject. A negative Length @@ -1375,9 +1375,9 @@

      As match/2, but Subject is searched until exhausted and a list of all non-overlapping parts matching Pattern is returned (in order).

      The first and longest match is preferred to a shorter, which is illustrated by -the following example:

      1> binary:matches(<<"abcde">>,
      -                  [<<"bcde">>,<<"bc">>,<<"de">>],[]).
      -[{1,4}]

      The result shows that <<"bcde">> is selected instead of the shorter match +the following example:

      1> binary:matches(<<"abcde">>,
      +                  [<<"bcde">>,<<"bc">>,<<"de">>],[]).
      +[{1,4}]

      The result shows that <<"bcde">> is selected instead of the shorter match <<"bc">> (which would have given raise to one more match, <<"de">>). This corresponds to the behavior of POSIX regular expressions (and programs like awk), but is not consistent with alternative matches in re (and Perl), where @@ -1446,7 +1446,7 @@

      Extracts the part of binary Subject described by PosLen.

      A negative length can be used to extract bytes at the end of a binary:

      1> Bin = <<1,2,3,4,5,6,7,8,9,10>>.
      -2> binary:part(Bin, {byte_size(Bin), -5}).
      +2> binary:part(Bin, {byte_size(Bin), -5}).
       <<6,7,8,9,10>>

      Note

      part/2 and part/3 are also available in the erlang module under the names binary_part/2 and binary_part/3. Those BIFs are allowed in guard tests.

      If PosLen in any way references outside the binary, a badarg exception is @@ -1484,33 +1484,33 @@ it can be useful to get the size of the referenced binary. This function can be used in a program to trigger the use of copy/1. By copying a binary, one can dereference the original, possibly large, binary that a -smaller binary is a reference to.

      Example:

      store(Binary, GBSet) ->
      +smaller binary is a reference to.

      Example:

      store(Binary, GBSet) ->
         NewBin =
      -      case binary:referenced_byte_size(Binary) of
      -          Large when Large > 2 * byte_size(Binary) ->
      -             binary:copy(Binary);
      +      case binary:referenced_byte_size(Binary) of
      +          Large when Large > 2 * byte_size(Binary) ->
      +             binary:copy(Binary);
                 _ ->
                    Binary
             end,
      -  gb_sets:insert(NewBin,GBSet).

      In this example, we chose to copy the binary content before inserting it in + gb_sets:insert(NewBin,GBSet).

      In this example, we chose to copy the binary content before inserting it in gb_sets:set() if it references a binary more than twice the data size we want to keep. Of course, different rules apply when copying to different programs.

      Binary sharing occurs whenever binaries are taken apart. This is the fundamental reason why binaries are fast, decomposition can always be done with O(1) complexity. In rare circumstances this data sharing is however undesirable, why this function together with copy/1 can be useful when optimizing -for memory use.

      Example of binary sharing:

      1> A = binary:copy(<<1>>, 100).
      +for memory use.

      Example of binary sharing:

      1> A = binary:copy(<<1>>, 100).
       <<1,1,1,1,1 ...
      -2> byte_size(A).
      +2> byte_size(A).
       100
      -3> binary:referenced_byte_size(A).
      +3> binary:referenced_byte_size(A).
       100
       4> <<B:10/binary, C:90/binary>> = A.
       <<1,1,1,1,1 ...
      -5> {byte_size(B), binary:referenced_byte_size(B)}.
      -{10,10}
      -6> {byte_size(C), binary:referenced_byte_size(C)}.
      -{90,100}

      In the above example, the small binary B was copied while the larger binary +5> {byte_size(B), binary:referenced_byte_size(B)}. +{10,10} +6> {byte_size(C), binary:referenced_byte_size(C)}. +{90,100}

      In the above example, the small binary B was copied while the larger binary C references binary A.

      Note

      Binary data is shared among processes. If another process still references the larger binary, copying the part this process uses only consumes more memory and does not free up the larger binary for garbage collection. Use this kind @@ -1599,28 +1599,28 @@ at the specified position (or positions) before inserting Replacement into Subject. If Replacement is given as a fun instead, this option is ignored.

      If any position specified in InsPos > size of the replacement binary, a badarg exception is raised.

      Options global and {scope, part()} work as for split/3. The return type is -always a binary/0.

      For a description of Pattern, see compile_pattern/1.

      Examples:

      1> binary:replace(<<"abcde">>, [<<"b">>, <<"d">>], <<"X">>, []).
      +always a binary/0.

      For a description of Pattern, see compile_pattern/1.

      Examples:

      1> binary:replace(<<"abcde">>, [<<"b">>, <<"d">>], <<"X">>, []).
       <<"aXcde">>
       
      -2> binary:replace(<<"abcde">>, [<<"b">>, <<"d">>], <<"X">>, [global]).
      +2> binary:replace(<<"abcde">>, [<<"b">>, <<"d">>], <<"X">>, [global]).
       <<"aXcXe">>
       
      -3> binary:replace(<<"abcde">>, <<"b">>, <<"[]">>, [{insert_replaced, 1}]).
      +3> binary:replace(<<"abcde">>, <<"b">>, <<"[]">>, [{insert_replaced, 1}]).
       <<"a[b]cde">>
       
      -4> binary:replace(<<"abcde">>, [<<"b">>, <<"d">>], <<"[]">>, [global, {insert_replaced, 1}]).
      +4> binary:replace(<<"abcde">>, [<<"b">>, <<"d">>], <<"[]">>, [global, {insert_replaced, 1}]).
       <<"a[b]c[d]e">>
       
      /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/c.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (723))
      --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/c.html	2026-06-04 19:05:18.130595839 +0000
      +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/c.html	2026-06-04 19:05:18.131595848 +0000
      @@ -1755,7 +1755,7 @@
             
       
       

      Compiles and then loads the code for a file on all nodes. Options defaults to -[]. Compilation is equivalent to:

      compile:file(File, Options ++ [report_errors, report_warnings])
      +[]. Compilation is equivalent to:

      compile:file(File, Options ++ [report_errors, report_warnings])
      @@ -2102,7 +2102,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/calendar.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (454)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/calendar.html 2026-06-04 19:05:18.163596145 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/calendar.html 2026-06-04 19:05:18.163596145 +0000 @@ -1845,10 +1845,10 @@

      Converts an RFC 3339 timestamp into system time. The data format of RFC 3339 timestamps is described by RFC 3339. Starting from OTP 25.1, the minutes part of the time zone is optional.

      Valid option:

      • {unit, Unit} - The time unit of the return value. The default is -second.
      1> calendar:rfc3339_to_system_time("2018-02-01T16:17:58+01:00").
      +second.
    1> calendar:rfc3339_to_system_time("2018-02-01T16:17:58+01:00").
     1517498278
    -2> calendar:rfc3339_to_system_time("2018-02-01 15:18:02.088Z",
    -   [{unit, nanosecond}]).
    +2> calendar:rfc3339_to_system_time("2018-02-01 15:18:02.088Z",
    +   [{unit, nanosecond}]).
     1517498282088000000
    @@ -2018,16 +2018,16 @@ the formatted string includes a fraction of a second. The number of fractional second digits is three, six, or nine depending on what time unit is chosen. For native three fractional digits are included. Notice that trailing zeros -are not removed from the fraction.

    1> calendar:system_time_to_rfc3339(erlang:system_time(second)).
    +are not removed from the fraction.

    1> calendar:system_time_to_rfc3339(erlang:system_time(second)).
     "2018-04-23T14:56:28+02:00"
    -2> calendar:system_time_to_rfc3339(erlang:system_time(second),
    -   [{offset, "-02:00"}]).
    +2> calendar:system_time_to_rfc3339(erlang:system_time(second),
    +   [{offset, "-02:00"}]).
     "2018-04-23T10:56:52-02:00"
    -3> calendar:system_time_to_rfc3339(erlang:system_time(second),
    -   [{offset, -7200}]).
    +3> calendar:system_time_to_rfc3339(erlang:system_time(second),
    +   [{offset, -7200}]).
     "2018-04-23T10:57:05-02:00"
    -4> calendar:system_time_to_rfc3339(erlang:system_time(millisecond),
    -   [{unit, millisecond}, {time_designator, $\s}, {offset, "Z"}]).
    +4> calendar:system_time_to_rfc3339(erlang:system_time(millisecond),
    +   [{unit, millisecond}, {time_designator, $\s}, {offset, "Z"}]).
     "2018-04-23 12:57:20.482Z"
    @@ -2262,7 +2262,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/dets.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (341)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/dets.html 2026-06-04 19:05:18.202596507 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/dets.html 2026-06-04 19:05:18.202596507 +0000 @@ -1914,14 +1914,14 @@

    Returns a list of all objects with key Key stored in table Name, for -example:

    2> dets:open_file(abc, [{type, bag}]).
    -{ok,abc}
    -3> dets:insert(abc, {1,2,3}).
    +example:

    2> dets:open_file(abc, [{type, bag}]).
    +{ok,abc}
    +3> dets:insert(abc, {1,2,3}).
     ok
    -4> dets:insert(abc, {1,3,4}).
    +4> dets:insert(abc, {1,3,4}).
     ok
    -5> dets:lookup(abc, 1).
    -[{1,2,3},{1,3,4}]

    If the table type is set, the function returns either the empty list or a list +5> dets:lookup(abc, 1). +[{1,2,3},{1,3,4}]

    If the table type is set, the function returns either the empty list or a list with one object, as there cannot be more than one object with a given key. If the table type is bag or duplicate_bag, the function returns a list of arbitrary length.

    Notice that the order of objects returned is unspecified. In particular, the @@ -2778,11 +2778,11 @@ specification is specified explicitly. This is how to state match specifications that cannot easily be expressed within the syntax provided by qlc.

    The following example uses an explicit match specification to traverse the -table:

    1> dets:open_file(t, []),
    -ok = dets:insert(t, [{1,a},{2,b},{3,c},{4,d}]),
    -MS = ets:fun2ms(fun({X,Y}) when (X > 1) or (X < 5) -> {Y} end),
    -QH1 = dets:table(t, [{traverse, {select, MS}}]).

    An example with implicit match specification:

    2> QH2 = qlc:q([{Y} || {X,Y} <- dets:table(t), (X > 1) or (X < 5)]).

    The latter example is equivalent to the former, which can be verified using -function qlc:info/1:

    3> qlc:info(QH1) =:= qlc:info(QH2).
    +table:

    1> dets:open_file(t, []),
    +ok = dets:insert(t, [{1,a},{2,b},{3,c},{4,d}]),
    +MS = ets:fun2ms(fun({X,Y}) when (X > 1) or (X < 5) -> {Y} end),
    +QH1 = dets:table(t, [{traverse, {select, MS}}]).

    An example with implicit match specification:

    2> QH2 = qlc:q([{Y} || {X,Y} <- dets:table(t), (X > 1) or (X < 5)]).

    The latter example is equivalent to the former, which can be verified using +function qlc:info/1:

    3> qlc:info(QH1) =:= qlc:info(QH2).
     true

    qlc:info/1 returns information about a query handle. In this case identical information is returned for the two query handles.

    @@ -2856,7 +2856,7 @@

    Applies Fun to each object stored in table Name in some unspecified order. Different actions are taken depending on the return value of Fun. The following Fun return values are allowed:

    • continue - Continue to perform the traversal. For example, the following -function can be used to print the contents of a table:

      fun(X) -> io:format("~p~n", [X]), continue end.
    • {continue, Val} - Continue the traversal and accumulate Val. The +function can be used to print the contents of a table:

      fun(X) -> io:format("~p~n", [X]), continue end.
    • {continue, Val} - Continue the traversal and accumulate Val. The following function is supplied to collect all objects of a table in a list:

      fun(X) -> {continue, X} end.
    • {done, Value} - Terminate the traversal and return [Value | Acc].

    Any other value OtherValue returned by Fun terminates the traversal and is returned immediately.

    @@ -2927,7 +2927,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/dict.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1050)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/dict.html 2026-06-04 19:05:18.229596757 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/dict.html 2026-06-04 19:05:18.228596748 +0000 @@ -138,13 +138,13 @@ Notes

    Functions append and append_list are included so that keyed values can be -stored in a list accumulator, for example:

    > D0 = dict:new(),
    -  D1 = dict:store(files, [], D0),
    -  D2 = dict:append(files, f1, D1),
    -  D3 = dict:append(files, f2, D2),
    -  D4 = dict:append(files, f3, D3),
    -  dict:fetch(files, D4).
    -[f1,f2,f3]

    This saves the trouble of first fetching a keyed value, appending a new value to +stored in a list accumulator, for example:

    > D0 = dict:new(),
    +  D1 = dict:store(files, [], D0),
    +  D2 = dict:append(files, f1, D1),
    +  D3 = dict:append(files, f2, D2),
    +  D4 = dict:append(files, f3, D3),
    +  dict:fetch(files, D4).
    +[f1,f2,f3]

    This saves the trouble of first fetching a keyed value, appending a new value to the list of stored values, and storing the result.

    Function fetch is to be used if the key is known to be in the dictionary, otherwise function find.

    @@ -905,10 +905,10 @@ the Key-Value pairs from both dictionaries are included in the new dictionary. If a key occurs in both dictionaries, Fun is called with the key and both values to return a new value. merge can be defined as follows, but is -faster:

    merge(Fun, D1, D2) ->
    -    fold(fun (K, V1, D) ->
    -                 update(K, fun (V2) -> Fun(K, V1, V2) end, V1, D)
    -         end, D2, D1).
    +faster:

    merge(Fun, D1, D2) ->
    +    fold(fun (K, V1, D) ->
    +                 update(K, fun (V2) -> Fun(K, V1, V2) end, V1, D)
    +         end, D2, D1).
    @@ -1121,8 +1121,8 @@

    Updates a value in a dictionary by calling Fun on the value to get a new value. If Key is not present in the dictionary, Initial is stored as the -first value. For example, append/3 can be defined as:

    append(Key, Val, D) ->
    -    update(Key, fun (Old) -> Old ++ [Val] end, [Val], D).
    +first value. For example, append/3 can be defined as:

    append(Key, Val, D) ->
    +    update(Key, fun (Old) -> Old ++ [Val] end, [Val], D).
    @@ -1153,8 +1153,8 @@

    Adds Increment to the value associated with Key and stores this value. If Key is not present in the dictionary, Increment is stored as the first -value.

    This can be defined as follows, but is faster:

    update_counter(Key, Incr, D) ->
    -    update(Key, fun (Old) -> Old + Incr end, Incr, D).
    +value.

    This can be defined as follows, but is faster:

    update_counter(Key, Incr, D) ->
    +    update(Key, fun (Old) -> Old + Incr end, Incr, D).
    @@ -1183,7 +1183,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/digraph.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (422)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/digraph.html 2026-06-04 19:05:18.255596999 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/digraph.html 2026-06-04 19:05:18.255596999 +0000 @@ -1842,7 +1842,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/digraph_utils.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/digraph_utils.html 2026-06-04 19:05:18.279597221 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/digraph_utils.html 2026-06-04 19:05:18.279597221 +0000 @@ -1044,7 +1044,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/edlin.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1415)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/edlin.html 2026-06-04 19:05:18.302597435 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/edlin.html 2026-06-04 19:05:18.299597407 +0000 @@ -343,7 +343,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/edlin_expand.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/edlin_expand.html 2026-06-04 19:05:18.319597592 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/edlin_expand.html 2026-06-04 19:05:18.320597602 +0000 @@ -336,7 +336,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/epp.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (816)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/epp.html 2026-06-04 19:05:18.342597806 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/epp.html 2026-06-04 19:05:18.342597806 +0000 @@ -140,7 +140,7 @@ Error Information

    ErrorInfo is the standard ErrorInfo structure that is returned from all I/O -modules. The format is as follows:

    {ErrorLine, Module, ErrorDescriptor}

    A string describing the error is obtained with the following call:

    Module:format_error(ErrorDescriptor)

    +modules. The format is as follows:

    {ErrorLine, Module, ErrorDescriptor}

    A string describing the error is obtained with the following call:

    Module:format_error(ErrorDescriptor)

    @@ -1233,7 +1233,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_anno.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (361)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_anno.html 2026-06-04 19:05:18.364598010 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_anno.html 2026-06-04 19:05:18.365598019 +0000 @@ -1267,7 +1267,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_error.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1131)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_error.html 2026-06-04 19:05:18.387598223 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_error.html 2026-06-04 19:05:18.387598223 +0000 @@ -317,7 +317,7 @@

    A fun used to format function arguments for BIF and function calls. By default -the following fun will be used:

    fun(Term, I) -> io_lib:print(Term, I, 80, 30) end
    +the following fun will be used:

    fun(Term, I) -> io_lib:print(Term, I, 80, 30) end
    @@ -438,23 +438,23 @@ caused the error starting at 1.

  • general - An error that is not associated with any argument caused the error.

  • reason - If the Reason should be printed differently than the default way.

  • If the text returned includes new-lines, format_exception/4 will indent the -text correctly.

    Example:

    -module(my_error_module).
    --export([atom_to_string/1, format_error/2]).
    +text correctly.

    Example:

    -module(my_error_module).
    +-export([atom_to_string/1, format_error/2]).
     
    -atom_to_string(Arg) when is_atom(Arg) ->
    -  atom_to_list(Arg);
    -atom_to_string(Arg) ->
    -  erlang:error(badarg,[Arg],
    -               [{error_info,#{ module => ?MODULE,
    -                               cause => #{ 1 => "should be an atom" }}}]).
    -
    -format_error(Reason, [{_M,_F,_As,Info}|_]) ->
    -  ErrorInfo = proplists:get_value(error_info, Info, #{}),
    -  ErrorMap = maps:get(cause, ErrorInfo),
    -  ErrorMap#{ general => "optional general information",
    -             reason => io_lib:format("~p: ~p",[?MODULE, Reason]) }.
    1> c(my_error_module).
    -{ok,my_error_module}
    -2> my_error_module:atom_to_string(1).
    +atom_to_string(Arg) when is_atom(Arg) ->
    +  atom_to_list(Arg);
    +atom_to_string(Arg) ->
    +  erlang:error(badarg,[Arg],
    +               [{error_info,#{ module => ?MODULE,
    +                               cause => #{ 1 => "should be an atom" }}}]).
    +
    +format_error(Reason, [{_M,_F,_As,Info}|_]) ->
    +  ErrorInfo = proplists:get_value(error_info, Info, #{}),
    +  ErrorMap = maps:get(cause, ErrorInfo),
    +  ErrorMap#{ general => "optional general information",
    +             reason => io_lib:format("~p: ~p",[?MODULE, Reason]) }.
    1> c(my_error_module).
    +{ok,my_error_module}
    +2> my_error_module:atom_to_string(1).
     ** exception error: my_error_module: badarg
          in function  my_error_module:atom_to_string/1
             called as my_error_module:atom_to_string(1)
    @@ -542,18 +542,18 @@
     
     

    Format the error reason and stack back-trace caught using try ... catch in the same style as the shell formats them.

    Example:

    try
    -    do_something()
    +    do_something()
     catch
         C:R:Stk ->
    -        Message = erl_error:format_exception(C, R, Stk),
    -        io:format(LogFile, "~ts\n", [Message])
    +        Message = erl_error:format_exception(C, R, Stk),
    +        io:format(LogFile, "~ts\n", [Message])
     end

    If error_info is provided with the exception, format_exception will use that information to provide additional information about the exception.

    Example:

    try
    -  erlang:raise(badarg,[],[{error_info,#{}}])
    +  erlang:raise(badarg,[],[{error_info,#{}}])
     catch
         C:R:Stk ->
    -        Message = erl_error:format_exception(C, R, Stk),
    -        io:format(LogFile, "~ts\n", [Message])
    +        Message = erl_error:format_exception(C, R, Stk),
    +        io:format(LogFile, "~ts\n", [Message])
     end

    See erlang:error/3 for details on how to raise an exception with error_info included.

    @@ -584,7 +584,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_eval.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (924)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_eval.html 2026-06-04 19:05:18.410598437 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_eval.html 2026-06-04 19:05:18.411598446 +0000 @@ -141,13 +141,13 @@ LocalFunctionHandler can be used to define a function that is called when there is a call to a local function. The argument can have the following formats:

    • {value,Func} - This defines a local function handler that is called -with:

      Func(Name, Arguments)

      Name is the name of the local function (an atom) and Arguments is a list +with:

      Func(Name, Arguments)

      Name is the name of the local function (an atom) and Arguments is a list of the evaluated arguments. The function handler returns the value of the local function. In this case, the current bindings cannot be accessed. To signal an error, the function handler calls exit/1 with a -suitable exit value.

    • {eval,Func} - This defines a local function handler that is called with:

      Func(Name, Arguments, Bindings)

      Name is the name of the local function (an atom), Arguments is a list of +suitable exit value.

    • {eval,Func} - This defines a local function handler that is called with:

      Func(Name, Arguments, Bindings)

      Name is the name of the local function (an atom), Arguments is a list of the unevaluated arguments, and Bindings are the current variable bindings. -The function handler returns:

      {value,Value,NewBindings}

      Value is the value of the local function and NewBindings are the updated +The function handler returns:

      {value,Value,NewBindings}

      Value is the value of the local function and NewBindings are the updated variable bindings. In this case, the function handler must itself evaluate all the function arguments and manage the bindings. To signal an error, the function handler calls exit/1 with a suitable exit value.

    • none - There is no local function handler.

    @@ -161,7 +161,7 @@ expressions.
  • An operator Op/A is called (this is handled as a call to function erlang:Op/A).
  • Exceptions are calls to erlang:apply/2,3; neither of the function handlers are called for such calls. The argument can have the following formats:

    • {value,Func} - This defines a non-local function handler. The function -may be called with two arguments:

      Func(FuncSpec, Arguments)

      or three arguments:

      Func(Anno, FuncSpec, Arguments)

      Anno is the erl_anno:anno() of the node, FuncSpec +may be called with two arguments:

      Func(FuncSpec, Arguments)

      or three arguments:

      Func(Anno, FuncSpec, Arguments)

      Anno is the erl_anno:anno() of the node, FuncSpec is the name of the function on the form {Module,Function} or a fun, and Arguments is a list of the evaluated arguments. The function handler returns the value of the function. To signal an error, the function handler @@ -1425,7 +1425,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_expand_records.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_expand_records.html 2026-06-04 19:05:18.428598603 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_expand_records.html 2026-06-04 19:05:18.428598603 +0000 @@ -236,7 +236,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_features.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_features.html 2026-06-04 19:05:18.448598789 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_features.html 2026-06-04 19:05:18.448598789 +0000 @@ -592,7 +592,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_id_trans.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_id_trans.html 2026-06-04 19:05:18.466598956 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_id_trans.html 2026-06-04 19:05:18.466598956 +0000 @@ -291,7 +291,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_internal.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (363)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_internal.html 2026-06-04 19:05:18.485599132 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_internal.html 2026-06-04 19:05:18.484599123 +0000 @@ -580,7 +580,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_lint.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (816)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_lint.html 2026-06-04 19:05:18.503599299 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_lint.html 2026-06-04 19:05:18.502599290 +0000 @@ -139,7 +139,7 @@ Error Information

    ErrorInfo is the standard ErrorInfo structure that is returned from all I/O -modules. The format is as follows:

    {ErrorLine, Module, ErrorDescriptor}

    A string describing the error is obtained with the following call:

    Module:format_error(ErrorDescriptor)

    +modules. The format is as follows:

    {ErrorLine, Module, ErrorDescriptor}

    A string describing the error is obtained with the following call:

    Module:format_error(ErrorDescriptor)

    @@ -595,7 +595,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_parse.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (807)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_parse.html 2026-06-04 19:05:18.550599735 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_parse.html 2026-06-04 19:05:18.550599735 +0000 @@ -138,7 +138,7 @@ Error Information

    ErrorInfo is the standard ErrorInfo structure that is returned from all I/O modules. -The format is as follows:

    {ErrorLine, Module, ErrorDescriptor}

    A string describing the error is obtained with the following call:

    Module:format_error(ErrorDescriptor)

    +The format is as follows:

    {ErrorLine, Module, ErrorDescriptor}

    A string describing the error is obtained with the following call:

    Module:format_error(ErrorDescriptor)

    @@ -5920,7 +5920,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_pp.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_pp.html 2026-06-04 19:05:18.575599967 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_pp.html 2026-06-04 19:05:18.576599976 +0000 @@ -1005,7 +1005,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_scan.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (817)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_scan.html 2026-06-04 19:05:18.601600208 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_scan.html 2026-06-04 19:05:18.602600218 +0000 @@ -136,7 +136,7 @@ Error Information

    ErrorInfo is the standard ErrorInfo structure that is returned from all I/O -modules. The format is as follows:

    {ErrorLocation, Module, ErrorDescriptor}

    A string describing the error is obtained with the following call:

    Module:format_error(ErrorDescriptor)

    +modules. The format is as follows:

    {ErrorLocation, Module, ErrorDescriptor}

    A string describing the error is obtained with the following call:

    Module:format_error(ErrorDescriptor)

    @@ -1345,7 +1345,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_tar.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1320)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_tar.html 2026-06-04 19:05:18.631600487 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/erl_tar.html 2026-06-04 19:05:18.631600487 +0000 @@ -1291,14 +1291,14 @@ Notice that there is only an arity-2 read function, not an arity-1 function.

  • (position,{UserData,Position}) - Sets the position of UserData as defined for files in file:position/2

  • Example:

    The following is a complete Fun parameter for reading and writing on files using the file module:

    ExampleFun =
    -   fun(write, {Fd,Data}) ->  file:write(Fd, Data);
    -      (position, {Fd,Pos}) -> file:position(Fd, Pos);
    -      (read2, {Fd,Size}) -> file:read(Fd, Size);
    -      (close, Fd) -> file:close(Fd)
    -   end

    Here Fd was specified to function init/3 as:

    {ok,Fd} = file:open(Name, ...).
    -{ok,TarDesc} = erl_tar:init(Fd, [write], ExampleFun),

    TarDesc is then used:

    erl_tar:add(TarDesc, SomeValueIwantToAdd, FileNameInTarFile),
    +   fun(write, {Fd,Data}) ->  file:write(Fd, Data);
    +      (position, {Fd,Pos}) -> file:position(Fd, Pos);
    +      (read2, {Fd,Size}) -> file:read(Fd, Size);
    +      (close, Fd) -> file:close(Fd)
    +   end

    Here Fd was specified to function init/3 as:

    {ok,Fd} = file:open(Name, ...).
    +{ok,TarDesc} = erl_tar:init(Fd, [write], ExampleFun),

    TarDesc is then used:

    erl_tar:add(TarDesc, SomeValueIwantToAdd, FileNameInTarFile),
     ...,
    -erl_tar:close(TarDesc)

    When the erl_tar core wants to, for example, write a piece of Data, it would +erl_tar:close(TarDesc)

    When the erl_tar core wants to, for example, write a piece of Data, it would call ExampleFun(write, {UserData,Data}).

    Note

    This example with the file module operations is not necessary to use directly, as that is what function open/2 in principle does.

    Warning

    The TarDescriptor term is not a file descriptor. You are advised not to rely on the specific contents of this term, as it can change in future Erlang/OTP @@ -1487,7 +1487,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/escript.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1684)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/escript.html 2026-06-04 19:05:18.653600691 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/escript.html 2026-06-04 19:05:18.655600709 +0000 @@ -522,67 +522,67 @@ number of schedulers with +S3. We also extract the different sections from the newly created script:

    > Source = "%% Demo\nmain(_Args) ->\n    io:format(\"~p\",[erlang:system_info(schedulers)]).\n".
     "%% Demo\nmain(_Args) ->\n    io:format(erlang:system_info(schedulers)).\n"
    -> io:format("~s\n", [Source]).
    +> io:format("~s\n", [Source]).
     %% Demo
    -main(_Args) ->
    -    io:format(erlang:system_info(schedulers)).
    +main(_Args) ->
    +    io:format(erlang:system_info(schedulers)).
     
     ok
    -> {ok, Bin} = escript:create(binary, [shebang, comment, {emu_args, "+S3"},
    -                                      {source, list_to_binary(Source)}]).
    -{ok,<<"#!/usr/bin/env escript\n%% This is an -*- erlang -*- file\n%%!+S3"...>>}
    -> file:write_file("demo.escript", Bin).
    +> {ok, Bin} = escript:create(binary, [shebang, comment, {emu_args, "+S3"},
    +                                      {source, list_to_binary(Source)}]).
    +{ok,<<"#!/usr/bin/env escript\n%% This is an -*- erlang -*- file\n%%!+S3"...>>}
    +> file:write_file("demo.escript", Bin).
     ok
    -> os:cmd("escript demo.escript").
    +> os:cmd("escript demo.escript").
     "3"
    -> escript:extract("demo.escript", []).
    -{ok,[{shebang,default}, {comment,default}, {emu_args,"+S3"},
    -     {source,<<"%% Demo\nmain(_Args) ->\n    io:format(erlang:system_info(schedu"...>>}]}

    An escript without header can be created as follows:

    > file:write_file("demo.erl",
    -                  ["%% demo.erl\n-module(demo).\n-export([main/1]).\n\n", Source]).
    +> escript:extract("demo.escript", []).
    +{ok,[{shebang,default}, {comment,default}, {emu_args,"+S3"},
    +     {source,<<"%% Demo\nmain(_Args) ->\n    io:format(erlang:system_info(schedu"...>>}]}

    An escript without header can be created as follows:

    > file:write_file("demo.erl",
    +                  ["%% demo.erl\n-module(demo).\n-export([main/1]).\n\n", Source]).
     ok
    -> {ok, _, BeamCode} = compile:file("demo.erl", [binary, debug_info]).
    -{ok,demo,
    +> {ok, _, BeamCode} = compile:file("demo.erl", [binary, debug_info]).
    +{ok,demo,
         <<70,79,82,49,0,0,2,208,66,69,65,77,65,116,111,109,0,0,0,
    -      79,0,0,0,9,4,100,...>>}
    -> escript:create("demo.beam", [{beam, BeamCode}]).
    +      79,0,0,0,9,4,100,...>>}
    +> escript:create("demo.beam", [{beam, BeamCode}]).
     ok
    -> escript:extract("demo.beam", []).
    -{ok,[{shebang,undefined}, {comment,undefined}, {emu_args,undefined},
    -     {beam,<<70,79,82,49,0,0,3,68,66,69,65,77,65,116,
    -             111,109,0,0,0,83,0,0,0,9,...>>}]}
    -> os:cmd("escript demo.beam").
    +> escript:extract("demo.beam", []).
    +{ok,[{shebang,undefined}, {comment,undefined}, {emu_args,undefined},
    +     {beam,<<70,79,82,49,0,0,3,68,66,69,65,77,65,116,
    +             111,109,0,0,0,83,0,0,0,9,...>>}]}
    +> os:cmd("escript demo.beam").
     "true"

    Here we create an archive script containing both Erlang code and Beam code, then we iterate over all files in the archive and collect their contents and some -information about them:

    > {ok, SourceCode} = file:read_file("demo.erl").
    -{ok,<<"%% demo.erl\n-module(demo).\n-export([main/1]).\n\n%% Demo\nmain(_Arg"...>>}
    -> escript:create("demo.escript",
    -                 [shebang,
    -                  {archive, [{"demo.erl", SourceCode},
    -                             {"demo.beam", BeamCode}], []}]).
    -ok
    -> {ok, [{shebang,default}, {comment,undefined}, {emu_args,undefined},
    -     {archive, ArchiveBin}]} = escript:extract("demo.escript", []).
    -{ok,[{shebang,default}, {comment,undefined}, {emu_args,undefined},
    -     {{archive,<<80,75,3,4,20,0,0,0,8,0,118,7,98,60,105,
    -                152,61,93,107,0,0,0,118,0,...>>}]}
    -> file:write_file("demo.zip", ArchiveBin).
    -ok
    -> zip:foldl(fun(N, I, B, A) -> [{N, I(), B()} | A] end, [], "demo.zip").
    -{ok,[{"demo.beam",
    -      {file_info,748,regular,read_write,
    -                 {{2010,3,2},{0,59,22}},
    -                 {{2010,3,2},{0,59,22}},
    -                 {{2010,3,2},{0,59,22}},
    -                 54,1,0,0,0,0,0},
    +information about them:

    > {ok, SourceCode} = file:read_file("demo.erl").
    +{ok,<<"%% demo.erl\n-module(demo).\n-export([main/1]).\n\n%% Demo\nmain(_Arg"...>>}
    +> escript:create("demo.escript",
    +                 [shebang,
    +                  {archive, [{"demo.erl", SourceCode},
    +                             {"demo.beam", BeamCode}], []}]).
    +ok
    +> {ok, [{shebang,default}, {comment,undefined}, {emu_args,undefined},
    +     {archive, ArchiveBin}]} = escript:extract("demo.escript", []).
    +{ok,[{shebang,default}, {comment,undefined}, {emu_args,undefined},
    +     {{archive,<<80,75,3,4,20,0,0,0,8,0,118,7,98,60,105,
    +                152,61,93,107,0,0,0,118,0,...>>}]}
    +> file:write_file("demo.zip", ArchiveBin).
    +ok
    +> zip:foldl(fun(N, I, B, A) -> [{N, I(), B()} | A] end, [], "demo.zip").
    +{ok,[{"demo.beam",
    +      {file_info,748,regular,read_write,
    +                 {{2010,3,2},{0,59,22}},
    +                 {{2010,3,2},{0,59,22}},
    +                 {{2010,3,2},{0,59,22}},
    +                 54,1,0,0,0,0,0},
           <<70,79,82,49,0,0,2,228,66,69,65,77,65,116,111,109,0,0,0,
    -        83,0,0,...>>},
    -     {"demo.erl",
    -      {file_info,118,regular,read_write,
    -                 {{2010,3,2},{0,59,22}},
    -                 {{2010,3,2},{0,59,22}},
    -                 {{2010,3,2},{0,59,22}},
    -                 54,1,0,0,0,0,0},
    -      <<"%% demo.erl\n-module(demo).\n-export([main/1]).\n\n%% Demo\nmain(_Arg"...>>}]}
    +
    83,0,0,...>>}, + {"demo.erl", + {file_info,118,regular,read_write, + {{2010,3,2},{0,59,22}}, + {{2010,3,2},{0,59,22}}, + {{2010,3,2},{0,59,22}}, + 54,1,0,0,0,0,0}, + <<"%% demo.erl\n-module(demo).\n-export([main/1]).\n\n%% Demo\nmain(_Arg"...>>}]}
    @@ -615,16 +615,16 @@ extracted value is set to the atom default. If a section is missing, the extracted value is set to the atom undefined.

    Option compile_source only affects the result if the escript contains source code. In this case the Erlang code is automatically compiled and -{source, BeamCode} is returned instead of {source, SourceCode}.

    Example:

    > escript:create("demo.escript",
    -                 [shebang, {archive, [{"demo.erl", SourceCode},
    -                                      {"demo.beam", BeamCode}], []}]).
    -ok
    -> {ok, [{shebang,default}, {comment,undefined}, {emu_args,undefined},
    -     {archive, ArchiveBin}]} =
    -              escript:extract("demo.escript", []).
    -{ok,[{{archive,<<80,75,3,4,20,0,0,0,8,0,118,7,98,60,105,
    -                152,61,93,107,0,0,0,118,0,...>>}
    -     {emu_args,undefined}]}
    +{source, BeamCode} is returned instead of {source, SourceCode}.

    Example:

    > escript:create("demo.escript",
    +                 [shebang, {archive, [{"demo.erl", SourceCode},
    +                                      {"demo.beam", BeamCode}], []}]).
    +ok
    +> {ok, [{shebang,default}, {comment,undefined}, {emu_args,undefined},
    +     {archive, ArchiveBin}]} =
    +              escript:extract("demo.escript", []).
    +{ok,[{{archive,<<80,75,3,4,20,0,0,0,8,0,118,7,98,60,105,
    +                152,61,93,107,0,0,0,118,0,...>>}
    +     {emu_args,undefined}]}
    @@ -682,7 +682,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/ets.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1175)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/ets.html 2026-06-04 19:05:18.708601201 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/ets.html 2026-06-04 19:05:18.709601210 +0000 @@ -220,10 +220,10 @@ find the next key is not done with such guarantees. This is often not a problem, but may cause rare subtle "unexpected" effects if a concurrent process inserts objects during a traversal. For example, consider one process -doing

    ets:new(t, [ordered_set, named_table]),
    -ets:insert(t, {1}),
    -ets:insert(t, {2}),
    -ets:insert(t, {3}),

    A concurrent call to ets:first(t), done by another process, may then in rare +doing

    ets:new(t, [ordered_set, named_table]),
    +ets:insert(t, {1}),
    +ets:insert(t, {2}),
    +ets:insert(t, {3}),

    A concurrent call to ets:first(t), done by another process, may then in rare cases return 2 even though 2 has never existed in the table ordered as the first key. In the same way, a concurrent call to ets:next(t, 1) may return 3 even though 3 never existed in the table ordered directly after 1.

    Effects like this are improbable but possible. The probability will further be @@ -236,11 +236,11 @@ lookup without any table traversal at all. For ordered_set a partially bound key will limit the traversal to only scan a subset of the table based on term order. A partially bound key is either a list or a tuple with a prefix that is -fully bound. Example:

    1> T = ets:new(t,[ordered_set]), ets:insert(T, {"555-1234", "John Smith"}).
    +fully bound. Example:

    1> T = ets:new(t,[ordered_set]), ets:insert(T, {"555-1234", "John Smith"}).
     true
     2> %% Efficient search of all with area code 555
    -2> ets:match(T,{[$5,$5,$5,$- |'$1'],'$2'}).
    -[["1234","John Smith"]]

    +2> ets:match(T,{[$5,$5,$5,$- |'$1'],'$2'}). +[["1234","John Smith"]]

    @@ -1936,19 +1936,19 @@ -include_lib("stdlib/include/ms_transform.hrl"). to the source file.

    The fun is very restricted, it can take only a single parameter (the object to match): a sole variable or a tuple. It must use the is_ guard tests. Language constructs that have no representation in a match specification (if, case, -receive, and so on) are not allowed.

    The return value is the resulting match specification.

    Example:

    1> ets:fun2ms(fun({M,N}) when N > 3 -> M end).
    -[{{'$1','$2'},[{'>','$2',3}],['$1']}]

    Variables from the environment can be imported, so that the following works:

    2> X=3.
    +receive, and so on) are not allowed.

    The return value is the resulting match specification.

    Example:

    1> ets:fun2ms(fun({M,N}) when N > 3 -> M end).
    +[{{'$1','$2'},[{'>','$2',3}],['$1']}]

    Variables from the environment can be imported, so that the following works:

    2> X=3.
     3
    -3> ets:fun2ms(fun({M,N}) when N > X -> M end).
    -[{{'$1','$2'},[{'>','$2',{const,3}}],['$1']}]

    The imported variables are replaced by match specification const expressions, +3> ets:fun2ms(fun({M,N}) when N > X -> M end). +[{{'$1','$2'},[{'>','$2',{const,3}}],['$1']}]

    The imported variables are replaced by match specification const expressions, which is consistent with the static scoping for Erlang funs. However, local or global function calls cannot be in the guard or body of the fun. Calls to -built-in match specification functions is of course allowed:

    4> ets:fun2ms(fun({M,N}) when N > X, my_fun(M) -> M end).
    +built-in match specification functions is of course allowed:

    4> ets:fun2ms(fun({M,N}) when N > X, my_fun(M) -> M end).
     Error: fun containing local Erlang function calls
    -('my_fun' called in guard) cannot be translated into match_spec
    -{error,transform_error}
    -5> ets:fun2ms(fun({M,N}) when N > X, is_atom(M) -> M end).
    -[{{'$1','$2'},[{'>','$2',{const,3}},{is_atom,'$1'}],['$1']}]

    As shown by the example, the function can be called from the shell also. The fun +('my_fun' called in guard) cannot be translated into match_spec +{error,transform_error} +5> ets:fun2ms(fun({M,N}) when N > X, is_atom(M) -> M end). +[{{'$1','$2'},[{'>','$2',{const,3}},{is_atom,'$1'}],['$1']}]

    As shown by the example, the function can be called from the shell also. The fun must be literally in the call when used from the shell as well.

    Warning

    If the parse_transform is not applied to a module that calls this pseudo function, the call fails in runtime (with a badarg). The ets module exports a function with this name, but it is never to be called except when @@ -2573,12 +2573,12 @@

    Matches the objects in table Table against pattern Pattern.

    A pattern is a term that can contain:

    • Bound parts (Erlang terms)
    • '_' that matches any Erlang term
    • Pattern variables '$N', where N=0,1,...

    The function returns a list with one element for each matching object, where -each element is an ordered list of pattern variable bindings, for example:

    6> ets:match(T, '$1'). % Matches every object in table
    -[[{rufsen,dog,7}],[{brunte,horse,5}],[{ludde,dog,5}]]
    -7> ets:match(T, {'_',dog,'$1'}).
    -[[7],[5]]
    -8> ets:match(T, {'_',cow,'$1'}).
    -[]

    If the key is specified in the pattern, the match is very efficient. If the key +each element is an ordered list of pattern variable bindings, for example:

    6> ets:match(T, '$1'). % Matches every object in table
    +[[{rufsen,dog,7}],[{brunte,horse,5}],[{ludde,dog,5}]]
    +7> ets:match(T, {'_',dog,'$1'}).
    +[[7],[5]]
    +8> ets:match(T, {'_',cow,'$1'}).
    +[]

    If the key is specified in the pattern, the match is very efficient. If the key is not specified, that is, if it is a variable or an underscore, the entire table must be searched. The search time can be substantial if the table is very large.

    For tables of type ordered_set, the result is in the same order as in a @@ -2830,10 +2830,10 @@ execution time):

    Table = ets:new...
     MatchSpec = ...
     % The following call...
    -ets:match_spec_run(ets:tab2list(Table),
    -                   ets:match_spec_compile(MatchSpec)),
    +ets:match_spec_run(ets:tab2list(Table),
    +                   ets:match_spec_compile(MatchSpec)),
     % ...gives the same result as the more common (and more efficient)
    -ets:select(Table, MatchSpec),

    Note

    This function has limited use in normal code. It is used by the dets +ets:select(Table, MatchSpec),

    Note

    This function has limited use in normal code. It is used by the dets module to perform the dets:select/1 operations and by Mnesia during transactions.

    @@ -3196,19 +3196,19 @@ format. Given that the original match specification is kept intact, the continuation can be restored, meaning it can once again be used in subsequent select/1 calls even though it has been stored on disk or on -another node.

    Examples:

    The following sequence of calls may fail:

    T=ets:new(x,[]),
    +another node.

    Examples:

    The following sequence of calls may fail:

    T=ets:new(x,[]),
     ...
    -MS = ets:fun2ms(fun({N,_}=A) when (N rem 10) =:= 0 -> A end),
    -{_,C} = ets:select(T, MS, 10),
    -MaybeBroken = binary_to_term(term_to_binary(C)),
    -ets:select(MaybeBroken).

    The following sequence works, as the call to +MS = ets:fun2ms(fun({N,_}=A) when (N rem 10) =:= 0 -> A end), +{_,C} = ets:select(T, MS, 10), +MaybeBroken = binary_to_term(term_to_binary(C)), +ets:select(MaybeBroken).

    The following sequence works, as the call to repair_continuation/2 reestablishes the -MaybeBroken continuation.

    T=ets:new(x,[]),
    +MaybeBroken continuation.

    T=ets:new(x,[]),
     ...
    -MS = ets:fun2ms(fun({N,_}=A) when (N rem 10) =:= 0 -> A end),
    -{_,C} = ets:select(T,MS,10),
    -MaybeBroken = binary_to_term(term_to_binary(C)),
    -ets:select(ets:repair_continuation(MaybeBroken,MS)).

    Note

    This function is rarely needed in application code. It is used by Mnesia to +MS = ets:fun2ms(fun({N,_}=A) when (N rem 10) =:= 0 -> A end), +{_,C} = ets:select(T,MS,10), +MaybeBroken = binary_to_term(term_to_binary(C)), +ets:select(ets:repair_continuation(MaybeBroken,MS)).

    Note

    This function is rarely needed in application code. It is used by Mnesia to provide distributed select/3 and select/1 sequences. A normal application would either use Mnesia or keep the continuation from being converted to external format.

    The actual behavior of compiled match specifications when recreated from @@ -3253,21 +3253,21 @@ to succeed even if keys are removed during the traversal. The keys for objects inserted or deleted during a traversal may or may not be returned by next/2 depending on the ordering of keys within the table and if -the key exists at the time next/2 is called.

    Example:

    clean_all_with_value(Table,X) ->
    -    safe_fixtable(Table,true),
    -    clean_all_with_value(Table,X,ets:first(Table)),
    -    safe_fixtable(Table,false).
    +the key exists at the time next/2 is called.

    Example:

    clean_all_with_value(Table,X) ->
    +    safe_fixtable(Table,true),
    +    clean_all_with_value(Table,X,ets:first(Table)),
    +    safe_fixtable(Table,false).
     
    -clean_all_with_value(Table,X,'$end_of_table') ->
    +clean_all_with_value(Table,X,'$end_of_table') ->
         true;
    -clean_all_with_value(Table,X,Key) ->
    -    case ets:lookup(Table,Key) of
    -        [{Key,X}] ->
    -            ets:delete(Table,Key);
    +clean_all_with_value(Table,X,Key) ->
    +    case ets:lookup(Table,Key) of
    +        [{Key,X}] ->
    +            ets:delete(Table,Key);
             _ ->
                 true
         end,
    -    clean_all_with_value(Table,X,ets:next(Table,Key)).

    Notice that deleted objects are not freed from a fixed table until it has been + clean_all_with_value(Table,X,ets:next(Table,Key)).

    Notice that deleted objects are not freed from a fixed table until it has been released. If a process fixes a table but never releases it, the memory used by the deleted objects is never freed. The performance of operations on the table also degrades significantly.

    To retrieve information about which processes have fixed which tables, use @@ -3355,7 +3355,7 @@ a list, so that the following code:

    ets:select(Table,[{{'$1','$2','$3'},[],['$$']}])

    gives the same output as:

    ets:select(Table,[{{'$1','$2','$3'},[],[['$1','$2','$3']]}])

    That is, all the bound variables in the match head as a list. If tuples are to be constructed, one has to write a tuple of arity 1 where the single element in the tuple is the tuple one wants to construct (as an ordinary tuple can be -mistaken for a Guard).

    Therefore the following call:

    ets:select(Table,[{{'$1','$2','$1'},[],['$_']}])

    gives the same output as:

    ets:select(Table,[{{'$1','$2','$1'},[],[{{'$1','$2','$3'}}]}])

    This syntax is equivalent to the syntax used in the trace patterns (see the +mistaken for a Guard).

    Therefore the following call:

    ets:select(Table,[{{'$1','$2','$1'},[],['$_']}])

    gives the same output as:

    ets:select(Table,[{{'$1','$2','$1'},[],[{{'$1','$2','$3'}}]}])

    This syntax is equivalent to the syntax used in the trace patterns (see the dbg) module in Runtime_Tools.

    The Guards are constructed as tuples, where the first element is the test name and the remaining elements are the test parameters. To check for a specific type (say a list) of the element bound to the match variable '$1', one would write @@ -3517,16 +3517,16 @@ object. If not, select_replace will fail with badarg without updating any objects.

    For the moment, due to performance and semantic constraints, tables of type bag are not yet supported.

    The function returns the total number of replaced objects.

    Example

    For all 2-tuples with a list in second position, add atom 'marker' first in -the list:

    1> T = ets:new(x,[]), ets:insert(T, {key, [1, 2, 3]}).
    +the list:

    1> T = ets:new(x,[]), ets:insert(T, {key, [1, 2, 3]}).
     true
    -2> MS = ets:fun2ms(fun({K, L}) when is_list(L) -> {K, [marker | L]} end).
    -[{{'$1','$2'},[{is_list,'$2'}],[{{'$1',[marker|'$2']}}]}]
    -3> ets:select_replace(T, MS).
    +2> MS = ets:fun2ms(fun({K, L}) when is_list(L) -> {K, [marker | L]} end).
    +[{{'$1','$2'},[{is_list,'$2'}],[{{'$1',[marker|'$2']}}]}]
    +3> ets:select_replace(T, MS).
     1
    -4> ets:tab2list(T).
    -[{key,[marker,1,2,3]}]

    A generic single object compare-and-swap operation:

    [Old] = ets:lookup(T, Key),
    -New = update_object(Old),
    -Success = (1 =:= ets:select_replace(T, [{Old, [], [{const, New}]}])),
    +4>
    ets:tab2list(T). +[{key,[marker,1,2,3]}]

    A generic single object compare-and-swap operation:

    [Old] = ets:lookup(T, Key),
    +New = update_object(Old),
    +Success = (1 =:= ets:select_replace(T, [{Old, [], [{const, New}]}])),
    @@ -3561,22 +3561,22 @@ ordered_set, the traversal of the table continues to objects with keys earlier in the Erlang term order. The returned list also contains objects with keys in reverse order. For all other table types, the behavior is exactly that of -select/1.

    Example:

    1> T = ets:new(x,[ordered_set]).
    -2> [ ets:insert(T,{N}) || N <- lists:seq(1,10) ].
    +select/1.

    Example:

    1> T = ets:new(x,[ordered_set]).
    +2> [ ets:insert(T,{N}) || N <- lists:seq(1,10) ].
     ...
    -3> {R0,C0} = ets:select_reverse(T,[{'_',[],['$_']}],4).
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/file_sorter.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1046))
    --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/file_sorter.html	2026-06-04 19:05:18.742601516 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/file_sorter.html	2026-06-04 19:05:18.741601507 +0000
    @@ -195,35 +195,35 @@
     argument {value, Value}. This makes it easy to initiate the sequence of output
     functions with a value calculated by the input functions.

    As an example, consider sorting the terms on a disk log file. A function that reads chunks from the disk log and returns a list of binaries is used as input. -The results are collected in a list of terms.

    sort(Log) ->
    -    {ok, _} = disk_log:open([{name,Log}, {mode,read_only}]),
    -    Input = input(Log, start),
    -    Output = output([]),
    -    Reply = file_sorter:sort(Input, Output, {format,term}),
    -    ok = disk_log:close(Log),
    +The results are collected in a list of terms.

    sort(Log) ->
    +    {ok, _} = disk_log:open([{name,Log}, {mode,read_only}]),
    +    Input = input(Log, start),
    +    Output = output([]),
    +    Reply = file_sorter:sort(Input, Output, {format,term}),
    +    ok = disk_log:close(Log),
         Reply.
     
    -input(Log, Cont) ->
    -    fun(close) ->
    +input(Log, Cont) ->
    +    fun(close) ->
                 ok;
    -       (read) ->
    -            case disk_log:chunk(Log, Cont) of
    -                {error, Reason} ->
    -                    {error, Reason};
    -                {Cont2, Terms} ->
    -                    {Terms, input(Log, Cont2)};
    -                {Cont2, Terms, _Badbytes} ->
    -                    {Terms, input(Log, Cont2)};
    +       (read) ->
    +            case disk_log:chunk(Log, Cont) of
    +                {error, Reason} ->
    +                    {error, Reason};
    +                {Cont2, Terms} ->
    +                    {Terms, input(Log, Cont2)};
    +                {Cont2, Terms, _Badbytes} ->
    +                    {Terms, input(Log, Cont2)};
                     eof ->
                         end_of_input
                 end
         end.
     
    -output(L) ->
    -    fun(close) ->
    -            lists:append(lists:reverse(L));
    -       (Terms) ->
    -            output([Terms | L])
    +output(L) ->
    +    fun(close) ->
    +            lists:append(lists:reverse(L));
    +       (Terms) ->
    +            output([Terms | L])
         end.

    For more examples of functions as input and output, see the end of the file_sorter module; the term format is implemented with functions.

    The possible values of Reason returned when an error occurs are:

    • bad_object, {bad_object, FileName} - Applying the format function failed for some binary, or the key(s) could not be extracted from some term.
    • {bad_term, FileName} - io:read/2 failed to read some term.
    • {file_error, FileName, file:posix()} - For an explanation of @@ -1914,7 +1914,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/filelib.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (915)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/filelib.html 2026-06-04 19:05:18.766601739 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/filelib.html 2026-06-04 19:05:18.767601748 +0000 @@ -1030,15 +1030,15 @@

      Sanitizes the relative path by eliminating ".." and "." components to protect against directory traversal attacks.

      Either returns the sanitized path name, or the atom unsafe if the path is unsafe. -The path is considered unsafe in the following circumstances:

      • The path is not relative.
      • A ".." component would climb up above the root of the relative path.
      • A symbolic link in the path points above the root of the relative path.

      Examples:

      1> {ok, Cwd} = file:get_cwd().
      +The path is considered unsafe in the following circumstances:

      • The path is not relative.
      • A ".." component would climb up above the root of the relative path.
      • A symbolic link in the path points above the root of the relative path.

      Examples:

      1> {ok, Cwd} = file:get_cwd().
       ...
      -2> filelib:safe_relative_path("dir/sub_dir/..", Cwd).
      +2> filelib:safe_relative_path("dir/sub_dir/..", Cwd).
       "dir"
      -3> filelib:safe_relative_path("dir/..", Cwd).
      -[]
      -4> filelib:safe_relative_path("dir/../..", Cwd).
      +3> filelib:safe_relative_path("dir/..", Cwd).
      +[]
      +4> filelib:safe_relative_path("dir/../..", Cwd).
       unsafe
      -5> filelib:safe_relative_path("/abs/path", Cwd).
      +5> filelib:safe_relative_path("/abs/path", Cwd).
       unsafe
    @@ -1138,7 +1138,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/filename.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1045)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/filename.html 2026-06-04 19:05:18.793601989 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/filename.html 2026-06-04 19:05:18.793601989 +0000 @@ -526,20 +526,20 @@

    Converts a relative Filename and returns an absolute name. No attempt is made to create the shortest absolute name, as this can give incorrect results on file -systems that allow links.

    Unix examples:

    1> pwd().
    +systems that allow links.

    Unix examples:

    1> pwd().
     "/usr/local"
    -2> filename:absname("foo").
    +2> filename:absname("foo").
     "/usr/local/foo"
    -3> filename:absname("../x").
    +3> filename:absname("../x").
     "/usr/local/../x"
    -4> filename:absname("/").
    -"/"

    Windows examples:

    1> pwd().
    +4> filename:absname("/").
    +"/"

    Windows examples:

    1> pwd().
     "D:/usr/local"
    -2> filename:absname("foo").
    +2> filename:absname("foo").
     "D:/usr/local/foo"
    -3> filename:absname("../x").
    +3> filename:absname("../x").
     "D:/usr/local/../x"
    -4> filename:absname("/").
    +4> filename:absname("/").
     "D:/"
    @@ -679,58 +679,58 @@ Opts the function will default to the native option, that is 'linux', 'darwin' or 'windows', as understood by os:type/0. Anything not recognized as 'darwin' or 'windows' is interpreted as 'linux'.

    The options 'author' and 'version' are only used with 'windows' option -mode.

    • user_cache

      The path location is intended for transient data files on a local machine.

      On Linux: Respects the os environment variable XDG_CACHE_HOME.

      1> filename:basedir(user_cache, "my_application", #{os=>linux}).
      -"/home/otptest/.cache/my_application"

      On Darwin:

      1> filename:basedir(user_cache, "my_application", #{os=>darwin}).
      -"/home/otptest/Library/Caches/my_application"

      On Windows:

      1> filename:basedir(user_cache, "My App").
      +mode.

      • user_cache

        The path location is intended for transient data files on a local machine.

        On Linux: Respects the os environment variable XDG_CACHE_HOME.

        1> filename:basedir(user_cache, "my_application", #{os=>linux}).
        +"/home/otptest/.cache/my_application"

        On Darwin:

        1> filename:basedir(user_cache, "my_application", #{os=>darwin}).
        +"/home/otptest/Library/Caches/my_application"

        On Windows:

        1> filename:basedir(user_cache, "My App").
         "c:/Users/otptest/AppData/Local/My App/Cache"
        -2> filename:basedir(user_cache, "My App").
        +2> filename:basedir(user_cache, "My App").
         "c:/Users/otptest/AppData/Local/My App/Cache"
        -3> filename:basedir(user_cache, "My App", #{author=>"Erlang"}).
        +3> filename:basedir(user_cache, "My App", #{author=>"Erlang"}).
         "c:/Users/otptest/AppData/Local/Erlang/My App/Cache"
        -4> filename:basedir(user_cache, "My App", #{version=>"1.2"}).
        +4> filename:basedir(user_cache, "My App", #{version=>"1.2"}).
         "c:/Users/otptest/AppData/Local/My App/1.2/Cache"
        -5> filename:basedir(user_cache, "My App", #{author=>"Erlang",version=>"1.2"}).
        -"c:/Users/otptest/AppData/Local/Erlang/My App/1.2/Cache"
      • user_config

        The path location is intended for persistent configuration files.

        On Linux: Respects the os environment variable XDG_CONFIG_HOME.

        2> filename:basedir(user_config, "my_application", #{os=>linux}).
        -"/home/otptest/.config/my_application"

        On Darwin:

        2> filename:basedir(user_config, "my_application", #{os=>darwin}).
        -"/home/otptest/Library/Application Support/my_application"

        On Windows:

        1> filename:basedir(user_config, "My App").
        +5> filename:basedir(user_cache, "My App", #{author=>"Erlang",version=>"1.2"}).
        +"c:/Users/otptest/AppData/Local/Erlang/My App/1.2/Cache"
      • user_config

        The path location is intended for persistent configuration files.

        On Linux: Respects the os environment variable XDG_CONFIG_HOME.

        2> filename:basedir(user_config, "my_application", #{os=>linux}).
        +"/home/otptest/.config/my_application"

        On Darwin:

        2> filename:basedir(user_config, "my_application", #{os=>darwin}).
        +"/home/otptest/Library/Application Support/my_application"

        On Windows:

        1> filename:basedir(user_config, "My App").
         "c:/Users/otptest/AppData/Roaming/My App"
        -2> filename:basedir(user_config, "My App", #{author=>"Erlang", version=>"1.2"}).
        -"c:/Users/otptest/AppData/Roaming/Erlang/My App/1.2"
      • user_data

        The path location is intended for persistent data files.

        On Linux: Respects the os environment variable XDG_DATA_HOME.

        3> filename:basedir(user_data, "my_application", #{os=>linux}).
        -"/home/otptest/.local/my_application"

        On Darwin:

        3> filename:basedir(user_data, "my_application", #{os=>darwin}).
        -"/home/otptest/Library/Application Support/my_application"

        On Windows:

        8> filename:basedir(user_data, "My App").
        +2> filename:basedir(user_config, "My App", #{author=>"Erlang", version=>"1.2"}).
        +"c:/Users/otptest/AppData/Roaming/Erlang/My App/1.2"
      • user_data

        The path location is intended for persistent data files.

        On Linux: Respects the os environment variable XDG_DATA_HOME.

        3> filename:basedir(user_data, "my_application", #{os=>linux}).
        +"/home/otptest/.local/my_application"

        On Darwin:

        3> filename:basedir(user_data, "my_application", #{os=>darwin}).
        +"/home/otptest/Library/Application Support/my_application"

        On Windows:

        8> filename:basedir(user_data, "My App").
         "c:/Users/otptest/AppData/Local/My App"
        -9> filename:basedir(user_data, "My App",#{author=>"Erlang",version=>"1.2"}).
        -"c:/Users/otptest/AppData/Local/Erlang/My App/1.2"
      • user_log

        The path location is intended for transient log files on a local machine.

        On Linux: Respects the os environment variable XDG_CACHE_HOME.

        4> filename:basedir(user_log, "my_application", #{os=>linux}).
        -"/home/otptest/.cache/my_application/log"

        On Darwin:

        4> filename:basedir(user_log, "my_application", #{os=>darwin}).
        -"/home/otptest/Library/Logs/my_application"

        On Windows:

        12> filename:basedir(user_log, "My App").
        +9> filename:basedir(user_data, "My App",#{author=>"Erlang",version=>"1.2"}).
        +"c:/Users/otptest/AppData/Local/Erlang/My App/1.2"
      • user_log

        The path location is intended for transient log files on a local machine.

        On Linux: Respects the os environment variable XDG_CACHE_HOME.

        4> filename:basedir(user_log, "my_application", #{os=>linux}).
        +"/home/otptest/.cache/my_application/log"

        On Darwin:

        4> filename:basedir(user_log, "my_application", #{os=>darwin}).
        +"/home/otptest/Library/Logs/my_application"

        On Windows:

        12> filename:basedir(user_log, "My App").
         "c:/Users/otptest/AppData/Local/My App/Logs"
        -13> filename:basedir(user_log, "My App",#{author=>"Erlang",version=>"1.2"}).
        -"c:/Users/otptest/AppData/Local/Erlang/My App/1.2/Logs"
      • site_config

        On Linux: Respects the os environment variable XDG_CONFIG_DIRS.

        5> filename:basedir(site_config, "my_application", #{os=>linux}).
        -["/usr/local/share/my_application",
        - "/usr/share/my_application"]
        -6> os:getenv("XDG_CONFIG_DIRS").
        +13> filename:basedir(user_log, "My App",#{author=>"Erlang",version=>"1.2"}).
        +"c:/Users/otptest/AppData/Local/Erlang/My App/1.2/Logs"
      • site_config

        On Linux: Respects the os environment variable XDG_CONFIG_DIRS.

        5> filename:basedir(site_config, "my_application", #{os=>linux}).
        +["/usr/local/share/my_application",
        + "/usr/share/my_application"]
        +6> os:getenv("XDG_CONFIG_DIRS").
         "/etc/xdg/xdg-ubuntu:/usr/share/upstart/xdg:/etc/xdg"
        -7> filename:basedir(site_config, "my_application", #{os=>linux}).
        -["/etc/xdg/xdg-ubuntu/my_application",
        +7> filename:basedir(site_config, "my_application", #{os=>linux}).
        +["/etc/xdg/xdg-ubuntu/my_application",
          "/usr/share/upstart/xdg/my_application",
        - "/etc/xdg/my_application"]
        -8> os:unsetenv("XDG_CONFIG_DIRS").
        + "/etc/xdg/my_application"]
        +8> os:unsetenv("XDG_CONFIG_DIRS").
         true
        -9> filename:basedir(site_config, "my_application", #{os=>linux}).
        -["/etc/xdg/my_application"]

        On Darwin:

        5> filename:basedir(site_config, "my_application", #{os=>darwin}).
        -["/Library/Application Support/my_application"]
      • site_data

        On Linux: Respects the os environment variable XDG_DATA_DIRS.

        10> os:getenv("XDG_DATA_DIRS").
        +9> filename:basedir(site_config, "my_application", #{os=>linux}).
        +["/etc/xdg/my_application"]

        On Darwin:

        5> filename:basedir(site_config, "my_application", #{os=>darwin}).
        +["/Library/Application Support/my_application"]
      • site_data

        On Linux: Respects the os environment variable XDG_DATA_DIRS.

        10> os:getenv("XDG_DATA_DIRS").
         "/usr/share/ubuntu:/usr/share/gnome:/usr/local/share/:/usr/share/"
        -11> filename:basedir(site_data, "my_application", #{os=>linux}).
        -["/usr/share/ubuntu/my_application",
        +11> filename:basedir(site_data, "my_application", #{os=>linux}).
        +["/usr/share/ubuntu/my_application",
          "/usr/share/gnome/my_application",
          "/usr/local/share/my_application",
        - "/usr/share/my_application"]
        -12> os:unsetenv("XDG_DATA_DIRS").
        + "/usr/share/my_application"]
        +12> os:unsetenv("XDG_DATA_DIRS").
         true
        -13> filename:basedir(site_data, "my_application", #{os=>linux}).
        -["/usr/local/share/my_application",
        - "/usr/share/my_application"]

        On Darwin:

        5> filename:basedir(site_data, "my_application", #{os=>darwin}).
        -["/Library/Application Support/my_application"]
      +13>
      filename:basedir(site_data, "my_application", #{os=>linux}). +["/usr/local/share/my_application", + "/usr/share/my_application"]

      On Darwin:

      5> filename:basedir(site_data, "my_application", #{os=>darwin}).
      +["/Library/Application Support/my_application"]
    @@ -759,12 +759,12 @@

    Returns the last component of Filename, or Filename itself if it does not -contain any directory separators.

    Examples:

    5> filename:basename("foo").
    +contain any directory separators.

    Examples:

    5> filename:basename("foo").
     "foo"
    -6> filename:basename("/usr/foo").
    +6> filename:basename("/usr/foo").
     "foo"
    -7> filename:basename("/").
    -[]
    +7>
    filename:basename("/"). +[]
    @@ -795,15 +795,15 @@

    Returns the last component of Filename with extension Ext stripped.

    This function is to be used to remove a (possible) specific extension. To remove an existing extension when you are unsure which one it is, use -rootname(basename(Filename)).

    Examples:

    8> filename:basename("~/src/kalle.erl", ".erl").
    +rootname(basename(Filename)).

    Examples:

    8> filename:basename("~/src/kalle.erl", ".erl").
     "kalle"
    -9> filename:basename("~/src/kalle.beam", ".erl").
    +9> filename:basename("~/src/kalle.beam", ".erl").
     "kalle.beam"
    -10> filename:basename("~/src/kalle.old.erl", ".erl").
    +10> filename:basename("~/src/kalle.old.erl", ".erl").
     "kalle.old"
    -11> filename:rootname(filename:basename("~/src/kalle.erl")).
    +11> filename:rootname(filename:basename("~/src/kalle.erl")).
     "kalle"
    -12> filename:rootname(filename:basename("~/src/kalle.beam")).
    +12> filename:rootname(filename:basename("~/src/kalle.beam")).
     "kalle"
    @@ -832,10 +832,10 @@ -

    Returns the directory part of Filename.

    Examples:

    13> filename:dirname("/usr/src/kalle.erl").
    +

    Returns the directory part of Filename.

    Examples:

    13> filename:dirname("/usr/src/kalle.erl").
     "/usr/src"
    -14> filename:dirname("kalle.erl").
    -"."
    5> filename:dirname("\\usr\\src/kalle.erl"). % Windows
    +14> filename:dirname("kalle.erl").
    +"."
    5> filename:dirname("\\usr\\src/kalle.erl"). % Windows
     "/usr/src"
    @@ -865,10 +865,10 @@

    Returns the file extension of Filename, including the period. Returns an empty -string if no extension exists.

    Examples:

    15> filename:extension("foo.erl").
    +string if no extension exists.

    Examples:

    15> filename:extension("foo.erl").
     ".erl"
    -16> filename:extension("beam.src/kalle").
    -[]
    +16>
    filename:extension("beam.src/kalle"). +[]
    @@ -928,10 +928,10 @@

    Joins a list of filename Components with directory separators. If one of the elements of Components includes an absolute path, such as "/xxx", the preceding elements, if any, are removed from the result.

    The result is "normalized":

    • Redundant directory separators are removed.
    • In Windows, all directory separators are forward slashes and the drive letter -is in lower case.

    Examples:

    17> filename:join(["/usr", "local", "bin"]).
    +is in lower case.

    Examples:

    17> filename:join(["/usr", "local", "bin"]).
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/gb_sets.html differs (HTML document, Unicode text, UTF-8 text)
    --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/gb_sets.html	2026-06-04 19:05:18.823602268 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/gb_sets.html	2026-06-04 19:05:18.822602258 +0000
    @@ -2076,7 +2076,7 @@
               Erlang programming language
     
           

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/gb_trees.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (317)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/gb_trees.html 2026-06-04 19:05:18.848602500 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/gb_trees.html 2026-06-04 19:05:18.848602500 +0000 @@ -1609,7 +1609,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/gen_event.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (661)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/gen_event.html 2026-06-04 19:05:18.886602852 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/gen_event.html 2026-06-04 19:05:18.886602852 +0000 @@ -1303,15 +1303,15 @@ but it may transform some values.

    Two possible use cases for this callback is to remove sensitive information from the state to prevent it from being printed in log files, or to compact large irrelevant status items -that would only clutter the logs.

    Example:

    format_status(Status) ->
    -  maps:map(
    -    fun(state,State) ->
    -            maps:remove(private_key, State);
    -       (message,{password, _Pass}) ->
    -            {password, removed};
    -       (_,Value) ->
    +that would only clutter the logs.

    Example:

    format_status(Status) ->
    +  maps:map(
    +    fun(state,State) ->
    +            maps:remove(private_key, State);
    +       (message,{password, _Pass}) ->
    +            {password, removed};
    +       (_,Value) ->
                 Value
    -    end, Status).

    Note

    This callback is optional, so event handler modules need not export it. + end, Status).

    Note

    This callback is optional, so event handler modules need not export it. If a handler does not export this function, the gen_event module uses the handler state directly for the purposes described below.

    If this callback is exported but fails, to hide possibly sensitive data, the default function will instead return the fact that @@ -2992,7 +2992,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/gen_fsm.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (879)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/gen_fsm.html 2026-06-04 19:05:18.926603223 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/gen_fsm.html 2026-06-04 19:05:18.927603232 +0000 @@ -135,163 +135,163 @@ Migration to gen_statem

    Here follows a simple example of turning a gen_fsm into a gen_statem. -The example comes from the previous User's Guide for gen_fsm

    -module(code_lock).
    --define(NAME, code_lock).
    +The example comes from the previous User's Guide for gen_fsm

    -module(code_lock).
    +-define(NAME, code_lock).
     %-define(BEFORE_REWRITE, true).
     
    --ifdef(BEFORE_REWRITE).
    --behaviour(gen_fsm).
    +-ifdef(BEFORE_REWRITE).
    +-behaviour(gen_fsm).
     -else.
    --behaviour(gen_statem).
    +-behaviour(gen_statem).
     -endif.
     
    --export([start_link/1, button/1, stop/0]).
    +-export([start_link/1, button/1, stop/0]).
     
    --ifdef(BEFORE_REWRITE).
    --export([init/1, locked/2, open/2, handle_sync_event/4, handle_event/3,
    -     handle_info/3, terminate/3, code_change/4]).
    +-ifdef(BEFORE_REWRITE).
    +-export([init/1, locked/2, open/2, handle_sync_event/4, handle_event/3,
    +     handle_info/3, terminate/3, code_change/4]).
     -else.
    --export([init/1, callback_mode/0, locked/3, open/3,
    -     terminate/3, code_change/4]).
    +-export([init/1, callback_mode/0, locked/3, open/3,
    +     terminate/3, code_change/4]).
     %% Add callback__mode/0
     %% Change arity of the state functions
     %% Remove handle_info/3
     -endif.
     
    --ifdef(BEFORE_REWRITE).
    -start_link(Code) ->
    -    gen_fsm:start_link({local, ?NAME}, ?MODULE, Code, []).
    +-ifdef(BEFORE_REWRITE).
    +start_link(Code) ->
    +    gen_fsm:start_link({local, ?NAME}, ?MODULE, Code, []).
     -else.
    -start_link(Code) ->
    -    gen_statem:start_link({local,?NAME}, ?MODULE, Code, []).
    +start_link(Code) ->
    +    gen_statem:start_link({local,?NAME}, ?MODULE, Code, []).
     -endif.
     
    --ifdef(BEFORE_REWRITE).
    -button(Digit) ->
    -    gen_fsm:send_event(?NAME, {button, Digit}).
    +-ifdef(BEFORE_REWRITE).
    +button(Digit) ->
    +    gen_fsm:send_event(?NAME, {button, Digit}).
     -else.
    -button(Digit) ->
    -    gen_statem:cast(?NAME, {button,Digit}).
    +button(Digit) ->
    +    gen_statem:cast(?NAME, {button,Digit}).
         %% send_event is asynchronous and becomes a cast
     -endif.
     
    --ifdef(BEFORE_REWRITE).
    -stop() ->
    -    gen_fsm:sync_send_all_state_event(?NAME, stop).
    +-ifdef(BEFORE_REWRITE).
    +stop() ->
    +    gen_fsm:sync_send_all_state_event(?NAME, stop).
     -else.
    -stop() ->
    -    gen_statem:call(?NAME, stop).
    +stop() ->
    +    gen_statem:call(?NAME, stop).
         %% sync_send is synchronous and becomes call
         %% all_state is handled by callback code in gen_statem
     -endif.
     
    -init(Code) ->
    -    do_lock(),
    -    Data = #href_anchor"ss">code => Code, remaining => Code},
    -    {ok, locked, Data}.
    +init(Code) ->
    +    do_lock(),
    +    Data = #href_anchor"ss">code => Code, remaining => Code},
    +    {ok, locked, Data}.
     
    --ifdef(BEFORE_REWRITE).
    +-ifdef(BEFORE_REWRITE).
     -else.
    -callback_mode() ->
    +callback_mode() ->
         state_functions.
     %% state_functions mode is the mode most similar to
     %% gen_fsm. There is also handle_event mode which is
     %% a fairly different concept.
     -endif.
     
    --ifdef(BEFORE_REWRITE).
    -locked({button, Digit}, Data0) ->
    -    case analyze_lock(Digit, Data0) of
    -    {open = StateName, Data} ->
    -        {next_state, StateName, Data, 10000};
    -    {StateName, Data} ->
    -        {next_state, StateName, Data}
    +-ifdef(BEFORE_REWRITE).
    +locked({button, Digit}, Data0) ->
    +    case analyze_lock(Digit, Data0) of
    +    {open = StateName, Data} ->
    +        {next_state, StateName, Data, 10000};
    +    {StateName, Data} ->
    +        {next_state, StateName, Data}
         end.
     -else.
    -locked(cast, {button,Digit}, Data0) ->
    -    case analyze_lock(Digit, Data0) of
    -    {open = StateName, Data} ->
    -        {next_state, StateName, Data, 10000};
    -    {StateName, Data} ->
    -        {next_state, StateName, Data}
    +locked(cast, {button,Digit}, Data0) ->
    +    case analyze_lock(Digit, Data0) of
    +    {open = StateName, Data} ->
    +        {next_state, StateName, Data, 10000};
    +    {StateName, Data} ->
    +        {next_state, StateName, Data}
         end;
    -locked({call, From}, Msg, Data) ->
    -    handle_call(From, Msg, Data);
    -locked({info, Msg}, StateName, Data) ->
    -    handle_info(Msg, StateName, Data).
    +locked({call, From}, Msg, Data) ->
    +    handle_call(From, Msg, Data);
    +locked({info, Msg}, StateName, Data) ->
    +    handle_info(Msg, StateName, Data).
     %% Arity differs
     %% All state events are dispatched to handle_call and handle_info help
     %% functions. If you want to handle a call or cast event specifically
     %% for this state you would add a special clause for it above.
     -endif.
     
    --ifdef(BEFORE_REWRITE).
    -open(timeout, State) ->
    -     do_lock(),
    -    {next_state, locked, State};
    -open({button,_}, Data) ->
    -    {next_state, locked, Data}.
    +-ifdef(BEFORE_REWRITE).
    +open(timeout, State) ->
    +     do_lock(),
    +    {next_state, locked, State};
    +open({button,_}, Data) ->
    +    {next_state, locked, Data}.
     -else.
    -open(timeout, _, Data) ->
    -    do_lock(),
    -    {next_state, locked, Data};
    -open(cast, {button,_}, Data) ->
    -    {next_state, locked, Data};
    -open({call, From}, Msg, Data) ->
    -    handle_call(From, Msg, Data);
    -open(info, Msg, Data) ->
    -    handle_info(Msg, open, Data).
    +open(timeout, _, Data) ->
    +    do_lock(),
    +    {next_state, locked, Data};
    +open(cast, {button,_}, Data) ->
    +    {next_state, locked, Data};
    +open({call, From}, Msg, Data) ->
    +    handle_call(From, Msg, Data);
    +open(info, Msg, Data) ->
    +    handle_info(Msg, open, Data).
     %% Arity differs
     %% All state events are dispatched to handle_call and handle_info help
     %% functions. If you want to handle a call or cast event specifically
     %% for this state you would add a special clause for it above.
     -endif.
     
    --ifdef(BEFORE_REWRITE).
    -handle_sync_event(stop, _From, _StateName, Data) ->
    -    {stop, normal, ok, Data}.
    +-ifdef(BEFORE_REWRITE).
    +handle_sync_event(stop, _From, _StateName, Data) ->
    +    {stop, normal, ok, Data}.
     
    -handle_event(Event, StateName, Data) ->
    -    {stop, {shutdown, {unexpected, Event, StateName}}, Data}.
    +handle_event(Event, StateName, Data) ->
    +    {stop, {shutdown, {unexpected, Event, StateName}}, Data}.
     
    -handle_info(Info, StateName, Data) ->
    -    {stop, {shutdown, {unexpected, Info, StateName}}, StateName, Data}.
    +handle_info(Info, StateName, Data) ->
    +    {stop, {shutdown, {unexpected, Info, StateName}}, StateName, Data}.
     -else.
     -endif.
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/gen_server.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (661))
    --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/gen_server.html	2026-06-04 19:05:18.970603631 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/gen_server.html	2026-06-04 19:05:18.970603631 +0000
    @@ -1279,15 +1279,15 @@
     but it may transform some values.

    Two possible use cases for this callback is to remove sensitive information from the state to prevent it from being printed in log files, or to compact large irrelevant status items -that would only clutter the logs.

    Example:

    format_status(Status) ->
    -  maps:map(
    -    fun(state,State) ->
    -            maps:remove(private_key, State);
    -       (message,{password, _Pass}) ->
    -            {password, removed};
    -       (_,Value) ->
    +that would only clutter the logs.

    Example:

    format_status(Status) ->
    +  maps:map(
    +    fun(state,State) ->
    +            maps:remove(private_key, State);
    +       (message,{password, _Pass}) ->
    +            {password, removed};
    +       (_,Value) ->
                 Value
    -    end, Status).

    Note

    This callback is optional, so callback modules need not export it. The + end, Status).

    Note

    This callback is optional, so callback modules need not export it. The gen_server module provides a default implementation of this function that returns the callback module state.

    If this callback is exported but fails, to hide possibly sensitive data, @@ -3008,7 +3008,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/gen_statem.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (956)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/gen_statem.html 2026-06-04 19:05:19.026604151 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/gen_statem.html 2026-06-04 19:05:19.027604160 +0000 @@ -176,7 +176,7 @@ depending on callback mode Release upgrade/downgrade -(code change) +(code change) -----> Module:code_change/4

    State callback

    The state callback for a specific state in a gen_statem is the callback function that is called for all events in this state. It is selected depending on which callback mode @@ -302,97 +302,97 @@ Pushbutton Code -

    The following is the complete callback module file pushbutton.erl:

    -module(pushbutton).
    --behaviour(gen_statem).
    +

    The following is the complete callback module file pushbutton.erl:

    -module(pushbutton).
    +-behaviour(gen_statem).
     
    --export([start/0,push/0,get_count/0,stop/0]).
    --export([terminate/3,code_change/4,init/1,callback_mode/0]).
    --export([on/3,off/3]).
    +-export([start/0,push/0,get_count/0,stop/0]).
    +-export([terminate/3,code_change/4,init/1,callback_mode/0]).
    +-export([on/3,off/3]).
     
    -name() -> pushbutton_statem. % The registered server name
    +name() -> pushbutton_statem. % The registered server name
     
     %% API.  This example uses a registered name name()
     %% and does not link to the caller.
    -start() ->
    -    gen_statem:start({local,name()}, ?MODULE, [], []).
    -push() ->
    -    gen_statem:call(name(), push).
    -get_count() ->
    -    gen_statem:call(name(), get_count).
    -stop() ->
    -    gen_statem:stop(name()).
    +start() ->
    +    gen_statem:start({local,name()}, ?MODULE, [], []).
    +push() ->
    +    gen_statem:call(name(), push).
    +get_count() ->
    +    gen_statem:call(name(), get_count).
    +stop() ->
    +    gen_statem:stop(name()).
     
     %% Mandatory callback functions
    -terminate(_Reason, _State, _Data) ->
    +terminate(_Reason, _State, _Data) ->
         void.
    -code_change(_Vsn, State, Data, _Extra) ->
    -    {ok,State,Data}.
    -init([]) ->
    +code_change(_Vsn, State, Data, _Extra) ->
    +    {ok,State,Data}.
    +init([]) ->
         %% Set the initial state + data.  Data is used only as a counter.
         State = off, Data = 0,
    -    {ok,State,Data}.
    -callback_mode() -> state_functions.
    +    {ok,State,Data}.
    +callback_mode() -> state_functions.
     
     %%% state callback(s)
     
    -off({call,From}, push, Data) ->
    +off({call,From}, push, Data) ->
         %% Go to 'on', increment count and reply
         %% that the resulting status is 'on'
    -    {next_state,on,Data+1,[{reply,From,on}]};
    -off(EventType, EventContent, Data) ->
    -    handle_event(EventType, EventContent, Data).
    +    {next_state,on,Data+1,[{reply,From,on}]};
    +off(EventType, EventContent, Data) ->
    +    handle_event(EventType, EventContent, Data).
     
    -on({call,From}, push, Data) ->
    +on({call,From}, push, Data) ->
         %% Go to 'off' and reply that the resulting status is 'off'
    -    {next_state,off,Data,[{reply,From,off}]};
    -on(EventType, EventContent, Data) ->
    -    handle_event(EventType, EventContent, Data).
    +    {next_state,off,Data,[{reply,From,off}]};
    +on(EventType, EventContent, Data) ->
    +    handle_event(EventType, EventContent, Data).
     
     %% Handle events common to all states
    -handle_event({call,From}, get_count, Data) ->
    +handle_event({call,From}, get_count, Data) ->
         %% Reply with the current count
    -    {keep_state,Data,[{reply,From,Data}]};
    -handle_event(_, _, Data) ->
    +    {keep_state,Data,[{reply,From,Data}]};
    +handle_event(_, _, Data) ->
         %% Ignore all other events
    -    {keep_state,Data}.

    The following is a shell session when running it:

    1> pushbutton:start().
    -{ok,<0.36.0>}
    -2> pushbutton:get_count().
    +    {keep_state,Data}.

    The following is a shell session when running it:

    1> pushbutton:start().
    +{ok,<0.36.0>}
    +2> pushbutton:get_count().
     0
    -3> pushbutton:push().
    +3> pushbutton:push().
     on
    -4> pushbutton:get_count().
    +4> pushbutton:get_count().
     1
    -5> pushbutton:push().
    +5> pushbutton:push().
     off
    -6> pushbutton:get_count().
    +6> pushbutton:get_count().
     1
    -7> pushbutton:stop().
    +7> pushbutton:stop().
     ok
    -8> pushbutton:push().
    +8> pushbutton:push().
     ** exception exit: {noproc,{gen_statem,call,[pushbutton_statem,push,infinity]}}
          in function  gen:do_for_proc/2 (gen.erl, line 261)
          in call from gen_statem:call/3 (gen_statem.erl, line 386)

    To compare styles, here follows the same example using callback mode handle_event_function, or rather, the code to replace after function init/1 -of the pushbutton.erl example file above:

    callback_mode() -> handle_event_function.
    +of the pushbutton.erl example file above:

    callback_mode() -> handle_event_function.
     
     %%% state callback(s)
     
    -handle_event({call,From}, push, off, Data) ->
    +handle_event({call,From}, push, off, Data) ->
         %% Go to 'on', increment count and reply
         %% that the resulting status is 'on'
    -    {next_state,on,Data+1,[{reply,From,on}]};
    -handle_event({call,From}, push, on, Data) ->
    +    {next_state,on,Data+1,[{reply,From,on}]};
    +handle_event({call,From}, push, on, Data) ->
         %% Go to 'off' and reply that the resulting status is 'off'
    -    {next_state,off,Data,[{reply,From,off}]};
    +    {next_state,off,Data,[{reply,From,off}]};
     %%
     %% Event handling common to all states
    -handle_event({call,From}, get_count, State, Data) ->
    +handle_event({call,From}, get_count, State, Data) ->
         %% Reply with the current count
    -    {next_state,State,Data,[{reply,From,Data}]};
    -handle_event(_, _, State, Data) ->
    +    {next_state,State,Data,[{reply,From,Data}]};
    +handle_event(_, _, State, Data) ->
         %% Ignore all other events
    -    {next_state,State,Data}.

    Note

    + {next_state,State,Data}.

    Note

    @@ -3177,15 +3177,15 @@ containing the same keys as the input map, but it may transform some values.

    One use case for this function is to return compact alternative state representations to avoid having large state terms printed in log files. -Another is to hide sensitive data from being written to the error log.

    Example:

    format_status(Status) ->
    -  maps:map(
    -    fun(state,State) ->
    -            maps:remove(private_key, State);
    -       (message,{password, _Pass}) ->
    -            {password, removed};
    -       (_,Value) ->
    +Another is to hide sensitive data from being written to the error log.

    Example:

    format_status(Status) ->
    +  maps:map(
    +    fun(state,State) ->
    +            maps:remove(private_key, State);
    +       (message,{password, _Pass}) ->
    +            {password, removed};
    +       (_,Value) ->
                 Value
    -    end, Status).

    Note

    This callback is optional, so a callback module does not need + end, Status).

    Note

    This callback is optional, so a callback module does not need to export it. The gen_statem module provides a default implementation of this function that returns {State, Data}.

    If this callback is exported but fails, to hide possibly sensitive data, the default function will instead return {State, Info}, @@ -3359,8 +3359,8 @@ to initialize the implementation state and server data.

    Args is the Args argument provided to that start function.

    Note

    Note that if the gen_statem is started through proc_lib and enter_loop/4,5,6, this callback will never be called. Since this callback is not optional -it can in that case be implemented as:

    -spec init(_) -> no_return().
    -init(Args) -> erlang:error(not_implemented, [Args]).
    +it can in that case be implemented as:

    -spec init(_) -> no_return().
    +init(Args) -> erlang:error(not_implemented, [Args]).

    @@ -4793,7 +4793,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/introduction.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (873)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/introduction.html 2026-06-04 19:05:19.046604336 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/introduction.html 2026-06-04 19:05:19.047604346 +0000 @@ -189,7 +189,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/io.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (876)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/io.html 2026-06-04 19:05:19.086604707 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/io.html 2026-06-04 19:05:19.086604707 +0000 @@ -148,7 +148,7 @@ Error Information

    The ErrorInfo mentioned in this module is the standard ErrorInfo structure -that is returned from all I/O modules. It has the following format:

    {ErrorLocation, Module, ErrorDescriptor}

    A string that describes the error is obtained with the following call:

    Module:format_error(ErrorDescriptor)
    +that is returned from all I/O modules. It has the following format:

    {ErrorLocation, Module, ErrorDescriptor}

    A string that describes the error is obtained with the following call:

    Module:format_error(ErrorDescriptor)
    @@ -1189,12 +1189,12 @@ no IoDevice argument is specified in the function calls in this module.

    It is sometimes desirable to use an explicit IoDevice argument that refers to the default I/O device. This is the case with functions that can access either a file or the default I/O device. The atom standard_io has this -special meaning. The following example illustrates this:

    27> io:read('enter>').
    +special meaning. The following example illustrates this:

    27> io:read('enter>').
     enter>foo.
    -{ok,foo}
    -28> io:read(standard_io, 'enter>').
    +{ok,foo}
    +28> io:read(standard_io, 'enter>').
     enter>bar.
    -{ok,bar}

    By default all I/O sent to standard_io will end up in the user +{ok,bar}

    By default all I/O sent to standard_io will end up in the user I/O device of the node that spawned the calling process.

    standard_io is an alias for group_leader/0, so in order to change where the default input/output requests are sent you can change the group leader of the current process using @@ -1469,33 +1469,33 @@ whitespace characters are stripped. An Erlang string (list of characters) is returned.

    If Unicode translation is in effect (~ts), characters > 255 are accepted, otherwise not. With the translation modifier, the returned list can as a -consequence also contain integers > 255:

    1> io:fread("Prompt> ","~s").
    +consequence also contain integers > 255:

    1> io:fread("Prompt> ","~s").
     Prompt> <Characters beyond latin1 range not printable in this medium>
    -{error,{fread,string}}
    -2> io:fread("Prompt> ","~ts").
    +{error,{fread,string}}
    +2> io:fread("Prompt> ","~ts").
     Prompt> <Characters beyond latin1 range not printable in this medium>
    -{ok,[[1091,1085,1080,1094,1086,1076,1077]]}
  • a - Similar to s, but the resulting string is converted into an +{ok,[[1091,1085,1080,1094,1086,1076,1077]]}

  • a - Similar to s, but the resulting string is converted into an atom.

  • c - The number of characters equal to the field width are read (default is 1) and returned as an Erlang string. However, leading and trailing whitespace characters are not omitted as they are with s. All -characters are returned.

    The Unicode translation modifier works as with s:

    1> io:fread("Prompt> ","~c").
    +characters are returned.

    The Unicode translation modifier works as with s:

    1> io:fread("Prompt> ","~c").
     Prompt> <Character beyond latin1 range not printable in this medium>
    -{error,{fread,string}}
    -2> io:fread("Prompt> ","~tc").
    +{error,{fread,string}}
    +2> io:fread("Prompt> ","~tc").
     Prompt> <Character beyond latin1 range not printable in this medium>
    -{ok,[[1091]]}
  • l - Returns the number of characters that have been scanned up to that +{ok,[[1091]]}

  • l - Returns the number of characters that have been scanned up to that point, including whitespace characters.

  • The function returns:
    • {ok, Terms} - The read was successful and Terms is the list of successfully matched and read items.

    • eof - End of file was encountered.

    • {error, FreadError} - The reading failed and FreadError gives a hint about the error.

    • {error, ErrorDescription} - The read operation failed and parameter -ErrorDescription gives a hint about the error.

    Examples:

    20> io:fread('enter>', "~f~f~f").
    +ErrorDescription gives a hint about the error.

    Examples:

    20> io:fread('enter>', "~f~f~f").
     enter>1.9 35.5e3 15.0
    -{ok,[1.9,3.55e4,15.0]}
    -21> io:fread('enter>', "~10f~d").
    +{ok,[1.9,3.55e4,15.0]}
    +21> io:fread('enter>', "~10f~d").
     enter>     5.67899
    -{ok,[5.678,99]}
    -22> io:fread('enter>', ":~10s:~10c:").
    +{ok,[5.678,99]}
    +22> io:fread('enter>', ":~10s:~10c:").
     enter>:   alan   :   joe    :
    -{ok, ["alan", "   joe    "]}
    +
    {ok, ["alan", " joe "]}
    @@ -1584,7 +1584,7 @@ the output device, and control sequences for formatting, see below. If Format is an atom or a binary, it is first converted to a list with the aid of atom_to_list/1 or -binary_to_list/1. Example:

    1> io:fwrite("Hello world!~n", []).
    +binary_to_list/1. Example:

    1> io:fwrite("Hello world!~n", []).
     Hello world!
     ok

    The general format of a control sequence is ~F.P.PadModC.

    The character C determines the type of control sequence to be used. It is the only required field. All of F, P, Pad, and Mod are optional. For @@ -1602,25 +1602,25 @@ padding character is ' ' (space).

  • Mod is the control sequence modifier. This is one or more characters that change the interpretation of Data.

    The current modifiers are:

    • t - For Unicode translation.

    • l - For stopping p and P from detecting printable characters.

    • k - For use with p, P, w, and W to format maps in map-key ordered order (see maps:iterator_order/0).

    • K - Similar to k, for formatting maps in map-key order, but takes an -extra argument that specifies the maps:iterator_order/0.

      For example:

      > M = #{ a => 1, b => 2 }.
      -#{a => 1,b => 2}
      -> io:format("~Kp~n", [reversed, M]).
      -#{b => 2,a => 1}
      +extra argument that specifies the maps:iterator_order/0.

      For example:

      > M = #{ a => 1, b => 2 }.
      +#{a => 1,b => 2}
      +> io:format("~Kp~n", [reversed, M]).
      +#{b => 2,a => 1}
       ok
  • If F, P, or Pad is a * character, the next argument in Data is used as -the value. For example:

    1> io:fwrite("~*.*.0f~n",[9, 5, 3.14159265]).
    +the value. For example:

    1> io:fwrite("~*.*.0f~n",[9, 5, 3.14159265]).
     003.14159
    -ok

    To use a literal * character as Pad, it must be passed as an argument:

    2> io:fwrite("~*.*.*f~n",[9, 5, $*, 3.14159265]).
    +ok

    To use a literal * character as Pad, it must be passed as an argument:

    2> io:fwrite("~*.*.*f~n",[9, 5, $*, 3.14159265]).
     **3.14159
     ok

    Available control sequences:

    • ~ - Character ~ is written.

    • c - The argument is a number that is interpreted as an ASCII code. The precision is the number of times the character is printed and defaults to the -field width, which in turn defaults to 1. Example:

      1> io:fwrite("|~10.5c|~-10.5c|~5c|~n", [$a, $b, $c]).
      +field width, which in turn defaults to 1. Example:

      1> io:fwrite("|~10.5c|~-10.5c|~5c|~n", [$a, $b, $c]).
       |     aaaaa|bbbbb     |ccccc|
       ok

      If the Unicode translation modifier (t) is in effect, the integer argument can be any number representing a valid Unicode codepoint, otherwise it is to -be an integer less than or equal to 255, otherwise it is masked with 16#FF:

      2> io:fwrite("~tc~n",[1024]).
      -\x{400}
      +be an integer less than or equal to 255, otherwise it is masked with 16#FF:

      2> io:fwrite("~tc~n",[1024]).
      +\x{400}
       ok
      -3> io:fwrite("~c~n",[1024]).
      +3> io:fwrite("~c~n",[1024]).
       ^@
       ok
    • f - The argument is a float that is written as [-]ddd.ddd, where the precision is the number of digits after the decimal point. The default @@ -1638,18 +1638,18 @@ binaries are in UTF-8. The characters are printed without quotes. The string is first truncated by the specified precision and then padded and justified to the specified field width. The default precision is the field width.

      This format can be used for printing any object and truncating the output so -it fits a specified field:

      1> io:fwrite("|~10w|~n", [{hey, hey, hey}]).
      +it fits a specified field:

      1> io:fwrite("|~10w|~n", [{hey, hey, hey}]).
       |**********|
       ok
      -2> io:fwrite("|~10s|~n", [io_lib:write({hey, hey, hey})]).
      -|{hey,hey,h|
      -3> io:fwrite("|~-10.8s|~n", [io_lib:write({hey, hey, hey})]).
      -|{hey,hey  |
      +2> io:fwrite("|~10s|~n", [io_lib:write({hey, hey, hey})]).
      +|{hey,hey,h|
      +3> io:fwrite("|~-10.8s|~n", [io_lib:write({hey, hey, hey})]).
      +|{hey,hey  |
       ok

      A list with integers > 255 is considered an error if the Unicode translation -modifier is not specified:

      4> io:fwrite("~ts~n",[[1024]]).
      -\x{400}
      +modifier is not specified:

      4> io:fwrite("~ts~n",[[1024]]).
      +\x{400}
       ok
      -5> io:fwrite("~s~n",[[1024]]).
      +5> io:fwrite("~s~n",[[1024]]).
       ** exception error: bad argument
            in function  io:format/3
               called as io:format(<0.53.0>,"~s~n",[[1024]])
    • w - Writes data with the standard syntax. This is used to output Erlang @@ -1660,122 +1660,122 @@ breaks terms whose printed representation is longer than one line into many lines and indents each line sensibly. Left-justification is not supported. It also tries to detect flat lists of printable characters and output these as -strings. For example:

      1> T = [{attributes,[[{id,age,1.50000},{mode,explicit},
      -{typename,"INTEGER"}], [{id,cho},{mode,explicit},{typename,'Cho'}]]},
      -{typename,'Person'},{tag,{'PRIVATE',3}},{mode,implicit}].
      +strings. For example:

      1> T = [{attributes,[[{id,age,1.50000},{mode,explicit},
      +{typename,"INTEGER"}], [{id,cho},{mode,explicit},{typename,'Cho'}]]},
      +{typename,'Person'},{tag,{'PRIVATE',3}},{mode,implicit}].
       ...
      -2> io:fwrite("~w~n", [T]).
      -[{attributes,[[{id,age,1.5},{mode,explicit},{typename,
      -[73,78,84,69,71,69,82]}],[{id,cho},{mode,explicit},{typena
      -me,'Cho'}]]},{typename,'Person'},{tag,{'PRIVATE',3}},{mode
      -,implicit}]
      +2> io:fwrite("~w~n", [T]).
      +[{attributes,[[{id,age,1.5},{mode,explicit},{typename,
      +[73,78,84,69,71,69,82]}],[{id,cho},{mode,explicit},{typena
      +me,'Cho'}]]},{typename,'Person'},{tag,{'PRIVATE',3}},{mode
      +,implicit}]
       ok
      -3> io:fwrite("~62p~n", [T]).
      -[{attributes,[[{id,age,1.5},
      -               {mode,explicit},
      -               {typename,"INTEGER"}],
      -              [{id,cho},{mode,explicit},{typename,'Cho'}]]},
      - {typename,'Person'},
      - {tag,{'PRIVATE',3}},
      - {mode,implicit}]
      +3> io:fwrite("~62p~n", [T]).
      +[{attributes,[[{id,age,1.5},
      +               {mode,explicit},
      +               {typename,"INTEGER"}],
      +              [{id,cho},{mode,explicit},{typename,'Cho'}]]},
      + {typename,'Person'},
      + {tag,{'PRIVATE',3}},
      + {mode,implicit}]
       ok

      The field width specifies the maximum line length. It defaults to 80. The precision specifies the initial indentation of the term. It defaults to the number of characters printed on this line in the same call to write/1 or -format/1,2,3. For example, using T above:

      4> io:fwrite("Here T = ~62p~n", [T]).
      -Here T = [{attributes,[[{id,age,1.5},
      -                        {mode,explicit},
      -                        {typename,"INTEGER"}],
      -                       [{id,cho},
      -                        {mode,explicit},
      -                        {typename,'Cho'}]]},
      -          {typename,'Person'},
      -          {tag,{'PRIVATE',3}},
      -          {mode,implicit}]
      +format/1,2,3. For example, using T above:

      4> io:fwrite("Here T = ~62p~n", [T]).
      /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/io_lib.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1437))
      --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/io_lib.html	2026-06-04 19:05:19.116604986 +0000
      +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/io_lib.html	2026-06-04 19:05:19.116604986 +0000
      @@ -1032,8 +1032,8 @@
       input is needed to complete the original format string. RestFormat is the
       remaining format string, Nchars is the number of characters scanned, and
       InputStack is the reversed list of inputs matched up to that point.

    • {error, What} - The read operation failed and parameter What gives a -hint about the error.

    Example:

    3> io_lib:fread("~f~f~f", "15.6 17.3e-6 24.5").
    -{ok,[15.6,1.73e-5,24.5],[]}
    +hint about the error.

    Example:

    3> io_lib:fread("~f~f~f", "15.6 17.3e-6 24.5").
    +{ok,[15.6,1.73e-5,24.5],[]}
    @@ -1538,11 +1538,11 @@ "...".

    Depth defaults to -1, which means no limitation. Option CharsLimit puts a soft limit on the number of characters returned. When the number of characters is reached, remaining structures are replaced by "...". CharsLimit defaults to -1, -which means no limit on the number of characters returned.

    Example:

    1> lists:flatten(io_lib:write({1,[2],[3],[4,5],6,7,8,9})).
    +which means no limit on the number of characters returned.

    Example:

    1> lists:flatten(io_lib:write({1,[2],[3],[4,5],6,7,8,9})).
     "{1,[2],[3],[4,5],6,7,8,9}"
    -2> lists:flatten(io_lib:write({1,[2],[3],[4,5],6,7,8,9}, 5)).
    +2> lists:flatten(io_lib:write({1,[2],[3],[4,5],6,7,8,9}, 5)).
     "{1,[2],[3],[...],...}"
    -3> lists:flatten(io_lib:write({[1,2,3],[4,5],6,7,8,9}, [{chars_limit,20}])).
    +3> lists:flatten(io_lib:write({[1,2,3],[4,5],6,7,8,9}, [{chars_limit,20}])).
     "{[1,2|...],[4|...],...}"
    @@ -1811,7 +1811,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/io_protocol.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (977)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/io_protocol.html 2026-06-04 19:05:19.148605282 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/io_protocol.html 2026-06-04 19:05:19.148605282 +0000 @@ -146,8 +146,8 @@ Protocol Basics

    As described in Robert's paper, I/O servers and clients communicate using -io_request/io_reply tuples as follows:

    {io_request, From, ReplyAs, Request}
    -{io_reply, ReplyAs, Reply}

    The client sends an io_request tuple to the I/O server and the server +io_request/io_reply tuples as follows:

    {io_request, From, ReplyAs, Request}
    +{io_reply, ReplyAs, Reply}

    The client sends an io_request tuple to the I/O server and the server eventually sends a corresponding io_reply tuple.

    • From is the pid/0 of the client, the process which the I/O server sends the I/O reply to.

    • ReplyAs can be any datum and is returned in the corresponding io_reply. The io module monitors the I/O server and uses the monitor reference as @@ -164,8 +164,8 @@ Output Requests -

      To output characters on an I/O device, the following Requests exist:

      {put_chars, Encoding, Characters}
      -{put_chars, Encoding, Module, Function, Args}
      • Encoding is unicode or latin1, meaning that the characters are (in case +

        To output characters on an I/O device, the following Requests exist:

        {put_chars, Encoding, Characters}
        +{put_chars, Encoding, Module, Function, Args}
        • Encoding is unicode or latin1, meaning that the characters are (in case of binaries) encoded as UTF-8 or ISO Latin-1 (pure bytes). A well-behaved I/O server is also to return an error indication if list elements contain integers > 255 when Encoding is set to latin1.

          Notice that this does not in any way tell how characters are to be put on the @@ -191,7 +191,7 @@ Input Requests -

          To read characters from an I/O device, the following Requests exist:

          {get_until, Encoding, Prompt, Module, Function, ExtraArgs}
          • Encoding denotes how data is to be sent back to the client and what data is +

            To read characters from an I/O device, the following Requests exist:

            {get_until, Encoding, Prompt, Module, Function, ExtraArgs}
            • Encoding denotes how data is to be sent back to the client and what data is sent to the function denoted by Module/Function/ExtraArgs. If the function supplied returns data as a list, the data is converted to this encoding. If the function supplied returns data in some other format, no @@ -207,8 +207,8 @@ nothing being written to the I/O device).

            • Module, Function, and ExtraArgs denote a function and arguments to determine when enough data is written. The function is to take two more arguments, the last state, and a list of characters. The function is to return -one of:

              {done, Result, RestChars}
              -{more, Continuation}

              Result can be any Erlang term, but if it is a list/0, the I/O server can +one of:

              {done, Result, RestChars}
              +{more, Continuation}

              Result can be any Erlang term, but if it is a list/0, the I/O server can convert it to a binary/0 of appropriate format before returning it to the client, if the I/O server is set in binary mode (see below).

              The function is called with the data the I/O server finds on its I/O device, returning one of:

              • {done, Result, RestChars} when enough data is read. In this case Result @@ -218,28 +218,28 @@ characters are available. When no more characters are available, the function must return {done, eof, Rest}. The initial state is the empty list. The data when an end of file is reached on the IO device is the atom eof.

                An emulation of the get_line request can be (inefficiently) implemented -using the following functions:

                -module(demo).
                --export([until_newline/3, get_line/1]).
                +using the following functions:

                -module(demo).
                +-export([until_newline/3, get_line/1]).
                 
                -until_newline(_ThisFar,eof,_MyStopCharacter) ->
                -    {done,eof,[]};
                -until_newline(ThisFar,CharList,MyStopCharacter) ->
                +until_newline(_ThisFar,eof,_MyStopCharacter) ->
                +    {done,eof,[]};
                +until_newline(ThisFar,CharList,MyStopCharacter) ->
                     case
                -        lists:splitwith(fun(X) -> X =/= MyStopCharacter end,  CharList)
                +        lists:splitwith(fun(X) -> X =/= MyStopCharacter end,  CharList)
                     of
                -  {L,[]} ->
                -            {more,ThisFar++L};
                -  {L2,[MyStopCharacter|Rest]} ->
                -      {done,ThisFar++L2++[MyStopCharacter],Rest}
                +  {L,[]} ->
                +            {more,ThisFar++L};
                +  {L2,[MyStopCharacter|Rest]} ->
                +      {done,ThisFar++L2++[MyStopCharacter],Rest}
                     end.
                 
                -get_line(IoServer) ->
                -    IoServer ! {io_request,
                -                self(),
                +get_line(IoServer) ->
                +    IoServer ! {io_request,
                +                self(),
                                 IoServer,
                -                {get_until, unicode, '', ?MODULE, until_newline, [$\n]}},
                +                {get_until, unicode, '', ?MODULE, until_newline, [$\n]}},
                     receive
                -        {io_reply, IoServer, Data} ->
                +        {io_reply, IoServer, Data} ->
                       Data
                     end.

                Notice that the last element in the Request tuple ([$\n]) is appended to the argument list when the function is called. The function is to be called @@ -277,10 +277,10 @@ must be able to handle binary data. For convenience, the modes of an I/O server can be set and retrieved using the following I/O requests:

                {setopts, Opts}
                • Opts is a list of options in the format recognized by the proplists module (and by the I/O server).

                As an example, the I/O server for the interactive shell (in group.erl) -understands the following options:

                {binary, boolean()} (or binary/list)
                -{echo, boolean()}
                -{expand_fun, fun()}
                -{encoding, unicode/latin1} (or unicode/latin1)

                Options binary and encoding are common for all I/O servers in OTP, while +understands the following options:

                {binary, boolean()} (or binary/list)
                +{echo, boolean()}
                +{expand_fun, fun()}
                +{encoding, unicode/latin1} (or unicode/latin1)

                Options binary and encoding are common for all I/O servers in OTP, while echo and expand are valid only for this I/O server. Option unicode notifies how characters are put on the physical I/O device, that is, if the terminal itself is Unicode-aware. It does not affect how characters are sent in @@ -303,9 +303,9 @@ continue until one of the requests results in an error or the list is consumed. The result of the last request is sent back to the client.

              The I/O server can, for a list of requests, send any of the following valid results in the reply, depending on the requests in the list:

              ok
              -{ok, Data}
              -{ok, Options}
              -{error, Error}

              +{ok, Data} +{ok, Options} +{error, Error}

    @@ -335,128 +335,128 @@ process handling incoming requests, usually both I/O-requests and other I/O device-specific requests (positioning, closing, and so on).

    The example I/O server stores characters in an ETS table, making up a fairly crude RAM file.

    The module begins with the usual directives, a function to start the I/O server -and a main loop handling the requests:

    -module(ets_io_server).
    +and a main loop handling the requests:

    -module(ets_io_server).
     
    --export([start_link/0, init/0, loop/1, until_newline/3, until_enough/3]).
    +-export([start_link/0, init/0, loop/1, until_newline/3, until_enough/3]).
     
    --define(CHARS_PER_REC, 10).
    +-define(CHARS_PER_REC, 10).
     
    --record(state, {
    +-record(state, {
     	  table,
     	  position, % absolute
     	  mode % binary | list
    -	 }).
    +	 }).
     
    -start_link() ->
    -    spawn_link(?MODULE,init,[]).
    +start_link() ->
    +    spawn_link(?MODULE,init,[]).
     
    -init() ->
    -    Table = ets:new(noname,[ordered_set]),
    -    ?MODULE:loop(#href_anchor"ss">state{table = Table, position = 0, mode=list}).
    +init() ->
    +    Table = ets:new(noname,[ordered_set]),
    +    ?MODULE:loop(#href_anchor"ss">state{table = Table, position = 0, mode=list}).
     
    -loop(State) ->
    +loop(State) ->
         receive
    -	{io_request, From, ReplyAs, Request} ->
    -	    case request(Request,State) of
    -		{Tag, Reply, NewState} when Tag =:= ok; Tag =:= error ->
    -		    reply(From, ReplyAs, Reply),
    -		    ?MODULE:loop(NewState);
    -		{stop, Reply, _NewState} ->
    -		    reply(From, ReplyAs, Reply),
    -		    exit(Reply)
    +	{io_request, From, ReplyAs, Request} ->
    +	    case request(Request,State) of
    +		{Tag, Reply, NewState} when Tag =:= ok; Tag =:= error ->
    +		    reply(From, ReplyAs, Reply),
    +		    ?MODULE:loop(NewState);
    +		{stop, Reply, _NewState} ->
    +		    reply(From, ReplyAs, Reply),
    +		    exit(Reply)
     	    end;
     	%% Private message
    -	{From, rewind} ->
    -	    From ! {self(), ok},
    -	    ?MODULE:loop(State#state{position = 0});
    +	{From, rewind} ->
    +	    From ! {self(), ok},
    +	    ?MODULE:loop(State#state{position = 0});
     	_Unknown ->
    -	    ?MODULE:loop(State)
    +	    ?MODULE:loop(State)
         end.

    The main loop receives messages from the client (which can use the the io module to send requests). For each request, the function request/2 is called and a reply is eventually sent using function reply/3.

    The "private" message {From, rewind} results in the current position in the pseudo-file to be reset to 0 (the beginning of the "file"). This is a typical example of I/O device-specific messages not being part of the I/O protocol. It is usually a bad idea to embed such private messages in io_request tuples, as -that can confuse the reader.

    First, we examine the reply function:

    reply(From, ReplyAs, Reply) ->
    -    From ! {io_reply, ReplyAs, Reply}.

    It sends the io_reply tuple back to the client, providing element ReplyAs +that can confuse the reader.

    First, we examine the reply function:

    reply(From, ReplyAs, Reply) ->
    +    From ! {io_reply, ReplyAs, Reply}.

    It sends the io_reply tuple back to the client, providing element ReplyAs received in the request along with the result of the request, as described -earlier.

    We need to handle some requests. First the requests for writing characters:

    request({put_chars, Encoding, Chars}, State) ->
    -    put_chars(unicode:characters_to_list(Chars,Encoding),State);
    -request({put_chars, Encoding, Module, Function, Args}, State) ->
    +earlier.

    We need to handle some requests. First the requests for writing characters:

    request({put_chars, Encoding, Chars}, State) ->
    +    put_chars(unicode:characters_to_list(Chars,Encoding),State);
    +request({put_chars, Encoding, Module, Function, Args}, State) ->
         try
    -	request({put_chars, Encoding, apply(Module, Function, Args)}, State)
    +	request({put_chars, Encoding, apply(Module, Function, Args)}, State)
         catch
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/json.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1547))
    --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/json.html	2026-06-04 19:05:19.177605551 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/json.html	2026-06-04 19:05:19.178605561 +0000
    @@ -991,8 +991,8 @@
       
       Example
     

    -
    > json:decode(<<"{\"foo\": 1}">>).
    -#{<<"foo">> => 1}
    +
    > json:decode(<<"{\"foo\": 1}">>).
    +#{<<"foo">> => 1}
    @@ -1044,9 +1044,9 @@ Example -

    Decoding object keys as atoms:

    > Push = fun(Key, Value, Acc) -> [{binary_to_existing_atom(Key), Value} | Acc] end.
    -> json:decode(<<"{\"foo\": 1}">>, ok, #{object_push => Push}).
    -{#{foo => 1},ok,<<>>}
    +

    Decoding object keys as atoms:

    > Push = fun(Key, Value, Acc) -> [{binary_to_existing_atom(Key), Value} | Acc] end.
    +> json:decode(<<"{\"foo\": 1}">>, ok, #{object_push => Push}).
    +{#{foo => 1},ok,<<>>}
    @@ -1079,11 +1079,11 @@

    Continue parsing a stream of bytes of a JSON value.

    Similar to decode_start/3, if the function returns {continue, State} and -there is no more data, use end_of_input instead of a binary.

    > {continue, State} = json:decode_start(<<"{\"foo\":">>, ok, #{}).
    -> json:decode_continue(<<"1}">>, State).
    -{#{foo => 1},ok,<<>>}
    > {continue, State} = json:decode_start(<<"123">>, ok, #{}).
    -> json:decode_continue(end_of_input, State).
    -{123,ok,<<>>}
    +there is no more data, use end_of_input instead of a binary.

    > {continue, State} = json:decode_start(<<"{\"foo\":">>, ok, #{}).
    +> json:decode_continue(<<"1}">>, State).
    +{#{foo => 1},ok,<<>>}
    > {continue, State} = json:decode_start(<<"123">>, ok, #{}).
    +> json:decode_continue(end_of_input, State).
    +{123,ok,<<>>}
    @@ -1153,7 +1153,7 @@ Examples -
    > iolist_to_binary(json:encode(#{foo => <<"bar">>})).
    +
    > iolist_to_binary(json:encode(#{foo => <<"bar">>})).
     <<"{\"foo\":\"bar\"}">>
    @@ -1195,10 +1195,10 @@ Examples

    An encoder that uses a heuristic to differentiate object-like -lists of key-value pairs from plain lists:

    > encoder([{_, _} | _] = Value, Encode) -> json:encode_key_value_list(Value, Encode);
    -> encoder(Other, Encode) -> json:encode_value(Other, Encode).
    -> custom_encode(Value) -> json:encode(Value, fun(Value, Encode) -> encoder(Value, Encode) end).
    -> iolist_to_binary(custom_encode([{a, []}, {b, 1}])).
    +lists of key-value pairs from plain lists:

    > encoder([{_, _} | _] = Value, Encode) -> json:encode_key_value_list(Value, Encode);
    +> encoder(Other, Encode) -> json:encode_value(Other, Encode).
    +> custom_encode(Value) -> json:encode(Value, fun(Value, Encode) -> encoder(Value, Encode) end).
    +> iolist_to_binary(custom_encode([{a, []}, {b, 1}])).
     <<"{\"a\":[],\"b\":1}">>
    @@ -1590,11 +1590,11 @@ -

    Generates formatted JSON corresponding to Term.

    Similiar to encode/1 but with added whitespaces for formatting.

    > io:put_chars(json:format(#{foo => <<"bar">>, baz => 52})).
    -{
    +

    Generates formatted JSON corresponding to Term.

    Similiar to encode/1 but with added whitespaces for formatting.

    > io:put_chars(json:format(#{foo => <<"bar">>, baz => 52})).
    +{
       "baz": 52,
       "foo": "bar"
    -}
    +}
     ok
    @@ -1659,20 +1659,20 @@

    Generates formatted JSON corresponding to Term.

    Similar to encode/2, can be customised with the Encoder callback and Options.

    Options can include 'indent' to specify number of spaces per level and 'max' which loosely limits the width of lists.

    The Encoder will get a 'State' argument which contains the 'Options' maps merged with other data when recursing through 'Term'.

    format_value/3 or various encode_* functions in this module can be used -to help in constructing such callbacks.

    > formatter({posix_time, SysTimeSecs}, Encode, State) ->
    -    TimeStr = calendar:system_time_to_rfc3339(SysTimeSecs, [{offset, "Z"}]),
    -    json:format_value(unicode:characters_to_binary(TimeStr), Encode, State);
    -> formatter(Other, Encode, State) -> json:format_value(Other, Encode, State).
    +to help in constructing such callbacks.

    > formatter({posix_time, SysTimeSecs}, Encode, State) ->
    +    TimeStr = calendar:system_time_to_rfc3339(SysTimeSecs, [{offset, "Z"}]),
    +    json:format_value(unicode:characters_to_binary(TimeStr), Encode, State);
    +> formatter(Other, Encode, State) -> json:format_value(Other, Encode, State).
     >
    -> Fun = fun(Value, Encode, State) -> formatter(Value, Encode, State) end.
    -> Options = #{indent => 4}.
    -> Term = #{id => 1, time => {posix_time, erlang:system_time(seconds)}}.
    +> Fun = fun(Value, Encode, State) -> formatter(Value, Encode, State) end.
    +> Options = #{indent => 4}.
    +> Term = #{id => 1, time => {posix_time, erlang:system_time(seconds)}}.
     >
    -> io:put_chars(json:format(Term, Fun, Options)).
    -{
    +> io:put_chars(json:format(Term, Fun, Options)).
    +{
         "id": 1,
         "time": "2024-05-23T16:07:48Z"
    -}
    +}
     ok
    @@ -1733,7 +1733,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/lists.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1413)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/lists.html 2026-06-04 19:05:19.223605978 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/lists.html 2026-06-04 19:05:19.222605969 +0000 @@ -1167,8 +1167,8 @@ -

    Returns a list in which all the sublists of ListOfLists have been appended.

    Example:

    > lists:append([[1, 2, 3], [a, b], [4, 5, 6]]).
    -[1,2,3,a,b,4,5,6]
    +

    Returns a list in which all the sublists of ListOfLists have been appended.

    Example:

    > lists:append([[1, 2, 3], [a, b], [4, 5, 6]]).
    +[1,2,3,a,b,4,5,6]
    @@ -1197,7 +1197,7 @@

    Returns a new list List3, which is made from the elements of List1 followed -by the elements of List2.

    Example:

    > lists:append("abc", "def").
    +by the elements of List2.

    Example:

    > lists:append("abc", "def").
     "abcdef"

    lists:append(A, B) is equivalent to A ++ B.

    @@ -1228,7 +1228,7 @@

    Concatenates the text representation of the elements of Things. The elements -of Things can be atoms, integers, floats, or strings.

    Example:

    > lists:concat([doc, '/', file, '.', 3]).
    +of Things can be atoms, integers, floats, or strings.

    Example:

    > lists:concat([doc, '/', file, '.', 3]).
     "doc/file.3"
    @@ -1347,8 +1347,8 @@ -

    Returns a list containing N copies of term Elem.

    Example:

    > lists:duplicate(5, xx).
    -[xx,xx,xx,xx,xx]
    +

    Returns a list containing N copies of term Elem.

    Example:

    > lists:duplicate(5, xx).
    +[xx,xx,xx,xx,xx]
    @@ -1449,12 +1449,12 @@

    Returns List1 with each element H replaced by a tuple of form {I, H} where I is the position of H in List1. The enumeration starts with Index and increases by Step in each step.

    That is, enumerate/3 behaves as if it had been defined as -follows:

    enumerate(I, S, List) ->
    -  {List1, _ } = lists:mapfoldl(fun(T, Acc) -> {{Acc, T}, Acc+S} end, I, List),
    -  List1.

    The default values for Index and Step are both 1.

    Examples:

    > lists:enumerate([a,b,c]).
    -[{1,a},{2,b},{3,c}]
    > lists:enumerate(10, [a,b,c]).
    -[{10,a},{11,b},{12,c}]
    > lists:enumerate(0, -2, [a,b,c]).
    -[{0,a},{-2,b},{-4,c}]
    +follows:

    enumerate(I, S, List) ->
    +  {List1, _ } = lists:mapfoldl(fun(T, Acc) -> {{Acc, T}, Acc+S} end, I, List),
    +  List1.

    The default values for Index and Step are both 1.

    Examples:

    > lists:enumerate([a,b,c]).
    +[{1,a},{2,b},{3,c}]
    > lists:enumerate(10, [a,b,c]).
    +[{10,a},{11,b},{12,c}]
    > lists:enumerate(0, -2, [a,b,c]).
    +[{0,a},{-2,b},{-4,c}]
    @@ -1523,15 +1523,15 @@

    Calls Fun(Elem) on successive elements Elem of List1 in order to update or remove elements from List1.

    Fun/1 must return either a Boolean or a tuple {true, Value}. The function returns the list of elements for which Fun returns a new value, where a value -of true is synonymous with {true, Elem}.

    That is, filtermap behaves as if it had been defined as follows:

    filtermap(Fun, List1) ->
    -    lists:foldr(fun(Elem, Acc) ->
    -                       case Fun(Elem) of
    +of true is synonymous with {true, Elem}.

    That is, filtermap behaves as if it had been defined as follows:

    filtermap(Fun, List1) ->
    +    lists:foldr(fun(Elem, Acc) ->
    +                       case Fun(Elem) of
                                false -> Acc;
    -                           true -> [Elem|Acc];
    -                           {true,Value} -> [Value|Acc]
    +                           true -> [Elem|Acc];
    +                           {true,Value} -> [Value|Acc]
                            end
    -                end, [], List1).

    Example:

    > lists:filtermap(fun(X) -> case X rem 2 of 0 -> {true, X div 2}; _ -> false end end, [1,2,3,4,5]).
    -[1,2]
    +
    end, [], List1).

    Example:

    > lists:filtermap(fun(X) -> case X rem 2 of 0 -> {true, X div 2}; _ -> false end end, [1,2,3,4,5]).
    +[1,2]
    @@ -1590,9 +1590,9 @@

    Takes a function from As to lists of Bs, and a list of As (List1) and produces a list of Bs by applying the function to every element in List1 and -appending the resulting lists.

    That is, flatmap behaves as if it had been defined as follows:

    flatmap(Fun, List1) ->
    -    append(map(Fun, List1)).

    Example:

    > lists:flatmap(fun(X)->[X,X] end, [a,b,c]).
    -[a,a,b,b,c,c]
    +appending the resulting lists.

    That is, flatmap behaves as if it had been defined as follows:

    flatmap(Fun, List1) ->
    +    append(map(Fun, List1)).

    Example:

    > lists:flatmap(fun(X)->[X,X] end, [a,b,c]).
    +[a,a,b,b,c,c]
    @@ -1688,9 +1688,9 @@

    Calls Fun(Elem, AccIn) on successive elements A of List, starting with AccIn == Acc0. Fun/2 must return a new accumulator, which is passed to the next call. The function returns the final value of the accumulator. Acc0 is -returned if the list is empty.

    Example:

    > lists:foldl(fun(X, Sum) -> X + Sum end, 0, [1,2,3,4,5]).
    +returned if the list is empty.

    Example:

    > lists:foldl(fun(X, Sum) -> X + Sum end, 0, [1,2,3,4,5]).
     15
    -> lists:foldl(fun(X, Prod) -> X * Prod end, 1, [1,2,3,4,5]).
    +> lists:foldl(fun(X, Prod) -> X * Prod end, 1, [1,2,3,4,5]).
     120
    @@ -1727,11 +1727,11 @@ -

    Like foldl/3, but the list is traversed from right to left.

    Example:

    > P = fun(A, AccIn) -> io:format("~p ", [A]), AccIn end.
    +

    Like foldl/3, but the list is traversed from right to left.

    Example:

    > P = fun(A, AccIn) -> io:format("~p ", [A]), AccIn end.
     #Fun<erl_eval.12.2225172>
    -> lists:foldl(P, void, [1,2,3]).
    +> lists:foldl(P, void, [1,2,3]).
     1 2 3 void
    -> lists:foldr(P, void, [1,2,3]).
    +> lists:foldr(P, void, [1,2,3]).
     3 2 1 void

    foldl/3 is tail recursive and is usually preferred to foldr/3.

    @@ -1794,12 +1794,12 @@

    Inserts Sep between each element in List1. Has no effect on the empty list -and on a singleton list. For example:

    > lists:join(x, [a,b,c]).
    -[a,x,b,x,c]
    -> lists:join(x, [a]).
    -[a]
    -> lists:join(x, []).
    -[]
    +and on a singleton list. For example:

    > lists:join(x, [a,b,c]).
    +[a,x,b,x,c]
    +> lists:join(x, [a]).
    +[a]
    +> lists:join(x, []).
    +[]
    @@ -1900,10 +1900,10 @@

    Returns a list of tuples where, for each tuple in TupleList1, the Nth element Term1 of the tuple has been replaced with the result of calling -Fun(Term1).

    Examples:

    > Fun = fun(Atom) -> atom_to_list(Atom) end.
    +Fun(Term1).

    Examples:

    > Fun = fun(Atom) -> atom_to_list(Atom) end.
     #Fun<erl_eval.6.10732646>
    -2> lists:keymap(Fun, 2, [{name,jane,22},{name,lizzie,20},{name,lydia,15}]).
    -[{name,"jane",22},{name,"lizzie",20},{name,"lydia",15}]
    +2>
    lists:keymap(Fun, 2, [{name,jane,22},{name,lizzie,20},{name,lydia,15}]). +[{name,"jane",22},{name,"lizzie",20},{name,"lydia",15}]
    @@ -2244,9 +2244,9 @@ -

    Combines the operations of map/2 and foldl/3 into one pass.

    Example:

    Summing the elements in a list and double them at the same time:

    > lists:mapfoldl(fun(X, Sum) -> {2*X, X+Sum} end,
    -0, [1,2,3,4,5]).
    -{[2,4,6,8,10],15}
    +

    Combines the operations of map/2 and foldl/3 into one pass.

    Example:

    Summing the elements in a list and double them at the same time:

    > lists:mapfoldl(fun(X, Sum) -> {2*X, X+Sum} end,
    +0, [1,2,3,4,5]).
    +{[2,4,6,8,10],15}
    @@ -2538,7 +2538,7 @@ -

    Returns the Nth element of List.

    Example:

    > lists:nth(3, [a, b, c, d, e]).
    +

    Returns the Nth element of List.

    Example:

    > lists:nth(3, [a, b, c, d, e]).
     c
    @@ -2568,14 +2568,14 @@

    Returns the Nth tail of List, that is, the sublist of List starting at -N+1 and continuing up to the end of the list.

    Example

    > lists:nthtail(3, [a, b, c, d, e]).
    -[d,e]
    -> tl(tl(tl([a, b, c, d, e]))).
    -[d,e]
    -> lists:nthtail(0, [a, b, c, d, e]).
    -[a,b,c,d,e]
    -> lists:nthtail(5, [a, b, c, d, e]).
    -[]
    +N+1 and continuing up to the end of the list.

    Example

    > lists:nthtail(3, [a, b, c, d, e]).
    +[d,e]
    +> tl(tl(tl([a, b, c, d, e]))).
    +[d,e]
    +> lists:nthtail(0, [a, b, c, d, e]).
    +[a,b,c,d,e]
    +> lists:nthtail(5, [a, b, c, d, e]).
    +[]
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/log_mf_h.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/log_mf_h.html 2026-06-04 19:05:19.242606154 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/log_mf_h.html 2026-06-04 19:05:19.242606154 +0000 @@ -459,7 +459,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/maps.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1832)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/maps.html 2026-06-04 19:05:19.273606442 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/maps.html 2026-06-04 19:05:19.273606442 +0000 @@ -745,10 +745,10 @@

    Returns a map Map for which predicate Pred holds true in MapOrIter.

    The call fails with a {badmap,Map} exception if MapOrIter is not a map or -valid iterator, or with badarg if Pred is not a function of arity 2.

    Example:

    > M = #{a => 2, b => 3, c=> 4, "a" => 1, "b" => 2, "c" => 4},
    -  Pred = fun(K,V) -> is_atom(K) andalso (V rem 2) =:= 0 end,
    -  maps:filter(Pred,M).
    -#{a => 2,c => 4}
    +valid iterator, or with badarg if Pred is not a function of arity 2.

    Example:

    > M = #{a => 2, b => 3, c=> 4, "a" => 1, "b" => 2, "c" => 4},
    +  Pred = fun(K,V) -> is_atom(K) andalso (V rem 2) =:= 0 end,
    +  maps:filter(Pred,M).
    +#{a => 2,c => 4}
    @@ -787,10 +787,10 @@ map. If it returns false, the association is not copied. If it returns {true, NewValue}, the value for Key is replaced with NewValue in the result map.

    The call fails with a {badmap,Map} exception if MapOrIter is not a map or -valid iterator, or with badarg if Fun is not a function of arity 2.

    Example:

    > Fun = fun(K,V) when is_atom(K) -> {true, V*2}; (_,V) -> (V rem 2) =:= 0 end,
    -  Map = #{k1 => 1, "k2" => 2, "k3" => 3},
    -  maps:filtermap(Fun,Map).
    -#{k1 => 2,"k2" => 2}
    +valid iterator, or with badarg if Fun is not a function of arity 2.

    Example:

    > Fun = fun(K,V) when is_atom(K) -> {true, V*2}; (_,V) -> (V rem 2) =:= 0 end,
    +  Map = #{k1 => 1, "k2" => 2, "k3" => 3},
    +  maps:filtermap(Fun,Map).
    +#{k1 => 2,"k2" => 2}
    @@ -821,10 +821,10 @@

    Returns a tuple {ok, Value}, where Value is the value associated with Key, -or error if no value is associated with Key in Map.

    The call fails with a {badmap,Map} exception if Map is not a map.

    Example:

    > Map = #{"hi" => 42},
    +or error if no value is associated with Key in Map.

    The call fails with a {badmap,Map} exception if Map is not a map.

    Example:

    > Map = #{"hi" => 42},
       Key = "hi",
    -  maps:find(Key,Map).
    -{ok,42}
    +
    maps:find(Key,Map). +{ok,42}
    @@ -865,9 +865,9 @@ which is passed to the next successive call. This function returns the final value of the accumulator. The initial accumulator value Init is returned if the map is empty.

    The call fails with a {badmap,Map} exception if MapOrIter is not a map or -valid iterator, or with badarg if Fun is not a function of arity 3.

    Example:

    > Fun = fun(K,V,AccIn) when is_list(K) -> AccIn + V end,
    -  Map = #{"k1" => 1, "k2" => 2, "k3" => 3},
    -  maps:fold(Fun,0,Map).
    +valid iterator, or with badarg if Fun is not a function of arity 3.

    Example:

    > Fun = fun(K,V,AccIn) when is_list(K) -> AccIn + V end,
    +  Map = #{"k1" => 1, "k2" => 2, "k3" => 3},
    +  maps:fold(Fun,0,Map).
     6
    @@ -934,8 +934,8 @@

    Takes a list of keys and a value and builds a map where all keys point to the -same value. The key can be in any order, and keys and value can be of any term.

    Example:

    > Keys = ["a", "b", "c"], maps:from_keys(Keys, ok).
    -#{"a" => ok,"b" => ok,"c" => ok}
    +same value. The key can be in any order, and keys and value can be of any term.

    Example:

    > Keys = ["a", "b", "c"], maps:from_keys(Keys, ok).
    +#{"a" => ok,"b" => ok,"c" => ok}
    @@ -967,9 +967,9 @@

    Takes a list of key-value tuples elements and builds a map. The associations can be in any order, and both keys and values in the association can be of any term.

    If the same key appears more than once, the latter (right-most) value is used -and the previous values are ignored.

    Example:

    > List = [{"a",ignored},{1337,"value two"},{42,value_three},{"a",1}],
    -  maps:from_list(List).
    -#{42 => value_three,1337 => "value two","a" => 1}
    +and the previous values are ignored.

    Example:

    > List = [{"a",ignored},{1337,"value two"},{42,value_three},{"a",1}],
    +  maps:from_list(List).
    +#{42 => value_three,1337 => "value two","a" => 1}
    @@ -1001,8 +1001,8 @@

    Returns value Value associated with Key if Map contains Key.

    The call fails with a {badmap,Map} exception if Map is not a map, or with a {badkey,Key} exception if no value is associated with Key.

    Example:

    > Key = 1337,
    -  Map = #{42 => value_two,1337 => "value one","a" => 1},
    -  maps:get(Key,Map).
    +  Map = #{42 => value_two,1337 => "value one","a" => 1},
    +  maps:get(Key,Map).
     "value one"
    @@ -1034,11 +1034,11 @@

    Returns value Value associated with Key if Map contains Key. If no value -is associated with Key, Default is returned.

    The call fails with a {badmap,Map} exception if Map is not a map.

    Example:

    > Map = #{ key1 => val1, key2 => val2 }.
    -#{key1 => val1,key2 => val2}
    -> maps:get(key1, Map, "Default value").
    +is associated with Key, Default is returned.

    The call fails with a {badmap,Map} exception if Map is not a map.

    Example:

    > Map = #{ key1 => val1, key2 => val2 }.
    +#{key1 => val1,key2 => val2}
    +> maps:get(key1, Map, "Default value").
     val1
    -> maps:get(key3, Map, "Default value").
    +> maps:get(key3, Map, "Default value").
     "Default value"
    @@ -1078,11 +1078,11 @@

    Partitions the given List into a map of groups.

    The result is a map where each key is given by KeyFun and each value is a list of elements from the given List for which KeyFun returned the same key.

    The order of elements within each group list is preserved from the original -list.

    Examples:

    > EvenOdd = fun(X) -> case X rem 2 of 0 -> even; 1 -> odd end end,
    -maps:groups_from_list(EvenOdd, [1, 2, 3]).
    -#{even => [2], odd => [1, 3]}
    -> maps:groups_from_list(fun erlang:length/1, ["ant", "buffalo", "cat", "dingo"]).
    -#{3 => ["ant", "cat"], 5 => ["dingo"], 7 => ["buffalo"]}
    +list.

    Examples:

    > EvenOdd = fun(X) -> case X rem 2 of 0 -> even; 1 -> odd end end,
    +maps:groups_from_list(EvenOdd, [1, 2, 3]).
    +#{even => [2], odd => [1, 3]}
    +> maps:groups_from_list(fun erlang:length/1, ["ant", "buffalo", "cat", "dingo"]).
    +#{3 => ["ant", "cat"], 5 => ["dingo"], 7 => ["buffalo"]}
    @@ -1124,15 +1124,15 @@

    Partitions the given List into a map of groups.

    The result is a map where each key is given by KeyFun and each value is a list of elements from the given List, mapped via ValueFun, for which KeyFun returned the same key.

    The order of elements within each group list is preserved from the original -list.

    Examples:

    > EvenOdd = fun(X) -> case X rem 2 of 0 -> even; 1 -> odd end end,
    -> Square = fun(X) -> X * X end,
    -> maps:groups_from_list(EvenOdd, Square, [1, 2, 3]).
    -#{even => [4], odd => [1, 9]}
    -> maps:groups_from_list(
    +list.

    Examples:

    > EvenOdd = fun(X) -> case X rem 2 of 0 -> even; 1 -> odd end end,
    +> Square = fun(X) -> X * X end,
    +> maps:groups_from_list(EvenOdd, Square, [1, 2, 3]).
    +#{even => [4], odd => [1, 9]}
    +> maps:groups_from_list(
         fun erlang:length/1,
         fun lists:reverse/1,
    -    ["ant", "buffalo", "cat", "dingo"]).
    -#{3 => ["tna", "tac"],5 => ["ognid"],7 => ["olaffub"]}
    +
    ["ant", "buffalo", "cat", "dingo"]). +#{3 => ["tna", "tac"],5 => ["ognid"],7 => ["olaffub"]}
    @@ -1164,10 +1164,10 @@

    Intersects two maps into a single map Map3. If a key exists in both maps, the -value in Map1 is superseded by the value in Map2.

    The call fails with a {badmap,Map} exception if Map1 or Map2 is not a map.

    Example:

    > Map1 = #{a => "value_one", b => "value_two"},
    -  Map2 = #{a => 1, c => 2},
    -  maps:intersect(Map1,Map2).
    -#{a => 1}
    +value in Map1 is superseded by the value in Map2.

    The call fails with a {badmap,Map} exception if Map1 or Map2 is not a map.

    Example:

    > Map1 = #{a => "value_one", b => "value_two"},
    +  Map2 = #{a => 1, c => 2},
    +  maps:intersect(Map1,Map2).
    +#{a => 1}
    @@ -1207,10 +1207,10 @@ the value from Map1 is the second parameter, and the value from Map2 is the third parameter.

    The call fails with a {badmap,Map} exception if Map1 or Map2 is not a map. The call fails with a badarg exception if Combiner is not a fun that takes -three arguments.

    Example:

    > Map1 = #{a => "value_one", b => "value_two"},
    -  Map2 = #{a => 1, c => 2},
    -  maps:intersect_with(fun(_Key, Value1, Value2) -> {Value1, Value2} end, Map1, Map2).
    -#{a => {"value_one",1}}
    +three arguments.

    Example:

    > Map1 = #{a => "value_one", b => "value_two"},
    +  Map2 = #{a => 1, c => 2},
    +  maps:intersect_with(fun(_Key, Value1, Value2) -> {Value1, Value2} end, Map1, Map2).
    +#{a => {"value_one",1}}
    @@ -1241,11 +1241,11 @@

    Returns true if map Map contains Key and returns false if it does not -contain the Key.

    The call fails with a {badmap,Map} exception if Map is not a map.

    Example:

    > Map = #{"42" => value}.
    -#{"42" => value}
    -> maps:is_key("42",Map).
    +contain the Key.

    The call fails with a {badmap,Map} exception if Map is not a map.

    Example:

    > Map = #{"42" => value}.
    +#{"42" => value}
    +> maps:is_key("42",Map).
     true
    -> maps:is_key(value,Map).
    +> maps:is_key(value,Map).
     false
    @@ -1278,15 +1278,15 @@

    Returns a map iterator Iterator that can be used by maps:next/1 to traverse the key-value associations in a map. When iterating over a map, the /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/math.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (343)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/math.html 2026-06-04 19:05:19.296606655 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/math.html 2026-06-04 19:05:19.296606655 +0000 @@ -1194,7 +1194,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/ms_transform.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (2060)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/ms_transform.html 2026-06-04 19:05:19.323606906 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/ms_transform.html 2026-06-04 19:05:19.323606906 +0000 @@ -154,31 +154,31 @@ table and construct a list of tuples containing relevant parts of the data in these rows. One can use ets:foldl/3 instead, but the ets:select/2 call is far more efficient. Without the translation provided by ms_transform, one must -struggle with writing match specifications terms to accommodate this.

    Consider a simple table of employees:

    -record(emp, {empno,     %Employee number as a string, the key
    +struggle with writing match specifications terms to accommodate this.

    Consider a simple table of employees:

    -record(emp, {empno,     %Employee number as a string, the key
                   surname,   %Surname of the employee
                   givenname, %Given name of employee
                   dept,      %Department, one of {dev,sales,prod,adm}
    -              empyear}). %Year the employee was employed

    We create the table using:

    ets:new(emp_tab, [{keypos,#emp.empno},named_table,ordered_set]).

    We fill the table with randomly chosen data:

    [{emp,"011103","Black","Alfred",sales,2000},
    - {emp,"041231","Doe","John",prod,2001},
    - {emp,"052341","Smith","John",dev,1997},
    - {emp,"076324","Smith","Ella",sales,1995},
    - {emp,"122334","Weston","Anna",prod,2002},
    - {emp,"535216","Chalker","Samuel",adm,1998},
    - {emp,"789789","Harrysson","Joe",adm,1996},
    - {emp,"963721","Scott","Juliana",dev,2003},
    - {emp,"989891","Brown","Gabriel",prod,1999}]

    Assuming that we want the employee numbers of everyone in the sales department, -there are several ways.

    ets:match/2 can be used:

    1> ets:match(emp_tab, {'_', '$1', '_', '_', sales, '_'}).
    -[["011103"],["076324"]]

    ets:match/2 uses a simpler type of match specification, but it is still + empyear}). %Year the employee was employed

    We create the table using:

    ets:new(emp_tab, [{keypos,#emp.empno},named_table,ordered_set]).

    We fill the table with randomly chosen data:

    [{emp,"011103","Black","Alfred",sales,2000},
    + {emp,"041231","Doe","John",prod,2001},
    + {emp,"052341","Smith","John",dev,1997},
    + {emp,"076324","Smith","Ella",sales,1995},
    + {emp,"122334","Weston","Anna",prod,2002},
    + {emp,"535216","Chalker","Samuel",adm,1998},
    + {emp,"789789","Harrysson","Joe",adm,1996},
    + {emp,"963721","Scott","Juliana",dev,2003},
    + {emp,"989891","Brown","Gabriel",prod,1999}]

    Assuming that we want the employee numbers of everyone in the sales department, +there are several ways.

    ets:match/2 can be used:

    1> ets:match(emp_tab, {'_', '$1', '_', '_', sales, '_'}).
    +[["011103"],["076324"]]

    ets:match/2 uses a simpler type of match specification, but it is still unreadable, and one has little control over the returned result. It is always a -list of lists.

    ets:foldl/3 or ets:foldr/3 can be used to avoid the nested lists:

    ets:foldr(fun(#emp{empno = E, dept = sales},Acc) -> [E | Acc];
    -             (_,Acc) -> Acc
    +list of lists.

    ets:foldl/3 or ets:foldr/3 can be used to avoid the nested lists:

    ets:foldr(fun(#emp{empno = E, dept = sales},Acc) -> [E | Acc];
    +             (_,Acc) -> Acc
               end,
    -          [],
    -          emp_tab).

    The result is ["011103","076324"]. The fun is straightforward, so the only + [], + emp_tab).

    The result is ["011103","076324"]. The fun is straightforward, so the only problem is that all the data from the table must be transferred from the table to the calling process for filtering. That is inefficient compared to the ets:match/2 call where the filtering can be done "inside" the emulator and -only the result is transferred to the process.

    Consider a "pure" ets:select/2 call that does what ets:foldr does:

    ets:select(emp_tab, [{#emp{empno = '$1', dept = sales, _='_'},[],['$1']}]).

    Although the record syntax is used, it is still hard to read and even harder to +only the result is transferred to the process.

    Consider a "pure" ets:select/2 call that does what ets:foldr does:

    ets:select(emp_tab, [{#emp{empno = '$1', dept = sales, _='_'},[],['$1']}]).

    Although the record syntax is used, it is still hard to read and even harder to write. The first element of the tuple, #emp{empno = '$1', dept = sales, _='_'}, tells what to match. Elements not matching this are not returned, as in the ets:match/2 example. The second @@ -189,12 +189,12 @@ hence the employee number is returned. The result is ["011103","076324"], as in the ets:foldr/3 example, but the result is retrieved much more efficiently in terms of execution speed and memory consumption.

    Using ets:fun2ms/1, we can combine the ease of use of the ets:foldr/3 and -the efficiency of the pure ets:select/2 example:

    -include_lib("stdlib/include/ms_transform.hrl").
    +the efficiency of the pure ets:select/2 example:

    -include_lib("stdlib/include/ms_transform.hrl").
     
    -ets:select(emp_tab, ets:fun2ms(
    -                      fun(#emp{empno = E, dept = sales}) ->
    +ets:select(emp_tab, ets:fun2ms(
    +                      fun(#emp{empno = E, dept = sales}) ->
                                   E
    -                      end)).

    This example requires no special knowledge of match specifications to + end)).

    This example requires no special knowledge of match specifications to understand. The head of the fun matches what you want to filter out and the body returns what you want returned. As long as the fun can be kept within the limits of the match specifications, there is no need to transfer all table data to the @@ -216,22 +216,22 @@

    Assume that we want to get all the employee numbers of employees hired before year 2000. Using ets:match/2 is not an alternative here, as relational operators cannot be expressed there. Once again, ets:foldr/3 can do it -(slowly, but correct):

    ets:foldr(fun(#emp{empno = E, empyear = Y},Acc) when Y < 2000 -> [E | Acc];
    -                  (_,Acc) -> Acc
    +(slowly, but correct):

    ets:foldr(fun(#emp{empno = E, empyear = Y},Acc) when Y < 2000 -> [E | Acc];
    +                  (_,Acc) -> Acc
               end,
    -          [],
    -          emp_tab).

    The result is ["052341","076324","535216","789789","989891"], as expected. The + [], + emp_tab).

    The result is ["052341","076324","535216","789789","989891"], as expected. The equivalent expression using a handwritten match specification would look like -this:

    ets:select(emp_tab, [{#emp{empno = '$1', empyear = '$2', _='_'},
    -                     [{'<', '$2', 2000}],
    -                     ['$1']}]).

    This gives the same result. [{'<', '$2', 2000}] is in the guard part and +this:

    ets:select(emp_tab, [{#emp{empno = '$1', empyear = '$2', _='_'},
    +                     [{'<', '$2', 2000}],
    +                     ['$1']}]).

    This gives the same result. [{'<', '$2', 2000}] is in the guard part and therefore discards anything that does not have an empyear (bound to '$2' in -the head) less than 2000, as the guard in the foldr/3 example.

    We write it using ets:fun2ms/1:

    -include_lib("stdlib/include/ms_transform.hrl").
    +the head) less than 2000, as the guard in the foldr/3 example.

    We write it using ets:fun2ms/1:

    -include_lib("stdlib/include/ms_transform.hrl").
     
    -ets:select(emp_tab, ets:fun2ms(
    -                      fun(#emp{empno = E, empyear = Y}) when Y < 2000 ->
    +ets:select(emp_tab, ets:fun2ms(
    +                      fun(#emp{empno = E, empyear = Y}) when Y < 2000 ->
                                E
    -                      end)).

    + end)).

    @@ -239,11 +239,11 @@

    Assume that we want the whole object matching instead of only one element. One alternative is to assign a variable to every part of the record and build it up -once again in the body of the fun, but the following is easier:

    ets:select(emp_tab, ets:fun2ms(
    -                      fun(Obj = #emp{empno = E, empyear = Y})
    +once again in the body of the fun, but the following is easier:

    ets:select(emp_tab, ets:fun2ms(
    +                      fun(Obj = #emp{empno = E, empyear = Y})
                              when Y < 2000 ->
                                   Obj
    -                      end)).

    As in ordinary Erlang matching, you can bind a variable to the whole matched + end)).

    As in ordinary Erlang matching, you can bind a variable to the whole matched object using a "match inside the match", that is, a =. Unfortunately in funs translated to match specifications, it is allowed only at the "top-level", that is, matching the whole object arriving to be matched into a separate variable. @@ -258,10 +258,10 @@

    This example concerns the body of the fun. Assume that all employee numbers beginning with zero (0) must be changed to begin with one (1) instead, and -that we want to create the list [{<Old empno>,<New empno>}]:

    ets:select(emp_tab, ets:fun2ms(
    -                      fun(#emp{empno = [$0 | Rest] }) ->
    -                              {[$0|Rest],[$1|Rest]}
    -                      end)).

    This query hits the feature of partially bound keys in table type ordered_set, +that we want to create the list [{<Old empno>,<New empno>}]:

    ets:select(emp_tab, ets:fun2ms(
    +                      fun(#emp{empno = [$0 | Rest] }) ->
    +                              {[$0|Rest],[$1|Rest]}
    +                      end)).

    This query hits the feature of partially bound keys in table type ordered_set, so that not the whole table needs to be searched, only the part containing keys beginning with 0 is looked into.

    @@ -274,24 +274,24 @@ {rookie, <employee number>}.
  • For all other employees, return {newbie, <employee number>}, except for those named Smith as they would be affronted by anything other than the tag guru and that is also what is returned for their numbers: -{guru, <employee number>}.
  • This is accomplished as follows:

    ets:select(emp_tab, ets:fun2ms(
    -                      fun(#emp{empno = E, surname = "Smith" }) ->
    -                              {guru,E};
    -                         (#emp{empno = E, empyear = Y}) when Y < 1997  ->
    -                              {inventory, E};
    -                         (#emp{empno = E, empyear = Y}) when Y > 2001  ->
    -                              {newbie, E};
    -                         (#emp{empno = E, empyear = Y}) -> % 1997 -- 2001
    -                              {rookie, E}
    -                      end)).

    The result is as follows:

    [{rookie,"011103"},
    - {rookie,"041231"},
    - {guru,"052341"},
    - {guru,"076324"},
    - {newbie,"122334"},
    - {rookie,"535216"},
    - {inventory,"789789"},
    - {newbie,"963721"},
    - {rookie,"989891"}]

    +{guru, <employee number>}.

    This is accomplished as follows:

    ets:select(emp_tab, ets:fun2ms(
    +                      fun(#emp{empno = E, surname = "Smith" }) ->
    +                              {guru,E};
    +                         (#emp{empno = E, empyear = Y}) when Y < 1997  ->
    +                              {inventory, E};
    +                         (#emp{empno = E, empyear = Y}) when Y > 2001  ->
    +                              {newbie, E};
    +                         (#emp{empno = E, empyear = Y}) -> % 1997 -- 2001
    +                              {rookie, E}
    +                      end)).

    The result is as follows:

    [{rookie,"011103"},
    + {rookie,"041231"},
    + {guru,"052341"},
    + {guru,"076324"},
    + {newbie,"122334"},
    + {rookie,"535216"},
    + {inventory,"789789"},
    + {newbie,"963721"},
    + {rookie,"989891"}]

    @@ -338,18 +338,18 @@ more, as filtering using Erlang code is not a good idea when tracing (except afterwards, if you trace to file). The concept is similar to that of ets:fun2ms/1 except that you usually use it directly from the shell (which can -also be done with ets:fun2ms/1).

    The following is an example module to trace on:

    -module(toy).
    +also be done with ets:fun2ms/1).

    The following is an example module to trace on:

    -module(toy).
     
    --export([start/1, store/2, retrieve/1]).
    +-export([start/1, store/2, retrieve/1]).
     
    -start(Args) ->
    -    toy_table = ets:new(toy_table, Args).
    +start(Args) ->
    +    toy_table = ets:new(toy_table, Args).
     
    -store(Key, Value) ->
    -    ets:insert(toy_table, {Key,Value}).
    +store(Key, Value) ->
    +    ets:insert(toy_table, {Key,Value}).
     
    -retrieve(Key) ->
    -    [{Key, Value}] = ets:lookup(toy_table, Key),
    +retrieve(Key) ->
    +    [{Key, Value}] = ets:lookup(toy_table, Key),
         Value.

    During model testing, the first test results in {badmatch,16} in /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/notes.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (3320)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/notes.html 2026-06-04 19:05:19.390607527 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/notes.html 2026-06-04 19:05:19.391607537 +0000 @@ -202,8 +202,8 @@ Improvements and New Features

    • The functions is_equal/2, map/2, and filtermap/2 have been added to the modules sets, ordsets, and gb_sets.

      Own Id: OTP-18622 Aux Id: PR-7183, PR-7232

    • The compiler now emits nicer error message for function head mismatches. -For example, given:

      a() -> ok;
      -a(_) -> error.

      Erlang/OTP 26 and earlier would emit a diagnostic similar to:

      t.erl:6:1: head mismatch
      +For example, given:

      a() -> ok;
      +a(_) -> error.

      Erlang/OTP 26 and earlier would emit a diagnostic similar to:

      t.erl:6:1: head mismatch
       %    6| a(_) -> error.
       %     | ^

      while in Erlang/OTP 27 the diagnostic is similar to:

      t.erl:6:1: head mismatch: function a with arities 0 and 1 is regarded as two distinct functions. Is the number of arguments incorrect or is the semicolon in a/0 unwanted?
       %    6| a(_) -> error.
      @@ -236,12 +236,12 @@
       shell:prompt_width/1 have been exported to help with custom prompt implementations.

      Own Id: OTP-18834 Aux Id: PR-7675

    • The shell now pages long output from the documentation help command (h(Module)), auto completions and the search command.

      Own Id: OTP-18846 Aux Id: PR-7845

    • The M-h hotkey (Alt/Option-h) now outputs help for the module or function directly before the cursor.

      Own Id: OTP-18847 Aux Id: PR-7846

    • Added support for adding a custom code formatter that formats your multi-line shell commands in your preferred formatting on submission. See shell:format_shell_func/ and shell:erl_pp_format_func/1.

      Own Id: OTP-18848 Aux Id: PR-7847

    • Added shell functions for viewing, forgetting and saving locally defined functions, types and records.

      Own Id: OTP-18852 Aux Id: PR-7844

    • Added string:jaro_similarity/2, which can be used to calculate the similarity between two strings.

      Own Id: OTP-18865 Aux Id: PR-7879

    • The new function ets:update_element/4 is similar to ets:update_element/3, but takes a default tuple as the fourth argument, which will be inserted if no previous record with that key exists.

      Own Id: OTP-18870 Aux Id: PR-7857

    • Added functions to retrieve the next higher or lower key/element from gb_trees and gb_sets, as well as returning iterators that start at given keys/elements.

      Own Id: OTP-18874 Aux Id: PR-7745

    • When the shell built-in function c/1,2 is used to re-compile a module, the current working directory of the original compilation is now added to the include path.

      Own Id: OTP-18908 Aux Id: PR-7957

    • The timer module now uses a private table for its internal state, slightly improving its performance.

      Own Id: OTP-18914 Aux Id: PR-7973

    • EEP-59 - Documentation Attributes has been implemented.

      Documentation attributes can be used to document functions, types, callbacks, and modules. The keyword -moduledoc "Documentation here". is used to document modules, while -doc "Documentation here". can be used on top of functions, types, and callbacks to document them, respectively.

      • Types, callbacks, and function documentation can be set to hidden either via -doc false or -doc hidden. When documentation attributes mark a type as hidden, they will not be part of the documentation.

      • The documentation from moduledoc and doc gets added by default to the binary beam file, following the format of EEP-48.

      • Using the compiler flag warn_missing_doc will raise a warning when -doc attributes are missing in exported functions, types, and callbacks.

      • Using the compiler flag warn_missing_spec_documented will raise a warning when -spec attributes are missing in documented functions, types, and callbacks.

      • moduledocs and docs may refer to external files to be embedded, such as -doc {file, "README.md"}., which refers to the file README.md found in the current working directory.

      • The compiler warns about exported functions whose specs refer to hidden types. Thus, there will be warnings when a hidden type (meaning, the type is not part of the documentation) gets used in an exported function.

      Own Id: OTP-18916 Aux Id: PR-7936

    • New ets functions ets:first_lookup/1, ets:next_lookup/2, ets:prev_lookup/2 and ets:last_lookup/1. Example: ets:next_lookup/1 is equivalent to ets:next/2 followed by ets:lookup/2 with the next key. The new combined functions are more efficient and with guaranteed atomicity.

      Own Id: OTP-18923 Aux Id: PR-6791

    • The maybe expression is now enabled by default.

      To use maybe as an atom, it needs to be single-quoted. Alternatively, the maybe expression can be disabled by disabling the maybe_expr feature. That can be done by placing the following the line at the beginning of an Erlang source file:

      -feature(maybe_expr, disable).

      Another way to disable the maybe_expr feature is by passing the -disable-feature option to erlc:

      erlc -disable-feature maybe_expr some_file.erl

      Own Id: OTP-18944 Aux Id: PR-8067

    • The compiler will now raise a warning when updating record/map literals. As an example, consider this module:

      -module(t).
      --export([f/0]).
      --record(r, {a,b,c}).
      +spec attributes are missing in documented functions, types, and callbacks.

    • moduledocs and docs may refer to external files to be embedded, such as -doc {file, "README.md"}., which refers to the file README.md found in the current working directory.

    • The compiler warns about exported functions whose specs refer to hidden types. Thus, there will be warnings when a hidden type (meaning, the type is not part of the documentation) gets used in an exported function.

    Own Id: OTP-18916 Aux Id: PR-7936

  • New ets functions ets:first_lookup/1, ets:next_lookup/2, ets:prev_lookup/2 and ets:last_lookup/1. Example: ets:next_lookup/1 is equivalent to ets:next/2 followed by ets:lookup/2 with the next key. The new combined functions are more efficient and with guaranteed atomicity.

    Own Id: OTP-18923 Aux Id: PR-6791

  • The maybe expression is now enabled by default.

    To use maybe as an atom, it needs to be single-quoted. Alternatively, the maybe expression can be disabled by disabling the maybe_expr feature. That can be done by placing the following the line at the beginning of an Erlang source file:

    -feature(maybe_expr, disable).

    Another way to disable the maybe_expr feature is by passing the -disable-feature option to erlc:

    erlc -disable-feature maybe_expr some_file.erl

    Own Id: OTP-18944 Aux Id: PR-8067

  • The compiler will now raise a warning when updating record/map literals. As an example, consider this module:

    -module(t).
    +-export([f/0]).
    +-record(r, {a,b,c}).
     
    -f() ->
    -    #href_anchor"ss">r{a=1}#r{b=2}.

    The compiler raises the following warning:

    1> c(t).
    +f() ->
    +    #href_anchor"ss">r{a=1}#r{b=2}.

    The compiler raises the following warning:

    1> c(t).
     t.erl:6:12: Warning: expression updates a literal
     %    6|     #r{a=1}#r{b=2}.
     %     |            ^

    Own Id: OTP-18951 Aux Id: PR-8069

  • The documentation has been migrated to use Markdown and ExDoc.

    Own Id: OTP-18955 Aux Id: PR-8026

  • Optimized ets:foldl and ets:foldr to use new ets:next_lookup. Also made them immune against table renaming.

    Own Id: OTP-18993 Aux Id: PR-8048

  • Windows now supports all functions in math.

    Own Id: OTP-19001 Aux Id: PR-8164

  • erl_lint (and by extension the compiler) will now warn for code using deprecated callbacks.

    The only callback currenly deprecated is format_status/2 in gen_server, gen_event and gen_statem.

    You can use nowarn_deprecated_callback to silence the warning.

    Own Id: OTP-19010 Aux Id: PR-8205

  • There is a new module json for encoding and decoding JSON.

    Both encoding and decoding can be customized. Decoding can be done in a SAX-like fashion and handle multiple documents and streams of data.

    Own Id: OTP-19020 Aux Id: PR-8111

  • @@ -4530,7 +4530,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/orddict.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1551)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/orddict.html 2026-06-04 19:05:19.422607824 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/orddict.html 2026-06-04 19:05:19.423607834 +0000 @@ -142,13 +142,13 @@

    Functions append/3 and append_list/3 are included so that keyed values can be stored in a list accumulator, for -example:

    > D0 = orddict:new(),
    -  D1 = orddict:store(files, [], D0),
    -  D2 = orddict:append(files, f1, D1),
    -  D3 = orddict:append(files, f2, D2),
    -  D4 = orddict:append(files, f3, D3),
    -  orddict:fetch(files, D4).
    -[f1,f2,f3]

    This saves the trouble of first fetching a keyed value, appending a new value to +example:

    > D0 = orddict:new(),
    +  D1 = orddict:store(files, [], D0),
    +  D2 = orddict:append(files, f1, D1),
    +  D3 = orddict:append(files, f2, D2),
    +  D4 = orddict:append(files, f3, D3),
    +  orddict:fetch(files, D4).
    +[f1,f2,f3]

    This saves the trouble of first fetching a keyed value, appending a new value to the list of stored values, and storing the result.

    Function fetch/2 is to be used if the key is known to be in the dictionary, otherwise function find/2.

    @@ -537,16 +537,16 @@

    Appends a new Value to the current list of values associated with Key. An exception is generated if the initial value associated with Key is not a list -of values.

    See also section Notes.

    Example 1:

    1> OrdDict1 = orddict:from_list([{x, []}]).
    -[{x,[]}]
    -2> OrdDict2 = orddict:append(x, 1, OrdDict1).
    -[{x,[1]}]
    -3> OrdDict3 = orddict:append(x, 2, OrdDict2).
    -[{x,[1,2]}]
    -4> orddict:append(y, 3, OrdDict3).
    -[{x,[1,2]},{y,[3]}]

    Example 2:

    1> OrdDict1 = orddict:from_list([{a, no_list}]).
    -[{a,no_list}]
    -2> orddict:append(a, 1, OrdDict1).
    +of values.

    See also section Notes.

    Example 1:

    1> OrdDict1 = orddict:from_list([{x, []}]).
    +[{x,[]}]
    +2> OrdDict2 = orddict:append(x, 1, OrdDict1).
    +[{x,[1]}]
    +3> OrdDict3 = orddict:append(x, 2, OrdDict2).
    +[{x,[1,2]}]
    +4> orddict:append(y, 3, OrdDict3).
    +[{x,[1,2]},{y,[3]}]

    Example 2:

    1> OrdDict1 = orddict:from_list([{a, no_list}]).
    +[{a,no_list}]
    +2> orddict:append(a, 1, OrdDict1).
     ** exception error: bad argument
          in operator  ++/2
             called as no_list ++ [1]
    @@ -583,12 +583,12 @@

    Appends a list of values ValList to the current list of values associated with Key. An exception is generated if the initial value associated with Key is -not a list of values.

    See also section Notes.

    Example:

    1> OrdDict1 = orddict:from_list([{x, []}]).
    -[{x,[]}]
    -2> OrdDict2 = orddict:append_list(x, [1,2], OrdDict1).
    -[{x,[1,2]}]
    -3> OrdDict3 = orddict:append_list(y, [3,4], OrdDict2).
    -[{x,[1,2]},{y,[3,4]}]
    +not a list of values.

    See also section Notes.

    Example:

    1> OrdDict1 = orddict:from_list([{x, []}]).
    +[{x,[]}]
    +2> OrdDict2 = orddict:append_list(x, [1,2], OrdDict1).
    +[{x,[1,2]}]
    +3> OrdDict3 = orddict:append_list(y, [3,4], OrdDict2).
    +[{x,[1,2]},{y,[3,4]}]
    @@ -617,10 +617,10 @@ -

    Erases all items with a specified key from a dictionary.

    Example:

    1> OrdDict1 = orddict:from_list([{a, 1}, {b, 2}]).
    -[{a,1},{b,2}]
    -2> orddict:erase(a, OrdDict1).
    -[{b,2}]
    +

    Erases all items with a specified key from a dictionary.

    Example:

    1> OrdDict1 = orddict:from_list([{a, 1}, {b, 2}]).
    +[{a,1},{b,2}]
    +2> orddict:erase(a, OrdDict1).
    +[{b,2}]
    @@ -650,11 +650,11 @@

    Returns the value associated with Key in dictionary Orddict. This function assumes that the Key is present in the dictionary. An exception is generated -if Key is not in the dictionary.

    See also section Notes.

    Example:

    1> OrdDict1 = orddict:from_list([{a, 1}, {b, 2}]).
    -[{a,1},{b,2}]
    -2> orddict:fetch(a, OrdDict1).
    +if Key is not in the dictionary.

    See also section Notes.

    Example:

    1> OrdDict1 = orddict:from_list([{a, 1}, {b, 2}]).
    +[{a,1},{b,2}]
    +2> orddict:fetch(a, OrdDict1).
     1
    -3> orddict:fetch(missing, OrdDict1).
    +3> orddict:fetch(missing, OrdDict1).
     ** exception error: no function clause matching orddict:fetch(missing,[])
    @@ -683,10 +683,10 @@ -

    Returns a list of all keys in a dictionary.

    Example:

    1> OrdDict1 = orddict:from_list([{a, 1}, {b, 2}]).
    -[{a,1},{b,2}]
    -2> orddict:fetch_keys(OrdDict1).
    -[a,b]
    +

    Returns a list of all keys in a dictionary.

    Example:

    1> OrdDict1 = orddict:from_list([{a, 1}, {b, 2}]).
    +[{a,1},{b,2}]
    +2> orddict:fetch_keys(OrdDict1).
    +[a,b]
    @@ -719,10 +719,10 @@

    Orddict2 is a dictionary of all keys and values in Orddict1 for which -Pred(Key, Value) is true.

    Example:

    1> OrdDict1 = orddict:from_list([{a, 1}, {b, 2}]).
    -[{a,1},{b,2}]
    -2> orddict:filter(fun (K, V) -> V > 1 end, OrdDict1).
    -[{b,2}]
    +Pred(Key, Value) is true.

    Example:

    1> OrdDict1 = orddict:from_list([{a, 1}, {b, 2}]).
    +[{a,1},{b,2}]
    +2> orddict:filter(fun (K, V) -> V > 1 end, OrdDict1).
    +[{b,2}]
    @@ -752,11 +752,11 @@

    Searches for a key in a dictionary. Returns {ok, Value}, where Value is the value associated with Key, or error if the key is not present in the -dictionary.

    See also section Notes.

    Example:

    1> OrdDict1 = orddict:from_list([{a, 1}, {b, 2}]).
    -[{a,1},{b,2}]
    -2> orddict:find(a, OrdDict1).
    -{ok,1}
    -3> orddict:find(c, OrdDict1).
    +dictionary.

    See also section Notes.

    Example:

    1> OrdDict1 = orddict:from_list([{a, 1}, {b, 2}]).
    +[{a,1},{b,2}]
    +2> orddict:find(a, OrdDict1).
    +{ok,1}
    +3> orddict:find(c, OrdDict1).
     error
    @@ -794,10 +794,10 @@

    Calls Fun on successive keys and values of Orddict together with an extra argument Acc (short for accumulator). Fun must return a new accumulator that -is passed to the next call. Acc0 is returned if the list is empty.

    Example:

    1> OrdDict1 = orddict:from_list([{a, 1}, {b, 2}]).
    -[{a,1},{b,2}]
    -2> orddict:fold(fun (K, V, Acc) -> [{K, V+100} | Acc] end, [], OrdDict1).
    -[{b,102},{a,101}]
    +is passed to the next call. Acc0 is returned if the list is empty.

    Example:

    1> OrdDict1 = orddict:from_list([{a, 1}, {b, 2}]).
    +[{a,1},{b,2}]
    +2> orddict:fold(fun (K, V, Acc) -> [{K, V+100} | Acc] end, [], OrdDict1).
    +[{b,102},{a,101}]
    @@ -916,10 +916,10 @@

    Calls Fun on successive keys and values of Orddict1 to return a new value -for each key.

    Example:

    1> OrdDict1 = orddict:from_list([{a, 1}, {b, 2}]).
    -[{a,1},{b,2}]
    -2> orddict:map(fun (_K, V) -> V + 100 end, OrdDict1).
    -[{a,101},{b,102}]
    +for each key.

    Example:

    1> OrdDict1 = orddict:from_list([{a, 1}, {b, 2}]).
    +[{a,1},{b,2}]
    +2> orddict:map(fun (_K, V) -> V + 100 end, OrdDict1).
    +[{a,101},{b,102}]
    @@ -955,15 +955,15 @@

    Merges two dictionaries, Orddict1 and Orddict2, to create a new dictionary. All the Key-Value pairs from both dictionaries are included in the new dictionary.

    If a key occurs in both dictionaries, Fun is called with the key -and both values to return a new value.

    merge/3 can be defined as follows, but is faster:

    merge(Fun, D1, D2) ->
    -    fold(fun (K, V1, D) ->
    -                 update(K, fun (V2) -> Fun(K, V1, V2) end, V1, D)
    -         end, D2, D1).

    Example:

    1> OrdDict1 = orddict:from_list([{a, 1}, {b, 2}]).
    -[{a,1},{b,2}]
    -2> OrdDict2 = orddict:from_list([{b, 7}, {c, 8}]).
    -[{b,7},{c,8}]
    -3> orddict:merge(fun (K, V1, V2) -> V1 * V2 end, OrdDict1, OrdDict2).
    -[{a,1},{b,14},{c,8}]
    +and both values to return a new value.

    merge/3 can be defined as follows, but is faster:

    merge(Fun, D1, D2) ->
    +    fold(fun (K, V1, D) ->
    +                 update(K, fun (V2) -> Fun(K, V1, V2) end, V1, D)
    +         end, D2, D1).

    Example:

    1> OrdDict1 = orddict:from_list([{a, 1}, {b, 2}]).
    +[{a,1},{b,2}]
    +2> OrdDict2 = orddict:from_list([{b, 7}, {c, 8}]).
    +[{b,7},{c,8}]
    +3> orddict:merge(fun (K, V1, V2) -> V1 * V2 end, OrdDict1, OrdDict2).
    +[{a,1},{b,14},{c,8}]
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/ordsets.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (327)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/ordsets.html 2026-06-04 19:05:19.448608065 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/ordsets.html 2026-06-04 19:05:19.448608065 +0000 @@ -1092,7 +1092,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/peer.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1109)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/peer.html 2026-06-04 19:05:19.475608316 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/peer.html 2026-06-04 19:05:19.475608316 +0000 @@ -161,127 +161,127 @@ manual analysis. If the test case fails, the CRASH REPORT contains these arguments
  • multiple test cases can run concurrently speeding up overall testing process, peer node names are unique even when there are multiple instances of the same -test suite running in parallel
  • -module(my_SUITE).
    --behaviour(ct_suite).
    --export([all/0, groups/0]).
    --export([basic/1, args/1, named/1, restart_node/1, multi_node/1]).
    +test suite running in parallel
    -module(my_SUITE).
    +-behaviour(ct_suite).
    +-export([all/0, groups/0]).
    +-export([basic/1, args/1, named/1, restart_node/1, multi_node/1]).
     
    --include_lib("common_test/include/ct.hrl").
    +-include_lib("common_test/include/ct.hrl").
     
    -groups() ->
    -    [{quick, [parallel],
    -        [basic, args, named, restart_node, multi_node]}].
    +groups() ->
    +    [{quick, [parallel],
    +        [basic, args, named, restart_node, multi_node]}].
     
    -all() ->
    -    [{group, quick}].
    +all() ->
    +    [{group, quick}].
     
    -basic(Config) when is_list(Config) ->
    -    {ok, Peer, _Node} = ?CT_PEER(),
    -    peer:stop(Peer).
    +basic(Config) when is_list(Config) ->
    +    {ok, Peer, _Node} = ?CT_PEER(),
    +    peer:stop(Peer).
     
    -args(Config) when is_list(Config) ->
    +args(Config) when is_list(Config) ->
         %% specify additional arguments to the new node
    -    {ok, Peer, _Node} = ?CT_PEER(["-emu_flavor", "smp"]),
    -    peer:stop(Peer).
    +    {ok, Peer, _Node} = ?CT_PEER(["-emu_flavor", "smp"]),
    +    peer:stop(Peer).
     
    -named(Config) when is_list(Config) ->
    +named(Config) when is_list(Config) ->
         %% pass test case name down to function starting nodes
    -    Peer = start_node_impl(named_test),
    -    peer:stop(Peer).
    +    Peer = start_node_impl(named_test),
    +    peer:stop(Peer).
     
    -start_node_impl(ActualTestCase) ->
    -    {ok, Peer, Node} = ?CT_PEER(#{name => ?CT_PEER_NAME(ActualTestCase)}),
    +start_node_impl(ActualTestCase) ->
    +    {ok, Peer, Node} = ?CT_PEER(#{name => ?CT_PEER_NAME(ActualTestCase)}),
         %% extra setup needed for multiple test cases
    -    ok = rpc:call(Node, application, set_env, [kernel, key, value]),
    +    ok = rpc:call(Node, application, set_env, [kernel, key, value]),
         Peer.
     
    -restart_node(Config) when is_list(Config) ->
    -    Name = ?CT_PEER_NAME(),
    -    {ok, Peer, Node} = ?CT_PEER(#{name => Name}),
    -    peer:stop(Peer),
    +restart_node(Config) when is_list(Config) ->
    +    Name = ?CT_PEER_NAME(),
    +    {ok, Peer, Node} = ?CT_PEER(#{name => Name}),
    +    peer:stop(Peer),
         %% restart the node with the same name as before
    -    {ok, Peer2, Node} = ?CT_PEER(#{name => Name, args => ["+fnl"]}),
    -    peer:stop(Peer2).

    The next example demonstrates how to start multiple nodes concurrently:

    multi_node(Config) when is_list(Config) ->
    -    Peers = [?CT_PEER(#{wait_boot => {self(), tag}})
    -        || _ <- lists:seq(1, 4)],
    +    {ok, Peer2, Node} = ?CT_PEER(#{name => Name, args => ["+fnl"]}),
    +    peer:stop(Peer2).

    The next example demonstrates how to start multiple nodes concurrently:

    multi_node(Config) when is_list(Config) ->
    +    Peers = [?CT_PEER(#{wait_boot => {self(), tag}})
    +        || _ <- lists:seq(1, 4)],
         %% wait for all nodes to complete boot process, get their names:
    -    _Nodes = [receive {tag, {started, Node, Peer}} -> Node end
    -        || {ok, Peer} <- Peers],
    -    [peer:stop(Peer) || {ok, Peer} <- Peers].

    Start a peer on a different host. Requires ssh key-based authentication set -up, allowing "another_host" connection without password prompt.

    Ssh = os:find_executable("ssh"),
    -peer:start_link(#{exec => {Ssh, ["another_host", "erl"]},
    -    connection => standard_io}),

    The following Common Test case demonstrates Docker integration, starting two + _Nodes = [receive {tag, {started, Node, Peer}} -> Node end + || {ok, Peer} <- Peers], + [peer:stop(Peer) || {ok, Peer} <- Peers].

    Start a peer on a different host. Requires ssh key-based authentication set +up, allowing "another_host" connection without password prompt.

    Ssh = os:find_executable("ssh"),
    +peer:start_link(#{exec => {Ssh, ["another_host", "erl"]},
    +    connection => standard_io}),

    The following Common Test case demonstrates Docker integration, starting two containers with hostnames "one" and "two". In this example Erlang nodes running -inside containers form an Erlang cluster.

    docker(Config) when is_list(Config) ->
    -    Docker = os:find_executable("docker"),
    -    PrivDir = proplists:get_value(priv_dir, Config),
    -    build_release(PrivDir),
    -    build_image(PrivDir),
    +inside containers form an Erlang cluster.

    docker(Config) when is_list(Config) ->
    +    Docker = os:find_executable("docker"),
    +    PrivDir = proplists:get_value(priv_dir, Config),
    +    build_release(PrivDir),
    +    build_image(PrivDir),
     
         %% start two Docker containers
    -    {ok, Peer, Node} = peer:start_link(#{name => lambda,
    +    {ok, Peer, Node} = peer:start_link(#{name => lambda,
             connection => standard_io,
    -        exec => {Docker, ["run", "-h", "one", "-i", "lambda"]}}),
    -    {ok, Peer2, Node2} = peer:start_link(#{name => lambda,
    +        exec => {Docker, ["run", "-h", "one", "-i", "lambda"]}}),
    +    {ok, Peer2, Node2} = peer:start_link(#{name => lambda,
             connection => standard_io,
    -        exec => {Docker, ["run", "-h", "two", "-i", "lambda"]}}),
    +        exec => {Docker, ["run", "-h", "two", "-i", "lambda"]}}),
     
         %% find IP address of the second node using alternative connection RPC
    -    {ok, Ips} = peer:call(Peer2, inet, getifaddrs, []),
    -    {"eth0", Eth0} = lists:keyfind("eth0", 1, Ips),
    -    {addr, Ip} = lists:keyfind(addr, 1, Eth0),
    +    {ok, Ips} = peer:call(Peer2, inet, getifaddrs, []),
    +    {"eth0", Eth0} = lists:keyfind("eth0", 1, Ips),
    +    {addr, Ip} = lists:keyfind(addr, 1, Eth0),
     
         %% make first node to discover second one
    -    ok = peer:call(Peer, inet_db, set_lookup, [[file]]),
    -    ok = peer:call(Peer, inet_db, add_host, [Ip, ["two"]]),
    +    ok = peer:call(Peer, inet_db, set_lookup, [[file]]),
    +    ok = peer:call(Peer, inet_db, add_host, [Ip, ["two"]]),
     
         %% join a cluster
    -    true = peer:call(Peer, net_kernel, connect_node, [Node2]),
    +    true = peer:call(Peer, net_kernel, connect_node, [Node2]),
         %% verify that second peer node has only the first node visible
    -    [Node] = peer:call(Peer2, erlang, nodes, []),
    +    [Node] = peer:call(Peer2, erlang, nodes, []),
     
         %% stop peers, causing containers to also stop
    -    peer:stop(Peer2),
    -    peer:stop(Peer).
    +    peer:stop(Peer2),
    +    peer:stop(Peer).
     
    -build_release(Dir) ->
    +build_release(Dir) ->
         %% load sasl.app file, otherwise application:get_key will fail
    -    application:load(sasl),
    +    application:load(sasl),
         %% create *.rel - release file
    -    RelFile = filename:join(Dir, "lambda.rel"),
    -    Release = {release, {"lambda", "1.0.0"},
    -        {erts, erlang:system_info(version)},
    -        [{App, begin {ok, Vsn} = application:get_key(App, vsn), Vsn end}
    -            || App <- [kernel, stdlib, sasl]]},
    -    ok = file:write_file(RelFile, list_to_binary(lists:flatten(
    -        io_lib:format("~tp.", [Release])))),
    -    RelFileNoExt = filename:join(Dir, "lambda"),
    +    RelFile = filename:join(Dir, "lambda.rel"),
    +    Release = {release, {"lambda", "1.0.0"},
    +        {erts, erlang:system_info(version)},
    +        [{App, begin {ok, Vsn} = application:get_key(App, vsn), Vsn end}
    +            || App <- [kernel, stdlib, sasl]]},
    +    ok = file:write_file(RelFile, list_to_binary(lists:flatten(
    +        io_lib:format("~tp.", [Release])))),
    +    RelFileNoExt = filename:join(Dir, "lambda"),
     
         %% create boot script
    -    {ok, systools_make, []} = systools:make_script(RelFileNoExt,
    -        [silent, {outdir, Dir}]),
    +    {ok, systools_make, []} = systools:make_script(RelFileNoExt,
    +        [silent, {outdir, Dir}]),
         %% package release into *.tar.gz
    -    ok = systools:make_tar(RelFileNoExt, [{erts, code:root_dir()}]).
    +    ok = systools:make_tar(RelFileNoExt, [{erts, code:root_dir()}]).
     
    -build_image(Dir) ->
    +build_image(Dir) ->
         %% Create Dockerfile example, working only for Ubuntu 20.04
         %% Expose port 4445, and make Erlang distribution to listen
         %%  on this port, and connect to it without EPMD
         %% Set cookie on both nodes to be the same.
    -    BuildScript = filename:join(Dir, "Dockerfile"),
    +    BuildScript = filename:join(Dir, "Dockerfile"),
         Dockerfile =
           "FROM ubuntu:20.04 as runner\n"
           "EXPOSE 4445\n"
           "WORKDIR /opt/lambda\n"
           "COPY lambda.tar.gz /tmp\n"
           "RUN tar -zxvf /tmp/lambda.tar.gz -C /opt/lambda\n"
    -      "ENTRYPOINT [\"/opt/lambda/erts-" ++ erlang:system_info(version) ++
    +      "ENTRYPOINT [\"/opt/lambda/erts-" ++ erlang:system_info(version) ++
           "/bin/dyn_erl\", \"-boot\", \"/opt/lambda/releases/1.0.0/start\","
           " \"-kernel\", \"inet_dist_listen_min\", \"4445\","
           " \"-erl_epmd_port\", \"4445\","
           " \"-setcookie\", \"secret\"]\n",
    -    ok = file:write_file(BuildScript, Dockerfile),
    -    os:cmd("docker build -t lambda " ++ Dir).
    +
    ok = file:write_file(BuildScript, Dockerfile), + os:cmd("docker build -t lambda " ++ Dir).
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/pool.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (448)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/pool.html 2026-06-04 19:05:19.498608529 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/pool.html 2026-06-04 19:05:19.497608520 +0000 @@ -515,7 +515,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/proc_lib.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (650)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/proc_lib.html 2026-06-04 19:05:19.531608835 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/proc_lib.html 2026-06-04 19:05:19.532608845 +0000 @@ -995,21 +995,21 @@ failed. When doing so the start function can return before the failing process has exited, which may block VM resources required for a new start attempt to succeed. Use init_fail/2,3 for that purpose.

    The following example illustrates how this function and proc_lib:start_link/3 -are used:

    -module(my_proc).
    --export([start_link/0]).
    --export([init/1]).
    +are used:

    -module(my_proc).
    +-export([start_link/0]).
    +-export([init/1]).
     
    -start_link() ->
    -    proc_lib:start_link(my_proc, init, [self()]).
    +start_link() ->
    +    proc_lib:start_link(my_proc, init, [self()]).
     
    -init(Parent) ->
    -    case do_initialization() of
    +init(Parent) ->
    +    case do_initialization() of
             ok ->
    -            proc_lib:init_ack(Parent, {ok, self()});
    -        {error, Reason} ->
    -            exit(Reason)
    +            proc_lib:init_ack(Parent, {ok, self()});
    +        {error, Reason} ->
    +            exit(Reason)
         end,
    -    loop().
    +    loop().
     
     ...
    @@ -1082,21 +1082,21 @@ started process, the start function returns an error tuple when the started process exits, or when the start function time-out (if used) has passed, see start/3,4,5.

    The following example illustrates how this function and proc_lib:start_link/3 -can be used:

    -module(my_proc).
    --export([start_link/0]).
    --export([init/1]).
    +can be used:

    -module(my_proc).
    +-export([start_link/0]).
    +-export([init/1]).
     
    -start_link() ->
    -    proc_lib:start_link(my_proc, init, [self()]).
    +start_link() ->
    +    proc_lib:start_link(my_proc, init, [self()]).
     
    -init(Parent) ->
    -    case do_initialization() of
    +init(Parent) ->
    +    case do_initialization() of
             ok ->
    -            proc_lib:init_ack(Parent, {ok, self()});
    -        {error, Reason} = Error ->
    -            proc_lib:init_fail(Parent, Error, {exit, normal})
    +            proc_lib:init_ack(Parent, {ok, self()});
    +        {error, Reason} = Error ->
    +            proc_lib:init_fail(Parent, Error, {exit, normal})
         end,
    -    loop().
    +    loop().
     
     ...
    @@ -2030,7 +2030,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/proplists.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (3915)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/proplists.html 2026-06-04 19:05:19.557609076 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/proplists.html 2026-06-04 19:05:19.557609076 +0000 @@ -532,7 +532,7 @@

    Similar to get_all_values/2, but each value is wrapped in a list unless it is already itself a list. The resulting list of lists is concatenated. This is -often useful for "incremental" options.

    Example:

    append_values(a, [{a, [1,2]}, {b, 0}, {a, 3}, {c, -1}, {a, [4]}])

    returns:

    [1,2,3,4]
    +often useful for "incremental" options.

    Example:

    append_values(a, [{a, [1,2]}, {b, 0}, {a, 3}, {c, -1}, {a, [4]}])

    returns:

    [1,2,3,4]
    @@ -626,10 +626,10 @@ first entry in ListIn with the same key as Property, and E and Property have equivalent normal forms, then E is replaced with the terms in Expansion, and any following entries with the same key are deleted from -ListIn.

    For example, the following expressions all return [fie, bar, baz, fum]:

    expand([{foo, [bar, baz]}], [fie, foo, fum])
    -expand([{{foo, true}, [bar, baz]}], [fie, foo, fum])
    -expand([{{foo, false}, [bar, baz]}], [fie, {foo, false}, fum])

    However, no expansion is done in the following call because {foo, false} -shadows foo:

    expand([{{foo, true}, [bar, baz]}], [{foo, false}, fie, foo, fum])

    Notice that if the original property term is to be preserved in the result when +ListIn.

    For example, the following expressions all return [fie, bar, baz, fum]:

    expand([{foo, [bar, baz]}], [fie, foo, fum])
    +expand([{{foo, true}, [bar, baz]}], [fie, foo, fum])
    +expand([{{foo, false}, [bar, baz]}], [fie, {foo, false}, fum])

    However, no expansion is done in the following call because {foo, false} +shadows foo:

    expand([{{foo, true}, [bar, baz]}], [{foo, false}, fie, foo, fum])

    Notice that if the original property term is to be preserved in the result when expanded, it must be included in the expansion list. The inserted terms are not expanded recursively. If Expansions contains more than one property with the same key, only the first occurrence is used.

    See also normalize/2.

    @@ -1034,7 +1034,7 @@

    Partitions List into a list of sublists and a remainder.

    Lists contains one sublist for each key in Keys, in the corresponding order. The relative order of the elements in each sublist is preserved from the original List. Rest contains the elements in List that are not associated with any of the -specified keys, also with their original relative order preserved.

    Example:

    split([{c, 2}, {e, 1}, a, {c, 3, 4}, d, {b, 5}, b], [a, b, c])

    returns:

    {[[a], [{b, 5}, b],[{c, 2}, {c, 3, 4}]], [{e, 1}, d]}
    +specified keys, also with their original relative order preserved.

    Example:

    split([{c, 2}, {e, 1}, a, {c, 3, 4}, d, {b, 5}, b], [a, b, c])

    returns:

    {[[a], [{b, 5}, b],[{c, 2}, {c, 3, 4}]], [{e, 1}, d]}
    @@ -1157,7 +1157,7 @@ an association of the form Key => Value. Anything else will be silently ignored.

    If the same key appears in List multiple times, the value of the one appearing nearest to the head of List will be in the result map, that is the value that -would be returned by a call to get_value(Key, List).

    Example:

    to_map([a, {b, 1}, {c, 2}, {c, 3}])

    returns:

    #{a => true, b => 1, c => 2}
    +would be returned by a call to get_value(Key, List).

    Example:

    to_map([a, {b, 1}, {c, 2}, {c, 3}])

    returns:

    #{a => true, b => 1, c => 2}
    @@ -1253,7 +1253,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/qlc.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1468)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/qlc.html 2026-06-04 19:05:19.602609494 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/qlc.html 2026-06-04 19:05:19.602609494 +0000 @@ -285,24 +285,24 @@ If a tuple {finished} exists among the answers to QH, it is returned twice from append/2.

    As another example, consider concatenating the answers to two queries QH1 and QH2 while removing all duplicates. This is accomplished by using option -unique:

    qlc:q([X || X <- qlc:append(QH1, QH2)], {unique, true})

    The cost is substantial: every returned answer is stored in an ETS table. Before +unique:

    qlc:q([X || X <- qlc:append(QH1, QH2)], {unique, true})

    The cost is substantial: every returned answer is stored in an ETS table. Before returning an answer, it is looked up in the ETS table to check if it has already been returned. Without the unique option, all answers to QH1 would be returned followed by all answers to QH2. The unique option keeps the order between the remaining answers.

    If the order of the answers is not important, there is an alternative to the -unique option, namely to sort the answers uniquely:

    qlc:sort(qlc:q([X || X <- qlc:append(QH1, QH2)], {unique, true})).

    This query also removes duplicates but the answers are sorted. If there are many +unique option, namely to sort the answers uniquely:

    qlc:sort(qlc:q([X || X <- qlc:append(QH1, QH2)], {unique, true})).

    This query also removes duplicates but the answers are sorted. If there are many answers, temporary files are used. Notice that to get the first unique answer, all answers must be found and sorted. Both alternatives find duplicates by comparing answers, that is, if A1 and A2 are answers found in that order, then A2 is a removed if A1 == A2.

    To return only a few answers, cursors can be used. The following code returns no -more than five answers using an ETS table for storing the unique answers:

    C = qlc:cursor(qlc:q([X || X <- qlc:append(QH1, QH2)],{unique,true})),
    -R = qlc:next_answers(C, 5),
    -ok = qlc:delete_cursor(C),
    +more than five answers using an ETS table for storing the unique answers:

    C = qlc:cursor(qlc:q([X || X <- qlc:append(QH1, QH2)],{unique,true})),
    +R = qlc:next_answers(C, 5),
    +ok = qlc:delete_cursor(C),
     R.

    QLCs are convenient for stating constraints on data from two or more tables. The -following example does a natural join on two query handles on position 2:

    qlc:q([{X1,X2,X3,Y1} ||
    -          {X1,X2,X3} <- QH1,
    -          {Y1,Y2} <- QH2,
    -          X2 =:= Y2])

    The qlc module evaluates this differently depending on the query handles QH1 +following example does a natural join on two query handles on position 2:

    qlc:q([{X1,X2,X3,Y1} ||
    +          {X1,X2,X3} <- QH1,
    +          {Y1,Y2} <- QH2,
    +          X2 =:= Y2])

    The qlc module evaluates this differently depending on the query handles QH1 and QH2. If, for example, X2 is matched against the key of a QLC table, the lookup join method traverses the objects of QH2 while looking up key values in the table. However, if not X2 or Y2 is matched against the key or an indexed @@ -310,11 +310,11 @@ both sorted on position 2 and next do the join by traversing the objects one by one.

    Option join can be used to force the qlc module to use a certain join method. For the rest of this section it is assumed that the excessively slow -join method called "nested loop" has been chosen:

    qlc:q([{X1,X2,X3,Y1} ||
    -          {X1,X2,X3} <- QH1,
    -          {Y1,Y2} <- QH2,
    -          X2 =:= Y2],
    -      {join, nested_loop})

    In this case the filter is applied to every possible pair of answers to QH1 +join method called "nested loop" has been chosen:

    qlc:q([{X1,X2,X3,Y1} ||
    +          {X1,X2,X3} <- QH1,
    +          {Y1,Y2} <- QH2,
    +          X2 =:= Y2],
    +      {join, nested_loop})

    In this case the filter is applied to every possible pair of answers to QH1 and QH2, one at a time. If there are M answers to QH1 and N answers to QH2, the filter is run M*N times.

    If QH2 is a call to the function for gb_trees, as defined in section Implementing a QLC Table, then @@ -328,7 +328,7 @@ no side effects so that the meaning of the query does not change if QH2 is evaluated only once. One way of caching the answers is to evaluate QH2 first of all and substitute the list of answers for QH2 in the query. Another way is -to use option cache. It is expressed like this:

    QH2' = qlc:q([X || X <- QH2], {cache, ets})

    or only

    QH2' = qlc:q([X || X <- QH2], cache)

    The effect of option cache is that when generator QH2' is run the first +to use option cache. It is expressed like this:

    QH2' = qlc:q([X || X <- QH2], {cache, ets})

    or only

    QH2' = qlc:q([X || X <- QH2], cache)

    The effect of option cache is that when generator QH2' is run the first time, every answer is stored in an ETS table. When the next answer of QH1 is tried, answers to QH2' are copied from the ETS table, which is very fast. As for option unique the cost is a possibly substantial amount of RAM memory.

    Option {cache, list} offers the possibility to store the answers in a list on @@ -350,62 +350,62 @@ Implementing a QLC Table

    As an example of how to use function table/2, the implementation of a QLC -table for the gb_trees module is given:

    -module(gb_table).
    +table for the gb_trees module is given:

    -module(gb_table).
     
    --export([table/1]).
    +-export([table/1]).
     
    -table(T) ->
    -    TF = fun() -> qlc_next(gb_trees:next(gb_trees:iterator(T))) end,
    -    InfoFun = fun(num_of_objects) -> gb_trees:size(T);
    -                 (keypos) -> 1;
    -                 (is_sorted_key) -> true;
    -                 (is_unique_objects) -> true;
    -                 (_) -> undefined
    +table(T) ->
    +    TF = fun() -> qlc_next(gb_trees:next(gb_trees:iterator(T))) end,
    +    InfoFun = fun(num_of_objects) -> gb_trees:size(T);
    +                 (keypos) -> 1;
    +                 (is_sorted_key) -> true;
    +                 (is_unique_objects) -> true;
    +                 (_) -> undefined
                   end,
         LookupFun =
    -        fun(1, Ks) ->
    -                lists:flatmap(fun(K) ->
    -                                      case gb_trees:lookup(K, T) of
    -                                          {value, V} -> [{K,V}];
    -                                          none -> []
    +        fun(1, Ks) ->
    +                lists:flatmap(fun(K) ->
    +                                      case gb_trees:lookup(K, T) of
    +                                          {value, V} -> [{K,V}];
    +                                          none -> []
                                           end
    -                              end, Ks)
    +                              end, Ks)
             end,
         FormatFun =
    -        fun({all, NElements, ElementFun}) ->
    -                ValsS = io_lib:format("gb_trees:from_orddict(~w)",
    -                                      [gb_nodes(T, NElements, ElementFun)]),
    -                io_lib:format("gb_table:table(~s)", [ValsS]);
    -           ({lookup, 1, KeyValues, _NElements, ElementFun}) ->
    -                ValsS = io_lib:format("gb_trees:from_orddict(~w)",
    -                                      [gb_nodes(T, infinity, ElementFun)]),
    -                io_lib:format("lists:flatmap(fun(K) -> "
    +        fun({all, NElements, ElementFun}) ->
    +                ValsS = io_lib:format("gb_trees:from_orddict(~w)",
    +                                      [gb_nodes(T, NElements, ElementFun)]),
    +                io_lib:format("gb_table:table(~s)", [ValsS]);
    +           ({lookup, 1, KeyValues, _NElements, ElementFun}) ->
    +                ValsS = io_lib:format("gb_trees:from_orddict(~w)",
    +                                      [gb_nodes(T, infinity, ElementFun)]),
    +                io_lib:format("lists:flatmap(fun(K) -> "
                                   "case gb_trees:lookup(K, ~s) of "
                                   "{value, V} -> [{K,V}];none -> [] end "
                                   "end, ~w)",
    -                              [ValsS, [ElementFun(KV) || KV <- KeyValues]])
    +                              [ValsS, [ElementFun(KV) || KV <- KeyValues]])
             end,
    -    qlc:table(TF, [{info_fun, InfoFun}, {format_fun, FormatFun},
    -                   {lookup_fun, LookupFun},{key_equality,&#href_anchor"p" data-group-id="4331025148-44">}]).
    +    qlc:table(TF, [{info_fun, InfoFun}, {format_fun, FormatFun},
    +                   {lookup_fun, LookupFun},{key_equality,&#href_anchor"p" data-group-id="7509824878-44">}]).
     
    -qlc_next({X, V, S}) ->
    -    [{X,V} | fun() -> qlc_next(gb_trees:next(S)) end];
    -qlc_next(none) ->
    -    [].
    -
    -gb_nodes(T, infinity, ElementFun) ->
    -    gb_nodes(T, -1, ElementFun);
    -gb_nodes(T, NElements, ElementFun) ->
    -    gb_iter(gb_trees:iterator(T), NElements, ElementFun).
    +qlc_next({X, V, S}) ->
    +    [{X,V} | fun() -> qlc_next(gb_trees:next(S)) end];
    +qlc_next(none) ->
    +    [].
    +
    +gb_nodes(T, infinity, ElementFun) ->
    +    gb_nodes(T, -1, ElementFun);
    +gb_nodes(T, NElements, ElementFun) ->
    +    gb_iter(gb_trees:iterator(T), NElements, ElementFun).
     
    -gb_iter(_I, 0, _EFun) ->
    +gb_iter(_I, 0, _EFun) ->
         '...';
    -gb_iter(I0, N, EFun) ->
    -    case gb_trees:next(I0) of
    -        {X, V, I} ->
    -            [EFun({X,V}) | gb_iter(I, N-1, EFun)];
    +gb_iter(I0, N, EFun) ->
    +    case gb_trees:next(I0) of
    +        {X, V, I} ->
    +            [EFun({X,V}) | gb_iter(I, N-1, EFun)];
             none ->
    -            []
    +            []
         end.

    TF is the traversal function. The qlc module requires that there is a way of traversing all objects of the data structure. gb_trees has an iterator function suitable for that purpose. Notice that for each object returned, a new @@ -441,49 +441,49 @@ example, 2 == 2.0 evaluates to true while 2 =:= 2.0 evaluates to false. Normally this is a minor issue, but the qlc module cannot ignore the difference, which affects the user's choice of operators in QLCs.

    If the qlc module at compile time can determine that some constant is free of -integers, it does not matter which one of ==/2 or =:=/2 is used:

    1> E1 = ets:new(t, [set]), % uses =:=/2 for key equality
    -Q1 = qlc:q([K ||
    -{K} <- ets:table(E1),
    -K == 2.71 orelse K == a]),
    -io:format("~s~n", [qlc:info(Q1)]).
    -ets:match_spec_run(
    -       lists:flatmap(fun(V) ->
    -			    ets:lookup(#Ref<0.3098908599.2283929601.256025>,
    -				       V)
    +integers, it does not matter which one of ==/2 or =:=/2 is used:

    1> E1 = ets:new(t, [set]), % uses =:=/2 for key equality
    +Q1 = qlc:q([K ||
    +{K} <- ets:table(E1),
    +K == 2.71 orelse K == a]),
    +io:format("~s~n", [qlc:info(Q1)]).
    +ets:match_spec_run(
    +       lists:flatmap(fun(V) ->
    +			    ets:lookup(#Ref<0.3098908599.2283929601.256025>,
    +				       V)
     		     end,
    -		     [a, 2.71]),
    -       ets:match_spec_compile([{{'$1'}, [], ['$1']}]))

    In the example, operator ==/2 has been handled exactly as =:=/2 would have + [a, 2.71]), + ets:match_spec_compile([{{'$1'}, [], ['$1']}]))

    In the example, operator ==/2 has been handled exactly as =:=/2 would have been handled. However, if it cannot be determined at compile time that some constant is free of integers, and the table uses =:=/2 when comparing keys for equality (see option key_equality), then the qlc module does not try to look up the constant. The reason is that there is in the general case no upper limit on the number of key values that can compare equal -to such a constant; every combination of integers and floats must be looked up:

    2> E2 = ets:new(t, [set]),
    -true = ets:insert(E2, [{{2,2},a},{{2,2.0},b},{{2.0,2},c}]),
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/queue.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (992))
    --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/queue.html	2026-06-04 19:05:19.635609800 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/queue.html	2026-06-04 19:05:19.635609800 +0000
    @@ -723,10 +723,10 @@
           
     
     

    Returns true if Pred(Item) returns true for all items Item in Q, -otherwise false.

    Example:

    1> Queue = queue:from_list([1,2,3,4,5]).
    -2> queue:all(fun (E) -> E > 3 end, Queue).
    +otherwise false.

    Example:

    1> Queue = queue:from_list([1,2,3,4,5]).
    +2> queue:all(fun (E) -> E > 3 end, Queue).
     false
    -3> queue:all(fun (E) -> E > 0 end, Queue).
    +3> queue:all(fun (E) -> E > 0 end, Queue).
     true
    @@ -758,10 +758,10 @@

    Returns true if Pred(Item) returns true for at least one item Item in -Q, otherwise false.

    Example:

    1> Queue = queue:from_list([1,2,3,4,5]).
    -2> queue:any(fun (E) -> E > 10 end, Queue).
    +Q, otherwise false.

    Example:

    1> Queue = queue:from_list([1,2,3,4,5]).
    +2> queue:any(fun (E) -> E > 10 end, Queue).
     false
    -3> queue:any(fun (E) -> E > 3 end, Queue).
    +3> queue:any(fun (E) -> E > 3 end, Queue).
     true
    @@ -793,9 +793,9 @@

    Returns a copy of Q1 where the first item matching Item is deleted, if there -is such an item.

    Example:

    1> Queue = queue:from_list([1,2,3,4,5]).
    -2> Queue1 = queue:delete(3, Queue).
    -3> queue:member(3, Queue1).
    +is such an item.

    Example:

    1> Queue = queue:from_list([1,2,3,4,5]).
    +2> Queue1 = queue:delete(3, Queue).
    +3> queue:member(3, Queue1).
     false
    @@ -827,10 +827,10 @@

    Returns a copy of Q1 where the last item matching Item is deleted, if there -is such an item.

    Example:

    1> Queue = queue:from_list([1,2,3,4,3,5]).
    -2> Queue1 = queue:delete_r(3, Queue).
    -3> queue:to_list(Queue1).
    -[1,2,3,4,5]
    +is such an item.

    Example:

    1> Queue = queue:from_list([1,2,3,4,3,5]).
    +2> Queue1 = queue:delete_r(3, Queue).
    +3> queue:to_list(Queue1).
    +[1,2,3,4,5]
    @@ -866,10 +866,10 @@

    Returns a copy of Q1 where the first item for which Pred returns true is -deleted, if there is such an item.

    Example:

    1> Queue = queue:from_list([100,1,2,3,4,5]).
    -2> Queue1 = queue:delete_with(fun (E) -> E > 0, Queue).
    -3> queue:to_list(Queue1).
    -[1,2,3,4,5]
    +deleted, if there is such an item.

    Example:

    1> Queue = queue:from_list([100,1,2,3,4,5]).
    +2> Queue1 = queue:delete_with(fun (E) -> E > 0, Queue).
    +3> queue:to_list(Queue1).
    +[1,2,3,4,5]
    @@ -905,10 +905,10 @@

    Returns a copy of Q1 where the last item for which Pred returns true is -deleted, if there is such an item.

    Example:

    1> Queue = queue:from_list([1,2,3,4,5,100]).
    -2> Queue1 = queue:delete_with(fun (E) -> E > 10, Queue).
    -3> queue:to_list(Queue1).
    -[1,2,3,4,5]
    +deleted, if there is such an item.

    Example:

    1> Queue = queue:from_list([1,2,3,4,5,100]).
    +2> Queue1 = queue:delete_with(fun (E) -> E > 10, Queue).
    +3> queue:to_list(Queue1).
    +[1,2,3,4,5]
    @@ -939,19 +939,19 @@

    Returns a queue Q2 that is the result of calling Fun(Item) on all items in Q1.

    If Fun(Item) returns true, Item is copied to the result queue. If it returns false, Item is not copied. If it returns a list, the list elements -are inserted instead of Item in the result queue.

    Example 1:

    1> Queue = queue:from_list([1,2,3,4,5]).
    -{[5,4,3],[1,2]}
    -2> Queue1 = queue:filter(fun (E) -> E > 2 end, Queue).
    -{[5],[3,4]}
    -3> queue:to_list(Queue1).
    -[3,4,5]

    So, Fun(Item) returning [Item] is thereby semantically equivalent to +are inserted instead of Item in the result queue.

    Example 1:

    1> Queue = queue:from_list([1,2,3,4,5]).
    +{[5,4,3],[1,2]}
    +2> Queue1 = queue:filter(fun (E) -> E > 2 end, Queue).
    +{[5],[3,4]}
    +3> queue:to_list(Queue1).
    +[3,4,5]

    So, Fun(Item) returning [Item] is thereby semantically equivalent to returning true, just as returning [] is semantically equivalent to returning -false. But returning a list builds more garbage than returning an atom.

    Example 2:

    1> Queue = queue:from_list([1,2,3,4,5]).
    -{[5,4,3],[1,2]}
    -2> Queue1 = queue:filter(fun (E) -> [E, E+1] end, Queue).
    -{[6,5,5,4,4,3],[1,2,2,3]}
    -3> queue:to_list(Queue1).
    -[1,2,2,3,3,4,4,5,5,6]
    +false. But returning a list builds more garbage than returning an atom.

    Example 2:

    1> Queue = queue:from_list([1,2,3,4,5]).
    +{[5,4,3],[1,2]}
    +2> Queue1 = queue:filter(fun (E) -> [E, E+1] end, Queue).
    +{[6,5,5,4,4,3],[1,2,2,3]}
    +3> queue:to_list(Queue1).
    +[1,2,2,3,3,4,4,5,5,6]
    @@ -990,15 +990,15 @@

    Returns a queue Q2 that is the result of calling Fun(Item) on all items in Q1.

    If Fun(Item) returns true, Item is copied to the result queue. If it returns false, Item is not copied. If it returns {true, NewItem}, the -queue element at this position is replaced with NewItem in the result queue.

    Example 1:

    1> Queue = queue:from_list([1,2,3,4,5]).
    -{[5,4,3],[1,2]}
    -2> Queue1 = queue:filtermap(fun (E) -> E > 2 end, Queue).
    -{[5],[3,4]}
    -3> queue:to_list(Queue1).
    -[3,4,5]
    -4> Queue1 = queue:filtermap(fun (E) -> {true, E+100} end, Queue).
    -{"ihg","ef"}
    -5> queue:to_list(Queue1).
    +queue element at this position is replaced with NewItem in the result queue.

    Example 1:

    1> Queue = queue:from_list([1,2,3,4,5]).
    +{[5,4,3],[1,2]}
    +2> Queue1 = queue:filtermap(fun (E) -> E > 2 end, Queue).
    +{[5],[3,4]}
    +3> queue:to_list(Queue1).
    +[3,4,5]
    +4> Queue1 = queue:filtermap(fun (E) -> {true, E+100} end, Queue).
    +{"ihg","ef"}
    +5> queue:to_list(Queue1).
     "efghi
    @@ -1039,9 +1039,9 @@ AccIn == Acc0. The queue is traversed in queue order, that is, from front to rear. Fun/2 must return a new accumulator, which is passed to the next call. The function returns the final value of the accumulator. Acc0 is returned if -the queue is empty.

    Example:

    1> queue:fold(fun(X, Sum) -> X + Sum end, 0, queue:from_list([1,2,3,4,5])).
    +the queue is empty.

    Example:

    1> queue:fold(fun(X, Sum) -> X + Sum end, 0, queue:from_list([1,2,3,4,5])).
     15
    -2> queue:fold(fun(X, Prod) -> X * Prod end, 1, queue:from_list([1,2,3,4,5])).
    +2> queue:fold(fun(X, Prod) -> X * Prod end, 1, queue:from_list([1,2,3,4,5])).
     120
    @@ -1099,12 +1099,12 @@ -

    Inserts Item at the rear of queue Q1. Returns the resulting queue Q2.

    Example:

    1> Queue = queue:from_list([1,2,3,4,5]).
    -{[5,4,3],[1,2]}
    -2> Queue1 = queue:in(100, Queue).
    -{[100,5,4,3],[1,2]}
    -3> queue:to_list(Queue1).
    -[1,2,3,4,5,100]
    +

    Inserts Item at the rear of queue Q1. Returns the resulting queue Q2.

    Example:

    1> Queue = queue:from_list([1,2,3,4,5]).
    +{[5,4,3],[1,2]}
    +2> Queue1 = queue:in(100, Queue).
    +{[100,5,4,3],[1,2]}
    +3> queue:to_list(Queue1).
    +[1,2,3,4,5,100]
    @@ -1132,12 +1132,12 @@ -

    Inserts Item at the front of queue Q1. Returns the resulting queue Q2.

    Example:

    1> Queue = queue:from_list([1,2,3,4,5]).
    -{[5,4,3],[1,2]}
    -2> Queue1 = queue:in_r(100, Queue).
    -{[5,4,3],[100,1,2]}
    -3> queue:to_list(Queue1).
    -[100,1,2,3,4,5]
    +

    Inserts Item at the front of queue Q1. Returns the resulting queue Q2.

    Example:

    1> Queue = queue:from_list([1,2,3,4,5]).
    +{[5,4,3],[1,2]}
    +2> Queue1 = queue:in_r(100, Queue).
    +{[5,4,3],[100,1,2]}
    +3> queue:to_list(Queue1).
    +[100,1,2,3,4,5]
    @@ -1225,12 +1225,12 @@

    Returns a queue Q3 that is the result of joining Q1 and Q2 with Q1 in -front of Q2.

    Example:

    1> Queue1 = queue:from_list([1,3]).
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/rand.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (2789))
    --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/rand.html	2026-06-04 19:05:19.671610134 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/rand.html	2026-06-04 19:05:19.683610245 +0000
    @@ -201,13 +201,13 @@
     a reasonably unpredictable seed.

    The functions with explicit state don't use the process dictionary.

    Examples

    Simple use; create and seed the default algorithm with a non-fixed seed, if not already done, and generate two uniformly distibuted -floating point numbers.

    R0 = rand:uniform(),
    -R1 = rand:uniform(),

    Use a specified algorithm:

    _ = rand:seed(exro928ss),
    -R2 = rand:uniform(),

    Use a specified algorithm with a fixed seed:

    _ = rand:seed(exro928ss, {123, 123534, 345345}),
    -R3 = rand:uniform(),

    Use the functional API with a non-fixed seed:

    S0 = rand:seed_s(exsss),
    -{R4, S1} = rand:uniform_s(S0),

    Generate a textbook basic form Box-Muller standard normal distribution number:

    R5 = rand:uniform_real(),
    -R6 = rand:uniform(),
    -SND0 = math:sqrt(-2 * math:log(R5)) * math:cos(math:pi() * R6)

    Generate a standard normal distribution number:

    {SND1, S2} = rand:normal_s(S1),

    Generate a normal distribution number with with mean -3 and variance 0.5:

    {ND0, S3} = rand:normal_s(-3, 0.5, S2),

    Quality of the Generated Numbers

    Note

    The builtin random number generator algorithms are not cryptographically +floating point numbers.

    R0 = rand:uniform(),
    +R1 = rand:uniform(),

    Use a specified algorithm:

    _ = rand:seed(exro928ss),
    +R2 = rand:uniform(),

    Use a specified algorithm with a fixed seed:

    _ = rand:seed(exro928ss, {123, 123534, 345345}),
    +R3 = rand:uniform(),

    Use the functional API with a non-fixed seed:

    S0 = rand:seed_s(exsss),
    +{R4, S1} = rand:uniform_s(S0),

    Generate a textbook basic form Box-Muller standard normal distribution number:

    R5 = rand:uniform_real(),
    +R6 = rand:uniform(),
    +SND0 = math:sqrt(-2 * math:log(R5)) * math:cos(math:pi() * R6)

    Generate a standard normal distribution number:

    {SND1, S2} = rand:normal_s(S1),

    Generate a normal distribution number with with mean -3 and variance 0.5:

    {ND0, S3} = rand:normal_s(-3, 0.5, S2),

    Quality of the Generated Numbers

    Note

    The builtin random number generator algorithms are not cryptographically strong. If a cryptographically strong random number generator is needed, use something like crypto:rand_seed/0.

    For all these generators except exro928ss and exsss the lowest bit(s) have got a slightly less random behaviour than all other bits. @@ -218,7 +218,7 @@ up to (and included) 16TB, with the exception of binary rank tests, which fail due to the lowest bit being an LFSR; all other bits pass all tests. We suggest to use a sign test to extract a random Boolean value.

    If this is a problem; to generate a boolean with these algorithms, -use something like this:

    (rand:uniform(256) > 128) % -> boolean()
    ((rand:uniform(256) - 1) bsr 7) % -> 0 | 1

    For a general range, with N = 1 for exrop, and N = 3 for exs1024s:

    (((rand:uniform(Range bsl N) - 1) bsr N) + 1)

    The floating point generating functions in this module waste the lowest bits +use something like this:

    (rand:uniform(256) > 128) % -> boolean()
    ((rand:uniform(256) - 1) bsr 7) % -> 0 | 1

    For a general range, with N = 1 for exrop, and N = 3 for exs1024s:

    (((rand:uniform(Range bsl N) - 1) bsr N) + 1)

    The floating point generating functions in this module waste the lowest bits when converting from an integer so they avoid this snag.

    @@ -1947,10 +1947,10 @@ equally spaced in the interval.

    Warning

    This function may return exactly 0.0 which can be fatal for certain applications. If that is undesired you can use (1.0 - rand:uniform()) to get the interval 0.0 < X =< 1.0, or instead use uniform_real/0.

    If neither endpoint is desired you can achieve the range -0.0 < X < 1.0 using test and re-try like this:

    my_uniform() ->
    -    case rand:uniform() of
    +0.0 < X < 1.0 using test and re-try like this:

    my_uniform() ->
    +    case rand:uniform() of
             X when 0.0 < X -> X;
    -        _ -> my_uniform()
    +        _ -> my_uniform()
         end.

    @@ -2111,7 +2111,7 @@ 16#7fa6502 * 2^32 - 1, which have been selected, in collaboration with Sebastiano Vigna, to avoid bignum operations and still get good statistical quality. It has been named "MWC59" and can be written as:

    C = CX0 bsr 32
    -X = CX0 band ((1 bsl 32)-1))
    +X = CX0 band ((1 bsl 32)-1))
     CX1 = 16#7fa6502 * X + C

    Because the generator uses a multiplier that is a power of 2 it gets statistical flaws for collision tests and birthday spacings tests in 2 and 3 dimensions, and these caveats apply even when looking @@ -2381,7 +2381,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/random.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (756)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/random.html 2026-06-04 19:05:19.706610459 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/random.html 2026-06-04 19:05:19.706610459 +0000 @@ -472,9 +472,9 @@

    Seeds random number generation with integer values in the process dictionary and -returns the old state.

    The following is an easy way of obtaining a unique value to seed with:

    random:seed(erlang:phash2([node()]),
    -            erlang:monotonic_time(),
    -            erlang:unique_integer())

    For details, see erlang:phash2/1, erlang:node/0, erlang:monotonic_time/0, +returns the old state.

    The following is an easy way of obtaining a unique value to seed with:

    random:seed(erlang:phash2([node()]),
    +            erlang:monotonic_time(),
    +            erlang:unique_integer())

    For details, see erlang:phash2/1, erlang:node/0, erlang:monotonic_time/0, and erlang:unique_integer/0.

    @@ -637,7 +637,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/re.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (2281)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/re.html 2026-06-04 19:05:19.752610885 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/re.html 2026-06-04 19:05:19.753610895 +0000 @@ -1375,9 +1375,9 @@ follows (COMMIT) can be triggered first, so merely passing (COMMIT) during a match does not always guarantee that a match must be at this starting point.

    Notice that (*COMMIT) at the start of a pattern is not the same as an anchor, unless the PCRE start-of-match optimizations are turned off, as shown in the -following example:

    1> re:run("xyzabc","(*COMMIT)abc",[{capture,all,list}]).
    -{match,["abc"]}
    -2> re:run("xyzabc","(*COMMIT)abc",[{capture,all,list},no_start_optimize]).
    +following example:

    1> re:run("xyzabc","(*COMMIT)abc",[{capture,all,list}]).
    +{match,["abc"]}
    +2> re:run("xyzabc","(*COMMIT)abc",[{capture,all,list},no_start_optimize]).
     nomatch

    For this pattern, PCRE knows that any match must start with "a", so the optimization skips along the subject to "a" before applying the pattern to the first set of data. The match attempt then succeeds. In the second call the @@ -2108,32 +2108,32 @@

    Takes a compiled regular expression and an item, and returns the relevant data from the regular expression.

    The only supported item is namelist, which returns the tuple {namelist, [binary()]}, -containing the names of all (unique) named subpatterns in the regular expression.

    For example:

    1> {ok,MP} = re:compile("(?<A>A)|(?<B>B)|(?<C>C)").
    -{ok,{re_pattern,3,0,0,
    +containing the names of all (unique) named subpatterns in the regular expression.

    For example:

    1> {ok,MP} = re:compile("(?<A>A)|(?<B>B)|(?<C>C)").
    +{ok,{re_pattern,3,0,0,
                     <<69,82,67,80,119,0,0,0,0,0,0,0,1,0,0,0,255,255,255,255,
    -                  255,255,...>>}}
    -2> re:inspect(MP,namelist).
    -{namelist,[<<"A">>,<<"B">>,<<"C">>]}
    -3> {ok,MPD} = re:compile("(?<C>A)|(?<B>B)|(?<C>C)",[dupnames]).
    -{ok,{re_pattern,3,0,0,
    +                  255,255,...>>}}
    +2> re:inspect(MP,namelist).
    +{namelist,[<<"A">>,<<"B">>,<<"C">>]}
    +3> {ok,MPD} = re:compile("(?<C>A)|(?<B>B)|(?<C>C)",[dupnames]).
    +{ok,{re_pattern,3,0,0,
                     <<69,82,67,80,119,0,0,0,0,0,8,0,1,0,0,0,255,255,255,255,
    -                  255,255,...>>}}
    -4> re:inspect(MPD,namelist).
    -{namelist,[<<"B">>,<<"C">>]}

    Notice in the second example that the duplicate name only occurs once in the + 255,255,...>>}} +4> re:inspect(MPD,namelist). +{namelist,[<<"B">>,<<"C">>]}

    Notice in the second example that the duplicate name only occurs once in the returned list, and that the list is in alphabetical order regardless of where the names are positioned in the regular expression. The order of the names is the same as the order of captured subexpressions if {capture, all_names} is specified as an option to run/3. You can therefore create a name-to-value -mapping from the result of run/3 like this:

    1> {ok,MP} = re:compile("(?<A>A)|(?<B>B)|(?<C>C)").
    -{ok,{re_pattern,3,0,0,
    +mapping from the result of run/3 like this:

    1> {ok,MP} = re:compile("(?<A>A)|(?<B>B)|(?<C>C)").
    +{ok,{re_pattern,3,0,0,
                     <<69,82,67,80,119,0,0,0,0,0,0,0,1,0,0,0,255,255,255,255,
    -                  255,255,...>>}}
    -2> {namelist, N} = re:inspect(MP,namelist).
    -{namelist,[<<"A">>,<<"B">>,<<"C">>]}
    -3> {match,L} = re:run("AA",MP,[{capture,all_names,binary}]).
    -{match,[<<"A">>,<<>>,<<>>]}
    -4> NameMap = lists:zip(N,L).
    -[{<<"A">>,<<"A">>},{<<"B">>,<<>>},{<<"C">>,<<>>}]
    +
    255,255,...>>}} +2> {namelist, N} = re:inspect(MP,namelist). +{namelist,[<<"A">>,<<"B">>,<<"C">>]} +3> {match,L} = re:run("AA",MP,[{capture,all_names,binary}]). +{match,[<<"A">>,<<>>,<<>>]} +4> NameMap = lists:zip(N,L). +[{<<"A">>,<<"A">>},{<<"B">>,<<>>},{<<"C">>,<<>>}]
    @@ -2226,16 +2226,16 @@ subexpression number N, is inserted in the result. If no subexpression with that number is generated by the regular expression, nothing is inserted.

    To insert an & or a \ in the result, precede it with a \. Notice that Erlang already gives a special meaning to \ in literal strings, so a single \ must be -written as "\\" and therefore a double \ as "\\\\".

    Example:

    1> re:replace("abcd","c","[&]",[{return,list}]).
    -"ab[c]d"

    while

    2> re:replace("abcd","c","[\\&]",[{return,list}]).
    +written as "\\" and therefore a double \ as "\\\\".

    Example:

    1> re:replace("abcd","c","[&]",[{return,list}]).
    +"ab[c]d"

    while

    2> re:replace("abcd","c","[\\&]",[{return,list}]).
     "ab[&]d"

    If the replacement is given as a fun, it will be called with the whole matching expression as the first argument and a list of subexpression matches in the order in which they appear in the regular expression. The returned value will be -inserted in the result.

    Example:

    3> re:replace("abcd", ".(.)",
    -    fun(Whole, [<<C>>]) ->
    -         <<$#, Whole/binary, $-, (C - $a + $A), $#>>
    +inserted in the result.

    Example:

    3> re:replace("abcd", ".(.)",
    +    fun(Whole, [<<C>>]) ->
    +         <<$#, Whole/binary, $-, (C - $a + $A), $#>>
         end,
    -    [{return, list}]).
    +    [{return, list}]).
     "#ab-B#cd"

    Note

    Non-matching optional subexpressions will not be included in the list of subexpression matches if they are the last subexpressions in the regular expression.

    Example:

    The regular expression "(a)(b)?(c)?" ("a", optionally followed by "b", @@ -2352,7 +2352,7 @@ run/3 handles empty matches in the same way as Perl: a zero-length match at any point is also retried with options [anchored, notempty_atstart]. If that search gives a result of length > 0, -the result is included. Example:

    re:run("cat","(|at)",[global]).

    The following matchings are performed:

    • At offset 0 - The regular expression (|at) first match at the +the result is included. Example:

      re:run("cat","(|at)",[global]).

      The following matchings are performed:

      • At offset 0 - The regular expression (|at) first match at the initial position of string cat, giving the result set [{0,0},{0,0}] (the second {0,0} is because of the subexpression marked by the parentheses). As the length of the match is 0, we do not advance to the next position yet.

      • At offset 0 with [anchored, notempty_atstart] - The search is @@ -2364,7 +2364,7 @@ of results and the position in the search string is advanced two steps.

      • At offset 3 - The search once again matches the empty string, giving [{3,0},{3,0}].

      • At offset 1 with [anchored, notempty_atstart] - This gives no result of length > 0 and we are at the last position, so the global search is -complete.

      The result of the call is:

      {match,[[{0,0},{0,0}],[{1,0},{1,0}],[{1,2},{1,2}],[{3,0},{3,0}]]}
    • notempty - An empty string is not considered to be a valid match if this +complete.

    The result of the call is:

    {match,[[{0,0},{0,0}],[{1,0},{1,0}],[{1,2},{1,2}],[{3,0},{3,0}]]}
  • notempty - An empty string is not considered to be a valid match if this option is specified. If alternatives in the pattern exist, they are tried. If all the alternatives match the empty string, the entire match fails.

    Example:

    If the following pattern is applied to a string not beginning with "a" or "b", it would normally match the empty string at the start of the subject:

    a?b?

    With option notempty, this match is invalid, so run/3 searches @@ -2435,12 +2435,12 @@ instead of the stack, the amount of heap memory that can be used.

  • The Erlang VM uses a PCRE library where heap memory is used when regular expression match recursion occurs. This therefore limits the use of machine heap, not C stack.

    Specifying a lower value can result in matches with deep recursion failing, -when they should have matched:

    1> re:run("aaaaaaaaaaaaaz","(a+)*z").
    -{match,[{0,14},{0,13}]}
    -2> re:run("aaaaaaaaaaaaaz","(a+)*z",[{match_limit_recursion,5}]).
    +when they should have matched:

    1> re:run("aaaaaaaaaaaaaz","(a+)*z").
    +{match,[{0,14},{0,13}]}
    +2> re:run("aaaaaaaaaaaaaz","(a+)*z",[{match_limit_recursion,5}]).
     nomatch
    -3> re:run("aaaaaaaaaaaaaz","(a+)*z",[{match_limit_recursion,5},report_errors]).
    -{error,match_limit_recursion}

    This option and option match_limit are only to be used in rare cases. +3> re:run("aaaaaaaaaaaaaz","(a+)*z",[{match_limit_recursion,5},report_errors]). +{error,match_limit_recursion}

    This option and option match_limit are only to be used in rare cases. Understanding of the PCRE library internals is recommended before tampering with these limits.

  • {offset, integer() >= 0} - Start matching at the offset (position) specified in the subject string. The offset is zero-based, so that the default @@ -2462,9 +2462,9 @@ capturing).

    As an example of the default behavior, the following call returns, as first and only captured string, the matching part of the subject ("abcd" in the middle) as an index pair {3,4}, where character positions are zero-based, -just as in offsets:

    re:run("ABCabcdABC","abcd",[]).

    The return value of this call is:

    {match,[{3,4}]}

    Another (and quite common) case is where the regular expression matches all of -the subject:

    re:run("ABCabcdABC",".*abcd.*",[]).

    Here the return value correspondingly points out all of the string, beginning -at index 0, and it is 10 characters long:

    {match,[{0,10}]}

    If the regular expression contains capturing subpatterns, like in:

    re:run("ABCabcdABC",".*(abcd).*",[]).

    all of the matched subject is captured, as well as the captured substrings:

    {match,[{0,10},{3,4}]}

    The complete matching pattern always gives the first return value in the list +just as in offsets:

    re:run("ABCabcdABC","abcd",[]).

    The return value of this call is:

    {match,[{3,4}]}

    Another (and quite common) case is where the regular expression matches all of +the subject:

    re:run("ABCabcdABC",".*abcd.*",[]).

    Here the return value correspondingly points out all of the string, beginning +at index 0, and it is 10 characters long:

    {match,[{0,10}]}

    If the regular expression contains capturing subpatterns, like in:

    re:run("ABCabcdABC",".*(abcd).*",[]).

    all of the matched subject is captured, as well as the captured substrings:

    {match,[{0,10},{3,4}]}

    The complete matching pattern always gives the first return value in the list and the remaining subpatterns are added in the order they occurred in the regular expression.

    The capture tuple is built up as follows:

    • ValueSpec - Specifies which captured (sub)patterns are to be returned. ValueSpec can either be an atom describing a predefined set of return @@ -2489,12 +2489,12 @@ subpatterns (see below) in the regular expression, one can use atom/0s or string/0s to specify the subpatterns to be returned. For example, consider the regular expression:

      ".*(abcd).*"

      matched against string "ABCabcdABC", capturing only the "abcd" part (the -first explicit subpattern):

      re:run("ABCabcdABC",".*(abcd).*",[{capture,[1]}]).

      The call gives the following result, as the first explicitly captured +first explicit subpattern):

      re:run("ABCabcdABC",".*(abcd).*",[{capture,[1]}]).

      The call gives the following result, as the first explicitly captured subpattern is "(abcd)", matching "abcd" in the subject, at (zero-based) -position 3, of length 4:

      {match,[{3,4}]}

      Consider the same regular expression, but with the subpattern explicitly +position 3, of length 4:

      {match,[{3,4}]}

      Consider the same regular expression, but with the subpattern explicitly named 'FOO':

      ".*(?<FOO>abcd).*"

      With this expression, we could still give the index of the subpattern with -the following call:

      re:run("ABCabcdABC",".*(?<FOO>abcd).*",[{capture,[1]}]).

      giving the same result as before. But, as the subpattern is named, we can -also specify its name in the value list:

      re:run("ABCabcdABC",".*(?<FOO>abcd).*",[{capture,['FOO']}]).

      This would give the same result as the earlier examples, namely:

      {match,[{3,4}]}

      The values list can specify indexes or names not present in the regular +the following call:

      re:run("ABCabcdABC",".*(?<FOO>abcd).*",[{capture,[1]}]).

      giving the same result as before. But, as the subpattern is named, we can +also specify its name in the value list:

      re:run("ABCabcdABC",".*(?<FOO>abcd).*",[{capture,['FOO']}]).

      This would give the same result as the earlier examples, namely:

      {match,[{3,4}]}

      The values list can specify indexes or names not present in the regular expression, in which case the return values vary depending on the type. If the type is index, the tuple {-1,0} is returned for values with no corresponding subpattern in the regular expression, but for the other types @@ -2529,12 +2529,12 @@ string:

      "ABCabcdABC"

      the subpattern at index 2 does not match, as "abdd" is not present in the string, but the complete pattern matches (because of the alternative a(..d)). The subpattern at index 2 is therefore unassigned and the default -return value is:

      {match,[{0,10},{3,4},{-1,0},{4,3}]}

      Setting the capture Type to binary gives:

      {match,[<<"ABCabcdABC">>,<<"abcd">>,<<>>,<<"bcd">>]}

      Here the empty binary (<<>>) represents the unassigned subpattern. In the +return value is:

      {match,[{0,10},{3,4},{-1,0},{4,3}]}

      Setting the capture Type to binary gives:

      {match,[<<"ABCabcdABC">>,<<"abcd">>,<<>>,<<"bcd">>]}

      Here the empty binary (<<>>) represents the unassigned subpattern. In the binary case, some information about the matching is therefore lost, as <<>> can also be an empty string captured.

      If differentiation between empty matches and non-existing subpatterns is necessary, use the type index and do the conversion to the final type in Erlang code.

      When option global is speciified, the capture specification affects each -match separately, so that:

      re:run("cacb","c(a|b)",[global,{capture,[1],list}]).

      gives

      {match,[["a"],["b"]]}

    For a descriptions of options only affecting the compilation step, see +match separately, so that:

    re:run("cacb","c(a|b)",[global,{capture,[1],list}]).

    gives

    {match,[["a"],["b"]]}
  • For a descriptions of options only affecting the compilation step, see compile/2.

    @@ -2623,7 +2623,7 @@ compilation option is specified to this function, both the regular expression and Subject are to be specified as valid Unicode charlist()s.

    The result is given as a list of "strings", the preferred data type specified in option return (default iodata).

    If subexpressions are specified in the regular expression, the matching -subexpressions are returned in the resulting list as well. For example:

    re:split("Erlang","[ln]",[{return,list}]).

    gives

    ["Er","a","g"]

    while

    re:split("Erlang","([ln])",[{return,list}]).

    gives

    ["Er","l","a","n","g"]

    The text matching the subexpression (marked by the parentheses in the regular +subexpressions are returned in the resulting list as well. For example:

    re:split("Erlang","[ln]",[{return,list}]).

    gives

    ["Er","a","g"]

    while

    re:split("Erlang","([ln])",[{return,list}]).

    gives

    ["Er","l","a","n","g"]

    The text matching the subexpression (marked by the parentheses in the regular expression) is inserted in the result list where it was found. This means that concatenating the result of a split where the whole regular expression is a single subexpression (as in the last example) always results in the original @@ -2631,21 +2631,21 @@ "g"), nothing is inserted after that. To make the group of strings and the parts matching the subexpressions more obvious, one can use option group, which groups together the part of the subject string with the parts matching the -subexpressions when the string was split:

    re:split("Erlang","([ln])",[{return,list},group]).

    gives

    [["Er","l"],["a","n"],["g"]]

    Here the regular expression first matched the "l", causing "Er" to be the first +subexpressions when the string was split:

    re:split("Erlang","([ln])",[{return,list},group]).

    gives

    [["Er","l"],["a","n"],["g"]]

    Here the regular expression first matched the "l", causing "Er" to be the first part in the result. When the regular expression matched, the (only) subexpression was bound to the "l", so the "l" is inserted in the group together with "Er". The next match is of the "n", making "a" the next part to be returned. As the subexpression is bound to substring "n" in this case, the "n" is inserted into this group. The last group consists of the remaining string, as no more matches are found.

    By default, all parts of the string, including the empty strings, are returned -from the function, for example:

    re:split("Erlang","[lg]",[{return,list}]).

    gives

    ["Er","an",[]]

    as the matching of the "g" in the end of the string leaves an empty rest, which +from the function, for example:

    re:split("Erlang","[lg]",[{return,list}]).

    gives

    ["Er","an",[]]

    as the matching of the "g" in the end of the string leaves an empty rest, which is also returned. This behavior differs from the default behavior of the split function in Perl, where empty strings at the end are by default removed. To get -the "trimming" default behavior of Perl, specify trim as an option:

    re:split("Erlang","[lg]",[{return,list},trim]).

    gives

    ["Er","an"]

    The "trim" option says; "give me as many parts as possible except the empty +the "trimming" default behavior of Perl, specify trim as an option:

    re:split("Erlang","[lg]",[{return,list},trim]).

    gives

    ["Er","an"]

    The "trim" option says; "give me as many parts as possible except the empty ones", which sometimes can be useful. You can also specify how many parts you -want, by specifying {parts,N}:

    re:split("Erlang","[lg]",[{return,list},{parts,2}]).

    gives

    ["Er","ang"]

    Notice that the last part is "ang", not "an", as splitting was specified into /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/search.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/search.html 2026-06-04 19:05:19.771611061 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/search.html 2026-06-04 19:05:19.771611061 +0000 @@ -145,7 +145,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/sets.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1618)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/sets.html 2026-06-04 19:05:19.793611266 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/sets.html 2026-06-04 19:05:19.793611266 +0000 @@ -156,11 +156,11 @@ respect to the aforementioned functions, their overall behavior may differ. As mentioned, this module considers elements as different if and only if they do not match (=:=), while both ordsets and gb_sets consider elements -as different if and only if they do not compare equal (==).

    Example:

    1> sets:is_element(1.0, sets:from_list([1])).
    +as different if and only if they do not compare equal (==).

    Example:

    1> sets:is_element(1.0, sets:from_list([1])).
     false
    -2> ordsets:is_element(1.0, ordsets:from_list([1])).
    +2> ordsets:is_element(1.0, ordsets:from_list([1])).
     true
    -2> gb_sets:is_element(1.0, gb_sets:from_list([1])).
    +2> gb_sets:is_element(1.0, gb_sets:from_list([1])).
     true

    @@ -1226,7 +1226,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/shell.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (917)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/shell.html 2026-06-04 19:05:19.821611525 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/shell.html 2026-06-04 19:05:19.821611525 +0000 @@ -166,7 +166,7 @@ definitions. To facilitate matters, record definitions in modules shell_default and user_default (if loaded) are read each time a new job is started. For example, adding the following line to user_default makes the -definition of file_info readily available in the shell:

    -include_lib("kernel/include/file.hrl").

    The shell runs in two modes:

    Command 1 sets variable Str to string "abcd".

    2> L = length(Str).
    +4

    Command 2 sets L to the length of string Str.

    3> Descriptor = {L, list_to_atom(Str)}.
    +{4,abcd}

    Command 3 builds the tuple Descriptor, evaluating the BIF list_to_atom/1 .

    4> L.
    -4

    Command 4 prints the value of variable L.

    5> b().
    -Descriptor = {4,abcd}
    +4

    Command 4 prints the value of variable L.

    5> b().
    +Descriptor = {4,abcd}
     L = 4
     Str = "abcd"
     ok

    Command 5 evaluates the internal shell command b(), which is an abbreviation of "bindings". This prints the current shell variables and their bindings. ok -at the end is the return value of function b().

    6> f(L).
    +at the end is the return value of function b().

    6> f(L).
     ok

    Command 6 evaluates the internal shell command f(L) (abbreviation of -"forget"). The value of variable L is removed.

    7> b().
    -Descriptor = {4,abcd}
    +"forget"). The value of variable L is removed.

    7> b().
    +Descriptor = {4,abcd}
     Str = "abcd"
    -ok

    Command 7 prints the new bindings.

    8> f(L).
    -ok

    Command 8 has no effect, as L has no value.

    9> {L, _} = Descriptor.
    -{4,abcd}

    Command 9 performs a pattern matching operation on Descriptor, binding a new +ok

    Command 7 prints the new bindings.

    8> f(L).
    +ok

    Command 8 has no effect, as L has no value.

    9> {L, _} = Descriptor.
    +{4,abcd}

    Command 9 performs a pattern matching operation on Descriptor, binding a new value to L.

    10> L.
    -4

    Command 10 prints the current value of L.

    11> {P, Q, R} = Descriptor.
    +4

    Command 10 prints the current value of L.

    11> {P, Q, R} = Descriptor.
     ** exception error: no match of right hand side value {4,abcd}

    Command 11 tries to match {P, Q, R} against Descriptor, which is {4, abc}. The match fails and none of the new variables become bound. The printout starting with "** exception error:" is not the value of the expression (the @@ -266,74 +266,74 @@ other variables (L, Str, and so on) are unchanged.

    12> P.
     * 1:1: variable 'P' is unbound
     13> Descriptor.
    -{4,abcd}

    Commands 12 and 13 show that P is unbound because the previous command failed, -and that Descriptor has not changed.

    14>{P, Q} = Descriptor.
    -{4,abcd}
    +{4,abcd}

    Commands 12 and 13 show that P is unbound because the previous command failed, +and that Descriptor has not changed.

    14>{P, Q} = Descriptor.
    +{4,abcd}
     15> P.
    -4

    Commands 14 and 15 show a correct match where P and Q are bound.

    16> f().
    -ok

    Command 16 clears all bindings.

    The next few commands assume that test1:demo(X) is defined as follows:

    demo(X) ->
    -    put(aa, worked),
    +4

    Commands 14 and 15 show a correct match where P and Q are bound.

    16> f().
    +ok

    Command 16 clears all bindings.

    The next few commands assume that test1:demo(X) is defined as follows:

    demo(X) ->
    +    put(aa, worked),
         X = 1,
    -    X + 10.
    17> put(aa, hello).
    +    X + 10.
    17> put(aa, hello).
     undefined
    -18> get(aa).
    +18> get(aa).
     hello

    Commands 17 and 18 set and inspect the value of item aa in the process -dictionary.

    19> Y = test1:demo(1).
    +dictionary.

    19> Y = test1:demo(1).
     11

    Command 19 evaluates test1:demo(1). The evaluation succeeds and the changes made in the process dictionary become visible to the shell. The new value of -dictionary item aa can be seen in command 20.

    20> get().
    -[{aa,worked}]
    -21> put(aa, hello).
    +dictionary item aa can be seen in command 20.

    20> get().
    +[{aa,worked}]
    +21> put(aa, hello).
     worked
    -22> Z = test1:demo(2).
    +22> Z = test1:demo(2).
     ** exception error: no match of right hand side value 1
          in function  test1:demo/1

    Commands 21 and 22 change the value of dictionary item aa to hello and call test1:demo(2). Evaluation fails and the changes made to the dictionary in test1:demo(2), before the error occurred, are discarded.

    23> Z.
     * 1:1: variable 'Z' is unbound
    -24> get(aa).
    +24> get(aa).
     hello

    Commands 23 and 24 show that Z was not bound and that dictionary item aa has -retained its original value.

    25> erase(), put(aa, hello).
    +retained its original value.

    25> erase(), put(aa, hello).
     undefined
    -26> spawn(test1, demo, [1]).
    +26> spawn(test1, demo, [1]).
     <0.57.0>
    -27> get(aa).
    +27> get(aa).
     hello

    Commands 25, 26, and 27 show the effect of evaluating test1:demo(1) in the background. In this case, the expression is evaluated in a newly spawned process. Any changes made in the process dictionary are local to the newly -spawned process and therefore not visible to the shell.

    28> io:format("hello hello\n").
    +spawned process and therefore not visible to the shell.

    28> io:format("hello hello\n").
     hello hello
     ok
    -29> e(28).
    +29> e(28).
     hello hello
     ok
    -30> v(28).
    +30> v(28).
     ok

    Commands 28, 29 and 30 use the history facilities of the shell. Command 29 re-evaluates command 28. Command 30 uses the value (result) of command 28. In the cases of a pure function (a function with no side effects), the result is the same. For a function with side effects, the result can be different.

    The next few commands show some record manipulation. It is assumed that ex.erl -defines a record as follows:

    -record(rec, {a, b = val()}).

    val() ->
        3.

    31> c(ex).
    -{ok,ex}
    -32> rr(ex).
    -[rec]

    Commands 31 and 32 compile file ex.erl and read the record definitions in +defines a record as follows:

    -record(rec, {a, b = val()}).

    val() ->
        3.

    31> c(ex).
    +{ok,ex}
    +32> rr(ex).
    +[rec]

    Commands 31 and 32 compile file ex.erl and read the record definitions in ex.beam. If the compiler did not output any record definitions on the BEAM -file, rr(ex) tries to read record definitions from the source file instead.

    33> rl(rec).
    --record(rec,{a,b = val()}).
    -ok

    Command 33 prints the definition of the record named rec.

    34> #rec{}.
    +file, rr(ex) tries to read record definitions from the source file instead.

    33> rl(rec).
    +-record(rec,{a,b = val()}).
    +ok

    Command 33 prints the definition of the record named rec.

    34> #rec{}.
     ** exception error: undefined shell command val/0

    Command 34 tries to create a rec record, but fails as function val/0 is -undefined.

    35> #rec{b = 3}.
    -#rec{a = undefined,b = 3}

    Command 35 shows the workaround: explicitly assign values to record fields that -cannot otherwise be initialized.

    36> rp(v(-1)).
    -#rec{a = undefined,b = 3}
    +undefined.

    35> #rec{b = 3}.
    +#rec{a = undefined,b = 3}

    Command 35 shows the workaround: explicitly assign values to record fields that +cannot otherwise be initialized.

    36> rp(v(-1)).
    +#rec{a = undefined,b = 3}
     ok

    Command 36 prints the newly created record using record definitions maintained -by the shell.

    37> rd(rec, {f = orddict:new()}).
    +by the shell.

    37> rd(rec, {f = orddict:new()}).
     rec

    Command 37 defines a record directly in the shell. The definition replaces the -one read from file ex.beam.

    38> #rec{}.
    -#rec{f = []}
    -ok

    Command 38 creates a record using the new definition, and prints the result.

    39> rd(rec, {c}), A.
    +one read from file ex.beam.

    38> #rec{}.
    +#rec{f = []}
    +ok

    Command 38 creates a record using the new definition, and prints the result.

    39> rd(rec, {c}), A.
     * 1:15: variable 'A' is unbound
    -40> #rec{}.
    -#rec{c = undefined}
    +40> #rec{}.
    +#rec{c = undefined}
     ok

    Command 39 and 40 show that record definitions are updated as side effects. The evaluation of the command fails, but the definition of rec has been carried out.

    For the next command, it is assumed that test1:loop(N) is defined as follows:

    loop(N) ->
        io:format("Hello Number: ~w~n", [N]),
        loop(N+1).

    41> test1:loop(0).
    @@ -359,31 +359,31 @@
     JCL mode the user can start and stop jobs.

    In this particular case, command i ("interrupt") terminates the looping program, and command c connects to the shell again. As the process was running in the background before we killed it, more printouts occur before message -"** exception exit: killed" is shown.

    42> E = ets:new(t, []).
    -#Ref<0.1662103692.2407923716.214192>

    Command 42 creates an ETS table.

    43> ets:insert({d,1,2}).
    +"** exception exit: killed" is shown.

    42> E = ets:new(t, []).
    +#Ref<0.1662103692.2407923716.214192>

    Command 42 creates an ETS table.

    43> ets:insert({d,1,2}).
     ** exception error: undefined function ets:insert/1

    Command 43 tries to insert a tuple into the ETS table, but the first argument -(the table) is missing. The exception kills the evaluator process.

    44> ets:insert(E, {d,1,2}).
    +(the table) is missing. The exception kills the evaluator process.

    44> ets:insert(E, {d,1,2}).
     ** exception error: argument is of wrong type
          in function  ets:insert/2
             called as ets:insert(16,{d,1,2})

    Command 44 corrects the mistake, but the ETS table has been destroyed as it was -owned by the killed evaluator process.

    45> f(E).
    +owned by the killed evaluator process.

    45> f(E).
     ok
    -46> catch_exception(true).
    +46> catch_exception(true).
     false

    Command 46 sets the exception handling of the evaluator process to true. The exception handling can also be set when starting Erlang by -erl -stdlib shell_catch_exception true.

    47> E = ets:new(t, []).
    +erl -stdlib shell_catch_exception true.

    47> E = ets:new(t, []).
     #Ref<0.1662103692.2407923716.214197>
    -48> ets:insert({d,1,2}).
    +48> ets:insert({d,1,2}).
     * exception error: undefined function ets:insert/1

    Command 48 makes the same mistake as in command 43, but this time the evaluator process lives on. The single star at the beginning of the printout signals that -the exception has been caught.

    49> ets:insert(E, {d,1,2}).
    -true

    Command 49 successfully inserts the tuple into the ETS table.

    50> ets:insert(#Ref<0.1662103692.2407923716.214197>, {e,3,4}).
    +the exception has been caught.

    49> ets:insert(E, {d,1,2}).
    +true

    Command 49 successfully inserts the tuple into the ETS table.

    50> ets:insert(#Ref<0.1662103692.2407923716.214197>, {e,3,4}).
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/shell_default.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (420))
    --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/shell_default.html	2026-06-04 19:05:19.839611692 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/shell_default.html	2026-06-04 19:05:19.839611692 +0000
    @@ -129,10 +129,10 @@
     
         

    Customizing the Erlang environment.

    The functions in this module are called when no module name is specified in a -shell command.

    Consider the following shell dialog:

    1> lists:reverse("abc").
    +shell command.

    Consider the following shell dialog:

    1> lists:reverse("abc").
     "cba"
    -2> c(foo).
    -{ok, foo}

    In command one, module lists is called. In command two, no module name is +2> c(foo). +{ok, foo}

    In command one, module lists is called. In command two, no module name is specified. The shell searches module user_default followed by module shell_default for function c/1.

    shell_default is intended for "system wide" customizations to the shell. user_default is intended for "local" or individual user customizations.

    @@ -237,7 +237,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/shell_docs.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (319)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/shell_docs.html 2026-06-04 19:05:19.862611906 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/shell_docs.html 2026-06-04 19:05:19.862611906 +0000 @@ -1294,7 +1294,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/slave.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (979)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/slave.html 2026-06-04 19:05:19.884612110 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/slave.html 2026-06-04 19:05:19.884612110 +0000 @@ -375,7 +375,7 @@ at a master node. A pseudo server is an intermediary that only has the same registered name as the real server.

    For example, if you have started a slave node N and want to execute pxw graphics code on this node, you can start server pxw_server as a pseudo server -at the slave node. This is illustrated as follows:

    rpc:call(N, slave, pseudo, [node(), [pxw_server]]).
    +at the slave node. This is illustrated as follows:

    rpc:call(N, slave, pseudo, [node(), [pxw_server]]).

    @@ -529,9 +529,9 @@ passed to the new node and can be used for a variety of purposes; see erl(1).

    As an example, suppose that you want to start a slave node at host H with node name Name@H and want the slave node to have the following properties:

    • Directory Dir is to be added to the code path.
    • The Mnesia directory is to be set to M.
    • The Unix DISPLAY environment variable is to be set to the display of the -master node.

    The following code is executed to achieve this:

    E = " -env DISPLAY " ++ net_adm:localhost() ++ ":0 ",
    +master node.

    The following code is executed to achieve this:

    E = " -env DISPLAY " ++ net_adm:localhost() ++ ":0 ",
     Arg = "-mnesia_dir " ++ M ++ " -pa " ++ Dir ++ E,
    -slave:start(H, Name, Arg).

    The function returns {ok, Node}, where Node is the name of the new node, +slave:start(H, Name, Arg).

    The function returns {ok, Node}, where Node is the name of the new node, otherwise {error, Reason}, where Reason can be one of:

    • timeout - The master node failed to get in contact with the slave node. This can occur in a number of circumstances:

      • Erlang/OTP is not installed on the remote host.
      • The file system on the other host has a different structure to the the master.
      • The Erlang nodes have different cookies.
    • no_rsh - No remote shell program was found on the computer. Note that @@ -710,7 +710,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/sofs.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1348)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/sofs.html 2026-06-04 19:05:19.944612666 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/sofs.html 2026-06-04 19:05:19.944612666 +0000 @@ -262,11 +262,11 @@ selecting, duplicating, or rearranging parts of the elements.
    • Specifying a SetFun as an integer I is equivalent to specifying {external, fun(X) -> element(I, X) end}, but is to be preferred, as it makes it possible to handle this case even more efficiently.

    Examples of SetFuns:

    fun sofs:union/1
    -fun(S) -> sofs:partition(1, S) end
    -{external, fun(A) -> A end}
    -{external, fun({A,_,C}) -> {C,A} end}
    -{external, fun({_,{_,C}}) -> C end}
    -{external, fun({_,{_,{_,E}=C}}) -> {E,{E,C}} end}
    +fun(S) -> sofs:partition(1, S) end
    +{external, fun(A) -> A end}
    +{external, fun({A,_,C}) -> {C,A} end}
    +{external, fun({_,{_,C}}) -> C end}
    +{external, fun({_,{_,{_,E}=C}}) -> {E,{E,C}} end}
     2

    The order in which a SetFun is applied to the elements of an unordered set is not specified, and can change in future versions of this module.

    The execution time of the functions of this module is dominated by the time it takes to sort lists. When no sorting is needed, the execution time is in the @@ -1832,10 +1832,10 @@ belongs to SetOfSets and E belongs to Set.

    If SetOfSets is a partition of a set X and R is the equivalence relation in X induced by SetOfSets, then the returned relation is the canonical map from X onto the equivalence classes with -respect to R.

    1> Ss = sofs:from_term([[a,b],[b,c]]),
    -CR = sofs:canonical_relation(Ss),
    -sofs:to_external(CR).
    -[{a,[a,b]},{b,[a,b]},{b,[b,c]},{c,[b,c]}]
    +respect to R.

    1> Ss = sofs:from_term([[a,b],[b,c]]),
    +CR = sofs:canonical_relation(Ss),
    +sofs:to_external(CR).
    +[{a,[a,b]},{b,[a,b]},{b,[b,c]},{c,[b,c]}]
    @@ -1865,11 +1865,11 @@

    Returns the composite of the functions Function1 and -Function2.

    1> F1 = sofs:a_function([{a,1},{b,2},{c,2}]),
    -F2 = sofs:a_function([{1,x},{2,y},{3,z}]),
    -F = sofs:composite(F1, F2),
    -sofs:to_external(F).
    -[{a,x},{b,y},{c,y}]
    +Function2.

    1> F1 = sofs:a_function([{a,1},{b,2},{c,2}]),
    +F2 = sofs:a_function([{1,x},{2,y},{3,z}]),
    +F = sofs:composite(F1, F2),
    +sofs:to_external(F).
    +[{a,x},{b,y},{c,y}]
    @@ -1899,11 +1899,11 @@

    Creates the function that maps each element of set Set -onto AnySet.

    1> S = sofs:set([a,b]),
    -E = sofs:from_term(1),
    -R = sofs:constant_function(S, E),
    -sofs:to_external(R).
    -[{a,1},{b,1}]
    +onto AnySet.

    1> S = sofs:set([a,b]),
    +E = sofs:from_term(1),
    +R = sofs:constant_function(S, E),
    +sofs:to_external(R).
    +[{a,1},{b,1}]
    @@ -1931,10 +1931,10 @@ -

    Returns the converse of the binary relation BinRel1.

    1> R1 = sofs:relation([{1,a},{2,b},{3,a}]),
    -R2 = sofs:converse(R1),
    -sofs:to_external(R2).
    -[{a,1},{a,3},{b,2}]
    +

    Returns the converse of the binary relation BinRel1.

    1> R1 = sofs:relation([{1,a},{2,b},{3,a}]),
    +R2 = sofs:converse(R1),
    +sofs:to_external(R2).
    +[{a,1},{a,3},{b,2}]
    @@ -2052,10 +2052,10 @@ -

    Returns the domain of the binary relation BinRel.

    1> R = sofs:relation([{1,a},{1,b},{2,b},{2,c}]),
    -S = sofs:domain(R),
    -sofs:to_external(S).
    -[1,2]
    +

    Returns the domain of the binary relation BinRel.

    1> R = sofs:relation([{1,a},{1,b},{2,b},{2,c}]),
    +S = sofs:domain(R),
    +sofs:to_external(S).
    +[1,2]
    @@ -2085,11 +2085,11 @@

    Returns the difference between the binary relation BinRel1 and the -restriction of BinRel1 to Set.

    1> R1 = sofs:relation([{1,a},{2,b},{3,c}]),
    -S = sofs:set([2,4,6]),
    -R2 = sofs:drestriction(R1, S),
    -sofs:to_external(R2).
    -[{1,a},{3,c}]

    drestriction(R, S) is equivalent to +restriction of BinRel1 to Set.

    1> R1 = sofs:relation([{1,a},{2,b},{3,c}]),
    +S = sofs:set([2,4,6]),
    +R2 = sofs:drestriction(R1, S),
    +sofs:to_external(R2).
    +[{1,a},{3,c}]

    drestriction(R, S) is equivalent to difference(R, restriction(R, S)).

    @@ -2120,12 +2120,12 @@

    Returns a subset of Set1 containing those elements that do not give an element -in Set2 as the result of applying SetFun.

    1> SetFun = {external, fun({_A,B,C}) -> {B,C} end},
    -R1 = sofs:relation([{a,aa,1},{b,bb,2},{c,cc,3}]),
    -R2 = sofs:relation([{bb,2},{cc,3},{dd,4}]),
    -R3 = sofs:drestriction(SetFun, R1, R2),
    -sofs:to_external(R3).
    -[{a,aa,1}]

    drestriction(F, S1, S2) is equivalent to +in Set2 as the result of applying SetFun.

    1> SetFun = {external, fun({_A,B,C}) -> {B,C} end},
    +R1 = sofs:relation([{a,aa,1},{b,bb,2},{c,cc,3}]),
    +R2 = sofs:relation([{bb,2},{cc,3},{dd,4}]),
    +R3 = sofs:drestriction(SetFun, R1, R2),
    +sofs:to_external(R3).
    +[{a,aa,1}]

    drestriction(F, S1, S2) is equivalent to difference(S1, restriction(F, S1, S2)).

    @@ -2190,12 +2190,12 @@

    Returns the extension of BinRel1 such that for each element E in Set that does not belong to the domain of -BinRel1, BinRel2 contains the pair (E, AnySet).

    1> S = sofs:set([b,c]),
    -A = sofs:empty_set(),
    -R = sofs:family([{a,[1,2]},{b,[3]}]),
    -X = sofs:extension(R, S, A),
    -sofs:to_external(X).
    -[{a,[1,2]},{b,[3]},{c,[]}]
    +BinRel1, BinRel2 contains the pair (E, AnySet).

    1> S = sofs:set([b,c]),
    +A = sofs:empty_set(),
    +R = sofs:family([{a,[1,2]},{b,[3]}]),
    +X = sofs:extension(R, S, A),
    +sofs:to_external(X).
    +[{a,[1,2]},{b,[3]},{c,[]}]
    @@ -2284,11 +2284,11 @@

    If Family1 and Family2 are families, then Family3 is the family such that the index set is equal to the index set of Family1, and Family3[i] is the difference between Family1[i] and Family2[i] if -Family2 maps i, otherwise Family1[i].

    1> F1 = sofs:family([{a,[1,2]},{b,[3,4]}]),
    -F2 = sofs:family([{b,[4,5]},{c,[6,7]}]),
    -F3 = sofs:family_difference(F1, F2),
    -sofs:to_external(F3).
    -[{a,[1,2]},{b,[3]}]
    +Family2 maps i, otherwise Family1[i].

    1> F1 = sofs:family([{a,[1,2]},{b,[3,4]}]),
    +F2 = sofs:family([{b,[4,5]},{c,[6,7]}]),
    +F3 = sofs:family_difference(F1, F2),
    +sofs:to_external(F3).
    +[{a,[1,2]},{b,[3]}]
    @@ -2319,10 +2319,10 @@

    If Family1 is a family and Family1[i] is a binary relation for every i in the index set of Family1, then Family2 is the family with the same index set as Family1 such that Family2[i] is the -domain of Family1[i].

    1> FR = sofs:from_term([{a,[{1,a},{2,b},{3,c}]},{b,[]},{c,[{4,d},{5,e}]}]),
    -F = sofs:family_domain(FR),
    -sofs:to_external(F).
    -[{a,[1,2,3]},{b,[]},{c,[4,5]}]
    +domain of Family1[i].

    1> FR = sofs:from_term([{a,[{1,a},{2,b},{3,c}]},{b,[]},{c,[{4,d},{5,e}]}]),
    +F = sofs:family_domain(FR),
    +sofs:to_external(F).
    +[{a,[1,2,3]},{b,[]},{c,[4,5]}]
    @@ -2353,10 +2353,10 @@

    If Family1 is a family and Family1[i] is a binary relation for every i in the index set of Family1, then Family2 is the family with the same index set as Family1 such that Family2[i] is the -field of Family1[i].

    1> FR = sofs:from_term([{a,[{1,a},{2,b},{3,c}]},{b,[]},{c,[{4,d},{5,e}]}]),
    -F = sofs:family_field(FR),
    -sofs:to_external(F).
    -[{a,[1,2,3,a,b,c]},{b,[]},{c,[4,5,d,e]}]

    family_field(Family1) is equivalent to +field of Family1[i].

    1> FR = sofs:from_term([{a,[{1,a},{2,b},{3,c}]},{b,[]},{c,[{4,d},{5,e}]}]),
    +F = sofs:family_field(FR),
    +sofs:to_external(F).
    +[{a,[1,2,3,a,b,c]},{b,[]},{c,[4,5,d,e]}]

    family_field(Family1) is equivalent to family_union(family_domain(Family1), family_range(Family1)).

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/argparse.xhtml differs (HTML document, ASCII text, with very long lines (1338)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/argparse.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/argparse.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -42,20 +42,20 @@ example below is a fully functioning Erlang program accepting two command line arguments and printing their product.

    #!/usr/bin/env escript
     
    -main(Args) ->
    -    argparse:run(Args, cli(), #{progname => mul}).
    +main(Args) ->
    +    argparse:run(Args, cli(), #{progname => mul}).
     
    -cli() ->
    -    #{
    -        arguments => [
    -            #{name => left, type => integer},
    -            #{name => right, type => integer}
    -        ],
    +cli() ->
    +    #{
    +        arguments => [
    +            #{name => left, type => integer},
    +            #{name => right, type => integer}
    +        ],
             handler =>
    -            fun (#{left := Left, right := Right}) ->
    -                io:format("~b~n", [Left * Right])
    +            fun (#{left := Left, right := Right}) ->
    +                io:format("~b~n", [Left * Right])
                 end
    -    }.

    Running this script with no arguments results in an error, accompanied by the + }.

    Running this script with no arguments results in an error, accompanied by the usage information.

    The cli function defines a single command with embedded handler accepting a map. Keys of the map are argument names as defined by the argument field of the command, left and right in the example. Values are taken from the @@ -69,25 +69,25 @@

    A command may contain nested commands, forming a hierarchy. Arguments defined at the upper level command are automatically added to all nested commands. Nested -commands example (assuming progname is nested):

    cli() ->
    -  #{
    +commands example (assuming progname is nested):

    cli() ->
    +  #{
         %% top level argument applicable to all commands
    -    arguments => [#{name => top}],
    -      commands => #{
    -        "first" => #{
    +    arguments => [#{name => top}],
    +      commands => #{
    +        "first" => #{
               %% argument applicable to "first" command and
               %%  all commands nested into "first"
    -          arguments => [#{name => mid}],
    -          commands => #{
    -            "second" => #{
    +          arguments => [#{name => mid}],
    +          commands => #{
    +            "second" => #{
                   %% argument only applicable for "second" command
    -              arguments => [#{name => bottom}],
    -              handler => fun (A) -> io:format("~p~n", [A]) end
    -          }
    -        }
    -      }
    -    }
    -  }.

    In the example above, a 3-level hierarchy is defined. First is the script itself + arguments => [#{name => bottom}], + handler => fun (A) -> io:format("~p~n", [A]) end + } + } + } + } + }.

    In the example above, a 3-level hierarchy is defined. First is the script itself (nested), accepting the only argument top. Since it has no associated handler, run/3 will not accept user input omitting nested command selection. For this example, user has to supply 5 arguments in the command line, two being @@ -105,14 +105,14 @@ on all operating systems). Both options and positional arguments have 1 or more associated values. See argument specification to find more details about supported combinations.

    In the user input, short options may be concatenated with their values. Long -options support values separated by =. Consider this definition:

    cli() ->
    -  #{
    -    arguments => [
    -      #{name => long, long => "-long"},
    -      #{name => short, short => $s}
    -    ],
    -    handler => fun (Args) -> io:format("~p~n", [Args]) end
    -  }.

    Running ./args --long=VALUE prints #{long => "VALUE"}, running +options support values separated by =. Consider this definition:

    cli() ->
    +  #{
    +    arguments => [
    +      #{name => long, long => "-long"},
    +      #{name => short, short => $s}
    +    ],
    +    handler => fun (Args) -> io:format("~p~n", [Args]) end
    +  }.

    Running ./args --long=VALUE prints #{long => "VALUE"}, running ./args -sVALUE prints #{short => "VALUE"}

    argparse supports boolean flags concatenation: it is possible to shorten -r -f -v to -rfv.

    Shortened option names are not supported: it is not possible to use --my-argum instead of --my-argument-name even when such option can be unambiguously @@ -492,111 +492,111 @@ which case resulting argument map will either contain the default value, or not have the key at all.

    • name - Sets the argument name in the parsed argument map. If help is not defined, name is also used to generate the default usage message.

    • short - Defines a short (single character) form of an optional argument.

      %% Define a command accepting argument named myarg, with short form $a:
      -1> Cmd = #{arguments => [#{name => myarg, short => $a}]}.
      +1> Cmd = #{arguments => [#{name => myarg, short => $a}]}.
       %% Parse command line "-a str":
      -2> {ok, ArgMap, _, _} = argparse:parse(["-a", "str"], Cmd), ArgMap.
      +2> {ok, ArgMap, _, _} = argparse:parse(["-a", "str"], Cmd), ArgMap.
       
      -#{myarg => "str"}
      +#{myarg => "str"}
       
       %% Option value can be concatenated with the switch: "-astr"
      -3> {ok, ArgMap, _, _} = argparse:parse(["-astr"], Cmd), ArgMap.
      +3> {ok, ArgMap, _, _} = argparse:parse(["-astr"], Cmd), ArgMap.
       
      -#{myarg => "str"}

      By default all options expect a single value following the option switch. The -only exception is an option of a boolean type.

    • long - Defines a long form of an optional argument.

      1> Cmd = #{arguments => [#{name => myarg, long => "name"}]}.
      +#{myarg => "str"}

      By default all options expect a single value following the option switch. The +only exception is an option of a boolean type.

    • long - Defines a long form of an optional argument.

      1> Cmd = #{arguments => [#{name => myarg, long => "name"}]}.
       %% Parse command line "-name Erlang":
      -2> {ok, ArgMap, _, _} = argparse:parse(["-name", "Erlang"], Cmd), ArgMap.
      +2> {ok, ArgMap, _, _} = argparse:parse(["-name", "Erlang"], Cmd), ArgMap.
       
      -#{myarg => "Erlang"}
      +#{myarg => "Erlang"}
       %% Or use "=" to separate the switch and the value:
      -3> {ok, ArgMap, _, _} = argparse:parse(["-name=Erlang"], Cmd), ArgMap.
      +3> {ok, ArgMap, _, _} = argparse:parse(["-name=Erlang"], Cmd), ArgMap.
       
      -#{myarg => "Erlang"}

      If neither short not long is defined, the argument is treated as +#{myarg => "Erlang"}

    If neither short not long is defined, the argument is treated as positional.

  • required - Forces the parser to expect the argument to be present in the command line. By default, all positional argument are required, and all options are not.

  • default - Specifies the default value to put in the parsed argument map -if the value is not supplied in the command line.

    1> argparse:parse([], #{arguments => [#{name => myarg, short => $m}]}).
    +if the value is not supplied in the command line.

    1> argparse:parse([], #{arguments => [#{name => myarg, short => $m}]}).
     
    -{ok,#{}, ...
    -2> argparse:parse([], #{arguments => [#{name => myarg, short => $m, default => "def"}]}).
    +{ok,#{}, ...
    +2> argparse:parse([], #{arguments => [#{name => myarg, short => $m, default => "def"}]}).
     
    -{ok,#{myarg => "def"}, ...
  • type - Defines type conversion and validation routine. The default is +{ok,#{myarg => "def"}, ...

  • type - Defines type conversion and validation routine. The default is string, assuming no conversion.

  • nargs - Defines the number of following arguments to consume from the command line. By default, the parser consumes the next argument and converts it into an Erlang term according to the specified type.

    • pos_integer/0 - Consume exactly this number of positional arguments, fail if there is not enough. Value in the argument map contains a list of exactly this length. Example, defining a positional argument expecting 3 -integer values:

      1> Cmd = #{arguments => [#{name => ints, type => integer, nargs => 3}]},
      -argparse:parse(["1", "2", "3"], Cmd).
      +integer values:

      1> Cmd = #{arguments => [#{name => ints, type => integer, nargs => 3}]},
      +argparse:parse(["1", "2", "3"], Cmd).
       
      -{ok, #{ints => [1, 2, 3]}, ...

      Another example defining an option accepted as -env and expecting two -string arguments:

      1> Cmd = #{arguments => [#{name => env, long => "env", nargs => 2}]},
      -argparse:parse(["-env", "key", "value"], Cmd).
      +{ok, #{ints => [1, 2, 3]}, ...

      Another example defining an option accepted as -env and expecting two +string arguments:

      1> Cmd = #{arguments => [#{name => env, long => "env", nargs => 2}]},
      +argparse:parse(["-env", "key", "value"], Cmd).
       
      -{ok, #{env => ["key", "value"]}, ...
    • list - Consume all following arguments until hitting the next option +{ok, #{env => ["key", "value"]}, ...

  • list - Consume all following arguments until hitting the next option (starting with an option prefix). May result in an empty list added to the -arguments map.

    1> Cmd = #{arguments => [
    -  #{name => nodes, long => "nodes", nargs => list},
    -  #{name => verbose, short => $v, type => boolean}
    -]},
    -argparse:parse(["-nodes", "one", "two", "-v"], Cmd).
    +arguments map.

    1> Cmd = #{arguments => [
    +  #{name => nodes, long => "nodes", nargs => list},
    +  #{name => verbose, short => $v, type => boolean}
    +]},
    +argparse:parse(["-nodes", "one", "two", "-v"], Cmd).
     
    -{ok, #{nodes => ["one", "two"], verbose => true}, ...
  • nonempty_list - Same as list, but expects at least one argument. +{ok, #{nodes => ["one", "two"], verbose => true}, ...

  • nonempty_list - Same as list, but expects at least one argument. Returns an error if the following command line argument is an option switch (starting with the prefix).

  • 'maybe' - Consumes the next argument from the command line, if it does not start with an option prefix. Otherwise, adds a default value to the -arguments map.

    1> Cmd = #{arguments => [
    -  #{name => level, short => $l, nargs => 'maybe', default => "error"},
    -  #{name => verbose, short => $v, type => boolean}
    -]},
    -argparse:parse(["-l", "info", "-v"], Cmd).
    +arguments map.

    1> Cmd = #{arguments => [
    +  #{name => level, short => $l, nargs => 'maybe', default => "error"},
    +  #{name => verbose, short => $v, type => boolean}
    +]},
    +argparse:parse(["-l", "info", "-v"], Cmd).
     
    -{ok,#{level => "info",verbose => true}, ...
    +{ok,#{level => "info",verbose => true}, ...
     
     %% When "info" is omitted, argument maps receives the default "error"
    -2> argparse:parse(["-l", "-v"], Cmd).
    +2> argparse:parse(["-l", "-v"], Cmd).
     
    -{ok,#{level => "error",verbose => true}, ...
  • {'maybe', term()} - Consumes the next argument from the command line, +{ok,#{level => "error",verbose => true}, ...

  • {'maybe', term()} - Consumes the next argument from the command line, /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/array.xhtml differs (HTML document, ASCII text, with very long lines (2373)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/array.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/array.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -31,14 +31,14 @@ reset/2). If you need to differentiate between unset and set entries, ensure that the default value cannot be confused with the values of set entries.

    The array never shrinks automatically. If an index I has been used to set an entry successfully, all indices in the range [0,I] stay accessible unless the -array size is explicitly changed by calling resize/2.

    Examples:

    Create a fixed-size array with entries 0-9 set to undefined:

    A0 = array:new(10).
    -10 = array:size(A0).

    Create an extendible array and set entry 17 to true, causing the array to grow -automatically:

    A1 = array:set(17, true, array:new()).
    -18 = array:size(A1).

    Read back a stored value:

    true = array:get(17, A1).

    Accessing an unset entry returns default value:

    undefined = array:get(3, A1)

    Accessing an entry beyond the last set entry also returns the default value, if -the array does not have fixed size:

    undefined = array:get(18, A1).

    "Sparse" functions ignore default-valued entries:

    A2 = array:set(4, false, A1).
    -[{4, false}, {17, true}] = array:sparse_to_orddict(A2).

    An extendible array can be made fixed-size later:

    A3 = array:fix(A2).

    A fixed-size array does not grow automatically and does not allow accesses -beyond the last set entry:

    {'EXIT',{badarg,_}} = (catch array:set(18, true, A3)).
    -{'EXIT',{badarg,_}} = (catch array:get(18, A3)).
    +array size is explicitly changed by calling resize/2.

    Examples:

    Create a fixed-size array with entries 0-9 set to undefined:

    A0 = array:new(10).
    +10 = array:size(A0).

    Create an extendible array and set entry 17 to true, causing the array to grow +automatically:

    A1 = array:set(17, true, array:new()).
    +18 = array:size(A1).

    Read back a stored value:

    true = array:get(17, A1).

    Accessing an unset entry returns default value:

    undefined = array:get(3, A1)

    Accessing an entry beyond the last set entry also returns the default value, if +the array does not have fixed size:

    undefined = array:get(18, A1).

    "Sparse" functions ignore default-valued entries:

    A2 = array:set(4, false, A1).
    +[{4, false}, {17, true}] = array:sparse_to_orddict(A2).

    An extendible array can be made fixed-size later:

    A3 = array:fix(A2).

    A fixed-size array does not grow automatically and does not allow accesses +beyond the last set entry:

    {'EXIT',{badarg,_}} = (catch array:set(18, true, A3)).
    +{'EXIT',{badarg,_}} = (catch array:get(18, A3)).
    @@ -1063,7 +1063,7 @@ array size; this also implies {fixed, true}. If N is not a non-negative integer, the call fails with reason badarg.

  • fixed or {fixed, true} - Creates a fixed-size array. See also fix/1.

  • {fixed, false} - Creates an extendible (non-fixed-size) array.

  • {default, Value} - Sets the default value for the array to Value.

  • Options are processed in the order they occur in the list, that is, later options have higher precedence.

    The default value is used as the value of uninitialized entries, and cannot be -changed once the array has been created.

    Examples:

    array:new(100)

    creates a fixed-size array of size 100.

    array:new({default,0})

    creates an empty, extendible array whose default value is 0.

    array:new([{size,10},{fixed,false},{default,-1}])

    creates an extendible array with initial size 10 whose default value is -1.

    See also fix/1, from_list/2, get/2, new/0, new/2, set/3.

    +changed once the array has been created.

    Examples:

    array:new(100)

    creates a fixed-size array of size 100.

    array:new({default,0})

    creates an empty, extendible array whose default value is 0.

    array:new([{size,10},{fixed,false},{default,-1}])

    creates an extendible array with initial size 10 whose default value is -1.

    See also fix/1, from_list/2, get/2, new/0, new/2, set/3.

    @@ -1096,7 +1096,7 @@ Options override parameter Size.

    If Options is a list, this is equivalent to new([{size, Size} | Options]), otherwise it is equivalent to new([{size, Size} | [Options]]). However, using this function -directly is more efficient.

    Example:

    array:new(100, {default,0})

    creates a fixed-size array of size 100, whose default value is 0.

    See also new/1.

    +directly is more efficient.

    Example:

    array:new(100, {default,0})

    creates a fixed-size array of size 100, whose default value is 0.

    See also new/1.

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/assert_hrl.xhtml differs (HTML document, ASCII text, with very long lines (1299)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/assert_hrl.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/assert_hrl.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -27,7 +27,7 @@ Description

    The include file assert.hrl provides macros for inserting assertions in your -program code.

    Include the following directive in the module from which the function is called:

    -include_lib("stdlib/include/assert.hrl").

    When an assertion succeeds, the assert macro yields the atom ok. When an +program code.

    Include the following directive in the module from which the function is called:

    -include_lib("stdlib/include/assert.hrl").

    When an assertion succeeds, the assert macro yields the atom ok. When an assertion fails, an exception of type error is generated. The associated error term has the form {Macro, Info}. Macro is the macro name, for example, assertEqual. Info is a list of tagged values, such as @@ -55,7 +55,7 @@

    • assert(BoolExpr)

    • assert(BoolExpr, Comment) - Tests that BoolExpr completes normally returning true.

    • assertNot(BoolExpr)

    • assertNot(BoolExpr, Comment) - Tests that BoolExpr completes normally returning false.

    • assertMatch(GuardedPattern, Expr)

    • assertMatch(GuardedPattern, Expr, Comment) - Tests that Expr completes -normally yielding a value that matches GuardedPattern, for example:

      ?assertMatch({bork, _}, f())

      Notice that a guard when ... can be included:

      ?assertMatch({bork, X} when X > 0, f())
    • assertNotMatch(GuardedPattern, Expr)

    • assertNotMatch(GuardedPattern, Expr, Comment) - Tests that Expr +normally yielding a value that matches GuardedPattern, for example:

      ?assertMatch({bork, _}, f())

      Notice that a guard when ... can be included:

      ?assertMatch({bork, X} when X > 0, f())
    • assertNotMatch(GuardedPattern, Expr)

    • assertNotMatch(GuardedPattern, Expr, Comment) - Tests that Expr completes normally yielding a value that does not match GuardedPattern.

      As in assertMatch, GuardedPattern can have a when part.

    • assertEqual(ExpectedValue, Expr)

    • assertEqual(ExpectedValue, Expr, Comment) - Tests that Expr completes normally yielding a value that is exactly equal to ExpectedValue.

    • assertNotEqual(ExpectedValue, Expr)

    • assertNotEqual(ExpectedValue, Expr, Comment) - Tests that Expr completes normally yielding a value that is not exactly equal to /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/base64.xhtml differs (HTML document, ASCII text, with very long lines (634)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/base64.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/base64.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -550,15 +550,15 @@

      Decodes a base64 string encoded using the standard alphabet according to RFC 4648 Section 4 to plain ASCII.

      The function will strips away any whitespace characters and check for the -the correct number of = padding characters at the end of the encoded string.

      See decode_options/0 for details on which options can be passed.

      Example:

      1> base64:decode("AQIDBA==").
      +the correct number of = padding characters at the end of the encoded string.

      See decode_options/0 for details on which options can be passed.

      Example:

      1> base64:decode("AQIDBA==").
       <<1,2,3,4>>
      -2> base64:decode("AQ ID BA==").
      +2> base64:decode("AQ ID BA==").
       <<1,2,3,4>>
      -3> base64:decode("AQIDBA=").
      +3> base64:decode("AQIDBA=").
       ** exception error: missing_padding
            in function  base64:decode_list/7 (base64.erl, line 734)
               *** data to decode is missing final = padding characters, if this is intended, use the `padding => false` option
      -4> base64:decode("AQIDBA=", #{ padding => false }).
      +4> base64:decode("AQIDBA=", #{ padding => false }).
       <<1,2,3,4>>
    @@ -813,9 +813,9 @@

    Decodes a base64 "mime" string encoded using the standard alphabet according to RFC 4648 Section 4 to plain ASCII.

    The function will strips away any illegal characters. It does not check for the -the correct number of = padding characters at the end of the encoded string.

    See decode_options/0 for details on which options can be passed.

    Example:

    1> base64:mime_decode("AQIDBA==").
    +the correct number of = padding characters at the end of the encoded string.

    See decode_options/0 for details on which options can be passed.

    Example:

    1> base64:mime_decode("AQIDBA==").
     <<1,2,3,4>>
    -2> base64:mime_decode("AQIDB=A=").
    +2> base64:mime_decode("AQIDB=A=").
     <<1,2,3,4>>
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/beam_lib.xhtml differs (HTML document, ASCII text, with very long lines (1372)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/beam_lib.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/beam_lib.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -46,8 +46,8 @@ Reconstruct Source Code

    The following example shows how to reconstruct Erlang source code from the debug -information in a BEAM file Beam:

    {ok,{_,[{abstract_code,{_,AC}}]}} = beam_lib:chunks(Beam,[abstract_code]).
    -io:fwrite("~s~n", [erl_prettypr:format(erl_syntax:form_list(AC))]).

    +information in a BEAM file Beam:

    {ok,{_,[{abstract_code,{_,AC}}]}} = beam_lib:chunks(Beam,[abstract_code]).
    +io:fwrite("~s~n", [erl_prettypr:format(erl_syntax:form_list(AC))]).

    @@ -77,13 +77,13 @@ user's home directory and then filename:basedir(user_config, "erlang"). If the file is found and contains a key, beam_lib implicitly creates a crypto key fun -and registers it.

    File .erlang.crypt is to contain a single list of tuples:

    {debug_info, Mode, Module, Key}

    Mode is the type of crypto algorithm; currently, the only allowed value is +and registers it.

    File .erlang.crypt is to contain a single list of tuples:

    {debug_info, Mode, Module, Key}

    Mode is the type of crypto algorithm; currently, the only allowed value is des3_cbc. Module is either an atom, in which case Key is only used for the module Module, or [], in which case Key is used for all modules. Key is the non-empty key string.

    Key in the first tuple where both Mode and Module match is used.

    The following is an example of an .erlang.crypt file that returns the same key -for all modules:

    [{debug_info, des3_cbc, [], "%>7}|pc/DM6Cga*68$Mw]L#&_Gejr]G^"}].

    The following is a slightly more complicated example of an .erlang.crypt -providing one key for module t and another key for all other modules:

    [{debug_info, des3_cbc, t, "My KEY"},
    - {debug_info, des3_cbc, [], "%>7}|pc/DM6Cga*68$Mw]L#&_Gejr]G^"}].

    Note

    Do not use any of the keys in these examples. Use your own keys.

    +for all modules:

    [{debug_info, des3_cbc, [], "%>7}|pc/DM6Cga*68$Mw]L#&_Gejr]G^"}].

    The following is a slightly more complicated example of an .erlang.crypt +providing one key for module t and another key for all other modules:

    [{debug_info, des3_cbc, t, "My KEY"},
    + {debug_info, des3_cbc, [], "%>7}|pc/DM6Cga*68$Mw]L#&_Gejr]G^"}].

    Note

    Do not use any of the keys in these examples. Use your own keys.

    @@ -1435,11 +1435,11 @@

    Registers an unary fun that is called if beam_lib must read an debug_info chunk that has been encrypted. The fun is held in a process that is started by the function.

    If a fun is already registered when attempting to register a fun, -{error, exists} is returned.

    The fun must handle the following arguments:

    CryptoKeyFun(init) -> ok | {ok, NewCryptoKeyFun} | {error, Term}

    Called when the fun is registered, in the process that holds the fun. Here the +{error, exists} is returned.

    The fun must handle the following arguments:

    CryptoKeyFun(init) -> ok | {ok, NewCryptoKeyFun} | {error, Term}

    Called when the fun is registered, in the process that holds the fun. Here the crypto key fun can do any necessary initializations. If {ok, NewCryptoKeyFun} is returned, NewCryptoKeyFun is registered instead of CryptoKeyFun. If {error, Term} is returned, the registration is aborted and -crypto_key_fun/1 also returns {error, Term}.

    CryptoKeyFun({debug_info, Mode, Module, Filename}) -> Key

    Called when the key is needed for module Module in the file named Filename. +crypto_key_fun/1 also returns {error, Term}.

    CryptoKeyFun({debug_info, Mode, Module, Filename}) -> Key

    Called when the key is needed for module Module in the file named Filename. Mode is the type of crypto algorithm; currently, the only possible value is des3_cbc. The call is to fail (raise an exception) if no key is available.

    CryptoKeyFun(clear) -> term()

    Called before the fun is unregistered. Here any cleaning up can be done. The return value is not important, but is passed back to the caller of @@ -1806,14 +1806,14 @@ -vsn(Vsn).

    If this attribute is not specified, the version defaults to the checksum of the module. Notice that if version Vsn is not a list, it is made into one, that is {ok,{Module,[Vsn]}} is returned. If there are many -vsn -module attributes, the result is the concatenated list of versions.

    Examples:

    1> beam_lib:version(a). % -vsn(1).
    -{ok,{a,[1]}}
    -2> beam_lib:version(b). % -vsn([1]).
    -{ok,{b,[1]}}
    -3> beam_lib:version(c). % -vsn([1]). -vsn(2).
    -{ok,{c,[1,2]}}
    -4> beam_lib:version(d). % no -vsn attribute
    -{ok,{d,[275613208176997377698094100858909383631]}}
    +module attributes, the result is the concatenated list of versions.

    Examples:

    1> beam_lib:version(a). % -vsn(1).
    +{ok,{a,[1]}}
    +2> beam_lib:version(b). % -vsn([1]).
    +{ok,{b,[1]}}
    +3> beam_lib:version(c). % -vsn([1]). -vsn(2).
    +{ok,{c,[1,2]}}
    +4> beam_lib:version(d). % no -vsn attribute
    +{ok,{d,[275613208176997377698094100858909383631]}}
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/binary.xhtml differs (HTML document, ASCII text, with very long lines (1041)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/binary.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/binary.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -522,7 +522,7 @@ -

    Converts Subject to a list of byte/0s, each representing the value of one byte.

    Example:

    1> binary:bin_to_list(<<"erlang">>).
    +

    Converts Subject to a list of byte/0s, each representing the value of one byte.

    Example:

    1> binary:bin_to_list(<<"erlang">>).
     "erlang"
     %% or [101,114,108,97,110,103] in list notation.
    @@ -588,7 +588,7 @@

    Converts Subject to a list of byte/0s, each representing the value of one byte. PosLen or alternatively Pos and Len denote which part of the Subject binary to convert. By default, the entire Subject binary is -converted.

    Example:

    1> binary:bin_to_list(<<"erlang">>, {1,3}).
    +converted.

    Example:

    1> binary:bin_to_list(<<"erlang">>, {1,3}).
     "rla"
     %% or [114,108,97] in list notation.

    If PosLen or alternatively Pos and Len in any way reference outside the binary, a badarg exception is raised.

    @@ -730,7 +730,7 @@ -

    Decodes a hex encoded binary into a binary.

    Example

    1> binary:decode_hex(<<"66">>).
    +

    Decodes a hex encoded binary into a binary.

    Example

    1> binary:decode_hex(<<"66">>).
     <<"f">>
    @@ -796,11 +796,11 @@

    Converts the binary digit representation, in big endian or little endian, of a -positive integer in Subject to an Erlang integer/0.

    Example:

    1> binary:decode_unsigned(<<169,138,199>>).
    +positive integer in Subject to an Erlang integer/0.

    Example:

    1> binary:decode_unsigned(<<169,138,199>>).
     11111111
    -2> binary:decode_unsigned(<<169,138,199>>, big).
    +2> binary:decode_unsigned(<<169,138,199>>, big).
     11111111
    -3> binary:decode_unsigned(<<169,138,199>>, little).
    +3> binary:decode_unsigned(<<169,138,199>>, little).
     13077161
    @@ -863,13 +863,13 @@

    Encodes a binary into a hex encoded binary using the specified case for the -hexadecimal digits "a" to "f".

    The default case is uppercase.

    Example:

    1> binary:encode_hex(<<"f">>).
    +hexadecimal digits "a" to "f".

    The default case is uppercase.

    Example:

    1> binary:encode_hex(<<"f">>).
     <<"66">>
    -2> binary:encode_hex(<<"/">>).
    +2> binary:encode_hex(<<"/">>).
     <<"2F">>
    -3> binary:encode_hex(<<"/">>, lowercase).
    +3> binary:encode_hex(<<"/">>, lowercase).
     <<"2f">>
    -4> binary:encode_hex(<<"/">>, uppercase).
    +4> binary:encode_hex(<<"/">>, uppercase).
     <<"2F">>
    @@ -932,11 +932,11 @@

    Converts a positive integer to the smallest possible representation in a binary -digit representation, either big endian or little endian.

    Example:

    1> binary:encode_unsigned(11111111).
    +digit representation, either big endian or little endian.

    Example:

    1> binary:encode_unsigned(11111111).
     <<169,138,199>>
    -2> binary:encode_unsigned(11111111, big).
    +2> binary:encode_unsigned(11111111, big).
     <<169,138,199>>
    -2> binary:encode_unsigned(11111111, little).
    +2> binary:encode_unsigned(11111111, little).
     <<199,138,169>>
    @@ -1060,9 +1060,9 @@

    Returns the length of the longest common prefix of the binaries in list -Binaries.

    Example:

    1> binary:longest_common_prefix([<<"erlang">>, <<"ergonomy">>]).
    +Binaries.

    Example:

    1> binary:longest_common_prefix([<<"erlang">>, <<"ergonomy">>]).
     2
    -2> binary:longest_common_prefix([<<"erlang">>, <<"perl">>]).
    +2> binary:longest_common_prefix([<<"erlang">>, <<"perl">>]).
     0

    If Binaries is not a flat non-empty list of binaries, a badarg exception is raised.

    @@ -1095,9 +1095,9 @@

    Returns the length of the longest common suffix of the binaries in list -Binaries.

    Example:

    1> binary:longest_common_suffix([<<"erlang">>, <<"fang">>]).
    +Binaries.

    Example:

    1> binary:longest_common_suffix([<<"erlang">>, <<"fang">>]).
     3
    -2> binary:longest_common_suffix([<<"erlang">>, <<"perl">>]).
    +2> binary:longest_common_suffix([<<"erlang">>, <<"perl">>]).
     0

    If Binaries is not a flat non-empty list of binaries, a badarg exception is raised.

    @@ -1173,8 +1173,8 @@

    Searches for the first occurrence of Pattern in Subject and returns the position and length.

    The function returns {Pos, Length} for the binary in Pattern, starting at -the lowest position in Subject.

    Example:

    1> binary:match(<<"abcde">>, [<<"bcde">>, <<"cd">>],[]).
    -{1,4}

    Even though <<"cd">> ends before <<"bcde">>, <<"bcde">> begins first and +the lowest position in Subject.

    Example:

    1> binary:match(<<"abcde">>, [<<"bcde">>, <<"cd">>],[]).
    +{1,4}

    Even though <<"cd">> ends before <<"bcde">>, <<"bcde">> begins first and is therefore the first match. If two overlapping matches begin at the same position, the longest is returned.

    Summary of the options:

    • {scope, {Start, Length}} - Only the specified part is searched. Return values still have offsets from the beginning of Subject. A negative Length @@ -1254,9 +1254,9 @@

      As match/2, but Subject is searched until exhausted and a list of all non-overlapping parts matching Pattern is returned (in order).

      The first and longest match is preferred to a shorter, which is illustrated by -the following example:

      1> binary:matches(<<"abcde">>,
      -                  [<<"bcde">>,<<"bc">>,<<"de">>],[]).
      -[{1,4}]

      The result shows that <<"bcde">> is selected instead of the shorter match +the following example:

      1> binary:matches(<<"abcde">>,
      +                  [<<"bcde">>,<<"bc">>,<<"de">>],[]).
      +[{1,4}]

      The result shows that <<"bcde">> is selected instead of the shorter match <<"bc">> (which would have given raise to one more match, <<"de">>). This corresponds to the behavior of POSIX regular expressions (and programs like awk), but is not consistent with alternative matches in re (and Perl), where @@ -1325,7 +1325,7 @@

      Extracts the part of binary Subject described by PosLen.

      A negative length can be used to extract bytes at the end of a binary:

      1> Bin = <<1,2,3,4,5,6,7,8,9,10>>.
      -2> binary:part(Bin, {byte_size(Bin), -5}).
      +2> binary:part(Bin, {byte_size(Bin), -5}).
       <<6,7,8,9,10>>

      Note

      part/2 and part/3 are also available in the erlang module under the names binary_part/2 and binary_part/3. Those BIFs are allowed in guard tests.

      If PosLen in any way references outside the binary, a badarg exception is @@ -1363,33 +1363,33 @@ it can be useful to get the size of the referenced binary. This function can be used in a program to trigger the use of copy/1. By copying a binary, one can dereference the original, possibly large, binary that a -smaller binary is a reference to.

      Example:

      store(Binary, GBSet) ->
      +smaller binary is a reference to.

      Example:

      store(Binary, GBSet) ->
         NewBin =
      -      case binary:referenced_byte_size(Binary) of
      -          Large when Large > 2 * byte_size(Binary) ->
      -             binary:copy(Binary);
      +      case binary:referenced_byte_size(Binary) of
      +          Large when Large > 2 * byte_size(Binary) ->
      +             binary:copy(Binary);
                 _ ->
                    Binary
             end,
      -  gb_sets:insert(NewBin,GBSet).

      In this example, we chose to copy the binary content before inserting it in + gb_sets:insert(NewBin,GBSet).

      In this example, we chose to copy the binary content before inserting it in gb_sets:set() if it references a binary more than twice the data size we want to keep. Of course, different rules apply when copying to different programs.

      Binary sharing occurs whenever binaries are taken apart. This is the fundamental reason why binaries are fast, decomposition can always be done with O(1) complexity. In rare circumstances this data sharing is however undesirable, why this function together with copy/1 can be useful when optimizing -for memory use.

      Example of binary sharing:

      1> A = binary:copy(<<1>>, 100).
      +for memory use.

      Example of binary sharing:

      1> A = binary:copy(<<1>>, 100).
       <<1,1,1,1,1 ...
      -2> byte_size(A).
      +2> byte_size(A).
       100
      -3> binary:referenced_byte_size(A).
      +3> binary:referenced_byte_size(A).
       100
       4> <<B:10/binary, C:90/binary>> = A.
       <<1,1,1,1,1 ...
      -5> {byte_size(B), binary:referenced_byte_size(B)}.
      -{10,10}
      -6> {byte_size(C), binary:referenced_byte_size(C)}.
      -{90,100}

      In the above example, the small binary B was copied while the larger binary +5> {byte_size(B), binary:referenced_byte_size(B)}. +{10,10} +6> {byte_size(C), binary:referenced_byte_size(C)}. +{90,100}

      In the above example, the small binary B was copied while the larger binary C references binary A.

      Note

      Binary data is shared among processes. If another process still references the larger binary, copying the part this process uses only consumes more memory and does not free up the larger binary for garbage collection. Use this kind @@ -1478,28 +1478,28 @@ at the specified position (or positions) before inserting Replacement into Subject. If Replacement is given as a fun instead, this option is ignored.

      If any position specified in InsPos > size of the replacement binary, a badarg exception is raised.

      Options global and {scope, part()} work as for split/3. The return type is -always a binary/0.

      For a description of Pattern, see compile_pattern/1.

      Examples:

      1> binary:replace(<<"abcde">>, [<<"b">>, <<"d">>], <<"X">>, []).
      +always a binary/0.

      For a description of Pattern, see compile_pattern/1.

      Examples:

      1> binary:replace(<<"abcde">>, [<<"b">>, <<"d">>], <<"X">>, []).
       <<"aXcde">>
       
      -2> binary:replace(<<"abcde">>, [<<"b">>, <<"d">>], <<"X">>, [global]).
      +2> binary:replace(<<"abcde">>, [<<"b">>, <<"d">>], <<"X">>, [global]).
       <<"aXcXe">>
       
      -3> binary:replace(<<"abcde">>, <<"b">>, <<"[]">>, [{insert_replaced, 1}]).
      +3> binary:replace(<<"abcde">>, <<"b">>, <<"[]">>, [{insert_replaced, 1}]).
       <<"a[b]cde">>
       
      -4> binary:replace(<<"abcde">>, [<<"b">>, <<"d">>], <<"[]">>, [global, {insert_replaced, 1}]).
      +4> binary:replace(<<"abcde">>, [<<"b">>, <<"d">>], <<"[]">>, [global, {insert_replaced, 1}]).
       <<"a[b]c[d]e">>
       
      /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/calendar.xhtml differs (HTML document, ASCII text, with very long lines (454))
      --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/calendar.xhtml	2026-06-04 00:07:10.000000000 +0000
      +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/calendar.xhtml	2042-07-06 13:26:37.000000000 +0000
      @@ -1724,10 +1724,10 @@
       

      Converts an RFC 3339 timestamp into system time. The data format of RFC 3339 timestamps is described by RFC 3339. Starting from OTP 25.1, the minutes part of the time zone is optional.

      Valid option:

      • {unit, Unit} - The time unit of the return value. The default is -second.
      1> calendar:rfc3339_to_system_time("2018-02-01T16:17:58+01:00").
      +second.
    1> calendar:rfc3339_to_system_time("2018-02-01T16:17:58+01:00").
     1517498278
    -2> calendar:rfc3339_to_system_time("2018-02-01 15:18:02.088Z",
    -   [{unit, nanosecond}]).
    +2> calendar:rfc3339_to_system_time("2018-02-01 15:18:02.088Z",
    +   [{unit, nanosecond}]).
     1517498282088000000
    @@ -1897,16 +1897,16 @@ the formatted string includes a fraction of a second. The number of fractional second digits is three, six, or nine depending on what time unit is chosen. For native three fractional digits are included. Notice that trailing zeros -are not removed from the fraction.

    1> calendar:system_time_to_rfc3339(erlang:system_time(second)).
    +are not removed from the fraction.

    1> calendar:system_time_to_rfc3339(erlang:system_time(second)).
     "2018-04-23T14:56:28+02:00"
    -2> calendar:system_time_to_rfc3339(erlang:system_time(second),
    -   [{offset, "-02:00"}]).
    +2> calendar:system_time_to_rfc3339(erlang:system_time(second),
    +   [{offset, "-02:00"}]).
     "2018-04-23T10:56:52-02:00"
    -3> calendar:system_time_to_rfc3339(erlang:system_time(second),
    -   [{offset, -7200}]).
    +3> calendar:system_time_to_rfc3339(erlang:system_time(second),
    +   [{offset, -7200}]).
     "2018-04-23T10:57:05-02:00"
    -4> calendar:system_time_to_rfc3339(erlang:system_time(millisecond),
    -   [{unit, millisecond}, {time_designator, $\s}, {offset, "Z"}]).
    +4> calendar:system_time_to_rfc3339(erlang:system_time(millisecond),
    +   [{unit, millisecond}, {time_designator, $\s}, {offset, "Z"}]).
     "2018-04-23 12:57:20.482Z"
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/content.opf differs (XML 1.0 document, ASCII text) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/content.opf 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/content.opf 2042-07-06 13:26:37.000000000 +0000 @@ -4,10 +4,10 @@ version="3.0"> stdlib - 6.1.2 - urn:uuid:c41293f0-91a6-5ef2-6fb0-d0bc16a0c34b + urn:uuid:74f0f4e5-c88f-9ec3-b8e3-0062ea45b712 en - 2026-06-04T00:07:09Z + 2042-07-06T13:26:37Z /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/c.xhtml differs (HTML document, ASCII text, with very long lines (723)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/c.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/c.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -1634,7 +1634,7 @@

    Compiles and then loads the code for a file on all nodes. Options defaults to -[]. Compilation is equivalent to:

    compile:file(File, Options ++ [report_errors, report_warnings])
    +[]. Compilation is equivalent to:

    compile:file(File, Options ++ [report_errors, report_warnings])
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/dets.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (586)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/dets.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/dets.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -1793,14 +1793,14 @@

    Returns a list of all objects with key Key stored in table Name, for -example:

    2> dets:open_file(abc, [{type, bag}]).
    -{ok,abc}
    -3> dets:insert(abc, {1,2,3}).
    +example:

    2> dets:open_file(abc, [{type, bag}]).
    +{ok,abc}
    +3> dets:insert(abc, {1,2,3}).
     ok
    -4> dets:insert(abc, {1,3,4}).
    +4> dets:insert(abc, {1,3,4}).
     ok
    -5> dets:lookup(abc, 1).
    -[{1,2,3},{1,3,4}]

    If the table type is set, the function returns either the empty list or a list +5> dets:lookup(abc, 1). +[{1,2,3},{1,3,4}]

    If the table type is set, the function returns either the empty list or a list with one object, as there cannot be more than one object with a given key. If the table type is bag or duplicate_bag, the function returns a list of arbitrary length.

    Notice that the order of objects returned is unspecified. In particular, the @@ -2657,11 +2657,11 @@ specification is specified explicitly. This is how to state match specifications that cannot easily be expressed within the syntax provided by qlc.

    The following example uses an explicit match specification to traverse the -table:

    1> dets:open_file(t, []),
    -ok = dets:insert(t, [{1,a},{2,b},{3,c},{4,d}]),
    -MS = ets:fun2ms(fun({X,Y}) when (X > 1) or (X < 5) -> {Y} end),
    -QH1 = dets:table(t, [{traverse, {select, MS}}]).

    An example with implicit match specification:

    2> QH2 = qlc:q([{Y} || {X,Y} <- dets:table(t), (X > 1) or (X < 5)]).

    The latter example is equivalent to the former, which can be verified using -function qlc:info/1:

    3> qlc:info(QH1) =:= qlc:info(QH2).
    +table:

    1> dets:open_file(t, []),
    +ok = dets:insert(t, [{1,a},{2,b},{3,c},{4,d}]),
    +MS = ets:fun2ms(fun({X,Y}) when (X > 1) or (X < 5) -> {Y} end),
    +QH1 = dets:table(t, [{traverse, {select, MS}}]).

    An example with implicit match specification:

    2> QH2 = qlc:q([{Y} || {X,Y} <- dets:table(t), (X > 1) or (X < 5)]).

    The latter example is equivalent to the former, which can be verified using +function qlc:info/1:

    3> qlc:info(QH1) =:= qlc:info(QH2).
     true

    qlc:info/1 returns information about a query handle. In this case identical information is returned for the two query handles.

    @@ -2735,7 +2735,7 @@

    Applies Fun to each object stored in table Name in some unspecified order. Different actions are taken depending on the return value of Fun. The following Fun return values are allowed:

    • continue - Continue to perform the traversal. For example, the following -function can be used to print the contents of a table:

      fun(X) -> io:format("~p~n", [X]), continue end.
    • {continue, Val} - Continue the traversal and accumulate Val. The +function can be used to print the contents of a table:

      fun(X) -> io:format("~p~n", [X]), continue end.
    • {continue, Val} - Continue the traversal and accumulate Val. The following function is supplied to collect all objects of a table in a list:

      fun(X) -> {continue, X} end.
    • {done, Value} - Terminate the traversal and return [Value | Acc].

    Any other value OtherValue returned by Fun terminates the traversal and is returned immediately.

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/dict.xhtml differs (HTML document, ASCII text, with very long lines (1050)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/dict.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/dict.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -33,13 +33,13 @@ Notes

    Functions append and append_list are included so that keyed values can be -stored in a list accumulator, for example:

    > D0 = dict:new(),
    -  D1 = dict:store(files, [], D0),
    -  D2 = dict:append(files, f1, D1),
    -  D3 = dict:append(files, f2, D2),
    -  D4 = dict:append(files, f3, D3),
    -  dict:fetch(files, D4).
    -[f1,f2,f3]

    This saves the trouble of first fetching a keyed value, appending a new value to +stored in a list accumulator, for example:

    > D0 = dict:new(),
    +  D1 = dict:store(files, [], D0),
    +  D2 = dict:append(files, f1, D1),
    +  D3 = dict:append(files, f2, D2),
    +  D4 = dict:append(files, f3, D3),
    +  dict:fetch(files, D4).
    +[f1,f2,f3]

    This saves the trouble of first fetching a keyed value, appending a new value to the list of stored values, and storing the result.

    Function fetch is to be used if the key is known to be in the dictionary, otherwise function find.

    @@ -784,10 +784,10 @@ the Key-Value pairs from both dictionaries are included in the new dictionary. If a key occurs in both dictionaries, Fun is called with the key and both values to return a new value. merge can be defined as follows, but is -faster:

    merge(Fun, D1, D2) ->
    -    fold(fun (K, V1, D) ->
    -                 update(K, fun (V2) -> Fun(K, V1, V2) end, V1, D)
    -         end, D2, D1).
    +faster:

    merge(Fun, D1, D2) ->
    +    fold(fun (K, V1, D) ->
    +                 update(K, fun (V2) -> Fun(K, V1, V2) end, V1, D)
    +         end, D2, D1).
    @@ -1000,8 +1000,8 @@

    Updates a value in a dictionary by calling Fun on the value to get a new value. If Key is not present in the dictionary, Initial is stored as the -first value. For example, append/3 can be defined as:

    append(Key, Val, D) ->
    -    update(Key, fun (Old) -> Old ++ [Val] end, [Val], D).
    +first value. For example, append/3 can be defined as:

    append(Key, Val, D) ->
    +    update(Key, fun (Old) -> Old ++ [Val] end, [Val], D).
    @@ -1032,8 +1032,8 @@

    Adds Increment to the value associated with Key and stores this value. If Key is not present in the dictionary, Increment is stored as the first -value.

    This can be defined as follows, but is faster:

    update_counter(Key, Incr, D) ->
    -    update(Key, fun (Old) -> Old + Incr end, Incr, D).
    +value.

    This can be defined as follows, but is faster:

    update_counter(Key, Incr, D) ->
    +    update(Key, fun (Old) -> Old + Incr end, Incr, D).
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/epp.xhtml differs (HTML document, ASCII text, with very long lines (816)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/epp.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/epp.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -35,7 +35,7 @@ Error Information

    ErrorInfo is the standard ErrorInfo structure that is returned from all I/O -modules. The format is as follows:

    {ErrorLine, Module, ErrorDescriptor}

    A string describing the error is obtained with the following call:

    Module:format_error(ErrorDescriptor)

    +modules. The format is as follows:

    {ErrorLine, Module, ErrorDescriptor}

    A string describing the error is obtained with the following call:

    Module:format_error(ErrorDescriptor)

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/erl_error.xhtml differs (HTML document, ASCII text, with very long lines (1131)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/erl_error.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/erl_error.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -201,7 +201,7 @@

    A fun used to format function arguments for BIF and function calls. By default -the following fun will be used:

    fun(Term, I) -> io_lib:print(Term, I, 80, 30) end
    +the following fun will be used:

    fun(Term, I) -> io_lib:print(Term, I, 80, 30) end
    @@ -317,23 +317,23 @@ caused the error starting at 1.

  • general - An error that is not associated with any argument caused the error.

  • reason - If the Reason should be printed differently than the default way.

  • If the text returned includes new-lines, format_exception/4 will indent the -text correctly.

    Example:

    -module(my_error_module).
    --export([atom_to_string/1, format_error/2]).
    +text correctly.

    Example:

    -module(my_error_module).
    +-export([atom_to_string/1, format_error/2]).
     
    -atom_to_string(Arg) when is_atom(Arg) ->
    -  atom_to_list(Arg);
    -atom_to_string(Arg) ->
    -  erlang:error(badarg,[Arg],
    -               [{error_info,#{ module => ?MODULE,
    -                               cause => #{ 1 => "should be an atom" }}}]).
    -
    -format_error(Reason, [{_M,_F,_As,Info}|_]) ->
    -  ErrorInfo = proplists:get_value(error_info, Info, #{}),
    -  ErrorMap = maps:get(cause, ErrorInfo),
    -  ErrorMap#{ general => "optional general information",
    -             reason => io_lib:format("~p: ~p",[?MODULE, Reason]) }.
    1> c(my_error_module).
    -{ok,my_error_module}
    -2> my_error_module:atom_to_string(1).
    +atom_to_string(Arg) when is_atom(Arg) ->
    +  atom_to_list(Arg);
    +atom_to_string(Arg) ->
    +  erlang:error(badarg,[Arg],
    +               [{error_info,#{ module => ?MODULE,
    +                               cause => #{ 1 => "should be an atom" }}}]).
    +
    +format_error(Reason, [{_M,_F,_As,Info}|_]) ->
    +  ErrorInfo = proplists:get_value(error_info, Info, #{}),
    +  ErrorMap = maps:get(cause, ErrorInfo),
    +  ErrorMap#{ general => "optional general information",
    +             reason => io_lib:format("~p: ~p",[?MODULE, Reason]) }.
    1> c(my_error_module).
    +{ok,my_error_module}
    +2> my_error_module:atom_to_string(1).
     ** exception error: my_error_module: badarg
          in function  my_error_module:atom_to_string/1
             called as my_error_module:atom_to_string(1)
    @@ -416,18 +416,18 @@
     
     

    Format the error reason and stack back-trace caught using try ... catch in the same style as the shell formats them.

    Example:

    try
    -    do_something()
    +    do_something()
     catch
         C:R:Stk ->
    -        Message = erl_error:format_exception(C, R, Stk),
    -        io:format(LogFile, "~ts\n", [Message])
    +        Message = erl_error:format_exception(C, R, Stk),
    +        io:format(LogFile, "~ts\n", [Message])
     end

    If error_info is provided with the exception, format_exception will use that information to provide additional information about the exception.

    Example:

    try
    -  erlang:raise(badarg,[],[{error_info,#{}}])
    +  erlang:raise(badarg,[],[{error_info,#{}}])
     catch
         C:R:Stk ->
    -        Message = erl_error:format_exception(C, R, Stk),
    -        io:format(LogFile, "~ts\n", [Message])
    +        Message = erl_error:format_exception(C, R, Stk),
    +        io:format(LogFile, "~ts\n", [Message])
     end

    See erlang:error/3 for details on how to raise an exception with error_info included.

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/erl_eval.xhtml differs (HTML document, ASCII text, with very long lines (922)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/erl_eval.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/erl_eval.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -36,13 +36,13 @@ LocalFunctionHandler can be used to define a function that is called when there is a call to a local function. The argument can have the following formats:

    • {value,Func} - This defines a local function handler that is called -with:

      Func(Name, Arguments)

      Name is the name of the local function (an atom) and Arguments is a list +with:

      Func(Name, Arguments)

      Name is the name of the local function (an atom) and Arguments is a list of the evaluated arguments. The function handler returns the value of the local function. In this case, the current bindings cannot be accessed. To signal an error, the function handler calls exit/1 with a -suitable exit value.

    • {eval,Func} - This defines a local function handler that is called with:

      Func(Name, Arguments, Bindings)

      Name is the name of the local function (an atom), Arguments is a list of +suitable exit value.

    • {eval,Func} - This defines a local function handler that is called with:

      Func(Name, Arguments, Bindings)

      Name is the name of the local function (an atom), Arguments is a list of the unevaluated arguments, and Bindings are the current variable bindings. -The function handler returns:

      {value,Value,NewBindings}

      Value is the value of the local function and NewBindings are the updated +The function handler returns:

      {value,Value,NewBindings}

      Value is the value of the local function and NewBindings are the updated variable bindings. In this case, the function handler must itself evaluate all the function arguments and manage the bindings. To signal an error, the function handler calls exit/1 with a suitable exit value.

    • none - There is no local function handler.

    @@ -56,7 +56,7 @@ expressions.
  • An operator Op/A is called (this is handled as a call to function erlang:Op/A).
  • Exceptions are calls to erlang:apply/2,3; neither of the function handlers are called for such calls. The argument can have the following formats:

    • {value,Func} - This defines a non-local function handler. The function -may be called with two arguments:

      Func(FuncSpec, Arguments)

      or three arguments:

      Func(Anno, FuncSpec, Arguments)

      Anno is the erl_anno:anno() of the node, FuncSpec +may be called with two arguments:

      Func(FuncSpec, Arguments)

      or three arguments:

      Func(Anno, FuncSpec, Arguments)

      Anno is the erl_anno:anno() of the node, FuncSpec is the name of the function on the form {Module,Function} or a fun, and Arguments is a list of the evaluated arguments. The function handler returns the value of the function. To signal an error, the function handler /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/erl_lint.xhtml differs (HTML document, ASCII text, with very long lines (816)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/erl_lint.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/erl_lint.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -34,7 +34,7 @@ Error Information

    ErrorInfo is the standard ErrorInfo structure that is returned from all I/O -modules. The format is as follows:

    {ErrorLine, Module, ErrorDescriptor}

    A string describing the error is obtained with the following call:

    Module:format_error(ErrorDescriptor)

    +modules. The format is as follows:

    {ErrorLine, Module, ErrorDescriptor}

    A string describing the error is obtained with the following call:

    Module:format_error(ErrorDescriptor)

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/erl_parse.xhtml differs (HTML document, ASCII text, with very long lines (807)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/erl_parse.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/erl_parse.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -33,7 +33,7 @@ Error Information

    ErrorInfo is the standard ErrorInfo structure that is returned from all I/O modules. -The format is as follows:

    {ErrorLine, Module, ErrorDescriptor}

    A string describing the error is obtained with the following call:

    Module:format_error(ErrorDescriptor)

    +The format is as follows:

    {ErrorLine, Module, ErrorDescriptor}

    A string describing the error is obtained with the following call:

    Module:format_error(ErrorDescriptor)

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/erl_scan.xhtml differs (HTML document, ASCII text, with very long lines (817)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/erl_scan.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/erl_scan.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -31,7 +31,7 @@ Error Information

    ErrorInfo is the standard ErrorInfo structure that is returned from all I/O -modules. The format is as follows:

    {ErrorLocation, Module, ErrorDescriptor}

    A string describing the error is obtained with the following call:

    Module:format_error(ErrorDescriptor)

    +modules. The format is as follows:

    {ErrorLocation, Module, ErrorDescriptor}

    A string describing the error is obtained with the following call:

    Module:format_error(ErrorDescriptor)

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/erl_tar.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (1320)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/erl_tar.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/erl_tar.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -1170,14 +1170,14 @@ Notice that there is only an arity-2 read function, not an arity-1 function.

  • (position,{UserData,Position}) - Sets the position of UserData as defined for files in file:position/2

  • Example:

    The following is a complete Fun parameter for reading and writing on files using the file module:

    ExampleFun =
    -   fun(write, {Fd,Data}) ->  file:write(Fd, Data);
    -      (position, {Fd,Pos}) -> file:position(Fd, Pos);
    -      (read2, {Fd,Size}) -> file:read(Fd, Size);
    -      (close, Fd) -> file:close(Fd)
    -   end

    Here Fd was specified to function init/3 as:

    {ok,Fd} = file:open(Name, ...).
    -{ok,TarDesc} = erl_tar:init(Fd, [write], ExampleFun),

    TarDesc is then used:

    erl_tar:add(TarDesc, SomeValueIwantToAdd, FileNameInTarFile),
    +   fun(write, {Fd,Data}) ->  file:write(Fd, Data);
    +      (position, {Fd,Pos}) -> file:position(Fd, Pos);
    +      (read2, {Fd,Size}) -> file:read(Fd, Size);
    +      (close, Fd) -> file:close(Fd)
    +   end

    Here Fd was specified to function init/3 as:

    {ok,Fd} = file:open(Name, ...).
    +{ok,TarDesc} = erl_tar:init(Fd, [write], ExampleFun),

    TarDesc is then used:

    erl_tar:add(TarDesc, SomeValueIwantToAdd, FileNameInTarFile),
     ...,
    -erl_tar:close(TarDesc)

    When the erl_tar core wants to, for example, write a piece of Data, it would +erl_tar:close(TarDesc)

    When the erl_tar core wants to, for example, write a piece of Data, it would call ExampleFun(write, {UserData,Data}).

    Note

    This example with the file module operations is not necessary to use directly, as that is what function open/2 in principle does.

    Warning

    The TarDescriptor term is not a file descriptor. You are advised not to rely on the specific contents of this term, as it can change in future Erlang/OTP /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/escript.xhtml differs (HTML document, ASCII text, with very long lines (1684)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/escript.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/escript.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -401,67 +401,67 @@ number of schedulers with +S3. We also extract the different sections from the newly created script:

    > Source = "%% Demo\nmain(_Args) ->\n    io:format(\"~p\",[erlang:system_info(schedulers)]).\n".
     "%% Demo\nmain(_Args) ->\n    io:format(erlang:system_info(schedulers)).\n"
    -> io:format("~s\n", [Source]).
    +> io:format("~s\n", [Source]).
     %% Demo
    -main(_Args) ->
    -    io:format(erlang:system_info(schedulers)).
    +main(_Args) ->
    +    io:format(erlang:system_info(schedulers)).
     
     ok
    -> {ok, Bin} = escript:create(binary, [shebang, comment, {emu_args, "+S3"},
    -                                      {source, list_to_binary(Source)}]).
    -{ok,<<"#!/usr/bin/env escript\n%% This is an -*- erlang -*- file\n%%!+S3"...>>}
    -> file:write_file("demo.escript", Bin).
    +> {ok, Bin} = escript:create(binary, [shebang, comment, {emu_args, "+S3"},
    +                                      {source, list_to_binary(Source)}]).
    +{ok,<<"#!/usr/bin/env escript\n%% This is an -*- erlang -*- file\n%%!+S3"...>>}
    +> file:write_file("demo.escript", Bin).
     ok
    -> os:cmd("escript demo.escript").
    +> os:cmd("escript demo.escript").
     "3"
    -> escript:extract("demo.escript", []).
    -{ok,[{shebang,default}, {comment,default}, {emu_args,"+S3"},
    -     {source,<<"%% Demo\nmain(_Args) ->\n    io:format(erlang:system_info(schedu"...>>}]}

    An escript without header can be created as follows:

    > file:write_file("demo.erl",
    -                  ["%% demo.erl\n-module(demo).\n-export([main/1]).\n\n", Source]).
    +> escript:extract("demo.escript", []).
    +{ok,[{shebang,default}, {comment,default}, {emu_args,"+S3"},
    +     {source,<<"%% Demo\nmain(_Args) ->\n    io:format(erlang:system_info(schedu"...>>}]}

    An escript without header can be created as follows:

    > file:write_file("demo.erl",
    +                  ["%% demo.erl\n-module(demo).\n-export([main/1]).\n\n", Source]).
     ok
    -> {ok, _, BeamCode} = compile:file("demo.erl", [binary, debug_info]).
    -{ok,demo,
    +> {ok, _, BeamCode} = compile:file("demo.erl", [binary, debug_info]).
    +{ok,demo,
         <<70,79,82,49,0,0,2,208,66,69,65,77,65,116,111,109,0,0,0,
    -      79,0,0,0,9,4,100,...>>}
    -> escript:create("demo.beam", [{beam, BeamCode}]).
    +      79,0,0,0,9,4,100,...>>}
    +> escript:create("demo.beam", [{beam, BeamCode}]).
     ok
    -> escript:extract("demo.beam", []).
    -{ok,[{shebang,undefined}, {comment,undefined}, {emu_args,undefined},
    -     {beam,<<70,79,82,49,0,0,3,68,66,69,65,77,65,116,
    -             111,109,0,0,0,83,0,0,0,9,...>>}]}
    -> os:cmd("escript demo.beam").
    +> escript:extract("demo.beam", []).
    +{ok,[{shebang,undefined}, {comment,undefined}, {emu_args,undefined},
    +     {beam,<<70,79,82,49,0,0,3,68,66,69,65,77,65,116,
    +             111,109,0,0,0,83,0,0,0,9,...>>}]}
    +> os:cmd("escript demo.beam").
     "true"

    Here we create an archive script containing both Erlang code and Beam code, then we iterate over all files in the archive and collect their contents and some -information about them:

    > {ok, SourceCode} = file:read_file("demo.erl").
    -{ok,<<"%% demo.erl\n-module(demo).\n-export([main/1]).\n\n%% Demo\nmain(_Arg"...>>}
    -> escript:create("demo.escript",
    -                 [shebang,
    -                  {archive, [{"demo.erl", SourceCode},
    -                             {"demo.beam", BeamCode}], []}]).
    -ok
    -> {ok, [{shebang,default}, {comment,undefined}, {emu_args,undefined},
    -     {archive, ArchiveBin}]} = escript:extract("demo.escript", []).
    -{ok,[{shebang,default}, {comment,undefined}, {emu_args,undefined},
    -     {{archive,<<80,75,3,4,20,0,0,0,8,0,118,7,98,60,105,
    -                152,61,93,107,0,0,0,118,0,...>>}]}
    -> file:write_file("demo.zip", ArchiveBin).
    -ok
    -> zip:foldl(fun(N, I, B, A) -> [{N, I(), B()} | A] end, [], "demo.zip").
    -{ok,[{"demo.beam",
    -      {file_info,748,regular,read_write,
    -                 {{2010,3,2},{0,59,22}},
    -                 {{2010,3,2},{0,59,22}},
    -                 {{2010,3,2},{0,59,22}},
    -                 54,1,0,0,0,0,0},
    +information about them:

    > {ok, SourceCode} = file:read_file("demo.erl").
    +{ok,<<"%% demo.erl\n-module(demo).\n-export([main/1]).\n\n%% Demo\nmain(_Arg"...>>}
    +> escript:create("demo.escript",
    +                 [shebang,
    +                  {archive, [{"demo.erl", SourceCode},
    +                             {"demo.beam", BeamCode}], []}]).
    +ok
    +> {ok, [{shebang,default}, {comment,undefined}, {emu_args,undefined},
    +     {archive, ArchiveBin}]} = escript:extract("demo.escript", []).
    +{ok,[{shebang,default}, {comment,undefined}, {emu_args,undefined},
    +     {{archive,<<80,75,3,4,20,0,0,0,8,0,118,7,98,60,105,
    +                152,61,93,107,0,0,0,118,0,...>>}]}
    +> file:write_file("demo.zip", ArchiveBin).
    +ok
    +> zip:foldl(fun(N, I, B, A) -> [{N, I(), B()} | A] end, [], "demo.zip").
    +{ok,[{"demo.beam",
    +      {file_info,748,regular,read_write,
    +                 {{2010,3,2},{0,59,22}},
    +                 {{2010,3,2},{0,59,22}},
    +                 {{2010,3,2},{0,59,22}},
    +                 54,1,0,0,0,0,0},
           <<70,79,82,49,0,0,2,228,66,69,65,77,65,116,111,109,0,0,0,
    -        83,0,0,...>>},
    -     {"demo.erl",
    -      {file_info,118,regular,read_write,
    -                 {{2010,3,2},{0,59,22}},
    -                 {{2010,3,2},{0,59,22}},
    -                 {{2010,3,2},{0,59,22}},
    -                 54,1,0,0,0,0,0},
    -      <<"%% demo.erl\n-module(demo).\n-export([main/1]).\n\n%% Demo\nmain(_Arg"...>>}]}
    +
    83,0,0,...>>}, + {"demo.erl", + {file_info,118,regular,read_write, + {{2010,3,2},{0,59,22}}, + {{2010,3,2},{0,59,22}}, + {{2010,3,2},{0,59,22}}, + 54,1,0,0,0,0,0}, + <<"%% demo.erl\n-module(demo).\n-export([main/1]).\n\n%% Demo\nmain(_Arg"...>>}]}
    @@ -494,16 +494,16 @@ extracted value is set to the atom default. If a section is missing, the extracted value is set to the atom undefined.

    Option compile_source only affects the result if the escript contains source code. In this case the Erlang code is automatically compiled and -{source, BeamCode} is returned instead of {source, SourceCode}.

    Example:

    > escript:create("demo.escript",
    -                 [shebang, {archive, [{"demo.erl", SourceCode},
    -                                      {"demo.beam", BeamCode}], []}]).
    -ok
    -> {ok, [{shebang,default}, {comment,undefined}, {emu_args,undefined},
    -     {archive, ArchiveBin}]} =
    -              escript:extract("demo.escript", []).
    -{ok,[{{archive,<<80,75,3,4,20,0,0,0,8,0,118,7,98,60,105,
    -                152,61,93,107,0,0,0,118,0,...>>}
    -     {emu_args,undefined}]}
    +{source, BeamCode} is returned instead of {source, SourceCode}.

    Example:

    > escript:create("demo.escript",
    +                 [shebang, {archive, [{"demo.erl", SourceCode},
    +                                      {"demo.beam", BeamCode}], []}]).
    +ok
    +> {ok, [{shebang,default}, {comment,undefined}, {emu_args,undefined},
    +     {archive, ArchiveBin}]} =
    +              escript:extract("demo.escript", []).
    +{ok,[{{archive,<<80,75,3,4,20,0,0,0,8,0,118,7,98,60,105,
    +                152,61,93,107,0,0,0,118,0,...>>}
    +     {emu_args,undefined}]}
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/ets.xhtml differs (HTML document, ASCII text, with very long lines (1175)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/ets.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/ets.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -115,10 +115,10 @@ find the next key is not done with such guarantees. This is often not a problem, but may cause rare subtle "unexpected" effects if a concurrent process inserts objects during a traversal. For example, consider one process -doing

    ets:new(t, [ordered_set, named_table]),
    -ets:insert(t, {1}),
    -ets:insert(t, {2}),
    -ets:insert(t, {3}),

    A concurrent call to ets:first(t), done by another process, may then in rare +doing

    ets:new(t, [ordered_set, named_table]),
    +ets:insert(t, {1}),
    +ets:insert(t, {2}),
    +ets:insert(t, {3}),

    A concurrent call to ets:first(t), done by another process, may then in rare cases return 2 even though 2 has never existed in the table ordered as the first key. In the same way, a concurrent call to ets:next(t, 1) may return 3 even though 3 never existed in the table ordered directly after 1.

    Effects like this are improbable but possible. The probability will further be @@ -131,11 +131,11 @@ lookup without any table traversal at all. For ordered_set a partially bound key will limit the traversal to only scan a subset of the table based on term order. A partially bound key is either a list or a tuple with a prefix that is -fully bound. Example:

    1> T = ets:new(t,[ordered_set]), ets:insert(T, {"555-1234", "John Smith"}).
    +fully bound. Example:

    1> T = ets:new(t,[ordered_set]), ets:insert(T, {"555-1234", "John Smith"}).
     true
     2> %% Efficient search of all with area code 555
    -2> ets:match(T,{[$5,$5,$5,$- |'$1'],'$2'}).
    -[["1234","John Smith"]]

    +2> ets:match(T,{[$5,$5,$5,$- |'$1'],'$2'}). +[["1234","John Smith"]]

    @@ -1815,19 +1815,19 @@ -include_lib("stdlib/include/ms_transform.hrl"). to the source file.

    The fun is very restricted, it can take only a single parameter (the object to match): a sole variable or a tuple. It must use the is_ guard tests. Language constructs that have no representation in a match specification (if, case, -receive, and so on) are not allowed.

    The return value is the resulting match specification.

    Example:

    1> ets:fun2ms(fun({M,N}) when N > 3 -> M end).
    -[{{'$1','$2'},[{'>','$2',3}],['$1']}]

    Variables from the environment can be imported, so that the following works:

    2> X=3.
    +receive, and so on) are not allowed.

    The return value is the resulting match specification.

    Example:

    1> ets:fun2ms(fun({M,N}) when N > 3 -> M end).
    +[{{'$1','$2'},[{'>','$2',3}],['$1']}]

    Variables from the environment can be imported, so that the following works:

    2> X=3.
     3
    -3> ets:fun2ms(fun({M,N}) when N > X -> M end).
    -[{{'$1','$2'},[{'>','$2',{const,3}}],['$1']}]

    The imported variables are replaced by match specification const expressions, +3> ets:fun2ms(fun({M,N}) when N > X -> M end). +[{{'$1','$2'},[{'>','$2',{const,3}}],['$1']}]

    The imported variables are replaced by match specification const expressions, which is consistent with the static scoping for Erlang funs. However, local or global function calls cannot be in the guard or body of the fun. Calls to -built-in match specification functions is of course allowed:

    4> ets:fun2ms(fun({M,N}) when N > X, my_fun(M) -> M end).
    +built-in match specification functions is of course allowed:

    4> ets:fun2ms(fun({M,N}) when N > X, my_fun(M) -> M end).
     Error: fun containing local Erlang function calls
    -('my_fun' called in guard) cannot be translated into match_spec
    -{error,transform_error}
    -5> ets:fun2ms(fun({M,N}) when N > X, is_atom(M) -> M end).
    -[{{'$1','$2'},[{'>','$2',{const,3}},{is_atom,'$1'}],['$1']}]

    As shown by the example, the function can be called from the shell also. The fun +('my_fun' called in guard) cannot be translated into match_spec +{error,transform_error} +5> ets:fun2ms(fun({M,N}) when N > X, is_atom(M) -> M end). +[{{'$1','$2'},[{'>','$2',{const,3}},{is_atom,'$1'}],['$1']}]

    As shown by the example, the function can be called from the shell also. The fun must be literally in the call when used from the shell as well.

    Warning

    If the parse_transform is not applied to a module that calls this pseudo function, the call fails in runtime (with a badarg). The ets module exports a function with this name, but it is never to be called except when @@ -2452,12 +2452,12 @@

    Matches the objects in table Table against pattern Pattern.

    A pattern is a term that can contain:

    • Bound parts (Erlang terms)
    • '_' that matches any Erlang term
    • Pattern variables '$N', where N=0,1,...

    The function returns a list with one element for each matching object, where -each element is an ordered list of pattern variable bindings, for example:

    6> ets:match(T, '$1'). % Matches every object in table
    -[[{rufsen,dog,7}],[{brunte,horse,5}],[{ludde,dog,5}]]
    -7> ets:match(T, {'_',dog,'$1'}).
    -[[7],[5]]
    -8> ets:match(T, {'_',cow,'$1'}).
    -[]

    If the key is specified in the pattern, the match is very efficient. If the key +each element is an ordered list of pattern variable bindings, for example:

    6> ets:match(T, '$1'). % Matches every object in table
    +[[{rufsen,dog,7}],[{brunte,horse,5}],[{ludde,dog,5}]]
    +7> ets:match(T, {'_',dog,'$1'}).
    +[[7],[5]]
    +8> ets:match(T, {'_',cow,'$1'}).
    +[]

    If the key is specified in the pattern, the match is very efficient. If the key is not specified, that is, if it is a variable or an underscore, the entire table must be searched. The search time can be substantial if the table is very large.

    For tables of type ordered_set, the result is in the same order as in a @@ -2709,10 +2709,10 @@ execution time):

    Table = ets:new...
     MatchSpec = ...
     % The following call...
    -ets:match_spec_run(ets:tab2list(Table),
    -                   ets:match_spec_compile(MatchSpec)),
    +ets:match_spec_run(ets:tab2list(Table),
    +                   ets:match_spec_compile(MatchSpec)),
     % ...gives the same result as the more common (and more efficient)
    -ets:select(Table, MatchSpec),

    Note

    This function has limited use in normal code. It is used by the dets +ets:select(Table, MatchSpec),

    Note

    This function has limited use in normal code. It is used by the dets module to perform the dets:select/1 operations and by Mnesia during transactions.

    @@ -3075,19 +3075,19 @@ format. Given that the original match specification is kept intact, the continuation can be restored, meaning it can once again be used in subsequent select/1 calls even though it has been stored on disk or on -another node.

    Examples:

    The following sequence of calls may fail:

    T=ets:new(x,[]),
    +another node.

    Examples:

    The following sequence of calls may fail:

    T=ets:new(x,[]),
     ...
    -MS = ets:fun2ms(fun({N,_}=A) when (N rem 10) =:= 0 -> A end),
    -{_,C} = ets:select(T, MS, 10),
    -MaybeBroken = binary_to_term(term_to_binary(C)),
    -ets:select(MaybeBroken).

    The following sequence works, as the call to +MS = ets:fun2ms(fun({N,_}=A) when (N rem 10) =:= 0 -> A end), +{_,C} = ets:select(T, MS, 10), +MaybeBroken = binary_to_term(term_to_binary(C)), +ets:select(MaybeBroken).

    The following sequence works, as the call to repair_continuation/2 reestablishes the -MaybeBroken continuation.

    T=ets:new(x,[]),
    +MaybeBroken continuation.

    T=ets:new(x,[]),
     ...
    -MS = ets:fun2ms(fun({N,_}=A) when (N rem 10) =:= 0 -> A end),
    -{_,C} = ets:select(T,MS,10),
    -MaybeBroken = binary_to_term(term_to_binary(C)),
    -ets:select(ets:repair_continuation(MaybeBroken,MS)).

    Note

    This function is rarely needed in application code. It is used by Mnesia to +MS = ets:fun2ms(fun({N,_}=A) when (N rem 10) =:= 0 -> A end), +{_,C} = ets:select(T,MS,10), +MaybeBroken = binary_to_term(term_to_binary(C)), +ets:select(ets:repair_continuation(MaybeBroken,MS)).

    Note

    This function is rarely needed in application code. It is used by Mnesia to provide distributed select/3 and select/1 sequences. A normal application would either use Mnesia or keep the continuation from being converted to external format.

    The actual behavior of compiled match specifications when recreated from @@ -3132,21 +3132,21 @@ to succeed even if keys are removed during the traversal. The keys for objects inserted or deleted during a traversal may or may not be returned by next/2 depending on the ordering of keys within the table and if -the key exists at the time next/2 is called.

    Example:

    clean_all_with_value(Table,X) ->
    -    safe_fixtable(Table,true),
    -    clean_all_with_value(Table,X,ets:first(Table)),
    -    safe_fixtable(Table,false).
    +the key exists at the time next/2 is called.

    Example:

    clean_all_with_value(Table,X) ->
    +    safe_fixtable(Table,true),
    +    clean_all_with_value(Table,X,ets:first(Table)),
    +    safe_fixtable(Table,false).
     
    -clean_all_with_value(Table,X,'$end_of_table') ->
    +clean_all_with_value(Table,X,'$end_of_table') ->
         true;
    -clean_all_with_value(Table,X,Key) ->
    -    case ets:lookup(Table,Key) of
    -        [{Key,X}] ->
    -            ets:delete(Table,Key);
    +clean_all_with_value(Table,X,Key) ->
    +    case ets:lookup(Table,Key) of
    +        [{Key,X}] ->
    +            ets:delete(Table,Key);
             _ ->
                 true
         end,
    -    clean_all_with_value(Table,X,ets:next(Table,Key)).

    Notice that deleted objects are not freed from a fixed table until it has been + clean_all_with_value(Table,X,ets:next(Table,Key)).

    Notice that deleted objects are not freed from a fixed table until it has been released. If a process fixes a table but never releases it, the memory used by the deleted objects is never freed. The performance of operations on the table also degrades significantly.

    To retrieve information about which processes have fixed which tables, use @@ -3234,7 +3234,7 @@ a list, so that the following code:

    ets:select(Table,[{{'$1','$2','$3'},[],['$$']}])

    gives the same output as:

    ets:select(Table,[{{'$1','$2','$3'},[],[['$1','$2','$3']]}])

    That is, all the bound variables in the match head as a list. If tuples are to be constructed, one has to write a tuple of arity 1 where the single element in the tuple is the tuple one wants to construct (as an ordinary tuple can be -mistaken for a Guard).

    Therefore the following call:

    ets:select(Table,[{{'$1','$2','$1'},[],['$_']}])

    gives the same output as:

    ets:select(Table,[{{'$1','$2','$1'},[],[{{'$1','$2','$3'}}]}])

    This syntax is equivalent to the syntax used in the trace patterns (see the +mistaken for a Guard).

    Therefore the following call:

    ets:select(Table,[{{'$1','$2','$1'},[],['$_']}])

    gives the same output as:

    ets:select(Table,[{{'$1','$2','$1'},[],[{{'$1','$2','$3'}}]}])

    This syntax is equivalent to the syntax used in the trace patterns (see the dbg) module in Runtime_Tools.

    The Guards are constructed as tuples, where the first element is the test name and the remaining elements are the test parameters. To check for a specific type (say a list) of the element bound to the match variable '$1', one would write @@ -3396,16 +3396,16 @@ object. If not, select_replace will fail with badarg without updating any objects.

    For the moment, due to performance and semantic constraints, tables of type bag are not yet supported.

    The function returns the total number of replaced objects.

    Example

    For all 2-tuples with a list in second position, add atom 'marker' first in -the list:

    1> T = ets:new(x,[]), ets:insert(T, {key, [1, 2, 3]}).
    +the list:

    1> T = ets:new(x,[]), ets:insert(T, {key, [1, 2, 3]}).
     true
    -2> MS = ets:fun2ms(fun({K, L}) when is_list(L) -> {K, [marker | L]} end).
    -[{{'$1','$2'},[{is_list,'$2'}],[{{'$1',[marker|'$2']}}]}]
    -3> ets:select_replace(T, MS).
    +2> MS = ets:fun2ms(fun({K, L}) when is_list(L) -> {K, [marker | L]} end).
    +[{{'$1','$2'},[{is_list,'$2'}],[{{'$1',[marker|'$2']}}]}]
    +3> ets:select_replace(T, MS).
     1
    -4> ets:tab2list(T).
    -[{key,[marker,1,2,3]}]

    A generic single object compare-and-swap operation:

    [Old] = ets:lookup(T, Key),
    -New = update_object(Old),
    -Success = (1 =:= ets:select_replace(T, [{Old, [], [{const, New}]}])),
    +4>
    ets:tab2list(T). +[{key,[marker,1,2,3]}]

    A generic single object compare-and-swap operation:

    [Old] = ets:lookup(T, Key),
    +New = update_object(Old),
    +Success = (1 =:= ets:select_replace(T, [{Old, [], [{const, New}]}])),
    @@ -3440,22 +3440,22 @@ ordered_set, the traversal of the table continues to objects with keys earlier in the Erlang term order. The returned list also contains objects with keys in reverse order. For all other table types, the behavior is exactly that of -select/1.

    Example:

    1> T = ets:new(x,[ordered_set]).
    -2> [ ets:insert(T,{N}) || N <- lists:seq(1,10) ].
    +select/1.

    Example:

    1> T = ets:new(x,[ordered_set]).
    +2> [ ets:insert(T,{N}) || N <- lists:seq(1,10) ].
     ...
    -3> {R0,C0} = ets:select_reverse(T,[{'_',[],['$_']}],4).
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/filelib.xhtml differs (HTML document, ASCII text, with very long lines (915))
    --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/filelib.xhtml	2026-06-04 00:07:10.000000000 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/filelib.xhtml	2042-07-06 13:26:37.000000000 +0000
    @@ -909,15 +909,15 @@
     
     

    Sanitizes the relative path by eliminating ".." and "." components to protect against directory traversal attacks.

    Either returns the sanitized path name, or the atom unsafe if the path is unsafe. -The path is considered unsafe in the following circumstances:

    • The path is not relative.
    • A ".." component would climb up above the root of the relative path.
    • A symbolic link in the path points above the root of the relative path.

    Examples:

    1> {ok, Cwd} = file:get_cwd().
    +The path is considered unsafe in the following circumstances:

    • The path is not relative.
    • A ".." component would climb up above the root of the relative path.
    • A symbolic link in the path points above the root of the relative path.

    Examples:

    1> {ok, Cwd} = file:get_cwd().
     ...
    -2> filelib:safe_relative_path("dir/sub_dir/..", Cwd).
    +2> filelib:safe_relative_path("dir/sub_dir/..", Cwd).
     "dir"
    -3> filelib:safe_relative_path("dir/..", Cwd).
    -[]
    -4> filelib:safe_relative_path("dir/../..", Cwd).
    +3> filelib:safe_relative_path("dir/..", Cwd).
    +[]
    +4> filelib:safe_relative_path("dir/../..", Cwd).
     unsafe
    -5> filelib:safe_relative_path("/abs/path", Cwd).
    +5> filelib:safe_relative_path("/abs/path", Cwd).
     unsafe
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/filename.xhtml differs (HTML document, ASCII text, with very long lines (1045)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/filename.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/filename.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -405,20 +405,20 @@

    Converts a relative Filename and returns an absolute name. No attempt is made to create the shortest absolute name, as this can give incorrect results on file -systems that allow links.

    Unix examples:

    1> pwd().
    +systems that allow links.

    Unix examples:

    1> pwd().
     "/usr/local"
    -2> filename:absname("foo").
    +2> filename:absname("foo").
     "/usr/local/foo"
    -3> filename:absname("../x").
    +3> filename:absname("../x").
     "/usr/local/../x"
    -4> filename:absname("/").
    -"/"

    Windows examples:

    1> pwd().
    +4> filename:absname("/").
    +"/"

    Windows examples:

    1> pwd().
     "D:/usr/local"
    -2> filename:absname("foo").
    +2> filename:absname("foo").
     "D:/usr/local/foo"
    -3> filename:absname("../x").
    +3> filename:absname("../x").
     "D:/usr/local/../x"
    -4> filename:absname("/").
    +4> filename:absname("/").
     "D:/"
    @@ -558,58 +558,58 @@ Opts the function will default to the native option, that is 'linux', 'darwin' or 'windows', as understood by os:type/0. Anything not recognized as 'darwin' or 'windows' is interpreted as 'linux'.

    The options 'author' and 'version' are only used with 'windows' option -mode.

    • user_cache

      The path location is intended for transient data files on a local machine.

      On Linux: Respects the os environment variable XDG_CACHE_HOME.

      1> filename:basedir(user_cache, "my_application", #{os=>linux}).
      -"/home/otptest/.cache/my_application"

      On Darwin:

      1> filename:basedir(user_cache, "my_application", #{os=>darwin}).
      -"/home/otptest/Library/Caches/my_application"

      On Windows:

      1> filename:basedir(user_cache, "My App").
      +mode.

      • user_cache

        The path location is intended for transient data files on a local machine.

        On Linux: Respects the os environment variable XDG_CACHE_HOME.

        1> filename:basedir(user_cache, "my_application", #{os=>linux}).
        +"/home/otptest/.cache/my_application"

        On Darwin:

        1> filename:basedir(user_cache, "my_application", #{os=>darwin}).
        +"/home/otptest/Library/Caches/my_application"

        On Windows:

        1> filename:basedir(user_cache, "My App").
         "c:/Users/otptest/AppData/Local/My App/Cache"
        -2> filename:basedir(user_cache, "My App").
        +2> filename:basedir(user_cache, "My App").
         "c:/Users/otptest/AppData/Local/My App/Cache"
        -3> filename:basedir(user_cache, "My App", #{author=>"Erlang"}).
        +3> filename:basedir(user_cache, "My App", #{author=>"Erlang"}).
         "c:/Users/otptest/AppData/Local/Erlang/My App/Cache"
        -4> filename:basedir(user_cache, "My App", #{version=>"1.2"}).
        +4> filename:basedir(user_cache, "My App", #{version=>"1.2"}).
         "c:/Users/otptest/AppData/Local/My App/1.2/Cache"
        -5> filename:basedir(user_cache, "My App", #{author=>"Erlang",version=>"1.2"}).
        -"c:/Users/otptest/AppData/Local/Erlang/My App/1.2/Cache"
      • user_config

        The path location is intended for persistent configuration files.

        On Linux: Respects the os environment variable XDG_CONFIG_HOME.

        2> filename:basedir(user_config, "my_application", #{os=>linux}).
        -"/home/otptest/.config/my_application"

        On Darwin:

        2> filename:basedir(user_config, "my_application", #{os=>darwin}).
        -"/home/otptest/Library/Application Support/my_application"

        On Windows:

        1> filename:basedir(user_config, "My App").
        +5> filename:basedir(user_cache, "My App", #{author=>"Erlang",version=>"1.2"}).
        +"c:/Users/otptest/AppData/Local/Erlang/My App/1.2/Cache"
      • user_config

        The path location is intended for persistent configuration files.

        On Linux: Respects the os environment variable XDG_CONFIG_HOME.

        2> filename:basedir(user_config, "my_application", #{os=>linux}).
        +"/home/otptest/.config/my_application"

        On Darwin:

        2> filename:basedir(user_config, "my_application", #{os=>darwin}).
        +"/home/otptest/Library/Application Support/my_application"

        On Windows:

        1> filename:basedir(user_config, "My App").
         "c:/Users/otptest/AppData/Roaming/My App"
        -2> filename:basedir(user_config, "My App", #{author=>"Erlang", version=>"1.2"}).
        -"c:/Users/otptest/AppData/Roaming/Erlang/My App/1.2"
      • user_data

        The path location is intended for persistent data files.

        On Linux: Respects the os environment variable XDG_DATA_HOME.

        3> filename:basedir(user_data, "my_application", #{os=>linux}).
        -"/home/otptest/.local/my_application"

        On Darwin:

        3> filename:basedir(user_data, "my_application", #{os=>darwin}).
        -"/home/otptest/Library/Application Support/my_application"

        On Windows:

        8> filename:basedir(user_data, "My App").
        +2> filename:basedir(user_config, "My App", #{author=>"Erlang", version=>"1.2"}).
        +"c:/Users/otptest/AppData/Roaming/Erlang/My App/1.2"
      • user_data

        The path location is intended for persistent data files.

        On Linux: Respects the os environment variable XDG_DATA_HOME.

        3> filename:basedir(user_data, "my_application", #{os=>linux}).
        +"/home/otptest/.local/my_application"

        On Darwin:

        3> filename:basedir(user_data, "my_application", #{os=>darwin}).
        +"/home/otptest/Library/Application Support/my_application"

        On Windows:

        8> filename:basedir(user_data, "My App").
         "c:/Users/otptest/AppData/Local/My App"
        -9> filename:basedir(user_data, "My App",#{author=>"Erlang",version=>"1.2"}).
        -"c:/Users/otptest/AppData/Local/Erlang/My App/1.2"
      • user_log

        The path location is intended for transient log files on a local machine.

        On Linux: Respects the os environment variable XDG_CACHE_HOME.

        4> filename:basedir(user_log, "my_application", #{os=>linux}).
        -"/home/otptest/.cache/my_application/log"

        On Darwin:

        4> filename:basedir(user_log, "my_application", #{os=>darwin}).
        -"/home/otptest/Library/Logs/my_application"

        On Windows:

        12> filename:basedir(user_log, "My App").
        +9> filename:basedir(user_data, "My App",#{author=>"Erlang",version=>"1.2"}).
        +"c:/Users/otptest/AppData/Local/Erlang/My App/1.2"
      • user_log

        The path location is intended for transient log files on a local machine.

        On Linux: Respects the os environment variable XDG_CACHE_HOME.

        4> filename:basedir(user_log, "my_application", #{os=>linux}).
        +"/home/otptest/.cache/my_application/log"

        On Darwin:

        4> filename:basedir(user_log, "my_application", #{os=>darwin}).
        +"/home/otptest/Library/Logs/my_application"

        On Windows:

        12> filename:basedir(user_log, "My App").
         "c:/Users/otptest/AppData/Local/My App/Logs"
        -13> filename:basedir(user_log, "My App",#{author=>"Erlang",version=>"1.2"}).
        -"c:/Users/otptest/AppData/Local/Erlang/My App/1.2/Logs"
      • site_config

        On Linux: Respects the os environment variable XDG_CONFIG_DIRS.

        5> filename:basedir(site_config, "my_application", #{os=>linux}).
        -["/usr/local/share/my_application",
        - "/usr/share/my_application"]
        -6> os:getenv("XDG_CONFIG_DIRS").
        +13> filename:basedir(user_log, "My App",#{author=>"Erlang",version=>"1.2"}).
        +"c:/Users/otptest/AppData/Local/Erlang/My App/1.2/Logs"
      • site_config

        On Linux: Respects the os environment variable XDG_CONFIG_DIRS.

        5> filename:basedir(site_config, "my_application", #{os=>linux}).
        +["/usr/local/share/my_application",
        + "/usr/share/my_application"]
        +6> os:getenv("XDG_CONFIG_DIRS").
         "/etc/xdg/xdg-ubuntu:/usr/share/upstart/xdg:/etc/xdg"
        -7> filename:basedir(site_config, "my_application", #{os=>linux}).
        -["/etc/xdg/xdg-ubuntu/my_application",
        +7> filename:basedir(site_config, "my_application", #{os=>linux}).
        +["/etc/xdg/xdg-ubuntu/my_application",
          "/usr/share/upstart/xdg/my_application",
        - "/etc/xdg/my_application"]
        -8> os:unsetenv("XDG_CONFIG_DIRS").
        + "/etc/xdg/my_application"]
        +8> os:unsetenv("XDG_CONFIG_DIRS").
         true
        -9> filename:basedir(site_config, "my_application", #{os=>linux}).
        -["/etc/xdg/my_application"]

        On Darwin:

        5> filename:basedir(site_config, "my_application", #{os=>darwin}).
        -["/Library/Application Support/my_application"]
      • site_data

        On Linux: Respects the os environment variable XDG_DATA_DIRS.

        10> os:getenv("XDG_DATA_DIRS").
        +9> filename:basedir(site_config, "my_application", #{os=>linux}).
        +["/etc/xdg/my_application"]

        On Darwin:

        5> filename:basedir(site_config, "my_application", #{os=>darwin}).
        +["/Library/Application Support/my_application"]
      • site_data

        On Linux: Respects the os environment variable XDG_DATA_DIRS.

        10> os:getenv("XDG_DATA_DIRS").
         "/usr/share/ubuntu:/usr/share/gnome:/usr/local/share/:/usr/share/"
        -11> filename:basedir(site_data, "my_application", #{os=>linux}).
        -["/usr/share/ubuntu/my_application",
        +11> filename:basedir(site_data, "my_application", #{os=>linux}).
        +["/usr/share/ubuntu/my_application",
          "/usr/share/gnome/my_application",
          "/usr/local/share/my_application",
        - "/usr/share/my_application"]
        -12> os:unsetenv("XDG_DATA_DIRS").
        + "/usr/share/my_application"]
        +12> os:unsetenv("XDG_DATA_DIRS").
         true
        -13> filename:basedir(site_data, "my_application", #{os=>linux}).
        -["/usr/local/share/my_application",
        - "/usr/share/my_application"]

        On Darwin:

        5> filename:basedir(site_data, "my_application", #{os=>darwin}).
        -["/Library/Application Support/my_application"]
      +13>
      filename:basedir(site_data, "my_application", #{os=>linux}). +["/usr/local/share/my_application", + "/usr/share/my_application"]

      On Darwin:

      5> filename:basedir(site_data, "my_application", #{os=>darwin}).
      +["/Library/Application Support/my_application"]
    @@ -638,12 +638,12 @@

    Returns the last component of Filename, or Filename itself if it does not -contain any directory separators.

    Examples:

    5> filename:basename("foo").
    +contain any directory separators.

    Examples:

    5> filename:basename("foo").
     "foo"
    -6> filename:basename("/usr/foo").
    +6> filename:basename("/usr/foo").
     "foo"
    -7> filename:basename("/").
    -[]
    +7>
    filename:basename("/"). +[]
    @@ -674,15 +674,15 @@

    Returns the last component of Filename with extension Ext stripped.

    This function is to be used to remove a (possible) specific extension. To remove an existing extension when you are unsure which one it is, use -rootname(basename(Filename)).

    Examples:

    8> filename:basename("~/src/kalle.erl", ".erl").
    +rootname(basename(Filename)).

    Examples:

    8> filename:basename("~/src/kalle.erl", ".erl").
     "kalle"
    -9> filename:basename("~/src/kalle.beam", ".erl").
    +9> filename:basename("~/src/kalle.beam", ".erl").
     "kalle.beam"
    -10> filename:basename("~/src/kalle.old.erl", ".erl").
    +10> filename:basename("~/src/kalle.old.erl", ".erl").
     "kalle.old"
    -11> filename:rootname(filename:basename("~/src/kalle.erl")).
    +11> filename:rootname(filename:basename("~/src/kalle.erl")).
     "kalle"
    -12> filename:rootname(filename:basename("~/src/kalle.beam")).
    +12> filename:rootname(filename:basename("~/src/kalle.beam")).
     "kalle"
    @@ -711,10 +711,10 @@ -

    Returns the directory part of Filename.

    Examples:

    13> filename:dirname("/usr/src/kalle.erl").
    +

    Returns the directory part of Filename.

    Examples:

    13> filename:dirname("/usr/src/kalle.erl").
     "/usr/src"
    -14> filename:dirname("kalle.erl").
    -"."
    5> filename:dirname("\\usr\\src/kalle.erl"). % Windows
    +14> filename:dirname("kalle.erl").
    +"."
    5> filename:dirname("\\usr\\src/kalle.erl"). % Windows
     "/usr/src"
    @@ -744,10 +744,10 @@

    Returns the file extension of Filename, including the period. Returns an empty -string if no extension exists.

    Examples:

    15> filename:extension("foo.erl").
    +string if no extension exists.

    Examples:

    15> filename:extension("foo.erl").
     ".erl"
    -16> filename:extension("beam.src/kalle").
    -[]
    +16>
    filename:extension("beam.src/kalle"). +[]
    @@ -807,10 +807,10 @@

    Joins a list of filename Components with directory separators. If one of the elements of Components includes an absolute path, such as "/xxx", the preceding elements, if any, are removed from the result.

    The result is "normalized":

    • Redundant directory separators are removed.
    • In Windows, all directory separators are forward slashes and the drive letter -is in lower case.

    Examples:

    17> filename:join(["/usr", "local", "bin"]).
    +is in lower case.

    Examples:

    17> filename:join(["/usr", "local", "bin"]).
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/file_sorter.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (1046))
    --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/file_sorter.xhtml	2026-06-04 00:07:10.000000000 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/file_sorter.xhtml	2042-07-06 13:26:37.000000000 +0000
    @@ -90,35 +90,35 @@
     argument {value, Value}. This makes it easy to initiate the sequence of output
     functions with a value calculated by the input functions.

    As an example, consider sorting the terms on a disk log file. A function that reads chunks from the disk log and returns a list of binaries is used as input. -The results are collected in a list of terms.

    sort(Log) ->
    -    {ok, _} = disk_log:open([{name,Log}, {mode,read_only}]),
    -    Input = input(Log, start),
    -    Output = output([]),
    -    Reply = file_sorter:sort(Input, Output, {format,term}),
    -    ok = disk_log:close(Log),
    +The results are collected in a list of terms.

    sort(Log) ->
    +    {ok, _} = disk_log:open([{name,Log}, {mode,read_only}]),
    +    Input = input(Log, start),
    +    Output = output([]),
    +    Reply = file_sorter:sort(Input, Output, {format,term}),
    +    ok = disk_log:close(Log),
         Reply.
     
    -input(Log, Cont) ->
    -    fun(close) ->
    +input(Log, Cont) ->
    +    fun(close) ->
                 ok;
    -       (read) ->
    -            case disk_log:chunk(Log, Cont) of
    -                {error, Reason} ->
    -                    {error, Reason};
    -                {Cont2, Terms} ->
    -                    {Terms, input(Log, Cont2)};
    -                {Cont2, Terms, _Badbytes} ->
    -                    {Terms, input(Log, Cont2)};
    +       (read) ->
    +            case disk_log:chunk(Log, Cont) of
    +                {error, Reason} ->
    +                    {error, Reason};
    +                {Cont2, Terms} ->
    +                    {Terms, input(Log, Cont2)};
    +                {Cont2, Terms, _Badbytes} ->
    +                    {Terms, input(Log, Cont2)};
                     eof ->
                         end_of_input
                 end
         end.
     
    -output(L) ->
    -    fun(close) ->
    -            lists:append(lists:reverse(L));
    -       (Terms) ->
    -            output([Terms | L])
    +output(L) ->
    +    fun(close) ->
    +            lists:append(lists:reverse(L));
    +       (Terms) ->
    +            output([Terms | L])
         end.

    For more examples of functions as input and output, see the end of the file_sorter module; the term format is implemented with functions.

    The possible values of Reason returned when an error occurs are:

    • bad_object, {bad_object, FileName} - Applying the format function failed for some binary, or the key(s) could not be extracted from some term.
    • {bad_term, FileName} - io:read/2 failed to read some term.
    • {file_error, FileName, file:posix()} - For an explanation of /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/gen_event.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (646)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/gen_event.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/gen_event.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -1182,15 +1182,15 @@ but it may transform some values.

      Two possible use cases for this callback is to remove sensitive information from the state to prevent it from being printed in log files, or to compact large irrelevant status items -that would only clutter the logs.

      Example:

      format_status(Status) ->
      -  maps:map(
      -    fun(state,State) ->
      -            maps:remove(private_key, State);
      -       (message,{password, _Pass}) ->
      -            {password, removed};
      -       (_,Value) ->
      +that would only clutter the logs.

      Example:

      format_status(Status) ->
      +  maps:map(
      +    fun(state,State) ->
      +            maps:remove(private_key, State);
      +       (message,{password, _Pass}) ->
      +            {password, removed};
      +       (_,Value) ->
                   Value
      -    end, Status).

      Note

      This callback is optional, so event handler modules need not export it. + end, Status).

      Note

      This callback is optional, so event handler modules need not export it. If a handler does not export this function, the gen_event module uses the handler state directly for the purposes described below.

      If this callback is exported but fails, to hide possibly sensitive data, the default function will instead return the fact that /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/gen_fsm.xhtml differs (HTML document, ASCII text, with very long lines (879)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/gen_fsm.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/gen_fsm.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -30,163 +30,163 @@ Migration to gen_statem

      Here follows a simple example of turning a gen_fsm into a gen_statem. -The example comes from the previous User's Guide for gen_fsm

      -module(code_lock).
      --define(NAME, code_lock).
      +The example comes from the previous User's Guide for gen_fsm

      -module(code_lock).
      +-define(NAME, code_lock).
       %-define(BEFORE_REWRITE, true).
       
      --ifdef(BEFORE_REWRITE).
      --behaviour(gen_fsm).
      +-ifdef(BEFORE_REWRITE).
      +-behaviour(gen_fsm).
       -else.
      --behaviour(gen_statem).
      +-behaviour(gen_statem).
       -endif.
       
      --export([start_link/1, button/1, stop/0]).
      +-export([start_link/1, button/1, stop/0]).
       
      --ifdef(BEFORE_REWRITE).
      --export([init/1, locked/2, open/2, handle_sync_event/4, handle_event/3,
      -     handle_info/3, terminate/3, code_change/4]).
      +-ifdef(BEFORE_REWRITE).
      +-export([init/1, locked/2, open/2, handle_sync_event/4, handle_event/3,
      +     handle_info/3, terminate/3, code_change/4]).
       -else.
      --export([init/1, callback_mode/0, locked/3, open/3,
      -     terminate/3, code_change/4]).
      +-export([init/1, callback_mode/0, locked/3, open/3,
      +     terminate/3, code_change/4]).
       %% Add callback__mode/0
       %% Change arity of the state functions
       %% Remove handle_info/3
       -endif.
       
      --ifdef(BEFORE_REWRITE).
      -start_link(Code) ->
      -    gen_fsm:start_link({local, ?NAME}, ?MODULE, Code, []).
      +-ifdef(BEFORE_REWRITE).
      +start_link(Code) ->
      +    gen_fsm:start_link({local, ?NAME}, ?MODULE, Code, []).
       -else.
      -start_link(Code) ->
      -    gen_statem:start_link({local,?NAME}, ?MODULE, Code, []).
      +start_link(Code) ->
      +    gen_statem:start_link({local,?NAME}, ?MODULE, Code, []).
       -endif.
       
      --ifdef(BEFORE_REWRITE).
      -button(Digit) ->
      -    gen_fsm:send_event(?NAME, {button, Digit}).
      +-ifdef(BEFORE_REWRITE).
      +button(Digit) ->
      +    gen_fsm:send_event(?NAME, {button, Digit}).
       -else.
      -button(Digit) ->
      -    gen_statem:cast(?NAME, {button,Digit}).
      +button(Digit) ->
      +    gen_statem:cast(?NAME, {button,Digit}).
           %% send_event is asynchronous and becomes a cast
       -endif.
       
      --ifdef(BEFORE_REWRITE).
      -stop() ->
      -    gen_fsm:sync_send_all_state_event(?NAME, stop).
      +-ifdef(BEFORE_REWRITE).
      +stop() ->
      +    gen_fsm:sync_send_all_state_event(?NAME, stop).
       -else.
      -stop() ->
      -    gen_statem:call(?NAME, stop).
      +stop() ->
      +    gen_statem:call(?NAME, stop).
           %% sync_send is synchronous and becomes call
           %% all_state is handled by callback code in gen_statem
       -endif.
       
      -init(Code) ->
      -    do_lock(),
      -    Data = #{code => Code, remaining => Code},
      -    {ok, locked, Data}.
      +init(Code) ->
      +    do_lock(),
      +    Data = #{code => Code, remaining => Code},
      +    {ok, locked, Data}.
       
      --ifdef(BEFORE_REWRITE).
      +-ifdef(BEFORE_REWRITE).
       -else.
      -callback_mode() ->
      +callback_mode() ->
           state_functions.
       %% state_functions mode is the mode most similar to
       %% gen_fsm. There is also handle_event mode which is
       %% a fairly different concept.
       -endif.
       
      --ifdef(BEFORE_REWRITE).
      -locked({button, Digit}, Data0) ->
      -    case analyze_lock(Digit, Data0) of
      -    {open = StateName, Data} ->
      -        {next_state, StateName, Data, 10000};
      -    {StateName, Data} ->
      -        {next_state, StateName, Data}
      +-ifdef(BEFORE_REWRITE).
      +locked({button, Digit}, Data0) ->
      +    case analyze_lock(Digit, Data0) of
      +    {open = StateName, Data} ->
      +        {next_state, StateName, Data, 10000};
      +    {StateName, Data} ->
      +        {next_state, StateName, Data}
           end.
       -else.
      -locked(cast, {button,Digit}, Data0) ->
      -    case analyze_lock(Digit, Data0) of
      -    {open = StateName, Data} ->
      -        {next_state, StateName, Data, 10000};
      -    {StateName, Data} ->
      -        {next_state, StateName, Data}
      +locked(cast, {button,Digit}, Data0) ->
      +    case analyze_lock(Digit, Data0) of
      +    {open = StateName, Data} ->
      +        {next_state, StateName, Data, 10000};
      +    {StateName, Data} ->
      +        {next_state, StateName, Data}
           end;
      -locked({call, From}, Msg, Data) ->
      -    handle_call(From, Msg, Data);
      -locked({info, Msg}, StateName, Data) ->
      -    handle_info(Msg, StateName, Data).
      +locked({call, From}, Msg, Data) ->
      +    handle_call(From, Msg, Data);
      +locked({info, Msg}, StateName, Data) ->
      +    handle_info(Msg, StateName, Data).
       %% Arity differs
       %% All state events are dispatched to handle_call and handle_info help
       %% functions. If you want to handle a call or cast event specifically
       %% for this state you would add a special clause for it above.
       -endif.
       
      --ifdef(BEFORE_REWRITE).
      -open(timeout, State) ->
      -     do_lock(),
      -    {next_state, locked, State};
      -open({button,_}, Data) ->
      -    {next_state, locked, Data}.
      --else.
      -open(timeout, _, Data) ->
      -    do_lock(),
      -    {next_state, locked, Data};
      -open(cast, {button,_}, Data) ->
      -    {next_state, locked, Data};
      -open({call, From}, Msg, Data) ->
      -    handle_call(From, Msg, Data);
      -open(info, Msg, Data) ->
      -    handle_info(Msg, open, Data).
      +-ifdef(BEFORE_REWRITE).
      +open(timeout, State) ->
      +     do_lock(),
      +    {next_state, locked, State};
      +open({button,_}, Data) ->
      +    {next_state, locked, Data}.
      +-else.
      +open(timeout, _, Data) ->
      +    do_lock(),
      +    {next_state, locked, Data};
      +open(cast, {button,_}, Data) ->
      +    {next_state, locked, Data};
      +open({call, From}, Msg, Data) ->
      +    handle_call(From, Msg, Data);
      +open(info, Msg, Data) ->
      +    handle_info(Msg, open, Data).
       %% Arity differs
       %% All state events are dispatched to handle_call and handle_info help
       %% functions. If you want to handle a call or cast event specifically
       %% for this state you would add a special clause for it above.
       -endif.
       
      --ifdef(BEFORE_REWRITE).
      -handle_sync_event(stop, _From, _StateName, Data) ->
      -    {stop, normal, ok, Data}.
      +-ifdef(BEFORE_REWRITE).
      +handle_sync_event(stop, _From, _StateName, Data) ->
      +    {stop, normal, ok, Data}.
       
      -handle_event(Event, StateName, Data) ->
      -    {stop, {shutdown, {unexpected, Event, StateName}}, Data}.
      +handle_event(Event, StateName, Data) ->
      +    {stop, {shutdown, {unexpected, Event, StateName}}, Data}.
       
      -handle_info(Info, StateName, Data) ->
      -    {stop, {shutdown, {unexpected, Info, StateName}}, StateName, Data}.
      +handle_info(Info, StateName, Data) ->
      +    {stop, {shutdown, {unexpected, Info, StateName}}, StateName, Data}.
       -else.
      /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/gen_server.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (656))
      --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/gen_server.xhtml	2026-06-04 00:07:10.000000000 +0000
      +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/gen_server.xhtml	2042-07-06 13:26:37.000000000 +0000
      @@ -1158,15 +1158,15 @@
       but it may transform some values.

      Two possible use cases for this callback is to remove sensitive information from the state to prevent it from being printed in log files, or to compact large irrelevant status items -that would only clutter the logs.

      Example:

      format_status(Status) ->
      -  maps:map(
      -    fun(state,State) ->
      -            maps:remove(private_key, State);
      -       (message,{password, _Pass}) ->
      -            {password, removed};
      -       (_,Value) ->
      +that would only clutter the logs.

      Example:

      format_status(Status) ->
      +  maps:map(
      +    fun(state,State) ->
      +            maps:remove(private_key, State);
      +       (message,{password, _Pass}) ->
      +            {password, removed};
      +       (_,Value) ->
                   Value
      -    end, Status).

      Note

      This callback is optional, so callback modules need not export it. The + end, Status).

      Note

      This callback is optional, so callback modules need not export it. The gen_server module provides a default implementation of this function that returns the callback module state.

      If this callback is exported but fails, to hide possibly sensitive data, /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/gen_statem.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (956)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/gen_statem.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/gen_statem.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -71,7 +71,7 @@ depending on callback mode Release upgrade/downgrade -(code change) +(code change) -----> Module:code_change/4

      State callback

      The state callback for a specific state in a gen_statem is the callback function that is called for all events in this state. It is selected depending on which callback mode @@ -197,97 +197,97 @@ Pushbutton Code -

      The following is the complete callback module file pushbutton.erl:

      -module(pushbutton).
      --behaviour(gen_statem).
      +

      The following is the complete callback module file pushbutton.erl:

      -module(pushbutton).
      +-behaviour(gen_statem).
       
      --export([start/0,push/0,get_count/0,stop/0]).
      --export([terminate/3,code_change/4,init/1,callback_mode/0]).
      --export([on/3,off/3]).
      +-export([start/0,push/0,get_count/0,stop/0]).
      +-export([terminate/3,code_change/4,init/1,callback_mode/0]).
      +-export([on/3,off/3]).
       
      -name() -> pushbutton_statem. % The registered server name
      +name() -> pushbutton_statem. % The registered server name
       
       %% API.  This example uses a registered name name()
       %% and does not link to the caller.
      -start() ->
      -    gen_statem:start({local,name()}, ?MODULE, [], []).
      -push() ->
      -    gen_statem:call(name(), push).
      -get_count() ->
      -    gen_statem:call(name(), get_count).
      -stop() ->
      -    gen_statem:stop(name()).
      +start() ->
      +    gen_statem:start({local,name()}, ?MODULE, [], []).
      +push() ->
      +    gen_statem:call(name(), push).
      +get_count() ->
      +    gen_statem:call(name(), get_count).
      +stop() ->
      +    gen_statem:stop(name()).
       
       %% Mandatory callback functions
      -terminate(_Reason, _State, _Data) ->
      +terminate(_Reason, _State, _Data) ->
           void.
      -code_change(_Vsn, State, Data, _Extra) ->
      -    {ok,State,Data}.
      -init([]) ->
      +code_change(_Vsn, State, Data, _Extra) ->
      +    {ok,State,Data}.
      +init([]) ->
           %% Set the initial state + data.  Data is used only as a counter.
           State = off, Data = 0,
      -    {ok,State,Data}.
      -callback_mode() -> state_functions.
      +    {ok,State,Data}.
      +callback_mode() -> state_functions.
       
       %%% state callback(s)
       
      -off({call,From}, push, Data) ->
      +off({call,From}, push, Data) ->
           %% Go to 'on', increment count and reply
           %% that the resulting status is 'on'
      -    {next_state,on,Data+1,[{reply,From,on}]};
      -off(EventType, EventContent, Data) ->
      -    handle_event(EventType, EventContent, Data).
      +    {next_state,on,Data+1,[{reply,From,on}]};
      +off(EventType, EventContent, Data) ->
      +    handle_event(EventType, EventContent, Data).
       
      -on({call,From}, push, Data) ->
      +on({call,From}, push, Data) ->
           %% Go to 'off' and reply that the resulting status is 'off'
      -    {next_state,off,Data,[{reply,From,off}]};
      -on(EventType, EventContent, Data) ->
      -    handle_event(EventType, EventContent, Data).
      +    {next_state,off,Data,[{reply,From,off}]};
      +on(EventType, EventContent, Data) ->
      +    handle_event(EventType, EventContent, Data).
       
       %% Handle events common to all states
      -handle_event({call,From}, get_count, Data) ->
      +handle_event({call,From}, get_count, Data) ->
           %% Reply with the current count
      -    {keep_state,Data,[{reply,From,Data}]};
      -handle_event(_, _, Data) ->
      +    {keep_state,Data,[{reply,From,Data}]};
      +handle_event(_, _, Data) ->
           %% Ignore all other events
      -    {keep_state,Data}.

      The following is a shell session when running it:

      1> pushbutton:start().
      -{ok,<0.36.0>}
      -2> pushbutton:get_count().
      +    {keep_state,Data}.

      The following is a shell session when running it:

      1> pushbutton:start().
      +{ok,<0.36.0>}
      +2> pushbutton:get_count().
       0
      -3> pushbutton:push().
      +3> pushbutton:push().
       on
      -4> pushbutton:get_count().
      +4> pushbutton:get_count().
       1
      -5> pushbutton:push().
      +5> pushbutton:push().
       off
      -6> pushbutton:get_count().
      +6> pushbutton:get_count().
       1
      -7> pushbutton:stop().
      +7> pushbutton:stop().
       ok
      -8> pushbutton:push().
      +8> pushbutton:push().
       ** exception exit: {noproc,{gen_statem,call,[pushbutton_statem,push,infinity]}}
            in function  gen:do_for_proc/2 (gen.erl, line 261)
            in call from gen_statem:call/3 (gen_statem.erl, line 386)

      To compare styles, here follows the same example using callback mode handle_event_function, or rather, the code to replace after function init/1 -of the pushbutton.erl example file above:

      callback_mode() -> handle_event_function.
      +of the pushbutton.erl example file above:

      callback_mode() -> handle_event_function.
       
       %%% state callback(s)
       
      -handle_event({call,From}, push, off, Data) ->
      +handle_event({call,From}, push, off, Data) ->
           %% Go to 'on', increment count and reply
           %% that the resulting status is 'on'
      -    {next_state,on,Data+1,[{reply,From,on}]};
      -handle_event({call,From}, push, on, Data) ->
      +    {next_state,on,Data+1,[{reply,From,on}]};
      +handle_event({call,From}, push, on, Data) ->
           %% Go to 'off' and reply that the resulting status is 'off'
      -    {next_state,off,Data,[{reply,From,off}]};
      +    {next_state,off,Data,[{reply,From,off}]};
       %%
       %% Event handling common to all states
      -handle_event({call,From}, get_count, State, Data) ->
      +handle_event({call,From}, get_count, State, Data) ->
           %% Reply with the current count
      -    {next_state,State,Data,[{reply,From,Data}]};
      -handle_event(_, _, State, Data) ->
      +    {next_state,State,Data,[{reply,From,Data}]};
      +handle_event(_, _, State, Data) ->
           %% Ignore all other events
      -    {next_state,State,Data}.

      Note

      + {next_state,State,Data}.

      Note

      @@ -3056,15 +3056,15 @@ containing the same keys as the input map, but it may transform some values.

      One use case for this function is to return compact alternative state representations to avoid having large state terms printed in log files. -Another is to hide sensitive data from being written to the error log.

      Example:

      format_status(Status) ->
      -  maps:map(
      -    fun(state,State) ->
      -            maps:remove(private_key, State);
      -       (message,{password, _Pass}) ->
      -            {password, removed};
      -       (_,Value) ->
      +Another is to hide sensitive data from being written to the error log.

      Example:

      format_status(Status) ->
      +  maps:map(
      +    fun(state,State) ->
      +            maps:remove(private_key, State);
      +       (message,{password, _Pass}) ->
      +            {password, removed};
      +       (_,Value) ->
                   Value
      -    end, Status).

      Note

      This callback is optional, so a callback module does not need + end, Status).

      Note

      This callback is optional, so a callback module does not need to export it. The gen_statem module provides a default implementation of this function that returns {State, Data}.

      If this callback is exported but fails, to hide possibly sensitive data, the default function will instead return {State, Info}, @@ -3238,8 +3238,8 @@ to initialize the implementation state and server data.

      Args is the Args argument provided to that start function.

      Note

      Note that if the gen_statem is started through proc_lib and enter_loop/4,5,6, this callback will never be called. Since this callback is not optional -it can in that case be implemented as:

      -spec init(_) -> no_return().
      -init(Args) -> erlang:error(not_implemented, [Args]).
      +it can in that case be implemented as:

      -spec init(_) -> no_return().
      +init(Args) -> erlang:error(not_implemented, [Args]).

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/io_lib.xhtml differs (HTML document, ASCII text, with very long lines (1526)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/io_lib.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/io_lib.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -911,8 +911,8 @@ input is needed to complete the original format string. RestFormat is the remaining format string, Nchars is the number of characters scanned, and InputStack is the reversed list of inputs matched up to that point.

  • {error, What} - The read operation failed and parameter What gives a -hint about the error.

  • Example:

    3> io_lib:fread("~f~f~f", "15.6 17.3e-6 24.5").
    -{ok,[15.6,1.73e-5,24.5],[]}
    +hint about the error.

    Example:

    3> io_lib:fread("~f~f~f", "15.6 17.3e-6 24.5").
    +{ok,[15.6,1.73e-5,24.5],[]}
    @@ -1417,11 +1417,11 @@ "...".

    Depth defaults to -1, which means no limitation. Option CharsLimit puts a soft limit on the number of characters returned. When the number of characters is reached, remaining structures are replaced by "...". CharsLimit defaults to -1, -which means no limit on the number of characters returned.

    Example:

    1> lists:flatten(io_lib:write({1,[2],[3],[4,5],6,7,8,9})).
    +which means no limit on the number of characters returned.

    Example:

    1> lists:flatten(io_lib:write({1,[2],[3],[4,5],6,7,8,9})).
     "{1,[2],[3],[4,5],6,7,8,9}"
    -2> lists:flatten(io_lib:write({1,[2],[3],[4,5],6,7,8,9}, 5)).
    +2> lists:flatten(io_lib:write({1,[2],[3],[4,5],6,7,8,9}, 5)).
     "{1,[2],[3],[...],...}"
    -3> lists:flatten(io_lib:write({[1,2,3],[4,5],6,7,8,9}, [{chars_limit,20}])).
    +3> lists:flatten(io_lib:write({[1,2,3],[4,5],6,7,8,9}, [{chars_limit,20}])).
     "{[1,2|...],[4|...],...}"
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/io_protocol.xhtml differs (HTML document, ASCII text, with very long lines (977)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/io_protocol.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/io_protocol.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -41,8 +41,8 @@ Protocol Basics

    As described in Robert's paper, I/O servers and clients communicate using -io_request/io_reply tuples as follows:

    {io_request, From, ReplyAs, Request}
    -{io_reply, ReplyAs, Reply}

    The client sends an io_request tuple to the I/O server and the server +io_request/io_reply tuples as follows:

    {io_request, From, ReplyAs, Request}
    +{io_reply, ReplyAs, Reply}

    The client sends an io_request tuple to the I/O server and the server eventually sends a corresponding io_reply tuple.

    • From is the pid/0 of the client, the process which the I/O server sends the I/O reply to.

    • ReplyAs can be any datum and is returned in the corresponding io_reply. The io module monitors the I/O server and uses the monitor reference as @@ -59,8 +59,8 @@ Output Requests -

      To output characters on an I/O device, the following Requests exist:

      {put_chars, Encoding, Characters}
      -{put_chars, Encoding, Module, Function, Args}
      • Encoding is unicode or latin1, meaning that the characters are (in case +

        To output characters on an I/O device, the following Requests exist:

        {put_chars, Encoding, Characters}
        +{put_chars, Encoding, Module, Function, Args}
        • Encoding is unicode or latin1, meaning that the characters are (in case of binaries) encoded as UTF-8 or ISO Latin-1 (pure bytes). A well-behaved I/O server is also to return an error indication if list elements contain integers > 255 when Encoding is set to latin1.

          Notice that this does not in any way tell how characters are to be put on the @@ -86,7 +86,7 @@ Input Requests -

          To read characters from an I/O device, the following Requests exist:

          {get_until, Encoding, Prompt, Module, Function, ExtraArgs}
          • Encoding denotes how data is to be sent back to the client and what data is +

            To read characters from an I/O device, the following Requests exist:

            {get_until, Encoding, Prompt, Module, Function, ExtraArgs}
            • Encoding denotes how data is to be sent back to the client and what data is sent to the function denoted by Module/Function/ExtraArgs. If the function supplied returns data as a list, the data is converted to this encoding. If the function supplied returns data in some other format, no @@ -102,8 +102,8 @@ nothing being written to the I/O device).

            • Module, Function, and ExtraArgs denote a function and arguments to determine when enough data is written. The function is to take two more arguments, the last state, and a list of characters. The function is to return -one of:

              {done, Result, RestChars}
              -{more, Continuation}

              Result can be any Erlang term, but if it is a list/0, the I/O server can +one of:

              {done, Result, RestChars}
              +{more, Continuation}

              Result can be any Erlang term, but if it is a list/0, the I/O server can convert it to a binary/0 of appropriate format before returning it to the client, if the I/O server is set in binary mode (see below).

              The function is called with the data the I/O server finds on its I/O device, returning one of:

              • {done, Result, RestChars} when enough data is read. In this case Result @@ -113,28 +113,28 @@ characters are available. When no more characters are available, the function must return {done, eof, Rest}. The initial state is the empty list. The data when an end of file is reached on the IO device is the atom eof.

                An emulation of the get_line request can be (inefficiently) implemented -using the following functions:

                -module(demo).
                --export([until_newline/3, get_line/1]).
                +using the following functions:

                -module(demo).
                +-export([until_newline/3, get_line/1]).
                 
                -until_newline(_ThisFar,eof,_MyStopCharacter) ->
                -    {done,eof,[]};
                -until_newline(ThisFar,CharList,MyStopCharacter) ->
                +until_newline(_ThisFar,eof,_MyStopCharacter) ->
                +    {done,eof,[]};
                +until_newline(ThisFar,CharList,MyStopCharacter) ->
                     case
                -        lists:splitwith(fun(X) -> X =/= MyStopCharacter end,  CharList)
                +        lists:splitwith(fun(X) -> X =/= MyStopCharacter end,  CharList)
                     of
                -  {L,[]} ->
                -            {more,ThisFar++L};
                -  {L2,[MyStopCharacter|Rest]} ->
                -      {done,ThisFar++L2++[MyStopCharacter],Rest}
                +  {L,[]} ->
                +            {more,ThisFar++L};
                +  {L2,[MyStopCharacter|Rest]} ->
                +      {done,ThisFar++L2++[MyStopCharacter],Rest}
                     end.
                 
                -get_line(IoServer) ->
                -    IoServer ! {io_request,
                -                self(),
                +get_line(IoServer) ->
                +    IoServer ! {io_request,
                +                self(),
                                 IoServer,
                -                {get_until, unicode, '', ?MODULE, until_newline, [$\n]}},
                +                {get_until, unicode, '', ?MODULE, until_newline, [$\n]}},
                     receive
                -        {io_reply, IoServer, Data} ->
                +        {io_reply, IoServer, Data} ->
                       Data
                     end.

                Notice that the last element in the Request tuple ([$\n]) is appended to the argument list when the function is called. The function is to be called @@ -172,10 +172,10 @@ must be able to handle binary data. For convenience, the modes of an I/O server can be set and retrieved using the following I/O requests:

                {setopts, Opts}
                • Opts is a list of options in the format recognized by the proplists module (and by the I/O server).

                As an example, the I/O server for the interactive shell (in group.erl) -understands the following options:

                {binary, boolean()} (or binary/list)
                -{echo, boolean()}
                -{expand_fun, fun()}
                -{encoding, unicode/latin1} (or unicode/latin1)

                Options binary and encoding are common for all I/O servers in OTP, while +understands the following options:

                {binary, boolean()} (or binary/list)
                +{echo, boolean()}
                +{expand_fun, fun()}
                +{encoding, unicode/latin1} (or unicode/latin1)

                Options binary and encoding are common for all I/O servers in OTP, while echo and expand are valid only for this I/O server. Option unicode notifies how characters are put on the physical I/O device, that is, if the terminal itself is Unicode-aware. It does not affect how characters are sent in @@ -198,9 +198,9 @@ continue until one of the requests results in an error or the list is consumed. The result of the last request is sent back to the client.

              The I/O server can, for a list of requests, send any of the following valid results in the reply, depending on the requests in the list:

              ok
              -{ok, Data}
              -{ok, Options}
              -{error, Error}

              +{ok, Data} +{ok, Options} +{error, Error}

    @@ -230,128 +230,128 @@ process handling incoming requests, usually both I/O-requests and other I/O device-specific requests (positioning, closing, and so on).

    The example I/O server stores characters in an ETS table, making up a fairly crude RAM file.

    The module begins with the usual directives, a function to start the I/O server -and a main loop handling the requests:

    -module(ets_io_server).
    +and a main loop handling the requests:

    -module(ets_io_server).
     
    --export([start_link/0, init/0, loop/1, until_newline/3, until_enough/3]).
    +-export([start_link/0, init/0, loop/1, until_newline/3, until_enough/3]).
     
    --define(CHARS_PER_REC, 10).
    +-define(CHARS_PER_REC, 10).
     
    --record(state, {
    +-record(state, {
     	  table,
     	  position, % absolute
     	  mode % binary | list
    -	 }).
    +	 }).
     
    -start_link() ->
    -    spawn_link(?MODULE,init,[]).
    +start_link() ->
    +    spawn_link(?MODULE,init,[]).
     
    -init() ->
    -    Table = ets:new(noname,[ordered_set]),
    -    ?MODULE:loop(#state{table = Table, position = 0, mode=list}).
    +init() ->
    +    Table = ets:new(noname,[ordered_set]),
    +    ?MODULE:loop(#state{table = Table, position = 0, mode=list}).
     
    -loop(State) ->
    +loop(State) ->
         receive
    -	{io_request, From, ReplyAs, Request} ->
    -	    case request(Request,State) of
    -		{Tag, Reply, NewState} when Tag =:= ok; Tag =:= error ->
    -		    reply(From, ReplyAs, Reply),
    -		    ?MODULE:loop(NewState);
    -		{stop, Reply, _NewState} ->
    -		    reply(From, ReplyAs, Reply),
    -		    exit(Reply)
    +	{io_request, From, ReplyAs, Request} ->
    +	    case request(Request,State) of
    +		{Tag, Reply, NewState} when Tag =:= ok; Tag =:= error ->
    +		    reply(From, ReplyAs, Reply),
    +		    ?MODULE:loop(NewState);
    +		{stop, Reply, _NewState} ->
    +		    reply(From, ReplyAs, Reply),
    +		    exit(Reply)
     	    end;
     	%% Private message
    -	{From, rewind} ->
    -	    From ! {self(), ok},
    -	    ?MODULE:loop(State#state{position = 0});
    +	{From, rewind} ->
    +	    From ! {self(), ok},
    +	    ?MODULE:loop(State#state{position = 0});
     	_Unknown ->
    -	    ?MODULE:loop(State)
    +	    ?MODULE:loop(State)
         end.

    The main loop receives messages from the client (which can use the the io module to send requests). For each request, the function request/2 is called and a reply is eventually sent using function reply/3.

    The "private" message {From, rewind} results in the current position in the pseudo-file to be reset to 0 (the beginning of the "file"). This is a typical example of I/O device-specific messages not being part of the I/O protocol. It is usually a bad idea to embed such private messages in io_request tuples, as -that can confuse the reader.

    First, we examine the reply function:

    reply(From, ReplyAs, Reply) ->
    -    From ! {io_reply, ReplyAs, Reply}.

    It sends the io_reply tuple back to the client, providing element ReplyAs +that can confuse the reader.

    First, we examine the reply function:

    reply(From, ReplyAs, Reply) ->
    +    From ! {io_reply, ReplyAs, Reply}.

    It sends the io_reply tuple back to the client, providing element ReplyAs received in the request along with the result of the request, as described -earlier.

    We need to handle some requests. First the requests for writing characters:

    request({put_chars, Encoding, Chars}, State) ->
    -    put_chars(unicode:characters_to_list(Chars,Encoding),State);
    -request({put_chars, Encoding, Module, Function, Args}, State) ->
    +earlier.

    We need to handle some requests. First the requests for writing characters:

    request({put_chars, Encoding, Chars}, State) ->
    +    put_chars(unicode:characters_to_list(Chars,Encoding),State);
    +request({put_chars, Encoding, Module, Function, Args}, State) ->
         try
    -	request({put_chars, Encoding, apply(Module, Function, Args)}, State)
    +	request({put_chars, Encoding, apply(Module, Function, Args)}, State)
         catch
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/io.xhtml differs (HTML document, ASCII text, with very long lines (876))
    --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/io.xhtml	2026-06-04 00:07:10.000000000 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/io.xhtml	2042-07-06 13:26:37.000000000 +0000
    @@ -43,7 +43,7 @@
       Error Information
     

    The ErrorInfo mentioned in this module is the standard ErrorInfo structure -that is returned from all I/O modules. It has the following format:

    {ErrorLocation, Module, ErrorDescriptor}

    A string that describes the error is obtained with the following call:

    Module:format_error(ErrorDescriptor)
    +that is returned from all I/O modules. It has the following format:

    {ErrorLocation, Module, ErrorDescriptor}

    A string that describes the error is obtained with the following call:

    Module:format_error(ErrorDescriptor)
    @@ -1073,12 +1073,12 @@ no IoDevice argument is specified in the function calls in this module.

    It is sometimes desirable to use an explicit IoDevice argument that refers to the default I/O device. This is the case with functions that can access either a file or the default I/O device. The atom standard_io has this -special meaning. The following example illustrates this:

    27> io:read('enter>').
    +special meaning. The following example illustrates this:

    27> io:read('enter>').
     enter>foo.
    -{ok,foo}
    -28> io:read(standard_io, 'enter>').
    +{ok,foo}
    +28> io:read(standard_io, 'enter>').
     enter>bar.
    -{ok,bar}

    By default all I/O sent to standard_io will end up in the user +{ok,bar}

    By default all I/O sent to standard_io will end up in the user I/O device of the node that spawned the calling process.

    standard_io is an alias for group_leader/0, so in order to change where the default input/output requests are sent you can change the group leader of the current process using @@ -1348,33 +1348,33 @@ whitespace characters are stripped. An Erlang string (list of characters) is returned.

    If Unicode translation is in effect (~ts), characters > 255 are accepted, otherwise not. With the translation modifier, the returned list can as a -consequence also contain integers > 255:

    1> io:fread("Prompt> ","~s").
    +consequence also contain integers > 255:

    1> io:fread("Prompt> ","~s").
     Prompt> <Characters beyond latin1 range not printable in this medium>
    -{error,{fread,string}}
    -2> io:fread("Prompt> ","~ts").
    +{error,{fread,string}}
    +2> io:fread("Prompt> ","~ts").
     Prompt> <Characters beyond latin1 range not printable in this medium>
    -{ok,[[1091,1085,1080,1094,1086,1076,1077]]}
  • a - Similar to s, but the resulting string is converted into an +{ok,[[1091,1085,1080,1094,1086,1076,1077]]}

  • a - Similar to s, but the resulting string is converted into an atom.

  • c - The number of characters equal to the field width are read (default is 1) and returned as an Erlang string. However, leading and trailing whitespace characters are not omitted as they are with s. All -characters are returned.

    The Unicode translation modifier works as with s:

    1> io:fread("Prompt> ","~c").
    +characters are returned.

    The Unicode translation modifier works as with s:

    1> io:fread("Prompt> ","~c").
     Prompt> <Character beyond latin1 range not printable in this medium>
    -{error,{fread,string}}
    -2> io:fread("Prompt> ","~tc").
    +{error,{fread,string}}
    +2> io:fread("Prompt> ","~tc").
     Prompt> <Character beyond latin1 range not printable in this medium>
    -{ok,[[1091]]}
  • l - Returns the number of characters that have been scanned up to that +{ok,[[1091]]}

  • l - Returns the number of characters that have been scanned up to that point, including whitespace characters.

  • The function returns:
    • {ok, Terms} - The read was successful and Terms is the list of successfully matched and read items.

    • eof - End of file was encountered.

    • {error, FreadError} - The reading failed and FreadError gives a hint about the error.

    • {error, ErrorDescription} - The read operation failed and parameter -ErrorDescription gives a hint about the error.

    Examples:

    20> io:fread('enter>', "~f~f~f").
    +ErrorDescription gives a hint about the error.

    Examples:

    20> io:fread('enter>', "~f~f~f").
     enter>1.9 35.5e3 15.0
    -{ok,[1.9,3.55e4,15.0]}
    -21> io:fread('enter>', "~10f~d").
    +{ok,[1.9,3.55e4,15.0]}
    +21> io:fread('enter>', "~10f~d").
     enter>     5.67899
    -{ok,[5.678,99]}
    -22> io:fread('enter>', ":~10s:~10c:").
    +{ok,[5.678,99]}
    +22> io:fread('enter>', ":~10s:~10c:").
     enter>:   alan   :   joe    :
    -{ok, ["alan", "   joe    "]}
    +
    {ok, ["alan", " joe "]}
    @@ -1463,7 +1463,7 @@ the output device, and control sequences for formatting, see below. If Format is an atom or a binary, it is first converted to a list with the aid of atom_to_list/1 or -binary_to_list/1. Example:

    1> io:fwrite("Hello world!~n", []).
    +binary_to_list/1. Example:

    1> io:fwrite("Hello world!~n", []).
     Hello world!
     ok

    The general format of a control sequence is ~F.P.PadModC.

    The character C determines the type of control sequence to be used. It is the only required field. All of F, P, Pad, and Mod are optional. For @@ -1481,25 +1481,25 @@ padding character is ' ' (space).

  • Mod is the control sequence modifier. This is one or more characters that change the interpretation of Data.

    The current modifiers are:

    • t - For Unicode translation.

    • l - For stopping p and P from detecting printable characters.

    • k - For use with p, P, w, and W to format maps in map-key ordered order (see maps:iterator_order/0).

    • K - Similar to k, for formatting maps in map-key order, but takes an -extra argument that specifies the maps:iterator_order/0.

      For example:

      > M = #{ a => 1, b => 2 }.
      -#{a => 1,b => 2}
      -> io:format("~Kp~n", [reversed, M]).
      -#{b => 2,a => 1}
      +extra argument that specifies the maps:iterator_order/0.

      For example:

      > M = #{ a => 1, b => 2 }.
      +#{a => 1,b => 2}
      +> io:format("~Kp~n", [reversed, M]).
      +#{b => 2,a => 1}
       ok
  • If F, P, or Pad is a * character, the next argument in Data is used as -the value. For example:

    1> io:fwrite("~*.*.0f~n",[9, 5, 3.14159265]).
    +the value. For example:

    1> io:fwrite("~*.*.0f~n",[9, 5, 3.14159265]).
     003.14159
    -ok

    To use a literal * character as Pad, it must be passed as an argument:

    2> io:fwrite("~*.*.*f~n",[9, 5, $*, 3.14159265]).
    +ok

    To use a literal * character as Pad, it must be passed as an argument:

    2> io:fwrite("~*.*.*f~n",[9, 5, $*, 3.14159265]).
     **3.14159
     ok

    Available control sequences:

    • ~ - Character ~ is written.

    • c - The argument is a number that is interpreted as an ASCII code. The precision is the number of times the character is printed and defaults to the -field width, which in turn defaults to 1. Example:

      1> io:fwrite("|~10.5c|~-10.5c|~5c|~n", [$a, $b, $c]).
      +field width, which in turn defaults to 1. Example:

      1> io:fwrite("|~10.5c|~-10.5c|~5c|~n", [$a, $b, $c]).
       |     aaaaa|bbbbb     |ccccc|
       ok

      If the Unicode translation modifier (t) is in effect, the integer argument can be any number representing a valid Unicode codepoint, otherwise it is to -be an integer less than or equal to 255, otherwise it is masked with 16#FF:

      2> io:fwrite("~tc~n",[1024]).
      -\x{400}
      +be an integer less than or equal to 255, otherwise it is masked with 16#FF:

      2> io:fwrite("~tc~n",[1024]).
      +\x{400}
       ok
      -3> io:fwrite("~c~n",[1024]).
      +3> io:fwrite("~c~n",[1024]).
       ^@
       ok
    • f - The argument is a float that is written as [-]ddd.ddd, where the precision is the number of digits after the decimal point. The default @@ -1517,18 +1517,18 @@ binaries are in UTF-8. The characters are printed without quotes. The string is first truncated by the specified precision and then padded and justified to the specified field width. The default precision is the field width.

      This format can be used for printing any object and truncating the output so -it fits a specified field:

      1> io:fwrite("|~10w|~n", [{hey, hey, hey}]).
      +it fits a specified field:

      1> io:fwrite("|~10w|~n", [{hey, hey, hey}]).
       |**********|
       ok
      -2> io:fwrite("|~10s|~n", [io_lib:write({hey, hey, hey})]).
      -|{hey,hey,h|
      -3> io:fwrite("|~-10.8s|~n", [io_lib:write({hey, hey, hey})]).
      -|{hey,hey  |
      +2> io:fwrite("|~10s|~n", [io_lib:write({hey, hey, hey})]).
      +|{hey,hey,h|
      +3> io:fwrite("|~-10.8s|~n", [io_lib:write({hey, hey, hey})]).
      +|{hey,hey  |
       ok

      A list with integers > 255 is considered an error if the Unicode translation -modifier is not specified:

      4> io:fwrite("~ts~n",[[1024]]).
      -\x{400}
      +modifier is not specified:

      4> io:fwrite("~ts~n",[[1024]]).
      +\x{400}
       ok
      -5> io:fwrite("~s~n",[[1024]]).
      +5> io:fwrite("~s~n",[[1024]]).
       ** exception error: bad argument
            in function  io:format/3
               called as io:format(<0.53.0>,"~s~n",[[1024]])
    • w - Writes data with the standard syntax. This is used to output Erlang @@ -1539,122 +1539,122 @@ breaks terms whose printed representation is longer than one line into many lines and indents each line sensibly. Left-justification is not supported. It also tries to detect flat lists of printable characters and output these as -strings. For example:

      1> T = [{attributes,[[{id,age,1.50000},{mode,explicit},
      -{typename,"INTEGER"}], [{id,cho},{mode,explicit},{typename,'Cho'}]]},
      -{typename,'Person'},{tag,{'PRIVATE',3}},{mode,implicit}].
      +strings. For example:

      1> T = [{attributes,[[{id,age,1.50000},{mode,explicit},
      +{typename,"INTEGER"}], [{id,cho},{mode,explicit},{typename,'Cho'}]]},
      +{typename,'Person'},{tag,{'PRIVATE',3}},{mode,implicit}].
       ...
      -2> io:fwrite("~w~n", [T]).
      -[{attributes,[[{id,age,1.5},{mode,explicit},{typename,
      -[73,78,84,69,71,69,82]}],[{id,cho},{mode,explicit},{typena
      -me,'Cho'}]]},{typename,'Person'},{tag,{'PRIVATE',3}},{mode
      -,implicit}]
      +2> io:fwrite("~w~n", [T]).
      +[{attributes,[[{id,age,1.5},{mode,explicit},{typename,
      +[73,78,84,69,71,69,82]}],[{id,cho},{mode,explicit},{typena
      +me,'Cho'}]]},{typename,'Person'},{tag,{'PRIVATE',3}},{mode
      +,implicit}]
       ok
      -3> io:fwrite("~62p~n", [T]).
      -[{attributes,[[{id,age,1.5},
      -               {mode,explicit},
      -               {typename,"INTEGER"}],
      -              [{id,cho},{mode,explicit},{typename,'Cho'}]]},
      - {typename,'Person'},
      - {tag,{'PRIVATE',3}},
      - {mode,implicit}]
      +3> io:fwrite("~62p~n", [T]).
      +[{attributes,[[{id,age,1.5},
      +               {mode,explicit},
      +               {typename,"INTEGER"}],
      +              [{id,cho},{mode,explicit},{typename,'Cho'}]]},
      + {typename,'Person'},
      + {tag,{'PRIVATE',3}},
      + {mode,implicit}]
       ok

      The field width specifies the maximum line length. It defaults to 80. The precision specifies the initial indentation of the term. It defaults to the number of characters printed on this line in the same call to write/1 or -format/1,2,3. For example, using T above:

      4> io:fwrite("Here T = ~62p~n", [T]).
      -Here T = [{attributes,[[{id,age,1.5},
      -                        {mode,explicit},
      -                        {typename,"INTEGER"}],
      -                       [{id,cho},
      -                        {mode,explicit},
      -                        {typename,'Cho'}]]},
      -          {typename,'Person'},
      -          {tag,{'PRIVATE',3}},
      -          {mode,implicit}]
      +format/1,2,3. For example, using T above:

      4> io:fwrite("Here T = ~62p~n", [T]).
      /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/json.xhtml differs (HTML document, ASCII text, with very long lines (1547))
      --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/json.xhtml	2026-06-04 00:07:10.000000000 +0000
      +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/json.xhtml	2042-07-06 13:26:37.000000000 +0000
      @@ -870,8 +870,8 @@
         
         Example
       
      -
      > json:decode(<<"{\"foo\": 1}">>).
      -#{<<"foo">> => 1}
      +
      > json:decode(<<"{\"foo\": 1}">>).
      +#{<<"foo">> => 1}
    @@ -923,9 +923,9 @@ Example -

    Decoding object keys as atoms:

    > Push = fun(Key, Value, Acc) -> [{binary_to_existing_atom(Key), Value} | Acc] end.
    -> json:decode(<<"{\"foo\": 1}">>, ok, #{object_push => Push}).
    -{#{foo => 1},ok,<<>>}
    +

    Decoding object keys as atoms:

    > Push = fun(Key, Value, Acc) -> [{binary_to_existing_atom(Key), Value} | Acc] end.
    +> json:decode(<<"{\"foo\": 1}">>, ok, #{object_push => Push}).
    +{#{foo => 1},ok,<<>>}
    @@ -958,11 +958,11 @@

    Continue parsing a stream of bytes of a JSON value.

    Similar to decode_start/3, if the function returns {continue, State} and -there is no more data, use end_of_input instead of a binary.

    > {continue, State} = json:decode_start(<<"{\"foo\":">>, ok, #{}).
    -> json:decode_continue(<<"1}">>, State).
    -{#{foo => 1},ok,<<>>}
    > {continue, State} = json:decode_start(<<"123">>, ok, #{}).
    -> json:decode_continue(end_of_input, State).
    -{123,ok,<<>>}
    +there is no more data, use end_of_input instead of a binary.

    > {continue, State} = json:decode_start(<<"{\"foo\":">>, ok, #{}).
    +> json:decode_continue(<<"1}">>, State).
    +{#{foo => 1},ok,<<>>}
    > {continue, State} = json:decode_start(<<"123">>, ok, #{}).
    +> json:decode_continue(end_of_input, State).
    +{123,ok,<<>>}
    @@ -1032,7 +1032,7 @@ Examples -
    > iolist_to_binary(json:encode(#{foo => <<"bar">>})).
    +
    > iolist_to_binary(json:encode(#{foo => <<"bar">>})).
     <<"{\"foo\":\"bar\"}">>
    @@ -1074,10 +1074,10 @@ Examples

    An encoder that uses a heuristic to differentiate object-like -lists of key-value pairs from plain lists:

    > encoder([{_, _} | _] = Value, Encode) -> json:encode_key_value_list(Value, Encode);
    -> encoder(Other, Encode) -> json:encode_value(Other, Encode).
    -> custom_encode(Value) -> json:encode(Value, fun(Value, Encode) -> encoder(Value, Encode) end).
    -> iolist_to_binary(custom_encode([{a, []}, {b, 1}])).
    +lists of key-value pairs from plain lists:

    > encoder([{_, _} | _] = Value, Encode) -> json:encode_key_value_list(Value, Encode);
    +> encoder(Other, Encode) -> json:encode_value(Other, Encode).
    +> custom_encode(Value) -> json:encode(Value, fun(Value, Encode) -> encoder(Value, Encode) end).
    +> iolist_to_binary(custom_encode([{a, []}, {b, 1}])).
     <<"{\"a\":[],\"b\":1}">>
    @@ -1469,11 +1469,11 @@ -

    Generates formatted JSON corresponding to Term.

    Similiar to encode/1 but with added whitespaces for formatting.

    > io:put_chars(json:format(#{foo => <<"bar">>, baz => 52})).
    -{
    +

    Generates formatted JSON corresponding to Term.

    Similiar to encode/1 but with added whitespaces for formatting.

    > io:put_chars(json:format(#{foo => <<"bar">>, baz => 52})).
    +{
       "baz": 52,
       "foo": "bar"
    -}
    +}
     ok
    @@ -1538,20 +1538,20 @@

    Generates formatted JSON corresponding to Term.

    Similar to encode/2, can be customised with the Encoder callback and Options.

    Options can include 'indent' to specify number of spaces per level and 'max' which loosely limits the width of lists.

    The Encoder will get a 'State' argument which contains the 'Options' maps merged with other data when recursing through 'Term'.

    format_value/3 or various encode_* functions in this module can be used -to help in constructing such callbacks.

    > formatter({posix_time, SysTimeSecs}, Encode, State) ->
    -    TimeStr = calendar:system_time_to_rfc3339(SysTimeSecs, [{offset, "Z"}]),
    -    json:format_value(unicode:characters_to_binary(TimeStr), Encode, State);
    -> formatter(Other, Encode, State) -> json:format_value(Other, Encode, State).
    +to help in constructing such callbacks.

    > formatter({posix_time, SysTimeSecs}, Encode, State) ->
    +    TimeStr = calendar:system_time_to_rfc3339(SysTimeSecs, [{offset, "Z"}]),
    +    json:format_value(unicode:characters_to_binary(TimeStr), Encode, State);
    +> formatter(Other, Encode, State) -> json:format_value(Other, Encode, State).
     >
    -> Fun = fun(Value, Encode, State) -> formatter(Value, Encode, State) end.
    -> Options = #{indent => 4}.
    -> Term = #{id => 1, time => {posix_time, erlang:system_time(seconds)}}.
    +> Fun = fun(Value, Encode, State) -> formatter(Value, Encode, State) end.
    +> Options = #{indent => 4}.
    +> Term = #{id => 1, time => {posix_time, erlang:system_time(seconds)}}.
     >
    -> io:put_chars(json:format(Term, Fun, Options)).
    -{
    +> io:put_chars(json:format(Term, Fun, Options)).
    +{
         "id": 1,
         "time": "2024-05-23T16:07:48Z"
    -}
    +}
     ok
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/lists.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (1478)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/lists.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/lists.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -1051,8 +1051,8 @@ -

    Returns a list in which all the sublists of ListOfLists have been appended.

    Example:

    > lists:append([[1, 2, 3], [a, b], [4, 5, 6]]).
    -[1,2,3,a,b,4,5,6]
    +

    Returns a list in which all the sublists of ListOfLists have been appended.

    Example:

    > lists:append([[1, 2, 3], [a, b], [4, 5, 6]]).
    +[1,2,3,a,b,4,5,6]
    @@ -1081,7 +1081,7 @@

    Returns a new list List3, which is made from the elements of List1 followed -by the elements of List2.

    Example:

    > lists:append("abc", "def").
    +by the elements of List2.

    Example:

    > lists:append("abc", "def").
     "abcdef"

    lists:append(A, B) is equivalent to A ++ B.

    @@ -1112,7 +1112,7 @@

    Concatenates the text representation of the elements of Things. The elements -of Things can be atoms, integers, floats, or strings.

    Example:

    > lists:concat([doc, '/', file, '.', 3]).
    +of Things can be atoms, integers, floats, or strings.

    Example:

    > lists:concat([doc, '/', file, '.', 3]).
     "doc/file.3"
    @@ -1231,8 +1231,8 @@ -

    Returns a list containing N copies of term Elem.

    Example:

    > lists:duplicate(5, xx).
    -[xx,xx,xx,xx,xx]
    +

    Returns a list containing N copies of term Elem.

    Example:

    > lists:duplicate(5, xx).
    +[xx,xx,xx,xx,xx]
    @@ -1333,12 +1333,12 @@

    Returns List1 with each element H replaced by a tuple of form {I, H} where I is the position of H in List1. The enumeration starts with Index and increases by Step in each step.

    That is, enumerate/3 behaves as if it had been defined as -follows:

    enumerate(I, S, List) ->
    -  {List1, _ } = lists:mapfoldl(fun(T, Acc) -> {{Acc, T}, Acc+S} end, I, List),
    -  List1.

    The default values for Index and Step are both 1.

    Examples:

    > lists:enumerate([a,b,c]).
    -[{1,a},{2,b},{3,c}]
    > lists:enumerate(10, [a,b,c]).
    -[{10,a},{11,b},{12,c}]
    > lists:enumerate(0, -2, [a,b,c]).
    -[{0,a},{-2,b},{-4,c}]
    +follows:

    enumerate(I, S, List) ->
    +  {List1, _ } = lists:mapfoldl(fun(T, Acc) -> {{Acc, T}, Acc+S} end, I, List),
    +  List1.

    The default values for Index and Step are both 1.

    Examples:

    > lists:enumerate([a,b,c]).
    +[{1,a},{2,b},{3,c}]
    > lists:enumerate(10, [a,b,c]).
    +[{10,a},{11,b},{12,c}]
    > lists:enumerate(0, -2, [a,b,c]).
    +[{0,a},{-2,b},{-4,c}]
    @@ -1407,15 +1407,15 @@

    Calls Fun(Elem) on successive elements Elem of List1 in order to update or remove elements from List1.

    Fun/1 must return either a Boolean or a tuple {true, Value}. The function returns the list of elements for which Fun returns a new value, where a value -of true is synonymous with {true, Elem}.

    That is, filtermap behaves as if it had been defined as follows:

    filtermap(Fun, List1) ->
    -    lists:foldr(fun(Elem, Acc) ->
    -                       case Fun(Elem) of
    +of true is synonymous with {true, Elem}.

    That is, filtermap behaves as if it had been defined as follows:

    filtermap(Fun, List1) ->
    +    lists:foldr(fun(Elem, Acc) ->
    +                       case Fun(Elem) of
                                false -> Acc;
    -                           true -> [Elem|Acc];
    -                           {true,Value} -> [Value|Acc]
    +                           true -> [Elem|Acc];
    +                           {true,Value} -> [Value|Acc]
                            end
    -                end, [], List1).

    Example:

    > lists:filtermap(fun(X) -> case X rem 2 of 0 -> {true, X div 2}; _ -> false end end, [1,2,3,4,5]).
    -[1,2]
    +
    end, [], List1).

    Example:

    > lists:filtermap(fun(X) -> case X rem 2 of 0 -> {true, X div 2}; _ -> false end end, [1,2,3,4,5]).
    +[1,2]
    @@ -1474,9 +1474,9 @@

    Takes a function from As to lists of Bs, and a list of As (List1) and produces a list of Bs by applying the function to every element in List1 and -appending the resulting lists.

    That is, flatmap behaves as if it had been defined as follows:

    flatmap(Fun, List1) ->
    -    append(map(Fun, List1)).

    Example:

    > lists:flatmap(fun(X)->[X,X] end, [a,b,c]).
    -[a,a,b,b,c,c]
    +appending the resulting lists.

    That is, flatmap behaves as if it had been defined as follows:

    flatmap(Fun, List1) ->
    +    append(map(Fun, List1)).

    Example:

    > lists:flatmap(fun(X)->[X,X] end, [a,b,c]).
    +[a,a,b,b,c,c]
    @@ -1572,9 +1572,9 @@

    Calls Fun(Elem, AccIn) on successive elements A of List, starting with AccIn == Acc0. Fun/2 must return a new accumulator, which is passed to the next call. The function returns the final value of the accumulator. Acc0 is -returned if the list is empty.

    Example:

    > lists:foldl(fun(X, Sum) -> X + Sum end, 0, [1,2,3,4,5]).
    +returned if the list is empty.

    Example:

    > lists:foldl(fun(X, Sum) -> X + Sum end, 0, [1,2,3,4,5]).
     15
    -> lists:foldl(fun(X, Prod) -> X * Prod end, 1, [1,2,3,4,5]).
    +> lists:foldl(fun(X, Prod) -> X * Prod end, 1, [1,2,3,4,5]).
     120
    @@ -1611,11 +1611,11 @@ -

    Like foldl/3, but the list is traversed from right to left.

    Example:

    > P = fun(A, AccIn) -> io:format("~p ", [A]), AccIn end.
    +

    Like foldl/3, but the list is traversed from right to left.

    Example:

    > P = fun(A, AccIn) -> io:format("~p ", [A]), AccIn end.
     #Fun<erl_eval.12.2225172>
    -> lists:foldl(P, void, [1,2,3]).
    +> lists:foldl(P, void, [1,2,3]).
     1 2 3 void
    -> lists:foldr(P, void, [1,2,3]).
    +> lists:foldr(P, void, [1,2,3]).
     3 2 1 void

    foldl/3 is tail recursive and is usually preferred to foldr/3.

    @@ -1678,12 +1678,12 @@

    Inserts Sep between each element in List1. Has no effect on the empty list -and on a singleton list. For example:

    > lists:join(x, [a,b,c]).
    -[a,x,b,x,c]
    -> lists:join(x, [a]).
    -[a]
    -> lists:join(x, []).
    -[]
    +and on a singleton list. For example:

    > lists:join(x, [a,b,c]).
    +[a,x,b,x,c]
    +> lists:join(x, [a]).
    +[a]
    +> lists:join(x, []).
    +[]
    @@ -1784,10 +1784,10 @@

    Returns a list of tuples where, for each tuple in TupleList1, the Nth element Term1 of the tuple has been replaced with the result of calling -Fun(Term1).

    Examples:

    > Fun = fun(Atom) -> atom_to_list(Atom) end.
    +Fun(Term1).

    Examples:

    > Fun = fun(Atom) -> atom_to_list(Atom) end.
     #Fun<erl_eval.6.10732646>
    -2> lists:keymap(Fun, 2, [{name,jane,22},{name,lizzie,20},{name,lydia,15}]).
    -[{name,"jane",22},{name,"lizzie",20},{name,"lydia",15}]
    +2>
    lists:keymap(Fun, 2, [{name,jane,22},{name,lizzie,20},{name,lydia,15}]). +[{name,"jane",22},{name,"lizzie",20},{name,"lydia",15}]
    @@ -2128,9 +2128,9 @@ -

    Combines the operations of map/2 and foldl/3 into one pass.

    Example:

    Summing the elements in a list and double them at the same time:

    > lists:mapfoldl(fun(X, Sum) -> {2*X, X+Sum} end,
    -0, [1,2,3,4,5]).
    -{[2,4,6,8,10],15}
    +

    Combines the operations of map/2 and foldl/3 into one pass.

    Example:

    Summing the elements in a list and double them at the same time:

    > lists:mapfoldl(fun(X, Sum) -> {2*X, X+Sum} end,
    +0, [1,2,3,4,5]).
    +{[2,4,6,8,10],15}
    @@ -2422,7 +2422,7 @@ -

    Returns the Nth element of List.

    Example:

    > lists:nth(3, [a, b, c, d, e]).
    +

    Returns the Nth element of List.

    Example:

    > lists:nth(3, [a, b, c, d, e]).
     c
    @@ -2452,14 +2452,14 @@

    Returns the Nth tail of List, that is, the sublist of List starting at -N+1 and continuing up to the end of the list.

    Example

    > lists:nthtail(3, [a, b, c, d, e]).
    -[d,e]
    -> tl(tl(tl([a, b, c, d, e]))).
    -[d,e]
    -> lists:nthtail(0, [a, b, c, d, e]).
    -[a,b,c,d,e]
    -> lists:nthtail(5, [a, b, c, d, e]).
    -[]
    +N+1 and continuing up to the end of the list.

    Example

    > lists:nthtail(3, [a, b, c, d, e]).
    +[d,e]
    +> tl(tl(tl([a, b, c, d, e]))).
    +[d,e]
    +> lists:nthtail(0, [a, b, c, d, e]).
    +[a,b,c,d,e]
    +> lists:nthtail(5, [a, b, c, d, e]).
    +[]
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/maps.xhtml differs (HTML document, ASCII text, with very long lines (1832)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/maps.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/maps.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -624,10 +624,10 @@

    Returns a map Map for which predicate Pred holds true in MapOrIter.

    The call fails with a {badmap,Map} exception if MapOrIter is not a map or -valid iterator, or with badarg if Pred is not a function of arity 2.

    Example:

    > M = #{a => 2, b => 3, c=> 4, "a" => 1, "b" => 2, "c" => 4},
    -  Pred = fun(K,V) -> is_atom(K) andalso (V rem 2) =:= 0 end,
    -  maps:filter(Pred,M).
    -#{a => 2,c => 4}
    +valid iterator, or with badarg if Pred is not a function of arity 2.

    Example:

    > M = #{a => 2, b => 3, c=> 4, "a" => 1, "b" => 2, "c" => 4},
    +  Pred = fun(K,V) -> is_atom(K) andalso (V rem 2) =:= 0 end,
    +  maps:filter(Pred,M).
    +#{a => 2,c => 4}
    @@ -666,10 +666,10 @@ map. If it returns false, the association is not copied. If it returns {true, NewValue}, the value for Key is replaced with NewValue in the result map.

    The call fails with a {badmap,Map} exception if MapOrIter is not a map or -valid iterator, or with badarg if Fun is not a function of arity 2.

    Example:

    > Fun = fun(K,V) when is_atom(K) -> {true, V*2}; (_,V) -> (V rem 2) =:= 0 end,
    -  Map = #{k1 => 1, "k2" => 2, "k3" => 3},
    -  maps:filtermap(Fun,Map).
    -#{k1 => 2,"k2" => 2}
    +valid iterator, or with badarg if Fun is not a function of arity 2.

    Example:

    > Fun = fun(K,V) when is_atom(K) -> {true, V*2}; (_,V) -> (V rem 2) =:= 0 end,
    +  Map = #{k1 => 1, "k2" => 2, "k3" => 3},
    +  maps:filtermap(Fun,Map).
    +#{k1 => 2,"k2" => 2}
    @@ -700,10 +700,10 @@

    Returns a tuple {ok, Value}, where Value is the value associated with Key, -or error if no value is associated with Key in Map.

    The call fails with a {badmap,Map} exception if Map is not a map.

    Example:

    > Map = #{"hi" => 42},
    +or error if no value is associated with Key in Map.

    The call fails with a {badmap,Map} exception if Map is not a map.

    Example:

    > Map = #{"hi" => 42},
       Key = "hi",
    -  maps:find(Key,Map).
    -{ok,42}
    +
    maps:find(Key,Map). +{ok,42}
    @@ -744,9 +744,9 @@ which is passed to the next successive call. This function returns the final value of the accumulator. The initial accumulator value Init is returned if the map is empty.

    The call fails with a {badmap,Map} exception if MapOrIter is not a map or -valid iterator, or with badarg if Fun is not a function of arity 3.

    Example:

    > Fun = fun(K,V,AccIn) when is_list(K) -> AccIn + V end,
    -  Map = #{"k1" => 1, "k2" => 2, "k3" => 3},
    -  maps:fold(Fun,0,Map).
    +valid iterator, or with badarg if Fun is not a function of arity 3.

    Example:

    > Fun = fun(K,V,AccIn) when is_list(K) -> AccIn + V end,
    +  Map = #{"k1" => 1, "k2" => 2, "k3" => 3},
    +  maps:fold(Fun,0,Map).
     6
    @@ -813,8 +813,8 @@

    Takes a list of keys and a value and builds a map where all keys point to the -same value. The key can be in any order, and keys and value can be of any term.

    Example:

    > Keys = ["a", "b", "c"], maps:from_keys(Keys, ok).
    -#{"a" => ok,"b" => ok,"c" => ok}
    +same value. The key can be in any order, and keys and value can be of any term.

    Example:

    > Keys = ["a", "b", "c"], maps:from_keys(Keys, ok).
    +#{"a" => ok,"b" => ok,"c" => ok}
    @@ -846,9 +846,9 @@

    Takes a list of key-value tuples elements and builds a map. The associations can be in any order, and both keys and values in the association can be of any term.

    If the same key appears more than once, the latter (right-most) value is used -and the previous values are ignored.

    Example:

    > List = [{"a",ignored},{1337,"value two"},{42,value_three},{"a",1}],
    -  maps:from_list(List).
    -#{42 => value_three,1337 => "value two","a" => 1}
    +and the previous values are ignored.

    Example:

    > List = [{"a",ignored},{1337,"value two"},{42,value_three},{"a",1}],
    +  maps:from_list(List).
    +#{42 => value_three,1337 => "value two","a" => 1}
    @@ -880,8 +880,8 @@

    Returns value Value associated with Key if Map contains Key.

    The call fails with a {badmap,Map} exception if Map is not a map, or with a {badkey,Key} exception if no value is associated with Key.

    Example:

    > Key = 1337,
    -  Map = #{42 => value_two,1337 => "value one","a" => 1},
    -  maps:get(Key,Map).
    +  Map = #{42 => value_two,1337 => "value one","a" => 1},
    +  maps:get(Key,Map).
     "value one"
    @@ -913,11 +913,11 @@

    Returns value Value associated with Key if Map contains Key. If no value -is associated with Key, Default is returned.

    The call fails with a {badmap,Map} exception if Map is not a map.

    Example:

    > Map = #{ key1 => val1, key2 => val2 }.
    -#{key1 => val1,key2 => val2}
    -> maps:get(key1, Map, "Default value").
    +is associated with Key, Default is returned.

    The call fails with a {badmap,Map} exception if Map is not a map.

    Example:

    > Map = #{ key1 => val1, key2 => val2 }.
    +#{key1 => val1,key2 => val2}
    +> maps:get(key1, Map, "Default value").
     val1
    -> maps:get(key3, Map, "Default value").
    +> maps:get(key3, Map, "Default value").
     "Default value"
    @@ -957,11 +957,11 @@

    Partitions the given List into a map of groups.

    The result is a map where each key is given by KeyFun and each value is a list of elements from the given List for which KeyFun returned the same key.

    The order of elements within each group list is preserved from the original -list.

    Examples:

    > EvenOdd = fun(X) -> case X rem 2 of 0 -> even; 1 -> odd end end,
    -maps:groups_from_list(EvenOdd, [1, 2, 3]).
    -#{even => [2], odd => [1, 3]}
    -> maps:groups_from_list(fun erlang:length/1, ["ant", "buffalo", "cat", "dingo"]).
    -#{3 => ["ant", "cat"], 5 => ["dingo"], 7 => ["buffalo"]}
    +list.

    Examples:

    > EvenOdd = fun(X) -> case X rem 2 of 0 -> even; 1 -> odd end end,
    +maps:groups_from_list(EvenOdd, [1, 2, 3]).
    +#{even => [2], odd => [1, 3]}
    +> maps:groups_from_list(fun erlang:length/1, ["ant", "buffalo", "cat", "dingo"]).
    +#{3 => ["ant", "cat"], 5 => ["dingo"], 7 => ["buffalo"]}
    @@ -1003,15 +1003,15 @@

    Partitions the given List into a map of groups.

    The result is a map where each key is given by KeyFun and each value is a list of elements from the given List, mapped via ValueFun, for which KeyFun returned the same key.

    The order of elements within each group list is preserved from the original -list.

    Examples:

    > EvenOdd = fun(X) -> case X rem 2 of 0 -> even; 1 -> odd end end,
    -> Square = fun(X) -> X * X end,
    -> maps:groups_from_list(EvenOdd, Square, [1, 2, 3]).
    -#{even => [4], odd => [1, 9]}
    -> maps:groups_from_list(
    +list.

    Examples:

    > EvenOdd = fun(X) -> case X rem 2 of 0 -> even; 1 -> odd end end,
    +> Square = fun(X) -> X * X end,
    +> maps:groups_from_list(EvenOdd, Square, [1, 2, 3]).
    +#{even => [4], odd => [1, 9]}
    +> maps:groups_from_list(
         fun erlang:length/1,
         fun lists:reverse/1,
    -    ["ant", "buffalo", "cat", "dingo"]).
    -#{3 => ["tna", "tac"],5 => ["ognid"],7 => ["olaffub"]}
    +
    ["ant", "buffalo", "cat", "dingo"]). +#{3 => ["tna", "tac"],5 => ["ognid"],7 => ["olaffub"]}
    @@ -1043,10 +1043,10 @@

    Intersects two maps into a single map Map3. If a key exists in both maps, the -value in Map1 is superseded by the value in Map2.

    The call fails with a {badmap,Map} exception if Map1 or Map2 is not a map.

    Example:

    > Map1 = #{a => "value_one", b => "value_two"},
    -  Map2 = #{a => 1, c => 2},
    -  maps:intersect(Map1,Map2).
    -#{a => 1}
    +value in Map1 is superseded by the value in Map2.

    The call fails with a {badmap,Map} exception if Map1 or Map2 is not a map.

    Example:

    > Map1 = #{a => "value_one", b => "value_two"},
    +  Map2 = #{a => 1, c => 2},
    +  maps:intersect(Map1,Map2).
    +#{a => 1}
    @@ -1086,10 +1086,10 @@ the value from Map1 is the second parameter, and the value from Map2 is the third parameter.

    The call fails with a {badmap,Map} exception if Map1 or Map2 is not a map. The call fails with a badarg exception if Combiner is not a fun that takes -three arguments.

    Example:

    > Map1 = #{a => "value_one", b => "value_two"},
    -  Map2 = #{a => 1, c => 2},
    -  maps:intersect_with(fun(_Key, Value1, Value2) -> {Value1, Value2} end, Map1, Map2).
    -#{a => {"value_one",1}}
    +three arguments.

    Example:

    > Map1 = #{a => "value_one", b => "value_two"},
    +  Map2 = #{a => 1, c => 2},
    +  maps:intersect_with(fun(_Key, Value1, Value2) -> {Value1, Value2} end, Map1, Map2).
    +#{a => {"value_one",1}}
    @@ -1120,11 +1120,11 @@

    Returns true if map Map contains Key and returns false if it does not -contain the Key.

    The call fails with a {badmap,Map} exception if Map is not a map.

    Example:

    > Map = #{"42" => value}.
    -#{"42" => value}
    -> maps:is_key("42",Map).
    +contain the Key.

    The call fails with a {badmap,Map} exception if Map is not a map.

    Example:

    > Map = #{"42" => value}.
    +#{"42" => value}
    +> maps:is_key("42",Map).
     true
    -> maps:is_key(value,Map).
    +> maps:is_key(value,Map).
     false
    @@ -1157,15 +1157,15 @@

    Returns a map iterator Iterator that can be used by maps:next/1 to traverse the key-value associations in a map. When iterating over a map, the /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/ms_transform.xhtml differs (HTML document, ASCII text, with very long lines (2060)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/ms_transform.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/ms_transform.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -49,31 +49,31 @@ table and construct a list of tuples containing relevant parts of the data in these rows. One can use ets:foldl/3 instead, but the ets:select/2 call is far more efficient. Without the translation provided by ms_transform, one must -struggle with writing match specifications terms to accommodate this.

    Consider a simple table of employees:

    -record(emp, {empno,     %Employee number as a string, the key
    +struggle with writing match specifications terms to accommodate this.

    Consider a simple table of employees:

    -record(emp, {empno,     %Employee number as a string, the key
                   surname,   %Surname of the employee
                   givenname, %Given name of employee
                   dept,      %Department, one of {dev,sales,prod,adm}
    -              empyear}). %Year the employee was employed

    We create the table using:

    ets:new(emp_tab, [{keypos,#emp.empno},named_table,ordered_set]).

    We fill the table with randomly chosen data:

    [{emp,"011103","Black","Alfred",sales,2000},
    - {emp,"041231","Doe","John",prod,2001},
    - {emp,"052341","Smith","John",dev,1997},
    - {emp,"076324","Smith","Ella",sales,1995},
    - {emp,"122334","Weston","Anna",prod,2002},
    - {emp,"535216","Chalker","Samuel",adm,1998},
    - {emp,"789789","Harrysson","Joe",adm,1996},
    - {emp,"963721","Scott","Juliana",dev,2003},
    - {emp,"989891","Brown","Gabriel",prod,1999}]

    Assuming that we want the employee numbers of everyone in the sales department, -there are several ways.

    ets:match/2 can be used:

    1> ets:match(emp_tab, {'_', '$1', '_', '_', sales, '_'}).
    -[["011103"],["076324"]]

    ets:match/2 uses a simpler type of match specification, but it is still + empyear}). %Year the employee was employed

    We create the table using:

    ets:new(emp_tab, [{keypos,#emp.empno},named_table,ordered_set]).

    We fill the table with randomly chosen data:

    [{emp,"011103","Black","Alfred",sales,2000},
    + {emp,"041231","Doe","John",prod,2001},
    + {emp,"052341","Smith","John",dev,1997},
    + {emp,"076324","Smith","Ella",sales,1995},
    + {emp,"122334","Weston","Anna",prod,2002},
    + {emp,"535216","Chalker","Samuel",adm,1998},
    + {emp,"789789","Harrysson","Joe",adm,1996},
    + {emp,"963721","Scott","Juliana",dev,2003},
    + {emp,"989891","Brown","Gabriel",prod,1999}]

    Assuming that we want the employee numbers of everyone in the sales department, +there are several ways.

    ets:match/2 can be used:

    1> ets:match(emp_tab, {'_', '$1', '_', '_', sales, '_'}).
    +[["011103"],["076324"]]

    ets:match/2 uses a simpler type of match specification, but it is still unreadable, and one has little control over the returned result. It is always a -list of lists.

    ets:foldl/3 or ets:foldr/3 can be used to avoid the nested lists:

    ets:foldr(fun(#emp{empno = E, dept = sales},Acc) -> [E | Acc];
    -             (_,Acc) -> Acc
    +list of lists.

    ets:foldl/3 or ets:foldr/3 can be used to avoid the nested lists:

    ets:foldr(fun(#emp{empno = E, dept = sales},Acc) -> [E | Acc];
    +             (_,Acc) -> Acc
               end,
    -          [],
    -          emp_tab).

    The result is ["011103","076324"]. The fun is straightforward, so the only + [], + emp_tab).

    The result is ["011103","076324"]. The fun is straightforward, so the only problem is that all the data from the table must be transferred from the table to the calling process for filtering. That is inefficient compared to the ets:match/2 call where the filtering can be done "inside" the emulator and -only the result is transferred to the process.

    Consider a "pure" ets:select/2 call that does what ets:foldr does:

    ets:select(emp_tab, [{#emp{empno = '$1', dept = sales, _='_'},[],['$1']}]).

    Although the record syntax is used, it is still hard to read and even harder to +only the result is transferred to the process.

    Consider a "pure" ets:select/2 call that does what ets:foldr does:

    ets:select(emp_tab, [{#emp{empno = '$1', dept = sales, _='_'},[],['$1']}]).

    Although the record syntax is used, it is still hard to read and even harder to write. The first element of the tuple, #emp{empno = '$1', dept = sales, _='_'}, tells what to match. Elements not matching this are not returned, as in the ets:match/2 example. The second @@ -84,12 +84,12 @@ hence the employee number is returned. The result is ["011103","076324"], as in the ets:foldr/3 example, but the result is retrieved much more efficiently in terms of execution speed and memory consumption.

    Using ets:fun2ms/1, we can combine the ease of use of the ets:foldr/3 and -the efficiency of the pure ets:select/2 example:

    -include_lib("stdlib/include/ms_transform.hrl").
    +the efficiency of the pure ets:select/2 example:

    -include_lib("stdlib/include/ms_transform.hrl").
     
    -ets:select(emp_tab, ets:fun2ms(
    -                      fun(#emp{empno = E, dept = sales}) ->
    +ets:select(emp_tab, ets:fun2ms(
    +                      fun(#emp{empno = E, dept = sales}) ->
                                   E
    -                      end)).

    This example requires no special knowledge of match specifications to + end)).

    This example requires no special knowledge of match specifications to understand. The head of the fun matches what you want to filter out and the body returns what you want returned. As long as the fun can be kept within the limits of the match specifications, there is no need to transfer all table data to the @@ -111,22 +111,22 @@

    Assume that we want to get all the employee numbers of employees hired before year 2000. Using ets:match/2 is not an alternative here, as relational operators cannot be expressed there. Once again, ets:foldr/3 can do it -(slowly, but correct):

    ets:foldr(fun(#emp{empno = E, empyear = Y},Acc) when Y < 2000 -> [E | Acc];
    -                  (_,Acc) -> Acc
    +(slowly, but correct):

    ets:foldr(fun(#emp{empno = E, empyear = Y},Acc) when Y < 2000 -> [E | Acc];
    +                  (_,Acc) -> Acc
               end,
    -          [],
    -          emp_tab).

    The result is ["052341","076324","535216","789789","989891"], as expected. The + [], + emp_tab).

    The result is ["052341","076324","535216","789789","989891"], as expected. The equivalent expression using a handwritten match specification would look like -this:

    ets:select(emp_tab, [{#emp{empno = '$1', empyear = '$2', _='_'},
    -                     [{'<', '$2', 2000}],
    -                     ['$1']}]).

    This gives the same result. [{'<', '$2', 2000}] is in the guard part and +this:

    ets:select(emp_tab, [{#emp{empno = '$1', empyear = '$2', _='_'},
    +                     [{'<', '$2', 2000}],
    +                     ['$1']}]).

    This gives the same result. [{'<', '$2', 2000}] is in the guard part and therefore discards anything that does not have an empyear (bound to '$2' in -the head) less than 2000, as the guard in the foldr/3 example.

    We write it using ets:fun2ms/1:

    -include_lib("stdlib/include/ms_transform.hrl").
    +the head) less than 2000, as the guard in the foldr/3 example.

    We write it using ets:fun2ms/1:

    -include_lib("stdlib/include/ms_transform.hrl").
     
    -ets:select(emp_tab, ets:fun2ms(
    -                      fun(#emp{empno = E, empyear = Y}) when Y < 2000 ->
    +ets:select(emp_tab, ets:fun2ms(
    +                      fun(#emp{empno = E, empyear = Y}) when Y < 2000 ->
                                E
    -                      end)).

    + end)).

    @@ -134,11 +134,11 @@

    Assume that we want the whole object matching instead of only one element. One alternative is to assign a variable to every part of the record and build it up -once again in the body of the fun, but the following is easier:

    ets:select(emp_tab, ets:fun2ms(
    -                      fun(Obj = #emp{empno = E, empyear = Y})
    +once again in the body of the fun, but the following is easier:

    ets:select(emp_tab, ets:fun2ms(
    +                      fun(Obj = #emp{empno = E, empyear = Y})
                              when Y < 2000 ->
                                   Obj
    -                      end)).

    As in ordinary Erlang matching, you can bind a variable to the whole matched + end)).

    As in ordinary Erlang matching, you can bind a variable to the whole matched object using a "match inside the match", that is, a =. Unfortunately in funs translated to match specifications, it is allowed only at the "top-level", that is, matching the whole object arriving to be matched into a separate variable. @@ -153,10 +153,10 @@

    This example concerns the body of the fun. Assume that all employee numbers beginning with zero (0) must be changed to begin with one (1) instead, and -that we want to create the list [{<Old empno>,<New empno>}]:

    ets:select(emp_tab, ets:fun2ms(
    -                      fun(#emp{empno = [$0 | Rest] }) ->
    -                              {[$0|Rest],[$1|Rest]}
    -                      end)).

    This query hits the feature of partially bound keys in table type ordered_set, +that we want to create the list [{<Old empno>,<New empno>}]:

    ets:select(emp_tab, ets:fun2ms(
    +                      fun(#emp{empno = [$0 | Rest] }) ->
    +                              {[$0|Rest],[$1|Rest]}
    +                      end)).

    This query hits the feature of partially bound keys in table type ordered_set, so that not the whole table needs to be searched, only the part containing keys beginning with 0 is looked into.

    @@ -169,24 +169,24 @@ {rookie, <employee number>}.
  • For all other employees, return {newbie, <employee number>}, except for those named Smith as they would be affronted by anything other than the tag guru and that is also what is returned for their numbers: -{guru, <employee number>}.
  • This is accomplished as follows:

    ets:select(emp_tab, ets:fun2ms(
    -                      fun(#emp{empno = E, surname = "Smith" }) ->
    -                              {guru,E};
    -                         (#emp{empno = E, empyear = Y}) when Y < 1997  ->
    -                              {inventory, E};
    -                         (#emp{empno = E, empyear = Y}) when Y > 2001  ->
    -                              {newbie, E};
    -                         (#emp{empno = E, empyear = Y}) -> % 1997 -- 2001
    -                              {rookie, E}
    -                      end)).

    The result is as follows:

    [{rookie,"011103"},
    - {rookie,"041231"},
    - {guru,"052341"},
    - {guru,"076324"},
    - {newbie,"122334"},
    - {rookie,"535216"},
    - {inventory,"789789"},
    - {newbie,"963721"},
    - {rookie,"989891"}]

    +{guru, <employee number>}.

    This is accomplished as follows:

    ets:select(emp_tab, ets:fun2ms(
    +                      fun(#emp{empno = E, surname = "Smith" }) ->
    +                              {guru,E};
    +                         (#emp{empno = E, empyear = Y}) when Y < 1997  ->
    +                              {inventory, E};
    +                         (#emp{empno = E, empyear = Y}) when Y > 2001  ->
    +                              {newbie, E};
    +                         (#emp{empno = E, empyear = Y}) -> % 1997 -- 2001
    +                              {rookie, E}
    +                      end)).

    The result is as follows:

    [{rookie,"011103"},
    + {rookie,"041231"},
    + {guru,"052341"},
    + {guru,"076324"},
    + {newbie,"122334"},
    + {rookie,"535216"},
    + {inventory,"789789"},
    + {newbie,"963721"},
    + {rookie,"989891"}]

    @@ -233,18 +233,18 @@ more, as filtering using Erlang code is not a good idea when tracing (except afterwards, if you trace to file). The concept is similar to that of ets:fun2ms/1 except that you usually use it directly from the shell (which can -also be done with ets:fun2ms/1).

    The following is an example module to trace on:

    -module(toy).
    +also be done with ets:fun2ms/1).

    The following is an example module to trace on:

    -module(toy).
     
    --export([start/1, store/2, retrieve/1]).
    +-export([start/1, store/2, retrieve/1]).
     
    -start(Args) ->
    -    toy_table = ets:new(toy_table, Args).
    +start(Args) ->
    +    toy_table = ets:new(toy_table, Args).
     
    -store(Key, Value) ->
    -    ets:insert(toy_table, {Key,Value}).
    +store(Key, Value) ->
    +    ets:insert(toy_table, {Key,Value}).
     
    -retrieve(Key) ->
    -    [{Key, Value}] = ets:lookup(toy_table, Key),
    +retrieve(Key) ->
    +    [{Key, Value}] = ets:lookup(toy_table, Key),
         Value.

    During model testing, the first test results in {badmatch,16} in /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/notes.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (3348)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/notes.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/notes.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -97,8 +97,8 @@ Improvements and New Features

    • The functions is_equal/2, map/2, and filtermap/2 have been added to the modules sets, ordsets, and gb_sets.

      Own Id: OTP-18622 Aux Id: PR-7183, PR-7232

    • The compiler now emits nicer error message for function head mismatches. -For example, given:

      a() -> ok;
      -a(_) -> error.

      Erlang/OTP 26 and earlier would emit a diagnostic similar to:

      t.erl:6:1: head mismatch
      +For example, given:

      a() -> ok;
      +a(_) -> error.

      Erlang/OTP 26 and earlier would emit a diagnostic similar to:

      t.erl:6:1: head mismatch
       %    6| a(_) -> error.
       %     | ^

      while in Erlang/OTP 27 the diagnostic is similar to:

      t.erl:6:1: head mismatch: function a with arities 0 and 1 is regarded as two distinct functions. Is the number of arguments incorrect or is the semicolon in a/0 unwanted?
       %    6| a(_) -> error.
      @@ -131,12 +131,12 @@
       shell:prompt_width/1 have been exported to help with custom prompt implementations.

      Own Id: OTP-18834 Aux Id: PR-7675

    • The shell now pages long output from the documentation help command (h(Module)), auto completions and the search command.

      Own Id: OTP-18846 Aux Id: PR-7845

    • The M-h hotkey (Alt/Option-h) now outputs help for the module or function directly before the cursor.

      Own Id: OTP-18847 Aux Id: PR-7846

    • Added support for adding a custom code formatter that formats your multi-line shell commands in your preferred formatting on submission. See shell:format_shell_func/ and shell:erl_pp_format_func/1.

      Own Id: OTP-18848 Aux Id: PR-7847

    • Added shell functions for viewing, forgetting and saving locally defined functions, types and records.

      Own Id: OTP-18852 Aux Id: PR-7844

    • Added string:jaro_similarity/2, which can be used to calculate the similarity between two strings.

      Own Id: OTP-18865 Aux Id: PR-7879

    • The new function ets:update_element/4 is similar to ets:update_element/3, but takes a default tuple as the fourth argument, which will be inserted if no previous record with that key exists.

      Own Id: OTP-18870 Aux Id: PR-7857

    • Added functions to retrieve the next higher or lower key/element from gb_trees and gb_sets, as well as returning iterators that start at given keys/elements.

      Own Id: OTP-18874 Aux Id: PR-7745

    • When the shell built-in function c/1,2 is used to re-compile a module, the current working directory of the original compilation is now added to the include path.

      Own Id: OTP-18908 Aux Id: PR-7957

    • The timer module now uses a private table for its internal state, slightly improving its performance.

      Own Id: OTP-18914 Aux Id: PR-7973

    • EEP-59 - Documentation Attributes has been implemented.

      Documentation attributes can be used to document functions, types, callbacks, and modules. The keyword -moduledoc "Documentation here". is used to document modules, while -doc "Documentation here". can be used on top of functions, types, and callbacks to document them, respectively.

      • Types, callbacks, and function documentation can be set to hidden either via -doc false or -doc hidden. When documentation attributes mark a type as hidden, they will not be part of the documentation.

      • The documentation from moduledoc and doc gets added by default to the binary beam file, following the format of EEP-48.

      • Using the compiler flag warn_missing_doc will raise a warning when -doc attributes are missing in exported functions, types, and callbacks.

      • Using the compiler flag warn_missing_spec_documented will raise a warning when -spec attributes are missing in documented functions, types, and callbacks.

      • moduledocs and docs may refer to external files to be embedded, such as -doc {file, "README.md"}., which refers to the file README.md found in the current working directory.

      • The compiler warns about exported functions whose specs refer to hidden types. Thus, there will be warnings when a hidden type (meaning, the type is not part of the documentation) gets used in an exported function.

      Own Id: OTP-18916 Aux Id: PR-7936

    • New ets functions ets:first_lookup/1, ets:next_lookup/2, ets:prev_lookup/2 and ets:last_lookup/1. Example: ets:next_lookup/1 is equivalent to ets:next/2 followed by ets:lookup/2 with the next key. The new combined functions are more efficient and with guaranteed atomicity.

      Own Id: OTP-18923 Aux Id: PR-6791

    • The maybe expression is now enabled by default.

      To use maybe as an atom, it needs to be single-quoted. Alternatively, the maybe expression can be disabled by disabling the maybe_expr feature. That can be done by placing the following the line at the beginning of an Erlang source file:

      -feature(maybe_expr, disable).

      Another way to disable the maybe_expr feature is by passing the -disable-feature option to erlc:

      erlc -disable-feature maybe_expr some_file.erl

      Own Id: OTP-18944 Aux Id: PR-8067

    • The compiler will now raise a warning when updating record/map literals. As an example, consider this module:

      -module(t).
      --export([f/0]).
      --record(r, {a,b,c}).
      +spec attributes are missing in documented functions, types, and callbacks.

    • moduledocs and docs may refer to external files to be embedded, such as -doc {file, "README.md"}., which refers to the file README.md found in the current working directory.

    • The compiler warns about exported functions whose specs refer to hidden types. Thus, there will be warnings when a hidden type (meaning, the type is not part of the documentation) gets used in an exported function.

    Own Id: OTP-18916 Aux Id: PR-7936

  • New ets functions ets:first_lookup/1, ets:next_lookup/2, ets:prev_lookup/2 and ets:last_lookup/1. Example: ets:next_lookup/1 is equivalent to ets:next/2 followed by ets:lookup/2 with the next key. The new combined functions are more efficient and with guaranteed atomicity.

    Own Id: OTP-18923 Aux Id: PR-6791

  • The maybe expression is now enabled by default.

    To use maybe as an atom, it needs to be single-quoted. Alternatively, the maybe expression can be disabled by disabling the maybe_expr feature. That can be done by placing the following the line at the beginning of an Erlang source file:

    -feature(maybe_expr, disable).

    Another way to disable the maybe_expr feature is by passing the -disable-feature option to erlc:

    erlc -disable-feature maybe_expr some_file.erl

    Own Id: OTP-18944 Aux Id: PR-8067

  • The compiler will now raise a warning when updating record/map literals. As an example, consider this module:

    -module(t).
    +-export([f/0]).
    +-record(r, {a,b,c}).
     
    -f() ->
    -    #r{a=1}#r{b=2}.

    The compiler raises the following warning:

    1> c(t).
    +f() ->
    +    #r{a=1}#r{b=2}.

    The compiler raises the following warning:

    1> c(t).
     t.erl:6:12: Warning: expression updates a literal
     %    6|     #r{a=1}#r{b=2}.
     %     |            ^

    Own Id: OTP-18951 Aux Id: PR-8069

  • The documentation has been migrated to use Markdown and ExDoc.

    Own Id: OTP-18955 Aux Id: PR-8026

  • Optimized ets:foldl and ets:foldr to use new ets:next_lookup. Also made them immune against table renaming.

    Own Id: OTP-18993 Aux Id: PR-8048

  • Windows now supports all functions in math.

    Own Id: OTP-19001 Aux Id: PR-8164

  • erl_lint (and by extension the compiler) will now warn for code using deprecated callbacks.

    The only callback currenly deprecated is format_status/2 in gen_server, gen_event and gen_statem.

    You can use nowarn_deprecated_callback to silence the warning.

    Own Id: OTP-19010 Aux Id: PR-8205

  • There is a new module json for encoding and decoding JSON.

    Both encoding and decoding can be customized. Decoding can be done in a SAX-like fashion and handle multiple documents and streams of data.

    Own Id: OTP-19020 Aux Id: PR-8111

  • /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/orddict.xhtml differs (HTML document, ASCII text, with very long lines (1551)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/orddict.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/orddict.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -37,13 +37,13 @@

    Functions append/3 and append_list/3 are included so that keyed values can be stored in a list accumulator, for -example:

    > D0 = orddict:new(),
    -  D1 = orddict:store(files, [], D0),
    -  D2 = orddict:append(files, f1, D1),
    -  D3 = orddict:append(files, f2, D2),
    -  D4 = orddict:append(files, f3, D3),
    -  orddict:fetch(files, D4).
    -[f1,f2,f3]

    This saves the trouble of first fetching a keyed value, appending a new value to +example:

    > D0 = orddict:new(),
    +  D1 = orddict:store(files, [], D0),
    +  D2 = orddict:append(files, f1, D1),
    +  D3 = orddict:append(files, f2, D2),
    +  D4 = orddict:append(files, f3, D3),
    +  orddict:fetch(files, D4).
    +[f1,f2,f3]

    This saves the trouble of first fetching a keyed value, appending a new value to the list of stored values, and storing the result.

    Function fetch/2 is to be used if the key is known to be in the dictionary, otherwise function find/2.

    @@ -416,16 +416,16 @@

    Appends a new Value to the current list of values associated with Key. An exception is generated if the initial value associated with Key is not a list -of values.

    See also section Notes.

    Example 1:

    1> OrdDict1 = orddict:from_list([{x, []}]).
    -[{x,[]}]
    -2> OrdDict2 = orddict:append(x, 1, OrdDict1).
    -[{x,[1]}]
    -3> OrdDict3 = orddict:append(x, 2, OrdDict2).
    -[{x,[1,2]}]
    -4> orddict:append(y, 3, OrdDict3).
    -[{x,[1,2]},{y,[3]}]

    Example 2:

    1> OrdDict1 = orddict:from_list([{a, no_list}]).
    -[{a,no_list}]
    -2> orddict:append(a, 1, OrdDict1).
    +of values.

    See also section Notes.

    Example 1:

    1> OrdDict1 = orddict:from_list([{x, []}]).
    +[{x,[]}]
    +2> OrdDict2 = orddict:append(x, 1, OrdDict1).
    +[{x,[1]}]
    +3> OrdDict3 = orddict:append(x, 2, OrdDict2).
    +[{x,[1,2]}]
    +4> orddict:append(y, 3, OrdDict3).
    +[{x,[1,2]},{y,[3]}]

    Example 2:

    1> OrdDict1 = orddict:from_list([{a, no_list}]).
    +[{a,no_list}]
    +2> orddict:append(a, 1, OrdDict1).
     ** exception error: bad argument
          in operator  ++/2
             called as no_list ++ [1]
    @@ -462,12 +462,12 @@

    Appends a list of values ValList to the current list of values associated with Key. An exception is generated if the initial value associated with Key is -not a list of values.

    See also section Notes.

    Example:

    1> OrdDict1 = orddict:from_list([{x, []}]).
    -[{x,[]}]
    -2> OrdDict2 = orddict:append_list(x, [1,2], OrdDict1).
    -[{x,[1,2]}]
    -3> OrdDict3 = orddict:append_list(y, [3,4], OrdDict2).
    -[{x,[1,2]},{y,[3,4]}]
    +not a list of values.

    See also section Notes.

    Example:

    1> OrdDict1 = orddict:from_list([{x, []}]).
    +[{x,[]}]
    +2> OrdDict2 = orddict:append_list(x, [1,2], OrdDict1).
    +[{x,[1,2]}]
    +3> OrdDict3 = orddict:append_list(y, [3,4], OrdDict2).
    +[{x,[1,2]},{y,[3,4]}]
    @@ -496,10 +496,10 @@ -

    Erases all items with a specified key from a dictionary.

    Example:

    1> OrdDict1 = orddict:from_list([{a, 1}, {b, 2}]).
    -[{a,1},{b,2}]
    -2> orddict:erase(a, OrdDict1).
    -[{b,2}]
    +

    Erases all items with a specified key from a dictionary.

    Example:

    1> OrdDict1 = orddict:from_list([{a, 1}, {b, 2}]).
    +[{a,1},{b,2}]
    +2> orddict:erase(a, OrdDict1).
    +[{b,2}]
    @@ -529,11 +529,11 @@

    Returns the value associated with Key in dictionary Orddict. This function assumes that the Key is present in the dictionary. An exception is generated -if Key is not in the dictionary.

    See also section Notes.

    Example:

    1> OrdDict1 = orddict:from_list([{a, 1}, {b, 2}]).
    -[{a,1},{b,2}]
    -2> orddict:fetch(a, OrdDict1).
    +if Key is not in the dictionary.

    See also section Notes.

    Example:

    1> OrdDict1 = orddict:from_list([{a, 1}, {b, 2}]).
    +[{a,1},{b,2}]
    +2> orddict:fetch(a, OrdDict1).
     1
    -3> orddict:fetch(missing, OrdDict1).
    +3> orddict:fetch(missing, OrdDict1).
     ** exception error: no function clause matching orddict:fetch(missing,[])
    @@ -562,10 +562,10 @@ -

    Returns a list of all keys in a dictionary.

    Example:

    1> OrdDict1 = orddict:from_list([{a, 1}, {b, 2}]).
    -[{a,1},{b,2}]
    -2> orddict:fetch_keys(OrdDict1).
    -[a,b]
    +

    Returns a list of all keys in a dictionary.

    Example:

    1> OrdDict1 = orddict:from_list([{a, 1}, {b, 2}]).
    +[{a,1},{b,2}]
    +2> orddict:fetch_keys(OrdDict1).
    +[a,b]
    @@ -598,10 +598,10 @@

    Orddict2 is a dictionary of all keys and values in Orddict1 for which -Pred(Key, Value) is true.

    Example:

    1> OrdDict1 = orddict:from_list([{a, 1}, {b, 2}]).
    -[{a,1},{b,2}]
    -2> orddict:filter(fun (K, V) -> V > 1 end, OrdDict1).
    -[{b,2}]
    +Pred(Key, Value) is true.

    Example:

    1> OrdDict1 = orddict:from_list([{a, 1}, {b, 2}]).
    +[{a,1},{b,2}]
    +2> orddict:filter(fun (K, V) -> V > 1 end, OrdDict1).
    +[{b,2}]
    @@ -631,11 +631,11 @@

    Searches for a key in a dictionary. Returns {ok, Value}, where Value is the value associated with Key, or error if the key is not present in the -dictionary.

    See also section Notes.

    Example:

    1> OrdDict1 = orddict:from_list([{a, 1}, {b, 2}]).
    -[{a,1},{b,2}]
    -2> orddict:find(a, OrdDict1).
    -{ok,1}
    -3> orddict:find(c, OrdDict1).
    +dictionary.

    See also section Notes.

    Example:

    1> OrdDict1 = orddict:from_list([{a, 1}, {b, 2}]).
    +[{a,1},{b,2}]
    +2> orddict:find(a, OrdDict1).
    +{ok,1}
    +3> orddict:find(c, OrdDict1).
     error
    @@ -673,10 +673,10 @@

    Calls Fun on successive keys and values of Orddict together with an extra argument Acc (short for accumulator). Fun must return a new accumulator that -is passed to the next call. Acc0 is returned if the list is empty.

    Example:

    1> OrdDict1 = orddict:from_list([{a, 1}, {b, 2}]).
    -[{a,1},{b,2}]
    -2> orddict:fold(fun (K, V, Acc) -> [{K, V+100} | Acc] end, [], OrdDict1).
    -[{b,102},{a,101}]
    +is passed to the next call. Acc0 is returned if the list is empty.

    Example:

    1> OrdDict1 = orddict:from_list([{a, 1}, {b, 2}]).
    +[{a,1},{b,2}]
    +2> orddict:fold(fun (K, V, Acc) -> [{K, V+100} | Acc] end, [], OrdDict1).
    +[{b,102},{a,101}]
    @@ -795,10 +795,10 @@

    Calls Fun on successive keys and values of Orddict1 to return a new value -for each key.

    Example:

    1> OrdDict1 = orddict:from_list([{a, 1}, {b, 2}]).
    -[{a,1},{b,2}]
    -2> orddict:map(fun (_K, V) -> V + 100 end, OrdDict1).
    -[{a,101},{b,102}]
    +for each key.

    Example:

    1> OrdDict1 = orddict:from_list([{a, 1}, {b, 2}]).
    +[{a,1},{b,2}]
    +2> orddict:map(fun (_K, V) -> V + 100 end, OrdDict1).
    +[{a,101},{b,102}]
    @@ -834,15 +834,15 @@

    Merges two dictionaries, Orddict1 and Orddict2, to create a new dictionary. All the Key-Value pairs from both dictionaries are included in the new dictionary.

    If a key occurs in both dictionaries, Fun is called with the key -and both values to return a new value.

    merge/3 can be defined as follows, but is faster:

    merge(Fun, D1, D2) ->
    -    fold(fun (K, V1, D) ->
    -                 update(K, fun (V2) -> Fun(K, V1, V2) end, V1, D)
    -         end, D2, D1).

    Example:

    1> OrdDict1 = orddict:from_list([{a, 1}, {b, 2}]).
    -[{a,1},{b,2}]
    -2> OrdDict2 = orddict:from_list([{b, 7}, {c, 8}]).
    -[{b,7},{c,8}]
    -3> orddict:merge(fun (K, V1, V2) -> V1 * V2 end, OrdDict1, OrdDict2).
    -[{a,1},{b,14},{c,8}]
    +and both values to return a new value.

    merge/3 can be defined as follows, but is faster:

    merge(Fun, D1, D2) ->
    +    fold(fun (K, V1, D) ->
    +                 update(K, fun (V2) -> Fun(K, V1, V2) end, V1, D)
    +         end, D2, D1).

    Example:

    1> OrdDict1 = orddict:from_list([{a, 1}, {b, 2}]).
    +[{a,1},{b,2}]
    +2> OrdDict2 = orddict:from_list([{b, 7}, {c, 8}]).
    +[{b,7},{c,8}]
    +3> orddict:merge(fun (K, V1, V2) -> V1 * V2 end, OrdDict1, OrdDict2).
    +[{a,1},{b,14},{c,8}]
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/peer.xhtml differs (HTML document, ASCII text, with very long lines (1109)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/peer.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/peer.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -56,127 +56,127 @@ manual analysis. If the test case fails, the CRASH REPORT contains these arguments
  • multiple test cases can run concurrently speeding up overall testing process, peer node names are unique even when there are multiple instances of the same -test suite running in parallel
  • -module(my_SUITE).
    --behaviour(ct_suite).
    --export([all/0, groups/0]).
    --export([basic/1, args/1, named/1, restart_node/1, multi_node/1]).
    +test suite running in parallel
    -module(my_SUITE).
    +-behaviour(ct_suite).
    +-export([all/0, groups/0]).
    +-export([basic/1, args/1, named/1, restart_node/1, multi_node/1]).
     
    --include_lib("common_test/include/ct.hrl").
    +-include_lib("common_test/include/ct.hrl").
     
    -groups() ->
    -    [{quick, [parallel],
    -        [basic, args, named, restart_node, multi_node]}].
    +groups() ->
    +    [{quick, [parallel],
    +        [basic, args, named, restart_node, multi_node]}].
     
    -all() ->
    -    [{group, quick}].
    +all() ->
    +    [{group, quick}].
     
    -basic(Config) when is_list(Config) ->
    -    {ok, Peer, _Node} = ?CT_PEER(),
    -    peer:stop(Peer).
    +basic(Config) when is_list(Config) ->
    +    {ok, Peer, _Node} = ?CT_PEER(),
    +    peer:stop(Peer).
     
    -args(Config) when is_list(Config) ->
    +args(Config) when is_list(Config) ->
         %% specify additional arguments to the new node
    -    {ok, Peer, _Node} = ?CT_PEER(["-emu_flavor", "smp"]),
    -    peer:stop(Peer).
    +    {ok, Peer, _Node} = ?CT_PEER(["-emu_flavor", "smp"]),
    +    peer:stop(Peer).
     
    -named(Config) when is_list(Config) ->
    +named(Config) when is_list(Config) ->
         %% pass test case name down to function starting nodes
    -    Peer = start_node_impl(named_test),
    -    peer:stop(Peer).
    +    Peer = start_node_impl(named_test),
    +    peer:stop(Peer).
     
    -start_node_impl(ActualTestCase) ->
    -    {ok, Peer, Node} = ?CT_PEER(#{name => ?CT_PEER_NAME(ActualTestCase)}),
    +start_node_impl(ActualTestCase) ->
    +    {ok, Peer, Node} = ?CT_PEER(#{name => ?CT_PEER_NAME(ActualTestCase)}),
         %% extra setup needed for multiple test cases
    -    ok = rpc:call(Node, application, set_env, [kernel, key, value]),
    +    ok = rpc:call(Node, application, set_env, [kernel, key, value]),
         Peer.
     
    -restart_node(Config) when is_list(Config) ->
    -    Name = ?CT_PEER_NAME(),
    -    {ok, Peer, Node} = ?CT_PEER(#{name => Name}),
    -    peer:stop(Peer),
    +restart_node(Config) when is_list(Config) ->
    +    Name = ?CT_PEER_NAME(),
    +    {ok, Peer, Node} = ?CT_PEER(#{name => Name}),
    +    peer:stop(Peer),
         %% restart the node with the same name as before
    -    {ok, Peer2, Node} = ?CT_PEER(#{name => Name, args => ["+fnl"]}),
    -    peer:stop(Peer2).

    The next example demonstrates how to start multiple nodes concurrently:

    multi_node(Config) when is_list(Config) ->
    -    Peers = [?CT_PEER(#{wait_boot => {self(), tag}})
    -        || _ <- lists:seq(1, 4)],
    +    {ok, Peer2, Node} = ?CT_PEER(#{name => Name, args => ["+fnl"]}),
    +    peer:stop(Peer2).

    The next example demonstrates how to start multiple nodes concurrently:

    multi_node(Config) when is_list(Config) ->
    +    Peers = [?CT_PEER(#{wait_boot => {self(), tag}})
    +        || _ <- lists:seq(1, 4)],
         %% wait for all nodes to complete boot process, get their names:
    -    _Nodes = [receive {tag, {started, Node, Peer}} -> Node end
    -        || {ok, Peer} <- Peers],
    -    [peer:stop(Peer) || {ok, Peer} <- Peers].

    Start a peer on a different host. Requires ssh key-based authentication set -up, allowing "another_host" connection without password prompt.

    Ssh = os:find_executable("ssh"),
    -peer:start_link(#{exec => {Ssh, ["another_host", "erl"]},
    -    connection => standard_io}),

    The following Common Test case demonstrates Docker integration, starting two + _Nodes = [receive {tag, {started, Node, Peer}} -> Node end + || {ok, Peer} <- Peers], + [peer:stop(Peer) || {ok, Peer} <- Peers].

    Start a peer on a different host. Requires ssh key-based authentication set +up, allowing "another_host" connection without password prompt.

    Ssh = os:find_executable("ssh"),
    +peer:start_link(#{exec => {Ssh, ["another_host", "erl"]},
    +    connection => standard_io}),

    The following Common Test case demonstrates Docker integration, starting two containers with hostnames "one" and "two". In this example Erlang nodes running -inside containers form an Erlang cluster.

    docker(Config) when is_list(Config) ->
    -    Docker = os:find_executable("docker"),
    -    PrivDir = proplists:get_value(priv_dir, Config),
    -    build_release(PrivDir),
    -    build_image(PrivDir),
    +inside containers form an Erlang cluster.

    docker(Config) when is_list(Config) ->
    +    Docker = os:find_executable("docker"),
    +    PrivDir = proplists:get_value(priv_dir, Config),
    +    build_release(PrivDir),
    +    build_image(PrivDir),
     
         %% start two Docker containers
    -    {ok, Peer, Node} = peer:start_link(#{name => lambda,
    +    {ok, Peer, Node} = peer:start_link(#{name => lambda,
             connection => standard_io,
    -        exec => {Docker, ["run", "-h", "one", "-i", "lambda"]}}),
    -    {ok, Peer2, Node2} = peer:start_link(#{name => lambda,
    +        exec => {Docker, ["run", "-h", "one", "-i", "lambda"]}}),
    +    {ok, Peer2, Node2} = peer:start_link(#{name => lambda,
             connection => standard_io,
    -        exec => {Docker, ["run", "-h", "two", "-i", "lambda"]}}),
    +        exec => {Docker, ["run", "-h", "two", "-i", "lambda"]}}),
     
         %% find IP address of the second node using alternative connection RPC
    -    {ok, Ips} = peer:call(Peer2, inet, getifaddrs, []),
    -    {"eth0", Eth0} = lists:keyfind("eth0", 1, Ips),
    -    {addr, Ip} = lists:keyfind(addr, 1, Eth0),
    +    {ok, Ips} = peer:call(Peer2, inet, getifaddrs, []),
    +    {"eth0", Eth0} = lists:keyfind("eth0", 1, Ips),
    +    {addr, Ip} = lists:keyfind(addr, 1, Eth0),
     
         %% make first node to discover second one
    -    ok = peer:call(Peer, inet_db, set_lookup, [[file]]),
    -    ok = peer:call(Peer, inet_db, add_host, [Ip, ["two"]]),
    +    ok = peer:call(Peer, inet_db, set_lookup, [[file]]),
    +    ok = peer:call(Peer, inet_db, add_host, [Ip, ["two"]]),
     
         %% join a cluster
    -    true = peer:call(Peer, net_kernel, connect_node, [Node2]),
    +    true = peer:call(Peer, net_kernel, connect_node, [Node2]),
         %% verify that second peer node has only the first node visible
    -    [Node] = peer:call(Peer2, erlang, nodes, []),
    +    [Node] = peer:call(Peer2, erlang, nodes, []),
     
         %% stop peers, causing containers to also stop
    -    peer:stop(Peer2),
    -    peer:stop(Peer).
    +    peer:stop(Peer2),
    +    peer:stop(Peer).
     
    -build_release(Dir) ->
    +build_release(Dir) ->
         %% load sasl.app file, otherwise application:get_key will fail
    -    application:load(sasl),
    +    application:load(sasl),
         %% create *.rel - release file
    -    RelFile = filename:join(Dir, "lambda.rel"),
    -    Release = {release, {"lambda", "1.0.0"},
    -        {erts, erlang:system_info(version)},
    -        [{App, begin {ok, Vsn} = application:get_key(App, vsn), Vsn end}
    -            || App <- [kernel, stdlib, sasl]]},
    -    ok = file:write_file(RelFile, list_to_binary(lists:flatten(
    -        io_lib:format("~tp.", [Release])))),
    -    RelFileNoExt = filename:join(Dir, "lambda"),
    +    RelFile = filename:join(Dir, "lambda.rel"),
    +    Release = {release, {"lambda", "1.0.0"},
    +        {erts, erlang:system_info(version)},
    +        [{App, begin {ok, Vsn} = application:get_key(App, vsn), Vsn end}
    +            || App <- [kernel, stdlib, sasl]]},
    +    ok = file:write_file(RelFile, list_to_binary(lists:flatten(
    +        io_lib:format("~tp.", [Release])))),
    +    RelFileNoExt = filename:join(Dir, "lambda"),
     
         %% create boot script
    -    {ok, systools_make, []} = systools:make_script(RelFileNoExt,
    -        [silent, {outdir, Dir}]),
    +    {ok, systools_make, []} = systools:make_script(RelFileNoExt,
    +        [silent, {outdir, Dir}]),
         %% package release into *.tar.gz
    -    ok = systools:make_tar(RelFileNoExt, [{erts, code:root_dir()}]).
    +    ok = systools:make_tar(RelFileNoExt, [{erts, code:root_dir()}]).
     
    -build_image(Dir) ->
    +build_image(Dir) ->
         %% Create Dockerfile example, working only for Ubuntu 20.04
         %% Expose port 4445, and make Erlang distribution to listen
         %%  on this port, and connect to it without EPMD
         %% Set cookie on both nodes to be the same.
    -    BuildScript = filename:join(Dir, "Dockerfile"),
    +    BuildScript = filename:join(Dir, "Dockerfile"),
         Dockerfile =
           "FROM ubuntu:20.04 as runner\n"
           "EXPOSE 4445\n"
           "WORKDIR /opt/lambda\n"
           "COPY lambda.tar.gz /tmp\n"
           "RUN tar -zxvf /tmp/lambda.tar.gz -C /opt/lambda\n"
    -      "ENTRYPOINT [\"/opt/lambda/erts-" ++ erlang:system_info(version) ++
    +      "ENTRYPOINT [\"/opt/lambda/erts-" ++ erlang:system_info(version) ++
           "/bin/dyn_erl\", \"-boot\", \"/opt/lambda/releases/1.0.0/start\","
           " \"-kernel\", \"inet_dist_listen_min\", \"4445\","
           " \"-erl_epmd_port\", \"4445\","
           " \"-setcookie\", \"secret\"]\n",
    -    ok = file:write_file(BuildScript, Dockerfile),
    -    os:cmd("docker build -t lambda " ++ Dir).
    +
    ok = file:write_file(BuildScript, Dockerfile), + os:cmd("docker build -t lambda " ++ Dir).
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/proc_lib.xhtml differs (HTML document, ASCII text, with very long lines (650)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/proc_lib.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/proc_lib.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -874,21 +874,21 @@ failed. When doing so the start function can return before the failing process has exited, which may block VM resources required for a new start attempt to succeed. Use init_fail/2,3 for that purpose.

    The following example illustrates how this function and proc_lib:start_link/3 -are used:

    -module(my_proc).
    --export([start_link/0]).
    --export([init/1]).
    +are used:

    -module(my_proc).
    +-export([start_link/0]).
    +-export([init/1]).
     
    -start_link() ->
    -    proc_lib:start_link(my_proc, init, [self()]).
    +start_link() ->
    +    proc_lib:start_link(my_proc, init, [self()]).
     
    -init(Parent) ->
    -    case do_initialization() of
    +init(Parent) ->
    +    case do_initialization() of
             ok ->
    -            proc_lib:init_ack(Parent, {ok, self()});
    -        {error, Reason} ->
    -            exit(Reason)
    +            proc_lib:init_ack(Parent, {ok, self()});
    +        {error, Reason} ->
    +            exit(Reason)
         end,
    -    loop().
    +    loop().
     
     ...
    @@ -961,21 +961,21 @@ started process, the start function returns an error tuple when the started process exits, or when the start function time-out (if used) has passed, see start/3,4,5.

    The following example illustrates how this function and proc_lib:start_link/3 -can be used:

    -module(my_proc).
    --export([start_link/0]).
    --export([init/1]).
    +can be used:

    -module(my_proc).
    +-export([start_link/0]).
    +-export([init/1]).
     
    -start_link() ->
    -    proc_lib:start_link(my_proc, init, [self()]).
    +start_link() ->
    +    proc_lib:start_link(my_proc, init, [self()]).
     
    -init(Parent) ->
    -    case do_initialization() of
    +init(Parent) ->
    +    case do_initialization() of
             ok ->
    -            proc_lib:init_ack(Parent, {ok, self()});
    -        {error, Reason} = Error ->
    -            proc_lib:init_fail(Parent, Error, {exit, normal})
    +            proc_lib:init_ack(Parent, {ok, self()});
    +        {error, Reason} = Error ->
    +            proc_lib:init_fail(Parent, Error, {exit, normal})
         end,
    -    loop().
    +    loop().
     
     ...
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/proplists.xhtml differs (HTML document, ASCII text, with very long lines (3915)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/proplists.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/proplists.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -411,7 +411,7 @@

    Similar to get_all_values/2, but each value is wrapped in a list unless it is already itself a list. The resulting list of lists is concatenated. This is -often useful for "incremental" options.

    Example:

    append_values(a, [{a, [1,2]}, {b, 0}, {a, 3}, {c, -1}, {a, [4]}])

    returns:

    [1,2,3,4]
    +often useful for "incremental" options.

    Example:

    append_values(a, [{a, [1,2]}, {b, 0}, {a, 3}, {c, -1}, {a, [4]}])

    returns:

    [1,2,3,4]
    @@ -505,10 +505,10 @@ first entry in ListIn with the same key as Property, and E and Property have equivalent normal forms, then E is replaced with the terms in Expansion, and any following entries with the same key are deleted from -ListIn.

    For example, the following expressions all return [fie, bar, baz, fum]:

    expand([{foo, [bar, baz]}], [fie, foo, fum])
    -expand([{{foo, true}, [bar, baz]}], [fie, foo, fum])
    -expand([{{foo, false}, [bar, baz]}], [fie, {foo, false}, fum])

    However, no expansion is done in the following call because {foo, false} -shadows foo:

    expand([{{foo, true}, [bar, baz]}], [{foo, false}, fie, foo, fum])

    Notice that if the original property term is to be preserved in the result when +ListIn.

    For example, the following expressions all return [fie, bar, baz, fum]:

    expand([{foo, [bar, baz]}], [fie, foo, fum])
    +expand([{{foo, true}, [bar, baz]}], [fie, foo, fum])
    +expand([{{foo, false}, [bar, baz]}], [fie, {foo, false}, fum])

    However, no expansion is done in the following call because {foo, false} +shadows foo:

    expand([{{foo, true}, [bar, baz]}], [{foo, false}, fie, foo, fum])

    Notice that if the original property term is to be preserved in the result when expanded, it must be included in the expansion list. The inserted terms are not expanded recursively. If Expansions contains more than one property with the same key, only the first occurrence is used.

    See also normalize/2.

    @@ -913,7 +913,7 @@

    Partitions List into a list of sublists and a remainder.

    Lists contains one sublist for each key in Keys, in the corresponding order. The relative order of the elements in each sublist is preserved from the original List. Rest contains the elements in List that are not associated with any of the -specified keys, also with their original relative order preserved.

    Example:

    split([{c, 2}, {e, 1}, a, {c, 3, 4}, d, {b, 5}, b], [a, b, c])

    returns:

    {[[a], [{b, 5}, b],[{c, 2}, {c, 3, 4}]], [{e, 1}, d]}
    +specified keys, also with their original relative order preserved.

    Example:

    split([{c, 2}, {e, 1}, a, {c, 3, 4}, d, {b, 5}, b], [a, b, c])

    returns:

    {[[a], [{b, 5}, b],[{c, 2}, {c, 3, 4}]], [{e, 1}, d]}
    @@ -1036,7 +1036,7 @@ an association of the form Key => Value. Anything else will be silently ignored.

    If the same key appears in List multiple times, the value of the one appearing nearest to the head of List will be in the result map, that is the value that -would be returned by a call to get_value(Key, List).

    Example:

    to_map([a, {b, 1}, {c, 2}, {c, 3}])

    returns:

    #{a => true, b => 1, c => 2}
    +would be returned by a call to get_value(Key, List).

    Example:

    to_map([a, {b, 1}, {c, 2}, {c, 3}])

    returns:

    #{a => true, b => 1, c => 2}
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/qlc.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (1572)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/qlc.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/qlc.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -180,24 +180,24 @@ If a tuple {finished} exists among the answers to QH, it is returned twice from append/2.

    As another example, consider concatenating the answers to two queries QH1 and QH2 while removing all duplicates. This is accomplished by using option -unique:

    qlc:q([X || X <- qlc:append(QH1, QH2)], {unique, true})

    The cost is substantial: every returned answer is stored in an ETS table. Before +unique:

    qlc:q([X || X <- qlc:append(QH1, QH2)], {unique, true})

    The cost is substantial: every returned answer is stored in an ETS table. Before returning an answer, it is looked up in the ETS table to check if it has already been returned. Without the unique option, all answers to QH1 would be returned followed by all answers to QH2. The unique option keeps the order between the remaining answers.

    If the order of the answers is not important, there is an alternative to the -unique option, namely to sort the answers uniquely:

    qlc:sort(qlc:q([X || X <- qlc:append(QH1, QH2)], {unique, true})).

    This query also removes duplicates but the answers are sorted. If there are many +unique option, namely to sort the answers uniquely:

    qlc:sort(qlc:q([X || X <- qlc:append(QH1, QH2)], {unique, true})).

    This query also removes duplicates but the answers are sorted. If there are many answers, temporary files are used. Notice that to get the first unique answer, all answers must be found and sorted. Both alternatives find duplicates by comparing answers, that is, if A1 and A2 are answers found in that order, then A2 is a removed if A1 == A2.

    To return only a few answers, cursors can be used. The following code returns no -more than five answers using an ETS table for storing the unique answers:

    C = qlc:cursor(qlc:q([X || X <- qlc:append(QH1, QH2)],{unique,true})),
    -R = qlc:next_answers(C, 5),
    -ok = qlc:delete_cursor(C),
    +more than five answers using an ETS table for storing the unique answers:

    C = qlc:cursor(qlc:q([X || X <- qlc:append(QH1, QH2)],{unique,true})),
    +R = qlc:next_answers(C, 5),
    +ok = qlc:delete_cursor(C),
     R.

    QLCs are convenient for stating constraints on data from two or more tables. The -following example does a natural join on two query handles on position 2:

    qlc:q([{X1,X2,X3,Y1} ||
    -          {X1,X2,X3} <- QH1,
    -          {Y1,Y2} <- QH2,
    -          X2 =:= Y2])

    The qlc module evaluates this differently depending on the query handles QH1 +following example does a natural join on two query handles on position 2:

    qlc:q([{X1,X2,X3,Y1} ||
    +          {X1,X2,X3} <- QH1,
    +          {Y1,Y2} <- QH2,
    +          X2 =:= Y2])

    The qlc module evaluates this differently depending on the query handles QH1 and QH2. If, for example, X2 is matched against the key of a QLC table, the lookup join method traverses the objects of QH2 while looking up key values in the table. However, if not X2 or Y2 is matched against the key or an indexed @@ -205,11 +205,11 @@ both sorted on position 2 and next do the join by traversing the objects one by one.

    Option join can be used to force the qlc module to use a certain join method. For the rest of this section it is assumed that the excessively slow -join method called "nested loop" has been chosen:

    qlc:q([{X1,X2,X3,Y1} ||
    -          {X1,X2,X3} <- QH1,
    -          {Y1,Y2} <- QH2,
    -          X2 =:= Y2],
    -      {join, nested_loop})

    In this case the filter is applied to every possible pair of answers to QH1 +join method called "nested loop" has been chosen:

    qlc:q([{X1,X2,X3,Y1} ||
    +          {X1,X2,X3} <- QH1,
    +          {Y1,Y2} <- QH2,
    +          X2 =:= Y2],
    +      {join, nested_loop})

    In this case the filter is applied to every possible pair of answers to QH1 and QH2, one at a time. If there are M answers to QH1 and N answers to QH2, the filter is run M*N times.

    If QH2 is a call to the function for gb_trees, as defined in section Implementing a QLC Table, then @@ -223,7 +223,7 @@ no side effects so that the meaning of the query does not change if QH2 is evaluated only once. One way of caching the answers is to evaluate QH2 first of all and substitute the list of answers for QH2 in the query. Another way is -to use option cache. It is expressed like this:

    QH2' = qlc:q([X || X <- QH2], {cache, ets})

    or only

    QH2' = qlc:q([X || X <- QH2], cache)

    The effect of option cache is that when generator QH2' is run the first +to use option cache. It is expressed like this:

    QH2' = qlc:q([X || X <- QH2], {cache, ets})

    or only

    QH2' = qlc:q([X || X <- QH2], cache)

    The effect of option cache is that when generator QH2' is run the first time, every answer is stored in an ETS table. When the next answer of QH1 is tried, answers to QH2' are copied from the ETS table, which is very fast. As for option unique the cost is a possibly substantial amount of RAM memory.

    Option {cache, list} offers the possibility to store the answers in a list on @@ -245,62 +245,62 @@ Implementing a QLC Table

    As an example of how to use function table/2, the implementation of a QLC -table for the gb_trees module is given:

    -module(gb_table).
    +table for the gb_trees module is given:

    -module(gb_table).
     
    --export([table/1]).
    +-export([table/1]).
     
    -table(T) ->
    -    TF = fun() -> qlc_next(gb_trees:next(gb_trees:iterator(T))) end,
    -    InfoFun = fun(num_of_objects) -> gb_trees:size(T);
    -                 (keypos) -> 1;
    -                 (is_sorted_key) -> true;
    -                 (is_unique_objects) -> true;
    -                 (_) -> undefined
    +table(T) ->
    +    TF = fun() -> qlc_next(gb_trees:next(gb_trees:iterator(T))) end,
    +    InfoFun = fun(num_of_objects) -> gb_trees:size(T);
    +                 (keypos) -> 1;
    +                 (is_sorted_key) -> true;
    +                 (is_unique_objects) -> true;
    +                 (_) -> undefined
                   end,
         LookupFun =
    -        fun(1, Ks) ->
    -                lists:flatmap(fun(K) ->
    -                                      case gb_trees:lookup(K, T) of
    -                                          {value, V} -> [{K,V}];
    -                                          none -> []
    +        fun(1, Ks) ->
    +                lists:flatmap(fun(K) ->
    +                                      case gb_trees:lookup(K, T) of
    +                                          {value, V} -> [{K,V}];
    +                                          none -> []
                                           end
    -                              end, Ks)
    +                              end, Ks)
             end,
         FormatFun =
    -        fun({all, NElements, ElementFun}) ->
    -                ValsS = io_lib:format("gb_trees:from_orddict(~w)",
    -                                      [gb_nodes(T, NElements, ElementFun)]),
    -                io_lib:format("gb_table:table(~s)", [ValsS]);
    -           ({lookup, 1, KeyValues, _NElements, ElementFun}) ->
    -                ValsS = io_lib:format("gb_trees:from_orddict(~w)",
    -                                      [gb_nodes(T, infinity, ElementFun)]),
    -                io_lib:format("lists:flatmap(fun(K) -> "
    +        fun({all, NElements, ElementFun}) ->
    +                ValsS = io_lib:format("gb_trees:from_orddict(~w)",
    +                                      [gb_nodes(T, NElements, ElementFun)]),
    +                io_lib:format("gb_table:table(~s)", [ValsS]);
    +           ({lookup, 1, KeyValues, _NElements, ElementFun}) ->
    +                ValsS = io_lib:format("gb_trees:from_orddict(~w)",
    +                                      [gb_nodes(T, infinity, ElementFun)]),
    +                io_lib:format("lists:flatmap(fun(K) -> "
                                   "case gb_trees:lookup(K, ~s) of "
                                   "{value, V} -> [{K,V}];none -> [] end "
                                   "end, ~w)",
    -                              [ValsS, [ElementFun(KV) || KV <- KeyValues]])
    +                              [ValsS, [ElementFun(KV) || KV <- KeyValues]])
             end,
    -    qlc:table(TF, [{info_fun, InfoFun}, {format_fun, FormatFun},
    -                   {lookup_fun, LookupFun},{key_equality,'=='}]).
    +    qlc:table(TF, [{info_fun, InfoFun}, {format_fun, FormatFun},
    +                   {lookup_fun, LookupFun},{key_equality,'=='}]).
     
    -qlc_next({X, V, S}) ->
    -    [{X,V} | fun() -> qlc_next(gb_trees:next(S)) end];
    -qlc_next(none) ->
    -    [].
    -
    -gb_nodes(T, infinity, ElementFun) ->
    -    gb_nodes(T, -1, ElementFun);
    -gb_nodes(T, NElements, ElementFun) ->
    -    gb_iter(gb_trees:iterator(T), NElements, ElementFun).
    +qlc_next({X, V, S}) ->
    +    [{X,V} | fun() -> qlc_next(gb_trees:next(S)) end];
    +qlc_next(none) ->
    +    [].
    +
    +gb_nodes(T, infinity, ElementFun) ->
    +    gb_nodes(T, -1, ElementFun);
    +gb_nodes(T, NElements, ElementFun) ->
    +    gb_iter(gb_trees:iterator(T), NElements, ElementFun).
     
    -gb_iter(_I, 0, _EFun) ->
    +gb_iter(_I, 0, _EFun) ->
         '...';
    -gb_iter(I0, N, EFun) ->
    -    case gb_trees:next(I0) of
    -        {X, V, I} ->
    -            [EFun({X,V}) | gb_iter(I, N-1, EFun)];
    +gb_iter(I0, N, EFun) ->
    +    case gb_trees:next(I0) of
    +        {X, V, I} ->
    +            [EFun({X,V}) | gb_iter(I, N-1, EFun)];
             none ->
    -            []
    +            []
         end.

    TF is the traversal function. The qlc module requires that there is a way of traversing all objects of the data structure. gb_trees has an iterator function suitable for that purpose. Notice that for each object returned, a new @@ -336,49 +336,49 @@ example, 2 == 2.0 evaluates to true while 2 =:= 2.0 evaluates to false. Normally this is a minor issue, but the qlc module cannot ignore the difference, which affects the user's choice of operators in QLCs.

    If the qlc module at compile time can determine that some constant is free of -integers, it does not matter which one of ==/2 or =:=/2 is used:

    1> E1 = ets:new(t, [set]), % uses =:=/2 for key equality
    -Q1 = qlc:q([K ||
    -{K} <- ets:table(E1),
    -K == 2.71 orelse K == a]),
    -io:format("~s~n", [qlc:info(Q1)]).
    -ets:match_spec_run(
    -       lists:flatmap(fun(V) ->
    -			    ets:lookup(#Ref<0.3098908599.2283929601.256025>,
    -				       V)
    +integers, it does not matter which one of ==/2 or =:=/2 is used:

    1> E1 = ets:new(t, [set]), % uses =:=/2 for key equality
    +Q1 = qlc:q([K ||
    +{K} <- ets:table(E1),
    +K == 2.71 orelse K == a]),
    +io:format("~s~n", [qlc:info(Q1)]).
    +ets:match_spec_run(
    +       lists:flatmap(fun(V) ->
    +			    ets:lookup(#Ref<0.3098908599.2283929601.256025>,
    +				       V)
     		     end,
    -		     [a, 2.71]),
    -       ets:match_spec_compile([{{'$1'}, [], ['$1']}]))

    In the example, operator ==/2 has been handled exactly as =:=/2 would have + [a, 2.71]), + ets:match_spec_compile([{{'$1'}, [], ['$1']}]))

    In the example, operator ==/2 has been handled exactly as =:=/2 would have been handled. However, if it cannot be determined at compile time that some constant is free of integers, and the table uses =:=/2 when comparing keys for equality (see option key_equality), then the qlc module does not try to look up the constant. The reason is that there is in the general case no upper limit on the number of key values that can compare equal -to such a constant; every combination of integers and floats must be looked up:

    2> E2 = ets:new(t, [set]),
    -true = ets:insert(E2, [{{2,2},a},{{2,2.0},b},{{2.0,2},c}]),
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/queue.xhtml differs (HTML document, ASCII text, with very long lines (1484))
    --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/queue.xhtml	2026-06-04 00:07:10.000000000 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/queue.xhtml	2042-07-06 13:26:37.000000000 +0000
    @@ -602,10 +602,10 @@
           
     
     

    Returns true if Pred(Item) returns true for all items Item in Q, -otherwise false.

    Example:

    1> Queue = queue:from_list([1,2,3,4,5]).
    -2> queue:all(fun (E) -> E > 3 end, Queue).
    +otherwise false.

    Example:

    1> Queue = queue:from_list([1,2,3,4,5]).
    +2> queue:all(fun (E) -> E > 3 end, Queue).
     false
    -3> queue:all(fun (E) -> E > 0 end, Queue).
    +3> queue:all(fun (E) -> E > 0 end, Queue).
     true
    @@ -637,10 +637,10 @@

    Returns true if Pred(Item) returns true for at least one item Item in -Q, otherwise false.

    Example:

    1> Queue = queue:from_list([1,2,3,4,5]).
    -2> queue:any(fun (E) -> E > 10 end, Queue).
    +Q, otherwise false.

    Example:

    1> Queue = queue:from_list([1,2,3,4,5]).
    +2> queue:any(fun (E) -> E > 10 end, Queue).
     false
    -3> queue:any(fun (E) -> E > 3 end, Queue).
    +3> queue:any(fun (E) -> E > 3 end, Queue).
     true
    @@ -672,9 +672,9 @@

    Returns a copy of Q1 where the first item matching Item is deleted, if there -is such an item.

    Example:

    1> Queue = queue:from_list([1,2,3,4,5]).
    -2> Queue1 = queue:delete(3, Queue).
    -3> queue:member(3, Queue1).
    +is such an item.

    Example:

    1> Queue = queue:from_list([1,2,3,4,5]).
    +2> Queue1 = queue:delete(3, Queue).
    +3> queue:member(3, Queue1).
     false
    @@ -706,10 +706,10 @@

    Returns a copy of Q1 where the last item matching Item is deleted, if there -is such an item.

    Example:

    1> Queue = queue:from_list([1,2,3,4,3,5]).
    -2> Queue1 = queue:delete_r(3, Queue).
    -3> queue:to_list(Queue1).
    -[1,2,3,4,5]
    +is such an item.

    Example:

    1> Queue = queue:from_list([1,2,3,4,3,5]).
    +2> Queue1 = queue:delete_r(3, Queue).
    +3> queue:to_list(Queue1).
    +[1,2,3,4,5]
    @@ -745,10 +745,10 @@

    Returns a copy of Q1 where the first item for which Pred returns true is -deleted, if there is such an item.

    Example:

    1> Queue = queue:from_list([100,1,2,3,4,5]).
    -2> Queue1 = queue:delete_with(fun (E) -> E > 0, Queue).
    -3> queue:to_list(Queue1).
    -[1,2,3,4,5]
    +deleted, if there is such an item.

    Example:

    1> Queue = queue:from_list([100,1,2,3,4,5]).
    +2> Queue1 = queue:delete_with(fun (E) -> E > 0, Queue).
    +3> queue:to_list(Queue1).
    +[1,2,3,4,5]
    @@ -784,10 +784,10 @@

    Returns a copy of Q1 where the last item for which Pred returns true is -deleted, if there is such an item.

    Example:

    1> Queue = queue:from_list([1,2,3,4,5,100]).
    -2> Queue1 = queue:delete_with(fun (E) -> E > 10, Queue).
    -3> queue:to_list(Queue1).
    -[1,2,3,4,5]
    +deleted, if there is such an item.

    Example:

    1> Queue = queue:from_list([1,2,3,4,5,100]).
    +2> Queue1 = queue:delete_with(fun (E) -> E > 10, Queue).
    +3> queue:to_list(Queue1).
    +[1,2,3,4,5]
    @@ -818,19 +818,19 @@

    Returns a queue Q2 that is the result of calling Fun(Item) on all items in Q1.

    If Fun(Item) returns true, Item is copied to the result queue. If it returns false, Item is not copied. If it returns a list, the list elements -are inserted instead of Item in the result queue.

    Example 1:

    1> Queue = queue:from_list([1,2,3,4,5]).
    -{[5,4,3],[1,2]}
    -2> Queue1 = queue:filter(fun (E) -> E > 2 end, Queue).
    -{[5],[3,4]}
    -3> queue:to_list(Queue1).
    -[3,4,5]

    So, Fun(Item) returning [Item] is thereby semantically equivalent to +are inserted instead of Item in the result queue.

    Example 1:

    1> Queue = queue:from_list([1,2,3,4,5]).
    +{[5,4,3],[1,2]}
    +2> Queue1 = queue:filter(fun (E) -> E > 2 end, Queue).
    +{[5],[3,4]}
    +3> queue:to_list(Queue1).
    +[3,4,5]

    So, Fun(Item) returning [Item] is thereby semantically equivalent to returning true, just as returning [] is semantically equivalent to returning -false. But returning a list builds more garbage than returning an atom.

    Example 2:

    1> Queue = queue:from_list([1,2,3,4,5]).
    -{[5,4,3],[1,2]}
    -2> Queue1 = queue:filter(fun (E) -> [E, E+1] end, Queue).
    -{[6,5,5,4,4,3],[1,2,2,3]}
    -3> queue:to_list(Queue1).
    -[1,2,2,3,3,4,4,5,5,6]
    +false. But returning a list builds more garbage than returning an atom.

    Example 2:

    1> Queue = queue:from_list([1,2,3,4,5]).
    +{[5,4,3],[1,2]}
    +2> Queue1 = queue:filter(fun (E) -> [E, E+1] end, Queue).
    +{[6,5,5,4,4,3],[1,2,2,3]}
    +3> queue:to_list(Queue1).
    +[1,2,2,3,3,4,4,5,5,6]
    @@ -869,15 +869,15 @@

    Returns a queue Q2 that is the result of calling Fun(Item) on all items in Q1.

    If Fun(Item) returns true, Item is copied to the result queue. If it returns false, Item is not copied. If it returns {true, NewItem}, the -queue element at this position is replaced with NewItem in the result queue.

    Example 1:

    1> Queue = queue:from_list([1,2,3,4,5]).
    -{[5,4,3],[1,2]}
    -2> Queue1 = queue:filtermap(fun (E) -> E > 2 end, Queue).
    -{[5],[3,4]}
    -3> queue:to_list(Queue1).
    -[3,4,5]
    -4> Queue1 = queue:filtermap(fun (E) -> {true, E+100} end, Queue).
    -{"ihg","ef"}
    -5> queue:to_list(Queue1).
    +queue element at this position is replaced with NewItem in the result queue.

    Example 1:

    1> Queue = queue:from_list([1,2,3,4,5]).
    +{[5,4,3],[1,2]}
    +2> Queue1 = queue:filtermap(fun (E) -> E > 2 end, Queue).
    +{[5],[3,4]}
    +3> queue:to_list(Queue1).
    +[3,4,5]
    +4> Queue1 = queue:filtermap(fun (E) -> {true, E+100} end, Queue).
    +{"ihg","ef"}
    +5> queue:to_list(Queue1).
     "efghi
    @@ -918,9 +918,9 @@ AccIn == Acc0. The queue is traversed in queue order, that is, from front to rear. Fun/2 must return a new accumulator, which is passed to the next call. The function returns the final value of the accumulator. Acc0 is returned if -the queue is empty.

    Example:

    1> queue:fold(fun(X, Sum) -> X + Sum end, 0, queue:from_list([1,2,3,4,5])).
    +the queue is empty.

    Example:

    1> queue:fold(fun(X, Sum) -> X + Sum end, 0, queue:from_list([1,2,3,4,5])).
     15
    -2> queue:fold(fun(X, Prod) -> X * Prod end, 1, queue:from_list([1,2,3,4,5])).
    +2> queue:fold(fun(X, Prod) -> X * Prod end, 1, queue:from_list([1,2,3,4,5])).
     120
    @@ -978,12 +978,12 @@ -

    Inserts Item at the rear of queue Q1. Returns the resulting queue Q2.

    Example:

    1> Queue = queue:from_list([1,2,3,4,5]).
    -{[5,4,3],[1,2]}
    -2> Queue1 = queue:in(100, Queue).
    -{[100,5,4,3],[1,2]}
    -3> queue:to_list(Queue1).
    -[1,2,3,4,5,100]
    +

    Inserts Item at the rear of queue Q1. Returns the resulting queue Q2.

    Example:

    1> Queue = queue:from_list([1,2,3,4,5]).
    +{[5,4,3],[1,2]}
    +2> Queue1 = queue:in(100, Queue).
    +{[100,5,4,3],[1,2]}
    +3> queue:to_list(Queue1).
    +[1,2,3,4,5,100]
    @@ -1011,12 +1011,12 @@ -

    Inserts Item at the front of queue Q1. Returns the resulting queue Q2.

    Example:

    1> Queue = queue:from_list([1,2,3,4,5]).
    -{[5,4,3],[1,2]}
    -2> Queue1 = queue:in_r(100, Queue).
    -{[5,4,3],[100,1,2]}
    -3> queue:to_list(Queue1).
    -[100,1,2,3,4,5]
    +

    Inserts Item at the front of queue Q1. Returns the resulting queue Q2.

    Example:

    1> Queue = queue:from_list([1,2,3,4,5]).
    +{[5,4,3],[1,2]}
    +2> Queue1 = queue:in_r(100, Queue).
    +{[5,4,3],[100,1,2]}
    +3> queue:to_list(Queue1).
    +[100,1,2,3,4,5]
    @@ -1104,12 +1104,12 @@

    Returns a queue Q3 that is the result of joining Q1 and Q2 with Q1 in -front of Q2.

    Example:

    1> Queue1 = queue:from_list([1,3]).
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/random.xhtml differs (HTML document, ASCII text, with very long lines (756))
    --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/random.xhtml	2026-06-04 00:07:10.000000000 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/random.xhtml	2042-07-06 13:26:37.000000000 +0000
    @@ -351,9 +351,9 @@
           
     
     

    Seeds random number generation with integer values in the process dictionary and -returns the old state.

    The following is an easy way of obtaining a unique value to seed with:

    random:seed(erlang:phash2([node()]),
    -            erlang:monotonic_time(),
    -            erlang:unique_integer())

    For details, see erlang:phash2/1, erlang:node/0, erlang:monotonic_time/0, +returns the old state.

    The following is an easy way of obtaining a unique value to seed with:

    random:seed(erlang:phash2([node()]),
    +            erlang:monotonic_time(),
    +            erlang:unique_integer())

    For details, see erlang:phash2/1, erlang:node/0, erlang:monotonic_time/0, and erlang:unique_integer/0.

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/rand.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (2789)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/rand.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/rand.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -96,13 +96,13 @@ a reasonably unpredictable seed.

    The functions with explicit state don't use the process dictionary.

    Examples

    Simple use; create and seed the default algorithm with a non-fixed seed, if not already done, and generate two uniformly distibuted -floating point numbers.

    R0 = rand:uniform(),
    -R1 = rand:uniform(),

    Use a specified algorithm:

    _ = rand:seed(exro928ss),
    -R2 = rand:uniform(),

    Use a specified algorithm with a fixed seed:

    _ = rand:seed(exro928ss, {123, 123534, 345345}),
    -R3 = rand:uniform(),

    Use the functional API with a non-fixed seed:

    S0 = rand:seed_s(exsss),
    -{R4, S1} = rand:uniform_s(S0),

    Generate a textbook basic form Box-Muller standard normal distribution number:

    R5 = rand:uniform_real(),
    -R6 = rand:uniform(),
    -SND0 = math:sqrt(-2 * math:log(R5)) * math:cos(math:pi() * R6)

    Generate a standard normal distribution number:

    {SND1, S2} = rand:normal_s(S1),

    Generate a normal distribution number with with mean -3 and variance 0.5:

    {ND0, S3} = rand:normal_s(-3, 0.5, S2),

    Quality of the Generated Numbers

    Note

    The builtin random number generator algorithms are not cryptographically +floating point numbers.

    R0 = rand:uniform(),
    +R1 = rand:uniform(),

    Use a specified algorithm:

    _ = rand:seed(exro928ss),
    +R2 = rand:uniform(),

    Use a specified algorithm with a fixed seed:

    _ = rand:seed(exro928ss, {123, 123534, 345345}),
    +R3 = rand:uniform(),

    Use the functional API with a non-fixed seed:

    S0 = rand:seed_s(exsss),
    +{R4, S1} = rand:uniform_s(S0),

    Generate a textbook basic form Box-Muller standard normal distribution number:

    R5 = rand:uniform_real(),
    +R6 = rand:uniform(),
    +SND0 = math:sqrt(-2 * math:log(R5)) * math:cos(math:pi() * R6)

    Generate a standard normal distribution number:

    {SND1, S2} = rand:normal_s(S1),

    Generate a normal distribution number with with mean -3 and variance 0.5:

    {ND0, S3} = rand:normal_s(-3, 0.5, S2),

    Quality of the Generated Numbers

    Note

    The builtin random number generator algorithms are not cryptographically strong. If a cryptographically strong random number generator is needed, use something like crypto:rand_seed/0.

    For all these generators except exro928ss and exsss the lowest bit(s) have got a slightly less random behaviour than all other bits. @@ -113,7 +113,7 @@ up to (and included) 16TB, with the exception of binary rank tests, which fail due to the lowest bit being an LFSR; all other bits pass all tests. We suggest to use a sign test to extract a random Boolean value.

    If this is a problem; to generate a boolean with these algorithms, -use something like this:

    (rand:uniform(256) > 128) % -> boolean()
    ((rand:uniform(256) - 1) bsr 7) % -> 0 | 1

    For a general range, with N = 1 for exrop, and N = 3 for exs1024s:

    (((rand:uniform(Range bsl N) - 1) bsr N) + 1)

    The floating point generating functions in this module waste the lowest bits +use something like this:

    (rand:uniform(256) > 128) % -> boolean()
    ((rand:uniform(256) - 1) bsr 7) % -> 0 | 1

    For a general range, with N = 1 for exrop, and N = 3 for exs1024s:

    (((rand:uniform(Range bsl N) - 1) bsr N) + 1)

    The floating point generating functions in this module waste the lowest bits when converting from an integer so they avoid this snag.

    @@ -1826,10 +1826,10 @@ equally spaced in the interval.

    Warning

    This function may return exactly 0.0 which can be fatal for certain applications. If that is undesired you can use (1.0 - rand:uniform()) to get the interval 0.0 < X =< 1.0, or instead use uniform_real/0.

    If neither endpoint is desired you can achieve the range -0.0 < X < 1.0 using test and re-try like this:

    my_uniform() ->
    -    case rand:uniform() of
    +0.0 < X < 1.0 using test and re-try like this:

    my_uniform() ->
    +    case rand:uniform() of
             X when 0.0 < X -> X;
    -        _ -> my_uniform()
    +        _ -> my_uniform()
         end.
    @@ -1985,7 +1985,7 @@ 16#7fa6502 * 2^32 - 1, which have been selected, in collaboration with Sebastiano Vigna, to avoid bignum operations and still get good statistical quality. It has been named "MWC59" and can be written as:

    C = CX0 bsr 32
    -X = CX0 band ((1 bsl 32)-1))
    +X = CX0 band ((1 bsl 32)-1))
     CX1 = 16#7fa6502 * X + C

    Because the generator uses a multiplier that is a power of 2 it gets statistical flaws for collision tests and birthday spacings tests in 2 and 3 dimensions, and these caveats apply even when looking /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/re.xhtml differs (HTML document, ASCII text, with very long lines (2281)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/re.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/re.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -1270,9 +1270,9 @@ follows (COMMIT) can be triggered first, so merely passing (COMMIT) during a match does not always guarantee that a match must be at this starting point.

    Notice that (*COMMIT) at the start of a pattern is not the same as an anchor, unless the PCRE start-of-match optimizations are turned off, as shown in the -following example:

    1> re:run("xyzabc","(*COMMIT)abc",[{capture,all,list}]).
    -{match,["abc"]}
    -2> re:run("xyzabc","(*COMMIT)abc",[{capture,all,list},no_start_optimize]).
    +following example:

    1> re:run("xyzabc","(*COMMIT)abc",[{capture,all,list}]).
    +{match,["abc"]}
    +2> re:run("xyzabc","(*COMMIT)abc",[{capture,all,list},no_start_optimize]).
     nomatch

    For this pattern, PCRE knows that any match must start with "a", so the optimization skips along the subject to "a" before applying the pattern to the first set of data. The match attempt then succeeds. In the second call the @@ -1989,32 +1989,32 @@

    Takes a compiled regular expression and an item, and returns the relevant data from the regular expression.

    The only supported item is namelist, which returns the tuple {namelist, [binary()]}, -containing the names of all (unique) named subpatterns in the regular expression.

    For example:

    1> {ok,MP} = re:compile("(?<A>A)|(?<B>B)|(?<C>C)").
    -{ok,{re_pattern,3,0,0,
    +containing the names of all (unique) named subpatterns in the regular expression.

    For example:

    1> {ok,MP} = re:compile("(?<A>A)|(?<B>B)|(?<C>C)").
    +{ok,{re_pattern,3,0,0,
                     <<69,82,67,80,119,0,0,0,0,0,0,0,1,0,0,0,255,255,255,255,
    -                  255,255,...>>}}
    -2> re:inspect(MP,namelist).
    -{namelist,[<<"A">>,<<"B">>,<<"C">>]}
    -3> {ok,MPD} = re:compile("(?<C>A)|(?<B>B)|(?<C>C)",[dupnames]).
    -{ok,{re_pattern,3,0,0,
    +                  255,255,...>>}}
    +2> re:inspect(MP,namelist).
    +{namelist,[<<"A">>,<<"B">>,<<"C">>]}
    +3> {ok,MPD} = re:compile("(?<C>A)|(?<B>B)|(?<C>C)",[dupnames]).
    +{ok,{re_pattern,3,0,0,
                     <<69,82,67,80,119,0,0,0,0,0,8,0,1,0,0,0,255,255,255,255,
    -                  255,255,...>>}}
    -4> re:inspect(MPD,namelist).
    -{namelist,[<<"B">>,<<"C">>]}

    Notice in the second example that the duplicate name only occurs once in the + 255,255,...>>}} +4> re:inspect(MPD,namelist). +{namelist,[<<"B">>,<<"C">>]}

    Notice in the second example that the duplicate name only occurs once in the returned list, and that the list is in alphabetical order regardless of where the names are positioned in the regular expression. The order of the names is the same as the order of captured subexpressions if {capture, all_names} is specified as an option to run/3. You can therefore create a name-to-value -mapping from the result of run/3 like this:

    1> {ok,MP} = re:compile("(?<A>A)|(?<B>B)|(?<C>C)").
    -{ok,{re_pattern,3,0,0,
    +mapping from the result of run/3 like this:

    1> {ok,MP} = re:compile("(?<A>A)|(?<B>B)|(?<C>C)").
    +{ok,{re_pattern,3,0,0,
                     <<69,82,67,80,119,0,0,0,0,0,0,0,1,0,0,0,255,255,255,255,
    -                  255,255,...>>}}
    -2> {namelist, N} = re:inspect(MP,namelist).
    -{namelist,[<<"A">>,<<"B">>,<<"C">>]}
    -3> {match,L} = re:run("AA",MP,[{capture,all_names,binary}]).
    -{match,[<<"A">>,<<>>,<<>>]}
    -4> NameMap = lists:zip(N,L).
    -[{<<"A">>,<<"A">>},{<<"B">>,<<>>},{<<"C">>,<<>>}]
    +
    255,255,...>>}} +2> {namelist, N} = re:inspect(MP,namelist). +{namelist,[<<"A">>,<<"B">>,<<"C">>]} +3> {match,L} = re:run("AA",MP,[{capture,all_names,binary}]). +{match,[<<"A">>,<<>>,<<>>]} +4> NameMap = lists:zip(N,L). +[{<<"A">>,<<"A">>},{<<"B">>,<<>>},{<<"C">>,<<>>}]
    @@ -2107,16 +2107,16 @@ subexpression number N, is inserted in the result. If no subexpression with that number is generated by the regular expression, nothing is inserted.

    To insert an & or a \ in the result, precede it with a \. Notice that Erlang already gives a special meaning to \ in literal strings, so a single \ must be -written as "\\" and therefore a double \ as "\\\\".

    Example:

    1> re:replace("abcd","c","[&]",[{return,list}]).
    -"ab[c]d"

    while

    2> re:replace("abcd","c","[\\&]",[{return,list}]).
    +written as "\\" and therefore a double \ as "\\\\".

    Example:

    1> re:replace("abcd","c","[&]",[{return,list}]).
    +"ab[c]d"

    while

    2> re:replace("abcd","c","[\\&]",[{return,list}]).
     "ab[&]d"

    If the replacement is given as a fun, it will be called with the whole matching expression as the first argument and a list of subexpression matches in the order in which they appear in the regular expression. The returned value will be -inserted in the result.

    Example:

    3> re:replace("abcd", ".(.)",
    -    fun(Whole, [<<C>>]) ->
    -         <<$#, Whole/binary, $-, (C - $a + $A), $#>>
    +inserted in the result.

    Example:

    3> re:replace("abcd", ".(.)",
    +    fun(Whole, [<<C>>]) ->
    +         <<$#, Whole/binary, $-, (C - $a + $A), $#>>
         end,
    -    [{return, list}]).
    +    [{return, list}]).
     "#ab-B#cd"

    Note

    Non-matching optional subexpressions will not be included in the list of subexpression matches if they are the last subexpressions in the regular expression.

    Example:

    The regular expression "(a)(b)?(c)?" ("a", optionally followed by "b", @@ -2233,7 +2233,7 @@ run/3 handles empty matches in the same way as Perl: a zero-length match at any point is also retried with options [anchored, notempty_atstart]. If that search gives a result of length > 0, -the result is included. Example:

    re:run("cat","(|at)",[global]).

    The following matchings are performed:

    • At offset 0 - The regular expression (|at) first match at the +the result is included. Example:

      re:run("cat","(|at)",[global]).

      The following matchings are performed:

      • At offset 0 - The regular expression (|at) first match at the initial position of string cat, giving the result set [{0,0},{0,0}] (the second {0,0} is because of the subexpression marked by the parentheses). As the length of the match is 0, we do not advance to the next position yet.

      • At offset 0 with [anchored, notempty_atstart] - The search is @@ -2245,7 +2245,7 @@ of results and the position in the search string is advanced two steps.

      • At offset 3 - The search once again matches the empty string, giving [{3,0},{3,0}].

      • At offset 1 with [anchored, notempty_atstart] - This gives no result of length > 0 and we are at the last position, so the global search is -complete.

      The result of the call is:

      {match,[[{0,0},{0,0}],[{1,0},{1,0}],[{1,2},{1,2}],[{3,0},{3,0}]]}
    • notempty - An empty string is not considered to be a valid match if this +complete.

    The result of the call is:

    {match,[[{0,0},{0,0}],[{1,0},{1,0}],[{1,2},{1,2}],[{3,0},{3,0}]]}
  • notempty - An empty string is not considered to be a valid match if this option is specified. If alternatives in the pattern exist, they are tried. If all the alternatives match the empty string, the entire match fails.

    Example:

    If the following pattern is applied to a string not beginning with "a" or "b", it would normally match the empty string at the start of the subject:

    a?b?

    With option notempty, this match is invalid, so run/3 searches @@ -2316,12 +2316,12 @@ instead of the stack, the amount of heap memory that can be used.

  • The Erlang VM uses a PCRE library where heap memory is used when regular expression match recursion occurs. This therefore limits the use of machine heap, not C stack.

    Specifying a lower value can result in matches with deep recursion failing, -when they should have matched:

    1> re:run("aaaaaaaaaaaaaz","(a+)*z").
    -{match,[{0,14},{0,13}]}
    -2> re:run("aaaaaaaaaaaaaz","(a+)*z",[{match_limit_recursion,5}]).
    +when they should have matched:

    1> re:run("aaaaaaaaaaaaaz","(a+)*z").
    +{match,[{0,14},{0,13}]}
    +2> re:run("aaaaaaaaaaaaaz","(a+)*z",[{match_limit_recursion,5}]).
     nomatch
    -3> re:run("aaaaaaaaaaaaaz","(a+)*z",[{match_limit_recursion,5},report_errors]).
    -{error,match_limit_recursion}

    This option and option match_limit are only to be used in rare cases. +3> re:run("aaaaaaaaaaaaaz","(a+)*z",[{match_limit_recursion,5},report_errors]). +{error,match_limit_recursion}

    This option and option match_limit are only to be used in rare cases. Understanding of the PCRE library internals is recommended before tampering with these limits.

  • {offset, integer() >= 0} - Start matching at the offset (position) specified in the subject string. The offset is zero-based, so that the default @@ -2343,9 +2343,9 @@ capturing).

    As an example of the default behavior, the following call returns, as first and only captured string, the matching part of the subject ("abcd" in the middle) as an index pair {3,4}, where character positions are zero-based, -just as in offsets:

    re:run("ABCabcdABC","abcd",[]).

    The return value of this call is:

    {match,[{3,4}]}

    Another (and quite common) case is where the regular expression matches all of -the subject:

    re:run("ABCabcdABC",".*abcd.*",[]).

    Here the return value correspondingly points out all of the string, beginning -at index 0, and it is 10 characters long:

    {match,[{0,10}]}

    If the regular expression contains capturing subpatterns, like in:

    re:run("ABCabcdABC",".*(abcd).*",[]).

    all of the matched subject is captured, as well as the captured substrings:

    {match,[{0,10},{3,4}]}

    The complete matching pattern always gives the first return value in the list +just as in offsets:

    re:run("ABCabcdABC","abcd",[]).

    The return value of this call is:

    {match,[{3,4}]}

    Another (and quite common) case is where the regular expression matches all of +the subject:

    re:run("ABCabcdABC",".*abcd.*",[]).

    Here the return value correspondingly points out all of the string, beginning +at index 0, and it is 10 characters long:

    {match,[{0,10}]}

    If the regular expression contains capturing subpatterns, like in:

    re:run("ABCabcdABC",".*(abcd).*",[]).

    all of the matched subject is captured, as well as the captured substrings:

    {match,[{0,10},{3,4}]}

    The complete matching pattern always gives the first return value in the list and the remaining subpatterns are added in the order they occurred in the regular expression.

    The capture tuple is built up as follows:

    • ValueSpec - Specifies which captured (sub)patterns are to be returned. ValueSpec can either be an atom describing a predefined set of return @@ -2370,12 +2370,12 @@ subpatterns (see below) in the regular expression, one can use atom/0s or string/0s to specify the subpatterns to be returned. For example, consider the regular expression:

      ".*(abcd).*"

      matched against string "ABCabcdABC", capturing only the "abcd" part (the -first explicit subpattern):

      re:run("ABCabcdABC",".*(abcd).*",[{capture,[1]}]).

      The call gives the following result, as the first explicitly captured +first explicit subpattern):

      re:run("ABCabcdABC",".*(abcd).*",[{capture,[1]}]).

      The call gives the following result, as the first explicitly captured subpattern is "(abcd)", matching "abcd" in the subject, at (zero-based) -position 3, of length 4:

      {match,[{3,4}]}

      Consider the same regular expression, but with the subpattern explicitly +position 3, of length 4:

      {match,[{3,4}]}

      Consider the same regular expression, but with the subpattern explicitly named 'FOO':

      ".*(?<FOO>abcd).*"

      With this expression, we could still give the index of the subpattern with -the following call:

      re:run("ABCabcdABC",".*(?<FOO>abcd).*",[{capture,[1]}]).

      giving the same result as before. But, as the subpattern is named, we can -also specify its name in the value list:

      re:run("ABCabcdABC",".*(?<FOO>abcd).*",[{capture,['FOO']}]).

      This would give the same result as the earlier examples, namely:

      {match,[{3,4}]}

      The values list can specify indexes or names not present in the regular +the following call:

      re:run("ABCabcdABC",".*(?<FOO>abcd).*",[{capture,[1]}]).

      giving the same result as before. But, as the subpattern is named, we can +also specify its name in the value list:

      re:run("ABCabcdABC",".*(?<FOO>abcd).*",[{capture,['FOO']}]).

      This would give the same result as the earlier examples, namely:

      {match,[{3,4}]}

      The values list can specify indexes or names not present in the regular expression, in which case the return values vary depending on the type. If the type is index, the tuple {-1,0} is returned for values with no corresponding subpattern in the regular expression, but for the other types @@ -2410,12 +2410,12 @@ string:

      "ABCabcdABC"

      the subpattern at index 2 does not match, as "abdd" is not present in the string, but the complete pattern matches (because of the alternative a(..d)). The subpattern at index 2 is therefore unassigned and the default -return value is:

      {match,[{0,10},{3,4},{-1,0},{4,3}]}

      Setting the capture Type to binary gives:

      {match,[<<"ABCabcdABC">>,<<"abcd">>,<<>>,<<"bcd">>]}

      Here the empty binary (<<>>) represents the unassigned subpattern. In the +return value is:

      {match,[{0,10},{3,4},{-1,0},{4,3}]}

      Setting the capture Type to binary gives:

      {match,[<<"ABCabcdABC">>,<<"abcd">>,<<>>,<<"bcd">>]}

      Here the empty binary (<<>>) represents the unassigned subpattern. In the binary case, some information about the matching is therefore lost, as <<>> can also be an empty string captured.

      If differentiation between empty matches and non-existing subpatterns is necessary, use the type index and do the conversion to the final type in Erlang code.

      When option global is speciified, the capture specification affects each -match separately, so that:

      re:run("cacb","c(a|b)",[global,{capture,[1],list}]).

      gives

      {match,[["a"],["b"]]}

    For a descriptions of options only affecting the compilation step, see +match separately, so that:

    re:run("cacb","c(a|b)",[global,{capture,[1],list}]).

    gives

    {match,[["a"],["b"]]}
  • For a descriptions of options only affecting the compilation step, see compile/2.

    @@ -2504,7 +2504,7 @@ compilation option is specified to this function, both the regular expression and Subject are to be specified as valid Unicode charlist()s.

    The result is given as a list of "strings", the preferred data type specified in option return (default iodata).

    If subexpressions are specified in the regular expression, the matching -subexpressions are returned in the resulting list as well. For example:

    re:split("Erlang","[ln]",[{return,list}]).

    gives

    ["Er","a","g"]

    while

    re:split("Erlang","([ln])",[{return,list}]).

    gives

    ["Er","l","a","n","g"]

    The text matching the subexpression (marked by the parentheses in the regular +subexpressions are returned in the resulting list as well. For example:

    re:split("Erlang","[ln]",[{return,list}]).

    gives

    ["Er","a","g"]

    while

    re:split("Erlang","([ln])",[{return,list}]).

    gives

    ["Er","l","a","n","g"]

    The text matching the subexpression (marked by the parentheses in the regular expression) is inserted in the result list where it was found. This means that concatenating the result of a split where the whole regular expression is a single subexpression (as in the last example) always results in the original @@ -2512,21 +2512,21 @@ "g"), nothing is inserted after that. To make the group of strings and the parts matching the subexpressions more obvious, one can use option group, which groups together the part of the subject string with the parts matching the -subexpressions when the string was split:

    re:split("Erlang","([ln])",[{return,list},group]).

    gives

    [["Er","l"],["a","n"],["g"]]

    Here the regular expression first matched the "l", causing "Er" to be the first +subexpressions when the string was split:

    re:split("Erlang","([ln])",[{return,list},group]).

    gives

    [["Er","l"],["a","n"],["g"]]

    Here the regular expression first matched the "l", causing "Er" to be the first part in the result. When the regular expression matched, the (only) subexpression was bound to the "l", so the "l" is inserted in the group together with "Er". The next match is of the "n", making "a" the next part to be returned. As the subexpression is bound to substring "n" in this case, the "n" is inserted into this group. The last group consists of the remaining string, as no more matches are found.

    By default, all parts of the string, including the empty strings, are returned -from the function, for example:

    re:split("Erlang","[lg]",[{return,list}]).

    gives

    ["Er","an",[]]

    as the matching of the "g" in the end of the string leaves an empty rest, which +from the function, for example:

    re:split("Erlang","[lg]",[{return,list}]).

    gives

    ["Er","an",[]]

    as the matching of the "g" in the end of the string leaves an empty rest, which is also returned. This behavior differs from the default behavior of the split function in Perl, where empty strings at the end are by default removed. To get -the "trimming" default behavior of Perl, specify trim as an option:

    re:split("Erlang","[lg]",[{return,list},trim]).

    gives

    ["Er","an"]

    The "trim" option says; "give me as many parts as possible except the empty +the "trimming" default behavior of Perl, specify trim as an option:

    re:split("Erlang","[lg]",[{return,list},trim]).

    gives

    ["Er","an"]

    The "trim" option says; "give me as many parts as possible except the empty ones", which sometimes can be useful. You can also specify how many parts you -want, by specifying {parts,N}:

    re:split("Erlang","[lg]",[{return,list},{parts,2}]).

    gives

    ["Er","ang"]

    Notice that the last part is "ang", not "an", as splitting was specified into /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/sets.xhtml differs (HTML document, ASCII text, with very long lines (1588)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/sets.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/sets.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -51,11 +51,11 @@ respect to the aforementioned functions, their overall behavior may differ. As mentioned, this module considers elements as different if and only if they do not match (=:=), while both ordsets and gb_sets consider elements -as different if and only if they do not compare equal (==).

    Example:

    1> sets:is_element(1.0, sets:from_list([1])).
    +as different if and only if they do not compare equal (==).

    Example:

    1> sets:is_element(1.0, sets:from_list([1])).
     false
    -2> ordsets:is_element(1.0, ordsets:from_list([1])).
    +2> ordsets:is_element(1.0, ordsets:from_list([1])).
     true
    -2> gb_sets:is_element(1.0, gb_sets:from_list([1])).
    +2> gb_sets:is_element(1.0, gb_sets:from_list([1])).
     true

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/shell_default.xhtml differs (HTML document, ASCII text, with very long lines (420)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/shell_default.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/shell_default.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -24,10 +24,10 @@

    Customizing the Erlang environment.

    The functions in this module are called when no module name is specified in a -shell command.

    Consider the following shell dialog:

    1> lists:reverse("abc").
    +shell command.

    Consider the following shell dialog:

    1> lists:reverse("abc").
     "cba"
    -2> c(foo).
    -{ok, foo}

    In command one, module lists is called. In command two, no module name is +2> c(foo). +{ok, foo}

    In command one, module lists is called. In command two, no module name is specified. The shell searches module user_default followed by module shell_default for function c/1.

    shell_default is intended for "system wide" customizations to the shell. user_default is intended for "local" or individual user customizations.

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/shell.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (917)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/shell.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/shell.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -61,7 +61,7 @@ definitions. To facilitate matters, record definitions in modules shell_default and user_default (if loaded) are read each time a new job is started. For example, adding the following line to user_default makes the -definition of file_info readily available in the shell:

    -include_lib("kernel/include/file.hrl").

    The shell runs in two modes:

    Command 1 sets variable Str to string "abcd".

    2> L = length(Str).
    +4

    Command 2 sets L to the length of string Str.

    3> Descriptor = {L, list_to_atom(Str)}.
    +{4,abcd}

    Command 3 builds the tuple Descriptor, evaluating the BIF list_to_atom/1 .

    4> L.
    -4

    Command 4 prints the value of variable L.

    5> b().
    -Descriptor = {4,abcd}
    +4

    Command 4 prints the value of variable L.

    5> b().
    +Descriptor = {4,abcd}
     L = 4
     Str = "abcd"
     ok

    Command 5 evaluates the internal shell command b(), which is an abbreviation of "bindings". This prints the current shell variables and their bindings. ok -at the end is the return value of function b().

    6> f(L).
    +at the end is the return value of function b().

    6> f(L).
     ok

    Command 6 evaluates the internal shell command f(L) (abbreviation of -"forget"). The value of variable L is removed.

    7> b().
    -Descriptor = {4,abcd}
    +"forget"). The value of variable L is removed.

    7> b().
    +Descriptor = {4,abcd}
     Str = "abcd"
    -ok

    Command 7 prints the new bindings.

    8> f(L).
    -ok

    Command 8 has no effect, as L has no value.

    9> {L, _} = Descriptor.
    -{4,abcd}

    Command 9 performs a pattern matching operation on Descriptor, binding a new +ok

    Command 7 prints the new bindings.

    8> f(L).
    +ok

    Command 8 has no effect, as L has no value.

    9> {L, _} = Descriptor.
    +{4,abcd}

    Command 9 performs a pattern matching operation on Descriptor, binding a new value to L.

    10> L.
    -4

    Command 10 prints the current value of L.

    11> {P, Q, R} = Descriptor.
    +4

    Command 10 prints the current value of L.

    11> {P, Q, R} = Descriptor.
     ** exception error: no match of right hand side value {4,abcd}

    Command 11 tries to match {P, Q, R} against Descriptor, which is {4, abc}. The match fails and none of the new variables become bound. The printout starting with "** exception error:" is not the value of the expression (the @@ -161,74 +161,74 @@ other variables (L, Str, and so on) are unchanged.

    12> P.
     * 1:1: variable 'P' is unbound
     13> Descriptor.
    -{4,abcd}

    Commands 12 and 13 show that P is unbound because the previous command failed, -and that Descriptor has not changed.

    14>{P, Q} = Descriptor.
    -{4,abcd}
    +{4,abcd}

    Commands 12 and 13 show that P is unbound because the previous command failed, +and that Descriptor has not changed.

    14>{P, Q} = Descriptor.
    +{4,abcd}
     15> P.
    -4

    Commands 14 and 15 show a correct match where P and Q are bound.

    16> f().
    -ok

    Command 16 clears all bindings.

    The next few commands assume that test1:demo(X) is defined as follows:

    demo(X) ->
    -    put(aa, worked),
    +4

    Commands 14 and 15 show a correct match where P and Q are bound.

    16> f().
    +ok

    Command 16 clears all bindings.

    The next few commands assume that test1:demo(X) is defined as follows:

    demo(X) ->
    +    put(aa, worked),
         X = 1,
    -    X + 10.
    17> put(aa, hello).
    +    X + 10.
    17> put(aa, hello).
     undefined
    -18> get(aa).
    +18> get(aa).
     hello

    Commands 17 and 18 set and inspect the value of item aa in the process -dictionary.

    19> Y = test1:demo(1).
    +dictionary.

    19> Y = test1:demo(1).
     11

    Command 19 evaluates test1:demo(1). The evaluation succeeds and the changes made in the process dictionary become visible to the shell. The new value of -dictionary item aa can be seen in command 20.

    20> get().
    -[{aa,worked}]
    -21> put(aa, hello).
    +dictionary item aa can be seen in command 20.

    20> get().
    +[{aa,worked}]
    +21> put(aa, hello).
     worked
    -22> Z = test1:demo(2).
    +22> Z = test1:demo(2).
     ** exception error: no match of right hand side value 1
          in function  test1:demo/1

    Commands 21 and 22 change the value of dictionary item aa to hello and call test1:demo(2). Evaluation fails and the changes made to the dictionary in test1:demo(2), before the error occurred, are discarded.

    23> Z.
     * 1:1: variable 'Z' is unbound
    -24> get(aa).
    +24> get(aa).
     hello

    Commands 23 and 24 show that Z was not bound and that dictionary item aa has -retained its original value.

    25> erase(), put(aa, hello).
    +retained its original value.

    25> erase(), put(aa, hello).
     undefined
    -26> spawn(test1, demo, [1]).
    +26> spawn(test1, demo, [1]).
     <0.57.0>
    -27> get(aa).
    +27> get(aa).
     hello

    Commands 25, 26, and 27 show the effect of evaluating test1:demo(1) in the background. In this case, the expression is evaluated in a newly spawned process. Any changes made in the process dictionary are local to the newly -spawned process and therefore not visible to the shell.

    28> io:format("hello hello\n").
    +spawned process and therefore not visible to the shell.

    28> io:format("hello hello\n").
     hello hello
     ok
    -29> e(28).
    +29> e(28).
     hello hello
     ok
    -30> v(28).
    +30> v(28).
     ok

    Commands 28, 29 and 30 use the history facilities of the shell. Command 29 re-evaluates command 28. Command 30 uses the value (result) of command 28. In the cases of a pure function (a function with no side effects), the result is the same. For a function with side effects, the result can be different.

    The next few commands show some record manipulation. It is assumed that ex.erl -defines a record as follows:

    -record(rec, {a, b = val()}).

    val() ->
        3.

    31> c(ex).
    -{ok,ex}
    -32> rr(ex).
    -[rec]

    Commands 31 and 32 compile file ex.erl and read the record definitions in +defines a record as follows:

    -record(rec, {a, b = val()}).

    val() ->
        3.

    31> c(ex).
    +{ok,ex}
    +32> rr(ex).
    +[rec]

    Commands 31 and 32 compile file ex.erl and read the record definitions in ex.beam. If the compiler did not output any record definitions on the BEAM -file, rr(ex) tries to read record definitions from the source file instead.

    33> rl(rec).
    --record(rec,{a,b = val()}).
    -ok

    Command 33 prints the definition of the record named rec.

    34> #rec{}.
    +file, rr(ex) tries to read record definitions from the source file instead.

    33> rl(rec).
    +-record(rec,{a,b = val()}).
    +ok

    Command 33 prints the definition of the record named rec.

    34> #rec{}.
     ** exception error: undefined shell command val/0

    Command 34 tries to create a rec record, but fails as function val/0 is -undefined.

    35> #rec{b = 3}.
    -#rec{a = undefined,b = 3}

    Command 35 shows the workaround: explicitly assign values to record fields that -cannot otherwise be initialized.

    36> rp(v(-1)).
    -#rec{a = undefined,b = 3}
    +undefined.

    35> #rec{b = 3}.
    +#rec{a = undefined,b = 3}

    Command 35 shows the workaround: explicitly assign values to record fields that +cannot otherwise be initialized.

    36> rp(v(-1)).
    +#rec{a = undefined,b = 3}
     ok

    Command 36 prints the newly created record using record definitions maintained -by the shell.

    37> rd(rec, {f = orddict:new()}).
    +by the shell.

    37> rd(rec, {f = orddict:new()}).
     rec

    Command 37 defines a record directly in the shell. The definition replaces the -one read from file ex.beam.

    38> #rec{}.
    -#rec{f = []}
    -ok

    Command 38 creates a record using the new definition, and prints the result.

    39> rd(rec, {c}), A.
    +one read from file ex.beam.

    38> #rec{}.
    +#rec{f = []}
    +ok

    Command 38 creates a record using the new definition, and prints the result.

    39> rd(rec, {c}), A.
     * 1:15: variable 'A' is unbound
    -40> #rec{}.
    -#rec{c = undefined}
    +40> #rec{}.
    +#rec{c = undefined}
     ok

    Command 39 and 40 show that record definitions are updated as side effects. The evaluation of the command fails, but the definition of rec has been carried out.

    For the next command, it is assumed that test1:loop(N) is defined as follows:

    loop(N) ->
        io:format("Hello Number: ~w~n", [N]),
        loop(N+1).

    41> test1:loop(0).
    @@ -254,31 +254,31 @@
     JCL mode the user can start and stop jobs.

    In this particular case, command i ("interrupt") terminates the looping program, and command c connects to the shell again. As the process was running in the background before we killed it, more printouts occur before message -"** exception exit: killed" is shown.

    42> E = ets:new(t, []).
    -#Ref<0.1662103692.2407923716.214192>

    Command 42 creates an ETS table.

    43> ets:insert({d,1,2}).
    +"** exception exit: killed" is shown.

    42> E = ets:new(t, []).
    +#Ref<0.1662103692.2407923716.214192>

    Command 42 creates an ETS table.

    43> ets:insert({d,1,2}).
     ** exception error: undefined function ets:insert/1

    Command 43 tries to insert a tuple into the ETS table, but the first argument -(the table) is missing. The exception kills the evaluator process.

    44> ets:insert(E, {d,1,2}).
    +(the table) is missing. The exception kills the evaluator process.

    44> ets:insert(E, {d,1,2}).
     ** exception error: argument is of wrong type
          in function  ets:insert/2
             called as ets:insert(16,{d,1,2})

    Command 44 corrects the mistake, but the ETS table has been destroyed as it was -owned by the killed evaluator process.

    45> f(E).
    +owned by the killed evaluator process.

    45> f(E).
     ok
    -46> catch_exception(true).
    +46> catch_exception(true).
     false

    Command 46 sets the exception handling of the evaluator process to true. The exception handling can also be set when starting Erlang by -erl -stdlib shell_catch_exception true.

    47> E = ets:new(t, []).
    +erl -stdlib shell_catch_exception true.

    47> E = ets:new(t, []).
     #Ref<0.1662103692.2407923716.214197>
    -48> ets:insert({d,1,2}).
    +48> ets:insert({d,1,2}).
     * exception error: undefined function ets:insert/1

    Command 48 makes the same mistake as in command 43, but this time the evaluator process lives on. The single star at the beginning of the printout signals that -the exception has been caught.

    49> ets:insert(E, {d,1,2}).
    -true

    Command 49 successfully inserts the tuple into the ETS table.

    50> ets:insert(#Ref<0.1662103692.2407923716.214197>, {e,3,4}).
    +the exception has been caught.

    49> ets:insert(E, {d,1,2}).
    +true

    Command 49 successfully inserts the tuple into the ETS table.

    50> ets:insert(#Ref<0.1662103692.2407923716.214197>, {e,3,4}).
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/slave.xhtml differs (HTML document, ASCII text, with very long lines (979))
    --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/slave.xhtml	2026-06-04 00:07:10.000000000 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/slave.xhtml	2042-07-06 13:26:37.000000000 +0000
    @@ -259,7 +259,7 @@
     at a master node. A pseudo server is an intermediary that only has the same
     registered name as the real server.

    For example, if you have started a slave node N and want to execute pxw graphics code on this node, you can start server pxw_server as a pseudo server -at the slave node. This is illustrated as follows:

    rpc:call(N, slave, pseudo, [node(), [pxw_server]]).
    +at the slave node. This is illustrated as follows:

    rpc:call(N, slave, pseudo, [node(), [pxw_server]]).
    @@ -413,9 +413,9 @@ passed to the new node and can be used for a variety of purposes; see erl(1).

    As an example, suppose that you want to start a slave node at host H with node name Name@H and want the slave node to have the following properties:

    • Directory Dir is to be added to the code path.
    • The Mnesia directory is to be set to M.
    • The Unix DISPLAY environment variable is to be set to the display of the -master node.

    The following code is executed to achieve this:

    E = " -env DISPLAY " ++ net_adm:localhost() ++ ":0 ",
    +master node.

    The following code is executed to achieve this:

    E = " -env DISPLAY " ++ net_adm:localhost() ++ ":0 ",
     Arg = "-mnesia_dir " ++ M ++ " -pa " ++ Dir ++ E,
    -slave:start(H, Name, Arg).

    The function returns {ok, Node}, where Node is the name of the new node, +slave:start(H, Name, Arg).

    The function returns {ok, Node}, where Node is the name of the new node, otherwise {error, Reason}, where Reason can be one of:

    • timeout - The master node failed to get in contact with the slave node. This can occur in a number of circumstances:

      • Erlang/OTP is not installed on the remote host.
      • The file system on the other host has a different structure to the the master.
      • The Erlang nodes have different cookies.
    • no_rsh - No remote shell program was found on the computer. Note that /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/sofs.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (1348)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/sofs.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/sofs.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -157,11 +157,11 @@ selecting, duplicating, or rearranging parts of the elements.

    • Specifying a SetFun as an integer I is equivalent to specifying {external, fun(X) -> element(I, X) end}, but is to be preferred, as it makes it possible to handle this case even more efficiently.

    Examples of SetFuns:

    fun sofs:union/1
    -fun(S) -> sofs:partition(1, S) end
    -{external, fun(A) -> A end}
    -{external, fun({A,_,C}) -> {C,A} end}
    -{external, fun({_,{_,C}}) -> C end}
    -{external, fun({_,{_,{_,E}=C}}) -> {E,{E,C}} end}
    +fun(S) -> sofs:partition(1, S) end
    +{external, fun(A) -> A end}
    +{external, fun({A,_,C}) -> {C,A} end}
    +{external, fun({_,{_,C}}) -> C end}
    +{external, fun({_,{_,{_,E}=C}}) -> {E,{E,C}} end}
     2

    The order in which a SetFun is applied to the elements of an unordered set is not specified, and can change in future versions of this module.

    The execution time of the functions of this module is dominated by the time it takes to sort lists. When no sorting is needed, the execution time is in the @@ -1711,10 +1711,10 @@ belongs to SetOfSets and E belongs to Set.

    If SetOfSets is a partition of a set X and R is the equivalence relation in X induced by SetOfSets, then the returned relation is the canonical map from X onto the equivalence classes with -respect to R.

    1> Ss = sofs:from_term([[a,b],[b,c]]),
    -CR = sofs:canonical_relation(Ss),
    -sofs:to_external(CR).
    -[{a,[a,b]},{b,[a,b]},{b,[b,c]},{c,[b,c]}]
    +respect to R.

    1> Ss = sofs:from_term([[a,b],[b,c]]),
    +CR = sofs:canonical_relation(Ss),
    +sofs:to_external(CR).
    +[{a,[a,b]},{b,[a,b]},{b,[b,c]},{c,[b,c]}]
    @@ -1744,11 +1744,11 @@

    Returns the composite of the functions Function1 and -Function2.

    1> F1 = sofs:a_function([{a,1},{b,2},{c,2}]),
    -F2 = sofs:a_function([{1,x},{2,y},{3,z}]),
    -F = sofs:composite(F1, F2),
    -sofs:to_external(F).
    -[{a,x},{b,y},{c,y}]
    +Function2.

    1> F1 = sofs:a_function([{a,1},{b,2},{c,2}]),
    +F2 = sofs:a_function([{1,x},{2,y},{3,z}]),
    +F = sofs:composite(F1, F2),
    +sofs:to_external(F).
    +[{a,x},{b,y},{c,y}]
    @@ -1778,11 +1778,11 @@

    Creates the function that maps each element of set Set -onto AnySet.

    1> S = sofs:set([a,b]),
    -E = sofs:from_term(1),
    -R = sofs:constant_function(S, E),
    -sofs:to_external(R).
    -[{a,1},{b,1}]
    +onto AnySet.

    1> S = sofs:set([a,b]),
    +E = sofs:from_term(1),
    +R = sofs:constant_function(S, E),
    +sofs:to_external(R).
    +[{a,1},{b,1}]
    @@ -1810,10 +1810,10 @@ -

    Returns the converse of the binary relation BinRel1.

    1> R1 = sofs:relation([{1,a},{2,b},{3,a}]),
    -R2 = sofs:converse(R1),
    -sofs:to_external(R2).
    -[{a,1},{a,3},{b,2}]
    +

    Returns the converse of the binary relation BinRel1.

    1> R1 = sofs:relation([{1,a},{2,b},{3,a}]),
    +R2 = sofs:converse(R1),
    +sofs:to_external(R2).
    +[{a,1},{a,3},{b,2}]
    @@ -1931,10 +1931,10 @@ -

    Returns the domain of the binary relation BinRel.

    1> R = sofs:relation([{1,a},{1,b},{2,b},{2,c}]),
    -S = sofs:domain(R),
    -sofs:to_external(S).
    -[1,2]
    +

    Returns the domain of the binary relation BinRel.

    1> R = sofs:relation([{1,a},{1,b},{2,b},{2,c}]),
    +S = sofs:domain(R),
    +sofs:to_external(S).
    +[1,2]
    @@ -1964,11 +1964,11 @@

    Returns the difference between the binary relation BinRel1 and the -restriction of BinRel1 to Set.

    1> R1 = sofs:relation([{1,a},{2,b},{3,c}]),
    -S = sofs:set([2,4,6]),
    -R2 = sofs:drestriction(R1, S),
    -sofs:to_external(R2).
    -[{1,a},{3,c}]

    drestriction(R, S) is equivalent to +restriction of BinRel1 to Set.

    1> R1 = sofs:relation([{1,a},{2,b},{3,c}]),
    +S = sofs:set([2,4,6]),
    +R2 = sofs:drestriction(R1, S),
    +sofs:to_external(R2).
    +[{1,a},{3,c}]

    drestriction(R, S) is equivalent to difference(R, restriction(R, S)).

    @@ -1999,12 +1999,12 @@

    Returns a subset of Set1 containing those elements that do not give an element -in Set2 as the result of applying SetFun.

    1> SetFun = {external, fun({_A,B,C}) -> {B,C} end},
    -R1 = sofs:relation([{a,aa,1},{b,bb,2},{c,cc,3}]),
    -R2 = sofs:relation([{bb,2},{cc,3},{dd,4}]),
    -R3 = sofs:drestriction(SetFun, R1, R2),
    -sofs:to_external(R3).
    -[{a,aa,1}]

    drestriction(F, S1, S2) is equivalent to +in Set2 as the result of applying SetFun.

    1> SetFun = {external, fun({_A,B,C}) -> {B,C} end},
    +R1 = sofs:relation([{a,aa,1},{b,bb,2},{c,cc,3}]),
    +R2 = sofs:relation([{bb,2},{cc,3},{dd,4}]),
    +R3 = sofs:drestriction(SetFun, R1, R2),
    +sofs:to_external(R3).
    +[{a,aa,1}]

    drestriction(F, S1, S2) is equivalent to difference(S1, restriction(F, S1, S2)).

    @@ -2069,12 +2069,12 @@

    Returns the extension of BinRel1 such that for each element E in Set that does not belong to the domain of -BinRel1, BinRel2 contains the pair (E, AnySet).

    1> S = sofs:set([b,c]),
    -A = sofs:empty_set(),
    -R = sofs:family([{a,[1,2]},{b,[3]}]),
    -X = sofs:extension(R, S, A),
    -sofs:to_external(X).
    -[{a,[1,2]},{b,[3]},{c,[]}]
    +BinRel1, BinRel2 contains the pair (E, AnySet).

    1> S = sofs:set([b,c]),
    +A = sofs:empty_set(),
    +R = sofs:family([{a,[1,2]},{b,[3]}]),
    +X = sofs:extension(R, S, A),
    +sofs:to_external(X).
    +[{a,[1,2]},{b,[3]},{c,[]}]
    @@ -2163,11 +2163,11 @@

    If Family1 and Family2 are families, then Family3 is the family such that the index set is equal to the index set of Family1, and Family3[i] is the difference between Family1[i] and Family2[i] if -Family2 maps i, otherwise Family1[i].

    1> F1 = sofs:family([{a,[1,2]},{b,[3,4]}]),
    -F2 = sofs:family([{b,[4,5]},{c,[6,7]}]),
    -F3 = sofs:family_difference(F1, F2),
    -sofs:to_external(F3).
    -[{a,[1,2]},{b,[3]}]
    +Family2 maps i, otherwise Family1[i].

    1> F1 = sofs:family([{a,[1,2]},{b,[3,4]}]),
    +F2 = sofs:family([{b,[4,5]},{c,[6,7]}]),
    +F3 = sofs:family_difference(F1, F2),
    +sofs:to_external(F3).
    +[{a,[1,2]},{b,[3]}]
    @@ -2198,10 +2198,10 @@

    If Family1 is a family and Family1[i] is a binary relation for every i in the index set of Family1, then Family2 is the family with the same index set as Family1 such that Family2[i] is the -domain of Family1[i].

    1> FR = sofs:from_term([{a,[{1,a},{2,b},{3,c}]},{b,[]},{c,[{4,d},{5,e}]}]),
    -F = sofs:family_domain(FR),
    -sofs:to_external(F).
    -[{a,[1,2,3]},{b,[]},{c,[4,5]}]
    +domain of Family1[i].

    1> FR = sofs:from_term([{a,[{1,a},{2,b},{3,c}]},{b,[]},{c,[{4,d},{5,e}]}]),
    +F = sofs:family_domain(FR),
    +sofs:to_external(F).
    +[{a,[1,2,3]},{b,[]},{c,[4,5]}]
    @@ -2232,10 +2232,10 @@

    If Family1 is a family and Family1[i] is a binary relation for every i in the index set of Family1, then Family2 is the family with the same index set as Family1 such that Family2[i] is the -field of Family1[i].

    1> FR = sofs:from_term([{a,[{1,a},{2,b},{3,c}]},{b,[]},{c,[{4,d},{5,e}]}]),
    -F = sofs:family_field(FR),
    -sofs:to_external(F).
    -[{a,[1,2,3,a,b,c]},{b,[]},{c,[4,5,d,e]}]

    family_field(Family1) is equivalent to +field of Family1[i].

    1> FR = sofs:from_term([{a,[{1,a},{2,b},{3,c}]},{b,[]},{c,[{4,d},{5,e}]}]),
    +F = sofs:family_field(FR),
    +sofs:to_external(F).
    +[{a,[1,2,3,a,b,c]},{b,[]},{c,[4,5,d,e]}]

    family_field(Family1) is equivalent to family_union(family_domain(Family1), family_range(Family1)).

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/stdlib_app.xhtml differs (HTML document, ASCII text, with very long lines (1971)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/stdlib_app.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/stdlib_app.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -56,13 +56,13 @@ prompt function takes the main prompt as its only parameter.

  • shell_saved_results = integer() >= 0 - Can be used to determine how many results are saved by the Erlang shell.

  • shell_session_slogan = string() | fun() -> string()) - The slogan printed when starting an Erlang shell. Example:

    $ erl -stdlib shell_session_slogan '"Test slogan"'
    -Erlang/OTP 26 [DEVELOPMENT] [erts-13.0.2] [source] [64-bit] [smp:8:8] [ds:8:8:10] [async-threads:1] [jit:ns]
    +Erlang/OTP 26 [DEVELOPMENT] [erts-13.0.2] [source] [64-bit] [smp:8:8] [ds:8:8:10] [async-threads:1] [jit:ns]
     
     Test slogan
     1>
  • shell_slogan = string() | fun(() -> string()) - The slogan printed when starting the Erlang shell subsystem. Example:

    $ erl -stdlib shell_slogan '"Test slogan"'
     Test slogan
    -Eshell V13.0.2  (abort with ^G)
    +Eshell V13.0.2  (abort with ^G)
     1>

    The default is the return value of erlang:system_info(system_version).

  • shell_strings = boolean() - Can be used to determine how the Erlang shell outputs lists of integers.

  • /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/string.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (1067)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/string.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/string.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -44,14 +44,14 @@ expect UTF-8 binaries but not all functions verify that all binaries are encoded correctly.

    Unless otherwise specified the return value type is the same as the input type. That is, binary input returns binary output, list input returns a list output, -and mixed input can return a mixed output.

    1> string:trim("  sarah  ").
    +and mixed input can return a mixed output.

    1> string:trim("  sarah  ").
     "sarah"
    -2> string:trim(<<"  sarah  ">>).
    +2> string:trim(<<"  sarah  ">>).
     <<"sarah">>
    -3> string:lexemes("foo bar", " ").
    -["foo","bar"]
    -4> string:lexemes(<<"foo bar">>, " ").
    -[<<"foo">>,<<"bar">>]

    This module has been reworked in Erlang/OTP 20 to handle unicode:chardata/0 +3> string:lexemes("foo bar", " "). +["foo","bar"] +4> string:lexemes(<<"foo bar">>, " "). +[<<"foo">>,<<"bar">>]

    This module has been reworked in Erlang/OTP 20 to handle unicode:chardata/0 and operate on grapheme clusters. The old functions that only work on Latin-1 lists as input are still available but should not be used, they will be @@ -951,7 +951,7 @@

    Converts String to a case-agnostic comparable string. Function casefold/1 is preferred over lowercase/1 -when two strings are to be compared for equality. See also equal/4.

    Example:

    1> string:casefold("Ω and ẞ SHARP S").
    +when two strings are to be compared for equality. See also equal/4.

    Example:

    1> string:casefold("Ω and ẞ SHARP S").
     "ω and ss sharp s"
    @@ -983,9 +983,9 @@

    Returns a string where any trailing \n or \r\n have been removed from -String.

    Example:

    182> string:chomp(<<"\nHello\n\n">>).
    +String.

    Example:

    182> string:chomp(<<"\nHello\n\n">>).
     <<"\nHello">>
    -183> string:chomp("\nHello\r\r\n").
    +183> string:chomp("\nHello\r\r\n").
     "\nHello\r"
    @@ -1086,11 +1086,11 @@ nfc, nfd, nfkc, and -nfkd.

    Example:

    1> string:equal("åäö", <<"åäö"/utf8>>).
    +nfkd.

    Example:

    1> string:equal("åäö", <<"åäö"/utf8>>).
     true
    -2> string:equal("åäö", unicode:characters_to_nfd_binary("åäö")).
    +2> string:equal("åäö", unicode:characters_to_nfd_binary("åäö")).
     false
    -3> string:equal("åäö", unicode:characters_to_nfd_binary("ÅÄÖ"), true, nfc).
    +3> string:equal("åäö", unicode:characters_to_nfd_binary("ÅÄÖ"), true, nfc).
     true
    @@ -1156,13 +1156,13 @@

    Removes anything before SearchPattern in String and returns the remainder of the string or nomatch if SearchPattern is not found. Dir, which can be leading or trailing, indicates from which direction characters are to be -searched.

    Example:

    1> string:find("ab..cd..ef", ".").
    +searched.

    Example:

    1> string:find("ab..cd..ef", ".").
     "..cd..ef"
    -2> string:find(<<"ab..cd..ef">>, "..", trailing).
    +2> string:find(<<"ab..cd..ef">>, "..", trailing).
     <<"..ef">>
    -3> string:find(<<"ab..cd..ef">>, "x", leading).
    +3> string:find(<<"ab..cd..ef">>, "x", leading).
     nomatch
    -4> string:find("ab..cd..ef", "x", trailing).
    +4> string:find("ab..cd..ef", "x", trailing).
     nomatch
    @@ -1193,9 +1193,9 @@ -

    Returns true if String is the empty string, otherwise false.

    Example:

    1> string:is_empty("foo").
    +

    Returns true if String is the empty string, otherwise false.

    Example:

    1> string:is_empty("foo").
     false
    -2> string:is_empty(["",<<>>]).
    +2> string:is_empty(["",<<>>]).
     true
    @@ -1233,13 +1233,13 @@

    Returns a float between +0.0 and 1.0 representing the Jaro similarity between the given strings. Strings with a higher similarity will score closer -to 1.0, with +0.0 meaning no similarity and 1.0 meaning an exact match.

    Example:

    1> string:jaro_similarity("ditto", "ditto").
    +to 1.0, with +0.0 meaning no similarity and 1.0 meaning an exact match.

    Example:

    1> string:jaro_similarity("ditto", "ditto").
     1.0
    -2> string:jaro_similarity("foo", "bar").
    +2> string:jaro_similarity("foo", "bar").
     +0.0
    -3> string:jaro_similarity("michelle", "michael").
    +3> string:jaro_similarity("michelle", "michael").
     0.8690476190476191
    -4> string:jaro_similarity(<<"Édouard"/utf8>>, <<"Claude">>).
    +4> string:jaro_similarity(<<"Édouard"/utf8>>, <<"Claude">>).
     0.5317460317460317

    The Jaro distance between two strings can be calculated with JaroDistance = 1.0 - JaroSimilarity.

    @@ -1271,9 +1271,9 @@ -

    Returns the number of grapheme clusters in String.

    Example:

    1> string:length("ß↑e̊").
    +

    Returns the number of grapheme clusters in String.

    Example:

    1> string:length("ß↑e̊").
     3
    -2> string:length(<<195,159,226,134,145,101,204,138>>).
    +2> string:length(<<195,159,226,134,145,101,204,138>>).
     3
    @@ -1308,10 +1308,10 @@

    Returns a list of lexemes in String, separated by the grapheme clusters in SeparatorList.

    Notice that, as shown in this example, two or more adjacent separator graphemes clusters in String are treated as one. That is, there are no empty strings in -the resulting list of lexemes. See also split/3 which returns empty strings.

    Notice that [$\r,$\n] is one grapheme cluster.

    Example:

    1> string:lexemes("abc de̊fxxghix jkl\r\nfoo", "x e" ++ [[$\r,$\n]]).
    -["abc","de̊f","ghi","jkl","foo"]
    -2> string:lexemes(<<"abc de̊fxxghix jkl\r\nfoo"/utf8>>, "x e" ++ [$\r,$\n]).
    -[<<"abc">>,<<"de̊f"/utf8>>,<<"ghi">>,<<"jkl\r\nfoo">>]
    +the resulting list of lexemes. See also split/3 which returns empty strings.

    Notice that [$\r,$\n] is one grapheme cluster.

    Example:

    1> string:lexemes("abc de̊fxxghix jkl\r\nfoo", "x e" ++ [[$\r,$\n]]).
    +["abc","de̊f","ghi","jkl","foo"]
    +2> string:lexemes(<<"abc de̊fxxghix jkl\r\nfoo"/utf8>>, "x e" ++ [$\r,$\n]).
    +[<<"abc">>,<<"de̊f"/utf8>>,<<"ghi">>,<<"jkl\r\nfoo">>]
    @@ -1342,7 +1342,7 @@

    Converts String to lowercase.

    Notice that function casefold/1 should be used when converting a string to be -tested for equality.

    Example:

    2> string:lowercase(string:uppercase("Michał")).
    +tested for equality.

    Example:

    2> string:lowercase(string:uppercase("Michał")).
     "michał"
    @@ -1376,8 +1376,8 @@

    Returns the first codepoint in String and the rest of String in the tail. Returns an empty list if String is empty or an {error, String} tuple if the -next byte is invalid.

    Example:

    1> string:next_codepoint(unicode:characters_to_binary("e̊fg")).
    -[101|<<"̊fg"/utf8>>]
    +next byte is invalid.

    Example:

    1> string:next_codepoint(unicode:characters_to_binary("e̊fg")).
    +[101|<<"̊fg"/utf8>>]
    @@ -1411,8 +1411,8 @@

    Returns the first grapheme cluster in String and the rest of String in the tail. Returns an empty list if String is empty or an {error, String} tuple -if the next byte is invalid.

    Example:

    1> string:next_grapheme(unicode:characters_to_binary("e̊fg")).
    -["e̊"|<<"fg">>]
    +if the next byte is invalid.

    Example:

    1> string:next_grapheme(unicode:characters_to_binary("e̊fg")).
    +["e̊"|<<"fg">>]
    @@ -1447,7 +1447,7 @@

    Returns lexeme number N in String, where lexemes are separated by the -grapheme clusters in SeparatorList.

    Example:

    1> string:nth_lexeme("abc.de̊f.ghiejkl", 3, ".e").
    +grapheme clusters in SeparatorList.

    Example:

    1> string:nth_lexeme("abc.de̊f.ghiejkl", 3, ".e").
     "ghi"
    @@ -1545,11 +1545,11 @@

    Pads String to Length with grapheme cluster Char. Dir, which can be -leading, trailing, or both, indicates where the padding should be added.

    Example:

    1> string:pad(<<"He̊llö"/utf8>>, 8).
    -[<<72,101,204,138,108,108,195,182>>,32,32,32]
    -2> io:format("'~ts'~n",[string:pad("He̊llö", 8, leading)]).
    +leading, trailing, or both, indicates where the padding should be added.

    Example:

    1> string:pad(<<"He̊llö"/utf8>>, 8).
    +[<<72,101,204,138,108,108,195,182>>,32,32,32]
    +2> io:format("'~ts'~n",[string:pad("He̊llö", 8, leading)]).
     '   He̊llö'
    -3> io:format("'~ts'~n",[string:pad("He̊llö", 8, both)]).
    +3> io:format("'~ts'~n",[string:pad("He̊llö", 8, both)]).
     ' He̊llö  '
    @@ -1581,9 +1581,9 @@

    If Prefix is the prefix of String, removes it and returns the remainder of -String, otherwise returns nomatch.

    Example:

    1> string:prefix(<<"prefix of string">>, "pre").
    +String, otherwise returns nomatch.

    Example:

    1> string:prefix(<<"prefix of string">>, "pre").
     <<"fix of string">>
    -2> string:prefix("pre", "prefix").
    +2> string:prefix("pre", "prefix").
     nomatch
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/supervisor.xhtml differs (HTML document, ASCII text, with very long lines (731)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/supervisor.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/supervisor.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -53,10 +53,10 @@ Supervisor flags

    The supervisor properties are defined by the supervisor flags. The type -definition for the supervisor flags is as follows:

    sup_flags() = #{strategy => strategy(),           % optional
    -                intensity => non_neg_integer(),   % optional
    -                period => pos_integer(),          % optional
    -                auto_shutdown => auto_shutdown()} % optional

    Restart Strategies

    A supervisor can have one of the following restart strategies specified with +definition for the supervisor flags is as follows:

    sup_flags() = #{strategy => strategy(),           % optional
    +                intensity => non_neg_integer(),   % optional
    +                period => pos_integer(),          % optional
    +                auto_shutdown => auto_shutdown()} % optional

    Restart Strategies

    A supervisor can have one of the following restart strategies specified with the strategy key in the above map:

    • one_for_one - If one child process terminates and is to be restarted, only that child process is affected. This is the default restart strategy.

    • one_for_all - If one child process terminates and is to be restarted, all other child processes are terminated and then all child processes are @@ -100,13 +100,13 @@ Child specification

    -

    The type definition of a child specification is as follows:

    child_spec() = #{id => child_id(),             % mandatory
    -                 start => mfargs(),            % mandatory
    -                 restart => restart(),         % optional
    -                 significant => significant(), % optional
    -                 shutdown => shutdown(),       % optional
    -                 type => worker(),             % optional
    -                 modules => modules()}         % optional

    The old tuple format is kept for backwards compatibility, see child_spec/0, +

    The type definition of a child specification is as follows:

    child_spec() = #{id => child_id(),             % mandatory
    +                 start => mfargs(),            % mandatory
    +                 restart => restart(),         % optional
    +                 significant => significant(), % optional
    +                 shutdown => shutdown(),       % optional
    +                 type => worker(),             % optional
    +                 modules => modules()}         % optional

    The old tuple format is kept for backwards compatibility, see child_spec/0, but the map is preferred.

    • id is used to identify the child specification internally by the supervisor.

      The id key is mandatory.

      Notice that this identifier on occations has been called "name". As far as possible, the terms "identifier" or "id" are now used but to keep backward compatibility, some occurences of "name" can still be found, for example in /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/timer.xhtml differs (HTML document, ASCII text, with very long lines (1427)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/timer.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/timer.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -38,15 +38,15 @@ Examples -

      Example 1

      The following example shows how to print "Hello World!" in 5 seconds:

      1> timer:apply_after(5000, io, format, ["~nHello World!~n", []]).
      -{ok,TRef}
      +

      Example 1

      The following example shows how to print "Hello World!" in 5 seconds:

      1> timer:apply_after(5000, io, format, ["~nHello World!~n", []]).
      +{ok,TRef}
       Hello World!

      Example 2

      The following example shows a process performing a certain action, and if this -action is not completed within a certain limit, the process is killed:

      Pid = spawn(mod, fun, [foo, bar]),
      +action is not completed within a certain limit, the process is killed:

      Pid = spawn(mod, fun, [foo, bar]),
       %% If pid is not finished in 10 seconds, kill him
      -{ok, R} = timer:kill_after(timer:seconds(10), Pid),
      +{ok, R} = timer:kill_after(timer:seconds(10), Pid),
       ...
       %% We change our mind...
      -timer:cancel(R),
      +timer:cancel(R),
       ...

      @@ -73,20 +73,20 @@ process which set the timer about its completion, by sending it a done message.

      Using self/0 inside the timed function, the code below does not work as intended. The task gets done, but the done message gets sent to the wrong -process and is lost.

      1> timer:apply_after(1000, fun() -> do_something(), self() ! done end).
      -{ok,TRef}
      +process and is lost.

      1> timer:apply_after(1000, fun() -> do_something(), self() ! done end).
      +{ok,TRef}
       2> receive done -> done after 5000 -> timeout end.
       %% ... 5s pass...
       timeout

      The code below calls self/0 in the process which sets the timer and assigns it to a variable, which is then used in the function to send the done message to, -and so works as intended.

      1> Target = self()
      +and so works as intended.

      1> Target = self()
       <0.82.0>
      -2> timer:apply_after(1000, fun() -> do_something(), Target ! done end).
      -{ok,TRef}
      +2> timer:apply_after(1000, fun() -> do_something(), Target ! done end).
      +{ok,TRef}
       3> receive done -> done after 5000 -> timeout end.
       %% ... 1s passes...
      -done

      Another option is to pass the message target as a parameter to the function.

      1> timer:apply_after(1000, fun(Target) -> do_something(), Target ! done end, [self()]).
      -{ok,TRef}
      +done

      Another option is to pass the message target as a parameter to the function.

      1> timer:apply_after(1000, fun(Target) -> do_something(), Target ! done end, [self()]).
      +{ok,TRef}
       2> receive done -> done after 5000 -> timeout end.
       %% ... 1s passes...
       done
      /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/unicode_usage.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (1560)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/unicode_usage.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/unicode_usage.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -234,20 +234,20 @@ iolists, where binaries and lists can be combined to represent a sequence of bytes. In the same way, the Unicode-aware modules often allow for combinations of binaries and lists, where the binaries have characters encoded in UTF-8 and -the lists contain such binaries or numbers representing Unicode code points:

      unicode_binary() = binary() with characters encoded in UTF-8 coding standard
      +the lists contain such binaries or numbers representing Unicode code points:

      unicode_binary() = binary() with characters encoded in UTF-8 coding standard
       
      -chardata() = charlist() | unicode_binary()
      +chardata() = charlist() | unicode_binary()
       
      -charlist() = maybe_improper_list(char() | unicode_binary() | charlist(),
      -  unicode_binary() | nil())

      The module unicode even supports similar mixes with binaries containing +charlist() = maybe_improper_list(char() | unicode_binary() | charlist(), + unicode_binary() | nil())

      The module unicode even supports similar mixes with binaries containing other encodings than UTF-8, but that is a special case to allow for conversions -to and from external data:

      external_unicode_binary() = binary() with characters coded in a user-specified
      -  Unicode encoding other than UTF-8 (UTF-16 or UTF-32)
      +to and from external data:

      external_unicode_binary() = binary() with characters coded in a user-specified
      +  Unicode encoding other than UTF-8 (UTF-16 or UTF-32)
       
      -external_chardata() = external_charlist() | external_unicode_binary()
      +external_chardata() = external_charlist() | external_unicode_binary()
       
      -external_charlist() = maybe_improper_list(char() | external_unicode_binary() |
      -  external_charlist(), external_unicode_binary() | nil())

      +external_charlist() = maybe_improper_list(char() | external_unicode_binary() | + external_charlist(), external_unicode_binary() | nil())

      @@ -295,7 +295,7 @@

      In certain output functions and in the output of return values in the shell, Erlang tries to detect string data in lists and binaries heuristically. -Typically you will see heuristic detection in a situation like this:

      1> [97,98,99].
      +Typically you will see heuristic detection in a situation like this:

      1> [97,98,99].
       "abc"
       2> <<97,98,99>>.
       <<"abc">>
      @@ -315,27 +315,27 @@
       controls how heuristic string detection is done. More ranges are expected to be
       added in the future, enabling tailoring of the heuristics to the language and
       region relevant to the user.

      The following examples show the two startup options:

      $ erl +pc latin1
      -Erlang R16B (erts-5.10.1) [source] [async-threads:0] [hipe] [kernel-poll:false]
      +Erlang R16B (erts-5.10.1) [source] [async-threads:0] [hipe] [kernel-poll:false]
       
      -Eshell V5.10.1  (abort with ^G)
      -1> [1024].
      -[1024]
      -2> [1070,1085,1080,1082,1086,1076].
      -[1070,1085,1080,1082,1086,1076]
      -3> [229,228,246].
      +Eshell V5.10.1  (abort with ^G)
      +1> [1024].
      +[1024]
      +2> [1070,1085,1080,1082,1086,1076].
      +[1070,1085,1080,1082,1086,1076]
      +3> [229,228,246].
       "åäö"
       4> <<208,174,208,189,208,184,208,186,208,190,208,180>>.
       <<208,174,208,189,208,184,208,186,208,190,208,180>>
       5> <<229/utf8,228/utf8,246/utf8>>.
       <<"åäö"/utf8>>
      $ erl +pc unicode
      -Erlang R16B (erts-5.10.1) [source] [async-threads:0] [hipe] [kernel-poll:false]
      +Erlang R16B (erts-5.10.1) [source] [async-threads:0] [hipe] [kernel-poll:false]
       
      -Eshell V5.10.1  (abort with ^G)
      -1> [1024].
      +Eshell V5.10.1  (abort with ^G)
      +1> [1024].
       "Ѐ"
      -2> [1070,1085,1080,1082,1086,1076].
      +2> [1070,1085,1080,1082,1086,1076].
       "Юникод"
      -3> [229,228,246].
      +3> [229,228,246].
       "åäö"
       4> <<208,174,208,189,208,184,208,186,208,190,208,180>>.
       <<"Юникод"/utf8>>
      @@ -348,17 +348,17 @@
       outputs anything containing printable Unicode data (in binaries, either UTF-8 or
       bytewise encoded) as string data.

      These heuristics are also used by io:format/2, io_lib:format/2, and friends when modifier t is used with ~p or ~P:

      $ erl +pc latin1
      -Erlang R16B (erts-5.10.1) [source] [async-threads:0] [hipe] [kernel-poll:false]
      +Erlang R16B (erts-5.10.1) [source] [async-threads:0] [hipe] [kernel-poll:false]
       
      -Eshell V5.10.1  (abort with ^G)
      -1> io:format("~tp~n",[{<<"åäö">>, <<"åäö"/utf8>>, <<208,174,208,189,208,184,208,186,208,190,208,180>>}]).
      -{<<"åäö">>,<<"åäö"/utf8>>,<<208,174,208,189,208,184,208,186,208,190,208,180>>}
      +Eshell V5.10.1  (abort with ^G)
      +1> io:format("~tp~n",[{<<"åäö">>, <<"åäö"/utf8>>, <<208,174,208,189,208,184,208,186,208,190,208,180>>}]).
      +{<<"åäö">>,<<"åäö"/utf8>>,<<208,174,208,189,208,184,208,186,208,190,208,180>>}
       ok
      $ erl +pc unicode
      -Erlang R16B (erts-5.10.1) [source] [async-threads:0] [hipe] [kernel-poll:false]
      +Erlang R16B (erts-5.10.1) [source] [async-threads:0] [hipe] [kernel-poll:false]
       
      -Eshell V5.10.1  (abort with ^G)
      -1> io:format("~tp~n",[{<<"åäö">>, <<"åäö"/utf8>>, <<208,174,208,189,208,184,208,186,208,190,208,180>>}]).
      -{<<"åäö">>,<<"åäö"/utf8>>,<<"Юникод"/utf8>>}
      +Eshell V5.10.1  (abort with ^G)
      +1> io:format("~tp~n",[{<<"åäö">>, <<"åäö"/utf8>>, <<208,174,208,189,208,184,208,186,208,190,208,180>>}]).
      +{<<"åäö">>,<<"åäö"/utf8>>,<<"Юникод"/utf8>>}
       ok

      Notice that this only affects heuristic interpretation of lists and binaries on output. For example, the ~ts format sequence always outputs a valid list of characters, regardless of the +pc setting, as the programmer has explicitly @@ -381,19 +381,19 @@ capable of. There is no portable way for Erlang to ask the terminal about its UTF-8 capacity, we have to rely on the language and character type settings.

      To investigate what Erlang thinks about the terminal, the call io:getopts() can be used when the shell is started:

      $ LC_CTYPE=en_US.ISO-8859-1 erl
      -Erlang R16B (erts-5.10.1) [source] [async-threads:0] [hipe] [kernel-poll:false]
      +Erlang R16B (erts-5.10.1) [source] [async-threads:0] [hipe] [kernel-poll:false]
       
      -Eshell V5.10.1  (abort with ^G)
      -1> lists:keyfind(encoding, 1, io:getopts()).
      -{encoding,latin1}
      -2> q().
      +Eshell V5.10.1  (abort with ^G)
      +1> lists:keyfind(encoding, 1, io:getopts()).
      +{encoding,latin1}
      +2> q().
       ok
       $ LC_CTYPE=en_US.UTF-8 erl
      -Erlang R16B (erts-5.10.1) [source] [async-threads:0] [hipe] [kernel-poll:false]
      +Erlang R16B (erts-5.10.1) [source] [async-threads:0] [hipe] [kernel-poll:false]
       
      -Eshell V5.10.1  (abort with ^G)
      -1> lists:keyfind(encoding, 1, io:getopts()).
      -{encoding,unicode}
      +Eshell V5.10.1  (abort with ^G)
      +1> lists:keyfind(encoding, 1, io:getopts()).
      +{encoding,unicode}
       2>

      When (finally?) everything is in order with the locale settings, fonts. and the terminal emulator, you have probably found a way to input characters in the script you desire. For testing, the simplest way is to add some keyboard @@ -406,14 +406,14 @@ easily if you are not used to this. For example, entering commands using a Cyrillic character set is not easily done in the Erlang shell.

      Now you are set up for some Unicode input and output. The simplest thing to do is to enter a string in the shell:

      $ erl
      -Erlang R16B (erts-5.10.1) [source] [async-threads:0] [hipe] [kernel-poll:false]
      +Erlang R16B (erts-5.10.1) [source] [async-threads:0] [hipe] [kernel-poll:false]
       
      -Eshell V5.10.1  (abort with ^G)
      -1> lists:keyfind(encoding, 1, io:getopts()).
      -{encoding,unicode}
      +Eshell V5.10.1  (abort with ^G)
      +1> lists:keyfind(encoding, 1, io:getopts()).
      +{encoding,unicode}
       2> "Юникод".
       "Юникод"
      -3> io:format("~ts~n", [v(2)]).
      +3> io:format("~ts~n", [v(2)]).
       Юникод
       ok
       4>

      While strings can be input as Unicode characters, the language elements are @@ -446,10 +446,10 @@ charlist() represented by it.

      #!/usr/bin/env escript
       %%! -kernel standard_io_encoding latin1
       
      -main(_) ->
      -  {ok, Char} = file:read_line(standard_io),
      -  ok = file:write(standard_io, string:trim(Char)),
      -  ok = file:write(standard_io, io_lib:format(": ~w~n",[string:trim(Char)])),
      +main(_) ->
      +  {ok, Char} = file:read_line(standard_io),
      +  ok = file:write(standard_io, string:trim(Char)),
      +  ok = file:write(standard_io, io_lib:format(": ~w~n",[string:trim(Char)])),
         ok.
      $ escript test.es
       ξ
       ξ: [206,190]

      ξ would normally be represented as the integer 958, but since we are using @@ -685,13 +685,13 @@ example {encoding,utf8}).

    Functions reading Erlang syntax from files recognize the coding: comment and can therefore handle Unicode data on input. When writing Erlang terms to a file, you are advised to insert such comments when applicable:

    $ erl +fna +pc unicode
    -Erlang R16B (erts-5.10.1) [source]  [async-threads:0] [hipe] [kernel-poll:false]
    +Erlang R16B (erts-5.10.1) [source]  [async-threads:0] [hipe] [kernel-poll:false]
     
    -Eshell V5.10.1  (abort with ^G)
    -1> file:write_file("test.term",<<"%% coding: utf-8\n[{\"Юникод\",4711}].\n"/utf8>>).
    +Eshell V5.10.1  (abort with ^G)
    +1> file:write_file("test.term",<<"%% coding: utf-8\n[{\"Юникод\",4711}].\n"/utf8>>).
     ok
    -2> file:consult("test.term").
    -{ok,[[{"Юникод",4711}]]}

    +2> file:consult("test.term"). +{ok,[[{"Юникод",4711}]]}

    @@ -770,21 +770,21 @@ same way as the remaining file. If such a file is to be read, the first few bytes (depending on encoding) are not part of the text. This code outlines how to open a file that is believed to have a BOM, and sets the files encoding and -position for further sequential reading (preferably using the io module).

    Notice that error handling is omitted from the code:

    open_bom_file_for_reading(File) ->
    -    {ok,F} = file:open(File,[read,binary]),
    -    {ok,Bin} = file:read(F,4),
    -    {Type,Bytes} = unicode:bom_to_encoding(Bin),
    -    file:position(F,Bytes),
    -    io:setopts(F,[{encoding,Type}]),
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/unicode.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (1528))
    --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/unicode.xhtml	2026-06-04 00:07:10.000000000 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/unicode.xhtml	2042-07-06 13:26:37.000000000 +0000
    @@ -950,13 +950,13 @@
     the first part of a (so far) valid UTF character.

    If one UTF character is split over two consecutive binaries in the Data, the conversion succeeds. This means that a character can be decoded from a range of binaries as long as the whole range is specified as input without errors -occurring.

    Example:

    decode_data(Data) ->
    -   case unicode:characters_to_list(Data,unicode) of
    -      {incomplete,Encoded, Rest} ->
    -            More = get_some_more_data(),
    -            Encoded ++ decode_data([Rest, More]);
    -      {error,Encoded,Rest} ->
    -            handle_error(Encoded,Rest);
    +occurring.

    Example:

    decode_data(Data) ->
    +   case unicode:characters_to_list(Data,unicode) of
    +      {incomplete,Encoded, Rest} ->
    +            More = get_some_more_data(),
    +            Encoded ++ decode_data([Rest, More]);
    +      {error,Encoded,Rest} ->
    +            handle_error(Encoded,Rest);
           List ->
                 List
        end.

    However, bit strings that are not whole bytes are not allowed, so a UTF @@ -991,7 +991,7 @@

    Converts a possibly deep list of characters and binaries into a Normalized Form -of canonical equivalent Composed characters according to the Unicode standard.

    Any binaries in the input must be encoded with utf8 encoding.

    The result is an utf8 encoded binary.

    4> unicode:characters_to_nfc_binary([<<"abc..a">>,[778],$a,[776],$o,[776]]).
    +of canonical equivalent Composed characters according to the Unicode standard.

    Any binaries in the input must be encoded with utf8 encoding.

    The result is an utf8 encoded binary.

    4> unicode:characters_to_nfc_binary([<<"abc..a">>,[778],$a,[776],$o,[776]]).
     <<"abc..åäö"/utf8>>
    @@ -1023,7 +1023,7 @@

    Converts a possibly deep list of characters and binaries into a Normalized Form -of canonical equivalent Composed characters according to the Unicode standard.

    Any binaries in the input must be encoded with utf8 encoding.

    The result is a list of characters.

    3> unicode:characters_to_nfc_list([<<"abc..a">>,[778],$a,[776],$o,[776]]).
    +of canonical equivalent Composed characters according to the Unicode standard.

    Any binaries in the input must be encoded with utf8 encoding.

    The result is a list of characters.

    3> unicode:characters_to_nfc_list([<<"abc..a">>,[778],$a,[776],$o,[776]]).
     "abc..åäö"
    @@ -1055,7 +1055,7 @@

    Converts a possibly deep list of characters and binaries into a Normalized Form -of canonical equivalent Decomposed characters according to the Unicode standard.

    Any binaries in the input must be encoded with utf8 encoding.

    The result is an utf8 encoded binary.

    2> unicode:characters_to_nfd_binary("abc..åäö").
    +of canonical equivalent Decomposed characters according to the Unicode standard.

    Any binaries in the input must be encoded with utf8 encoding.

    The result is an utf8 encoded binary.

    2> unicode:characters_to_nfd_binary("abc..åäö").
     <<97,98,99,46,46,97,204,138,97,204,136,111,204,136>>
    @@ -1087,8 +1087,8 @@

    Converts a possibly deep list of characters and binaries into a Normalized Form -of canonical equivalent Decomposed characters according to the Unicode standard.

    Any binaries in the input must be encoded with utf8 encoding.

    The result is a list of characters.

    1> unicode:characters_to_nfd_list("abc..åäö").
    -[97,98,99,46,46,97,778,97,776,111,776]
    +of canonical equivalent Decomposed characters according to the Unicode standard.

    Any binaries in the input must be encoded with utf8 encoding.

    The result is a list of characters.

    1> unicode:characters_to_nfd_list("abc..åäö").
    +[97,98,99,46,46,97,778,97,776,111,776]
    @@ -1119,7 +1119,7 @@

    Converts a possibly deep list of characters and binaries into a Normalized Form -of compatibly equivalent Composed characters according to the Unicode standard.

    Any binaries in the input must be encoded with utf8 encoding.

    The result is an utf8 encoded binary.

    4> unicode:characters_to_nfkc_binary([<<"abc..a">>,[778],$a,[776],$o,[776],[65299,65298]]).
    +of compatibly equivalent Composed characters according to the Unicode standard.

    Any binaries in the input must be encoded with utf8 encoding.

    The result is an utf8 encoded binary.

    4> unicode:characters_to_nfkc_binary([<<"abc..a">>,[778],$a,[776],$o,[776],[65299,65298]]).
     <<"abc..åäö32"/utf8>>
    @@ -1151,7 +1151,7 @@

    Converts a possibly deep list of characters and binaries into a Normalized Form -of compatibly equivalent Composed characters according to the Unicode standard.

    Any binaries in the input must be encoded with utf8 encoding.

    The result is a list of characters.

    3> unicode:characters_to_nfkc_list([<<"abc..a">>,[778],$a,[776],$o,[776],[65299,65298]]).
    +of compatibly equivalent Composed characters according to the Unicode standard.

    Any binaries in the input must be encoded with utf8 encoding.

    The result is a list of characters.

    3> unicode:characters_to_nfkc_list([<<"abc..a">>,[778],$a,[776],$o,[776],[65299,65298]]).
     "abc..åäö32"
    @@ -1184,7 +1184,7 @@

    Converts a possibly deep list of characters and binaries into a Normalized Form of compatibly equivalent Decomposed characters according to the Unicode -standard.

    Any binaries in the input must be encoded with utf8 encoding.

    The result is an utf8 encoded binary.

    2> unicode:characters_to_nfkd_binary(["abc..åäö",[65299,65298]]).
    +standard.

    Any binaries in the input must be encoded with utf8 encoding.

    The result is an utf8 encoded binary.

    2> unicode:characters_to_nfkd_binary(["abc..åäö",[65299,65298]]).
     <<97,98,99,46,46,97,204,138,97,204,136,111,204,136,51,50>>
    @@ -1217,8 +1217,8 @@

    Converts a possibly deep list of characters and binaries into a Normalized Form of compatibly equivalent Decomposed characters according to the Unicode -standard.

    Any binaries in the input must be encoded with utf8 encoding.

    The result is a list of characters.

    1> unicode:characters_to_nfkd_list(["abc..åäö",[65299,65298]]).
    -[97,98,99,46,46,97,778,97,776,111,776,51,50]
    +standard.

    Any binaries in the input must be encoded with utf8 encoding.

    The result is a list of characters.

    1> unicode:characters_to_nfkd_list(["abc..åäö",[65299,65298]]).
    +[97,98,99,46,46,97,778,97,776,111,776,51,50]
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/uri_string_usage.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (1070)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/uri_string_usage.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/uri_string_usage.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -89,19 +89,19 @@ to explain this by an example.

    Let's say that we would like to create the following URI and send it over the network: http://cities/örebro?foo bar. This is not a valid URI as it contains characters that are not allowed in a URI such as "ö" and the space. We can -verify this by parsing the URI:

      1> uri_string:parse("http://cities/örebro?foo bar").
    -  {error,invalid_uri,":"}

    The URI parser tries all possible combinations to interpret the input and fails +verify this by parsing the URI:

      1> uri_string:parse("http://cities/örebro?foo bar").
    +  {error,invalid_uri,":"}

    The URI parser tries all possible combinations to interpret the input and fails at the last attempt when it encounters the colon character ":". Note, that the inital fault occurs when the parser attempts to interpret the character "ö" and after a failure back-tracks to the point where it has another possible parsing alternative.

    The proper way to solve this problem is to use uri_string:recompose/1 with a -uri_map() as input:

      2> uri_string:recompose(#{scheme => "http", host => "cities", path => "/örebro",
    -  query => "foo bar"}).
    +uri_map() as input:

      2> uri_string:recompose(#{scheme => "http", host => "cities", path => "/örebro",
    +  query => "foo bar"}).
       "http://cities/%C3%B6rebro?foo%20bar"

    The result is a valid URI where all the special characters are encoded as defined by the standard. Applying uri_string:parse/1 and -uri_string:percent_decode/1 on the URI returns the original input:

      3> uri_string:percent_decode(uri_string:parse("http://cities/%C3%B6rebro?foo%20bar")).
    -  #{host => "cities",path => "/örebro",query => "foo bar",
    -  scheme => "http"}

    This symmetric property is heavily used in our property test suite.

    +uri_string:percent_decode/1 on the URI returns the original input:

      3> uri_string:percent_decode(uri_string:parse("http://cities/%C3%B6rebro?foo%20bar")).
    +  #{host => "cities",path => "/örebro",query => "foo bar",
    +  scheme => "http"}

    This symmetric property is heavily used in our property test suite.

    @@ -124,27 +124,27 @@ question the library provides a utility function, uri_string:allowed_characters/0, that lists the allowed set of characters in each major URI component, and also in the -most important standard character sets.

        1> uri_string:allowed_characters().
    -    [{scheme,
    -     "+-.0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz"},
    -    {userinfo,
    -     "!$%&'()*+,-.0123456789:;=ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz~"},
    -    {host,
    -     "!$&'()*+,-.0123456789:;=ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz~"},
    -    {ipv4,".0123456789"},
    -    {ipv6,".0123456789:ABCDEFabcdef"},
    -    {regname,
    -     "!$%&'()*+,-.0123456789;=ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz~"},
    -    {path,
    -     "!$%&'()*+,-./0123456789:;=@ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz~"},
    -    {query,
    -     "!$%&'()*+,-./0123456789:;=?@ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz~"},
    -    {fragment,
    -     "!$%&'()*+,-./0123456789:;=?@ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz~"},
    -    {reserved,"!#$&'()*+,/:;=?@[]"},
    -    {unreserved,
    -     "-.0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz~"}]

    If a URI component has a character that is not allowed, it will be -percent-encoded when the URI is produced:

        2> uri_string:recompose(#{scheme => "https", host => "local#host", path => ""}).
    +most important standard character sets.

        1> uri_string:allowed_characters().
    +    [{scheme,
    +     "+-.0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz"},
    +    {userinfo,
    +     "!$%&'()*+,-.0123456789:;=ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz~"},
    +    {host,
    +     "!$&'()*+,-.0123456789:;=ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz~"},
    +    {ipv4,".0123456789"},
    +    {ipv6,".0123456789:ABCDEFabcdef"},
    +    {regname,
    +     "!$%&'()*+,-.0123456789;=ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz~"},
    +    {path,
    +     "!$%&'()*+,-./0123456789:;=@ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz~"},
    +    {query,
    +     "!$%&'()*+,-./0123456789:;=?@ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz~"},
    +    {fragment,
    +     "!$%&'()*+,-./0123456789:;=?@ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz~"},
    +    {reserved,"!#$&'()*+,/:;=?@[]"},
    +    {unreserved,
    +     "-.0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz~"}]

    If a URI component has a character that is not allowed, it will be +percent-encoded when the URI is produced:

        2> uri_string:recompose(#{scheme => "https", host => "local#host", path => ""}).
         "https://local%23host"

    Consuming a URI containing percent-encoded triplets can take many steps. The following example shows how to handle an input URI that is not normalized and contains multiple percent-encoded triplets. First, the input @@ -156,32 +156,32 @@ You can try to normalize the input with uri_string:normalize/1. The normalize operation decodes those percent-encoded triplets that correspond to a character in the unreserved set. Normalization is a safe, idempotent operation that -converts a URI into its canonical form:

        4> uri_string:normalize("http://%6C%6Fcal%23host/%F6re%26bro%20").
    +converts a URI into its canonical form:

        4> uri_string:normalize("http://%6C%6Fcal%23host/%F6re%26bro%20").
         "http://local%23host/%F6re%26bro%20"
    -    5> uri_string:normalize("http://%6C%6Fcal%23host/%F6re%26bro%20", [return_map]).
    -    #{host => "local%23host",path => "/%F6re%26bro%20",
    -      scheme => "http"}

    There are still a few percent-encoded triplets left in the output. At this + 5> uri_string:normalize("http://%6C%6Fcal%23host/%F6re%26bro%20", [return_map]). + #{host => "local%23host",path => "/%F6re%26bro%20", + scheme => "http"}

    There are still a few percent-encoded triplets left in the output. At this point, when the URI is already parsed, it is safe to apply application specific decoding on the remaining character triplets. Erlang/OTP provides a function, uri_string:percent_decode/1 for raw percent decoding that you can use on the -host and path components, or on the whole map:

        6> uri_string:percent_decode("local%23host").
    +host and path components, or on the whole map:

        6> uri_string:percent_decode("local%23host").
         "local#host"
    -    7> uri_string:percent_decode("/%F6re%26bro%20").
    -    {error,invalid_utf8,<<"/öre&bro ">>}
    -    8> uri_string:percent_decode(#{host => "local%23host",path => "/%F6re%26bro%20",
    -    scheme => "http"}).
    -    {error,{invalid,{path,{invalid_utf8,<<"/öre&bro ">>}}}}

    The host was successfully decoded but the path contains at least one character + 7> uri_string:percent_decode("/%F6re%26bro%20"). + {error,invalid_utf8,<<"/öre&bro ">>} + 8> uri_string:percent_decode(#{host => "local%23host",path => "/%F6re%26bro%20", + scheme => "http"}). + {error,{invalid,{path,{invalid_utf8,<<"/öre&bro ">>}}}}

    The host was successfully decoded but the path contains at least one character with non-UTF-8 encoding. In order to be able to decode this, you have to make assumptions about the encoding used in these triplets. The most obvious choice is latin-1, so you can try uri_string:transcode/2, to transcode the path to -UTF-8 and run the percent-decode operation on the transcoded string:

        9> uri_string:transcode("/%F6re%26bro%20", [{in_encoding, latin1}]).
    +UTF-8 and run the percent-decode operation on the transcoded string:

        9> uri_string:transcode("/%F6re%26bro%20", [{in_encoding, latin1}]).
         "/%C3%B6re%26bro%20"
    -    10> uri_string:percent_decode("/%C3%B6re%26bro%20").
    +    10> uri_string:percent_decode("/%C3%B6re%26bro%20").
         "/öre&bro "

    It is important to emphasize that it is not safe to apply -uri_string:percent_decode/1 directly on an input URI:

        11> uri_string:percent_decode("http://%6C%6Fcal%23host/%C3%B6re%26bro%20").
    +uri_string:percent_decode/1 directly on an input URI:

        11> uri_string:percent_decode("http://%6C%6Fcal%23host/%C3%B6re%26bro%20").
         "http://local#host/öre&bro "
    -    12> uri_string:parse("http://local#host/öre&bro ").
    -    {error,invalid_uri,":"}

    Note

    Percent-encoding is implemented in uri_string:recompose/1 and it happens + 12> uri_string:parse("http://local#host/öre&bro "). + {error,invalid_uri,":"}

    Note

    Percent-encoding is implemented in uri_string:recompose/1 and it happens when converting a uri_map() into a uri_string(). Applying any percent-encoding directly on an input URI would not be safe just as in the case of /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/uri_string.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (1060)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/uri_string.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/uri_string.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -480,10 +480,10 @@

    Composes a form-urlencoded QueryString based on a QueryList, a list of non-percent-encoded key-value pairs.

    Form-urlencoding is defined in section 4.10.21.6 of the HTML 5.2 specification and in section 4.10.22.6 of the HTML 5.0 -specification for non-UTF-8 encodings.

    See also the opposite operation dissect_query/1.

    Example:

    1> uri_string:compose_query([{"foo bar","1"},{"city","örebro"}]).
    +specification for non-UTF-8 encodings.

    See also the opposite operation dissect_query/1.

    Example:

    1> uri_string:compose_query([{"foo bar","1"},{"city","örebro"}]).
     "foo+bar=1&city=%C3%B6rebro"
    -2> uri_string:compose_query([{<<"foo bar">>,<<"1">>},
    -2> {<<"city">>,<<"örebro"/utf8>>}]).
    +2> uri_string:compose_query([{<<"foo bar">>,<<"1">>},
    +2> {<<"city">>,<<"örebro"/utf8>>}]).
     <<"foo+bar=1&city=%C3%B6rebro">>

    @@ -527,11 +527,11 @@ ";" (U+003B) character.

    Bytes that are out of the range 0x2A, 0x2D, 0x2E, 0x30 to 0x39, 0x41 to 0x5A, 0x5F, 0x61 to 0x7A, are percent-encoded (U+0025 PERCENT SIGN character (%) followed by uppercase ASCII hex digits representing the hexadecimal value of the -byte).

    See also the opposite operation dissect_query/1.

    Example:

    1> uri_string:compose_query([{"foo bar","1"},{"city","örebro"}],
    -1> [{encoding, latin1}]).
    +byte).

    See also the opposite operation dissect_query/1.

    Example:

    1> uri_string:compose_query([{"foo bar","1"},{"city","örebro"}],
    +1> [{encoding, latin1}]).
     "foo+bar=1&city=%F6rebro"
    -2> uri_string:compose_query([{<<"foo bar">>,<<"1">>},
    -2> {<<"city">>,<<"東京"/utf8>>}], [{encoding, latin1}]).
    +2> uri_string:compose_query([{<<"foo bar">>,<<"1">>},
    +2> {<<"city">>,<<"東京"/utf8>>}], [{encoding, latin1}]).
     <<"foo+bar=1&city=%26%2326481%3B%26%2320140%3B">>
    @@ -568,11 +568,11 @@

    Dissects an urlencoded QueryString and returns a QueryList, a list of non-percent-encoded key-value pairs.

    Form-urlencoding is defined in section 4.10.21.6 of the HTML 5.2 specification and in section 4.10.22.6 of the HTML 5.0 -specification for non-UTF-8 encodings.

    See also the opposite operation compose_query/1.

    Example:

    1> uri_string:dissect_query("foo+bar=1&city=%C3%B6rebro").
    -[{"foo bar","1"},{"city","örebro"}]
    -2> uri_string:dissect_query(<<"foo+bar=1&city=%26%2326481%3B%26%2320140%3B">>).
    -[{<<"foo bar">>,<<"1">>},
    - {<<"city">>,<<230,157,177,228,186,172>>}]
    +specification for non-UTF-8 encodings.

    See also the opposite operation compose_query/1.

    Example:

    1> uri_string:dissect_query("foo+bar=1&city=%C3%B6rebro").
    +[{"foo bar","1"},{"city","örebro"}]
    +2> uri_string:dissect_query(<<"foo+bar=1&city=%26%2326481%3B%26%2320140%3B">>).
    +[{<<"foo bar">>,<<"1">>},
    + {<<"city">>,<<230,157,177,228,186,172>>}]
    @@ -606,14 +606,14 @@

    Transforms an URI into a normalized form using Syntax-Based Normalization as defined by RFC 3986.

    This function implements case normalization, percent-encoding normalization, path segment normalization and scheme based normalization for HTTP(S) with basic -support for FTP, SSH, SFTP and TFTP.

    Example:

    1> uri_string:normalize("/a/b/c/./../../g").
    +support for FTP, SSH, SFTP and TFTP.

    Example:

    1> uri_string:normalize("/a/b/c/./../../g").
     "/a/g"
    -2> uri_string:normalize(<<"mid/content=5/../6">>).
    +2> uri_string:normalize(<<"mid/content=5/../6">>).
     <<"mid/6">>
    -3> uri_string:normalize("http://localhost:80").
    +3> uri_string:normalize("http://localhost:80").
     "http://localhost/"
    -4> uri_string:normalize(#{scheme => "http",port => 80,path => "/a/b/c/./../../g",
    -4> host => "localhost-örebro"}).
    +4> uri_string:normalize(#{scheme => "http",port => 80,path => "/a/b/c/./../../g",
    +4> host => "localhost-örebro"}).
     "http://localhost-%C3%B6rebro/a/g"
    @@ -650,15 +650,15 @@

    Same as normalize/1 but with an additional Options parameter, that controls whether the normalized URI shall be returned as an -uri_map().

    There is one supported option: return_map.

    Example:

    1> uri_string:normalize("/a/b/c/./../../g", [return_map]).
    -#{path => "/a/g"}
    -2> uri_string:normalize(<<"mid/content=5/../6">>, [return_map]).
    -#{path => <<"mid/6">>}
    -3> uri_string:normalize("http://localhost:80", [return_map]).
    -#{scheme => "http",path => "/",host => "localhost"}
    -4> uri_string:normalize(#{scheme => "http",port => 80,path => "/a/b/c/./../../g",
    -4> host => "localhost-örebro"}, [return_map]).
    -#{scheme => "http",path => "/a/g",host => "localhost-örebro"}
    +uri_map().

    There is one supported option: return_map.

    Example:

    1> uri_string:normalize("/a/b/c/./../../g", [return_map]).
    +#{path => "/a/g"}
    +2> uri_string:normalize(<<"mid/content=5/../6">>, [return_map]).
    +#{path => <<"mid/6">>}
    +3> uri_string:normalize("http://localhost:80", [return_map]).
    +#{scheme => "http",path => "/",host => "localhost"}
    +4> uri_string:normalize(#{scheme => "http",port => 80,path => "/a/b/c/./../../g",
    +4> host => "localhost-örebro"}, [return_map]).
    +#{scheme => "http",path => "/a/g",host => "localhost-örebro"}
    @@ -690,14 +690,14 @@

    Parses an RFC 3986 compliant uri_string/0 into a uri_map/0, that holds the parsed components of the -URI. If parsing fails, an error tuple is returned.

    See also the opposite operation recompose/1.

    Example:

    1> uri_string:parse("foo://user@example.com:8042/over/there?name=ferret#nose").
    -#{fragment => "nose",host => "example.com",
    +URI. If parsing fails, an error tuple is returned.

    See also the opposite operation recompose/1.

    Example:

    1> uri_string:parse("foo://user@example.com:8042/over/there?name=ferret#nose").
    +#{fragment => "nose",host => "example.com",
       path => "/over/there",port => 8042,query => "name=ferret",
    -  scheme => foo,userinfo => "user"}
    -2> uri_string:parse(<<"foo://user@example.com:8042/over/there?name=ferret">>).
    -#{host => <<"example.com">>,path => <<"/over/there">>,
    +  scheme => foo,userinfo => "user"}
    +2> uri_string:parse(<<"foo://user@example.com:8042/over/there?name=ferret">>).
    +#{host => <<"example.com">>,path => <<"/over/there">>,
       port => 8042,query => <<"name=ferret">>,scheme => <<"foo">>,
    -  userinfo => <<"user">>}
    +
    userinfo => <<"user">>}
    @@ -736,15 +736,15 @@

    Decodes all percent-encoded triplets in the input that can be both a uri_string/0 and a uri_map/0.

    Note, that this function performs raw decoding and it shall be used on already parsed URI components. Applying this function directly on a standard URI can -effectively change it.

    If the input encoding is not UTF-8, an error tuple is returned.

    Example:

    1> uri_string:percent_decode(#{host => "localhost-%C3%B6rebro",path => [],
    -1> scheme => "http"}).
    -#{host => "localhost-örebro",path => [],scheme => "http"}
    -2> uri_string:percent_decode(<<"%C3%B6rebro">>).
    +effectively change it.

    If the input encoding is not UTF-8, an error tuple is returned.

    Example:

    1> uri_string:percent_decode(#{host => "localhost-%C3%B6rebro",path => [],
    +1> scheme => "http"}).
    +#{host => "localhost-örebro",path => [],scheme => "http"}
    +2> uri_string:percent_decode(<<"%C3%B6rebro">>).
     <<"örebro"/utf8>>

    Warning

    Using uri_string:percent_decode/1 directly on a URI is not safe. This example shows, that after each consecutive application of the function the -resulting URI will be changed. None of these URIs refer to the same resource.

    3> uri_string:percent_decode(<<"http://local%252Fhost/path">>).
    +resulting URI will be changed. None of these URIs refer to the same resource.

    3> uri_string:percent_decode(<<"http://local%252Fhost/path">>).
     <<"http://local%2Fhost/path">>
    -4> uri_string:percent_decode(<<"http://local%2Fhost/path">>).
    +4> uri_string:percent_decode(<<"http://local%2Fhost/path">>).
     <<"http://local/host/path">>
    @@ -777,9 +777,9 @@

    Replaces characters out of unreserved set with their percent encoded equivalents.

    Unreserved characters defined in -RFC 3986 are not quoted.

    Example:

    1> uri_string:quote("SomeId/04").
    +RFC 3986 are not quoted.

    Example:

    1> uri_string:quote("SomeId/04").
     "SomeId%2F04"
    -2> uri_string:quote(<<"SomeId/04">>).
    +2> uri_string:quote(<<"SomeId/04">>).
     <<"SomeId%2F04">>

    Warning

    Function is not aware about any URI component context and should not be used on whole URI. If applied more than once on the same data, might produce unexpected results.

    @@ -814,9 +814,9 @@

    Same as quote/1, but Safe allows user to provide a list of -characters to be protected from encoding.

    Example:

    1> uri_string:quote("SomeId/04", "/").
    +characters to be protected from encoding.

    Example:

    1> uri_string:quote("SomeId/04", "/").
     "SomeId/04"
    -2> uri_string:quote(<<"SomeId/04">>, "/").
    +2> uri_string:quote(<<"SomeId/04">>, "/").
     <<"SomeId/04">>

    Warning

    Function is not aware about any URI component context and should not be used on whole URI. If applied more than once on the same data, might produce unexpected results.

    @@ -851,13 +851,13 @@

    Creates an RFC 3986 compliant URIString (percent-encoded), based on the components of URIMap. If the -URIMap is invalid, an error tuple is returned.

    See also the opposite operation parse/1.

    Example:

    1> URIMap = #{fragment => "nose", host => "example.com", path => "/over/there",
    -1> port => 8042, query => "name=ferret", scheme => "foo", userinfo => "user"}.
    -#{fragment => "nose",host => "example.com",
    +URIMap is invalid, an error tuple is returned.

    See also the opposite operation parse/1.

    Example:

    1> URIMap = #{fragment => "nose", host => "example.com", path => "/over/there",
    +1> port => 8042, query => "name=ferret", scheme => "foo", userinfo => "user"}.
    +#{fragment => "nose",host => "example.com",
       path => "/over/there",port => 8042,query => "name=ferret",
    -  scheme => "foo",userinfo => "user"}
    +  scheme => "foo",userinfo => "user"}
     
    -2> uri_string:recompose(URIMap).
    +2> uri_string:recompose(URIMap).
     "foo://example.com:8042/over/there?name=ferret#nose"
    @@ -894,13 +894,13 @@

    Convert a RefURI reference that might be relative to a given base URI into the parsed components of the reference's target, which can then be recomposed to -form the target URI.

    Example:

    1> uri_string:resolve("/abs/ol/ute", "http://localhost/a/b/c?q").
    +form the target URI.

    Example:

    1> uri_string:resolve("/abs/ol/ute", "http://localhost/a/b/c?q").
     "http://localhost/abs/ol/ute"
    -2> uri_string:resolve("../relative", "http://localhost/a/b/c?q").
    +2> uri_string:resolve("../relative", "http://localhost/a/b/c?q").
     "http://localhost/a/relative"
    -3> uri_string:resolve("http://localhost/full", "http://localhost/a/b/c?q").
    +3> uri_string:resolve("http://localhost/full", "http://localhost/a/b/c?q").
     "http://localhost/full"
    -4> uri_string:resolve(#{path => "path", query => "xyz"}, "http://localhost/a/b/c?q").
    +4> uri_string:resolve(#{path => "path", query => "xyz"}, "http://localhost/a/b/c?q").
     "http://localhost/a/b/path?xyz"
    @@ -938,11 +938,11 @@ /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/zip.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (2139)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/zip.xhtml 2026-06-04 00:07:10.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib.epub/OEBPS/zip.xhtml 2042-07-06 13:26:37.000000000 +0000 @@ -928,28 +928,28 @@ archive. The iteration can be ended prematurely in a controlled manner by throwing an exception.

    Example:

    > Name = "dummy.zip".
     "dummy.zip"
    -> {ok, {Name, Bin}} = zip:create(Name, [{"foo", <<"FOO">>}, {"bar", <<"BAR">>}], [memory]).
    -{ok,{"dummy.zip",
    +> {ok, {Name, Bin}} = zip:create(Name, [{"foo", <<"FOO">>}, {"bar", <<"BAR">>}], [memory]).
    +{ok,{"dummy.zip",
          <<80,75,3,4,20,0,0,0,0,0,74,152,97,60,171,39,212,26,3,0,
    -       0,0,3,0,0,...>>}}
    -> {ok, FileSpec} = zip:foldl(fun(N, I, B, Acc) -> [{N, B(), I()} | Acc] end, [], {Name, Bin}).
    -{ok,[{"bar",<<"BAR">>,
    -      {file_info,3,regular,read_write,
    -                 {{2010,3,1},{19,2,10}},
    -                 {{2010,3,1},{19,2,10}},
    -                 {{2010,3,1},{19,2,10}},
    -                 54,1,0,0,0,0,0}},
    -     {"foo",<<"FOO">>,
    -      {file_info,3,regular,read_write,
    -                 {{2010,3,1},{19,2,10}},
    -                 {{2010,3,1},{19,2,10}},
    -                 {{2010,3,1},{19,2,10}},
    -                 54,1,0,0,0,0,0}}]}
    -> {ok, {Name, Bin}} = zip:create(Name, lists:reverse(FileSpec), [memory]).
    -{ok,{"dummy.zip",
    +       0,0,3,0,0,...>>}}
    +> {ok, FileSpec} = zip:foldl(fun(N, I, B, Acc) -> [{N, B(), I()} | Acc] end, [], {Name, Bin}).
    +{ok,[{"bar",<<"BAR">>,
    +      {file_info,3,regular,read_write,
    +                 {{2010,3,1},{19,2,10}},
    +                 {{2010,3,1},{19,2,10}},
    +                 {{2010,3,1},{19,2,10}},
    +                 54,1,0,0,0,0,0}},
    +     {"foo",<<"FOO">>,
    +      {file_info,3,regular,read_write,
    +                 {{2010,3,1},{19,2,10}},
    +                 {{2010,3,1},{19,2,10}},
    +                 {{2010,3,1},{19,2,10}},
    +                 54,1,0,0,0,0,0}}]}
    +> {ok, {Name, Bin}} = zip:create(Name, lists:reverse(FileSpec), [memory]).
    +{ok,{"dummy.zip",
          <<80,75,3,4,20,0,0,0,0,0,74,152,97,60,171,39,212,26,3,0,
    -       0,0,3,0,0,...>>}}
    -> catch zip:foldl(fun("foo", _, B, _) -> throw(B()); (_,_,_,Acc) -> Acc end, [], {Name, Bin}).
    +       0,0,3,0,0,...>>}}
    +> catch zip:foldl(fun("foo", _, B, _) -> throw(B()); (_,_,_,Acc) -> Acc end, [], {Name, Bin}).
     <<"FOO">>
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib_app.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1971)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib_app.html 2026-06-04 19:05:20.671619410 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/stdlib_app.html 2026-06-04 19:05:20.672619419 +0000 @@ -160,13 +160,13 @@ prompt function takes the main prompt as its only parameter.

  • shell_saved_results = integer() >= 0 - Can be used to determine how many results are saved by the Erlang shell.

  • shell_session_slogan = string() | fun() -> string()) - The slogan printed when starting an Erlang shell. Example:

    $ erl -stdlib shell_session_slogan '"Test slogan"'
    -Erlang/OTP 26 [DEVELOPMENT] [erts-13.0.2] [source] [64-bit] [smp:8:8] [ds:8:8:10] [async-threads:1] [jit:ns]
    +Erlang/OTP 26 [DEVELOPMENT] [erts-13.0.2] [source] [64-bit] [smp:8:8] [ds:8:8:10] [async-threads:1] [jit:ns]
     
     Test slogan
     1>
  • shell_slogan = string() | fun(() -> string()) - The slogan printed when starting the Erlang shell subsystem. Example:

    $ erl -stdlib shell_slogan '"Test slogan"'
     Test slogan
    -Eshell V13.0.2  (abort with ^G)
    +Eshell V13.0.2  (abort with ^G)
     1>

    The default is the return value of erlang:system_info(system_version).

  • shell_strings = boolean() - Can be used to determine how the Erlang shell outputs lists of integers.

  • @@ -226,7 +226,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/string.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (726)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/string.html 2026-06-04 19:05:20.713619800 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/string.html 2026-06-04 19:05:20.713619800 +0000 @@ -149,14 +149,14 @@ expect UTF-8 binaries but not all functions verify that all binaries are encoded correctly.

    Unless otherwise specified the return value type is the same as the input type. That is, binary input returns binary output, list input returns a list output, -and mixed input can return a mixed output.

    1> string:trim("  sarah  ").
    +and mixed input can return a mixed output.

    1> string:trim("  sarah  ").
     "sarah"
    -2> string:trim(<<"  sarah  ">>).
    +2> string:trim(<<"  sarah  ">>).
     <<"sarah">>
    -3> string:lexemes("foo bar", " ").
    -["foo","bar"]
    -4> string:lexemes(<<"foo bar">>, " ").
    -[<<"foo">>,<<"bar">>]

    This module has been reworked in Erlang/OTP 20 to handle unicode:chardata/0 +3> string:lexemes("foo bar", " "). +["foo","bar"] +4> string:lexemes(<<"foo bar">>, " "). +[<<"foo">>,<<"bar">>]

    This module has been reworked in Erlang/OTP 20 to handle unicode:chardata/0 and operate on grapheme clusters. The old functions that only work on Latin-1 lists as input are still available but should not be used, they will be @@ -1068,7 +1068,7 @@

    Converts String to a case-agnostic comparable string. Function casefold/1 is preferred over lowercase/1 -when two strings are to be compared for equality. See also equal/4.

    Example:

    1> string:casefold("Ω and ẞ SHARP S").
    +when two strings are to be compared for equality. See also equal/4.

    Example:

    1> string:casefold("Ω and ẞ SHARP S").
     "ω and ss sharp s"
    @@ -1100,9 +1100,9 @@

    Returns a string where any trailing \n or \r\n have been removed from -String.

    Example:

    182> string:chomp(<<"\nHello\n\n">>).
    +String.

    Example:

    182> string:chomp(<<"\nHello\n\n">>).
     <<"\nHello">>
    -183> string:chomp("\nHello\r\r\n").
    +183> string:chomp("\nHello\r\r\n").
     "\nHello\r"
    @@ -1203,11 +1203,11 @@ nfc, nfd, nfkc, and -nfkd.

    Example:

    1> string:equal("åäö", <<"åäö"/utf8>>).
    +nfkd.

    Example:

    1> string:equal("åäö", <<"åäö"/utf8>>).
     true
    -2> string:equal("åäö", unicode:characters_to_nfd_binary("åäö")).
    +2> string:equal("åäö", unicode:characters_to_nfd_binary("åäö")).
     false
    -3> string:equal("åäö", unicode:characters_to_nfd_binary("ÅÄÖ"), true, nfc).
    +3> string:equal("åäö", unicode:characters_to_nfd_binary("ÅÄÖ"), true, nfc).
     true
    @@ -1273,13 +1273,13 @@

    Removes anything before SearchPattern in String and returns the remainder of the string or nomatch if SearchPattern is not found. Dir, which can be leading or trailing, indicates from which direction characters are to be -searched.

    Example:

    1> string:find("ab..cd..ef", ".").
    +searched.

    Example:

    1> string:find("ab..cd..ef", ".").
     "..cd..ef"
    -2> string:find(<<"ab..cd..ef">>, "..", trailing).
    +2> string:find(<<"ab..cd..ef">>, "..", trailing).
     <<"..ef">>
    -3> string:find(<<"ab..cd..ef">>, "x", leading).
    +3> string:find(<<"ab..cd..ef">>, "x", leading).
     nomatch
    -4> string:find("ab..cd..ef", "x", trailing).
    +4> string:find("ab..cd..ef", "x", trailing).
     nomatch
    @@ -1310,9 +1310,9 @@ -

    Returns true if String is the empty string, otherwise false.

    Example:

    1> string:is_empty("foo").
    +

    Returns true if String is the empty string, otherwise false.

    Example:

    1> string:is_empty("foo").
     false
    -2> string:is_empty(["",<<>>]).
    +2> string:is_empty(["",<<>>]).
     true
    @@ -1350,13 +1350,13 @@

    Returns a float between +0.0 and 1.0 representing the Jaro similarity between the given strings. Strings with a higher similarity will score closer -to 1.0, with +0.0 meaning no similarity and 1.0 meaning an exact match.

    Example:

    1> string:jaro_similarity("ditto", "ditto").
    +to 1.0, with +0.0 meaning no similarity and 1.0 meaning an exact match.

    Example:

    1> string:jaro_similarity("ditto", "ditto").
     1.0
    -2> string:jaro_similarity("foo", "bar").
    +2> string:jaro_similarity("foo", "bar").
     +0.0
    -3> string:jaro_similarity("michelle", "michael").
    +3> string:jaro_similarity("michelle", "michael").
     0.8690476190476191
    -4> string:jaro_similarity(<<"Édouard"/utf8>>, <<"Claude">>).
    +4> string:jaro_similarity(<<"Édouard"/utf8>>, <<"Claude">>).
     0.5317460317460317

    The Jaro distance between two strings can be calculated with JaroDistance = 1.0 - JaroSimilarity.

    @@ -1388,9 +1388,9 @@ -

    Returns the number of grapheme clusters in String.

    Example:

    1> string:length("ß↑e̊").
    +

    Returns the number of grapheme clusters in String.

    Example:

    1> string:length("ß↑e̊").
     3
    -2> string:length(<<195,159,226,134,145,101,204,138>>).
    +2> string:length(<<195,159,226,134,145,101,204,138>>).
     3
    @@ -1425,10 +1425,10 @@

    Returns a list of lexemes in String, separated by the grapheme clusters in SeparatorList.

    Notice that, as shown in this example, two or more adjacent separator graphemes clusters in String are treated as one. That is, there are no empty strings in -the resulting list of lexemes. See also split/3 which returns empty strings.

    Notice that [$\r,$\n] is one grapheme cluster.

    Example:

    1> string:lexemes("abc de̊fxxghix jkl\r\nfoo", "x e" ++ [[$\r,$\n]]).
    -["abc","de̊f","ghi","jkl","foo"]
    -2> string:lexemes(<<"abc de̊fxxghix jkl\r\nfoo"/utf8>>, "x e" ++ [$\r,$\n]).
    -[<<"abc">>,<<"de̊f"/utf8>>,<<"ghi">>,<<"jkl\r\nfoo">>]
    +the resulting list of lexemes. See also split/3 which returns empty strings.

    Notice that [$\r,$\n] is one grapheme cluster.

    Example:

    1> string:lexemes("abc de̊fxxghix jkl\r\nfoo", "x e" ++ [[$\r,$\n]]).
    +["abc","de̊f","ghi","jkl","foo"]
    +2> string:lexemes(<<"abc de̊fxxghix jkl\r\nfoo"/utf8>>, "x e" ++ [$\r,$\n]).
    +[<<"abc">>,<<"de̊f"/utf8>>,<<"ghi">>,<<"jkl\r\nfoo">>]
    @@ -1459,7 +1459,7 @@

    Converts String to lowercase.

    Notice that function casefold/1 should be used when converting a string to be -tested for equality.

    Example:

    2> string:lowercase(string:uppercase("Michał")).
    +tested for equality.

    Example:

    2> string:lowercase(string:uppercase("Michał")).
     "michał"
    @@ -1493,8 +1493,8 @@

    Returns the first codepoint in String and the rest of String in the tail. Returns an empty list if String is empty or an {error, String} tuple if the -next byte is invalid.

    Example:

    1> string:next_codepoint(unicode:characters_to_binary("e̊fg")).
    -[101|<<"̊fg"/utf8>>]
    +next byte is invalid.

    Example:

    1> string:next_codepoint(unicode:characters_to_binary("e̊fg")).
    +[101|<<"̊fg"/utf8>>]
    @@ -1528,8 +1528,8 @@

    Returns the first grapheme cluster in String and the rest of String in the tail. Returns an empty list if String is empty or an {error, String} tuple -if the next byte is invalid.

    Example:

    1> string:next_grapheme(unicode:characters_to_binary("e̊fg")).
    -["e̊"|<<"fg">>]
    +if the next byte is invalid.

    Example:

    1> string:next_grapheme(unicode:characters_to_binary("e̊fg")).
    +["e̊"|<<"fg">>]
    @@ -1564,7 +1564,7 @@

    Returns lexeme number N in String, where lexemes are separated by the -grapheme clusters in SeparatorList.

    Example:

    1> string:nth_lexeme("abc.de̊f.ghiejkl", 3, ".e").
    +grapheme clusters in SeparatorList.

    Example:

    1> string:nth_lexeme("abc.de̊f.ghiejkl", 3, ".e").
     "ghi"
    @@ -1662,11 +1662,11 @@

    Pads String to Length with grapheme cluster Char. Dir, which can be -leading, trailing, or both, indicates where the padding should be added.

    Example:

    1> string:pad(<<"He̊llö"/utf8>>, 8).
    -[<<72,101,204,138,108,108,195,182>>,32,32,32]
    -2> io:format("'~ts'~n",[string:pad("He̊llö", 8, leading)]).
    +leading, trailing, or both, indicates where the padding should be added.

    Example:

    1> string:pad(<<"He̊llö"/utf8>>, 8).
    +[<<72,101,204,138,108,108,195,182>>,32,32,32]
    +2> io:format("'~ts'~n",[string:pad("He̊llö", 8, leading)]).
     '   He̊llö'
    -3> io:format("'~ts'~n",[string:pad("He̊llö", 8, both)]).
    +3> io:format("'~ts'~n",[string:pad("He̊llö", 8, both)]).
     ' He̊llö  '
    @@ -1698,9 +1698,9 @@

    If Prefix is the prefix of String, removes it and returns the remainder of -String, otherwise returns nomatch.

    Example:

    1> string:prefix(<<"prefix of string">>, "pre").
    +String, otherwise returns nomatch.

    Example:

    1> string:prefix(<<"prefix of string">>, "pre").
     <<"fix of string">>
    -2> string:prefix("pre", "prefix").
    +2> string:prefix("pre", "prefix").
     nomatch
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/supervisor.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (731)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/supervisor.html 2026-06-04 19:05:20.745620097 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/supervisor.html 2026-06-04 19:05:20.745620097 +0000 @@ -158,10 +158,10 @@ Supervisor flags

    The supervisor properties are defined by the supervisor flags. The type -definition for the supervisor flags is as follows:

    sup_flags() = #{strategy => strategy(),           % optional
    -                intensity => non_neg_integer(),   % optional
    -                period => pos_integer(),          % optional
    -                auto_shutdown => auto_shutdown()} % optional

    Restart Strategies

    A supervisor can have one of the following restart strategies specified with +definition for the supervisor flags is as follows:

    sup_flags() = #{strategy => strategy(),           % optional
    +                intensity => non_neg_integer(),   % optional
    +                period => pos_integer(),          % optional
    +                auto_shutdown => auto_shutdown()} % optional

    Restart Strategies

    A supervisor can have one of the following restart strategies specified with the strategy key in the above map:

    • one_for_one - If one child process terminates and is to be restarted, only that child process is affected. This is the default restart strategy.

    • one_for_all - If one child process terminates and is to be restarted, all other child processes are terminated and then all child processes are @@ -205,13 +205,13 @@ Child specification

    -

    The type definition of a child specification is as follows:

    child_spec() = #{id => child_id(),             % mandatory
    -                 start => mfargs(),            % mandatory
    -                 restart => restart(),         % optional
    -                 significant => significant(), % optional
    -                 shutdown => shutdown(),       % optional
    -                 type => worker(),             % optional
    -                 modules => modules()}         % optional

    The old tuple format is kept for backwards compatibility, see child_spec/0, +

    The type definition of a child specification is as follows:

    child_spec() = #{id => child_id(),             % mandatory
    +                 start => mfargs(),            % mandatory
    +                 restart => restart(),         % optional
    +                 significant => significant(), % optional
    +                 shutdown => shutdown(),       % optional
    +                 type => worker(),             % optional
    +                 modules => modules()}         % optional

    The old tuple format is kept for backwards compatibility, see child_spec/0, but the map is preferred.

    • id is used to identify the child specification internally by the supervisor.

      The id key is mandatory.

      Notice that this identifier on occations has been called "name". As far as possible, the terms "identifier" or "id" are now used but to keep backward compatibility, some occurences of "name" can still be found, for example in @@ -1806,7 +1806,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/supervisor_bridge.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (457)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/supervisor_bridge.html 2026-06-04 19:05:20.765620282 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/supervisor_bridge.html 2026-06-04 19:05:20.765620282 +0000 @@ -419,7 +419,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/sys.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (642)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/sys.html 2026-06-04 19:05:20.801620616 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/sys.html 2026-06-04 19:05:20.801620616 +0000 @@ -2323,7 +2323,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/timer.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1427)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/timer.html 2026-06-04 19:05:20.831620894 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/timer.html 2026-06-04 19:05:20.831620894 +0000 @@ -143,15 +143,15 @@ Examples -

      Example 1

      The following example shows how to print "Hello World!" in 5 seconds:

      1> timer:apply_after(5000, io, format, ["~nHello World!~n", []]).
      -{ok,TRef}
      +

      Example 1

      The following example shows how to print "Hello World!" in 5 seconds:

      1> timer:apply_after(5000, io, format, ["~nHello World!~n", []]).
      +{ok,TRef}
       Hello World!

      Example 2

      The following example shows a process performing a certain action, and if this -action is not completed within a certain limit, the process is killed:

      Pid = spawn(mod, fun, [foo, bar]),
      +action is not completed within a certain limit, the process is killed:

      Pid = spawn(mod, fun, [foo, bar]),
       %% If pid is not finished in 10 seconds, kill him
      -{ok, R} = timer:kill_after(timer:seconds(10), Pid),
      +{ok, R} = timer:kill_after(timer:seconds(10), Pid),
       ...
       %% We change our mind...
      -timer:cancel(R),
      +timer:cancel(R),
       ...

      @@ -178,20 +178,20 @@ process which set the timer about its completion, by sending it a done message.

      Using self/0 inside the timed function, the code below does not work as intended. The task gets done, but the done message gets sent to the wrong -process and is lost.

      1> timer:apply_after(1000, fun() -> do_something(), self() ! done end).
      -{ok,TRef}
      +process and is lost.

      1> timer:apply_after(1000, fun() -> do_something(), self() ! done end).
      +{ok,TRef}
       2> receive done -> done after 5000 -> timeout end.
       %% ... 5s pass...
       timeout

      The code below calls self/0 in the process which sets the timer and assigns it to a variable, which is then used in the function to send the done message to, -and so works as intended.

      1> Target = self()
      +and so works as intended.

      1> Target = self()
       <0.82.0>
      -2> timer:apply_after(1000, fun() -> do_something(), Target ! done end).
      -{ok,TRef}
      +2> timer:apply_after(1000, fun() -> do_something(), Target ! done end).
      +{ok,TRef}
       3> receive done -> done after 5000 -> timeout end.
       %% ... 1s passes...
      -done

      Another option is to pass the message target as a parameter to the function.

      1> timer:apply_after(1000, fun(Target) -> do_something(), Target ! done end, [self()]).
      -{ok,TRef}
      +done

      Another option is to pass the message target as a parameter to the function.

      1> timer:apply_after(1000, fun(Target) -> do_something(), Target ! done end, [self()]).
      +{ok,TRef}
       2> receive done -> done after 5000 -> timeout end.
       %% ... 1s passes...
       done
      @@ -1640,7 +1640,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/unicode.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1528)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/unicode.html 2026-06-04 19:05:20.859621154 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/unicode.html 2026-06-04 19:05:20.859621154 +0000 @@ -1071,13 +1071,13 @@ the first part of a (so far) valid UTF character.

      If one UTF character is split over two consecutive binaries in the Data, the conversion succeeds. This means that a character can be decoded from a range of binaries as long as the whole range is specified as input without errors -occurring.

      Example:

      decode_data(Data) ->
      -   case unicode:characters_to_list(Data,unicode) of
      -      {incomplete,Encoded, Rest} ->
      -            More = get_some_more_data(),
      -            Encoded ++ decode_data([Rest, More]);
      -      {error,Encoded,Rest} ->
      -            handle_error(Encoded,Rest);
      +occurring.

      Example:

      decode_data(Data) ->
      +   case unicode:characters_to_list(Data,unicode) of
      +      {incomplete,Encoded, Rest} ->
      +            More = get_some_more_data(),
      +            Encoded ++ decode_data([Rest, More]);
      +      {error,Encoded,Rest} ->
      +            handle_error(Encoded,Rest);
             List ->
                   List
          end.

      However, bit strings that are not whole bytes are not allowed, so a UTF @@ -1112,7 +1112,7 @@

      Converts a possibly deep list of characters and binaries into a Normalized Form -of canonical equivalent Composed characters according to the Unicode standard.

      Any binaries in the input must be encoded with utf8 encoding.

      The result is an utf8 encoded binary.

      4> unicode:characters_to_nfc_binary([<<"abc..a">>,[778],$a,[776],$o,[776]]).
      +of canonical equivalent Composed characters according to the Unicode standard.

      Any binaries in the input must be encoded with utf8 encoding.

      The result is an utf8 encoded binary.

      4> unicode:characters_to_nfc_binary([<<"abc..a">>,[778],$a,[776],$o,[776]]).
       <<"abc..åäö"/utf8>>
      @@ -1144,7 +1144,7 @@

      Converts a possibly deep list of characters and binaries into a Normalized Form -of canonical equivalent Composed characters according to the Unicode standard.

      Any binaries in the input must be encoded with utf8 encoding.

      The result is a list of characters.

      3> unicode:characters_to_nfc_list([<<"abc..a">>,[778],$a,[776],$o,[776]]).
      +of canonical equivalent Composed characters according to the Unicode standard.

      Any binaries in the input must be encoded with utf8 encoding.

      The result is a list of characters.

      3> unicode:characters_to_nfc_list([<<"abc..a">>,[778],$a,[776],$o,[776]]).
       "abc..åäö"
      @@ -1176,7 +1176,7 @@

      Converts a possibly deep list of characters and binaries into a Normalized Form -of canonical equivalent Decomposed characters according to the Unicode standard.

      Any binaries in the input must be encoded with utf8 encoding.

      The result is an utf8 encoded binary.

      2> unicode:characters_to_nfd_binary("abc..åäö").
      +of canonical equivalent Decomposed characters according to the Unicode standard.

      Any binaries in the input must be encoded with utf8 encoding.

      The result is an utf8 encoded binary.

      2> unicode:characters_to_nfd_binary("abc..åäö").
       <<97,98,99,46,46,97,204,138,97,204,136,111,204,136>>
      @@ -1208,8 +1208,8 @@

      Converts a possibly deep list of characters and binaries into a Normalized Form -of canonical equivalent Decomposed characters according to the Unicode standard.

      Any binaries in the input must be encoded with utf8 encoding.

      The result is a list of characters.

      1> unicode:characters_to_nfd_list("abc..åäö").
      -[97,98,99,46,46,97,778,97,776,111,776]
      +of canonical equivalent Decomposed characters according to the Unicode standard.

      Any binaries in the input must be encoded with utf8 encoding.

      The result is a list of characters.

      1> unicode:characters_to_nfd_list("abc..åäö").
      +[97,98,99,46,46,97,778,97,776,111,776]
      @@ -1240,7 +1240,7 @@

      Converts a possibly deep list of characters and binaries into a Normalized Form -of compatibly equivalent Composed characters according to the Unicode standard.

      Any binaries in the input must be encoded with utf8 encoding.

      The result is an utf8 encoded binary.

      4> unicode:characters_to_nfkc_binary([<<"abc..a">>,[778],$a,[776],$o,[776],[65299,65298]]).
      +of compatibly equivalent Composed characters according to the Unicode standard.

      Any binaries in the input must be encoded with utf8 encoding.

      The result is an utf8 encoded binary.

      4> unicode:characters_to_nfkc_binary([<<"abc..a">>,[778],$a,[776],$o,[776],[65299,65298]]).
       <<"abc..åäö32"/utf8>>
      @@ -1272,7 +1272,7 @@

      Converts a possibly deep list of characters and binaries into a Normalized Form -of compatibly equivalent Composed characters according to the Unicode standard.

      Any binaries in the input must be encoded with utf8 encoding.

      The result is a list of characters.

      3> unicode:characters_to_nfkc_list([<<"abc..a">>,[778],$a,[776],$o,[776],[65299,65298]]).
      +of compatibly equivalent Composed characters according to the Unicode standard.

      Any binaries in the input must be encoded with utf8 encoding.

      The result is a list of characters.

      3> unicode:characters_to_nfkc_list([<<"abc..a">>,[778],$a,[776],$o,[776],[65299,65298]]).
       "abc..åäö32"
      @@ -1305,7 +1305,7 @@

      Converts a possibly deep list of characters and binaries into a Normalized Form of compatibly equivalent Decomposed characters according to the Unicode -standard.

      Any binaries in the input must be encoded with utf8 encoding.

      The result is an utf8 encoded binary.

      2> unicode:characters_to_nfkd_binary(["abc..åäö",[65299,65298]]).
      +standard.

      Any binaries in the input must be encoded with utf8 encoding.

      The result is an utf8 encoded binary.

      2> unicode:characters_to_nfkd_binary(["abc..åäö",[65299,65298]]).
       <<97,98,99,46,46,97,204,138,97,204,136,111,204,136,51,50>>
      @@ -1338,8 +1338,8 @@

      Converts a possibly deep list of characters and binaries into a Normalized Form of compatibly equivalent Decomposed characters according to the Unicode -standard.

      Any binaries in the input must be encoded with utf8 encoding.

      The result is a list of characters.

      1> unicode:characters_to_nfkd_list(["abc..åäö",[65299,65298]]).
      -[97,98,99,46,46,97,778,97,776,111,776,51,50]
      +standard.

      Any binaries in the input must be encoded with utf8 encoding.

      The result is a list of characters.

      1> unicode:characters_to_nfkd_list(["abc..åäö",[65299,65298]]).
      +[97,98,99,46,46,97,778,97,776,111,776,51,50]
      @@ -1400,7 +1400,7 @@ Erlang programming language

      -

      Copyright © 1996-2026 Ericsson AB

      +

      Copyright © 1996-2042 Ericsson AB

      /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/unicode_usage.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1560)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/unicode_usage.html 2026-06-04 19:05:20.894621479 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/unicode_usage.html 2026-06-04 19:05:20.895621488 +0000 @@ -329,20 +329,20 @@ iolists, where binaries and lists can be combined to represent a sequence of bytes. In the same way, the Unicode-aware modules often allow for combinations of binaries and lists, where the binaries have characters encoded in UTF-8 and -the lists contain such binaries or numbers representing Unicode code points:

      unicode_binary() = binary() with characters encoded in UTF-8 coding standard
      +the lists contain such binaries or numbers representing Unicode code points:

      unicode_binary() = binary() with characters encoded in UTF-8 coding standard
       
      -chardata() = charlist() | unicode_binary()
      +chardata() = charlist() | unicode_binary()
       
      -charlist() = maybe_improper_list(char() | unicode_binary() | charlist(),
      -  unicode_binary() | nil())

      The module unicode even supports similar mixes with binaries containing +charlist() = maybe_improper_list(char() | unicode_binary() | charlist(), + unicode_binary() | nil())

      The module unicode even supports similar mixes with binaries containing other encodings than UTF-8, but that is a special case to allow for conversions -to and from external data:

      external_unicode_binary() = binary() with characters coded in a user-specified
      -  Unicode encoding other than UTF-8 (UTF-16 or UTF-32)
      +to and from external data:

      external_unicode_binary() = binary() with characters coded in a user-specified
      +  Unicode encoding other than UTF-8 (UTF-16 or UTF-32)
       
      -external_chardata() = external_charlist() | external_unicode_binary()
      +external_chardata() = external_charlist() | external_unicode_binary()
       
      -external_charlist() = maybe_improper_list(char() | external_unicode_binary() |
      -  external_charlist(), external_unicode_binary() | nil())

      +external_charlist() = maybe_improper_list(char() | external_unicode_binary() | + external_charlist(), external_unicode_binary() | nil())

      @@ -390,7 +390,7 @@

      In certain output functions and in the output of return values in the shell, Erlang tries to detect string data in lists and binaries heuristically. -Typically you will see heuristic detection in a situation like this:

      1> [97,98,99].
      +Typically you will see heuristic detection in a situation like this:

      1> [97,98,99].
       "abc"
       2> <<97,98,99>>.
       <<"abc">>
      @@ -410,27 +410,27 @@
       controls how heuristic string detection is done. More ranges are expected to be
       added in the future, enabling tailoring of the heuristics to the language and
       region relevant to the user.

      The following examples show the two startup options:

      $ erl +pc latin1
      -Erlang R16B (erts-5.10.1) [source] [async-threads:0] [hipe] [kernel-poll:false]
      +Erlang R16B (erts-5.10.1) [source] [async-threads:0] [hipe] [kernel-poll:false]
       
      -Eshell V5.10.1  (abort with ^G)
      -1> [1024].
      -[1024]
      -2> [1070,1085,1080,1082,1086,1076].
      -[1070,1085,1080,1082,1086,1076]
      -3> [229,228,246].
      +Eshell V5.10.1  (abort with ^G)
      +1> [1024].
      +[1024]
      +2> [1070,1085,1080,1082,1086,1076].
      +[1070,1085,1080,1082,1086,1076]
      +3> [229,228,246].
       "åäö"
       4> <<208,174,208,189,208,184,208,186,208,190,208,180>>.
       <<208,174,208,189,208,184,208,186,208,190,208,180>>
       5> <<229/utf8,228/utf8,246/utf8>>.
       <<"åäö"/utf8>>
      $ erl +pc unicode
      -Erlang R16B (erts-5.10.1) [source] [async-threads:0] [hipe] [kernel-poll:false]
      +Erlang R16B (erts-5.10.1) [source] [async-threads:0] [hipe] [kernel-poll:false]
       
      -Eshell V5.10.1  (abort with ^G)
      -1> [1024].
      +Eshell V5.10.1  (abort with ^G)
      +1> [1024].
       "Ѐ"
      -2> [1070,1085,1080,1082,1086,1076].
      +2> [1070,1085,1080,1082,1086,1076].
       "Юникод"
      -3> [229,228,246].
      +3> [229,228,246].
       "åäö"
       4> <<208,174,208,189,208,184,208,186,208,190,208,180>>.
       <<"Юникод"/utf8>>
      @@ -443,17 +443,17 @@
       outputs anything containing printable Unicode data (in binaries, either UTF-8 or
       bytewise encoded) as string data.

      These heuristics are also used by io:format/2, io_lib:format/2, and friends when modifier t is used with ~p or ~P:

      $ erl +pc latin1
      -Erlang R16B (erts-5.10.1) [source] [async-threads:0] [hipe] [kernel-poll:false]
      +Erlang R16B (erts-5.10.1) [source] [async-threads:0] [hipe] [kernel-poll:false]
       
      -Eshell V5.10.1  (abort with ^G)
      -1> io:format("~tp~n",[{<<"åäö">>, <<"åäö"/utf8>>, <<208,174,208,189,208,184,208,186,208,190,208,180>>}]).
      -{<<"åäö">>,<<"åäö"/utf8>>,<<208,174,208,189,208,184,208,186,208,190,208,180>>}
      +Eshell V5.10.1  (abort with ^G)
      +1> io:format("~tp~n",[{<<"åäö">>, <<"åäö"/utf8>>, <<208,174,208,189,208,184,208,186,208,190,208,180>>}]).
      +{<<"åäö">>,<<"åäö"/utf8>>,<<208,174,208,189,208,184,208,186,208,190,208,180>>}
       ok
      $ erl +pc unicode
      -Erlang R16B (erts-5.10.1) [source] [async-threads:0] [hipe] [kernel-poll:false]
      +Erlang R16B (erts-5.10.1) [source] [async-threads:0] [hipe] [kernel-poll:false]
       
      -Eshell V5.10.1  (abort with ^G)
      -1> io:format("~tp~n",[{<<"åäö">>, <<"åäö"/utf8>>, <<208,174,208,189,208,184,208,186,208,190,208,180>>}]).
      -{<<"åäö">>,<<"åäö"/utf8>>,<<"Юникод"/utf8>>}
      +Eshell V5.10.1  (abort with ^G)
      +1> io:format("~tp~n",[{<<"åäö">>, <<"åäö"/utf8>>, <<208,174,208,189,208,184,208,186,208,190,208,180>>}]).
      +{<<"åäö">>,<<"åäö"/utf8>>,<<"Юникод"/utf8>>}
       ok

      Notice that this only affects heuristic interpretation of lists and binaries on output. For example, the ~ts format sequence always outputs a valid list of characters, regardless of the +pc setting, as the programmer has explicitly @@ -476,19 +476,19 @@ capable of. There is no portable way for Erlang to ask the terminal about its UTF-8 capacity, we have to rely on the language and character type settings.

      To investigate what Erlang thinks about the terminal, the call io:getopts() can be used when the shell is started:

      $ LC_CTYPE=en_US.ISO-8859-1 erl
      -Erlang R16B (erts-5.10.1) [source] [async-threads:0] [hipe] [kernel-poll:false]
      +Erlang R16B (erts-5.10.1) [source] [async-threads:0] [hipe] [kernel-poll:false]
       
      -Eshell V5.10.1  (abort with ^G)
      -1> lists:keyfind(encoding, 1, io:getopts()).
      -{encoding,latin1}
      -2> q().
      +Eshell V5.10.1  (abort with ^G)
      +1> lists:keyfind(encoding, 1, io:getopts()).
      +{encoding,latin1}
      +2> q().
       ok
       $ LC_CTYPE=en_US.UTF-8 erl
      -Erlang R16B (erts-5.10.1) [source] [async-threads:0] [hipe] [kernel-poll:false]
      +Erlang R16B (erts-5.10.1) [source] [async-threads:0] [hipe] [kernel-poll:false]
       
      -Eshell V5.10.1  (abort with ^G)
      -1> lists:keyfind(encoding, 1, io:getopts()).
      -{encoding,unicode}
      +Eshell V5.10.1  (abort with ^G)
      +1> lists:keyfind(encoding, 1, io:getopts()).
      +{encoding,unicode}
       2>

      When (finally?) everything is in order with the locale settings, fonts. and the terminal emulator, you have probably found a way to input characters in the script you desire. For testing, the simplest way is to add some keyboard @@ -501,14 +501,14 @@ easily if you are not used to this. For example, entering commands using a Cyrillic character set is not easily done in the Erlang shell.

      Now you are set up for some Unicode input and output. The simplest thing to do is to enter a string in the shell:

      $ erl
      -Erlang R16B (erts-5.10.1) [source] [async-threads:0] [hipe] [kernel-poll:false]
      +Erlang R16B (erts-5.10.1) [source] [async-threads:0] [hipe] [kernel-poll:false]
       
      -Eshell V5.10.1  (abort with ^G)
      -1> lists:keyfind(encoding, 1, io:getopts()).
      -{encoding,unicode}
      +Eshell V5.10.1  (abort with ^G)
      +1> lists:keyfind(encoding, 1, io:getopts()).
      +{encoding,unicode}
       2> "Юникод".
       "Юникод"
      -3> io:format("~ts~n", [v(2)]).
      +3> io:format("~ts~n", [v(2)]).
       Юникод
       ok
       4>

      While strings can be input as Unicode characters, the language elements are @@ -541,10 +541,10 @@ charlist() represented by it.

      #!/usr/bin/env escript
       %%! -kernel standard_io_encoding latin1
       
      -main(_) ->
      -  {ok, Char} = file:read_line(standard_io),
      -  ok = file:write(standard_io, string:trim(Char)),
      -  ok = file:write(standard_io, io_lib:format(": ~w~n",[string:trim(Char)])),
      +main(_) ->
      +  {ok, Char} = file:read_line(standard_io),
      +  ok = file:write(standard_io, string:trim(Char)),
      +  ok = file:write(standard_io, io_lib:format(": ~w~n",[string:trim(Char)])),
         ok.
      $ escript test.es
       ξ
       ξ: [206,190]

      ξ would normally be represented as the integer 958, but since we are using @@ -780,13 +780,13 @@ example {encoding,utf8}).

    Functions reading Erlang syntax from files recognize the coding: comment and can therefore handle Unicode data on input. When writing Erlang terms to a file, you are advised to insert such comments when applicable:

    $ erl +fna +pc unicode
    -Erlang R16B (erts-5.10.1) [source]  [async-threads:0] [hipe] [kernel-poll:false]
    +Erlang R16B (erts-5.10.1) [source]  [async-threads:0] [hipe] [kernel-poll:false]
     
    -Eshell V5.10.1  (abort with ^G)
    -1> file:write_file("test.term",<<"%% coding: utf-8\n[{\"Юникод\",4711}].\n"/utf8>>).
    +Eshell V5.10.1  (abort with ^G)
    +1> file:write_file("test.term",<<"%% coding: utf-8\n[{\"Юникод\",4711}].\n"/utf8>>).
     ok
    -2> file:consult("test.term").
    -{ok,[[{"Юникод",4711}]]}

    +2> file:consult("test.term"). +{ok,[[{"Юникод",4711}]]}

    @@ -865,21 +865,21 @@ same way as the remaining file. If such a file is to be read, the first few bytes (depending on encoding) are not part of the text. This code outlines how to open a file that is believed to have a BOM, and sets the files encoding and -position for further sequential reading (preferably using the io module).

    Notice that error handling is omitted from the code:

    open_bom_file_for_reading(File) ->
    -    {ok,F} = file:open(File,[read,binary]),
    -    {ok,Bin} = file:read(F,4),
    -    {Type,Bytes} = unicode:bom_to_encoding(Bin),
    -    file:position(F,Bytes),
    -    io:setopts(F,[{encoding,Type}]),
    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/uri_string.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1056))
    --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/uri_string.html	2026-06-04 19:05:20.925621766 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/uri_string.html	2026-06-04 19:05:20.925621766 +0000
    @@ -586,10 +586,10 @@
     

    Composes a form-urlencoded QueryString based on a QueryList, a list of non-percent-encoded key-value pairs.

    Form-urlencoding is defined in section 4.10.21.6 of the HTML 5.2 specification and in section 4.10.22.6 of the HTML 5.0 -specification for non-UTF-8 encodings.

    See also the opposite operation dissect_query/1.

    Example:

    1> uri_string:compose_query([{"foo bar","1"},{"city","örebro"}]).
    +specification for non-UTF-8 encodings.

    See also the opposite operation dissect_query/1.

    Example:

    1> uri_string:compose_query([{"foo bar","1"},{"city","örebro"}]).
     "foo+bar=1&city=%C3%B6rebro"
    -2> uri_string:compose_query([{<<"foo bar">>,<<"1">>},
    -2> {<<"city">>,<<"örebro"/utf8>>}]).
    +2> uri_string:compose_query([{<<"foo bar">>,<<"1">>},
    +2> {<<"city">>,<<"örebro"/utf8>>}]).
     <<"foo+bar=1&city=%C3%B6rebro">>
    @@ -633,11 +633,11 @@ ";" (U+003B) character.

    Bytes that are out of the range 0x2A, 0x2D, 0x2E, 0x30 to 0x39, 0x41 to 0x5A, 0x5F, 0x61 to 0x7A, are percent-encoded (U+0025 PERCENT SIGN character (%) followed by uppercase ASCII hex digits representing the hexadecimal value of the -byte).

    See also the opposite operation dissect_query/1.

    Example:

    1> uri_string:compose_query([{"foo bar","1"},{"city","örebro"}],
    -1> [{encoding, latin1}]).
    +byte).

    See also the opposite operation dissect_query/1.

    Example:

    1> uri_string:compose_query([{"foo bar","1"},{"city","örebro"}],
    +1> [{encoding, latin1}]).
     "foo+bar=1&city=%F6rebro"
    -2> uri_string:compose_query([{<<"foo bar">>,<<"1">>},
    -2> {<<"city">>,<<"東京"/utf8>>}], [{encoding, latin1}]).
    +2> uri_string:compose_query([{<<"foo bar">>,<<"1">>},
    +2> {<<"city">>,<<"東京"/utf8>>}], [{encoding, latin1}]).
     <<"foo+bar=1&city=%26%2326481%3B%26%2320140%3B">>
    @@ -674,11 +674,11 @@

    Dissects an urlencoded QueryString and returns a QueryList, a list of non-percent-encoded key-value pairs.

    Form-urlencoding is defined in section 4.10.21.6 of the HTML 5.2 specification and in section 4.10.22.6 of the HTML 5.0 -specification for non-UTF-8 encodings.

    See also the opposite operation compose_query/1.

    Example:

    1> uri_string:dissect_query("foo+bar=1&city=%C3%B6rebro").
    -[{"foo bar","1"},{"city","örebro"}]
    -2> uri_string:dissect_query(<<"foo+bar=1&city=%26%2326481%3B%26%2320140%3B">>).
    -[{<<"foo bar">>,<<"1">>},
    - {<<"city">>,<<230,157,177,228,186,172>>}]
    +specification for non-UTF-8 encodings.

    See also the opposite operation compose_query/1.

    Example:

    1> uri_string:dissect_query("foo+bar=1&city=%C3%B6rebro").
    +[{"foo bar","1"},{"city","örebro"}]
    +2> uri_string:dissect_query(<<"foo+bar=1&city=%26%2326481%3B%26%2320140%3B">>).
    +[{<<"foo bar">>,<<"1">>},
    + {<<"city">>,<<230,157,177,228,186,172>>}]
    @@ -712,14 +712,14 @@

    Transforms an URI into a normalized form using Syntax-Based Normalization as defined by RFC 3986.

    This function implements case normalization, percent-encoding normalization, path segment normalization and scheme based normalization for HTTP(S) with basic -support for FTP, SSH, SFTP and TFTP.

    Example:

    1> uri_string:normalize("/a/b/c/./../../g").
    +support for FTP, SSH, SFTP and TFTP.

    Example:

    1> uri_string:normalize("/a/b/c/./../../g").
     "/a/g"
    -2> uri_string:normalize(<<"mid/content=5/../6">>).
    +2> uri_string:normalize(<<"mid/content=5/../6">>).
     <<"mid/6">>
    -3> uri_string:normalize("http://localhost:80").
    +3> uri_string:normalize("http://localhost:80").
     "http://localhost/"
    -4> uri_string:normalize(#href_anchor"ss">scheme => "http",port => 80,path => "/a/b/c/./../../g",
    -4> host => "localhost-örebro"}).
    +4> uri_string:normalize(#href_anchor"ss">scheme => "http",port => 80,path => "/a/b/c/./../../g",
    +4> host => "localhost-örebro"}).
     "http://localhost-%C3%B6rebro/a/g"
    @@ -756,15 +756,15 @@

    Same as normalize/1 but with an additional Options parameter, that controls whether the normalized URI shall be returned as an -uri_map().

    There is one supported option: return_map.

    Example:

    1> uri_string:normalize("/a/b/c/./../../g", [return_map]).
    -#{path => "/a/g"}
    -2> uri_string:normalize(<<"mid/content=5/../6">>, [return_map]).
    -#{path => <<"mid/6">>}
    -3> uri_string:normalize("http://localhost:80", [return_map]).
    -#{scheme => "http",path => "/",host => "localhost"}
    -4> uri_string:normalize(#{scheme => "http",port => 80,path => "/a/b/c/./../../g",
    -4> host => "localhost-örebro"}, [return_map]).
    -#{scheme => "http",path => "/a/g",host => "localhost-örebro"}
    +uri_map().

    There is one supported option: return_map.

    Example:

    1> uri_string:normalize("/a/b/c/./../../g", [return_map]).
    +#{path => "/a/g"}
    +2> uri_string:normalize(<<"mid/content=5/../6">>, [return_map]).
    +#{path => <<"mid/6">>}
    +3> uri_string:normalize("http://localhost:80", [return_map]).
    +#{scheme => "http",path => "/",host => "localhost"}
    +4> uri_string:normalize(#{scheme => "http",port => 80,path => "/a/b/c/./../../g",
    +4> host => "localhost-örebro"}, [return_map]).
    +#{scheme => "http",path => "/a/g",host => "localhost-örebro"}
    @@ -796,14 +796,14 @@

    Parses an RFC 3986 compliant uri_string/0 into a uri_map/0, that holds the parsed components of the -URI. If parsing fails, an error tuple is returned.

    See also the opposite operation recompose/1.

    Example:

    1> uri_string:parse("foo://user@example.com:8042/over/there?name=ferret#nose").
    -#{fragment => "nose",host => "example.com",
    +URI. If parsing fails, an error tuple is returned.

    See also the opposite operation recompose/1.

    Example:

    1> uri_string:parse("foo://user@example.com:8042/over/there?name=ferret#nose").
    +#{fragment => "nose",host => "example.com",
       path => "/over/there",port => 8042,query => "name=ferret",
    -  scheme => foo,userinfo => "user"}
    -2> uri_string:parse(<<"foo://user@example.com:8042/over/there?name=ferret">>).
    -#{host => <<"example.com">>,path => <<"/over/there">>,
    +  scheme => foo,userinfo => "user"}
    +2> uri_string:parse(<<"foo://user@example.com:8042/over/there?name=ferret">>).
    +#{host => <<"example.com">>,path => <<"/over/there">>,
       port => 8042,query => <<"name=ferret">>,scheme => <<"foo">>,
    -  userinfo => <<"user">>}
    +
    userinfo => <<"user">>}
    @@ -842,15 +842,15 @@

    Decodes all percent-encoded triplets in the input that can be both a uri_string/0 and a uri_map/0.

    Note, that this function performs raw decoding and it shall be used on already parsed URI components. Applying this function directly on a standard URI can -effectively change it.

    If the input encoding is not UTF-8, an error tuple is returned.

    Example:

    1> uri_string:percent_decode(#{host => "localhost-%C3%B6rebro",path => [],
    -1> scheme => "http"}).
    -#{host => "localhost-örebro",path => [],scheme => "http"}
    -2> uri_string:percent_decode(<<"%C3%B6rebro">>).
    +effectively change it.

    If the input encoding is not UTF-8, an error tuple is returned.

    Example:

    1> uri_string:percent_decode(#{host => "localhost-%C3%B6rebro",path => [],
    +1> scheme => "http"}).
    +#{host => "localhost-örebro",path => [],scheme => "http"}
    +2> uri_string:percent_decode(<<"%C3%B6rebro">>).
     <<"örebro"/utf8>>

    Warning

    Using uri_string:percent_decode/1 directly on a URI is not safe. This example shows, that after each consecutive application of the function the -resulting URI will be changed. None of these URIs refer to the same resource.

    3> uri_string:percent_decode(<<"http://local%252Fhost/path">>).
    +resulting URI will be changed. None of these URIs refer to the same resource.

    3> uri_string:percent_decode(<<"http://local%252Fhost/path">>).
     <<"http://local%2Fhost/path">>
    -4> uri_string:percent_decode(<<"http://local%2Fhost/path">>).
    +4> uri_string:percent_decode(<<"http://local%2Fhost/path">>).
     <<"http://local/host/path">>
    @@ -883,9 +883,9 @@

    Replaces characters out of unreserved set with their percent encoded equivalents.

    Unreserved characters defined in -RFC 3986 are not quoted.

    Example:

    1> uri_string:quote("SomeId/04").
    +RFC 3986 are not quoted.

    Example:

    1> uri_string:quote("SomeId/04").
     "SomeId%2F04"
    -2> uri_string:quote(<<"SomeId/04">>).
    +2> uri_string:quote(<<"SomeId/04">>).
     <<"SomeId%2F04">>

    Warning

    Function is not aware about any URI component context and should not be used on whole URI. If applied more than once on the same data, might produce unexpected results.

    @@ -920,9 +920,9 @@

    Same as quote/1, but Safe allows user to provide a list of -characters to be protected from encoding.

    Example:

    1> uri_string:quote("SomeId/04", "/").
    +characters to be protected from encoding.

    Example:

    1> uri_string:quote("SomeId/04", "/").
     "SomeId/04"
    -2> uri_string:quote(<<"SomeId/04">>, "/").
    +2> uri_string:quote(<<"SomeId/04">>, "/").
     <<"SomeId/04">>

    Warning

    Function is not aware about any URI component context and should not be used on whole URI. If applied more than once on the same data, might produce unexpected results.

    @@ -957,13 +957,13 @@

    Creates an RFC 3986 compliant URIString (percent-encoded), based on the components of URIMap. If the -URIMap is invalid, an error tuple is returned.

    See also the opposite operation parse/1.

    Example:

    1> URIMap = #{fragment => "nose", host => "example.com", path => "/over/there",
    -1> port => 8042, query => "name=ferret", scheme => "foo", userinfo => "user"}.
    -#{fragment => "nose",host => "example.com",
    +URIMap is invalid, an error tuple is returned.

    See also the opposite operation parse/1.

    Example:

    1> URIMap = #{fragment => "nose", host => "example.com", path => "/over/there",
    +1> port => 8042, query => "name=ferret", scheme => "foo", userinfo => "user"}.
    +#{fragment => "nose",host => "example.com",
       path => "/over/there",port => 8042,query => "name=ferret",
    -  scheme => "foo",userinfo => "user"}
    +  scheme => "foo",userinfo => "user"}
     
    -2> uri_string:recompose(URIMap).
    +2> uri_string:recompose(URIMap).
     "foo://example.com:8042/over/there?name=ferret#nose"
    @@ -1000,13 +1000,13 @@

    Convert a RefURI reference that might be relative to a given base URI into the parsed components of the reference's target, which can then be recomposed to -form the target URI.

    Example:

    1> uri_string:resolve("/abs/ol/ute", "http://localhost/a/b/c?q").
    +form the target URI.

    Example:

    1> uri_string:resolve("/abs/ol/ute", "http://localhost/a/b/c?q").
     "http://localhost/abs/ol/ute"
    -2> uri_string:resolve("../relative", "http://localhost/a/b/c?q").
    +2> uri_string:resolve("../relative", "http://localhost/a/b/c?q").
     "http://localhost/a/relative"
    -3> uri_string:resolve("http://localhost/full", "http://localhost/a/b/c?q").
    +3> uri_string:resolve("http://localhost/full", "http://localhost/a/b/c?q").
     "http://localhost/full"
    -4> uri_string:resolve(#{path => "path", query => "xyz"}, "http://localhost/a/b/c?q").
    +4> uri_string:resolve(#{path => "path", query => "xyz"}, "http://localhost/a/b/c?q").
     "http://localhost/a/b/path?xyz"
    @@ -1044,11 +1044,11 @@ /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/uri_string_usage.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1070)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/uri_string_usage.html 2026-06-04 19:05:20.947621970 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/uri_string_usage.html 2026-06-04 19:05:20.946621961 +0000 @@ -180,19 +180,19 @@ to explain this by an example.

    Let's say that we would like to create the following URI and send it over the network: http://cities/örebro?foo bar. This is not a valid URI as it contains characters that are not allowed in a URI such as "ö" and the space. We can -verify this by parsing the URI:

      1> uri_string:parse("http://cities/örebro?foo bar").
    -  {error,invalid_uri,":"}

    The URI parser tries all possible combinations to interpret the input and fails +verify this by parsing the URI:

      1> uri_string:parse("http://cities/örebro?foo bar").
    +  {error,invalid_uri,":"}

    The URI parser tries all possible combinations to interpret the input and fails at the last attempt when it encounters the colon character ":". Note, that the inital fault occurs when the parser attempts to interpret the character "ö" and after a failure back-tracks to the point where it has another possible parsing alternative.

    The proper way to solve this problem is to use uri_string:recompose/1 with a -uri_map() as input:

      2> uri_string:recompose(#{scheme => "http", host => "cities", path => "/örebro",
    -  query => "foo bar"}).
    +uri_map() as input:

      2> uri_string:recompose(#{scheme => "http", host => "cities", path => "/örebro",
    +  query => "foo bar"}).
       "http://cities/%C3%B6rebro?foo%20bar"

    The result is a valid URI where all the special characters are encoded as defined by the standard. Applying uri_string:parse/1 and -uri_string:percent_decode/1 on the URI returns the original input:

      3> uri_string:percent_decode(uri_string:parse("http://cities/%C3%B6rebro?foo%20bar")).
    -  #{host => "cities",path => "/örebro",query => "foo bar",
    -  scheme => "http"}

    This symmetric property is heavily used in our property test suite.

    +uri_string:percent_decode/1 on the URI returns the original input:

      3> uri_string:percent_decode(uri_string:parse("http://cities/%C3%B6rebro?foo%20bar")).
    +  #{host => "cities",path => "/örebro",query => "foo bar",
    +  scheme => "http"}

    This symmetric property is heavily used in our property test suite.

    @@ -215,27 +215,27 @@ question the library provides a utility function, uri_string:allowed_characters/0, that lists the allowed set of characters in each major URI component, and also in the -most important standard character sets.

        1> uri_string:allowed_characters().
    -    [{scheme,
    -     "+-.0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz"},
    -    {userinfo,
    -     "!$%&'()*+,-.0123456789:;=ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz~"},
    -    {host,
    -     "!$&'()*+,-.0123456789:;=ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz~"},
    -    {ipv4,".0123456789"},
    -    {ipv6,".0123456789:ABCDEFabcdef"},
    -    {regname,
    -     "!$%&'()*+,-.0123456789;=ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz~"},
    -    {path,
    -     "!$%&'()*+,-./0123456789:;=@ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz~"},
    -    {query,
    -     "!$%&'()*+,-./0123456789:;=?@ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz~"},
    -    {fragment,
    -     "!$%&'()*+,-./0123456789:;=?@ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz~"},
    -    {reserved,"!#$&'()*+,/:;=?@[]"},
    -    {unreserved,
    -     "-.0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz~"}]

    If a URI component has a character that is not allowed, it will be -percent-encoded when the URI is produced:

        2> uri_string:recompose(#{scheme => "https", host => "local#host", path => ""}).
    +most important standard character sets.

        1> uri_string:allowed_characters().
    +    [{scheme,
    +     "+-.0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz"},
    +    {userinfo,
    +     "!$%&'()*+,-.0123456789:;=ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz~"},
    +    {host,
    +     "!$&'()*+,-.0123456789:;=ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz~"},
    +    {ipv4,".0123456789"},
    +    {ipv6,".0123456789:ABCDEFabcdef"},
    +    {regname,
    +     "!$%&'()*+,-.0123456789;=ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz~"},
    +    {path,
    +     "!$%&'()*+,-./0123456789:;=@ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz~"},
    +    {query,
    +     "!$%&'()*+,-./0123456789:;=?@ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz~"},
    +    {fragment,
    +     "!$%&'()*+,-./0123456789:;=?@ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz~"},
    +    {reserved,"!#$&'()*+,/:;=?@[]"},
    +    {unreserved,
    +     "-.0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz~"}]

    If a URI component has a character that is not allowed, it will be +percent-encoded when the URI is produced:

        2> uri_string:recompose(#{scheme => "https", host => "local#host", path => ""}).
         "https://local%23host"

    Consuming a URI containing percent-encoded triplets can take many steps. The following example shows how to handle an input URI that is not normalized and contains multiple percent-encoded triplets. First, the input @@ -247,32 +247,32 @@ You can try to normalize the input with uri_string:normalize/1. The normalize operation decodes those percent-encoded triplets that correspond to a character in the unreserved set. Normalization is a safe, idempotent operation that -converts a URI into its canonical form:

        4> uri_string:normalize("http://%6C%6Fcal%23host/%F6re%26bro%20").
    +converts a URI into its canonical form:

        4> uri_string:normalize("http://%6C%6Fcal%23host/%F6re%26bro%20").
         "http://local%23host/%F6re%26bro%20"
    -    5> uri_string:normalize("http://%6C%6Fcal%23host/%F6re%26bro%20", [return_map]).
    -    #{host => "local%23host",path => "/%F6re%26bro%20",
    -      scheme => "http"}

    There are still a few percent-encoded triplets left in the output. At this + 5> uri_string:normalize("http://%6C%6Fcal%23host/%F6re%26bro%20", [return_map]). + #{host => "local%23host",path => "/%F6re%26bro%20", + scheme => "http"}

    There are still a few percent-encoded triplets left in the output. At this point, when the URI is already parsed, it is safe to apply application specific decoding on the remaining character triplets. Erlang/OTP provides a function, uri_string:percent_decode/1 for raw percent decoding that you can use on the -host and path components, or on the whole map:

        6> uri_string:percent_decode("local%23host").
    +host and path components, or on the whole map:

        6> uri_string:percent_decode("local%23host").
         "local#host"
    -    7> uri_string:percent_decode("/%F6re%26bro%20").
    -    {error,invalid_utf8,<<"/öre&bro ">>}
    -    8> uri_string:percent_decode(#{host => "local%23host",path => "/%F6re%26bro%20",
    -    scheme => "http"}).
    -    {error,{invalid,{path,{invalid_utf8,<<"/öre&bro ">>}}}}

    The host was successfully decoded but the path contains at least one character + 7> uri_string:percent_decode("/%F6re%26bro%20"). + {error,invalid_utf8,<<"/öre&bro ">>} + 8> uri_string:percent_decode(#{host => "local%23host",path => "/%F6re%26bro%20", + scheme => "http"}). + {error,{invalid,{path,{invalid_utf8,<<"/öre&bro ">>}}}}

    The host was successfully decoded but the path contains at least one character with non-UTF-8 encoding. In order to be able to decode this, you have to make assumptions about the encoding used in these triplets. The most obvious choice is latin-1, so you can try uri_string:transcode/2, to transcode the path to -UTF-8 and run the percent-decode operation on the transcoded string:

        9> uri_string:transcode("/%F6re%26bro%20", [{in_encoding, latin1}]).
    +UTF-8 and run the percent-decode operation on the transcoded string:

        9> uri_string:transcode("/%F6re%26bro%20", [{in_encoding, latin1}]).
         "/%C3%B6re%26bro%20"
    -    10> uri_string:percent_decode("/%C3%B6re%26bro%20").
    +    10> uri_string:percent_decode("/%C3%B6re%26bro%20").
         "/öre&bro "

    It is important to emphasize that it is not safe to apply -uri_string:percent_decode/1 directly on an input URI:

        11> uri_string:percent_decode("http://%6C%6Fcal%23host/%C3%B6re%26bro%20").
    +uri_string:percent_decode/1 directly on an input URI:

        11> uri_string:percent_decode("http://%6C%6Fcal%23host/%C3%B6re%26bro%20").
         "http://local#host/öre&bro "
    -    12> uri_string:parse("http://local#host/öre&bro ").
    -    {error,invalid_uri,":"}

    Note

    Percent-encoding is implemented in uri_string:recompose/1 and it happens + 12> uri_string:parse("http://local#host/öre&bro "). + {error,invalid_uri,":"}

    Note

    Percent-encoding is implemented in uri_string:recompose/1 and it happens when converting a uri_map() into a uri_string(). Applying any percent-encoding directly on an input URI would not be safe just as in the case of @@ -368,7 +368,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/win32reg.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (454)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/win32reg.html 2026-06-04 19:05:20.967622156 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/win32reg.html 2026-06-04 19:05:20.968622165 +0000 @@ -918,7 +918,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/zip.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (2139)) --- old//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/zip.html 2026-06-04 19:05:20.999622453 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/stdlib-6.1.2/doc/html/zip.html 2026-06-04 19:05:20.999622453 +0000 @@ -1054,28 +1054,28 @@ archive. The iteration can be ended prematurely in a controlled manner by throwing an exception.

    Example:

    > Name = "dummy.zip".
     "dummy.zip"
    -> {ok, {Name, Bin}} = zip:create(Name, [{"foo", <<"FOO">>}, {"bar", <<"BAR">>}], [memory]).
    -{ok,{"dummy.zip",
    +> {ok, {Name, Bin}} = zip:create(Name, [{"foo", <<"FOO">>}, {"bar", <<"BAR">>}], [memory]).
    +{ok,{"dummy.zip",
          <<80,75,3,4,20,0,0,0,0,0,74,152,97,60,171,39,212,26,3,0,
    -       0,0,3,0,0,...>>}}
    -> {ok, FileSpec} = zip:foldl(fun(N, I, B, Acc) -> [{N, B(), I()} | Acc] end, [], {Name, Bin}).
    -{ok,[{"bar",<<"BAR">>,
    -      {file_info,3,regular,read_write,
    -                 {{2010,3,1},{19,2,10}},
    -                 {{2010,3,1},{19,2,10}},
    -                 {{2010,3,1},{19,2,10}},
    -                 54,1,0,0,0,0,0}},
    -     {"foo",<<"FOO">>,
    -      {file_info,3,regular,read_write,
    -                 {{2010,3,1},{19,2,10}},
    -                 {{2010,3,1},{19,2,10}},
    -                 {{2010,3,1},{19,2,10}},
    -                 54,1,0,0,0,0,0}}]}
    -> {ok, {Name, Bin}} = zip:create(Name, lists:reverse(FileSpec), [memory]).
    -{ok,{"dummy.zip",
    +       0,0,3,0,0,...>>}}
    +> {ok, FileSpec} = zip:foldl(fun(N, I, B, Acc) -> [{N, B(), I()} | Acc] end, [], {Name, Bin}).
    +{ok,[{"bar",<<"BAR">>,
    +      {file_info,3,regular,read_write,
    +                 {{2010,3,1},{19,2,10}},
    +                 {{2010,3,1},{19,2,10}},
    +                 {{2010,3,1},{19,2,10}},
    +                 54,1,0,0,0,0,0}},
    +     {"foo",<<"FOO">>,
    +      {file_info,3,regular,read_write,
    +                 {{2010,3,1},{19,2,10}},
    +                 {{2010,3,1},{19,2,10}},
    +                 {{2010,3,1},{19,2,10}},
    +                 54,1,0,0,0,0,0}}]}
    +> {ok, {Name, Bin}} = zip:create(Name, lists:reverse(FileSpec), [memory]).
    +{ok,{"dummy.zip",
          <<80,75,3,4,20,0,0,0,0,0,74,152,97,60,171,39,212,26,3,0,
    -       0,0,3,0,0,...>>}}
    -> catch zip:foldl(fun("foo", _, B, _) -> throw(B()); (_,_,_,Acc) -> Acc end, [], {Name, Bin}).
    +       0,0,3,0,0,...>>}}
    +> catch zip:foldl(fun("foo", _, B, _) -> throw(B()); (_,_,_,Acc) -> Acc end, [], {Name, Bin}).
     <<"FOO">>
    @@ -1683,7 +1683,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/404.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/404.html 2026-06-04 19:05:21.020622648 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/404.html 2026-06-04 19:05:21.020622648 +0000 @@ -143,7 +143,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/api-reference.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/api-reference.html 2026-06-04 19:05:21.037622805 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/api-reference.html 2026-06-04 19:05:21.037622805 +0000 @@ -253,7 +253,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/chapter.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/chapter.html 2026-06-04 19:05:21.054622963 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/chapter.html 2026-06-04 19:05:21.054622963 +0000 @@ -181,7 +181,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/epp_dodger.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (464)) --- old//usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/epp_dodger.html 2026-06-04 19:05:21.074623149 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/epp_dodger.html 2026-06-04 19:05:21.076623167 +0000 @@ -891,7 +891,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/erl_comment_scan.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (454)) --- old//usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/erl_comment_scan.html 2026-06-04 19:05:21.095623343 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/erl_comment_scan.html 2026-06-04 19:05:21.095623343 +0000 @@ -449,7 +449,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/erl_prettypr.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (434)) --- old//usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/erl_prettypr.html 2026-06-04 19:05:21.118623557 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/erl_prettypr.html 2026-06-04 19:05:21.118623557 +0000 @@ -1013,7 +1013,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/erl_recomment.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (349)) --- old//usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/erl_recomment.html 2026-06-04 19:05:21.137623733 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/erl_recomment.html 2026-06-04 19:05:21.137623733 +0000 @@ -391,7 +391,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/erl_syntax.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/erl_syntax.html 2026-06-04 19:05:21.232624614 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/erl_syntax.html 2026-06-04 19:05:21.232624614 +0000 @@ -6854,10 +6854,10 @@

    Returns the associated post-comments of a node.

    This is a possibly empty list of abstract comments, in top-down textual order. When the code is formatted, post-comments are typically -displayed to the right of and/or below the node. For example:

    {foo, X, Y}     % Post-comment of tuple

    If possible, the comment should be moved past any following separator characters +displayed to the right of and/or below the node. For example:

    {foo, X, Y}     % Post-comment of tuple

    If possible, the comment should be moved past any following separator characters on the same line, rather than placing the separators on the following line. -For example:

    foo([X | Xs], Y) ->
    -    foo(Xs, bar(X));     % Post-comment of 'bar(X)' node
    +For example:

    foo([X | Xs], Y) ->
    +    foo(Xs, bar(X));     % Post-comment of 'bar(X)' node
      ...

    (where the comment is moved past the rightmost ")" and the ";").

    See also: comment/2, get_attrs/1, get_precomments/1, set_postcomments/2.

    @@ -6890,10 +6890,10 @@

    Returns the associated pre-comments of a node.

    This is a possibly empty list of abstract comments, in top-down textual order. When the code is formatted, pre-comments are typically displayed directly above the node. For example:

    % Pre-comment of function
    -foo(X) -> {bar, X}.

    If possible, the comment should be moved before any preceding separator -characters on the same line. For example:

    foo([X | Xs]) ->
    +foo(X) -> {bar, X}.

    If possible, the comment should be moved before any preceding separator +characters on the same line. For example:

    foo([X | Xs]) ->
         % Pre-comment of 'bar(X)' node
    -    [bar(X) | foo(Xs)];
    +    [bar(X) | foo(Xs)];
     ...

    (where the comment is moved before the "[").

    See also: comment/2, get_attrs/1, get_postcomments/1, set_precomments/2.

    @@ -12151,7 +12151,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/erl_syntax_lib.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1095)) --- old//usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/erl_syntax_lib.html 2026-06-04 19:05:21.269624957 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/erl_syntax_lib.html 2026-06-04 19:05:21.269624957 +0000 @@ -2502,7 +2502,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/merl.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1976)) --- old//usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/merl.html 2026-06-04 19:05:21.300625245 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/merl.html 2026-06-04 19:05:21.300625245 +0000 @@ -138,30 +138,30 @@ Quick start

    To enable the full power of Merl, your module needs to include the Merl header -file:

    -include_lib("syntax_tools/include/merl.hrl").

    Then, you can use the ?Q(Text) macros in your code to create ASTs or match on -existing ASTs. For example:

    Tuple = ?Q("{foo, 42}"),
    -?Q("{foo, _@Number}") = Tuple,
    -Call = ?Q("foo:bar(_@Number)")

    Calling merl:print(Call) will then print the following code:

    foo:bar(42)

    The ?Q macros turn the quoted code fragments into ASTs, and lifts +file:

    -include_lib("syntax_tools/include/merl.hrl").

    Then, you can use the ?Q(Text) macros in your code to create ASTs or match on +existing ASTs. For example:

    Tuple = ?Q("{foo, 42}"),
    +?Q("{foo, _@Number}") = Tuple,
    +Call = ?Q("foo:bar(_@Number)")

    Calling merl:print(Call) will then print the following code:

    foo:bar(42)

    The ?Q macros turn the quoted code fragments into ASTs, and lifts metavariables such as _@Tuple and _@Number to the level of your Erlang code, so you can use the corresponding Erlang variables Tuple and Number directly. This is the most straightforward way to use Merl, and in many cases it's all you need.

    You can even write case switches using ?Q macros as patterns. For example:

    case AST of
    -    ?Q("{foo, _@Foo}") -> handle(Foo);
    -    ?Q("{bar, _@Bar}") when erl_syntax:is_integer(Bar) -> handle(Bar);
    -    _ -> handle_default()
    +    ?Q("{foo, _@Foo}") -> handle(Foo);
    +    ?Q("{bar, _@Bar}") when erl_syntax:is_integer(Bar) -> handle(Bar);
    +    _ -> handle_default()
     end

    These case switches only allow ?Q(...) or _ as clause patterns, and the guards may contain any expressions, not just Erlang guard expressions.

    If the macro MERL_NO_TRANSFORM is defined before the merl.hrl header file is included, the parse transform used by Merl will be disabled, and in that case, the match expressions ?Q(...) = ..., case switches using ?Q(...) patterns, and automatic metavariables like _@Tuple cannot be used in your code, but the Merl macros and functions still work. To do metavariable substitution, you need -to use the ?Q(Text, Map) macro. For example:

    Tuple = ?Q("{foo, _@bar, _@baz}", [{bar, Bar}, {baz,Baz}])

    The text given to a ?Q(Text) macro can be either a single string or a list of +to use the ?Q(Text, Map) macro. For example:

    Tuple = ?Q("{foo, _@bar, _@baz}", [{bar, Bar}, {baz,Baz}])

    The text given to a ?Q(Text) macro can be either a single string or a list of strings. The latter is useful when you need to split a long expression over -multiple lines. For example:

    ?Q(["case _@Expr of",
    +multiple lines. For example:

    ?Q(["case _@Expr of",
         "  {foo, X} -> f(X);",
         "  {bar, X} -> g(X)",
         "  _ -> h(X)"
    -"end"])

    If there is a syntax error somewhere in the text (like the missing semicolon in +"end"])

    If there is a syntax error somewhere in the text (like the missing semicolon in the second clause above) this allows Merl to generate an error message pointing to the exact line in your source code. (Just remember to comma-separate the strings in the list, otherwise Erlang will concatenate the string fragments as @@ -184,23 +184,23 @@ uppercase character, as in _@Foo or _@_@Foo, it will become a variable on the Erlang level, and can be used to easily deconstruct and construct syntax trees:

    case Input of
    -    ?Q("{foo, _@Number}") -> ?Q("foo:bar(_@Number)");
    +    ?Q("{foo, _@Number}") -> ?Q("foo:bar(_@Number)");
         ...

    We refer to these as "automatic metavariables". If in addition the name ends with @, as in _@Foo@, the value of the variable as an Erlang term will be automatically converted to the corresponding abstract syntax tree when used to -construct a larger tree. For example, in:

    Bar = {bar, 42},
    -Foo = ?Q("{foo, _@Bar@}")

    (where Bar is just some term, not a syntax tree) the result Foo will be a +construct a larger tree. For example, in:

    Bar = {bar, 42},
    +Foo = ?Q("{foo, _@Bar@}")

    (where Bar is just some term, not a syntax tree) the result Foo will be a syntax tree representing {foo, {bar, 42}}. This avoids the need for temporary -variables in order to inject data, as in

    TmpBar = erl_syntax:abstract(Bar),
    -Foo = ?Q("{foo, _@TmpBar}")

    If the context requires an integer rather than a variable, an atom, or a string, +variables in order to inject data, as in

    TmpBar = erl_syntax:abstract(Bar),
    +Foo = ?Q("{foo, _@TmpBar}")

    If the context requires an integer rather than a variable, an atom, or a string, you cannot use the uppercase convention to mark an automatic metavariable. Instead, if the integer (without the 909-prefix and lift/glob markers) ends in a 9, the integer will become an Erlang-level variable prefixed with Q, and if it ends with 99 it will also be automatically abstracted. For example, the following will increment the arity of the exported function f:

    case Form of
    -    ?Q("-export([f/90919]).") ->
    -        Q2 = erl_syntax:concrete(Q1) + 1,
    -        ?Q("-export([f/909299]).");
    +    ?Q("-export([f/90919]).") ->
    +        Q2 = erl_syntax:concrete(Q1) + 1,
    +        ?Q("-export([f/909299]).");
         ...

    @@ -209,40 +209,40 @@

    Merl can only parse a fragment of text if it follows the basic syntactical rules of Erlang. In most places, a normal Erlang variable can be used as metavariable, -for example:

    ?Q("f(_@Arg)") = Expr

    but if you want to match on something like the name of a function, you have to -use an atom as metavariable:

    ?Q("'@Name'() -> _@@_." = Function

    (note the anonymous glob variable _@@_ to ignore the function body).

    In some contexts, only a string or an integer is allowed. For example, the +for example:

    ?Q("f(_@Arg)") = Expr

    but if you want to match on something like the name of a function, you have to +use an atom as metavariable:

    ?Q("'@Name'() -> _@@_." = Function

    (note the anonymous glob variable _@@_ to ignore the function body).

    In some contexts, only a string or an integer is allowed. For example, the directive -file(Name, Line) requires that Name is a string literal and -Line an integer literal:

    ?Q("-file(\"'@File\", 9090).") = ?Q("-file(\"foo.erl\", 42).")).

    This will extract the string literal "foo.erl" into the variable Foo. Note +Line an integer literal:

    ?Q("-file(\"'@File\", 9090).") = ?Q("-file(\"foo.erl\", 42).")).

    This will extract the string literal "foo.erl" into the variable Foo. Note the use of the anonymous variable 9090 to ignore the line number. To match and also bind a metavariable that must be an integer literal, we can use the convention of ending the integer with a 9, turning it into a Q-prefixed variable on the Erlang level (see the previous section).

    Globs

    Whenever you want to match out a number of elements in a sequence (zero or more) -rather than a fixed set of elements, you need to use a glob. For example:

    ?Q("{_@@Elements}") = ?Q({a, b, c})

    will bind Elements to the list of individual syntax trees representing the atoms +rather than a fixed set of elements, you need to use a glob. For example:

    ?Q("{_@@Elements}") = ?Q({a, b, c})

    will bind Elements to the list of individual syntax trees representing the atoms a, b, and c. This can also be used with static prefix and suffix elements -in the sequence. For example:

    ?Q("{a, b, _@@Elements}") = ?Q({a, b, c, d})

    will bind Elements to the list of the c and d subtrees, and

    ?Q("{_@@Elements, c, d}") = ?Q({a, b, c, d})

    will bind Elements to the list of the a and b subtrees. You can even use -plain metavariables in the prefix or suffix:

    ?Q("{_@First, _@@Rest}") = ?Q({a, b, c})

    or

    ?Q("{_@@_, _@Last}") = ?Q({a, b, c})

    (ignoring all but the last element). However, you cannot have two globs as part +in the sequence. For example:

    ?Q("{a, b, _@@Elements}") = ?Q({a, b, c, d})

    will bind Elements to the list of the c and d subtrees, and

    ?Q("{_@@Elements, c, d}") = ?Q({a, b, c, d})

    will bind Elements to the list of the a and b subtrees. You can even use +plain metavariables in the prefix or suffix:

    ?Q("{_@First, _@@Rest}") = ?Q({a, b, c})

    or

    ?Q("{_@@_, _@Last}") = ?Q({a, b, c})

    (ignoring all but the last element). However, you cannot have two globs as part of the same sequence.

    Lifted metavariables

    In some cases, the Erlang syntax rules make it impossible to place a -metavariable directly where you would like it. For example, you cannot write:

    ?Q("-export([_@@Name]).")

    to match out all name/arity pairs in the export list, or to insert a list of +metavariable directly where you would like it. For example, you cannot write:

    ?Q("-export([_@@Name]).")

    to match out all name/arity pairs in the export list, or to insert a list of exports in a declaration, because the Erlang parser only allows elements on the form A/I (where A is an atom and I an integer) in the export list. A variable like the above is not allowed, but neither is a single atom or integer, so '@@Name' or 909919 would not work either.

    What you have to do in such cases is to write your metavariable in a syntactically valid position, and use lifting markers to denote where it should -really apply, as in:

    ?Q("-export(['@_@Name'/0]).")

    This causes the variable to be lifted (after parsing) to the next higher level +really apply, as in:

    ?Q("-export(['@_@Name'/0]).")

    This causes the variable to be lifted (after parsing) to the next higher level in the syntax tree, replacing that entire subtree. In this case, the '@_@Name'/0 will be replaced with '@@Name', and the /0 part was just used as dummy notation and will be discarded.

    You may even need to apply lifting more than once. To match the entire export -list as a single syntax tree, you can write:

    ?Q("-export(['@__Name'/0]).")

    using two underscores, but with no glob marker this time. This will make the +list as a single syntax tree, you can write:

    ?Q("-export(['@__Name'/0]).")

    using two underscores, but with no glob marker this time. This will make the entire ['@__Name'/0] part be replaced with '@Name'.

    Sometimes, the tree structure of a code fragment is not very obvious, and parts of the structure may be invisible when printed as source code. For instance, a -simple function definition like the following:

    zero() -> 0.

    consists of the name (the atom zero), and a list of clauses containing the +simple function definition like the following:

    zero() -> 0.

    consists of the name (the atom zero), and a list of clauses containing the single clause () -> 0. The clause consists of an argument list (empty), a guard (empty), and a body (which is always a list of expressions) containing the single expression 0. This means that to match out the name and the list of clauses of any function, you'll need to use a pattern like ?Q("'@Name'() -> _@_@Body."), using a dummy clause whose body is a glob lifted one level.

    To visualize the structure of a syntax tree, you can use the function -merl:show(T), which prints a summary. For example, entering

    merl:show(merl:quote("inc(X, Y) when Y > 0 -> X + Y."))

    in the Erlang shell will print the following (where the + signs separate +merl:show(T), which prints a summary. For example, entering

    merl:show(merl:quote("inc(X, Y) when Y > 0 -> X + Y."))

    in the Erlang shell will print the following (where the + signs separate groups of subtrees on the same level):

    function: inc(X, Y) when ... -> X + Y.
       atom: inc
       +
    @@ -1776,7 +1776,7 @@
               Erlang programming language
     
           

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/merl_transform.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/merl_transform.html 2026-06-04 19:05:21.317625403 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/merl_transform.html 2026-06-04 19:05:21.317625403 +0000 @@ -156,7 +156,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/notes.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (567)) --- old//usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/notes.html 2026-06-04 19:05:21.337625588 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/notes.html 2026-06-04 19:05:21.337625588 +0000 @@ -910,7 +910,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/prettypr.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (429)) --- old//usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/prettypr.html 2026-06-04 19:05:21.358625783 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/prettypr.html 2026-06-04 19:05:21.358625783 +0000 @@ -1170,7 +1170,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/search.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/search.html 2026-06-04 19:05:21.374544278 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/syntax_tools-3.2.1/doc/html/search.html 2026-06-04 19:05:21.375882761 +0000 @@ -141,7 +141,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/404.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/404.html 2026-06-04 19:05:21.390626080 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/404.html 2026-06-04 19:05:21.390626080 +0000 @@ -147,7 +147,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/api-reference.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/api-reference.html 2026-06-04 19:05:21.407626238 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/api-reference.html 2026-06-04 19:05:21.407626238 +0000 @@ -194,7 +194,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    Missing in old package: /usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/dist/search_data-9671378E.js Missing in old package: /usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/dist/search_data-9671378E.js /usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/getting_started.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1248)) --- old//usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/getting_started.html 2026-06-04 19:05:21.427626423 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/getting_started.html 2026-06-04 19:05:21.427626423 +0000 @@ -128,9 +128,9 @@

    The start/1 function starts a daemon process listening for UDP packets on a port. When it receives a request for read or write, it spawns a temporary server process handling the transfer.

    This is a simple example of starting the TFTP server and reading the content of -a sample file using the TFTP client.

    Step 1. Create a sample file to be used for the transfer:

          $ echo "Erlang/OTP 21" > file.txt

    Step 2. Start the TFTP server:

          1> {ok, Pid} = tftp:start([{port, 19999}]).
    -      {ok,<0.65.0>}

    Step 3. Start the TFTP client (in another shell):

          1> tftp:read_file("file.txt", binary, [{port, 19999}]).
    -      {ok,<<"Erlang/OTP 21\n">>}
    +a sample file using the TFTP client.

    Step 1. Create a sample file to be used for the transfer:

          $ echo "Erlang/OTP 21" > file.txt

    Step 2. Start the TFTP server:

          1> {ok, Pid} = tftp:start([{port, 19999}]).
    +      {ok,<0.65.0>}

    Step 3. Start the TFTP client (in another shell):

          1> tftp:read_file("file.txt", binary, [{port, 19999}]).
    +      {ok,<<"Erlang/OTP 21\n">>}
    @@ -172,7 +172,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/introduction.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/introduction.html 2026-06-04 19:05:21.445626590 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/introduction.html 2026-06-04 19:05:21.445626590 +0000 @@ -189,7 +189,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/notes.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (464)) --- old//usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/notes.html 2026-06-04 19:05:21.462626748 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/notes.html 2026-06-04 19:05:21.462626748 +0000 @@ -300,7 +300,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/search.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/search.html 2026-06-04 19:05:21.477661211 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/search.html 2026-06-04 19:05:21.477661211 +0000 @@ -122,7 +122,7 @@
    - + /usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/tftp.epub/OEBPS/content.opf differs (XML 1.0 document, ASCII text) --- old//usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/tftp.epub/OEBPS/content.opf 2026-06-04 00:08:49.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/tftp.epub/OEBPS/content.opf 2042-07-06 13:28:12.000000000 +0000 @@ -4,10 +4,10 @@ version="3.0"> tftp - 1.2.1 - urn:uuid:d195bb25-1f0e-ee0e-2dc1-6ddf92088d98 + urn:uuid:3613aec2-9caf-0a5c-744d-6805e74c42f0 en - 2026-06-04T00:08:49Z + 2042-07-06T13:28:12Z /usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/tftp.epub/OEBPS/getting_started.xhtml differs (HTML document, ASCII text, with very long lines (1248)) --- old//usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/tftp.epub/OEBPS/getting_started.xhtml 2026-06-04 00:08:49.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/tftp.epub/OEBPS/getting_started.xhtml 2042-07-06 13:28:12.000000000 +0000 @@ -23,9 +23,9 @@

    The start/1 function starts a daemon process listening for UDP packets on a port. When it receives a request for read or write, it spawns a temporary server process handling the transfer.

    This is a simple example of starting the TFTP server and reading the content of -a sample file using the TFTP client.

    Step 1. Create a sample file to be used for the transfer:

          $ echo "Erlang/OTP 21" > file.txt

    Step 2. Start the TFTP server:

          1> {ok, Pid} = tftp:start([{port, 19999}]).
    -      {ok,<0.65.0>}

    Step 3. Start the TFTP client (in another shell):

          1> tftp:read_file("file.txt", binary, [{port, 19999}]).
    -      {ok,<<"Erlang/OTP 21\n">>}
    +a sample file using the TFTP client.

    Step 1. Create a sample file to be used for the transfer:

          $ echo "Erlang/OTP 21" > file.txt

    Step 2. Start the TFTP server:

          1> {ok, Pid} = tftp:start([{port, 19999}]).
    +      {ok,<0.65.0>}

    Step 3. Start the TFTP client (in another shell):

          1> tftp:read_file("file.txt", binary, [{port, 19999}]).
    +      {ok,<<"Erlang/OTP 21\n">>}
    /usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/tftp.epub/OEBPS/tftp.xhtml differs (HTML document, ASCII text, with very long lines (630)) --- old//usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/tftp.epub/OEBPS/tftp.xhtml 2026-06-04 00:08:49.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/tftp.epub/OEBPS/tftp.xhtml 2042-07-06 13:28:12.000000000 +0000 @@ -29,7 +29,7 @@ Overwiew

    -

    This is a complete implementation of the following IETF standards:

    RFC 1350, The TFTP Protocol (revision 2).
    +

    This is a complete implementation of the following IETF standards:

    RFC 1350, The TFTP Protocol (revision 2).
     RFC 2347, TFTP Option Extension.
     RFC 2348, TFTP Blocksize Option.
     RFC 2349, TFTP Timeout Interval and Transfer Size Options.

    The only feature that not is implemented in this release is /usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/tftp.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (630)) --- old//usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/tftp.html 2026-06-04 19:05:21.560627657 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/tftp.html 2026-06-04 19:05:21.560627657 +0000 @@ -134,7 +134,7 @@ Overwiew -

    This is a complete implementation of the following IETF standards:

    RFC 1350, The TFTP Protocol (revision 2).
    +

    This is a complete implementation of the following IETF standards:

    RFC 1350, The TFTP Protocol (revision 2).
     RFC 2347, TFTP Option Extension.
     RFC 2348, TFTP Blocksize Option.
     RFC 2349, TFTP Timeout Interval and Transfer Size Options.

    The only feature that not is implemented in this release is @@ -964,7 +964,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/tftp_logger.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/tftp_logger.html 2026-06-04 19:05:21.578627824 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tftp-1.2.1/doc/html/tftp_logger.html 2026-06-04 19:05:21.580627842 +0000 @@ -311,7 +311,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/404.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/404.html 2026-06-04 19:05:21.596695428 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/404.html 2026-06-04 19:05:21.596695428 +0000 @@ -147,7 +147,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/api-reference.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/api-reference.html 2026-06-04 19:05:21.613628148 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/api-reference.html 2026-06-04 19:05:21.614628158 +0000 @@ -260,7 +260,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/cover.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (586)) --- old//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/cover.html 2026-06-04 19:05:21.646628454 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/cover.html 2026-06-04 19:05:21.646628454 +0000 @@ -1561,7 +1561,7 @@ call is equivalent to analyse('_', coverage, Arg).

    Otherwise Arg is assumed to be a module name, and this call is equivalent to analyse(Arg, coverage, function).

    Note

    To analyze a module whose name overlaps with one the values in analysis() or level(), the module -name has to be in a list. For example, to analyze a module named calls:

    cover:analyse([calls]).
    +name has to be in a list. For example, to analyze a module named calls:

    cover:analyse([calls]).
    @@ -1603,7 +1603,7 @@ analyse(Arg1, Arg2, function).

    If Arg2 is one of the values in level(), Arg1 is assumed to be a module and this call is equivalent to analyse(Arg1, coverage, Arg2).

    Note

    To analyze a module whose name overlaps with one of the values in analysis(), the module name needs to be in a -list. For example, to analyze a module named calls:

    cover:analyse([calls], function).
    +list. For example, to analyze a module named calls:

    cover:analyse([calls], function).
    @@ -1712,7 +1712,7 @@ options, this call is equivalent to analyse_to_file('_', Arg).

    Otherwise Arg is assumed to be a module, and this call is equivalent to analyse_to_file(Arg, []).

    Note

    To analyze a module of the name html (which overlaps with an option in analyse_option()), it is necessary to -use cover:analyse_to_file/2:

    cover:analyse_to_file([html], []).
    +use cover:analyse_to_file/2:

    cover:analyse_to_file([html], []).
    @@ -2705,7 +2705,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/cover_chapter.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (842)) --- old//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/cover_chapter.html 2026-06-04 19:05:21.671628687 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/cover_chapter.html 2026-06-04 19:05:21.671628687 +0000 @@ -146,81 +146,81 @@ Example -

    Assume that a test case for the following program should be verified:

    -module(channel).
    --behaviour(gen_server).
    +

    Assume that a test case for the following program should be verified:

    -module(channel).
    +-behaviour(gen_server).
     
    --export([start_link/0,stop/0]).
    --export([alloc/0,free/1]). % client interface
    --export([init/1,handle_call/3,terminate/2]). % callback functions
    +-export([start_link/0,stop/0]).
    +-export([alloc/0,free/1]). % client interface
    +-export([init/1,handle_call/3,terminate/2]). % callback functions
     
    -start_link() ->
    -    gen_server:start_link({local,channel}, channel, [], []).
    +start_link() ->
    +    gen_server:start_link({local,channel}, channel, [], []).
     
    -stop() ->
    -    gen_server:call(channel, stop).
    +stop() ->
    +    gen_server:call(channel, stop).
     
     %%%-Client interface functions-------------------------------------------
     
    -alloc() ->
    -    gen_server:call(channel, alloc).
    +alloc() ->
    +    gen_server:call(channel, alloc).
     
    -free(Channel) ->
    -    gen_server:call(channel, {free,Channel}).
    +free(Channel) ->
    +    gen_server:call(channel, {free,Channel}).
     
     %%%-gen_server callback functions----------------------------------------
     
    -init(_Arg) ->
    -    {ok,channels()}.
    +init(_Arg) ->
    +    {ok,channels()}.
     
    -handle_call(stop, _Client, Channels) ->
    -    {stop,normal,ok,Channels};
    +handle_call(stop, _Client, Channels) ->
    +    {stop,normal,ok,Channels};
     
    -handle_call(alloc, _Client, Channels) ->
    -    {Ch,Channels2} = alloc(Channels),
    -    {reply,{ok,Ch},Channels2};
    +handle_call(alloc, _Client, Channels) ->
    +    {Ch,Channels2} = alloc(Channels),
    +    {reply,{ok,Ch},Channels2};
     
    -handle_call({free,Channel}, _Client, Channels) ->
    -    Channels2 = free(Channel, Channels),
    -    {reply,ok,Channels2}.
    +handle_call({free,Channel}, _Client, Channels) ->
    +    Channels2 = free(Channel, Channels),
    +    {reply,ok,Channels2}.
     
    -terminate(_Reason, _Channels) ->
    +terminate(_Reason, _Channels) ->
         ok.
     
     %%%-Internal functions---------------------------------------------------
     
    -channels() ->
    -    [ch1,ch2,ch3].
    +channels() ->
    +    [ch1,ch2,ch3].
     
    -alloc([Channel|Channels]) ->
    -    {Channel,Channels};
    -alloc([]) ->
    +alloc([Channel|Channels]) ->
    +    {Channel,Channels};
    +alloc([]) ->
         false.
     
    -free(Channel, Channels) ->
    -    [Channel|Channels].

    The test case is implemented as follows:

    -module(test).
    --export([s/0]).
    -
    -s() ->
    -    {ok,Pid} = channel:start_link(),
    -    {ok,Ch1} = channel:alloc(),
    -    ok = channel:free(Ch1),
    -    ok = channel:stop().

    +free(Channel, Channels) -> + [Channel|Channels].

    The test case is implemented as follows:

    -module(test).
    +-export([s/0]).
    +
    +s() ->
    +    {ok,Pid} = channel:start_link(),
    +    {ok,Ch1} = channel:alloc(),
    +    ok = channel:free(Ch1),
    +    ok = channel:stop().

    Preparation

    First of all, Cover must be started. This spawns a process which owns the Cover -database where all coverage data will be stored.

    1> cover:start().
    -{ok,<0.90.0>}

    To include other nodes in the coverage analysis, use +database where all coverage data will be stored.

    1> cover:start().
    +{ok,<0.90.0>}

    To include other nodes in the coverage analysis, use cover:start/1. All cover-compiled modules will then be loaded on all nodes, and data from all nodes will be summed up when analysing. For simplicity this example only involves the current node.

    Before any analysis can take place, the involved modules must be cover-compiled. This means that some extra information is added to the module before beging compiled into a binary and loaded. The source file of the module is -not affected and no .beam file is created.

    2> cover:compile_module(channel).
    -{ok,channel}

    Each time a function in the cover-compiled module channel is called, +not affected and no .beam file is created.

    2> cover:compile_module(channel).
    +{ok,channel}

    Each time a function in the cover-compiled module channel is called, information about the call will be added to the Cover database. Run the test case:

    3> test:s().
     ok

    Cover analysis is performed by examining the contents of the Cover database. The @@ -238,56 +238,56 @@ {Cov,NotCov}, where Cov is the number of executable lines that have been executed at least once and NotCov is the number of executable lines that have not been executed.

    If the analysis is made on module level, the result is given for the entire -module as a tuple {Module,{Cov,NotCov}}:

    4> cover:analyse(channel, coverage, module).
    -{ok,{channel,{14,1}}}

    For channel, the result shows that 14 lines in the module are covered but one +module as a tuple {Module,{Cov,NotCov}}:

    4> cover:analyse(channel, coverage, module).
    +{ok,{channel,{14,1}}}

    For channel, the result shows that 14 lines in the module are covered but one line is not covered.

    If the analysis is made on function level, the result is given as a list of tuples {Function,{Cov,NotCov}}, one for each function in the module. A -function is specified by its module name, function name and arity:

    5> cover:analyse(channel, coverage, function).
    -{ok,[{{channel,start_link,0},{1,0}},
    -     {{channel,stop,0},{1,0}},
    -     {{channel,alloc,0},{1,0}},
    -     {{channel,free,1},{1,0}},
    -     {{channel,init,1},{1,0}},
    -     {{channel,handle_call,3},{5,0}},
    -     {{channel,terminate,2},{1,0}},
    -     {{channel,channels,0},{1,0}},
    -     {{channel,alloc,1},{1,1}},
    -     {{channel,free,2},{1,0}}]}

    For channel, the result shows that the uncovered line is in the function +function is specified by its module name, function name and arity:

    5> cover:analyse(channel, coverage, function).
    +{ok,[{{channel,start_link,0},{1,0}},
    +     {{channel,stop,0},{1,0}},
    +     {{channel,alloc,0},{1,0}},
    +     {{channel,free,1},{1,0}},
    +     {{channel,init,1},{1,0}},
    +     {{channel,handle_call,3},{5,0}},
    +     {{channel,terminate,2},{1,0}},
    +     {{channel,channels,0},{1,0}},
    +     {{channel,alloc,1},{1,1}},
    +     {{channel,free,2},{1,0}}]}

    For channel, the result shows that the uncovered line is in the function channel:alloc/1.

    If the analysis is made on clause level, the result is given as a list of tuples {Clause,{Cov,NotCov}}, one for each function clause in the module. A clause is specified by its module name, function name, arity and position within the -function definition:

    6> cover:analyse(channel, coverage, clause).
    -{ok,[{{channel,start_link,0,1},{1,0}},
    -     {{channel,stop,0,1},{1,0}},
    -     {{channel,alloc,0,1},{1,0}},
    -     {{channel,free,1,1},{1,0}},
    -     {{channel,init,1,1},{1,0}},
    -     {{channel,handle_call,3,1},{1,0}},
    -     {{channel,handle_call,3,2},{2,0}},
    -     {{channel,handle_call,3,3},{2,0}},
    -     {{channel,terminate,2,1},{1,0}},
    -     {{channel,channels,0,1},{1,0}},
    -     {{channel,alloc,1,1},{1,0}},
    -     {{channel,alloc,1,2},{0,1}},
    -     {{channel,free,2,1},{1,0}}]}

    For channel, the result shows that the uncovered line is in the second clause +function definition:

    6> cover:analyse(channel, coverage, clause).
    +{ok,[{{channel,start_link,0,1},{1,0}},
    +     {{channel,stop,0,1},{1,0}},
    +     {{channel,alloc,0,1},{1,0}},
    +     {{channel,free,1,1},{1,0}},
    +     {{channel,init,1,1},{1,0}},
    +     {{channel,handle_call,3,1},{1,0}},
    +     {{channel,handle_call,3,2},{2,0}},
    +     {{channel,handle_call,3,3},{2,0}},
    +     {{channel,terminate,2,1},{1,0}},
    +     {{channel,channels,0,1},{1,0}},
    +     {{channel,alloc,1,1},{1,0}},
    +     {{channel,alloc,1,2},{0,1}},
    +     {{channel,free,2,1},{1,0}}]}

    For channel, the result shows that the uncovered line is in the second clause of channel:alloc/1.

    Finally, if the analysis is made on line level, the result is given as a list of tuples {Line,{Cov,NotCov}}, one for each executable line in the source code. A -line is specified by its module name and line number.

    7> cover:analyse(channel, coverage, line).
    -{ok,[{{channel,9},{1,0}},
    -     {{channel,12},{1,0}},
    -     {{channel,17},{1,0}},
    -     {{channel,20},{1,0}},
    -     {{channel,25},{1,0}},
    -     {{channel,28},{1,0}},
    -     {{channel,31},{1,0}},
    -     {{channel,32},{1,0}},
    /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/cprof.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1243))
    --- old//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/cprof.html	2026-06-04 19:05:21.693628890 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/cprof.html	2026-06-04 19:05:21.693628890 +0000
    @@ -590,7 +590,7 @@
     
           
     
    -

    Collects and analyses all call counters for module Module.

    This function returns:

    {Module, ModuleCount, FuncAnalysisList}

    where FuncAnalysisList is a list of tuples, one for each function:

    {{Module, FunctionName, Arity}, FuncCallCount}

    If call counters are still running while analyse/0,1,2 is executing, the result +

    Collects and analyses all call counters for module Module.

    This function returns:

    {Module, ModuleCount, FuncAnalysisList}

    where FuncAnalysisList is a list of tuples, one for each function:

    {{Module, FunctionName, Arity}, FuncCallCount}

    If call counters are still running while analyse/0,1,2 is executing, the result could be inconsistent. This happens if the process executing analyse/0,1,2 is scheduled out so some other process can increment the counters that are being analysed. Calling pause() before analysing takes care of @@ -1111,7 +1111,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/cprof_chapter.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1636)) --- old//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/cprof_chapter.html 2026-06-04 19:05:21.713629076 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/cprof_chapter.html 2026-06-04 19:05:21.713629076 +0000 @@ -156,36 +156,36 @@ Example: Background work -

    From the Erlang shell:

    1> cprof:start(), cprof:pause(). % Stop counters just after start
    +

    From the Erlang shell:

    1> cprof:start(), cprof:pause(). % Stop counters just after start
     8492
    -2> cprof:analyse().
    -{539,
    - [{shell,155,
    -         [{{shell,prep_check,1},55},
    -          {{shell,used_records,4},45},
    -          {{shell,used_records,1},45},
    -          {{shell,used_record_defs,2},1},
    -          {{shell,record_defs,2},1},
    -          {{shell,record_bindings,2},1},
    -          {{shell,exprs,7},1},
    -          {{shell,expr,4},1},
    -          {{shell,expand_records,2},1},
    -          {{shell,check_command,2},1},
    -          {{shell,apply_fun,3},1},
    -          {{shell,'-exprs/7-lc$^0/1-0-',1},1},
    -          {{shell,'-eval_loop/3-fun-0-',3},1}]},
    +2> cprof:analyse().
    +{539,
    + [{shell,155,
    +         [{{shell,prep_check,1},55},
    +          {{shell,used_records,4},45},
    +          {{shell,used_records,1},45},
    +          {{shell,used_record_defs,2},1},
    +          {{shell,record_defs,2},1},
    +          {{shell,record_bindings,2},1},
    +          {{shell,exprs,7},1},
    +          {{shell,expr,4},1},
    +          {{shell,expand_records,2},1},
    +          {{shell,check_command,2},1},
    +          {{shell,apply_fun,3},1},
    +          {{shell,'-exprs/7-lc$^0/1-0-',1},1},
    +          {{shell,'-eval_loop/3-fun-0-',3},1}]},
       %% Information about many modules omitted.
                          .
                          .
                          .
       %% Here is the last part.
    -  {erts_internal,2,[{{erts_internal,trace_pattern,3},2}]},
    -  {otp_internal,1,[{{otp_internal,obsolete,3},1}]},
    -  {maps,1,[{{maps,from_list,1},1}]},
    -  {erl_internal,1,[{{erl_internal,bif,3},1}]}]}
    -3> cprof:analyse(cprof).
    -{cprof,3,[{{cprof,tr,2},2},{{cprof,pause,0},1}]}
    -4> cprof:stop().
    +  {erts_internal,2,[{{erts_internal,trace_pattern,3},2}]},
    +  {otp_internal,1,[{{otp_internal,obsolete,3},1}]},
    +  {maps,1,[{{maps,from_list,1},1}]},
    +  {erl_internal,1,[{{erl_internal,bif,3},1}]}]}
    +3> cprof:analyse(cprof).
    +{cprof,3,[{{cprof,tr,2},2},{{cprof,pause,0},1}]}
    +4> cprof:stop().
     8586

    The example showed some of the background work that the shell performs just to interpret the first command line.

    What is captured in this example is the part of the work the shell does while interpreting the command line that occurs between the actual calls to @@ -195,20 +195,20 @@ Example: One module -

    From the Erlang shell:

    1> cprof:start(),R=calendar:day_of_the_week(1896,4,27),cprof:pause(),R.
    +

    From the Erlang shell:

    1> cprof:start(),R=calendar:day_of_the_week(1896,4,27),cprof:pause(),R.
     1
    -2> cprof:analyse(calendar).
    -{calendar,9,
    -          [{{calendar,last_day_of_the_month1,2},1},
    -           {{calendar,last_day_of_the_month,2},1},
    -           {{calendar,is_leap_year1,1},1},
    -           {{calendar,is_leap_year,1},1},
    -           {{calendar,dy,1},1},
    -           {{calendar,dm,1},1},
    -           {{calendar,df,2},1},
    -           {{calendar,day_of_the_week,3},1},
    -           {{calendar,date_to_gregorian_days,3},1}]}
    -3> cprof:stop().
    +2> cprof:analyse(calendar).
    +{calendar,9,
    +          [{{calendar,last_day_of_the_month1,2},1},
    +           {{calendar,last_day_of_the_month,2},1},
    +           {{calendar,is_leap_year1,1},1},
    +           {{calendar,is_leap_year,1},1},
    +           {{calendar,dy,1},1},
    +           {{calendar,dm,1},1},
    +           {{calendar,df,2},1},
    +           {{calendar,day_of_the_week,3},1},
    +           {{calendar,date_to_gregorian_days,3},1}]}
    +3> cprof:stop().
     8648

    The example tells us that "Aktiebolaget LM Ericsson & Co" was registered on a Monday (since the return value of the first command is 1), and that the calendar module needed 9 function calls to calculate that.

    Using cprof:analyse() in this example also shows approximately the same @@ -218,60 +218,60 @@ Example: In the code -

    Write a module:

    -module(sort).
    --export([do/1]).
    +

    Write a module:

    -module(sort).
    +-export([do/1]).
     
    -do(N) ->
    -    cprof:stop(),
    -    cprof:start(),
    -    do(N, []).
    -
    -do(0, L) ->
    -    R = lists:sort(L),
    -    cprof:pause(),
    +do(N) ->
    +    cprof:stop(),
    +    cprof:start(),
    +    do(N, []).
    +
    +do(0, L) ->
    +    R = lists:sort(L),
    +    cprof:pause(),
         R;
    -do(N, L) ->
    -    do(N-1, [rand:uniform(256)-1 | L]).

    From the Erlang shell:

    1> c(sort).
    -{ok,sort}
    -2> rand:seed(default, 42), ok.
    +do(N, L) ->
    +    do(N-1, [rand:uniform(256)-1 | L]).

    From the Erlang shell:

    1> c(sort).
    +{ok,sort}
    +2> rand:seed(default, 42), ok.
     ok.
    -3> sort:do(1000).
    -[0,0,0,1,1,1,1,2,2,3,3,4,4,4,4,5,5,5,6,6,6,6,7,7,7,7,7,8,8|...]
    -4> cprof:analyse().
    -{13180,
    - [{lists,6173,
    -         [{{lists,rmerge3_1,6},1045},
    -          {{lists,rmerge3_2,6},977},
    -          {{lists,split_1,5},652},
    -          {{lists,merge3_1,6},579},
    -          {{lists,merge3_2,6},577},
    -          {{lists,rmerge3_12_3,6},511},
    -          {{lists,split_1_1,6},347},
    -          {{lists,merge3_12_3,6},310},
    -          {{lists,rmerge3_21_3,6},282},
    -          {{lists,merge3_21_3,6},221},
    -          {{lists,merge2_1,4},154},
    -          {{lists,merge2_2,5},138},
    -          {{lists,reverse,2},106},
    -          {{lists,rmerge2_2,5},87},
    -          {{lists,rmergel,2},81},
    -          {{lists,rmerge2_1,4},75},
    -          {{lists,mergel,2},28},
    -          {{lists,keyfind,3},2},
    -          {{lists,sort,1},1}]},
    -  {rand,5000,
    -        [{{rand,uniform_s,2},1000},
    -         {{rand,uniform,1},1000},
    -         {{rand,seed_put,1},1000},
    -         {{rand,seed_get,0},1000},
    -         {{rand,exsss_uniform,2},1000}]},
    -  {erlang,1004,
    -          [{{erlang,put,2},1000},
    -           {{erlang,trace_pattern,3},2},
    -           {{erlang,ensure_tracer_module_loaded,2},2}]},
    -  {sort,1001,[{{sort,do,2},1001}]},
    -  {erts_internal,2,[{{erts_internal,trace_pattern,3},2}]}]}
    -5> cprof:stop().
    +3> sort:do(1000).
    +[0,0,0,1,1,1,1,2,2,3,3,4,4,4,4,5,5,5,6,6,6,6,7,7,7,7,7,8,8|...]
    +4> cprof:analyse().
    +{13180,
    + [{lists,6173,
    +         [{{lists,rmerge3_1,6},1045},
    +          {{lists,rmerge3_2,6},977},
    +          {{lists,split_1,5},652},
    +          {{lists,merge3_1,6},579},
    +          {{lists,merge3_2,6},577},
    +          {{lists,rmerge3_12_3,6},511},
    +          {{lists,split_1_1,6},347},
    +          {{lists,merge3_12_3,6},310},
    +          {{lists,rmerge3_21_3,6},282},
    +          {{lists,merge3_21_3,6},221},
    +          {{lists,merge2_1,4},154},
    +          {{lists,merge2_2,5},138},
    +          {{lists,reverse,2},106},
    +          {{lists,rmerge2_2,5},87},
    +          {{lists,rmergel,2},81},
    +          {{lists,rmerge2_1,4},75},
    +          {{lists,mergel,2},28},
    +          {{lists,keyfind,3},2},
    +          {{lists,sort,1},1}]},
    +  {rand,5000,
    +        [{{rand,uniform_s,2},1000},
    +         {{rand,uniform,1},1000},
    +         {{rand,seed_put,1},1000},
    +         {{rand,seed_get,0},1000},
    +         {{rand,exsss_uniform,2},1000}]},
    +  {erlang,1004,
    Missing in old package: /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/dist/search_data-C30560BD.js
    Missing in old package: /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/dist/search_data-C30560BD.js
    /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/eprof.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (366))
    --- old//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/eprof.html	2026-06-04 19:05:21.741629336 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/eprof.html	2026-06-04 19:05:21.745629373 +0000
    @@ -1011,7 +1011,7 @@
               Erlang programming language
     
           

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/erlang-el.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (898)) --- old//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/erlang-el.html 2026-06-04 19:05:21.765629558 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/erlang-el.html 2026-06-04 19:05:21.766629568 +0000 @@ -211,23 +211,23 @@
    • C-c C-a (align-current) - aligns comments, arrows, assignments, and type annotations around the cursor.
    Example:
     
    -sum(L) -> sum(L, 0).
    -sum([H|T], Sum) -> sum(T, Sum + H);  % recurse
    -sum([], Sum) -> Sum.   % base case
    +sum(L) -> sum(L, 0).
    +sum([H|T], Sum) -> sum(T, Sum + H);  % recurse
    +sum([], Sum) -> Sum.   % base case
     
    --record { two :: int(), % hello
    -          three = hello :: string(),    % there
    -          four = 42 :: int() }.
    +-record { two :: int(), % hello
    +          three = hello :: string(),    % there
    +          four = 42 :: int() }.
     
     becomes:
     
    -sum(L) -> sum(L, 0).
    -sum([H|T], Sum) -> sum(T, Sum + H); % recurse
    -sum([], Sum)    -> Sum.             % base case
    +sum(L) -> sum(L, 0).
    +sum([H|T], Sum) -> sum(T, Sum + H); % recurse
    +sum([], Sum)    -> Sum.             % base case
     
    --record { two           :: int(),    % hello
    -          three = hello :: string(), % there
    -          four  = 42    :: int() }.

    +-record { two :: int(), % hello + three = hello :: string(), % there + four = 42 :: int() }.

    @@ -355,7 +355,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/erlang_mode_chapter.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/erlang_mode_chapter.html 2026-06-04 19:05:21.785629744 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/erlang_mode_chapter.html 2026-06-04 19:05:21.786629753 +0000 @@ -331,7 +331,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/fprof.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1176)) --- old//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/fprof.html 2026-06-04 19:05:21.818630050 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/fprof.html 2026-06-04 19:05:21.818630050 +0000 @@ -175,61 +175,61 @@ interested reader to try it out. Note that some flags to analyse/1 will affect the format.

    The following example was run on Erlang/OTP R8 on Solaris 8; all OTP internals in this example are version dependent.

    As an example, we will use the following function, which is a -slightly modified benchmark function from module file:

    -module(foo).
    --export([create_file_slow/2]).
    +slightly modified benchmark function from module file:

    -module(foo).
    +-export([create_file_slow/2]).
     
    -create_file_slow(Name, N) when is_integer(N), N >= 0 ->
    -    {ok, FD} =
    -        file:open(Name, [raw, write, delayed_write, binary]),
    +create_file_slow(Name, N) when is_integer(N), N >= 0 ->
    +    {ok, FD} =
    +        file:open(Name, [raw, write, delayed_write, binary]),
         if N > 256 ->
    -            ok = file:write(FD,
    -                            lists:map(fun (X) -> <<X:32/unsigned>> end,
    -                            lists:seq(0, 255))),
    -            ok = create_file_slow(FD, 256, N);
    +            ok = file:write(FD,
    +                            lists:map(fun (X) -> <<X:32/unsigned>> end,
    +                            lists:seq(0, 255))),
    +            ok = create_file_slow(FD, 256, N);
            true ->
    -            ok = create_file_slow(FD, 0, N)
    +            ok = create_file_slow(FD, 0, N)
         end,
    -    ok = file:close(FD).
    +    ok = file:close(FD).
     
    -create_file_slow(FD, M, M) ->
    +create_file_slow(FD, M, M) ->
         ok;
    -create_file_slow(FD, M, N) ->
    -    ok = file:write(FD, <<M:32/unsigned>>),
    -    create_file_slow(FD, M+1, N).

    Let us have a look at the printout after running:

    1> fprof:apply(foo, create_file_slow, [junk, 1024]).
    -2> fprof:profile().
    -3> fprof:analyse().

    The printout starts with:

    %% Analysis results:
    -{  analysis_options,
    - [{callers, true},
    -  {sort, acc},
    -  {totals, false},
    -  {details, true}]}.
    +create_file_slow(FD, M, N) ->
    +    ok = file:write(FD, <<M:32/unsigned>>),
    +    create_file_slow(FD, M+1, N).

    Let us have a look at the printout after running:

    1> fprof:apply(foo, create_file_slow, [junk, 1024]).
    +2> fprof:profile().
    +3> fprof:analyse().

    The printout starts with:

    %% Analysis results:
    +{  analysis_options,
    + [{callers, true},
    +  {sort, acc},
    +  {totals, false},
    +  {details, true}]}.
     
     %                                       CNT       ACC       OWN
    -[{ totals,                             9627, 1691.119, 1659.074}].  %%%

    The CNT column shows the total number of function calls that was found in the +[{ totals, 9627, 1691.119, 1659.074}]. %%%

    The CNT column shows the total number of function calls that was found in the trace. In the ACC column is the total time of the trace from first timestamp to last. And in the OWN column is the sum of the execution time in functions found in the trace, not including called functions. In this case it is very close to the ACC time since the emulator had practically nothing to do except executing our test program.

    All time values in the printout are in milliseconds.

    The printout continues:

    %                                       CNT       ACC       OWN
    -[{ "<0.28.0>",                         9627,undefined, 1659.074}].   %%

    This is the printout header of one process. The printout contains only this one +[{ "<0.28.0>", 9627,undefined, 1659.074}]. %%

    This is the printout header of one process. The printout contains only this one process since we called fprof:apply/3 that traces only the current process. Therefore the CNT and OWN columns perfectly matches the totals above. The ACC column is undefined since summing the ACC times of all calls in the process makes no sense — one would get something like the ACC value from totals above multiplied by the average depth of the call stack.

    All paragraphs up to the next process header only concerns function calls within -this process.

    Now we come to something more interesting:

    {[{undefined,                             0, 1691.076,    0.030}],
    - { {fprof,apply_start_stop,4},            0, 1691.076,    0.030},     %
    - [{{foo,create_file_slow,2},              1, 1691.046,    0.103},
    -  {suspend,                               1,    0.000,    0.000}]}.
    -
    -{[{{fprof,apply_start_stop,4},            1, 1691.046,    0.103}],
    - { {foo,create_file_slow,2},              1, 1691.046,    0.103},     %
    - [{{file,close,1},                        1, 1398.873,    0.019},
    -  {{foo,create_file_slow,3},              1,  249.678,    0.029},
    -  {{file,open,2},                         1,   20.778,    0.055},
    -  {{lists,map,2},                         1,   16.590,    0.043},
    -  {{lists,seq,2},                         1,    4.708,    0.017},
    -  {{file,write,2},                        1,    0.316,    0.021}]}.

    The printout consists of one paragraph per called function. The function +this process.

    Now we come to something more interesting:

    {[{undefined,                             0, 1691.076,    0.030}],
    + { {fprof,apply_start_stop,4},            0, 1691.076,    0.030},     %
    + [{{foo,create_file_slow,2},              1, 1691.046,    0.103},
    +  {suspend,                               1,    0.000,    0.000}]}.
    +
    +{[{{fprof,apply_start_stop,4},            1, 1691.046,    0.103}],
    + { {foo,create_file_slow,2},              1, 1691.046,    0.103},     %
    + [{{file,close,1},                        1, 1398.873,    0.019},
    +  {{foo,create_file_slow,3},              1,  249.678,    0.029},
    +  {{file,open,2},                         1,   20.778,    0.055},
    +  {{lists,map,2},                         1,   16.590,    0.043},
    +  {{lists,seq,2},                         1,    4.708,    0.017},
    +  {{file,write,2},                        1,    0.316,    0.021}]}.

    The printout consists of one paragraph per called function. The function marked with % is the one the paragraph concerns — foo:create_file_slow/2. Above the marked function are the calling functions — those that has called the marked, and below are those called by the marked function.

    The paragraphs are per default sorted in descending order of the ACC column for @@ -246,12 +246,12 @@ (lists:seq/2 and lists:map/2).

    The function undefined that has called fprof:apply_start_stop/4 is an unknown function because that call was not recorded in the trace. It was only recorded that the execution returned from fprof:apply_start_stop/4 to some -other function above in the call stack, or that the process exited from there.

    Let us continue down the printout to find:

    {[{{foo,create_file_slow,2},              1,  249.678,    0.029},
    -  {{foo,create_file_slow,3},            768,    0.000,   23.294}],
    - { {foo,create_file_slow,3},            769,  249.678,   23.323},     %
    - [{{file,write,2},                      768,  220.314,   14.539},
    -  {suspend,                              57,    6.041,    0.000},
    -  {{foo,create_file_slow,3},            768,    0.000,   23.294}]}.

    If you compare with the code you will see there also that +other function above in the call stack, or that the process exited from there.

    Let us continue down the printout to find:

    {[{{foo,create_file_slow,2},              1,  249.678,    0.029},
    +  {{foo,create_file_slow,3},            768,    0.000,   23.294}],
    + { {foo,create_file_slow,3},            769,  249.678,   23.323},     %
    + [{{file,write,2},                      768,  220.314,   14.539},
    +  {suspend,                              57,    6.041,    0.000},
    +  {{foo,create_file_slow,3},            768,    0.000,   23.294}]}.

    If you compare with the code you will see there also that foo:create_file_slow/3 was called only from foo:create_file_slow/2 and itself, and called only file:write/2, note the number of calls to file:write/2. But here we see that suspend was called a few times. This is a @@ -259,88 +259,88 @@ foo:create_file_slow/3, and since there is no receive or erlang:yield/0 in the code, it must be Erlang scheduling suspensions, or the trace file driver compensating for large file write operations (these are regarded as a schedule -out followed by a schedule in to the same process).

    Let us find the suspend entry:

    {[{{file,write,2},                       53,    6.281,    0.000},
    -  {{foo,create_file_slow,3},             57,    6.041,    0.000},
    -  {{prim_file,drv_command,4},            50,    4.582,    0.000},
    -  {{prim_file,drv_get_response,1},       34,    2.986,    0.000},
    -  {{lists,map,2},                        10,    2.104,    0.000},
    -  {{prim_file,write,2},                  17,    1.852,    0.000},
    -  {{erlang,port_command,2},              15,    1.713,    0.000},
    -  {{prim_file,drv_command,2},            22,    1.482,    0.000},
    -  {{prim_file,translate_response,2},     11,    1.441,    0.000},
    -  {{prim_file,'-drv_command/2-fun-0-',1},  15,    1.340,    0.000},
    -  {{lists,seq,4},                         3,    0.880,    0.000},
    -  {{foo,'-create_file_slow/2-fun-0-',1},   5,    0.523,    0.000},
    -  {{erlang,bump_reductions,1},            4,    0.503,    0.000},
    -  {{prim_file,open_int_setopts,3},        1,    0.165,    0.000},
    -  {{prim_file,i32,4},                     1,    0.109,    0.000},
    -  {{fprof,apply_start_stop,4},            1,    0.000,    0.000}],
    - { suspend,                             299,   32.002,    0.000},     %
    - [ ]}.

    We find no particularly long suspend times, so no function seems to have waited +out followed by a schedule in to the same process).

    Let us find the suspend entry:

    {[{{file,write,2},                       53,    6.281,    0.000},
    +  {{foo,create_file_slow,3},             57,    6.041,    0.000},
    +  {{prim_file,drv_command,4},            50,    4.582,    0.000},
    +  {{prim_file,drv_get_response,1},       34,    2.986,    0.000},
    +  {{lists,map,2},                        10,    2.104,    0.000},
    +  {{prim_file,write,2},                  17,    1.852,    0.000},
    +  {{erlang,port_command,2},              15,    1.713,    0.000},
    +  {{prim_file,drv_command,2},            22,    1.482,    0.000},
    +  {{prim_file,translate_response,2},     11,    1.441,    0.000},
    +  {{prim_file,'-drv_command/2-fun-0-',1},  15,    1.340,    0.000},
    +  {{lists,seq,4},                         3,    0.880,    0.000},
    +  {{foo,'-create_file_slow/2-fun-0-',1},   5,    0.523,    0.000},
    +  {{erlang,bump_reductions,1},            4,    0.503,    0.000},
    +  {{prim_file,open_int_setopts,3},        1,    0.165,    0.000},
    +  {{prim_file,i32,4},                     1,    0.109,    0.000},
    +  {{fprof,apply_start_stop,4},            1,    0.000,    0.000}],
    + { suspend,                             299,   32.002,    0.000},     %
    + [ ]}.

    We find no particularly long suspend times, so no function seems to have waited in a receive statement. Actually, prim_file:drv_command/4 contains a receive statement, but in this test program, the message lies in the process receive buffer when the receive statement is entered. We also see that the total suspend time for the test run is small.

    The suspend pseudo function has an OWN time of zero. This is to prevent the process total OWN time from including time in suspension. Whether suspend -time is really ACC or OWN time is more of a philosophical question.

    Now we look at another interesting pseudo function, garbage_collect:

    {[{{prim_file,drv_command,4},            25,    0.873,    0.873},
    -  {{prim_file,write,2},                  16,    0.692,    0.692},
    -  {{lists,map,2},                         2,    0.195,    0.195}],
    - { garbage_collect,                      43,    1.760,    1.760},     %
    - [ ]}.

    Here we see that no function stands out, which is very normal.

    The garbage_collect pseudo function has not an OWN time of zero like +time is really ACC or OWN time is more of a philosophical question.

    Now we look at another interesting pseudo function, garbage_collect:

    {[{{prim_file,drv_command,4},            25,    0.873,    0.873},
    +  {{prim_file,write,2},                  16,    0.692,    0.692},
    +  {{lists,map,2},                         2,    0.195,    0.195}],
    + { garbage_collect,                      43,    1.760,    1.760},     %
    + [ ]}.

    Here we see that no function stands out, which is very normal.

    The garbage_collect pseudo function has not an OWN time of zero like suspend, instead it is equal to the ACC time.

    Garbage collection often occurs while a process is suspended, but fprof hides this fact by pretending that the suspended function was first unsuspended and then garbage collected. Otherwise the printout would show garbage_collect being called from suspend, but not which function that might have caused the -garbage collection.

    Let us now get back to the test code:

    {[{{foo,create_file_slow,3},            768,  220.314,   14.539},
    -  {{foo,create_file_slow,2},              1,    0.316,    0.021}],
    - { {file,write,2},                      769,  220.630,   14.560},     %
    - [{{prim_file,write,2},                 769,  199.789,   22.573},
    -  {suspend,                              53,    6.281,    0.000}]}.

    Not unexpectedly, we see that file:write/2 was called from +garbage collection.

    Let us now get back to the test code:

    {[{{foo,create_file_slow,3},            768,  220.314,   14.539},
    +  {{foo,create_file_slow,2},              1,    0.316,    0.021}],
    + { {file,write,2},                      769,  220.630,   14.560},     %
    + [{{prim_file,write,2},                 769,  199.789,   22.573},
    +  {suspend,                              53,    6.281,    0.000}]}.

    Not unexpectedly, we see that file:write/2 was called from foo:create_file_slow/3 and foo:create_file_slow/2. The number of calls in each case as well as the used time are also confirms the previous results.

    We see that file:write/2 only calls prim_file:write/2, but let us refrain from digging into the internals of the kernel application.

    If we nevertheless do dig down we find the call to the linked-in driver -that does the file operations towards the host operating system:

    {[{{prim_file,drv_command,4},           772, 1458.356, 1456.643}],
    - { {erlang,port_command,2},             772, 1458.356, 1456.643},     %
    - [{suspend,                              15,    1.713,    0.000}]}.

    This is 86 % of the total run time, and as we saw before it is the close +that does the file operations towards the host operating system:

    {[{{prim_file,drv_command,4},           772, 1458.356, 1456.643}],
    + { {erlang,port_command,2},             772, 1458.356, 1456.643},     %
    + [{suspend,                              15,    1.713,    0.000}]}.

    This is 86 % of the total run time, and as we saw before it is the close operation the absolutely biggest contributor. We find a comparison ratio a -little bit up in the call stack:

    {[{{prim_file,close,1},                   1, 1398.748,    0.024},
    /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/fprof_chapter.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (669))
    --- old//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/fprof_chapter.html	2026-06-04 19:05:21.837630226 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/fprof_chapter.html	2026-06-04 19:05:21.839630245 +0000
    @@ -176,10 +176,10 @@
     
     

    It is also possible to trace immediately into the profiling process that creates the raw profile data, that is to short circuit the tracing and profiling steps -so that the filesystem is not used for tracing.

    Do something like this:

    {ok, Tracer} = fprof:profile(start),
    -fprof:trace([start, {tracer, Tracer}]),
    +so that the filesystem is not used for tracing.

    Do something like this:

    {ok, Tracer} = fprof:profile(start),
    +fprof:trace([start, {tracer, Tracer}]),
     %% Run code to profile
    -fprof:trace(stop);

    This puts less load on the filesystem, but much more load on the Erlang runtime +fprof:trace(stop);

    This puts less load on the filesystem, but much more load on the Erlang runtime system.

    @@ -231,7 +231,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/lcnt.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (552)) --- old//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/lcnt.html 2026-06-04 19:05:21.866630495 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/lcnt.html 2026-06-04 19:05:21.866630495 +0000 @@ -1857,7 +1857,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/lcnt_chapter.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1832)) --- old//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/lcnt_chapter.html 2026-06-04 19:05:21.888630699 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/lcnt_chapter.html 2026-06-04 19:05:21.890630718 +0000 @@ -233,20 +233,20 @@ Example with Mnesia Transaction Benchmark -

    From the Erlang shell:

    Erlang/OTP 27 [erts-15.0] [64-bit] [smp:8:8] [ds:8:8:10] [async-threads:1] [jit] [lock-counting]
    +

    From the Erlang shell:

    Erlang/OTP 27 [erts-15.0] [64-bit] [smp:8:8] [ds:8:8:10] [async-threads:1] [jit] [lock-counting]
     
    -Eshell V15.0 (press Ctrl+G to abort, type help(). for help)
    -1> Conf = [{db_nodes, [node()]}, {driver_nodes, [node()]}, {replica_nodes, [node()]},
    -    {n_drivers_per_node, 10}, {n_branches, 1000}, {n_accounts_per_branch, 10},
    -    {replica_type, ram_copies}, {stop_after, 60000}, {reuse_history_id, true}], ok.
    +Eshell V15.0 (press Ctrl+G to abort, type help(). for help)
    +1> Conf = [{db_nodes, [node()]}, {driver_nodes, [node()]}, {replica_nodes, [node()]},
    +    {n_drivers_per_node, 10}, {n_branches, 1000}, {n_accounts_per_branch, 10},
    +    {replica_type, ram_copies}, {stop_after, 60000}, {reuse_history_id, true}], ok.
     ok
    -2> mnesia_tpcb:init([{use_running_mnesia, false}|Conf]).
    +2> mnesia_tpcb:init([{use_running_mnesia, false}|Conf]).
         .
         .
         .
     ignore

    Initial configuring of the benchmark is done. It is time to profile the actual -Mnesia benchmark:

    3> lcnt:apply(fun() -> {ok,{time, Tps,_,_,_,_}} = mnesia_tpcb:run([{use_running_mnesia,
    -    true}|Conf]), Tps/60 end).
    +Mnesia benchmark:

    3> lcnt:apply(fun() -> {ok,{time, Tps,_,_,_,_}} = mnesia_tpcb:run([{use_running_mnesia,
    +    true}|Conf]), Tps/60 end).
           .
           .
           .
    @@ -350,63 +350,63 @@
       
       The Big Bang Benchmark
     
    -
    -module(big).
    --export([bang/1]).
    +
    -module(big).
    +-export([bang/1]).
     
    -pinger([], [], true) ->
    +pinger([], [], true) ->
         receive
    -	{procs, Procs, ReportTo} ->
    -	    pinger(Procs, [], ReportTo)
    +	{procs, Procs, ReportTo} ->
    +	    pinger(Procs, [], ReportTo)
         end;
    -pinger([], [], false) ->
    -    receive {ping, From} -> From ! {pong, self()} end,
    -    pinger([],[],false);
    -pinger([], [], ReportTo) ->
    -    ReportTo ! {done, self()},
    -    pinger([],[],false);
    -pinger([], [Po|Pos] = Pongers, ReportTo) ->
    +pinger([], [], false) ->
    +    receive {ping, From} -> From ! {pong, self()} end,
    +    pinger([],[],false);
    +pinger([], [], ReportTo) ->
    +    ReportTo ! {done, self()},
    +    pinger([],[],false);
    +pinger([], [Po|Pos] = Pongers, ReportTo) ->
         receive
    -	{ping, From} ->
    -	    From ! {pong, self()},
    -	    pinger([], Pongers, ReportTo);
    -	{pong, Po} ->
    -	    pinger([], Pos, ReportTo)
    +	{ping, From} ->
    +	    From ! {pong, self()},
    +	    pinger([], Pongers, ReportTo);
    +	{pong, Po} ->
    +	    pinger([], Pos, ReportTo)
         end;
    -pinger([Pi|Pis], Pongers, ReportTo) ->
    -    receive {ping, From} -> From ! {pong, self()}
    +pinger([Pi|Pis], Pongers, ReportTo) ->
    +    receive {ping, From} -> From ! {pong, self()}
         after 0 -> ok
         end,
    -    Pi ! {ping, self()},
    -    pinger(Pis, [Pi|Pongers], ReportTo).
    +    Pi ! {ping, self()},
    +    pinger(Pis, [Pi|Pongers], ReportTo).
     
    -spawn_procs(N) when N =< 0 ->
    -    [];
    -spawn_procs(N) ->
    -    [spawn_link(fun () -> pinger([],[],true) end) | spawn_procs(N-1)].
    +spawn_procs(N) when N =< 0 ->
    +    [];
    +spawn_procs(N) ->
    +    [spawn_link(fun () -> pinger([],[],true) end) | spawn_procs(N-1)].
     
    -send_procs([], Msg) ->
    +send_procs([], Msg) ->
         Msg;
    -send_procs([P|Ps], Msg) ->
    +send_procs([P|Ps], Msg) ->
         P ! Msg,
    -    send_procs(Ps, Msg).
    +    send_procs(Ps, Msg).
     
    -receive_msgs([]) ->
    +receive_msgs([]) ->
         ok;
    -receive_msgs([M|Ms]) ->
    +receive_msgs([M|Ms]) ->
         receive
     	M ->
    -	    receive_msgs(Ms)
    +	    receive_msgs(Ms)
         end.
     
    -bang(N) when integer(N) ->
    -    Procs = spawn_procs(N),
    -    RMsgs = lists:map(fun (P) -> {done, P} end, Procs),
    -    Start = now(),
    -    send_procs(Procs, {procs, Procs, self()}),
    -    receive_msgs(RMsgs),
    -    Stop = now(),
    -    lists:foreach(fun (P) -> exit(P, normal) end, Procs),
    -    timer:now_diff(Stop, Start).

    +bang(N) when integer(N) -> + Procs = spawn_procs(N), + RMsgs = lists:map(fun (P) -> {done, P} end, Procs), + Start = now(), + send_procs(Procs, {procs, Procs, self()}), + receive_msgs(RMsgs), + Stop = now(), + lists:foreach(fun (P) -> exit(P, normal) end, Procs), + timer:now_diff(Stop, Start).

    @@ -463,7 +463,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/make.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (793)) --- old//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/make.html 2026-06-04 19:05:21.909630894 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/make.html 2026-06-04 19:05:21.910630903 +0000 @@ -142,8 +142,8 @@ the first match is used. For example, the following Emakefile means that file1 should be compiled with the options [debug_info,{i,"../foo"}], while all other files in the current directory should be compiled with only the -debug_info flag.

    {'file1',[debug_info,{i,"../foo"}]}.
    -{'*',[debug_info]}.

    +debug_info flag.

    {'file1',[debug_info,{i,"../foo"}]}.
    +{'*',[debug_info]}.

    @@ -390,7 +390,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/notes.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (2231)) --- old//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/notes.html 2026-06-04 19:05:21.939631172 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/notes.html 2026-06-04 19:05:21.939631172 +0000 @@ -155,25 +155,25 @@ Fixed Bugs and Malfunctions

    -
    • Dialyzer warnings due to type specs added in dbg have been eliminated.

      Own Id: OTP-18860

    • In Erlang/OTP 26, doing a cover analysis on the line level would return multiple entries for lines on which multiple functions were defined.

      For example, consider this module:

      -module(foo).
      --export([bar/0, baz/0]).
      +
      • Dialyzer warnings due to type specs added in dbg have been eliminated.

        Own Id: OTP-18860

      • In Erlang/OTP 26, doing a cover analysis on the line level would return multiple entries for lines on which multiple functions were defined.

        For example, consider this module:

        -module(foo).
        +-export([bar/0, baz/0]).
         
        -bar() -> ok. baz() -> not_ok.

        In Erlang/OTP 26, analysing on the line level would return two entries -for line 4:

        1> cover:compile_module(foo).
        -{ok,foo}
        -2> foo:bar().
        +bar() -> ok. baz() -> not_ok.

        In Erlang/OTP 26, analysing on the line level would return two entries +for line 4:

        1> cover:compile_module(foo).
        +{ok,foo}
        +2> foo:bar().
         ok
        -3> cover:analyse(foo, coverage, line).
        -{ok,[{{foo,4},{1,0}},{{foo,4},{0,1}}]}
        -4> cover:analyse(foo, calls, line).
        -{ok,[{{foo,4},1},{{foo,4},0}]}

        In Erlang/OTP 27, there will only be a single entry for line 4:

        1> cover:compile_module(foo).
        -{ok,foo}
        -2> foo:bar().
        +3> cover:analyse(foo, coverage, line).
        +{ok,[{{foo,4},{1,0}},{{foo,4},{0,1}}]}
        +4> cover:analyse(foo, calls, line).
        +{ok,[{{foo,4},1},{{foo,4},0}]}

        In Erlang/OTP 27, there will only be a single entry for line 4:

        1> cover:compile_module(foo).
        +{ok,foo}
        +2> foo:bar().
         ok
        -3> cover:analyse(foo, coverage, line).
        -{ok,[{{foo,4},{1,0}}]}
        -4> cover:analyse(foo, calls, line).
        -{ok,[{{foo,4},1}]}

        Own Id: OTP-18998 Aux Id: GH-8159, PR-8182

      • Fixed align command in emacs mode.

        Own Id: OTP-19026 Aux Id: PR-8155

      +3> cover:analyse(foo, coverage, line). +{ok,[{{foo,4},{1,0}}]} +4> cover:analyse(foo, calls, line). +{ok,[{{foo,4},1}]}

      Own Id: OTP-18998 Aux Id: GH-8159, PR-8182

    • Fixed align command in emacs mode.

      Own Id: OTP-19026 Aux Id: PR-8155

    @@ -186,12 +186,12 @@ """. "a\nb\nc"

    Adjacent string literals without intervening white space is now a syntax error, to avoid possible confusion with triple-quoted strings. For example:

    1> "abc""xyz".
     "xyz".
    -* 1:6: adjacent string literals without intervening white space

    POTENTIAL INCOMPATIBILITY

    Own Id: OTP-18750 Aux Id: OTP-18746, PR-7313, PR-7451

  • There is a new tool tprof, which combines the functionality of eprof and cprof under one interface and adds heap profiling. It also has functionality to help with profiling process hierarchies.

    Example:

    1> tprof:profile(lists, seq, [1, 16], #href_anchor"ss">type => call_memory}).
    +* 1:6: adjacent string literals without intervening white space

    POTENTIAL INCOMPATIBILITY

    Own Id: OTP-18750 Aux Id: OTP-18746, PR-7313, PR-7451

  • There is a new tool tprof, which combines the functionality of eprof and cprof under one interface and adds heap profiling. It also has functionality to help with profiling process hierarchies.

    Example:

    1> tprof:profile(lists, seq, [1, 16], #href_anchor"ss">type => call_memory}).
     
     ****** Process <0.92.0>  --  100.00% of total *** 
    -FUNCTION          CALLS  WORDS  PER CALL  [     %]
    -lists:seq_loop/3      5     32      6.40  [100.00]
    -                            32            [ 100.0]
    +FUNCTION          CALLS  WORDS  PER CALL  [     %]
    +lists:seq_loop/3      5     32      6.40  [100.00]
    +                            32            [ 100.0]
     ok

    Own Id: OTP-18756 Aux Id: PR-6639

  • Native coverage support has been implemented in the JIT. It will automatically be used by the cover tool to reduce the execution overhead when running cover-compiled code.

    There are also new APIs to support native coverage without using the cover tool.

    To instrument code for native coverage it must be compiled with the line_coverage option.

    To enable native coverage in the runtime system, start it like so:

    $ erl +JPcover true

    There are also the following new functions for supporting native coverage:

    Own Id: OTP-18856 Aux Id: PR-7856

  • The documentation has been migrated to use Markdown and ExDoc.

    Own Id: OTP-18955 Aux Id: PR-8026

  • Improved the align command in emacs mode.

    Own Id: OTP-19080 Aux Id: PR-8288

  • @@ -1520,7 +1520,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/search.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/search.html 2026-06-04 19:05:21.958614265 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/search.html 2026-06-04 19:05:21.958631349 +0000 @@ -122,7 +122,7 @@
    - + /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tags.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (345)) --- old//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tags.html 2026-06-04 19:05:21.977631525 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tags.html 2026-06-04 19:05:21.977631525 +0000 @@ -804,7 +804,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/content.opf differs (XML 1.0 document, ASCII text) --- old//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/content.opf 2026-06-04 00:07:26.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/content.opf 2042-07-06 13:26:54.000000000 +0000 @@ -4,10 +4,10 @@ version="3.0"> tools - 4.1 - urn:uuid:02183f37-aaf1-550e-1b48-0284665ea6fe + urn:uuid:aea6d64d-cd93-f302-86a2-fbf03e8e4691 en - 2026-06-04T00:07:26Z + 2042-07-06T13:26:54Z /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/cover_chapter.xhtml differs (HTML document, ASCII text, with very long lines (842)) --- old//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/cover_chapter.xhtml 2026-06-04 00:07:26.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/cover_chapter.xhtml 2042-07-06 13:26:54.000000000 +0000 @@ -41,81 +41,81 @@ Example

    -

    Assume that a test case for the following program should be verified:

    -module(channel).
    --behaviour(gen_server).
    +

    Assume that a test case for the following program should be verified:

    -module(channel).
    +-behaviour(gen_server).
     
    --export([start_link/0,stop/0]).
    --export([alloc/0,free/1]). % client interface
    --export([init/1,handle_call/3,terminate/2]). % callback functions
    +-export([start_link/0,stop/0]).
    +-export([alloc/0,free/1]). % client interface
    +-export([init/1,handle_call/3,terminate/2]). % callback functions
     
    -start_link() ->
    -    gen_server:start_link({local,channel}, channel, [], []).
    +start_link() ->
    +    gen_server:start_link({local,channel}, channel, [], []).
     
    -stop() ->
    -    gen_server:call(channel, stop).
    +stop() ->
    +    gen_server:call(channel, stop).
     
     %%%-Client interface functions-------------------------------------------
     
    -alloc() ->
    -    gen_server:call(channel, alloc).
    +alloc() ->
    +    gen_server:call(channel, alloc).
     
    -free(Channel) ->
    -    gen_server:call(channel, {free,Channel}).
    +free(Channel) ->
    +    gen_server:call(channel, {free,Channel}).
     
     %%%-gen_server callback functions----------------------------------------
     
    -init(_Arg) ->
    -    {ok,channels()}.
    +init(_Arg) ->
    +    {ok,channels()}.
     
    -handle_call(stop, _Client, Channels) ->
    -    {stop,normal,ok,Channels};
    +handle_call(stop, _Client, Channels) ->
    +    {stop,normal,ok,Channels};
     
    -handle_call(alloc, _Client, Channels) ->
    -    {Ch,Channels2} = alloc(Channels),
    -    {reply,{ok,Ch},Channels2};
    +handle_call(alloc, _Client, Channels) ->
    +    {Ch,Channels2} = alloc(Channels),
    +    {reply,{ok,Ch},Channels2};
     
    -handle_call({free,Channel}, _Client, Channels) ->
    -    Channels2 = free(Channel, Channels),
    -    {reply,ok,Channels2}.
    +handle_call({free,Channel}, _Client, Channels) ->
    +    Channels2 = free(Channel, Channels),
    +    {reply,ok,Channels2}.
     
    -terminate(_Reason, _Channels) ->
    +terminate(_Reason, _Channels) ->
         ok.
     
     %%%-Internal functions---------------------------------------------------
     
    -channels() ->
    -    [ch1,ch2,ch3].
    +channels() ->
    +    [ch1,ch2,ch3].
     
    -alloc([Channel|Channels]) ->
    -    {Channel,Channels};
    -alloc([]) ->
    +alloc([Channel|Channels]) ->
    +    {Channel,Channels};
    +alloc([]) ->
         false.
     
    -free(Channel, Channels) ->
    -    [Channel|Channels].

    The test case is implemented as follows:

    -module(test).
    --export([s/0]).
    -
    -s() ->
    -    {ok,Pid} = channel:start_link(),
    -    {ok,Ch1} = channel:alloc(),
    -    ok = channel:free(Ch1),
    -    ok = channel:stop().

    +free(Channel, Channels) -> + [Channel|Channels].

    The test case is implemented as follows:

    -module(test).
    +-export([s/0]).
    +
    +s() ->
    +    {ok,Pid} = channel:start_link(),
    +    {ok,Ch1} = channel:alloc(),
    +    ok = channel:free(Ch1),
    +    ok = channel:stop().

    Preparation

    First of all, Cover must be started. This spawns a process which owns the Cover -database where all coverage data will be stored.

    1> cover:start().
    -{ok,<0.90.0>}

    To include other nodes in the coverage analysis, use +database where all coverage data will be stored.

    1> cover:start().
    +{ok,<0.90.0>}

    To include other nodes in the coverage analysis, use cover:start/1. All cover-compiled modules will then be loaded on all nodes, and data from all nodes will be summed up when analysing. For simplicity this example only involves the current node.

    Before any analysis can take place, the involved modules must be cover-compiled. This means that some extra information is added to the module before beging compiled into a binary and loaded. The source file of the module is -not affected and no .beam file is created.

    2> cover:compile_module(channel).
    -{ok,channel}

    Each time a function in the cover-compiled module channel is called, +not affected and no .beam file is created.

    2> cover:compile_module(channel).
    +{ok,channel}

    Each time a function in the cover-compiled module channel is called, information about the call will be added to the Cover database. Run the test case:

    3> test:s().
     ok

    Cover analysis is performed by examining the contents of the Cover database. The @@ -133,56 +133,56 @@ {Cov,NotCov}, where Cov is the number of executable lines that have been executed at least once and NotCov is the number of executable lines that have not been executed.

    If the analysis is made on module level, the result is given for the entire -module as a tuple {Module,{Cov,NotCov}}:

    4> cover:analyse(channel, coverage, module).
    -{ok,{channel,{14,1}}}

    For channel, the result shows that 14 lines in the module are covered but one +module as a tuple {Module,{Cov,NotCov}}:

    4> cover:analyse(channel, coverage, module).
    +{ok,{channel,{14,1}}}

    For channel, the result shows that 14 lines in the module are covered but one line is not covered.

    If the analysis is made on function level, the result is given as a list of tuples {Function,{Cov,NotCov}}, one for each function in the module. A -function is specified by its module name, function name and arity:

    5> cover:analyse(channel, coverage, function).
    -{ok,[{{channel,start_link,0},{1,0}},
    -     {{channel,stop,0},{1,0}},
    -     {{channel,alloc,0},{1,0}},
    -     {{channel,free,1},{1,0}},
    -     {{channel,init,1},{1,0}},
    -     {{channel,handle_call,3},{5,0}},
    -     {{channel,terminate,2},{1,0}},
    -     {{channel,channels,0},{1,0}},
    -     {{channel,alloc,1},{1,1}},
    -     {{channel,free,2},{1,0}}]}

    For channel, the result shows that the uncovered line is in the function +function is specified by its module name, function name and arity:

    5> cover:analyse(channel, coverage, function).
    +{ok,[{{channel,start_link,0},{1,0}},
    +     {{channel,stop,0},{1,0}},
    +     {{channel,alloc,0},{1,0}},
    +     {{channel,free,1},{1,0}},
    +     {{channel,init,1},{1,0}},
    +     {{channel,handle_call,3},{5,0}},
    +     {{channel,terminate,2},{1,0}},
    +     {{channel,channels,0},{1,0}},
    +     {{channel,alloc,1},{1,1}},
    +     {{channel,free,2},{1,0}}]}

    For channel, the result shows that the uncovered line is in the function channel:alloc/1.

    If the analysis is made on clause level, the result is given as a list of tuples {Clause,{Cov,NotCov}}, one for each function clause in the module. A clause is specified by its module name, function name, arity and position within the -function definition:

    6> cover:analyse(channel, coverage, clause).
    -{ok,[{{channel,start_link,0,1},{1,0}},
    -     {{channel,stop,0,1},{1,0}},
    -     {{channel,alloc,0,1},{1,0}},
    -     {{channel,free,1,1},{1,0}},
    -     {{channel,init,1,1},{1,0}},
    -     {{channel,handle_call,3,1},{1,0}},
    -     {{channel,handle_call,3,2},{2,0}},
    -     {{channel,handle_call,3,3},{2,0}},
    -     {{channel,terminate,2,1},{1,0}},
    -     {{channel,channels,0,1},{1,0}},
    -     {{channel,alloc,1,1},{1,0}},
    -     {{channel,alloc,1,2},{0,1}},
    -     {{channel,free,2,1},{1,0}}]}

    For channel, the result shows that the uncovered line is in the second clause +function definition:

    6> cover:analyse(channel, coverage, clause).
    +{ok,[{{channel,start_link,0,1},{1,0}},
    +     {{channel,stop,0,1},{1,0}},
    +     {{channel,alloc,0,1},{1,0}},
    +     {{channel,free,1,1},{1,0}},
    +     {{channel,init,1,1},{1,0}},
    +     {{channel,handle_call,3,1},{1,0}},
    +     {{channel,handle_call,3,2},{2,0}},
    +     {{channel,handle_call,3,3},{2,0}},
    +     {{channel,terminate,2,1},{1,0}},
    +     {{channel,channels,0,1},{1,0}},
    +     {{channel,alloc,1,1},{1,0}},
    +     {{channel,alloc,1,2},{0,1}},
    +     {{channel,free,2,1},{1,0}}]}

    For channel, the result shows that the uncovered line is in the second clause of channel:alloc/1.

    Finally, if the analysis is made on line level, the result is given as a list of tuples {Line,{Cov,NotCov}}, one for each executable line in the source code. A -line is specified by its module name and line number.

    7> cover:analyse(channel, coverage, line).
    -{ok,[{{channel,9},{1,0}},
    -     {{channel,12},{1,0}},
    -     {{channel,17},{1,0}},
    -     {{channel,20},{1,0}},
    -     {{channel,25},{1,0}},
    -     {{channel,28},{1,0}},
    -     {{channel,31},{1,0}},
    -     {{channel,32},{1,0}},
    /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/cover.xhtml differs (HTML document, ASCII text, with very long lines (677))
    --- old//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/cover.xhtml	2026-06-04 00:07:26.000000000 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/cover.xhtml	2042-07-06 13:26:54.000000000 +0000
    @@ -1440,7 +1440,7 @@
     call is equivalent to analyse('_', coverage, Arg).

    Otherwise Arg is assumed to be a module name, and this call is equivalent to analyse(Arg, coverage, function).

    Note

    To analyze a module whose name overlaps with one the values in analysis() or level(), the module -name has to be in a list. For example, to analyze a module named calls:

    cover:analyse([calls]).
    +name has to be in a list. For example, to analyze a module named calls:

    cover:analyse([calls]).
    @@ -1482,7 +1482,7 @@ analyse(Arg1, Arg2, function).

    If Arg2 is one of the values in level(), Arg1 is assumed to be a module and this call is equivalent to analyse(Arg1, coverage, Arg2).

    Note

    To analyze a module whose name overlaps with one of the values in analysis(), the module name needs to be in a -list. For example, to analyze a module named calls:

    cover:analyse([calls], function).
    +list. For example, to analyze a module named calls:

    cover:analyse([calls], function).
    @@ -1591,7 +1591,7 @@ options, this call is equivalent to analyse_to_file('_', Arg).

    Otherwise Arg is assumed to be a module, and this call is equivalent to analyse_to_file(Arg, []).

    Note

    To analyze a module of the name html (which overlaps with an option in analyse_option()), it is necessary to -use cover:analyse_to_file/2:

    cover:analyse_to_file([html], []).
    +use cover:analyse_to_file/2:

    cover:analyse_to_file([html], []).
    /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/cprof_chapter.xhtml differs (HTML document, ASCII text, with very long lines (1636)) --- old//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/cprof_chapter.xhtml 2026-06-04 00:07:26.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/cprof_chapter.xhtml 2042-07-06 13:26:54.000000000 +0000 @@ -51,36 +51,36 @@ Example: Background work -

    From the Erlang shell:

    1> cprof:start(), cprof:pause(). % Stop counters just after start
    +

    From the Erlang shell:

    1> cprof:start(), cprof:pause(). % Stop counters just after start
     8492
    -2> cprof:analyse().
    -{539,
    - [{shell,155,
    -         [{{shell,prep_check,1},55},
    -          {{shell,used_records,4},45},
    -          {{shell,used_records,1},45},
    -          {{shell,used_record_defs,2},1},
    -          {{shell,record_defs,2},1},
    -          {{shell,record_bindings,2},1},
    -          {{shell,exprs,7},1},
    -          {{shell,expr,4},1},
    -          {{shell,expand_records,2},1},
    -          {{shell,check_command,2},1},
    -          {{shell,apply_fun,3},1},
    -          {{shell,'-exprs/7-lc$^0/1-0-',1},1},
    -          {{shell,'-eval_loop/3-fun-0-',3},1}]},
    +2> cprof:analyse().
    +{539,
    + [{shell,155,
    +         [{{shell,prep_check,1},55},
    +          {{shell,used_records,4},45},
    +          {{shell,used_records,1},45},
    +          {{shell,used_record_defs,2},1},
    +          {{shell,record_defs,2},1},
    +          {{shell,record_bindings,2},1},
    +          {{shell,exprs,7},1},
    +          {{shell,expr,4},1},
    +          {{shell,expand_records,2},1},
    +          {{shell,check_command,2},1},
    +          {{shell,apply_fun,3},1},
    +          {{shell,'-exprs/7-lc$^0/1-0-',1},1},
    +          {{shell,'-eval_loop/3-fun-0-',3},1}]},
       %% Information about many modules omitted.
                          .
                          .
                          .
       %% Here is the last part.
    -  {erts_internal,2,[{{erts_internal,trace_pattern,3},2}]},
    -  {otp_internal,1,[{{otp_internal,obsolete,3},1}]},
    -  {maps,1,[{{maps,from_list,1},1}]},
    -  {erl_internal,1,[{{erl_internal,bif,3},1}]}]}
    -3> cprof:analyse(cprof).
    -{cprof,3,[{{cprof,tr,2},2},{{cprof,pause,0},1}]}
    -4> cprof:stop().
    +  {erts_internal,2,[{{erts_internal,trace_pattern,3},2}]},
    +  {otp_internal,1,[{{otp_internal,obsolete,3},1}]},
    +  {maps,1,[{{maps,from_list,1},1}]},
    +  {erl_internal,1,[{{erl_internal,bif,3},1}]}]}
    +3> cprof:analyse(cprof).
    +{cprof,3,[{{cprof,tr,2},2},{{cprof,pause,0},1}]}
    +4> cprof:stop().
     8586

    The example showed some of the background work that the shell performs just to interpret the first command line.

    What is captured in this example is the part of the work the shell does while interpreting the command line that occurs between the actual calls to @@ -90,20 +90,20 @@ Example: One module -

    From the Erlang shell:

    1> cprof:start(),R=calendar:day_of_the_week(1896,4,27),cprof:pause(),R.
    +

    From the Erlang shell:

    1> cprof:start(),R=calendar:day_of_the_week(1896,4,27),cprof:pause(),R.
     1
    -2> cprof:analyse(calendar).
    -{calendar,9,
    -          [{{calendar,last_day_of_the_month1,2},1},
    -           {{calendar,last_day_of_the_month,2},1},
    -           {{calendar,is_leap_year1,1},1},
    -           {{calendar,is_leap_year,1},1},
    -           {{calendar,dy,1},1},
    -           {{calendar,dm,1},1},
    -           {{calendar,df,2},1},
    -           {{calendar,day_of_the_week,3},1},
    -           {{calendar,date_to_gregorian_days,3},1}]}
    -3> cprof:stop().
    +2> cprof:analyse(calendar).
    +{calendar,9,
    +          [{{calendar,last_day_of_the_month1,2},1},
    +           {{calendar,last_day_of_the_month,2},1},
    +           {{calendar,is_leap_year1,1},1},
    +           {{calendar,is_leap_year,1},1},
    +           {{calendar,dy,1},1},
    +           {{calendar,dm,1},1},
    +           {{calendar,df,2},1},
    +           {{calendar,day_of_the_week,3},1},
    +           {{calendar,date_to_gregorian_days,3},1}]}
    +3> cprof:stop().
     8648

    The example tells us that "Aktiebolaget LM Ericsson & Co" was registered on a Monday (since the return value of the first command is 1), and that the calendar module needed 9 function calls to calculate that.

    Using cprof:analyse() in this example also shows approximately the same @@ -113,60 +113,60 @@ Example: In the code -

    Write a module:

    -module(sort).
    --export([do/1]).
    +

    Write a module:

    -module(sort).
    +-export([do/1]).
     
    -do(N) ->
    -    cprof:stop(),
    -    cprof:start(),
    -    do(N, []).
    +do(N) ->
    +    cprof:stop(),
    +    cprof:start(),
    +    do(N, []).
     
    -do(0, L) ->
    -    R = lists:sort(L),
    -    cprof:pause(),
    +do(0, L) ->
    +    R = lists:sort(L),
    +    cprof:pause(),
         R;
    -do(N, L) ->
    -    do(N-1, [rand:uniform(256)-1 | L]).

    From the Erlang shell:

    1> c(sort).
    -{ok,sort}
    -2> rand:seed(default, 42), ok.
    +do(N, L) ->
    +    do(N-1, [rand:uniform(256)-1 | L]).

    From the Erlang shell:

    1> c(sort).
    +{ok,sort}
    +2> rand:seed(default, 42), ok.
     ok.
    -3> sort:do(1000).
    -[0,0,0,1,1,1,1,2,2,3,3,4,4,4,4,5,5,5,6,6,6,6,7,7,7,7,7,8,8|...]
    -4> cprof:analyse().
    -{13180,
    - [{lists,6173,
    -         [{{lists,rmerge3_1,6},1045},
    -          {{lists,rmerge3_2,6},977},
    -          {{lists,split_1,5},652},
    -          {{lists,merge3_1,6},579},
    -          {{lists,merge3_2,6},577},
    -          {{lists,rmerge3_12_3,6},511},
    -          {{lists,split_1_1,6},347},
    -          {{lists,merge3_12_3,6},310},
    -          {{lists,rmerge3_21_3,6},282},
    -          {{lists,merge3_21_3,6},221},
    -          {{lists,merge2_1,4},154},
    -          {{lists,merge2_2,5},138},
    -          {{lists,reverse,2},106},
    -          {{lists,rmerge2_2,5},87},
    -          {{lists,rmergel,2},81},
    -          {{lists,rmerge2_1,4},75},
    -          {{lists,mergel,2},28},
    -          {{lists,keyfind,3},2},
    -          {{lists,sort,1},1}]},
    -  {rand,5000,
    -        [{{rand,uniform_s,2},1000},
    -         {{rand,uniform,1},1000},
    -         {{rand,seed_put,1},1000},
    -         {{rand,seed_get,0},1000},
    -         {{rand,exsss_uniform,2},1000}]},
    -  {erlang,1004,
    -          [{{erlang,put,2},1000},
    -           {{erlang,trace_pattern,3},2},
    -           {{erlang,ensure_tracer_module_loaded,2},2}]},
    -  {sort,1001,[{{sort,do,2},1001}]},
    -  {erts_internal,2,[{{erts_internal,trace_pattern,3},2}]}]}
    -5> cprof:stop().
    +3> sort:do(1000).
    +[0,0,0,1,1,1,1,2,2,3,3,4,4,4,4,5,5,5,6,6,6,6,7,7,7,7,7,8,8|...]
    +4> cprof:analyse().
    +{13180,
    + [{lists,6173,
    +         [{{lists,rmerge3_1,6},1045},
    +          {{lists,rmerge3_2,6},977},
    +          {{lists,split_1,5},652},
    +          {{lists,merge3_1,6},579},
    +          {{lists,merge3_2,6},577},
    +          {{lists,rmerge3_12_3,6},511},
    +          {{lists,split_1_1,6},347},
    +          {{lists,merge3_12_3,6},310},
    +          {{lists,rmerge3_21_3,6},282},
    +          {{lists,merge3_21_3,6},221},
    +          {{lists,merge2_1,4},154},
    +          {{lists,merge2_2,5},138},
    +          {{lists,reverse,2},106},
    +          {{lists,rmerge2_2,5},87},
    +          {{lists,rmergel,2},81},
    +          {{lists,rmerge2_1,4},75},
    +          {{lists,mergel,2},28},
    +          {{lists,keyfind,3},2},
    +          {{lists,sort,1},1}]},
    +  {rand,5000,
    +        [{{rand,uniform_s,2},1000},
    +         {{rand,uniform,1},1000},
    +         {{rand,seed_put,1},1000},
    +         {{rand,seed_get,0},1000},
    +         {{rand,exsss_uniform,2},1000}]},
    +  {erlang,1004,
    +          [{{erlang,put,2},1000},
    /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/cprof.xhtml differs (HTML document, ASCII text, with very long lines (1243))
    --- old//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/cprof.xhtml	2026-06-04 00:07:26.000000000 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/cprof.xhtml	2042-07-06 13:26:54.000000000 +0000
    @@ -469,7 +469,7 @@
     
           
     
    -

    Collects and analyses all call counters for module Module.

    This function returns:

    {Module, ModuleCount, FuncAnalysisList}

    where FuncAnalysisList is a list of tuples, one for each function:

    {{Module, FunctionName, Arity}, FuncCallCount}

    If call counters are still running while analyse/0,1,2 is executing, the result +

    Collects and analyses all call counters for module Module.

    This function returns:

    {Module, ModuleCount, FuncAnalysisList}

    where FuncAnalysisList is a list of tuples, one for each function:

    {{Module, FunctionName, Arity}, FuncCallCount}

    If call counters are still running while analyse/0,1,2 is executing, the result could be inconsistent. This happens if the process executing analyse/0,1,2 is scheduled out so some other process can increment the counters that are being analysed. Calling pause() before analysing takes care of /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/erlang-el.xhtml differs (HTML document, ASCII text, with very long lines (898)) --- old//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/erlang-el.xhtml 2026-06-04 00:07:26.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/erlang-el.xhtml 2042-07-06 13:26:54.000000000 +0000 @@ -106,23 +106,23 @@

    • C-c C-a (align-current) - aligns comments, arrows, assignments, and type annotations around the cursor.
    Example:
     
    -sum(L) -> sum(L, 0).
    -sum([H|T], Sum) -> sum(T, Sum + H);  % recurse
    -sum([], Sum) -> Sum.   % base case
    +sum(L) -> sum(L, 0).
    +sum([H|T], Sum) -> sum(T, Sum + H);  % recurse
    +sum([], Sum) -> Sum.   % base case
     
    --record { two :: int(), % hello
    -          three = hello :: string(),    % there
    -          four = 42 :: int() }.
    +-record { two :: int(), % hello
    +          three = hello :: string(),    % there
    +          four = 42 :: int() }.
     
     becomes:
     
    -sum(L) -> sum(L, 0).
    -sum([H|T], Sum) -> sum(T, Sum + H); % recurse
    -sum([], Sum)    -> Sum.             % base case
    +sum(L) -> sum(L, 0).
    +sum([H|T], Sum) -> sum(T, Sum + H); % recurse
    +sum([], Sum)    -> Sum.             % base case
     
    --record { two           :: int(),    % hello
    -          three = hello :: string(), % there
    -          four  = 42    :: int() }.

    +-record { two :: int(), % hello + three = hello :: string(), % there + four = 42 :: int() }.

    /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/fprof_chapter.xhtml differs (HTML document, ASCII text, with very long lines (669)) --- old//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/fprof_chapter.xhtml 2026-06-04 00:07:26.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/fprof_chapter.xhtml 2042-07-06 13:26:54.000000000 +0000 @@ -71,10 +71,10 @@

    It is also possible to trace immediately into the profiling process that creates the raw profile data, that is to short circuit the tracing and profiling steps -so that the filesystem is not used for tracing.

    Do something like this:

    {ok, Tracer} = fprof:profile(start),
    -fprof:trace([start, {tracer, Tracer}]),
    +so that the filesystem is not used for tracing.

    Do something like this:

    {ok, Tracer} = fprof:profile(start),
    +fprof:trace([start, {tracer, Tracer}]),
     %% Run code to profile
    -fprof:trace(stop);

    This puts less load on the filesystem, but much more load on the Erlang runtime +fprof:trace(stop);

    This puts less load on the filesystem, but much more load on the Erlang runtime system.

    /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/fprof.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (1176)) --- old//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/fprof.xhtml 2026-06-04 00:07:26.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/fprof.xhtml 2042-07-06 13:26:54.000000000 +0000 @@ -70,61 +70,61 @@ interested reader to try it out. Note that some flags to analyse/1 will affect the format.

    The following example was run on Erlang/OTP R8 on Solaris 8; all OTP internals in this example are version dependent.

    As an example, we will use the following function, which is a -slightly modified benchmark function from module file:

    -module(foo).
    --export([create_file_slow/2]).
    +slightly modified benchmark function from module file:

    -module(foo).
    +-export([create_file_slow/2]).
     
    -create_file_slow(Name, N) when is_integer(N), N >= 0 ->
    -    {ok, FD} =
    -        file:open(Name, [raw, write, delayed_write, binary]),
    +create_file_slow(Name, N) when is_integer(N), N >= 0 ->
    +    {ok, FD} =
    +        file:open(Name, [raw, write, delayed_write, binary]),
         if N > 256 ->
    -            ok = file:write(FD,
    -                            lists:map(fun (X) -> <<X:32/unsigned>> end,
    -                            lists:seq(0, 255))),
    -            ok = create_file_slow(FD, 256, N);
    +            ok = file:write(FD,
    +                            lists:map(fun (X) -> <<X:32/unsigned>> end,
    +                            lists:seq(0, 255))),
    +            ok = create_file_slow(FD, 256, N);
            true ->
    -            ok = create_file_slow(FD, 0, N)
    +            ok = create_file_slow(FD, 0, N)
         end,
    -    ok = file:close(FD).
    +    ok = file:close(FD).
     
    -create_file_slow(FD, M, M) ->
    +create_file_slow(FD, M, M) ->
         ok;
    -create_file_slow(FD, M, N) ->
    -    ok = file:write(FD, <<M:32/unsigned>>),
    -    create_file_slow(FD, M+1, N).

    Let us have a look at the printout after running:

    1> fprof:apply(foo, create_file_slow, [junk, 1024]).
    -2> fprof:profile().
    -3> fprof:analyse().

    The printout starts with:

    %% Analysis results:
    -{  analysis_options,
    - [{callers, true},
    -  {sort, acc},
    -  {totals, false},
    -  {details, true}]}.
    +create_file_slow(FD, M, N) ->
    +    ok = file:write(FD, <<M:32/unsigned>>),
    +    create_file_slow(FD, M+1, N).

    Let us have a look at the printout after running:

    1> fprof:apply(foo, create_file_slow, [junk, 1024]).
    +2> fprof:profile().
    +3> fprof:analyse().

    The printout starts with:

    %% Analysis results:
    +{  analysis_options,
    + [{callers, true},
    +  {sort, acc},
    +  {totals, false},
    +  {details, true}]}.
     
     %                                       CNT       ACC       OWN
    -[{ totals,                             9627, 1691.119, 1659.074}].  %%%

    The CNT column shows the total number of function calls that was found in the +[{ totals, 9627, 1691.119, 1659.074}]. %%%

    The CNT column shows the total number of function calls that was found in the trace. In the ACC column is the total time of the trace from first timestamp to last. And in the OWN column is the sum of the execution time in functions found in the trace, not including called functions. In this case it is very close to the ACC time since the emulator had practically nothing to do except executing our test program.

    All time values in the printout are in milliseconds.

    The printout continues:

    %                                       CNT       ACC       OWN
    -[{ "<0.28.0>",                         9627,undefined, 1659.074}].   %%

    This is the printout header of one process. The printout contains only this one +[{ "<0.28.0>", 9627,undefined, 1659.074}]. %%

    This is the printout header of one process. The printout contains only this one process since we called fprof:apply/3 that traces only the current process. Therefore the CNT and OWN columns perfectly matches the totals above. The ACC column is undefined since summing the ACC times of all calls in the process makes no sense — one would get something like the ACC value from totals above multiplied by the average depth of the call stack.

    All paragraphs up to the next process header only concerns function calls within -this process.

    Now we come to something more interesting:

    {[{undefined,                             0, 1691.076,    0.030}],
    - { {fprof,apply_start_stop,4},            0, 1691.076,    0.030},     %
    - [{{foo,create_file_slow,2},              1, 1691.046,    0.103},
    -  {suspend,                               1,    0.000,    0.000}]}.
    +this process.

    Now we come to something more interesting:

    {[{undefined,                             0, 1691.076,    0.030}],
    + { {fprof,apply_start_stop,4},            0, 1691.076,    0.030},     %
    + [{{foo,create_file_slow,2},              1, 1691.046,    0.103},
    +  {suspend,                               1,    0.000,    0.000}]}.
     
    -{[{{fprof,apply_start_stop,4},            1, 1691.046,    0.103}],
    - { {foo,create_file_slow,2},              1, 1691.046,    0.103},     %
    - [{{file,close,1},                        1, 1398.873,    0.019},
    -  {{foo,create_file_slow,3},              1,  249.678,    0.029},
    -  {{file,open,2},                         1,   20.778,    0.055},
    -  {{lists,map,2},                         1,   16.590,    0.043},
    -  {{lists,seq,2},                         1,    4.708,    0.017},
    -  {{file,write,2},                        1,    0.316,    0.021}]}.

    The printout consists of one paragraph per called function. The function +{[{{fprof,apply_start_stop,4}, 1, 1691.046, 0.103}], + { {foo,create_file_slow,2}, 1, 1691.046, 0.103}, % + [{{file,close,1}, 1, 1398.873, 0.019}, + {{foo,create_file_slow,3}, 1, 249.678, 0.029}, + {{file,open,2}, 1, 20.778, 0.055}, + {{lists,map,2}, 1, 16.590, 0.043}, + {{lists,seq,2}, 1, 4.708, 0.017}, + {{file,write,2}, 1, 0.316, 0.021}]}.

    The printout consists of one paragraph per called function. The function marked with % is the one the paragraph concerns — foo:create_file_slow/2. Above the marked function are the calling functions — those that has called the marked, and below are those called by the marked function.

    The paragraphs are per default sorted in descending order of the ACC column for @@ -141,12 +141,12 @@ (lists:seq/2 and lists:map/2).

    The function undefined that has called fprof:apply_start_stop/4 is an unknown function because that call was not recorded in the trace. It was only recorded that the execution returned from fprof:apply_start_stop/4 to some -other function above in the call stack, or that the process exited from there.

    Let us continue down the printout to find:

    {[{{foo,create_file_slow,2},              1,  249.678,    0.029},
    -  {{foo,create_file_slow,3},            768,    0.000,   23.294}],
    - { {foo,create_file_slow,3},            769,  249.678,   23.323},     %
    - [{{file,write,2},                      768,  220.314,   14.539},
    -  {suspend,                              57,    6.041,    0.000},
    -  {{foo,create_file_slow,3},            768,    0.000,   23.294}]}.

    If you compare with the code you will see there also that +other function above in the call stack, or that the process exited from there.

    Let us continue down the printout to find:

    {[{{foo,create_file_slow,2},              1,  249.678,    0.029},
    +  {{foo,create_file_slow,3},            768,    0.000,   23.294}],
    + { {foo,create_file_slow,3},            769,  249.678,   23.323},     %
    + [{{file,write,2},                      768,  220.314,   14.539},
    +  {suspend,                              57,    6.041,    0.000},
    +  {{foo,create_file_slow,3},            768,    0.000,   23.294}]}.

    If you compare with the code you will see there also that foo:create_file_slow/3 was called only from foo:create_file_slow/2 and itself, and called only file:write/2, note the number of calls to file:write/2. But here we see that suspend was called a few times. This is a @@ -154,88 +154,88 @@ foo:create_file_slow/3, and since there is no receive or erlang:yield/0 in the code, it must be Erlang scheduling suspensions, or the trace file driver compensating for large file write operations (these are regarded as a schedule -out followed by a schedule in to the same process).

    Let us find the suspend entry:

    {[{{file,write,2},                       53,    6.281,    0.000},
    -  {{foo,create_file_slow,3},             57,    6.041,    0.000},
    -  {{prim_file,drv_command,4},            50,    4.582,    0.000},
    -  {{prim_file,drv_get_response,1},       34,    2.986,    0.000},
    -  {{lists,map,2},                        10,    2.104,    0.000},
    -  {{prim_file,write,2},                  17,    1.852,    0.000},
    -  {{erlang,port_command,2},              15,    1.713,    0.000},
    -  {{prim_file,drv_command,2},            22,    1.482,    0.000},
    -  {{prim_file,translate_response,2},     11,    1.441,    0.000},
    -  {{prim_file,'-drv_command/2-fun-0-',1},  15,    1.340,    0.000},
    -  {{lists,seq,4},                         3,    0.880,    0.000},
    -  {{foo,'-create_file_slow/2-fun-0-',1},   5,    0.523,    0.000},
    -  {{erlang,bump_reductions,1},            4,    0.503,    0.000},
    -  {{prim_file,open_int_setopts,3},        1,    0.165,    0.000},
    -  {{prim_file,i32,4},                     1,    0.109,    0.000},
    -  {{fprof,apply_start_stop,4},            1,    0.000,    0.000}],
    - { suspend,                             299,   32.002,    0.000},     %
    - [ ]}.

    We find no particularly long suspend times, so no function seems to have waited +out followed by a schedule in to the same process).

    Let us find the suspend entry:

    {[{{file,write,2},                       53,    6.281,    0.000},
    +  {{foo,create_file_slow,3},             57,    6.041,    0.000},
    +  {{prim_file,drv_command,4},            50,    4.582,    0.000},
    +  {{prim_file,drv_get_response,1},       34,    2.986,    0.000},
    +  {{lists,map,2},                        10,    2.104,    0.000},
    +  {{prim_file,write,2},                  17,    1.852,    0.000},
    +  {{erlang,port_command,2},              15,    1.713,    0.000},
    +  {{prim_file,drv_command,2},            22,    1.482,    0.000},
    +  {{prim_file,translate_response,2},     11,    1.441,    0.000},
    +  {{prim_file,'-drv_command/2-fun-0-',1},  15,    1.340,    0.000},
    +  {{lists,seq,4},                         3,    0.880,    0.000},
    +  {{foo,'-create_file_slow/2-fun-0-',1},   5,    0.523,    0.000},
    +  {{erlang,bump_reductions,1},            4,    0.503,    0.000},
    +  {{prim_file,open_int_setopts,3},        1,    0.165,    0.000},
    +  {{prim_file,i32,4},                     1,    0.109,    0.000},
    +  {{fprof,apply_start_stop,4},            1,    0.000,    0.000}],
    + { suspend,                             299,   32.002,    0.000},     %
    + [ ]}.

    We find no particularly long suspend times, so no function seems to have waited in a receive statement. Actually, prim_file:drv_command/4 contains a receive statement, but in this test program, the message lies in the process receive buffer when the receive statement is entered. We also see that the total suspend time for the test run is small.

    The suspend pseudo function has an OWN time of zero. This is to prevent the process total OWN time from including time in suspension. Whether suspend -time is really ACC or OWN time is more of a philosophical question.

    Now we look at another interesting pseudo function, garbage_collect:

    {[{{prim_file,drv_command,4},            25,    0.873,    0.873},
    -  {{prim_file,write,2},                  16,    0.692,    0.692},
    -  {{lists,map,2},                         2,    0.195,    0.195}],
    - { garbage_collect,                      43,    1.760,    1.760},     %
    - [ ]}.

    Here we see that no function stands out, which is very normal.

    The garbage_collect pseudo function has not an OWN time of zero like +time is really ACC or OWN time is more of a philosophical question.

    Now we look at another interesting pseudo function, garbage_collect:

    {[{{prim_file,drv_command,4},            25,    0.873,    0.873},
    +  {{prim_file,write,2},                  16,    0.692,    0.692},
    +  {{lists,map,2},                         2,    0.195,    0.195}],
    + { garbage_collect,                      43,    1.760,    1.760},     %
    + [ ]}.

    Here we see that no function stands out, which is very normal.

    The garbage_collect pseudo function has not an OWN time of zero like suspend, instead it is equal to the ACC time.

    Garbage collection often occurs while a process is suspended, but fprof hides this fact by pretending that the suspended function was first unsuspended and then garbage collected. Otherwise the printout would show garbage_collect being called from suspend, but not which function that might have caused the -garbage collection.

    Let us now get back to the test code:

    {[{{foo,create_file_slow,3},            768,  220.314,   14.539},
    -  {{foo,create_file_slow,2},              1,    0.316,    0.021}],
    - { {file,write,2},                      769,  220.630,   14.560},     %
    - [{{prim_file,write,2},                 769,  199.789,   22.573},
    -  {suspend,                              53,    6.281,    0.000}]}.

    Not unexpectedly, we see that file:write/2 was called from +garbage collection.

    Let us now get back to the test code:

    {[{{foo,create_file_slow,3},            768,  220.314,   14.539},
    +  {{foo,create_file_slow,2},              1,    0.316,    0.021}],
    + { {file,write,2},                      769,  220.630,   14.560},     %
    + [{{prim_file,write,2},                 769,  199.789,   22.573},
    +  {suspend,                              53,    6.281,    0.000}]}.

    Not unexpectedly, we see that file:write/2 was called from foo:create_file_slow/3 and foo:create_file_slow/2. The number of calls in each case as well as the used time are also confirms the previous results.

    We see that file:write/2 only calls prim_file:write/2, but let us refrain from digging into the internals of the kernel application.

    If we nevertheless do dig down we find the call to the linked-in driver -that does the file operations towards the host operating system:

    {[{{prim_file,drv_command,4},           772, 1458.356, 1456.643}],
    - { {erlang,port_command,2},             772, 1458.356, 1456.643},     %
    - [{suspend,                              15,    1.713,    0.000}]}.

    This is 86 % of the total run time, and as we saw before it is the close +that does the file operations towards the host operating system:

    {[{{prim_file,drv_command,4},           772, 1458.356, 1456.643}],
    + { {erlang,port_command,2},             772, 1458.356, 1456.643},     %
    + [{suspend,                              15,    1.713,    0.000}]}.

    This is 86 % of the total run time, and as we saw before it is the close operation the absolutely biggest contributor. We find a comparison ratio a -little bit up in the call stack:

    {[{{prim_file,close,1},                   1, 1398.748,    0.024},
    -  {{prim_file,write,2},                 769,  174.672,   12.810},
    /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/lcnt_chapter.xhtml differs (HTML document, ASCII text, with very long lines (1832))
    --- old//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/lcnt_chapter.xhtml	2026-06-04 00:07:26.000000000 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/lcnt_chapter.xhtml	2042-07-06 13:26:54.000000000 +0000
    @@ -128,20 +128,20 @@
       
       Example with Mnesia Transaction Benchmark
     
    -

    From the Erlang shell:

    Erlang/OTP 27 [erts-15.0] [64-bit] [smp:8:8] [ds:8:8:10] [async-threads:1] [jit] [lock-counting]
    +

    From the Erlang shell:

    Erlang/OTP 27 [erts-15.0] [64-bit] [smp:8:8] [ds:8:8:10] [async-threads:1] [jit] [lock-counting]
     
    -Eshell V15.0 (press Ctrl+G to abort, type help(). for help)
    -1> Conf = [{db_nodes, [node()]}, {driver_nodes, [node()]}, {replica_nodes, [node()]},
    -    {n_drivers_per_node, 10}, {n_branches, 1000}, {n_accounts_per_branch, 10},
    -    {replica_type, ram_copies}, {stop_after, 60000}, {reuse_history_id, true}], ok.
    +Eshell V15.0 (press Ctrl+G to abort, type help(). for help)
    +1> Conf = [{db_nodes, [node()]}, {driver_nodes, [node()]}, {replica_nodes, [node()]},
    +    {n_drivers_per_node, 10}, {n_branches, 1000}, {n_accounts_per_branch, 10},
    +    {replica_type, ram_copies}, {stop_after, 60000}, {reuse_history_id, true}], ok.
     ok
    -2> mnesia_tpcb:init([{use_running_mnesia, false}|Conf]).
    +2> mnesia_tpcb:init([{use_running_mnesia, false}|Conf]).
         .
         .
         .
     ignore

    Initial configuring of the benchmark is done. It is time to profile the actual -Mnesia benchmark:

    3> lcnt:apply(fun() -> {ok,{time, Tps,_,_,_,_}} = mnesia_tpcb:run([{use_running_mnesia,
    -    true}|Conf]), Tps/60 end).
    +Mnesia benchmark:

    3> lcnt:apply(fun() -> {ok,{time, Tps,_,_,_,_}} = mnesia_tpcb:run([{use_running_mnesia,
    +    true}|Conf]), Tps/60 end).
           .
           .
           .
    @@ -245,63 +245,63 @@
       
       The Big Bang Benchmark
     
    -
    -module(big).
    --export([bang/1]).
    +
    -module(big).
    +-export([bang/1]).
     
    -pinger([], [], true) ->
    +pinger([], [], true) ->
         receive
    -	{procs, Procs, ReportTo} ->
    -	    pinger(Procs, [], ReportTo)
    +	{procs, Procs, ReportTo} ->
    +	    pinger(Procs, [], ReportTo)
         end;
    -pinger([], [], false) ->
    -    receive {ping, From} -> From ! {pong, self()} end,
    -    pinger([],[],false);
    -pinger([], [], ReportTo) ->
    -    ReportTo ! {done, self()},
    -    pinger([],[],false);
    -pinger([], [Po|Pos] = Pongers, ReportTo) ->
    +pinger([], [], false) ->
    +    receive {ping, From} -> From ! {pong, self()} end,
    +    pinger([],[],false);
    +pinger([], [], ReportTo) ->
    +    ReportTo ! {done, self()},
    +    pinger([],[],false);
    +pinger([], [Po|Pos] = Pongers, ReportTo) ->
         receive
    -	{ping, From} ->
    -	    From ! {pong, self()},
    -	    pinger([], Pongers, ReportTo);
    -	{pong, Po} ->
    -	    pinger([], Pos, ReportTo)
    +	{ping, From} ->
    +	    From ! {pong, self()},
    +	    pinger([], Pongers, ReportTo);
    +	{pong, Po} ->
    +	    pinger([], Pos, ReportTo)
         end;
    -pinger([Pi|Pis], Pongers, ReportTo) ->
    -    receive {ping, From} -> From ! {pong, self()}
    +pinger([Pi|Pis], Pongers, ReportTo) ->
    +    receive {ping, From} -> From ! {pong, self()}
         after 0 -> ok
         end,
    -    Pi ! {ping, self()},
    -    pinger(Pis, [Pi|Pongers], ReportTo).
    +    Pi ! {ping, self()},
    +    pinger(Pis, [Pi|Pongers], ReportTo).
     
    -spawn_procs(N) when N =< 0 ->
    -    [];
    -spawn_procs(N) ->
    -    [spawn_link(fun () -> pinger([],[],true) end) | spawn_procs(N-1)].
    +spawn_procs(N) when N =< 0 ->
    +    [];
    +spawn_procs(N) ->
    +    [spawn_link(fun () -> pinger([],[],true) end) | spawn_procs(N-1)].
     
    -send_procs([], Msg) ->
    +send_procs([], Msg) ->
         Msg;
    -send_procs([P|Ps], Msg) ->
    +send_procs([P|Ps], Msg) ->
         P ! Msg,
    -    send_procs(Ps, Msg).
    +    send_procs(Ps, Msg).
     
    -receive_msgs([]) ->
    +receive_msgs([]) ->
         ok;
    -receive_msgs([M|Ms]) ->
    +receive_msgs([M|Ms]) ->
         receive
     	M ->
    -	    receive_msgs(Ms)
    +	    receive_msgs(Ms)
         end.
     
    -bang(N) when integer(N) ->
    -    Procs = spawn_procs(N),
    -    RMsgs = lists:map(fun (P) -> {done, P} end, Procs),
    -    Start = now(),
    -    send_procs(Procs, {procs, Procs, self()}),
    -    receive_msgs(RMsgs),
    -    Stop = now(),
    -    lists:foreach(fun (P) -> exit(P, normal) end, Procs),
    -    timer:now_diff(Stop, Start).

    +bang(N) when integer(N) -> + Procs = spawn_procs(N), + RMsgs = lists:map(fun (P) -> {done, P} end, Procs), + Start = now(), + send_procs(Procs, {procs, Procs, self()}), + receive_msgs(RMsgs), + Stop = now(), + lists:foreach(fun (P) -> exit(P, normal) end, Procs), + timer:now_diff(Stop, Start).

    /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/make.xhtml differs (HTML document, ASCII text, with very long lines (793)) --- old//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/make.xhtml 2026-06-04 00:07:26.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/make.xhtml 2042-07-06 13:26:54.000000000 +0000 @@ -37,8 +37,8 @@ the first match is used. For example, the following Emakefile means that file1 should be compiled with the options [debug_info,{i,"../foo"}], while all other files in the current directory should be compiled with only the -debug_info flag.

    {'file1',[debug_info,{i,"../foo"}]}.
    -{'*',[debug_info]}.

    +debug_info flag.

    {'file1',[debug_info,{i,"../foo"}]}.
    +{'*',[debug_info]}.

    /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/notes.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (2225)) --- old//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/notes.xhtml 2026-06-04 00:07:26.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/notes.xhtml 2042-07-06 13:26:54.000000000 +0000 @@ -50,25 +50,25 @@ Fixed Bugs and Malfunctions

    -
    • Dialyzer warnings due to type specs added in dbg have been eliminated.

      Own Id: OTP-18860

    • In Erlang/OTP 26, doing a cover analysis on the line level would return multiple entries for lines on which multiple functions were defined.

      For example, consider this module:

      -module(foo).
      --export([bar/0, baz/0]).
      +
      • Dialyzer warnings due to type specs added in dbg have been eliminated.

        Own Id: OTP-18860

      • In Erlang/OTP 26, doing a cover analysis on the line level would return multiple entries for lines on which multiple functions were defined.

        For example, consider this module:

        -module(foo).
        +-export([bar/0, baz/0]).
         
        -bar() -> ok. baz() -> not_ok.

        In Erlang/OTP 26, analysing on the line level would return two entries -for line 4:

        1> cover:compile_module(foo).
        -{ok,foo}
        -2> foo:bar().
        +bar() -> ok. baz() -> not_ok.

        In Erlang/OTP 26, analysing on the line level would return two entries +for line 4:

        1> cover:compile_module(foo).
        +{ok,foo}
        +2> foo:bar().
         ok
        -3> cover:analyse(foo, coverage, line).
        -{ok,[{{foo,4},{1,0}},{{foo,4},{0,1}}]}
        -4> cover:analyse(foo, calls, line).
        -{ok,[{{foo,4},1},{{foo,4},0}]}

        In Erlang/OTP 27, there will only be a single entry for line 4:

        1> cover:compile_module(foo).
        -{ok,foo}
        -2> foo:bar().
        +3> cover:analyse(foo, coverage, line).
        +{ok,[{{foo,4},{1,0}},{{foo,4},{0,1}}]}
        +4> cover:analyse(foo, calls, line).
        +{ok,[{{foo,4},1},{{foo,4},0}]}

        In Erlang/OTP 27, there will only be a single entry for line 4:

        1> cover:compile_module(foo).
        +{ok,foo}
        +2> foo:bar().
         ok
        -3> cover:analyse(foo, coverage, line).
        -{ok,[{{foo,4},{1,0}}]}
        -4> cover:analyse(foo, calls, line).
        -{ok,[{{foo,4},1}]}

        Own Id: OTP-18998 Aux Id: GH-8159, PR-8182

      • Fixed align command in emacs mode.

        Own Id: OTP-19026 Aux Id: PR-8155

      +3> cover:analyse(foo, coverage, line). +{ok,[{{foo,4},{1,0}}]} +4> cover:analyse(foo, calls, line). +{ok,[{{foo,4},1}]}

      Own Id: OTP-18998 Aux Id: GH-8159, PR-8182

    • Fixed align command in emacs mode.

      Own Id: OTP-19026 Aux Id: PR-8155

    @@ -81,12 +81,12 @@ """. "a\nb\nc"

    Adjacent string literals without intervening white space is now a syntax error, to avoid possible confusion with triple-quoted strings. For example:

    1> "abc""xyz".
     "xyz".
    -* 1:6: adjacent string literals without intervening white space

    POTENTIAL INCOMPATIBILITY

    Own Id: OTP-18750 Aux Id: OTP-18746, PR-7313, PR-7451

  • There is a new tool tprof, which combines the functionality of eprof and cprof under one interface and adds heap profiling. It also has functionality to help with profiling process hierarchies.

    Example:

    1> tprof:profile(lists, seq, [1, 16], #{type => call_memory}).
    +* 1:6: adjacent string literals without intervening white space

    POTENTIAL INCOMPATIBILITY

    Own Id: OTP-18750 Aux Id: OTP-18746, PR-7313, PR-7451

  • There is a new tool tprof, which combines the functionality of eprof and cprof under one interface and adds heap profiling. It also has functionality to help with profiling process hierarchies.

    Example:

    1> tprof:profile(lists, seq, [1, 16], #{type => call_memory}).
     
     ****** Process <0.92.0>  --  100.00% of total *** 
    -FUNCTION          CALLS  WORDS  PER CALL  [     %]
    -lists:seq_loop/3      5     32      6.40  [100.00]
    -                            32            [ 100.0]
    +FUNCTION          CALLS  WORDS  PER CALL  [     %]
    +lists:seq_loop/3      5     32      6.40  [100.00]
    +                            32            [ 100.0]
     ok

    Own Id: OTP-18756 Aux Id: PR-6639

  • Native coverage support has been implemented in the JIT. It will automatically be used by the cover tool to reduce the execution overhead when running cover-compiled code.

    There are also new APIs to support native coverage without using the cover tool.

    To instrument code for native coverage it must be compiled with the line_coverage option.

    To enable native coverage in the runtime system, start it like so:

    $ erl +JPcover true

    There are also the following new functions for supporting native coverage:

    Own Id: OTP-18856 Aux Id: PR-7856

  • The documentation has been migrated to use Markdown and ExDoc.

    Own Id: OTP-18955 Aux Id: PR-8026

  • Improved the align command in emacs mode.

    Own Id: OTP-19080 Aux Id: PR-8288

  • /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/tprof.xhtml differs (HTML document, ASCII text, with very long lines (1237)) --- old//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/tprof.xhtml 2026-06-04 00:07:26.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/tprof.xhtml 2042-07-06 13:26:54.000000000 +0000 @@ -55,137 +55,137 @@ Ad-hoc profiling

    -

    Ad-hoc profiling is convenient for profiling a single function call.

    For example:

    1> tprof:profile(lists, seq, [1, 16], #{type => call_memory}).
    +

    Ad-hoc profiling is convenient for profiling a single function call.

    For example:

    1> tprof:profile(lists, seq, [1, 16], #{type => call_memory}).
     
     ****** Process <0.92.0>  --  100.00% of total *** 
    -FUNCTION          CALLS  WORDS  PER CALL  [     %]
    -lists:seq_loop/3      5     32      6.40  [100.00]
    -                            32            [ 100.0]
    +FUNCTION          CALLS  WORDS  PER CALL  [     %]
    +lists:seq_loop/3      5     32      6.40  [100.00]
    +                            32            [ 100.0]
     ok

    By default tracing is enabled for all functions in all modules. When funs -are created in the interactive shell, parts of shell code are also traced:

    1> tprof:profile(fun() -> lists:seq(1, 16) end, #{type => call_memory}).
    +are created in the interactive shell, parts of shell code are also traced:

    1> tprof:profile(fun() -> lists:seq(1, 16) end, #{type => call_memory}).
     
     ****** Process <0.95.0>  --  100.00% of total *** 
    -FUNCTION                   CALLS  WORDS  PER CALL  [    %]
    -erl_eval:do_apply/7            1      3      3.00  [ 3.61]
    -erl_eval:match_list/6          1      3      3.00  [ 3.61]
    -lists:reverse/1                1      4      4.00  [ 4.82]
    -erl_eval:expr_list/7           3      7      2.33  [ 8.43]
    -erl_eval:ret_expr/3            4     16      4.00  [19.28]
    -erl_eval:merge_bindings/4      3     18      6.00  [21.69]
    -lists:seq_loop/3               5     32      6.40  [38.55]
    -                                     83            [100.0]
    -ok

    However, it is possible to limit the trace to specific functions or modules:

    2> tprof:profile(fun() -> lists:seq(1, 16) end,
    -                 #{type => call_memory, pattern => [{lists, seq_loop, '_'}]}).
    +FUNCTION                   CALLS  WORDS  PER CALL  [    %]
    +erl_eval:do_apply/7            1      3      3.00  [ 3.61]
    +erl_eval:match_list/6          1      3      3.00  [ 3.61]
    +lists:reverse/1                1      4      4.00  [ 4.82]
    +erl_eval:expr_list/7           3      7      2.33  [ 8.43]
    +erl_eval:ret_expr/3            4     16      4.00  [19.28]
    +erl_eval:merge_bindings/4      3     18      6.00  [21.69]
    +lists:seq_loop/3               5     32      6.40  [38.55]
    +                                     83            [100.0]
    +ok

    However, it is possible to limit the trace to specific functions or modules:

    2> tprof:profile(fun() -> lists:seq(1, 16) end,
    +                 #{type => call_memory, pattern => [{lists, seq_loop, '_'}]}).
     ****** Process <0.98.0>  --  100.00% of total *** 
    -FUNCTION          CALLS  WORDS  PER CALL  [     %]
    -lists:seq_loop/3      5     32      6.40  [100.00]
    -                            32            [ 100.0]
    +FUNCTION          CALLS  WORDS  PER CALL  [     %]
    +lists:seq_loop/3      5     32      6.40  [100.00]
    +                            32            [ 100.0]
     
     ok

    Ad-hoc profiling results can be printed in a few different ways. The following -examples use the test module defined like this:

    -module(test).
    --export([test_spawn/0]).
    -test_spawn() ->
    -    {Pid, MRef} = spawn_monitor(fun () -> lists:seq(1, 32) end),
    +examples use the test module defined like this:

    -module(test).
    +-export([test_spawn/0]).
    +test_spawn() ->
    +    {Pid, MRef} = spawn_monitor(fun () -> lists:seq(1, 32) end),
         receive
    -        {'DOWN', MRef, process, Pid, normal} ->
    +        {'DOWN', MRef, process, Pid, normal} ->
                 done
    -    end.

    By default per-process statistics is shown:

    1> tprof:profile(test, test_spawn, [], #{type => call_memory}).
    +    end.

    By default per-process statistics is shown:

    1> tprof:profile(test, test_spawn, [], #{type => call_memory}).
     
     ****** Process <0.176.0>    -- 23.66 % of total allocations ***
    -FUNCTION                CALLS  WORDS  PER CALL  [    %]
    -erlang:spawn_monitor/1      1      2         2  [ 9.09]
    -erlang:spawn_opt/4          1      6         6  [27.27]
    -test:test_spawn/0           1     14        14  [63.64]
    -                                  22            [100.0]
    +FUNCTION                CALLS  WORDS  PER CALL  [    %]
    +erlang:spawn_monitor/1      1      2         2  [ 9.09]
    +erlang:spawn_opt/4          1      6         6  [27.27]
    +test:test_spawn/0           1     14        14  [63.64]
    +                                  22            [100.0]
     
     ****** Process <0.177.0>    -- 76.34 % of total allocations ***
    -FUNCTION           CALLS  WORDS  PER CALL  [    %]
    -erlang:apply/2         1      7         7  [ 9.86]
    -lists:seq_loop/3       9     64         7  [90.14]
    -                             71            [100.0]

    The following example prints the combined memory allocation of all +FUNCTION CALLS WORDS PER CALL [ %] +erlang:apply/2 1 7 7 [ 9.86] +lists:seq_loop/3 9 64 7 [90.14] + 71 [100.0]

    The following example prints the combined memory allocation of all processes, sorted by the total number of allocated words in descending -order:

    2> tprof:profile(test, test_spawn, [],
    -                 #{type => call_memory, report => {total, {measurement, descending}}}).
    +order:

    2> tprof:profile(test, test_spawn, [],
    +                 #{type => call_memory, report => {total, {measurement, descending}}}).
     
    -FUNCTION                CALLS  WORDS  PER CALL  [    %]
    -lists:seq_loop/3            9     64         7  [68.82]
    -test:test_spawn/0           1     14        14  [15.05]
    -erlang:apply/2              1      7         7  [ 7.53]
    -erlang:spawn_opt/4          1      6         6  [ 6.45]
    -erlang:spawn_monitor/1      1      2         2  [ 2.15]
    -                                  93            [100.0]

    The profiling data can also be collected for further inspection:

    3> {done, ProfileData} = tprof:profile(fun test:test_spawn/0,
    -                                       #{type => call_memory, report => return}).
    +FUNCTION                CALLS  WORDS  PER CALL  [    %]
    +lists:seq_loop/3            9     64         7  [68.82]
    +test:test_spawn/0           1     14        14  [15.05]
    +erlang:apply/2              1      7         7  [ 7.53]
    +erlang:spawn_opt/4          1      6         6  [ 6.45]
    +erlang:spawn_monitor/1      1      2         2  [ 2.15]
    +                                  93            [100.0]

    The profiling data can also be collected for further inspection:

    3> {done, ProfileData} = tprof:profile(fun test:test_spawn/0,
    +                                       #{type => call_memory, report => return}).
     <...>
    -4> tprof:format(tprof:inspect(ProfileData, process, {percent, descending})).
    +4> tprof:format(tprof:inspect(ProfileData, process, {percent, descending})).
     
     ****** Process <0.223.0>    -- 23.66 % of total allocations ***
    -FUNCTION                CALLS  WORDS  PER CALL  [    %]
    -test:test_spawn/0           1     14        14  [63.64]
    -erlang:spawn_opt/4          1      6         6  [27.27]
    -erlang:spawn_monitor/1      1      2         2  [ 9.09]
    -                                  22            [100.0]
    +FUNCTION                CALLS  WORDS  PER CALL  [    %]
    +test:test_spawn/0           1     14        14  [63.64]
    +erlang:spawn_opt/4          1      6         6  [27.27]
    +erlang:spawn_monitor/1      1      2         2  [ 9.09]
    +                                  22            [100.0]
     
     ****** Process <0.224.0>    -- 76.34 % of total allocations ***
    -FUNCTION           CALLS  WORDS  PER CALL  [    %]
    -lists:seq_loop/3       9     64         7  [90.14]
    -erlang:apply/2         1      7         7  [ 9.86]
    -                             71            [100.0]

    Which processes that are profiled depends on the profiling type.

    • call_count (default) counts calls in all processes.

    • call_time and call_memory limits the profiling to the processes +FUNCTION CALLS WORDS PER CALL [ %] +lists:seq_loop/3 9 64 7 [90.14] +erlang:apply/2 1 7 7 [ 9.86] + 71 [100.0]

    Which processes that are profiled depends on the profiling type.

    • call_count (default) counts calls in all processes.

    • call_time and call_memory limits the profiling to the processes spawned from the user-provided function (using the set_on_spawn -option for trace:process/4).

    call_time and call_memory can be restricted to profile a single process:

    2> tprof:profile(test, test_spawn, [],
    -                 #{type => call_memory, set_on_spawn => false}).
    +option for trace:process/4).

    call_time and call_memory can be restricted to profile a single process:

    2> tprof:profile(test, test_spawn, [],
    +                 #{type => call_memory, set_on_spawn => false}).
     
     ****** Process <0.183.0>    -- 100.00 % of total allocations ***
    -FUNCTION                CALLS  WORDS  PER CALL  [    %]
    -erlang:spawn_monitor/1      1      2         2  [ 9.09]
    -erlang:spawn_opt/4          1      6         6  [27.27]
    -test:test_spawn/0           1     14        14  [63.64]

    Erlang programs can perform expensive operations in other processes +FUNCTION CALLS WORDS PER CALL [ %] +erlang:spawn_monitor/1 1 2 2 [ 9.09] +erlang:spawn_opt/4 1 6 6 [27.27] +test:test_spawn/0 1 14 14 [63.64]

    Erlang programs can perform expensive operations in other processes than the original one. You can include multiple, new, or even all -processes in the trace when measuring time or memory:

    7> pg:start_link().
    -{ok,<0.252.0>}
    -8> tprof:profile(fun() -> pg:join(group, self()) end,
    -                 #{type => call_memory, rootset => [pg]}).
    +processes in the trace when measuring time or memory:

    7> pg:start_link().
    +{ok,<0.252.0>}
    +8> tprof:profile(fun() -> pg:join(group, self()) end,
    +                 #{type => call_memory, rootset => [pg]}).
     ****** Process <0.252.0>    -- 52.86 % of total allocations ***
    -FUNCTION                      CALLS  WORDS  PER CALL  [    %]
    -pg:leave_local_update_ets/5       1      2         2  [ 1.80]
    -gen:reply/2                       1      3         3  [ 2.70]
    -erlang:monitor/2                  1      3         3  [ 2.70]
    -gen_server:try_handle_call/4      1      3         3  [ 2.70]
    -gen_server:try_dispatch/4         1      3         3  [ 2.70]
    -maps:iterator/1                   2      4         2  [ 3.60]
    -maps:take/2                       1      6         6  [ 5.41]
    -pg:join_local_update_ets/5        1      8         8  [ 7.21]
    -pg:handle_info/2                  1      8         8  [ 7.21]
    -pg:handle_call/3                  1      9         9  [ 8.11]
    -gen_server:loop/7                 2      9         4  [ 8.11]
    -ets:lookup/2                      2     10         5  [ 9.01]
    -pg:join_local/3                   1     11        11  [ 9.91]
    -pg:notify_group/5                 2     16         8  [14.41]
    -erlang:setelement/3               2     16         8  [14.41]
    -                                       111            [100.0]
    +FUNCTION                      CALLS  WORDS  PER CALL  [    %]
    +pg:leave_local_update_ets/5       1      2         2  [ 1.80]
    +gen:reply/2                       1      3         3  [ 2.70]
    +erlang:monitor/2                  1      3         3  [ 2.70]
    +gen_server:try_handle_call/4      1      3         3  [ 2.70]
    +gen_server:try_dispatch/4         1      3         3  [ 2.70]
    +maps:iterator/1                   2      4         2  [ 3.60]
    +maps:take/2                       1      6         6  [ 5.41]
    +pg:join_local_update_ets/5        1      8         8  [ 7.21]
    +pg:handle_info/2                  1      8         8  [ 7.21]
    +pg:handle_call/3                  1      9         9  [ 8.11]
    +gen_server:loop/7                 2      9         4  [ 8.11]
    +ets:lookup/2                      2     10         5  [ 9.01]
    +pg:join_local/3                   1     11        11  [ 9.91]
    +pg:notify_group/5                 2     16         8  [14.41]
    +erlang:setelement/3               2     16         8  [14.41]
    +                                       111            [100.0]
     
     ****** Process <0.255.0>    -- 47.14 % of total allocations ***
    -FUNCTION                   CALLS  WORDS  PER CALL  [    %]
    -erl_eval:match_list/6          1      3         3  [ 3.03]
    -erlang:monitor/2               1      3         3  [ 3.03]
    -lists:reverse/1                2      4         2  [ 4.04]
    /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/xref_chapter.xhtml differs (HTML document, Unicode text, UTF-8 text, with very long lines (993))
    --- old//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/xref_chapter.xhtml	2026-06-04 00:07:26.000000000 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tools.epub/OEBPS/xref_chapter.xhtml	2042-07-06 13:26:54.000000000 +0000
    @@ -35,25 +35,25 @@
       
       Module Check
     
    -

    Assume we want to check the following module:

    -module(my_module).
    +

    Assume we want to check the following module:

    -module(my_module).
     
    --export([t/1]).
    +-export([t/1]).
     
    -t(A) ->
    -  my_module:t2(A).
    +t(A) ->
    +  my_module:t2(A).
     
    -t2(_) ->
    +t2(_) ->
       true.

    Cross reference data are read from BEAM files, so the first step when checking -an edited module is to compile it:

    1> c(my_module, debug_info).
    +an edited module is to compile it:

    1> c(my_module, debug_info).
     ./my_module.erl:10: Warning: function t2/1 is unused
    -{ok, my_module}

    The debug_info option ensures that the BEAM file contains debug information, +{ok, my_module}

    The debug_info option ensures that the BEAM file contains debug information, which makes it possible to find unused local functions.

    The module can now be checked for calls to deprecated functions, calls to undefined functions, and for unused local -functions:

    2> xref:m(my_module)
    -[{deprecated,[]},
    - {undefined,[{{my_module,t,1},{my_module,t2,1}}]},
    - {unused,[{my_module,t2,1}]}]

    m/1 is also suitable for checking that the BEAM file of a module that is about +functions:

    2> xref:m(my_module)
    +[{deprecated,[]},
    + {undefined,[{{my_module,t,1},{my_module,t2,1}}]},
    + {unused,[{my_module,t2,1}]}]

    m/1 is also suitable for checking that the BEAM file of a module that is about to be loaded into a running a system does not call any undefined functions. In either case, the code path of the code server (see the module code) is used for finding modules that export externally called functions not exported by the @@ -68,28 +68,28 @@ this example an xref server will be used, which makes it possible to analyze applications and releases, and also to select the library path explicitly.

    Each Xref server is referred to by a unique name. The name is given when -creating the server:

    1> xref:start(s).
    -{ok,<0.27.0>}

    Next the system to be analyzed is added to the Xref server. Here the system will +creating the server:

    1> xref:start(s).
    +{ok,<0.27.0>}

    Next the system to be analyzed is added to the Xref server. Here the system will be OTP, so no library path will be needed. Otherwise, when analyzing a system that uses OTP, the OTP modules are typically made library modules by setting the library path to the default OTP code path (or to code_path, see the reference manual). By default, the names of read BEAM files and warnings are output when adding analyzed modules, but these messages -can be avoided by setting default values of some options:

    2> xref:set_default(s, [{verbose,false}, {warnings,false}]).
    +can be avoided by setting default values of some options:

    2> xref:set_default(s, [{verbose,false}, {warnings,false}]).
     ok
    -3> xref:add_release(s, code:lib_dir(), {name, otp}).
    -{ok,otp}

    add_release/3 assumes that all subdirectories of the library directory +3> xref:add_release(s, code:lib_dir(), {name, otp}). +{ok,otp}

    add_release/3 assumes that all subdirectories of the library directory returned by code:lib_dir() contain applications; -the effect is that of reading all BEAM files for the application.

    It is now easy to check the release for calls to undefined functions:

    4> xref:analyze(s, undefined_function_calls).
    -{ok, [...]}

    We can now continue with further analyses, or we can delete the Xref server:

    5> xref:stop(s).

    The check for calls to undefined functions is an example of a predefined +the effect is that of reading all BEAM files for the application.

    It is now easy to check the release for calls to undefined functions:

    4> xref:analyze(s, undefined_function_calls).
    +{ok, [...]}

    We can now continue with further analyses, or we can delete the Xref server:

    5> xref:stop(s).

    The check for calls to undefined functions is an example of a predefined analysis, probably the most useful one. Other examples are the analyses that find unused local functions, or functions that call some given functions. See the analyze/2,3 functions for a complete list of predefined analyses.

    Each predefined analysis is a shorthand for a query, a sentence of a tiny language providing cross reference data as values of predefined variables. The check for calls to -undefined functions can thus be stated as a query:

    4> xref:q(s, "(XC - UC) || (XU - X - B)").
    -{ok,[...]}

    The query asks for the restriction of external calls except the unresolved calls +undefined functions can thus be stated as a query:

    4> xref:q(s, "(XC - UC) || (XU - X - B)").
    +{ok,[...]}

    The query asks for the restriction of external calls except the unresolved calls to calls to functions that are externally used but neither exported nor built-in functions (the || operator restricts the used functions while the | operator restricts the calling functions). The - operator returns the difference of two @@ -119,8 +119,8 @@ provided with a simple language. Below are some expressions of the language with comments, focusing on elements of the language rather than providing useful examples. The analyzed system is assumed to be OTP, so in order to run the -queries, first evaluate these calls:

    xref:start(s).
    -xref:add_release(s, code:root_dir()).
    • xref:q(s, "(Fun) xref : Mod"). - All functions of the xref module.

    • xref:q(s, "xref : Mod * X"). - All exported functions of the xref +queries, first evaluate these calls:

      xref:start(s).
      +xref:add_release(s, code:root_dir()).
      • xref:q(s, "(Fun) xref : Mod"). - All functions of the xref module.

      • xref:q(s, "xref : Mod * X"). - All exported functions of the xref module. The first operand of the intersection operator * is implicitly converted to the more special type of the second operand.

      • xref:q(s, "(Mod) tools"). - All modules of the Tools application.

      • xref:q(s, '"xref_.*" : Mod'). - All modules with a name beginning with xref_.

      • xref:q(s, "# E | X "). - Number of calls from exported functions.

      • xref:q(s, "XC || L "). - All external calls to local functions.

      • xref:q(s, "XC * LC"). - All calls that have both an external and a local @@ -163,18 +163,18 @@ a module M1 is said to call a module M2 if there is some function in M1 that calls some function in M2. It would be nice if we could use the much smaller module graph, since it is available also in the light weight -modulesmode of Xref servers.

        t(S) ->
        -  {ok, _} = xref:q(S, "Eplus := closure E"),
        -  {ok, Ms} = xref:q(S, "AM"),
        -  Fun = fun(M, N) ->
        -      Q = io_lib:format("# (Mod) (Eplus | ~p : Mod)", [M]),
        -      {ok, N0} = xref:q(S, lists:flatten(Q)),
        +modulesmode of Xref servers.

        t(S) ->
        +  {ok, _} = xref:q(S, "Eplus := closure E"),
        +  {ok, Ms} = xref:q(S, "AM"),
        +  Fun = fun(M, N) ->
        +      Q = io_lib:format("# (Mod) (Eplus | ~p : Mod)", [M]),
        +      {ok, N0} = xref:q(S, lists:flatten(Q)),
               N + N0
             end,
        -  Sum = lists:foldl(Fun, 0, Ms),
        -  ok = xref:forget(S, 'Eplus'),
        -  {ok, Tot} = xref:q(S, "# (closure ME | AM)"),
        -  100 * ((Tot - Sum) / Tot).

        Comments on the code:

        • We want to find the reduction of the closure of the function graph to modules. + Sum = lists:foldl(Fun, 0, Ms), + ok = xref:forget(S, 'Eplus'), + {ok, Tot} = xref:q(S, "# (closure ME | AM)"), + 100 * ((Tot - Sum) / Tot).

        Comments on the code:

        • We want to find the reduction of the closure of the function graph to modules. The direct expression for doing that would be (Mod) (closure E | AM), but then we would have to represent all of the transitive closure of E in memory. Instead the number of indirectly used modules is found for each analyzed /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tprof.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1237)) --- old//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tprof.html 2026-06-04 19:05:22.187633473 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/tprof.html 2026-06-04 19:05:22.187633473 +0000 @@ -160,137 +160,137 @@ Ad-hoc profiling -

          Ad-hoc profiling is convenient for profiling a single function call.

          For example:

          1> tprof:profile(lists, seq, [1, 16], #{type => call_memory}).
          +

          Ad-hoc profiling is convenient for profiling a single function call.

          For example:

          1> tprof:profile(lists, seq, [1, 16], #{type => call_memory}).
           
           ****** Process <0.92.0>  --  100.00% of total *** 
          -FUNCTION          CALLS  WORDS  PER CALL  [     %]
          -lists:seq_loop/3      5     32      6.40  [100.00]
          -                            32            [ 100.0]
          +FUNCTION          CALLS  WORDS  PER CALL  [     %]
          +lists:seq_loop/3      5     32      6.40  [100.00]
          +                            32            [ 100.0]
           ok

          By default tracing is enabled for all functions in all modules. When funs -are created in the interactive shell, parts of shell code are also traced:

          1> tprof:profile(fun() -> lists:seq(1, 16) end, #{type => call_memory}).
          +are created in the interactive shell, parts of shell code are also traced:

          1> tprof:profile(fun() -> lists:seq(1, 16) end, #{type => call_memory}).
           
           ****** Process <0.95.0>  --  100.00% of total *** 
          -FUNCTION                   CALLS  WORDS  PER CALL  [    %]
          -erl_eval:do_apply/7            1      3      3.00  [ 3.61]
          -erl_eval:match_list/6          1      3      3.00  [ 3.61]
          -lists:reverse/1                1      4      4.00  [ 4.82]
          -erl_eval:expr_list/7           3      7      2.33  [ 8.43]
          -erl_eval:ret_expr/3            4     16      4.00  [19.28]
          -erl_eval:merge_bindings/4      3     18      6.00  [21.69]
          -lists:seq_loop/3               5     32      6.40  [38.55]
          -                                     83            [100.0]
          -ok

          However, it is possible to limit the trace to specific functions or modules:

          2> tprof:profile(fun() -> lists:seq(1, 16) end,
          -                 #{type => call_memory, pattern => [{lists, seq_loop, '_'}]}).
          +FUNCTION                   CALLS  WORDS  PER CALL  [    %]
          +erl_eval:do_apply/7            1      3      3.00  [ 3.61]
          +erl_eval:match_list/6          1      3      3.00  [ 3.61]
          +lists:reverse/1                1      4      4.00  [ 4.82]
          +erl_eval:expr_list/7           3      7      2.33  [ 8.43]
          +erl_eval:ret_expr/3            4     16      4.00  [19.28]
          +erl_eval:merge_bindings/4      3     18      6.00  [21.69]
          +lists:seq_loop/3               5     32      6.40  [38.55]
          +                                     83            [100.0]
          +ok

          However, it is possible to limit the trace to specific functions or modules:

          2> tprof:profile(fun() -> lists:seq(1, 16) end,
          +                 #{type => call_memory, pattern => [{lists, seq_loop, '_'}]}).
           ****** Process <0.98.0>  --  100.00% of total *** 
          -FUNCTION          CALLS  WORDS  PER CALL  [     %]
          -lists:seq_loop/3      5     32      6.40  [100.00]
          -                            32            [ 100.0]
          +FUNCTION          CALLS  WORDS  PER CALL  [     %]
          +lists:seq_loop/3      5     32      6.40  [100.00]
          +                            32            [ 100.0]
           
           ok

          Ad-hoc profiling results can be printed in a few different ways. The following -examples use the test module defined like this:

          -module(test).
          --export([test_spawn/0]).
          -test_spawn() ->
          -    {Pid, MRef} = spawn_monitor(fun () -> lists:seq(1, 32) end),
          +examples use the test module defined like this:

          -module(test).
          +-export([test_spawn/0]).
          +test_spawn() ->
          +    {Pid, MRef} = spawn_monitor(fun () -> lists:seq(1, 32) end),
               receive
          -        {'DOWN', MRef, process, Pid, normal} ->
          +        {'DOWN', MRef, process, Pid, normal} ->
                       done
          -    end.

          By default per-process statistics is shown:

          1> tprof:profile(test, test_spawn, [], #{type => call_memory}).
          +    end.

          By default per-process statistics is shown:

          1> tprof:profile(test, test_spawn, [], #{type => call_memory}).
           
           ****** Process <0.176.0>    -- 23.66 % of total allocations ***
          -FUNCTION                CALLS  WORDS  PER CALL  [    %]
          -erlang:spawn_monitor/1      1      2         2  [ 9.09]
          -erlang:spawn_opt/4          1      6         6  [27.27]
          -test:test_spawn/0           1     14        14  [63.64]
          -                                  22            [100.0]
          +FUNCTION                CALLS  WORDS  PER CALL  [    %]
          +erlang:spawn_monitor/1      1      2         2  [ 9.09]
          +erlang:spawn_opt/4          1      6         6  [27.27]
          +test:test_spawn/0           1     14        14  [63.64]
          +                                  22            [100.0]
           
           ****** Process <0.177.0>    -- 76.34 % of total allocations ***
          -FUNCTION           CALLS  WORDS  PER CALL  [    %]
          -erlang:apply/2         1      7         7  [ 9.86]
          -lists:seq_loop/3       9     64         7  [90.14]
          -                             71            [100.0]

          The following example prints the combined memory allocation of all +FUNCTION CALLS WORDS PER CALL [ %] +erlang:apply/2 1 7 7 [ 9.86] +lists:seq_loop/3 9 64 7 [90.14] + 71 [100.0]

          The following example prints the combined memory allocation of all processes, sorted by the total number of allocated words in descending -order:

          2> tprof:profile(test, test_spawn, [],
          -                 #{type => call_memory, report => {total, {measurement, descending}}}).
          +order:

          2> tprof:profile(test, test_spawn, [],
          +                 #{type => call_memory, report => {total, {measurement, descending}}}).
           
          -FUNCTION                CALLS  WORDS  PER CALL  [    %]
          -lists:seq_loop/3            9     64         7  [68.82]
          -test:test_spawn/0           1     14        14  [15.05]
          -erlang:apply/2              1      7         7  [ 7.53]
          -erlang:spawn_opt/4          1      6         6  [ 6.45]
          -erlang:spawn_monitor/1      1      2         2  [ 2.15]
          -                                  93            [100.0]

          The profiling data can also be collected for further inspection:

          3> {done, ProfileData} = tprof:profile(fun test:test_spawn/0,
          -                                       #{type => call_memory, report => return}).
          +FUNCTION                CALLS  WORDS  PER CALL  [    %]
          +lists:seq_loop/3            9     64         7  [68.82]
          +test:test_spawn/0           1     14        14  [15.05]
          +erlang:apply/2              1      7         7  [ 7.53]
          +erlang:spawn_opt/4          1      6         6  [ 6.45]
          +erlang:spawn_monitor/1      1      2         2  [ 2.15]
          +                                  93            [100.0]

          The profiling data can also be collected for further inspection:

          3> {done, ProfileData} = tprof:profile(fun test:test_spawn/0,
          +                                       #{type => call_memory, report => return}).
           <...>
          -4> tprof:format(tprof:inspect(ProfileData, process, {percent, descending})).
          +4> tprof:format(tprof:inspect(ProfileData, process, {percent, descending})).
           
           ****** Process <0.223.0>    -- 23.66 % of total allocations ***
          -FUNCTION                CALLS  WORDS  PER CALL  [    %]
          -test:test_spawn/0           1     14        14  [63.64]
          -erlang:spawn_opt/4          1      6         6  [27.27]
          -erlang:spawn_monitor/1      1      2         2  [ 9.09]
          -                                  22            [100.0]
          +FUNCTION                CALLS  WORDS  PER CALL  [    %]
          +test:test_spawn/0           1     14        14  [63.64]
          +erlang:spawn_opt/4          1      6         6  [27.27]
          +erlang:spawn_monitor/1      1      2         2  [ 9.09]
          +                                  22            [100.0]
           
           ****** Process <0.224.0>    -- 76.34 % of total allocations ***
          -FUNCTION           CALLS  WORDS  PER CALL  [    %]
          -lists:seq_loop/3       9     64         7  [90.14]
          -erlang:apply/2         1      7         7  [ 9.86]
          -                             71            [100.0]

          Which processes that are profiled depends on the profiling type.

          • call_count (default) counts calls in all processes.

          • call_time and call_memory limits the profiling to the processes +FUNCTION CALLS WORDS PER CALL [ %] +lists:seq_loop/3 9 64 7 [90.14] +erlang:apply/2 1 7 7 [ 9.86] + 71 [100.0]

          Which processes that are profiled depends on the profiling type.

          • call_count (default) counts calls in all processes.

          • call_time and call_memory limits the profiling to the processes spawned from the user-provided function (using the set_on_spawn -option for trace:process/4).

          call_time and call_memory can be restricted to profile a single process:

          2> tprof:profile(test, test_spawn, [],
          -                 #{type => call_memory, set_on_spawn => false}).
          +option for trace:process/4).

        call_time and call_memory can be restricted to profile a single process:

        2> tprof:profile(test, test_spawn, [],
        +                 #{type => call_memory, set_on_spawn => false}).
         
         ****** Process <0.183.0>    -- 100.00 % of total allocations ***
        -FUNCTION                CALLS  WORDS  PER CALL  [    %]
        -erlang:spawn_monitor/1      1      2         2  [ 9.09]
        -erlang:spawn_opt/4          1      6         6  [27.27]
        -test:test_spawn/0           1     14        14  [63.64]

        Erlang programs can perform expensive operations in other processes +FUNCTION CALLS WORDS PER CALL [ %] +erlang:spawn_monitor/1 1 2 2 [ 9.09] +erlang:spawn_opt/4 1 6 6 [27.27] +test:test_spawn/0 1 14 14 [63.64]

    Erlang programs can perform expensive operations in other processes than the original one. You can include multiple, new, or even all -processes in the trace when measuring time or memory:

    7> pg:start_link().
    -{ok,<0.252.0>}
    -8> tprof:profile(fun() -> pg:join(group, self()) end,
    -                 #href_anchor"ss">type => call_memory, rootset => [pg]}).
    +processes in the trace when measuring time or memory:

    7> pg:start_link().
    +{ok,<0.252.0>}
    +8> tprof:profile(fun() -> pg:join(group, self()) end,
    +                 #href_anchor"ss">type => call_memory, rootset => [pg]}).
     ****** Process <0.252.0>    -- 52.86 % of total allocations ***
    -FUNCTION                      CALLS  WORDS  PER CALL  [    %]
    -pg:leave_local_update_ets/5       1      2         2  [ 1.80]
    -gen:reply/2                       1      3         3  [ 2.70]
    -erlang:monitor/2                  1      3         3  [ 2.70]
    -gen_server:try_handle_call/4      1      3         3  [ 2.70]
    -gen_server:try_dispatch/4         1      3         3  [ 2.70]
    -maps:iterator/1                   2      4         2  [ 3.60]
    -maps:take/2                       1      6         6  [ 5.41]
    -pg:join_local_update_ets/5        1      8         8  [ 7.21]
    -pg:handle_info/2                  1      8         8  [ 7.21]
    -pg:handle_call/3                  1      9         9  [ 8.11]
    -gen_server:loop/7                 2      9         4  [ 8.11]
    -ets:lookup/2                      2     10         5  [ 9.01]
    -pg:join_local/3                   1     11        11  [ 9.91]
    -pg:notify_group/5                 2     16         8  [14.41]
    -erlang:setelement/3               2     16         8  [14.41]
    -                                       111            [100.0]
    +FUNCTION                      CALLS  WORDS  PER CALL  [    %]
    +pg:leave_local_update_ets/5       1      2         2  [ 1.80]
    +gen:reply/2                       1      3         3  [ 2.70]
    +erlang:monitor/2                  1      3         3  [ 2.70]
    +gen_server:try_handle_call/4      1      3         3  [ 2.70]
    +gen_server:try_dispatch/4         1      3         3  [ 2.70]
    +maps:iterator/1                   2      4         2  [ 3.60]
    +maps:take/2                       1      6         6  [ 5.41]
    +pg:join_local_update_ets/5        1      8         8  [ 7.21]
    +pg:handle_info/2                  1      8         8  [ 7.21]
    +pg:handle_call/3                  1      9         9  [ 8.11]
    +gen_server:loop/7                 2      9         4  [ 8.11]
    +ets:lookup/2                      2     10         5  [ 9.01]
    +pg:join_local/3                   1     11        11  [ 9.91]
    +pg:notify_group/5                 2     16         8  [14.41]
    +erlang:setelement/3               2     16         8  [14.41]
    +                                       111            [100.0]
     
     ****** Process <0.255.0>    -- 47.14 % of total allocations ***
    -FUNCTION                   CALLS  WORDS  PER CALL  [    %]
    -erl_eval:match_list/6          1      3         3  [ 3.03]
    -erlang:monitor/2               1      3         3  [ 3.03]
    -lists:reverse/1                2      4         2  [ 4.04]
    /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/xref.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1070))
    --- old//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/xref.html	2026-06-04 19:05:22.235633918 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/xref.html	2026-06-04 19:05:22.235633918 +0000
    @@ -3722,7 +3722,7 @@
               Erlang programming language
     
           

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/xref_chapter.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (993)) --- old//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/xref_chapter.html 2026-06-04 19:05:22.255634104 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/tools-4.1/doc/html/xref_chapter.html 2026-06-04 19:05:22.255634104 +0000 @@ -140,25 +140,25 @@ Module Check -

    Assume we want to check the following module:

    -module(my_module).
    +

    Assume we want to check the following module:

    -module(my_module).
     
    --export([t/1]).
    +-export([t/1]).
     
    -t(A) ->
    -  my_module:t2(A).
    +t(A) ->
    +  my_module:t2(A).
     
    -t2(_) ->
    +t2(_) ->
       true.

    Cross reference data are read from BEAM files, so the first step when checking -an edited module is to compile it:

    1> c(my_module, debug_info).
    +an edited module is to compile it:

    1> c(my_module, debug_info).
     ./my_module.erl:10: Warning: function t2/1 is unused
    -{ok, my_module}

    The debug_info option ensures that the BEAM file contains debug information, +{ok, my_module}

    The debug_info option ensures that the BEAM file contains debug information, which makes it possible to find unused local functions.

    The module can now be checked for calls to deprecated functions, calls to undefined functions, and for unused local -functions:

    2> xref:m(my_module)
    -[{deprecated,[]},
    - {undefined,[{{my_module,t,1},{my_module,t2,1}}]},
    - {unused,[{my_module,t2,1}]}]

    m/1 is also suitable for checking that the BEAM file of a module that is about +functions:

    2> xref:m(my_module)
    +[{deprecated,[]},
    + {undefined,[{{my_module,t,1},{my_module,t2,1}}]},
    + {unused,[{my_module,t2,1}]}]

    m/1 is also suitable for checking that the BEAM file of a module that is about to be loaded into a running a system does not call any undefined functions. In either case, the code path of the code server (see the module code) is used for finding modules that export externally called functions not exported by the @@ -173,28 +173,28 @@ this example an xref server will be used, which makes it possible to analyze applications and releases, and also to select the library path explicitly.

    Each Xref server is referred to by a unique name. The name is given when -creating the server:

    1> xref:start(s).
    -{ok,<0.27.0>}

    Next the system to be analyzed is added to the Xref server. Here the system will +creating the server:

    1> xref:start(s).
    +{ok,<0.27.0>}

    Next the system to be analyzed is added to the Xref server. Here the system will be OTP, so no library path will be needed. Otherwise, when analyzing a system that uses OTP, the OTP modules are typically made library modules by setting the library path to the default OTP code path (or to code_path, see the reference manual). By default, the names of read BEAM files and warnings are output when adding analyzed modules, but these messages -can be avoided by setting default values of some options:

    2> xref:set_default(s, [{verbose,false}, {warnings,false}]).
    +can be avoided by setting default values of some options:

    2> xref:set_default(s, [{verbose,false}, {warnings,false}]).
     ok
    -3> xref:add_release(s, code:lib_dir(), {name, otp}).
    -{ok,otp}

    add_release/3 assumes that all subdirectories of the library directory +3> xref:add_release(s, code:lib_dir(), {name, otp}). +{ok,otp}

    add_release/3 assumes that all subdirectories of the library directory returned by code:lib_dir() contain applications; -the effect is that of reading all BEAM files for the application.

    It is now easy to check the release for calls to undefined functions:

    4> xref:analyze(s, undefined_function_calls).
    -{ok, [...]}

    We can now continue with further analyses, or we can delete the Xref server:

    5> xref:stop(s).

    The check for calls to undefined functions is an example of a predefined +the effect is that of reading all BEAM files for the application.

    It is now easy to check the release for calls to undefined functions:

    4> xref:analyze(s, undefined_function_calls).
    +{ok, [...]}

    We can now continue with further analyses, or we can delete the Xref server:

    5> xref:stop(s).

    The check for calls to undefined functions is an example of a predefined analysis, probably the most useful one. Other examples are the analyses that find unused local functions, or functions that call some given functions. See the analyze/2,3 functions for a complete list of predefined analyses.

    Each predefined analysis is a shorthand for a query, a sentence of a tiny language providing cross reference data as values of predefined variables. The check for calls to -undefined functions can thus be stated as a query:

    4> xref:q(s, "(XC - UC) || (XU - X - B)").
    -{ok,[...]}

    The query asks for the restriction of external calls except the unresolved calls +undefined functions can thus be stated as a query:

    4> xref:q(s, "(XC - UC) || (XU - X - B)").
    +{ok,[...]}

    The query asks for the restriction of external calls except the unresolved calls to calls to functions that are externally used but neither exported nor built-in functions (the || operator restricts the used functions while the | operator restricts the calling functions). The - operator returns the difference of two @@ -224,8 +224,8 @@ provided with a simple language. Below are some expressions of the language with comments, focusing on elements of the language rather than providing useful examples. The analyzed system is assumed to be OTP, so in order to run the -queries, first evaluate these calls:

    xref:start(s).
    -xref:add_release(s, code:root_dir()).
    • xref:q(s, "(Fun) xref : Mod"). - All functions of the xref module.

    • xref:q(s, "xref : Mod * X"). - All exported functions of the xref +queries, first evaluate these calls:

      xref:start(s).
      +xref:add_release(s, code:root_dir()).
      • xref:q(s, "(Fun) xref : Mod"). - All functions of the xref module.

      • xref:q(s, "xref : Mod * X"). - All exported functions of the xref module. The first operand of the intersection operator * is implicitly converted to the more special type of the second operand.

      • xref:q(s, "(Mod) tools"). - All modules of the Tools application.

      • xref:q(s, '"xref_.*" : Mod'). - All modules with a name beginning with xref_.

      • xref:q(s, "# E | X "). - Number of calls from exported functions.

      • xref:q(s, "XC || L "). - All external calls to local functions.

      • xref:q(s, "XC * LC"). - All calls that have both an external and a local @@ -268,18 +268,18 @@ a module M1 is said to call a module M2 if there is some function in M1 that calls some function in M2. It would be nice if we could use the much smaller module graph, since it is available also in the light weight -modulesmode of Xref servers.

        t(S) ->
        -  {ok, _} = xref:q(S, "Eplus := closure E"),
        -  {ok, Ms} = xref:q(S, "AM"),
        -  Fun = fun(M, N) ->
        -      Q = io_lib:format("# (Mod) (Eplus | ~p : Mod)", [M]),
        -      {ok, N0} = xref:q(S, lists:flatten(Q)),
        +modulesmode of Xref servers.

        t(S) ->
        +  {ok, _} = xref:q(S, "Eplus := closure E"),
        +  {ok, Ms} = xref:q(S, "AM"),
        +  Fun = fun(M, N) ->
        +      Q = io_lib:format("# (Mod) (Eplus | ~p : Mod)", [M]),
        +      {ok, N0} = xref:q(S, lists:flatten(Q)),
               N + N0
             end,
        -  Sum = lists:foldl(Fun, 0, Ms),
        -  ok = xref:forget(S, 'Eplus'),
        -  {ok, Tot} = xref:q(S, "# (closure ME | AM)"),
        -  100 * ((Tot - Sum) / Tot).

        Comments on the code:

        • We want to find the reduction of the closure of the function graph to modules. + Sum = lists:foldl(Fun, 0, Ms), + ok = xref:forget(S, 'Eplus'), + {ok, Tot} = xref:q(S, "# (closure ME | AM)"), + 100 * ((Tot - Sum) / Tot).

        Comments on the code:

        • We want to find the reduction of the closure of the function graph to modules. The direct expression for doing that would be (Mod) (closure E | AM), but then we would have to represent all of the transitive closure of E in memory. Instead the number of indirectly used modules is found for each analyzed @@ -354,7 +354,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/404.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/404.html 2026-06-04 19:05:22.271577100 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/404.html 2026-06-04 19:05:22.271577100 +0000 @@ -147,7 +147,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/api-reference.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (468)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/api-reference.html 2026-06-04 19:05:22.307634586 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/api-reference.html 2026-06-04 19:05:22.307634586 +0000 @@ -2418,7 +2418,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/chapter.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (839)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/chapter.html 2026-06-04 19:05:22.325634753 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/chapter.html 2026-06-04 19:05:22.325634753 +0000 @@ -161,13 +161,13 @@ is the object reference. Optional arguments are last and expressed as tagged tuples in any order.

          For example the wxWindow C++ class is implemented in the wxWindow erlang module and the member wxWindow::CenterOnParent is thus -wxWindow:centerOnParent. The following C++ code:

            wxWindow MyWin = new wxWindow();
          -  MyWin.CenterOnParent(wxVERTICAL);
          +wxWindow:centerOnParent. The following C++ code:

            wxWindow MyWin = new wxWindow();
          +  MyWin.CenterOnParent(wxVERTICAL);
             ...
          -  delete MyWin;

          would in erlang look like:

            MyWin = wxWindow:new(),
          -  wxWindow:centerOnParent(MyWin, [{dir,?wxVERTICAL}]),
          +  delete MyWin;

          would in erlang look like:

            MyWin = wxWindow:new(),
          +  wxWindow:centerOnParent(MyWin, [{dir,?wxVERTICAL}]),
             ...
          -  wxWindow:destroy(MyWin),

          When you are reading wxWidgets documentation or the examples, you will notice + wxWindow:destroy(MyWin),

          When you are reading wxWidgets documentation or the examples, you will notice that some of the most basic classes are missing in wx, they are directly mapped to corresponding erlang terms:

          • wxPoint is represented by {Xcoord,Ycoord}

          • wxSize is represented by {Width,Height}

          • wxRect is represented by {Xcoord,Ycoord,Width,Height}

          • wxColour is represented by {Red,Green,Blue[,Alpha]}

          • wxString is represented by unicode:charlist()

          • wxGBPosition is represented by {Row,Column}

          • wxGBSpan is represented by {RowSpan,ColumnSPan}

          • wxGridCellCoords is represented by {Row,Column}

          In the places where the erlang API differs from the original one it should be @@ -195,14 +195,14 @@ from several processes in your application, you must share the environment. You can get the active environment with wx:get_env/0 and set it in the new processes with wx:set_env/1. Two processes or applications which have both -called wx:new() will not be able use each others objects.

            wx:new(),
          -  MyWin = wxFrame:new(wx:null(), 42, "Example", []),
          -  Env = wx:get_env(),
          -  spawn(fun() ->
          -           wx:set_env(Env),
          +called wx:new() will not be able use each others objects.

            wx:new(),
          +  MyWin = wxFrame:new(wx:null(), 42, "Example", []),
          +  Env = wx:get_env(),
          +  spawn(fun() ->
          +           wx:set_env(Env),
                      %% Here you can do wx calls from your helper process.
                      ...
          -        end),
          +        end),
             ...

          When wx:destroy/0 is invoked or when all processes in the application have died, the memory is deleted and all windows created by that application are closed.

          The wx application never cleans or garbage collects memory as long as the user @@ -308,7 +308,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/gl.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/gl.html 2026-06-04 19:05:22.616637452 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/gl.html 2026-06-04 19:05:22.617637462 +0000 @@ -41049,7 +41049,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/glu.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (595)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/glu.html 2026-06-04 19:05:22.653637796 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/glu.html 2026-06-04 19:05:22.652637787 +0000 @@ -1821,7 +1821,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/notes.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (804)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/notes.html 2026-06-04 19:05:22.678638028 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/notes.html 2026-06-04 19:05:22.680638046 +0000 @@ -1082,7 +1082,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/search.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/search.html 2026-06-04 19:05:22.699790655 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/search.html 2026-06-04 19:05:22.700441091 +0000 @@ -145,7 +145,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wx.epub/OEBPS/chapter.xhtml differs (HTML document, ASCII text, with very long lines (839)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wx.epub/OEBPS/chapter.xhtml 2026-06-04 00:08:19.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wx.epub/OEBPS/chapter.xhtml 2042-07-06 13:27:44.000000000 +0000 @@ -56,13 +56,13 @@ is the object reference. Optional arguments are last and expressed as tagged tuples in any order.

          For example the wxWindow C++ class is implemented in the wxWindow erlang module and the member wxWindow::CenterOnParent is thus -wxWindow:centerOnParent. The following C++ code:

            wxWindow MyWin = new wxWindow();
          -  MyWin.CenterOnParent(wxVERTICAL);
          +wxWindow:centerOnParent. The following C++ code:

            wxWindow MyWin = new wxWindow();
          +  MyWin.CenterOnParent(wxVERTICAL);
             ...
          -  delete MyWin;

          would in erlang look like:

            MyWin = wxWindow:new(),
          -  wxWindow:centerOnParent(MyWin, [{dir,?wxVERTICAL}]),
          +  delete MyWin;

          would in erlang look like:

            MyWin = wxWindow:new(),
          +  wxWindow:centerOnParent(MyWin, [{dir,?wxVERTICAL}]),
             ...
          -  wxWindow:destroy(MyWin),

          When you are reading wxWidgets documentation or the examples, you will notice + wxWindow:destroy(MyWin),

          When you are reading wxWidgets documentation or the examples, you will notice that some of the most basic classes are missing in wx, they are directly mapped to corresponding erlang terms:

          • wxPoint is represented by {Xcoord,Ycoord}

          • wxSize is represented by {Width,Height}

          • wxRect is represented by {Xcoord,Ycoord,Width,Height}

          • wxColour is represented by {Red,Green,Blue[,Alpha]}

          • wxString is represented by unicode:charlist()

          • wxGBPosition is represented by {Row,Column}

          • wxGBSpan is represented by {RowSpan,ColumnSPan}

          • wxGridCellCoords is represented by {Row,Column}

          In the places where the erlang API differs from the original one it should be @@ -90,14 +90,14 @@ from several processes in your application, you must share the environment. You can get the active environment with wx:get_env/0 and set it in the new processes with wx:set_env/1. Two processes or applications which have both -called wx:new() will not be able use each others objects.

            wx:new(),
          -  MyWin = wxFrame:new(wx:null(), 42, "Example", []),
          -  Env = wx:get_env(),
          -  spawn(fun() ->
          -           wx:set_env(Env),
          +called wx:new() will not be able use each others objects.

            wx:new(),
          +  MyWin = wxFrame:new(wx:null(), 42, "Example", []),
          +  Env = wx:get_env(),
          +  spawn(fun() ->
          +           wx:set_env(Env),
                      %% Here you can do wx calls from your helper process.
                      ...
          -        end),
          +        end),
             ...

          When wx:destroy/0 is invoked or when all processes in the application have died, the memory is deleted and all windows created by that application are closed.

          The wx application never cleans or garbage collects memory as long as the user /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wx.epub/OEBPS/content.opf differs (XML 1.0 document, ASCII text) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wx.epub/OEBPS/content.opf 2026-06-04 00:08:19.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wx.epub/OEBPS/content.opf 2042-07-06 13:27:44.000000000 +0000 @@ -4,10 +4,10 @@ version="3.0"> wx - 2.4.3 - urn:uuid:9764c95c-5b9a-5fae-22fe-8b439aafb976 + urn:uuid:206c37f1-0920-bc4c-fac6-2825b720f740 en - 2026-06-04T00:08:18Z + 2042-07-06T13:27:44Z /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wx.epub/OEBPS/wx_object.xhtml differs (HTML document, ASCII text, with very long lines (722)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wx.epub/OEBPS/wx_object.xhtml 2026-06-04 00:08:19.000000000 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wx.epub/OEBPS/wx_object.xhtml 2042-07-06 13:27:44.000000000 +0000 @@ -31,36 +31,36 @@ shutdown | Term, terminate(State) is called. It lets the user module clean up, it is always called when server terminates or when wx_object() in the driver is deleted. If the Parent process terminates the Module:terminate/2 function is -called.
          terminate(Reason, State)

          Example:

            -module(myDialog).
          -  -export([new/2, show/1, destroy/1]).  %% API
          -  -export([init/1, handle_call/3, handle_event/2,
          -           handle_info/2, code_change/3, terminate/2]).
          +called.
          terminate(Reason, State)

          Example:

            -module(myDialog).
          +  -export([new/2, show/1, destroy/1]).  %% API
          +  -export([init/1, handle_call/3, handle_event/2,
          +           handle_info/2, code_change/3, terminate/2]).
                      new/2, showModal/1, destroy/1]).  %% Callbacks
           
             %% Client API
          -  new(Parent, Msg) ->
          -     wx_object:start(?MODULE, [Parent,Id], []).
          +  new(Parent, Msg) ->
          +     wx_object:start(?MODULE, [Parent,Id], []).
           
          -  show(Dialog) ->
          -     wx_object:call(Dialog, show_modal).
          +  show(Dialog) ->
          +     wx_object:call(Dialog, show_modal).
           
          -  destroy(Dialog) ->
          -     wx_object:call(Dialog, destroy).
          +  destroy(Dialog) ->
          +     wx_object:call(Dialog, destroy).
           
             %% Server Implementation ala gen_server
          -  init([Parent, Str]) ->
          -     Dialog = wxDialog:new(Parent, 42, "Testing", []),
          +  init([Parent, Str]) ->
          +     Dialog = wxDialog:new(Parent, 42, "Testing", []),
                ...
          -     wxDialog:connect(Dialog, command_button_clicked),
          -     {Dialog, MyState}.
          +     wxDialog:connect(Dialog, command_button_clicked),
          +     {Dialog, MyState}.
           
          -  handle_call(show, _From, State) ->
          -     wxDialog:show(State#state.win),
          -     {reply, ok, State};
          +  handle_call(show, _From, State) ->
          +     wxDialog:show(State#state.win),
          +     {reply, ok, State};
             ...
          -  handle_event(#wx{}, State) ->
          -     io:format("Users clicked button~n",[]),
          -     {noreply, State};
          +  handle_event(#wx{}, State) ->
          +     io:format("Users clicked button~n",[]),
          +     {noreply, State};
             ...

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wx.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (497)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wx.html 2026-06-04 19:05:23.244643278 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wx.html 2026-06-04 19:05:23.244643278 +0000 @@ -1457,7 +1457,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAcceleratorEntry.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (521)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAcceleratorEntry.html 2026-06-04 19:05:23.266643482 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAcceleratorEntry.html 2026-06-04 19:05:23.266643482 +0000 @@ -560,7 +560,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAcceleratorTable.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (506)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAcceleratorTable.html 2026-06-04 19:05:23.285643658 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAcceleratorTable.html 2026-06-04 19:05:23.285643658 +0000 @@ -433,7 +433,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxActivateEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (497)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxActivateEvent.html 2026-06-04 19:05:23.302643816 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxActivateEvent.html 2026-06-04 19:05:23.303643825 +0000 @@ -354,7 +354,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxArtProvider.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (762)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxArtProvider.html 2026-06-04 19:05:23.323644011 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxArtProvider.html 2026-06-04 19:05:23.323644011 +0000 @@ -420,7 +420,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiDockArt.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (503)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiDockArt.html 2026-06-04 19:05:23.343644196 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiDockArt.html 2026-06-04 19:05:23.343644196 +0000 @@ -473,7 +473,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiManager.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (790)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiManager.html 2026-06-04 19:05:23.370644447 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiManager.html 2026-06-04 19:05:23.371644456 +0000 @@ -1473,7 +1473,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiManagerEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (739)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiManagerEvent.html 2026-06-04 19:05:23.393644660 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiManagerEvent.html 2026-06-04 19:05:23.393644660 +0000 @@ -820,7 +820,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiNotebook.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1744)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiNotebook.html 2026-06-04 19:05:23.419644901 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiNotebook.html 2026-06-04 19:05:23.418644892 +0000 @@ -1429,7 +1429,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiNotebookEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (918)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiNotebookEvent.html 2026-06-04 19:05:23.437645068 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiNotebookEvent.html 2026-06-04 19:05:23.437645068 +0000 @@ -559,7 +559,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiPaneInfo.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (452)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiPaneInfo.html 2026-06-04 19:05:23.477645439 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiPaneInfo.html 2026-06-04 19:05:23.478645449 +0000 @@ -4097,7 +4097,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiSimpleTabArt.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (321)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiSimpleTabArt.html 2026-06-04 19:05:23.495645606 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiSimpleTabArt.html 2026-06-04 19:05:23.495645606 +0000 @@ -316,7 +316,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiTabArt.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (503)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiTabArt.html 2026-06-04 19:05:23.516645801 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxAuiTabArt.html 2026-06-04 19:05:23.512645764 +0000 @@ -469,7 +469,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBitmap.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (872)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBitmap.html 2026-06-04 19:05:23.541646033 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBitmap.html 2026-06-04 19:05:23.541646033 +0000 @@ -1379,7 +1379,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBitmapButton.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (691)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBitmapButton.html 2026-06-04 19:05:23.561646219 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBitmapButton.html 2026-06-04 19:05:23.561646219 +0000 @@ -551,7 +551,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBitmapDataObject.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (952)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBitmapDataObject.html 2026-06-04 19:05:23.580646395 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBitmapDataObject.html 2026-06-04 19:05:23.580646395 +0000 @@ -434,7 +434,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBookCtrlBase.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (954)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBookCtrlBase.html 2026-06-04 19:05:23.602646599 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBookCtrlBase.html 2026-06-04 19:05:23.602646599 +0000 @@ -958,7 +958,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBookCtrlEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1068)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBookCtrlEvent.html 2026-06-04 19:05:23.621646775 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBookCtrlEvent.html 2026-06-04 19:05:23.621646775 +0000 @@ -477,7 +477,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBoxSizer.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (594)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBoxSizer.html 2026-06-04 19:05:23.639646942 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBoxSizer.html 2026-06-04 19:05:23.639646942 +0000 @@ -354,7 +354,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBrush.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (764)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBrush.html 2026-06-04 19:05:23.658647119 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBrush.html 2026-06-04 19:05:23.658647119 +0000 @@ -748,7 +748,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBufferedDC.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (653)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBufferedDC.html 2026-06-04 19:05:23.678647304 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBufferedDC.html 2026-06-04 19:05:23.677647295 +0000 @@ -571,7 +571,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBufferedPaintDC.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (936)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBufferedPaintDC.html 2026-06-04 19:05:23.696647471 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxBufferedPaintDC.html 2026-06-04 19:05:23.696647471 +0000 @@ -408,7 +408,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxButton.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (610)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxButton.html 2026-06-04 19:05:23.718647675 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxButton.html 2026-06-04 19:05:23.718647675 +0000 @@ -929,7 +929,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCalendarCtrl.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (904)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCalendarCtrl.html 2026-06-04 19:05:23.742647898 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCalendarCtrl.html 2026-06-04 19:05:23.743647907 +0000 @@ -1402,7 +1402,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCalendarDateAttr.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (465)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCalendarDateAttr.html 2026-06-04 19:05:23.764648102 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCalendarDateAttr.html 2026-06-04 19:05:23.764648102 +0000 @@ -1046,7 +1046,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCalendarEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (717)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCalendarEvent.html 2026-06-04 19:05:23.782648269 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCalendarEvent.html 2026-06-04 19:05:23.782648269 +0000 @@ -393,7 +393,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCaret.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (341)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCaret.html 2026-06-04 19:05:23.805648482 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCaret.html 2026-06-04 19:05:23.805648482 +0000 @@ -986,7 +986,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCheckBox.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (802)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCheckBox.html 2026-06-04 19:05:23.825648667 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCheckBox.html 2026-06-04 19:05:23.825648667 +0000 @@ -777,7 +777,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCheckListBox.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1107)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCheckListBox.html 2026-06-04 19:05:23.844648844 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCheckListBox.html 2026-06-04 19:05:23.844648844 +0000 @@ -522,7 +522,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxChildFocusEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (561)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxChildFocusEvent.html 2026-06-04 19:05:23.863649020 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxChildFocusEvent.html 2026-06-04 19:05:23.863649020 +0000 @@ -359,7 +359,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxChoice.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (948)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxChoice.html 2026-06-04 19:05:23.882649196 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxChoice.html 2026-06-04 19:05:23.882649196 +0000 @@ -662,7 +662,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxChoicebook.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1199)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxChoicebook.html 2026-06-04 19:05:23.906649419 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxChoicebook.html 2026-06-04 19:05:23.906649419 +0000 @@ -1370,7 +1370,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxClientDC.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (774)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxClientDC.html 2026-06-04 19:05:23.925649595 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxClientDC.html 2026-06-04 19:05:23.926649605 +0000 @@ -323,7 +323,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxClipboard.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (494)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxClipboard.html 2026-06-04 19:05:23.947649799 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxClipboard.html 2026-06-04 19:05:23.947649799 +0000 @@ -801,7 +801,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxClipboardTextEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (620)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxClipboardTextEvent.html 2026-06-04 19:05:23.965649966 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxClipboardTextEvent.html 2026-06-04 19:05:23.965649966 +0000 @@ -306,7 +306,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCloseEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (557)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCloseEvent.html 2026-06-04 19:05:23.983650133 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCloseEvent.html 2026-06-04 19:05:23.983650133 +0000 @@ -562,7 +562,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxColourData.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (455)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxColourData.html 2026-06-04 19:05:24.002650309 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxColourData.html 2026-06-04 19:05:24.001650300 +0000 @@ -548,7 +548,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxColourDialog.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (926)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxColourDialog.html 2026-06-04 19:05:24.020650476 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxColourDialog.html 2026-06-04 19:05:24.021650486 +0000 @@ -517,7 +517,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxColourPickerCtrl.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (809)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxColourPickerCtrl.html 2026-06-04 19:05:24.041650671 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxColourPickerCtrl.html 2026-06-04 19:05:24.041650671 +0000 @@ -583,7 +583,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxColourPickerEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (645)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxColourPickerEvent.html 2026-06-04 19:05:24.058650829 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxColourPickerEvent.html 2026-06-04 19:05:24.058650829 +0000 @@ -356,7 +356,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxComboBox.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1013)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxComboBox.html 2026-06-04 19:05:24.081651042 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxComboBox.html 2026-06-04 19:05:24.081651042 +0000 @@ -1302,7 +1302,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCommandEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (553)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCommandEvent.html 2026-06-04 19:05:24.100651219 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCommandEvent.html 2026-06-04 19:05:24.100651219 +0000 @@ -692,7 +692,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxContextMenuEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (708)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxContextMenuEvent.html 2026-06-04 19:05:24.118651385 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxContextMenuEvent.html 2026-06-04 19:05:24.118651385 +0000 @@ -405,7 +405,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxControl.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (402)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxControl.html 2026-06-04 19:05:24.136651552 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxControl.html 2026-06-04 19:05:24.136651552 +0000 @@ -328,7 +328,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxControlWithItems.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (651)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxControlWithItems.html 2026-06-04 19:05:24.158651756 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxControlWithItems.html 2026-06-04 19:05:24.158651756 +0000 @@ -1173,7 +1173,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCursor.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (888)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCursor.html 2026-06-04 19:05:24.174651905 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxCursor.html 2026-06-04 19:05:24.174651905 +0000 @@ -481,7 +481,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDC.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1054)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDC.html 2026-06-04 19:05:24.217652304 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDC.html 2026-06-04 19:05:24.217652304 +0000 @@ -4056,7 +4056,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDCOverlay.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (323)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDCOverlay.html 2026-06-04 19:05:24.235652471 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDCOverlay.html 2026-06-04 19:05:24.236652480 +0000 @@ -399,7 +399,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDataObject.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (647)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDataObject.html 2026-06-04 19:05:24.253652638 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDataObject.html 2026-06-04 19:05:24.253652638 +0000 @@ -258,7 +258,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDateEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (630)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDateEvent.html 2026-06-04 19:05:24.272652814 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDateEvent.html 2026-06-04 19:05:24.272652814 +0000 @@ -348,7 +348,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDatePickerCtrl.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (792)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDatePickerCtrl.html 2026-06-04 19:05:24.291652990 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDatePickerCtrl.html 2026-06-04 19:05:24.291652990 +0000 @@ -592,7 +592,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDialog.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (825)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDialog.html 2026-06-04 19:05:24.315653213 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDialog.html 2026-06-04 19:05:24.315653213 +0000 @@ -961,7 +961,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDirDialog.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (749)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDirDialog.html 2026-06-04 19:05:24.334653389 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDirDialog.html 2026-06-04 19:05:24.334653389 +0000 @@ -535,7 +535,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDirPickerCtrl.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (858)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDirPickerCtrl.html 2026-06-04 19:05:24.354653575 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDirPickerCtrl.html 2026-06-04 19:05:24.354653575 +0000 @@ -591,7 +591,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDisplay.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (438)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDisplay.html 2026-06-04 19:05:24.373653751 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDisplay.html 2026-06-04 19:05:24.373653751 +0000 @@ -705,7 +705,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDisplayChangedEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (457)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDisplayChangedEvent.html 2026-06-04 19:05:24.393653936 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDisplayChangedEvent.html 2026-06-04 19:05:24.393653936 +0000 @@ -299,7 +299,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDropFilesEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (569)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDropFilesEvent.html 2026-06-04 19:05:24.412654113 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxDropFilesEvent.html 2026-06-04 19:05:24.413654122 +0000 @@ -436,7 +436,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxEraseEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (417)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxEraseEvent.html 2026-06-04 19:05:24.434654317 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxEraseEvent.html 2026-06-04 19:05:24.433654307 +0000 @@ -358,7 +358,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (405)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxEvent.html 2026-06-04 19:05:24.452654484 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxEvent.html 2026-06-04 19:05:24.453654493 +0000 @@ -599,7 +599,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxEvtHandler.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (439)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxEvtHandler.html 2026-06-04 19:05:24.471654660 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxEvtHandler.html 2026-06-04 19:05:24.471654660 +0000 @@ -666,7 +666,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFileDataObject.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (675)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFileDataObject.html 2026-06-04 19:05:24.488654818 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFileDataObject.html 2026-06-04 19:05:24.488654818 +0000 @@ -393,7 +393,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFileDialog.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (943)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFileDialog.html 2026-06-04 19:05:24.509655012 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFileDialog.html 2026-06-04 19:05:24.509655012 +0000 @@ -942,7 +942,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFileDirPickerEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (844)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFileDirPickerEvent.html 2026-06-04 19:05:24.526655170 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFileDirPickerEvent.html 2026-06-04 19:05:24.526655170 +0000 @@ -356,7 +356,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFilePickerCtrl.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (862)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFilePickerCtrl.html 2026-06-04 19:05:24.546655356 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFilePickerCtrl.html 2026-06-04 19:05:24.546655356 +0000 @@ -594,7 +594,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFindReplaceData.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFindReplaceData.html 2026-06-04 19:05:24.564655523 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFindReplaceData.html 2026-06-04 19:05:24.564655523 +0000 @@ -584,7 +584,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFindReplaceDialog.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (662)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFindReplaceDialog.html 2026-06-04 19:05:24.584655708 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFindReplaceDialog.html 2026-06-04 19:05:24.584655708 +0000 @@ -528,7 +528,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFlexGridSizer.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (738)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFlexGridSizer.html 2026-06-04 19:05:24.606655912 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFlexGridSizer.html 2026-06-04 19:05:24.606655912 +0000 @@ -851,7 +851,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFocusEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (521)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFocusEvent.html 2026-06-04 19:05:24.624656079 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFocusEvent.html 2026-06-04 19:05:24.624656079 +0000 @@ -364,7 +364,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFont.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (723)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFont.html 2026-06-04 19:05:24.646656283 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFont.html 2026-06-04 19:05:24.646656283 +0000 @@ -1211,7 +1211,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFontData.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (467)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFontData.html 2026-06-04 19:05:24.665656460 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFontData.html 2026-06-04 19:05:24.664656450 +0000 @@ -849,7 +849,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFontDialog.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (818)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFontDialog.html 2026-06-04 19:05:24.682656617 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFontDialog.html 2026-06-04 19:05:24.683656626 +0000 @@ -436,7 +436,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFontPickerCtrl.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (793)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFontPickerCtrl.html 2026-06-04 19:05:24.702656803 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFontPickerCtrl.html 2026-06-04 19:05:24.702656803 +0000 @@ -663,7 +663,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFontPickerEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (633)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFontPickerEvent.html 2026-06-04 19:05:24.719656960 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFontPickerEvent.html 2026-06-04 19:05:24.719656960 +0000 @@ -355,7 +355,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFrame.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (885)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFrame.html 2026-06-04 19:05:24.743657183 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxFrame.html 2026-06-04 19:05:24.743657183 +0000 @@ -1290,7 +1290,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGBSizerItem.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGBSizerItem.html 2026-06-04 19:05:24.762657359 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGBSizerItem.html 2026-06-04 19:05:24.762657359 +0000 @@ -224,7 +224,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGCDC.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (454)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGCDC.html 2026-06-04 19:05:24.781657536 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGCDC.html 2026-06-04 19:05:24.781657536 +0000 @@ -444,7 +444,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGLCanvas.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (468)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGLCanvas.html 2026-06-04 19:05:24.802657730 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGLCanvas.html 2026-06-04 19:05:24.802657730 +0000 @@ -544,7 +544,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGLContext.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (307)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGLContext.html 2026-06-04 19:05:24.821657907 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGLContext.html 2026-06-04 19:05:24.821657907 +0000 @@ -457,7 +457,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGauge.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (655)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGauge.html 2026-06-04 19:05:24.841658092 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGauge.html 2026-06-04 19:05:24.841658092 +0000 @@ -738,7 +738,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGenericDirCtrl.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (745)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGenericDirCtrl.html 2026-06-04 19:05:24.862658287 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGenericDirCtrl.html 2026-06-04 19:05:24.863658296 +0000 @@ -1112,7 +1112,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsBrush.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (498)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsBrush.html 2026-06-04 19:05:24.881658463 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsBrush.html 2026-06-04 19:05:24.880658454 +0000 @@ -222,7 +222,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsContext.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (624)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsContext.html 2026-06-04 19:05:24.911658741 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsContext.html 2026-06-04 19:05:24.910658732 +0000 @@ -2219,7 +2219,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsFont.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (494)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsFont.html 2026-06-04 19:05:24.930658918 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsFont.html 2026-06-04 19:05:24.930658918 +0000 @@ -222,7 +222,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsGradientStops.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (375)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsGradientStops.html 2026-06-04 19:05:24.949659094 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsGradientStops.html 2026-06-04 19:05:24.948659085 +0000 @@ -624,7 +624,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsMatrix.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (502)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsMatrix.html 2026-06-04 19:05:24.970659289 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsMatrix.html 2026-06-04 19:05:24.970659289 +0000 @@ -716,7 +716,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsObject.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (649)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsObject.html 2026-06-04 19:05:24.988659456 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsObject.html 2026-06-04 19:05:24.988659456 +0000 @@ -354,7 +354,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsPath.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (496)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsPath.html 2026-06-04 19:05:25.011659669 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsPath.html 2026-06-04 19:05:25.011659669 +0000 @@ -1174,7 +1174,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsPen.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (465)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsPen.html 2026-06-04 19:05:25.028659827 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsPen.html 2026-06-04 19:05:25.028659827 +0000 @@ -222,7 +222,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsRenderer.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (318)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsRenderer.html 2026-06-04 19:05:25.050660031 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGraphicsRenderer.html 2026-06-04 19:05:25.050660031 +0000 @@ -709,7 +709,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGrid.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (869)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGrid.html 2026-06-04 19:05:25.118660662 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGrid.html 2026-06-04 19:05:25.118660662 +0000 @@ -8449,7 +8449,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridBagSizer.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (463)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridBagSizer.html 2026-06-04 19:05:25.145660912 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridBagSizer.html 2026-06-04 19:05:25.145660912 +0000 @@ -1164,7 +1164,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellAttr.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (356)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellAttr.html 2026-06-04 19:05:25.167661116 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellAttr.html 2026-06-04 19:05:25.167661116 +0000 @@ -1095,7 +1095,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellBoolEditor.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (862)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellBoolEditor.html 2026-06-04 19:05:25.183661265 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellBoolEditor.html 2026-06-04 19:05:25.183661265 +0000 @@ -436,7 +436,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellBoolRenderer.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (804)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellBoolRenderer.html 2026-06-04 19:05:25.200661422 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellBoolRenderer.html 2026-06-04 19:05:25.200661422 +0000 @@ -314,7 +314,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellChoiceEditor.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (912)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellChoiceEditor.html 2026-06-04 19:05:25.218661589 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellChoiceEditor.html 2026-06-04 19:05:25.218661589 +0000 @@ -393,7 +393,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellEditor.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (790)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellEditor.html 2026-06-04 19:05:25.236661756 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellEditor.html 2026-06-04 19:05:25.236661756 +0000 @@ -603,7 +603,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellFloatEditor.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (871)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellFloatEditor.html 2026-06-04 19:05:25.253661914 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellFloatEditor.html 2026-06-04 19:05:25.254661923 +0000 @@ -394,7 +394,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellFloatRenderer.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (930)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellFloatRenderer.html 2026-06-04 19:05:25.272662090 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellFloatRenderer.html 2026-06-04 19:05:25.272662090 +0000 @@ -546,7 +546,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellNumberEditor.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (981)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellNumberEditor.html 2026-06-04 19:05:25.290662257 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellNumberEditor.html 2026-06-04 19:05:25.290662257 +0000 @@ -430,7 +430,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellNumberRenderer.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (923)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellNumberRenderer.html 2026-06-04 19:05:25.309662434 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellNumberRenderer.html 2026-06-04 19:05:25.310662443 +0000 @@ -314,7 +314,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellRenderer.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (659)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellRenderer.html 2026-06-04 19:05:25.332662647 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellRenderer.html 2026-06-04 19:05:25.328662610 +0000 @@ -339,7 +339,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellStringRenderer.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (751)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellStringRenderer.html 2026-06-04 19:05:25.348662795 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellStringRenderer.html 2026-06-04 19:05:25.348662795 +0000 @@ -315,7 +315,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellTextEditor.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (866)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellTextEditor.html 2026-06-04 19:05:25.366662962 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridCellTextEditor.html 2026-06-04 19:05:25.366662962 +0000 @@ -391,7 +391,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (517)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridEvent.html 2026-06-04 19:05:25.383663120 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridEvent.html 2026-06-04 19:05:25.385663139 +0000 @@ -643,7 +643,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridSizer.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (478)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridSizer.html 2026-06-04 19:05:25.404663315 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxGridSizer.html 2026-06-04 19:05:25.404663315 +0000 @@ -743,7 +743,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxHelpEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (577)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxHelpEvent.html 2026-06-04 19:05:25.423663491 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxHelpEvent.html 2026-06-04 19:05:25.423663491 +0000 @@ -477,7 +477,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxHtmlEasyPrinting.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (407)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxHtmlEasyPrinting.html 2026-06-04 19:05:25.444663686 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxHtmlEasyPrinting.html 2026-06-04 19:05:25.444663686 +0000 @@ -960,7 +960,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxHtmlLinkEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (529)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxHtmlLinkEvent.html 2026-06-04 19:05:25.461663844 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxHtmlLinkEvent.html 2026-06-04 19:05:25.461663844 +0000 @@ -357,7 +357,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxHtmlWindow.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (841)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxHtmlWindow.html 2026-06-04 19:05:25.483664048 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxHtmlWindow.html 2026-06-04 19:05:25.484664057 +0000 @@ -1361,7 +1361,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxIcon.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (831)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxIcon.html 2026-06-04 19:05:25.502664224 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxIcon.html 2026-06-04 19:05:25.502664224 +0000 @@ -446,7 +446,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxIconBundle.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (449)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxIconBundle.html 2026-06-04 19:05:25.520664391 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxIconBundle.html 2026-06-04 19:05:25.520664391 +0000 @@ -600,7 +600,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxIconizeEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (740)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxIconizeEvent.html 2026-06-04 19:05:25.538664558 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxIconizeEvent.html 2026-06-04 19:05:25.538664558 +0000 @@ -354,7 +354,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxIdleEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (546)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxIdleEvent.html 2026-06-04 19:05:25.556664725 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxIdleEvent.html 2026-06-04 19:05:25.556664725 +0000 @@ -541,7 +541,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxImage.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1486)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxImage.html 2026-06-04 19:05:25.598665114 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxImage.html 2026-06-04 19:05:25.598665114 +0000 @@ -3859,7 +3859,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxImageList.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (591)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxImageList.html 2026-06-04 19:05:25.620665318 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxImageList.html 2026-06-04 19:05:25.621665328 +0000 @@ -973,7 +973,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxInitDialogEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (744)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxInitDialogEvent.html 2026-06-04 19:05:25.639665495 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxInitDialogEvent.html 2026-06-04 19:05:25.639665495 +0000 @@ -298,7 +298,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxJoystickEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (341)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxJoystickEvent.html 2026-06-04 19:05:25.660665689 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxJoystickEvent.html 2026-06-04 19:05:25.661665699 +0000 @@ -861,7 +861,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxKeyEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (573)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxKeyEvent.html 2026-06-04 19:05:25.686665931 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxKeyEvent.html 2026-06-04 19:05:25.684665912 +0000 @@ -935,7 +935,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxLayoutAlgorithm.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (455)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxLayoutAlgorithm.html 2026-06-04 19:05:25.707666125 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxLayoutAlgorithm.html 2026-06-04 19:05:25.707666125 +0000 @@ -599,7 +599,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxListBox.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1003)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxListBox.html 2026-06-04 19:05:25.728666320 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxListBox.html 2026-06-04 19:05:25.728666320 +0000 @@ -827,7 +827,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxListCtrl.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (2068)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxListCtrl.html 2026-06-04 19:05:25.765666664 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxListCtrl.html 2026-06-04 19:05:25.765666664 +0000 @@ -3262,7 +3262,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxListEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (701)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxListEvent.html 2026-06-04 19:05:25.786666858 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxListEvent.html 2026-06-04 19:05:25.786666858 +0000 @@ -837,7 +837,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxListItem.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1143)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxListItem.html 2026-06-04 19:05:25.810667081 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxListItem.html 2026-06-04 19:05:25.810667081 +0000 @@ -1272,7 +1272,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxListItemAttr.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxListItemAttr.html 2026-06-04 19:05:25.829667257 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxListItemAttr.html 2026-06-04 19:05:25.829667257 +0000 @@ -695,7 +695,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxListView.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (559)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxListView.html 2026-06-04 19:05:25.849667443 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxListView.html 2026-06-04 19:05:25.849667443 +0000 @@ -589,7 +589,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxListbook.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1091)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxListbook.html 2026-06-04 19:05:25.874667675 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxListbook.html 2026-06-04 19:05:25.875667684 +0000 @@ -1369,7 +1369,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxLocale.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (530)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxLocale.html 2026-06-04 19:05:25.899667906 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxLocale.html 2026-06-04 19:05:25.900667916 +0000 @@ -1371,7 +1371,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxLogNull.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxLogNull.html 2026-06-04 19:05:25.918668083 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxLogNull.html 2026-06-04 19:05:25.918668083 +0000 @@ -317,7 +317,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMDIChildFrame.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (917)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMDIChildFrame.html 2026-06-04 19:05:25.939668278 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMDIChildFrame.html 2026-06-04 19:05:25.939668278 +0000 @@ -660,7 +660,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMDIClientWindow.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (722)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMDIClientWindow.html 2026-06-04 19:05:25.957668445 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMDIClientWindow.html 2026-06-04 19:05:25.958668454 +0000 @@ -405,7 +405,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMDIParentFrame.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (944)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMDIParentFrame.html 2026-06-04 19:05:25.977668630 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMDIParentFrame.html 2026-06-04 19:05:25.978668639 +0000 @@ -828,7 +828,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMask.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (391)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMask.html 2026-06-04 19:05:25.996668806 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMask.html 2026-06-04 19:05:25.996668806 +0000 @@ -474,7 +474,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMaximizeEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (694)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMaximizeEvent.html 2026-06-04 19:05:26.012668955 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMaximizeEvent.html 2026-06-04 19:05:26.012668955 +0000 @@ -301,7 +301,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMemoryDC.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (573)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMemoryDC.html 2026-06-04 19:05:26.028669103 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMemoryDC.html 2026-06-04 19:05:26.032669140 +0000 @@ -447,7 +447,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMenu.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (885)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMenu.html 2026-06-04 19:05:26.067669465 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMenu.html 2026-06-04 19:05:26.068669474 +0000 @@ -2244,7 +2244,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMenuBar.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (586)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMenuBar.html 2026-06-04 19:05:26.094669715 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMenuBar.html 2026-06-04 19:05:26.094669715 +0000 @@ -1458,7 +1458,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMenuEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (623)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMenuEvent.html 2026-06-04 19:05:26.114669901 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMenuEvent.html 2026-06-04 19:05:26.114669901 +0000 @@ -444,7 +444,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMenuItem.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (4328)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMenuItem.html 2026-06-04 19:05:26.138670124 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMenuItem.html 2026-06-04 19:05:26.140670142 +0000 @@ -1431,7 +1431,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMessageDialog.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (664)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMessageDialog.html 2026-06-04 19:05:26.160670328 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMessageDialog.html 2026-06-04 19:05:26.163670355 +0000 @@ -397,7 +397,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMiniFrame.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (926)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMiniFrame.html 2026-06-04 19:05:26.182670532 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMiniFrame.html 2026-06-04 19:05:26.183670541 +0000 @@ -498,7 +498,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMirrorDC.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (364)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMirrorDC.html 2026-06-04 19:05:26.199670689 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMirrorDC.html 2026-06-04 19:05:26.200670699 +0000 @@ -317,7 +317,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMouseCaptureChangedEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (917)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMouseCaptureChangedEvent.html 2026-06-04 19:05:26.216670847 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMouseCaptureChangedEvent.html 2026-06-04 19:05:26.215670838 +0000 @@ -357,7 +357,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMouseCaptureLostEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1006)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMouseCaptureLostEvent.html 2026-06-04 19:05:26.231670986 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMouseCaptureLostEvent.html 2026-06-04 19:05:26.231670986 +0000 @@ -303,7 +303,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMouseEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (416)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMouseEvent.html 2026-06-04 19:05:26.257671227 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMouseEvent.html 2026-06-04 19:05:26.257671227 +0000 @@ -2082,7 +2082,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMoveEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (506)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMoveEvent.html 2026-06-04 19:05:26.277671413 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMoveEvent.html 2026-06-04 19:05:26.277671413 +0000 @@ -397,7 +397,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMultiChoiceDialog.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (953)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMultiChoiceDialog.html 2026-06-04 19:05:26.295671580 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxMultiChoiceDialog.html 2026-06-04 19:05:26.295671580 +0000 @@ -447,7 +447,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxNavigationKeyEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (469)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxNavigationKeyEvent.html 2026-06-04 19:05:26.314671756 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxNavigationKeyEvent.html 2026-06-04 19:05:26.314671756 +0000 @@ -630,7 +630,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxNotebook.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (981)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxNotebook.html 2026-06-04 19:05:26.335671951 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxNotebook.html 2026-06-04 19:05:26.336671960 +0000 @@ -855,7 +855,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxNotificationMessage.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (398)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxNotificationMessage.html 2026-06-04 19:05:26.356672146 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxNotificationMessage.html 2026-06-04 19:05:26.356672146 +0000 @@ -937,7 +937,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxNotifyEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (575)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxNotifyEvent.html 2026-06-04 19:05:26.376672331 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxNotifyEvent.html 2026-06-04 19:05:26.377672340 +0000 @@ -360,7 +360,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxOverlay.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (368)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxOverlay.html 2026-06-04 19:05:26.396672517 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxOverlay.html 2026-06-04 19:05:26.396672517 +0000 @@ -354,7 +354,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPageSetupDialog.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (583)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPageSetupDialog.html 2026-06-04 19:05:26.412672665 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPageSetupDialog.html 2026-06-04 19:05:26.412672665 +0000 @@ -439,7 +439,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPageSetupDialogData.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (524)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPageSetupDialogData.html 2026-06-04 19:05:26.436672888 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPageSetupDialogData.html 2026-06-04 19:05:26.436672888 +0000 @@ -1479,7 +1479,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPaintDC.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (774)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPaintDC.html 2026-06-04 19:05:26.455673064 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPaintDC.html 2026-06-04 19:05:26.453673045 +0000 @@ -320,7 +320,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPaintEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (434)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPaintEvent.html 2026-06-04 19:05:26.471673213 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPaintEvent.html 2026-06-04 19:05:26.471673213 +0000 @@ -307,7 +307,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPalette.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (502)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPalette.html 2026-06-04 19:05:26.492673407 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPalette.html 2026-06-04 19:05:26.493673417 +0000 @@ -631,7 +631,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPaletteChangedEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (310)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPaletteChangedEvent.html 2026-06-04 19:05:26.511673584 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPaletteChangedEvent.html 2026-06-04 19:05:26.511673584 +0000 @@ -386,7 +386,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPanel.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (548)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPanel.html 2026-06-04 19:05:26.531673769 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPanel.html 2026-06-04 19:05:26.531673769 +0000 @@ -487,7 +487,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPasswordEntryDialog.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (886)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPasswordEntryDialog.html 2026-06-04 19:05:26.547673918 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPasswordEntryDialog.html 2026-06-04 19:05:26.548673927 +0000 @@ -361,7 +361,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPen.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (769)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPen.html 2026-06-04 19:05:26.567674103 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPen.html 2026-06-04 19:05:26.569674122 +0000 @@ -862,7 +862,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPickerBase.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (623)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPickerBase.html 2026-06-04 19:05:26.589674307 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPickerBase.html 2026-06-04 19:05:26.589674307 +0000 @@ -788,7 +788,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPopupTransientWindow.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (671)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPopupTransientWindow.html 2026-06-04 19:05:26.608674483 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPopupTransientWindow.html 2026-06-04 19:05:26.608674483 +0000 @@ -509,7 +509,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPopupWindow.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (597)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPopupWindow.html 2026-06-04 19:05:26.627674660 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPopupWindow.html 2026-06-04 19:05:26.627674660 +0000 @@ -524,7 +524,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPostScriptDC.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (495)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPostScriptDC.html 2026-06-04 19:05:26.643674808 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPostScriptDC.html 2026-06-04 19:05:26.644674817 +0000 @@ -354,7 +354,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPreviewCanvas.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (838)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPreviewCanvas.html 2026-06-04 19:05:26.660674966 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPreviewCanvas.html 2026-06-04 19:05:26.660674966 +0000 @@ -221,7 +221,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPreviewControlBar.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (794)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPreviewControlBar.html 2026-06-04 19:05:26.678675133 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPreviewControlBar.html 2026-06-04 19:05:26.678675133 +0000 @@ -519,7 +519,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPreviewFrame.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (849)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPreviewFrame.html 2026-06-04 19:05:26.698675318 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPreviewFrame.html 2026-06-04 19:05:26.699675328 +0000 @@ -520,7 +520,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPrintData.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (926)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPrintData.html 2026-06-04 19:05:26.720675522 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPrintData.html 2026-06-04 19:05:26.721675532 +0000 @@ -1085,7 +1085,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPrintDialog.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (787)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPrintDialog.html 2026-06-04 19:05:26.738675689 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPrintDialog.html 2026-06-04 19:05:26.739675699 +0000 @@ -433,7 +433,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPrintDialogData.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (733)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPrintDialogData.html 2026-06-04 19:05:26.763675921 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPrintDialogData.html 2026-06-04 19:05:26.763675921 +0000 @@ -1270,7 +1270,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPrintPreview.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (807)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPrintPreview.html 2026-06-04 19:05:26.785676125 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPrintPreview.html 2026-06-04 19:05:26.785676125 +0000 @@ -1033,7 +1033,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPrinter.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (577)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPrinter.html 2026-06-04 19:05:26.805676311 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPrinter.html 2026-06-04 19:05:26.805676311 +0000 @@ -720,7 +720,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPrintout.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (634)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPrintout.html 2026-06-04 19:05:26.834676580 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxPrintout.html 2026-06-04 19:05:26.834676580 +0000 @@ -1233,7 +1233,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxProgressDialog.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (639)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxProgressDialog.html 2026-06-04 19:05:26.852676747 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxProgressDialog.html 2026-06-04 19:05:26.852676747 +0000 @@ -493,7 +493,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxQueryNewPaletteEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (314)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxQueryNewPaletteEvent.html 2026-06-04 19:05:26.868676895 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxQueryNewPaletteEvent.html 2026-06-04 19:05:26.868676895 +0000 @@ -388,7 +388,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxRadioBox.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1032)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxRadioBox.html 2026-06-04 19:05:26.889677090 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxRadioBox.html 2026-06-04 19:05:26.889677090 +0000 @@ -1133,7 +1133,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxRadioButton.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (791)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxRadioButton.html 2026-06-04 19:05:26.909677275 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxRadioButton.html 2026-06-04 19:05:26.909677275 +0000 @@ -590,7 +590,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxRegion.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (431)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxRegion.html 2026-06-04 19:05:26.934677508 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxRegion.html 2026-06-04 19:05:26.934677508 +0000 @@ -1205,7 +1205,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSashEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (775)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSashEvent.html 2026-06-04 19:05:26.953677684 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSashEvent.html 2026-06-04 19:05:26.953677684 +0000 @@ -447,7 +447,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSashLayoutWindow.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (800)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSashLayoutWindow.html 2026-06-04 19:05:26.972677860 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSashLayoutWindow.html 2026-06-04 19:05:26.972677860 +0000 @@ -688,7 +688,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSashWindow.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (981)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSashWindow.html 2026-06-04 19:05:26.994678064 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSashWindow.html 2026-06-04 19:05:26.994678064 +0000 @@ -793,7 +793,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxScreenDC.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (776)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxScreenDC.html 2026-06-04 19:05:27.013678240 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxScreenDC.html 2026-06-04 19:05:27.013678240 +0000 @@ -317,7 +317,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxScrollBar.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1696)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxScrollBar.html 2026-06-04 19:05:27.032678417 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxScrollBar.html 2026-06-04 19:05:27.033678426 +0000 @@ -805,7 +805,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxScrollEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (903)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxScrollEvent.html 2026-06-04 19:05:27.050678583 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxScrollEvent.html 2026-06-04 19:05:27.050678583 +0000 @@ -408,7 +408,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxScrollWinEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (548)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxScrollWinEvent.html 2026-06-04 19:05:27.068678751 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxScrollWinEvent.html 2026-06-04 19:05:27.068678751 +0000 @@ -399,7 +399,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxScrolledWindow.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (844)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxScrolledWindow.html 2026-06-04 19:05:27.091678964 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxScrolledWindow.html 2026-06-04 19:05:27.092678973 +0000 @@ -1079,7 +1079,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSetCursorEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (554)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSetCursorEvent.html 2026-06-04 19:05:27.111679149 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSetCursorEvent.html 2026-06-04 19:05:27.111679149 +0000 @@ -514,7 +514,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxShowEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (634)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxShowEvent.html 2026-06-04 19:05:27.128679307 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxShowEvent.html 2026-06-04 19:05:27.129679316 +0000 @@ -395,7 +395,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSingleChoiceDialog.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (953)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSingleChoiceDialog.html 2026-06-04 19:05:27.145679465 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSingleChoiceDialog.html 2026-06-04 19:05:27.145679465 +0000 @@ -486,7 +486,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSizeEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (517)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSizeEvent.html 2026-06-04 19:05:27.163679632 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSizeEvent.html 2026-06-04 19:05:27.163679632 +0000 @@ -404,7 +404,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSizer.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (388)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSizer.html 2026-06-04 19:05:27.195679929 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSizer.html 2026-06-04 19:05:27.195679929 +0000 @@ -2346,7 +2346,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSizerFlags.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (478)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSizerFlags.html 2026-06-04 19:05:27.217680133 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSizerFlags.html 2026-06-04 19:05:27.217680133 +0000 @@ -745,7 +745,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSizerItem.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (432)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSizerItem.html 2026-06-04 19:05:27.244680383 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSizerItem.html 2026-06-04 19:05:27.244680383 +0000 @@ -1691,7 +1691,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSlider.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1796)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSlider.html 2026-06-04 19:05:27.268680606 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSlider.html 2026-06-04 19:05:27.268680606 +0000 @@ -950,7 +950,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSpinButton.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (798)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSpinButton.html 2026-06-04 19:05:27.290680810 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSpinButton.html 2026-06-04 19:05:27.290680810 +0000 @@ -693,7 +693,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSpinCtrl.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (986)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSpinCtrl.html 2026-06-04 19:05:27.312681014 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSpinCtrl.html 2026-06-04 19:05:27.311681005 +0000 @@ -745,7 +745,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSpinEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (875)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSpinEvent.html 2026-06-04 19:05:27.329681172 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSpinEvent.html 2026-06-04 19:05:27.329681172 +0000 @@ -392,7 +392,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSplashScreen.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (658)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSplashScreen.html 2026-06-04 19:05:27.348681348 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSplashScreen.html 2026-06-04 19:05:27.348681348 +0000 @@ -447,7 +447,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSplitterEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (734)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSplitterEvent.html 2026-06-04 19:05:27.366681515 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSplitterEvent.html 2026-06-04 19:05:27.366681515 +0000 @@ -516,7 +516,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSplitterWindow.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (748)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSplitterWindow.html 2026-06-04 19:05:27.391681747 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSplitterWindow.html 2026-06-04 19:05:27.391681747 +0000 @@ -1355,7 +1355,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStaticBitmap.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (584)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStaticBitmap.html 2026-06-04 19:05:27.411681932 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStaticBitmap.html 2026-06-04 19:05:27.412681942 +0000 @@ -572,7 +572,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStaticBox.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (685)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStaticBox.html 2026-06-04 19:05:27.431682118 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStaticBox.html 2026-06-04 19:05:27.432682127 +0000 @@ -495,7 +495,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStaticBoxSizer.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (789)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStaticBoxSizer.html 2026-06-04 19:05:27.448682276 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStaticBoxSizer.html 2026-06-04 19:05:27.449682285 +0000 @@ -400,7 +400,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStaticLine.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (675)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStaticLine.html 2026-06-04 19:05:27.467682452 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStaticLine.html 2026-06-04 19:05:27.467682452 +0000 @@ -568,7 +568,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStaticText.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (740)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStaticText.html 2026-06-04 19:05:27.486682628 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStaticText.html 2026-06-04 19:05:27.486682628 +0000 @@ -631,7 +631,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStatusBar.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (638)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStatusBar.html 2026-06-04 19:05:27.509682841 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStatusBar.html 2026-06-04 19:05:27.509682841 +0000 @@ -1097,7 +1097,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStdDialogButtonSizer.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (698)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStdDialogButtonSizer.html 2026-06-04 19:05:27.529683027 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStdDialogButtonSizer.html 2026-06-04 19:05:27.530683036 +0000 @@ -517,7 +517,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStyledTextCtrl.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (524)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStyledTextCtrl.html 2026-06-04 19:05:27.646684112 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStyledTextCtrl.html 2026-06-04 19:05:27.646684112 +0000 @@ -17656,7 +17656,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStyledTextEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1362)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStyledTextEvent.html 2026-06-04 19:05:27.674684372 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxStyledTextEvent.html 2026-06-04 19:05:27.673684363 +0000 @@ -1228,7 +1228,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSysColourChangedEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (452)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSysColourChangedEvent.html 2026-06-04 19:05:27.692684539 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSysColourChangedEvent.html 2026-06-04 19:05:27.692684539 +0000 @@ -303,7 +303,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSystemOptions.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (439)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSystemOptions.html 2026-06-04 19:05:27.711684715 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSystemOptions.html 2026-06-04 19:05:27.711684715 +0000 @@ -479,7 +479,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSystemSettings.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (603)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSystemSettings.html 2026-06-04 19:05:27.728684873 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxSystemSettings.html 2026-06-04 19:05:27.729684882 +0000 @@ -438,7 +438,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTaskBarIcon.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (743)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTaskBarIcon.html 2026-06-04 19:05:27.750685077 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTaskBarIcon.html 2026-06-04 19:05:27.747685049 +0000 @@ -521,7 +521,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTaskBarIconEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (351)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTaskBarIconEvent.html 2026-06-04 19:05:27.768685244 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTaskBarIconEvent.html 2026-06-04 19:05:27.768685244 +0000 @@ -295,7 +295,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTextAttr.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (422)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTextAttr.html 2026-06-04 19:05:27.795685494 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTextAttr.html 2026-06-04 19:05:27.807685606 +0000 @@ -1852,7 +1852,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTextCtrl.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (641)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTextCtrl.html 2026-06-04 19:05:27.841685921 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTextCtrl.html 2026-06-04 19:05:27.850686004 +0000 @@ -2526,7 +2526,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTextDataObject.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (763)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTextDataObject.html 2026-06-04 19:05:27.869686181 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTextDataObject.html 2026-06-04 19:05:27.868686172 +0000 @@ -481,7 +481,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTextEntryDialog.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (776)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTextEntryDialog.html 2026-06-04 19:05:27.888686357 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTextEntryDialog.html 2026-06-04 19:05:27.888686357 +0000 @@ -477,7 +477,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxToggleButton.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1210)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxToggleButton.html 2026-06-04 19:05:27.908686543 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxToggleButton.html 2026-06-04 19:05:27.909686552 +0000 @@ -573,7 +573,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxToolBar.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (724)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxToolBar.html 2026-06-04 19:05:27.938686821 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxToolBar.html 2026-06-04 19:05:27.938686821 +0000 @@ -2074,7 +2074,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxToolTip.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (462)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxToolTip.html 2026-06-04 19:05:27.956686988 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxToolTip.html 2026-06-04 19:05:27.956686988 +0000 @@ -505,7 +505,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxToolbook.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1071)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxToolbook.html 2026-06-04 19:05:27.982687229 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxToolbook.html 2026-06-04 19:05:27.981687220 +0000 @@ -1371,7 +1371,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTopLevelWindow.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (794)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTopLevelWindow.html 2026-06-04 19:05:28.006687452 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTopLevelWindow.html 2026-06-04 19:05:28.007687461 +0000 @@ -1147,7 +1147,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTreeCtrl.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (2161)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTreeCtrl.html 2026-06-04 19:05:28.048687841 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTreeCtrl.html 2026-06-04 19:05:28.048687841 +0000 @@ -3667,7 +3667,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTreeEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (670)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTreeEvent.html 2026-06-04 19:05:28.069688036 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTreeEvent.html 2026-06-04 19:05:28.070688045 +0000 @@ -636,7 +636,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTreebook.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1203)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTreebook.html 2026-06-04 19:05:28.095688277 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxTreebook.html 2026-06-04 19:05:28.095688277 +0000 @@ -1563,7 +1563,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxUpdateUIEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (595)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxUpdateUIEvent.html 2026-06-04 19:05:28.116688472 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxUpdateUIEvent.html 2026-06-04 19:05:28.116688472 +0000 @@ -1032,7 +1032,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxWebView.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (620)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxWebView.html 2026-06-04 19:05:28.149688778 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxWebView.html 2026-06-04 19:05:28.149688778 +0000 @@ -2341,7 +2341,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxWebViewEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (632)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxWebViewEvent.html 2026-06-04 19:05:28.170688973 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxWebViewEvent.html 2026-06-04 19:05:28.169688964 +0000 @@ -484,7 +484,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxWindow.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (4498)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxWindow.html 2026-06-04 19:05:28.244689659 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxWindow.html 2026-06-04 19:05:28.245689669 +0000 @@ -8231,7 +8231,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxWindowCreateEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (809)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxWindowCreateEvent.html 2026-06-04 19:05:28.265689854 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxWindowCreateEvent.html 2026-06-04 19:05:28.265689854 +0000 @@ -299,7 +299,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxWindowDC.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (683)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxWindowDC.html 2026-06-04 19:05:28.281690003 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxWindowDC.html 2026-06-04 19:05:28.281690003 +0000 @@ -318,7 +318,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxWindowDestroyEvent.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (637)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxWindowDestroyEvent.html 2026-06-04 19:05:28.298690160 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxWindowDestroyEvent.html 2026-06-04 19:05:28.298690160 +0000 @@ -300,7 +300,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxXmlResource.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (423)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxXmlResource.html 2026-06-04 19:05:28.324690401 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wxXmlResource.html 2026-06-04 19:05:28.324690401 +0000 @@ -1485,7 +1485,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wx_misc.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (404)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wx_misc.html 2026-06-04 19:05:28.348690624 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wx_misc.html 2026-06-04 19:05:28.347690615 +0000 @@ -1366,7 +1366,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wx_object.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (722)) --- old//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wx_object.html 2026-06-04 19:05:28.376690884 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/wx-2.4.3/doc/html/wx_object.html 2026-06-04 19:05:28.377690893 +0000 @@ -136,36 +136,36 @@ shutdown | Term, terminate(State) is called. It lets the user module clean up, it is always called when server terminates or when wx_object() in the driver is deleted. If the Parent process terminates the Module:terminate/2 function is -called.
          terminate(Reason, State)

          Example:

            -module(myDialog).
          -  -export([new/2, show/1, destroy/1]).  %% API
          -  -export([init/1, handle_call/3, handle_event/2,
          -           handle_info/2, code_change/3, terminate/2]).
          +called.
          terminate(Reason, State)

          Example:

            -module(myDialog).
          +  -export([new/2, show/1, destroy/1]).  %% API
          +  -export([init/1, handle_call/3, handle_event/2,
          +           handle_info/2, code_change/3, terminate/2]).
                      new/2, showModal/1, destroy/1]).  %% Callbacks
           
             %% Client API
          -  new(Parent, Msg) ->
          -     wx_object:start(?MODULE, [Parent,Id], []).
          +  new(Parent, Msg) ->
          +     wx_object:start(?MODULE, [Parent,Id], []).
           
          -  show(Dialog) ->
          -     wx_object:call(Dialog, show_modal).
          +  show(Dialog) ->
          +     wx_object:call(Dialog, show_modal).
           
          -  destroy(Dialog) ->
          -     wx_object:call(Dialog, destroy).
          +  destroy(Dialog) ->
          +     wx_object:call(Dialog, destroy).
           
             %% Server Implementation ala gen_server
          -  init([Parent, Str]) ->
          -     Dialog = wxDialog:new(Parent, 42, "Testing", []),
          +  init([Parent, Str]) ->
          +     Dialog = wxDialog:new(Parent, 42, "Testing", []),
                ...
          -     wxDialog:connect(Dialog, command_button_clicked),
          -     {Dialog, MyState}.
          +     wxDialog:connect(Dialog, command_button_clicked),
          +     {Dialog, MyState}.
           
          -  handle_call(show, _From, State) ->
          -     wxDialog:show(State#state.win),
          -     {reply, ok, State};
          +  handle_call(show, _From, State) ->
          +     wxDialog:show(State#state.win),
          +     {reply, ok, State};
             ...
          -  handle_event(#wx{}, State) ->
          -     io:format("Users clicked button~n",[]),
          -     {noreply, State};
          +  handle_event(#wx{}, State) ->
          +     io:format("Users clicked button~n",[]),
          +     {noreply, State};
             ...

          @@ -1371,7 +1371,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/404.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/404.html 2026-06-04 19:05:28.395550024 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/404.html 2026-06-04 19:05:28.395550024 +0000 @@ -143,7 +143,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/api-reference.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/api-reference.html 2026-06-04 19:05:28.412691218 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/api-reference.html 2026-06-04 19:05:28.412691218 +0000 @@ -235,7 +235,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/notes.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (658)) --- old//usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/notes.html 2026-06-04 19:05:28.438691459 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/notes.html 2026-06-04 19:05:28.438691459 +0000 @@ -1314,7 +1314,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/search.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/search.html 2026-06-04 19:05:28.455397630 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/search.html 2026-06-04 19:05:28.455397630 +0000 @@ -141,7 +141,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (987)) --- old//usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl.html 2026-06-04 19:05:28.475691802 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl.html 2026-06-04 19:05:28.475691802 +0000 @@ -1137,7 +1137,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_eventp.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (594)) --- old//usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_eventp.html 2026-06-04 19:05:28.497692006 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_eventp.html 2026-06-04 19:05:28.497692006 +0000 @@ -554,7 +554,7 @@ Erlang programming language

          -

          Copyright © 1996-2026 Ericsson AB

          +

          Copyright © 1996-2042 Ericsson AB

          /usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_examples.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (2073)) --- old//usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_examples.html 2026-06-04 19:05:28.516692182 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_examples.html 2026-06-04 19:05:28.517692192 +0000 @@ -146,92 +146,92 @@ user state, use their own state variable instead. Another option (used in e.g. xmerl_eventp.erl) is for customization functions to share one of the local states (in xmerl_eventp.erl, the continuation function and the fetch function -both access the cont_state.)

          Functions to access user state:

          • xmerl_scan:user_state(GlobalState)
          • xmerl_scan:user_state(UserState, GlobalState)

          1.2 Event Function

          {event_fun, fun()} | {event_fun, fun(), EventState}

          The event function is called at the beginning and at the end of a parsed entity. -It has the following format and semantics:

          fun(Event, GlobalState) ->
          -   EventState = xmerl_scan:event_state(GlobalState),
          -   EventState2 = foo(Event, EventState),
          -   GlobalState2 = xmerl_scan:event_state(EventState2, GlobalState)
          -end.

          1.3 Hook Function

          {hook_fun, fun()} | {hook_fun, fun(), HookState}

          The hook function is called when the processor has parsed a complete entity. -Format and semantics:

          fun(Entity, GlobalState) ->
          -   HookState = xmerl_scan:hook_state(GlobalState),
          -   {TransformedEntity, HookState2} = foo(Entity, HookState),
          -   GlobalState2 = xmerl_scan:hook_state(HookState2, GlobalState),
          -   {TransformedEntity, GlobalState2}
          +both access the cont_state.)

          Functions to access user state:

          • xmerl_scan:user_state(GlobalState)
          • xmerl_scan:user_state(UserState, GlobalState)

          1.2 Event Function

          {event_fun, fun()} | {event_fun, fun(), EventState}

          The event function is called at the beginning and at the end of a parsed entity. +It has the following format and semantics:

          fun(Event, GlobalState) ->
          +   EventState = xmerl_scan:event_state(GlobalState),
          +   EventState2 = foo(Event, EventState),
          +   GlobalState2 = xmerl_scan:event_state(EventState2, GlobalState)
          +end.

          1.3 Hook Function

          {hook_fun, fun()} | {hook_fun, fun(), HookState}

          The hook function is called when the processor has parsed a complete entity. +Format and semantics:

          fun(Entity, GlobalState) ->
          +   HookState = xmerl_scan:hook_state(GlobalState),
          +   {TransformedEntity, HookState2} = foo(Entity, HookState),
          +   GlobalState2 = xmerl_scan:hook_state(HookState2, GlobalState),
          +   {TransformedEntity, GlobalState2}
           end.

          The relationship between the event function, the hook function and the accumulator function is as follows:

          1. The event function is first called with an 'ended' event for the parsed entity.
          2. The hook function is called, possibly re-formatting the entity.
          3. The acc function is called in order to (optionally) add the re-formatted -entity to the contents of its parent element.

          1.4 Fetch Function

          {fetch_fun, fun()} | {fetch_fun, fun(), FetchState}

          The fetch function is called in order to fetch an external resource (e.g. a +entity to the contents of its parent element.

        • 1.4 Fetch Function

          {fetch_fun, fun()} | {fetch_fun, fun(), FetchState}

          The fetch function is called in order to fetch an external resource (e.g. a DTD).

          The fetch function can respond with three different return values:

          Result ::=
          -   {ok, {file, Filename}, NewGlobalState} |
          -   {ok, {string, String}, NewGlobalState} |
          -   {ok, not_fetched, NewGlobalState}

          Format and semantics:

          fun(URI, GlobalState) ->
          -   FetchState = xmerl_scan:fetch_state(GlobalState),
          -   Result = foo(URI, FetchState).  % Result being one of the above
          -end.

          1.5 Continuation Function

          {continuation_fun, fun()} | {continuation_fun, fun(), ContinuationState}

          The continuation function is called when the parser encounters the end of the -byte stream. Format and semantics:

          fun(Continue, Exception, GlobalState) ->
          -   ContState = xmerl_scan:cont_state(GlobalState),
          -   {Result, ContState2} = get_more_bytes(ContState),
          +   {ok, {file, Filename}, NewGlobalState} |
          +   {ok, {string, String}, NewGlobalState} |
          +   {ok, not_fetched, NewGlobalState}

          Format and semantics:

          fun(URI, GlobalState) ->
          +   FetchState = xmerl_scan:fetch_state(GlobalState),
          +   Result = foo(URI, FetchState).  % Result being one of the above
          +end.

          1.5 Continuation Function

          {continuation_fun, fun()} | {continuation_fun, fun(), ContinuationState}

          The continuation function is called when the parser encounters the end of the +byte stream. Format and semantics:

          fun(Continue, Exception, GlobalState) ->
          +   ContState = xmerl_scan:cont_state(GlobalState),
          +   {Result, ContState2} = get_more_bytes(ContState),
              case Result of
          -      [] ->
          -         GlobalState2 = xmerl_scan:cont_state(ContState2, GlobalState),
          -         Exception(GlobalState2);
          +      [] ->
          +         GlobalState2 = xmerl_scan:cont_state(ContState2, GlobalState),
          +         Exception(GlobalState2);
                 MoreBytes ->
          -         {MoreBytes2, Rest} = end_on_whitespace_char(MoreBytes),
          -         ContState3 = update_cont_state(Rest, ContState2),
          -         GlobalState3 = xmerl_scan:cont_state(ContState3, GlobalState),
          -         Continue(MoreBytes2, GlobalState3)
          +         {MoreBytes2, Rest} = end_on_whitespace_char(MoreBytes),
          +         ContState3 = update_cont_state(Rest, ContState2),
          +         GlobalState3 = xmerl_scan:cont_state(ContState3, GlobalState),
          +         Continue(MoreBytes2, GlobalState3)
              end
          -end.

          1.6 Rules Functions

          {rules, ReadFun : fun(), WriteFun : fun(), RulesState} |
          -{rules, Table : ets()}

          The rules functions take care of storing scanner information in a rules +end.

    1.6 Rules Functions

    {rules, ReadFun : fun(), WriteFun : fun(), RulesState} |
    +{rules, Table : ets()}

    The rules functions take care of storing scanner information in a rules database. User-provided rules functions may opt to store the information in mnesia, or perhaps in the user_state(RulesState).

    The following modes exist:

    • If the user doesn't specify an option, the scanner creates an ets table, and uses built-in functions to read and write data to it. When the scanner is done, the ets table is deleted.
    • If the user specifies an ets table via the {rules, Table} option, the scanner uses this table. When the scanner is done, it does not delete the table.
    • If the user specifies read and write functions, the scanner will use them -instead.

    The format for the read and write functions are as follows:

     WriteFun(Context, Name, Definition, ScannerState) -> NewScannerState.
    - ReadFun(Context, Name, ScannerState) -> Definition | undefined.

    Here is a summary of the data objects currently being written by the scanner:

    ContextKey ValueDefinition
    notationNotationName{system, SL} | {public, PIDL, SL}
    elem_defElementName#xmlElement{content = ContentSpec}
    parameter_entityPENamePEDef
    entityEntityNameEntityDef

    Table 1: Scanner data objects

    where

    ContentSpec ::= empty | any | ElemContent
    -ElemContent ::= {Mode, Elems}
    +instead.

    The format for the read and write functions are as follows:

     WriteFun(Context, Name, Definition, ScannerState) -> NewScannerState.
    + ReadFun(Context, Name, ScannerState) -> Definition | undefined.

    Here is a summary of the data objects currently being written by the scanner:

    ContextKey ValueDefinition
    notationNotationName{system, SL} | {public, PIDL, SL}
    elem_defElementName#xmlElement{content = ContentSpec}
    parameter_entityPENamePEDef
    entityEntityNameEntityDef

    Table 1: Scanner data objects

    where

    ContentSpec ::= empty | any | ElemContent
    +ElemContent ::= {Mode, Elems}
     Mode        ::= seq | choice
    -Elems       ::= [Elem]
    -Elem        ::= '#PCDATA' | Name | ElemContent | {Occurrence, Elems}
    +Elems       ::= [Elem]
    +Elem        ::= '#PCDATA' | Name | ElemContent | {Occurrence, Elems}
     Occurrence  ::= '*' | '?' | '+'

    NOTE: When <Elem> is not wrapped with <Occurrence>, (Occurrence = once) is -implied.

    1.7 Accumulator Function

    {acc_fun, fun()}

    The accumulator function is called to accumulate the contents of an entity.When +implied.

    1.7 Accumulator Function

    {acc_fun, fun()}

    The accumulator function is called to accumulate the contents of an entity.When parsing very large files, it may not be desirable to do so.In this case, an acc function can be provided that simply doesn't accumulate.

    Note that it is possible to even modify the parsed entity before accumulating it, but this must be done with care. xmerl_scan performs post-processing of the element for namespace management. Thus, the element must keep its original structure for this to work.

    The acc function has the following format and semantics:

    %% default accumulating acc fun
    -fun(ParsedEntity, Acc, GlobalState) ->
    -   {[ParsedEntity|Acc], GlobalState}.
    +fun(ParsedEntity, Acc, GlobalState) ->
    +   {[ParsedEntity|Acc], GlobalState}.
     
     %% non-accumulating acc fun
    -fun(ParsedEntity, Acc, GlobalState) ->
    -   {Acc, GlobalState}.

    1.8 Close Function

    The close function is called when a document (either the main document or an +fun(ParsedEntity, Acc, GlobalState) -> + {Acc, GlobalState}.

    1.8 Close Function

    The close function is called when a document (either the main document or an external DTD) has been completely parsed. When xmerl_scan was started using xmerl_scan:file/[1,2], the file will be read in full, and closed immediately, before the parsing starts, so when the close function is called, it will not need to actually close the file. In this case, the close function will be a good -place to modify the state variables.

    Format and semantics:

    fun(GlobalState) ->
    +place to modify the state variables.

    Format and semantics:

    fun(GlobalState) ->
        GlobalState1 = ....  % state variables may be altered

    2 Examples

    -

    See xmerl_test.erl for more examples.

    2.1 Handling spaces

    The following sample program illustrates three ways of scanning a document:

    1. the default scan, which leaves whitespace untouched
    2. normalizing spaces
    3. normalizing spaces, then removing text elements that only contain one space.
    -module(tmp).
    +

    See xmerl_test.erl for more examples.

    2.1 Handling spaces

    The following sample program illustrates three ways of scanning a document:

    1. the default scan, which leaves whitespace untouched
    2. normalizing spaces
    3. normalizing spaces, then removing text elements that only contain one space.
    -module(tmp).
     
    --include("xmerl.hrl").
    +-include("xmerl.hrl").
     
    --export([file1/1, file2/1, file3/1]).
    +-export([file1/1, file2/1, file3/1]).
     
    -file1(F) -> xmerl_scan:file(F).
    +file1(F) -> xmerl_scan:file(F).
     
    -file2(F) -> xmerl_scan:file(F, [{space,normalize}]).
    +file2(F) -> xmerl_scan:file(F, [{space,normalize}]).
     
    -file3(F) -> Acc = fun(#xmlText{value = " ", pos = P}, Acc, S) -> {Acc, P,
    -S}; % new return format (X, Acc, S) -> {[X|Acc], S} end, xmerl_scan:file(F,
    -[{space,normalize}, {acc_fun, Acc}]).
    +
    file3(F) -> Acc = fun(#xmlText{value = " ", pos = P}, Acc, S) -> {Acc, P, +S}; % new return format (X, Acc, S) -> {[X|Acc], S} end, xmerl_scan:file(F, +[{space,normalize}, {acc_fun, Acc}]).
    @@ -278,7 +278,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_sax_parser.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (381)) --- old//usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_sax_parser.html 2026-06-04 19:05:28.539692396 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_sax_parser.html 2026-06-04 19:05:28.539692396 +0000 @@ -797,7 +797,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_scan.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (594)) --- old//usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_scan.html 2026-06-04 19:05:28.566692646 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_scan.html 2026-06-04 19:05:28.565692637 +0000 @@ -1147,7 +1147,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_ug.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1168)) --- old//usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_ug.html 2026-06-04 19:05:28.592692887 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_ug.html 2026-06-04 19:05:28.592692887 +0000 @@ -193,16 +193,16 @@ structure and data of the document. If it is a simple document like:

    <?xml version="1.0"?>
     <dog>
     Grand Danois
    -</dog>

    The parse result will be:

    #xmlElement{name = dog,
    +</dog>

    The parse result will be:

    #xmlElement{name = dog,
                 ...
    -            parents = [],
    +            parents = [],
                 ...
    -            attributes = [],
    -            content = [{xmlText,[{dog,1}],1,[],"\
    +            attributes = [],
    +            content = [{xmlText,[{dog,1}],1,[],"\
     Grand Danois\
    -",text}],
    +",text}],
                 ...
    -            }

    Where the content of the top element is: + }

    Where the content of the top element is: [{xmlText,[{dog,1}],1,[],"\ Grand Danois\ ",text}]. Text will be returned in xmlText records. Though, usually documents are more complex, and the content of the top element will in that case be a nested structure with #xmlElement{} @@ -256,41 +256,41 @@ <!ELEMENT motorcycles (bike,date?)+ > <!ELEMENT bike (name,engine,kind,drive, accessories?,comment?) > <!ELEMENT name (manufacturer,brandName,additionalName?) > -<!ELEMENT manufacturer (#href_anchor"makeup erlang" translate="no">3> {ParseResult,Misc}=xmerl_scan:file("motorcycles.xml"). -{{xmlElement,motorcycles, +<!ELEMENT manufacturer (#href_anchor"makeup erlang" translate="no">3> {ParseResult,Misc}=xmerl_scan:file("motorcycles.xml"). +{{xmlElement,motorcycles, motorcycles, - [], - {xmlNamespace,[],[]}, - [], + [], + {xmlNamespace,[],[]}, + [], 1, - [], - [{xmlText,[{motorcycles,1}],1,[],"\ - ",text}, - {xmlElement,bike, + [], + [{xmlText,[{motorcycles,1}],1,[],"\ + ",text}, + {xmlElement,bike, bike, - [], - {xmlNamespace,[],[]}, - [{motorcycles,1}], + [], + {xmlNamespace,[],[]}, + [{motorcycles,1}], 2, - [{xmlAttribute,year,[],[],[],[]|...}, - {xmlAttribute,color,[],[],[]|...}], - [{xmlText,[{bike,2},{motorcycles|...}], + [{xmlAttribute,year,[],[],[],[]|...}, + {xmlAttribute,color,[],[],[]|...}], + [{xmlText,[{bike,2},{motorcycles|...}], 1, - []|...}, - {xmlElement,name,name,[]|...}, - {xmlText,[{...}|...],3|...}, - {xmlElement,engine|...}, - {xmlText|...}, - {...}|...], - [], + []|...}, + {xmlElement,name,name,[]|...}, + {xmlText,[{...}|...],3|...}, + {xmlElement,engine|...}, + {xmlText|...}, + {...}|...], + [], ".", - undeclared}, + undeclared}, ... - ], - [], + ], + [], ".", - undeclared}, - []} + undeclared}, + []} 4>

    If you instead receives the XML doc as a string you can parse it by xmerl_scan:string/1. Both file/2 and string/2 exists where the second argument is a list of options to the parser, see the reference manual.

    @@ -327,22 +327,22 @@ {Tag, Content} or Tag where:

    • Tag = atom()
    • Attributes = [{Name, Value}| #xmlAttribute{}]
    • Name = atom()
    • Value = IOString | atom() | integer()

    See also reference manual for xmerl

    If you want to add the information about a black Harley Davidsson 1200 cc Sportster motorcycle from 2003 that is in shape as new in the motorcycles.xml document you can put the data in a simple-form data structure like:

    Data =
    -  {bike,
    -     [{year,"2003"},{color,"black"},{condition,"new"}],
    -     [{name,
    -         [{manufacturer,["Harley Davidsson"]},
    -          {brandName,["XL1200C"]},
    -          {additionalName,["Sportster"]}]},
    -      {engine,
    -         ["V-engine, 2-cylinders, 1200 cc"]},
    -      {kind,["custom"]},
    -      {drive,["belt"]}]}

    In order to append this data to the end of the motorcycles.xml document you have -to parse the file and add Data to the end of the root element content.

        {RootEl,Misc}=xmerl_scan:file('motorcycles.xml'),
    -    #xmlElement{content=Content} = RootEl,
    -    NewContent=Content++lists:flatten([Data]),
    -    NewRootEl=RootEl#xmlElement{content=NewContent},

    Then you can run it through the export_simple/2 function:

        {ok,IOF}=file:open('new_motorcycles.xml',[write]),
    -    Export=xmerl:export_simple([NewRootEl],xmerl_xml),
    -    io:format(IOF,"~s~n",[lists:flatten(Export)]),

    The result would be:

    
    +  {bike,
    +     [{year,"2003"},{color,"black"},{condition,"new"}],
    +     [{name,
    +         [{manufacturer,["Harley Davidsson"]},
    +          {brandName,["XL1200C"]},
    +          {additionalName,["Sportster"]}]},
    +      {engine,
    +         ["V-engine, 2-cylinders, 1200 cc"]},
    +      {kind,["custom"]},
    +      {drive,["belt"]}]}

    In order to append this data to the end of the motorcycles.xml document you have +to parse the file and add Data to the end of the root element content.

        {RootEl,Misc}=xmerl_scan:file('motorcycles.xml'),
    +    #xmlElement{content=Content} = RootEl,
    +    NewContent=Content++lists:flatten([Data]),
    +    NewRootEl=RootEl#xmlElement{content=NewContent},

    Then you can run it through the export_simple/2 function:

        {ok,IOF}=file:open('new_motorcycles.xml',[write]),
    +    Export=xmerl:export_simple([NewRootEl],xmerl_xml),
    +    io:format(IOF,"~s~n",[lists:flatten(Export)]),

    The result would be:

    
     <?xml version="1.0"?><motorcycles>
       <bike year="2000" color="black">
         <name>
    @@ -369,40 +369,40 @@
     <bike year="2003" color="black" condition="new"><name><manufacturer>Harley Davidsson</manufacturer><brandName>XL1200C</brandName><additionalName>Sportster</additionalName></name><engine>V-engine, 2-cylinders, 1200 cc</engine><kind>custom</kind><drive>belt</drive></bike></motorcycles>

    If it is important to get similar indentation and newlines as in the original document you have to add #href_anchor"inline">{prolog,Value} to export_simple/3. The following example code fixes those changes in the previous example:

        Data =
    -      [#xmlText{value="  "},
    -       {bike,[{year,"2003"},{color,"black"},{condition,"new"}],
    -             [#xmlText{value="\
    -    "},
    -              {name,[#xmlText{value="\
    -      "},
    -                     {manufacturer,["Harley Davidsson"]},
    -                     #xmlText{value="\
    -      "},
    -                     {brandName,["XL1200C"]},
    -                     #xmlText{value="\
    -      "},
    -                     {additionalName,["Sportster"]},
    -                     #xmlText{value="\
    -    "}]},
    -              {engine,["V-engine, 2-cylinders, 1200 cc"]},
    -              #xmlText{value="\
    -    "},
    -              {kind,["custom"]},
    -              #xmlText{value="\
    -    "},
    -              {drive,["belt"]},
    -              #xmlText{value="\
    -  "}]},
    -       #xmlText{value="\
    -"}],
    +      [#xmlText{value="  "},
    +       {bike,[{year,"2003"},{color,"black"},{condition,"new"}],
    +             [#xmlText{value="\
    +    "},
    +              {name,[#xmlText{value="\
    +      "},
    +                     {manufacturer,["Harley Davidsson"]},
    +                     #xmlText{value="\
    +      "},
    +                     {brandName,["XL1200C"]},
    +                     #xmlText{value="\
    +      "},
    +                     {additionalName,["Sportster"]},
    +                     #xmlText{value="\
    +    "}]},
    +              {engine,["V-engine, 2-cylinders, 1200 cc"]},
    +              #xmlText{value="\
    +    "},
    +              {kind,["custom"]},
    +              #xmlText{value="\
    +    "},
    +              {drive,["belt"]},
    +              #xmlText{value="\
    +  "}]},
    +       #xmlText{value="\
    +"}],
         ...
    -    NewContent=Content++lists:flatten([Data]),
    -    NewRootEl=RootEl#xmlElement{content=NewContent},
    +    NewContent=Content++lists:flatten([Data]),
    +    NewRootEl=RootEl#xmlElement{content=NewContent},
         ...
    -    Prolog = ["<?xml version=\\"1.0\\" encoding=\\"utf-8\\" ?>
    +    Prolog = ["<?xml version=\\"1.0\\" encoding=\\"utf-8\\" ?>
     <!DOCTYPE motorcycles SYSTEM \\"motorcycles.dtd\\">\
    -"],
    -    Export=xmerl:export_simple([NewRootEl],xmerl_xml,[{prolog,Prolog}]),
    /usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_xpath.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (333))
    --- old//usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_xpath.html	2026-06-04 19:05:28.613693082 +0000
    +++ new//usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_xpath.html	2026-06-04 19:05:28.613693082 +0000
    @@ -500,7 +500,7 @@
               Erlang programming language
     
           

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_xs.html differs (HTML document, Unicode text, UTF-8 text) --- old//usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_xs.html 2026-06-04 19:05:28.631693249 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_xs.html 2026-06-04 19:05:28.631693249 +0000 @@ -366,7 +366,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_xs_examples.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (1283)) --- old//usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_xs_examples.html 2026-06-04 19:05:28.650693426 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_xs_examples.html 2026-06-04 19:05:28.650693426 +0000 @@ -135,13 +135,13 @@
    <h1> <xsl:apply-templates/> </h1> -</xsl:template>

    becomes in Erlang:

    template(E = #xmlElement{ parents=[{'doc',_}|_], name='title'}) ->
    -    ["<h1>",
    -         xslapply(fun template/1, E),
    -     "</h1>"];


    Example 2 Using value_of and select

    <xsl:template match="title">
    +</xsl:template>

    becomes in Erlang:

    template(E = #xmlElement{ parents=[{'doc',_}|_], name='title'}) ->
    +    ["<h1>",
    +         xslapply(fun template/1, E),
    +     "</h1>"];


    Example 2 Using value_of and select

    <xsl:template match="title">
       <div align="center"><h1><xsl:value-of select="." /></h1></div>
    -</xsl:template>

    becomes:

    template(E = #xmlElement{name='title'}) ->
    -    ["<div align=\"center\"><h1>", value_of(select(".", E)), "</h1></div>"];


    Example 3 Simple xsl stylesheet

    A complete example with the XSLT sheet in the xmerl distribution.

    <xsl:stylesheet version="1.0"
    +</xsl:template>

    becomes:

    template(E = #xmlElement{name='title'}) ->
    +    ["<div align=\"center\"><h1>", value_of(select(".", E)), "</h1></div>"];


    Example 3 Simple xsl stylesheet

    A complete example with the XSLT sheet in the xmerl distribution.

    <xsl:stylesheet version="1.0"
             xmlns:xsl="http://www.w3.org/1999/XSL/Transform"
             xmlns="http://www.w3.org/TR/xhtml1/strict">
     
    @@ -202,60 +202,60 @@
         </em>
       </xsl:template>
     
    -</xsl:stylesheet>


    Example 4 Erlang version

    Erlang transformation of previous example:

    -include("xmerl.hrl").
    +</xsl:stylesheet>


    Example 4 Erlang version

    Erlang transformation of previous example:

    -include("xmerl.hrl").
     
    --import(xmerl_xs,
    -    [ xslapply/2, value_of/1, select/2, built_in_rules/2 ]).
    +-import(xmerl_xs,
    +    [ xslapply/2, value_of/1, select/2, built_in_rules/2 ]).
     
    -doctype()->
    +doctype()->
         "<!DOCTYPE html PUBLIC \"-//W3C//DTD XHTML 1.0 Transitional//EN\"\
      \"http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd \">".
     
    -process_xml(Doc)->
    -    template(Doc).
    +process_xml(Doc)->
    +    template(Doc).
     
    -template(E = #xmlElement{name='doc'})->
    -    [ "<\?xml version=\"1.0\" encoding=\"iso-8859-1\"\?>",
    -      doctype(),
    +template(E = #xmlElement{name='doc'})->
    +    [ "<\?xml version=\"1.0\" encoding=\"iso-8859-1\"\?>",
    +      doctype(),
           "<html xmlns=\"http://www.w3.org/1999/xhtml\" >"
           "<head>"
    -      "<title>", value_of(select("title",E)), "</title>"
    +      "<title>", value_of(select("title",E)), "</title>"
           "</head>"
           "<body>",
    -      xslapply( fun template/1, E),
    +      xslapply( fun template/1, E),
           "</body>"
    -      "</html>" ];
    +      "</html>" ];
     
     
    -template(E = #xmlElement{ parents=[{'doc',_}|_], name='title'}) ->
    -    ["<h1>",
    -     xslapply( fun template/1, E),
    -     "</h1>"];
    +template(E = #xmlElement{ parents=[{'doc',_}|_], name='title'}) ->
    +    ["<h1>",
    +     xslapply( fun template/1, E),
    +     "</h1>"];
     
    -template(E = #xmlElement{ parents=[{'chapter',_}|_], name='title'}) ->
    -    ["<h2>",
    -     xslapply( fun template/1, E),
    -     "</h2>"];
    +template(E = #xmlElement{ parents=[{'chapter',_}|_], name='title'}) ->
    +    ["<h2>",
    +     xslapply( fun template/1, E),
    +     "</h2>"];
     
    -template(E = #xmlElement{ parents=[{'section',_}|_], name='title'}) ->
    -    ["<h3>",
    -     xslapply( fun template/1, E),
    -     "</h3>"];
    +template(E = #xmlElement{ parents=[{'section',_}|_], name='title'}) ->
    +    ["<h3>",
    +     xslapply( fun template/1, E),
    +     "</h3>"];
     
    -template(E = #xmlElement{ name='para'}) ->
    -    ["<p>", xslapply( fun template/1, E), "</p>"];
    +template(E = #xmlElement{ name='para'}) ->
    +    ["<p>", xslapply( fun template/1, E), "</p>"];
     
    -template(E = #xmlElement{ name='note'}) ->
    -    ["<p class=\"note\">"
    +template(E = #xmlElement{ name='note'}) ->
    +    ["<p class=\"note\">"
          "<b>NOTE: </b>",
    -     xslapply( fun template/1, E),
    -     "</p>"];
    +     xslapply( fun template/1, E),
    +     "</p>"];
     
    -template(E = #xmlElement{ name='emph'}) ->
    -    ["<em>", xslapply( fun template/1, E), "</em>"];
    +template(E = #xmlElement{ name='emph'}) ->
    +    ["<em>", xslapply( fun template/1, E), "</em>"];
     
    -template(E)->
    -    built_in_rules( fun template/1, E).

    It is important to end with a call to xmerl_xs:built_in_rules/2 if you want any +template(E)-> + built_in_rules( fun template/1, E).

    It is important to end with a call to xmerl_xs:built_in_rules/2 if you want any text to be written in "push" transforms. That are the ones using a lot xslapply( fun template/1, E ) instead of value_of(select("xpath",E)), which is pull...


    The largest example is the stylesheet to transform this document from the Simplified Docbook XML format to xhtml. The source file is sdocbook2xhtml.erl.

    @@ -274,21 +274,21 @@ <xsl:template match="line"> <xsl:if test="position() mod 2 = 0">&#160;&#160;</xsl:if> <xsl:value-of select="." /><br /> -</xsl:template>

    Can be written as

    template(E = #xmlElement{name='stanza'}) ->
    -    {Lines,LineNo} = lists:mapfoldl(fun template_pos/2, 1, select("line", E)),
    -    ["<p>", Lines, "</p>"].
    +</xsl:template>

    Can be written as

    template(E = #xmlElement{name='stanza'}) ->
    +    {Lines,LineNo} = lists:mapfoldl(fun template_pos/2, 1, select("line", E)),
    +    ["<p>", Lines, "</p>"].
     
    -template_pos(E = #xmlElement{name='line'}, P) ->
    -    {[indent_line(P rem 2), value_of(E#xmlElement.content), "<br />"], P + 1 }.
    +template_pos(E = #xmlElement{name='line'}, P) ->
    +    {[indent_line(P rem 2), value_of(E#xmlElement.content), "<br />"], P + 1 }.
     
    -indent_line(0)->"&#160;&#160;";
    -indent_line(_)->"".

    Global tree awareness

    In XSLT you have "root" access to the top of the tree with XPath, even though +indent_line(0)->"&#160;&#160;"; +indent_line(_)->"".


    Global tree awareness

    In XSLT you have "root" access to the top of the tree with XPath, even though you are somewhere deep in your tree.

    The xslapply/2 function only carries back the child part of the tree to the template fun. But it is quite easy to write template funs that handles both the -child and top tree.


    Example 6 Passing the root tree

    The following example piece will prepend the article title to any section title

    template(E = #xmlElement{name='title'}, ETop ) ->
    -    ["<h3>", value_of(select("title", ETop))," - ",
    -     xslapply( fun(A) -> template(A, ETop) end, E),
    -     "</h3>"];

    +child and top tree.


    Example 6 Passing the root tree

    The following example piece will prepend the article title to any section title

    template(E = #xmlElement{name='title'}, ETop ) ->
    +    ["<h3>", value_of(select("title", ETop))," - ",
    +     xslapply( fun(A) -> template(A, ETop) end, E),
    +     "</h3>"];

    @@ -326,7 +326,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    /usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_xsd.html differs (HTML document, Unicode text, UTF-8 text, with very long lines (711)) --- old//usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_xsd.html 2026-06-04 19:05:28.671693620 +0000 +++ new//usr/share/doc/packages/erlang27-doc/lib/xmerl-2.1/doc/html/xmerl_xsd.html 2026-06-04 19:05:28.671693620 +0000 @@ -806,9 +806,9 @@ several times towards the same schema it reduces time consumption.

    The result, ValidElement, is the valid element that conforms to the post-schema-validation infoset. When the validator finds an error it tries to continue and reports a list of all errors found. In those cases an unexpected -error is found it may cause a single error reason.

    Usage example:

    1>{E,_} = xmerl_scan:file("my_XML_document.xml").
    -2>{ok,S} = xmerl_xsd:process_schema("my_XML_Schema.xsd").
    -3>{E2,_} = xmerl_xsd:validate(E,S).

    Observe that E2 may differ from E if for instance there are default values +error is found it may cause a single error reason.

    Usage example:

    1>{E,_} = xmerl_scan:file("my_XML_document.xml").
    +2>{ok,S} = xmerl_xsd:process_schema("my_XML_Schema.xsd").
    +3>{E2,_} = xmerl_xsd:validate(E,S).

    Observe that E2 may differ from E if for instance there are default values defined in my_XML_Schema.xsd.

    @@ -834,7 +834,7 @@ Erlang programming language

    -

    Copyright © 1996-2026 Ericsson AB

    +

    Copyright © 1996-2042 Ericsson AB

    overalldiffered=2 (number of pkgs that are not bit-by-bit identical: 0 is good) overall=1