--- /srv/rebuilderd/tmp/rebuilderdXblwzf/inputs/erlang-doc_27.3.4.11+dfsg-1_all.deb +++ /srv/rebuilderd/tmp/rebuilderdXblwzf/out/erlang-doc_27.3.4.11+dfsg-1_all.deb ├── file list │ @@ -1,3 +1,3 @@ │ -rw-r--r-- 0 0 0 4 2026-04-22 08:03:21.000000 debian-binary │ --rw-r--r-- 0 0 0 40680 2026-04-22 08:03:21.000000 control.tar.xz │ --rw-r--r-- 0 0 0 20994304 2026-04-22 08:03:21.000000 data.tar.xz │ +-rw-r--r-- 0 0 0 40672 2026-04-22 08:03:21.000000 control.tar.xz │ +-rw-r--r-- 0 0 0 20993496 2026-04-22 08:03:21.000000 data.tar.xz ├── control.tar.xz │ ├── control.tar │ │ ├── ./md5sums │ │ │ ├── ./md5sums │ │ │ │┄ Files differ │ │ │ ├── line order │ │ │ │ @@ -317,15 +317,15 @@ │ │ │ │ usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/dist/lato-latin-300-normal-YUMVEFOL.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/dist/lato-latin-400-normal-W7754I4D.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/dist/lato-latin-700-normal-2XVSBPG4.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/dist/lato-latin-ext-300-normal-VPGGJKJL.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/dist/remixicon-NKANDIL5.woff2 │ │ │ │ -usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/dist/search_data-656BDBDC.js │ │ │ │ +usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/dist/search_data-382BFC7C.js │ │ │ │ usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/dist/sidebar_items-9A100A55.js │ │ │ │ usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/index.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/notes.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/search.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/common_test-1.27.7/doc/html/.build │ │ │ │ usr/share/doc/erlang-doc/html/lib/common_test-1.27.7/doc/html/404.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/common_test-1.27.7/doc/html/api-reference.html │ │ │ │ @@ -443,15 +443,15 @@ │ │ │ │ usr/share/doc/erlang-doc/html/lib/crypto-5.5.3.2/doc/html/dist/lato-latin-300-normal-YUMVEFOL.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/crypto-5.5.3.2/doc/html/dist/lato-latin-400-normal-W7754I4D.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/crypto-5.5.3.2/doc/html/dist/lato-latin-700-normal-2XVSBPG4.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/crypto-5.5.3.2/doc/html/dist/lato-latin-ext-300-normal-VPGGJKJL.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/crypto-5.5.3.2/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/crypto-5.5.3.2/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/crypto-5.5.3.2/doc/html/dist/remixicon-NKANDIL5.woff2 │ │ │ │ -usr/share/doc/erlang-doc/html/lib/crypto-5.5.3.2/doc/html/dist/search_data-5BF91F6C.js │ │ │ │ +usr/share/doc/erlang-doc/html/lib/crypto-5.5.3.2/doc/html/dist/search_data-24D91A3C.js │ │ │ │ usr/share/doc/erlang-doc/html/lib/crypto-5.5.3.2/doc/html/dist/sidebar_items-AF2AA597.js │ │ │ │ usr/share/doc/erlang-doc/html/lib/crypto-5.5.3.2/doc/html/engine_keys.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/crypto-5.5.3.2/doc/html/engine_load.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/crypto-5.5.3.2/doc/html/fips.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/crypto-5.5.3.2/doc/html/index.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/crypto-5.5.3.2/doc/html/licenses.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/crypto-5.5.3.2/doc/html/new_api.html │ │ │ │ @@ -646,15 +646,15 @@ │ │ │ │ usr/share/doc/erlang-doc/html/lib/eldap-1.2.14.1/doc/html/dist/lato-latin-300-normal-YUMVEFOL.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/eldap-1.2.14.1/doc/html/dist/lato-latin-400-normal-W7754I4D.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/eldap-1.2.14.1/doc/html/dist/lato-latin-700-normal-2XVSBPG4.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/eldap-1.2.14.1/doc/html/dist/lato-latin-ext-300-normal-VPGGJKJL.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/eldap-1.2.14.1/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/eldap-1.2.14.1/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/eldap-1.2.14.1/doc/html/dist/remixicon-NKANDIL5.woff2 │ │ │ │ -usr/share/doc/erlang-doc/html/lib/eldap-1.2.14.1/doc/html/dist/search_data-7A421979.js │ │ │ │ +usr/share/doc/erlang-doc/html/lib/eldap-1.2.14.1/doc/html/dist/search_data-E773FF9E.js │ │ │ │ usr/share/doc/erlang-doc/html/lib/eldap-1.2.14.1/doc/html/dist/sidebar_items-5C2028D5.js │ │ │ │ usr/share/doc/erlang-doc/html/lib/eldap-1.2.14.1/doc/html/eldap.epub │ │ │ │ usr/share/doc/erlang-doc/html/lib/eldap-1.2.14.1/doc/html/eldap.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/eldap-1.2.14.1/doc/html/index.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/eldap-1.2.14.1/doc/html/notes.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/eldap-1.2.14.1/doc/html/search.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/erl_interface-5.5.2/doc/html/.build │ │ │ │ @@ -968,15 +968,15 @@ │ │ │ │ usr/share/doc/erlang-doc/html/lib/jinterface-1.14.1/doc/html/dist/lato-latin-300-normal-YUMVEFOL.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/jinterface-1.14.1/doc/html/dist/lato-latin-400-normal-W7754I4D.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/jinterface-1.14.1/doc/html/dist/lato-latin-700-normal-2XVSBPG4.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/jinterface-1.14.1/doc/html/dist/lato-latin-ext-300-normal-VPGGJKJL.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/jinterface-1.14.1/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/jinterface-1.14.1/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/jinterface-1.14.1/doc/html/dist/remixicon-NKANDIL5.woff2 │ │ │ │ -usr/share/doc/erlang-doc/html/lib/jinterface-1.14.1/doc/html/dist/search_data-A53AF012.js │ │ │ │ +usr/share/doc/erlang-doc/html/lib/jinterface-1.14.1/doc/html/dist/search_data-D2E3D7BA.js │ │ │ │ usr/share/doc/erlang-doc/html/lib/jinterface-1.14.1/doc/html/dist/sidebar_items-C4FB09FB.js │ │ │ │ usr/share/doc/erlang-doc/html/lib/jinterface-1.14.1/doc/html/index.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/jinterface-1.14.1/doc/html/jinterface_users_guide.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/jinterface-1.14.1/doc/html/notes.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/jinterface-1.14.1/doc/html/search.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/.build │ │ │ │ usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/404.html │ │ │ │ @@ -1001,15 +1001,15 @@ │ │ │ │ usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/dist/lato-latin-300-normal-YUMVEFOL.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/dist/lato-latin-400-normal-W7754I4D.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/dist/lato-latin-700-normal-2XVSBPG4.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/dist/lato-latin-ext-300-normal-VPGGJKJL.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/dist/remixicon-NKANDIL5.woff2 │ │ │ │ -usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/dist/search_data-9CA2735F.js │ │ │ │ +usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/dist/search_data-45DA08B4.js │ │ │ │ usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/dist/sidebar_items-FCA6C10D.js │ │ │ │ usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/eep48_chapter.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/erl_boot_server.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/erl_ddll.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/erl_epmd.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/erpc.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/error_handler.html │ │ │ │ @@ -1073,15 +1073,15 @@ │ │ │ │ usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/dist/lato-latin-300-normal-YUMVEFOL.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/dist/lato-latin-400-normal-W7754I4D.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/dist/lato-latin-700-normal-2XVSBPG4.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/dist/lato-latin-ext-300-normal-VPGGJKJL.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/dist/remixicon-NKANDIL5.woff2 │ │ │ │ -usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/dist/search_data-7DE65072.js │ │ │ │ +usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/dist/search_data-B0144FAD.js │ │ │ │ usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/dist/sidebar_items-017D32EE.js │ │ │ │ usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/index.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/megaco.epub │ │ │ │ usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/megaco.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/megaco_architecture.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/megaco_codec_meas.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/megaco_codec_mstone1.html │ │ │ │ @@ -1123,15 +1123,15 @@ │ │ │ │ usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/dist/lato-latin-300-normal-YUMVEFOL.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/dist/lato-latin-400-normal-W7754I4D.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/dist/lato-latin-700-normal-2XVSBPG4.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/dist/lato-latin-ext-300-normal-VPGGJKJL.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/dist/remixicon-NKANDIL5.woff2 │ │ │ │ -usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/dist/search_data-BC67FB4D.js │ │ │ │ +usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/dist/search_data-4C102A02.js │ │ │ │ usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/dist/sidebar_items-A19B2882.js │ │ │ │ usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/index.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/mnesia.epub │ │ │ │ usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/mnesia.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/mnesia_app_a.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/mnesia_app_b.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/mnesia_app_c.html │ │ │ │ @@ -1620,15 +1620,15 @@ │ │ │ │ usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/dist/lato-latin-300-normal-YUMVEFOL.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/dist/lato-latin-400-normal-W7754I4D.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/dist/lato-latin-700-normal-2XVSBPG4.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/dist/lato-latin-ext-300-normal-VPGGJKJL.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/dist/remixicon-NKANDIL5.woff2 │ │ │ │ -usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/dist/search_data-0C02F667.js │ │ │ │ +usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/dist/search_data-BB0E13B7.js │ │ │ │ usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/dist/sidebar_items-79C80363.js │ │ │ │ usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/edlin.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/edlin_expand.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/epp.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/erl_anno.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/erl_error.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/erl_eval.html │ │ │ │ @@ -1714,15 +1714,15 @@ │ │ │ │ usr/share/doc/erlang-doc/html/lib/syntax_tools-3.2.2.2/doc/html/dist/lato-latin-300-normal-YUMVEFOL.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/syntax_tools-3.2.2.2/doc/html/dist/lato-latin-400-normal-W7754I4D.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/syntax_tools-3.2.2.2/doc/html/dist/lato-latin-700-normal-2XVSBPG4.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/syntax_tools-3.2.2.2/doc/html/dist/lato-latin-ext-300-normal-VPGGJKJL.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/syntax_tools-3.2.2.2/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/syntax_tools-3.2.2.2/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/syntax_tools-3.2.2.2/doc/html/dist/remixicon-NKANDIL5.woff2 │ │ │ │ -usr/share/doc/erlang-doc/html/lib/syntax_tools-3.2.2.2/doc/html/dist/search_data-1D7BB8C0.js │ │ │ │ +usr/share/doc/erlang-doc/html/lib/syntax_tools-3.2.2.2/doc/html/dist/search_data-B09DB05B.js │ │ │ │ usr/share/doc/erlang-doc/html/lib/syntax_tools-3.2.2.2/doc/html/dist/sidebar_items-2B4A1108.js │ │ │ │ usr/share/doc/erlang-doc/html/lib/syntax_tools-3.2.2.2/doc/html/epp_dodger.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/syntax_tools-3.2.2.2/doc/html/erl_comment_scan.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/syntax_tools-3.2.2.2/doc/html/erl_prettypr.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/syntax_tools-3.2.2.2/doc/html/erl_recomment.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/syntax_tools-3.2.2.2/doc/html/erl_syntax.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/syntax_tools-3.2.2.2/doc/html/erl_syntax_lib.html │ │ │ │ @@ -1749,15 +1749,15 @@ │ │ │ │ usr/share/doc/erlang-doc/html/lib/tftp-1.2.2.1/doc/html/dist/lato-latin-300-normal-YUMVEFOL.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/tftp-1.2.2.1/doc/html/dist/lato-latin-400-normal-W7754I4D.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/tftp-1.2.2.1/doc/html/dist/lato-latin-700-normal-2XVSBPG4.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/tftp-1.2.2.1/doc/html/dist/lato-latin-ext-300-normal-VPGGJKJL.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/tftp-1.2.2.1/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/tftp-1.2.2.1/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/tftp-1.2.2.1/doc/html/dist/remixicon-NKANDIL5.woff2 │ │ │ │ -usr/share/doc/erlang-doc/html/lib/tftp-1.2.2.1/doc/html/dist/search_data-654EBB26.js │ │ │ │ +usr/share/doc/erlang-doc/html/lib/tftp-1.2.2.1/doc/html/dist/search_data-F3ACFEF4.js │ │ │ │ usr/share/doc/erlang-doc/html/lib/tftp-1.2.2.1/doc/html/dist/sidebar_items-F16FBB4B.js │ │ │ │ usr/share/doc/erlang-doc/html/lib/tftp-1.2.2.1/doc/html/getting_started.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/tftp-1.2.2.1/doc/html/index.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/tftp-1.2.2.1/doc/html/introduction.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/tftp-1.2.2.1/doc/html/notes.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/tftp-1.2.2.1/doc/html/search.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/tftp-1.2.2.1/doc/html/tftp.epub │ │ │ │ @@ -1786,15 +1786,15 @@ │ │ │ │ usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/dist/lato-latin-300-normal-YUMVEFOL.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/dist/lato-latin-400-normal-W7754I4D.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/dist/lato-latin-700-normal-2XVSBPG4.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/dist/lato-latin-ext-300-normal-VPGGJKJL.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/dist/remixicon-NKANDIL5.woff2 │ │ │ │ -usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/dist/search_data-074D3797.js │ │ │ │ +usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/dist/search_data-6515C1E6.js │ │ │ │ usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/dist/sidebar_items-11035E81.js │ │ │ │ usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/eprof.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/erlang-el.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/erlang_mode_chapter.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/fprof.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/fprof_chapter.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/index.html │ │ │ │ @@ -1826,15 +1826,15 @@ │ │ │ │ usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/dist/lato-latin-300-normal-YUMVEFOL.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/dist/lato-latin-400-normal-W7754I4D.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/dist/lato-latin-700-normal-2XVSBPG4.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/dist/lato-latin-ext-300-normal-VPGGJKJL.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 │ │ │ │ usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/dist/remixicon-NKANDIL5.woff2 │ │ │ │ -usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/dist/search_data-18EDDFD7.js │ │ │ │ +usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/dist/search_data-C8002B3E.js │ │ │ │ usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/dist/sidebar_items-F7AE20D7.js │ │ │ │ usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/gl.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/glu.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/index.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/notes.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/search.html │ │ │ │ usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/wx.epub ├── data.tar.xz │ ├── data.tar │ │ ├── file list │ │ │ @@ -137,15 +137,15 @@ │ │ │ -rw-r--r-- 0 root (0) root (0) 293 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/doc/ssh.html │ │ │ -rw-r--r-- 0 root (0) root (0) 294 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/doc/ssl.html │ │ │ -rw-r--r-- 0 root (0) root (0) 295 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/doc/stdlib.html │ │ │ -rw-r--r-- 0 root (0) root (0) 301 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/doc/syntax_tools.html │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/doc/system/ │ │ │ -rw-r--r-- 0 root (0) root (0) 2286 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/doc/system/.build │ │ │ -rw-r--r-- 0 root (0) root (0) 5651 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/doc/system/404.html │ │ │ --rw-r--r-- 0 root (0) root (0) 655233 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/doc/system/Erlang System Documentation.epub │ │ │ +-rw-r--r-- 0 root (0) root (0) 655215 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/doc/system/Erlang System Documentation.epub │ │ │ -rw-r--r-- 0 root (0) root (0) 53766 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/doc/system/applications.html │ │ │ -rw-r--r-- 0 root (0) root (0) 97492 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/doc/system/appup_cookbook.html │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/doc/system/assets/ │ │ │ -rw-r--r-- 0 root (0) root (0) 7982 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/doc/system/assets/ballpoint-pen.svg │ │ │ -rw-r--r-- 0 root (0) root (0) 2284 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/doc/system/assets/dist1.gif │ │ │ -rw-r--r-- 0 root (0) root (0) 5214 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/doc/system/assets/dist2.gif │ │ │ -rw-r--r-- 0 root (0) root (0) 5007 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/doc/system/assets/dist3.gif │ │ │ @@ -351,15 +351,15 @@ │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/ │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/ │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/ │ │ │ -rw-r--r-- 0 root (0) root (0) 1060 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/.build │ │ │ -rw-r--r-- 0 root (0) root (0) 6010 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/404.html │ │ │ -rw-r--r-- 0 root (0) root (0) 6692 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/api-reference.html │ │ │ --rw-r--r-- 0 root (0) root (0) 96845 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/asn1.epub │ │ │ +-rw-r--r-- 0 root (0) root (0) 96839 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/asn1.epub │ │ │ -rw-r--r-- 0 root (0) root (0) 141134 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/asn1_getting_started.html │ │ │ -rw-r--r-- 0 root (0) root (0) 9328 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/asn1_introduction.html │ │ │ -rw-r--r-- 0 root (0) root (0) 7454 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/asn1_overview.html │ │ │ -rw-r--r-- 0 root (0) root (0) 79237 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/asn1_spec.html │ │ │ -rw-r--r-- 0 root (0) root (0) 35477 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/asn1ct.html │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/assets/ │ │ │ -rw-r--r-- 0 root (0) root (0) 1340 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/assets/exclusive_Win_But.gif │ │ │ @@ -380,15 +380,15 @@ │ │ │ -rw-r--r-- 0 root (0) root (0) 23236 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/dist/lato-latin-300-normal-YUMVEFOL.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 23580 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/dist/lato-latin-400-normal-W7754I4D.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 23040 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/dist/lato-latin-700-normal-2XVSBPG4.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5624 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/dist/lato-latin-ext-300-normal-VPGGJKJL.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5472 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5368 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 1956 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/dist/remixicon-NKANDIL5.woff2 │ │ │ --rw-r--r-- 0 root (0) root (0) 150048 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/dist/search_data-656BDBDC.js │ │ │ +-rw-r--r-- 0 root (0) root (0) 150048 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/dist/search_data-382BFC7C.js │ │ │ -rw-r--r-- 0 root (0) root (0) 5693 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/dist/sidebar_items-9A100A55.js │ │ │ -rw-r--r-- 0 root (0) root (0) 264 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/index.html │ │ │ -rw-r--r-- 0 root (0) root (0) 98943 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/notes.html │ │ │ -rw-r--r-- 0 root (0) root (0) 5926 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/asn1-5.3.4.2/doc/html/search.html │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/common_test-1.27.7/ │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/common_test-1.27.7/doc/ │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/common_test-1.27.7/doc/html/ │ │ │ @@ -397,15 +397,15 @@ │ │ │ -rw-r--r-- 0 root (0) root (0) 10672 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/common_test-1.27.7/doc/html/api-reference.html │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/common_test-1.27.7/doc/html/assets/ │ │ │ -rw-r--r-- 0 root (0) root (0) 4963 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/common_test-1.27.7/doc/html/assets/config.gif │ │ │ -rw-r--r-- 0 root (0) root (0) 10726 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/common_test-1.27.7/doc/html/assets/html_logs.gif │ │ │ -rw-r--r-- 0 root (0) root (0) 5837 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/common_test-1.27.7/doc/html/assets/logo.png │ │ │ -rw-r--r-- 0 root (0) root (0) 9561 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/common_test-1.27.7/doc/html/assets/tc_execution.gif │ │ │ -rw-r--r-- 0 root (0) root (0) 21795 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/common_test-1.27.7/doc/html/basics_chapter.html │ │ │ --rw-r--r-- 0 root (0) root (0) 399415 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/common_test-1.27.7/doc/html/common_test.epub │ │ │ +-rw-r--r-- 0 root (0) root (0) 399383 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/common_test-1.27.7/doc/html/common_test.epub │ │ │ -rw-r--r-- 0 root (0) root (0) 7502 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/common_test-1.27.7/doc/html/common_test_app.html │ │ │ -rw-r--r-- 0 root (0) root (0) 59626 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/common_test-1.27.7/doc/html/config_file_chapter.html │ │ │ -rw-r--r-- 0 root (0) root (0) 25541 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/common_test-1.27.7/doc/html/cover_chapter.html │ │ │ -rw-r--r-- 0 root (0) root (0) 182868 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/common_test-1.27.7/doc/html/ct.html │ │ │ -rw-r--r-- 0 root (0) root (0) 12310 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/common_test-1.27.7/doc/html/ct_cover.html │ │ │ -rw-r--r-- 0 root (0) root (0) 30032 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/common_test-1.27.7/doc/html/ct_ftp.html │ │ │ -rw-r--r-- 0 root (0) root (0) 77362 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/common_test-1.27.7/doc/html/ct_hooks.html │ │ │ @@ -466,15 +466,15 @@ │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/compiler-8.6.1.4/doc/html/assets/ │ │ │ -rw-r--r-- 0 root (0) root (0) 5837 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/compiler-8.6.1.4/doc/html/assets/logo.png │ │ │ -rw-r--r-- 0 root (0) root (0) 24226 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/compiler-8.6.1.4/doc/html/beam_ssa.html │ │ │ -rw-r--r-- 0 root (0) root (0) 450809 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/compiler-8.6.1.4/doc/html/cerl.html │ │ │ -rw-r--r-- 0 root (0) root (0) 28701 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/compiler-8.6.1.4/doc/html/cerl_clauses.html │ │ │ -rw-r--r-- 0 root (0) root (0) 28995 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/compiler-8.6.1.4/doc/html/cerl_trees.html │ │ │ -rw-r--r-- 0 root (0) root (0) 84370 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/compiler-8.6.1.4/doc/html/compile.html │ │ │ --rw-r--r-- 0 root (0) root (0) 182720 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/compiler-8.6.1.4/doc/html/compiler.epub │ │ │ +-rw-r--r-- 0 root (0) root (0) 182719 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/compiler-8.6.1.4/doc/html/compiler.epub │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/compiler-8.6.1.4/doc/html/dist/ │ │ │ -rw-r--r-- 0 root (0) root (0) 20933 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/compiler-8.6.1.4/doc/html/dist/handlebars.runtime-CFQAK6SD.js │ │ │ -rw-r--r-- 0 root (0) root (0) 33580 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/compiler-8.6.1.4/doc/html/dist/handlebars.templates-K7URE6B4.js │ │ │ -rw-r--r-- 0 root (0) root (0) 70589 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/compiler-8.6.1.4/doc/html/dist/html-55NP3CS6.js │ │ │ -rw-r--r-- 0 root (0) root (0) 67213 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/compiler-8.6.1.4/doc/html/dist/html-erlang-WGRVP7UZ.css │ │ │ -rw-r--r-- 0 root (0) root (0) 17732 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/compiler-8.6.1.4/doc/html/dist/inconsolata-latin-400-normal-OXLHDACS.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 17976 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/compiler-8.6.1.4/doc/html/dist/inconsolata-latin-700-normal-S55P5GAG.woff2 │ │ │ @@ -521,15 +521,15 @@ │ │ │ -rw-r--r-- 0 root (0) root (0) 23236 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/crypto-5.5.3.2/doc/html/dist/lato-latin-300-normal-YUMVEFOL.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 23580 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/crypto-5.5.3.2/doc/html/dist/lato-latin-400-normal-W7754I4D.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 23040 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/crypto-5.5.3.2/doc/html/dist/lato-latin-700-normal-2XVSBPG4.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5624 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/crypto-5.5.3.2/doc/html/dist/lato-latin-ext-300-normal-VPGGJKJL.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5472 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/crypto-5.5.3.2/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5368 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/crypto-5.5.3.2/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 1956 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/crypto-5.5.3.2/doc/html/dist/remixicon-NKANDIL5.woff2 │ │ │ --rw-r--r-- 0 root (0) root (0) 215912 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/crypto-5.5.3.2/doc/html/dist/search_data-5BF91F6C.js │ │ │ +-rw-r--r-- 0 root (0) root (0) 215912 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/crypto-5.5.3.2/doc/html/dist/search_data-24D91A3C.js │ │ │ -rw-r--r-- 0 root (0) root (0) 24600 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/crypto-5.5.3.2/doc/html/dist/sidebar_items-AF2AA597.js │ │ │ -rw-r--r-- 0 root (0) root (0) 19906 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/crypto-5.5.3.2/doc/html/engine_keys.html │ │ │ -rw-r--r-- 0 root (0) root (0) 20917 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/crypto-5.5.3.2/doc/html/engine_load.html │ │ │ -rw-r--r-- 0 root (0) root (0) 15693 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/crypto-5.5.3.2/doc/html/fips.html │ │ │ -rw-r--r-- 0 root (0) root (0) 266 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/crypto-5.5.3.2/doc/html/index.html │ │ │ -rw-r--r-- 0 root (0) root (0) 13097 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/crypto-5.5.3.2/doc/html/licenses.html │ │ │ -rw-r--r-- 0 root (0) root (0) 54383 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/crypto-5.5.3.2/doc/html/new_api.html │ │ │ @@ -583,15 +583,15 @@ │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/dialyzer-5.3.1/doc/ │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/dialyzer-5.3.1/doc/html/ │ │ │ -rw-r--r-- 0 root (0) root (0) 921 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/dialyzer-5.3.1/doc/html/.build │ │ │ -rw-r--r-- 0 root (0) root (0) 6028 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/dialyzer-5.3.1/doc/html/404.html │ │ │ -rw-r--r-- 0 root (0) root (0) 6794 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/dialyzer-5.3.1/doc/html/api-reference.html │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/dialyzer-5.3.1/doc/html/assets/ │ │ │ -rw-r--r-- 0 root (0) root (0) 5837 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/dialyzer-5.3.1/doc/html/assets/logo.png │ │ │ --rw-r--r-- 0 root (0) root (0) 66388 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/dialyzer-5.3.1/doc/html/dialyzer.epub │ │ │ +-rw-r--r-- 0 root (0) root (0) 66387 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/dialyzer-5.3.1/doc/html/dialyzer.epub │ │ │ -rw-r--r-- 0 root (0) root (0) 53654 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/dialyzer-5.3.1/doc/html/dialyzer.html │ │ │ -rw-r--r-- 0 root (0) root (0) 25902 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/dialyzer-5.3.1/doc/html/dialyzer_chapter.html │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/dialyzer-5.3.1/doc/html/dist/ │ │ │ -rw-r--r-- 0 root (0) root (0) 20933 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/dialyzer-5.3.1/doc/html/dist/handlebars.runtime-CFQAK6SD.js │ │ │ -rw-r--r-- 0 root (0) root (0) 33580 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/dialyzer-5.3.1/doc/html/dist/handlebars.templates-K7URE6B4.js │ │ │ -rw-r--r-- 0 root (0) root (0) 70589 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/dialyzer-5.3.1/doc/html/dist/html-55NP3CS6.js │ │ │ -rw-r--r-- 0 root (0) root (0) 67213 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/dialyzer-5.3.1/doc/html/dist/html-erlang-WGRVP7UZ.css │ │ │ @@ -618,15 +618,15 @@ │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/diameter-2.4.1.1/doc/ │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/diameter-2.4.1.1/doc/html/ │ │ │ -rw-r--r-- 0 root (0) root (0) 1143 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/diameter-2.4.1.1/doc/html/.build │ │ │ -rw-r--r-- 0 root (0) root (0) 6034 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/diameter-2.4.1.1/doc/html/404.html │ │ │ -rw-r--r-- 0 root (0) root (0) 8222 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/diameter-2.4.1.1/doc/html/api-reference.html │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/diameter-2.4.1.1/doc/html/assets/ │ │ │ -rw-r--r-- 0 root (0) root (0) 5837 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/diameter-2.4.1.1/doc/html/assets/logo.png │ │ │ --rw-r--r-- 0 root (0) root (0) 144221 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/diameter-2.4.1.1/doc/html/diameter.epub │ │ │ +-rw-r--r-- 0 root (0) root (0) 144222 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/diameter-2.4.1.1/doc/html/diameter.epub │ │ │ -rw-r--r-- 0 root (0) root (0) 253956 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/diameter-2.4.1.1/doc/html/diameter.html │ │ │ -rw-r--r-- 0 root (0) root (0) 57599 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/diameter-2.4.1.1/doc/html/diameter_app.html │ │ │ -rw-r--r-- 0 root (0) root (0) 29032 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/diameter-2.4.1.1/doc/html/diameter_codec.html │ │ │ -rw-r--r-- 0 root (0) root (0) 32274 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/diameter-2.4.1.1/doc/html/diameter_dict.html │ │ │ -rw-r--r-- 0 root (0) root (0) 6784 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/diameter-2.4.1.1/doc/html/diameter_examples.html │ │ │ -rw-r--r-- 0 root (0) root (0) 9532 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/diameter-2.4.1.1/doc/html/diameter_intro.html │ │ │ -rw-r--r-- 0 root (0) root (0) 21968 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/diameter-2.4.1.1/doc/html/diameter_make.html │ │ │ @@ -750,17 +750,17 @@ │ │ │ -rw-r--r-- 0 root (0) root (0) 23236 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/eldap-1.2.14.1/doc/html/dist/lato-latin-300-normal-YUMVEFOL.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 23580 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/eldap-1.2.14.1/doc/html/dist/lato-latin-400-normal-W7754I4D.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 23040 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/eldap-1.2.14.1/doc/html/dist/lato-latin-700-normal-2XVSBPG4.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5624 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/eldap-1.2.14.1/doc/html/dist/lato-latin-ext-300-normal-VPGGJKJL.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5472 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/eldap-1.2.14.1/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5368 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/eldap-1.2.14.1/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 1956 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/eldap-1.2.14.1/doc/html/dist/remixicon-NKANDIL5.woff2 │ │ │ --rw-r--r-- 0 root (0) root (0) 24651 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/eldap-1.2.14.1/doc/html/dist/search_data-7A421979.js │ │ │ +-rw-r--r-- 0 root (0) root (0) 24651 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/eldap-1.2.14.1/doc/html/dist/search_data-E773FF9E.js │ │ │ -rw-r--r-- 0 root (0) root (0) 6047 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/eldap-1.2.14.1/doc/html/dist/sidebar_items-5C2028D5.js │ │ │ --rw-r--r-- 0 root (0) root (0) 33173 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/eldap-1.2.14.1/doc/html/eldap.epub │ │ │ +-rw-r--r-- 0 root (0) root (0) 33176 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/eldap-1.2.14.1/doc/html/eldap.epub │ │ │ -rw-r--r-- 0 root (0) root (0) 94819 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/eldap-1.2.14.1/doc/html/eldap.html │ │ │ -rw-r--r-- 0 root (0) root (0) 266 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/eldap-1.2.14.1/doc/html/index.html │ │ │ -rw-r--r-- 0 root (0) root (0) 25611 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/eldap-1.2.14.1/doc/html/notes.html │ │ │ -rw-r--r-- 0 root (0) root (0) 5935 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/eldap-1.2.14.1/doc/html/search.html │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/erl_interface-5.5.2/ │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/erl_interface-5.5.2/doc/ │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/erl_interface-5.5.2/doc/html/ │ │ │ @@ -789,15 +789,15 @@ │ │ │ -rw-r--r-- 0 root (0) root (0) 193099 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/erl_interface-5.5.2/doc/html/dist/search_data-1F14090C.js │ │ │ -rw-r--r-- 0 root (0) root (0) 15936 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/erl_interface-5.5.2/doc/html/dist/sidebar_items-8A5CCEF3.js │ │ │ -rw-r--r-- 0 root (0) root (0) 73740 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/erl_interface-5.5.2/doc/html/ei.html │ │ │ -rw-r--r-- 0 root (0) root (0) 72795 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/erl_interface-5.5.2/doc/html/ei_connect.html │ │ │ -rw-r--r-- 0 root (0) root (0) 11739 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/erl_interface-5.5.2/doc/html/ei_global.html │ │ │ -rw-r--r-- 0 root (0) root (0) 26984 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/erl_interface-5.5.2/doc/html/ei_users_guide.html │ │ │ -rw-r--r-- 0 root (0) root (0) 22688 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/erl_interface-5.5.2/doc/html/erl_call_cmd.html │ │ │ --rw-r--r-- 0 root (0) root (0) 84947 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/erl_interface-5.5.2/doc/html/erl_interface.epub │ │ │ +-rw-r--r-- 0 root (0) root (0) 84949 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/erl_interface-5.5.2/doc/html/erl_interface.epub │ │ │ -rw-r--r-- 0 root (0) root (0) 272 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/erl_interface-5.5.2/doc/html/index.html │ │ │ -rw-r--r-- 0 root (0) root (0) 110953 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/erl_interface-5.5.2/doc/html/notes.html │ │ │ -rw-r--r-- 0 root (0) root (0) 5565 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/erl_interface-5.5.2/doc/html/search.html │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/et-1.7.1/ │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/et-1.7.1/doc/ │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/et-1.7.1/doc/html/ │ │ │ -rw-r--r-- 0 root (0) root (0) 1332 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/et-1.7.1/doc/html/.build │ │ │ @@ -832,15 +832,15 @@ │ │ │ -rw-r--r-- 0 root (0) root (0) 23040 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/et-1.7.1/doc/html/dist/lato-latin-700-normal-2XVSBPG4.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5624 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/et-1.7.1/doc/html/dist/lato-latin-ext-300-normal-VPGGJKJL.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5472 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/et-1.7.1/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5368 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/et-1.7.1/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 1956 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/et-1.7.1/doc/html/dist/remixicon-NKANDIL5.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 80722 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/et-1.7.1/doc/html/dist/search_data-07FF68FB.js │ │ │ -rw-r--r-- 0 root (0) root (0) 9243 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/et-1.7.1/doc/html/dist/sidebar_items-639C3385.js │ │ │ --rw-r--r-- 0 root (0) root (0) 302434 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/et-1.7.1/doc/html/et.epub │ │ │ +-rw-r--r-- 0 root (0) root (0) 302441 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/et-1.7.1/doc/html/et.epub │ │ │ -rw-r--r-- 0 root (0) root (0) 22899 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/et-1.7.1/doc/html/et.html │ │ │ -rw-r--r-- 0 root (0) root (0) 57168 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/et-1.7.1/doc/html/et_collector.html │ │ │ -rw-r--r-- 0 root (0) root (0) 52828 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/et-1.7.1/doc/html/et_desc.html │ │ │ -rw-r--r-- 0 root (0) root (0) 100672 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/et-1.7.1/doc/html/et_examples.html │ │ │ -rw-r--r-- 0 root (0) root (0) 9916 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/et-1.7.1/doc/html/et_intro.html │ │ │ -rw-r--r-- 0 root (0) root (0) 20457 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/et-1.7.1/doc/html/et_selector.html │ │ │ -rw-r--r-- 0 root (0) root (0) 45778 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/et-1.7.1/doc/html/et_tutorial.html │ │ │ @@ -907,15 +907,15 @@ │ │ │ -rw-r--r-- 0 root (0) root (0) 23040 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ftp-1.2.3/doc/html/dist/lato-latin-700-normal-2XVSBPG4.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5624 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ftp-1.2.3/doc/html/dist/lato-latin-ext-300-normal-VPGGJKJL.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5472 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ftp-1.2.3/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5368 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ftp-1.2.3/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 1956 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ftp-1.2.3/doc/html/dist/remixicon-NKANDIL5.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 29403 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ftp-1.2.3/doc/html/dist/search_data-FF6A1601.js │ │ │ -rw-r--r-- 0 root (0) root (0) 5270 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ftp-1.2.3/doc/html/dist/sidebar_items-B6B07F6E.js │ │ │ --rw-r--r-- 0 root (0) root (0) 33163 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ftp-1.2.3/doc/html/ftp.epub │ │ │ +-rw-r--r-- 0 root (0) root (0) 33167 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ftp-1.2.3/doc/html/ftp.epub │ │ │ -rw-r--r-- 0 root (0) root (0) 82127 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ftp-1.2.3/doc/html/ftp.html │ │ │ -rw-r--r-- 0 root (0) root (0) 12856 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ftp-1.2.3/doc/html/ftp_client.html │ │ │ -rw-r--r-- 0 root (0) root (0) 261 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ftp-1.2.3/doc/html/index.html │ │ │ -rw-r--r-- 0 root (0) root (0) 7162 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ftp-1.2.3/doc/html/introduction.html │ │ │ -rw-r--r-- 0 root (0) root (0) 22515 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ftp-1.2.3/doc/html/notes.html │ │ │ -rw-r--r-- 0 root (0) root (0) 5914 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ftp-1.2.3/doc/html/search.html │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/inets-9.3.2.4/ │ │ │ @@ -951,15 +951,15 @@ │ │ │ -rw-r--r-- 0 root (0) root (0) 11421 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/inets-9.3.2.4/doc/html/http_uri.html │ │ │ -rw-r--r-- 0 root (0) root (0) 91302 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/inets-9.3.2.4/doc/html/httpc.html │ │ │ -rw-r--r-- 0 root (0) root (0) 118366 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/inets-9.3.2.4/doc/html/httpd.html │ │ │ -rw-r--r-- 0 root (0) root (0) 12136 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/inets-9.3.2.4/doc/html/httpd_custom_api.html │ │ │ -rw-r--r-- 0 root (0) root (0) 13448 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/inets-9.3.2.4/doc/html/httpd_socket.html │ │ │ -rw-r--r-- 0 root (0) root (0) 45124 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/inets-9.3.2.4/doc/html/httpd_util.html │ │ │ -rw-r--r-- 0 root (0) root (0) 265 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/inets-9.3.2.4/doc/html/index.html │ │ │ --rw-r--r-- 0 root (0) root (0) 153444 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/inets-9.3.2.4/doc/html/inets.epub │ │ │ +-rw-r--r-- 0 root (0) root (0) 153442 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/inets-9.3.2.4/doc/html/inets.epub │ │ │ -rw-r--r-- 0 root (0) root (0) 25717 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/inets-9.3.2.4/doc/html/inets.html │ │ │ -rw-r--r-- 0 root (0) root (0) 8659 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/inets-9.3.2.4/doc/html/inets_services.html │ │ │ -rw-r--r-- 0 root (0) root (0) 7466 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/inets-9.3.2.4/doc/html/introduction.html │ │ │ -rw-r--r-- 0 root (0) root (0) 21300 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/inets-9.3.2.4/doc/html/mod_alias.html │ │ │ -rw-r--r-- 0 root (0) root (0) 83168 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/inets-9.3.2.4/doc/html/mod_auth.html │ │ │ -rw-r--r-- 0 root (0) root (0) 19815 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/inets-9.3.2.4/doc/html/mod_esi.html │ │ │ -rw-r--r-- 0 root (0) root (0) 37282 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/inets-9.3.2.4/doc/html/mod_security.html │ │ │ @@ -1111,15 +1111,15 @@ │ │ │ -rw-r--r-- 0 root (0) root (0) 23236 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/jinterface-1.14.1/doc/html/dist/lato-latin-300-normal-YUMVEFOL.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 23580 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/jinterface-1.14.1/doc/html/dist/lato-latin-400-normal-W7754I4D.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 23040 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/jinterface-1.14.1/doc/html/dist/lato-latin-700-normal-2XVSBPG4.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5624 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/jinterface-1.14.1/doc/html/dist/lato-latin-ext-300-normal-VPGGJKJL.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5472 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/jinterface-1.14.1/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5368 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/jinterface-1.14.1/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 1956 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/jinterface-1.14.1/doc/html/dist/remixicon-NKANDIL5.woff2 │ │ │ --rw-r--r-- 0 root (0) root (0) 52505 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/jinterface-1.14.1/doc/html/dist/search_data-A53AF012.js │ │ │ +-rw-r--r-- 0 root (0) root (0) 52505 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/jinterface-1.14.1/doc/html/dist/search_data-D2E3D7BA.js │ │ │ -rw-r--r-- 0 root (0) root (0) 3223 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/jinterface-1.14.1/doc/html/dist/sidebar_items-C4FB09FB.js │ │ │ -rw-r--r-- 0 root (0) root (0) 278 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/jinterface-1.14.1/doc/html/index.html │ │ │ -rw-r--r-- 0 root (0) root (0) 32121 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/jinterface-1.14.1/doc/html/jinterface_users_guide.html │ │ │ -rw-r--r-- 0 root (0) root (0) 47129 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/jinterface-1.14.1/doc/html/notes.html │ │ │ -rw-r--r-- 0 root (0) root (0) 5436 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/jinterface-1.14.1/doc/html/search.html │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/ │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/ │ │ │ @@ -1149,15 +1149,15 @@ │ │ │ -rw-r--r-- 0 root (0) root (0) 23236 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/dist/lato-latin-300-normal-YUMVEFOL.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 23580 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/dist/lato-latin-400-normal-W7754I4D.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 23040 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/dist/lato-latin-700-normal-2XVSBPG4.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5624 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/dist/lato-latin-ext-300-normal-VPGGJKJL.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5472 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5368 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 1956 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/dist/remixicon-NKANDIL5.woff2 │ │ │ --rw-r--r-- 0 root (0) root (0) 1225649 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/dist/search_data-9CA2735F.js │ │ │ +-rw-r--r-- 0 root (0) root (0) 1225649 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/dist/search_data-45DA08B4.js │ │ │ -rw-r--r-- 0 root (0) root (0) 115768 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/dist/sidebar_items-FCA6C10D.js │ │ │ -rw-r--r-- 0 root (0) root (0) 21084 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/eep48_chapter.html │ │ │ -rw-r--r-- 0 root (0) root (0) 15895 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/erl_boot_server.html │ │ │ -rw-r--r-- 0 root (0) root (0) 85756 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/erl_ddll.html │ │ │ -rw-r--r-- 0 root (0) root (0) 25156 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/erl_epmd.html │ │ │ -rw-r--r-- 0 root (0) root (0) 111330 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/erpc.html │ │ │ -rw-r--r-- 0 root (0) root (0) 15177 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/error_handler.html │ │ │ @@ -1169,15 +1169,15 @@ │ │ │ -rw-r--r-- 0 root (0) root (0) 57284 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/global.html │ │ │ -rw-r--r-- 0 root (0) root (0) 37262 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/global_group.html │ │ │ -rw-r--r-- 0 root (0) root (0) 24987 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/heart.html │ │ │ -rw-r--r-- 0 root (0) root (0) 267 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/index.html │ │ │ -rw-r--r-- 0 root (0) root (0) 184632 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/inet.html │ │ │ -rw-r--r-- 0 root (0) root (0) 88431 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/inet_res.html │ │ │ -rw-r--r-- 0 root (0) root (0) 7733 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/introduction_chapter.html │ │ │ --rw-r--r-- 0 root (0) root (0) 793528 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/kernel.epub │ │ │ +-rw-r--r-- 0 root (0) root (0) 793508 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/kernel.epub │ │ │ -rw-r--r-- 0 root (0) root (0) 42783 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/kernel_app.html │ │ │ -rw-r--r-- 0 root (0) root (0) 188628 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/logger.html │ │ │ -rw-r--r-- 0 root (0) root (0) 108846 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/logger_chapter.html │ │ │ -rw-r--r-- 0 root (0) root (0) 70817 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/logger_cookbook.html │ │ │ -rw-r--r-- 0 root (0) root (0) 15657 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/logger_disk_log_h.html │ │ │ -rw-r--r-- 0 root (0) root (0) 25632 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/logger_filters.html │ │ │ -rw-r--r-- 0 root (0) root (0) 34207 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/kernel-10.2.7.4/doc/html/logger_formatter.html │ │ │ @@ -1226,18 +1226,18 @@ │ │ │ -rw-r--r-- 0 root (0) root (0) 23236 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/dist/lato-latin-300-normal-YUMVEFOL.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 23580 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/dist/lato-latin-400-normal-W7754I4D.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 23040 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/dist/lato-latin-700-normal-2XVSBPG4.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5624 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/dist/lato-latin-ext-300-normal-VPGGJKJL.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5472 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5368 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 1956 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/dist/remixicon-NKANDIL5.woff2 │ │ │ --rw-r--r-- 0 root (0) root (0) 200508 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/dist/search_data-7DE65072.js │ │ │ +-rw-r--r-- 0 root (0) root (0) 200508 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/dist/search_data-B0144FAD.js │ │ │ -rw-r--r-- 0 root (0) root (0) 33294 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/dist/sidebar_items-017D32EE.js │ │ │ -rw-r--r-- 0 root (0) root (0) 266 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/index.html │ │ │ --rw-r--r-- 0 root (0) root (0) 181634 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/megaco.epub │ │ │ +-rw-r--r-- 0 root (0) root (0) 181638 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/megaco.epub │ │ │ -rw-r--r-- 0 root (0) root (0) 199469 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/megaco.html │ │ │ -rw-r--r-- 0 root (0) root (0) 13686 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/megaco_architecture.html │ │ │ -rw-r--r-- 0 root (0) root (0) 9144 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/megaco_codec_meas.html │ │ │ -rw-r--r-- 0 root (0) root (0) 23106 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/megaco_codec_mstone1.html │ │ │ -rw-r--r-- 0 root (0) root (0) 9748 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/megaco_codec_mstone2.html │ │ │ -rw-r--r-- 0 root (0) root (0) 9720 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/megaco_codec_transform.html │ │ │ -rw-r--r-- 0 root (0) root (0) 18682 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/megaco-4.7.2.1/doc/html/megaco_debug.html │ │ │ @@ -1281,18 +1281,18 @@ │ │ │ -rw-r--r-- 0 root (0) root (0) 23236 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/dist/lato-latin-300-normal-YUMVEFOL.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 23580 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/dist/lato-latin-400-normal-W7754I4D.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 23040 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/dist/lato-latin-700-normal-2XVSBPG4.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5624 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/dist/lato-latin-ext-300-normal-VPGGJKJL.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5472 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5368 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 1956 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/dist/remixicon-NKANDIL5.woff2 │ │ │ --rw-r--r-- 0 root (0) root (0) 376330 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/dist/search_data-BC67FB4D.js │ │ │ +-rw-r--r-- 0 root (0) root (0) 376330 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/dist/search_data-4C102A02.js │ │ │ -rw-r--r-- 0 root (0) root (0) 24634 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/dist/sidebar_items-A19B2882.js │ │ │ -rw-r--r-- 0 root (0) root (0) 267 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/index.html │ │ │ --rw-r--r-- 0 root (0) root (0) 222191 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/mnesia.epub │ │ │ +-rw-r--r-- 0 root (0) root (0) 222182 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/mnesia.epub │ │ │ -rw-r--r-- 0 root (0) root (0) 320928 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/mnesia.html │ │ │ -rw-r--r-- 0 root (0) root (0) 45474 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/mnesia_app_a.html │ │ │ -rw-r--r-- 0 root (0) root (0) 87801 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/mnesia_app_b.html │ │ │ -rw-r--r-- 0 root (0) root (0) 46066 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/mnesia_app_c.html │ │ │ -rw-r--r-- 0 root (0) root (0) 9875 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/mnesia_chap1.html │ │ │ -rw-r--r-- 0 root (0) root (0) 109262 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/mnesia_chap2.html │ │ │ -rw-r--r-- 0 root (0) root (0) 51400 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/mnesia-4.23.5.2/doc/html/mnesia_chap3.html │ │ │ @@ -1339,15 +1339,15 @@ │ │ │ -rw-r--r-- 0 root (0) root (0) 146200 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/observer-2.17/doc/html/dist/search_data-FFC02264.js │ │ │ -rw-r--r-- 0 root (0) root (0) 12765 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/observer-2.17/doc/html/dist/sidebar_items-6D9D41B7.js │ │ │ -rw-r--r-- 0 root (0) root (0) 17966 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/observer-2.17/doc/html/etop.html │ │ │ -rw-r--r-- 0 root (0) root (0) 15746 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/observer-2.17/doc/html/etop_ug.html │ │ │ -rw-r--r-- 0 root (0) root (0) 265 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/observer-2.17/doc/html/index.html │ │ │ -rw-r--r-- 0 root (0) root (0) 7350 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/observer-2.17/doc/html/introduction_ug.html │ │ │ -rw-r--r-- 0 root (0) root (0) 71142 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/observer-2.17/doc/html/notes.html │ │ │ --rw-r--r-- 0 root (0) root (0) 116812 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/observer-2.17/doc/html/observer.epub │ │ │ +-rw-r--r-- 0 root (0) root (0) 116811 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/observer-2.17/doc/html/observer.epub │ │ │ -rw-r--r-- 0 root (0) root (0) 13905 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/observer-2.17/doc/html/observer.html │ │ │ -rw-r--r-- 0 root (0) root (0) 7238 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/observer-2.17/doc/html/observer_app.html │ │ │ -rw-r--r-- 0 root (0) root (0) 23494 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/observer-2.17/doc/html/observer_ug.html │ │ │ -rw-r--r-- 0 root (0) root (0) 5941 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/observer-2.17/doc/html/search.html │ │ │ -rw-r--r-- 0 root (0) root (0) 111981 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/observer-2.17/doc/html/ttb.html │ │ │ -rw-r--r-- 0 root (0) root (0) 165996 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/observer-2.17/doc/html/ttb_ug.html │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/odbc-2.15/ │ │ │ @@ -1381,15 +1381,15 @@ │ │ │ -rw-r--r-- 0 root (0) root (0) 76343 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/odbc-2.15/doc/html/dist/search_data-D78563F6.js │ │ │ -rw-r--r-- 0 root (0) root (0) 7406 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/odbc-2.15/doc/html/dist/sidebar_items-19ECDBA9.js │ │ │ -rw-r--r-- 0 root (0) root (0) 13859 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/odbc-2.15/doc/html/error_handling.html │ │ │ -rw-r--r-- 0 root (0) root (0) 51373 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/odbc-2.15/doc/html/getting_started.html │ │ │ -rw-r--r-- 0 root (0) root (0) 261 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/odbc-2.15/doc/html/index.html │ │ │ -rw-r--r-- 0 root (0) root (0) 8466 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/odbc-2.15/doc/html/introduction.html │ │ │ -rw-r--r-- 0 root (0) root (0) 57071 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/odbc-2.15/doc/html/notes.html │ │ │ --rw-r--r-- 0 root (0) root (0) 67287 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/odbc-2.15/doc/html/odbc.epub │ │ │ +-rw-r--r-- 0 root (0) root (0) 67292 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/odbc-2.15/doc/html/odbc.epub │ │ │ -rw-r--r-- 0 root (0) root (0) 76660 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/odbc-2.15/doc/html/odbc.html │ │ │ -rw-r--r-- 0 root (0) root (0) 5917 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/odbc-2.15/doc/html/search.html │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/os_mon-2.10.1/ │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/os_mon-2.10.1/doc/ │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/os_mon-2.10.1/doc/html/ │ │ │ -rw-r--r-- 0 root (0) root (0) 952 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/os_mon-2.10.1/doc/html/.build │ │ │ -rw-r--r-- 0 root (0) root (0) 6019 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/os_mon-2.10.1/doc/html/404.html │ │ │ @@ -1522,15 +1522,15 @@ │ │ │ -rw-r--r-- 0 root (0) root (0) 5472 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/reltool-1.0.1/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5368 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/reltool-1.0.1/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 1956 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/reltool-1.0.1/doc/html/dist/remixicon-NKANDIL5.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 90283 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/reltool-1.0.1/doc/html/dist/search_data-8726EDEC.js │ │ │ -rw-r--r-- 0 root (0) root (0) 8840 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/reltool-1.0.1/doc/html/dist/sidebar_items-DF937488.js │ │ │ -rw-r--r-- 0 root (0) root (0) 265 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/reltool-1.0.1/doc/html/index.html │ │ │ -rw-r--r-- 0 root (0) root (0) 46277 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/reltool-1.0.1/doc/html/notes.html │ │ │ --rw-r--r-- 0 root (0) root (0) 62978 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/reltool-1.0.1/doc/html/reltool.epub │ │ │ +-rw-r--r-- 0 root (0) root (0) 62974 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/reltool-1.0.1/doc/html/reltool.epub │ │ │ -rw-r--r-- 0 root (0) root (0) 100627 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/reltool-1.0.1/doc/html/reltool.html │ │ │ -rw-r--r-- 0 root (0) root (0) 200434 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/reltool-1.0.1/doc/html/reltool_examples.html │ │ │ -rw-r--r-- 0 root (0) root (0) 9368 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/reltool-1.0.1/doc/html/reltool_intro.html │ │ │ -rw-r--r-- 0 root (0) root (0) 23138 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/reltool-1.0.1/doc/html/reltool_usage.html │ │ │ -rw-r--r-- 0 root (0) root (0) 5938 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/reltool-1.0.1/doc/html/search.html │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/runtime_tools-2.1.1/ │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/runtime_tools-2.1.1/doc/ │ │ │ @@ -1564,15 +1564,15 @@ │ │ │ -rw-r--r-- 0 root (0) root (0) 9774 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/runtime_tools-2.1.1/doc/html/dtrace.html │ │ │ -rw-r--r-- 0 root (0) root (0) 47868 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/runtime_tools-2.1.1/doc/html/dyntrace.html │ │ │ -rw-r--r-- 0 root (0) root (0) 271 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/runtime_tools-2.1.1/doc/html/index.html │ │ │ -rw-r--r-- 0 root (0) root (0) 50868 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/runtime_tools-2.1.1/doc/html/instrument.html │ │ │ -rw-r--r-- 0 root (0) root (0) 64811 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/runtime_tools-2.1.1/doc/html/lttng.html │ │ │ -rw-r--r-- 0 root (0) root (0) 50090 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/runtime_tools-2.1.1/doc/html/msacc.html │ │ │ -rw-r--r-- 0 root (0) root (0) 78751 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/runtime_tools-2.1.1/doc/html/notes.html │ │ │ --rw-r--r-- 0 root (0) root (0) 118820 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/runtime_tools-2.1.1/doc/html/runtime_tools.epub │ │ │ +-rw-r--r-- 0 root (0) root (0) 118804 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/runtime_tools-2.1.1/doc/html/runtime_tools.epub │ │ │ -rw-r--r-- 0 root (0) root (0) 7584 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/runtime_tools-2.1.1/doc/html/runtime_tools_app.html │ │ │ -rw-r--r-- 0 root (0) root (0) 29115 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/runtime_tools-2.1.1/doc/html/scheduler.html │ │ │ -rw-r--r-- 0 root (0) root (0) 5974 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/runtime_tools-2.1.1/doc/html/search.html │ │ │ -rw-r--r-- 0 root (0) root (0) 12911 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/runtime_tools-2.1.1/doc/html/system_information.html │ │ │ -rw-r--r-- 0 root (0) root (0) 9992 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/runtime_tools-2.1.1/doc/html/systemtap.html │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/sasl-4.2.2.1/ │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/sasl-4.2.2.1/doc/ │ │ │ @@ -1607,15 +1607,15 @@ │ │ │ -rw-r--r-- 0 root (0) root (0) 34692 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/sasl-4.2.2.1/doc/html/error_logging.html │ │ │ -rw-r--r-- 0 root (0) root (0) 264 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/sasl-4.2.2.1/doc/html/index.html │ │ │ -rw-r--r-- 0 root (0) root (0) 70704 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/sasl-4.2.2.1/doc/html/notes.html │ │ │ -rw-r--r-- 0 root (0) root (0) 42554 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/sasl-4.2.2.1/doc/html/rb.html │ │ │ -rw-r--r-- 0 root (0) root (0) 12226 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/sasl-4.2.2.1/doc/html/rel.html │ │ │ -rw-r--r-- 0 root (0) root (0) 80666 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/sasl-4.2.2.1/doc/html/release_handler.html │ │ │ -rw-r--r-- 0 root (0) root (0) 9583 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/sasl-4.2.2.1/doc/html/relup.html │ │ │ --rw-r--r-- 0 root (0) root (0) 92449 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/sasl-4.2.2.1/doc/html/sasl.epub │ │ │ +-rw-r--r-- 0 root (0) root (0) 92453 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/sasl-4.2.2.1/doc/html/sasl.epub │ │ │ -rw-r--r-- 0 root (0) root (0) 17199 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/sasl-4.2.2.1/doc/html/sasl_app.html │ │ │ -rw-r--r-- 0 root (0) root (0) 7705 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/sasl-4.2.2.1/doc/html/sasl_intro.html │ │ │ -rw-r--r-- 0 root (0) root (0) 17275 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/sasl-4.2.2.1/doc/html/script.html │ │ │ -rw-r--r-- 0 root (0) root (0) 5926 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/sasl-4.2.2.1/doc/html/search.html │ │ │ -rw-r--r-- 0 root (0) root (0) 40711 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/sasl-4.2.2.1/doc/html/systools.html │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/snmp-5.18.2/ │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/snmp-5.18.2/doc/ │ │ │ @@ -1745,15 +1745,15 @@ │ │ │ -rw-r--r-- 0 root (0) root (0) 373816 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ssh-5.2.11.7/doc/html/dist/search_data-B2C75D26.js │ │ │ -rw-r--r-- 0 root (0) root (0) 46168 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ssh-5.2.11.7/doc/html/dist/sidebar_items-9B02B7D5.js │ │ │ -rw-r--r-- 0 root (0) root (0) 27804 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ssh-5.2.11.7/doc/html/hardening.html │ │ │ -rw-r--r-- 0 root (0) root (0) 264 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ssh-5.2.11.7/doc/html/index.html │ │ │ -rw-r--r-- 0 root (0) root (0) 14206 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ssh-5.2.11.7/doc/html/introduction.html │ │ │ -rw-r--r-- 0 root (0) root (0) 235654 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ssh-5.2.11.7/doc/html/notes.html │ │ │ -rw-r--r-- 0 root (0) root (0) 5923 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ssh-5.2.11.7/doc/html/search.html │ │ │ --rw-r--r-- 0 root (0) root (0) 274575 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ssh-5.2.11.7/doc/html/ssh.epub │ │ │ +-rw-r--r-- 0 root (0) root (0) 274578 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ssh-5.2.11.7/doc/html/ssh.epub │ │ │ -rw-r--r-- 0 root (0) root (0) 250458 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ssh-5.2.11.7/doc/html/ssh.html │ │ │ -rw-r--r-- 0 root (0) root (0) 24859 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ssh-5.2.11.7/doc/html/ssh_agent.html │ │ │ -rw-r--r-- 0 root (0) root (0) 25764 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ssh-5.2.11.7/doc/html/ssh_app.html │ │ │ -rw-r--r-- 0 root (0) root (0) 44362 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ssh-5.2.11.7/doc/html/ssh_client_channel.html │ │ │ -rw-r--r-- 0 root (0) root (0) 23335 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ssh-5.2.11.7/doc/html/ssh_client_key_api.html │ │ │ -rw-r--r-- 0 root (0) root (0) 78399 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ssh-5.2.11.7/doc/html/ssh_connection.html │ │ │ -rw-r--r-- 0 root (0) root (0) 49063 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ssh-5.2.11.7/doc/html/ssh_file.html │ │ │ @@ -1790,15 +1790,15 @@ │ │ │ -rw-r--r-- 0 root (0) root (0) 5368 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ssl-11.2.12.7/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 1956 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ssl-11.2.12.7/doc/html/dist/remixicon-NKANDIL5.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 491166 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ssl-11.2.12.7/doc/html/dist/search_data-66B4354E.js │ │ │ -rw-r--r-- 0 root (0) root (0) 27434 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ssl-11.2.12.7/doc/html/dist/sidebar_items-4EB419B0.js │ │ │ -rw-r--r-- 0 root (0) root (0) 265 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ssl-11.2.12.7/doc/html/index.html │ │ │ -rw-r--r-- 0 root (0) root (0) 259463 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ssl-11.2.12.7/doc/html/notes.html │ │ │ -rw-r--r-- 0 root (0) root (0) 5926 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ssl-11.2.12.7/doc/html/search.html │ │ │ --rw-r--r-- 0 root (0) root (0) 213577 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ssl-11.2.12.7/doc/html/ssl.epub │ │ │ +-rw-r--r-- 0 root (0) root (0) 213587 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ssl-11.2.12.7/doc/html/ssl.epub │ │ │ -rw-r--r-- 0 root (0) root (0) 322702 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ssl-11.2.12.7/doc/html/ssl.html │ │ │ -rw-r--r-- 0 root (0) root (0) 17362 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ssl-11.2.12.7/doc/html/ssl_app.html │ │ │ -rw-r--r-- 0 root (0) root (0) 12890 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ssl-11.2.12.7/doc/html/ssl_crl_cache.html │ │ │ -rw-r--r-- 0 root (0) root (0) 21815 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ssl-11.2.12.7/doc/html/ssl_crl_cache_api.html │ │ │ -rw-r--r-- 0 root (0) root (0) 39391 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ssl-11.2.12.7/doc/html/ssl_distribution.html │ │ │ -rw-r--r-- 0 root (0) root (0) 14213 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ssl-11.2.12.7/doc/html/ssl_protocol.html │ │ │ -rw-r--r-- 0 root (0) root (0) 25887 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/ssl-11.2.12.7/doc/html/ssl_session_cache_api.html │ │ │ @@ -1838,15 +1838,15 @@ │ │ │ -rw-r--r-- 0 root (0) root (0) 23236 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/dist/lato-latin-300-normal-YUMVEFOL.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 23580 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/dist/lato-latin-400-normal-W7754I4D.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 23040 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/dist/lato-latin-700-normal-2XVSBPG4.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5624 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/dist/lato-latin-ext-300-normal-VPGGJKJL.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5472 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5368 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 1956 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/dist/remixicon-NKANDIL5.woff2 │ │ │ --rw-r--r-- 0 root (0) root (0) 1846642 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/dist/search_data-0C02F667.js │ │ │ +-rw-r--r-- 0 root (0) root (0) 1846642 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/dist/search_data-BB0E13B7.js │ │ │ -rw-r--r-- 0 root (0) root (0) 241821 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/dist/sidebar_items-79C80363.js │ │ │ -rw-r--r-- 0 root (0) root (0) 18711 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/edlin.html │ │ │ -rw-r--r-- 0 root (0) root (0) 15308 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/edlin_expand.html │ │ │ -rw-r--r-- 0 root (0) root (0) 52741 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/epp.html │ │ │ -rw-r--r-- 0 root (0) root (0) 41182 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/erl_anno.html │ │ │ -rw-r--r-- 0 root (0) root (0) 34129 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/erl_error.html │ │ │ -rw-r--r-- 0 root (0) root (0) 57502 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/erl_eval.html │ │ │ @@ -1896,15 +1896,15 @@ │ │ │ -rw-r--r-- 0 root (0) root (0) 5938 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/search.html │ │ │ -rw-r--r-- 0 root (0) root (0) 47294 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/sets.html │ │ │ -rw-r--r-- 0 root (0) root (0) 106633 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/shell.html │ │ │ -rw-r--r-- 0 root (0) root (0) 10167 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/shell_default.html │ │ │ -rw-r--r-- 0 root (0) root (0) 49822 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/shell_docs.html │ │ │ -rw-r--r-- 0 root (0) root (0) 33204 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/slave.html │ │ │ -rw-r--r-- 0 root (0) root (0) 354831 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/sofs.html │ │ │ --rw-r--r-- 0 root (0) root (0) 1410902 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/stdlib.epub │ │ │ +-rw-r--r-- 0 root (0) root (0) 1410937 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/stdlib.epub │ │ │ -rw-r--r-- 0 root (0) root (0) 15682 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/stdlib_app.html │ │ │ -rw-r--r-- 0 root (0) root (0) 192390 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/string.html │ │ │ -rw-r--r-- 0 root (0) root (0) 93086 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/supervisor.html │ │ │ -rw-r--r-- 0 root (0) root (0) 20623 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/supervisor_bridge.html │ │ │ -rw-r--r-- 0 root (0) root (0) 107262 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/sys.html │ │ │ -rw-r--r-- 0 root (0) root (0) 81772 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/timer.html │ │ │ -rw-r--r-- 0 root (0) root (0) 75028 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/stdlib-6.2.2.3/doc/html/unicode.html │ │ │ @@ -1937,15 +1937,15 @@ │ │ │ -rw-r--r-- 0 root (0) root (0) 23236 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/syntax_tools-3.2.2.2/doc/html/dist/lato-latin-300-normal-YUMVEFOL.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 23580 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/syntax_tools-3.2.2.2/doc/html/dist/lato-latin-400-normal-W7754I4D.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 23040 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/syntax_tools-3.2.2.2/doc/html/dist/lato-latin-700-normal-2XVSBPG4.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5624 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/syntax_tools-3.2.2.2/doc/html/dist/lato-latin-ext-300-normal-VPGGJKJL.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5472 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/syntax_tools-3.2.2.2/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5368 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/syntax_tools-3.2.2.2/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 1956 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/syntax_tools-3.2.2.2/doc/html/dist/remixicon-NKANDIL5.woff2 │ │ │ --rw-r--r-- 0 root (0) root (0) 212519 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/syntax_tools-3.2.2.2/doc/html/dist/search_data-1D7BB8C0.js │ │ │ +-rw-r--r-- 0 root (0) root (0) 212519 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/syntax_tools-3.2.2.2/doc/html/dist/search_data-B09DB05B.js │ │ │ -rw-r--r-- 0 root (0) root (0) 52682 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/syntax_tools-3.2.2.2/doc/html/dist/sidebar_items-2B4A1108.js │ │ │ -rw-r--r-- 0 root (0) root (0) 37822 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/syntax_tools-3.2.2.2/doc/html/epp_dodger.html │ │ │ -rw-r--r-- 0 root (0) root (0) 17453 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/syntax_tools-3.2.2.2/doc/html/erl_comment_scan.html │ │ │ -rw-r--r-- 0 root (0) root (0) 39814 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/syntax_tools-3.2.2.2/doc/html/erl_prettypr.html │ │ │ -rw-r--r-- 0 root (0) root (0) 17404 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/syntax_tools-3.2.2.2/doc/html/erl_recomment.html │ │ │ -rw-r--r-- 0 root (0) root (0) 509513 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/syntax_tools-3.2.2.2/doc/html/erl_syntax.html │ │ │ -rw-r--r-- 0 root (0) root (0) 112150 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/syntax_tools-3.2.2.2/doc/html/erl_syntax_lib.html │ │ │ @@ -1977,15 +1977,15 @@ │ │ │ -rw-r--r-- 0 root (0) root (0) 23236 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tftp-1.2.2.1/doc/html/dist/lato-latin-300-normal-YUMVEFOL.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 23580 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tftp-1.2.2.1/doc/html/dist/lato-latin-400-normal-W7754I4D.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 23040 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tftp-1.2.2.1/doc/html/dist/lato-latin-700-normal-2XVSBPG4.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5624 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tftp-1.2.2.1/doc/html/dist/lato-latin-ext-300-normal-VPGGJKJL.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5472 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tftp-1.2.2.1/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5368 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tftp-1.2.2.1/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 1956 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tftp-1.2.2.1/doc/html/dist/remixicon-NKANDIL5.woff2 │ │ │ --rw-r--r-- 0 root (0) root (0) 26219 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tftp-1.2.2.1/doc/html/dist/search_data-654EBB26.js │ │ │ +-rw-r--r-- 0 root (0) root (0) 26219 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tftp-1.2.2.1/doc/html/dist/search_data-F3ACFEF4.js │ │ │ -rw-r--r-- 0 root (0) root (0) 3089 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tftp-1.2.2.1/doc/html/dist/sidebar_items-F16FBB4B.js │ │ │ -rw-r--r-- 0 root (0) root (0) 10557 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tftp-1.2.2.1/doc/html/getting_started.html │ │ │ -rw-r--r-- 0 root (0) root (0) 264 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tftp-1.2.2.1/doc/html/index.html │ │ │ -rw-r--r-- 0 root (0) root (0) 8818 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tftp-1.2.2.1/doc/html/introduction.html │ │ │ -rw-r--r-- 0 root (0) root (0) 16338 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tftp-1.2.2.1/doc/html/notes.html │ │ │ -rw-r--r-- 0 root (0) root (0) 5926 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tftp-1.2.2.1/doc/html/search.html │ │ │ -rw-r--r-- 0 root (0) root (0) 30486 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tftp-1.2.2.1/doc/html/tftp.epub │ │ │ @@ -2019,36 +2019,36 @@ │ │ │ -rw-r--r-- 0 root (0) root (0) 23236 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/dist/lato-latin-300-normal-YUMVEFOL.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 23580 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/dist/lato-latin-400-normal-W7754I4D.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 23040 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/dist/lato-latin-700-normal-2XVSBPG4.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5624 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/dist/lato-latin-ext-300-normal-VPGGJKJL.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5472 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5368 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 1956 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/dist/remixicon-NKANDIL5.woff2 │ │ │ --rw-r--r-- 0 root (0) root (0) 305159 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/dist/search_data-074D3797.js │ │ │ +-rw-r--r-- 0 root (0) root (0) 305159 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/dist/search_data-6515C1E6.js │ │ │ -rw-r--r-- 0 root (0) root (0) 36457 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/dist/sidebar_items-11035E81.js │ │ │ -rw-r--r-- 0 root (0) root (0) 42782 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/eprof.html │ │ │ -rw-r--r-- 0 root (0) root (0) 28459 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/erlang-el.html │ │ │ -rw-r--r-- 0 root (0) root (0) 18986 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/erlang_mode_chapter.html │ │ │ -rw-r--r-- 0 root (0) root (0) 132091 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/fprof.html │ │ │ -rw-r--r-- 0 root (0) root (0) 12996 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/fprof_chapter.html │ │ │ -rw-r--r-- 0 root (0) root (0) 263 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/index.html │ │ │ -rw-r--r-- 0 root (0) root (0) 67398 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/lcnt.html │ │ │ -rw-r--r-- 0 root (0) root (0) 53463 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/lcnt_chapter.html │ │ │ -rw-r--r-- 0 root (0) root (0) 18424 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/make.html │ │ │ -rw-r--r-- 0 root (0) root (0) 107061 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/notes.html │ │ │ -rw-r--r-- 0 root (0) root (0) 5926 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/search.html │ │ │ -rw-r--r-- 0 root (0) root (0) 28575 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/tags.html │ │ │ --rw-r--r-- 0 root (0) root (0) 239378 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/tools.epub │ │ │ +-rw-r--r-- 0 root (0) root (0) 239377 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/tools.epub │ │ │ -rw-r--r-- 0 root (0) root (0) 174030 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/tprof.html │ │ │ -rw-r--r-- 0 root (0) root (0) 184557 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/xref.html │ │ │ -rw-r--r-- 0 root (0) root (0) 39639 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/tools-4.1.1/doc/html/xref_chapter.html │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/ │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/ │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/ │ │ │ --rw-r--r-- 0 root (0) root (0) 1610 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/.build.gz │ │ │ +-rw-r--r-- 0 root (0) root (0) 1612 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/.build.gz │ │ │ -rw-r--r-- 0 root (0) root (0) 5998 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/404.html │ │ │ -rw-r--r-- 0 root (0) root (0) 81462 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/api-reference.html │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/assets/ │ │ │ -rw-r--r-- 0 root (0) root (0) 5837 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/assets/logo.png │ │ │ -rw-r--r-- 0 root (0) root (0) 23126 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/chapter.html │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/dist/ │ │ │ -rw-r--r-- 0 root (0) root (0) 20933 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/dist/handlebars.runtime-CFQAK6SD.js │ │ │ @@ -2064,22 +2064,22 @@ │ │ │ -rw-r--r-- 0 root (0) root (0) 23236 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/dist/lato-latin-300-normal-YUMVEFOL.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 23580 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/dist/lato-latin-400-normal-W7754I4D.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 23040 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/dist/lato-latin-700-normal-2XVSBPG4.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5624 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/dist/lato-latin-ext-300-normal-VPGGJKJL.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5472 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/dist/lato-latin-ext-400-normal-N27NCBWW.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 5368 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/dist/lato-latin-ext-700-normal-Q2L5DVMW.woff2 │ │ │ -rw-r--r-- 0 root (0) root (0) 1956 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/dist/remixicon-NKANDIL5.woff2 │ │ │ --rw-r--r-- 0 root (0) root (0) 1665163 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/dist/search_data-18EDDFD7.js │ │ │ +-rw-r--r-- 0 root (0) root (0) 1665163 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/dist/search_data-C8002B3E.js │ │ │ -rw-r--r-- 0 root (0) root (0) 578685 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/dist/sidebar_items-F7AE20D7.js │ │ │ -rw-r--r-- 0 root (0) root (0) 1720405 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/gl.html │ │ │ -rw-r--r-- 0 root (0) root (0) 77348 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/glu.html │ │ │ -rw-r--r-- 0 root (0) root (0) 262 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/index.html │ │ │ -rw-r--r-- 0 root (0) root (0) 59333 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/notes.html │ │ │ -rw-r--r-- 0 root (0) root (0) 5914 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/search.html │ │ │ --rw-r--r-- 0 root (0) root (0) 1607643 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/wx.epub │ │ │ +-rw-r--r-- 0 root (0) root (0) 1607641 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/wx.epub │ │ │ -rw-r--r-- 0 root (0) root (0) 54025 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/wx.html │ │ │ -rw-r--r-- 0 root (0) root (0) 19460 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/wxAcceleratorEntry.html │ │ │ -rw-r--r-- 0 root (0) root (0) 15138 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/wxAcceleratorTable.html │ │ │ -rw-r--r-- 0 root (0) root (0) 12381 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/wxActivateEvent.html │ │ │ -rw-r--r-- 0 root (0) root (0) 19135 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/wxArtProvider.html │ │ │ -rw-r--r-- 0 root (0) root (0) 17647 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/wxAuiDockArt.html │ │ │ -rw-r--r-- 0 root (0) root (0) 63051 2026-04-22 08:03:21.000000 ./usr/share/doc/erlang-doc/html/lib/wx-2.4.3.1/doc/html/wxAuiManager.html │ │ ├── ./usr/share/doc/erlang-doc/html/doc/system/Erlang System Documentation.epub │ │ │ ├── zipinfo {} │ │ │ │ @@ -1,93 +1,93 @@ │ │ │ │ -Zip file size: 655233 bytes, number of entries: 91 │ │ │ │ -?rw-r--r-- 6.1 unx 20 bx stor 26-Apr-22 09:07 mimetype │ │ │ │ -?rw-r--r-- 6.1 unx 17923 bx defN 26-Apr-22 09:07 OEBPS/versions.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 4674 bx defN 26-Apr-22 09:07 OEBPS/upgrade.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 53440 bx defN 26-Apr-22 09:07 OEBPS/typespec.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 2167 bx defN 26-Apr-22 09:07 OEBPS/tutorial.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 766 bx defN 26-Apr-22 09:07 OEBPS/title.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 46257 bx defN 26-Apr-22 09:07 OEBPS/tablesdatabases.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 12467 bx defN 26-Apr-22 09:07 OEBPS/system_principles.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 7347 bx defN 26-Apr-22 09:07 OEBPS/system_limits.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 63477 bx defN 26-Apr-22 09:07 OEBPS/sup_princ.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 254034 bx defN 26-Apr-22 09:07 OEBPS/statem.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 111725 bx defN 26-Apr-22 09:07 OEBPS/spec_proc.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 251286 bx defN 26-Apr-22 09:07 OEBPS/seq_prog.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 70944 bx defN 26-Apr-22 09:07 OEBPS/robustness.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 20878 bx defN 26-Apr-22 09:07 OEBPS/release_structure.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 59981 bx defN 26-Apr-22 09:07 OEBPS/release_handling.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 4597 bx defN 26-Apr-22 09:07 OEBPS/reference_manual.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 19456 bx defN 26-Apr-22 09:07 OEBPS/ref_man_records.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 48277 bx defN 26-Apr-22 09:07 OEBPS/ref_man_processes.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 14478 bx defN 26-Apr-22 09:07 OEBPS/ref_man_functions.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 49543 bx defN 26-Apr-22 09:07 OEBPS/records_macros.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 2191 bx defN 26-Apr-22 09:07 OEBPS/readme.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 786 bx defN 26-Apr-22 09:07 OEBPS/programming_examples.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 40217 bx defN 26-Apr-22 09:07 OEBPS/prog_ex_records.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 15207 bx defN 26-Apr-22 09:07 OEBPS/profiling.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 8502 bx defN 26-Apr-22 09:07 OEBPS/ports.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 3853 bx defN 26-Apr-22 09:07 OEBPS/patterns.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 13418 bx defN 26-Apr-22 09:07 OEBPS/overview.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 8960 bx defN 26-Apr-22 09:07 OEBPS/otp-patch-apply.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 9083 bx defN 26-Apr-22 09:07 OEBPS/opaques.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 14135 bx defN 26-Apr-22 09:07 OEBPS/nif.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 6368 bx defN 26-Apr-22 09:07 OEBPS/nav.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 25843 bx defN 26-Apr-22 09:07 OEBPS/modules.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 7013 bx defN 26-Apr-22 09:07 OEBPS/misc.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 5478 bx defN 26-Apr-22 09:07 OEBPS/memory.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 45533 bx defN 26-Apr-22 09:07 OEBPS/maps.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 39595 bx defN 26-Apr-22 09:07 OEBPS/macros.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 31440 bx defN 26-Apr-22 09:07 OEBPS/listhandling.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 43066 bx defN 26-Apr-22 09:07 OEBPS/list_comprehensions.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 2212 bx defN 26-Apr-22 09:07 OEBPS/installation_guide.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 55528 bx defN 26-Apr-22 09:07 OEBPS/install.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 28230 bx defN 26-Apr-22 09:07 OEBPS/install-win32.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 35716 bx defN 26-Apr-22 09:07 OEBPS/install-cross.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 20859 bx defN 26-Apr-22 09:07 OEBPS/included_applications.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 2354 bx defN 26-Apr-22 09:07 OEBPS/getting_started.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 31342 bx defN 26-Apr-22 09:07 OEBPS/gen_server_concepts.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 119136 bx defN 26-Apr-22 09:07 OEBPS/funs.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 8454 bx defN 26-Apr-22 09:07 OEBPS/features.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 256795 bx defN 26-Apr-22 09:07 OEBPS/expressions.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 2366 bx defN 26-Apr-22 09:07 OEBPS/example.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 26771 bx defN 26-Apr-22 09:07 OEBPS/events.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 16653 bx defN 26-Apr-22 09:07 OEBPS/errors.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 13610 bx defN 26-Apr-22 09:07 OEBPS/error_logging.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 42617 bx defN 26-Apr-22 09:07 OEBPS/erl_interface.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 18221 bx defN 26-Apr-22 09:07 OEBPS/embedded.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 2086 bx defN 26-Apr-22 09:07 OEBPS/efficiency_guide.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 46586 bx defN 26-Apr-22 09:07 OEBPS/eff_guide_processes.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 21210 bx defN 26-Apr-22 09:07 OEBPS/eff_guide_functions.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 9339 bx defN 26-Apr-22 09:07 OEBPS/drivers.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 47181 bx defN 26-Apr-22 09:07 OEBPS/documentation.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 14893 bx defN 26-Apr-22 09:07 OEBPS/distributed_applications.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 24377 bx defN 26-Apr-22 09:07 OEBPS/distributed.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 14562 bx defN 26-Apr-22 09:07 OEBPS/dist/epub-erlang-ESPT6BQV.css │ │ │ │ -?rw-r--r-- 6.1 unx 499 bx defN 26-Apr-22 09:07 OEBPS/dist/epub-LSJCIYTM.js │ │ │ │ -?rw-r--r-- 6.1 unx 36781 bx defN 26-Apr-22 09:07 OEBPS/design_principles.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 15004 bx defN 26-Apr-22 09:07 OEBPS/debugging.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 72899 bx defN 26-Apr-22 09:07 OEBPS/data_types.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 115068 bx defN 26-Apr-22 09:07 OEBPS/create_target.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 13188 bx defN 26-Apr-22 09:07 OEBPS/content.opf │ │ │ │ -?rw-r--r-- 6.1 unx 130016 bx defN 26-Apr-22 09:07 OEBPS/conc_prog.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 33232 bx defN 26-Apr-22 09:07 OEBPS/commoncaveats.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 11936 bx defN 26-Apr-22 09:07 OEBPS/code_loading.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 804 bx defN 26-Apr-22 09:07 OEBPS/cnode.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 5178 bx defN 26-Apr-22 09:07 OEBPS/character_set.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 40800 bx defN 26-Apr-22 09:07 OEBPS/c_portdriver.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 35603 bx defN 26-Apr-22 09:07 OEBPS/c_port.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 34820 bx defN 26-Apr-22 09:07 OEBPS/bit_syntax.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 53328 bx defN 26-Apr-22 09:07 OEBPS/binaryhandling.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 7607 bx defN 26-Apr-22 09:07 OEBPS/benchmarking.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 5837 bx defN 26-Apr-22 09:07 OEBPS/assets/logo.png │ │ │ │ -?rw-r--r-- 6.1 unx 5837 bx defN 26-Apr-22 09:07 OEBPS/assets/erlang-logo.png │ │ │ │ -?rw-r--r-- 6.1 unx 7044 bx stor 26-Apr-22 09:07 OEBPS/assets/dist5.gif │ │ │ │ -?rw-r--r-- 6.1 unx 2939 bx stor 26-Apr-22 09:07 OEBPS/assets/dist4.gif │ │ │ │ -?rw-r--r-- 6.1 unx 5007 bx stor 26-Apr-22 09:07 OEBPS/assets/dist3.gif │ │ │ │ -?rw-r--r-- 6.1 unx 5214 bx stor 26-Apr-22 09:07 OEBPS/assets/dist2.gif │ │ │ │ -?rw-r--r-- 6.1 unx 2284 bx stor 26-Apr-22 09:07 OEBPS/assets/dist1.gif │ │ │ │ -?rw-r--r-- 6.1 unx 7982 bx stor 26-Apr-22 09:07 OEBPS/assets/ballpoint-pen.svg │ │ │ │ -?rw-r--r-- 6.1 unx 91722 bx defN 26-Apr-22 09:07 OEBPS/appup_cookbook.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 47930 bx defN 26-Apr-22 09:07 OEBPS/applications.xhtml │ │ │ │ -?rw-r--r-- 6.1 unx 252 bx defN 26-Apr-22 09:07 META-INF/container.xml │ │ │ │ -?rw-r--r-- 6.1 unx 162 bx defN 26-Apr-22 09:07 META-INF/com.apple.ibooks.display-options.xml │ │ │ │ -91 files, 3084496 bytes uncompressed, 639301 bytes compressed: 79.3% │ │ │ │ +Zip file size: 655215 bytes, number of entries: 91 │ │ │ │ +?rw-r--r-- 6.1 unx 20 bx stor 26-Apr-27 16:44 mimetype │ │ │ │ +?rw-r--r-- 6.1 unx 17923 bx defN 26-Apr-27 16:44 OEBPS/versions.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 4674 bx defN 26-Apr-27 16:44 OEBPS/upgrade.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 53440 bx defN 26-Apr-27 16:44 OEBPS/typespec.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 2167 bx defN 26-Apr-27 16:44 OEBPS/tutorial.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 766 bx defN 26-Apr-27 16:44 OEBPS/title.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 46257 bx defN 26-Apr-27 16:44 OEBPS/tablesdatabases.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 12467 bx defN 26-Apr-27 16:44 OEBPS/system_principles.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 7347 bx defN 26-Apr-27 16:44 OEBPS/system_limits.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 63477 bx defN 26-Apr-27 16:44 OEBPS/sup_princ.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 254034 bx defN 26-Apr-27 16:44 OEBPS/statem.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 111725 bx defN 26-Apr-27 16:44 OEBPS/spec_proc.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 251286 bx defN 26-Apr-27 16:44 OEBPS/seq_prog.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 70944 bx defN 26-Apr-27 16:44 OEBPS/robustness.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 20878 bx defN 26-Apr-27 16:44 OEBPS/release_structure.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 59981 bx defN 26-Apr-27 16:44 OEBPS/release_handling.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 4597 bx defN 26-Apr-27 16:44 OEBPS/reference_manual.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 19456 bx defN 26-Apr-27 16:44 OEBPS/ref_man_records.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 48277 bx defN 26-Apr-27 16:44 OEBPS/ref_man_processes.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 14478 bx defN 26-Apr-27 16:44 OEBPS/ref_man_functions.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 49543 bx defN 26-Apr-27 16:44 OEBPS/records_macros.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 2191 bx defN 26-Apr-27 16:44 OEBPS/readme.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 786 bx defN 26-Apr-27 16:44 OEBPS/programming_examples.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 40217 bx defN 26-Apr-27 16:44 OEBPS/prog_ex_records.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 15207 bx defN 26-Apr-27 16:44 OEBPS/profiling.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 8502 bx defN 26-Apr-27 16:44 OEBPS/ports.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 3853 bx defN 26-Apr-27 16:44 OEBPS/patterns.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 13418 bx defN 26-Apr-27 16:44 OEBPS/overview.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 8960 bx defN 26-Apr-27 16:44 OEBPS/otp-patch-apply.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 9083 bx defN 26-Apr-27 16:44 OEBPS/opaques.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 14135 bx defN 26-Apr-27 16:44 OEBPS/nif.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 6368 bx defN 26-Apr-27 16:44 OEBPS/nav.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 25843 bx defN 26-Apr-27 16:44 OEBPS/modules.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 7013 bx defN 26-Apr-27 16:44 OEBPS/misc.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 5478 bx defN 26-Apr-27 16:44 OEBPS/memory.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 45533 bx defN 26-Apr-27 16:44 OEBPS/maps.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 39595 bx defN 26-Apr-27 16:44 OEBPS/macros.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 31440 bx defN 26-Apr-27 16:44 OEBPS/listhandling.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 43066 bx defN 26-Apr-27 16:44 OEBPS/list_comprehensions.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 2212 bx defN 26-Apr-27 16:44 OEBPS/installation_guide.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 55528 bx defN 26-Apr-27 16:44 OEBPS/install.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 28230 bx defN 26-Apr-27 16:44 OEBPS/install-win32.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 35716 bx defN 26-Apr-27 16:44 OEBPS/install-cross.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 20859 bx defN 26-Apr-27 16:44 OEBPS/included_applications.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 2354 bx defN 26-Apr-27 16:44 OEBPS/getting_started.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 31342 bx defN 26-Apr-27 16:44 OEBPS/gen_server_concepts.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 119136 bx defN 26-Apr-27 16:44 OEBPS/funs.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 8454 bx defN 26-Apr-27 16:44 OEBPS/features.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 256795 bx defN 26-Apr-27 16:44 OEBPS/expressions.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 2366 bx defN 26-Apr-27 16:44 OEBPS/example.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 26771 bx defN 26-Apr-27 16:44 OEBPS/events.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 16653 bx defN 26-Apr-27 16:44 OEBPS/errors.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 13610 bx defN 26-Apr-27 16:44 OEBPS/error_logging.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 42617 bx defN 26-Apr-27 16:44 OEBPS/erl_interface.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 18221 bx defN 26-Apr-27 16:44 OEBPS/embedded.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 2086 bx defN 26-Apr-27 16:44 OEBPS/efficiency_guide.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 46586 bx defN 26-Apr-27 16:44 OEBPS/eff_guide_processes.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 21210 bx defN 26-Apr-27 16:44 OEBPS/eff_guide_functions.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 9339 bx defN 26-Apr-27 16:44 OEBPS/drivers.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 47181 bx defN 26-Apr-27 16:44 OEBPS/documentation.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 14893 bx defN 26-Apr-27 16:44 OEBPS/distributed_applications.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 24377 bx defN 26-Apr-27 16:44 OEBPS/distributed.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 14562 bx defN 26-Apr-27 16:44 OEBPS/dist/epub-erlang-ESPT6BQV.css │ │ │ │ +?rw-r--r-- 6.1 unx 499 bx defN 26-Apr-27 16:44 OEBPS/dist/epub-LSJCIYTM.js │ │ │ │ +?rw-r--r-- 6.1 unx 36781 bx defN 26-Apr-27 16:44 OEBPS/design_principles.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 15004 bx defN 26-Apr-27 16:44 OEBPS/debugging.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 72899 bx defN 26-Apr-27 16:44 OEBPS/data_types.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 115068 bx defN 26-Apr-27 16:44 OEBPS/create_target.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 13188 bx defN 26-Apr-27 16:44 OEBPS/content.opf │ │ │ │ +?rw-r--r-- 6.1 unx 130016 bx defN 26-Apr-27 16:44 OEBPS/conc_prog.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 33232 bx defN 26-Apr-27 16:44 OEBPS/commoncaveats.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 11936 bx defN 26-Apr-27 16:44 OEBPS/code_loading.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 804 bx defN 26-Apr-27 16:44 OEBPS/cnode.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 5178 bx defN 26-Apr-27 16:44 OEBPS/character_set.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 40800 bx defN 26-Apr-27 16:44 OEBPS/c_portdriver.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 35603 bx defN 26-Apr-27 16:44 OEBPS/c_port.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 34820 bx defN 26-Apr-27 16:44 OEBPS/bit_syntax.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 53328 bx defN 26-Apr-27 16:44 OEBPS/binaryhandling.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 7607 bx defN 26-Apr-27 16:44 OEBPS/benchmarking.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 5837 bx defN 26-Apr-27 16:44 OEBPS/assets/logo.png │ │ │ │ +?rw-r--r-- 6.1 unx 5837 bx defN 26-Apr-27 16:44 OEBPS/assets/erlang-logo.png │ │ │ │ +?rw-r--r-- 6.1 unx 7044 bx stor 26-Apr-27 16:44 OEBPS/assets/dist5.gif │ │ │ │ +?rw-r--r-- 6.1 unx 2939 bx stor 26-Apr-27 16:44 OEBPS/assets/dist4.gif │ │ │ │ +?rw-r--r-- 6.1 unx 5007 bx stor 26-Apr-27 16:44 OEBPS/assets/dist3.gif │ │ │ │ +?rw-r--r-- 6.1 unx 5214 bx stor 26-Apr-27 16:44 OEBPS/assets/dist2.gif │ │ │ │ +?rw-r--r-- 6.1 unx 2284 bx stor 26-Apr-27 16:44 OEBPS/assets/dist1.gif │ │ │ │ +?rw-r--r-- 6.1 unx 7982 bx stor 26-Apr-27 16:44 OEBPS/assets/ballpoint-pen.svg │ │ │ │ +?rw-r--r-- 6.1 unx 91722 bx defN 26-Apr-27 16:44 OEBPS/appup_cookbook.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 47930 bx defN 26-Apr-27 16:44 OEBPS/applications.xhtml │ │ │ │ +?rw-r--r-- 6.1 unx 252 bx defN 26-Apr-27 16:44 META-INF/container.xml │ │ │ │ +?rw-r--r-- 6.1 unx 162 bx defN 26-Apr-27 16:44 META-INF/com.apple.ibooks.display-options.xml │ │ │ │ +91 files, 3084496 bytes uncompressed, 639283 bytes compressed: 79.3% │ │ │ ├── zipdetails --redact --walk --utc {} │ │ │ │ @@ -1,29 +1,29 @@ │ │ │ │ │ │ │ │ 00000 LOCAL HEADER #1 04034B50 (67324752) │ │ │ │ 00004 Extract Zip Spec 0A (10) '1.0' │ │ │ │ 00005 Extract OS 00 (0) 'MS-DOS' │ │ │ │ 00006 General Purpose Flag 0000 (0) │ │ │ │ 00008 Compression Method 0000 (0) 'Stored' │ │ │ │ -0000A Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ +0000A Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ 0000E CRC 2CAB616F (749429103) │ │ │ │ 00012 Compressed Size 00000014 (20) │ │ │ │ 00016 Uncompressed Size 00000014 (20) │ │ │ │ 0001A Filename Length 0008 (8) │ │ │ │ 0001C Extra Length 001C (28) │ │ │ │ 0001E Filename 'XXXXXXXX' │ │ │ │ # │ │ │ │ # WARNING: Offset 0x1E: Filename 'XXXXXXXX' │ │ │ │ # Zero length filename │ │ │ │ # │ │ │ │ 00026 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ 00028 Length 0009 (9) │ │ │ │ 0002A Flags 03 (3) 'Modification Access' │ │ │ │ -0002B Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -0002F Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ +0002B Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +0002F Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ 00033 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ 00035 Length 000B (11) │ │ │ │ 00037 Version 01 (1) │ │ │ │ 00038 UID Size 04 (4) │ │ │ │ 00039 UID 00000000 (0) │ │ │ │ 0003D GID Size 04 (4) │ │ │ │ 0003E GID 00000000 (0) │ │ │ │ @@ -31,30 +31,30 @@ │ │ │ │ │ │ │ │ 00056 LOCAL HEADER #2 04034B50 (67324752) │ │ │ │ 0005A Extract Zip Spec 14 (20) '2.0' │ │ │ │ 0005B Extract OS 00 (0) 'MS-DOS' │ │ │ │ 0005C General Purpose Flag 0000 (0) │ │ │ │ [Bits 1-2] 0 'Normal Compression' │ │ │ │ 0005E Compression Method 0008 (8) 'Deflated' │ │ │ │ -00060 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ +00060 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ 00064 CRC AC138643 (2886960707) │ │ │ │ 00068 Compressed Size 000015AD (5549) │ │ │ │ 0006C Uncompressed Size 00004603 (17923) │ │ │ │ 00070 Filename Length 0014 (20) │ │ │ │ 00072 Extra Length 001C (28) │ │ │ │ 00074 Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ # │ │ │ │ # WARNING: Offset 0x74: Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ # Zero length filename │ │ │ │ # │ │ │ │ 00088 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ 0008A Length 0009 (9) │ │ │ │ 0008C Flags 03 (3) 'Modification Access' │ │ │ │ -0008D Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -00091 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ +0008D Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +00091 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ 00095 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ 00097 Length 000B (11) │ │ │ │ 00099 Version 01 (1) │ │ │ │ 0009A UID Size 04 (4) │ │ │ │ 0009B UID 00000000 (0) │ │ │ │ 0009F GID Size 04 (4) │ │ │ │ 000A0 GID 00000000 (0) │ │ │ │ @@ -62,30 +62,30 @@ │ │ │ │ │ │ │ │ 01651 LOCAL HEADER #3 04034B50 (67324752) │ │ │ │ 01655 Extract Zip Spec 14 (20) '2.0' │ │ │ │ 01656 Extract OS 00 (0) 'MS-DOS' │ │ │ │ 01657 General Purpose Flag 0000 (0) │ │ │ │ [Bits 1-2] 0 'Normal Compression' │ │ │ │ 01659 Compression Method 0008 (8) 'Deflated' │ │ │ │ -0165B Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ +0165B Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ 0165F CRC 02C7C4B0 (46646448) │ │ │ │ 01663 Compressed Size 000006D6 (1750) │ │ │ │ 01667 Uncompressed Size 00001242 (4674) │ │ │ │ 0166B Filename Length 0013 (19) │ │ │ │ 0166D Extra Length 001C (28) │ │ │ │ 0166F Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ # │ │ │ │ # WARNING: Offset 0x166F: Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ # Zero length filename │ │ │ │ # │ │ │ │ 01682 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ 01684 Length 0009 (9) │ │ │ │ 01686 Flags 03 (3) 'Modification Access' │ │ │ │ -01687 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -0168B Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ +01687 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +0168B Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ 0168F Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ 01691 Length 000B (11) │ │ │ │ 01693 Version 01 (1) │ │ │ │ 01694 UID Size 04 (4) │ │ │ │ 01695 UID 00000000 (0) │ │ │ │ 01699 GID Size 04 (4) │ │ │ │ 0169A GID 00000000 (0) │ │ │ │ @@ -93,6187 +93,6187 @@ │ │ │ │ │ │ │ │ 01D74 LOCAL HEADER #4 04034B50 (67324752) │ │ │ │ 01D78 Extract Zip Spec 14 (20) '2.0' │ │ │ │ 01D79 Extract OS 00 (0) 'MS-DOS' │ │ │ │ 01D7A General Purpose Flag 0000 (0) │ │ │ │ [Bits 1-2] 0 'Normal Compression' │ │ │ │ 01D7C Compression Method 0008 (8) 'Deflated' │ │ │ │ -01D7E Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -01D82 CRC 5AAA010F (1521090831) │ │ │ │ -01D86 Compressed Size 00002DA6 (11686) │ │ │ │ +01D7E Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +01D82 CRC AA4D5C72 (2857196658) │ │ │ │ +01D86 Compressed Size 00002D9F (11679) │ │ │ │ 01D8A Uncompressed Size 0000D0C0 (53440) │ │ │ │ 01D8E Filename Length 0014 (20) │ │ │ │ 01D90 Extra Length 001C (28) │ │ │ │ 01D92 Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ # │ │ │ │ # WARNING: Offset 0x1D92: Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ # Zero length filename │ │ │ │ # │ │ │ │ 01DA6 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ 01DA8 Length 0009 (9) │ │ │ │ 01DAA Flags 03 (3) 'Modification Access' │ │ │ │ -01DAB Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -01DAF Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ +01DAB Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +01DAF Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ 01DB3 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ 01DB5 Length 000B (11) │ │ │ │ 01DB7 Version 01 (1) │ │ │ │ 01DB8 UID Size 04 (4) │ │ │ │ 01DB9 UID 00000000 (0) │ │ │ │ 01DBD GID Size 04 (4) │ │ │ │ 01DBE GID 00000000 (0) │ │ │ │ 01DC2 PAYLOAD │ │ │ │ │ │ │ │ -04B68 LOCAL HEADER #5 04034B50 (67324752) │ │ │ │ -04B6C Extract Zip Spec 14 (20) '2.0' │ │ │ │ -04B6D Extract OS 00 (0) 'MS-DOS' │ │ │ │ -04B6E General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -04B70 Compression Method 0008 (8) 'Deflated' │ │ │ │ -04B72 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -04B76 CRC 701446B8 (1880377016) │ │ │ │ -04B7A Compressed Size 000003F1 (1009) │ │ │ │ -04B7E Uncompressed Size 00000877 (2167) │ │ │ │ -04B82 Filename Length 0014 (20) │ │ │ │ -04B84 Extra Length 001C (28) │ │ │ │ -04B86 Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x4B86: Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -04B9A Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -04B9C Length 0009 (9) │ │ │ │ -04B9E Flags 03 (3) 'Modification Access' │ │ │ │ -04B9F Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -04BA3 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -04BA7 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -04BA9 Length 000B (11) │ │ │ │ -04BAB Version 01 (1) │ │ │ │ -04BAC UID Size 04 (4) │ │ │ │ -04BAD UID 00000000 (0) │ │ │ │ -04BB1 GID Size 04 (4) │ │ │ │ -04BB2 GID 00000000 (0) │ │ │ │ -04BB6 PAYLOAD │ │ │ │ - │ │ │ │ -04FA7 LOCAL HEADER #6 04034B50 (67324752) │ │ │ │ -04FAB Extract Zip Spec 14 (20) '2.0' │ │ │ │ -04FAC Extract OS 00 (0) 'MS-DOS' │ │ │ │ -04FAD General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -04FAF Compression Method 0008 (8) 'Deflated' │ │ │ │ -04FB1 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -04FB5 CRC 8666CBE3 (2254883811) │ │ │ │ -04FB9 Compressed Size 000001AF (431) │ │ │ │ -04FBD Uncompressed Size 000002FE (766) │ │ │ │ -04FC1 Filename Length 0011 (17) │ │ │ │ -04FC3 Extra Length 001C (28) │ │ │ │ -04FC5 Filename 'XXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x4FC5: Filename 'XXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -04FD6 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -04FD8 Length 0009 (9) │ │ │ │ -04FDA Flags 03 (3) 'Modification Access' │ │ │ │ -04FDB Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -04FDF Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -04FE3 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -04FE5 Length 000B (11) │ │ │ │ -04FE7 Version 01 (1) │ │ │ │ -04FE8 UID Size 04 (4) │ │ │ │ -04FE9 UID 00000000 (0) │ │ │ │ -04FED GID Size 04 (4) │ │ │ │ -04FEE GID 00000000 (0) │ │ │ │ -04FF2 PAYLOAD │ │ │ │ - │ │ │ │ -051A1 LOCAL HEADER #7 04034B50 (67324752) │ │ │ │ -051A5 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -051A6 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -051A7 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -051A9 Compression Method 0008 (8) 'Deflated' │ │ │ │ -051AB Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -051AF CRC FB649512 (4217672978) │ │ │ │ -051B3 Compressed Size 000020C5 (8389) │ │ │ │ -051B7 Uncompressed Size 0000B4B1 (46257) │ │ │ │ -051BB Filename Length 001B (27) │ │ │ │ -051BD Extra Length 001C (28) │ │ │ │ -051BF Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x51BF: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -051DA Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -051DC Length 0009 (9) │ │ │ │ -051DE Flags 03 (3) 'Modification Access' │ │ │ │ -051DF Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -051E3 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -051E7 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -051E9 Length 000B (11) │ │ │ │ -051EB Version 01 (1) │ │ │ │ -051EC UID Size 04 (4) │ │ │ │ -051ED UID 00000000 (0) │ │ │ │ -051F1 GID Size 04 (4) │ │ │ │ -051F2 GID 00000000 (0) │ │ │ │ -051F6 PAYLOAD │ │ │ │ - │ │ │ │ -072BB LOCAL HEADER #8 04034B50 (67324752) │ │ │ │ -072BF Extract Zip Spec 14 (20) '2.0' │ │ │ │ -072C0 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -072C1 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -072C3 Compression Method 0008 (8) 'Deflated' │ │ │ │ -072C5 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -072C9 CRC 6A77DB59 (1786239833) │ │ │ │ -072CD Compressed Size 00000E70 (3696) │ │ │ │ -072D1 Uncompressed Size 000030B3 (12467) │ │ │ │ -072D5 Filename Length 001D (29) │ │ │ │ -072D7 Extra Length 001C (28) │ │ │ │ -072D9 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x72D9: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -072F6 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -072F8 Length 0009 (9) │ │ │ │ -072FA Flags 03 (3) 'Modification Access' │ │ │ │ -072FB Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -072FF Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -07303 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -07305 Length 000B (11) │ │ │ │ -07307 Version 01 (1) │ │ │ │ -07308 UID Size 04 (4) │ │ │ │ -07309 UID 00000000 (0) │ │ │ │ -0730D GID Size 04 (4) │ │ │ │ -0730E GID 00000000 (0) │ │ │ │ -07312 PAYLOAD │ │ │ │ - │ │ │ │ -08182 LOCAL HEADER #9 04034B50 (67324752) │ │ │ │ -08186 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -08187 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -08188 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -0818A Compression Method 0008 (8) 'Deflated' │ │ │ │ -0818C Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -08190 CRC FEBE631B (4273890075) │ │ │ │ -08194 Compressed Size 00000973 (2419) │ │ │ │ -08198 Uncompressed Size 00001CB3 (7347) │ │ │ │ -0819C Filename Length 0019 (25) │ │ │ │ -0819E Extra Length 001C (28) │ │ │ │ -081A0 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x81A0: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -081B9 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -081BB Length 0009 (9) │ │ │ │ -081BD Flags 03 (3) 'Modification Access' │ │ │ │ -081BE Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -081C2 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -081C6 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -081C8 Length 000B (11) │ │ │ │ -081CA Version 01 (1) │ │ │ │ -081CB UID Size 04 (4) │ │ │ │ -081CC UID 00000000 (0) │ │ │ │ -081D0 GID Size 04 (4) │ │ │ │ -081D1 GID 00000000 (0) │ │ │ │ -081D5 PAYLOAD │ │ │ │ - │ │ │ │ -08B48 LOCAL HEADER #10 04034B50 (67324752) │ │ │ │ -08B4C Extract Zip Spec 14 (20) '2.0' │ │ │ │ -08B4D Extract OS 00 (0) 'MS-DOS' │ │ │ │ -08B4E General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -08B50 Compression Method 0008 (8) 'Deflated' │ │ │ │ -08B52 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -08B56 CRC 92805732 (2457884466) │ │ │ │ -08B5A Compressed Size 0000387D (14461) │ │ │ │ -08B5E Uncompressed Size 0000F7F5 (63477) │ │ │ │ -08B62 Filename Length 0015 (21) │ │ │ │ -08B64 Extra Length 001C (28) │ │ │ │ -08B66 Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x8B66: Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -08B7B Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -08B7D Length 0009 (9) │ │ │ │ -08B7F Flags 03 (3) 'Modification Access' │ │ │ │ -08B80 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -08B84 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -08B88 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -08B8A Length 000B (11) │ │ │ │ -08B8C Version 01 (1) │ │ │ │ -08B8D UID Size 04 (4) │ │ │ │ -08B8E UID 00000000 (0) │ │ │ │ -08B92 GID Size 04 (4) │ │ │ │ -08B93 GID 00000000 (0) │ │ │ │ -08B97 PAYLOAD │ │ │ │ - │ │ │ │ -0C414 LOCAL HEADER #11 04034B50 (67324752) │ │ │ │ -0C418 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -0C419 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -0C41A General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -0C41C Compression Method 0008 (8) 'Deflated' │ │ │ │ -0C41E Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -0C422 CRC 61281D0E (1630018830) │ │ │ │ -0C426 Compressed Size 0000AB01 (43777) │ │ │ │ -0C42A Uncompressed Size 0003E052 (254034) │ │ │ │ -0C42E Filename Length 0012 (18) │ │ │ │ -0C430 Extra Length 001C (28) │ │ │ │ -0C432 Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0xC432: Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -0C444 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -0C446 Length 0009 (9) │ │ │ │ -0C448 Flags 03 (3) 'Modification Access' │ │ │ │ -0C449 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -0C44D Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -0C451 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -0C453 Length 000B (11) │ │ │ │ -0C455 Version 01 (1) │ │ │ │ -0C456 UID Size 04 (4) │ │ │ │ -0C457 UID 00000000 (0) │ │ │ │ -0C45B GID Size 04 (4) │ │ │ │ -0C45C GID 00000000 (0) │ │ │ │ -0C460 PAYLOAD │ │ │ │ - │ │ │ │ -16F61 LOCAL HEADER #12 04034B50 (67324752) │ │ │ │ -16F65 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -16F66 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -16F67 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -16F69 Compression Method 0008 (8) 'Deflated' │ │ │ │ -16F6B Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -16F6F CRC 26BAED81 (649784705) │ │ │ │ -16F73 Compressed Size 00003B07 (15111) │ │ │ │ -16F77 Uncompressed Size 0001B46D (111725) │ │ │ │ -16F7B Filename Length 0015 (21) │ │ │ │ -16F7D Extra Length 001C (28) │ │ │ │ -16F7F Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x16F7F: Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -16F94 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -16F96 Length 0009 (9) │ │ │ │ -16F98 Flags 03 (3) 'Modification Access' │ │ │ │ -16F99 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -16F9D Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -16FA1 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -16FA3 Length 000B (11) │ │ │ │ -16FA5 Version 01 (1) │ │ │ │ -16FA6 UID Size 04 (4) │ │ │ │ -16FA7 UID 00000000 (0) │ │ │ │ -16FAB GID Size 04 (4) │ │ │ │ -16FAC GID 00000000 (0) │ │ │ │ -16FB0 PAYLOAD │ │ │ │ - │ │ │ │ -1AAB7 LOCAL HEADER #13 04034B50 (67324752) │ │ │ │ -1AABB Extract Zip Spec 14 (20) '2.0' │ │ │ │ -1AABC Extract OS 00 (0) 'MS-DOS' │ │ │ │ -1AABD General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -1AABF Compression Method 0008 (8) 'Deflated' │ │ │ │ -1AAC1 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -1AAC5 CRC F477CF64 (4101492580) │ │ │ │ -1AAC9 Compressed Size 0000918E (37262) │ │ │ │ -1AACD Uncompressed Size 0003D596 (251286) │ │ │ │ -1AAD1 Filename Length 0014 (20) │ │ │ │ -1AAD3 Extra Length 001C (28) │ │ │ │ -1AAD5 Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x1AAD5: Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -1AAE9 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -1AAEB Length 0009 (9) │ │ │ │ -1AAED Flags 03 (3) 'Modification Access' │ │ │ │ -1AAEE Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -1AAF2 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -1AAF6 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -1AAF8 Length 000B (11) │ │ │ │ -1AAFA Version 01 (1) │ │ │ │ -1AAFB UID Size 04 (4) │ │ │ │ -1AAFC UID 00000000 (0) │ │ │ │ -1AB00 GID Size 04 (4) │ │ │ │ -1AB01 GID 00000000 (0) │ │ │ │ -1AB05 PAYLOAD │ │ │ │ - │ │ │ │ -23C93 LOCAL HEADER #14 04034B50 (67324752) │ │ │ │ -23C97 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -23C98 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -23C99 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -23C9B Compression Method 0008 (8) 'Deflated' │ │ │ │ -23C9D Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -23CA1 CRC E4DF2C3D (3839831101) │ │ │ │ -23CA5 Compressed Size 00002A67 (10855) │ │ │ │ -23CA9 Uncompressed Size 00011520 (70944) │ │ │ │ -23CAD Filename Length 0016 (22) │ │ │ │ -23CAF Extra Length 001C (28) │ │ │ │ -23CB1 Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x23CB1: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -23CC7 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -23CC9 Length 0009 (9) │ │ │ │ -23CCB Flags 03 (3) 'Modification Access' │ │ │ │ -23CCC Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -23CD0 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -23CD4 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -23CD6 Length 000B (11) │ │ │ │ -23CD8 Version 01 (1) │ │ │ │ -23CD9 UID Size 04 (4) │ │ │ │ -23CDA UID 00000000 (0) │ │ │ │ -23CDE GID Size 04 (4) │ │ │ │ -23CDF GID 00000000 (0) │ │ │ │ -23CE3 PAYLOAD │ │ │ │ - │ │ │ │ -2674A LOCAL HEADER #15 04034B50 (67324752) │ │ │ │ -2674E Extract Zip Spec 14 (20) '2.0' │ │ │ │ -2674F Extract OS 00 (0) 'MS-DOS' │ │ │ │ -26750 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -26752 Compression Method 0008 (8) 'Deflated' │ │ │ │ -26754 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -26758 CRC 3F278541 (1059554625) │ │ │ │ -2675C Compressed Size 000014DB (5339) │ │ │ │ -26760 Uncompressed Size 0000518E (20878) │ │ │ │ -26764 Filename Length 001D (29) │ │ │ │ -26766 Extra Length 001C (28) │ │ │ │ -26768 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x26768: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -26785 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -26787 Length 0009 (9) │ │ │ │ -26789 Flags 03 (3) 'Modification Access' │ │ │ │ -2678A Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -2678E Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -26792 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -26794 Length 000B (11) │ │ │ │ -26796 Version 01 (1) │ │ │ │ -26797 UID Size 04 (4) │ │ │ │ -26798 UID 00000000 (0) │ │ │ │ -2679C GID Size 04 (4) │ │ │ │ -2679D GID 00000000 (0) │ │ │ │ -267A1 PAYLOAD │ │ │ │ - │ │ │ │ -27C7C LOCAL HEADER #16 04034B50 (67324752) │ │ │ │ -27C80 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -27C81 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -27C82 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -27C84 Compression Method 0008 (8) 'Deflated' │ │ │ │ -27C86 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -27C8A CRC F4CD7EBA (4107108026) │ │ │ │ -27C8E Compressed Size 0000380C (14348) │ │ │ │ -27C92 Uncompressed Size 0000EA4D (59981) │ │ │ │ -27C96 Filename Length 001C (28) │ │ │ │ -27C98 Extra Length 001C (28) │ │ │ │ -27C9A Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x27C9A: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -27CB6 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -27CB8 Length 0009 (9) │ │ │ │ -27CBA Flags 03 (3) 'Modification Access' │ │ │ │ -27CBB Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -27CBF Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -27CC3 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -27CC5 Length 000B (11) │ │ │ │ -27CC7 Version 01 (1) │ │ │ │ -27CC8 UID Size 04 (4) │ │ │ │ -27CC9 UID 00000000 (0) │ │ │ │ -27CCD GID Size 04 (4) │ │ │ │ -27CCE GID 00000000 (0) │ │ │ │ -27CD2 PAYLOAD │ │ │ │ - │ │ │ │ -2B4DE LOCAL HEADER #17 04034B50 (67324752) │ │ │ │ -2B4E2 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -2B4E3 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -2B4E4 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -2B4E6 Compression Method 0008 (8) 'Deflated' │ │ │ │ -2B4E8 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -2B4EC CRC BF5A452D (3210364205) │ │ │ │ -2B4F0 Compressed Size 000006A2 (1698) │ │ │ │ -2B4F4 Uncompressed Size 000011F5 (4597) │ │ │ │ -2B4F8 Filename Length 001C (28) │ │ │ │ -2B4FA Extra Length 001C (28) │ │ │ │ -2B4FC Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x2B4FC: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -2B518 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -2B51A Length 0009 (9) │ │ │ │ -2B51C Flags 03 (3) 'Modification Access' │ │ │ │ -2B51D Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -2B521 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -2B525 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -2B527 Length 000B (11) │ │ │ │ -2B529 Version 01 (1) │ │ │ │ -2B52A UID Size 04 (4) │ │ │ │ -2B52B UID 00000000 (0) │ │ │ │ -2B52F GID Size 04 (4) │ │ │ │ -2B530 GID 00000000 (0) │ │ │ │ -2B534 PAYLOAD │ │ │ │ - │ │ │ │ -2BBD6 LOCAL HEADER #18 04034B50 (67324752) │ │ │ │ -2BBDA Extract Zip Spec 14 (20) '2.0' │ │ │ │ -2BBDB Extract OS 00 (0) 'MS-DOS' │ │ │ │ -2BBDC General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -2BBDE Compression Method 0008 (8) 'Deflated' │ │ │ │ -2BBE0 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -2BBE4 CRC 7905ED7B (2030431611) │ │ │ │ -2BBE8 Compressed Size 00001080 (4224) │ │ │ │ -2BBEC Uncompressed Size 00004C00 (19456) │ │ │ │ -2BBF0 Filename Length 001B (27) │ │ │ │ -2BBF2 Extra Length 001C (28) │ │ │ │ -2BBF4 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x2BBF4: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -2BC0F Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -2BC11 Length 0009 (9) │ │ │ │ -2BC13 Flags 03 (3) 'Modification Access' │ │ │ │ -2BC14 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -2BC18 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -2BC1C Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -2BC1E Length 000B (11) │ │ │ │ -2BC20 Version 01 (1) │ │ │ │ -2BC21 UID Size 04 (4) │ │ │ │ -2BC22 UID 00000000 (0) │ │ │ │ -2BC26 GID Size 04 (4) │ │ │ │ -2BC27 GID 00000000 (0) │ │ │ │ -2BC2B PAYLOAD │ │ │ │ - │ │ │ │ -2CCAB LOCAL HEADER #19 04034B50 (67324752) │ │ │ │ -2CCAF Extract Zip Spec 14 (20) '2.0' │ │ │ │ -2CCB0 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -2CCB1 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -2CCB3 Compression Method 0008 (8) 'Deflated' │ │ │ │ -2CCB5 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -2CCB9 CRC A8D0EAB1 (2832263857) │ │ │ │ -2CCBD Compressed Size 000033AC (13228) │ │ │ │ -2CCC1 Uncompressed Size 0000BC95 (48277) │ │ │ │ -2CCC5 Filename Length 001D (29) │ │ │ │ -2CCC7 Extra Length 001C (28) │ │ │ │ -2CCC9 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x2CCC9: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -2CCE6 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -2CCE8 Length 0009 (9) │ │ │ │ -2CCEA Flags 03 (3) 'Modification Access' │ │ │ │ -2CCEB Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -2CCEF Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -2CCF3 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -2CCF5 Length 000B (11) │ │ │ │ -2CCF7 Version 01 (1) │ │ │ │ -2CCF8 UID Size 04 (4) │ │ │ │ -2CCF9 UID 00000000 (0) │ │ │ │ -2CCFD GID Size 04 (4) │ │ │ │ -2CCFE GID 00000000 (0) │ │ │ │ -2CD02 PAYLOAD │ │ │ │ - │ │ │ │ -300AE LOCAL HEADER #20 04034B50 (67324752) │ │ │ │ -300B2 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -300B3 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -300B4 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -300B6 Compression Method 0008 (8) 'Deflated' │ │ │ │ -300B8 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -300BC CRC 49B504F3 (1236600051) │ │ │ │ -300C0 Compressed Size 00000D6C (3436) │ │ │ │ -300C4 Uncompressed Size 0000388E (14478) │ │ │ │ -300C8 Filename Length 001D (29) │ │ │ │ -300CA Extra Length 001C (28) │ │ │ │ -300CC Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x300CC: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -300E9 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -300EB Length 0009 (9) │ │ │ │ -300ED Flags 03 (3) 'Modification Access' │ │ │ │ -300EE Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -300F2 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -300F6 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -300F8 Length 000B (11) │ │ │ │ -300FA Version 01 (1) │ │ │ │ -300FB UID Size 04 (4) │ │ │ │ -300FC UID 00000000 (0) │ │ │ │ -30100 GID Size 04 (4) │ │ │ │ -30101 GID 00000000 (0) │ │ │ │ -30105 PAYLOAD │ │ │ │ - │ │ │ │ -30E71 LOCAL HEADER #21 04034B50 (67324752) │ │ │ │ -30E75 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -30E76 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -30E77 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -30E79 Compression Method 0008 (8) 'Deflated' │ │ │ │ -30E7B Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -30E7F CRC 63C17846 (1673623622) │ │ │ │ -30E83 Compressed Size 00001C69 (7273) │ │ │ │ -30E87 Uncompressed Size 0000C187 (49543) │ │ │ │ -30E8B Filename Length 001A (26) │ │ │ │ -30E8D Extra Length 001C (28) │ │ │ │ -30E8F Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x30E8F: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -30EA9 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -30EAB Length 0009 (9) │ │ │ │ -30EAD Flags 03 (3) 'Modification Access' │ │ │ │ -30EAE Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -30EB2 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -30EB6 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -30EB8 Length 000B (11) │ │ │ │ -30EBA Version 01 (1) │ │ │ │ -30EBB UID Size 04 (4) │ │ │ │ -30EBC UID 00000000 (0) │ │ │ │ -30EC0 GID Size 04 (4) │ │ │ │ -30EC1 GID 00000000 (0) │ │ │ │ -30EC5 PAYLOAD │ │ │ │ - │ │ │ │ -32B2E LOCAL HEADER #22 04034B50 (67324752) │ │ │ │ -32B32 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -32B33 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -32B34 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -32B36 Compression Method 0008 (8) 'Deflated' │ │ │ │ -32B38 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -32B3C CRC FFC68C4A (4291202122) │ │ │ │ -32B40 Compressed Size 000003A4 (932) │ │ │ │ -32B44 Uncompressed Size 0000088F (2191) │ │ │ │ -32B48 Filename Length 0012 (18) │ │ │ │ -32B4A Extra Length 001C (28) │ │ │ │ -32B4C Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x32B4C: Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -32B5E Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -32B60 Length 0009 (9) │ │ │ │ -32B62 Flags 03 (3) 'Modification Access' │ │ │ │ -32B63 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -32B67 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -32B6B Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -32B6D Length 000B (11) │ │ │ │ -32B6F Version 01 (1) │ │ │ │ -32B70 UID Size 04 (4) │ │ │ │ -32B71 UID 00000000 (0) │ │ │ │ -32B75 GID Size 04 (4) │ │ │ │ -32B76 GID 00000000 (0) │ │ │ │ -32B7A PAYLOAD │ │ │ │ - │ │ │ │ -32F1E LOCAL HEADER #23 04034B50 (67324752) │ │ │ │ -32F22 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -32F23 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -32F24 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -32F26 Compression Method 0008 (8) 'Deflated' │ │ │ │ -32F28 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -32F2C CRC 75B01EAE (1974476462) │ │ │ │ -32F30 Compressed Size 000001D4 (468) │ │ │ │ -32F34 Uncompressed Size 00000312 (786) │ │ │ │ -32F38 Filename Length 0020 (32) │ │ │ │ -32F3A Extra Length 001C (28) │ │ │ │ -32F3C Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x32F3C: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -32F5C Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -32F5E Length 0009 (9) │ │ │ │ -32F60 Flags 03 (3) 'Modification Access' │ │ │ │ -32F61 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -32F65 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -32F69 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -32F6B Length 000B (11) │ │ │ │ -32F6D Version 01 (1) │ │ │ │ -32F6E UID Size 04 (4) │ │ │ │ -32F6F UID 00000000 (0) │ │ │ │ -32F73 GID Size 04 (4) │ │ │ │ -32F74 GID 00000000 (0) │ │ │ │ -32F78 PAYLOAD │ │ │ │ - │ │ │ │ -3314C LOCAL HEADER #24 04034B50 (67324752) │ │ │ │ -33150 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -33151 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -33152 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -33154 Compression Method 0008 (8) 'Deflated' │ │ │ │ -33156 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -3315A CRC 897859D5 (2306365909) │ │ │ │ -3315E Compressed Size 000017A7 (6055) │ │ │ │ -33162 Uncompressed Size 00009D19 (40217) │ │ │ │ -33166 Filename Length 001B (27) │ │ │ │ -33168 Extra Length 001C (28) │ │ │ │ -3316A Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x3316A: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -33185 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -33187 Length 0009 (9) │ │ │ │ -33189 Flags 03 (3) 'Modification Access' │ │ │ │ -3318A Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -3318E Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -33192 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -33194 Length 000B (11) │ │ │ │ -33196 Version 01 (1) │ │ │ │ -33197 UID Size 04 (4) │ │ │ │ -33198 UID 00000000 (0) │ │ │ │ -3319C GID Size 04 (4) │ │ │ │ -3319D GID 00000000 (0) │ │ │ │ -331A1 PAYLOAD │ │ │ │ - │ │ │ │ -34948 LOCAL HEADER #25 04034B50 (67324752) │ │ │ │ -3494C Extract Zip Spec 14 (20) '2.0' │ │ │ │ -3494D Extract OS 00 (0) 'MS-DOS' │ │ │ │ -3494E General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -34950 Compression Method 0008 (8) 'Deflated' │ │ │ │ -34952 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -34956 CRC AA7532E3 (2859807459) │ │ │ │ -3495A Compressed Size 00001373 (4979) │ │ │ │ -3495E Uncompressed Size 00003B67 (15207) │ │ │ │ -34962 Filename Length 0015 (21) │ │ │ │ -34964 Extra Length 001C (28) │ │ │ │ -34966 Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x34966: Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -3497B Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -3497D Length 0009 (9) │ │ │ │ -3497F Flags 03 (3) 'Modification Access' │ │ │ │ -34980 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -34984 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -34988 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -3498A Length 000B (11) │ │ │ │ -3498C Version 01 (1) │ │ │ │ -3498D UID Size 04 (4) │ │ │ │ -3498E UID 00000000 (0) │ │ │ │ -34992 GID Size 04 (4) │ │ │ │ -34993 GID 00000000 (0) │ │ │ │ -34997 PAYLOAD │ │ │ │ - │ │ │ │ -35D0A LOCAL HEADER #26 04034B50 (67324752) │ │ │ │ -35D0E Extract Zip Spec 14 (20) '2.0' │ │ │ │ -35D0F Extract OS 00 (0) 'MS-DOS' │ │ │ │ -35D10 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -35D12 Compression Method 0008 (8) 'Deflated' │ │ │ │ -35D14 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -35D18 CRC 3F4BD8A9 (1061935273) │ │ │ │ -35D1C Compressed Size 00000AD3 (2771) │ │ │ │ -35D20 Uncompressed Size 00002136 (8502) │ │ │ │ -35D24 Filename Length 0011 (17) │ │ │ │ -35D26 Extra Length 001C (28) │ │ │ │ -35D28 Filename 'XXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x35D28: Filename 'XXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -35D39 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -35D3B Length 0009 (9) │ │ │ │ -35D3D Flags 03 (3) 'Modification Access' │ │ │ │ -35D3E Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -35D42 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -35D46 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -35D48 Length 000B (11) │ │ │ │ -35D4A Version 01 (1) │ │ │ │ -35D4B UID Size 04 (4) │ │ │ │ -35D4C UID 00000000 (0) │ │ │ │ -35D50 GID Size 04 (4) │ │ │ │ -35D51 GID 00000000 (0) │ │ │ │ -35D55 PAYLOAD │ │ │ │ - │ │ │ │ -36828 LOCAL HEADER #27 04034B50 (67324752) │ │ │ │ -3682C Extract Zip Spec 14 (20) '2.0' │ │ │ │ -3682D Extract OS 00 (0) 'MS-DOS' │ │ │ │ -3682E General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -36830 Compression Method 0008 (8) 'Deflated' │ │ │ │ -36832 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -36836 CRC AA8AD019 (2861223961) │ │ │ │ -3683A Compressed Size 000003FE (1022) │ │ │ │ -3683E Uncompressed Size 00000F0D (3853) │ │ │ │ -36842 Filename Length 0014 (20) │ │ │ │ -36844 Extra Length 001C (28) │ │ │ │ -36846 Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x36846: Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -3685A Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -3685C Length 0009 (9) │ │ │ │ -3685E Flags 03 (3) 'Modification Access' │ │ │ │ -3685F Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -36863 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -36867 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -36869 Length 000B (11) │ │ │ │ -3686B Version 01 (1) │ │ │ │ -3686C UID Size 04 (4) │ │ │ │ -3686D UID 00000000 (0) │ │ │ │ -36871 GID Size 04 (4) │ │ │ │ -36872 GID 00000000 (0) │ │ │ │ -36876 PAYLOAD │ │ │ │ - │ │ │ │ -36C74 LOCAL HEADER #28 04034B50 (67324752) │ │ │ │ -36C78 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -36C79 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -36C7A General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -36C7C Compression Method 0008 (8) 'Deflated' │ │ │ │ -36C7E Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -36C82 CRC 2177E3D4 (561505236) │ │ │ │ -36C86 Compressed Size 00001263 (4707) │ │ │ │ -36C8A Uncompressed Size 0000346A (13418) │ │ │ │ -36C8E Filename Length 0014 (20) │ │ │ │ -36C90 Extra Length 001C (28) │ │ │ │ -36C92 Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x36C92: Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -36CA6 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -36CA8 Length 0009 (9) │ │ │ │ -36CAA Flags 03 (3) 'Modification Access' │ │ │ │ -36CAB Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -36CAF Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -36CB3 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -36CB5 Length 000B (11) │ │ │ │ -36CB7 Version 01 (1) │ │ │ │ -36CB8 UID Size 04 (4) │ │ │ │ -36CB9 UID 00000000 (0) │ │ │ │ -36CBD GID Size 04 (4) │ │ │ │ -36CBE GID 00000000 (0) │ │ │ │ -36CC2 PAYLOAD │ │ │ │ - │ │ │ │ -37F25 LOCAL HEADER #29 04034B50 (67324752) │ │ │ │ -37F29 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -37F2A Extract OS 00 (0) 'MS-DOS' │ │ │ │ -37F2B General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -37F2D Compression Method 0008 (8) 'Deflated' │ │ │ │ -37F2F Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -37F33 CRC 5BE66E46 (1541828166) │ │ │ │ -37F37 Compressed Size 00000AD1 (2769) │ │ │ │ -37F3B Uncompressed Size 00002300 (8960) │ │ │ │ -37F3F Filename Length 001B (27) │ │ │ │ -37F41 Extra Length 001C (28) │ │ │ │ -37F43 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x37F43: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -37F5E Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -37F60 Length 0009 (9) │ │ │ │ -37F62 Flags 03 (3) 'Modification Access' │ │ │ │ -37F63 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -37F67 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -37F6B Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -37F6D Length 000B (11) │ │ │ │ -37F6F Version 01 (1) │ │ │ │ -37F70 UID Size 04 (4) │ │ │ │ -37F71 UID 00000000 (0) │ │ │ │ -37F75 GID Size 04 (4) │ │ │ │ -37F76 GID 00000000 (0) │ │ │ │ -37F7A PAYLOAD │ │ │ │ - │ │ │ │ -38A4B LOCAL HEADER #30 04034B50 (67324752) │ │ │ │ -38A4F Extract Zip Spec 14 (20) '2.0' │ │ │ │ -38A50 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -38A51 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -38A53 Compression Method 0008 (8) 'Deflated' │ │ │ │ -38A55 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -38A59 CRC 45B42DB7 (1169436087) │ │ │ │ -38A5D Compressed Size 00000A8F (2703) │ │ │ │ -38A61 Uncompressed Size 0000237B (9083) │ │ │ │ -38A65 Filename Length 0013 (19) │ │ │ │ -38A67 Extra Length 001C (28) │ │ │ │ -38A69 Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x38A69: Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -38A7C Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -38A7E Length 0009 (9) │ │ │ │ -38A80 Flags 03 (3) 'Modification Access' │ │ │ │ -38A81 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -38A85 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -38A89 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -38A8B Length 000B (11) │ │ │ │ -38A8D Version 01 (1) │ │ │ │ -38A8E UID Size 04 (4) │ │ │ │ -38A8F UID 00000000 (0) │ │ │ │ -38A93 GID Size 04 (4) │ │ │ │ -38A94 GID 00000000 (0) │ │ │ │ -38A98 PAYLOAD │ │ │ │ - │ │ │ │ -39527 LOCAL HEADER #31 04034B50 (67324752) │ │ │ │ -3952B Extract Zip Spec 14 (20) '2.0' │ │ │ │ -3952C Extract OS 00 (0) 'MS-DOS' │ │ │ │ -3952D General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -3952F Compression Method 0008 (8) 'Deflated' │ │ │ │ -39531 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -39535 CRC 3291086B (848365675) │ │ │ │ -39539 Compressed Size 00000F4B (3915) │ │ │ │ -3953D Uncompressed Size 00003737 (14135) │ │ │ │ -39541 Filename Length 000F (15) │ │ │ │ -39543 Extra Length 001C (28) │ │ │ │ -39545 Filename 'XXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x39545: Filename 'XXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -39554 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -39556 Length 0009 (9) │ │ │ │ -39558 Flags 03 (3) 'Modification Access' │ │ │ │ -39559 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -3955D Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -39561 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -39563 Length 000B (11) │ │ │ │ -39565 Version 01 (1) │ │ │ │ -39566 UID Size 04 (4) │ │ │ │ -39567 UID 00000000 (0) │ │ │ │ -3956B GID Size 04 (4) │ │ │ │ -3956C GID 00000000 (0) │ │ │ │ -39570 PAYLOAD │ │ │ │ - │ │ │ │ -3A4BB LOCAL HEADER #32 04034B50 (67324752) │ │ │ │ -3A4BF Extract Zip Spec 14 (20) '2.0' │ │ │ │ -3A4C0 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -3A4C1 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -3A4C3 Compression Method 0008 (8) 'Deflated' │ │ │ │ -3A4C5 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -3A4C9 CRC 3759BA2B (928627243) │ │ │ │ -3A4CD Compressed Size 0000066B (1643) │ │ │ │ -3A4D1 Uncompressed Size 000018E0 (6368) │ │ │ │ -3A4D5 Filename Length 000F (15) │ │ │ │ -3A4D7 Extra Length 001C (28) │ │ │ │ -3A4D9 Filename 'XXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x3A4D9: Filename 'XXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -3A4E8 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -3A4EA Length 0009 (9) │ │ │ │ -3A4EC Flags 03 (3) 'Modification Access' │ │ │ │ -3A4ED Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -3A4F1 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -3A4F5 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -3A4F7 Length 000B (11) │ │ │ │ -3A4F9 Version 01 (1) │ │ │ │ -3A4FA UID Size 04 (4) │ │ │ │ -3A4FB UID 00000000 (0) │ │ │ │ -3A4FF GID Size 04 (4) │ │ │ │ -3A500 GID 00000000 (0) │ │ │ │ -3A504 PAYLOAD │ │ │ │ - │ │ │ │ -3AB6F LOCAL HEADER #33 04034B50 (67324752) │ │ │ │ -3AB73 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -3AB74 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -3AB75 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -3AB77 Compression Method 0008 (8) 'Deflated' │ │ │ │ -3AB79 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -3AB7D CRC 7A69714D (2053730637) │ │ │ │ -3AB81 Compressed Size 00001A49 (6729) │ │ │ │ -3AB85 Uncompressed Size 000064F3 (25843) │ │ │ │ -3AB89 Filename Length 0013 (19) │ │ │ │ -3AB8B Extra Length 001C (28) │ │ │ │ -3AB8D Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x3AB8D: Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -3ABA0 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -3ABA2 Length 0009 (9) │ │ │ │ -3ABA4 Flags 03 (3) 'Modification Access' │ │ │ │ -3ABA5 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -3ABA9 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -3ABAD Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -3ABAF Length 000B (11) │ │ │ │ -3ABB1 Version 01 (1) │ │ │ │ -3ABB2 UID Size 04 (4) │ │ │ │ -3ABB3 UID 00000000 (0) │ │ │ │ -3ABB7 GID Size 04 (4) │ │ │ │ -3ABB8 GID 00000000 (0) │ │ │ │ -3ABBC PAYLOAD │ │ │ │ - │ │ │ │ -3C605 LOCAL HEADER #34 04034B50 (67324752) │ │ │ │ -3C609 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -3C60A Extract OS 00 (0) 'MS-DOS' │ │ │ │ -3C60B General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -3C60D Compression Method 0008 (8) 'Deflated' │ │ │ │ -3C60F Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -3C613 CRC 57156588 (1461020040) │ │ │ │ -3C617 Compressed Size 000009A7 (2471) │ │ │ │ -3C61B Uncompressed Size 00001B65 (7013) │ │ │ │ -3C61F Filename Length 0010 (16) │ │ │ │ -3C621 Extra Length 001C (28) │ │ │ │ -3C623 Filename 'XXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x3C623: Filename 'XXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -3C633 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -3C635 Length 0009 (9) │ │ │ │ -3C637 Flags 03 (3) 'Modification Access' │ │ │ │ -3C638 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -3C63C Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -3C640 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -3C642 Length 000B (11) │ │ │ │ -3C644 Version 01 (1) │ │ │ │ -3C645 UID Size 04 (4) │ │ │ │ -3C646 UID 00000000 (0) │ │ │ │ -3C64A GID Size 04 (4) │ │ │ │ -3C64B GID 00000000 (0) │ │ │ │ -3C64F PAYLOAD │ │ │ │ - │ │ │ │ -3CFF6 LOCAL HEADER #35 04034B50 (67324752) │ │ │ │ -3CFFA Extract Zip Spec 14 (20) '2.0' │ │ │ │ -3CFFB Extract OS 00 (0) 'MS-DOS' │ │ │ │ -3CFFC General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -3CFFE Compression Method 0008 (8) 'Deflated' │ │ │ │ -3D000 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -3D004 CRC 2899E6E3 (681174755) │ │ │ │ -3D008 Compressed Size 000006B8 (1720) │ │ │ │ -3D00C Uncompressed Size 00001566 (5478) │ │ │ │ -3D010 Filename Length 0012 (18) │ │ │ │ -3D012 Extra Length 001C (28) │ │ │ │ -3D014 Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x3D014: Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -3D026 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -3D028 Length 0009 (9) │ │ │ │ -3D02A Flags 03 (3) 'Modification Access' │ │ │ │ -3D02B Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -3D02F Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -3D033 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -3D035 Length 000B (11) │ │ │ │ -3D037 Version 01 (1) │ │ │ │ -3D038 UID Size 04 (4) │ │ │ │ -3D039 UID 00000000 (0) │ │ │ │ -3D03D GID Size 04 (4) │ │ │ │ -3D03E GID 00000000 (0) │ │ │ │ -3D042 PAYLOAD │ │ │ │ - │ │ │ │ -3D6FA LOCAL HEADER #36 04034B50 (67324752) │ │ │ │ -3D6FE Extract Zip Spec 14 (20) '2.0' │ │ │ │ -3D6FF Extract OS 00 (0) 'MS-DOS' │ │ │ │ -3D700 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -3D702 Compression Method 0008 (8) 'Deflated' │ │ │ │ -3D704 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -3D708 CRC CED2ACF6 (3469913334) │ │ │ │ -3D70C Compressed Size 00002A18 (10776) │ │ │ │ -3D710 Uncompressed Size 0000B1DD (45533) │ │ │ │ -3D714 Filename Length 0010 (16) │ │ │ │ -3D716 Extra Length 001C (28) │ │ │ │ -3D718 Filename 'XXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x3D718: Filename 'XXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -3D728 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -3D72A Length 0009 (9) │ │ │ │ -3D72C Flags 03 (3) 'Modification Access' │ │ │ │ -3D72D Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -3D731 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -3D735 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -3D737 Length 000B (11) │ │ │ │ -3D739 Version 01 (1) │ │ │ │ -3D73A UID Size 04 (4) │ │ │ │ -3D73B UID 00000000 (0) │ │ │ │ -3D73F GID Size 04 (4) │ │ │ │ -3D740 GID 00000000 (0) │ │ │ │ -3D744 PAYLOAD │ │ │ │ - │ │ │ │ -4015C LOCAL HEADER #37 04034B50 (67324752) │ │ │ │ -40160 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -40161 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -40162 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -40164 Compression Method 0008 (8) 'Deflated' │ │ │ │ -40166 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -4016A CRC 7607C573 (1980220787) │ │ │ │ -4016E Compressed Size 00001E85 (7813) │ │ │ │ -40172 Uncompressed Size 00009AAB (39595) │ │ │ │ -40176 Filename Length 0012 (18) │ │ │ │ -40178 Extra Length 001C (28) │ │ │ │ -4017A Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x4017A: Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -4018C Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -4018E Length 0009 (9) │ │ │ │ -40190 Flags 03 (3) 'Modification Access' │ │ │ │ -40191 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -40195 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -40199 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -4019B Length 000B (11) │ │ │ │ -4019D Version 01 (1) │ │ │ │ -4019E UID Size 04 (4) │ │ │ │ -4019F UID 00000000 (0) │ │ │ │ -401A3 GID Size 04 (4) │ │ │ │ -401A4 GID 00000000 (0) │ │ │ │ -401A8 PAYLOAD │ │ │ │ - │ │ │ │ -4202D LOCAL HEADER #38 04034B50 (67324752) │ │ │ │ -42031 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -42032 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -42033 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -42035 Compression Method 0008 (8) 'Deflated' │ │ │ │ -42037 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -4203B CRC 5AB3A3E2 (1521722338) │ │ │ │ -4203F Compressed Size 00001476 (5238) │ │ │ │ -42043 Uncompressed Size 00007AD0 (31440) │ │ │ │ -42047 Filename Length 0018 (24) │ │ │ │ -42049 Extra Length 001C (28) │ │ │ │ -4204B Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x4204B: Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -42063 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -42065 Length 0009 (9) │ │ │ │ -42067 Flags 03 (3) 'Modification Access' │ │ │ │ -42068 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -4206C Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -42070 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -42072 Length 000B (11) │ │ │ │ -42074 Version 01 (1) │ │ │ │ -42075 UID Size 04 (4) │ │ │ │ -42076 UID 00000000 (0) │ │ │ │ -4207A GID Size 04 (4) │ │ │ │ -4207B GID 00000000 (0) │ │ │ │ -4207F PAYLOAD │ │ │ │ - │ │ │ │ -434F5 LOCAL HEADER #39 04034B50 (67324752) │ │ │ │ -434F9 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -434FA Extract OS 00 (0) 'MS-DOS' │ │ │ │ -434FB General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -434FD Compression Method 0008 (8) 'Deflated' │ │ │ │ -434FF Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -43503 CRC FA499AED (4199127789) │ │ │ │ -43507 Compressed Size 000018D1 (6353) │ │ │ │ -4350B Uncompressed Size 0000A83A (43066) │ │ │ │ -4350F Filename Length 001F (31) │ │ │ │ -43511 Extra Length 001C (28) │ │ │ │ -43513 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x43513: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -43532 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -43534 Length 0009 (9) │ │ │ │ -43536 Flags 03 (3) 'Modification Access' │ │ │ │ -43537 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -4353B Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -4353F Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -43541 Length 000B (11) │ │ │ │ -43543 Version 01 (1) │ │ │ │ -43544 UID Size 04 (4) │ │ │ │ -43545 UID 00000000 (0) │ │ │ │ -43549 GID Size 04 (4) │ │ │ │ -4354A GID 00000000 (0) │ │ │ │ -4354E PAYLOAD │ │ │ │ - │ │ │ │ -44E1F LOCAL HEADER #40 04034B50 (67324752) │ │ │ │ -44E23 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -44E24 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -44E25 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -44E27 Compression Method 0008 (8) 'Deflated' │ │ │ │ -44E29 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -44E2D CRC 6DE2E94A (1843587402) │ │ │ │ -44E31 Compressed Size 000003F8 (1016) │ │ │ │ -44E35 Uncompressed Size 000008A4 (2212) │ │ │ │ -44E39 Filename Length 001E (30) │ │ │ │ -44E3B Extra Length 001C (28) │ │ │ │ -44E3D Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x44E3D: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -44E5B Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -44E5D Length 0009 (9) │ │ │ │ -44E5F Flags 03 (3) 'Modification Access' │ │ │ │ -44E60 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -44E64 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -44E68 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -44E6A Length 000B (11) │ │ │ │ -44E6C Version 01 (1) │ │ │ │ -44E6D UID Size 04 (4) │ │ │ │ -44E6E UID 00000000 (0) │ │ │ │ -44E72 GID Size 04 (4) │ │ │ │ -44E73 GID 00000000 (0) │ │ │ │ -44E77 PAYLOAD │ │ │ │ - │ │ │ │ -4526F LOCAL HEADER #41 04034B50 (67324752) │ │ │ │ -45273 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -45274 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -45275 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -45277 Compression Method 0008 (8) 'Deflated' │ │ │ │ -45279 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -4527D CRC 93538F15 (2471726869) │ │ │ │ -45281 Compressed Size 00004296 (17046) │ │ │ │ -45285 Uncompressed Size 0000D8E8 (55528) │ │ │ │ -45289 Filename Length 0013 (19) │ │ │ │ -4528B Extra Length 001C (28) │ │ │ │ -4528D Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x4528D: Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -452A0 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -452A2 Length 0009 (9) │ │ │ │ -452A4 Flags 03 (3) 'Modification Access' │ │ │ │ -452A5 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -452A9 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -452AD Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -452AF Length 000B (11) │ │ │ │ -452B1 Version 01 (1) │ │ │ │ -452B2 UID Size 04 (4) │ │ │ │ -452B3 UID 00000000 (0) │ │ │ │ -452B7 GID Size 04 (4) │ │ │ │ -452B8 GID 00000000 (0) │ │ │ │ -452BC PAYLOAD │ │ │ │ - │ │ │ │ -49552 LOCAL HEADER #42 04034B50 (67324752) │ │ │ │ -49556 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -49557 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -49558 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -4955A Compression Method 0008 (8) 'Deflated' │ │ │ │ -4955C Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -49560 CRC 117AFDAE (293273006) │ │ │ │ -49564 Compressed Size 000026C5 (9925) │ │ │ │ -49568 Uncompressed Size 00006E46 (28230) │ │ │ │ -4956C Filename Length 0019 (25) │ │ │ │ -4956E Extra Length 001C (28) │ │ │ │ -49570 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x49570: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -49589 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -4958B Length 0009 (9) │ │ │ │ -4958D Flags 03 (3) 'Modification Access' │ │ │ │ -4958E Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -49592 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -49596 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -49598 Length 000B (11) │ │ │ │ -4959A Version 01 (1) │ │ │ │ -4959B UID Size 04 (4) │ │ │ │ -4959C UID 00000000 (0) │ │ │ │ -495A0 GID Size 04 (4) │ │ │ │ -495A1 GID 00000000 (0) │ │ │ │ -495A5 PAYLOAD │ │ │ │ - │ │ │ │ -4BC6A LOCAL HEADER #43 04034B50 (67324752) │ │ │ │ -4BC6E Extract Zip Spec 14 (20) '2.0' │ │ │ │ -4BC6F Extract OS 00 (0) 'MS-DOS' │ │ │ │ -4BC70 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -4BC72 Compression Method 0008 (8) 'Deflated' │ │ │ │ -4BC74 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -4BC78 CRC 300CDC3B (806149179) │ │ │ │ -4BC7C Compressed Size 0000273A (10042) │ │ │ │ -4BC80 Uncompressed Size 00008B84 (35716) │ │ │ │ -4BC84 Filename Length 0019 (25) │ │ │ │ -4BC86 Extra Length 001C (28) │ │ │ │ -4BC88 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x4BC88: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -4BCA1 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -4BCA3 Length 0009 (9) │ │ │ │ -4BCA5 Flags 03 (3) 'Modification Access' │ │ │ │ -4BCA6 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -4BCAA Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -4BCAE Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -4BCB0 Length 000B (11) │ │ │ │ -4BCB2 Version 01 (1) │ │ │ │ -4BCB3 UID Size 04 (4) │ │ │ │ -4BCB4 UID 00000000 (0) │ │ │ │ -4BCB8 GID Size 04 (4) │ │ │ │ -4BCB9 GID 00000000 (0) │ │ │ │ -4BCBD PAYLOAD │ │ │ │ - │ │ │ │ -4E3F7 LOCAL HEADER #44 04034B50 (67324752) │ │ │ │ -4E3FB Extract Zip Spec 14 (20) '2.0' │ │ │ │ -4E3FC Extract OS 00 (0) 'MS-DOS' │ │ │ │ -4E3FD General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -4E3FF Compression Method 0008 (8) 'Deflated' │ │ │ │ -4E401 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -4E405 CRC D651D0B9 (3595686073) │ │ │ │ -4E409 Compressed Size 00000CF1 (3313) │ │ │ │ -4E40D Uncompressed Size 0000517B (20859) │ │ │ │ -4E411 Filename Length 0021 (33) │ │ │ │ -4E413 Extra Length 001C (28) │ │ │ │ -4E415 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x4E415: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -4E436 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -4E438 Length 0009 (9) │ │ │ │ -4E43A Flags 03 (3) 'Modification Access' │ │ │ │ -4E43B Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -4E43F Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -4E443 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -4E445 Length 000B (11) │ │ │ │ -4E447 Version 01 (1) │ │ │ │ -4E448 UID Size 04 (4) │ │ │ │ -4E449 UID 00000000 (0) │ │ │ │ -4E44D GID Size 04 (4) │ │ │ │ -4E44E GID 00000000 (0) │ │ │ │ -4E452 PAYLOAD │ │ │ │ - │ │ │ │ -4F143 LOCAL HEADER #45 04034B50 (67324752) │ │ │ │ -4F147 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -4F148 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -4F149 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -4F14B Compression Method 0008 (8) 'Deflated' │ │ │ │ -4F14D Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -4F151 CRC 0D2E5D9B (221142427) │ │ │ │ -4F155 Compressed Size 00000468 (1128) │ │ │ │ -4F159 Uncompressed Size 00000932 (2354) │ │ │ │ -4F15D Filename Length 001B (27) │ │ │ │ -4F15F Extra Length 001C (28) │ │ │ │ -4F161 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x4F161: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -4F17C Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -4F17E Length 0009 (9) │ │ │ │ -4F180 Flags 03 (3) 'Modification Access' │ │ │ │ -4F181 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -4F185 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -4F189 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -4F18B Length 000B (11) │ │ │ │ -4F18D Version 01 (1) │ │ │ │ -4F18E UID Size 04 (4) │ │ │ │ -4F18F UID 00000000 (0) │ │ │ │ -4F193 GID Size 04 (4) │ │ │ │ -4F194 GID 00000000 (0) │ │ │ │ -4F198 PAYLOAD │ │ │ │ - │ │ │ │ -4F600 LOCAL HEADER #46 04034B50 (67324752) │ │ │ │ -4F604 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -4F605 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -4F606 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -4F608 Compression Method 0008 (8) 'Deflated' │ │ │ │ -4F60A Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -4F60E CRC 5B690D13 (1533611283) │ │ │ │ -4F612 Compressed Size 000016EF (5871) │ │ │ │ -4F616 Uncompressed Size 00007A6E (31342) │ │ │ │ -4F61A Filename Length 001F (31) │ │ │ │ -4F61C Extra Length 001C (28) │ │ │ │ -4F61E Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x4F61E: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -4F63D Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -4F63F Length 0009 (9) │ │ │ │ -4F641 Flags 03 (3) 'Modification Access' │ │ │ │ -4F642 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -4F646 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -4F64A Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -4F64C Length 000B (11) │ │ │ │ -4F64E Version 01 (1) │ │ │ │ -4F64F UID Size 04 (4) │ │ │ │ -4F650 UID 00000000 (0) │ │ │ │ -4F654 GID Size 04 (4) │ │ │ │ -4F655 GID 00000000 (0) │ │ │ │ -4F659 PAYLOAD │ │ │ │ - │ │ │ │ -50D48 LOCAL HEADER #47 04034B50 (67324752) │ │ │ │ -50D4C Extract Zip Spec 14 (20) '2.0' │ │ │ │ -50D4D Extract OS 00 (0) 'MS-DOS' │ │ │ │ -50D4E General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -50D50 Compression Method 0008 (8) 'Deflated' │ │ │ │ -50D52 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -50D56 CRC 70167630 (1880520240) │ │ │ │ -50D5A Compressed Size 0000415D (16733) │ │ │ │ -50D5E Uncompressed Size 0001D160 (119136) │ │ │ │ -50D62 Filename Length 0010 (16) │ │ │ │ -50D64 Extra Length 001C (28) │ │ │ │ -50D66 Filename 'XXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x50D66: Filename 'XXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -50D76 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -50D78 Length 0009 (9) │ │ │ │ -50D7A Flags 03 (3) 'Modification Access' │ │ │ │ -50D7B Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -50D7F Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -50D83 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -50D85 Length 000B (11) │ │ │ │ -50D87 Version 01 (1) │ │ │ │ -50D88 UID Size 04 (4) │ │ │ │ -50D89 UID 00000000 (0) │ │ │ │ -50D8D GID Size 04 (4) │ │ │ │ -50D8E GID 00000000 (0) │ │ │ │ -50D92 PAYLOAD │ │ │ │ - │ │ │ │ -54EEF LOCAL HEADER #48 04034B50 (67324752) │ │ │ │ -54EF3 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -54EF4 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -54EF5 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -54EF7 Compression Method 0008 (8) 'Deflated' │ │ │ │ -54EF9 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -54EFD CRC 6CEC6D86 (1827433862) │ │ │ │ -54F01 Compressed Size 00000A98 (2712) │ │ │ │ -54F05 Uncompressed Size 00002106 (8454) │ │ │ │ -54F09 Filename Length 0014 (20) │ │ │ │ -54F0B Extra Length 001C (28) │ │ │ │ -54F0D Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x54F0D: Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -54F21 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -54F23 Length 0009 (9) │ │ │ │ -54F25 Flags 03 (3) 'Modification Access' │ │ │ │ -54F26 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -54F2A Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -54F2E Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -54F30 Length 000B (11) │ │ │ │ -54F32 Version 01 (1) │ │ │ │ -54F33 UID Size 04 (4) │ │ │ │ -54F34 UID 00000000 (0) │ │ │ │ -54F38 GID Size 04 (4) │ │ │ │ -54F39 GID 00000000 (0) │ │ │ │ -54F3D PAYLOAD │ │ │ │ - │ │ │ │ -559D5 LOCAL HEADER #49 04034B50 (67324752) │ │ │ │ -559D9 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -559DA Extract OS 00 (0) 'MS-DOS' │ │ │ │ -559DB General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -559DD Compression Method 0008 (8) 'Deflated' │ │ │ │ -559DF Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -559E3 CRC AC6356BB (2892191419) │ │ │ │ -559E7 Compressed Size 0000AD83 (44419) │ │ │ │ -559EB Uncompressed Size 0003EB1B (256795) │ │ │ │ -559EF Filename Length 0017 (23) │ │ │ │ -559F1 Extra Length 001C (28) │ │ │ │ -559F3 Filename 'XXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x559F3: Filename 'XXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -55A0A Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -55A0C Length 0009 (9) │ │ │ │ -55A0E Flags 03 (3) 'Modification Access' │ │ │ │ -55A0F Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -55A13 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -55A17 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -55A19 Length 000B (11) │ │ │ │ -55A1B Version 01 (1) │ │ │ │ -55A1C UID Size 04 (4) │ │ │ │ -55A1D UID 00000000 (0) │ │ │ │ -55A21 GID Size 04 (4) │ │ │ │ -55A22 GID 00000000 (0) │ │ │ │ -55A26 PAYLOAD │ │ │ │ - │ │ │ │ -607A9 LOCAL HEADER #50 04034B50 (67324752) │ │ │ │ -607AD Extract Zip Spec 14 (20) '2.0' │ │ │ │ -607AE Extract OS 00 (0) 'MS-DOS' │ │ │ │ -607AF General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -607B1 Compression Method 0008 (8) 'Deflated' │ │ │ │ -607B3 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -607B7 CRC 6543FD4E (1698954574) │ │ │ │ -607BB Compressed Size 00000401 (1025) │ │ │ │ -607BF Uncompressed Size 0000093E (2366) │ │ │ │ -607C3 Filename Length 0013 (19) │ │ │ │ -607C5 Extra Length 001C (28) │ │ │ │ -607C7 Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x607C7: Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -607DA Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -607DC Length 0009 (9) │ │ │ │ -607DE Flags 03 (3) 'Modification Access' │ │ │ │ -607DF Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -607E3 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -607E7 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -607E9 Length 000B (11) │ │ │ │ -607EB Version 01 (1) │ │ │ │ -607EC UID Size 04 (4) │ │ │ │ -607ED UID 00000000 (0) │ │ │ │ -607F1 GID Size 04 (4) │ │ │ │ -607F2 GID 00000000 (0) │ │ │ │ -607F6 PAYLOAD │ │ │ │ - │ │ │ │ -60BF7 LOCAL HEADER #51 04034B50 (67324752) │ │ │ │ -60BFB Extract Zip Spec 14 (20) '2.0' │ │ │ │ -60BFC Extract OS 00 (0) 'MS-DOS' │ │ │ │ -60BFD General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -60BFF Compression Method 0008 (8) 'Deflated' │ │ │ │ -60C01 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -60C05 CRC 8FA51372 (2409960306) │ │ │ │ -60C09 Compressed Size 000014D7 (5335) │ │ │ │ -60C0D Uncompressed Size 00006893 (26771) │ │ │ │ -60C11 Filename Length 0012 (18) │ │ │ │ -60C13 Extra Length 001C (28) │ │ │ │ -60C15 Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x60C15: Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -60C27 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -60C29 Length 0009 (9) │ │ │ │ -60C2B Flags 03 (3) 'Modification Access' │ │ │ │ -60C2C Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -60C30 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -60C34 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -60C36 Length 000B (11) │ │ │ │ -60C38 Version 01 (1) │ │ │ │ -60C39 UID Size 04 (4) │ │ │ │ -60C3A UID 00000000 (0) │ │ │ │ -60C3E GID Size 04 (4) │ │ │ │ -60C3F GID 00000000 (0) │ │ │ │ -60C43 PAYLOAD │ │ │ │ - │ │ │ │ -6211A LOCAL HEADER #52 04034B50 (67324752) │ │ │ │ -6211E Extract Zip Spec 14 (20) '2.0' │ │ │ │ -6211F Extract OS 00 (0) 'MS-DOS' │ │ │ │ -62120 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -62122 Compression Method 0008 (8) 'Deflated' │ │ │ │ -62124 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -62128 CRC 67A3A30C (1738777356) │ │ │ │ -6212C Compressed Size 000011F1 (4593) │ │ │ │ -62130 Uncompressed Size 0000410D (16653) │ │ │ │ -62134 Filename Length 0012 (18) │ │ │ │ -62136 Extra Length 001C (28) │ │ │ │ -62138 Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x62138: Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -6214A Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -6214C Length 0009 (9) │ │ │ │ -6214E Flags 03 (3) 'Modification Access' │ │ │ │ -6214F Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -62153 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -62157 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -62159 Length 000B (11) │ │ │ │ -6215B Version 01 (1) │ │ │ │ -6215C UID Size 04 (4) │ │ │ │ -6215D UID 00000000 (0) │ │ │ │ -62161 GID Size 04 (4) │ │ │ │ -62162 GID 00000000 (0) │ │ │ │ -62166 PAYLOAD │ │ │ │ - │ │ │ │ -63357 LOCAL HEADER #53 04034B50 (67324752) │ │ │ │ -6335B Extract Zip Spec 14 (20) '2.0' │ │ │ │ -6335C Extract OS 00 (0) 'MS-DOS' │ │ │ │ -6335D General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -6335F Compression Method 0008 (8) 'Deflated' │ │ │ │ -63361 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -63365 CRC FEC012D9 (4274000601) │ │ │ │ -63369 Compressed Size 000009DC (2524) │ │ │ │ -6336D Uncompressed Size 0000352A (13610) │ │ │ │ -63371 Filename Length 0019 (25) │ │ │ │ -63373 Extra Length 001C (28) │ │ │ │ -63375 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x63375: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -6338E Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -63390 Length 0009 (9) │ │ │ │ -63392 Flags 03 (3) 'Modification Access' │ │ │ │ -63393 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -63397 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -6339B Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -6339D Length 000B (11) │ │ │ │ -6339F Version 01 (1) │ │ │ │ -633A0 UID Size 04 (4) │ │ │ │ -633A1 UID 00000000 (0) │ │ │ │ -633A5 GID Size 04 (4) │ │ │ │ -633A6 GID 00000000 (0) │ │ │ │ -633AA PAYLOAD │ │ │ │ - │ │ │ │ -63D86 LOCAL HEADER #54 04034B50 (67324752) │ │ │ │ -63D8A Extract Zip Spec 14 (20) '2.0' │ │ │ │ -63D8B Extract OS 00 (0) 'MS-DOS' │ │ │ │ -63D8C General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -63D8E Compression Method 0008 (8) 'Deflated' │ │ │ │ -63D90 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -63D94 CRC E3AB0B6C (3819637612) │ │ │ │ -63D98 Compressed Size 000018B7 (6327) │ │ │ │ -63D9C Uncompressed Size 0000A679 (42617) │ │ │ │ -63DA0 Filename Length 0019 (25) │ │ │ │ -63DA2 Extra Length 001C (28) │ │ │ │ -63DA4 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x63DA4: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -63DBD Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -63DBF Length 0009 (9) │ │ │ │ -63DC1 Flags 03 (3) 'Modification Access' │ │ │ │ -63DC2 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -63DC6 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -63DCA Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -63DCC Length 000B (11) │ │ │ │ -63DCE Version 01 (1) │ │ │ │ -63DCF UID Size 04 (4) │ │ │ │ -63DD0 UID 00000000 (0) │ │ │ │ -63DD4 GID Size 04 (4) │ │ │ │ -63DD5 GID 00000000 (0) │ │ │ │ -63DD9 PAYLOAD │ │ │ │ - │ │ │ │ -65690 LOCAL HEADER #55 04034B50 (67324752) │ │ │ │ -65694 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -65695 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -65696 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -65698 Compression Method 0008 (8) 'Deflated' │ │ │ │ -6569A Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -6569E CRC 63DD925D (1675465309) │ │ │ │ -656A2 Compressed Size 0000177F (6015) │ │ │ │ -656A6 Uncompressed Size 0000472D (18221) │ │ │ │ -656AA Filename Length 0014 (20) │ │ │ │ -656AC Extra Length 001C (28) │ │ │ │ -656AE Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x656AE: Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -656C2 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -656C4 Length 0009 (9) │ │ │ │ -656C6 Flags 03 (3) 'Modification Access' │ │ │ │ -656C7 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -656CB Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -656CF Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -656D1 Length 000B (11) │ │ │ │ -656D3 Version 01 (1) │ │ │ │ -656D4 UID Size 04 (4) │ │ │ │ -656D5 UID 00000000 (0) │ │ │ │ -656D9 GID Size 04 (4) │ │ │ │ -656DA GID 00000000 (0) │ │ │ │ -656DE PAYLOAD │ │ │ │ - │ │ │ │ -66E5D LOCAL HEADER #56 04034B50 (67324752) │ │ │ │ -66E61 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -66E62 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -66E63 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -66E65 Compression Method 0008 (8) 'Deflated' │ │ │ │ -66E67 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -66E6B CRC 7088EC5F (1888021599) │ │ │ │ -66E6F Compressed Size 0000040B (1035) │ │ │ │ -66E73 Uncompressed Size 00000826 (2086) │ │ │ │ -66E77 Filename Length 001C (28) │ │ │ │ -66E79 Extra Length 001C (28) │ │ │ │ -66E7B Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x66E7B: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -66E97 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -66E99 Length 0009 (9) │ │ │ │ -66E9B Flags 03 (3) 'Modification Access' │ │ │ │ -66E9C Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -66EA0 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -66EA4 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -66EA6 Length 000B (11) │ │ │ │ -66EA8 Version 01 (1) │ │ │ │ -66EA9 UID Size 04 (4) │ │ │ │ -66EAA UID 00000000 (0) │ │ │ │ -66EAE GID Size 04 (4) │ │ │ │ -66EAF GID 00000000 (0) │ │ │ │ -66EB3 PAYLOAD │ │ │ │ - │ │ │ │ -672BE LOCAL HEADER #57 04034B50 (67324752) │ │ │ │ -672C2 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -672C3 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -672C4 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -672C6 Compression Method 0008 (8) 'Deflated' │ │ │ │ -672C8 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -672CC CRC 17AEC46D (397329517) │ │ │ │ -672D0 Compressed Size 00002496 (9366) │ │ │ │ -672D4 Uncompressed Size 0000B5FA (46586) │ │ │ │ -672D8 Filename Length 001F (31) │ │ │ │ -672DA Extra Length 001C (28) │ │ │ │ -672DC Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x672DC: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -672FB Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -672FD Length 0009 (9) │ │ │ │ -672FF Flags 03 (3) 'Modification Access' │ │ │ │ -67300 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -67304 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -67308 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -6730A Length 000B (11) │ │ │ │ -6730C Version 01 (1) │ │ │ │ -6730D UID Size 04 (4) │ │ │ │ -6730E UID 00000000 (0) │ │ │ │ -67312 GID Size 04 (4) │ │ │ │ -67313 GID 00000000 (0) │ │ │ │ -67317 PAYLOAD │ │ │ │ - │ │ │ │ -697AD LOCAL HEADER #58 04034B50 (67324752) │ │ │ │ -697B1 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -697B2 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -697B3 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -697B5 Compression Method 0008 (8) 'Deflated' │ │ │ │ -697B7 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -697BB CRC C2A7AFB2 (3265769394) │ │ │ │ -697BF Compressed Size 00000E7A (3706) │ │ │ │ -697C3 Uncompressed Size 000052DA (21210) │ │ │ │ -697C7 Filename Length 001F (31) │ │ │ │ -697C9 Extra Length 001C (28) │ │ │ │ -697CB Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x697CB: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -697EA Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -697EC Length 0009 (9) │ │ │ │ -697EE Flags 03 (3) 'Modification Access' │ │ │ │ -697EF Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -697F3 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -697F7 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -697F9 Length 000B (11) │ │ │ │ -697FB Version 01 (1) │ │ │ │ -697FC UID Size 04 (4) │ │ │ │ -697FD UID 00000000 (0) │ │ │ │ -69801 GID Size 04 (4) │ │ │ │ -69802 GID 00000000 (0) │ │ │ │ -69806 PAYLOAD │ │ │ │ - │ │ │ │ -6A680 LOCAL HEADER #59 04034B50 (67324752) │ │ │ │ -6A684 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -6A685 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -6A686 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -6A688 Compression Method 0008 (8) 'Deflated' │ │ │ │ -6A68A Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -6A68E CRC B20283C2 (2986509250) │ │ │ │ -6A692 Compressed Size 00000A44 (2628) │ │ │ │ -6A696 Uncompressed Size 0000247B (9339) │ │ │ │ -6A69A Filename Length 0013 (19) │ │ │ │ -6A69C Extra Length 001C (28) │ │ │ │ -6A69E Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x6A69E: Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -6A6B1 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -6A6B3 Length 0009 (9) │ │ │ │ -6A6B5 Flags 03 (3) 'Modification Access' │ │ │ │ -6A6B6 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -6A6BA Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -6A6BE Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -6A6C0 Length 000B (11) │ │ │ │ -6A6C2 Version 01 (1) │ │ │ │ -6A6C3 UID Size 04 (4) │ │ │ │ -6A6C4 UID 00000000 (0) │ │ │ │ -6A6C8 GID Size 04 (4) │ │ │ │ -6A6C9 GID 00000000 (0) │ │ │ │ -6A6CD PAYLOAD │ │ │ │ - │ │ │ │ -6B111 LOCAL HEADER #60 04034B50 (67324752) │ │ │ │ -6B115 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -6B116 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -6B117 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -6B119 Compression Method 0008 (8) 'Deflated' │ │ │ │ -6B11B Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -6B11F CRC 21DCD0E4 (568119524) │ │ │ │ -6B123 Compressed Size 0000248A (9354) │ │ │ │ -6B127 Uncompressed Size 0000B84D (47181) │ │ │ │ -6B12B Filename Length 0019 (25) │ │ │ │ -6B12D Extra Length 001C (28) │ │ │ │ -6B12F Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x6B12F: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -6B148 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -6B14A Length 0009 (9) │ │ │ │ -6B14C Flags 03 (3) 'Modification Access' │ │ │ │ -6B14D Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -6B151 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -6B155 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -6B157 Length 000B (11) │ │ │ │ -6B159 Version 01 (1) │ │ │ │ -6B15A UID Size 04 (4) │ │ │ │ -6B15B UID 00000000 (0) │ │ │ │ -6B15F GID Size 04 (4) │ │ │ │ -6B160 GID 00000000 (0) │ │ │ │ -6B164 PAYLOAD │ │ │ │ - │ │ │ │ -6D5EE LOCAL HEADER #61 04034B50 (67324752) │ │ │ │ -6D5F2 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -6D5F3 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -6D5F4 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -6D5F6 Compression Method 0008 (8) 'Deflated' │ │ │ │ -6D5F8 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -6D5FC CRC 7B1EDBE3 (2065619939) │ │ │ │ -6D600 Compressed Size 00000EFA (3834) │ │ │ │ -6D604 Uncompressed Size 00003A2D (14893) │ │ │ │ -6D608 Filename Length 0024 (36) │ │ │ │ -6D60A Extra Length 001C (28) │ │ │ │ -6D60C Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x6D60C: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -6D630 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -6D632 Length 0009 (9) │ │ │ │ -6D634 Flags 03 (3) 'Modification Access' │ │ │ │ -6D635 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -6D639 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -6D63D Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -6D63F Length 000B (11) │ │ │ │ -6D641 Version 01 (1) │ │ │ │ -6D642 UID Size 04 (4) │ │ │ │ -6D643 UID 00000000 (0) │ │ │ │ -6D647 GID Size 04 (4) │ │ │ │ -6D648 GID 00000000 (0) │ │ │ │ -6D64C PAYLOAD │ │ │ │ - │ │ │ │ -6E546 LOCAL HEADER #62 04034B50 (67324752) │ │ │ │ -6E54A Extract Zip Spec 14 (20) '2.0' │ │ │ │ -6E54B Extract OS 00 (0) 'MS-DOS' │ │ │ │ -6E54C General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -6E54E Compression Method 0008 (8) 'Deflated' │ │ │ │ -6E550 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -6E554 CRC C480C4AF (3296773295) │ │ │ │ -6E558 Compressed Size 00001AB8 (6840) │ │ │ │ -6E55C Uncompressed Size 00005F39 (24377) │ │ │ │ -6E560 Filename Length 0017 (23) │ │ │ │ -6E562 Extra Length 001C (28) │ │ │ │ -6E564 Filename 'XXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x6E564: Filename 'XXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -6E57B Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -6E57D Length 0009 (9) │ │ │ │ -6E57F Flags 03 (3) 'Modification Access' │ │ │ │ -6E580 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -6E584 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -6E588 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -6E58A Length 000B (11) │ │ │ │ -6E58C Version 01 (1) │ │ │ │ -6E58D UID Size 04 (4) │ │ │ │ -6E58E UID 00000000 (0) │ │ │ │ -6E592 GID Size 04 (4) │ │ │ │ -6E593 GID 00000000 (0) │ │ │ │ -6E597 PAYLOAD │ │ │ │ - │ │ │ │ -7004F LOCAL HEADER #63 04034B50 (67324752) │ │ │ │ -70053 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -70054 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -70055 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -70057 Compression Method 0008 (8) 'Deflated' │ │ │ │ -70059 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -7005D CRC 11E32AF1 (300100337) │ │ │ │ -70061 Compressed Size 00000ED3 (3795) │ │ │ │ -70065 Uncompressed Size 000038E2 (14562) │ │ │ │ -70069 Filename Length 0023 (35) │ │ │ │ -7006B Extra Length 001C (28) │ │ │ │ -7006D Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x7006D: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -70090 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -70092 Length 0009 (9) │ │ │ │ -70094 Flags 03 (3) 'Modification Access' │ │ │ │ -70095 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -70099 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -7009D Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -7009F Length 000B (11) │ │ │ │ -700A1 Version 01 (1) │ │ │ │ -700A2 UID Size 04 (4) │ │ │ │ -700A3 UID 00000000 (0) │ │ │ │ -700A7 GID Size 04 (4) │ │ │ │ -700A8 GID 00000000 (0) │ │ │ │ -700AC PAYLOAD │ │ │ │ - │ │ │ │ -70F7F LOCAL HEADER #64 04034B50 (67324752) │ │ │ │ -70F83 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -70F84 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -70F85 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -70F87 Compression Method 0008 (8) 'Deflated' │ │ │ │ -70F89 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -70F8D CRC 2DB7929F (767005343) │ │ │ │ -70F91 Compressed Size 00000113 (275) │ │ │ │ -70F95 Uncompressed Size 000001F3 (499) │ │ │ │ -70F99 Filename Length 001B (27) │ │ │ │ -70F9B Extra Length 001C (28) │ │ │ │ -70F9D Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x70F9D: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -70FB8 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -70FBA Length 0009 (9) │ │ │ │ -70FBC Flags 03 (3) 'Modification Access' │ │ │ │ -70FBD Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -70FC1 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -70FC5 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -70FC7 Length 000B (11) │ │ │ │ -70FC9 Version 01 (1) │ │ │ │ -70FCA UID Size 04 (4) │ │ │ │ -70FCB UID 00000000 (0) │ │ │ │ -70FCF GID Size 04 (4) │ │ │ │ -70FD0 GID 00000000 (0) │ │ │ │ -70FD4 PAYLOAD │ │ │ │ - │ │ │ │ -710E7 LOCAL HEADER #65 04034B50 (67324752) │ │ │ │ -710EB Extract Zip Spec 14 (20) '2.0' │ │ │ │ -710EC Extract OS 00 (0) 'MS-DOS' │ │ │ │ -710ED General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -710EF Compression Method 0008 (8) 'Deflated' │ │ │ │ -710F1 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -710F5 CRC 7EA8516A (2124960106) │ │ │ │ -710F9 Compressed Size 00001894 (6292) │ │ │ │ -710FD Uncompressed Size 00008FAD (36781) │ │ │ │ -71101 Filename Length 001D (29) │ │ │ │ -71103 Extra Length 001C (28) │ │ │ │ -71105 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x71105: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -71122 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -71124 Length 0009 (9) │ │ │ │ -71126 Flags 03 (3) 'Modification Access' │ │ │ │ -71127 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -7112B Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -7112F Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -71131 Length 000B (11) │ │ │ │ -71133 Version 01 (1) │ │ │ │ -71134 UID Size 04 (4) │ │ │ │ -71135 UID 00000000 (0) │ │ │ │ -71139 GID Size 04 (4) │ │ │ │ -7113A GID 00000000 (0) │ │ │ │ -7113E PAYLOAD │ │ │ │ - │ │ │ │ -729D2 LOCAL HEADER #66 04034B50 (67324752) │ │ │ │ -729D6 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -729D7 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -729D8 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -729DA Compression Method 0008 (8) 'Deflated' │ │ │ │ -729DC Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -729E0 CRC ECF01B2E (3975158574) │ │ │ │ -729E4 Compressed Size 0000164B (5707) │ │ │ │ -729E8 Uncompressed Size 00003A9C (15004) │ │ │ │ -729EC Filename Length 0015 (21) │ │ │ │ -729EE Extra Length 001C (28) │ │ │ │ -729F0 Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x729F0: Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -72A05 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -72A07 Length 0009 (9) │ │ │ │ -72A09 Flags 03 (3) 'Modification Access' │ │ │ │ -72A0A Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -72A0E Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -72A12 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -72A14 Length 000B (11) │ │ │ │ -72A16 Version 01 (1) │ │ │ │ -72A17 UID Size 04 (4) │ │ │ │ -72A18 UID 00000000 (0) │ │ │ │ -72A1C GID Size 04 (4) │ │ │ │ -72A1D GID 00000000 (0) │ │ │ │ -72A21 PAYLOAD │ │ │ │ - │ │ │ │ -7406C LOCAL HEADER #67 04034B50 (67324752) │ │ │ │ -74070 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -74071 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -74072 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -74074 Compression Method 0008 (8) 'Deflated' │ │ │ │ -74076 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -7407A CRC C2126410 (3255985168) │ │ │ │ -7407E Compressed Size 00003B51 (15185) │ │ │ │ -74082 Uncompressed Size 00011CC3 (72899) │ │ │ │ -74086 Filename Length 0016 (22) │ │ │ │ -74088 Extra Length 001C (28) │ │ │ │ -7408A Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x7408A: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -740A0 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -740A2 Length 0009 (9) │ │ │ │ -740A4 Flags 03 (3) 'Modification Access' │ │ │ │ -740A5 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -740A9 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -740AD Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -740AF Length 000B (11) │ │ │ │ -740B1 Version 01 (1) │ │ │ │ -740B2 UID Size 04 (4) │ │ │ │ -740B3 UID 00000000 (0) │ │ │ │ -740B7 GID Size 04 (4) │ │ │ │ -740B8 GID 00000000 (0) │ │ │ │ -740BC PAYLOAD │ │ │ │ - │ │ │ │ -77C0D LOCAL HEADER #68 04034B50 (67324752) │ │ │ │ -77C11 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -77C12 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -77C13 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -77C15 Compression Method 0008 (8) 'Deflated' │ │ │ │ -77C17 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -77C1B CRC 3D4C1AC5 (1028397765) │ │ │ │ -77C1F Compressed Size 00003E80 (16000) │ │ │ │ -77C23 Uncompressed Size 0001C17C (115068) │ │ │ │ -77C27 Filename Length 0019 (25) │ │ │ │ -77C29 Extra Length 001C (28) │ │ │ │ -77C2B Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x77C2B: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -77C44 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -77C46 Length 0009 (9) │ │ │ │ -77C48 Flags 03 (3) 'Modification Access' │ │ │ │ -77C49 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -77C4D Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -77C51 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -77C53 Length 000B (11) │ │ │ │ -77C55 Version 01 (1) │ │ │ │ -77C56 UID Size 04 (4) │ │ │ │ -77C57 UID 00000000 (0) │ │ │ │ -77C5B GID Size 04 (4) │ │ │ │ -77C5C GID 00000000 (0) │ │ │ │ -77C60 PAYLOAD │ │ │ │ - │ │ │ │ -7BAE0 LOCAL HEADER #69 04034B50 (67324752) │ │ │ │ -7BAE4 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -7BAE5 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -7BAE6 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -7BAE8 Compression Method 0008 (8) 'Deflated' │ │ │ │ -7BAEA Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -7BAEE CRC B300AC31 (3003165745) │ │ │ │ -7BAF2 Compressed Size 00000838 (2104) │ │ │ │ -7BAF6 Uncompressed Size 00003384 (13188) │ │ │ │ -7BAFA Filename Length 0011 (17) │ │ │ │ -7BAFC Extra Length 001C (28) │ │ │ │ -7BAFE Filename 'XXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x7BAFE: Filename 'XXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -7BB0F Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -7BB11 Length 0009 (9) │ │ │ │ -7BB13 Flags 03 (3) 'Modification Access' │ │ │ │ -7BB14 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -7BB18 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -7BB1C Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -7BB1E Length 000B (11) │ │ │ │ -7BB20 Version 01 (1) │ │ │ │ -7BB21 UID Size 04 (4) │ │ │ │ -7BB22 UID 00000000 (0) │ │ │ │ -7BB26 GID Size 04 (4) │ │ │ │ -7BB27 GID 00000000 (0) │ │ │ │ -7BB2B PAYLOAD │ │ │ │ - │ │ │ │ -7C363 LOCAL HEADER #70 04034B50 (67324752) │ │ │ │ -7C367 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -7C368 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -7C369 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -7C36B Compression Method 0008 (8) 'Deflated' │ │ │ │ -7C36D Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -7C371 CRC 02590B0F (39389967) │ │ │ │ -7C375 Compressed Size 000051A8 (20904) │ │ │ │ -7C379 Uncompressed Size 0001FBE0 (130016) │ │ │ │ -7C37D Filename Length 0015 (21) │ │ │ │ -7C37F Extra Length 001C (28) │ │ │ │ -7C381 Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x7C381: Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -7C396 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -7C398 Length 0009 (9) │ │ │ │ -7C39A Flags 03 (3) 'Modification Access' │ │ │ │ -7C39B Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -7C39F Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -7C3A3 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -7C3A5 Length 000B (11) │ │ │ │ -7C3A7 Version 01 (1) │ │ │ │ -7C3A8 UID Size 04 (4) │ │ │ │ -7C3A9 UID 00000000 (0) │ │ │ │ -7C3AD GID Size 04 (4) │ │ │ │ -7C3AE GID 00000000 (0) │ │ │ │ -7C3B2 PAYLOAD │ │ │ │ - │ │ │ │ -8155A LOCAL HEADER #71 04034B50 (67324752) │ │ │ │ -8155E Extract Zip Spec 14 (20) '2.0' │ │ │ │ -8155F Extract OS 00 (0) 'MS-DOS' │ │ │ │ -81560 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -81562 Compression Method 0008 (8) 'Deflated' │ │ │ │ -81564 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -81568 CRC C1807A53 (3246422611) │ │ │ │ -8156C Compressed Size 00001B07 (6919) │ │ │ │ -81570 Uncompressed Size 000081D0 (33232) │ │ │ │ -81574 Filename Length 0019 (25) │ │ │ │ -81576 Extra Length 001C (28) │ │ │ │ -81578 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x81578: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -81591 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -81593 Length 0009 (9) │ │ │ │ -81595 Flags 03 (3) 'Modification Access' │ │ │ │ -81596 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -8159A Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -8159E Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -815A0 Length 000B (11) │ │ │ │ -815A2 Version 01 (1) │ │ │ │ -815A3 UID Size 04 (4) │ │ │ │ -815A4 UID 00000000 (0) │ │ │ │ -815A8 GID Size 04 (4) │ │ │ │ -815A9 GID 00000000 (0) │ │ │ │ -815AD PAYLOAD │ │ │ │ - │ │ │ │ -830B4 LOCAL HEADER #72 04034B50 (67324752) │ │ │ │ -830B8 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -830B9 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -830BA General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -830BC Compression Method 0008 (8) 'Deflated' │ │ │ │ -830BE Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -830C2 CRC 9189CEB3 (2441727667) │ │ │ │ -830C6 Compressed Size 00000D99 (3481) │ │ │ │ -830CA Uncompressed Size 00002EA0 (11936) │ │ │ │ -830CE Filename Length 0018 (24) │ │ │ │ -830D0 Extra Length 001C (28) │ │ │ │ -830D2 Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x830D2: Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -830EA Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -830EC Length 0009 (9) │ │ │ │ -830EE Flags 03 (3) 'Modification Access' │ │ │ │ -830EF Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -830F3 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -830F7 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -830F9 Length 000B (11) │ │ │ │ -830FB Version 01 (1) │ │ │ │ -830FC UID Size 04 (4) │ │ │ │ -830FD UID 00000000 (0) │ │ │ │ -83101 GID Size 04 (4) │ │ │ │ -83102 GID 00000000 (0) │ │ │ │ -83106 PAYLOAD │ │ │ │ - │ │ │ │ -83E9F LOCAL HEADER #73 04034B50 (67324752) │ │ │ │ -83EA3 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -83EA4 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -83EA5 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -83EA7 Compression Method 0008 (8) 'Deflated' │ │ │ │ -83EA9 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -83EAD CRC C1ECA9DB (3253512667) │ │ │ │ -83EB1 Compressed Size 000001E1 (481) │ │ │ │ -83EB5 Uncompressed Size 00000324 (804) │ │ │ │ -83EB9 Filename Length 0011 (17) │ │ │ │ -83EBB Extra Length 001C (28) │ │ │ │ -83EBD Filename 'XXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x83EBD: Filename 'XXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -83ECE Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -83ED0 Length 0009 (9) │ │ │ │ -83ED2 Flags 03 (3) 'Modification Access' │ │ │ │ -83ED3 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -83ED7 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -83EDB Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -83EDD Length 000B (11) │ │ │ │ -83EDF Version 01 (1) │ │ │ │ -83EE0 UID Size 04 (4) │ │ │ │ -83EE1 UID 00000000 (0) │ │ │ │ -83EE5 GID Size 04 (4) │ │ │ │ -83EE6 GID 00000000 (0) │ │ │ │ -83EEA PAYLOAD │ │ │ │ - │ │ │ │ -840CB LOCAL HEADER #74 04034B50 (67324752) │ │ │ │ -840CF Extract Zip Spec 14 (20) '2.0' │ │ │ │ -840D0 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -840D1 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -840D3 Compression Method 0008 (8) 'Deflated' │ │ │ │ -840D5 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -840D9 CRC A600F67C (2785080956) │ │ │ │ -840DD Compressed Size 000006C3 (1731) │ │ │ │ -840E1 Uncompressed Size 0000143A (5178) │ │ │ │ -840E5 Filename Length 0019 (25) │ │ │ │ -840E7 Extra Length 001C (28) │ │ │ │ -840E9 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x840E9: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -84102 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -84104 Length 0009 (9) │ │ │ │ -84106 Flags 03 (3) 'Modification Access' │ │ │ │ -84107 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -8410B Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -8410F Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -84111 Length 000B (11) │ │ │ │ -84113 Version 01 (1) │ │ │ │ -84114 UID Size 04 (4) │ │ │ │ -84115 UID 00000000 (0) │ │ │ │ -84119 GID Size 04 (4) │ │ │ │ -8411A GID 00000000 (0) │ │ │ │ -8411E PAYLOAD │ │ │ │ - │ │ │ │ -847E1 LOCAL HEADER #75 04034B50 (67324752) │ │ │ │ -847E5 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -847E6 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -847E7 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -847E9 Compression Method 0008 (8) 'Deflated' │ │ │ │ -847EB Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -847EF CRC 155C3697 (358364823) │ │ │ │ -847F3 Compressed Size 00001B8D (7053) │ │ │ │ -847F7 Uncompressed Size 00009F60 (40800) │ │ │ │ -847FB Filename Length 0018 (24) │ │ │ │ -847FD Extra Length 001C (28) │ │ │ │ -847FF Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x847FF: Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -84817 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -84819 Length 0009 (9) │ │ │ │ -8481B Flags 03 (3) 'Modification Access' │ │ │ │ -8481C Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -84820 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -84824 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -84826 Length 000B (11) │ │ │ │ -84828 Version 01 (1) │ │ │ │ -84829 UID Size 04 (4) │ │ │ │ -8482A UID 00000000 (0) │ │ │ │ -8482E GID Size 04 (4) │ │ │ │ -8482F GID 00000000 (0) │ │ │ │ -84833 PAYLOAD │ │ │ │ - │ │ │ │ -863C0 LOCAL HEADER #76 04034B50 (67324752) │ │ │ │ -863C4 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -863C5 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -863C6 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -863C8 Compression Method 0008 (8) 'Deflated' │ │ │ │ -863CA Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -863CE CRC 46789641 (1182307905) │ │ │ │ -863D2 Compressed Size 00001705 (5893) │ │ │ │ -863D6 Uncompressed Size 00008B13 (35603) │ │ │ │ -863DA Filename Length 0012 (18) │ │ │ │ -863DC Extra Length 001C (28) │ │ │ │ -863DE Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x863DE: Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -863F0 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -863F2 Length 0009 (9) │ │ │ │ -863F4 Flags 03 (3) 'Modification Access' │ │ │ │ -863F5 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -863F9 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -863FD Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -863FF Length 000B (11) │ │ │ │ -86401 Version 01 (1) │ │ │ │ -86402 UID Size 04 (4) │ │ │ │ -86403 UID 00000000 (0) │ │ │ │ -86407 GID Size 04 (4) │ │ │ │ -86408 GID 00000000 (0) │ │ │ │ -8640C PAYLOAD │ │ │ │ - │ │ │ │ -87B11 LOCAL HEADER #77 04034B50 (67324752) │ │ │ │ -87B15 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -87B16 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -87B17 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -87B19 Compression Method 0008 (8) 'Deflated' │ │ │ │ -87B1B Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -87B1F CRC 0955C117 (156614935) │ │ │ │ -87B23 Compressed Size 00001E11 (7697) │ │ │ │ -87B27 Uncompressed Size 00008804 (34820) │ │ │ │ -87B2B Filename Length 0016 (22) │ │ │ │ -87B2D Extra Length 001C (28) │ │ │ │ -87B2F Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x87B2F: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -87B45 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -87B47 Length 0009 (9) │ │ │ │ -87B49 Flags 03 (3) 'Modification Access' │ │ │ │ -87B4A Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -87B4E Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -87B52 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -87B54 Length 000B (11) │ │ │ │ -87B56 Version 01 (1) │ │ │ │ -87B57 UID Size 04 (4) │ │ │ │ -87B58 UID 00000000 (0) │ │ │ │ -87B5C GID Size 04 (4) │ │ │ │ -87B5D GID 00000000 (0) │ │ │ │ -87B61 PAYLOAD │ │ │ │ - │ │ │ │ -89972 LOCAL HEADER #78 04034B50 (67324752) │ │ │ │ -89976 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -89977 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -89978 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -8997A Compression Method 0008 (8) 'Deflated' │ │ │ │ -8997C Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -89980 CRC 77D44A26 (2010401318) │ │ │ │ -89984 Compressed Size 000029AB (10667) │ │ │ │ -89988 Uncompressed Size 0000D050 (53328) │ │ │ │ -8998C Filename Length 001A (26) │ │ │ │ -8998E Extra Length 001C (28) │ │ │ │ -89990 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x89990: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -899AA Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -899AC Length 0009 (9) │ │ │ │ -899AE Flags 03 (3) 'Modification Access' │ │ │ │ -899AF Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -899B3 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -899B7 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -899B9 Length 000B (11) │ │ │ │ -899BB Version 01 (1) │ │ │ │ -899BC UID Size 04 (4) │ │ │ │ -899BD UID 00000000 (0) │ │ │ │ -899C1 GID Size 04 (4) │ │ │ │ -899C2 GID 00000000 (0) │ │ │ │ -899C6 PAYLOAD │ │ │ │ - │ │ │ │ -8C371 LOCAL HEADER #79 04034B50 (67324752) │ │ │ │ -8C375 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -8C376 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -8C377 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -8C379 Compression Method 0008 (8) 'Deflated' │ │ │ │ -8C37B Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -8C37F CRC 4DD2C149 (1305657673) │ │ │ │ -8C383 Compressed Size 000009AC (2476) │ │ │ │ -8C387 Uncompressed Size 00001DB7 (7607) │ │ │ │ -8C38B Filename Length 0018 (24) │ │ │ │ -8C38D Extra Length 001C (28) │ │ │ │ -8C38F Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x8C38F: Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -8C3A7 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -8C3A9 Length 0009 (9) │ │ │ │ -8C3AB Flags 03 (3) 'Modification Access' │ │ │ │ -8C3AC Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -8C3B0 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -8C3B4 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -8C3B6 Length 000B (11) │ │ │ │ -8C3B8 Version 01 (1) │ │ │ │ -8C3B9 UID Size 04 (4) │ │ │ │ -8C3BA UID 00000000 (0) │ │ │ │ -8C3BE GID Size 04 (4) │ │ │ │ -8C3BF GID 00000000 (0) │ │ │ │ -8C3C3 PAYLOAD │ │ │ │ - │ │ │ │ -8CD6F LOCAL HEADER #80 04034B50 (67324752) │ │ │ │ -8CD73 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -8CD74 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -8CD75 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -8CD77 Compression Method 0008 (8) 'Deflated' │ │ │ │ -8CD79 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -8CD7D CRC F5E2129F (4125233823) │ │ │ │ -8CD81 Compressed Size 000016BC (5820) │ │ │ │ -8CD85 Uncompressed Size 000016CD (5837) │ │ │ │ -8CD89 Filename Length 0015 (21) │ │ │ │ -8CD8B Extra Length 001C (28) │ │ │ │ -8CD8D Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x8CD8D: Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -8CDA2 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -8CDA4 Length 0009 (9) │ │ │ │ -8CDA6 Flags 03 (3) 'Modification Access' │ │ │ │ -8CDA7 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -8CDAB Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -8CDAF Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -8CDB1 Length 000B (11) │ │ │ │ -8CDB3 Version 01 (1) │ │ │ │ -8CDB4 UID Size 04 (4) │ │ │ │ -8CDB5 UID 00000000 (0) │ │ │ │ -8CDB9 GID Size 04 (4) │ │ │ │ -8CDBA GID 00000000 (0) │ │ │ │ -8CDBE PAYLOAD │ │ │ │ - │ │ │ │ -8E47A LOCAL HEADER #81 04034B50 (67324752) │ │ │ │ -8E47E Extract Zip Spec 14 (20) '2.0' │ │ │ │ -8E47F Extract OS 00 (0) 'MS-DOS' │ │ │ │ -8E480 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -8E482 Compression Method 0008 (8) 'Deflated' │ │ │ │ -8E484 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -8E488 CRC F5E2129F (4125233823) │ │ │ │ -8E48C Compressed Size 000016BC (5820) │ │ │ │ -8E490 Uncompressed Size 000016CD (5837) │ │ │ │ -8E494 Filename Length 001C (28) │ │ │ │ -8E496 Extra Length 001C (28) │ │ │ │ -8E498 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x8E498: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -8E4B4 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -8E4B6 Length 0009 (9) │ │ │ │ -8E4B8 Flags 03 (3) 'Modification Access' │ │ │ │ -8E4B9 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -8E4BD Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -8E4C1 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -8E4C3 Length 000B (11) │ │ │ │ -8E4C5 Version 01 (1) │ │ │ │ -8E4C6 UID Size 04 (4) │ │ │ │ -8E4C7 UID 00000000 (0) │ │ │ │ -8E4CB GID Size 04 (4) │ │ │ │ -8E4CC GID 00000000 (0) │ │ │ │ -8E4D0 PAYLOAD │ │ │ │ - │ │ │ │ -8FB8C LOCAL HEADER #82 04034B50 (67324752) │ │ │ │ -8FB90 Extract Zip Spec 0A (10) '1.0' │ │ │ │ -8FB91 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -8FB92 General Purpose Flag 0000 (0) │ │ │ │ -8FB94 Compression Method 0000 (0) 'Stored' │ │ │ │ -8FB96 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -8FB9A CRC FC95F24B (4237685323) │ │ │ │ -8FB9E Compressed Size 00001B84 (7044) │ │ │ │ -8FBA2 Uncompressed Size 00001B84 (7044) │ │ │ │ -8FBA6 Filename Length 0016 (22) │ │ │ │ -8FBA8 Extra Length 001C (28) │ │ │ │ -8FBAA Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x8FBAA: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -8FBC0 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -8FBC2 Length 0009 (9) │ │ │ │ -8FBC4 Flags 03 (3) 'Modification Access' │ │ │ │ -8FBC5 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -8FBC9 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -8FBCD Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -8FBCF Length 000B (11) │ │ │ │ -8FBD1 Version 01 (1) │ │ │ │ -8FBD2 UID Size 04 (4) │ │ │ │ -8FBD3 UID 00000000 (0) │ │ │ │ -8FBD7 GID Size 04 (4) │ │ │ │ -8FBD8 GID 00000000 (0) │ │ │ │ -8FBDC PAYLOAD │ │ │ │ - │ │ │ │ -91760 LOCAL HEADER #83 04034B50 (67324752) │ │ │ │ -91764 Extract Zip Spec 0A (10) '1.0' │ │ │ │ -91765 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -91766 General Purpose Flag 0000 (0) │ │ │ │ -91768 Compression Method 0000 (0) 'Stored' │ │ │ │ -9176A Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9176E CRC D0D71F86 (3503759238) │ │ │ │ -91772 Compressed Size 00000B7B (2939) │ │ │ │ -91776 Uncompressed Size 00000B7B (2939) │ │ │ │ -9177A Filename Length 0016 (22) │ │ │ │ -9177C Extra Length 001C (28) │ │ │ │ -9177E Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9177E: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -91794 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -91796 Length 0009 (9) │ │ │ │ -91798 Flags 03 (3) 'Modification Access' │ │ │ │ -91799 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9179D Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -917A1 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -917A3 Length 000B (11) │ │ │ │ -917A5 Version 01 (1) │ │ │ │ -917A6 UID Size 04 (4) │ │ │ │ -917A7 UID 00000000 (0) │ │ │ │ -917AB GID Size 04 (4) │ │ │ │ -917AC GID 00000000 (0) │ │ │ │ -917B0 PAYLOAD │ │ │ │ - │ │ │ │ -9232B LOCAL HEADER #84 04034B50 (67324752) │ │ │ │ -9232F Extract Zip Spec 0A (10) '1.0' │ │ │ │ -92330 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -92331 General Purpose Flag 0000 (0) │ │ │ │ -92333 Compression Method 0000 (0) 'Stored' │ │ │ │ -92335 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -92339 CRC FFF9C4D2 (4294558930) │ │ │ │ -9233D Compressed Size 0000138F (5007) │ │ │ │ -92341 Uncompressed Size 0000138F (5007) │ │ │ │ -92345 Filename Length 0016 (22) │ │ │ │ -92347 Extra Length 001C (28) │ │ │ │ -92349 Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x92349: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9235F Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -92361 Length 0009 (9) │ │ │ │ -92363 Flags 03 (3) 'Modification Access' │ │ │ │ -92364 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -92368 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9236C Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9236E Length 000B (11) │ │ │ │ -92370 Version 01 (1) │ │ │ │ -92371 UID Size 04 (4) │ │ │ │ -92372 UID 00000000 (0) │ │ │ │ -92376 GID Size 04 (4) │ │ │ │ -92377 GID 00000000 (0) │ │ │ │ -9237B PAYLOAD │ │ │ │ - │ │ │ │ -9370A LOCAL HEADER #85 04034B50 (67324752) │ │ │ │ -9370E Extract Zip Spec 0A (10) '1.0' │ │ │ │ -9370F Extract OS 00 (0) 'MS-DOS' │ │ │ │ -93710 General Purpose Flag 0000 (0) │ │ │ │ -93712 Compression Method 0000 (0) 'Stored' │ │ │ │ -93714 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -93718 CRC A1037E8E (2701360782) │ │ │ │ -9371C Compressed Size 0000145E (5214) │ │ │ │ -93720 Uncompressed Size 0000145E (5214) │ │ │ │ -93724 Filename Length 0016 (22) │ │ │ │ -93726 Extra Length 001C (28) │ │ │ │ -93728 Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x93728: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9373E Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -93740 Length 0009 (9) │ │ │ │ -93742 Flags 03 (3) 'Modification Access' │ │ │ │ -93743 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -93747 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9374B Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9374D Length 000B (11) │ │ │ │ -9374F Version 01 (1) │ │ │ │ -93750 UID Size 04 (4) │ │ │ │ -93751 UID 00000000 (0) │ │ │ │ -93755 GID Size 04 (4) │ │ │ │ -93756 GID 00000000 (0) │ │ │ │ -9375A PAYLOAD │ │ │ │ - │ │ │ │ -94BB8 LOCAL HEADER #86 04034B50 (67324752) │ │ │ │ -94BBC Extract Zip Spec 0A (10) '1.0' │ │ │ │ -94BBD Extract OS 00 (0) 'MS-DOS' │ │ │ │ -94BBE General Purpose Flag 0000 (0) │ │ │ │ -94BC0 Compression Method 0000 (0) 'Stored' │ │ │ │ -94BC2 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -94BC6 CRC 5E9E64F1 (1587438833) │ │ │ │ -94BCA Compressed Size 000008EC (2284) │ │ │ │ -94BCE Uncompressed Size 000008EC (2284) │ │ │ │ -94BD2 Filename Length 0016 (22) │ │ │ │ -94BD4 Extra Length 001C (28) │ │ │ │ -94BD6 Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x94BD6: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -94BEC Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -94BEE Length 0009 (9) │ │ │ │ -94BF0 Flags 03 (3) 'Modification Access' │ │ │ │ -94BF1 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -94BF5 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -94BF9 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -94BFB Length 000B (11) │ │ │ │ -94BFD Version 01 (1) │ │ │ │ -94BFE UID Size 04 (4) │ │ │ │ -94BFF UID 00000000 (0) │ │ │ │ -94C03 GID Size 04 (4) │ │ │ │ -94C04 GID 00000000 (0) │ │ │ │ -94C08 PAYLOAD │ │ │ │ - │ │ │ │ -954F4 LOCAL HEADER #87 04034B50 (67324752) │ │ │ │ -954F8 Extract Zip Spec 0A (10) '1.0' │ │ │ │ -954F9 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -954FA General Purpose Flag 0000 (0) │ │ │ │ -954FC Compression Method 0000 (0) 'Stored' │ │ │ │ -954FE Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -95502 CRC 42E340AB (1122189483) │ │ │ │ -95506 Compressed Size 00001F2E (7982) │ │ │ │ -9550A Uncompressed Size 00001F2E (7982) │ │ │ │ -9550E Filename Length 001E (30) │ │ │ │ -95510 Extra Length 001C (28) │ │ │ │ -95512 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x95512: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -95530 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -95532 Length 0009 (9) │ │ │ │ -95534 Flags 03 (3) 'Modification Access' │ │ │ │ -95535 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -95539 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9553D Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9553F Length 000B (11) │ │ │ │ -95541 Version 01 (1) │ │ │ │ -95542 UID Size 04 (4) │ │ │ │ -95543 UID 00000000 (0) │ │ │ │ -95547 GID Size 04 (4) │ │ │ │ -95548 GID 00000000 (0) │ │ │ │ -9554C PAYLOAD │ │ │ │ - │ │ │ │ -9747A LOCAL HEADER #88 04034B50 (67324752) │ │ │ │ -9747E Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9747F Extract OS 00 (0) 'MS-DOS' │ │ │ │ -97480 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -97482 Compression Method 0008 (8) 'Deflated' │ │ │ │ -97484 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -97488 CRC B21943AB (2988000171) │ │ │ │ -9748C Compressed Size 00003D6E (15726) │ │ │ │ -97490 Uncompressed Size 0001664A (91722) │ │ │ │ -97494 Filename Length 001A (26) │ │ │ │ -97496 Extra Length 001C (28) │ │ │ │ -97498 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x97498: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -974B2 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -974B4 Length 0009 (9) │ │ │ │ -974B6 Flags 03 (3) 'Modification Access' │ │ │ │ -974B7 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -974BB Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -974BF Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -974C1 Length 000B (11) │ │ │ │ -974C3 Version 01 (1) │ │ │ │ -974C4 UID Size 04 (4) │ │ │ │ -974C5 UID 00000000 (0) │ │ │ │ -974C9 GID Size 04 (4) │ │ │ │ -974CA GID 00000000 (0) │ │ │ │ -974CE PAYLOAD │ │ │ │ - │ │ │ │ -9B23C LOCAL HEADER #89 04034B50 (67324752) │ │ │ │ -9B240 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9B241 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9B242 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9B244 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9B246 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9B24A CRC 107A8FFA (276467706) │ │ │ │ -9B24E Compressed Size 000029CC (10700) │ │ │ │ -9B252 Uncompressed Size 0000BB3A (47930) │ │ │ │ -9B256 Filename Length 0018 (24) │ │ │ │ -9B258 Extra Length 001C (28) │ │ │ │ -9B25A Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9B25A: Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9B272 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9B274 Length 0009 (9) │ │ │ │ -9B276 Flags 03 (3) 'Modification Access' │ │ │ │ -9B277 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9B27B Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9B27F Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9B281 Length 000B (11) │ │ │ │ -9B283 Version 01 (1) │ │ │ │ -9B284 UID Size 04 (4) │ │ │ │ -9B285 UID 00000000 (0) │ │ │ │ -9B289 GID Size 04 (4) │ │ │ │ -9B28A GID 00000000 (0) │ │ │ │ -9B28E PAYLOAD │ │ │ │ - │ │ │ │ -9DC5A LOCAL HEADER #90 04034B50 (67324752) │ │ │ │ -9DC5E Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9DC5F Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9DC60 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9DC62 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9DC64 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9DC68 CRC DCB3B516 (3702764822) │ │ │ │ -9DC6C Compressed Size 000000AE (174) │ │ │ │ -9DC70 Uncompressed Size 000000FC (252) │ │ │ │ -9DC74 Filename Length 0016 (22) │ │ │ │ -9DC76 Extra Length 001C (28) │ │ │ │ -9DC78 Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9DC78: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9DC8E Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9DC90 Length 0009 (9) │ │ │ │ -9DC92 Flags 03 (3) 'Modification Access' │ │ │ │ -9DC93 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9DC97 Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9DC9B Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9DC9D Length 000B (11) │ │ │ │ -9DC9F Version 01 (1) │ │ │ │ -9DCA0 UID Size 04 (4) │ │ │ │ -9DCA1 UID 00000000 (0) │ │ │ │ -9DCA5 GID Size 04 (4) │ │ │ │ -9DCA6 GID 00000000 (0) │ │ │ │ -9DCAA PAYLOAD XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX │ │ │ │ +04B61 LOCAL HEADER #5 04034B50 (67324752) │ │ │ │ +04B65 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +04B66 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +04B67 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +04B69 Compression Method 0008 (8) 'Deflated' │ │ │ │ +04B6B Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +04B6F CRC 701446B8 (1880377016) │ │ │ │ +04B73 Compressed Size 000003F1 (1009) │ │ │ │ +04B77 Uncompressed Size 00000877 (2167) │ │ │ │ +04B7B Filename Length 0014 (20) │ │ │ │ +04B7D Extra Length 001C (28) │ │ │ │ +04B7F Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x4B7F: Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +04B93 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +04B95 Length 0009 (9) │ │ │ │ +04B97 Flags 03 (3) 'Modification Access' │ │ │ │ +04B98 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +04B9C Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +04BA0 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +04BA2 Length 000B (11) │ │ │ │ +04BA4 Version 01 (1) │ │ │ │ +04BA5 UID Size 04 (4) │ │ │ │ +04BA6 UID 00000000 (0) │ │ │ │ +04BAA GID Size 04 (4) │ │ │ │ +04BAB GID 00000000 (0) │ │ │ │ +04BAF PAYLOAD │ │ │ │ + │ │ │ │ +04FA0 LOCAL HEADER #6 04034B50 (67324752) │ │ │ │ +04FA4 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +04FA5 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +04FA6 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +04FA8 Compression Method 0008 (8) 'Deflated' │ │ │ │ +04FAA Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +04FAE CRC 8666CBE3 (2254883811) │ │ │ │ +04FB2 Compressed Size 000001AF (431) │ │ │ │ +04FB6 Uncompressed Size 000002FE (766) │ │ │ │ +04FBA Filename Length 0011 (17) │ │ │ │ +04FBC Extra Length 001C (28) │ │ │ │ +04FBE Filename 'XXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x4FBE: Filename 'XXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +04FCF Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +04FD1 Length 0009 (9) │ │ │ │ +04FD3 Flags 03 (3) 'Modification Access' │ │ │ │ +04FD4 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +04FD8 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +04FDC Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +04FDE Length 000B (11) │ │ │ │ +04FE0 Version 01 (1) │ │ │ │ +04FE1 UID Size 04 (4) │ │ │ │ +04FE2 UID 00000000 (0) │ │ │ │ +04FE6 GID Size 04 (4) │ │ │ │ +04FE7 GID 00000000 (0) │ │ │ │ +04FEB PAYLOAD │ │ │ │ + │ │ │ │ +0519A LOCAL HEADER #7 04034B50 (67324752) │ │ │ │ +0519E Extract Zip Spec 14 (20) '2.0' │ │ │ │ +0519F Extract OS 00 (0) 'MS-DOS' │ │ │ │ +051A0 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +051A2 Compression Method 0008 (8) 'Deflated' │ │ │ │ +051A4 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +051A8 CRC AD1718B2 (2903972018) │ │ │ │ +051AC Compressed Size 000020C8 (8392) │ │ │ │ +051B0 Uncompressed Size 0000B4B1 (46257) │ │ │ │ +051B4 Filename Length 001B (27) │ │ │ │ +051B6 Extra Length 001C (28) │ │ │ │ +051B8 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x51B8: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +051D3 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +051D5 Length 0009 (9) │ │ │ │ +051D7 Flags 03 (3) 'Modification Access' │ │ │ │ +051D8 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +051DC Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +051E0 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +051E2 Length 000B (11) │ │ │ │ +051E4 Version 01 (1) │ │ │ │ +051E5 UID Size 04 (4) │ │ │ │ +051E6 UID 00000000 (0) │ │ │ │ +051EA GID Size 04 (4) │ │ │ │ +051EB GID 00000000 (0) │ │ │ │ +051EF PAYLOAD │ │ │ │ + │ │ │ │ +072B7 LOCAL HEADER #8 04034B50 (67324752) │ │ │ │ +072BB Extract Zip Spec 14 (20) '2.0' │ │ │ │ +072BC Extract OS 00 (0) 'MS-DOS' │ │ │ │ +072BD General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +072BF Compression Method 0008 (8) 'Deflated' │ │ │ │ +072C1 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +072C5 CRC 6A77DB59 (1786239833) │ │ │ │ +072C9 Compressed Size 00000E70 (3696) │ │ │ │ +072CD Uncompressed Size 000030B3 (12467) │ │ │ │ +072D1 Filename Length 001D (29) │ │ │ │ +072D3 Extra Length 001C (28) │ │ │ │ +072D5 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x72D5: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +072F2 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +072F4 Length 0009 (9) │ │ │ │ +072F6 Flags 03 (3) 'Modification Access' │ │ │ │ +072F7 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +072FB Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +072FF Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +07301 Length 000B (11) │ │ │ │ +07303 Version 01 (1) │ │ │ │ +07304 UID Size 04 (4) │ │ │ │ +07305 UID 00000000 (0) │ │ │ │ +07309 GID Size 04 (4) │ │ │ │ +0730A GID 00000000 (0) │ │ │ │ +0730E PAYLOAD │ │ │ │ + │ │ │ │ +0817E LOCAL HEADER #9 04034B50 (67324752) │ │ │ │ +08182 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +08183 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +08184 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +08186 Compression Method 0008 (8) 'Deflated' │ │ │ │ +08188 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +0818C CRC FEBE631B (4273890075) │ │ │ │ +08190 Compressed Size 00000973 (2419) │ │ │ │ +08194 Uncompressed Size 00001CB3 (7347) │ │ │ │ +08198 Filename Length 0019 (25) │ │ │ │ +0819A Extra Length 001C (28) │ │ │ │ +0819C Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x819C: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +081B5 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +081B7 Length 0009 (9) │ │ │ │ +081B9 Flags 03 (3) 'Modification Access' │ │ │ │ +081BA Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +081BE Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +081C2 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +081C4 Length 000B (11) │ │ │ │ +081C6 Version 01 (1) │ │ │ │ +081C7 UID Size 04 (4) │ │ │ │ +081C8 UID 00000000 (0) │ │ │ │ +081CC GID Size 04 (4) │ │ │ │ +081CD GID 00000000 (0) │ │ │ │ +081D1 PAYLOAD │ │ │ │ + │ │ │ │ +08B44 LOCAL HEADER #10 04034B50 (67324752) │ │ │ │ +08B48 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +08B49 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +08B4A General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +08B4C Compression Method 0008 (8) 'Deflated' │ │ │ │ +08B4E Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +08B52 CRC 31D57F6C (836075372) │ │ │ │ +08B56 Compressed Size 0000387A (14458) │ │ │ │ +08B5A Uncompressed Size 0000F7F5 (63477) │ │ │ │ +08B5E Filename Length 0015 (21) │ │ │ │ +08B60 Extra Length 001C (28) │ │ │ │ +08B62 Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x8B62: Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +08B77 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +08B79 Length 0009 (9) │ │ │ │ +08B7B Flags 03 (3) 'Modification Access' │ │ │ │ +08B7C Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +08B80 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +08B84 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +08B86 Length 000B (11) │ │ │ │ +08B88 Version 01 (1) │ │ │ │ +08B89 UID Size 04 (4) │ │ │ │ +08B8A UID 00000000 (0) │ │ │ │ +08B8E GID Size 04 (4) │ │ │ │ +08B8F GID 00000000 (0) │ │ │ │ +08B93 PAYLOAD │ │ │ │ + │ │ │ │ +0C40D LOCAL HEADER #11 04034B50 (67324752) │ │ │ │ +0C411 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +0C412 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +0C413 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +0C415 Compression Method 0008 (8) 'Deflated' │ │ │ │ +0C417 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +0C41B CRC BD5B2005 (3176865797) │ │ │ │ +0C41F Compressed Size 0000AB03 (43779) │ │ │ │ +0C423 Uncompressed Size 0003E052 (254034) │ │ │ │ +0C427 Filename Length 0012 (18) │ │ │ │ +0C429 Extra Length 001C (28) │ │ │ │ +0C42B Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0xC42B: Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +0C43D Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +0C43F Length 0009 (9) │ │ │ │ +0C441 Flags 03 (3) 'Modification Access' │ │ │ │ +0C442 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +0C446 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +0C44A Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +0C44C Length 000B (11) │ │ │ │ +0C44E Version 01 (1) │ │ │ │ +0C44F UID Size 04 (4) │ │ │ │ +0C450 UID 00000000 (0) │ │ │ │ +0C454 GID Size 04 (4) │ │ │ │ +0C455 GID 00000000 (0) │ │ │ │ +0C459 PAYLOAD │ │ │ │ + │ │ │ │ +16F5C LOCAL HEADER #12 04034B50 (67324752) │ │ │ │ +16F60 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +16F61 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +16F62 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +16F64 Compression Method 0008 (8) 'Deflated' │ │ │ │ +16F66 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +16F6A CRC 0DF5E9A6 (234219942) │ │ │ │ +16F6E Compressed Size 00003B10 (15120) │ │ │ │ +16F72 Uncompressed Size 0001B46D (111725) │ │ │ │ +16F76 Filename Length 0015 (21) │ │ │ │ +16F78 Extra Length 001C (28) │ │ │ │ +16F7A Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x16F7A: Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +16F8F Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +16F91 Length 0009 (9) │ │ │ │ +16F93 Flags 03 (3) 'Modification Access' │ │ │ │ +16F94 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +16F98 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +16F9C Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +16F9E Length 000B (11) │ │ │ │ +16FA0 Version 01 (1) │ │ │ │ +16FA1 UID Size 04 (4) │ │ │ │ +16FA2 UID 00000000 (0) │ │ │ │ +16FA6 GID Size 04 (4) │ │ │ │ +16FA7 GID 00000000 (0) │ │ │ │ +16FAB PAYLOAD │ │ │ │ + │ │ │ │ +1AABB LOCAL HEADER #13 04034B50 (67324752) │ │ │ │ +1AABF Extract Zip Spec 14 (20) '2.0' │ │ │ │ +1AAC0 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +1AAC1 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +1AAC3 Compression Method 0008 (8) 'Deflated' │ │ │ │ +1AAC5 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +1AAC9 CRC 2ECD4327 (785204007) │ │ │ │ +1AACD Compressed Size 00009197 (37271) │ │ │ │ +1AAD1 Uncompressed Size 0003D596 (251286) │ │ │ │ +1AAD5 Filename Length 0014 (20) │ │ │ │ +1AAD7 Extra Length 001C (28) │ │ │ │ +1AAD9 Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x1AAD9: Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +1AAED Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +1AAEF Length 0009 (9) │ │ │ │ +1AAF1 Flags 03 (3) 'Modification Access' │ │ │ │ +1AAF2 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +1AAF6 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +1AAFA Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +1AAFC Length 000B (11) │ │ │ │ +1AAFE Version 01 (1) │ │ │ │ +1AAFF UID Size 04 (4) │ │ │ │ +1AB00 UID 00000000 (0) │ │ │ │ +1AB04 GID Size 04 (4) │ │ │ │ +1AB05 GID 00000000 (0) │ │ │ │ +1AB09 PAYLOAD │ │ │ │ + │ │ │ │ +23CA0 LOCAL HEADER #14 04034B50 (67324752) │ │ │ │ +23CA4 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +23CA5 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +23CA6 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +23CA8 Compression Method 0008 (8) 'Deflated' │ │ │ │ +23CAA Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +23CAE CRC DABB38CE (3669702862) │ │ │ │ +23CB2 Compressed Size 00002A66 (10854) │ │ │ │ +23CB6 Uncompressed Size 00011520 (70944) │ │ │ │ +23CBA Filename Length 0016 (22) │ │ │ │ +23CBC Extra Length 001C (28) │ │ │ │ +23CBE Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x23CBE: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +23CD4 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +23CD6 Length 0009 (9) │ │ │ │ +23CD8 Flags 03 (3) 'Modification Access' │ │ │ │ +23CD9 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +23CDD Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +23CE1 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +23CE3 Length 000B (11) │ │ │ │ +23CE5 Version 01 (1) │ │ │ │ +23CE6 UID Size 04 (4) │ │ │ │ +23CE7 UID 00000000 (0) │ │ │ │ +23CEB GID Size 04 (4) │ │ │ │ +23CEC GID 00000000 (0) │ │ │ │ +23CF0 PAYLOAD │ │ │ │ + │ │ │ │ +26756 LOCAL HEADER #15 04034B50 (67324752) │ │ │ │ +2675A Extract Zip Spec 14 (20) '2.0' │ │ │ │ +2675B Extract OS 00 (0) 'MS-DOS' │ │ │ │ +2675C General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +2675E Compression Method 0008 (8) 'Deflated' │ │ │ │ +26760 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +26764 CRC 65AA9970 (1705679216) │ │ │ │ +26768 Compressed Size 000014D9 (5337) │ │ │ │ +2676C Uncompressed Size 0000518E (20878) │ │ │ │ +26770 Filename Length 001D (29) │ │ │ │ +26772 Extra Length 001C (28) │ │ │ │ +26774 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x26774: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +26791 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +26793 Length 0009 (9) │ │ │ │ +26795 Flags 03 (3) 'Modification Access' │ │ │ │ +26796 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +2679A Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +2679E Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +267A0 Length 000B (11) │ │ │ │ +267A2 Version 01 (1) │ │ │ │ +267A3 UID Size 04 (4) │ │ │ │ +267A4 UID 00000000 (0) │ │ │ │ +267A8 GID Size 04 (4) │ │ │ │ +267A9 GID 00000000 (0) │ │ │ │ +267AD PAYLOAD │ │ │ │ + │ │ │ │ +27C86 LOCAL HEADER #16 04034B50 (67324752) │ │ │ │ +27C8A Extract Zip Spec 14 (20) '2.0' │ │ │ │ +27C8B Extract OS 00 (0) 'MS-DOS' │ │ │ │ +27C8C General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +27C8E Compression Method 0008 (8) 'Deflated' │ │ │ │ +27C90 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +27C94 CRC 6BAC06B0 (1806436016) │ │ │ │ +27C98 Compressed Size 0000380A (14346) │ │ │ │ +27C9C Uncompressed Size 0000EA4D (59981) │ │ │ │ +27CA0 Filename Length 001C (28) │ │ │ │ +27CA2 Extra Length 001C (28) │ │ │ │ +27CA4 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x27CA4: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +27CC0 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +27CC2 Length 0009 (9) │ │ │ │ +27CC4 Flags 03 (3) 'Modification Access' │ │ │ │ +27CC5 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +27CC9 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +27CCD Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +27CCF Length 000B (11) │ │ │ │ +27CD1 Version 01 (1) │ │ │ │ +27CD2 UID Size 04 (4) │ │ │ │ +27CD3 UID 00000000 (0) │ │ │ │ +27CD7 GID Size 04 (4) │ │ │ │ +27CD8 GID 00000000 (0) │ │ │ │ +27CDC PAYLOAD │ │ │ │ + │ │ │ │ +2B4E6 LOCAL HEADER #17 04034B50 (67324752) │ │ │ │ +2B4EA Extract Zip Spec 14 (20) '2.0' │ │ │ │ +2B4EB Extract OS 00 (0) 'MS-DOS' │ │ │ │ +2B4EC General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +2B4EE Compression Method 0008 (8) 'Deflated' │ │ │ │ +2B4F0 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +2B4F4 CRC BF5A452D (3210364205) │ │ │ │ +2B4F8 Compressed Size 000006A2 (1698) │ │ │ │ +2B4FC Uncompressed Size 000011F5 (4597) │ │ │ │ +2B500 Filename Length 001C (28) │ │ │ │ +2B502 Extra Length 001C (28) │ │ │ │ +2B504 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x2B504: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +2B520 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +2B522 Length 0009 (9) │ │ │ │ +2B524 Flags 03 (3) 'Modification Access' │ │ │ │ +2B525 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +2B529 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +2B52D Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +2B52F Length 000B (11) │ │ │ │ +2B531 Version 01 (1) │ │ │ │ +2B532 UID Size 04 (4) │ │ │ │ +2B533 UID 00000000 (0) │ │ │ │ +2B537 GID Size 04 (4) │ │ │ │ +2B538 GID 00000000 (0) │ │ │ │ +2B53C PAYLOAD │ │ │ │ + │ │ │ │ +2BBDE LOCAL HEADER #18 04034B50 (67324752) │ │ │ │ +2BBE2 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +2BBE3 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +2BBE4 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +2BBE6 Compression Method 0008 (8) 'Deflated' │ │ │ │ +2BBE8 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +2BBEC CRC 1589B2CE (361345742) │ │ │ │ +2BBF0 Compressed Size 00001082 (4226) │ │ │ │ +2BBF4 Uncompressed Size 00004C00 (19456) │ │ │ │ +2BBF8 Filename Length 001B (27) │ │ │ │ +2BBFA Extra Length 001C (28) │ │ │ │ +2BBFC Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x2BBFC: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +2BC17 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +2BC19 Length 0009 (9) │ │ │ │ +2BC1B Flags 03 (3) 'Modification Access' │ │ │ │ +2BC1C Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +2BC20 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +2BC24 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +2BC26 Length 000B (11) │ │ │ │ +2BC28 Version 01 (1) │ │ │ │ +2BC29 UID Size 04 (4) │ │ │ │ +2BC2A UID 00000000 (0) │ │ │ │ +2BC2E GID Size 04 (4) │ │ │ │ +2BC2F GID 00000000 (0) │ │ │ │ +2BC33 PAYLOAD │ │ │ │ + │ │ │ │ +2CCB5 LOCAL HEADER #19 04034B50 (67324752) │ │ │ │ +2CCB9 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +2CCBA Extract OS 00 (0) 'MS-DOS' │ │ │ │ +2CCBB General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +2CCBD Compression Method 0008 (8) 'Deflated' │ │ │ │ +2CCBF Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +2CCC3 CRC 032E5955 (53369173) │ │ │ │ +2CCC7 Compressed Size 000033AC (13228) │ │ │ │ +2CCCB Uncompressed Size 0000BC95 (48277) │ │ │ │ +2CCCF Filename Length 001D (29) │ │ │ │ +2CCD1 Extra Length 001C (28) │ │ │ │ +2CCD3 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x2CCD3: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +2CCF0 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +2CCF2 Length 0009 (9) │ │ │ │ +2CCF4 Flags 03 (3) 'Modification Access' │ │ │ │ +2CCF5 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +2CCF9 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +2CCFD Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +2CCFF Length 000B (11) │ │ │ │ +2CD01 Version 01 (1) │ │ │ │ +2CD02 UID Size 04 (4) │ │ │ │ +2CD03 UID 00000000 (0) │ │ │ │ +2CD07 GID Size 04 (4) │ │ │ │ +2CD08 GID 00000000 (0) │ │ │ │ +2CD0C PAYLOAD │ │ │ │ + │ │ │ │ +300B8 LOCAL HEADER #20 04034B50 (67324752) │ │ │ │ +300BC Extract Zip Spec 14 (20) '2.0' │ │ │ │ +300BD Extract OS 00 (0) 'MS-DOS' │ │ │ │ +300BE General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +300C0 Compression Method 0008 (8) 'Deflated' │ │ │ │ +300C2 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +300C6 CRC 0DB6D018 (230084632) │ │ │ │ +300CA Compressed Size 00000D6A (3434) │ │ │ │ +300CE Uncompressed Size 0000388E (14478) │ │ │ │ +300D2 Filename Length 001D (29) │ │ │ │ +300D4 Extra Length 001C (28) │ │ │ │ +300D6 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x300D6: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +300F3 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +300F5 Length 0009 (9) │ │ │ │ +300F7 Flags 03 (3) 'Modification Access' │ │ │ │ +300F8 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +300FC Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +30100 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +30102 Length 000B (11) │ │ │ │ +30104 Version 01 (1) │ │ │ │ +30105 UID Size 04 (4) │ │ │ │ +30106 UID 00000000 (0) │ │ │ │ +3010A GID Size 04 (4) │ │ │ │ +3010B GID 00000000 (0) │ │ │ │ +3010F PAYLOAD │ │ │ │ + │ │ │ │ +30E79 LOCAL HEADER #21 04034B50 (67324752) │ │ │ │ +30E7D Extract Zip Spec 14 (20) '2.0' │ │ │ │ +30E7E Extract OS 00 (0) 'MS-DOS' │ │ │ │ +30E7F General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +30E81 Compression Method 0008 (8) 'Deflated' │ │ │ │ +30E83 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +30E87 CRC 14EDEBB8 (351136696) │ │ │ │ +30E8B Compressed Size 00001C6A (7274) │ │ │ │ +30E8F Uncompressed Size 0000C187 (49543) │ │ │ │ +30E93 Filename Length 001A (26) │ │ │ │ +30E95 Extra Length 001C (28) │ │ │ │ +30E97 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x30E97: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +30EB1 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +30EB3 Length 0009 (9) │ │ │ │ +30EB5 Flags 03 (3) 'Modification Access' │ │ │ │ +30EB6 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +30EBA Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +30EBE Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +30EC0 Length 000B (11) │ │ │ │ +30EC2 Version 01 (1) │ │ │ │ +30EC3 UID Size 04 (4) │ │ │ │ +30EC4 UID 00000000 (0) │ │ │ │ +30EC8 GID Size 04 (4) │ │ │ │ +30EC9 GID 00000000 (0) │ │ │ │ +30ECD PAYLOAD │ │ │ │ + │ │ │ │ +32B37 LOCAL HEADER #22 04034B50 (67324752) │ │ │ │ +32B3B Extract Zip Spec 14 (20) '2.0' │ │ │ │ +32B3C Extract OS 00 (0) 'MS-DOS' │ │ │ │ +32B3D General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +32B3F Compression Method 0008 (8) 'Deflated' │ │ │ │ +32B41 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +32B45 CRC FFC68C4A (4291202122) │ │ │ │ +32B49 Compressed Size 000003A4 (932) │ │ │ │ +32B4D Uncompressed Size 0000088F (2191) │ │ │ │ +32B51 Filename Length 0012 (18) │ │ │ │ +32B53 Extra Length 001C (28) │ │ │ │ +32B55 Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x32B55: Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +32B67 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +32B69 Length 0009 (9) │ │ │ │ +32B6B Flags 03 (3) 'Modification Access' │ │ │ │ +32B6C Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +32B70 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +32B74 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +32B76 Length 000B (11) │ │ │ │ +32B78 Version 01 (1) │ │ │ │ +32B79 UID Size 04 (4) │ │ │ │ +32B7A UID 00000000 (0) │ │ │ │ +32B7E GID Size 04 (4) │ │ │ │ +32B7F GID 00000000 (0) │ │ │ │ +32B83 PAYLOAD │ │ │ │ + │ │ │ │ +32F27 LOCAL HEADER #23 04034B50 (67324752) │ │ │ │ +32F2B Extract Zip Spec 14 (20) '2.0' │ │ │ │ +32F2C Extract OS 00 (0) 'MS-DOS' │ │ │ │ +32F2D General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +32F2F Compression Method 0008 (8) 'Deflated' │ │ │ │ +32F31 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +32F35 CRC 75B01EAE (1974476462) │ │ │ │ +32F39 Compressed Size 000001D4 (468) │ │ │ │ +32F3D Uncompressed Size 00000312 (786) │ │ │ │ +32F41 Filename Length 0020 (32) │ │ │ │ +32F43 Extra Length 001C (28) │ │ │ │ +32F45 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x32F45: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +32F65 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +32F67 Length 0009 (9) │ │ │ │ +32F69 Flags 03 (3) 'Modification Access' │ │ │ │ +32F6A Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +32F6E Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +32F72 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +32F74 Length 000B (11) │ │ │ │ +32F76 Version 01 (1) │ │ │ │ +32F77 UID Size 04 (4) │ │ │ │ +32F78 UID 00000000 (0) │ │ │ │ +32F7C GID Size 04 (4) │ │ │ │ +32F7D GID 00000000 (0) │ │ │ │ +32F81 PAYLOAD │ │ │ │ + │ │ │ │ +33155 LOCAL HEADER #24 04034B50 (67324752) │ │ │ │ +33159 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +3315A Extract OS 00 (0) 'MS-DOS' │ │ │ │ +3315B General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +3315D Compression Method 0008 (8) 'Deflated' │ │ │ │ +3315F Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +33163 CRC F1F15481 (4059124865) │ │ │ │ +33167 Compressed Size 000017AC (6060) │ │ │ │ +3316B Uncompressed Size 00009D19 (40217) │ │ │ │ +3316F Filename Length 001B (27) │ │ │ │ +33171 Extra Length 001C (28) │ │ │ │ +33173 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x33173: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +3318E Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +33190 Length 0009 (9) │ │ │ │ +33192 Flags 03 (3) 'Modification Access' │ │ │ │ +33193 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +33197 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +3319B Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +3319D Length 000B (11) │ │ │ │ +3319F Version 01 (1) │ │ │ │ +331A0 UID Size 04 (4) │ │ │ │ +331A1 UID 00000000 (0) │ │ │ │ +331A5 GID Size 04 (4) │ │ │ │ +331A6 GID 00000000 (0) │ │ │ │ +331AA PAYLOAD │ │ │ │ + │ │ │ │ +34956 LOCAL HEADER #25 04034B50 (67324752) │ │ │ │ +3495A Extract Zip Spec 14 (20) '2.0' │ │ │ │ +3495B Extract OS 00 (0) 'MS-DOS' │ │ │ │ +3495C General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +3495E Compression Method 0008 (8) 'Deflated' │ │ │ │ +34960 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +34964 CRC AA7532E3 (2859807459) │ │ │ │ +34968 Compressed Size 00001373 (4979) │ │ │ │ +3496C Uncompressed Size 00003B67 (15207) │ │ │ │ +34970 Filename Length 0015 (21) │ │ │ │ +34972 Extra Length 001C (28) │ │ │ │ +34974 Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x34974: Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +34989 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +3498B Length 0009 (9) │ │ │ │ +3498D Flags 03 (3) 'Modification Access' │ │ │ │ +3498E Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +34992 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +34996 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +34998 Length 000B (11) │ │ │ │ +3499A Version 01 (1) │ │ │ │ +3499B UID Size 04 (4) │ │ │ │ +3499C UID 00000000 (0) │ │ │ │ +349A0 GID Size 04 (4) │ │ │ │ +349A1 GID 00000000 (0) │ │ │ │ +349A5 PAYLOAD │ │ │ │ + │ │ │ │ +35D18 LOCAL HEADER #26 04034B50 (67324752) │ │ │ │ +35D1C Extract Zip Spec 14 (20) '2.0' │ │ │ │ +35D1D Extract OS 00 (0) 'MS-DOS' │ │ │ │ +35D1E General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +35D20 Compression Method 0008 (8) 'Deflated' │ │ │ │ +35D22 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +35D26 CRC 3F4BD8A9 (1061935273) │ │ │ │ +35D2A Compressed Size 00000AD3 (2771) │ │ │ │ +35D2E Uncompressed Size 00002136 (8502) │ │ │ │ +35D32 Filename Length 0011 (17) │ │ │ │ +35D34 Extra Length 001C (28) │ │ │ │ +35D36 Filename 'XXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x35D36: Filename 'XXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +35D47 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +35D49 Length 0009 (9) │ │ │ │ +35D4B Flags 03 (3) 'Modification Access' │ │ │ │ +35D4C Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +35D50 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +35D54 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +35D56 Length 000B (11) │ │ │ │ +35D58 Version 01 (1) │ │ │ │ +35D59 UID Size 04 (4) │ │ │ │ +35D5A UID 00000000 (0) │ │ │ │ +35D5E GID Size 04 (4) │ │ │ │ +35D5F GID 00000000 (0) │ │ │ │ +35D63 PAYLOAD │ │ │ │ + │ │ │ │ +36836 LOCAL HEADER #27 04034B50 (67324752) │ │ │ │ +3683A Extract Zip Spec 14 (20) '2.0' │ │ │ │ +3683B Extract OS 00 (0) 'MS-DOS' │ │ │ │ +3683C General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +3683E Compression Method 0008 (8) 'Deflated' │ │ │ │ +36840 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +36844 CRC 8660AD3A (2254482746) │ │ │ │ +36848 Compressed Size 000003FF (1023) │ │ │ │ +3684C Uncompressed Size 00000F0D (3853) │ │ │ │ +36850 Filename Length 0014 (20) │ │ │ │ +36852 Extra Length 001C (28) │ │ │ │ +36854 Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x36854: Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +36868 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +3686A Length 0009 (9) │ │ │ │ +3686C Flags 03 (3) 'Modification Access' │ │ │ │ +3686D Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +36871 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +36875 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +36877 Length 000B (11) │ │ │ │ +36879 Version 01 (1) │ │ │ │ +3687A UID Size 04 (4) │ │ │ │ +3687B UID 00000000 (0) │ │ │ │ +3687F GID Size 04 (4) │ │ │ │ +36880 GID 00000000 (0) │ │ │ │ +36884 PAYLOAD │ │ │ │ + │ │ │ │ +36C83 LOCAL HEADER #28 04034B50 (67324752) │ │ │ │ +36C87 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +36C88 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +36C89 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +36C8B Compression Method 0008 (8) 'Deflated' │ │ │ │ +36C8D Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +36C91 CRC 2177E3D4 (561505236) │ │ │ │ +36C95 Compressed Size 00001263 (4707) │ │ │ │ +36C99 Uncompressed Size 0000346A (13418) │ │ │ │ +36C9D Filename Length 0014 (20) │ │ │ │ +36C9F Extra Length 001C (28) │ │ │ │ +36CA1 Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x36CA1: Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +36CB5 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +36CB7 Length 0009 (9) │ │ │ │ +36CB9 Flags 03 (3) 'Modification Access' │ │ │ │ +36CBA Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +36CBE Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +36CC2 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +36CC4 Length 000B (11) │ │ │ │ +36CC6 Version 01 (1) │ │ │ │ +36CC7 UID Size 04 (4) │ │ │ │ +36CC8 UID 00000000 (0) │ │ │ │ +36CCC GID Size 04 (4) │ │ │ │ +36CCD GID 00000000 (0) │ │ │ │ +36CD1 PAYLOAD │ │ │ │ + │ │ │ │ +37F34 LOCAL HEADER #29 04034B50 (67324752) │ │ │ │ +37F38 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +37F39 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +37F3A General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +37F3C Compression Method 0008 (8) 'Deflated' │ │ │ │ +37F3E Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +37F42 CRC 5CDB7A87 (1557887623) │ │ │ │ +37F46 Compressed Size 00000AD0 (2768) │ │ │ │ +37F4A Uncompressed Size 00002300 (8960) │ │ │ │ +37F4E Filename Length 001B (27) │ │ │ │ +37F50 Extra Length 001C (28) │ │ │ │ +37F52 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x37F52: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +37F6D Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +37F6F Length 0009 (9) │ │ │ │ +37F71 Flags 03 (3) 'Modification Access' │ │ │ │ +37F72 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +37F76 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +37F7A Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +37F7C Length 000B (11) │ │ │ │ +37F7E Version 01 (1) │ │ │ │ +37F7F UID Size 04 (4) │ │ │ │ +37F80 UID 00000000 (0) │ │ │ │ +37F84 GID Size 04 (4) │ │ │ │ +37F85 GID 00000000 (0) │ │ │ │ +37F89 PAYLOAD │ │ │ │ + │ │ │ │ +38A59 LOCAL HEADER #30 04034B50 (67324752) │ │ │ │ +38A5D Extract Zip Spec 14 (20) '2.0' │ │ │ │ +38A5E Extract OS 00 (0) 'MS-DOS' │ │ │ │ +38A5F General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +38A61 Compression Method 0008 (8) 'Deflated' │ │ │ │ +38A63 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +38A67 CRC EA06709E (3926290590) │ │ │ │ +38A6B Compressed Size 00000A8E (2702) │ │ │ │ +38A6F Uncompressed Size 0000237B (9083) │ │ │ │ +38A73 Filename Length 0013 (19) │ │ │ │ +38A75 Extra Length 001C (28) │ │ │ │ +38A77 Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x38A77: Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +38A8A Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +38A8C Length 0009 (9) │ │ │ │ +38A8E Flags 03 (3) 'Modification Access' │ │ │ │ +38A8F Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +38A93 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +38A97 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +38A99 Length 000B (11) │ │ │ │ +38A9B Version 01 (1) │ │ │ │ +38A9C UID Size 04 (4) │ │ │ │ +38A9D UID 00000000 (0) │ │ │ │ +38AA1 GID Size 04 (4) │ │ │ │ +38AA2 GID 00000000 (0) │ │ │ │ +38AA6 PAYLOAD │ │ │ │ + │ │ │ │ +39534 LOCAL HEADER #31 04034B50 (67324752) │ │ │ │ +39538 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +39539 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +3953A General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +3953C Compression Method 0008 (8) 'Deflated' │ │ │ │ +3953E Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +39542 CRC 2A8D94A8 (713921704) │ │ │ │ +39546 Compressed Size 00000F4B (3915) │ │ │ │ +3954A Uncompressed Size 00003737 (14135) │ │ │ │ +3954E Filename Length 000F (15) │ │ │ │ +39550 Extra Length 001C (28) │ │ │ │ +39552 Filename 'XXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x39552: Filename 'XXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +39561 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +39563 Length 0009 (9) │ │ │ │ +39565 Flags 03 (3) 'Modification Access' │ │ │ │ +39566 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +3956A Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +3956E Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +39570 Length 000B (11) │ │ │ │ +39572 Version 01 (1) │ │ │ │ +39573 UID Size 04 (4) │ │ │ │ +39574 UID 00000000 (0) │ │ │ │ +39578 GID Size 04 (4) │ │ │ │ +39579 GID 00000000 (0) │ │ │ │ +3957D PAYLOAD │ │ │ │ + │ │ │ │ +3A4C8 LOCAL HEADER #32 04034B50 (67324752) │ │ │ │ +3A4CC Extract Zip Spec 14 (20) '2.0' │ │ │ │ +3A4CD Extract OS 00 (0) 'MS-DOS' │ │ │ │ +3A4CE General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +3A4D0 Compression Method 0008 (8) 'Deflated' │ │ │ │ +3A4D2 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +3A4D6 CRC 3759BA2B (928627243) │ │ │ │ +3A4DA Compressed Size 0000066B (1643) │ │ │ │ +3A4DE Uncompressed Size 000018E0 (6368) │ │ │ │ +3A4E2 Filename Length 000F (15) │ │ │ │ +3A4E4 Extra Length 001C (28) │ │ │ │ +3A4E6 Filename 'XXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x3A4E6: Filename 'XXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +3A4F5 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +3A4F7 Length 0009 (9) │ │ │ │ +3A4F9 Flags 03 (3) 'Modification Access' │ │ │ │ +3A4FA Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +3A4FE Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +3A502 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +3A504 Length 000B (11) │ │ │ │ +3A506 Version 01 (1) │ │ │ │ +3A507 UID Size 04 (4) │ │ │ │ +3A508 UID 00000000 (0) │ │ │ │ +3A50C GID Size 04 (4) │ │ │ │ +3A50D GID 00000000 (0) │ │ │ │ +3A511 PAYLOAD │ │ │ │ + │ │ │ │ +3AB7C LOCAL HEADER #33 04034B50 (67324752) │ │ │ │ +3AB80 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +3AB81 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +3AB82 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +3AB84 Compression Method 0008 (8) 'Deflated' │ │ │ │ +3AB86 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +3AB8A CRC 282DD890 (674093200) │ │ │ │ +3AB8E Compressed Size 00001A46 (6726) │ │ │ │ +3AB92 Uncompressed Size 000064F3 (25843) │ │ │ │ +3AB96 Filename Length 0013 (19) │ │ │ │ +3AB98 Extra Length 001C (28) │ │ │ │ +3AB9A Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x3AB9A: Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +3ABAD Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +3ABAF Length 0009 (9) │ │ │ │ +3ABB1 Flags 03 (3) 'Modification Access' │ │ │ │ +3ABB2 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +3ABB6 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +3ABBA Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +3ABBC Length 000B (11) │ │ │ │ +3ABBE Version 01 (1) │ │ │ │ +3ABBF UID Size 04 (4) │ │ │ │ +3ABC0 UID 00000000 (0) │ │ │ │ +3ABC4 GID Size 04 (4) │ │ │ │ +3ABC5 GID 00000000 (0) │ │ │ │ +3ABC9 PAYLOAD │ │ │ │ + │ │ │ │ +3C60F LOCAL HEADER #34 04034B50 (67324752) │ │ │ │ +3C613 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +3C614 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +3C615 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +3C617 Compression Method 0008 (8) 'Deflated' │ │ │ │ +3C619 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +3C61D CRC 57156588 (1461020040) │ │ │ │ +3C621 Compressed Size 000009A7 (2471) │ │ │ │ +3C625 Uncompressed Size 00001B65 (7013) │ │ │ │ +3C629 Filename Length 0010 (16) │ │ │ │ +3C62B Extra Length 001C (28) │ │ │ │ +3C62D Filename 'XXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x3C62D: Filename 'XXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +3C63D Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +3C63F Length 0009 (9) │ │ │ │ +3C641 Flags 03 (3) 'Modification Access' │ │ │ │ +3C642 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +3C646 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +3C64A Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +3C64C Length 000B (11) │ │ │ │ +3C64E Version 01 (1) │ │ │ │ +3C64F UID Size 04 (4) │ │ │ │ +3C650 UID 00000000 (0) │ │ │ │ +3C654 GID Size 04 (4) │ │ │ │ +3C655 GID 00000000 (0) │ │ │ │ +3C659 PAYLOAD │ │ │ │ + │ │ │ │ +3D000 LOCAL HEADER #35 04034B50 (67324752) │ │ │ │ +3D004 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +3D005 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +3D006 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +3D008 Compression Method 0008 (8) 'Deflated' │ │ │ │ +3D00A Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +3D00E CRC 2899E6E3 (681174755) │ │ │ │ +3D012 Compressed Size 000006B8 (1720) │ │ │ │ +3D016 Uncompressed Size 00001566 (5478) │ │ │ │ +3D01A Filename Length 0012 (18) │ │ │ │ +3D01C Extra Length 001C (28) │ │ │ │ +3D01E Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x3D01E: Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +3D030 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +3D032 Length 0009 (9) │ │ │ │ +3D034 Flags 03 (3) 'Modification Access' │ │ │ │ +3D035 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +3D039 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +3D03D Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +3D03F Length 000B (11) │ │ │ │ +3D041 Version 01 (1) │ │ │ │ +3D042 UID Size 04 (4) │ │ │ │ +3D043 UID 00000000 (0) │ │ │ │ +3D047 GID Size 04 (4) │ │ │ │ +3D048 GID 00000000 (0) │ │ │ │ +3D04C PAYLOAD │ │ │ │ + │ │ │ │ +3D704 LOCAL HEADER #36 04034B50 (67324752) │ │ │ │ +3D708 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +3D709 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +3D70A General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +3D70C Compression Method 0008 (8) 'Deflated' │ │ │ │ +3D70E Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +3D712 CRC 6F3FE42A (1866458154) │ │ │ │ +3D716 Compressed Size 00002A11 (10769) │ │ │ │ +3D71A Uncompressed Size 0000B1DD (45533) │ │ │ │ +3D71E Filename Length 0010 (16) │ │ │ │ +3D720 Extra Length 001C (28) │ │ │ │ +3D722 Filename 'XXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x3D722: Filename 'XXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +3D732 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +3D734 Length 0009 (9) │ │ │ │ +3D736 Flags 03 (3) 'Modification Access' │ │ │ │ +3D737 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +3D73B Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +3D73F Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +3D741 Length 000B (11) │ │ │ │ +3D743 Version 01 (1) │ │ │ │ +3D744 UID Size 04 (4) │ │ │ │ +3D745 UID 00000000 (0) │ │ │ │ +3D749 GID Size 04 (4) │ │ │ │ +3D74A GID 00000000 (0) │ │ │ │ +3D74E PAYLOAD │ │ │ │ + │ │ │ │ +4015F LOCAL HEADER #37 04034B50 (67324752) │ │ │ │ +40163 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +40164 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +40165 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +40167 Compression Method 0008 (8) 'Deflated' │ │ │ │ +40169 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +4016D CRC 1A12C88F (437438607) │ │ │ │ +40171 Compressed Size 00001E86 (7814) │ │ │ │ +40175 Uncompressed Size 00009AAB (39595) │ │ │ │ +40179 Filename Length 0012 (18) │ │ │ │ +4017B Extra Length 001C (28) │ │ │ │ +4017D Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x4017D: Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +4018F Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +40191 Length 0009 (9) │ │ │ │ +40193 Flags 03 (3) 'Modification Access' │ │ │ │ +40194 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +40198 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +4019C Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +4019E Length 000B (11) │ │ │ │ +401A0 Version 01 (1) │ │ │ │ +401A1 UID Size 04 (4) │ │ │ │ +401A2 UID 00000000 (0) │ │ │ │ +401A6 GID Size 04 (4) │ │ │ │ +401A7 GID 00000000 (0) │ │ │ │ +401AB PAYLOAD │ │ │ │ + │ │ │ │ +42031 LOCAL HEADER #38 04034B50 (67324752) │ │ │ │ +42035 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +42036 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +42037 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +42039 Compression Method 0008 (8) 'Deflated' │ │ │ │ +4203B Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +4203F CRC 21789752 (561551186) │ │ │ │ +42043 Compressed Size 00001478 (5240) │ │ │ │ +42047 Uncompressed Size 00007AD0 (31440) │ │ │ │ +4204B Filename Length 0018 (24) │ │ │ │ +4204D Extra Length 001C (28) │ │ │ │ +4204F Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x4204F: Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +42067 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +42069 Length 0009 (9) │ │ │ │ +4206B Flags 03 (3) 'Modification Access' │ │ │ │ +4206C Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +42070 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +42074 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +42076 Length 000B (11) │ │ │ │ +42078 Version 01 (1) │ │ │ │ +42079 UID Size 04 (4) │ │ │ │ +4207A UID 00000000 (0) │ │ │ │ +4207E GID Size 04 (4) │ │ │ │ +4207F GID 00000000 (0) │ │ │ │ +42083 PAYLOAD │ │ │ │ + │ │ │ │ +434FB LOCAL HEADER #39 04034B50 (67324752) │ │ │ │ +434FF Extract Zip Spec 14 (20) '2.0' │ │ │ │ +43500 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +43501 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +43503 Compression Method 0008 (8) 'Deflated' │ │ │ │ +43505 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +43509 CRC 9E56D86B (2656491627) │ │ │ │ +4350D Compressed Size 000018D7 (6359) │ │ │ │ +43511 Uncompressed Size 0000A83A (43066) │ │ │ │ +43515 Filename Length 001F (31) │ │ │ │ +43517 Extra Length 001C (28) │ │ │ │ +43519 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x43519: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +43538 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +4353A Length 0009 (9) │ │ │ │ +4353C Flags 03 (3) 'Modification Access' │ │ │ │ +4353D Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +43541 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +43545 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +43547 Length 000B (11) │ │ │ │ +43549 Version 01 (1) │ │ │ │ +4354A UID Size 04 (4) │ │ │ │ +4354B UID 00000000 (0) │ │ │ │ +4354F GID Size 04 (4) │ │ │ │ +43550 GID 00000000 (0) │ │ │ │ +43554 PAYLOAD │ │ │ │ + │ │ │ │ +44E2B LOCAL HEADER #40 04034B50 (67324752) │ │ │ │ +44E2F Extract Zip Spec 14 (20) '2.0' │ │ │ │ +44E30 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +44E31 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +44E33 Compression Method 0008 (8) 'Deflated' │ │ │ │ +44E35 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +44E39 CRC 6DE2E94A (1843587402) │ │ │ │ +44E3D Compressed Size 000003F8 (1016) │ │ │ │ +44E41 Uncompressed Size 000008A4 (2212) │ │ │ │ +44E45 Filename Length 001E (30) │ │ │ │ +44E47 Extra Length 001C (28) │ │ │ │ +44E49 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x44E49: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +44E67 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +44E69 Length 0009 (9) │ │ │ │ +44E6B Flags 03 (3) 'Modification Access' │ │ │ │ +44E6C Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +44E70 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +44E74 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +44E76 Length 000B (11) │ │ │ │ +44E78 Version 01 (1) │ │ │ │ +44E79 UID Size 04 (4) │ │ │ │ +44E7A UID 00000000 (0) │ │ │ │ +44E7E GID Size 04 (4) │ │ │ │ +44E7F GID 00000000 (0) │ │ │ │ +44E83 PAYLOAD │ │ │ │ + │ │ │ │ +4527B LOCAL HEADER #41 04034B50 (67324752) │ │ │ │ +4527F Extract Zip Spec 14 (20) '2.0' │ │ │ │ +45280 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +45281 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +45283 Compression Method 0008 (8) 'Deflated' │ │ │ │ +45285 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +45289 CRC 93538F15 (2471726869) │ │ │ │ +4528D Compressed Size 00004296 (17046) │ │ │ │ +45291 Uncompressed Size 0000D8E8 (55528) │ │ │ │ +45295 Filename Length 0013 (19) │ │ │ │ +45297 Extra Length 001C (28) │ │ │ │ +45299 Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x45299: Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +452AC Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +452AE Length 0009 (9) │ │ │ │ +452B0 Flags 03 (3) 'Modification Access' │ │ │ │ +452B1 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +452B5 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +452B9 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +452BB Length 000B (11) │ │ │ │ +452BD Version 01 (1) │ │ │ │ +452BE UID Size 04 (4) │ │ │ │ +452BF UID 00000000 (0) │ │ │ │ +452C3 GID Size 04 (4) │ │ │ │ +452C4 GID 00000000 (0) │ │ │ │ +452C8 PAYLOAD │ │ │ │ + │ │ │ │ +4955E LOCAL HEADER #42 04034B50 (67324752) │ │ │ │ +49562 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +49563 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +49564 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +49566 Compression Method 0008 (8) 'Deflated' │ │ │ │ +49568 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +4956C CRC 66B2004C (1722941516) │ │ │ │ +49570 Compressed Size 000026C3 (9923) │ │ │ │ +49574 Uncompressed Size 00006E46 (28230) │ │ │ │ +49578 Filename Length 0019 (25) │ │ │ │ +4957A Extra Length 001C (28) │ │ │ │ +4957C Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x4957C: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +49595 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +49597 Length 0009 (9) │ │ │ │ +49599 Flags 03 (3) 'Modification Access' │ │ │ │ +4959A Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +4959E Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +495A2 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +495A4 Length 000B (11) │ │ │ │ +495A6 Version 01 (1) │ │ │ │ +495A7 UID Size 04 (4) │ │ │ │ +495A8 UID 00000000 (0) │ │ │ │ +495AC GID Size 04 (4) │ │ │ │ +495AD GID 00000000 (0) │ │ │ │ +495B1 PAYLOAD │ │ │ │ + │ │ │ │ +4BC74 LOCAL HEADER #43 04034B50 (67324752) │ │ │ │ +4BC78 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +4BC79 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +4BC7A General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +4BC7C Compression Method 0008 (8) 'Deflated' │ │ │ │ +4BC7E Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +4BC82 CRC 300CDC3B (806149179) │ │ │ │ +4BC86 Compressed Size 0000273A (10042) │ │ │ │ +4BC8A Uncompressed Size 00008B84 (35716) │ │ │ │ +4BC8E Filename Length 0019 (25) │ │ │ │ +4BC90 Extra Length 001C (28) │ │ │ │ +4BC92 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x4BC92: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +4BCAB Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +4BCAD Length 0009 (9) │ │ │ │ +4BCAF Flags 03 (3) 'Modification Access' │ │ │ │ +4BCB0 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +4BCB4 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +4BCB8 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +4BCBA Length 000B (11) │ │ │ │ +4BCBC Version 01 (1) │ │ │ │ +4BCBD UID Size 04 (4) │ │ │ │ +4BCBE UID 00000000 (0) │ │ │ │ +4BCC2 GID Size 04 (4) │ │ │ │ +4BCC3 GID 00000000 (0) │ │ │ │ +4BCC7 PAYLOAD │ │ │ │ + │ │ │ │ +4E401 LOCAL HEADER #44 04034B50 (67324752) │ │ │ │ +4E405 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +4E406 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +4E407 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +4E409 Compression Method 0008 (8) 'Deflated' │ │ │ │ +4E40B Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +4E40F CRC 77A3FE35 (2007236149) │ │ │ │ +4E413 Compressed Size 00000CF2 (3314) │ │ │ │ +4E417 Uncompressed Size 0000517B (20859) │ │ │ │ +4E41B Filename Length 0021 (33) │ │ │ │ +4E41D Extra Length 001C (28) │ │ │ │ +4E41F Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x4E41F: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +4E440 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +4E442 Length 0009 (9) │ │ │ │ +4E444 Flags 03 (3) 'Modification Access' │ │ │ │ +4E445 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +4E449 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +4E44D Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +4E44F Length 000B (11) │ │ │ │ +4E451 Version 01 (1) │ │ │ │ +4E452 UID Size 04 (4) │ │ │ │ +4E453 UID 00000000 (0) │ │ │ │ +4E457 GID Size 04 (4) │ │ │ │ +4E458 GID 00000000 (0) │ │ │ │ +4E45C PAYLOAD │ │ │ │ + │ │ │ │ +4F14E LOCAL HEADER #45 04034B50 (67324752) │ │ │ │ +4F152 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +4F153 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +4F154 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +4F156 Compression Method 0008 (8) 'Deflated' │ │ │ │ +4F158 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +4F15C CRC 0D2E5D9B (221142427) │ │ │ │ +4F160 Compressed Size 00000468 (1128) │ │ │ │ +4F164 Uncompressed Size 00000932 (2354) │ │ │ │ +4F168 Filename Length 001B (27) │ │ │ │ +4F16A Extra Length 001C (28) │ │ │ │ +4F16C Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x4F16C: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +4F187 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +4F189 Length 0009 (9) │ │ │ │ +4F18B Flags 03 (3) 'Modification Access' │ │ │ │ +4F18C Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +4F190 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +4F194 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +4F196 Length 000B (11) │ │ │ │ +4F198 Version 01 (1) │ │ │ │ +4F199 UID Size 04 (4) │ │ │ │ +4F19A UID 00000000 (0) │ │ │ │ +4F19E GID Size 04 (4) │ │ │ │ +4F19F GID 00000000 (0) │ │ │ │ +4F1A3 PAYLOAD │ │ │ │ + │ │ │ │ +4F60B LOCAL HEADER #46 04034B50 (67324752) │ │ │ │ +4F60F Extract Zip Spec 14 (20) '2.0' │ │ │ │ +4F610 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +4F611 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +4F613 Compression Method 0008 (8) 'Deflated' │ │ │ │ +4F615 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +4F619 CRC CBAFCC83 (3417296003) │ │ │ │ +4F61D Compressed Size 000016ED (5869) │ │ │ │ +4F621 Uncompressed Size 00007A6E (31342) │ │ │ │ +4F625 Filename Length 001F (31) │ │ │ │ +4F627 Extra Length 001C (28) │ │ │ │ +4F629 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x4F629: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +4F648 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +4F64A Length 0009 (9) │ │ │ │ +4F64C Flags 03 (3) 'Modification Access' │ │ │ │ +4F64D Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +4F651 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +4F655 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +4F657 Length 000B (11) │ │ │ │ +4F659 Version 01 (1) │ │ │ │ +4F65A UID Size 04 (4) │ │ │ │ +4F65B UID 00000000 (0) │ │ │ │ +4F65F GID Size 04 (4) │ │ │ │ +4F660 GID 00000000 (0) │ │ │ │ +4F664 PAYLOAD │ │ │ │ + │ │ │ │ +50D51 LOCAL HEADER #47 04034B50 (67324752) │ │ │ │ +50D55 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +50D56 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +50D57 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +50D59 Compression Method 0008 (8) 'Deflated' │ │ │ │ +50D5B Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +50D5F CRC 37409808 (926980104) │ │ │ │ +50D63 Compressed Size 0000415F (16735) │ │ │ │ +50D67 Uncompressed Size 0001D160 (119136) │ │ │ │ +50D6B Filename Length 0010 (16) │ │ │ │ +50D6D Extra Length 001C (28) │ │ │ │ +50D6F Filename 'XXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x50D6F: Filename 'XXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +50D7F Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +50D81 Length 0009 (9) │ │ │ │ +50D83 Flags 03 (3) 'Modification Access' │ │ │ │ +50D84 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +50D88 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +50D8C Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +50D8E Length 000B (11) │ │ │ │ +50D90 Version 01 (1) │ │ │ │ +50D91 UID Size 04 (4) │ │ │ │ +50D92 UID 00000000 (0) │ │ │ │ +50D96 GID Size 04 (4) │ │ │ │ +50D97 GID 00000000 (0) │ │ │ │ +50D9B PAYLOAD │ │ │ │ + │ │ │ │ +54EFA LOCAL HEADER #48 04034B50 (67324752) │ │ │ │ +54EFE Extract Zip Spec 14 (20) '2.0' │ │ │ │ +54EFF Extract OS 00 (0) 'MS-DOS' │ │ │ │ +54F00 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +54F02 Compression Method 0008 (8) 'Deflated' │ │ │ │ +54F04 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +54F08 CRC 6CEC6D86 (1827433862) │ │ │ │ +54F0C Compressed Size 00000A98 (2712) │ │ │ │ +54F10 Uncompressed Size 00002106 (8454) │ │ │ │ +54F14 Filename Length 0014 (20) │ │ │ │ +54F16 Extra Length 001C (28) │ │ │ │ +54F18 Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x54F18: Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +54F2C Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +54F2E Length 0009 (9) │ │ │ │ +54F30 Flags 03 (3) 'Modification Access' │ │ │ │ +54F31 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +54F35 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +54F39 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +54F3B Length 000B (11) │ │ │ │ +54F3D Version 01 (1) │ │ │ │ +54F3E UID Size 04 (4) │ │ │ │ +54F3F UID 00000000 (0) │ │ │ │ +54F43 GID Size 04 (4) │ │ │ │ +54F44 GID 00000000 (0) │ │ │ │ +54F48 PAYLOAD │ │ │ │ + │ │ │ │ +559E0 LOCAL HEADER #49 04034B50 (67324752) │ │ │ │ +559E4 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +559E5 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +559E6 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +559E8 Compression Method 0008 (8) 'Deflated' │ │ │ │ +559EA Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +559EE CRC 025708CA (39258314) │ │ │ │ +559F2 Compressed Size 0000AD70 (44400) │ │ │ │ +559F6 Uncompressed Size 0003EB1B (256795) │ │ │ │ +559FA Filename Length 0017 (23) │ │ │ │ +559FC Extra Length 001C (28) │ │ │ │ +559FE Filename 'XXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x559FE: Filename 'XXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +55A15 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +55A17 Length 0009 (9) │ │ │ │ +55A19 Flags 03 (3) 'Modification Access' │ │ │ │ +55A1A Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +55A1E Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +55A22 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +55A24 Length 000B (11) │ │ │ │ +55A26 Version 01 (1) │ │ │ │ +55A27 UID Size 04 (4) │ │ │ │ +55A28 UID 00000000 (0) │ │ │ │ +55A2C GID Size 04 (4) │ │ │ │ +55A2D GID 00000000 (0) │ │ │ │ +55A31 PAYLOAD │ │ │ │ + │ │ │ │ +607A1 LOCAL HEADER #50 04034B50 (67324752) │ │ │ │ +607A5 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +607A6 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +607A7 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +607A9 Compression Method 0008 (8) 'Deflated' │ │ │ │ +607AB Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +607AF CRC A87C41BB (2826715579) │ │ │ │ +607B3 Compressed Size 00000401 (1025) │ │ │ │ +607B7 Uncompressed Size 0000093E (2366) │ │ │ │ +607BB Filename Length 0013 (19) │ │ │ │ +607BD Extra Length 001C (28) │ │ │ │ +607BF Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x607BF: Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +607D2 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +607D4 Length 0009 (9) │ │ │ │ +607D6 Flags 03 (3) 'Modification Access' │ │ │ │ +607D7 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +607DB Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +607DF Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +607E1 Length 000B (11) │ │ │ │ +607E3 Version 01 (1) │ │ │ │ +607E4 UID Size 04 (4) │ │ │ │ +607E5 UID 00000000 (0) │ │ │ │ +607E9 GID Size 04 (4) │ │ │ │ +607EA GID 00000000 (0) │ │ │ │ +607EE PAYLOAD │ │ │ │ + │ │ │ │ +60BEF LOCAL HEADER #51 04034B50 (67324752) │ │ │ │ +60BF3 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +60BF4 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +60BF5 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +60BF7 Compression Method 0008 (8) 'Deflated' │ │ │ │ +60BF9 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +60BFD CRC D64BD6EC (3595294444) │ │ │ │ +60C01 Compressed Size 000014D5 (5333) │ │ │ │ +60C05 Uncompressed Size 00006893 (26771) │ │ │ │ +60C09 Filename Length 0012 (18) │ │ │ │ +60C0B Extra Length 001C (28) │ │ │ │ +60C0D Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x60C0D: Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +60C1F Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +60C21 Length 0009 (9) │ │ │ │ +60C23 Flags 03 (3) 'Modification Access' │ │ │ │ +60C24 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +60C28 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +60C2C Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +60C2E Length 000B (11) │ │ │ │ +60C30 Version 01 (1) │ │ │ │ +60C31 UID Size 04 (4) │ │ │ │ +60C32 UID 00000000 (0) │ │ │ │ +60C36 GID Size 04 (4) │ │ │ │ +60C37 GID 00000000 (0) │ │ │ │ +60C3B PAYLOAD │ │ │ │ + │ │ │ │ +62110 LOCAL HEADER #52 04034B50 (67324752) │ │ │ │ +62114 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +62115 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +62116 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +62118 Compression Method 0008 (8) 'Deflated' │ │ │ │ +6211A Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +6211E CRC 6BB332CD (1806906061) │ │ │ │ +62122 Compressed Size 000011EF (4591) │ │ │ │ +62126 Uncompressed Size 0000410D (16653) │ │ │ │ +6212A Filename Length 0012 (18) │ │ │ │ +6212C Extra Length 001C (28) │ │ │ │ +6212E Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x6212E: Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +62140 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +62142 Length 0009 (9) │ │ │ │ +62144 Flags 03 (3) 'Modification Access' │ │ │ │ +62145 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +62149 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +6214D Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +6214F Length 000B (11) │ │ │ │ +62151 Version 01 (1) │ │ │ │ +62152 UID Size 04 (4) │ │ │ │ +62153 UID 00000000 (0) │ │ │ │ +62157 GID Size 04 (4) │ │ │ │ +62158 GID 00000000 (0) │ │ │ │ +6215C PAYLOAD │ │ │ │ + │ │ │ │ +6334B LOCAL HEADER #53 04034B50 (67324752) │ │ │ │ +6334F Extract Zip Spec 14 (20) '2.0' │ │ │ │ +63350 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +63351 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +63353 Compression Method 0008 (8) 'Deflated' │ │ │ │ +63355 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +63359 CRC C85B6AAE (3361434286) │ │ │ │ +6335D Compressed Size 000009DB (2523) │ │ │ │ +63361 Uncompressed Size 0000352A (13610) │ │ │ │ +63365 Filename Length 0019 (25) │ │ │ │ +63367 Extra Length 001C (28) │ │ │ │ +63369 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x63369: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +63382 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +63384 Length 0009 (9) │ │ │ │ +63386 Flags 03 (3) 'Modification Access' │ │ │ │ +63387 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +6338B Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +6338F Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +63391 Length 000B (11) │ │ │ │ +63393 Version 01 (1) │ │ │ │ +63394 UID Size 04 (4) │ │ │ │ +63395 UID 00000000 (0) │ │ │ │ +63399 GID Size 04 (4) │ │ │ │ +6339A GID 00000000 (0) │ │ │ │ +6339E PAYLOAD │ │ │ │ + │ │ │ │ +63D79 LOCAL HEADER #54 04034B50 (67324752) │ │ │ │ +63D7D Extract Zip Spec 14 (20) '2.0' │ │ │ │ +63D7E Extract OS 00 (0) 'MS-DOS' │ │ │ │ +63D7F General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +63D81 Compression Method 0008 (8) 'Deflated' │ │ │ │ +63D83 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +63D87 CRC 8032353E (2150774078) │ │ │ │ +63D8B Compressed Size 000018B7 (6327) │ │ │ │ +63D8F Uncompressed Size 0000A679 (42617) │ │ │ │ +63D93 Filename Length 0019 (25) │ │ │ │ +63D95 Extra Length 001C (28) │ │ │ │ +63D97 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x63D97: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +63DB0 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +63DB2 Length 0009 (9) │ │ │ │ +63DB4 Flags 03 (3) 'Modification Access' │ │ │ │ +63DB5 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +63DB9 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +63DBD Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +63DBF Length 000B (11) │ │ │ │ +63DC1 Version 01 (1) │ │ │ │ +63DC2 UID Size 04 (4) │ │ │ │ +63DC3 UID 00000000 (0) │ │ │ │ +63DC7 GID Size 04 (4) │ │ │ │ +63DC8 GID 00000000 (0) │ │ │ │ +63DCC PAYLOAD │ │ │ │ + │ │ │ │ +65683 LOCAL HEADER #55 04034B50 (67324752) │ │ │ │ +65687 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +65688 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +65689 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +6568B Compression Method 0008 (8) 'Deflated' │ │ │ │ +6568D Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +65691 CRC 63DD925D (1675465309) │ │ │ │ +65695 Compressed Size 0000177F (6015) │ │ │ │ +65699 Uncompressed Size 0000472D (18221) │ │ │ │ +6569D Filename Length 0014 (20) │ │ │ │ +6569F Extra Length 001C (28) │ │ │ │ +656A1 Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x656A1: Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +656B5 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +656B7 Length 0009 (9) │ │ │ │ +656B9 Flags 03 (3) 'Modification Access' │ │ │ │ +656BA Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +656BE Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +656C2 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +656C4 Length 000B (11) │ │ │ │ +656C6 Version 01 (1) │ │ │ │ +656C7 UID Size 04 (4) │ │ │ │ +656C8 UID 00000000 (0) │ │ │ │ +656CC GID Size 04 (4) │ │ │ │ +656CD GID 00000000 (0) │ │ │ │ +656D1 PAYLOAD │ │ │ │ + │ │ │ │ +66E50 LOCAL HEADER #56 04034B50 (67324752) │ │ │ │ +66E54 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +66E55 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +66E56 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +66E58 Compression Method 0008 (8) 'Deflated' │ │ │ │ +66E5A Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +66E5E CRC 7088EC5F (1888021599) │ │ │ │ +66E62 Compressed Size 0000040B (1035) │ │ │ │ +66E66 Uncompressed Size 00000826 (2086) │ │ │ │ +66E6A Filename Length 001C (28) │ │ │ │ +66E6C Extra Length 001C (28) │ │ │ │ +66E6E Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x66E6E: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +66E8A Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +66E8C Length 0009 (9) │ │ │ │ +66E8E Flags 03 (3) 'Modification Access' │ │ │ │ +66E8F Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +66E93 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +66E97 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +66E99 Length 000B (11) │ │ │ │ +66E9B Version 01 (1) │ │ │ │ +66E9C UID Size 04 (4) │ │ │ │ +66E9D UID 00000000 (0) │ │ │ │ +66EA1 GID Size 04 (4) │ │ │ │ +66EA2 GID 00000000 (0) │ │ │ │ +66EA6 PAYLOAD │ │ │ │ + │ │ │ │ +672B1 LOCAL HEADER #57 04034B50 (67324752) │ │ │ │ +672B5 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +672B6 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +672B7 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +672B9 Compression Method 0008 (8) 'Deflated' │ │ │ │ +672BB Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +672BF CRC 6536E3B1 (1698096049) │ │ │ │ +672C3 Compressed Size 0000249F (9375) │ │ │ │ +672C7 Uncompressed Size 0000B5FA (46586) │ │ │ │ +672CB Filename Length 001F (31) │ │ │ │ +672CD Extra Length 001C (28) │ │ │ │ +672CF Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x672CF: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +672EE Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +672F0 Length 0009 (9) │ │ │ │ +672F2 Flags 03 (3) 'Modification Access' │ │ │ │ +672F3 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +672F7 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +672FB Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +672FD Length 000B (11) │ │ │ │ +672FF Version 01 (1) │ │ │ │ +67300 UID Size 04 (4) │ │ │ │ +67301 UID 00000000 (0) │ │ │ │ +67305 GID Size 04 (4) │ │ │ │ +67306 GID 00000000 (0) │ │ │ │ +6730A PAYLOAD │ │ │ │ + │ │ │ │ +697A9 LOCAL HEADER #58 04034B50 (67324752) │ │ │ │ +697AD Extract Zip Spec 14 (20) '2.0' │ │ │ │ +697AE Extract OS 00 (0) 'MS-DOS' │ │ │ │ +697AF General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +697B1 Compression Method 0008 (8) 'Deflated' │ │ │ │ +697B3 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +697B7 CRC CD9E93C9 (3449721801) │ │ │ │ +697BB Compressed Size 00000E81 (3713) │ │ │ │ +697BF Uncompressed Size 000052DA (21210) │ │ │ │ +697C3 Filename Length 001F (31) │ │ │ │ +697C5 Extra Length 001C (28) │ │ │ │ +697C7 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x697C7: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +697E6 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +697E8 Length 0009 (9) │ │ │ │ +697EA Flags 03 (3) 'Modification Access' │ │ │ │ +697EB Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +697EF Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +697F3 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +697F5 Length 000B (11) │ │ │ │ +697F7 Version 01 (1) │ │ │ │ +697F8 UID Size 04 (4) │ │ │ │ +697F9 UID 00000000 (0) │ │ │ │ +697FD GID Size 04 (4) │ │ │ │ +697FE GID 00000000 (0) │ │ │ │ +69802 PAYLOAD │ │ │ │ + │ │ │ │ +6A683 LOCAL HEADER #59 04034B50 (67324752) │ │ │ │ +6A687 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +6A688 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +6A689 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +6A68B Compression Method 0008 (8) 'Deflated' │ │ │ │ +6A68D Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +6A691 CRC AD6F9DA2 (2909773218) │ │ │ │ +6A695 Compressed Size 00000A45 (2629) │ │ │ │ +6A699 Uncompressed Size 0000247B (9339) │ │ │ │ +6A69D Filename Length 0013 (19) │ │ │ │ +6A69F Extra Length 001C (28) │ │ │ │ +6A6A1 Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x6A6A1: Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +6A6B4 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +6A6B6 Length 0009 (9) │ │ │ │ +6A6B8 Flags 03 (3) 'Modification Access' │ │ │ │ +6A6B9 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +6A6BD Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +6A6C1 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +6A6C3 Length 000B (11) │ │ │ │ +6A6C5 Version 01 (1) │ │ │ │ +6A6C6 UID Size 04 (4) │ │ │ │ +6A6C7 UID 00000000 (0) │ │ │ │ +6A6CB GID Size 04 (4) │ │ │ │ +6A6CC GID 00000000 (0) │ │ │ │ +6A6D0 PAYLOAD │ │ │ │ + │ │ │ │ +6B115 LOCAL HEADER #60 04034B50 (67324752) │ │ │ │ +6B119 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +6B11A Extract OS 00 (0) 'MS-DOS' │ │ │ │ +6B11B General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +6B11D Compression Method 0008 (8) 'Deflated' │ │ │ │ +6B11F Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +6B123 CRC E99AD3C2 (3919238082) │ │ │ │ +6B127 Compressed Size 00002488 (9352) │ │ │ │ +6B12B Uncompressed Size 0000B84D (47181) │ │ │ │ +6B12F Filename Length 0019 (25) │ │ │ │ +6B131 Extra Length 001C (28) │ │ │ │ +6B133 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x6B133: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +6B14C Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +6B14E Length 0009 (9) │ │ │ │ +6B150 Flags 03 (3) 'Modification Access' │ │ │ │ +6B151 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +6B155 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +6B159 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +6B15B Length 000B (11) │ │ │ │ +6B15D Version 01 (1) │ │ │ │ +6B15E UID Size 04 (4) │ │ │ │ +6B15F UID 00000000 (0) │ │ │ │ +6B163 GID Size 04 (4) │ │ │ │ +6B164 GID 00000000 (0) │ │ │ │ +6B168 PAYLOAD │ │ │ │ + │ │ │ │ +6D5F0 LOCAL HEADER #61 04034B50 (67324752) │ │ │ │ +6D5F4 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +6D5F5 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +6D5F6 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +6D5F8 Compression Method 0008 (8) 'Deflated' │ │ │ │ +6D5FA Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +6D5FE CRC 88AC0595 (2292974997) │ │ │ │ +6D602 Compressed Size 00000EFB (3835) │ │ │ │ +6D606 Uncompressed Size 00003A2D (14893) │ │ │ │ +6D60A Filename Length 0024 (36) │ │ │ │ +6D60C Extra Length 001C (28) │ │ │ │ +6D60E Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x6D60E: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +6D632 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +6D634 Length 0009 (9) │ │ │ │ +6D636 Flags 03 (3) 'Modification Access' │ │ │ │ +6D637 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +6D63B Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +6D63F Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +6D641 Length 000B (11) │ │ │ │ +6D643 Version 01 (1) │ │ │ │ +6D644 UID Size 04 (4) │ │ │ │ +6D645 UID 00000000 (0) │ │ │ │ +6D649 GID Size 04 (4) │ │ │ │ +6D64A GID 00000000 (0) │ │ │ │ +6D64E PAYLOAD │ │ │ │ + │ │ │ │ +6E549 LOCAL HEADER #62 04034B50 (67324752) │ │ │ │ +6E54D Extract Zip Spec 14 (20) '2.0' │ │ │ │ +6E54E Extract OS 00 (0) 'MS-DOS' │ │ │ │ +6E54F General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +6E551 Compression Method 0008 (8) 'Deflated' │ │ │ │ +6E553 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +6E557 CRC 4F031D37 (1325604151) │ │ │ │ +6E55B Compressed Size 00001AB9 (6841) │ │ │ │ +6E55F Uncompressed Size 00005F39 (24377) │ │ │ │ +6E563 Filename Length 0017 (23) │ │ │ │ +6E565 Extra Length 001C (28) │ │ │ │ +6E567 Filename 'XXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x6E567: Filename 'XXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +6E57E Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +6E580 Length 0009 (9) │ │ │ │ +6E582 Flags 03 (3) 'Modification Access' │ │ │ │ +6E583 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +6E587 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +6E58B Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +6E58D Length 000B (11) │ │ │ │ +6E58F Version 01 (1) │ │ │ │ +6E590 UID Size 04 (4) │ │ │ │ +6E591 UID 00000000 (0) │ │ │ │ +6E595 GID Size 04 (4) │ │ │ │ +6E596 GID 00000000 (0) │ │ │ │ +6E59A PAYLOAD │ │ │ │ + │ │ │ │ +70053 LOCAL HEADER #63 04034B50 (67324752) │ │ │ │ +70057 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +70058 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +70059 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +7005B Compression Method 0008 (8) 'Deflated' │ │ │ │ +7005D Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +70061 CRC 11E32AF1 (300100337) │ │ │ │ +70065 Compressed Size 00000ED3 (3795) │ │ │ │ +70069 Uncompressed Size 000038E2 (14562) │ │ │ │ +7006D Filename Length 0023 (35) │ │ │ │ +7006F Extra Length 001C (28) │ │ │ │ +70071 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x70071: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +70094 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +70096 Length 0009 (9) │ │ │ │ +70098 Flags 03 (3) 'Modification Access' │ │ │ │ +70099 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +7009D Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +700A1 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +700A3 Length 000B (11) │ │ │ │ +700A5 Version 01 (1) │ │ │ │ +700A6 UID Size 04 (4) │ │ │ │ +700A7 UID 00000000 (0) │ │ │ │ +700AB GID Size 04 (4) │ │ │ │ +700AC GID 00000000 (0) │ │ │ │ +700B0 PAYLOAD │ │ │ │ + │ │ │ │ +70F83 LOCAL HEADER #64 04034B50 (67324752) │ │ │ │ +70F87 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +70F88 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +70F89 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +70F8B Compression Method 0008 (8) 'Deflated' │ │ │ │ +70F8D Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +70F91 CRC 2DB7929F (767005343) │ │ │ │ +70F95 Compressed Size 00000113 (275) │ │ │ │ +70F99 Uncompressed Size 000001F3 (499) │ │ │ │ +70F9D Filename Length 001B (27) │ │ │ │ +70F9F Extra Length 001C (28) │ │ │ │ +70FA1 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x70FA1: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +70FBC Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +70FBE Length 0009 (9) │ │ │ │ +70FC0 Flags 03 (3) 'Modification Access' │ │ │ │ +70FC1 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +70FC5 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +70FC9 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +70FCB Length 000B (11) │ │ │ │ +70FCD Version 01 (1) │ │ │ │ +70FCE UID Size 04 (4) │ │ │ │ +70FCF UID 00000000 (0) │ │ │ │ +70FD3 GID Size 04 (4) │ │ │ │ +70FD4 GID 00000000 (0) │ │ │ │ +70FD8 PAYLOAD │ │ │ │ + │ │ │ │ +710EB LOCAL HEADER #65 04034B50 (67324752) │ │ │ │ +710EF Extract Zip Spec 14 (20) '2.0' │ │ │ │ +710F0 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +710F1 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +710F3 Compression Method 0008 (8) 'Deflated' │ │ │ │ +710F5 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +710F9 CRC 4D088BEC (1292405740) │ │ │ │ +710FD Compressed Size 00001891 (6289) │ │ │ │ +71101 Uncompressed Size 00008FAD (36781) │ │ │ │ +71105 Filename Length 001D (29) │ │ │ │ +71107 Extra Length 001C (28) │ │ │ │ +71109 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x71109: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +71126 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +71128 Length 0009 (9) │ │ │ │ +7112A Flags 03 (3) 'Modification Access' │ │ │ │ +7112B Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +7112F Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +71133 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +71135 Length 000B (11) │ │ │ │ +71137 Version 01 (1) │ │ │ │ +71138 UID Size 04 (4) │ │ │ │ +71139 UID 00000000 (0) │ │ │ │ +7113D GID Size 04 (4) │ │ │ │ +7113E GID 00000000 (0) │ │ │ │ +71142 PAYLOAD │ │ │ │ + │ │ │ │ +729D3 LOCAL HEADER #66 04034B50 (67324752) │ │ │ │ +729D7 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +729D8 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +729D9 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +729DB Compression Method 0008 (8) 'Deflated' │ │ │ │ +729DD Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +729E1 CRC ECF01B2E (3975158574) │ │ │ │ +729E5 Compressed Size 0000164B (5707) │ │ │ │ +729E9 Uncompressed Size 00003A9C (15004) │ │ │ │ +729ED Filename Length 0015 (21) │ │ │ │ +729EF Extra Length 001C (28) │ │ │ │ +729F1 Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x729F1: Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +72A06 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +72A08 Length 0009 (9) │ │ │ │ +72A0A Flags 03 (3) 'Modification Access' │ │ │ │ +72A0B Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +72A0F Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +72A13 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +72A15 Length 000B (11) │ │ │ │ +72A17 Version 01 (1) │ │ │ │ +72A18 UID Size 04 (4) │ │ │ │ +72A19 UID 00000000 (0) │ │ │ │ +72A1D GID Size 04 (4) │ │ │ │ +72A1E GID 00000000 (0) │ │ │ │ +72A22 PAYLOAD │ │ │ │ + │ │ │ │ +7406D LOCAL HEADER #67 04034B50 (67324752) │ │ │ │ +74071 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +74072 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +74073 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +74075 Compression Method 0008 (8) 'Deflated' │ │ │ │ +74077 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +7407B CRC 4AB846D3 (1253590739) │ │ │ │ +7407F Compressed Size 00003B4F (15183) │ │ │ │ +74083 Uncompressed Size 00011CC3 (72899) │ │ │ │ +74087 Filename Length 0016 (22) │ │ │ │ +74089 Extra Length 001C (28) │ │ │ │ +7408B Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x7408B: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +740A1 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +740A3 Length 0009 (9) │ │ │ │ +740A5 Flags 03 (3) 'Modification Access' │ │ │ │ +740A6 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +740AA Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +740AE Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +740B0 Length 000B (11) │ │ │ │ +740B2 Version 01 (1) │ │ │ │ +740B3 UID Size 04 (4) │ │ │ │ +740B4 UID 00000000 (0) │ │ │ │ +740B8 GID Size 04 (4) │ │ │ │ +740B9 GID 00000000 (0) │ │ │ │ +740BD PAYLOAD │ │ │ │ + │ │ │ │ +77C0C LOCAL HEADER #68 04034B50 (67324752) │ │ │ │ +77C10 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +77C11 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +77C12 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +77C14 Compression Method 0008 (8) 'Deflated' │ │ │ │ +77C16 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +77C1A CRC 17EC873B (401377083) │ │ │ │ +77C1E Compressed Size 00003E7E (15998) │ │ │ │ +77C22 Uncompressed Size 0001C17C (115068) │ │ │ │ +77C26 Filename Length 0019 (25) │ │ │ │ +77C28 Extra Length 001C (28) │ │ │ │ +77C2A Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x77C2A: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +77C43 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +77C45 Length 0009 (9) │ │ │ │ +77C47 Flags 03 (3) 'Modification Access' │ │ │ │ +77C48 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +77C4C Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +77C50 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +77C52 Length 000B (11) │ │ │ │ +77C54 Version 01 (1) │ │ │ │ +77C55 UID Size 04 (4) │ │ │ │ +77C56 UID 00000000 (0) │ │ │ │ +77C5A GID Size 04 (4) │ │ │ │ +77C5B GID 00000000 (0) │ │ │ │ +77C5F PAYLOAD │ │ │ │ + │ │ │ │ +7BADD LOCAL HEADER #69 04034B50 (67324752) │ │ │ │ +7BAE1 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +7BAE2 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +7BAE3 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +7BAE5 Compression Method 0008 (8) 'Deflated' │ │ │ │ +7BAE7 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +7BAEB CRC 3FC481AE (1069842862) │ │ │ │ +7BAEF Compressed Size 0000083C (2108) │ │ │ │ +7BAF3 Uncompressed Size 00003384 (13188) │ │ │ │ +7BAF7 Filename Length 0011 (17) │ │ │ │ +7BAF9 Extra Length 001C (28) │ │ │ │ +7BAFB Filename 'XXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x7BAFB: Filename 'XXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +7BB0C Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +7BB0E Length 0009 (9) │ │ │ │ +7BB10 Flags 03 (3) 'Modification Access' │ │ │ │ +7BB11 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +7BB15 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +7BB19 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +7BB1B Length 000B (11) │ │ │ │ +7BB1D Version 01 (1) │ │ │ │ +7BB1E UID Size 04 (4) │ │ │ │ +7BB1F UID 00000000 (0) │ │ │ │ +7BB23 GID Size 04 (4) │ │ │ │ +7BB24 GID 00000000 (0) │ │ │ │ +7BB28 PAYLOAD │ │ │ │ + │ │ │ │ +7C364 LOCAL HEADER #70 04034B50 (67324752) │ │ │ │ +7C368 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +7C369 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +7C36A General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +7C36C Compression Method 0008 (8) 'Deflated' │ │ │ │ +7C36E Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +7C372 CRC 49C20694 (1237452436) │ │ │ │ +7C376 Compressed Size 000051A0 (20896) │ │ │ │ +7C37A Uncompressed Size 0001FBE0 (130016) │ │ │ │ +7C37E Filename Length 0015 (21) │ │ │ │ +7C380 Extra Length 001C (28) │ │ │ │ +7C382 Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x7C382: Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +7C397 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +7C399 Length 0009 (9) │ │ │ │ +7C39B Flags 03 (3) 'Modification Access' │ │ │ │ +7C39C Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +7C3A0 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +7C3A4 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +7C3A6 Length 000B (11) │ │ │ │ +7C3A8 Version 01 (1) │ │ │ │ +7C3A9 UID Size 04 (4) │ │ │ │ +7C3AA UID 00000000 (0) │ │ │ │ +7C3AE GID Size 04 (4) │ │ │ │ +7C3AF GID 00000000 (0) │ │ │ │ +7C3B3 PAYLOAD │ │ │ │ + │ │ │ │ +81553 LOCAL HEADER #71 04034B50 (67324752) │ │ │ │ +81557 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +81558 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +81559 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +8155B Compression Method 0008 (8) 'Deflated' │ │ │ │ +8155D Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +81561 CRC 383CB23F (943501887) │ │ │ │ +81565 Compressed Size 00001B0A (6922) │ │ │ │ +81569 Uncompressed Size 000081D0 (33232) │ │ │ │ +8156D Filename Length 0019 (25) │ │ │ │ +8156F Extra Length 001C (28) │ │ │ │ +81571 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x81571: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +8158A Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +8158C Length 0009 (9) │ │ │ │ +8158E Flags 03 (3) 'Modification Access' │ │ │ │ +8158F Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +81593 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +81597 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +81599 Length 000B (11) │ │ │ │ +8159B Version 01 (1) │ │ │ │ +8159C UID Size 04 (4) │ │ │ │ +8159D UID 00000000 (0) │ │ │ │ +815A1 GID Size 04 (4) │ │ │ │ +815A2 GID 00000000 (0) │ │ │ │ +815A6 PAYLOAD │ │ │ │ + │ │ │ │ +830B0 LOCAL HEADER #72 04034B50 (67324752) │ │ │ │ +830B4 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +830B5 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +830B6 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +830B8 Compression Method 0008 (8) 'Deflated' │ │ │ │ +830BA Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +830BE CRC 38C0483A (952125498) │ │ │ │ +830C2 Compressed Size 00000D97 (3479) │ │ │ │ +830C6 Uncompressed Size 00002EA0 (11936) │ │ │ │ +830CA Filename Length 0018 (24) │ │ │ │ +830CC Extra Length 001C (28) │ │ │ │ +830CE Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x830CE: Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +830E6 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +830E8 Length 0009 (9) │ │ │ │ +830EA Flags 03 (3) 'Modification Access' │ │ │ │ +830EB Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +830EF Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +830F3 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +830F5 Length 000B (11) │ │ │ │ +830F7 Version 01 (1) │ │ │ │ +830F8 UID Size 04 (4) │ │ │ │ +830F9 UID 00000000 (0) │ │ │ │ +830FD GID Size 04 (4) │ │ │ │ +830FE GID 00000000 (0) │ │ │ │ +83102 PAYLOAD │ │ │ │ + │ │ │ │ +83E99 LOCAL HEADER #73 04034B50 (67324752) │ │ │ │ +83E9D Extract Zip Spec 14 (20) '2.0' │ │ │ │ +83E9E Extract OS 00 (0) 'MS-DOS' │ │ │ │ +83E9F General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +83EA1 Compression Method 0008 (8) 'Deflated' │ │ │ │ +83EA3 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +83EA7 CRC C1ECA9DB (3253512667) │ │ │ │ +83EAB Compressed Size 000001E1 (481) │ │ │ │ +83EAF Uncompressed Size 00000324 (804) │ │ │ │ +83EB3 Filename Length 0011 (17) │ │ │ │ +83EB5 Extra Length 001C (28) │ │ │ │ +83EB7 Filename 'XXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x83EB7: Filename 'XXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +83EC8 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +83ECA Length 0009 (9) │ │ │ │ +83ECC Flags 03 (3) 'Modification Access' │ │ │ │ +83ECD Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +83ED1 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +83ED5 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +83ED7 Length 000B (11) │ │ │ │ +83ED9 Version 01 (1) │ │ │ │ +83EDA UID Size 04 (4) │ │ │ │ +83EDB UID 00000000 (0) │ │ │ │ +83EDF GID Size 04 (4) │ │ │ │ +83EE0 GID 00000000 (0) │ │ │ │ +83EE4 PAYLOAD │ │ │ │ + │ │ │ │ +840C5 LOCAL HEADER #74 04034B50 (67324752) │ │ │ │ +840C9 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +840CA Extract OS 00 (0) 'MS-DOS' │ │ │ │ +840CB General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +840CD Compression Method 0008 (8) 'Deflated' │ │ │ │ +840CF Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +840D3 CRC A600F67C (2785080956) │ │ │ │ +840D7 Compressed Size 000006C3 (1731) │ │ │ │ +840DB Uncompressed Size 0000143A (5178) │ │ │ │ +840DF Filename Length 0019 (25) │ │ │ │ +840E1 Extra Length 001C (28) │ │ │ │ +840E3 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x840E3: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +840FC Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +840FE Length 0009 (9) │ │ │ │ +84100 Flags 03 (3) 'Modification Access' │ │ │ │ +84101 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +84105 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +84109 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +8410B Length 000B (11) │ │ │ │ +8410D Version 01 (1) │ │ │ │ +8410E UID Size 04 (4) │ │ │ │ +8410F UID 00000000 (0) │ │ │ │ +84113 GID Size 04 (4) │ │ │ │ +84114 GID 00000000 (0) │ │ │ │ +84118 PAYLOAD │ │ │ │ + │ │ │ │ +847DB LOCAL HEADER #75 04034B50 (67324752) │ │ │ │ +847DF Extract Zip Spec 14 (20) '2.0' │ │ │ │ +847E0 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +847E1 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +847E3 Compression Method 0008 (8) 'Deflated' │ │ │ │ +847E5 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +847E9 CRC 18EBB852 (418101330) │ │ │ │ +847ED Compressed Size 00001B8F (7055) │ │ │ │ +847F1 Uncompressed Size 00009F60 (40800) │ │ │ │ +847F5 Filename Length 0018 (24) │ │ │ │ +847F7 Extra Length 001C (28) │ │ │ │ +847F9 Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x847F9: Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +84811 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +84813 Length 0009 (9) │ │ │ │ +84815 Flags 03 (3) 'Modification Access' │ │ │ │ +84816 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +8481A Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +8481E Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +84820 Length 000B (11) │ │ │ │ +84822 Version 01 (1) │ │ │ │ +84823 UID Size 04 (4) │ │ │ │ +84824 UID 00000000 (0) │ │ │ │ +84828 GID Size 04 (4) │ │ │ │ +84829 GID 00000000 (0) │ │ │ │ +8482D PAYLOAD │ │ │ │ + │ │ │ │ +863BC LOCAL HEADER #76 04034B50 (67324752) │ │ │ │ +863C0 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +863C1 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +863C2 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +863C4 Compression Method 0008 (8) 'Deflated' │ │ │ │ +863C6 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +863CA CRC A29C75F2 (2728162802) │ │ │ │ +863CE Compressed Size 000016FD (5885) │ │ │ │ +863D2 Uncompressed Size 00008B13 (35603) │ │ │ │ +863D6 Filename Length 0012 (18) │ │ │ │ +863D8 Extra Length 001C (28) │ │ │ │ +863DA Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x863DA: Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +863EC Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +863EE Length 0009 (9) │ │ │ │ +863F0 Flags 03 (3) 'Modification Access' │ │ │ │ +863F1 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +863F5 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +863F9 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +863FB Length 000B (11) │ │ │ │ +863FD Version 01 (1) │ │ │ │ +863FE UID Size 04 (4) │ │ │ │ +863FF UID 00000000 (0) │ │ │ │ +86403 GID Size 04 (4) │ │ │ │ +86404 GID 00000000 (0) │ │ │ │ +86408 PAYLOAD │ │ │ │ + │ │ │ │ +87B05 LOCAL HEADER #77 04034B50 (67324752) │ │ │ │ +87B09 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +87B0A Extract OS 00 (0) 'MS-DOS' │ │ │ │ +87B0B General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +87B0D Compression Method 0008 (8) 'Deflated' │ │ │ │ +87B0F Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +87B13 CRC 9D59BBDC (2639903708) │ │ │ │ +87B17 Compressed Size 00001E0B (7691) │ │ │ │ +87B1B Uncompressed Size 00008804 (34820) │ │ │ │ +87B1F Filename Length 0016 (22) │ │ │ │ +87B21 Extra Length 001C (28) │ │ │ │ +87B23 Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x87B23: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +87B39 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +87B3B Length 0009 (9) │ │ │ │ +87B3D Flags 03 (3) 'Modification Access' │ │ │ │ +87B3E Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +87B42 Access Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +87B46 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +87B48 Length 000B (11) │ │ │ │ +87B4A Version 01 (1) │ │ │ │ +87B4B UID Size 04 (4) │ │ │ │ +87B4C UID 00000000 (0) │ │ │ │ +87B50 GID Size 04 (4) │ │ │ │ +87B51 GID 00000000 (0) │ │ │ │ +87B55 PAYLOAD │ │ │ │ + │ │ │ │ +89960 LOCAL HEADER #78 04034B50 (67324752) │ │ │ │ +89964 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +89965 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +89966 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +89968 Compression Method 0008 (8) 'Deflated' │ │ │ │ +8996A Modification Time 5C9B8587 (1553696135) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +8996E CRC 70A0EB3A (1889594170) │ │ │ │ +89972 Compressed Size 000029AA (10666) │ │ │ │ +89976 Uncompressed Size 0000D050 (53328) │ │ │ │ +8997A Filename Length 001A (26) │ │ │ │ +8997C Extra Length 001C (28) │ │ │ │ +8997E Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x8997E: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +89998 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +8999A Length 0009 (9) │ │ │ │ +8999C Flags 03 (3) 'Modification Access' │ │ │ │ +8999D Modification Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +899A1 Access Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +899A5 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +899A7 Length 000B (11) │ │ │ │ +899A9 Version 01 (1) │ │ │ │ +899AA UID Size 04 (4) │ │ │ │ +899AB UID 00000000 (0) │ │ │ │ +899AF GID Size 04 (4) │ │ │ │ +899B0 GID 00000000 (0) │ │ │ │ +899B4 PAYLOAD │ │ │ │ + │ │ │ │ +8C35E LOCAL HEADER #79 04034B50 (67324752) │ │ │ │ +8C362 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +8C363 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +8C364 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +8C366 Compression Method 0008 (8) 'Deflated' │ │ │ │ +8C368 Modification Time 5C9B8587 (1553696135) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +8C36C CRC C79CE53D (3348948285) │ │ │ │ +8C370 Compressed Size 000009AD (2477) │ │ │ │ +8C374 Uncompressed Size 00001DB7 (7607) │ │ │ │ +8C378 Filename Length 0018 (24) │ │ │ │ +8C37A Extra Length 001C (28) │ │ │ │ +8C37C Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x8C37C: Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +8C394 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +8C396 Length 0009 (9) │ │ │ │ +8C398 Flags 03 (3) 'Modification Access' │ │ │ │ +8C399 Modification Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +8C39D Access Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +8C3A1 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +8C3A3 Length 000B (11) │ │ │ │ +8C3A5 Version 01 (1) │ │ │ │ +8C3A6 UID Size 04 (4) │ │ │ │ +8C3A7 UID 00000000 (0) │ │ │ │ +8C3AB GID Size 04 (4) │ │ │ │ +8C3AC GID 00000000 (0) │ │ │ │ +8C3B0 PAYLOAD │ │ │ │ + │ │ │ │ +8CD5D LOCAL HEADER #80 04034B50 (67324752) │ │ │ │ +8CD61 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +8CD62 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +8CD63 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +8CD65 Compression Method 0008 (8) 'Deflated' │ │ │ │ +8CD67 Modification Time 5C9B8587 (1553696135) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +8CD6B CRC F5E2129F (4125233823) │ │ │ │ +8CD6F Compressed Size 000016BC (5820) │ │ │ │ +8CD73 Uncompressed Size 000016CD (5837) │ │ │ │ +8CD77 Filename Length 0015 (21) │ │ │ │ +8CD79 Extra Length 001C (28) │ │ │ │ +8CD7B Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x8CD7B: Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +8CD90 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +8CD92 Length 0009 (9) │ │ │ │ +8CD94 Flags 03 (3) 'Modification Access' │ │ │ │ +8CD95 Modification Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +8CD99 Access Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +8CD9D Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +8CD9F Length 000B (11) │ │ │ │ +8CDA1 Version 01 (1) │ │ │ │ +8CDA2 UID Size 04 (4) │ │ │ │ +8CDA3 UID 00000000 (0) │ │ │ │ +8CDA7 GID Size 04 (4) │ │ │ │ +8CDA8 GID 00000000 (0) │ │ │ │ +8CDAC PAYLOAD │ │ │ │ + │ │ │ │ +8E468 LOCAL HEADER #81 04034B50 (67324752) │ │ │ │ +8E46C Extract Zip Spec 14 (20) '2.0' │ │ │ │ +8E46D Extract OS 00 (0) 'MS-DOS' │ │ │ │ +8E46E General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +8E470 Compression Method 0008 (8) 'Deflated' │ │ │ │ +8E472 Modification Time 5C9B8587 (1553696135) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +8E476 CRC F5E2129F (4125233823) │ │ │ │ +8E47A Compressed Size 000016BC (5820) │ │ │ │ +8E47E Uncompressed Size 000016CD (5837) │ │ │ │ +8E482 Filename Length 001C (28) │ │ │ │ +8E484 Extra Length 001C (28) │ │ │ │ +8E486 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x8E486: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +8E4A2 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +8E4A4 Length 0009 (9) │ │ │ │ +8E4A6 Flags 03 (3) 'Modification Access' │ │ │ │ +8E4A7 Modification Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +8E4AB Access Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +8E4AF Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +8E4B1 Length 000B (11) │ │ │ │ +8E4B3 Version 01 (1) │ │ │ │ +8E4B4 UID Size 04 (4) │ │ │ │ +8E4B5 UID 00000000 (0) │ │ │ │ +8E4B9 GID Size 04 (4) │ │ │ │ +8E4BA GID 00000000 (0) │ │ │ │ +8E4BE PAYLOAD │ │ │ │ + │ │ │ │ +8FB7A LOCAL HEADER #82 04034B50 (67324752) │ │ │ │ +8FB7E Extract Zip Spec 0A (10) '1.0' │ │ │ │ +8FB7F Extract OS 00 (0) 'MS-DOS' │ │ │ │ +8FB80 General Purpose Flag 0000 (0) │ │ │ │ +8FB82 Compression Method 0000 (0) 'Stored' │ │ │ │ +8FB84 Modification Time 5C9B8587 (1553696135) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +8FB88 CRC FC95F24B (4237685323) │ │ │ │ +8FB8C Compressed Size 00001B84 (7044) │ │ │ │ +8FB90 Uncompressed Size 00001B84 (7044) │ │ │ │ +8FB94 Filename Length 0016 (22) │ │ │ │ +8FB96 Extra Length 001C (28) │ │ │ │ +8FB98 Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x8FB98: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +8FBAE Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +8FBB0 Length 0009 (9) │ │ │ │ +8FBB2 Flags 03 (3) 'Modification Access' │ │ │ │ +8FBB3 Modification Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +8FBB7 Access Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +8FBBB Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +8FBBD Length 000B (11) │ │ │ │ +8FBBF Version 01 (1) │ │ │ │ +8FBC0 UID Size 04 (4) │ │ │ │ +8FBC1 UID 00000000 (0) │ │ │ │ +8FBC5 GID Size 04 (4) │ │ │ │ +8FBC6 GID 00000000 (0) │ │ │ │ +8FBCA PAYLOAD │ │ │ │ + │ │ │ │ +9174E LOCAL HEADER #83 04034B50 (67324752) │ │ │ │ +91752 Extract Zip Spec 0A (10) '1.0' │ │ │ │ +91753 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +91754 General Purpose Flag 0000 (0) │ │ │ │ +91756 Compression Method 0000 (0) 'Stored' │ │ │ │ +91758 Modification Time 5C9B8587 (1553696135) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9175C CRC D0D71F86 (3503759238) │ │ │ │ +91760 Compressed Size 00000B7B (2939) │ │ │ │ +91764 Uncompressed Size 00000B7B (2939) │ │ │ │ +91768 Filename Length 0016 (22) │ │ │ │ +9176A Extra Length 001C (28) │ │ │ │ +9176C Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9176C: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +91782 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +91784 Length 0009 (9) │ │ │ │ +91786 Flags 03 (3) 'Modification Access' │ │ │ │ +91787 Modification Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9178B Access Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9178F Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +91791 Length 000B (11) │ │ │ │ +91793 Version 01 (1) │ │ │ │ +91794 UID Size 04 (4) │ │ │ │ +91795 UID 00000000 (0) │ │ │ │ +91799 GID Size 04 (4) │ │ │ │ +9179A GID 00000000 (0) │ │ │ │ +9179E PAYLOAD │ │ │ │ + │ │ │ │ +92319 LOCAL HEADER #84 04034B50 (67324752) │ │ │ │ +9231D Extract Zip Spec 0A (10) '1.0' │ │ │ │ +9231E Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9231F General Purpose Flag 0000 (0) │ │ │ │ +92321 Compression Method 0000 (0) 'Stored' │ │ │ │ +92323 Modification Time 5C9B8587 (1553696135) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +92327 CRC FFF9C4D2 (4294558930) │ │ │ │ +9232B Compressed Size 0000138F (5007) │ │ │ │ +9232F Uncompressed Size 0000138F (5007) │ │ │ │ +92333 Filename Length 0016 (22) │ │ │ │ +92335 Extra Length 001C (28) │ │ │ │ +92337 Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x92337: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9234D Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9234F Length 0009 (9) │ │ │ │ +92351 Flags 03 (3) 'Modification Access' │ │ │ │ +92352 Modification Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +92356 Access Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9235A Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9235C Length 000B (11) │ │ │ │ +9235E Version 01 (1) │ │ │ │ +9235F UID Size 04 (4) │ │ │ │ +92360 UID 00000000 (0) │ │ │ │ +92364 GID Size 04 (4) │ │ │ │ +92365 GID 00000000 (0) │ │ │ │ +92369 PAYLOAD │ │ │ │ + │ │ │ │ +936F8 LOCAL HEADER #85 04034B50 (67324752) │ │ │ │ +936FC Extract Zip Spec 0A (10) '1.0' │ │ │ │ +936FD Extract OS 00 (0) 'MS-DOS' │ │ │ │ +936FE General Purpose Flag 0000 (0) │ │ │ │ +93700 Compression Method 0000 (0) 'Stored' │ │ │ │ +93702 Modification Time 5C9B8587 (1553696135) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +93706 CRC A1037E8E (2701360782) │ │ │ │ +9370A Compressed Size 0000145E (5214) │ │ │ │ +9370E Uncompressed Size 0000145E (5214) │ │ │ │ +93712 Filename Length 0016 (22) │ │ │ │ +93714 Extra Length 001C (28) │ │ │ │ +93716 Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x93716: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9372C Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9372E Length 0009 (9) │ │ │ │ +93730 Flags 03 (3) 'Modification Access' │ │ │ │ +93731 Modification Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +93735 Access Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +93739 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9373B Length 000B (11) │ │ │ │ +9373D Version 01 (1) │ │ │ │ +9373E UID Size 04 (4) │ │ │ │ +9373F UID 00000000 (0) │ │ │ │ +93743 GID Size 04 (4) │ │ │ │ +93744 GID 00000000 (0) │ │ │ │ +93748 PAYLOAD │ │ │ │ + │ │ │ │ +94BA6 LOCAL HEADER #86 04034B50 (67324752) │ │ │ │ +94BAA Extract Zip Spec 0A (10) '1.0' │ │ │ │ +94BAB Extract OS 00 (0) 'MS-DOS' │ │ │ │ +94BAC General Purpose Flag 0000 (0) │ │ │ │ +94BAE Compression Method 0000 (0) 'Stored' │ │ │ │ +94BB0 Modification Time 5C9B8587 (1553696135) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +94BB4 CRC 5E9E64F1 (1587438833) │ │ │ │ +94BB8 Compressed Size 000008EC (2284) │ │ │ │ +94BBC Uncompressed Size 000008EC (2284) │ │ │ │ +94BC0 Filename Length 0016 (22) │ │ │ │ +94BC2 Extra Length 001C (28) │ │ │ │ +94BC4 Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x94BC4: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +94BDA Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +94BDC Length 0009 (9) │ │ │ │ +94BDE Flags 03 (3) 'Modification Access' │ │ │ │ +94BDF Modification Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +94BE3 Access Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +94BE7 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +94BE9 Length 000B (11) │ │ │ │ +94BEB Version 01 (1) │ │ │ │ +94BEC UID Size 04 (4) │ │ │ │ +94BED UID 00000000 (0) │ │ │ │ +94BF1 GID Size 04 (4) │ │ │ │ +94BF2 GID 00000000 (0) │ │ │ │ +94BF6 PAYLOAD │ │ │ │ + │ │ │ │ +954E2 LOCAL HEADER #87 04034B50 (67324752) │ │ │ │ +954E6 Extract Zip Spec 0A (10) '1.0' │ │ │ │ +954E7 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +954E8 General Purpose Flag 0000 (0) │ │ │ │ +954EA Compression Method 0000 (0) 'Stored' │ │ │ │ +954EC Modification Time 5C9B8587 (1553696135) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +954F0 CRC 42E340AB (1122189483) │ │ │ │ +954F4 Compressed Size 00001F2E (7982) │ │ │ │ +954F8 Uncompressed Size 00001F2E (7982) │ │ │ │ +954FC Filename Length 001E (30) │ │ │ │ +954FE Extra Length 001C (28) │ │ │ │ +95500 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x95500: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9551E Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +95520 Length 0009 (9) │ │ │ │ +95522 Flags 03 (3) 'Modification Access' │ │ │ │ +95523 Modification Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +95527 Access Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9552B Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9552D Length 000B (11) │ │ │ │ +9552F Version 01 (1) │ │ │ │ +95530 UID Size 04 (4) │ │ │ │ +95531 UID 00000000 (0) │ │ │ │ +95535 GID Size 04 (4) │ │ │ │ +95536 GID 00000000 (0) │ │ │ │ +9553A PAYLOAD │ │ │ │ + │ │ │ │ +97468 LOCAL HEADER #88 04034B50 (67324752) │ │ │ │ +9746C Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9746D Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9746E General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +97470 Compression Method 0008 (8) 'Deflated' │ │ │ │ +97472 Modification Time 5C9B8587 (1553696135) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +97476 CRC ED950F53 (3985968979) │ │ │ │ +9747A Compressed Size 00003D6C (15724) │ │ │ │ +9747E Uncompressed Size 0001664A (91722) │ │ │ │ +97482 Filename Length 001A (26) │ │ │ │ +97484 Extra Length 001C (28) │ │ │ │ +97486 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x97486: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +974A0 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +974A2 Length 0009 (9) │ │ │ │ +974A4 Flags 03 (3) 'Modification Access' │ │ │ │ +974A5 Modification Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +974A9 Access Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +974AD Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +974AF Length 000B (11) │ │ │ │ +974B1 Version 01 (1) │ │ │ │ +974B2 UID Size 04 (4) │ │ │ │ +974B3 UID 00000000 (0) │ │ │ │ +974B7 GID Size 04 (4) │ │ │ │ +974B8 GID 00000000 (0) │ │ │ │ +974BC PAYLOAD │ │ │ │ + │ │ │ │ +9B228 LOCAL HEADER #89 04034B50 (67324752) │ │ │ │ +9B22C Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9B22D Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9B22E General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9B230 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9B232 Modification Time 5C9B8587 (1553696135) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9B236 CRC DD44B1AE (3712266670) │ │ │ │ +9B23A Compressed Size 000029CE (10702) │ │ │ │ +9B23E Uncompressed Size 0000BB3A (47930) │ │ │ │ +9B242 Filename Length 0018 (24) │ │ │ │ +9B244 Extra Length 001C (28) │ │ │ │ +9B246 Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9B246: Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9B25E Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9B260 Length 0009 (9) │ │ │ │ +9B262 Flags 03 (3) 'Modification Access' │ │ │ │ +9B263 Modification Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9B267 Access Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9B26B Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9B26D Length 000B (11) │ │ │ │ +9B26F Version 01 (1) │ │ │ │ +9B270 UID Size 04 (4) │ │ │ │ +9B271 UID 00000000 (0) │ │ │ │ +9B275 GID Size 04 (4) │ │ │ │ +9B276 GID 00000000 (0) │ │ │ │ +9B27A PAYLOAD │ │ │ │ + │ │ │ │ +9DC48 LOCAL HEADER #90 04034B50 (67324752) │ │ │ │ +9DC4C Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9DC4D Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9DC4E General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9DC50 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9DC52 Modification Time 5C9B8587 (1553696135) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9DC56 CRC DCB3B516 (3702764822) │ │ │ │ +9DC5A Compressed Size 000000AE (174) │ │ │ │ +9DC5E Uncompressed Size 000000FC (252) │ │ │ │ +9DC62 Filename Length 0016 (22) │ │ │ │ +9DC64 Extra Length 001C (28) │ │ │ │ +9DC66 Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9DC66: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9DC7C Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9DC7E Length 0009 (9) │ │ │ │ +9DC80 Flags 03 (3) 'Modification Access' │ │ │ │ +9DC81 Modification Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9DC85 Access Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9DC89 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9DC8B Length 000B (11) │ │ │ │ +9DC8D Version 01 (1) │ │ │ │ +9DC8E UID Size 04 (4) │ │ │ │ +9DC8F UID 00000000 (0) │ │ │ │ +9DC93 GID Size 04 (4) │ │ │ │ +9DC94 GID 00000000 (0) │ │ │ │ +9DC98 PAYLOAD XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX │ │ │ │ XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX │ │ │ │ │ │ │ │ -9DD58 LOCAL HEADER #91 04034B50 (67324752) │ │ │ │ -9DD5C Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9DD5D Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9DD5E General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9DD60 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9DD62 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9DD66 CRC 58439733 (1480824627) │ │ │ │ -9DD6A Compressed Size 00000077 (119) │ │ │ │ -9DD6E Uncompressed Size 000000A2 (162) │ │ │ │ -9DD72 Filename Length 002D (45) │ │ │ │ -9DD74 Extra Length 001C (28) │ │ │ │ -9DD76 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9DD76: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9DDA3 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9DDA5 Length 0009 (9) │ │ │ │ -9DDA7 Flags 03 (3) 'Modification Access' │ │ │ │ -9DDA8 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9DDAC Access Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9DDB0 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9DDB2 Length 000B (11) │ │ │ │ -9DDB4 Version 01 (1) │ │ │ │ -9DDB5 UID Size 04 (4) │ │ │ │ -9DDB6 UID 00000000 (0) │ │ │ │ -9DDBA GID Size 04 (4) │ │ │ │ -9DDBB GID 00000000 (0) │ │ │ │ -9DDBF PAYLOAD XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX │ │ │ │ - │ │ │ │ -9DE36 CENTRAL HEADER #1 02014B50 (33639248) │ │ │ │ -9DE3A Created Zip Spec 3D (61) '6.1' │ │ │ │ -9DE3B Created OS 03 (3) 'Unix' │ │ │ │ -9DE3C Extract Zip Spec 0A (10) '1.0' │ │ │ │ -9DE3D Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9DE3E General Purpose Flag 0000 (0) │ │ │ │ -9DE40 Compression Method 0000 (0) 'Stored' │ │ │ │ -9DE42 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9DE46 CRC 2CAB616F (749429103) │ │ │ │ -9DE4A Compressed Size 00000014 (20) │ │ │ │ -9DE4E Uncompressed Size 00000014 (20) │ │ │ │ -9DE52 Filename Length 0008 (8) │ │ │ │ -9DE54 Extra Length 0018 (24) │ │ │ │ -9DE56 Comment Length 0000 (0) │ │ │ │ -9DE58 Disk Start 0000 (0) │ │ │ │ -9DE5A Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9DE5C Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9DE60 Local Header Offset 00000000 (0) │ │ │ │ -9DE64 Filename 'XXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9DE64: Filename 'XXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9DE6C Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9DE6E Length 0005 (5) │ │ │ │ -9DE70 Flags 01 (1) 'Modification' │ │ │ │ -9DE71 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9DE75 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9DE77 Length 000B (11) │ │ │ │ -9DE79 Version 01 (1) │ │ │ │ -9DE7A UID Size 04 (4) │ │ │ │ -9DE7B UID 00000000 (0) │ │ │ │ -9DE7F GID Size 04 (4) │ │ │ │ -9DE80 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9DE84 CENTRAL HEADER #2 02014B50 (33639248) │ │ │ │ -9DE88 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9DE89 Created OS 03 (3) 'Unix' │ │ │ │ -9DE8A Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9DE8B Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9DE8C General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9DE8E Compression Method 0008 (8) 'Deflated' │ │ │ │ -9DE90 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9DE94 CRC AC138643 (2886960707) │ │ │ │ -9DE98 Compressed Size 000015AD (5549) │ │ │ │ -9DE9C Uncompressed Size 00004603 (17923) │ │ │ │ -9DEA0 Filename Length 0014 (20) │ │ │ │ -9DEA2 Extra Length 0018 (24) │ │ │ │ -9DEA4 Comment Length 0000 (0) │ │ │ │ -9DEA6 Disk Start 0000 (0) │ │ │ │ -9DEA8 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9DEAA Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9DEAE Local Header Offset 00000056 (86) │ │ │ │ -9DEB2 Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9DEB2: Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9DEC6 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9DEC8 Length 0005 (5) │ │ │ │ -9DECA Flags 01 (1) 'Modification' │ │ │ │ -9DECB Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9DECF Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9DED1 Length 000B (11) │ │ │ │ -9DED3 Version 01 (1) │ │ │ │ -9DED4 UID Size 04 (4) │ │ │ │ -9DED5 UID 00000000 (0) │ │ │ │ -9DED9 GID Size 04 (4) │ │ │ │ -9DEDA GID 00000000 (0) │ │ │ │ - │ │ │ │ -9DEDE CENTRAL HEADER #3 02014B50 (33639248) │ │ │ │ -9DEE2 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9DEE3 Created OS 03 (3) 'Unix' │ │ │ │ -9DEE4 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9DEE5 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9DEE6 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9DEE8 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9DEEA Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9DEEE CRC 02C7C4B0 (46646448) │ │ │ │ -9DEF2 Compressed Size 000006D6 (1750) │ │ │ │ -9DEF6 Uncompressed Size 00001242 (4674) │ │ │ │ -9DEFA Filename Length 0013 (19) │ │ │ │ -9DEFC Extra Length 0018 (24) │ │ │ │ -9DEFE Comment Length 0000 (0) │ │ │ │ -9DF00 Disk Start 0000 (0) │ │ │ │ -9DF02 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9DF04 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9DF08 Local Header Offset 00001651 (5713) │ │ │ │ -9DF0C Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9DF0C: Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9DF1F Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9DF21 Length 0005 (5) │ │ │ │ -9DF23 Flags 01 (1) 'Modification' │ │ │ │ -9DF24 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9DF28 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9DF2A Length 000B (11) │ │ │ │ -9DF2C Version 01 (1) │ │ │ │ -9DF2D UID Size 04 (4) │ │ │ │ -9DF2E UID 00000000 (0) │ │ │ │ -9DF32 GID Size 04 (4) │ │ │ │ -9DF33 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9DF37 CENTRAL HEADER #4 02014B50 (33639248) │ │ │ │ -9DF3B Created Zip Spec 3D (61) '6.1' │ │ │ │ -9DF3C Created OS 03 (3) 'Unix' │ │ │ │ -9DF3D Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9DF3E Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9DF3F General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9DF41 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9DF43 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9DF47 CRC 5AAA010F (1521090831) │ │ │ │ -9DF4B Compressed Size 00002DA6 (11686) │ │ │ │ -9DF4F Uncompressed Size 0000D0C0 (53440) │ │ │ │ -9DF53 Filename Length 0014 (20) │ │ │ │ -9DF55 Extra Length 0018 (24) │ │ │ │ -9DF57 Comment Length 0000 (0) │ │ │ │ -9DF59 Disk Start 0000 (0) │ │ │ │ -9DF5B Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9DF5D Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9DF61 Local Header Offset 00001D74 (7540) │ │ │ │ -9DF65 Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9DF65: Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9DF79 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9DF7B Length 0005 (5) │ │ │ │ -9DF7D Flags 01 (1) 'Modification' │ │ │ │ -9DF7E Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9DF82 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9DF84 Length 000B (11) │ │ │ │ -9DF86 Version 01 (1) │ │ │ │ -9DF87 UID Size 04 (4) │ │ │ │ -9DF88 UID 00000000 (0) │ │ │ │ -9DF8C GID Size 04 (4) │ │ │ │ -9DF8D GID 00000000 (0) │ │ │ │ - │ │ │ │ -9DF91 CENTRAL HEADER #5 02014B50 (33639248) │ │ │ │ -9DF95 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9DF96 Created OS 03 (3) 'Unix' │ │ │ │ -9DF97 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9DF98 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9DF99 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9DF9B Compression Method 0008 (8) 'Deflated' │ │ │ │ -9DF9D Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9DFA1 CRC 701446B8 (1880377016) │ │ │ │ -9DFA5 Compressed Size 000003F1 (1009) │ │ │ │ -9DFA9 Uncompressed Size 00000877 (2167) │ │ │ │ -9DFAD Filename Length 0014 (20) │ │ │ │ -9DFAF Extra Length 0018 (24) │ │ │ │ -9DFB1 Comment Length 0000 (0) │ │ │ │ -9DFB3 Disk Start 0000 (0) │ │ │ │ -9DFB5 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9DFB7 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9DFBB Local Header Offset 00004B68 (19304) │ │ │ │ -9DFBF Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9DFBF: Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9DFD3 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9DFD5 Length 0005 (5) │ │ │ │ -9DFD7 Flags 01 (1) 'Modification' │ │ │ │ -9DFD8 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9DFDC Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9DFDE Length 000B (11) │ │ │ │ -9DFE0 Version 01 (1) │ │ │ │ -9DFE1 UID Size 04 (4) │ │ │ │ -9DFE2 UID 00000000 (0) │ │ │ │ -9DFE6 GID Size 04 (4) │ │ │ │ -9DFE7 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9DFEB CENTRAL HEADER #6 02014B50 (33639248) │ │ │ │ -9DFEF Created Zip Spec 3D (61) '6.1' │ │ │ │ -9DFF0 Created OS 03 (3) 'Unix' │ │ │ │ -9DFF1 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9DFF2 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9DFF3 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9DFF5 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9DFF7 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9DFFB CRC 8666CBE3 (2254883811) │ │ │ │ -9DFFF Compressed Size 000001AF (431) │ │ │ │ -9E003 Uncompressed Size 000002FE (766) │ │ │ │ -9E007 Filename Length 0011 (17) │ │ │ │ -9E009 Extra Length 0018 (24) │ │ │ │ -9E00B Comment Length 0000 (0) │ │ │ │ -9E00D Disk Start 0000 (0) │ │ │ │ -9E00F Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9E011 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9E015 Local Header Offset 00004FA7 (20391) │ │ │ │ -9E019 Filename 'XXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9E019: Filename 'XXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9E02A Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9E02C Length 0005 (5) │ │ │ │ -9E02E Flags 01 (1) 'Modification' │ │ │ │ -9E02F Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9E033 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9E035 Length 000B (11) │ │ │ │ -9E037 Version 01 (1) │ │ │ │ -9E038 UID Size 04 (4) │ │ │ │ -9E039 UID 00000000 (0) │ │ │ │ -9E03D GID Size 04 (4) │ │ │ │ -9E03E GID 00000000 (0) │ │ │ │ - │ │ │ │ -9E042 CENTRAL HEADER #7 02014B50 (33639248) │ │ │ │ -9E046 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9E047 Created OS 03 (3) 'Unix' │ │ │ │ -9E048 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9E049 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9E04A General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9E04C Compression Method 0008 (8) 'Deflated' │ │ │ │ -9E04E Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9E052 CRC FB649512 (4217672978) │ │ │ │ -9E056 Compressed Size 000020C5 (8389) │ │ │ │ -9E05A Uncompressed Size 0000B4B1 (46257) │ │ │ │ -9E05E Filename Length 001B (27) │ │ │ │ -9E060 Extra Length 0018 (24) │ │ │ │ -9E062 Comment Length 0000 (0) │ │ │ │ -9E064 Disk Start 0000 (0) │ │ │ │ -9E066 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9E068 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9E06C Local Header Offset 000051A1 (20897) │ │ │ │ -9E070 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9E070: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9E08B Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9E08D Length 0005 (5) │ │ │ │ -9E08F Flags 01 (1) 'Modification' │ │ │ │ -9E090 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9E094 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9E096 Length 000B (11) │ │ │ │ -9E098 Version 01 (1) │ │ │ │ -9E099 UID Size 04 (4) │ │ │ │ -9E09A UID 00000000 (0) │ │ │ │ -9E09E GID Size 04 (4) │ │ │ │ -9E09F GID 00000000 (0) │ │ │ │ - │ │ │ │ -9E0A3 CENTRAL HEADER #8 02014B50 (33639248) │ │ │ │ -9E0A7 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9E0A8 Created OS 03 (3) 'Unix' │ │ │ │ -9E0A9 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9E0AA Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9E0AB General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9E0AD Compression Method 0008 (8) 'Deflated' │ │ │ │ -9E0AF Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9E0B3 CRC 6A77DB59 (1786239833) │ │ │ │ -9E0B7 Compressed Size 00000E70 (3696) │ │ │ │ -9E0BB Uncompressed Size 000030B3 (12467) │ │ │ │ -9E0BF Filename Length 001D (29) │ │ │ │ -9E0C1 Extra Length 0018 (24) │ │ │ │ -9E0C3 Comment Length 0000 (0) │ │ │ │ -9E0C5 Disk Start 0000 (0) │ │ │ │ -9E0C7 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9E0C9 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9E0CD Local Header Offset 000072BB (29371) │ │ │ │ -9E0D1 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9E0D1: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9E0EE Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9E0F0 Length 0005 (5) │ │ │ │ -9E0F2 Flags 01 (1) 'Modification' │ │ │ │ -9E0F3 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9E0F7 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9E0F9 Length 000B (11) │ │ │ │ -9E0FB Version 01 (1) │ │ │ │ -9E0FC UID Size 04 (4) │ │ │ │ -9E0FD UID 00000000 (0) │ │ │ │ -9E101 GID Size 04 (4) │ │ │ │ -9E102 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9E106 CENTRAL HEADER #9 02014B50 (33639248) │ │ │ │ -9E10A Created Zip Spec 3D (61) '6.1' │ │ │ │ -9E10B Created OS 03 (3) 'Unix' │ │ │ │ -9E10C Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9E10D Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9E10E General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9E110 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9E112 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9E116 CRC FEBE631B (4273890075) │ │ │ │ -9E11A Compressed Size 00000973 (2419) │ │ │ │ -9E11E Uncompressed Size 00001CB3 (7347) │ │ │ │ -9E122 Filename Length 0019 (25) │ │ │ │ -9E124 Extra Length 0018 (24) │ │ │ │ -9E126 Comment Length 0000 (0) │ │ │ │ -9E128 Disk Start 0000 (0) │ │ │ │ -9E12A Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9E12C Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9E130 Local Header Offset 00008182 (33154) │ │ │ │ -9E134 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9E134: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9E14D Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9E14F Length 0005 (5) │ │ │ │ -9E151 Flags 01 (1) 'Modification' │ │ │ │ -9E152 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9E156 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9E158 Length 000B (11) │ │ │ │ -9E15A Version 01 (1) │ │ │ │ -9E15B UID Size 04 (4) │ │ │ │ -9E15C UID 00000000 (0) │ │ │ │ -9E160 GID Size 04 (4) │ │ │ │ -9E161 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9E165 CENTRAL HEADER #10 02014B50 (33639248) │ │ │ │ -9E169 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9E16A Created OS 03 (3) 'Unix' │ │ │ │ -9E16B Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9E16C Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9E16D General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9E16F Compression Method 0008 (8) 'Deflated' │ │ │ │ -9E171 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9E175 CRC 92805732 (2457884466) │ │ │ │ -9E179 Compressed Size 0000387D (14461) │ │ │ │ -9E17D Uncompressed Size 0000F7F5 (63477) │ │ │ │ -9E181 Filename Length 0015 (21) │ │ │ │ -9E183 Extra Length 0018 (24) │ │ │ │ -9E185 Comment Length 0000 (0) │ │ │ │ -9E187 Disk Start 0000 (0) │ │ │ │ -9E189 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9E18B Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9E18F Local Header Offset 00008B48 (35656) │ │ │ │ -9E193 Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9E193: Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9E1A8 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9E1AA Length 0005 (5) │ │ │ │ -9E1AC Flags 01 (1) 'Modification' │ │ │ │ -9E1AD Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9E1B1 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9E1B3 Length 000B (11) │ │ │ │ -9E1B5 Version 01 (1) │ │ │ │ -9E1B6 UID Size 04 (4) │ │ │ │ -9E1B7 UID 00000000 (0) │ │ │ │ -9E1BB GID Size 04 (4) │ │ │ │ -9E1BC GID 00000000 (0) │ │ │ │ - │ │ │ │ -9E1C0 CENTRAL HEADER #11 02014B50 (33639248) │ │ │ │ -9E1C4 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9E1C5 Created OS 03 (3) 'Unix' │ │ │ │ -9E1C6 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9E1C7 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9E1C8 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9E1CA Compression Method 0008 (8) 'Deflated' │ │ │ │ -9E1CC Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9E1D0 CRC 61281D0E (1630018830) │ │ │ │ -9E1D4 Compressed Size 0000AB01 (43777) │ │ │ │ -9E1D8 Uncompressed Size 0003E052 (254034) │ │ │ │ -9E1DC Filename Length 0012 (18) │ │ │ │ -9E1DE Extra Length 0018 (24) │ │ │ │ -9E1E0 Comment Length 0000 (0) │ │ │ │ -9E1E2 Disk Start 0000 (0) │ │ │ │ -9E1E4 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9E1E6 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9E1EA Local Header Offset 0000C414 (50196) │ │ │ │ -9E1EE Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9E1EE: Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9E200 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9E202 Length 0005 (5) │ │ │ │ -9E204 Flags 01 (1) 'Modification' │ │ │ │ -9E205 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9E209 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9E20B Length 000B (11) │ │ │ │ -9E20D Version 01 (1) │ │ │ │ -9E20E UID Size 04 (4) │ │ │ │ -9E20F UID 00000000 (0) │ │ │ │ -9E213 GID Size 04 (4) │ │ │ │ -9E214 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9E218 CENTRAL HEADER #12 02014B50 (33639248) │ │ │ │ -9E21C Created Zip Spec 3D (61) '6.1' │ │ │ │ -9E21D Created OS 03 (3) 'Unix' │ │ │ │ -9E21E Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9E21F Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9E220 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9E222 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9E224 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9E228 CRC 26BAED81 (649784705) │ │ │ │ -9E22C Compressed Size 00003B07 (15111) │ │ │ │ -9E230 Uncompressed Size 0001B46D (111725) │ │ │ │ -9E234 Filename Length 0015 (21) │ │ │ │ -9E236 Extra Length 0018 (24) │ │ │ │ -9E238 Comment Length 0000 (0) │ │ │ │ -9E23A Disk Start 0000 (0) │ │ │ │ -9E23C Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9E23E Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9E242 Local Header Offset 00016F61 (94049) │ │ │ │ -9E246 Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9E246: Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9E25B Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9E25D Length 0005 (5) │ │ │ │ -9E25F Flags 01 (1) 'Modification' │ │ │ │ -9E260 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9E264 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9E266 Length 000B (11) │ │ │ │ -9E268 Version 01 (1) │ │ │ │ -9E269 UID Size 04 (4) │ │ │ │ -9E26A UID 00000000 (0) │ │ │ │ -9E26E GID Size 04 (4) │ │ │ │ -9E26F GID 00000000 (0) │ │ │ │ - │ │ │ │ -9E273 CENTRAL HEADER #13 02014B50 (33639248) │ │ │ │ -9E277 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9E278 Created OS 03 (3) 'Unix' │ │ │ │ -9E279 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9E27A Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9E27B General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9E27D Compression Method 0008 (8) 'Deflated' │ │ │ │ -9E27F Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9E283 CRC F477CF64 (4101492580) │ │ │ │ -9E287 Compressed Size 0000918E (37262) │ │ │ │ -9E28B Uncompressed Size 0003D596 (251286) │ │ │ │ -9E28F Filename Length 0014 (20) │ │ │ │ -9E291 Extra Length 0018 (24) │ │ │ │ -9E293 Comment Length 0000 (0) │ │ │ │ -9E295 Disk Start 0000 (0) │ │ │ │ -9E297 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9E299 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9E29D Local Header Offset 0001AAB7 (109239) │ │ │ │ -9E2A1 Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9E2A1: Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9E2B5 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9E2B7 Length 0005 (5) │ │ │ │ -9E2B9 Flags 01 (1) 'Modification' │ │ │ │ -9E2BA Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9E2BE Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9E2C0 Length 000B (11) │ │ │ │ -9E2C2 Version 01 (1) │ │ │ │ -9E2C3 UID Size 04 (4) │ │ │ │ -9E2C4 UID 00000000 (0) │ │ │ │ -9E2C8 GID Size 04 (4) │ │ │ │ -9E2C9 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9E2CD CENTRAL HEADER #14 02014B50 (33639248) │ │ │ │ -9E2D1 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9E2D2 Created OS 03 (3) 'Unix' │ │ │ │ -9E2D3 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9E2D4 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9E2D5 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9E2D7 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9E2D9 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9E2DD CRC E4DF2C3D (3839831101) │ │ │ │ -9E2E1 Compressed Size 00002A67 (10855) │ │ │ │ -9E2E5 Uncompressed Size 00011520 (70944) │ │ │ │ -9E2E9 Filename Length 0016 (22) │ │ │ │ -9E2EB Extra Length 0018 (24) │ │ │ │ -9E2ED Comment Length 0000 (0) │ │ │ │ -9E2EF Disk Start 0000 (0) │ │ │ │ -9E2F1 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9E2F3 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9E2F7 Local Header Offset 00023C93 (146579) │ │ │ │ -9E2FB Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9E2FB: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9E311 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9E313 Length 0005 (5) │ │ │ │ -9E315 Flags 01 (1) 'Modification' │ │ │ │ -9E316 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9E31A Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9E31C Length 000B (11) │ │ │ │ -9E31E Version 01 (1) │ │ │ │ -9E31F UID Size 04 (4) │ │ │ │ -9E320 UID 00000000 (0) │ │ │ │ -9E324 GID Size 04 (4) │ │ │ │ -9E325 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9E329 CENTRAL HEADER #15 02014B50 (33639248) │ │ │ │ -9E32D Created Zip Spec 3D (61) '6.1' │ │ │ │ -9E32E Created OS 03 (3) 'Unix' │ │ │ │ -9E32F Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9E330 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9E331 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9E333 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9E335 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9E339 CRC 3F278541 (1059554625) │ │ │ │ -9E33D Compressed Size 000014DB (5339) │ │ │ │ -9E341 Uncompressed Size 0000518E (20878) │ │ │ │ -9E345 Filename Length 001D (29) │ │ │ │ -9E347 Extra Length 0018 (24) │ │ │ │ -9E349 Comment Length 0000 (0) │ │ │ │ -9E34B Disk Start 0000 (0) │ │ │ │ -9E34D Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9E34F Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9E353 Local Header Offset 0002674A (157514) │ │ │ │ -9E357 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9E357: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9E374 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9E376 Length 0005 (5) │ │ │ │ -9E378 Flags 01 (1) 'Modification' │ │ │ │ -9E379 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9E37D Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9E37F Length 000B (11) │ │ │ │ -9E381 Version 01 (1) │ │ │ │ -9E382 UID Size 04 (4) │ │ │ │ -9E383 UID 00000000 (0) │ │ │ │ -9E387 GID Size 04 (4) │ │ │ │ -9E388 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9E38C CENTRAL HEADER #16 02014B50 (33639248) │ │ │ │ -9E390 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9E391 Created OS 03 (3) 'Unix' │ │ │ │ -9E392 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9E393 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9E394 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9E396 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9E398 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9E39C CRC F4CD7EBA (4107108026) │ │ │ │ -9E3A0 Compressed Size 0000380C (14348) │ │ │ │ -9E3A4 Uncompressed Size 0000EA4D (59981) │ │ │ │ -9E3A8 Filename Length 001C (28) │ │ │ │ -9E3AA Extra Length 0018 (24) │ │ │ │ -9E3AC Comment Length 0000 (0) │ │ │ │ -9E3AE Disk Start 0000 (0) │ │ │ │ -9E3B0 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9E3B2 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9E3B6 Local Header Offset 00027C7C (162940) │ │ │ │ -9E3BA Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9E3BA: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9E3D6 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9E3D8 Length 0005 (5) │ │ │ │ -9E3DA Flags 01 (1) 'Modification' │ │ │ │ -9E3DB Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9E3DF Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9E3E1 Length 000B (11) │ │ │ │ -9E3E3 Version 01 (1) │ │ │ │ -9E3E4 UID Size 04 (4) │ │ │ │ -9E3E5 UID 00000000 (0) │ │ │ │ -9E3E9 GID Size 04 (4) │ │ │ │ -9E3EA GID 00000000 (0) │ │ │ │ - │ │ │ │ -9E3EE CENTRAL HEADER #17 02014B50 (33639248) │ │ │ │ -9E3F2 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9E3F3 Created OS 03 (3) 'Unix' │ │ │ │ -9E3F4 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9E3F5 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9E3F6 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9E3F8 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9E3FA Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9E3FE CRC BF5A452D (3210364205) │ │ │ │ -9E402 Compressed Size 000006A2 (1698) │ │ │ │ -9E406 Uncompressed Size 000011F5 (4597) │ │ │ │ -9E40A Filename Length 001C (28) │ │ │ │ -9E40C Extra Length 0018 (24) │ │ │ │ -9E40E Comment Length 0000 (0) │ │ │ │ -9E410 Disk Start 0000 (0) │ │ │ │ -9E412 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9E414 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9E418 Local Header Offset 0002B4DE (177374) │ │ │ │ -9E41C Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9E41C: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9E438 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9E43A Length 0005 (5) │ │ │ │ -9E43C Flags 01 (1) 'Modification' │ │ │ │ -9E43D Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9E441 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9E443 Length 000B (11) │ │ │ │ -9E445 Version 01 (1) │ │ │ │ -9E446 UID Size 04 (4) │ │ │ │ -9E447 UID 00000000 (0) │ │ │ │ -9E44B GID Size 04 (4) │ │ │ │ -9E44C GID 00000000 (0) │ │ │ │ - │ │ │ │ -9E450 CENTRAL HEADER #18 02014B50 (33639248) │ │ │ │ -9E454 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9E455 Created OS 03 (3) 'Unix' │ │ │ │ -9E456 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9E457 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9E458 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9E45A Compression Method 0008 (8) 'Deflated' │ │ │ │ -9E45C Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9E460 CRC 7905ED7B (2030431611) │ │ │ │ -9E464 Compressed Size 00001080 (4224) │ │ │ │ -9E468 Uncompressed Size 00004C00 (19456) │ │ │ │ -9E46C Filename Length 001B (27) │ │ │ │ -9E46E Extra Length 0018 (24) │ │ │ │ -9E470 Comment Length 0000 (0) │ │ │ │ -9E472 Disk Start 0000 (0) │ │ │ │ -9E474 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9E476 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9E47A Local Header Offset 0002BBD6 (179158) │ │ │ │ -9E47E Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9E47E: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9E499 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9E49B Length 0005 (5) │ │ │ │ -9E49D Flags 01 (1) 'Modification' │ │ │ │ -9E49E Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9E4A2 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9E4A4 Length 000B (11) │ │ │ │ -9E4A6 Version 01 (1) │ │ │ │ -9E4A7 UID Size 04 (4) │ │ │ │ -9E4A8 UID 00000000 (0) │ │ │ │ -9E4AC GID Size 04 (4) │ │ │ │ -9E4AD GID 00000000 (0) │ │ │ │ - │ │ │ │ -9E4B1 CENTRAL HEADER #19 02014B50 (33639248) │ │ │ │ -9E4B5 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9E4B6 Created OS 03 (3) 'Unix' │ │ │ │ -9E4B7 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9E4B8 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9E4B9 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9E4BB Compression Method 0008 (8) 'Deflated' │ │ │ │ -9E4BD Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9E4C1 CRC A8D0EAB1 (2832263857) │ │ │ │ -9E4C5 Compressed Size 000033AC (13228) │ │ │ │ -9E4C9 Uncompressed Size 0000BC95 (48277) │ │ │ │ -9E4CD Filename Length 001D (29) │ │ │ │ -9E4CF Extra Length 0018 (24) │ │ │ │ -9E4D1 Comment Length 0000 (0) │ │ │ │ -9E4D3 Disk Start 0000 (0) │ │ │ │ -9E4D5 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9E4D7 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9E4DB Local Header Offset 0002CCAB (183467) │ │ │ │ -9E4DF Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9E4DF: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9E4FC Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9E4FE Length 0005 (5) │ │ │ │ -9E500 Flags 01 (1) 'Modification' │ │ │ │ -9E501 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9E505 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9E507 Length 000B (11) │ │ │ │ -9E509 Version 01 (1) │ │ │ │ -9E50A UID Size 04 (4) │ │ │ │ -9E50B UID 00000000 (0) │ │ │ │ -9E50F GID Size 04 (4) │ │ │ │ -9E510 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9E514 CENTRAL HEADER #20 02014B50 (33639248) │ │ │ │ -9E518 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9E519 Created OS 03 (3) 'Unix' │ │ │ │ -9E51A Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9E51B Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9E51C General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9E51E Compression Method 0008 (8) 'Deflated' │ │ │ │ -9E520 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9E524 CRC 49B504F3 (1236600051) │ │ │ │ -9E528 Compressed Size 00000D6C (3436) │ │ │ │ -9E52C Uncompressed Size 0000388E (14478) │ │ │ │ -9E530 Filename Length 001D (29) │ │ │ │ -9E532 Extra Length 0018 (24) │ │ │ │ -9E534 Comment Length 0000 (0) │ │ │ │ -9E536 Disk Start 0000 (0) │ │ │ │ -9E538 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9E53A Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9E53E Local Header Offset 000300AE (196782) │ │ │ │ -9E542 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9E542: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9E55F Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9E561 Length 0005 (5) │ │ │ │ -9E563 Flags 01 (1) 'Modification' │ │ │ │ -9E564 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9E568 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9E56A Length 000B (11) │ │ │ │ -9E56C Version 01 (1) │ │ │ │ -9E56D UID Size 04 (4) │ │ │ │ -9E56E UID 00000000 (0) │ │ │ │ -9E572 GID Size 04 (4) │ │ │ │ -9E573 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9E577 CENTRAL HEADER #21 02014B50 (33639248) │ │ │ │ -9E57B Created Zip Spec 3D (61) '6.1' │ │ │ │ -9E57C Created OS 03 (3) 'Unix' │ │ │ │ -9E57D Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9E57E Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9E57F General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9E581 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9E583 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9E587 CRC 63C17846 (1673623622) │ │ │ │ -9E58B Compressed Size 00001C69 (7273) │ │ │ │ -9E58F Uncompressed Size 0000C187 (49543) │ │ │ │ -9E593 Filename Length 001A (26) │ │ │ │ -9E595 Extra Length 0018 (24) │ │ │ │ -9E597 Comment Length 0000 (0) │ │ │ │ -9E599 Disk Start 0000 (0) │ │ │ │ -9E59B Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9E59D Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9E5A1 Local Header Offset 00030E71 (200305) │ │ │ │ -9E5A5 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9E5A5: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9E5BF Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9E5C1 Length 0005 (5) │ │ │ │ -9E5C3 Flags 01 (1) 'Modification' │ │ │ │ -9E5C4 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9E5C8 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9E5CA Length 000B (11) │ │ │ │ -9E5CC Version 01 (1) │ │ │ │ -9E5CD UID Size 04 (4) │ │ │ │ -9E5CE UID 00000000 (0) │ │ │ │ -9E5D2 GID Size 04 (4) │ │ │ │ -9E5D3 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9E5D7 CENTRAL HEADER #22 02014B50 (33639248) │ │ │ │ -9E5DB Created Zip Spec 3D (61) '6.1' │ │ │ │ -9E5DC Created OS 03 (3) 'Unix' │ │ │ │ -9E5DD Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9E5DE Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9E5DF General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9E5E1 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9E5E3 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9E5E7 CRC FFC68C4A (4291202122) │ │ │ │ -9E5EB Compressed Size 000003A4 (932) │ │ │ │ -9E5EF Uncompressed Size 0000088F (2191) │ │ │ │ -9E5F3 Filename Length 0012 (18) │ │ │ │ -9E5F5 Extra Length 0018 (24) │ │ │ │ -9E5F7 Comment Length 0000 (0) │ │ │ │ -9E5F9 Disk Start 0000 (0) │ │ │ │ -9E5FB Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9E5FD Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9E601 Local Header Offset 00032B2E (207662) │ │ │ │ -9E605 Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9E605: Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9E617 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9E619 Length 0005 (5) │ │ │ │ -9E61B Flags 01 (1) 'Modification' │ │ │ │ -9E61C Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9E620 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9E622 Length 000B (11) │ │ │ │ -9E624 Version 01 (1) │ │ │ │ -9E625 UID Size 04 (4) │ │ │ │ -9E626 UID 00000000 (0) │ │ │ │ -9E62A GID Size 04 (4) │ │ │ │ -9E62B GID 00000000 (0) │ │ │ │ - │ │ │ │ -9E62F CENTRAL HEADER #23 02014B50 (33639248) │ │ │ │ -9E633 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9E634 Created OS 03 (3) 'Unix' │ │ │ │ -9E635 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9E636 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9E637 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9E639 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9E63B Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9E63F CRC 75B01EAE (1974476462) │ │ │ │ -9E643 Compressed Size 000001D4 (468) │ │ │ │ -9E647 Uncompressed Size 00000312 (786) │ │ │ │ -9E64B Filename Length 0020 (32) │ │ │ │ -9E64D Extra Length 0018 (24) │ │ │ │ -9E64F Comment Length 0000 (0) │ │ │ │ -9E651 Disk Start 0000 (0) │ │ │ │ -9E653 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9E655 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9E659 Local Header Offset 00032F1E (208670) │ │ │ │ -9E65D Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9E65D: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9E67D Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9E67F Length 0005 (5) │ │ │ │ -9E681 Flags 01 (1) 'Modification' │ │ │ │ -9E682 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9E686 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9E688 Length 000B (11) │ │ │ │ -9E68A Version 01 (1) │ │ │ │ -9E68B UID Size 04 (4) │ │ │ │ -9E68C UID 00000000 (0) │ │ │ │ -9E690 GID Size 04 (4) │ │ │ │ -9E691 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9E695 CENTRAL HEADER #24 02014B50 (33639248) │ │ │ │ -9E699 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9E69A Created OS 03 (3) 'Unix' │ │ │ │ -9E69B Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9E69C Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9E69D General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9E69F Compression Method 0008 (8) 'Deflated' │ │ │ │ -9E6A1 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9E6A5 CRC 897859D5 (2306365909) │ │ │ │ -9E6A9 Compressed Size 000017A7 (6055) │ │ │ │ -9E6AD Uncompressed Size 00009D19 (40217) │ │ │ │ -9E6B1 Filename Length 001B (27) │ │ │ │ -9E6B3 Extra Length 0018 (24) │ │ │ │ -9E6B5 Comment Length 0000 (0) │ │ │ │ -9E6B7 Disk Start 0000 (0) │ │ │ │ -9E6B9 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9E6BB Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9E6BF Local Header Offset 0003314C (209228) │ │ │ │ -9E6C3 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9E6C3: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9E6DE Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9E6E0 Length 0005 (5) │ │ │ │ -9E6E2 Flags 01 (1) 'Modification' │ │ │ │ -9E6E3 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9E6E7 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9E6E9 Length 000B (11) │ │ │ │ -9E6EB Version 01 (1) │ │ │ │ -9E6EC UID Size 04 (4) │ │ │ │ -9E6ED UID 00000000 (0) │ │ │ │ -9E6F1 GID Size 04 (4) │ │ │ │ -9E6F2 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9E6F6 CENTRAL HEADER #25 02014B50 (33639248) │ │ │ │ -9E6FA Created Zip Spec 3D (61) '6.1' │ │ │ │ -9E6FB Created OS 03 (3) 'Unix' │ │ │ │ -9E6FC Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9E6FD Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9E6FE General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9E700 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9E702 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9E706 CRC AA7532E3 (2859807459) │ │ │ │ -9E70A Compressed Size 00001373 (4979) │ │ │ │ -9E70E Uncompressed Size 00003B67 (15207) │ │ │ │ -9E712 Filename Length 0015 (21) │ │ │ │ -9E714 Extra Length 0018 (24) │ │ │ │ -9E716 Comment Length 0000 (0) │ │ │ │ -9E718 Disk Start 0000 (0) │ │ │ │ -9E71A Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9E71C Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9E720 Local Header Offset 00034948 (215368) │ │ │ │ -9E724 Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9E724: Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9E739 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9E73B Length 0005 (5) │ │ │ │ -9E73D Flags 01 (1) 'Modification' │ │ │ │ -9E73E Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9E742 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9E744 Length 000B (11) │ │ │ │ -9E746 Version 01 (1) │ │ │ │ -9E747 UID Size 04 (4) │ │ │ │ -9E748 UID 00000000 (0) │ │ │ │ -9E74C GID Size 04 (4) │ │ │ │ -9E74D GID 00000000 (0) │ │ │ │ - │ │ │ │ -9E751 CENTRAL HEADER #26 02014B50 (33639248) │ │ │ │ -9E755 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9E756 Created OS 03 (3) 'Unix' │ │ │ │ -9E757 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9E758 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9E759 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9E75B Compression Method 0008 (8) 'Deflated' │ │ │ │ -9E75D Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9E761 CRC 3F4BD8A9 (1061935273) │ │ │ │ -9E765 Compressed Size 00000AD3 (2771) │ │ │ │ -9E769 Uncompressed Size 00002136 (8502) │ │ │ │ -9E76D Filename Length 0011 (17) │ │ │ │ -9E76F Extra Length 0018 (24) │ │ │ │ -9E771 Comment Length 0000 (0) │ │ │ │ -9E773 Disk Start 0000 (0) │ │ │ │ -9E775 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9E777 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9E77B Local Header Offset 00035D0A (220426) │ │ │ │ -9E77F Filename 'XXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9E77F: Filename 'XXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9E790 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9E792 Length 0005 (5) │ │ │ │ -9E794 Flags 01 (1) 'Modification' │ │ │ │ -9E795 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9E799 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9E79B Length 000B (11) │ │ │ │ -9E79D Version 01 (1) │ │ │ │ -9E79E UID Size 04 (4) │ │ │ │ -9E79F UID 00000000 (0) │ │ │ │ -9E7A3 GID Size 04 (4) │ │ │ │ -9E7A4 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9E7A8 CENTRAL HEADER #27 02014B50 (33639248) │ │ │ │ -9E7AC Created Zip Spec 3D (61) '6.1' │ │ │ │ -9E7AD Created OS 03 (3) 'Unix' │ │ │ │ -9E7AE Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9E7AF Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9E7B0 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9E7B2 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9E7B4 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9E7B8 CRC AA8AD019 (2861223961) │ │ │ │ -9E7BC Compressed Size 000003FE (1022) │ │ │ │ -9E7C0 Uncompressed Size 00000F0D (3853) │ │ │ │ -9E7C4 Filename Length 0014 (20) │ │ │ │ -9E7C6 Extra Length 0018 (24) │ │ │ │ -9E7C8 Comment Length 0000 (0) │ │ │ │ -9E7CA Disk Start 0000 (0) │ │ │ │ -9E7CC Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9E7CE Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9E7D2 Local Header Offset 00036828 (223272) │ │ │ │ -9E7D6 Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9E7D6: Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9E7EA Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9E7EC Length 0005 (5) │ │ │ │ -9E7EE Flags 01 (1) 'Modification' │ │ │ │ -9E7EF Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9E7F3 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9E7F5 Length 000B (11) │ │ │ │ -9E7F7 Version 01 (1) │ │ │ │ -9E7F8 UID Size 04 (4) │ │ │ │ -9E7F9 UID 00000000 (0) │ │ │ │ -9E7FD GID Size 04 (4) │ │ │ │ -9E7FE GID 00000000 (0) │ │ │ │ - │ │ │ │ -9E802 CENTRAL HEADER #28 02014B50 (33639248) │ │ │ │ -9E806 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9E807 Created OS 03 (3) 'Unix' │ │ │ │ -9E808 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9E809 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9E80A General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9E80C Compression Method 0008 (8) 'Deflated' │ │ │ │ -9E80E Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9E812 CRC 2177E3D4 (561505236) │ │ │ │ -9E816 Compressed Size 00001263 (4707) │ │ │ │ -9E81A Uncompressed Size 0000346A (13418) │ │ │ │ -9E81E Filename Length 0014 (20) │ │ │ │ -9E820 Extra Length 0018 (24) │ │ │ │ -9E822 Comment Length 0000 (0) │ │ │ │ -9E824 Disk Start 0000 (0) │ │ │ │ -9E826 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9E828 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9E82C Local Header Offset 00036C74 (224372) │ │ │ │ -9E830 Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9E830: Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9E844 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9E846 Length 0005 (5) │ │ │ │ -9E848 Flags 01 (1) 'Modification' │ │ │ │ -9E849 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9E84D Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9E84F Length 000B (11) │ │ │ │ -9E851 Version 01 (1) │ │ │ │ -9E852 UID Size 04 (4) │ │ │ │ -9E853 UID 00000000 (0) │ │ │ │ -9E857 GID Size 04 (4) │ │ │ │ -9E858 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9E85C CENTRAL HEADER #29 02014B50 (33639248) │ │ │ │ -9E860 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9E861 Created OS 03 (3) 'Unix' │ │ │ │ -9E862 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9E863 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9E864 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9E866 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9E868 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9E86C CRC 5BE66E46 (1541828166) │ │ │ │ -9E870 Compressed Size 00000AD1 (2769) │ │ │ │ -9E874 Uncompressed Size 00002300 (8960) │ │ │ │ -9E878 Filename Length 001B (27) │ │ │ │ -9E87A Extra Length 0018 (24) │ │ │ │ -9E87C Comment Length 0000 (0) │ │ │ │ -9E87E Disk Start 0000 (0) │ │ │ │ -9E880 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9E882 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9E886 Local Header Offset 00037F25 (229157) │ │ │ │ -9E88A Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9E88A: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9E8A5 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9E8A7 Length 0005 (5) │ │ │ │ -9E8A9 Flags 01 (1) 'Modification' │ │ │ │ -9E8AA Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9E8AE Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9E8B0 Length 000B (11) │ │ │ │ -9E8B2 Version 01 (1) │ │ │ │ -9E8B3 UID Size 04 (4) │ │ │ │ -9E8B4 UID 00000000 (0) │ │ │ │ -9E8B8 GID Size 04 (4) │ │ │ │ -9E8B9 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9E8BD CENTRAL HEADER #30 02014B50 (33639248) │ │ │ │ -9E8C1 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9E8C2 Created OS 03 (3) 'Unix' │ │ │ │ -9E8C3 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9E8C4 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9E8C5 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9E8C7 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9E8C9 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9E8CD CRC 45B42DB7 (1169436087) │ │ │ │ -9E8D1 Compressed Size 00000A8F (2703) │ │ │ │ -9E8D5 Uncompressed Size 0000237B (9083) │ │ │ │ -9E8D9 Filename Length 0013 (19) │ │ │ │ -9E8DB Extra Length 0018 (24) │ │ │ │ -9E8DD Comment Length 0000 (0) │ │ │ │ -9E8DF Disk Start 0000 (0) │ │ │ │ -9E8E1 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9E8E3 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9E8E7 Local Header Offset 00038A4B (232011) │ │ │ │ -9E8EB Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9E8EB: Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9E8FE Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9E900 Length 0005 (5) │ │ │ │ -9E902 Flags 01 (1) 'Modification' │ │ │ │ -9E903 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9E907 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9E909 Length 000B (11) │ │ │ │ -9E90B Version 01 (1) │ │ │ │ -9E90C UID Size 04 (4) │ │ │ │ -9E90D UID 00000000 (0) │ │ │ │ -9E911 GID Size 04 (4) │ │ │ │ -9E912 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9E916 CENTRAL HEADER #31 02014B50 (33639248) │ │ │ │ -9E91A Created Zip Spec 3D (61) '6.1' │ │ │ │ -9E91B Created OS 03 (3) 'Unix' │ │ │ │ -9E91C Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9E91D Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9E91E General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9E920 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9E922 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9E926 CRC 3291086B (848365675) │ │ │ │ -9E92A Compressed Size 00000F4B (3915) │ │ │ │ -9E92E Uncompressed Size 00003737 (14135) │ │ │ │ -9E932 Filename Length 000F (15) │ │ │ │ -9E934 Extra Length 0018 (24) │ │ │ │ -9E936 Comment Length 0000 (0) │ │ │ │ -9E938 Disk Start 0000 (0) │ │ │ │ -9E93A Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9E93C Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9E940 Local Header Offset 00039527 (234791) │ │ │ │ -9E944 Filename 'XXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9E944: Filename 'XXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9E953 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9E955 Length 0005 (5) │ │ │ │ -9E957 Flags 01 (1) 'Modification' │ │ │ │ -9E958 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9E95C Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9E95E Length 000B (11) │ │ │ │ -9E960 Version 01 (1) │ │ │ │ -9E961 UID Size 04 (4) │ │ │ │ -9E962 UID 00000000 (0) │ │ │ │ -9E966 GID Size 04 (4) │ │ │ │ -9E967 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9E96B CENTRAL HEADER #32 02014B50 (33639248) │ │ │ │ -9E96F Created Zip Spec 3D (61) '6.1' │ │ │ │ -9E970 Created OS 03 (3) 'Unix' │ │ │ │ -9E971 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9E972 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9E973 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9E975 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9E977 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9E97B CRC 3759BA2B (928627243) │ │ │ │ -9E97F Compressed Size 0000066B (1643) │ │ │ │ -9E983 Uncompressed Size 000018E0 (6368) │ │ │ │ -9E987 Filename Length 000F (15) │ │ │ │ -9E989 Extra Length 0018 (24) │ │ │ │ -9E98B Comment Length 0000 (0) │ │ │ │ -9E98D Disk Start 0000 (0) │ │ │ │ -9E98F Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9E991 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9E995 Local Header Offset 0003A4BB (238779) │ │ │ │ -9E999 Filename 'XXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9E999: Filename 'XXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9E9A8 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9E9AA Length 0005 (5) │ │ │ │ -9E9AC Flags 01 (1) 'Modification' │ │ │ │ -9E9AD Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9E9B1 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9E9B3 Length 000B (11) │ │ │ │ -9E9B5 Version 01 (1) │ │ │ │ -9E9B6 UID Size 04 (4) │ │ │ │ -9E9B7 UID 00000000 (0) │ │ │ │ -9E9BB GID Size 04 (4) │ │ │ │ -9E9BC GID 00000000 (0) │ │ │ │ - │ │ │ │ -9E9C0 CENTRAL HEADER #33 02014B50 (33639248) │ │ │ │ -9E9C4 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9E9C5 Created OS 03 (3) 'Unix' │ │ │ │ -9E9C6 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9E9C7 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9E9C8 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9E9CA Compression Method 0008 (8) 'Deflated' │ │ │ │ -9E9CC Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9E9D0 CRC 7A69714D (2053730637) │ │ │ │ -9E9D4 Compressed Size 00001A49 (6729) │ │ │ │ -9E9D8 Uncompressed Size 000064F3 (25843) │ │ │ │ -9E9DC Filename Length 0013 (19) │ │ │ │ -9E9DE Extra Length 0018 (24) │ │ │ │ -9E9E0 Comment Length 0000 (0) │ │ │ │ -9E9E2 Disk Start 0000 (0) │ │ │ │ -9E9E4 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9E9E6 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9E9EA Local Header Offset 0003AB6F (240495) │ │ │ │ -9E9EE Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9E9EE: Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9EA01 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9EA03 Length 0005 (5) │ │ │ │ -9EA05 Flags 01 (1) 'Modification' │ │ │ │ -9EA06 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9EA0A Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9EA0C Length 000B (11) │ │ │ │ -9EA0E Version 01 (1) │ │ │ │ -9EA0F UID Size 04 (4) │ │ │ │ -9EA10 UID 00000000 (0) │ │ │ │ -9EA14 GID Size 04 (4) │ │ │ │ -9EA15 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9EA19 CENTRAL HEADER #34 02014B50 (33639248) │ │ │ │ -9EA1D Created Zip Spec 3D (61) '6.1' │ │ │ │ -9EA1E Created OS 03 (3) 'Unix' │ │ │ │ -9EA1F Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9EA20 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9EA21 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9EA23 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9EA25 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9EA29 CRC 57156588 (1461020040) │ │ │ │ -9EA2D Compressed Size 000009A7 (2471) │ │ │ │ -9EA31 Uncompressed Size 00001B65 (7013) │ │ │ │ -9EA35 Filename Length 0010 (16) │ │ │ │ -9EA37 Extra Length 0018 (24) │ │ │ │ -9EA39 Comment Length 0000 (0) │ │ │ │ -9EA3B Disk Start 0000 (0) │ │ │ │ -9EA3D Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9EA3F Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9EA43 Local Header Offset 0003C605 (247301) │ │ │ │ -9EA47 Filename 'XXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9EA47: Filename 'XXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9EA57 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9EA59 Length 0005 (5) │ │ │ │ -9EA5B Flags 01 (1) 'Modification' │ │ │ │ -9EA5C Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9EA60 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9EA62 Length 000B (11) │ │ │ │ -9EA64 Version 01 (1) │ │ │ │ -9EA65 UID Size 04 (4) │ │ │ │ -9EA66 UID 00000000 (0) │ │ │ │ -9EA6A GID Size 04 (4) │ │ │ │ -9EA6B GID 00000000 (0) │ │ │ │ - │ │ │ │ -9EA6F CENTRAL HEADER #35 02014B50 (33639248) │ │ │ │ -9EA73 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9EA74 Created OS 03 (3) 'Unix' │ │ │ │ -9EA75 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9EA76 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9EA77 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9EA79 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9EA7B Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9EA7F CRC 2899E6E3 (681174755) │ │ │ │ -9EA83 Compressed Size 000006B8 (1720) │ │ │ │ -9EA87 Uncompressed Size 00001566 (5478) │ │ │ │ -9EA8B Filename Length 0012 (18) │ │ │ │ -9EA8D Extra Length 0018 (24) │ │ │ │ -9EA8F Comment Length 0000 (0) │ │ │ │ -9EA91 Disk Start 0000 (0) │ │ │ │ -9EA93 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9EA95 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9EA99 Local Header Offset 0003CFF6 (249846) │ │ │ │ -9EA9D Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9EA9D: Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9EAAF Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9EAB1 Length 0005 (5) │ │ │ │ -9EAB3 Flags 01 (1) 'Modification' │ │ │ │ -9EAB4 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9EAB8 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9EABA Length 000B (11) │ │ │ │ -9EABC Version 01 (1) │ │ │ │ -9EABD UID Size 04 (4) │ │ │ │ -9EABE UID 00000000 (0) │ │ │ │ -9EAC2 GID Size 04 (4) │ │ │ │ -9EAC3 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9EAC7 CENTRAL HEADER #36 02014B50 (33639248) │ │ │ │ -9EACB Created Zip Spec 3D (61) '6.1' │ │ │ │ -9EACC Created OS 03 (3) 'Unix' │ │ │ │ -9EACD Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9EACE Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9EACF General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9EAD1 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9EAD3 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9EAD7 CRC CED2ACF6 (3469913334) │ │ │ │ -9EADB Compressed Size 00002A18 (10776) │ │ │ │ -9EADF Uncompressed Size 0000B1DD (45533) │ │ │ │ -9EAE3 Filename Length 0010 (16) │ │ │ │ -9EAE5 Extra Length 0018 (24) │ │ │ │ -9EAE7 Comment Length 0000 (0) │ │ │ │ -9EAE9 Disk Start 0000 (0) │ │ │ │ -9EAEB Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9EAED Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9EAF1 Local Header Offset 0003D6FA (251642) │ │ │ │ -9EAF5 Filename 'XXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9EAF5: Filename 'XXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9EB05 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9EB07 Length 0005 (5) │ │ │ │ -9EB09 Flags 01 (1) 'Modification' │ │ │ │ -9EB0A Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9EB0E Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9EB10 Length 000B (11) │ │ │ │ -9EB12 Version 01 (1) │ │ │ │ -9EB13 UID Size 04 (4) │ │ │ │ -9EB14 UID 00000000 (0) │ │ │ │ -9EB18 GID Size 04 (4) │ │ │ │ -9EB19 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9EB1D CENTRAL HEADER #37 02014B50 (33639248) │ │ │ │ -9EB21 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9EB22 Created OS 03 (3) 'Unix' │ │ │ │ -9EB23 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9EB24 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9EB25 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9EB27 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9EB29 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9EB2D CRC 7607C573 (1980220787) │ │ │ │ -9EB31 Compressed Size 00001E85 (7813) │ │ │ │ -9EB35 Uncompressed Size 00009AAB (39595) │ │ │ │ -9EB39 Filename Length 0012 (18) │ │ │ │ -9EB3B Extra Length 0018 (24) │ │ │ │ -9EB3D Comment Length 0000 (0) │ │ │ │ -9EB3F Disk Start 0000 (0) │ │ │ │ -9EB41 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9EB43 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9EB47 Local Header Offset 0004015C (262492) │ │ │ │ -9EB4B Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9EB4B: Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9EB5D Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9EB5F Length 0005 (5) │ │ │ │ -9EB61 Flags 01 (1) 'Modification' │ │ │ │ -9EB62 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9EB66 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9EB68 Length 000B (11) │ │ │ │ -9EB6A Version 01 (1) │ │ │ │ -9EB6B UID Size 04 (4) │ │ │ │ -9EB6C UID 00000000 (0) │ │ │ │ -9EB70 GID Size 04 (4) │ │ │ │ -9EB71 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9EB75 CENTRAL HEADER #38 02014B50 (33639248) │ │ │ │ -9EB79 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9EB7A Created OS 03 (3) 'Unix' │ │ │ │ -9EB7B Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9EB7C Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9EB7D General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9EB7F Compression Method 0008 (8) 'Deflated' │ │ │ │ -9EB81 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9EB85 CRC 5AB3A3E2 (1521722338) │ │ │ │ -9EB89 Compressed Size 00001476 (5238) │ │ │ │ -9EB8D Uncompressed Size 00007AD0 (31440) │ │ │ │ -9EB91 Filename Length 0018 (24) │ │ │ │ -9EB93 Extra Length 0018 (24) │ │ │ │ -9EB95 Comment Length 0000 (0) │ │ │ │ -9EB97 Disk Start 0000 (0) │ │ │ │ -9EB99 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9EB9B Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9EB9F Local Header Offset 0004202D (270381) │ │ │ │ -9EBA3 Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9EBA3: Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9EBBB Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9EBBD Length 0005 (5) │ │ │ │ -9EBBF Flags 01 (1) 'Modification' │ │ │ │ -9EBC0 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9EBC4 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9EBC6 Length 000B (11) │ │ │ │ -9EBC8 Version 01 (1) │ │ │ │ -9EBC9 UID Size 04 (4) │ │ │ │ -9EBCA UID 00000000 (0) │ │ │ │ -9EBCE GID Size 04 (4) │ │ │ │ -9EBCF GID 00000000 (0) │ │ │ │ - │ │ │ │ -9EBD3 CENTRAL HEADER #39 02014B50 (33639248) │ │ │ │ -9EBD7 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9EBD8 Created OS 03 (3) 'Unix' │ │ │ │ -9EBD9 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9EBDA Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9EBDB General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9EBDD Compression Method 0008 (8) 'Deflated' │ │ │ │ -9EBDF Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9EBE3 CRC FA499AED (4199127789) │ │ │ │ -9EBE7 Compressed Size 000018D1 (6353) │ │ │ │ -9EBEB Uncompressed Size 0000A83A (43066) │ │ │ │ -9EBEF Filename Length 001F (31) │ │ │ │ -9EBF1 Extra Length 0018 (24) │ │ │ │ -9EBF3 Comment Length 0000 (0) │ │ │ │ -9EBF5 Disk Start 0000 (0) │ │ │ │ -9EBF7 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9EBF9 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9EBFD Local Header Offset 000434F5 (275701) │ │ │ │ -9EC01 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9EC01: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9EC20 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9EC22 Length 0005 (5) │ │ │ │ -9EC24 Flags 01 (1) 'Modification' │ │ │ │ -9EC25 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9EC29 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9EC2B Length 000B (11) │ │ │ │ -9EC2D Version 01 (1) │ │ │ │ -9EC2E UID Size 04 (4) │ │ │ │ -9EC2F UID 00000000 (0) │ │ │ │ -9EC33 GID Size 04 (4) │ │ │ │ -9EC34 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9EC38 CENTRAL HEADER #40 02014B50 (33639248) │ │ │ │ -9EC3C Created Zip Spec 3D (61) '6.1' │ │ │ │ -9EC3D Created OS 03 (3) 'Unix' │ │ │ │ -9EC3E Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9EC3F Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9EC40 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9EC42 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9EC44 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9EC48 CRC 6DE2E94A (1843587402) │ │ │ │ -9EC4C Compressed Size 000003F8 (1016) │ │ │ │ -9EC50 Uncompressed Size 000008A4 (2212) │ │ │ │ -9EC54 Filename Length 001E (30) │ │ │ │ -9EC56 Extra Length 0018 (24) │ │ │ │ -9EC58 Comment Length 0000 (0) │ │ │ │ -9EC5A Disk Start 0000 (0) │ │ │ │ -9EC5C Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9EC5E Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9EC62 Local Header Offset 00044E1F (282143) │ │ │ │ -9EC66 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9EC66: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9EC84 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9EC86 Length 0005 (5) │ │ │ │ -9EC88 Flags 01 (1) 'Modification' │ │ │ │ -9EC89 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9EC8D Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9EC8F Length 000B (11) │ │ │ │ -9EC91 Version 01 (1) │ │ │ │ -9EC92 UID Size 04 (4) │ │ │ │ -9EC93 UID 00000000 (0) │ │ │ │ -9EC97 GID Size 04 (4) │ │ │ │ -9EC98 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9EC9C CENTRAL HEADER #41 02014B50 (33639248) │ │ │ │ -9ECA0 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9ECA1 Created OS 03 (3) 'Unix' │ │ │ │ -9ECA2 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9ECA3 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9ECA4 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9ECA6 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9ECA8 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9ECAC CRC 93538F15 (2471726869) │ │ │ │ -9ECB0 Compressed Size 00004296 (17046) │ │ │ │ -9ECB4 Uncompressed Size 0000D8E8 (55528) │ │ │ │ -9ECB8 Filename Length 0013 (19) │ │ │ │ -9ECBA Extra Length 0018 (24) │ │ │ │ -9ECBC Comment Length 0000 (0) │ │ │ │ -9ECBE Disk Start 0000 (0) │ │ │ │ -9ECC0 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9ECC2 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9ECC6 Local Header Offset 0004526F (283247) │ │ │ │ -9ECCA Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9ECCA: Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9ECDD Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9ECDF Length 0005 (5) │ │ │ │ -9ECE1 Flags 01 (1) 'Modification' │ │ │ │ -9ECE2 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9ECE6 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9ECE8 Length 000B (11) │ │ │ │ -9ECEA Version 01 (1) │ │ │ │ -9ECEB UID Size 04 (4) │ │ │ │ -9ECEC UID 00000000 (0) │ │ │ │ -9ECF0 GID Size 04 (4) │ │ │ │ -9ECF1 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9ECF5 CENTRAL HEADER #42 02014B50 (33639248) │ │ │ │ -9ECF9 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9ECFA Created OS 03 (3) 'Unix' │ │ │ │ -9ECFB Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9ECFC Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9ECFD General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9ECFF Compression Method 0008 (8) 'Deflated' │ │ │ │ -9ED01 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9ED05 CRC 117AFDAE (293273006) │ │ │ │ -9ED09 Compressed Size 000026C5 (9925) │ │ │ │ -9ED0D Uncompressed Size 00006E46 (28230) │ │ │ │ -9ED11 Filename Length 0019 (25) │ │ │ │ -9ED13 Extra Length 0018 (24) │ │ │ │ -9ED15 Comment Length 0000 (0) │ │ │ │ -9ED17 Disk Start 0000 (0) │ │ │ │ -9ED19 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9ED1B Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9ED1F Local Header Offset 00049552 (300370) │ │ │ │ -9ED23 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9ED23: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9ED3C Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9ED3E Length 0005 (5) │ │ │ │ -9ED40 Flags 01 (1) 'Modification' │ │ │ │ -9ED41 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9ED45 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9ED47 Length 000B (11) │ │ │ │ -9ED49 Version 01 (1) │ │ │ │ -9ED4A UID Size 04 (4) │ │ │ │ -9ED4B UID 00000000 (0) │ │ │ │ -9ED4F GID Size 04 (4) │ │ │ │ -9ED50 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9ED54 CENTRAL HEADER #43 02014B50 (33639248) │ │ │ │ -9ED58 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9ED59 Created OS 03 (3) 'Unix' │ │ │ │ -9ED5A Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9ED5B Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9ED5C General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9ED5E Compression Method 0008 (8) 'Deflated' │ │ │ │ -9ED60 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9ED64 CRC 300CDC3B (806149179) │ │ │ │ -9ED68 Compressed Size 0000273A (10042) │ │ │ │ -9ED6C Uncompressed Size 00008B84 (35716) │ │ │ │ -9ED70 Filename Length 0019 (25) │ │ │ │ -9ED72 Extra Length 0018 (24) │ │ │ │ -9ED74 Comment Length 0000 (0) │ │ │ │ -9ED76 Disk Start 0000 (0) │ │ │ │ -9ED78 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9ED7A Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9ED7E Local Header Offset 0004BC6A (310378) │ │ │ │ -9ED82 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9ED82: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9ED9B Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9ED9D Length 0005 (5) │ │ │ │ -9ED9F Flags 01 (1) 'Modification' │ │ │ │ -9EDA0 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9EDA4 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9EDA6 Length 000B (11) │ │ │ │ -9EDA8 Version 01 (1) │ │ │ │ -9EDA9 UID Size 04 (4) │ │ │ │ -9EDAA UID 00000000 (0) │ │ │ │ -9EDAE GID Size 04 (4) │ │ │ │ -9EDAF GID 00000000 (0) │ │ │ │ - │ │ │ │ -9EDB3 CENTRAL HEADER #44 02014B50 (33639248) │ │ │ │ -9EDB7 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9EDB8 Created OS 03 (3) 'Unix' │ │ │ │ -9EDB9 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9EDBA Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9EDBB General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9EDBD Compression Method 0008 (8) 'Deflated' │ │ │ │ -9EDBF Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9EDC3 CRC D651D0B9 (3595686073) │ │ │ │ -9EDC7 Compressed Size 00000CF1 (3313) │ │ │ │ -9EDCB Uncompressed Size 0000517B (20859) │ │ │ │ -9EDCF Filename Length 0021 (33) │ │ │ │ -9EDD1 Extra Length 0018 (24) │ │ │ │ -9EDD3 Comment Length 0000 (0) │ │ │ │ -9EDD5 Disk Start 0000 (0) │ │ │ │ -9EDD7 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9EDD9 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9EDDD Local Header Offset 0004E3F7 (320503) │ │ │ │ -9EDE1 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9EDE1: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9EE02 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9EE04 Length 0005 (5) │ │ │ │ -9EE06 Flags 01 (1) 'Modification' │ │ │ │ -9EE07 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9EE0B Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9EE0D Length 000B (11) │ │ │ │ -9EE0F Version 01 (1) │ │ │ │ -9EE10 UID Size 04 (4) │ │ │ │ -9EE11 UID 00000000 (0) │ │ │ │ -9EE15 GID Size 04 (4) │ │ │ │ -9EE16 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9EE1A CENTRAL HEADER #45 02014B50 (33639248) │ │ │ │ -9EE1E Created Zip Spec 3D (61) '6.1' │ │ │ │ -9EE1F Created OS 03 (3) 'Unix' │ │ │ │ -9EE20 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9EE21 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9EE22 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9EE24 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9EE26 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9EE2A CRC 0D2E5D9B (221142427) │ │ │ │ -9EE2E Compressed Size 00000468 (1128) │ │ │ │ -9EE32 Uncompressed Size 00000932 (2354) │ │ │ │ -9EE36 Filename Length 001B (27) │ │ │ │ -9EE38 Extra Length 0018 (24) │ │ │ │ -9EE3A Comment Length 0000 (0) │ │ │ │ -9EE3C Disk Start 0000 (0) │ │ │ │ -9EE3E Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9EE40 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9EE44 Local Header Offset 0004F143 (323907) │ │ │ │ -9EE48 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9EE48: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9EE63 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9EE65 Length 0005 (5) │ │ │ │ -9EE67 Flags 01 (1) 'Modification' │ │ │ │ -9EE68 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9EE6C Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9EE6E Length 000B (11) │ │ │ │ -9EE70 Version 01 (1) │ │ │ │ -9EE71 UID Size 04 (4) │ │ │ │ -9EE72 UID 00000000 (0) │ │ │ │ -9EE76 GID Size 04 (4) │ │ │ │ -9EE77 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9EE7B CENTRAL HEADER #46 02014B50 (33639248) │ │ │ │ -9EE7F Created Zip Spec 3D (61) '6.1' │ │ │ │ -9EE80 Created OS 03 (3) 'Unix' │ │ │ │ -9EE81 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9EE82 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9EE83 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9EE85 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9EE87 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9EE8B CRC 5B690D13 (1533611283) │ │ │ │ -9EE8F Compressed Size 000016EF (5871) │ │ │ │ -9EE93 Uncompressed Size 00007A6E (31342) │ │ │ │ -9EE97 Filename Length 001F (31) │ │ │ │ -9EE99 Extra Length 0018 (24) │ │ │ │ -9EE9B Comment Length 0000 (0) │ │ │ │ -9EE9D Disk Start 0000 (0) │ │ │ │ -9EE9F Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9EEA1 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9EEA5 Local Header Offset 0004F600 (325120) │ │ │ │ -9EEA9 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9EEA9: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9EEC8 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9EECA Length 0005 (5) │ │ │ │ -9EECC Flags 01 (1) 'Modification' │ │ │ │ -9EECD Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9EED1 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9EED3 Length 000B (11) │ │ │ │ -9EED5 Version 01 (1) │ │ │ │ -9EED6 UID Size 04 (4) │ │ │ │ -9EED7 UID 00000000 (0) │ │ │ │ -9EEDB GID Size 04 (4) │ │ │ │ -9EEDC GID 00000000 (0) │ │ │ │ - │ │ │ │ -9EEE0 CENTRAL HEADER #47 02014B50 (33639248) │ │ │ │ -9EEE4 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9EEE5 Created OS 03 (3) 'Unix' │ │ │ │ -9EEE6 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9EEE7 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9EEE8 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9EEEA Compression Method 0008 (8) 'Deflated' │ │ │ │ -9EEEC Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9EEF0 CRC 70167630 (1880520240) │ │ │ │ -9EEF4 Compressed Size 0000415D (16733) │ │ │ │ -9EEF8 Uncompressed Size 0001D160 (119136) │ │ │ │ -9EEFC Filename Length 0010 (16) │ │ │ │ -9EEFE Extra Length 0018 (24) │ │ │ │ -9EF00 Comment Length 0000 (0) │ │ │ │ -9EF02 Disk Start 0000 (0) │ │ │ │ -9EF04 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9EF06 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9EF0A Local Header Offset 00050D48 (331080) │ │ │ │ -9EF0E Filename 'XXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9EF0E: Filename 'XXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9EF1E Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9EF20 Length 0005 (5) │ │ │ │ -9EF22 Flags 01 (1) 'Modification' │ │ │ │ -9EF23 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9EF27 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9EF29 Length 000B (11) │ │ │ │ -9EF2B Version 01 (1) │ │ │ │ -9EF2C UID Size 04 (4) │ │ │ │ -9EF2D UID 00000000 (0) │ │ │ │ -9EF31 GID Size 04 (4) │ │ │ │ -9EF32 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9EF36 CENTRAL HEADER #48 02014B50 (33639248) │ │ │ │ -9EF3A Created Zip Spec 3D (61) '6.1' │ │ │ │ -9EF3B Created OS 03 (3) 'Unix' │ │ │ │ -9EF3C Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9EF3D Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9EF3E General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9EF40 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9EF42 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9EF46 CRC 6CEC6D86 (1827433862) │ │ │ │ -9EF4A Compressed Size 00000A98 (2712) │ │ │ │ -9EF4E Uncompressed Size 00002106 (8454) │ │ │ │ -9EF52 Filename Length 0014 (20) │ │ │ │ -9EF54 Extra Length 0018 (24) │ │ │ │ -9EF56 Comment Length 0000 (0) │ │ │ │ -9EF58 Disk Start 0000 (0) │ │ │ │ -9EF5A Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9EF5C Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9EF60 Local Header Offset 00054EEF (347887) │ │ │ │ -9EF64 Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9EF64: Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9EF78 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9EF7A Length 0005 (5) │ │ │ │ -9EF7C Flags 01 (1) 'Modification' │ │ │ │ -9EF7D Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9EF81 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9EF83 Length 000B (11) │ │ │ │ -9EF85 Version 01 (1) │ │ │ │ -9EF86 UID Size 04 (4) │ │ │ │ -9EF87 UID 00000000 (0) │ │ │ │ -9EF8B GID Size 04 (4) │ │ │ │ -9EF8C GID 00000000 (0) │ │ │ │ - │ │ │ │ -9EF90 CENTRAL HEADER #49 02014B50 (33639248) │ │ │ │ -9EF94 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9EF95 Created OS 03 (3) 'Unix' │ │ │ │ -9EF96 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9EF97 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9EF98 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9EF9A Compression Method 0008 (8) 'Deflated' │ │ │ │ -9EF9C Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9EFA0 CRC AC6356BB (2892191419) │ │ │ │ -9EFA4 Compressed Size 0000AD83 (44419) │ │ │ │ -9EFA8 Uncompressed Size 0003EB1B (256795) │ │ │ │ -9EFAC Filename Length 0017 (23) │ │ │ │ -9EFAE Extra Length 0018 (24) │ │ │ │ -9EFB0 Comment Length 0000 (0) │ │ │ │ -9EFB2 Disk Start 0000 (0) │ │ │ │ -9EFB4 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9EFB6 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9EFBA Local Header Offset 000559D5 (350677) │ │ │ │ -9EFBE Filename 'XXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9EFBE: Filename 'XXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9EFD5 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9EFD7 Length 0005 (5) │ │ │ │ -9EFD9 Flags 01 (1) 'Modification' │ │ │ │ -9EFDA Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9EFDE Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9EFE0 Length 000B (11) │ │ │ │ -9EFE2 Version 01 (1) │ │ │ │ -9EFE3 UID Size 04 (4) │ │ │ │ -9EFE4 UID 00000000 (0) │ │ │ │ -9EFE8 GID Size 04 (4) │ │ │ │ -9EFE9 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9EFED CENTRAL HEADER #50 02014B50 (33639248) │ │ │ │ -9EFF1 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9EFF2 Created OS 03 (3) 'Unix' │ │ │ │ -9EFF3 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9EFF4 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9EFF5 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9EFF7 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9EFF9 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9EFFD CRC 6543FD4E (1698954574) │ │ │ │ -9F001 Compressed Size 00000401 (1025) │ │ │ │ -9F005 Uncompressed Size 0000093E (2366) │ │ │ │ -9F009 Filename Length 0013 (19) │ │ │ │ -9F00B Extra Length 0018 (24) │ │ │ │ -9F00D Comment Length 0000 (0) │ │ │ │ -9F00F Disk Start 0000 (0) │ │ │ │ -9F011 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9F013 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9F017 Local Header Offset 000607A9 (395177) │ │ │ │ -9F01B Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9F01B: Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9F02E Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9F030 Length 0005 (5) │ │ │ │ -9F032 Flags 01 (1) 'Modification' │ │ │ │ -9F033 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9F037 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9F039 Length 000B (11) │ │ │ │ -9F03B Version 01 (1) │ │ │ │ -9F03C UID Size 04 (4) │ │ │ │ -9F03D UID 00000000 (0) │ │ │ │ -9F041 GID Size 04 (4) │ │ │ │ -9F042 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9F046 CENTRAL HEADER #51 02014B50 (33639248) │ │ │ │ -9F04A Created Zip Spec 3D (61) '6.1' │ │ │ │ -9F04B Created OS 03 (3) 'Unix' │ │ │ │ -9F04C Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9F04D Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9F04E General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9F050 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9F052 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9F056 CRC 8FA51372 (2409960306) │ │ │ │ -9F05A Compressed Size 000014D7 (5335) │ │ │ │ -9F05E Uncompressed Size 00006893 (26771) │ │ │ │ -9F062 Filename Length 0012 (18) │ │ │ │ -9F064 Extra Length 0018 (24) │ │ │ │ -9F066 Comment Length 0000 (0) │ │ │ │ -9F068 Disk Start 0000 (0) │ │ │ │ -9F06A Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9F06C Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9F070 Local Header Offset 00060BF7 (396279) │ │ │ │ -9F074 Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9F074: Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9F086 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9F088 Length 0005 (5) │ │ │ │ -9F08A Flags 01 (1) 'Modification' │ │ │ │ -9F08B Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9F08F Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9F091 Length 000B (11) │ │ │ │ -9F093 Version 01 (1) │ │ │ │ -9F094 UID Size 04 (4) │ │ │ │ -9F095 UID 00000000 (0) │ │ │ │ -9F099 GID Size 04 (4) │ │ │ │ -9F09A GID 00000000 (0) │ │ │ │ - │ │ │ │ -9F09E CENTRAL HEADER #52 02014B50 (33639248) │ │ │ │ -9F0A2 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9F0A3 Created OS 03 (3) 'Unix' │ │ │ │ -9F0A4 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9F0A5 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9F0A6 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9F0A8 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9F0AA Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9F0AE CRC 67A3A30C (1738777356) │ │ │ │ -9F0B2 Compressed Size 000011F1 (4593) │ │ │ │ -9F0B6 Uncompressed Size 0000410D (16653) │ │ │ │ -9F0BA Filename Length 0012 (18) │ │ │ │ -9F0BC Extra Length 0018 (24) │ │ │ │ -9F0BE Comment Length 0000 (0) │ │ │ │ -9F0C0 Disk Start 0000 (0) │ │ │ │ -9F0C2 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9F0C4 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9F0C8 Local Header Offset 0006211A (401690) │ │ │ │ -9F0CC Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9F0CC: Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9F0DE Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9F0E0 Length 0005 (5) │ │ │ │ -9F0E2 Flags 01 (1) 'Modification' │ │ │ │ -9F0E3 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9F0E7 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9F0E9 Length 000B (11) │ │ │ │ -9F0EB Version 01 (1) │ │ │ │ -9F0EC UID Size 04 (4) │ │ │ │ -9F0ED UID 00000000 (0) │ │ │ │ -9F0F1 GID Size 04 (4) │ │ │ │ -9F0F2 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9F0F6 CENTRAL HEADER #53 02014B50 (33639248) │ │ │ │ -9F0FA Created Zip Spec 3D (61) '6.1' │ │ │ │ -9F0FB Created OS 03 (3) 'Unix' │ │ │ │ -9F0FC Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9F0FD Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9F0FE General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9F100 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9F102 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9F106 CRC FEC012D9 (4274000601) │ │ │ │ -9F10A Compressed Size 000009DC (2524) │ │ │ │ -9F10E Uncompressed Size 0000352A (13610) │ │ │ │ -9F112 Filename Length 0019 (25) │ │ │ │ -9F114 Extra Length 0018 (24) │ │ │ │ -9F116 Comment Length 0000 (0) │ │ │ │ -9F118 Disk Start 0000 (0) │ │ │ │ -9F11A Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9F11C Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9F120 Local Header Offset 00063357 (406359) │ │ │ │ -9F124 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9F124: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9F13D Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9F13F Length 0005 (5) │ │ │ │ -9F141 Flags 01 (1) 'Modification' │ │ │ │ -9F142 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9F146 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9F148 Length 000B (11) │ │ │ │ -9F14A Version 01 (1) │ │ │ │ -9F14B UID Size 04 (4) │ │ │ │ -9F14C UID 00000000 (0) │ │ │ │ -9F150 GID Size 04 (4) │ │ │ │ -9F151 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9F155 CENTRAL HEADER #54 02014B50 (33639248) │ │ │ │ -9F159 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9F15A Created OS 03 (3) 'Unix' │ │ │ │ -9F15B Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9F15C Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9F15D General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9F15F Compression Method 0008 (8) 'Deflated' │ │ │ │ -9F161 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9F165 CRC E3AB0B6C (3819637612) │ │ │ │ -9F169 Compressed Size 000018B7 (6327) │ │ │ │ -9F16D Uncompressed Size 0000A679 (42617) │ │ │ │ -9F171 Filename Length 0019 (25) │ │ │ │ -9F173 Extra Length 0018 (24) │ │ │ │ -9F175 Comment Length 0000 (0) │ │ │ │ -9F177 Disk Start 0000 (0) │ │ │ │ -9F179 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9F17B Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9F17F Local Header Offset 00063D86 (408966) │ │ │ │ -9F183 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9F183: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9F19C Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9F19E Length 0005 (5) │ │ │ │ -9F1A0 Flags 01 (1) 'Modification' │ │ │ │ -9F1A1 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9F1A5 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9F1A7 Length 000B (11) │ │ │ │ -9F1A9 Version 01 (1) │ │ │ │ -9F1AA UID Size 04 (4) │ │ │ │ -9F1AB UID 00000000 (0) │ │ │ │ -9F1AF GID Size 04 (4) │ │ │ │ -9F1B0 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9F1B4 CENTRAL HEADER #55 02014B50 (33639248) │ │ │ │ -9F1B8 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9F1B9 Created OS 03 (3) 'Unix' │ │ │ │ -9F1BA Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9F1BB Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9F1BC General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9F1BE Compression Method 0008 (8) 'Deflated' │ │ │ │ -9F1C0 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9F1C4 CRC 63DD925D (1675465309) │ │ │ │ -9F1C8 Compressed Size 0000177F (6015) │ │ │ │ -9F1CC Uncompressed Size 0000472D (18221) │ │ │ │ -9F1D0 Filename Length 0014 (20) │ │ │ │ -9F1D2 Extra Length 0018 (24) │ │ │ │ -9F1D4 Comment Length 0000 (0) │ │ │ │ -9F1D6 Disk Start 0000 (0) │ │ │ │ -9F1D8 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9F1DA Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9F1DE Local Header Offset 00065690 (415376) │ │ │ │ -9F1E2 Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9F1E2: Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9F1F6 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9F1F8 Length 0005 (5) │ │ │ │ -9F1FA Flags 01 (1) 'Modification' │ │ │ │ -9F1FB Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9F1FF Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9F201 Length 000B (11) │ │ │ │ -9F203 Version 01 (1) │ │ │ │ -9F204 UID Size 04 (4) │ │ │ │ -9F205 UID 00000000 (0) │ │ │ │ -9F209 GID Size 04 (4) │ │ │ │ -9F20A GID 00000000 (0) │ │ │ │ - │ │ │ │ -9F20E CENTRAL HEADER #56 02014B50 (33639248) │ │ │ │ -9F212 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9F213 Created OS 03 (3) 'Unix' │ │ │ │ -9F214 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9F215 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9F216 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9F218 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9F21A Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9F21E CRC 7088EC5F (1888021599) │ │ │ │ -9F222 Compressed Size 0000040B (1035) │ │ │ │ -9F226 Uncompressed Size 00000826 (2086) │ │ │ │ -9F22A Filename Length 001C (28) │ │ │ │ -9F22C Extra Length 0018 (24) │ │ │ │ -9F22E Comment Length 0000 (0) │ │ │ │ -9F230 Disk Start 0000 (0) │ │ │ │ -9F232 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9F234 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9F238 Local Header Offset 00066E5D (421469) │ │ │ │ -9F23C Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9F23C: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9F258 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9F25A Length 0005 (5) │ │ │ │ -9F25C Flags 01 (1) 'Modification' │ │ │ │ -9F25D Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9F261 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9F263 Length 000B (11) │ │ │ │ -9F265 Version 01 (1) │ │ │ │ -9F266 UID Size 04 (4) │ │ │ │ -9F267 UID 00000000 (0) │ │ │ │ -9F26B GID Size 04 (4) │ │ │ │ -9F26C GID 00000000 (0) │ │ │ │ - │ │ │ │ -9F270 CENTRAL HEADER #57 02014B50 (33639248) │ │ │ │ -9F274 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9F275 Created OS 03 (3) 'Unix' │ │ │ │ -9F276 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9F277 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9F278 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9F27A Compression Method 0008 (8) 'Deflated' │ │ │ │ -9F27C Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9F280 CRC 17AEC46D (397329517) │ │ │ │ -9F284 Compressed Size 00002496 (9366) │ │ │ │ -9F288 Uncompressed Size 0000B5FA (46586) │ │ │ │ -9F28C Filename Length 001F (31) │ │ │ │ -9F28E Extra Length 0018 (24) │ │ │ │ -9F290 Comment Length 0000 (0) │ │ │ │ -9F292 Disk Start 0000 (0) │ │ │ │ -9F294 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9F296 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9F29A Local Header Offset 000672BE (422590) │ │ │ │ -9F29E Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9F29E: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9F2BD Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9F2BF Length 0005 (5) │ │ │ │ -9F2C1 Flags 01 (1) 'Modification' │ │ │ │ -9F2C2 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9F2C6 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9F2C8 Length 000B (11) │ │ │ │ -9F2CA Version 01 (1) │ │ │ │ -9F2CB UID Size 04 (4) │ │ │ │ -9F2CC UID 00000000 (0) │ │ │ │ -9F2D0 GID Size 04 (4) │ │ │ │ -9F2D1 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9F2D5 CENTRAL HEADER #58 02014B50 (33639248) │ │ │ │ -9F2D9 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9F2DA Created OS 03 (3) 'Unix' │ │ │ │ -9F2DB Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9F2DC Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9F2DD General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9F2DF Compression Method 0008 (8) 'Deflated' │ │ │ │ -9F2E1 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9F2E5 CRC C2A7AFB2 (3265769394) │ │ │ │ -9F2E9 Compressed Size 00000E7A (3706) │ │ │ │ -9F2ED Uncompressed Size 000052DA (21210) │ │ │ │ -9F2F1 Filename Length 001F (31) │ │ │ │ -9F2F3 Extra Length 0018 (24) │ │ │ │ -9F2F5 Comment Length 0000 (0) │ │ │ │ -9F2F7 Disk Start 0000 (0) │ │ │ │ -9F2F9 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9F2FB Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9F2FF Local Header Offset 000697AD (432045) │ │ │ │ -9F303 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9F303: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9F322 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9F324 Length 0005 (5) │ │ │ │ -9F326 Flags 01 (1) 'Modification' │ │ │ │ -9F327 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9F32B Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9F32D Length 000B (11) │ │ │ │ -9F32F Version 01 (1) │ │ │ │ -9F330 UID Size 04 (4) │ │ │ │ -9F331 UID 00000000 (0) │ │ │ │ -9F335 GID Size 04 (4) │ │ │ │ -9F336 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9F33A CENTRAL HEADER #59 02014B50 (33639248) │ │ │ │ -9F33E Created Zip Spec 3D (61) '6.1' │ │ │ │ -9F33F Created OS 03 (3) 'Unix' │ │ │ │ -9F340 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9F341 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9F342 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9F344 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9F346 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9F34A CRC B20283C2 (2986509250) │ │ │ │ -9F34E Compressed Size 00000A44 (2628) │ │ │ │ -9F352 Uncompressed Size 0000247B (9339) │ │ │ │ -9F356 Filename Length 0013 (19) │ │ │ │ -9F358 Extra Length 0018 (24) │ │ │ │ -9F35A Comment Length 0000 (0) │ │ │ │ -9F35C Disk Start 0000 (0) │ │ │ │ -9F35E Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9F360 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9F364 Local Header Offset 0006A680 (435840) │ │ │ │ -9F368 Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9F368: Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9F37B Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9F37D Length 0005 (5) │ │ │ │ -9F37F Flags 01 (1) 'Modification' │ │ │ │ -9F380 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9F384 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9F386 Length 000B (11) │ │ │ │ -9F388 Version 01 (1) │ │ │ │ -9F389 UID Size 04 (4) │ │ │ │ -9F38A UID 00000000 (0) │ │ │ │ -9F38E GID Size 04 (4) │ │ │ │ -9F38F GID 00000000 (0) │ │ │ │ - │ │ │ │ -9F393 CENTRAL HEADER #60 02014B50 (33639248) │ │ │ │ -9F397 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9F398 Created OS 03 (3) 'Unix' │ │ │ │ -9F399 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9F39A Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9F39B General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9F39D Compression Method 0008 (8) 'Deflated' │ │ │ │ -9F39F Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9F3A3 CRC 21DCD0E4 (568119524) │ │ │ │ -9F3A7 Compressed Size 0000248A (9354) │ │ │ │ -9F3AB Uncompressed Size 0000B84D (47181) │ │ │ │ -9F3AF Filename Length 0019 (25) │ │ │ │ -9F3B1 Extra Length 0018 (24) │ │ │ │ -9F3B3 Comment Length 0000 (0) │ │ │ │ -9F3B5 Disk Start 0000 (0) │ │ │ │ -9F3B7 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9F3B9 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9F3BD Local Header Offset 0006B111 (438545) │ │ │ │ -9F3C1 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9F3C1: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9F3DA Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9F3DC Length 0005 (5) │ │ │ │ -9F3DE Flags 01 (1) 'Modification' │ │ │ │ -9F3DF Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9F3E3 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9F3E5 Length 000B (11) │ │ │ │ -9F3E7 Version 01 (1) │ │ │ │ -9F3E8 UID Size 04 (4) │ │ │ │ -9F3E9 UID 00000000 (0) │ │ │ │ -9F3ED GID Size 04 (4) │ │ │ │ -9F3EE GID 00000000 (0) │ │ │ │ - │ │ │ │ -9F3F2 CENTRAL HEADER #61 02014B50 (33639248) │ │ │ │ -9F3F6 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9F3F7 Created OS 03 (3) 'Unix' │ │ │ │ -9F3F8 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9F3F9 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9F3FA General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9F3FC Compression Method 0008 (8) 'Deflated' │ │ │ │ -9F3FE Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9F402 CRC 7B1EDBE3 (2065619939) │ │ │ │ -9F406 Compressed Size 00000EFA (3834) │ │ │ │ -9F40A Uncompressed Size 00003A2D (14893) │ │ │ │ -9F40E Filename Length 0024 (36) │ │ │ │ -9F410 Extra Length 0018 (24) │ │ │ │ -9F412 Comment Length 0000 (0) │ │ │ │ -9F414 Disk Start 0000 (0) │ │ │ │ -9F416 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9F418 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9F41C Local Header Offset 0006D5EE (447982) │ │ │ │ -9F420 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9F420: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9F444 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9F446 Length 0005 (5) │ │ │ │ -9F448 Flags 01 (1) 'Modification' │ │ │ │ -9F449 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9F44D Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9F44F Length 000B (11) │ │ │ │ -9F451 Version 01 (1) │ │ │ │ -9F452 UID Size 04 (4) │ │ │ │ -9F453 UID 00000000 (0) │ │ │ │ -9F457 GID Size 04 (4) │ │ │ │ -9F458 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9F45C CENTRAL HEADER #62 02014B50 (33639248) │ │ │ │ -9F460 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9F461 Created OS 03 (3) 'Unix' │ │ │ │ -9F462 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9F463 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9F464 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9F466 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9F468 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9F46C CRC C480C4AF (3296773295) │ │ │ │ -9F470 Compressed Size 00001AB8 (6840) │ │ │ │ -9F474 Uncompressed Size 00005F39 (24377) │ │ │ │ -9F478 Filename Length 0017 (23) │ │ │ │ -9F47A Extra Length 0018 (24) │ │ │ │ -9F47C Comment Length 0000 (0) │ │ │ │ -9F47E Disk Start 0000 (0) │ │ │ │ -9F480 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9F482 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9F486 Local Header Offset 0006E546 (451910) │ │ │ │ -9F48A Filename 'XXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9F48A: Filename 'XXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9F4A1 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9F4A3 Length 0005 (5) │ │ │ │ -9F4A5 Flags 01 (1) 'Modification' │ │ │ │ -9F4A6 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9F4AA Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9F4AC Length 000B (11) │ │ │ │ -9F4AE Version 01 (1) │ │ │ │ -9F4AF UID Size 04 (4) │ │ │ │ -9F4B0 UID 00000000 (0) │ │ │ │ -9F4B4 GID Size 04 (4) │ │ │ │ -9F4B5 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9F4B9 CENTRAL HEADER #63 02014B50 (33639248) │ │ │ │ -9F4BD Created Zip Spec 3D (61) '6.1' │ │ │ │ -9F4BE Created OS 03 (3) 'Unix' │ │ │ │ -9F4BF Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9F4C0 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9F4C1 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9F4C3 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9F4C5 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9F4C9 CRC 11E32AF1 (300100337) │ │ │ │ -9F4CD Compressed Size 00000ED3 (3795) │ │ │ │ -9F4D1 Uncompressed Size 000038E2 (14562) │ │ │ │ -9F4D5 Filename Length 0023 (35) │ │ │ │ -9F4D7 Extra Length 0018 (24) │ │ │ │ -9F4D9 Comment Length 0000 (0) │ │ │ │ -9F4DB Disk Start 0000 (0) │ │ │ │ -9F4DD Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9F4DF Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9F4E3 Local Header Offset 0007004F (458831) │ │ │ │ -9F4E7 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9F4E7: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9F50A Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9F50C Length 0005 (5) │ │ │ │ -9F50E Flags 01 (1) 'Modification' │ │ │ │ -9F50F Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9F513 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9F515 Length 000B (11) │ │ │ │ -9F517 Version 01 (1) │ │ │ │ -9F518 UID Size 04 (4) │ │ │ │ -9F519 UID 00000000 (0) │ │ │ │ -9F51D GID Size 04 (4) │ │ │ │ -9F51E GID 00000000 (0) │ │ │ │ - │ │ │ │ -9F522 CENTRAL HEADER #64 02014B50 (33639248) │ │ │ │ -9F526 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9F527 Created OS 03 (3) 'Unix' │ │ │ │ -9F528 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9F529 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9F52A General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9F52C Compression Method 0008 (8) 'Deflated' │ │ │ │ -9F52E Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9F532 CRC 2DB7929F (767005343) │ │ │ │ -9F536 Compressed Size 00000113 (275) │ │ │ │ -9F53A Uncompressed Size 000001F3 (499) │ │ │ │ -9F53E Filename Length 001B (27) │ │ │ │ -9F540 Extra Length 0018 (24) │ │ │ │ -9F542 Comment Length 0000 (0) │ │ │ │ -9F544 Disk Start 0000 (0) │ │ │ │ -9F546 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9F548 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9F54C Local Header Offset 00070F7F (462719) │ │ │ │ -9F550 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9F550: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9F56B Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9F56D Length 0005 (5) │ │ │ │ -9F56F Flags 01 (1) 'Modification' │ │ │ │ -9F570 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9F574 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9F576 Length 000B (11) │ │ │ │ -9F578 Version 01 (1) │ │ │ │ -9F579 UID Size 04 (4) │ │ │ │ -9F57A UID 00000000 (0) │ │ │ │ -9F57E GID Size 04 (4) │ │ │ │ -9F57F GID 00000000 (0) │ │ │ │ - │ │ │ │ -9F583 CENTRAL HEADER #65 02014B50 (33639248) │ │ │ │ -9F587 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9F588 Created OS 03 (3) 'Unix' │ │ │ │ -9F589 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9F58A Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9F58B General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9F58D Compression Method 0008 (8) 'Deflated' │ │ │ │ -9F58F Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9F593 CRC 7EA8516A (2124960106) │ │ │ │ -9F597 Compressed Size 00001894 (6292) │ │ │ │ -9F59B Uncompressed Size 00008FAD (36781) │ │ │ │ -9F59F Filename Length 001D (29) │ │ │ │ -9F5A1 Extra Length 0018 (24) │ │ │ │ -9F5A3 Comment Length 0000 (0) │ │ │ │ -9F5A5 Disk Start 0000 (0) │ │ │ │ -9F5A7 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9F5A9 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9F5AD Local Header Offset 000710E7 (463079) │ │ │ │ -9F5B1 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9F5B1: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9F5CE Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9F5D0 Length 0005 (5) │ │ │ │ -9F5D2 Flags 01 (1) 'Modification' │ │ │ │ -9F5D3 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9F5D7 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9F5D9 Length 000B (11) │ │ │ │ -9F5DB Version 01 (1) │ │ │ │ -9F5DC UID Size 04 (4) │ │ │ │ -9F5DD UID 00000000 (0) │ │ │ │ -9F5E1 GID Size 04 (4) │ │ │ │ -9F5E2 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9F5E6 CENTRAL HEADER #66 02014B50 (33639248) │ │ │ │ -9F5EA Created Zip Spec 3D (61) '6.1' │ │ │ │ -9F5EB Created OS 03 (3) 'Unix' │ │ │ │ -9F5EC Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9F5ED Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9F5EE General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9F5F0 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9F5F2 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9F5F6 CRC ECF01B2E (3975158574) │ │ │ │ -9F5FA Compressed Size 0000164B (5707) │ │ │ │ -9F5FE Uncompressed Size 00003A9C (15004) │ │ │ │ -9F602 Filename Length 0015 (21) │ │ │ │ -9F604 Extra Length 0018 (24) │ │ │ │ -9F606 Comment Length 0000 (0) │ │ │ │ -9F608 Disk Start 0000 (0) │ │ │ │ -9F60A Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9F60C Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9F610 Local Header Offset 000729D2 (469458) │ │ │ │ -9F614 Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9F614: Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9F629 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9F62B Length 0005 (5) │ │ │ │ -9F62D Flags 01 (1) 'Modification' │ │ │ │ -9F62E Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9F632 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9F634 Length 000B (11) │ │ │ │ -9F636 Version 01 (1) │ │ │ │ -9F637 UID Size 04 (4) │ │ │ │ -9F638 UID 00000000 (0) │ │ │ │ -9F63C GID Size 04 (4) │ │ │ │ -9F63D GID 00000000 (0) │ │ │ │ - │ │ │ │ -9F641 CENTRAL HEADER #67 02014B50 (33639248) │ │ │ │ -9F645 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9F646 Created OS 03 (3) 'Unix' │ │ │ │ -9F647 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9F648 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9F649 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9F64B Compression Method 0008 (8) 'Deflated' │ │ │ │ -9F64D Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9F651 CRC C2126410 (3255985168) │ │ │ │ -9F655 Compressed Size 00003B51 (15185) │ │ │ │ -9F659 Uncompressed Size 00011CC3 (72899) │ │ │ │ -9F65D Filename Length 0016 (22) │ │ │ │ -9F65F Extra Length 0018 (24) │ │ │ │ -9F661 Comment Length 0000 (0) │ │ │ │ -9F663 Disk Start 0000 (0) │ │ │ │ -9F665 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9F667 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9F66B Local Header Offset 0007406C (475244) │ │ │ │ -9F66F Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9F66F: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9F685 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9F687 Length 0005 (5) │ │ │ │ -9F689 Flags 01 (1) 'Modification' │ │ │ │ -9F68A Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9F68E Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9F690 Length 000B (11) │ │ │ │ -9F692 Version 01 (1) │ │ │ │ -9F693 UID Size 04 (4) │ │ │ │ -9F694 UID 00000000 (0) │ │ │ │ -9F698 GID Size 04 (4) │ │ │ │ -9F699 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9F69D CENTRAL HEADER #68 02014B50 (33639248) │ │ │ │ -9F6A1 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9F6A2 Created OS 03 (3) 'Unix' │ │ │ │ -9F6A3 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9F6A4 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9F6A5 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9F6A7 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9F6A9 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9F6AD CRC 3D4C1AC5 (1028397765) │ │ │ │ -9F6B1 Compressed Size 00003E80 (16000) │ │ │ │ -9F6B5 Uncompressed Size 0001C17C (115068) │ │ │ │ -9F6B9 Filename Length 0019 (25) │ │ │ │ -9F6BB Extra Length 0018 (24) │ │ │ │ -9F6BD Comment Length 0000 (0) │ │ │ │ -9F6BF Disk Start 0000 (0) │ │ │ │ -9F6C1 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9F6C3 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9F6C7 Local Header Offset 00077C0D (490509) │ │ │ │ -9F6CB Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9F6CB: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9F6E4 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9F6E6 Length 0005 (5) │ │ │ │ -9F6E8 Flags 01 (1) 'Modification' │ │ │ │ -9F6E9 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9F6ED Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9F6EF Length 000B (11) │ │ │ │ -9F6F1 Version 01 (1) │ │ │ │ -9F6F2 UID Size 04 (4) │ │ │ │ -9F6F3 UID 00000000 (0) │ │ │ │ -9F6F7 GID Size 04 (4) │ │ │ │ -9F6F8 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9F6FC CENTRAL HEADER #69 02014B50 (33639248) │ │ │ │ -9F700 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9F701 Created OS 03 (3) 'Unix' │ │ │ │ -9F702 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9F703 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9F704 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9F706 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9F708 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9F70C CRC B300AC31 (3003165745) │ │ │ │ -9F710 Compressed Size 00000838 (2104) │ │ │ │ -9F714 Uncompressed Size 00003384 (13188) │ │ │ │ -9F718 Filename Length 0011 (17) │ │ │ │ -9F71A Extra Length 0018 (24) │ │ │ │ -9F71C Comment Length 0000 (0) │ │ │ │ -9F71E Disk Start 0000 (0) │ │ │ │ -9F720 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9F722 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9F726 Local Header Offset 0007BAE0 (506592) │ │ │ │ -9F72A Filename 'XXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9F72A: Filename 'XXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9F73B Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9F73D Length 0005 (5) │ │ │ │ -9F73F Flags 01 (1) 'Modification' │ │ │ │ -9F740 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9F744 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9F746 Length 000B (11) │ │ │ │ -9F748 Version 01 (1) │ │ │ │ -9F749 UID Size 04 (4) │ │ │ │ -9F74A UID 00000000 (0) │ │ │ │ -9F74E GID Size 04 (4) │ │ │ │ -9F74F GID 00000000 (0) │ │ │ │ - │ │ │ │ -9F753 CENTRAL HEADER #70 02014B50 (33639248) │ │ │ │ -9F757 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9F758 Created OS 03 (3) 'Unix' │ │ │ │ -9F759 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9F75A Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9F75B General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9F75D Compression Method 0008 (8) 'Deflated' │ │ │ │ -9F75F Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9F763 CRC 02590B0F (39389967) │ │ │ │ -9F767 Compressed Size 000051A8 (20904) │ │ │ │ -9F76B Uncompressed Size 0001FBE0 (130016) │ │ │ │ -9F76F Filename Length 0015 (21) │ │ │ │ -9F771 Extra Length 0018 (24) │ │ │ │ -9F773 Comment Length 0000 (0) │ │ │ │ -9F775 Disk Start 0000 (0) │ │ │ │ -9F777 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9F779 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9F77D Local Header Offset 0007C363 (508771) │ │ │ │ -9F781 Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9F781: Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9F796 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9F798 Length 0005 (5) │ │ │ │ -9F79A Flags 01 (1) 'Modification' │ │ │ │ -9F79B Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9F79F Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9F7A1 Length 000B (11) │ │ │ │ -9F7A3 Version 01 (1) │ │ │ │ -9F7A4 UID Size 04 (4) │ │ │ │ -9F7A5 UID 00000000 (0) │ │ │ │ -9F7A9 GID Size 04 (4) │ │ │ │ -9F7AA GID 00000000 (0) │ │ │ │ - │ │ │ │ -9F7AE CENTRAL HEADER #71 02014B50 (33639248) │ │ │ │ -9F7B2 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9F7B3 Created OS 03 (3) 'Unix' │ │ │ │ -9F7B4 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9F7B5 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9F7B6 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9F7B8 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9F7BA Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9F7BE CRC C1807A53 (3246422611) │ │ │ │ -9F7C2 Compressed Size 00001B07 (6919) │ │ │ │ -9F7C6 Uncompressed Size 000081D0 (33232) │ │ │ │ -9F7CA Filename Length 0019 (25) │ │ │ │ -9F7CC Extra Length 0018 (24) │ │ │ │ -9F7CE Comment Length 0000 (0) │ │ │ │ -9F7D0 Disk Start 0000 (0) │ │ │ │ -9F7D2 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9F7D4 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9F7D8 Local Header Offset 0008155A (529754) │ │ │ │ -9F7DC Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9F7DC: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9F7F5 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9F7F7 Length 0005 (5) │ │ │ │ -9F7F9 Flags 01 (1) 'Modification' │ │ │ │ -9F7FA Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9F7FE Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9F800 Length 000B (11) │ │ │ │ -9F802 Version 01 (1) │ │ │ │ -9F803 UID Size 04 (4) │ │ │ │ -9F804 UID 00000000 (0) │ │ │ │ -9F808 GID Size 04 (4) │ │ │ │ -9F809 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9F80D CENTRAL HEADER #72 02014B50 (33639248) │ │ │ │ -9F811 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9F812 Created OS 03 (3) 'Unix' │ │ │ │ -9F813 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9F814 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9F815 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9F817 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9F819 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9F81D CRC 9189CEB3 (2441727667) │ │ │ │ -9F821 Compressed Size 00000D99 (3481) │ │ │ │ -9F825 Uncompressed Size 00002EA0 (11936) │ │ │ │ -9F829 Filename Length 0018 (24) │ │ │ │ -9F82B Extra Length 0018 (24) │ │ │ │ -9F82D Comment Length 0000 (0) │ │ │ │ -9F82F Disk Start 0000 (0) │ │ │ │ -9F831 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9F833 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9F837 Local Header Offset 000830B4 (536756) │ │ │ │ -9F83B Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9F83B: Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9F853 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9F855 Length 0005 (5) │ │ │ │ -9F857 Flags 01 (1) 'Modification' │ │ │ │ -9F858 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9F85C Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9F85E Length 000B (11) │ │ │ │ -9F860 Version 01 (1) │ │ │ │ -9F861 UID Size 04 (4) │ │ │ │ -9F862 UID 00000000 (0) │ │ │ │ -9F866 GID Size 04 (4) │ │ │ │ -9F867 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9F86B CENTRAL HEADER #73 02014B50 (33639248) │ │ │ │ -9F86F Created Zip Spec 3D (61) '6.1' │ │ │ │ -9F870 Created OS 03 (3) 'Unix' │ │ │ │ -9F871 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9F872 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9F873 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9F875 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9F877 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9F87B CRC C1ECA9DB (3253512667) │ │ │ │ -9F87F Compressed Size 000001E1 (481) │ │ │ │ -9F883 Uncompressed Size 00000324 (804) │ │ │ │ -9F887 Filename Length 0011 (17) │ │ │ │ -9F889 Extra Length 0018 (24) │ │ │ │ -9F88B Comment Length 0000 (0) │ │ │ │ -9F88D Disk Start 0000 (0) │ │ │ │ -9F88F Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9F891 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9F895 Local Header Offset 00083E9F (540319) │ │ │ │ -9F899 Filename 'XXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9F899: Filename 'XXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9F8AA Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9F8AC Length 0005 (5) │ │ │ │ -9F8AE Flags 01 (1) 'Modification' │ │ │ │ -9F8AF Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9F8B3 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9F8B5 Length 000B (11) │ │ │ │ -9F8B7 Version 01 (1) │ │ │ │ -9F8B8 UID Size 04 (4) │ │ │ │ -9F8B9 UID 00000000 (0) │ │ │ │ -9F8BD GID Size 04 (4) │ │ │ │ -9F8BE GID 00000000 (0) │ │ │ │ - │ │ │ │ -9F8C2 CENTRAL HEADER #74 02014B50 (33639248) │ │ │ │ -9F8C6 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9F8C7 Created OS 03 (3) 'Unix' │ │ │ │ -9F8C8 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9F8C9 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9F8CA General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9F8CC Compression Method 0008 (8) 'Deflated' │ │ │ │ -9F8CE Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9F8D2 CRC A600F67C (2785080956) │ │ │ │ -9F8D6 Compressed Size 000006C3 (1731) │ │ │ │ -9F8DA Uncompressed Size 0000143A (5178) │ │ │ │ -9F8DE Filename Length 0019 (25) │ │ │ │ -9F8E0 Extra Length 0018 (24) │ │ │ │ -9F8E2 Comment Length 0000 (0) │ │ │ │ -9F8E4 Disk Start 0000 (0) │ │ │ │ -9F8E6 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9F8E8 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9F8EC Local Header Offset 000840CB (540875) │ │ │ │ -9F8F0 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9F8F0: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9F909 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9F90B Length 0005 (5) │ │ │ │ -9F90D Flags 01 (1) 'Modification' │ │ │ │ -9F90E Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9F912 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9F914 Length 000B (11) │ │ │ │ -9F916 Version 01 (1) │ │ │ │ -9F917 UID Size 04 (4) │ │ │ │ -9F918 UID 00000000 (0) │ │ │ │ -9F91C GID Size 04 (4) │ │ │ │ -9F91D GID 00000000 (0) │ │ │ │ - │ │ │ │ -9F921 CENTRAL HEADER #75 02014B50 (33639248) │ │ │ │ -9F925 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9F926 Created OS 03 (3) 'Unix' │ │ │ │ -9F927 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9F928 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9F929 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9F92B Compression Method 0008 (8) 'Deflated' │ │ │ │ -9F92D Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9F931 CRC 155C3697 (358364823) │ │ │ │ -9F935 Compressed Size 00001B8D (7053) │ │ │ │ -9F939 Uncompressed Size 00009F60 (40800) │ │ │ │ -9F93D Filename Length 0018 (24) │ │ │ │ -9F93F Extra Length 0018 (24) │ │ │ │ -9F941 Comment Length 0000 (0) │ │ │ │ -9F943 Disk Start 0000 (0) │ │ │ │ -9F945 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9F947 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9F94B Local Header Offset 000847E1 (542689) │ │ │ │ -9F94F Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9F94F: Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9F967 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9F969 Length 0005 (5) │ │ │ │ -9F96B Flags 01 (1) 'Modification' │ │ │ │ -9F96C Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9F970 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9F972 Length 000B (11) │ │ │ │ -9F974 Version 01 (1) │ │ │ │ -9F975 UID Size 04 (4) │ │ │ │ -9F976 UID 00000000 (0) │ │ │ │ -9F97A GID Size 04 (4) │ │ │ │ -9F97B GID 00000000 (0) │ │ │ │ - │ │ │ │ -9F97F CENTRAL HEADER #76 02014B50 (33639248) │ │ │ │ -9F983 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9F984 Created OS 03 (3) 'Unix' │ │ │ │ -9F985 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9F986 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9F987 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9F989 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9F98B Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9F98F CRC 46789641 (1182307905) │ │ │ │ -9F993 Compressed Size 00001705 (5893) │ │ │ │ -9F997 Uncompressed Size 00008B13 (35603) │ │ │ │ -9F99B Filename Length 0012 (18) │ │ │ │ -9F99D Extra Length 0018 (24) │ │ │ │ -9F99F Comment Length 0000 (0) │ │ │ │ -9F9A1 Disk Start 0000 (0) │ │ │ │ -9F9A3 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9F9A5 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9F9A9 Local Header Offset 000863C0 (549824) │ │ │ │ -9F9AD Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9F9AD: Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9F9BF Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9F9C1 Length 0005 (5) │ │ │ │ -9F9C3 Flags 01 (1) 'Modification' │ │ │ │ -9F9C4 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9F9C8 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9F9CA Length 000B (11) │ │ │ │ -9F9CC Version 01 (1) │ │ │ │ -9F9CD UID Size 04 (4) │ │ │ │ -9F9CE UID 00000000 (0) │ │ │ │ -9F9D2 GID Size 04 (4) │ │ │ │ -9F9D3 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9F9D7 CENTRAL HEADER #77 02014B50 (33639248) │ │ │ │ -9F9DB Created Zip Spec 3D (61) '6.1' │ │ │ │ -9F9DC Created OS 03 (3) 'Unix' │ │ │ │ -9F9DD Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9F9DE Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9F9DF General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9F9E1 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9F9E3 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9F9E7 CRC 0955C117 (156614935) │ │ │ │ -9F9EB Compressed Size 00001E11 (7697) │ │ │ │ -9F9EF Uncompressed Size 00008804 (34820) │ │ │ │ -9F9F3 Filename Length 0016 (22) │ │ │ │ -9F9F5 Extra Length 0018 (24) │ │ │ │ -9F9F7 Comment Length 0000 (0) │ │ │ │ -9F9F9 Disk Start 0000 (0) │ │ │ │ -9F9FB Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9F9FD Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9FA01 Local Header Offset 00087B11 (555793) │ │ │ │ -9FA05 Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9FA05: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9FA1B Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9FA1D Length 0005 (5) │ │ │ │ -9FA1F Flags 01 (1) 'Modification' │ │ │ │ -9FA20 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9FA24 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9FA26 Length 000B (11) │ │ │ │ -9FA28 Version 01 (1) │ │ │ │ -9FA29 UID Size 04 (4) │ │ │ │ -9FA2A UID 00000000 (0) │ │ │ │ -9FA2E GID Size 04 (4) │ │ │ │ -9FA2F GID 00000000 (0) │ │ │ │ - │ │ │ │ -9FA33 CENTRAL HEADER #78 02014B50 (33639248) │ │ │ │ -9FA37 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9FA38 Created OS 03 (3) 'Unix' │ │ │ │ -9FA39 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9FA3A Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9FA3B General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9FA3D Compression Method 0008 (8) 'Deflated' │ │ │ │ -9FA3F Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9FA43 CRC 77D44A26 (2010401318) │ │ │ │ -9FA47 Compressed Size 000029AB (10667) │ │ │ │ -9FA4B Uncompressed Size 0000D050 (53328) │ │ │ │ -9FA4F Filename Length 001A (26) │ │ │ │ -9FA51 Extra Length 0018 (24) │ │ │ │ -9FA53 Comment Length 0000 (0) │ │ │ │ -9FA55 Disk Start 0000 (0) │ │ │ │ -9FA57 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9FA59 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9FA5D Local Header Offset 00089972 (563570) │ │ │ │ -9FA61 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9FA61: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9FA7B Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9FA7D Length 0005 (5) │ │ │ │ -9FA7F Flags 01 (1) 'Modification' │ │ │ │ -9FA80 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9FA84 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9FA86 Length 000B (11) │ │ │ │ -9FA88 Version 01 (1) │ │ │ │ -9FA89 UID Size 04 (4) │ │ │ │ -9FA8A UID 00000000 (0) │ │ │ │ -9FA8E GID Size 04 (4) │ │ │ │ -9FA8F GID 00000000 (0) │ │ │ │ - │ │ │ │ -9FA93 CENTRAL HEADER #79 02014B50 (33639248) │ │ │ │ -9FA97 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9FA98 Created OS 03 (3) 'Unix' │ │ │ │ -9FA99 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9FA9A Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9FA9B General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9FA9D Compression Method 0008 (8) 'Deflated' │ │ │ │ -9FA9F Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9FAA3 CRC 4DD2C149 (1305657673) │ │ │ │ -9FAA7 Compressed Size 000009AC (2476) │ │ │ │ -9FAAB Uncompressed Size 00001DB7 (7607) │ │ │ │ -9FAAF Filename Length 0018 (24) │ │ │ │ -9FAB1 Extra Length 0018 (24) │ │ │ │ -9FAB3 Comment Length 0000 (0) │ │ │ │ -9FAB5 Disk Start 0000 (0) │ │ │ │ -9FAB7 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9FAB9 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9FABD Local Header Offset 0008C371 (574321) │ │ │ │ -9FAC1 Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9FAC1: Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9FAD9 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9FADB Length 0005 (5) │ │ │ │ -9FADD Flags 01 (1) 'Modification' │ │ │ │ -9FADE Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9FAE2 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9FAE4 Length 000B (11) │ │ │ │ -9FAE6 Version 01 (1) │ │ │ │ -9FAE7 UID Size 04 (4) │ │ │ │ -9FAE8 UID 00000000 (0) │ │ │ │ -9FAEC GID Size 04 (4) │ │ │ │ -9FAED GID 00000000 (0) │ │ │ │ - │ │ │ │ -9FAF1 CENTRAL HEADER #80 02014B50 (33639248) │ │ │ │ -9FAF5 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9FAF6 Created OS 03 (3) 'Unix' │ │ │ │ -9FAF7 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9FAF8 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9FAF9 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9FAFB Compression Method 0008 (8) 'Deflated' │ │ │ │ -9FAFD Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9FB01 CRC F5E2129F (4125233823) │ │ │ │ -9FB05 Compressed Size 000016BC (5820) │ │ │ │ -9FB09 Uncompressed Size 000016CD (5837) │ │ │ │ -9FB0D Filename Length 0015 (21) │ │ │ │ -9FB0F Extra Length 0018 (24) │ │ │ │ -9FB11 Comment Length 0000 (0) │ │ │ │ -9FB13 Disk Start 0000 (0) │ │ │ │ -9FB15 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9FB17 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9FB1B Local Header Offset 0008CD6F (576879) │ │ │ │ -9FB1F Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9FB1F: Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9FB34 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9FB36 Length 0005 (5) │ │ │ │ -9FB38 Flags 01 (1) 'Modification' │ │ │ │ -9FB39 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9FB3D Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9FB3F Length 000B (11) │ │ │ │ -9FB41 Version 01 (1) │ │ │ │ -9FB42 UID Size 04 (4) │ │ │ │ -9FB43 UID 00000000 (0) │ │ │ │ -9FB47 GID Size 04 (4) │ │ │ │ -9FB48 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9FB4C CENTRAL HEADER #81 02014B50 (33639248) │ │ │ │ -9FB50 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9FB51 Created OS 03 (3) 'Unix' │ │ │ │ -9FB52 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9FB53 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9FB54 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9FB56 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9FB58 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9FB5C CRC F5E2129F (4125233823) │ │ │ │ -9FB60 Compressed Size 000016BC (5820) │ │ │ │ -9FB64 Uncompressed Size 000016CD (5837) │ │ │ │ -9FB68 Filename Length 001C (28) │ │ │ │ -9FB6A Extra Length 0018 (24) │ │ │ │ -9FB6C Comment Length 0000 (0) │ │ │ │ -9FB6E Disk Start 0000 (0) │ │ │ │ -9FB70 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9FB72 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9FB76 Local Header Offset 0008E47A (582778) │ │ │ │ -9FB7A Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9FB7A: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9FB96 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9FB98 Length 0005 (5) │ │ │ │ -9FB9A Flags 01 (1) 'Modification' │ │ │ │ -9FB9B Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9FB9F Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9FBA1 Length 000B (11) │ │ │ │ -9FBA3 Version 01 (1) │ │ │ │ -9FBA4 UID Size 04 (4) │ │ │ │ -9FBA5 UID 00000000 (0) │ │ │ │ -9FBA9 GID Size 04 (4) │ │ │ │ -9FBAA GID 00000000 (0) │ │ │ │ - │ │ │ │ -9FBAE CENTRAL HEADER #82 02014B50 (33639248) │ │ │ │ -9FBB2 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9FBB3 Created OS 03 (3) 'Unix' │ │ │ │ -9FBB4 Extract Zip Spec 0A (10) '1.0' │ │ │ │ -9FBB5 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9FBB6 General Purpose Flag 0000 (0) │ │ │ │ -9FBB8 Compression Method 0000 (0) 'Stored' │ │ │ │ -9FBBA Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9FBBE CRC FC95F24B (4237685323) │ │ │ │ -9FBC2 Compressed Size 00001B84 (7044) │ │ │ │ -9FBC6 Uncompressed Size 00001B84 (7044) │ │ │ │ -9FBCA Filename Length 0016 (22) │ │ │ │ -9FBCC Extra Length 0018 (24) │ │ │ │ -9FBCE Comment Length 0000 (0) │ │ │ │ -9FBD0 Disk Start 0000 (0) │ │ │ │ -9FBD2 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9FBD4 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9FBD8 Local Header Offset 0008FB8C (588684) │ │ │ │ -9FBDC Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9FBDC: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9FBF2 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9FBF4 Length 0005 (5) │ │ │ │ -9FBF6 Flags 01 (1) 'Modification' │ │ │ │ -9FBF7 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9FBFB Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9FBFD Length 000B (11) │ │ │ │ -9FBFF Version 01 (1) │ │ │ │ -9FC00 UID Size 04 (4) │ │ │ │ -9FC01 UID 00000000 (0) │ │ │ │ -9FC05 GID Size 04 (4) │ │ │ │ -9FC06 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9FC0A CENTRAL HEADER #83 02014B50 (33639248) │ │ │ │ -9FC0E Created Zip Spec 3D (61) '6.1' │ │ │ │ -9FC0F Created OS 03 (3) 'Unix' │ │ │ │ -9FC10 Extract Zip Spec 0A (10) '1.0' │ │ │ │ -9FC11 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9FC12 General Purpose Flag 0000 (0) │ │ │ │ -9FC14 Compression Method 0000 (0) 'Stored' │ │ │ │ -9FC16 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9FC1A CRC D0D71F86 (3503759238) │ │ │ │ -9FC1E Compressed Size 00000B7B (2939) │ │ │ │ -9FC22 Uncompressed Size 00000B7B (2939) │ │ │ │ -9FC26 Filename Length 0016 (22) │ │ │ │ -9FC28 Extra Length 0018 (24) │ │ │ │ -9FC2A Comment Length 0000 (0) │ │ │ │ -9FC2C Disk Start 0000 (0) │ │ │ │ -9FC2E Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9FC30 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9FC34 Local Header Offset 00091760 (595808) │ │ │ │ -9FC38 Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9FC38: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9FC4E Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9FC50 Length 0005 (5) │ │ │ │ -9FC52 Flags 01 (1) 'Modification' │ │ │ │ -9FC53 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9FC57 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9FC59 Length 000B (11) │ │ │ │ -9FC5B Version 01 (1) │ │ │ │ -9FC5C UID Size 04 (4) │ │ │ │ -9FC5D UID 00000000 (0) │ │ │ │ -9FC61 GID Size 04 (4) │ │ │ │ -9FC62 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9FC66 CENTRAL HEADER #84 02014B50 (33639248) │ │ │ │ -9FC6A Created Zip Spec 3D (61) '6.1' │ │ │ │ -9FC6B Created OS 03 (3) 'Unix' │ │ │ │ -9FC6C Extract Zip Spec 0A (10) '1.0' │ │ │ │ -9FC6D Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9FC6E General Purpose Flag 0000 (0) │ │ │ │ -9FC70 Compression Method 0000 (0) 'Stored' │ │ │ │ -9FC72 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9FC76 CRC FFF9C4D2 (4294558930) │ │ │ │ -9FC7A Compressed Size 0000138F (5007) │ │ │ │ -9FC7E Uncompressed Size 0000138F (5007) │ │ │ │ -9FC82 Filename Length 0016 (22) │ │ │ │ -9FC84 Extra Length 0018 (24) │ │ │ │ -9FC86 Comment Length 0000 (0) │ │ │ │ -9FC88 Disk Start 0000 (0) │ │ │ │ -9FC8A Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9FC8C Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9FC90 Local Header Offset 0009232B (598827) │ │ │ │ -9FC94 Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9FC94: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9FCAA Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9FCAC Length 0005 (5) │ │ │ │ -9FCAE Flags 01 (1) 'Modification' │ │ │ │ -9FCAF Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9FCB3 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9FCB5 Length 000B (11) │ │ │ │ -9FCB7 Version 01 (1) │ │ │ │ -9FCB8 UID Size 04 (4) │ │ │ │ -9FCB9 UID 00000000 (0) │ │ │ │ -9FCBD GID Size 04 (4) │ │ │ │ -9FCBE GID 00000000 (0) │ │ │ │ - │ │ │ │ -9FCC2 CENTRAL HEADER #85 02014B50 (33639248) │ │ │ │ -9FCC6 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9FCC7 Created OS 03 (3) 'Unix' │ │ │ │ -9FCC8 Extract Zip Spec 0A (10) '1.0' │ │ │ │ -9FCC9 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9FCCA General Purpose Flag 0000 (0) │ │ │ │ -9FCCC Compression Method 0000 (0) 'Stored' │ │ │ │ -9FCCE Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9FCD2 CRC A1037E8E (2701360782) │ │ │ │ -9FCD6 Compressed Size 0000145E (5214) │ │ │ │ -9FCDA Uncompressed Size 0000145E (5214) │ │ │ │ -9FCDE Filename Length 0016 (22) │ │ │ │ -9FCE0 Extra Length 0018 (24) │ │ │ │ -9FCE2 Comment Length 0000 (0) │ │ │ │ -9FCE4 Disk Start 0000 (0) │ │ │ │ -9FCE6 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9FCE8 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9FCEC Local Header Offset 0009370A (603914) │ │ │ │ -9FCF0 Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9FCF0: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9FD06 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9FD08 Length 0005 (5) │ │ │ │ -9FD0A Flags 01 (1) 'Modification' │ │ │ │ -9FD0B Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9FD0F Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9FD11 Length 000B (11) │ │ │ │ -9FD13 Version 01 (1) │ │ │ │ -9FD14 UID Size 04 (4) │ │ │ │ -9FD15 UID 00000000 (0) │ │ │ │ -9FD19 GID Size 04 (4) │ │ │ │ -9FD1A GID 00000000 (0) │ │ │ │ - │ │ │ │ -9FD1E CENTRAL HEADER #86 02014B50 (33639248) │ │ │ │ -9FD22 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9FD23 Created OS 03 (3) 'Unix' │ │ │ │ -9FD24 Extract Zip Spec 0A (10) '1.0' │ │ │ │ -9FD25 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9FD26 General Purpose Flag 0000 (0) │ │ │ │ -9FD28 Compression Method 0000 (0) 'Stored' │ │ │ │ -9FD2A Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9FD2E CRC 5E9E64F1 (1587438833) │ │ │ │ -9FD32 Compressed Size 000008EC (2284) │ │ │ │ -9FD36 Uncompressed Size 000008EC (2284) │ │ │ │ -9FD3A Filename Length 0016 (22) │ │ │ │ -9FD3C Extra Length 0018 (24) │ │ │ │ -9FD3E Comment Length 0000 (0) │ │ │ │ -9FD40 Disk Start 0000 (0) │ │ │ │ -9FD42 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9FD44 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9FD48 Local Header Offset 00094BB8 (609208) │ │ │ │ -9FD4C Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9FD4C: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9FD62 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9FD64 Length 0005 (5) │ │ │ │ -9FD66 Flags 01 (1) 'Modification' │ │ │ │ -9FD67 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9FD6B Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9FD6D Length 000B (11) │ │ │ │ -9FD6F Version 01 (1) │ │ │ │ -9FD70 UID Size 04 (4) │ │ │ │ -9FD71 UID 00000000 (0) │ │ │ │ -9FD75 GID Size 04 (4) │ │ │ │ -9FD76 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9FD7A CENTRAL HEADER #87 02014B50 (33639248) │ │ │ │ -9FD7E Created Zip Spec 3D (61) '6.1' │ │ │ │ -9FD7F Created OS 03 (3) 'Unix' │ │ │ │ -9FD80 Extract Zip Spec 0A (10) '1.0' │ │ │ │ -9FD81 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9FD82 General Purpose Flag 0000 (0) │ │ │ │ -9FD84 Compression Method 0000 (0) 'Stored' │ │ │ │ -9FD86 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9FD8A CRC 42E340AB (1122189483) │ │ │ │ -9FD8E Compressed Size 00001F2E (7982) │ │ │ │ -9FD92 Uncompressed Size 00001F2E (7982) │ │ │ │ -9FD96 Filename Length 001E (30) │ │ │ │ -9FD98 Extra Length 0018 (24) │ │ │ │ -9FD9A Comment Length 0000 (0) │ │ │ │ -9FD9C Disk Start 0000 (0) │ │ │ │ -9FD9E Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9FDA0 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9FDA4 Local Header Offset 000954F4 (611572) │ │ │ │ -9FDA8 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9FDA8: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9FDC6 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9FDC8 Length 0005 (5) │ │ │ │ -9FDCA Flags 01 (1) 'Modification' │ │ │ │ -9FDCB Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9FDCF Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9FDD1 Length 000B (11) │ │ │ │ -9FDD3 Version 01 (1) │ │ │ │ -9FDD4 UID Size 04 (4) │ │ │ │ -9FDD5 UID 00000000 (0) │ │ │ │ -9FDD9 GID Size 04 (4) │ │ │ │ -9FDDA GID 00000000 (0) │ │ │ │ - │ │ │ │ -9FDDE CENTRAL HEADER #88 02014B50 (33639248) │ │ │ │ -9FDE2 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9FDE3 Created OS 03 (3) 'Unix' │ │ │ │ -9FDE4 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9FDE5 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9FDE6 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9FDE8 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9FDEA Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9FDEE CRC B21943AB (2988000171) │ │ │ │ -9FDF2 Compressed Size 00003D6E (15726) │ │ │ │ -9FDF6 Uncompressed Size 0001664A (91722) │ │ │ │ -9FDFA Filename Length 001A (26) │ │ │ │ -9FDFC Extra Length 0018 (24) │ │ │ │ -9FDFE Comment Length 0000 (0) │ │ │ │ -9FE00 Disk Start 0000 (0) │ │ │ │ -9FE02 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9FE04 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9FE08 Local Header Offset 0009747A (619642) │ │ │ │ -9FE0C Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9FE0C: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9FE26 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9FE28 Length 0005 (5) │ │ │ │ -9FE2A Flags 01 (1) 'Modification' │ │ │ │ -9FE2B Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9FE2F Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9FE31 Length 000B (11) │ │ │ │ -9FE33 Version 01 (1) │ │ │ │ -9FE34 UID Size 04 (4) │ │ │ │ -9FE35 UID 00000000 (0) │ │ │ │ -9FE39 GID Size 04 (4) │ │ │ │ -9FE3A GID 00000000 (0) │ │ │ │ - │ │ │ │ -9FE3E CENTRAL HEADER #89 02014B50 (33639248) │ │ │ │ -9FE42 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9FE43 Created OS 03 (3) 'Unix' │ │ │ │ -9FE44 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9FE45 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9FE46 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9FE48 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9FE4A Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9FE4E CRC 107A8FFA (276467706) │ │ │ │ -9FE52 Compressed Size 000029CC (10700) │ │ │ │ -9FE56 Uncompressed Size 0000BB3A (47930) │ │ │ │ -9FE5A Filename Length 0018 (24) │ │ │ │ -9FE5C Extra Length 0018 (24) │ │ │ │ -9FE5E Comment Length 0000 (0) │ │ │ │ -9FE60 Disk Start 0000 (0) │ │ │ │ -9FE62 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9FE64 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9FE68 Local Header Offset 0009B23C (635452) │ │ │ │ -9FE6C Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9FE6C: Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9FE84 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9FE86 Length 0005 (5) │ │ │ │ -9FE88 Flags 01 (1) 'Modification' │ │ │ │ -9FE89 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9FE8D Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9FE8F Length 000B (11) │ │ │ │ -9FE91 Version 01 (1) │ │ │ │ -9FE92 UID Size 04 (4) │ │ │ │ -9FE93 UID 00000000 (0) │ │ │ │ -9FE97 GID Size 04 (4) │ │ │ │ -9FE98 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9FE9C CENTRAL HEADER #90 02014B50 (33639248) │ │ │ │ -9FEA0 Created Zip Spec 3D (61) '6.1' │ │ │ │ -9FEA1 Created OS 03 (3) 'Unix' │ │ │ │ -9FEA2 Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9FEA3 Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9FEA4 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9FEA6 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9FEA8 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9FEAC CRC DCB3B516 (3702764822) │ │ │ │ -9FEB0 Compressed Size 000000AE (174) │ │ │ │ -9FEB4 Uncompressed Size 000000FC (252) │ │ │ │ -9FEB8 Filename Length 0016 (22) │ │ │ │ -9FEBA Extra Length 0018 (24) │ │ │ │ -9FEBC Comment Length 0000 (0) │ │ │ │ -9FEBE Disk Start 0000 (0) │ │ │ │ -9FEC0 Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9FEC2 Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9FEC6 Local Header Offset 0009DC5A (646234) │ │ │ │ -9FECA Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9FECA: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9FEE0 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9FEE2 Length 0005 (5) │ │ │ │ -9FEE4 Flags 01 (1) 'Modification' │ │ │ │ -9FEE5 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9FEE9 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9FEEB Length 000B (11) │ │ │ │ -9FEED Version 01 (1) │ │ │ │ -9FEEE UID Size 04 (4) │ │ │ │ -9FEEF UID 00000000 (0) │ │ │ │ -9FEF3 GID Size 04 (4) │ │ │ │ -9FEF4 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9FEF8 CENTRAL HEADER #91 02014B50 (33639248) │ │ │ │ -9FEFC Created Zip Spec 3D (61) '6.1' │ │ │ │ -9FEFD Created OS 03 (3) 'Unix' │ │ │ │ -9FEFE Extract Zip Spec 14 (20) '2.0' │ │ │ │ -9FEFF Extract OS 00 (0) 'MS-DOS' │ │ │ │ -9FF00 General Purpose Flag 0000 (0) │ │ │ │ - [Bits 1-2] 0 'Normal Compression' │ │ │ │ -9FF02 Compression Method 0008 (8) 'Deflated' │ │ │ │ -9FF04 Modification Time 5C9648F0 (1553352944) 'Wed Apr 22 09:07:32 2026' │ │ │ │ -9FF08 CRC 58439733 (1480824627) │ │ │ │ -9FF0C Compressed Size 00000077 (119) │ │ │ │ -9FF10 Uncompressed Size 000000A2 (162) │ │ │ │ -9FF14 Filename Length 002D (45) │ │ │ │ -9FF16 Extra Length 0018 (24) │ │ │ │ -9FF18 Comment Length 0000 (0) │ │ │ │ -9FF1A Disk Start 0000 (0) │ │ │ │ -9FF1C Int File Attributes 0000 (0) │ │ │ │ - [Bit 0] 0 'Binary Data' │ │ │ │ -9FF1E Ext File Attributes 01A40000 (27525120) │ │ │ │ - [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ -9FF22 Local Header Offset 0009DD58 (646488) │ │ │ │ -9FF26 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# │ │ │ │ -# WARNING: Offset 0x9FF26: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ -# Zero length filename │ │ │ │ -# │ │ │ │ -9FF53 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ -9FF55 Length 0005 (5) │ │ │ │ -9FF57 Flags 01 (1) 'Modification' │ │ │ │ -9FF58 Modification Time 69E88FD5 (1776848853) 'Wed Apr 22 09:07:33 2026' │ │ │ │ -9FF5C Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ -9FF5E Length 000B (11) │ │ │ │ -9FF60 Version 01 (1) │ │ │ │ -9FF61 UID Size 04 (4) │ │ │ │ -9FF62 UID 00000000 (0) │ │ │ │ -9FF66 GID Size 04 (4) │ │ │ │ -9FF67 GID 00000000 (0) │ │ │ │ - │ │ │ │ -9FF6B END CENTRAL HEADER 06054B50 (101010256) │ │ │ │ -9FF6F Number of this disk 0000 (0) │ │ │ │ -9FF71 Central Dir Disk no 0000 (0) │ │ │ │ -9FF73 Entries in this disk 005B (91) │ │ │ │ -9FF75 Total Entries 005B (91) │ │ │ │ -9FF77 Size of Central Dir 00002135 (8501) │ │ │ │ -9FF7B Offset to Central Dir 0009DE36 (646710) │ │ │ │ -9FF7F Comment Length 0000 (0) │ │ │ │ +9DD46 LOCAL HEADER #91 04034B50 (67324752) │ │ │ │ +9DD4A Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9DD4B Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9DD4C General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9DD4E Compression Method 0008 (8) 'Deflated' │ │ │ │ +9DD50 Modification Time 5C9B8587 (1553696135) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9DD54 CRC 58439733 (1480824627) │ │ │ │ +9DD58 Compressed Size 00000077 (119) │ │ │ │ +9DD5C Uncompressed Size 000000A2 (162) │ │ │ │ +9DD60 Filename Length 002D (45) │ │ │ │ +9DD62 Extra Length 001C (28) │ │ │ │ +9DD64 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9DD64: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9DD91 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9DD93 Length 0009 (9) │ │ │ │ +9DD95 Flags 03 (3) 'Modification Access' │ │ │ │ +9DD96 Modification Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9DD9A Access Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9DD9E Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9DDA0 Length 000B (11) │ │ │ │ +9DDA2 Version 01 (1) │ │ │ │ +9DDA3 UID Size 04 (4) │ │ │ │ +9DDA4 UID 00000000 (0) │ │ │ │ +9DDA8 GID Size 04 (4) │ │ │ │ +9DDA9 GID 00000000 (0) │ │ │ │ +9DDAD PAYLOAD XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX │ │ │ │ + │ │ │ │ +9DE24 CENTRAL HEADER #1 02014B50 (33639248) │ │ │ │ +9DE28 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9DE29 Created OS 03 (3) 'Unix' │ │ │ │ +9DE2A Extract Zip Spec 0A (10) '1.0' │ │ │ │ +9DE2B Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9DE2C General Purpose Flag 0000 (0) │ │ │ │ +9DE2E Compression Method 0000 (0) 'Stored' │ │ │ │ +9DE30 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9DE34 CRC 2CAB616F (749429103) │ │ │ │ +9DE38 Compressed Size 00000014 (20) │ │ │ │ +9DE3C Uncompressed Size 00000014 (20) │ │ │ │ +9DE40 Filename Length 0008 (8) │ │ │ │ +9DE42 Extra Length 0018 (24) │ │ │ │ +9DE44 Comment Length 0000 (0) │ │ │ │ +9DE46 Disk Start 0000 (0) │ │ │ │ +9DE48 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9DE4A Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9DE4E Local Header Offset 00000000 (0) │ │ │ │ +9DE52 Filename 'XXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9DE52: Filename 'XXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9DE5A Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9DE5C Length 0005 (5) │ │ │ │ +9DE5E Flags 01 (1) 'Modification' │ │ │ │ +9DE5F Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9DE63 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9DE65 Length 000B (11) │ │ │ │ +9DE67 Version 01 (1) │ │ │ │ +9DE68 UID Size 04 (4) │ │ │ │ +9DE69 UID 00000000 (0) │ │ │ │ +9DE6D GID Size 04 (4) │ │ │ │ +9DE6E GID 00000000 (0) │ │ │ │ + │ │ │ │ +9DE72 CENTRAL HEADER #2 02014B50 (33639248) │ │ │ │ +9DE76 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9DE77 Created OS 03 (3) 'Unix' │ │ │ │ +9DE78 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9DE79 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9DE7A General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9DE7C Compression Method 0008 (8) 'Deflated' │ │ │ │ +9DE7E Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9DE82 CRC AC138643 (2886960707) │ │ │ │ +9DE86 Compressed Size 000015AD (5549) │ │ │ │ +9DE8A Uncompressed Size 00004603 (17923) │ │ │ │ +9DE8E Filename Length 0014 (20) │ │ │ │ +9DE90 Extra Length 0018 (24) │ │ │ │ +9DE92 Comment Length 0000 (0) │ │ │ │ +9DE94 Disk Start 0000 (0) │ │ │ │ +9DE96 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9DE98 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9DE9C Local Header Offset 00000056 (86) │ │ │ │ +9DEA0 Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9DEA0: Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9DEB4 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9DEB6 Length 0005 (5) │ │ │ │ +9DEB8 Flags 01 (1) 'Modification' │ │ │ │ +9DEB9 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9DEBD Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9DEBF Length 000B (11) │ │ │ │ +9DEC1 Version 01 (1) │ │ │ │ +9DEC2 UID Size 04 (4) │ │ │ │ +9DEC3 UID 00000000 (0) │ │ │ │ +9DEC7 GID Size 04 (4) │ │ │ │ +9DEC8 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9DECC CENTRAL HEADER #3 02014B50 (33639248) │ │ │ │ +9DED0 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9DED1 Created OS 03 (3) 'Unix' │ │ │ │ +9DED2 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9DED3 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9DED4 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9DED6 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9DED8 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9DEDC CRC 02C7C4B0 (46646448) │ │ │ │ +9DEE0 Compressed Size 000006D6 (1750) │ │ │ │ +9DEE4 Uncompressed Size 00001242 (4674) │ │ │ │ +9DEE8 Filename Length 0013 (19) │ │ │ │ +9DEEA Extra Length 0018 (24) │ │ │ │ +9DEEC Comment Length 0000 (0) │ │ │ │ +9DEEE Disk Start 0000 (0) │ │ │ │ +9DEF0 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9DEF2 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9DEF6 Local Header Offset 00001651 (5713) │ │ │ │ +9DEFA Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9DEFA: Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9DF0D Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9DF0F Length 0005 (5) │ │ │ │ +9DF11 Flags 01 (1) 'Modification' │ │ │ │ +9DF12 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9DF16 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9DF18 Length 000B (11) │ │ │ │ +9DF1A Version 01 (1) │ │ │ │ +9DF1B UID Size 04 (4) │ │ │ │ +9DF1C UID 00000000 (0) │ │ │ │ +9DF20 GID Size 04 (4) │ │ │ │ +9DF21 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9DF25 CENTRAL HEADER #4 02014B50 (33639248) │ │ │ │ +9DF29 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9DF2A Created OS 03 (3) 'Unix' │ │ │ │ +9DF2B Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9DF2C Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9DF2D General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9DF2F Compression Method 0008 (8) 'Deflated' │ │ │ │ +9DF31 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9DF35 CRC AA4D5C72 (2857196658) │ │ │ │ +9DF39 Compressed Size 00002D9F (11679) │ │ │ │ +9DF3D Uncompressed Size 0000D0C0 (53440) │ │ │ │ +9DF41 Filename Length 0014 (20) │ │ │ │ +9DF43 Extra Length 0018 (24) │ │ │ │ +9DF45 Comment Length 0000 (0) │ │ │ │ +9DF47 Disk Start 0000 (0) │ │ │ │ +9DF49 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9DF4B Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9DF4F Local Header Offset 00001D74 (7540) │ │ │ │ +9DF53 Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9DF53: Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9DF67 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9DF69 Length 0005 (5) │ │ │ │ +9DF6B Flags 01 (1) 'Modification' │ │ │ │ +9DF6C Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9DF70 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9DF72 Length 000B (11) │ │ │ │ +9DF74 Version 01 (1) │ │ │ │ +9DF75 UID Size 04 (4) │ │ │ │ +9DF76 UID 00000000 (0) │ │ │ │ +9DF7A GID Size 04 (4) │ │ │ │ +9DF7B GID 00000000 (0) │ │ │ │ + │ │ │ │ +9DF7F CENTRAL HEADER #5 02014B50 (33639248) │ │ │ │ +9DF83 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9DF84 Created OS 03 (3) 'Unix' │ │ │ │ +9DF85 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9DF86 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9DF87 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9DF89 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9DF8B Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9DF8F CRC 701446B8 (1880377016) │ │ │ │ +9DF93 Compressed Size 000003F1 (1009) │ │ │ │ +9DF97 Uncompressed Size 00000877 (2167) │ │ │ │ +9DF9B Filename Length 0014 (20) │ │ │ │ +9DF9D Extra Length 0018 (24) │ │ │ │ +9DF9F Comment Length 0000 (0) │ │ │ │ +9DFA1 Disk Start 0000 (0) │ │ │ │ +9DFA3 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9DFA5 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9DFA9 Local Header Offset 00004B61 (19297) │ │ │ │ +9DFAD Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9DFAD: Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9DFC1 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9DFC3 Length 0005 (5) │ │ │ │ +9DFC5 Flags 01 (1) 'Modification' │ │ │ │ +9DFC6 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9DFCA Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9DFCC Length 000B (11) │ │ │ │ +9DFCE Version 01 (1) │ │ │ │ +9DFCF UID Size 04 (4) │ │ │ │ +9DFD0 UID 00000000 (0) │ │ │ │ +9DFD4 GID Size 04 (4) │ │ │ │ +9DFD5 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9DFD9 CENTRAL HEADER #6 02014B50 (33639248) │ │ │ │ +9DFDD Created Zip Spec 3D (61) '6.1' │ │ │ │ +9DFDE Created OS 03 (3) 'Unix' │ │ │ │ +9DFDF Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9DFE0 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9DFE1 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9DFE3 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9DFE5 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9DFE9 CRC 8666CBE3 (2254883811) │ │ │ │ +9DFED Compressed Size 000001AF (431) │ │ │ │ +9DFF1 Uncompressed Size 000002FE (766) │ │ │ │ +9DFF5 Filename Length 0011 (17) │ │ │ │ +9DFF7 Extra Length 0018 (24) │ │ │ │ +9DFF9 Comment Length 0000 (0) │ │ │ │ +9DFFB Disk Start 0000 (0) │ │ │ │ +9DFFD Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9DFFF Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9E003 Local Header Offset 00004FA0 (20384) │ │ │ │ +9E007 Filename 'XXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9E007: Filename 'XXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9E018 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9E01A Length 0005 (5) │ │ │ │ +9E01C Flags 01 (1) 'Modification' │ │ │ │ +9E01D Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9E021 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9E023 Length 000B (11) │ │ │ │ +9E025 Version 01 (1) │ │ │ │ +9E026 UID Size 04 (4) │ │ │ │ +9E027 UID 00000000 (0) │ │ │ │ +9E02B GID Size 04 (4) │ │ │ │ +9E02C GID 00000000 (0) │ │ │ │ + │ │ │ │ +9E030 CENTRAL HEADER #7 02014B50 (33639248) │ │ │ │ +9E034 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9E035 Created OS 03 (3) 'Unix' │ │ │ │ +9E036 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9E037 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9E038 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9E03A Compression Method 0008 (8) 'Deflated' │ │ │ │ +9E03C Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9E040 CRC AD1718B2 (2903972018) │ │ │ │ +9E044 Compressed Size 000020C8 (8392) │ │ │ │ +9E048 Uncompressed Size 0000B4B1 (46257) │ │ │ │ +9E04C Filename Length 001B (27) │ │ │ │ +9E04E Extra Length 0018 (24) │ │ │ │ +9E050 Comment Length 0000 (0) │ │ │ │ +9E052 Disk Start 0000 (0) │ │ │ │ +9E054 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9E056 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9E05A Local Header Offset 0000519A (20890) │ │ │ │ +9E05E Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9E05E: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9E079 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9E07B Length 0005 (5) │ │ │ │ +9E07D Flags 01 (1) 'Modification' │ │ │ │ +9E07E Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9E082 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9E084 Length 000B (11) │ │ │ │ +9E086 Version 01 (1) │ │ │ │ +9E087 UID Size 04 (4) │ │ │ │ +9E088 UID 00000000 (0) │ │ │ │ +9E08C GID Size 04 (4) │ │ │ │ +9E08D GID 00000000 (0) │ │ │ │ + │ │ │ │ +9E091 CENTRAL HEADER #8 02014B50 (33639248) │ │ │ │ +9E095 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9E096 Created OS 03 (3) 'Unix' │ │ │ │ +9E097 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9E098 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9E099 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9E09B Compression Method 0008 (8) 'Deflated' │ │ │ │ +9E09D Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9E0A1 CRC 6A77DB59 (1786239833) │ │ │ │ +9E0A5 Compressed Size 00000E70 (3696) │ │ │ │ +9E0A9 Uncompressed Size 000030B3 (12467) │ │ │ │ +9E0AD Filename Length 001D (29) │ │ │ │ +9E0AF Extra Length 0018 (24) │ │ │ │ +9E0B1 Comment Length 0000 (0) │ │ │ │ +9E0B3 Disk Start 0000 (0) │ │ │ │ +9E0B5 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9E0B7 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9E0BB Local Header Offset 000072B7 (29367) │ │ │ │ +9E0BF Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9E0BF: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9E0DC Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9E0DE Length 0005 (5) │ │ │ │ +9E0E0 Flags 01 (1) 'Modification' │ │ │ │ +9E0E1 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9E0E5 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9E0E7 Length 000B (11) │ │ │ │ +9E0E9 Version 01 (1) │ │ │ │ +9E0EA UID Size 04 (4) │ │ │ │ +9E0EB UID 00000000 (0) │ │ │ │ +9E0EF GID Size 04 (4) │ │ │ │ +9E0F0 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9E0F4 CENTRAL HEADER #9 02014B50 (33639248) │ │ │ │ +9E0F8 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9E0F9 Created OS 03 (3) 'Unix' │ │ │ │ +9E0FA Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9E0FB Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9E0FC General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9E0FE Compression Method 0008 (8) 'Deflated' │ │ │ │ +9E100 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9E104 CRC FEBE631B (4273890075) │ │ │ │ +9E108 Compressed Size 00000973 (2419) │ │ │ │ +9E10C Uncompressed Size 00001CB3 (7347) │ │ │ │ +9E110 Filename Length 0019 (25) │ │ │ │ +9E112 Extra Length 0018 (24) │ │ │ │ +9E114 Comment Length 0000 (0) │ │ │ │ +9E116 Disk Start 0000 (0) │ │ │ │ +9E118 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9E11A Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9E11E Local Header Offset 0000817E (33150) │ │ │ │ +9E122 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9E122: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9E13B Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9E13D Length 0005 (5) │ │ │ │ +9E13F Flags 01 (1) 'Modification' │ │ │ │ +9E140 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9E144 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9E146 Length 000B (11) │ │ │ │ +9E148 Version 01 (1) │ │ │ │ +9E149 UID Size 04 (4) │ │ │ │ +9E14A UID 00000000 (0) │ │ │ │ +9E14E GID Size 04 (4) │ │ │ │ +9E14F GID 00000000 (0) │ │ │ │ + │ │ │ │ +9E153 CENTRAL HEADER #10 02014B50 (33639248) │ │ │ │ +9E157 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9E158 Created OS 03 (3) 'Unix' │ │ │ │ +9E159 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9E15A Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9E15B General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9E15D Compression Method 0008 (8) 'Deflated' │ │ │ │ +9E15F Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9E163 CRC 31D57F6C (836075372) │ │ │ │ +9E167 Compressed Size 0000387A (14458) │ │ │ │ +9E16B Uncompressed Size 0000F7F5 (63477) │ │ │ │ +9E16F Filename Length 0015 (21) │ │ │ │ +9E171 Extra Length 0018 (24) │ │ │ │ +9E173 Comment Length 0000 (0) │ │ │ │ +9E175 Disk Start 0000 (0) │ │ │ │ +9E177 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9E179 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9E17D Local Header Offset 00008B44 (35652) │ │ │ │ +9E181 Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9E181: Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9E196 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9E198 Length 0005 (5) │ │ │ │ +9E19A Flags 01 (1) 'Modification' │ │ │ │ +9E19B Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9E19F Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9E1A1 Length 000B (11) │ │ │ │ +9E1A3 Version 01 (1) │ │ │ │ +9E1A4 UID Size 04 (4) │ │ │ │ +9E1A5 UID 00000000 (0) │ │ │ │ +9E1A9 GID Size 04 (4) │ │ │ │ +9E1AA GID 00000000 (0) │ │ │ │ + │ │ │ │ +9E1AE CENTRAL HEADER #11 02014B50 (33639248) │ │ │ │ +9E1B2 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9E1B3 Created OS 03 (3) 'Unix' │ │ │ │ +9E1B4 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9E1B5 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9E1B6 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9E1B8 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9E1BA Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9E1BE CRC BD5B2005 (3176865797) │ │ │ │ +9E1C2 Compressed Size 0000AB03 (43779) │ │ │ │ +9E1C6 Uncompressed Size 0003E052 (254034) │ │ │ │ +9E1CA Filename Length 0012 (18) │ │ │ │ +9E1CC Extra Length 0018 (24) │ │ │ │ +9E1CE Comment Length 0000 (0) │ │ │ │ +9E1D0 Disk Start 0000 (0) │ │ │ │ +9E1D2 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9E1D4 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9E1D8 Local Header Offset 0000C40D (50189) │ │ │ │ +9E1DC Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9E1DC: Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9E1EE Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9E1F0 Length 0005 (5) │ │ │ │ +9E1F2 Flags 01 (1) 'Modification' │ │ │ │ +9E1F3 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9E1F7 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9E1F9 Length 000B (11) │ │ │ │ +9E1FB Version 01 (1) │ │ │ │ +9E1FC UID Size 04 (4) │ │ │ │ +9E1FD UID 00000000 (0) │ │ │ │ +9E201 GID Size 04 (4) │ │ │ │ +9E202 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9E206 CENTRAL HEADER #12 02014B50 (33639248) │ │ │ │ +9E20A Created Zip Spec 3D (61) '6.1' │ │ │ │ +9E20B Created OS 03 (3) 'Unix' │ │ │ │ +9E20C Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9E20D Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9E20E General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9E210 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9E212 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9E216 CRC 0DF5E9A6 (234219942) │ │ │ │ +9E21A Compressed Size 00003B10 (15120) │ │ │ │ +9E21E Uncompressed Size 0001B46D (111725) │ │ │ │ +9E222 Filename Length 0015 (21) │ │ │ │ +9E224 Extra Length 0018 (24) │ │ │ │ +9E226 Comment Length 0000 (0) │ │ │ │ +9E228 Disk Start 0000 (0) │ │ │ │ +9E22A Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9E22C Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9E230 Local Header Offset 00016F5C (94044) │ │ │ │ +9E234 Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9E234: Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9E249 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9E24B Length 0005 (5) │ │ │ │ +9E24D Flags 01 (1) 'Modification' │ │ │ │ +9E24E Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9E252 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9E254 Length 000B (11) │ │ │ │ +9E256 Version 01 (1) │ │ │ │ +9E257 UID Size 04 (4) │ │ │ │ +9E258 UID 00000000 (0) │ │ │ │ +9E25C GID Size 04 (4) │ │ │ │ +9E25D GID 00000000 (0) │ │ │ │ + │ │ │ │ +9E261 CENTRAL HEADER #13 02014B50 (33639248) │ │ │ │ +9E265 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9E266 Created OS 03 (3) 'Unix' │ │ │ │ +9E267 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9E268 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9E269 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9E26B Compression Method 0008 (8) 'Deflated' │ │ │ │ +9E26D Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9E271 CRC 2ECD4327 (785204007) │ │ │ │ +9E275 Compressed Size 00009197 (37271) │ │ │ │ +9E279 Uncompressed Size 0003D596 (251286) │ │ │ │ +9E27D Filename Length 0014 (20) │ │ │ │ +9E27F Extra Length 0018 (24) │ │ │ │ +9E281 Comment Length 0000 (0) │ │ │ │ +9E283 Disk Start 0000 (0) │ │ │ │ +9E285 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9E287 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9E28B Local Header Offset 0001AABB (109243) │ │ │ │ +9E28F Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9E28F: Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9E2A3 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9E2A5 Length 0005 (5) │ │ │ │ +9E2A7 Flags 01 (1) 'Modification' │ │ │ │ +9E2A8 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9E2AC Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9E2AE Length 000B (11) │ │ │ │ +9E2B0 Version 01 (1) │ │ │ │ +9E2B1 UID Size 04 (4) │ │ │ │ +9E2B2 UID 00000000 (0) │ │ │ │ +9E2B6 GID Size 04 (4) │ │ │ │ +9E2B7 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9E2BB CENTRAL HEADER #14 02014B50 (33639248) │ │ │ │ +9E2BF Created Zip Spec 3D (61) '6.1' │ │ │ │ +9E2C0 Created OS 03 (3) 'Unix' │ │ │ │ +9E2C1 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9E2C2 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9E2C3 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9E2C5 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9E2C7 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9E2CB CRC DABB38CE (3669702862) │ │ │ │ +9E2CF Compressed Size 00002A66 (10854) │ │ │ │ +9E2D3 Uncompressed Size 00011520 (70944) │ │ │ │ +9E2D7 Filename Length 0016 (22) │ │ │ │ +9E2D9 Extra Length 0018 (24) │ │ │ │ +9E2DB Comment Length 0000 (0) │ │ │ │ +9E2DD Disk Start 0000 (0) │ │ │ │ +9E2DF Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9E2E1 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9E2E5 Local Header Offset 00023CA0 (146592) │ │ │ │ +9E2E9 Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9E2E9: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9E2FF Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9E301 Length 0005 (5) │ │ │ │ +9E303 Flags 01 (1) 'Modification' │ │ │ │ +9E304 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9E308 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9E30A Length 000B (11) │ │ │ │ +9E30C Version 01 (1) │ │ │ │ +9E30D UID Size 04 (4) │ │ │ │ +9E30E UID 00000000 (0) │ │ │ │ +9E312 GID Size 04 (4) │ │ │ │ +9E313 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9E317 CENTRAL HEADER #15 02014B50 (33639248) │ │ │ │ +9E31B Created Zip Spec 3D (61) '6.1' │ │ │ │ +9E31C Created OS 03 (3) 'Unix' │ │ │ │ +9E31D Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9E31E Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9E31F General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9E321 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9E323 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9E327 CRC 65AA9970 (1705679216) │ │ │ │ +9E32B Compressed Size 000014D9 (5337) │ │ │ │ +9E32F Uncompressed Size 0000518E (20878) │ │ │ │ +9E333 Filename Length 001D (29) │ │ │ │ +9E335 Extra Length 0018 (24) │ │ │ │ +9E337 Comment Length 0000 (0) │ │ │ │ +9E339 Disk Start 0000 (0) │ │ │ │ +9E33B Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9E33D Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9E341 Local Header Offset 00026756 (157526) │ │ │ │ +9E345 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9E345: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9E362 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9E364 Length 0005 (5) │ │ │ │ +9E366 Flags 01 (1) 'Modification' │ │ │ │ +9E367 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9E36B Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9E36D Length 000B (11) │ │ │ │ +9E36F Version 01 (1) │ │ │ │ +9E370 UID Size 04 (4) │ │ │ │ +9E371 UID 00000000 (0) │ │ │ │ +9E375 GID Size 04 (4) │ │ │ │ +9E376 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9E37A CENTRAL HEADER #16 02014B50 (33639248) │ │ │ │ +9E37E Created Zip Spec 3D (61) '6.1' │ │ │ │ +9E37F Created OS 03 (3) 'Unix' │ │ │ │ +9E380 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9E381 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9E382 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9E384 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9E386 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9E38A CRC 6BAC06B0 (1806436016) │ │ │ │ +9E38E Compressed Size 0000380A (14346) │ │ │ │ +9E392 Uncompressed Size 0000EA4D (59981) │ │ │ │ +9E396 Filename Length 001C (28) │ │ │ │ +9E398 Extra Length 0018 (24) │ │ │ │ +9E39A Comment Length 0000 (0) │ │ │ │ +9E39C Disk Start 0000 (0) │ │ │ │ +9E39E Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9E3A0 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9E3A4 Local Header Offset 00027C86 (162950) │ │ │ │ +9E3A8 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9E3A8: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9E3C4 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9E3C6 Length 0005 (5) │ │ │ │ +9E3C8 Flags 01 (1) 'Modification' │ │ │ │ +9E3C9 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9E3CD Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9E3CF Length 000B (11) │ │ │ │ +9E3D1 Version 01 (1) │ │ │ │ +9E3D2 UID Size 04 (4) │ │ │ │ +9E3D3 UID 00000000 (0) │ │ │ │ +9E3D7 GID Size 04 (4) │ │ │ │ +9E3D8 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9E3DC CENTRAL HEADER #17 02014B50 (33639248) │ │ │ │ +9E3E0 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9E3E1 Created OS 03 (3) 'Unix' │ │ │ │ +9E3E2 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9E3E3 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9E3E4 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9E3E6 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9E3E8 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9E3EC CRC BF5A452D (3210364205) │ │ │ │ +9E3F0 Compressed Size 000006A2 (1698) │ │ │ │ +9E3F4 Uncompressed Size 000011F5 (4597) │ │ │ │ +9E3F8 Filename Length 001C (28) │ │ │ │ +9E3FA Extra Length 0018 (24) │ │ │ │ +9E3FC Comment Length 0000 (0) │ │ │ │ +9E3FE Disk Start 0000 (0) │ │ │ │ +9E400 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9E402 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9E406 Local Header Offset 0002B4E6 (177382) │ │ │ │ +9E40A Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9E40A: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9E426 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9E428 Length 0005 (5) │ │ │ │ +9E42A Flags 01 (1) 'Modification' │ │ │ │ +9E42B Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9E42F Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9E431 Length 000B (11) │ │ │ │ +9E433 Version 01 (1) │ │ │ │ +9E434 UID Size 04 (4) │ │ │ │ +9E435 UID 00000000 (0) │ │ │ │ +9E439 GID Size 04 (4) │ │ │ │ +9E43A GID 00000000 (0) │ │ │ │ + │ │ │ │ +9E43E CENTRAL HEADER #18 02014B50 (33639248) │ │ │ │ +9E442 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9E443 Created OS 03 (3) 'Unix' │ │ │ │ +9E444 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9E445 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9E446 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9E448 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9E44A Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9E44E CRC 1589B2CE (361345742) │ │ │ │ +9E452 Compressed Size 00001082 (4226) │ │ │ │ +9E456 Uncompressed Size 00004C00 (19456) │ │ │ │ +9E45A Filename Length 001B (27) │ │ │ │ +9E45C Extra Length 0018 (24) │ │ │ │ +9E45E Comment Length 0000 (0) │ │ │ │ +9E460 Disk Start 0000 (0) │ │ │ │ +9E462 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9E464 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9E468 Local Header Offset 0002BBDE (179166) │ │ │ │ +9E46C Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9E46C: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9E487 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9E489 Length 0005 (5) │ │ │ │ +9E48B Flags 01 (1) 'Modification' │ │ │ │ +9E48C Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9E490 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9E492 Length 000B (11) │ │ │ │ +9E494 Version 01 (1) │ │ │ │ +9E495 UID Size 04 (4) │ │ │ │ +9E496 UID 00000000 (0) │ │ │ │ +9E49A GID Size 04 (4) │ │ │ │ +9E49B GID 00000000 (0) │ │ │ │ + │ │ │ │ +9E49F CENTRAL HEADER #19 02014B50 (33639248) │ │ │ │ +9E4A3 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9E4A4 Created OS 03 (3) 'Unix' │ │ │ │ +9E4A5 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9E4A6 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9E4A7 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9E4A9 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9E4AB Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9E4AF CRC 032E5955 (53369173) │ │ │ │ +9E4B3 Compressed Size 000033AC (13228) │ │ │ │ +9E4B7 Uncompressed Size 0000BC95 (48277) │ │ │ │ +9E4BB Filename Length 001D (29) │ │ │ │ +9E4BD Extra Length 0018 (24) │ │ │ │ +9E4BF Comment Length 0000 (0) │ │ │ │ +9E4C1 Disk Start 0000 (0) │ │ │ │ +9E4C3 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9E4C5 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9E4C9 Local Header Offset 0002CCB5 (183477) │ │ │ │ +9E4CD Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9E4CD: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9E4EA Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9E4EC Length 0005 (5) │ │ │ │ +9E4EE Flags 01 (1) 'Modification' │ │ │ │ +9E4EF Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9E4F3 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9E4F5 Length 000B (11) │ │ │ │ +9E4F7 Version 01 (1) │ │ │ │ +9E4F8 UID Size 04 (4) │ │ │ │ +9E4F9 UID 00000000 (0) │ │ │ │ +9E4FD GID Size 04 (4) │ │ │ │ +9E4FE GID 00000000 (0) │ │ │ │ + │ │ │ │ +9E502 CENTRAL HEADER #20 02014B50 (33639248) │ │ │ │ +9E506 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9E507 Created OS 03 (3) 'Unix' │ │ │ │ +9E508 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9E509 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9E50A General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9E50C Compression Method 0008 (8) 'Deflated' │ │ │ │ +9E50E Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9E512 CRC 0DB6D018 (230084632) │ │ │ │ +9E516 Compressed Size 00000D6A (3434) │ │ │ │ +9E51A Uncompressed Size 0000388E (14478) │ │ │ │ +9E51E Filename Length 001D (29) │ │ │ │ +9E520 Extra Length 0018 (24) │ │ │ │ +9E522 Comment Length 0000 (0) │ │ │ │ +9E524 Disk Start 0000 (0) │ │ │ │ +9E526 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9E528 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9E52C Local Header Offset 000300B8 (196792) │ │ │ │ +9E530 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9E530: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9E54D Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9E54F Length 0005 (5) │ │ │ │ +9E551 Flags 01 (1) 'Modification' │ │ │ │ +9E552 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9E556 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9E558 Length 000B (11) │ │ │ │ +9E55A Version 01 (1) │ │ │ │ +9E55B UID Size 04 (4) │ │ │ │ +9E55C UID 00000000 (0) │ │ │ │ +9E560 GID Size 04 (4) │ │ │ │ +9E561 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9E565 CENTRAL HEADER #21 02014B50 (33639248) │ │ │ │ +9E569 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9E56A Created OS 03 (3) 'Unix' │ │ │ │ +9E56B Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9E56C Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9E56D General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9E56F Compression Method 0008 (8) 'Deflated' │ │ │ │ +9E571 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9E575 CRC 14EDEBB8 (351136696) │ │ │ │ +9E579 Compressed Size 00001C6A (7274) │ │ │ │ +9E57D Uncompressed Size 0000C187 (49543) │ │ │ │ +9E581 Filename Length 001A (26) │ │ │ │ +9E583 Extra Length 0018 (24) │ │ │ │ +9E585 Comment Length 0000 (0) │ │ │ │ +9E587 Disk Start 0000 (0) │ │ │ │ +9E589 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9E58B Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9E58F Local Header Offset 00030E79 (200313) │ │ │ │ +9E593 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9E593: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9E5AD Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9E5AF Length 0005 (5) │ │ │ │ +9E5B1 Flags 01 (1) 'Modification' │ │ │ │ +9E5B2 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9E5B6 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9E5B8 Length 000B (11) │ │ │ │ +9E5BA Version 01 (1) │ │ │ │ +9E5BB UID Size 04 (4) │ │ │ │ +9E5BC UID 00000000 (0) │ │ │ │ +9E5C0 GID Size 04 (4) │ │ │ │ +9E5C1 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9E5C5 CENTRAL HEADER #22 02014B50 (33639248) │ │ │ │ +9E5C9 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9E5CA Created OS 03 (3) 'Unix' │ │ │ │ +9E5CB Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9E5CC Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9E5CD General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9E5CF Compression Method 0008 (8) 'Deflated' │ │ │ │ +9E5D1 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9E5D5 CRC FFC68C4A (4291202122) │ │ │ │ +9E5D9 Compressed Size 000003A4 (932) │ │ │ │ +9E5DD Uncompressed Size 0000088F (2191) │ │ │ │ +9E5E1 Filename Length 0012 (18) │ │ │ │ +9E5E3 Extra Length 0018 (24) │ │ │ │ +9E5E5 Comment Length 0000 (0) │ │ │ │ +9E5E7 Disk Start 0000 (0) │ │ │ │ +9E5E9 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9E5EB Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9E5EF Local Header Offset 00032B37 (207671) │ │ │ │ +9E5F3 Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9E5F3: Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9E605 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9E607 Length 0005 (5) │ │ │ │ +9E609 Flags 01 (1) 'Modification' │ │ │ │ +9E60A Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9E60E Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9E610 Length 000B (11) │ │ │ │ +9E612 Version 01 (1) │ │ │ │ +9E613 UID Size 04 (4) │ │ │ │ +9E614 UID 00000000 (0) │ │ │ │ +9E618 GID Size 04 (4) │ │ │ │ +9E619 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9E61D CENTRAL HEADER #23 02014B50 (33639248) │ │ │ │ +9E621 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9E622 Created OS 03 (3) 'Unix' │ │ │ │ +9E623 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9E624 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9E625 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9E627 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9E629 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9E62D CRC 75B01EAE (1974476462) │ │ │ │ +9E631 Compressed Size 000001D4 (468) │ │ │ │ +9E635 Uncompressed Size 00000312 (786) │ │ │ │ +9E639 Filename Length 0020 (32) │ │ │ │ +9E63B Extra Length 0018 (24) │ │ │ │ +9E63D Comment Length 0000 (0) │ │ │ │ +9E63F Disk Start 0000 (0) │ │ │ │ +9E641 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9E643 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9E647 Local Header Offset 00032F27 (208679) │ │ │ │ +9E64B Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9E64B: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9E66B Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9E66D Length 0005 (5) │ │ │ │ +9E66F Flags 01 (1) 'Modification' │ │ │ │ +9E670 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9E674 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9E676 Length 000B (11) │ │ │ │ +9E678 Version 01 (1) │ │ │ │ +9E679 UID Size 04 (4) │ │ │ │ +9E67A UID 00000000 (0) │ │ │ │ +9E67E GID Size 04 (4) │ │ │ │ +9E67F GID 00000000 (0) │ │ │ │ + │ │ │ │ +9E683 CENTRAL HEADER #24 02014B50 (33639248) │ │ │ │ +9E687 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9E688 Created OS 03 (3) 'Unix' │ │ │ │ +9E689 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9E68A Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9E68B General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9E68D Compression Method 0008 (8) 'Deflated' │ │ │ │ +9E68F Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9E693 CRC F1F15481 (4059124865) │ │ │ │ +9E697 Compressed Size 000017AC (6060) │ │ │ │ +9E69B Uncompressed Size 00009D19 (40217) │ │ │ │ +9E69F Filename Length 001B (27) │ │ │ │ +9E6A1 Extra Length 0018 (24) │ │ │ │ +9E6A3 Comment Length 0000 (0) │ │ │ │ +9E6A5 Disk Start 0000 (0) │ │ │ │ +9E6A7 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9E6A9 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9E6AD Local Header Offset 00033155 (209237) │ │ │ │ +9E6B1 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9E6B1: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9E6CC Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9E6CE Length 0005 (5) │ │ │ │ +9E6D0 Flags 01 (1) 'Modification' │ │ │ │ +9E6D1 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9E6D5 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9E6D7 Length 000B (11) │ │ │ │ +9E6D9 Version 01 (1) │ │ │ │ +9E6DA UID Size 04 (4) │ │ │ │ +9E6DB UID 00000000 (0) │ │ │ │ +9E6DF GID Size 04 (4) │ │ │ │ +9E6E0 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9E6E4 CENTRAL HEADER #25 02014B50 (33639248) │ │ │ │ +9E6E8 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9E6E9 Created OS 03 (3) 'Unix' │ │ │ │ +9E6EA Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9E6EB Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9E6EC General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9E6EE Compression Method 0008 (8) 'Deflated' │ │ │ │ +9E6F0 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9E6F4 CRC AA7532E3 (2859807459) │ │ │ │ +9E6F8 Compressed Size 00001373 (4979) │ │ │ │ +9E6FC Uncompressed Size 00003B67 (15207) │ │ │ │ +9E700 Filename Length 0015 (21) │ │ │ │ +9E702 Extra Length 0018 (24) │ │ │ │ +9E704 Comment Length 0000 (0) │ │ │ │ +9E706 Disk Start 0000 (0) │ │ │ │ +9E708 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9E70A Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9E70E Local Header Offset 00034956 (215382) │ │ │ │ +9E712 Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9E712: Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9E727 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9E729 Length 0005 (5) │ │ │ │ +9E72B Flags 01 (1) 'Modification' │ │ │ │ +9E72C Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9E730 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9E732 Length 000B (11) │ │ │ │ +9E734 Version 01 (1) │ │ │ │ +9E735 UID Size 04 (4) │ │ │ │ +9E736 UID 00000000 (0) │ │ │ │ +9E73A GID Size 04 (4) │ │ │ │ +9E73B GID 00000000 (0) │ │ │ │ + │ │ │ │ +9E73F CENTRAL HEADER #26 02014B50 (33639248) │ │ │ │ +9E743 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9E744 Created OS 03 (3) 'Unix' │ │ │ │ +9E745 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9E746 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9E747 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9E749 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9E74B Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9E74F CRC 3F4BD8A9 (1061935273) │ │ │ │ +9E753 Compressed Size 00000AD3 (2771) │ │ │ │ +9E757 Uncompressed Size 00002136 (8502) │ │ │ │ +9E75B Filename Length 0011 (17) │ │ │ │ +9E75D Extra Length 0018 (24) │ │ │ │ +9E75F Comment Length 0000 (0) │ │ │ │ +9E761 Disk Start 0000 (0) │ │ │ │ +9E763 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9E765 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9E769 Local Header Offset 00035D18 (220440) │ │ │ │ +9E76D Filename 'XXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9E76D: Filename 'XXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9E77E Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9E780 Length 0005 (5) │ │ │ │ +9E782 Flags 01 (1) 'Modification' │ │ │ │ +9E783 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9E787 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9E789 Length 000B (11) │ │ │ │ +9E78B Version 01 (1) │ │ │ │ +9E78C UID Size 04 (4) │ │ │ │ +9E78D UID 00000000 (0) │ │ │ │ +9E791 GID Size 04 (4) │ │ │ │ +9E792 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9E796 CENTRAL HEADER #27 02014B50 (33639248) │ │ │ │ +9E79A Created Zip Spec 3D (61) '6.1' │ │ │ │ +9E79B Created OS 03 (3) 'Unix' │ │ │ │ +9E79C Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9E79D Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9E79E General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9E7A0 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9E7A2 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9E7A6 CRC 8660AD3A (2254482746) │ │ │ │ +9E7AA Compressed Size 000003FF (1023) │ │ │ │ +9E7AE Uncompressed Size 00000F0D (3853) │ │ │ │ +9E7B2 Filename Length 0014 (20) │ │ │ │ +9E7B4 Extra Length 0018 (24) │ │ │ │ +9E7B6 Comment Length 0000 (0) │ │ │ │ +9E7B8 Disk Start 0000 (0) │ │ │ │ +9E7BA Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9E7BC Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9E7C0 Local Header Offset 00036836 (223286) │ │ │ │ +9E7C4 Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9E7C4: Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9E7D8 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9E7DA Length 0005 (5) │ │ │ │ +9E7DC Flags 01 (1) 'Modification' │ │ │ │ +9E7DD Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9E7E1 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9E7E3 Length 000B (11) │ │ │ │ +9E7E5 Version 01 (1) │ │ │ │ +9E7E6 UID Size 04 (4) │ │ │ │ +9E7E7 UID 00000000 (0) │ │ │ │ +9E7EB GID Size 04 (4) │ │ │ │ +9E7EC GID 00000000 (0) │ │ │ │ + │ │ │ │ +9E7F0 CENTRAL HEADER #28 02014B50 (33639248) │ │ │ │ +9E7F4 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9E7F5 Created OS 03 (3) 'Unix' │ │ │ │ +9E7F6 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9E7F7 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9E7F8 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9E7FA Compression Method 0008 (8) 'Deflated' │ │ │ │ +9E7FC Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9E800 CRC 2177E3D4 (561505236) │ │ │ │ +9E804 Compressed Size 00001263 (4707) │ │ │ │ +9E808 Uncompressed Size 0000346A (13418) │ │ │ │ +9E80C Filename Length 0014 (20) │ │ │ │ +9E80E Extra Length 0018 (24) │ │ │ │ +9E810 Comment Length 0000 (0) │ │ │ │ +9E812 Disk Start 0000 (0) │ │ │ │ +9E814 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9E816 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9E81A Local Header Offset 00036C83 (224387) │ │ │ │ +9E81E Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9E81E: Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9E832 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9E834 Length 0005 (5) │ │ │ │ +9E836 Flags 01 (1) 'Modification' │ │ │ │ +9E837 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9E83B Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9E83D Length 000B (11) │ │ │ │ +9E83F Version 01 (1) │ │ │ │ +9E840 UID Size 04 (4) │ │ │ │ +9E841 UID 00000000 (0) │ │ │ │ +9E845 GID Size 04 (4) │ │ │ │ +9E846 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9E84A CENTRAL HEADER #29 02014B50 (33639248) │ │ │ │ +9E84E Created Zip Spec 3D (61) '6.1' │ │ │ │ +9E84F Created OS 03 (3) 'Unix' │ │ │ │ +9E850 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9E851 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9E852 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9E854 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9E856 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9E85A CRC 5CDB7A87 (1557887623) │ │ │ │ +9E85E Compressed Size 00000AD0 (2768) │ │ │ │ +9E862 Uncompressed Size 00002300 (8960) │ │ │ │ +9E866 Filename Length 001B (27) │ │ │ │ +9E868 Extra Length 0018 (24) │ │ │ │ +9E86A Comment Length 0000 (0) │ │ │ │ +9E86C Disk Start 0000 (0) │ │ │ │ +9E86E Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9E870 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9E874 Local Header Offset 00037F34 (229172) │ │ │ │ +9E878 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9E878: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9E893 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9E895 Length 0005 (5) │ │ │ │ +9E897 Flags 01 (1) 'Modification' │ │ │ │ +9E898 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9E89C Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9E89E Length 000B (11) │ │ │ │ +9E8A0 Version 01 (1) │ │ │ │ +9E8A1 UID Size 04 (4) │ │ │ │ +9E8A2 UID 00000000 (0) │ │ │ │ +9E8A6 GID Size 04 (4) │ │ │ │ +9E8A7 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9E8AB CENTRAL HEADER #30 02014B50 (33639248) │ │ │ │ +9E8AF Created Zip Spec 3D (61) '6.1' │ │ │ │ +9E8B0 Created OS 03 (3) 'Unix' │ │ │ │ +9E8B1 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9E8B2 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9E8B3 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9E8B5 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9E8B7 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9E8BB CRC EA06709E (3926290590) │ │ │ │ +9E8BF Compressed Size 00000A8E (2702) │ │ │ │ +9E8C3 Uncompressed Size 0000237B (9083) │ │ │ │ +9E8C7 Filename Length 0013 (19) │ │ │ │ +9E8C9 Extra Length 0018 (24) │ │ │ │ +9E8CB Comment Length 0000 (0) │ │ │ │ +9E8CD Disk Start 0000 (0) │ │ │ │ +9E8CF Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9E8D1 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9E8D5 Local Header Offset 00038A59 (232025) │ │ │ │ +9E8D9 Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9E8D9: Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9E8EC Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9E8EE Length 0005 (5) │ │ │ │ +9E8F0 Flags 01 (1) 'Modification' │ │ │ │ +9E8F1 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9E8F5 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9E8F7 Length 000B (11) │ │ │ │ +9E8F9 Version 01 (1) │ │ │ │ +9E8FA UID Size 04 (4) │ │ │ │ +9E8FB UID 00000000 (0) │ │ │ │ +9E8FF GID Size 04 (4) │ │ │ │ +9E900 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9E904 CENTRAL HEADER #31 02014B50 (33639248) │ │ │ │ +9E908 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9E909 Created OS 03 (3) 'Unix' │ │ │ │ +9E90A Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9E90B Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9E90C General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9E90E Compression Method 0008 (8) 'Deflated' │ │ │ │ +9E910 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9E914 CRC 2A8D94A8 (713921704) │ │ │ │ +9E918 Compressed Size 00000F4B (3915) │ │ │ │ +9E91C Uncompressed Size 00003737 (14135) │ │ │ │ +9E920 Filename Length 000F (15) │ │ │ │ +9E922 Extra Length 0018 (24) │ │ │ │ +9E924 Comment Length 0000 (0) │ │ │ │ +9E926 Disk Start 0000 (0) │ │ │ │ +9E928 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9E92A Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9E92E Local Header Offset 00039534 (234804) │ │ │ │ +9E932 Filename 'XXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9E932: Filename 'XXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9E941 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9E943 Length 0005 (5) │ │ │ │ +9E945 Flags 01 (1) 'Modification' │ │ │ │ +9E946 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9E94A Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9E94C Length 000B (11) │ │ │ │ +9E94E Version 01 (1) │ │ │ │ +9E94F UID Size 04 (4) │ │ │ │ +9E950 UID 00000000 (0) │ │ │ │ +9E954 GID Size 04 (4) │ │ │ │ +9E955 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9E959 CENTRAL HEADER #32 02014B50 (33639248) │ │ │ │ +9E95D Created Zip Spec 3D (61) '6.1' │ │ │ │ +9E95E Created OS 03 (3) 'Unix' │ │ │ │ +9E95F Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9E960 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9E961 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9E963 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9E965 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9E969 CRC 3759BA2B (928627243) │ │ │ │ +9E96D Compressed Size 0000066B (1643) │ │ │ │ +9E971 Uncompressed Size 000018E0 (6368) │ │ │ │ +9E975 Filename Length 000F (15) │ │ │ │ +9E977 Extra Length 0018 (24) │ │ │ │ +9E979 Comment Length 0000 (0) │ │ │ │ +9E97B Disk Start 0000 (0) │ │ │ │ +9E97D Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9E97F Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9E983 Local Header Offset 0003A4C8 (238792) │ │ │ │ +9E987 Filename 'XXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9E987: Filename 'XXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9E996 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9E998 Length 0005 (5) │ │ │ │ +9E99A Flags 01 (1) 'Modification' │ │ │ │ +9E99B Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9E99F Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9E9A1 Length 000B (11) │ │ │ │ +9E9A3 Version 01 (1) │ │ │ │ +9E9A4 UID Size 04 (4) │ │ │ │ +9E9A5 UID 00000000 (0) │ │ │ │ +9E9A9 GID Size 04 (4) │ │ │ │ +9E9AA GID 00000000 (0) │ │ │ │ + │ │ │ │ +9E9AE CENTRAL HEADER #33 02014B50 (33639248) │ │ │ │ +9E9B2 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9E9B3 Created OS 03 (3) 'Unix' │ │ │ │ +9E9B4 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9E9B5 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9E9B6 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9E9B8 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9E9BA Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9E9BE CRC 282DD890 (674093200) │ │ │ │ +9E9C2 Compressed Size 00001A46 (6726) │ │ │ │ +9E9C6 Uncompressed Size 000064F3 (25843) │ │ │ │ +9E9CA Filename Length 0013 (19) │ │ │ │ +9E9CC Extra Length 0018 (24) │ │ │ │ +9E9CE Comment Length 0000 (0) │ │ │ │ +9E9D0 Disk Start 0000 (0) │ │ │ │ +9E9D2 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9E9D4 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9E9D8 Local Header Offset 0003AB7C (240508) │ │ │ │ +9E9DC Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9E9DC: Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9E9EF Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9E9F1 Length 0005 (5) │ │ │ │ +9E9F3 Flags 01 (1) 'Modification' │ │ │ │ +9E9F4 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9E9F8 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9E9FA Length 000B (11) │ │ │ │ +9E9FC Version 01 (1) │ │ │ │ +9E9FD UID Size 04 (4) │ │ │ │ +9E9FE UID 00000000 (0) │ │ │ │ +9EA02 GID Size 04 (4) │ │ │ │ +9EA03 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9EA07 CENTRAL HEADER #34 02014B50 (33639248) │ │ │ │ +9EA0B Created Zip Spec 3D (61) '6.1' │ │ │ │ +9EA0C Created OS 03 (3) 'Unix' │ │ │ │ +9EA0D Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9EA0E Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9EA0F General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9EA11 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9EA13 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9EA17 CRC 57156588 (1461020040) │ │ │ │ +9EA1B Compressed Size 000009A7 (2471) │ │ │ │ +9EA1F Uncompressed Size 00001B65 (7013) │ │ │ │ +9EA23 Filename Length 0010 (16) │ │ │ │ +9EA25 Extra Length 0018 (24) │ │ │ │ +9EA27 Comment Length 0000 (0) │ │ │ │ +9EA29 Disk Start 0000 (0) │ │ │ │ +9EA2B Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9EA2D Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9EA31 Local Header Offset 0003C60F (247311) │ │ │ │ +9EA35 Filename 'XXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9EA35: Filename 'XXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9EA45 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9EA47 Length 0005 (5) │ │ │ │ +9EA49 Flags 01 (1) 'Modification' │ │ │ │ +9EA4A Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9EA4E Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9EA50 Length 000B (11) │ │ │ │ +9EA52 Version 01 (1) │ │ │ │ +9EA53 UID Size 04 (4) │ │ │ │ +9EA54 UID 00000000 (0) │ │ │ │ +9EA58 GID Size 04 (4) │ │ │ │ +9EA59 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9EA5D CENTRAL HEADER #35 02014B50 (33639248) │ │ │ │ +9EA61 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9EA62 Created OS 03 (3) 'Unix' │ │ │ │ +9EA63 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9EA64 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9EA65 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9EA67 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9EA69 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9EA6D CRC 2899E6E3 (681174755) │ │ │ │ +9EA71 Compressed Size 000006B8 (1720) │ │ │ │ +9EA75 Uncompressed Size 00001566 (5478) │ │ │ │ +9EA79 Filename Length 0012 (18) │ │ │ │ +9EA7B Extra Length 0018 (24) │ │ │ │ +9EA7D Comment Length 0000 (0) │ │ │ │ +9EA7F Disk Start 0000 (0) │ │ │ │ +9EA81 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9EA83 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9EA87 Local Header Offset 0003D000 (249856) │ │ │ │ +9EA8B Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9EA8B: Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9EA9D Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9EA9F Length 0005 (5) │ │ │ │ +9EAA1 Flags 01 (1) 'Modification' │ │ │ │ +9EAA2 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9EAA6 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9EAA8 Length 000B (11) │ │ │ │ +9EAAA Version 01 (1) │ │ │ │ +9EAAB UID Size 04 (4) │ │ │ │ +9EAAC UID 00000000 (0) │ │ │ │ +9EAB0 GID Size 04 (4) │ │ │ │ +9EAB1 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9EAB5 CENTRAL HEADER #36 02014B50 (33639248) │ │ │ │ +9EAB9 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9EABA Created OS 03 (3) 'Unix' │ │ │ │ +9EABB Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9EABC Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9EABD General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9EABF Compression Method 0008 (8) 'Deflated' │ │ │ │ +9EAC1 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9EAC5 CRC 6F3FE42A (1866458154) │ │ │ │ +9EAC9 Compressed Size 00002A11 (10769) │ │ │ │ +9EACD Uncompressed Size 0000B1DD (45533) │ │ │ │ +9EAD1 Filename Length 0010 (16) │ │ │ │ +9EAD3 Extra Length 0018 (24) │ │ │ │ +9EAD5 Comment Length 0000 (0) │ │ │ │ +9EAD7 Disk Start 0000 (0) │ │ │ │ +9EAD9 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9EADB Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9EADF Local Header Offset 0003D704 (251652) │ │ │ │ +9EAE3 Filename 'XXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9EAE3: Filename 'XXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9EAF3 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9EAF5 Length 0005 (5) │ │ │ │ +9EAF7 Flags 01 (1) 'Modification' │ │ │ │ +9EAF8 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9EAFC Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9EAFE Length 000B (11) │ │ │ │ +9EB00 Version 01 (1) │ │ │ │ +9EB01 UID Size 04 (4) │ │ │ │ +9EB02 UID 00000000 (0) │ │ │ │ +9EB06 GID Size 04 (4) │ │ │ │ +9EB07 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9EB0B CENTRAL HEADER #37 02014B50 (33639248) │ │ │ │ +9EB0F Created Zip Spec 3D (61) '6.1' │ │ │ │ +9EB10 Created OS 03 (3) 'Unix' │ │ │ │ +9EB11 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9EB12 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9EB13 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9EB15 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9EB17 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9EB1B CRC 1A12C88F (437438607) │ │ │ │ +9EB1F Compressed Size 00001E86 (7814) │ │ │ │ +9EB23 Uncompressed Size 00009AAB (39595) │ │ │ │ +9EB27 Filename Length 0012 (18) │ │ │ │ +9EB29 Extra Length 0018 (24) │ │ │ │ +9EB2B Comment Length 0000 (0) │ │ │ │ +9EB2D Disk Start 0000 (0) │ │ │ │ +9EB2F Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9EB31 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9EB35 Local Header Offset 0004015F (262495) │ │ │ │ +9EB39 Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9EB39: Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9EB4B Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9EB4D Length 0005 (5) │ │ │ │ +9EB4F Flags 01 (1) 'Modification' │ │ │ │ +9EB50 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9EB54 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9EB56 Length 000B (11) │ │ │ │ +9EB58 Version 01 (1) │ │ │ │ +9EB59 UID Size 04 (4) │ │ │ │ +9EB5A UID 00000000 (0) │ │ │ │ +9EB5E GID Size 04 (4) │ │ │ │ +9EB5F GID 00000000 (0) │ │ │ │ + │ │ │ │ +9EB63 CENTRAL HEADER #38 02014B50 (33639248) │ │ │ │ +9EB67 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9EB68 Created OS 03 (3) 'Unix' │ │ │ │ +9EB69 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9EB6A Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9EB6B General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9EB6D Compression Method 0008 (8) 'Deflated' │ │ │ │ +9EB6F Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9EB73 CRC 21789752 (561551186) │ │ │ │ +9EB77 Compressed Size 00001478 (5240) │ │ │ │ +9EB7B Uncompressed Size 00007AD0 (31440) │ │ │ │ +9EB7F Filename Length 0018 (24) │ │ │ │ +9EB81 Extra Length 0018 (24) │ │ │ │ +9EB83 Comment Length 0000 (0) │ │ │ │ +9EB85 Disk Start 0000 (0) │ │ │ │ +9EB87 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9EB89 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9EB8D Local Header Offset 00042031 (270385) │ │ │ │ +9EB91 Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9EB91: Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9EBA9 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9EBAB Length 0005 (5) │ │ │ │ +9EBAD Flags 01 (1) 'Modification' │ │ │ │ +9EBAE Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9EBB2 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9EBB4 Length 000B (11) │ │ │ │ +9EBB6 Version 01 (1) │ │ │ │ +9EBB7 UID Size 04 (4) │ │ │ │ +9EBB8 UID 00000000 (0) │ │ │ │ +9EBBC GID Size 04 (4) │ │ │ │ +9EBBD GID 00000000 (0) │ │ │ │ + │ │ │ │ +9EBC1 CENTRAL HEADER #39 02014B50 (33639248) │ │ │ │ +9EBC5 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9EBC6 Created OS 03 (3) 'Unix' │ │ │ │ +9EBC7 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9EBC8 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9EBC9 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9EBCB Compression Method 0008 (8) 'Deflated' │ │ │ │ +9EBCD Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9EBD1 CRC 9E56D86B (2656491627) │ │ │ │ +9EBD5 Compressed Size 000018D7 (6359) │ │ │ │ +9EBD9 Uncompressed Size 0000A83A (43066) │ │ │ │ +9EBDD Filename Length 001F (31) │ │ │ │ +9EBDF Extra Length 0018 (24) │ │ │ │ +9EBE1 Comment Length 0000 (0) │ │ │ │ +9EBE3 Disk Start 0000 (0) │ │ │ │ +9EBE5 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9EBE7 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9EBEB Local Header Offset 000434FB (275707) │ │ │ │ +9EBEF Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9EBEF: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9EC0E Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9EC10 Length 0005 (5) │ │ │ │ +9EC12 Flags 01 (1) 'Modification' │ │ │ │ +9EC13 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9EC17 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9EC19 Length 000B (11) │ │ │ │ +9EC1B Version 01 (1) │ │ │ │ +9EC1C UID Size 04 (4) │ │ │ │ +9EC1D UID 00000000 (0) │ │ │ │ +9EC21 GID Size 04 (4) │ │ │ │ +9EC22 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9EC26 CENTRAL HEADER #40 02014B50 (33639248) │ │ │ │ +9EC2A Created Zip Spec 3D (61) '6.1' │ │ │ │ +9EC2B Created OS 03 (3) 'Unix' │ │ │ │ +9EC2C Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9EC2D Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9EC2E General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9EC30 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9EC32 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9EC36 CRC 6DE2E94A (1843587402) │ │ │ │ +9EC3A Compressed Size 000003F8 (1016) │ │ │ │ +9EC3E Uncompressed Size 000008A4 (2212) │ │ │ │ +9EC42 Filename Length 001E (30) │ │ │ │ +9EC44 Extra Length 0018 (24) │ │ │ │ +9EC46 Comment Length 0000 (0) │ │ │ │ +9EC48 Disk Start 0000 (0) │ │ │ │ +9EC4A Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9EC4C Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9EC50 Local Header Offset 00044E2B (282155) │ │ │ │ +9EC54 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9EC54: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9EC72 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9EC74 Length 0005 (5) │ │ │ │ +9EC76 Flags 01 (1) 'Modification' │ │ │ │ +9EC77 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9EC7B Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9EC7D Length 000B (11) │ │ │ │ +9EC7F Version 01 (1) │ │ │ │ +9EC80 UID Size 04 (4) │ │ │ │ +9EC81 UID 00000000 (0) │ │ │ │ +9EC85 GID Size 04 (4) │ │ │ │ +9EC86 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9EC8A CENTRAL HEADER #41 02014B50 (33639248) │ │ │ │ +9EC8E Created Zip Spec 3D (61) '6.1' │ │ │ │ +9EC8F Created OS 03 (3) 'Unix' │ │ │ │ +9EC90 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9EC91 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9EC92 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9EC94 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9EC96 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9EC9A CRC 93538F15 (2471726869) │ │ │ │ +9EC9E Compressed Size 00004296 (17046) │ │ │ │ +9ECA2 Uncompressed Size 0000D8E8 (55528) │ │ │ │ +9ECA6 Filename Length 0013 (19) │ │ │ │ +9ECA8 Extra Length 0018 (24) │ │ │ │ +9ECAA Comment Length 0000 (0) │ │ │ │ +9ECAC Disk Start 0000 (0) │ │ │ │ +9ECAE Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9ECB0 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9ECB4 Local Header Offset 0004527B (283259) │ │ │ │ +9ECB8 Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9ECB8: Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9ECCB Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9ECCD Length 0005 (5) │ │ │ │ +9ECCF Flags 01 (1) 'Modification' │ │ │ │ +9ECD0 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9ECD4 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9ECD6 Length 000B (11) │ │ │ │ +9ECD8 Version 01 (1) │ │ │ │ +9ECD9 UID Size 04 (4) │ │ │ │ +9ECDA UID 00000000 (0) │ │ │ │ +9ECDE GID Size 04 (4) │ │ │ │ +9ECDF GID 00000000 (0) │ │ │ │ + │ │ │ │ +9ECE3 CENTRAL HEADER #42 02014B50 (33639248) │ │ │ │ +9ECE7 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9ECE8 Created OS 03 (3) 'Unix' │ │ │ │ +9ECE9 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9ECEA Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9ECEB General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9ECED Compression Method 0008 (8) 'Deflated' │ │ │ │ +9ECEF Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9ECF3 CRC 66B2004C (1722941516) │ │ │ │ +9ECF7 Compressed Size 000026C3 (9923) │ │ │ │ +9ECFB Uncompressed Size 00006E46 (28230) │ │ │ │ +9ECFF Filename Length 0019 (25) │ │ │ │ +9ED01 Extra Length 0018 (24) │ │ │ │ +9ED03 Comment Length 0000 (0) │ │ │ │ +9ED05 Disk Start 0000 (0) │ │ │ │ +9ED07 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9ED09 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9ED0D Local Header Offset 0004955E (300382) │ │ │ │ +9ED11 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9ED11: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9ED2A Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9ED2C Length 0005 (5) │ │ │ │ +9ED2E Flags 01 (1) 'Modification' │ │ │ │ +9ED2F Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9ED33 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9ED35 Length 000B (11) │ │ │ │ +9ED37 Version 01 (1) │ │ │ │ +9ED38 UID Size 04 (4) │ │ │ │ +9ED39 UID 00000000 (0) │ │ │ │ +9ED3D GID Size 04 (4) │ │ │ │ +9ED3E GID 00000000 (0) │ │ │ │ + │ │ │ │ +9ED42 CENTRAL HEADER #43 02014B50 (33639248) │ │ │ │ +9ED46 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9ED47 Created OS 03 (3) 'Unix' │ │ │ │ +9ED48 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9ED49 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9ED4A General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9ED4C Compression Method 0008 (8) 'Deflated' │ │ │ │ +9ED4E Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9ED52 CRC 300CDC3B (806149179) │ │ │ │ +9ED56 Compressed Size 0000273A (10042) │ │ │ │ +9ED5A Uncompressed Size 00008B84 (35716) │ │ │ │ +9ED5E Filename Length 0019 (25) │ │ │ │ +9ED60 Extra Length 0018 (24) │ │ │ │ +9ED62 Comment Length 0000 (0) │ │ │ │ +9ED64 Disk Start 0000 (0) │ │ │ │ +9ED66 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9ED68 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9ED6C Local Header Offset 0004BC74 (310388) │ │ │ │ +9ED70 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9ED70: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9ED89 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9ED8B Length 0005 (5) │ │ │ │ +9ED8D Flags 01 (1) 'Modification' │ │ │ │ +9ED8E Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9ED92 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9ED94 Length 000B (11) │ │ │ │ +9ED96 Version 01 (1) │ │ │ │ +9ED97 UID Size 04 (4) │ │ │ │ +9ED98 UID 00000000 (0) │ │ │ │ +9ED9C GID Size 04 (4) │ │ │ │ +9ED9D GID 00000000 (0) │ │ │ │ + │ │ │ │ +9EDA1 CENTRAL HEADER #44 02014B50 (33639248) │ │ │ │ +9EDA5 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9EDA6 Created OS 03 (3) 'Unix' │ │ │ │ +9EDA7 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9EDA8 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9EDA9 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9EDAB Compression Method 0008 (8) 'Deflated' │ │ │ │ +9EDAD Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9EDB1 CRC 77A3FE35 (2007236149) │ │ │ │ +9EDB5 Compressed Size 00000CF2 (3314) │ │ │ │ +9EDB9 Uncompressed Size 0000517B (20859) │ │ │ │ +9EDBD Filename Length 0021 (33) │ │ │ │ +9EDBF Extra Length 0018 (24) │ │ │ │ +9EDC1 Comment Length 0000 (0) │ │ │ │ +9EDC3 Disk Start 0000 (0) │ │ │ │ +9EDC5 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9EDC7 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9EDCB Local Header Offset 0004E401 (320513) │ │ │ │ +9EDCF Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9EDCF: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9EDF0 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9EDF2 Length 0005 (5) │ │ │ │ +9EDF4 Flags 01 (1) 'Modification' │ │ │ │ +9EDF5 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9EDF9 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9EDFB Length 000B (11) │ │ │ │ +9EDFD Version 01 (1) │ │ │ │ +9EDFE UID Size 04 (4) │ │ │ │ +9EDFF UID 00000000 (0) │ │ │ │ +9EE03 GID Size 04 (4) │ │ │ │ +9EE04 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9EE08 CENTRAL HEADER #45 02014B50 (33639248) │ │ │ │ +9EE0C Created Zip Spec 3D (61) '6.1' │ │ │ │ +9EE0D Created OS 03 (3) 'Unix' │ │ │ │ +9EE0E Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9EE0F Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9EE10 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9EE12 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9EE14 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9EE18 CRC 0D2E5D9B (221142427) │ │ │ │ +9EE1C Compressed Size 00000468 (1128) │ │ │ │ +9EE20 Uncompressed Size 00000932 (2354) │ │ │ │ +9EE24 Filename Length 001B (27) │ │ │ │ +9EE26 Extra Length 0018 (24) │ │ │ │ +9EE28 Comment Length 0000 (0) │ │ │ │ +9EE2A Disk Start 0000 (0) │ │ │ │ +9EE2C Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9EE2E Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9EE32 Local Header Offset 0004F14E (323918) │ │ │ │ +9EE36 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9EE36: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9EE51 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9EE53 Length 0005 (5) │ │ │ │ +9EE55 Flags 01 (1) 'Modification' │ │ │ │ +9EE56 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9EE5A Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9EE5C Length 000B (11) │ │ │ │ +9EE5E Version 01 (1) │ │ │ │ +9EE5F UID Size 04 (4) │ │ │ │ +9EE60 UID 00000000 (0) │ │ │ │ +9EE64 GID Size 04 (4) │ │ │ │ +9EE65 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9EE69 CENTRAL HEADER #46 02014B50 (33639248) │ │ │ │ +9EE6D Created Zip Spec 3D (61) '6.1' │ │ │ │ +9EE6E Created OS 03 (3) 'Unix' │ │ │ │ +9EE6F Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9EE70 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9EE71 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9EE73 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9EE75 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9EE79 CRC CBAFCC83 (3417296003) │ │ │ │ +9EE7D Compressed Size 000016ED (5869) │ │ │ │ +9EE81 Uncompressed Size 00007A6E (31342) │ │ │ │ +9EE85 Filename Length 001F (31) │ │ │ │ +9EE87 Extra Length 0018 (24) │ │ │ │ +9EE89 Comment Length 0000 (0) │ │ │ │ +9EE8B Disk Start 0000 (0) │ │ │ │ +9EE8D Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9EE8F Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9EE93 Local Header Offset 0004F60B (325131) │ │ │ │ +9EE97 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9EE97: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9EEB6 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9EEB8 Length 0005 (5) │ │ │ │ +9EEBA Flags 01 (1) 'Modification' │ │ │ │ +9EEBB Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9EEBF Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9EEC1 Length 000B (11) │ │ │ │ +9EEC3 Version 01 (1) │ │ │ │ +9EEC4 UID Size 04 (4) │ │ │ │ +9EEC5 UID 00000000 (0) │ │ │ │ +9EEC9 GID Size 04 (4) │ │ │ │ +9EECA GID 00000000 (0) │ │ │ │ + │ │ │ │ +9EECE CENTRAL HEADER #47 02014B50 (33639248) │ │ │ │ +9EED2 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9EED3 Created OS 03 (3) 'Unix' │ │ │ │ +9EED4 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9EED5 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9EED6 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9EED8 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9EEDA Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9EEDE CRC 37409808 (926980104) │ │ │ │ +9EEE2 Compressed Size 0000415F (16735) │ │ │ │ +9EEE6 Uncompressed Size 0001D160 (119136) │ │ │ │ +9EEEA Filename Length 0010 (16) │ │ │ │ +9EEEC Extra Length 0018 (24) │ │ │ │ +9EEEE Comment Length 0000 (0) │ │ │ │ +9EEF0 Disk Start 0000 (0) │ │ │ │ +9EEF2 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9EEF4 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9EEF8 Local Header Offset 00050D51 (331089) │ │ │ │ +9EEFC Filename 'XXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9EEFC: Filename 'XXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9EF0C Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9EF0E Length 0005 (5) │ │ │ │ +9EF10 Flags 01 (1) 'Modification' │ │ │ │ +9EF11 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9EF15 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9EF17 Length 000B (11) │ │ │ │ +9EF19 Version 01 (1) │ │ │ │ +9EF1A UID Size 04 (4) │ │ │ │ +9EF1B UID 00000000 (0) │ │ │ │ +9EF1F GID Size 04 (4) │ │ │ │ +9EF20 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9EF24 CENTRAL HEADER #48 02014B50 (33639248) │ │ │ │ +9EF28 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9EF29 Created OS 03 (3) 'Unix' │ │ │ │ +9EF2A Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9EF2B Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9EF2C General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9EF2E Compression Method 0008 (8) 'Deflated' │ │ │ │ +9EF30 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9EF34 CRC 6CEC6D86 (1827433862) │ │ │ │ +9EF38 Compressed Size 00000A98 (2712) │ │ │ │ +9EF3C Uncompressed Size 00002106 (8454) │ │ │ │ +9EF40 Filename Length 0014 (20) │ │ │ │ +9EF42 Extra Length 0018 (24) │ │ │ │ +9EF44 Comment Length 0000 (0) │ │ │ │ +9EF46 Disk Start 0000 (0) │ │ │ │ +9EF48 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9EF4A Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9EF4E Local Header Offset 00054EFA (347898) │ │ │ │ +9EF52 Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9EF52: Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9EF66 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9EF68 Length 0005 (5) │ │ │ │ +9EF6A Flags 01 (1) 'Modification' │ │ │ │ +9EF6B Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9EF6F Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9EF71 Length 000B (11) │ │ │ │ +9EF73 Version 01 (1) │ │ │ │ +9EF74 UID Size 04 (4) │ │ │ │ +9EF75 UID 00000000 (0) │ │ │ │ +9EF79 GID Size 04 (4) │ │ │ │ +9EF7A GID 00000000 (0) │ │ │ │ + │ │ │ │ +9EF7E CENTRAL HEADER #49 02014B50 (33639248) │ │ │ │ +9EF82 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9EF83 Created OS 03 (3) 'Unix' │ │ │ │ +9EF84 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9EF85 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9EF86 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9EF88 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9EF8A Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9EF8E CRC 025708CA (39258314) │ │ │ │ +9EF92 Compressed Size 0000AD70 (44400) │ │ │ │ +9EF96 Uncompressed Size 0003EB1B (256795) │ │ │ │ +9EF9A Filename Length 0017 (23) │ │ │ │ +9EF9C Extra Length 0018 (24) │ │ │ │ +9EF9E Comment Length 0000 (0) │ │ │ │ +9EFA0 Disk Start 0000 (0) │ │ │ │ +9EFA2 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9EFA4 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9EFA8 Local Header Offset 000559E0 (350688) │ │ │ │ +9EFAC Filename 'XXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9EFAC: Filename 'XXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9EFC3 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9EFC5 Length 0005 (5) │ │ │ │ +9EFC7 Flags 01 (1) 'Modification' │ │ │ │ +9EFC8 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9EFCC Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9EFCE Length 000B (11) │ │ │ │ +9EFD0 Version 01 (1) │ │ │ │ +9EFD1 UID Size 04 (4) │ │ │ │ +9EFD2 UID 00000000 (0) │ │ │ │ +9EFD6 GID Size 04 (4) │ │ │ │ +9EFD7 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9EFDB CENTRAL HEADER #50 02014B50 (33639248) │ │ │ │ +9EFDF Created Zip Spec 3D (61) '6.1' │ │ │ │ +9EFE0 Created OS 03 (3) 'Unix' │ │ │ │ +9EFE1 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9EFE2 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9EFE3 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9EFE5 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9EFE7 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9EFEB CRC A87C41BB (2826715579) │ │ │ │ +9EFEF Compressed Size 00000401 (1025) │ │ │ │ +9EFF3 Uncompressed Size 0000093E (2366) │ │ │ │ +9EFF7 Filename Length 0013 (19) │ │ │ │ +9EFF9 Extra Length 0018 (24) │ │ │ │ +9EFFB Comment Length 0000 (0) │ │ │ │ +9EFFD Disk Start 0000 (0) │ │ │ │ +9EFFF Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9F001 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9F005 Local Header Offset 000607A1 (395169) │ │ │ │ +9F009 Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9F009: Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9F01C Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9F01E Length 0005 (5) │ │ │ │ +9F020 Flags 01 (1) 'Modification' │ │ │ │ +9F021 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9F025 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9F027 Length 000B (11) │ │ │ │ +9F029 Version 01 (1) │ │ │ │ +9F02A UID Size 04 (4) │ │ │ │ +9F02B UID 00000000 (0) │ │ │ │ +9F02F GID Size 04 (4) │ │ │ │ +9F030 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9F034 CENTRAL HEADER #51 02014B50 (33639248) │ │ │ │ +9F038 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9F039 Created OS 03 (3) 'Unix' │ │ │ │ +9F03A Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9F03B Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9F03C General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9F03E Compression Method 0008 (8) 'Deflated' │ │ │ │ +9F040 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9F044 CRC D64BD6EC (3595294444) │ │ │ │ +9F048 Compressed Size 000014D5 (5333) │ │ │ │ +9F04C Uncompressed Size 00006893 (26771) │ │ │ │ +9F050 Filename Length 0012 (18) │ │ │ │ +9F052 Extra Length 0018 (24) │ │ │ │ +9F054 Comment Length 0000 (0) │ │ │ │ +9F056 Disk Start 0000 (0) │ │ │ │ +9F058 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9F05A Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9F05E Local Header Offset 00060BEF (396271) │ │ │ │ +9F062 Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9F062: Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9F074 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9F076 Length 0005 (5) │ │ │ │ +9F078 Flags 01 (1) 'Modification' │ │ │ │ +9F079 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9F07D Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9F07F Length 000B (11) │ │ │ │ +9F081 Version 01 (1) │ │ │ │ +9F082 UID Size 04 (4) │ │ │ │ +9F083 UID 00000000 (0) │ │ │ │ +9F087 GID Size 04 (4) │ │ │ │ +9F088 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9F08C CENTRAL HEADER #52 02014B50 (33639248) │ │ │ │ +9F090 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9F091 Created OS 03 (3) 'Unix' │ │ │ │ +9F092 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9F093 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9F094 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9F096 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9F098 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9F09C CRC 6BB332CD (1806906061) │ │ │ │ +9F0A0 Compressed Size 000011EF (4591) │ │ │ │ +9F0A4 Uncompressed Size 0000410D (16653) │ │ │ │ +9F0A8 Filename Length 0012 (18) │ │ │ │ +9F0AA Extra Length 0018 (24) │ │ │ │ +9F0AC Comment Length 0000 (0) │ │ │ │ +9F0AE Disk Start 0000 (0) │ │ │ │ +9F0B0 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9F0B2 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9F0B6 Local Header Offset 00062110 (401680) │ │ │ │ +9F0BA Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9F0BA: Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9F0CC Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9F0CE Length 0005 (5) │ │ │ │ +9F0D0 Flags 01 (1) 'Modification' │ │ │ │ +9F0D1 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9F0D5 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9F0D7 Length 000B (11) │ │ │ │ +9F0D9 Version 01 (1) │ │ │ │ +9F0DA UID Size 04 (4) │ │ │ │ +9F0DB UID 00000000 (0) │ │ │ │ +9F0DF GID Size 04 (4) │ │ │ │ +9F0E0 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9F0E4 CENTRAL HEADER #53 02014B50 (33639248) │ │ │ │ +9F0E8 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9F0E9 Created OS 03 (3) 'Unix' │ │ │ │ +9F0EA Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9F0EB Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9F0EC General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9F0EE Compression Method 0008 (8) 'Deflated' │ │ │ │ +9F0F0 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9F0F4 CRC C85B6AAE (3361434286) │ │ │ │ +9F0F8 Compressed Size 000009DB (2523) │ │ │ │ +9F0FC Uncompressed Size 0000352A (13610) │ │ │ │ +9F100 Filename Length 0019 (25) │ │ │ │ +9F102 Extra Length 0018 (24) │ │ │ │ +9F104 Comment Length 0000 (0) │ │ │ │ +9F106 Disk Start 0000 (0) │ │ │ │ +9F108 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9F10A Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9F10E Local Header Offset 0006334B (406347) │ │ │ │ +9F112 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9F112: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9F12B Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9F12D Length 0005 (5) │ │ │ │ +9F12F Flags 01 (1) 'Modification' │ │ │ │ +9F130 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9F134 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9F136 Length 000B (11) │ │ │ │ +9F138 Version 01 (1) │ │ │ │ +9F139 UID Size 04 (4) │ │ │ │ +9F13A UID 00000000 (0) │ │ │ │ +9F13E GID Size 04 (4) │ │ │ │ +9F13F GID 00000000 (0) │ │ │ │ + │ │ │ │ +9F143 CENTRAL HEADER #54 02014B50 (33639248) │ │ │ │ +9F147 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9F148 Created OS 03 (3) 'Unix' │ │ │ │ +9F149 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9F14A Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9F14B General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9F14D Compression Method 0008 (8) 'Deflated' │ │ │ │ +9F14F Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9F153 CRC 8032353E (2150774078) │ │ │ │ +9F157 Compressed Size 000018B7 (6327) │ │ │ │ +9F15B Uncompressed Size 0000A679 (42617) │ │ │ │ +9F15F Filename Length 0019 (25) │ │ │ │ +9F161 Extra Length 0018 (24) │ │ │ │ +9F163 Comment Length 0000 (0) │ │ │ │ +9F165 Disk Start 0000 (0) │ │ │ │ +9F167 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9F169 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9F16D Local Header Offset 00063D79 (408953) │ │ │ │ +9F171 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9F171: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9F18A Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9F18C Length 0005 (5) │ │ │ │ +9F18E Flags 01 (1) 'Modification' │ │ │ │ +9F18F Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9F193 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9F195 Length 000B (11) │ │ │ │ +9F197 Version 01 (1) │ │ │ │ +9F198 UID Size 04 (4) │ │ │ │ +9F199 UID 00000000 (0) │ │ │ │ +9F19D GID Size 04 (4) │ │ │ │ +9F19E GID 00000000 (0) │ │ │ │ + │ │ │ │ +9F1A2 CENTRAL HEADER #55 02014B50 (33639248) │ │ │ │ +9F1A6 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9F1A7 Created OS 03 (3) 'Unix' │ │ │ │ +9F1A8 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9F1A9 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9F1AA General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9F1AC Compression Method 0008 (8) 'Deflated' │ │ │ │ +9F1AE Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9F1B2 CRC 63DD925D (1675465309) │ │ │ │ +9F1B6 Compressed Size 0000177F (6015) │ │ │ │ +9F1BA Uncompressed Size 0000472D (18221) │ │ │ │ +9F1BE Filename Length 0014 (20) │ │ │ │ +9F1C0 Extra Length 0018 (24) │ │ │ │ +9F1C2 Comment Length 0000 (0) │ │ │ │ +9F1C4 Disk Start 0000 (0) │ │ │ │ +9F1C6 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9F1C8 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9F1CC Local Header Offset 00065683 (415363) │ │ │ │ +9F1D0 Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9F1D0: Filename 'XXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9F1E4 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9F1E6 Length 0005 (5) │ │ │ │ +9F1E8 Flags 01 (1) 'Modification' │ │ │ │ +9F1E9 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9F1ED Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9F1EF Length 000B (11) │ │ │ │ +9F1F1 Version 01 (1) │ │ │ │ +9F1F2 UID Size 04 (4) │ │ │ │ +9F1F3 UID 00000000 (0) │ │ │ │ +9F1F7 GID Size 04 (4) │ │ │ │ +9F1F8 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9F1FC CENTRAL HEADER #56 02014B50 (33639248) │ │ │ │ +9F200 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9F201 Created OS 03 (3) 'Unix' │ │ │ │ +9F202 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9F203 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9F204 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9F206 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9F208 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9F20C CRC 7088EC5F (1888021599) │ │ │ │ +9F210 Compressed Size 0000040B (1035) │ │ │ │ +9F214 Uncompressed Size 00000826 (2086) │ │ │ │ +9F218 Filename Length 001C (28) │ │ │ │ +9F21A Extra Length 0018 (24) │ │ │ │ +9F21C Comment Length 0000 (0) │ │ │ │ +9F21E Disk Start 0000 (0) │ │ │ │ +9F220 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9F222 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9F226 Local Header Offset 00066E50 (421456) │ │ │ │ +9F22A Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9F22A: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9F246 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9F248 Length 0005 (5) │ │ │ │ +9F24A Flags 01 (1) 'Modification' │ │ │ │ +9F24B Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9F24F Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9F251 Length 000B (11) │ │ │ │ +9F253 Version 01 (1) │ │ │ │ +9F254 UID Size 04 (4) │ │ │ │ +9F255 UID 00000000 (0) │ │ │ │ +9F259 GID Size 04 (4) │ │ │ │ +9F25A GID 00000000 (0) │ │ │ │ + │ │ │ │ +9F25E CENTRAL HEADER #57 02014B50 (33639248) │ │ │ │ +9F262 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9F263 Created OS 03 (3) 'Unix' │ │ │ │ +9F264 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9F265 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9F266 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9F268 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9F26A Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9F26E CRC 6536E3B1 (1698096049) │ │ │ │ +9F272 Compressed Size 0000249F (9375) │ │ │ │ +9F276 Uncompressed Size 0000B5FA (46586) │ │ │ │ +9F27A Filename Length 001F (31) │ │ │ │ +9F27C Extra Length 0018 (24) │ │ │ │ +9F27E Comment Length 0000 (0) │ │ │ │ +9F280 Disk Start 0000 (0) │ │ │ │ +9F282 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9F284 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9F288 Local Header Offset 000672B1 (422577) │ │ │ │ +9F28C Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9F28C: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9F2AB Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9F2AD Length 0005 (5) │ │ │ │ +9F2AF Flags 01 (1) 'Modification' │ │ │ │ +9F2B0 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9F2B4 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9F2B6 Length 000B (11) │ │ │ │ +9F2B8 Version 01 (1) │ │ │ │ +9F2B9 UID Size 04 (4) │ │ │ │ +9F2BA UID 00000000 (0) │ │ │ │ +9F2BE GID Size 04 (4) │ │ │ │ +9F2BF GID 00000000 (0) │ │ │ │ + │ │ │ │ +9F2C3 CENTRAL HEADER #58 02014B50 (33639248) │ │ │ │ +9F2C7 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9F2C8 Created OS 03 (3) 'Unix' │ │ │ │ +9F2C9 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9F2CA Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9F2CB General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9F2CD Compression Method 0008 (8) 'Deflated' │ │ │ │ +9F2CF Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9F2D3 CRC CD9E93C9 (3449721801) │ │ │ │ +9F2D7 Compressed Size 00000E81 (3713) │ │ │ │ +9F2DB Uncompressed Size 000052DA (21210) │ │ │ │ +9F2DF Filename Length 001F (31) │ │ │ │ +9F2E1 Extra Length 0018 (24) │ │ │ │ +9F2E3 Comment Length 0000 (0) │ │ │ │ +9F2E5 Disk Start 0000 (0) │ │ │ │ +9F2E7 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9F2E9 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9F2ED Local Header Offset 000697A9 (432041) │ │ │ │ +9F2F1 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9F2F1: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9F310 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9F312 Length 0005 (5) │ │ │ │ +9F314 Flags 01 (1) 'Modification' │ │ │ │ +9F315 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9F319 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9F31B Length 000B (11) │ │ │ │ +9F31D Version 01 (1) │ │ │ │ +9F31E UID Size 04 (4) │ │ │ │ +9F31F UID 00000000 (0) │ │ │ │ +9F323 GID Size 04 (4) │ │ │ │ +9F324 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9F328 CENTRAL HEADER #59 02014B50 (33639248) │ │ │ │ +9F32C Created Zip Spec 3D (61) '6.1' │ │ │ │ +9F32D Created OS 03 (3) 'Unix' │ │ │ │ +9F32E Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9F32F Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9F330 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9F332 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9F334 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9F338 CRC AD6F9DA2 (2909773218) │ │ │ │ +9F33C Compressed Size 00000A45 (2629) │ │ │ │ +9F340 Uncompressed Size 0000247B (9339) │ │ │ │ +9F344 Filename Length 0013 (19) │ │ │ │ +9F346 Extra Length 0018 (24) │ │ │ │ +9F348 Comment Length 0000 (0) │ │ │ │ +9F34A Disk Start 0000 (0) │ │ │ │ +9F34C Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9F34E Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9F352 Local Header Offset 0006A683 (435843) │ │ │ │ +9F356 Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9F356: Filename 'XXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9F369 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9F36B Length 0005 (5) │ │ │ │ +9F36D Flags 01 (1) 'Modification' │ │ │ │ +9F36E Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9F372 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9F374 Length 000B (11) │ │ │ │ +9F376 Version 01 (1) │ │ │ │ +9F377 UID Size 04 (4) │ │ │ │ +9F378 UID 00000000 (0) │ │ │ │ +9F37C GID Size 04 (4) │ │ │ │ +9F37D GID 00000000 (0) │ │ │ │ + │ │ │ │ +9F381 CENTRAL HEADER #60 02014B50 (33639248) │ │ │ │ +9F385 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9F386 Created OS 03 (3) 'Unix' │ │ │ │ +9F387 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9F388 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9F389 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9F38B Compression Method 0008 (8) 'Deflated' │ │ │ │ +9F38D Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9F391 CRC E99AD3C2 (3919238082) │ │ │ │ +9F395 Compressed Size 00002488 (9352) │ │ │ │ +9F399 Uncompressed Size 0000B84D (47181) │ │ │ │ +9F39D Filename Length 0019 (25) │ │ │ │ +9F39F Extra Length 0018 (24) │ │ │ │ +9F3A1 Comment Length 0000 (0) │ │ │ │ +9F3A3 Disk Start 0000 (0) │ │ │ │ +9F3A5 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9F3A7 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9F3AB Local Header Offset 0006B115 (438549) │ │ │ │ +9F3AF Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9F3AF: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9F3C8 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9F3CA Length 0005 (5) │ │ │ │ +9F3CC Flags 01 (1) 'Modification' │ │ │ │ +9F3CD Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9F3D1 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9F3D3 Length 000B (11) │ │ │ │ +9F3D5 Version 01 (1) │ │ │ │ +9F3D6 UID Size 04 (4) │ │ │ │ +9F3D7 UID 00000000 (0) │ │ │ │ +9F3DB GID Size 04 (4) │ │ │ │ +9F3DC GID 00000000 (0) │ │ │ │ + │ │ │ │ +9F3E0 CENTRAL HEADER #61 02014B50 (33639248) │ │ │ │ +9F3E4 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9F3E5 Created OS 03 (3) 'Unix' │ │ │ │ +9F3E6 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9F3E7 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9F3E8 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9F3EA Compression Method 0008 (8) 'Deflated' │ │ │ │ +9F3EC Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9F3F0 CRC 88AC0595 (2292974997) │ │ │ │ +9F3F4 Compressed Size 00000EFB (3835) │ │ │ │ +9F3F8 Uncompressed Size 00003A2D (14893) │ │ │ │ +9F3FC Filename Length 0024 (36) │ │ │ │ +9F3FE Extra Length 0018 (24) │ │ │ │ +9F400 Comment Length 0000 (0) │ │ │ │ +9F402 Disk Start 0000 (0) │ │ │ │ +9F404 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9F406 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9F40A Local Header Offset 0006D5F0 (447984) │ │ │ │ +9F40E Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9F40E: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9F432 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9F434 Length 0005 (5) │ │ │ │ +9F436 Flags 01 (1) 'Modification' │ │ │ │ +9F437 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9F43B Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9F43D Length 000B (11) │ │ │ │ +9F43F Version 01 (1) │ │ │ │ +9F440 UID Size 04 (4) │ │ │ │ +9F441 UID 00000000 (0) │ │ │ │ +9F445 GID Size 04 (4) │ │ │ │ +9F446 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9F44A CENTRAL HEADER #62 02014B50 (33639248) │ │ │ │ +9F44E Created Zip Spec 3D (61) '6.1' │ │ │ │ +9F44F Created OS 03 (3) 'Unix' │ │ │ │ +9F450 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9F451 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9F452 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9F454 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9F456 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9F45A CRC 4F031D37 (1325604151) │ │ │ │ +9F45E Compressed Size 00001AB9 (6841) │ │ │ │ +9F462 Uncompressed Size 00005F39 (24377) │ │ │ │ +9F466 Filename Length 0017 (23) │ │ │ │ +9F468 Extra Length 0018 (24) │ │ │ │ +9F46A Comment Length 0000 (0) │ │ │ │ +9F46C Disk Start 0000 (0) │ │ │ │ +9F46E Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9F470 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9F474 Local Header Offset 0006E549 (451913) │ │ │ │ +9F478 Filename 'XXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9F478: Filename 'XXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9F48F Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9F491 Length 0005 (5) │ │ │ │ +9F493 Flags 01 (1) 'Modification' │ │ │ │ +9F494 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9F498 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9F49A Length 000B (11) │ │ │ │ +9F49C Version 01 (1) │ │ │ │ +9F49D UID Size 04 (4) │ │ │ │ +9F49E UID 00000000 (0) │ │ │ │ +9F4A2 GID Size 04 (4) │ │ │ │ +9F4A3 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9F4A7 CENTRAL HEADER #63 02014B50 (33639248) │ │ │ │ +9F4AB Created Zip Spec 3D (61) '6.1' │ │ │ │ +9F4AC Created OS 03 (3) 'Unix' │ │ │ │ +9F4AD Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9F4AE Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9F4AF General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9F4B1 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9F4B3 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9F4B7 CRC 11E32AF1 (300100337) │ │ │ │ +9F4BB Compressed Size 00000ED3 (3795) │ │ │ │ +9F4BF Uncompressed Size 000038E2 (14562) │ │ │ │ +9F4C3 Filename Length 0023 (35) │ │ │ │ +9F4C5 Extra Length 0018 (24) │ │ │ │ +9F4C7 Comment Length 0000 (0) │ │ │ │ +9F4C9 Disk Start 0000 (0) │ │ │ │ +9F4CB Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9F4CD Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9F4D1 Local Header Offset 00070053 (458835) │ │ │ │ +9F4D5 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9F4D5: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9F4F8 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9F4FA Length 0005 (5) │ │ │ │ +9F4FC Flags 01 (1) 'Modification' │ │ │ │ +9F4FD Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9F501 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9F503 Length 000B (11) │ │ │ │ +9F505 Version 01 (1) │ │ │ │ +9F506 UID Size 04 (4) │ │ │ │ +9F507 UID 00000000 (0) │ │ │ │ +9F50B GID Size 04 (4) │ │ │ │ +9F50C GID 00000000 (0) │ │ │ │ + │ │ │ │ +9F510 CENTRAL HEADER #64 02014B50 (33639248) │ │ │ │ +9F514 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9F515 Created OS 03 (3) 'Unix' │ │ │ │ +9F516 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9F517 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9F518 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9F51A Compression Method 0008 (8) 'Deflated' │ │ │ │ +9F51C Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9F520 CRC 2DB7929F (767005343) │ │ │ │ +9F524 Compressed Size 00000113 (275) │ │ │ │ +9F528 Uncompressed Size 000001F3 (499) │ │ │ │ +9F52C Filename Length 001B (27) │ │ │ │ +9F52E Extra Length 0018 (24) │ │ │ │ +9F530 Comment Length 0000 (0) │ │ │ │ +9F532 Disk Start 0000 (0) │ │ │ │ +9F534 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9F536 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9F53A Local Header Offset 00070F83 (462723) │ │ │ │ +9F53E Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9F53E: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9F559 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9F55B Length 0005 (5) │ │ │ │ +9F55D Flags 01 (1) 'Modification' │ │ │ │ +9F55E Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9F562 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9F564 Length 000B (11) │ │ │ │ +9F566 Version 01 (1) │ │ │ │ +9F567 UID Size 04 (4) │ │ │ │ +9F568 UID 00000000 (0) │ │ │ │ +9F56C GID Size 04 (4) │ │ │ │ +9F56D GID 00000000 (0) │ │ │ │ + │ │ │ │ +9F571 CENTRAL HEADER #65 02014B50 (33639248) │ │ │ │ +9F575 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9F576 Created OS 03 (3) 'Unix' │ │ │ │ +9F577 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9F578 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9F579 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9F57B Compression Method 0008 (8) 'Deflated' │ │ │ │ +9F57D Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9F581 CRC 4D088BEC (1292405740) │ │ │ │ +9F585 Compressed Size 00001891 (6289) │ │ │ │ +9F589 Uncompressed Size 00008FAD (36781) │ │ │ │ +9F58D Filename Length 001D (29) │ │ │ │ +9F58F Extra Length 0018 (24) │ │ │ │ +9F591 Comment Length 0000 (0) │ │ │ │ +9F593 Disk Start 0000 (0) │ │ │ │ +9F595 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9F597 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9F59B Local Header Offset 000710EB (463083) │ │ │ │ +9F59F Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9F59F: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9F5BC Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9F5BE Length 0005 (5) │ │ │ │ +9F5C0 Flags 01 (1) 'Modification' │ │ │ │ +9F5C1 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9F5C5 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9F5C7 Length 000B (11) │ │ │ │ +9F5C9 Version 01 (1) │ │ │ │ +9F5CA UID Size 04 (4) │ │ │ │ +9F5CB UID 00000000 (0) │ │ │ │ +9F5CF GID Size 04 (4) │ │ │ │ +9F5D0 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9F5D4 CENTRAL HEADER #66 02014B50 (33639248) │ │ │ │ +9F5D8 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9F5D9 Created OS 03 (3) 'Unix' │ │ │ │ +9F5DA Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9F5DB Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9F5DC General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9F5DE Compression Method 0008 (8) 'Deflated' │ │ │ │ +9F5E0 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9F5E4 CRC ECF01B2E (3975158574) │ │ │ │ +9F5E8 Compressed Size 0000164B (5707) │ │ │ │ +9F5EC Uncompressed Size 00003A9C (15004) │ │ │ │ +9F5F0 Filename Length 0015 (21) │ │ │ │ +9F5F2 Extra Length 0018 (24) │ │ │ │ +9F5F4 Comment Length 0000 (0) │ │ │ │ +9F5F6 Disk Start 0000 (0) │ │ │ │ +9F5F8 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9F5FA Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9F5FE Local Header Offset 000729D3 (469459) │ │ │ │ +9F602 Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9F602: Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9F617 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9F619 Length 0005 (5) │ │ │ │ +9F61B Flags 01 (1) 'Modification' │ │ │ │ +9F61C Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9F620 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9F622 Length 000B (11) │ │ │ │ +9F624 Version 01 (1) │ │ │ │ +9F625 UID Size 04 (4) │ │ │ │ +9F626 UID 00000000 (0) │ │ │ │ +9F62A GID Size 04 (4) │ │ │ │ +9F62B GID 00000000 (0) │ │ │ │ + │ │ │ │ +9F62F CENTRAL HEADER #67 02014B50 (33639248) │ │ │ │ +9F633 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9F634 Created OS 03 (3) 'Unix' │ │ │ │ +9F635 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9F636 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9F637 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9F639 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9F63B Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9F63F CRC 4AB846D3 (1253590739) │ │ │ │ +9F643 Compressed Size 00003B4F (15183) │ │ │ │ +9F647 Uncompressed Size 00011CC3 (72899) │ │ │ │ +9F64B Filename Length 0016 (22) │ │ │ │ +9F64D Extra Length 0018 (24) │ │ │ │ +9F64F Comment Length 0000 (0) │ │ │ │ +9F651 Disk Start 0000 (0) │ │ │ │ +9F653 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9F655 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9F659 Local Header Offset 0007406D (475245) │ │ │ │ +9F65D Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9F65D: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9F673 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9F675 Length 0005 (5) │ │ │ │ +9F677 Flags 01 (1) 'Modification' │ │ │ │ +9F678 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9F67C Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9F67E Length 000B (11) │ │ │ │ +9F680 Version 01 (1) │ │ │ │ +9F681 UID Size 04 (4) │ │ │ │ +9F682 UID 00000000 (0) │ │ │ │ +9F686 GID Size 04 (4) │ │ │ │ +9F687 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9F68B CENTRAL HEADER #68 02014B50 (33639248) │ │ │ │ +9F68F Created Zip Spec 3D (61) '6.1' │ │ │ │ +9F690 Created OS 03 (3) 'Unix' │ │ │ │ +9F691 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9F692 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9F693 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9F695 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9F697 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9F69B CRC 17EC873B (401377083) │ │ │ │ +9F69F Compressed Size 00003E7E (15998) │ │ │ │ +9F6A3 Uncompressed Size 0001C17C (115068) │ │ │ │ +9F6A7 Filename Length 0019 (25) │ │ │ │ +9F6A9 Extra Length 0018 (24) │ │ │ │ +9F6AB Comment Length 0000 (0) │ │ │ │ +9F6AD Disk Start 0000 (0) │ │ │ │ +9F6AF Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9F6B1 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9F6B5 Local Header Offset 00077C0C (490508) │ │ │ │ +9F6B9 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9F6B9: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9F6D2 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9F6D4 Length 0005 (5) │ │ │ │ +9F6D6 Flags 01 (1) 'Modification' │ │ │ │ +9F6D7 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9F6DB Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9F6DD Length 000B (11) │ │ │ │ +9F6DF Version 01 (1) │ │ │ │ +9F6E0 UID Size 04 (4) │ │ │ │ +9F6E1 UID 00000000 (0) │ │ │ │ +9F6E5 GID Size 04 (4) │ │ │ │ +9F6E6 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9F6EA CENTRAL HEADER #69 02014B50 (33639248) │ │ │ │ +9F6EE Created Zip Spec 3D (61) '6.1' │ │ │ │ +9F6EF Created OS 03 (3) 'Unix' │ │ │ │ +9F6F0 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9F6F1 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9F6F2 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9F6F4 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9F6F6 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9F6FA CRC 3FC481AE (1069842862) │ │ │ │ +9F6FE Compressed Size 0000083C (2108) │ │ │ │ +9F702 Uncompressed Size 00003384 (13188) │ │ │ │ +9F706 Filename Length 0011 (17) │ │ │ │ +9F708 Extra Length 0018 (24) │ │ │ │ +9F70A Comment Length 0000 (0) │ │ │ │ +9F70C Disk Start 0000 (0) │ │ │ │ +9F70E Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9F710 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9F714 Local Header Offset 0007BADD (506589) │ │ │ │ +9F718 Filename 'XXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9F718: Filename 'XXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9F729 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9F72B Length 0005 (5) │ │ │ │ +9F72D Flags 01 (1) 'Modification' │ │ │ │ +9F72E Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9F732 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9F734 Length 000B (11) │ │ │ │ +9F736 Version 01 (1) │ │ │ │ +9F737 UID Size 04 (4) │ │ │ │ +9F738 UID 00000000 (0) │ │ │ │ +9F73C GID Size 04 (4) │ │ │ │ +9F73D GID 00000000 (0) │ │ │ │ + │ │ │ │ +9F741 CENTRAL HEADER #70 02014B50 (33639248) │ │ │ │ +9F745 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9F746 Created OS 03 (3) 'Unix' │ │ │ │ +9F747 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9F748 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9F749 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9F74B Compression Method 0008 (8) 'Deflated' │ │ │ │ +9F74D Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9F751 CRC 49C20694 (1237452436) │ │ │ │ +9F755 Compressed Size 000051A0 (20896) │ │ │ │ +9F759 Uncompressed Size 0001FBE0 (130016) │ │ │ │ +9F75D Filename Length 0015 (21) │ │ │ │ +9F75F Extra Length 0018 (24) │ │ │ │ +9F761 Comment Length 0000 (0) │ │ │ │ +9F763 Disk Start 0000 (0) │ │ │ │ +9F765 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9F767 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9F76B Local Header Offset 0007C364 (508772) │ │ │ │ +9F76F Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9F76F: Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9F784 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9F786 Length 0005 (5) │ │ │ │ +9F788 Flags 01 (1) 'Modification' │ │ │ │ +9F789 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9F78D Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9F78F Length 000B (11) │ │ │ │ +9F791 Version 01 (1) │ │ │ │ +9F792 UID Size 04 (4) │ │ │ │ +9F793 UID 00000000 (0) │ │ │ │ +9F797 GID Size 04 (4) │ │ │ │ +9F798 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9F79C CENTRAL HEADER #71 02014B50 (33639248) │ │ │ │ +9F7A0 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9F7A1 Created OS 03 (3) 'Unix' │ │ │ │ +9F7A2 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9F7A3 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9F7A4 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9F7A6 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9F7A8 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9F7AC CRC 383CB23F (943501887) │ │ │ │ +9F7B0 Compressed Size 00001B0A (6922) │ │ │ │ +9F7B4 Uncompressed Size 000081D0 (33232) │ │ │ │ +9F7B8 Filename Length 0019 (25) │ │ │ │ +9F7BA Extra Length 0018 (24) │ │ │ │ +9F7BC Comment Length 0000 (0) │ │ │ │ +9F7BE Disk Start 0000 (0) │ │ │ │ +9F7C0 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9F7C2 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9F7C6 Local Header Offset 00081553 (529747) │ │ │ │ +9F7CA Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9F7CA: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9F7E3 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9F7E5 Length 0005 (5) │ │ │ │ +9F7E7 Flags 01 (1) 'Modification' │ │ │ │ +9F7E8 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9F7EC Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9F7EE Length 000B (11) │ │ │ │ +9F7F0 Version 01 (1) │ │ │ │ +9F7F1 UID Size 04 (4) │ │ │ │ +9F7F2 UID 00000000 (0) │ │ │ │ +9F7F6 GID Size 04 (4) │ │ │ │ +9F7F7 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9F7FB CENTRAL HEADER #72 02014B50 (33639248) │ │ │ │ +9F7FF Created Zip Spec 3D (61) '6.1' │ │ │ │ +9F800 Created OS 03 (3) 'Unix' │ │ │ │ +9F801 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9F802 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9F803 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9F805 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9F807 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9F80B CRC 38C0483A (952125498) │ │ │ │ +9F80F Compressed Size 00000D97 (3479) │ │ │ │ +9F813 Uncompressed Size 00002EA0 (11936) │ │ │ │ +9F817 Filename Length 0018 (24) │ │ │ │ +9F819 Extra Length 0018 (24) │ │ │ │ +9F81B Comment Length 0000 (0) │ │ │ │ +9F81D Disk Start 0000 (0) │ │ │ │ +9F81F Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9F821 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9F825 Local Header Offset 000830B0 (536752) │ │ │ │ +9F829 Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9F829: Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9F841 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9F843 Length 0005 (5) │ │ │ │ +9F845 Flags 01 (1) 'Modification' │ │ │ │ +9F846 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9F84A Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9F84C Length 000B (11) │ │ │ │ +9F84E Version 01 (1) │ │ │ │ +9F84F UID Size 04 (4) │ │ │ │ +9F850 UID 00000000 (0) │ │ │ │ +9F854 GID Size 04 (4) │ │ │ │ +9F855 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9F859 CENTRAL HEADER #73 02014B50 (33639248) │ │ │ │ +9F85D Created Zip Spec 3D (61) '6.1' │ │ │ │ +9F85E Created OS 03 (3) 'Unix' │ │ │ │ +9F85F Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9F860 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9F861 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9F863 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9F865 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9F869 CRC C1ECA9DB (3253512667) │ │ │ │ +9F86D Compressed Size 000001E1 (481) │ │ │ │ +9F871 Uncompressed Size 00000324 (804) │ │ │ │ +9F875 Filename Length 0011 (17) │ │ │ │ +9F877 Extra Length 0018 (24) │ │ │ │ +9F879 Comment Length 0000 (0) │ │ │ │ +9F87B Disk Start 0000 (0) │ │ │ │ +9F87D Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9F87F Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9F883 Local Header Offset 00083E99 (540313) │ │ │ │ +9F887 Filename 'XXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9F887: Filename 'XXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9F898 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9F89A Length 0005 (5) │ │ │ │ +9F89C Flags 01 (1) 'Modification' │ │ │ │ +9F89D Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9F8A1 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9F8A3 Length 000B (11) │ │ │ │ +9F8A5 Version 01 (1) │ │ │ │ +9F8A6 UID Size 04 (4) │ │ │ │ +9F8A7 UID 00000000 (0) │ │ │ │ +9F8AB GID Size 04 (4) │ │ │ │ +9F8AC GID 00000000 (0) │ │ │ │ + │ │ │ │ +9F8B0 CENTRAL HEADER #74 02014B50 (33639248) │ │ │ │ +9F8B4 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9F8B5 Created OS 03 (3) 'Unix' │ │ │ │ +9F8B6 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9F8B7 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9F8B8 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9F8BA Compression Method 0008 (8) 'Deflated' │ │ │ │ +9F8BC Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9F8C0 CRC A600F67C (2785080956) │ │ │ │ +9F8C4 Compressed Size 000006C3 (1731) │ │ │ │ +9F8C8 Uncompressed Size 0000143A (5178) │ │ │ │ +9F8CC Filename Length 0019 (25) │ │ │ │ +9F8CE Extra Length 0018 (24) │ │ │ │ +9F8D0 Comment Length 0000 (0) │ │ │ │ +9F8D2 Disk Start 0000 (0) │ │ │ │ +9F8D4 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9F8D6 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9F8DA Local Header Offset 000840C5 (540869) │ │ │ │ +9F8DE Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9F8DE: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9F8F7 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9F8F9 Length 0005 (5) │ │ │ │ +9F8FB Flags 01 (1) 'Modification' │ │ │ │ +9F8FC Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9F900 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9F902 Length 000B (11) │ │ │ │ +9F904 Version 01 (1) │ │ │ │ +9F905 UID Size 04 (4) │ │ │ │ +9F906 UID 00000000 (0) │ │ │ │ +9F90A GID Size 04 (4) │ │ │ │ +9F90B GID 00000000 (0) │ │ │ │ + │ │ │ │ +9F90F CENTRAL HEADER #75 02014B50 (33639248) │ │ │ │ +9F913 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9F914 Created OS 03 (3) 'Unix' │ │ │ │ +9F915 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9F916 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9F917 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9F919 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9F91B Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9F91F CRC 18EBB852 (418101330) │ │ │ │ +9F923 Compressed Size 00001B8F (7055) │ │ │ │ +9F927 Uncompressed Size 00009F60 (40800) │ │ │ │ +9F92B Filename Length 0018 (24) │ │ │ │ +9F92D Extra Length 0018 (24) │ │ │ │ +9F92F Comment Length 0000 (0) │ │ │ │ +9F931 Disk Start 0000 (0) │ │ │ │ +9F933 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9F935 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9F939 Local Header Offset 000847DB (542683) │ │ │ │ +9F93D Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9F93D: Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9F955 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9F957 Length 0005 (5) │ │ │ │ +9F959 Flags 01 (1) 'Modification' │ │ │ │ +9F95A Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9F95E Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9F960 Length 000B (11) │ │ │ │ +9F962 Version 01 (1) │ │ │ │ +9F963 UID Size 04 (4) │ │ │ │ +9F964 UID 00000000 (0) │ │ │ │ +9F968 GID Size 04 (4) │ │ │ │ +9F969 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9F96D CENTRAL HEADER #76 02014B50 (33639248) │ │ │ │ +9F971 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9F972 Created OS 03 (3) 'Unix' │ │ │ │ +9F973 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9F974 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9F975 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9F977 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9F979 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9F97D CRC A29C75F2 (2728162802) │ │ │ │ +9F981 Compressed Size 000016FD (5885) │ │ │ │ +9F985 Uncompressed Size 00008B13 (35603) │ │ │ │ +9F989 Filename Length 0012 (18) │ │ │ │ +9F98B Extra Length 0018 (24) │ │ │ │ +9F98D Comment Length 0000 (0) │ │ │ │ +9F98F Disk Start 0000 (0) │ │ │ │ +9F991 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9F993 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9F997 Local Header Offset 000863BC (549820) │ │ │ │ +9F99B Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9F99B: Filename 'XXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9F9AD Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9F9AF Length 0005 (5) │ │ │ │ +9F9B1 Flags 01 (1) 'Modification' │ │ │ │ +9F9B2 Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9F9B6 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9F9B8 Length 000B (11) │ │ │ │ +9F9BA Version 01 (1) │ │ │ │ +9F9BB UID Size 04 (4) │ │ │ │ +9F9BC UID 00000000 (0) │ │ │ │ +9F9C0 GID Size 04 (4) │ │ │ │ +9F9C1 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9F9C5 CENTRAL HEADER #77 02014B50 (33639248) │ │ │ │ +9F9C9 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9F9CA Created OS 03 (3) 'Unix' │ │ │ │ +9F9CB Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9F9CC Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9F9CD General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9F9CF Compression Method 0008 (8) 'Deflated' │ │ │ │ +9F9D1 Modification Time 5C9B8586 (1553696134) 'Mon Apr 27 16:44:12 2026' │ │ │ │ +9F9D5 CRC 9D59BBDC (2639903708) │ │ │ │ +9F9D9 Compressed Size 00001E0B (7691) │ │ │ │ +9F9DD Uncompressed Size 00008804 (34820) │ │ │ │ +9F9E1 Filename Length 0016 (22) │ │ │ │ +9F9E3 Extra Length 0018 (24) │ │ │ │ +9F9E5 Comment Length 0000 (0) │ │ │ │ +9F9E7 Disk Start 0000 (0) │ │ │ │ +9F9E9 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9F9EB Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9F9EF Local Header Offset 00087B05 (555781) │ │ │ │ +9F9F3 Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9F9F3: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9FA09 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9FA0B Length 0005 (5) │ │ │ │ +9FA0D Flags 01 (1) 'Modification' │ │ │ │ +9FA0E Modification Time 69EF925D (1777308253) 'Mon Apr 27 16:44:13 2026' │ │ │ │ +9FA12 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9FA14 Length 000B (11) │ │ │ │ +9FA16 Version 01 (1) │ │ │ │ +9FA17 UID Size 04 (4) │ │ │ │ +9FA18 UID 00000000 (0) │ │ │ │ +9FA1C GID Size 04 (4) │ │ │ │ +9FA1D GID 00000000 (0) │ │ │ │ + │ │ │ │ +9FA21 CENTRAL HEADER #78 02014B50 (33639248) │ │ │ │ +9FA25 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9FA26 Created OS 03 (3) 'Unix' │ │ │ │ +9FA27 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9FA28 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9FA29 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9FA2B Compression Method 0008 (8) 'Deflated' │ │ │ │ +9FA2D Modification Time 5C9B8587 (1553696135) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9FA31 CRC 70A0EB3A (1889594170) │ │ │ │ +9FA35 Compressed Size 000029AA (10666) │ │ │ │ +9FA39 Uncompressed Size 0000D050 (53328) │ │ │ │ +9FA3D Filename Length 001A (26) │ │ │ │ +9FA3F Extra Length 0018 (24) │ │ │ │ +9FA41 Comment Length 0000 (0) │ │ │ │ +9FA43 Disk Start 0000 (0) │ │ │ │ +9FA45 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9FA47 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9FA4B Local Header Offset 00089960 (563552) │ │ │ │ +9FA4F Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9FA4F: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9FA69 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9FA6B Length 0005 (5) │ │ │ │ +9FA6D Flags 01 (1) 'Modification' │ │ │ │ +9FA6E Modification Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9FA72 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9FA74 Length 000B (11) │ │ │ │ +9FA76 Version 01 (1) │ │ │ │ +9FA77 UID Size 04 (4) │ │ │ │ +9FA78 UID 00000000 (0) │ │ │ │ +9FA7C GID Size 04 (4) │ │ │ │ +9FA7D GID 00000000 (0) │ │ │ │ + │ │ │ │ +9FA81 CENTRAL HEADER #79 02014B50 (33639248) │ │ │ │ +9FA85 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9FA86 Created OS 03 (3) 'Unix' │ │ │ │ +9FA87 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9FA88 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9FA89 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9FA8B Compression Method 0008 (8) 'Deflated' │ │ │ │ +9FA8D Modification Time 5C9B8587 (1553696135) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9FA91 CRC C79CE53D (3348948285) │ │ │ │ +9FA95 Compressed Size 000009AD (2477) │ │ │ │ +9FA99 Uncompressed Size 00001DB7 (7607) │ │ │ │ +9FA9D Filename Length 0018 (24) │ │ │ │ +9FA9F Extra Length 0018 (24) │ │ │ │ +9FAA1 Comment Length 0000 (0) │ │ │ │ +9FAA3 Disk Start 0000 (0) │ │ │ │ +9FAA5 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9FAA7 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9FAAB Local Header Offset 0008C35E (574302) │ │ │ │ +9FAAF Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9FAAF: Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9FAC7 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9FAC9 Length 0005 (5) │ │ │ │ +9FACB Flags 01 (1) 'Modification' │ │ │ │ +9FACC Modification Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9FAD0 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9FAD2 Length 000B (11) │ │ │ │ +9FAD4 Version 01 (1) │ │ │ │ +9FAD5 UID Size 04 (4) │ │ │ │ +9FAD6 UID 00000000 (0) │ │ │ │ +9FADA GID Size 04 (4) │ │ │ │ +9FADB GID 00000000 (0) │ │ │ │ + │ │ │ │ +9FADF CENTRAL HEADER #80 02014B50 (33639248) │ │ │ │ +9FAE3 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9FAE4 Created OS 03 (3) 'Unix' │ │ │ │ +9FAE5 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9FAE6 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9FAE7 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9FAE9 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9FAEB Modification Time 5C9B8587 (1553696135) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9FAEF CRC F5E2129F (4125233823) │ │ │ │ +9FAF3 Compressed Size 000016BC (5820) │ │ │ │ +9FAF7 Uncompressed Size 000016CD (5837) │ │ │ │ +9FAFB Filename Length 0015 (21) │ │ │ │ +9FAFD Extra Length 0018 (24) │ │ │ │ +9FAFF Comment Length 0000 (0) │ │ │ │ +9FB01 Disk Start 0000 (0) │ │ │ │ +9FB03 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9FB05 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9FB09 Local Header Offset 0008CD5D (576861) │ │ │ │ +9FB0D Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9FB0D: Filename 'XXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9FB22 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9FB24 Length 0005 (5) │ │ │ │ +9FB26 Flags 01 (1) 'Modification' │ │ │ │ +9FB27 Modification Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9FB2B Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9FB2D Length 000B (11) │ │ │ │ +9FB2F Version 01 (1) │ │ │ │ +9FB30 UID Size 04 (4) │ │ │ │ +9FB31 UID 00000000 (0) │ │ │ │ +9FB35 GID Size 04 (4) │ │ │ │ +9FB36 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9FB3A CENTRAL HEADER #81 02014B50 (33639248) │ │ │ │ +9FB3E Created Zip Spec 3D (61) '6.1' │ │ │ │ +9FB3F Created OS 03 (3) 'Unix' │ │ │ │ +9FB40 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9FB41 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9FB42 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9FB44 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9FB46 Modification Time 5C9B8587 (1553696135) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9FB4A CRC F5E2129F (4125233823) │ │ │ │ +9FB4E Compressed Size 000016BC (5820) │ │ │ │ +9FB52 Uncompressed Size 000016CD (5837) │ │ │ │ +9FB56 Filename Length 001C (28) │ │ │ │ +9FB58 Extra Length 0018 (24) │ │ │ │ +9FB5A Comment Length 0000 (0) │ │ │ │ +9FB5C Disk Start 0000 (0) │ │ │ │ +9FB5E Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9FB60 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9FB64 Local Header Offset 0008E468 (582760) │ │ │ │ +9FB68 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9FB68: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9FB84 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9FB86 Length 0005 (5) │ │ │ │ +9FB88 Flags 01 (1) 'Modification' │ │ │ │ +9FB89 Modification Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9FB8D Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9FB8F Length 000B (11) │ │ │ │ +9FB91 Version 01 (1) │ │ │ │ +9FB92 UID Size 04 (4) │ │ │ │ +9FB93 UID 00000000 (0) │ │ │ │ +9FB97 GID Size 04 (4) │ │ │ │ +9FB98 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9FB9C CENTRAL HEADER #82 02014B50 (33639248) │ │ │ │ +9FBA0 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9FBA1 Created OS 03 (3) 'Unix' │ │ │ │ +9FBA2 Extract Zip Spec 0A (10) '1.0' │ │ │ │ +9FBA3 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9FBA4 General Purpose Flag 0000 (0) │ │ │ │ +9FBA6 Compression Method 0000 (0) 'Stored' │ │ │ │ +9FBA8 Modification Time 5C9B8587 (1553696135) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9FBAC CRC FC95F24B (4237685323) │ │ │ │ +9FBB0 Compressed Size 00001B84 (7044) │ │ │ │ +9FBB4 Uncompressed Size 00001B84 (7044) │ │ │ │ +9FBB8 Filename Length 0016 (22) │ │ │ │ +9FBBA Extra Length 0018 (24) │ │ │ │ +9FBBC Comment Length 0000 (0) │ │ │ │ +9FBBE Disk Start 0000 (0) │ │ │ │ +9FBC0 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9FBC2 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9FBC6 Local Header Offset 0008FB7A (588666) │ │ │ │ +9FBCA Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9FBCA: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9FBE0 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9FBE2 Length 0005 (5) │ │ │ │ +9FBE4 Flags 01 (1) 'Modification' │ │ │ │ +9FBE5 Modification Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9FBE9 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9FBEB Length 000B (11) │ │ │ │ +9FBED Version 01 (1) │ │ │ │ +9FBEE UID Size 04 (4) │ │ │ │ +9FBEF UID 00000000 (0) │ │ │ │ +9FBF3 GID Size 04 (4) │ │ │ │ +9FBF4 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9FBF8 CENTRAL HEADER #83 02014B50 (33639248) │ │ │ │ +9FBFC Created Zip Spec 3D (61) '6.1' │ │ │ │ +9FBFD Created OS 03 (3) 'Unix' │ │ │ │ +9FBFE Extract Zip Spec 0A (10) '1.0' │ │ │ │ +9FBFF Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9FC00 General Purpose Flag 0000 (0) │ │ │ │ +9FC02 Compression Method 0000 (0) 'Stored' │ │ │ │ +9FC04 Modification Time 5C9B8587 (1553696135) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9FC08 CRC D0D71F86 (3503759238) │ │ │ │ +9FC0C Compressed Size 00000B7B (2939) │ │ │ │ +9FC10 Uncompressed Size 00000B7B (2939) │ │ │ │ +9FC14 Filename Length 0016 (22) │ │ │ │ +9FC16 Extra Length 0018 (24) │ │ │ │ +9FC18 Comment Length 0000 (0) │ │ │ │ +9FC1A Disk Start 0000 (0) │ │ │ │ +9FC1C Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9FC1E Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9FC22 Local Header Offset 0009174E (595790) │ │ │ │ +9FC26 Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9FC26: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9FC3C Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9FC3E Length 0005 (5) │ │ │ │ +9FC40 Flags 01 (1) 'Modification' │ │ │ │ +9FC41 Modification Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9FC45 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9FC47 Length 000B (11) │ │ │ │ +9FC49 Version 01 (1) │ │ │ │ +9FC4A UID Size 04 (4) │ │ │ │ +9FC4B UID 00000000 (0) │ │ │ │ +9FC4F GID Size 04 (4) │ │ │ │ +9FC50 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9FC54 CENTRAL HEADER #84 02014B50 (33639248) │ │ │ │ +9FC58 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9FC59 Created OS 03 (3) 'Unix' │ │ │ │ +9FC5A Extract Zip Spec 0A (10) '1.0' │ │ │ │ +9FC5B Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9FC5C General Purpose Flag 0000 (0) │ │ │ │ +9FC5E Compression Method 0000 (0) 'Stored' │ │ │ │ +9FC60 Modification Time 5C9B8587 (1553696135) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9FC64 CRC FFF9C4D2 (4294558930) │ │ │ │ +9FC68 Compressed Size 0000138F (5007) │ │ │ │ +9FC6C Uncompressed Size 0000138F (5007) │ │ │ │ +9FC70 Filename Length 0016 (22) │ │ │ │ +9FC72 Extra Length 0018 (24) │ │ │ │ +9FC74 Comment Length 0000 (0) │ │ │ │ +9FC76 Disk Start 0000 (0) │ │ │ │ +9FC78 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9FC7A Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9FC7E Local Header Offset 00092319 (598809) │ │ │ │ +9FC82 Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9FC82: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9FC98 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9FC9A Length 0005 (5) │ │ │ │ +9FC9C Flags 01 (1) 'Modification' │ │ │ │ +9FC9D Modification Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9FCA1 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9FCA3 Length 000B (11) │ │ │ │ +9FCA5 Version 01 (1) │ │ │ │ +9FCA6 UID Size 04 (4) │ │ │ │ +9FCA7 UID 00000000 (0) │ │ │ │ +9FCAB GID Size 04 (4) │ │ │ │ +9FCAC GID 00000000 (0) │ │ │ │ + │ │ │ │ +9FCB0 CENTRAL HEADER #85 02014B50 (33639248) │ │ │ │ +9FCB4 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9FCB5 Created OS 03 (3) 'Unix' │ │ │ │ +9FCB6 Extract Zip Spec 0A (10) '1.0' │ │ │ │ +9FCB7 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9FCB8 General Purpose Flag 0000 (0) │ │ │ │ +9FCBA Compression Method 0000 (0) 'Stored' │ │ │ │ +9FCBC Modification Time 5C9B8587 (1553696135) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9FCC0 CRC A1037E8E (2701360782) │ │ │ │ +9FCC4 Compressed Size 0000145E (5214) │ │ │ │ +9FCC8 Uncompressed Size 0000145E (5214) │ │ │ │ +9FCCC Filename Length 0016 (22) │ │ │ │ +9FCCE Extra Length 0018 (24) │ │ │ │ +9FCD0 Comment Length 0000 (0) │ │ │ │ +9FCD2 Disk Start 0000 (0) │ │ │ │ +9FCD4 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9FCD6 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9FCDA Local Header Offset 000936F8 (603896) │ │ │ │ +9FCDE Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9FCDE: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9FCF4 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9FCF6 Length 0005 (5) │ │ │ │ +9FCF8 Flags 01 (1) 'Modification' │ │ │ │ +9FCF9 Modification Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9FCFD Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9FCFF Length 000B (11) │ │ │ │ +9FD01 Version 01 (1) │ │ │ │ +9FD02 UID Size 04 (4) │ │ │ │ +9FD03 UID 00000000 (0) │ │ │ │ +9FD07 GID Size 04 (4) │ │ │ │ +9FD08 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9FD0C CENTRAL HEADER #86 02014B50 (33639248) │ │ │ │ +9FD10 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9FD11 Created OS 03 (3) 'Unix' │ │ │ │ +9FD12 Extract Zip Spec 0A (10) '1.0' │ │ │ │ +9FD13 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9FD14 General Purpose Flag 0000 (0) │ │ │ │ +9FD16 Compression Method 0000 (0) 'Stored' │ │ │ │ +9FD18 Modification Time 5C9B8587 (1553696135) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9FD1C CRC 5E9E64F1 (1587438833) │ │ │ │ +9FD20 Compressed Size 000008EC (2284) │ │ │ │ +9FD24 Uncompressed Size 000008EC (2284) │ │ │ │ +9FD28 Filename Length 0016 (22) │ │ │ │ +9FD2A Extra Length 0018 (24) │ │ │ │ +9FD2C Comment Length 0000 (0) │ │ │ │ +9FD2E Disk Start 0000 (0) │ │ │ │ +9FD30 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9FD32 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9FD36 Local Header Offset 00094BA6 (609190) │ │ │ │ +9FD3A Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9FD3A: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9FD50 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9FD52 Length 0005 (5) │ │ │ │ +9FD54 Flags 01 (1) 'Modification' │ │ │ │ +9FD55 Modification Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9FD59 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9FD5B Length 000B (11) │ │ │ │ +9FD5D Version 01 (1) │ │ │ │ +9FD5E UID Size 04 (4) │ │ │ │ +9FD5F UID 00000000 (0) │ │ │ │ +9FD63 GID Size 04 (4) │ │ │ │ +9FD64 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9FD68 CENTRAL HEADER #87 02014B50 (33639248) │ │ │ │ +9FD6C Created Zip Spec 3D (61) '6.1' │ │ │ │ +9FD6D Created OS 03 (3) 'Unix' │ │ │ │ +9FD6E Extract Zip Spec 0A (10) '1.0' │ │ │ │ +9FD6F Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9FD70 General Purpose Flag 0000 (0) │ │ │ │ +9FD72 Compression Method 0000 (0) 'Stored' │ │ │ │ +9FD74 Modification Time 5C9B8587 (1553696135) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9FD78 CRC 42E340AB (1122189483) │ │ │ │ +9FD7C Compressed Size 00001F2E (7982) │ │ │ │ +9FD80 Uncompressed Size 00001F2E (7982) │ │ │ │ +9FD84 Filename Length 001E (30) │ │ │ │ +9FD86 Extra Length 0018 (24) │ │ │ │ +9FD88 Comment Length 0000 (0) │ │ │ │ +9FD8A Disk Start 0000 (0) │ │ │ │ +9FD8C Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9FD8E Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9FD92 Local Header Offset 000954E2 (611554) │ │ │ │ +9FD96 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9FD96: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9FDB4 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9FDB6 Length 0005 (5) │ │ │ │ +9FDB8 Flags 01 (1) 'Modification' │ │ │ │ +9FDB9 Modification Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9FDBD Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9FDBF Length 000B (11) │ │ │ │ +9FDC1 Version 01 (1) │ │ │ │ +9FDC2 UID Size 04 (4) │ │ │ │ +9FDC3 UID 00000000 (0) │ │ │ │ +9FDC7 GID Size 04 (4) │ │ │ │ +9FDC8 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9FDCC CENTRAL HEADER #88 02014B50 (33639248) │ │ │ │ +9FDD0 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9FDD1 Created OS 03 (3) 'Unix' │ │ │ │ +9FDD2 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9FDD3 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9FDD4 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9FDD6 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9FDD8 Modification Time 5C9B8587 (1553696135) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9FDDC CRC ED950F53 (3985968979) │ │ │ │ +9FDE0 Compressed Size 00003D6C (15724) │ │ │ │ +9FDE4 Uncompressed Size 0001664A (91722) │ │ │ │ +9FDE8 Filename Length 001A (26) │ │ │ │ +9FDEA Extra Length 0018 (24) │ │ │ │ +9FDEC Comment Length 0000 (0) │ │ │ │ +9FDEE Disk Start 0000 (0) │ │ │ │ +9FDF0 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9FDF2 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9FDF6 Local Header Offset 00097468 (619624) │ │ │ │ +9FDFA Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9FDFA: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9FE14 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9FE16 Length 0005 (5) │ │ │ │ +9FE18 Flags 01 (1) 'Modification' │ │ │ │ +9FE19 Modification Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9FE1D Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9FE1F Length 000B (11) │ │ │ │ +9FE21 Version 01 (1) │ │ │ │ +9FE22 UID Size 04 (4) │ │ │ │ +9FE23 UID 00000000 (0) │ │ │ │ +9FE27 GID Size 04 (4) │ │ │ │ +9FE28 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9FE2C CENTRAL HEADER #89 02014B50 (33639248) │ │ │ │ +9FE30 Created Zip Spec 3D (61) '6.1' │ │ │ │ +9FE31 Created OS 03 (3) 'Unix' │ │ │ │ +9FE32 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9FE33 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9FE34 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9FE36 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9FE38 Modification Time 5C9B8587 (1553696135) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9FE3C CRC DD44B1AE (3712266670) │ │ │ │ +9FE40 Compressed Size 000029CE (10702) │ │ │ │ +9FE44 Uncompressed Size 0000BB3A (47930) │ │ │ │ +9FE48 Filename Length 0018 (24) │ │ │ │ +9FE4A Extra Length 0018 (24) │ │ │ │ +9FE4C Comment Length 0000 (0) │ │ │ │ +9FE4E Disk Start 0000 (0) │ │ │ │ +9FE50 Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9FE52 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9FE56 Local Header Offset 0009B228 (635432) │ │ │ │ +9FE5A Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9FE5A: Filename 'XXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9FE72 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9FE74 Length 0005 (5) │ │ │ │ +9FE76 Flags 01 (1) 'Modification' │ │ │ │ +9FE77 Modification Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9FE7B Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9FE7D Length 000B (11) │ │ │ │ +9FE7F Version 01 (1) │ │ │ │ +9FE80 UID Size 04 (4) │ │ │ │ +9FE81 UID 00000000 (0) │ │ │ │ +9FE85 GID Size 04 (4) │ │ │ │ +9FE86 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9FE8A CENTRAL HEADER #90 02014B50 (33639248) │ │ │ │ +9FE8E Created Zip Spec 3D (61) '6.1' │ │ │ │ +9FE8F Created OS 03 (3) 'Unix' │ │ │ │ +9FE90 Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9FE91 Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9FE92 General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9FE94 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9FE96 Modification Time 5C9B8587 (1553696135) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9FE9A CRC DCB3B516 (3702764822) │ │ │ │ +9FE9E Compressed Size 000000AE (174) │ │ │ │ +9FEA2 Uncompressed Size 000000FC (252) │ │ │ │ +9FEA6 Filename Length 0016 (22) │ │ │ │ +9FEA8 Extra Length 0018 (24) │ │ │ │ +9FEAA Comment Length 0000 (0) │ │ │ │ +9FEAC Disk Start 0000 (0) │ │ │ │ +9FEAE Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9FEB0 Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9FEB4 Local Header Offset 0009DC48 (646216) │ │ │ │ +9FEB8 Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9FEB8: Filename 'XXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9FECE Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9FED0 Length 0005 (5) │ │ │ │ +9FED2 Flags 01 (1) 'Modification' │ │ │ │ +9FED3 Modification Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9FED7 Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9FED9 Length 000B (11) │ │ │ │ +9FEDB Version 01 (1) │ │ │ │ +9FEDC UID Size 04 (4) │ │ │ │ +9FEDD UID 00000000 (0) │ │ │ │ +9FEE1 GID Size 04 (4) │ │ │ │ +9FEE2 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9FEE6 CENTRAL HEADER #91 02014B50 (33639248) │ │ │ │ +9FEEA Created Zip Spec 3D (61) '6.1' │ │ │ │ +9FEEB Created OS 03 (3) 'Unix' │ │ │ │ +9FEEC Extract Zip Spec 14 (20) '2.0' │ │ │ │ +9FEED Extract OS 00 (0) 'MS-DOS' │ │ │ │ +9FEEE General Purpose Flag 0000 (0) │ │ │ │ + [Bits 1-2] 0 'Normal Compression' │ │ │ │ +9FEF0 Compression Method 0008 (8) 'Deflated' │ │ │ │ +9FEF2 Modification Time 5C9B8587 (1553696135) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9FEF6 CRC 58439733 (1480824627) │ │ │ │ +9FEFA Compressed Size 00000077 (119) │ │ │ │ +9FEFE Uncompressed Size 000000A2 (162) │ │ │ │ +9FF02 Filename Length 002D (45) │ │ │ │ +9FF04 Extra Length 0018 (24) │ │ │ │ +9FF06 Comment Length 0000 (0) │ │ │ │ +9FF08 Disk Start 0000 (0) │ │ │ │ +9FF0A Int File Attributes 0000 (0) │ │ │ │ + [Bit 0] 0 'Binary Data' │ │ │ │ +9FF0C Ext File Attributes 01A40000 (27525120) │ │ │ │ + [Bits 16-24] 01A4 (420) 'Unix attrib: rw-r--r--' │ │ │ │ +9FF10 Local Header Offset 0009DD46 (646470) │ │ │ │ +9FF14 Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# │ │ │ │ +# WARNING: Offset 0x9FF14: Filename 'XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX' │ │ │ │ +# Zero length filename │ │ │ │ +# │ │ │ │ +9FF41 Extra ID #1 5455 (21589) 'Extended Timestamp [UT]' │ │ │ │ +9FF43 Length 0005 (5) │ │ │ │ +9FF45 Flags 01 (1) 'Modification' │ │ │ │ +9FF46 Modification Time 69EF925E (1777308254) 'Mon Apr 27 16:44:14 2026' │ │ │ │ +9FF4A Extra ID #2 7875 (30837) 'Unix Extra type 3 [ux]' │ │ │ │ +9FF4C Length 000B (11) │ │ │ │ +9FF4E Version 01 (1) │ │ │ │ +9FF4F UID Size 04 (4) │ │ │ │ +9FF50 UID 00000000 (0) │ │ │ │ +9FF54 GID Size 04 (4) │ │ │ │ +9FF55 GID 00000000 (0) │ │ │ │ + │ │ │ │ +9FF59 END CENTRAL HEADER 06054B50 (101010256) │ │ │ │ +9FF5D Number of this disk 0000 (0) │ │ │ │ +9FF5F Central Dir Disk no 0000 (0) │ │ │ │ +9FF61 Entries in this disk 005B (91) │ │ │ │ +9FF63 Total Entries 005B (91) │ │ │ │ +9FF65 Size of Central Dir 00002135 (8501) │ │ │ │ +9FF69 Offset to Central Dir 0009DE24 (646692) │ │ │ │ +9FF6D Comment Length 0000 (0) │ │ │ │ # │ │ │ │ # Warning Count: 182 │ │ │ │ # │ │ │ │ # Done │ │ │ ├── filetype from file(1) │ │ │ │ @@ -1 +1 @@ │ │ │ │ -Zip archive data, made by v6.1 UNIX, extract using at least v1.0, last modified Apr 22 2026 09:07:32, uncompressed size 20, method=store │ │ │ │ +Zip archive data, made by v6.1 UNIX, extract using at least v1.0, last modified Apr 27 2026 16:44:12, uncompressed size 20, method=store │ │ │ ├── OEBPS/typespec.xhtml │ │ │ │ @@ -143,122 +143,122 @@ │ │ │ │ and optional (=>) association types. If an association type is mandatory, an │ │ │ │ association with that type needs to be present. In the case of an optional │ │ │ │ association type it is not required for the key type to be present.

The notation #{} specifies the singleton type for the empty map. Note that │ │ │ │ this notation is not a shorthand for the map/0 type.

For convenience, the following types are also built-in. They can be thought as │ │ │ │ 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.

│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ Redefining built-in types │ │ │ │

│ │ │ │

Change

Starting from Erlang/OTP 26, it is permitted to define a type having the same │ │ │ │ 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.

│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ Type Declarations of User-Defined Types │ │ │ │

│ │ │ │

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:

For module-local types, the restriction that their definition exists in the │ │ │ │ module is enforced by the compiler and results in a compilation error. (A │ │ │ │ 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 │ │ │ │ accessible by other modules anyway - and is always to be exported.

Read more on Opaques

│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ 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{}.

│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ Specifications for Functions │ │ │ │

│ │ │ │

A specification (or contract) for a function is given using the -spec │ │ │ │ attribute. The general format is as follows:

-spec Function(ArgType1, ..., ArgTypeN) -> ReturnType.

An implementation of the function with the same name Function must exist in │ │ │ │ the current module, and the arity of the function must match the number of │ │ │ │ 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().
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ ├── OEBPS/tablesdatabases.xhtml │ │ │ │ @@ -51,73 +51,73 @@ │ │ │ │ │ │ │ │ │ │ │ │ Deleting an Element │ │ │ │ │ │ │ │

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,

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Fetching Data
│ │ │ │  

│ │ │ │  
Do not fetch data that you already have.
Consider that you have a module that handles the abstract data type Person.
│ │ │ │  You export the interface function print_person/1, which uses the internal
│ │ │ │  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]).

│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ Non-Persistent Database Storage │ │ │ │

│ │ │ │

For non-persistent database storage, prefer Ets tables over Mnesia │ │ │ │ local_content tables. Even the Mnesia dirty_write operations carry a fixed │ │ │ │ @@ -131,38 +131,38 @@ │ │ │ │ │ │ │ │

Assuming an Ets table that uses idno as key and contains the following:

[#person{idno = 1, name = "Adam",  age = 31, occupation = "mailman"},
│ │ │ │   #person{idno = 2, name = "Bryan", age = 31, occupation = "cashier"},
│ │ │ │   #person{idno = 3, name = "Bryan", age = 35, occupation = "banker"},
│ │ │ │   #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),

│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ ordered_set Tables │ │ │ │

│ │ │ │

If the data in the table is to be accessed so that the order of the keys in the │ │ │ │ table is significant, the table type ordered_set can be used instead of the │ │ │ │ @@ -198,20 +198,20 @@ │ │ │ │ Clearly, the second table would have to be kept consistent with the master │ │ │ │ table. Mnesia can do this for you, but a home-brew index table can be very │ │ │ │ efficient compared to the overhead involved in using Mnesia.

An index table for the table in the previous examples would have to be a bag (as │ │ │ │ keys would appear more than once) and can have the following contents:

[#index_entry{name="Adam", idno=1},
│ │ │ │   #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 │ │ │ │ table. The number of operations gained from the table must therefore be compared │ │ │ │ against the number of operations inserting objects in the table. However, notice │ │ │ │ that the gain is significant when the key can be used to lookup elements.

│ │ │ │ │ │ │ │ @@ -226,47 +226,47 @@ │ │ │ │ Secondary Index │ │ │ │

│ │ │ │

If you frequently do lookups on a field that is not the key of the table, you │ │ │ │ lose performance using mnesia:select() or │ │ │ │ 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),

│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ Transactions │ │ │ │

│ │ │ │

Using transactions is a way to guarantee that the distributed Mnesia database │ │ │ │ remains consistent, even when many different processes update it in parallel. │ │ │ │ However, if you have real-time requirements it is recommended to use dirtry │ │ │ │ operations instead of transactions. When using dirty operations, you lose the │ │ │ │ consistency guarantee; this is usually solved by only letting one process update │ │ │ │ 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,
│ │ │ │  
│ │ │ │ -{atomic, [Result1, Result2]}  = mnesia:transaction(Fun),
│ │ │ │ +{atomic, [Result1, Result2]}  = mnesia:transaction(Fun),
│ │ │ │  ...
│ │ │ │  
│ │ │ │  %% Same thing using dirty operations
│ │ │ │  ...
│ │ │ │  
│ │ │ │ -Result1 = mnesia:dirty_read({Table, Key}),
│ │ │ │ -Result2 = mnesia:dirty_read({Table2, Key2}),
│ │ │ │ +Result1 = mnesia:dirty_read({Table, Key}), │ │ │ │ +Result2 = mnesia:dirty_read({Table2, Key2}), │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ ├── OEBPS/sup_princ.xhtml │ │ │ │ @@ -33,48 +33,48 @@ │ │ │ │ the order specified by this list, and are terminated in the reverse order.

│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ 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.

│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ 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

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │ @@ -313,28 +313,28 @@
│ │ │ │  exhaust the Maximum Restart Intensity of the
│ │ │ │  parent supervisor.

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Child Specification
│ │ │ │  

│ │ │ │ -
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
│ │ │ │  module-function-arguments tuple used as apply(M, F, A).
      It is to be (or result in) a call to any of the following:
      The start key is mandatory.
    •  restart defines when a terminated child process is to be
│ │ │ │  restarted.
      • A permanent child process is always restarted.
      • A temporary child process is never restarted (not even when the supervisor
│ │ │ │  restart strategy is rest_for_one or one_for_all and a sibling death
│ │ │ │ @@ -362,53 +362,53 @@
│ │ │ │  supervisor, the default value infinity will be used.
      • type specifies whether the child process is a supervisor or a worker.
        The type key is optional. If it is not given, the default value worker
│ │ │ │  will be used.
      • modules has to be a list consisting of a single element. The value
│ │ │ │  of that element depends on the behaviour of the process:
        • If the child process is a gen_event, the element has to be the atom
│ │ │ │  dynamic.
        • Otherwise, the element should be Module, where Module is the
│ │ │ │  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
│ │ │ │  name can be specified by calling
│ │ │ │  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.
      
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Adding a Child Process
│ │ │ │ @@ -437,31 +437,31 @@
│ │ │ │      
│ │ │ │    
│ │ │ │    Simplified one_for_one Supervisors
│ │ │ │  
      
│ │ │ │  
      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
│ │ │ │  specification. If the start function is specified as {M, F, A}, the child
│ │ │ │  process is started by calling apply(M, F, A++List).
      For example, adding a child to simple_sup above:
      supervisor:start_child(Pid, [id1])
      The result is that the child process is started by calling
│ │ │ │  apply(call, start_link, []++[id1]), or actually:
      call:start_link(id1)
      A child under a simple_one_for_one supervisor can be terminated with the
│ │ │ │  following:
      supervisor:terminate_child(Sup, Pid)
      Sup is the pid, or name, of the supervisor and Pid is the pid of the child.
      Because a simple_one_for_one supervisor can have many children, it shuts them
│ │ │ ├── OEBPS/statem.xhtml
│ │ │ │ @@ -29,15 +29,15 @@
│ │ │ │  
│ │ │ │  
      Established Automata Theory does not deal much with how a state transition
│ │ │ │  is triggered, but assumes that the output is a function of the input
│ │ │ │  (and the state) and that they are some kind of values.
      For an Event-Driven State Machine, the input is an event that triggers
│ │ │ │  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
│ │ │ │  new state S' is different from the current state S, where "different" means
│ │ │ │  Erlang's strict inequality: =/= also known as "does not match". gen_statem
│ │ │ │  does more things during state changes than during other state transitions.
      As A and S' depend only on S and E, the kind of state machine described
│ │ │ │  here is a Mealy machine (see, for example, the Wikipedia article
│ │ │ │ @@ -310,20 +310,20 @@
│ │ │ │    
│ │ │ │    State Enter Calls
│ │ │ │  
│ │ │ │  
      The gen_statem behaviour can, if this is enabled, regardless of callback
│ │ │ │  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
│ │ │ │  callback module.
      The first state that is entered after gen_statem:init/1 will get
│ │ │ │  a state enter call with OldState equal to the current state.
      You may repeat the state enter call using the {repeat_state,...} return
│ │ │ │  value from the state callback. In this case
│ │ │ │  OldState will also be equal to the current state.
      Depending on how your state machine is specified, this can be a very useful
│ │ │ │ @@ -404,72 +404,72 @@
│ │ │ │  
│ │ │ │      locked      --> check_code : {button, Button}\n* Collect Buttons
│ │ │ │      check_code  --> locked     : Incorrect code
│ │ │ │      check_code  --> open       : Correct code\n* do_unlock()\n* Clear Buttons\n* Set state_timeout 10 s
│ │ │ │  
│ │ │ │      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.
      
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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
│ │ │ │  gen_statem is registered using global:register_name/2 in Kernel.
      • The second argument, ?MODULE, is the name of the callback module,
│ │ │ │  that is, the module where the callback functions are located,
│ │ │ │  which is this module.
        The interface functions (start_link/1 and button/1) are located in the
│ │ │ │  same module as the callback functions (init/1, locked/3, and open/3).
│ │ │ │ @@ -479,184 +479,184 @@
│ │ │ │  see gen_statem:start_link/3.
      If name registration succeeds, the new gen_statem process calls callback
│ │ │ │  function code_lock:init(Code). This function is expected to return
│ │ │ │  {ok, State, Data}, where State is the initial state of the gen_statem,
│ │ │ │  in this case locked; assuming that the door is locked to begin with.
│ │ │ │  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,
│ │ │ │  started by a supervisor.  Function,
│ │ │ │  gen_statem:start/3,4 can be used to start
│ │ │ │  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.
      
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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
│ │ │ │  to return a tuple {next_state, NewStateName, NewData}, or
│ │ │ │  {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}}
│ │ │ │ +            {next_state, locked, Data#{buttons := NewButtons}}
│ │ │ │      end.
      In state locked, when a button is pressed, it is collected with the
│ │ │ │  previously pressed buttons up to the length of the correct code, then
│ │ │ │  compared with the correct code. Depending on the result, the door is
│ │ │ │  either unlocked and the gen_statem goes to state open, or the door
│ │ │ │  remains in state locked.
      When changing to state open, the collected buttons are reset, the lock
│ │ │ │ -unlocked, and a state time-out for 10 seconds is started.
      open(cast, {button,_}, Data) ->
│ │ │ │ -    {next_state, open, Data}.
      In state open, a button event is ignored by staying in the same state.
│ │ │ │ +unlocked, and a state time-out for 10 seconds is started.
      open(cast, {button,_}, Data) ->
│ │ │ │ +    {next_state, open, Data}.
      In state open, a button event is ignored by staying in the same state.
│ │ │ │  This can also be done by returning {keep_state, Data}, or in this case
│ │ │ │  since Data is unchanged, by returning keep_state_and_data.
      
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    State Time-Outs
│ │ │ │  
      
│ │ │ │  
      When a correct code has been given, the door is unlocked and the following
│ │ │ │ -tuple is returned from locked/2:
      {next_state, open, Data#{buttons := []},
│ │ │ │ - [{state_timeout,10_000,lock}]}; % Time in milliseconds
      10,000 is a time-out value in milliseconds. After this time (10 seconds),
│ │ │ │ +tuple is returned from locked/2:
      {next_state, open, Data#{buttons := []},
│ │ │ │ + [{state_timeout,10_000,lock}]}; % Time in milliseconds
      10,000 is a time-out value in milliseconds. After this time (10 seconds),
│ │ │ │  a time-out occurs. Then, StateName(state_timeout, lock, Data) is called.
│ │ │ │  The time-out occurs when the door has been in state open for 10 seconds.
│ │ │ │ -After that the door is locked again:
      open(state_timeout, lock,  Data) ->
│ │ │ │ -    do_lock(),
│ │ │ │ -    {next_state, locked, Data};
      The timer for a state time-out is automatically canceled when
│ │ │ │ +After that the door is locked again:
      open(state_timeout, lock,  Data) ->
│ │ │ │ +    do_lock(),
│ │ │ │ +    {next_state, locked, Data};
      The timer for a state time-out is automatically canceled when
│ │ │ │  the state machine does a state change.
      You can restart, cancel, or update a state time-out. See section
│ │ │ │  Time-Outs for details.
      
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    All State Events
│ │ │ │  
      
│ │ │ │  
      Sometimes events can arrive in any state of the gen_statem. It is convenient
│ │ │ │  to handle these in a common state handler function that all state functions
│ │ │ │  call for events not specific to the state.
      Consider a code_length/0 function that returns the length
│ │ │ │  of the correct code.  We dispatch all events that are not state-specific
│ │ │ │  to the common function handle_common/3:
      ...
│ │ │ │ --export([button/1,code_length/0]).
│ │ │ │ +-export([button/1,code_length/0]).
│ │ │ │  ...
│ │ │ │  
│ │ │ │ -code_length() ->
│ │ │ │ -    gen_statem:call(?NAME, code_length).
│ │ │ │ +code_length() ->
│ │ │ │ +    gen_statem:call(?NAME, code_length).
│ │ │ │  
│ │ │ │  ...
│ │ │ │ -locked(...) -> ... ;
│ │ │ │ -locked(EventType, EventContent, Data) ->
│ │ │ │ -    handle_common(EventType, EventContent, Data).
│ │ │ │ +locked(...) -> ... ;
│ │ │ │ +locked(EventType, EventContent, Data) ->
│ │ │ │ +    handle_common(EventType, EventContent, Data).
│ │ │ │  
│ │ │ │  ...
│ │ │ │ -open(...) -> ... ;
│ │ │ │ -open(EventType, EventContent, Data) ->
│ │ │ │ -    handle_common(EventType, EventContent, Data).
│ │ │ │ -
│ │ │ │ -handle_common({call,From}, code_length, #{code := Code} = Data) ->
│ │ │ │ -    {keep_state, Data,
│ │ │ │ -     [{reply,From,length(Code)}]}.
      Another way to do it is through a convenience macro ?HANDLE_COMMON/0:
      ...
│ │ │ │ --export([button/1,code_length/0]).
│ │ │ │ +open(...) -> ... ;
│ │ │ │ +open(EventType, EventContent, Data) ->
│ │ │ │ +    handle_common(EventType, EventContent, Data).
│ │ │ │ +
│ │ │ │ +handle_common({call,From}, code_length, #{code := Code} = Data) ->
│ │ │ │ +    {keep_state, Data,
│ │ │ │ +     [{reply,From,length(Code)}]}.
      Another way to do it is through a convenience macro ?HANDLE_COMMON/0:
      ...
│ │ │ │ +-export([button/1,code_length/0]).
│ │ │ │  ...
│ │ │ │  
│ │ │ │ -code_length() ->
│ │ │ │ -    gen_statem:call(?NAME, code_length).
│ │ │ │ +code_length() ->
│ │ │ │ +    gen_statem:call(?NAME, code_length).
│ │ │ │  
│ │ │ │ --define(HANDLE_COMMON,
│ │ │ │ -    ?FUNCTION_NAME(T, C, D) -> handle_common(T, C, D)).
│ │ │ │ +-define(HANDLE_COMMON,
│ │ │ │ +    ?FUNCTION_NAME(T, C, D) -> handle_common(T, C, D)).
│ │ │ │  %%
│ │ │ │ -handle_common({call,From}, code_length, #{code := Code} = Data) ->
│ │ │ │ -    {keep_state, Data,
│ │ │ │ -     [{reply,From,length(Code)}]}.
│ │ │ │ +handle_common({call,From}, code_length, #{code := Code} = Data) ->
│ │ │ │ +    {keep_state, Data,
│ │ │ │ +     [{reply,From,length(Code)}]}.
│ │ │ │  
│ │ │ │  ...
│ │ │ │ -locked(...) -> ... ;
│ │ │ │ +locked(...) -> ... ;
│ │ │ │  ?HANDLE_COMMON.
│ │ │ │  
│ │ │ │  ...
│ │ │ │ -open(...) -> ... ;
│ │ │ │ +open(...) -> ... ;
│ │ │ │  ?HANDLE_COMMON.
      This example uses gen_statem:call/2, which waits for a reply from the server.
│ │ │ │  The reply is sent with a {reply, From, Reply} tuple in an action list in the
│ │ │ │  {keep_state, ...} tuple that retains the current state. This return form is
│ │ │ │  convenient when you want to stay in the current state but do not know or care
│ │ │ │  about what it is.
      If the common state callback needs to know the current state a function
│ │ │ │ -handle_common/4 can be used instead:
      -define(HANDLE_COMMON,
│ │ │ │ -    ?FUNCTION_NAME(T, C, D) -> handle_common(T, C, ?FUNCTION_NAME, D)).
      
│ │ │ │ +handle_common/4 can be used instead:
      -define(HANDLE_COMMON,
│ │ │ │ +    ?FUNCTION_NAME(T, C, D) -> handle_common(T, C, ?FUNCTION_NAME, D)).
      
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    One State Callback
│ │ │ │  
      
│ │ │ │  
      If callback mode handle_event_function is used,
│ │ │ │  all events are handled in
│ │ │ │  Module:handle_event/4 and we can
│ │ │ │  (but do not have to) use an event-centered approach where we first branch
│ │ │ │  depending on event and then depending on state:
      ...
│ │ │ │ --export([handle_event/4]).
│ │ │ │ +-export([handle_event/4]).
│ │ │ │  
│ │ │ │  ...
│ │ │ │ -callback_mode() ->
│ │ │ │ +callback_mode() ->
│ │ │ │      handle_event_function.
│ │ │ │  
│ │ │ │ -handle_event(cast, {button,Button}, State, #{code := Code} = Data) ->
│ │ │ │ +handle_event(cast, {button,Button}, State, #{code := Code} = Data) ->
│ │ │ │      case State of
│ │ │ │  	locked ->
│ │ │ │ -            #{length := Length, buttons := Buttons} = Data,
│ │ │ │ +            #{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
│ │ │ │ -                    {keep_state, Data#{buttons := NewButtons}}
│ │ │ │ +                    {keep_state, Data#{buttons := NewButtons}}
│ │ │ │              end;
│ │ │ │  	open ->
│ │ │ │              keep_state_and_data
│ │ │ │      end;
│ │ │ │ -handle_event(state_timeout, lock, open, Data) ->
│ │ │ │ -    do_lock(),
│ │ │ │ -    {next_state, locked, Data};
│ │ │ │ -handle_event(
│ │ │ │ -  {call,From}, code_length, _State, #{code := Code} = Data) ->
│ │ │ │ -    {keep_state, Data,
│ │ │ │ -     [{reply,From,length(Code)}]}.
│ │ │ │ +handle_event(state_timeout, lock, open, Data) ->
│ │ │ │ +    do_lock(),
│ │ │ │ +    {next_state, locked, Data};
│ │ │ │ +handle_event(
│ │ │ │ +  {call,From}, code_length, _State, #{code := Code} = Data) ->
│ │ │ │ +    {keep_state, Data,
│ │ │ │ +     [{reply,From,length(Code)}]}.
│ │ │ │  
│ │ │ │  ...
      
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Stopping
│ │ │ │  
      
│ │ │ │ @@ -668,59 +668,59 @@
│ │ │ │  
│ │ │ │  
      If the gen_statem is part of a supervision tree, no stop function is needed.
│ │ │ │  The gen_statem is automatically terminated by its supervisor. Exactly how
│ │ │ │  this is done is defined by a shutdown strategy
│ │ │ │  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_statem must in function init/1
│ │ │ │  set itself to trap exit signals by calling
│ │ │ │ -process_flag(trap_exit, true):
      init(Args) ->
│ │ │ │ -    process_flag(trap_exit, true),
│ │ │ │ -    do_lock(),
│ │ │ │ +process_flag(trap_exit, true):
      init(Args) ->
│ │ │ │ +    process_flag(trap_exit, true),
│ │ │ │ +    do_lock(),
│ │ │ │      ...
      When ordered to shut down, the gen_statem then calls callback function
│ │ │ │  terminate(shutdown, State, Data).
      In this example, function terminate/3 locks the door if it is open,
│ │ │ │  so we do not accidentally leave the door open
│ │ │ │ -when the supervision tree terminates:
      terminate(_Reason, State, _Data) ->
│ │ │ │ -    State =/= locked andalso do_lock(),
│ │ │ │ +when the supervision tree terminates:
      terminate(_Reason, State, _Data) ->
│ │ │ │ +    State =/= locked andalso do_lock(),
│ │ │ │      ok.
      
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Standalone gen_statem
│ │ │ │  
      
│ │ │ │  
      If the gen_statem is not part of a supervision tree, it can be stopped
│ │ │ │  using gen_statem:stop/1, preferably through
│ │ │ │  an API function:
      ...
│ │ │ │ --export([start_link/1,stop/0]).
│ │ │ │ +-export([start_link/1,stop/0]).
│ │ │ │  
│ │ │ │  ...
│ │ │ │ -stop() ->
│ │ │ │ -    gen_statem:stop(?NAME).
      This makes the gen_statem call callback function terminate/3 just like
│ │ │ │ +stop() ->
│ │ │ │ +    gen_statem:stop(?NAME).
      This makes the gen_statem call callback function terminate/3 just like
│ │ │ │  for a supervised server and waits for the process to terminate.
      
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Event Time-Outs
│ │ │ │  
      
│ │ │ │  
      A time-out feature inherited from gen_statem's predecessor gen_fsm,
│ │ │ │  is an event time-out, that is, if an event arrives the timer is canceled.
│ │ │ │  You get either an event or a time-out, but not both.
      It is ordered by the
│ │ │ │  transition action {timeout, Time, EventContent},
│ │ │ │  or just an integer Time, even without the enclosing actions list (the latter
│ │ │ │  is a form inherited from gen_fsm).
      This type of time-out is useful, for example, to act on inactivity.
│ │ │ │  Let's restart the code sequence if no button is pressed for say 30 seconds:
      ...
│ │ │ │  
│ │ │ │ -locked(timeout, _, Data) ->
│ │ │ │ -    {next_state, locked, Data#{buttons := []}};
│ │ │ │ -locked(
│ │ │ │ -  cast, {button,Button},
│ │ │ │ -  #{code := Code, length := Length, buttons := Buttons} = Data) ->
│ │ │ │ +locked(timeout, _, Data) ->
│ │ │ │ +    {next_state, locked, Data#{buttons := []}};
│ │ │ │ +locked(
│ │ │ │ +  cast, {button,Button},
│ │ │ │ +  #{code := Code, length := Length, buttons := Buttons} = Data) ->
│ │ │ │  ...
│ │ │ │  	true -> % Incomplete | Incorrect
│ │ │ │ -            {next_state, locked, Data#{buttons := NewButtons},
│ │ │ │ -             30_000} % Time in milliseconds
│ │ │ │ +            {next_state, locked, Data#{buttons := NewButtons},
│ │ │ │ +             30_000} % Time in milliseconds
│ │ │ │  ...
      Whenever we receive a button event we start an event time-out of 30 seconds,
│ │ │ │  and if we get an event type of timeout we reset the remaining
│ │ │ │  code sequence.
      An event time-out is canceled by any other event so you either get
│ │ │ │  some other event or the time-out event. Therefore, canceling,
│ │ │ │  restarting, or updating an event time-out is neither possible nor
│ │ │ │  necessary. Whatever event you act on has already canceled
│ │ │ │  the event time-out, so there is never a running event time-out
│ │ │ │ @@ -739,30 +739,30 @@
│ │ │ │  another, maybe cancel the time-out without changing states, or perhaps run
│ │ │ │  multiple time-outs in parallel. All this can be accomplished with
│ │ │ │  generic time-outs. They may look a little
│ │ │ │  bit like event time-outs but contain
│ │ │ │  a name to allow for any number of them simultaneously and they are
│ │ │ │  not automatically canceled.
      Here is how to accomplish the state time-out in the previous example
│ │ │ │  by instead using a generic time-out named for example open:
      ...
│ │ │ │ -locked(
│ │ │ │ -  cast, {button,Button},
│ │ │ │ -  #{code := Code, length := Length, buttons := Buttons} = Data) ->
│ │ │ │ +locked(
│ │ │ │ +  cast, {button,Button},
│ │ │ │ +  #{code := Code, length := Length, buttons := Buttons} = Data) ->
│ │ │ │  ...
│ │ │ │      if
│ │ │ │          NewButtons =:= Code -> % Correct
│ │ │ │ -	    do_unlock(),
│ │ │ │ -            {next_state, open, Data#{buttons := []},
│ │ │ │ -             [{{timeout,open},10_000,lock}]}; % Time in milliseconds
│ │ │ │ +	    do_unlock(),
│ │ │ │ +            {next_state, open, Data#{buttons := []},
│ │ │ │ +             [{{timeout,open},10_000,lock}]}; % Time in milliseconds
│ │ │ │  ...
│ │ │ │  
│ │ │ │ -open({timeout,open}, lock, Data) ->
│ │ │ │ -    do_lock(),
│ │ │ │ -    {next_state,locked,Data};
│ │ │ │ -open(cast, {button,_}, Data) ->
│ │ │ │ -    {keep_state,Data};
│ │ │ │ +open({timeout,open}, lock, Data) ->
│ │ │ │ +    do_lock(),
│ │ │ │ +    {next_state,locked,Data};
│ │ │ │ +open(cast, {button,_}, Data) ->
│ │ │ │ +    {keep_state,Data};
│ │ │ │  ...
      Specific generic time-outs can just as state time-outs
│ │ │ │  be restarted or canceled by setting it to a new time or infinity.
      In this particular case we do not need to cancel the time-out since
│ │ │ │  the time-out event is the only possible reason to do a state change
│ │ │ │  from open to locked.
      Instead of bothering with when to cancel a time-out, a late time-out event
│ │ │ │  can be handled by ignoring it if it arrives in a state
│ │ │ │  where it is known to be late.
      You can restart, cancel, or update a generic time-out.
│ │ │ │  See section Time-Outs for details.
      
│ │ │ │ @@ -774,32 +774,32 @@
│ │ │ │  
      The most versatile way to handle time-outs is to use Erlang Timers; see
│ │ │ │  erlang:start_timer/3,4. Most time-out tasks
│ │ │ │  can be performed with the time-out features in gen_statem,
│ │ │ │  but an example of one that cannot is if you should need the return value
│ │ │ │  from erlang:cancel_timer(Tref), that is,
│ │ │ │  the remaining time of the timer.
      Here is how to accomplish the state time-out in the previous example
│ │ │ │  by instead using an Erlang Timer:
      ...
│ │ │ │ -locked(
│ │ │ │ -  cast, {button,Button},
│ │ │ │ -  #{code := Code, length := Length, buttons := Buttons} = Data) ->
│ │ │ │ +locked(
│ │ │ │ +  cast, {button,Button},
│ │ │ │ +  #{code := Code, length := Length, buttons := Buttons} = Data) ->
│ │ │ │  ...
│ │ │ │      if
│ │ │ │          NewButtons =:= Code -> % Correct
│ │ │ │ -	    do_unlock(),
│ │ │ │ +	    do_unlock(),
│ │ │ │  	    Tref =
│ │ │ │ -                 erlang:start_timer(
│ │ │ │ -                     10_000, self(), lock), % Time in milliseconds
│ │ │ │ -            {next_state, open, Data#{buttons := [], timer => Tref}};
│ │ │ │ +                 erlang:start_timer(
│ │ │ │ +                     10_000, self(), lock), % Time in milliseconds
│ │ │ │ +            {next_state, open, Data#{buttons := [], timer => Tref}};
│ │ │ │  ...
│ │ │ │  
│ │ │ │ -open(info, {timeout,Tref,lock}, #{timer := Tref} = Data) ->
│ │ │ │ -    do_lock(),
│ │ │ │ -    {next_state,locked,maps:remove(timer, Data)};
│ │ │ │ -open(cast, {button,_}, Data) ->
│ │ │ │ -    {keep_state,Data};
│ │ │ │ +open(info, {timeout,Tref,lock}, #{timer := Tref} = Data) ->
│ │ │ │ +    do_lock(),
│ │ │ │ +    {next_state,locked,maps:remove(timer, Data)};
│ │ │ │ +open(cast, {button,_}, Data) ->
│ │ │ │ +    {keep_state,Data};
│ │ │ │  ...
      Removing the timer key from the map when we do a state change to locked
│ │ │ │  is not strictly necessary since we can only get into state open
│ │ │ │  with an updated timer map value. But it can be nice to not have
│ │ │ │  outdated values in the state Data.
      If you need to cancel a timer because of some other event, you can use
│ │ │ │  erlang:cancel_timer(Tref). Note that no time-out
│ │ │ │  message will arrive after this (because the timer has been
│ │ │ │  explicitly canceled), unless you have already postponed one earlier
│ │ │ │ @@ -815,16 +815,16 @@
│ │ │ │    Postponing Events
│ │ │ │  
      
│ │ │ │  
      If you want to ignore a particular event in the current state and handle it
│ │ │ │  in a future state, you can postpone the event. A postponed event
│ │ │ │  is retried after a state change, that is, OldState =/= NewState.
      Postponing is ordered by the
│ │ │ │  transition action postpone.
      In this example, instead of ignoring button events while in the open state,
│ │ │ │  we can postpone them handle them later in the locked state:
      ...
│ │ │ │ -open(cast, {button,_}, Data) ->
│ │ │ │ -    {keep_state,Data,[postpone]};
│ │ │ │ +open(cast, {button,_}, Data) ->
│ │ │ │ +    {keep_state,Data,[postpone]};
│ │ │ │  ...
      Since a postponed event is only retried after a state change, you have to
│ │ │ │  think about where to keep a state data item. You can keep it in the server
│ │ │ │  Data or in the State itself, for example by having two more or less
│ │ │ │  identical states to keep a boolean value, or by using a complex state (see
│ │ │ │  section Complex State) with
│ │ │ │  callback mode
│ │ │ │  handle_event_function. If a change
│ │ │ │ @@ -845,55 +845,55 @@
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Selective Receive
│ │ │ │  
│ │ │ │  
      Erlang's selective receive statement is often used to describe simple state
│ │ │ │  machine examples in straightforward Erlang code. The following is a possible
│ │ │ │ -implementation of the first example:
      -module(code_lock).
│ │ │ │ --define(NAME, code_lock_1).
│ │ │ │ --export([start_link/1,button/1]).
│ │ │ │ -
│ │ │ │ -start_link(Code) ->
│ │ │ │ -    spawn(
│ │ │ │ -      fun () ->
│ │ │ │ -	      true = register(?NAME, self()),
│ │ │ │ -	      do_lock(),
│ │ │ │ -	      locked(Code, length(Code), [])
│ │ │ │ -      end).
│ │ │ │ +implementation of the first example:
      -module(code_lock).
│ │ │ │ +-define(NAME, code_lock_1).
│ │ │ │ +-export([start_link/1,button/1]).
│ │ │ │ +
│ │ │ │ +start_link(Code) ->
│ │ │ │ +    spawn(
│ │ │ │ +      fun () ->
│ │ │ │ +	      true = register(?NAME, self()),
│ │ │ │ +	      do_lock(),
│ │ │ │ +	      locked(Code, length(Code), [])
│ │ │ │ +      end).
│ │ │ │  
│ │ │ │ -button(Button) ->
│ │ │ │ -    ?NAME ! {button,Button}.
      locked(Code, Length, Buttons) ->
│ │ │ │ +button(Button) ->
│ │ │ │ +    ?NAME ! {button,Button}.
      locked(Code, Length, Buttons) ->
│ │ │ │      receive
│ │ │ │ -        {button,Button} ->
│ │ │ │ +        {button,Button} ->
│ │ │ │              NewButtons =
│ │ │ │                  if
│ │ │ │ -                    length(Buttons) < Length ->
│ │ │ │ +                    length(Buttons) < Length ->
│ │ │ │                          Buttons;
│ │ │ │                      true ->
│ │ │ │ -                        tl(Buttons)
│ │ │ │ -                end ++ [Button],
│ │ │ │ +                        tl(Buttons)
│ │ │ │ +                end ++ [Button],
│ │ │ │              if
│ │ │ │                  NewButtons =:= Code -> % Correct
│ │ │ │ -                    do_unlock(),
│ │ │ │ -		    open(Code, Length);
│ │ │ │ +                    do_unlock(),
│ │ │ │ +		    open(Code, Length);
│ │ │ │                  true -> % Incomplete | Incorrect
│ │ │ │ -                    locked(Code, Length, NewButtons)
│ │ │ │ +                    locked(Code, Length, NewButtons)
│ │ │ │              end
│ │ │ │ -    end.
      open(Code, Length) ->
│ │ │ │ +    end.
      open(Code, Length) ->
│ │ │ │      receive
│ │ │ │      after 10_000 -> % Time in milliseconds
│ │ │ │ -	    do_lock(),
│ │ │ │ -	    locked(Code, Length, [])
│ │ │ │ +	    do_lock(),
│ │ │ │ +	    locked(Code, Length, [])
│ │ │ │      end.
│ │ │ │  
│ │ │ │ -do_lock() ->
│ │ │ │ -    io:format("Locked~n", []).
│ │ │ │ -do_unlock() ->
│ │ │ │ -    io:format("Open~n", []).
      The selective receive in this case causes open to implicitly postpone any
│ │ │ │ +do_lock() ->
│ │ │ │ +    io:format("Locked~n", []).
│ │ │ │ +do_unlock() ->
│ │ │ │ +    io:format("Open~n", []).
      The selective receive in this case causes open to implicitly postpone any
│ │ │ │  events to the locked state.
      A catch-all receive should never be used from a gen_statem behaviour
│ │ │ │  (or from any gen_* behaviour), as the receive statement is within
│ │ │ │  the gen_* engine itself. sys-compatible behaviours must respond to
│ │ │ │  system messages and therefore do that in their engine receive loop,
│ │ │ │  passing non-system messages to the callback module. Using a catch-all
│ │ │ │  receive can result in system messages being discarded, which in turn
│ │ │ │  can lead to unexpected behaviour. If a selective receive must be used,
│ │ │ │ @@ -916,40 +916,40 @@
│ │ │ │  section), especially if only one or a few states have state enter actions,
│ │ │ │  this is a perfect use case for the built in
│ │ │ │  state enter calls.
      You return a list containing state_enter from your
│ │ │ │  callback_mode/0 function and the
│ │ │ │  gen_statem engine will call your state callback once with an event
│ │ │ │  (enter, OldState, ...) whenever it does a state change. Then you
│ │ │ │  just need to handle these event-like calls in all states.
      ...
│ │ │ │ -init(Code) ->
│ │ │ │ -    process_flag(trap_exit, true),
│ │ │ │ -    Data = #{code => Code, length = length(Code)},
│ │ │ │ -    {ok, locked, Data}.
│ │ │ │ -
│ │ │ │ -callback_mode() ->
│ │ │ │ -    [state_functions,state_enter].
│ │ │ │ -
│ │ │ │ -locked(enter, _OldState, Data) ->
│ │ │ │ -    do_lock(),
│ │ │ │ -    {keep_state,Data#{buttons => []}};
│ │ │ │ -locked(
│ │ │ │ -  cast, {button,Button},
│ │ │ │ -  #{code := Code, length := Length, buttons := Buttons} = Data) ->
│ │ │ │ +init(Code) ->
│ │ │ │ +    process_flag(trap_exit, true),
│ │ │ │ +    Data = #{code => Code, length = length(Code)},
│ │ │ │ +    {ok, locked, Data}.
│ │ │ │ +
│ │ │ │ +callback_mode() ->
│ │ │ │ +    [state_functions,state_enter].
│ │ │ │ +
│ │ │ │ +locked(enter, _OldState, Data) ->
│ │ │ │ +    do_lock(),
│ │ │ │ +    {keep_state,Data#{buttons => []}};
│ │ │ │ +locked(
│ │ │ │ +  cast, {button,Button},
│ │ │ │ +  #{code := Code, length := Length, buttons := Buttons} = Data) ->
│ │ │ │  ...
│ │ │ │      if
│ │ │ │          NewButtons =:= Code -> % Correct
│ │ │ │ -            {next_state, open, Data};
│ │ │ │ +            {next_state, open, Data};
│ │ │ │  ...
│ │ │ │  
│ │ │ │ -open(enter, _OldState, _Data) ->
│ │ │ │ -    do_unlock(),
│ │ │ │ -    {keep_state_and_data,
│ │ │ │ -     [{state_timeout,10_000,lock}]}; % Time in milliseconds
│ │ │ │ -open(state_timeout, lock, Data) ->
│ │ │ │ -    {next_state, locked, Data};
│ │ │ │ +open(enter, _OldState, _Data) ->
│ │ │ │ +    do_unlock(),
│ │ │ │ +    {keep_state_and_data,
│ │ │ │ +     [{state_timeout,10_000,lock}]}; % Time in milliseconds
│ │ │ │ +open(state_timeout, lock, Data) ->
│ │ │ │ +    {next_state, locked, Data};
│ │ │ │  ...
      You can repeat the state enter code by returning one of
│ │ │ │  {repeat_state, ...},{repeat_state_and_data, _},
│ │ │ │  or repeat_state_and_data that otherwise behaves exactly like their
│ │ │ │  keep_state siblings.  See the type
│ │ │ │  state_callback_result()
│ │ │ │  in the Reference Manual.
      
│ │ │ │    
│ │ │ │ @@ -971,44 +971,44 @@
│ │ │ │  to dispatch pre-processed events as internal events to the main state
│ │ │ │  machine.
      Using internal events also can make it easier to synchronize the state
│ │ │ │  machines.
      A variant of this is to use a complex state with
│ │ │ │  one state callback, modeling the state
│ │ │ │  with, for example, a tuple {MainFSMState, SubFSMState}.
      To illustrate this we make up an example where the buttons instead generate
│ │ │ │  down and up (press and release) events, and the lock responds
│ │ │ │  to an up event only after the corresponding down event.
      ...
│ │ │ │ --export([down/1, up/1]).
│ │ │ │ +-export([down/1, up/1]).
│ │ │ │  ...
│ │ │ │ -down(Button) ->
│ │ │ │ -    gen_statem:cast(?NAME, {down,Button}).
│ │ │ │ +down(Button) ->
│ │ │ │ +    gen_statem:cast(?NAME, {down,Button}).
│ │ │ │  
│ │ │ │ -up(Button) ->
│ │ │ │ -    gen_statem:cast(?NAME, {up,Button}).
│ │ │ │ +up(Button) ->
│ │ │ │ +    gen_statem:cast(?NAME, {up,Button}).
│ │ │ │  
│ │ │ │  ...
│ │ │ │  
│ │ │ │ -locked(enter, _OldState, Data) ->
│ │ │ │ -    do_lock(),
│ │ │ │ -    {keep_state,Data#{buttons => []}};
│ │ │ │ -locked(
│ │ │ │ -  internal, {button,Button},
│ │ │ │ -  #{code := Code, length := Length, buttons := Buttons} = Data) ->
│ │ │ │ -...
      handle_common(cast, {down,Button}, Data) ->
│ │ │ │ -    {keep_state, Data#{button => Button}};
│ │ │ │ -handle_common(cast, {up,Button}, Data) ->
│ │ │ │ +locked(enter, _OldState, Data) ->
│ │ │ │ +    do_lock(),
│ │ │ │ +    {keep_state,Data#{buttons => []}};
│ │ │ │ +locked(
│ │ │ │ +  internal, {button,Button},
│ │ │ │ +  #{code := Code, length := Length, buttons := Buttons} = Data) ->
│ │ │ │ +...
      handle_common(cast, {down,Button}, Data) ->
│ │ │ │ +    {keep_state, Data#{button => Button}};
│ │ │ │ +handle_common(cast, {up,Button}, Data) ->
│ │ │ │      case Data of
│ │ │ │ -        #{button := Button} ->
│ │ │ │ -            {keep_state,maps:remove(button, Data),
│ │ │ │ -             [{next_event,internal,{button,Button}}]};
│ │ │ │ -        #{} ->
│ │ │ │ +        #{button := Button} ->
│ │ │ │ +            {keep_state,maps:remove(button, Data),
│ │ │ │ +             [{next_event,internal,{button,Button}}]};
│ │ │ │ +        #{} ->
│ │ │ │              keep_state_and_data
│ │ │ │      end;
│ │ │ │  ...
│ │ │ │  
│ │ │ │ -open(internal, {button,_}, Data) ->
│ │ │ │ -    {keep_state,Data,[postpone]};
│ │ │ │ +open(internal, {button,_}, Data) ->
│ │ │ │ +    {keep_state,Data,[postpone]};
│ │ │ │  ...
      If you start this program with code_lock:start([17]) you can unlock with
│ │ │ │  code_lock:down(17), code_lock:up(17).
      
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Example Revisited
│ │ │ │  
      
│ │ │ │ @@ -1036,152 +1036,152 @@
│ │ │ │  Also, the state diagram does not show that the code_length/0 call
│ │ │ │  must be handled in every state.
      
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Callback Mode: state_functions
│ │ │ │  
      
│ │ │ │ -
      Using state functions:
      -module(code_lock).
│ │ │ │ --behaviour(gen_statem).
│ │ │ │ --define(NAME, code_lock_2).
│ │ │ │ +
      Using state functions:
      -module(code_lock).
│ │ │ │ +-behaviour(gen_statem).
│ │ │ │ +-define(NAME, code_lock_2).
│ │ │ │  
│ │ │ │ --export([start_link/1,stop/0]).
│ │ │ │ --export([down/1,up/1,code_length/0]).
│ │ │ │ --export([init/1,callback_mode/0,terminate/3]).
│ │ │ │ --export([locked/3,open/3]).
│ │ │ │ -
│ │ │ │ -start_link(Code) ->
│ │ │ │ -    gen_statem:start_link({local,?NAME}, ?MODULE, Code, []).
│ │ │ │ -stop() ->
│ │ │ │ -    gen_statem:stop(?NAME).
│ │ │ │ -
│ │ │ │ -down(Button) ->
│ │ │ │ -    gen_statem:cast(?NAME, {down,Button}).
│ │ │ │ -up(Button) ->
│ │ │ │ -    gen_statem:cast(?NAME, {up,Button}).
│ │ │ │ -code_length() ->
│ │ │ │ -    gen_statem:call(?NAME, code_length).
      init(Code) ->
│ │ │ │ -    process_flag(trap_exit, true),
│ │ │ │ -    Data = #{code => Code, length => length(Code), buttons => []},
│ │ │ │ -    {ok, locked, Data}.
│ │ │ │ +-export([start_link/1,stop/0]).
│ │ │ │ +-export([down/1,up/1,code_length/0]).
│ │ │ │ +-export([init/1,callback_mode/0,terminate/3]).
│ │ │ │ +-export([locked/3,open/3]).
│ │ │ │ +
│ │ │ │ +start_link(Code) ->
│ │ │ │ +    gen_statem:start_link({local,?NAME}, ?MODULE, Code, []).
│ │ │ │ +stop() ->
│ │ │ │ +    gen_statem:stop(?NAME).
│ │ │ │ +
│ │ │ │ +down(Button) ->
│ │ │ │ +    gen_statem:cast(?NAME, {down,Button}).
│ │ │ │ +up(Button) ->
│ │ │ │ +    gen_statem:cast(?NAME, {up,Button}).
│ │ │ │ +code_length() ->
│ │ │ │ +    gen_statem:call(?NAME, code_length).
      init(Code) ->
│ │ │ │ +    process_flag(trap_exit, true),
│ │ │ │ +    Data = #{code => Code, length => length(Code), buttons => []},
│ │ │ │ +    {ok, locked, Data}.
│ │ │ │  
│ │ │ │ -callback_mode() ->
│ │ │ │ -    [state_functions,state_enter].
│ │ │ │ +callback_mode() ->
│ │ │ │ +    [state_functions,state_enter].
│ │ │ │  
│ │ │ │ --define(HANDLE_COMMON,
│ │ │ │ -    ?FUNCTION_NAME(T, C, D) -> handle_common(T, C, D)).
│ │ │ │ +-define(HANDLE_COMMON,
│ │ │ │ +    ?FUNCTION_NAME(T, C, D) -> handle_common(T, C, D)).
│ │ │ │  %%
│ │ │ │ -handle_common(cast, {down,Button}, Data) ->
│ │ │ │ -    {keep_state, Data#{button => Button}};
│ │ │ │ -handle_common(cast, {up,Button}, Data) ->
│ │ │ │ +handle_common(cast, {down,Button}, Data) ->
│ │ │ │ +    {keep_state, Data#{button => Button}};
│ │ │ │ +handle_common(cast, {up,Button}, Data) ->
│ │ │ │      case Data of
│ │ │ │ -        #{button := Button} ->
│ │ │ │ -            {keep_state, maps:remove(button, Data),
│ │ │ │ -             [{next_event,internal,{button,Button}}]};
│ │ │ │ -        #{} ->
│ │ │ │ +        #{button := Button} ->
│ │ │ │ +            {keep_state, maps:remove(button, Data),
│ │ │ │ +             [{next_event,internal,{button,Button}}]};
│ │ │ │ +        #{} ->
│ │ │ │              keep_state_and_data
│ │ │ │      end;
│ │ │ │ -handle_common({call,From}, code_length, #{code := Code}) ->
│ │ │ │ -    {keep_state_and_data,
│ │ │ │ -     [{reply,From,length(Code)}]}.
      locked(enter, _OldState, Data) ->
│ │ │ │ -    do_lock(),
│ │ │ │ -    {keep_state, Data#{buttons := []}};
│ │ │ │ -locked(state_timeout, button, Data) ->
│ │ │ │ -    {keep_state, Data#{buttons := []}};
│ │ │ │ -locked(
│ │ │ │ -  internal, {button,Button},
│ │ │ │ -  #{code := Code, length := Length, buttons := Buttons} = Data) ->
│ │ │ │ +handle_common({call,From}, code_length, #{code := Code}) ->
│ │ │ │ +    {keep_state_and_data,
│ │ │ │ +     [{reply,From,length(Code)}]}.
      locked(enter, _OldState, Data) ->
│ │ │ │ +    do_lock(),
│ │ │ │ +    {keep_state, Data#{buttons := []}};
│ │ │ │ +locked(state_timeout, button, Data) ->
│ │ │ │ +    {keep_state, Data#{buttons := []}};
│ │ │ │ +locked(
│ │ │ │ +  internal, {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
│ │ │ │ -            {next_state, open, Data};
│ │ │ │ +            {next_state, open, Data};
│ │ │ │  	true -> % Incomplete | Incorrect
│ │ │ │ -            {keep_state, Data#{buttons := NewButtons},
│ │ │ │ -             [{state_timeout,30_000,button}]} % Time in milliseconds
│ │ │ │ +            {keep_state, Data#{buttons := NewButtons},
│ │ │ │ +             [{state_timeout,30_000,button}]} % Time in milliseconds
│ │ │ │      end;
│ │ │ │ -?HANDLE_COMMON.
      open(enter, _OldState, _Data) ->
│ │ │ │ -    do_unlock(),
│ │ │ │ -    {keep_state_and_data,
│ │ │ │ -     [{state_timeout,10_000,lock}]}; % Time in milliseconds
│ │ │ │ -open(state_timeout, lock, Data) ->
│ │ │ │ -    {next_state, locked, Data};
│ │ │ │ -open(internal, {button,_}, _) ->
│ │ │ │ -    {keep_state_and_data, [postpone]};
│ │ │ │ +?HANDLE_COMMON.
      open(enter, _OldState, _Data) ->
│ │ │ │ +    do_unlock(),
│ │ │ │ +    {keep_state_and_data,
│ │ │ │ +     [{state_timeout,10_000,lock}]}; % Time in milliseconds
│ │ │ │ +open(state_timeout, lock, Data) ->
│ │ │ │ +    {next_state, locked, Data};
│ │ │ │ +open(internal, {button,_}, _) ->
│ │ │ │ +    {keep_state_and_data, [postpone]};
│ │ │ │  ?HANDLE_COMMON.
│ │ │ │  
│ │ │ │ -do_lock() ->
│ │ │ │ -    io:format("Locked~n", []).
│ │ │ │ -do_unlock() ->
│ │ │ │ -    io:format("Open~n", []).
│ │ │ │ +do_lock() ->
│ │ │ │ +    io:format("Locked~n", []).
│ │ │ │ +do_unlock() ->
│ │ │ │ +    io:format("Open~n", []).
│ │ │ │  
│ │ │ │ -terminate(_Reason, State, _Data) ->
│ │ │ │ -    State =/= locked andalso do_lock(),
│ │ │ │ +terminate(_Reason, State, _Data) ->
│ │ │ │ +    State =/= locked andalso do_lock(),
│ │ │ │      ok.
      
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Callback Mode: handle_event_function
│ │ │ │  
      
│ │ │ │  
      This section describes what to change in the example to use one
│ │ │ │  handle_event/4 function.  The previously used approach to first branch
│ │ │ │  depending on event does not work that well here because of
│ │ │ │ -the state enter calls, so this example first branches depending on state:
      -export([handle_event/4]).
      callback_mode() ->
│ │ │ │ -    [handle_event_function,state_enter].
      %%
│ │ │ │ +the state enter calls, so this example first branches depending on state:
      -export([handle_event/4]).
      callback_mode() ->
│ │ │ │ +    [handle_event_function,state_enter].
      %%
│ │ │ │  %% State: locked
│ │ │ │ -handle_event(enter, _OldState, locked, Data) ->
│ │ │ │ -    do_lock(),
│ │ │ │ -    {keep_state, Data#{buttons := []}};
│ │ │ │ -handle_event(state_timeout, button, locked, Data) ->
│ │ │ │ -    {keep_state, Data#{buttons := []}};
│ │ │ │ -handle_event(
│ │ │ │ -  internal, {button,Button}, locked,
│ │ │ │ -  #{code := Code, length := Length, buttons := Buttons} = Data) ->
│ │ │ │ +handle_event(enter, _OldState, locked, Data) ->
│ │ │ │ +    do_lock(),
│ │ │ │ +    {keep_state, Data#{buttons := []}};
│ │ │ │ +handle_event(state_timeout, button, locked, Data) ->
│ │ │ │ +    {keep_state, Data#{buttons := []}};
│ │ │ │ +handle_event(
│ │ │ │ +  internal, {button,Button}, locked,
│ │ │ │ +  #{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
│ │ │ │ -            {next_state, open, Data};
│ │ │ │ +            {next_state, open, Data};
│ │ │ │  	true -> % Incomplete | Incorrect
│ │ │ │ -            {keep_state, Data#{buttons := NewButtons},
│ │ │ │ -             [{state_timeout,30_000,button}]} % Time in milliseconds
│ │ │ │ +            {keep_state, Data#{buttons := NewButtons},
│ │ │ │ +             [{state_timeout,30_000,button}]} % Time in milliseconds
│ │ │ │      end;
      %%
│ │ │ │  %% State: open
│ │ │ │ -handle_event(enter, _OldState, open, _Data) ->
│ │ │ │ -    do_unlock(),
│ │ │ │ -    {keep_state_and_data,
│ │ │ │ -     [{state_timeout,10_000,lock}]}; % Time in milliseconds
│ │ │ │ -handle_event(state_timeout, lock, open, Data) ->
│ │ │ │ -    {next_state, locked, Data};
│ │ │ │ -handle_event(internal, {button,_}, open, _) ->
│ │ │ │ -    {keep_state_and_data,[postpone]};
      %% Common events
│ │ │ │ -handle_event(cast, {down,Button}, _State, Data) ->
│ │ │ │ -    {keep_state, Data#{button => Button}};
│ │ │ │ -handle_event(cast, {up,Button}, _State, Data) ->
│ │ │ │ +handle_event(enter, _OldState, open, _Data) ->
│ │ │ │ +    do_unlock(),
│ │ │ │ +    {keep_state_and_data,
│ │ │ │ +     [{state_timeout,10_000,lock}]}; % Time in milliseconds
│ │ │ │ +handle_event(state_timeout, lock, open, Data) ->
│ │ │ │ +    {next_state, locked, Data};
│ │ │ │ +handle_event(internal, {button,_}, open, _) ->
│ │ │ │ +    {keep_state_and_data,[postpone]};
      %% Common events
│ │ │ │ +handle_event(cast, {down,Button}, _State, Data) ->
│ │ │ │ +    {keep_state, Data#{button => Button}};
│ │ │ │ +handle_event(cast, {up,Button}, _State, Data) ->
│ │ │ │      case Data of
│ │ │ │ -        #{button := Button} ->
│ │ │ │ -            {keep_state, maps:remove(button, Data),
│ │ │ │ -             [{next_event,internal,{button,Button}},
│ │ │ │ -              {state_timeout,30_000,button}]}; % Time in milliseconds
│ │ │ │ -        #{} ->
│ │ │ │ +        #{button := Button} ->
│ │ │ │ +            {keep_state, maps:remove(button, Data),
│ │ │ │ +             [{next_event,internal,{button,Button}},
│ │ │ │ +              {state_timeout,30_000,button}]}; % Time in milliseconds
│ │ │ │ +        #{} ->
│ │ │ │              keep_state_and_data
│ │ │ │      end;
│ │ │ │ -handle_event({call,From}, code_length, _State, #{length := Length}) ->
│ │ │ │ -    {keep_state_and_data,
│ │ │ │ -     [{reply,From,Length}]}.
      Notice that postponing buttons from the open state to the locked state
│ │ │ │ +handle_event({call,From}, code_length, _State, #{length := Length}) ->
│ │ │ │ +    {keep_state_and_data,
│ │ │ │ +     [{reply,From,Length}]}.
      Notice that postponing buttons from the open state to the locked state
│ │ │ │  seems like a strange thing to do for a code lock, but it at least
│ │ │ │  illustrates event postponing.
      
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Filter the State
│ │ │ │  
      
│ │ │ │ @@ -1191,30 +1191,30 @@
│ │ │ │  and which digits that remain to unlock.
      This state data can be regarded as sensitive, and maybe not what you want
│ │ │ │  in the error log because of some unpredictable event.
      Another reason to filter the state can be that the state is too large to print,
│ │ │ │  as it fills the error log with uninteresting details.
      To avoid this, you can format the internal state that gets in the error log
│ │ │ │  and gets returned from sys:get_status/1,2
│ │ │ │  by implementing function
│ │ │ │  Module:format_status/2,
│ │ │ │  for example like this:
      ...
│ │ │ │ --export([init/1,terminate/3,format_status/2]).
│ │ │ │ +-export([init/1,terminate/3,format_status/2]).
│ │ │ │  ...
│ │ │ │  
│ │ │ │ -format_status(Opt, [_PDict,State,Data]) ->
│ │ │ │ +format_status(Opt, [_PDict,State,Data]) ->
│ │ │ │      StateData =
│ │ │ │ -	{State,
│ │ │ │ -	 maps:filter(
│ │ │ │ -	   fun (code, _) -> false;
│ │ │ │ -	       (_, _) -> true
│ │ │ │ +	{State,
│ │ │ │ +	 maps:filter(
│ │ │ │ +	   fun (code, _) -> false;
│ │ │ │ +	       (_, _) -> true
│ │ │ │  	   end,
│ │ │ │ -	   Data)},
│ │ │ │ +	   Data)},
│ │ │ │      case Opt of
│ │ │ │  	terminate ->
│ │ │ │  	    StateData;
│ │ │ │  	normal ->
│ │ │ │ -	    [{data,[{"State",StateData}]}]
│ │ │ │ +	    [{data,[{"State",StateData}]}]
│ │ │ │      end.
      It is not mandatory to implement a
│ │ │ │  Module:format_status/2 function.
│ │ │ │  If you do not, a default implementation is used that does the same
│ │ │ │  as this example function without filtering the Data term, that is,
│ │ │ │  StateData = {State, Data}, in this example containing sensitive information.
      
│ │ │ │    
│ │ │ │      
│ │ │ │ @@ -1227,104 +1227,104 @@
│ │ │ │  like a tuple.
      One reason to use this is when you have a state item that when changed
│ │ │ │  should cancel the state time-out, or one that affects
│ │ │ │  the event handling in combination with postponing events. We will go for
│ │ │ │  the latter and complicate the previous example by introducing
│ │ │ │  a configurable lock button (this is the state item in question),
│ │ │ │  which in the open state immediately locks the door, and an API function
│ │ │ │  set_lock_button/1 to set the lock button.
      Suppose now that we call set_lock_button while the door is open,
│ │ │ │ -and we have already postponed a button event that was the new lock button:
      1> code_lock:start_link([a,b,c], x).
│ │ │ │ -{ok,<0.666.0>}
│ │ │ │ -2> code_lock:button(a).
│ │ │ │ +and we have already postponed a button event that was the new lock button:
      1> code_lock:start_link([a,b,c], x).
│ │ │ │ +{ok,<0.666.0>}
│ │ │ │ +2> code_lock:button(a).
│ │ │ │  ok
│ │ │ │ -3> code_lock:button(b).
│ │ │ │ +3> code_lock:button(b).
│ │ │ │  ok
│ │ │ │ -4> code_lock:button(c).
│ │ │ │ +4> code_lock:button(c).
│ │ │ │  ok
│ │ │ │  Open
│ │ │ │ -5> code_lock:button(y).
│ │ │ │ +5> code_lock:button(y).
│ │ │ │  ok
│ │ │ │ -6> code_lock:set_lock_button(y).
│ │ │ │ +6> code_lock:set_lock_button(y).
│ │ │ │  x
│ │ │ │  % What should happen here?  Immediate lock or nothing?
      We could say that the button was pressed too early so it should not be
│ │ │ │  recognized as the lock button. Or we can make the lock button part of
│ │ │ │  the state so when we then change the lock button in the locked state,
│ │ │ │  the change becomes a state change and all postponed events are retried,
│ │ │ │  therefore the lock is immediately locked!
      We define the state as {StateName, LockButton}, where StateName
│ │ │ │ -is as before and LockButton is the current lock button:
      -module(code_lock).
│ │ │ │ --behaviour(gen_statem).
│ │ │ │ --define(NAME, code_lock_3).
│ │ │ │ +is as before and LockButton is the current lock button:
      -module(code_lock).
│ │ │ │ +-behaviour(gen_statem).
│ │ │ │ +-define(NAME, code_lock_3).
│ │ │ │  
│ │ │ │ --export([start_link/2,stop/0]).
│ │ │ │ --export([button/1,set_lock_button/1]).
│ │ │ │ --export([init/1,callback_mode/0,terminate/3]).
│ │ │ │ --export([handle_event/4]).
│ │ │ │ -
│ │ │ │ -start_link(Code, LockButton) ->
│ │ │ │ -    gen_statem:start_link(
│ │ │ │ -        {local,?NAME}, ?MODULE, {Code,LockButton}, []).
│ │ │ │ -stop() ->
│ │ │ │ -    gen_statem:stop(?NAME).
│ │ │ │ -
│ │ │ │ -button(Button) ->
│ │ │ │ -    gen_statem:cast(?NAME, {button,Button}).
│ │ │ │ -set_lock_button(LockButton) ->
│ │ │ │ -    gen_statem:call(?NAME, {set_lock_button,LockButton}).
      init({Code,LockButton}) ->
│ │ │ │ -    process_flag(trap_exit, true),
│ │ │ │ -    Data = #{code => Code, length => length(Code), buttons => []},
│ │ │ │ -    {ok, {locked,LockButton}, Data}.
│ │ │ │ +-export([start_link/2,stop/0]).
│ │ │ │ +-export([button/1,set_lock_button/1]).
│ │ │ │ +-export([init/1,callback_mode/0,terminate/3]).
│ │ │ │ +-export([handle_event/4]).
│ │ │ │ +
│ │ │ │ +start_link(Code, LockButton) ->
│ │ │ │ +    gen_statem:start_link(
│ │ │ │ +        {local,?NAME}, ?MODULE, {Code,LockButton}, []).
│ │ │ │ +stop() ->
│ │ │ │ +    gen_statem:stop(?NAME).
│ │ │ │ +
│ │ │ │ +button(Button) ->
│ │ │ │ +    gen_statem:cast(?NAME, {button,Button}).
│ │ │ │ +set_lock_button(LockButton) ->
│ │ │ │ +    gen_statem:call(?NAME, {set_lock_button,LockButton}).
      init({Code,LockButton}) ->
│ │ │ │ +    process_flag(trap_exit, true),
│ │ │ │ +    Data = #{code => Code, length => length(Code), buttons => []},
│ │ │ │ +    {ok, {locked,LockButton}, Data}.
│ │ │ │  
│ │ │ │ -callback_mode() ->
│ │ │ │ -    [handle_event_function,state_enter].
│ │ │ │ +callback_mode() ->
│ │ │ │ +    [handle_event_function,state_enter].
│ │ │ │  
│ │ │ │  %% State: locked
│ │ │ │ -handle_event(enter, _OldState, {locked,_}, Data) ->
│ │ │ │ -    do_lock(),
│ │ │ │ -    {keep_state, Data#{buttons := []}};
│ │ │ │ -handle_event(state_timeout, button, {locked,_}, Data) ->
│ │ │ │ -    {keep_state, Data#{buttons := []}};
│ │ │ │ -handle_event(
│ │ │ │ -  cast, {button,Button}, {locked,LockButton},
│ │ │ │ -  #{code := Code, length := Length, buttons := Buttons} = Data) ->
│ │ │ │ +handle_event(enter, _OldState, {locked,_}, Data) ->
│ │ │ │ +    do_lock(),
│ │ │ │ +    {keep_state, Data#{buttons := []}};
│ │ │ │ +handle_event(state_timeout, button, {locked,_}, Data) ->
│ │ │ │ +    {keep_state, Data#{buttons := []}};
│ │ │ │ +handle_event(
│ │ │ │ +  cast, {button,Button}, {locked,LockButton},
│ │ │ │ +  #{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
│ │ │ │ -            {next_state, {open,LockButton}, Data};
│ │ │ │ +            {next_state, {open,LockButton}, Data};
│ │ │ │  	true -> % Incomplete | Incorrect
│ │ │ │ -            {keep_state, Data#{buttons := NewButtons},
│ │ │ │ -             [{state_timeout,30_000,button}]} % Time in milliseconds
│ │ │ │ +            {keep_state, Data#{buttons := NewButtons},
│ │ │ │ +             [{state_timeout,30_000,button}]} % Time in milliseconds
│ │ │ │      end;
      %%
│ │ │ │  %% State: open
│ │ │ │ -handle_event(enter, _OldState, {open,_}, _Data) ->
│ │ │ │ -    do_unlock(),
│ │ │ │ -    {keep_state_and_data,
│ │ │ │ -     [{state_timeout,10_000,lock}]}; % Time in milliseconds
│ │ │ │ -handle_event(state_timeout, lock, {open,LockButton}, Data) ->
│ │ │ │ -    {next_state, {locked,LockButton}, Data};
│ │ │ │ -handle_event(cast, {button,LockButton}, {open,LockButton}, Data) ->
│ │ │ │ -    {next_state, {locked,LockButton}, Data};
│ │ │ │ -handle_event(cast, {button,_}, {open,_}, _Data) ->
│ │ │ │ -    {keep_state_and_data,[postpone]};
      %%
│ │ │ │ +handle_event(enter, _OldState, {open,_}, _Data) ->
│ │ │ │ +    do_unlock(),
│ │ │ │ +    {keep_state_and_data,
│ │ │ │ +     [{state_timeout,10_000,lock}]}; % Time in milliseconds
│ │ │ │ +handle_event(state_timeout, lock, {open,LockButton}, Data) ->
│ │ │ │ +    {next_state, {locked,LockButton}, Data};
│ │ │ │ +handle_event(cast, {button,LockButton}, {open,LockButton}, Data) ->
│ │ │ │ +    {next_state, {locked,LockButton}, Data};
│ │ │ │ +handle_event(cast, {button,_}, {open,_}, _Data) ->
│ │ │ │ +    {keep_state_and_data,[postpone]};
      %%
│ │ │ │  %% Common events
│ │ │ │ -handle_event(
│ │ │ │ -  {call,From}, {set_lock_button,NewLockButton},
│ │ │ │ -  {StateName,OldLockButton}, Data) ->
│ │ │ │ -    {next_state, {StateName,NewLockButton}, Data,
│ │ │ │ -     [{reply,From,OldLockButton}]}.
      do_lock() ->
│ │ │ │ -    io:format("Locked~n", []).
│ │ │ │ -do_unlock() ->
│ │ │ │ -    io:format("Open~n", []).
│ │ │ │ +handle_event(
│ │ │ │ +  {call,From}, {set_lock_button,NewLockButton},
│ │ │ │ +  {StateName,OldLockButton}, Data) ->
│ │ │ │ +    {next_state, {StateName,NewLockButton}, Data,
│ │ │ │ +     [{reply,From,OldLockButton}]}.
      do_lock() ->
│ │ │ │ +    io:format("Locked~n", []).
│ │ │ │ +do_unlock() ->
│ │ │ │ +    io:format("Open~n", []).
│ │ │ │  
│ │ │ │ -terminate(_Reason, State, _Data) ->
│ │ │ │ -    State =/= locked andalso do_lock(),
│ │ │ │ +terminate(_Reason, State, _Data) ->
│ │ │ │ +    State =/= locked andalso do_lock(),
│ │ │ │      ok.
      
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Hibernation
│ │ │ │  
      
│ │ │ │  
      If you have many servers in one node and they have some state(s) in their
│ │ │ │ @@ -1333,19 +1333,19 @@
│ │ │ │  footprint of a server can be minimized by hibernating it through
│ │ │ │  proc_lib:hibernate/3.
      Note
      It is rather costly to hibernate a process; see erlang:hibernate/3. It is
│ │ │ │  not something you want to do after every event.
      We can in this example hibernate in the {open, _} state,
│ │ │ │  because what normally occurs in that state is that the state time-out
│ │ │ │  after a while triggers a transition to {locked, _}:
      ...
│ │ │ │  %%
│ │ │ │  %% State: open
│ │ │ │ -handle_event(enter, _OldState, {open,_}, _Data) ->
│ │ │ │ -    do_unlock(),
│ │ │ │ -    {keep_state_and_data,
│ │ │ │ -     [{state_timeout,10_000,lock}, % Time in milliseconds
│ │ │ │ -      hibernate]};
│ │ │ │ +handle_event(enter, _OldState, {open,_}, _Data) ->
│ │ │ │ +    do_unlock(),
│ │ │ │ +    {keep_state_and_data,
│ │ │ │ +     [{state_timeout,10_000,lock}, % Time in milliseconds
│ │ │ │ +      hibernate]};
│ │ │ │  ...
      The atom hibernate in the action list on the
│ │ │ │  last line when entering the {open, _} state is the only change. If any event
│ │ │ │  arrives in the {open, _}, state, we do not bother to rehibernate,
│ │ │ │  so the server stays awake after any event.
      To change that we would need to insert action hibernate in more places.
│ │ │ │  For example, the state-independent set_lock_button operation
│ │ │ │  would have to use hibernate but only in the {open, _} state,
│ │ │ │  which would clutter the code.
      Another not uncommon scenario is to use the
│ │ │ ├── OEBPS/spec_proc.xhtml
│ │ │ │ @@ -28,72 +28,72 @@
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Simple Debugging
│ │ │ │  
      
│ │ │ │  
      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).
│ │ │ │ -ok
│ │ │ │ -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 => []}}}]}]]}
      
│ │ │ │ +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).
│ │ │ │ +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 => []}}}]}]]}
      
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Special Processes
│ │ │ │  
      
│ │ │ │  
      This section describes how to write a process that complies to the OTP design
│ │ │ │  principles, without using a standard behaviour. Such a process is to:
      System messages are messages with a special meaning, used in the supervision
│ │ │ │ @@ -103,238 +103,238 @@
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Example
│ │ │ │  
│ │ │ │  
      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)
│ │ │ │      end.
│ │ │ │  
│ │ │ │ -system_continue(Parent, Deb, Chs) ->
│ │ │ │ -    loop(Chs, Parent, Deb).
│ │ │ │ +system_continue(Parent, Deb, Chs) ->
│ │ │ │ +    loop(Chs, Parent, Deb).
│ │ │ │  
│ │ │ │ -system_terminate(Reason, _Parent, _Deb, _Chs) ->
│ │ │ │ -    exit(Reason).
│ │ │ │ +system_terminate(Reason, _Parent, _Deb, _Chs) ->
│ │ │ │ +    exit(Reason).
│ │ │ │  
│ │ │ │ -system_get_state(Chs) ->
│ │ │ │ -    {ok, Chs}.
│ │ │ │ +system_get_state(Chs) ->
│ │ │ │ +    {ok, Chs}.
│ │ │ │  
│ │ │ │ -system_replace_state(StateFun, Chs) ->
│ │ │ │ -    NChs = StateFun(Chs),
│ │ │ │ -    {ok, NChs, NChs}.
│ │ │ │ +system_replace_state(StateFun, Chs) ->
│ │ │ │ +    NChs = StateFun(Chs),
│ │ │ │ +    {ok, NChs, NChs}.
│ │ │ │  
│ │ │ │ -write_debug(Dev, Event, Name) ->
│ │ │ │ -    io:format(Dev, "~p event = ~p~n", [Name, Event]).
      As it is not relevant to the example, the channel handling functions have been
│ │ │ │ +write_debug(Dev, Event, Name) ->
│ │ │ │ +    io:format(Dev, "~p event = ~p~n", [Name, Event]).
      As it is not relevant to the example, the channel handling functions have been
│ │ │ │  omitted. To compile this example, the
│ │ │ │  implementation of channel handling
│ │ │ │  needs to be added to the module.
      Here is an example showing how the debugging functions in the sys
│ │ │ │  module can be used for ch4:
      % erl
│ │ │ │ -Erlang/OTP 27 [erts-15.0] [64-bit] [smp:8:8] [ds:8:8:10] [async-threads:1] [jit]
│ │ │ │ +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> ch4:start_link().
│ │ │ │ -{ok,<0.90.0>}
│ │ │ │ -2> sys:statistics(ch4, true).
│ │ │ │ -ok
│ │ │ │ -3> sys:trace(ch4, true).
│ │ │ │ -ok
│ │ │ │ -4> ch4:alloc().
│ │ │ │ -ch4 event = {in,alloc,<0.88.0>}
│ │ │ │ -ch4 event = {out,{ch4,1},<0.88.0>}
│ │ │ │ +Eshell V15.0 (press Ctrl+G to abort, type help(). for help)
│ │ │ │ +1> ch4:start_link().
│ │ │ │ +{ok,<0.90.0>}
│ │ │ │ +2> sys:statistics(ch4, true).
│ │ │ │ +ok
│ │ │ │ +3> sys:trace(ch4, true).
│ │ │ │ +ok
│ │ │ │ +4> ch4:alloc().
│ │ │ │ +ch4 event = {in,alloc,<0.88.0>}
│ │ │ │ +ch4 event = {out,{ch4,1},<0.88.0>}
│ │ │ │  1
│ │ │ │ -5> ch4:free(ch1).
│ │ │ │ -ch4 event = {in,{free,ch1}}
│ │ │ │ +5> ch4:free(ch1).
│ │ │ │ +ch4 event = {in,{free,ch1}}
│ │ │ │  ok
│ │ │ │ -6> sys:statistics(ch4, get).
│ │ │ │ -{ok,[{start_time,{{2024,5,3},{8,26,13}}},
│ │ │ │ -     {current_time,{{2024,5,3},{8,26,49}}},
│ │ │ │ -     {reductions,202},
│ │ │ │ -     {messages_in,2},
│ │ │ │ -     {messages_out,1}]}
│ │ │ │ -7> sys:statistics(ch4, false).
│ │ │ │ -ok
│ │ │ │ -8> sys:trace(ch4, false).
│ │ │ │ -ok
│ │ │ │ -9> sys:get_status(ch4).
│ │ │ │ -{status,<0.90.0>,
│ │ │ │ -        {module,ch4},
│ │ │ │ -        [[{'$initial_call',{ch4,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>,[],
│ │ │ │ -         {[1],[2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19|...]}]}
      
│ │ │ │ +6> sys:statistics(ch4, get).
│ │ │ │ +{ok,[{start_time,{{2024,5,3},{8,26,13}}},
│ │ │ │ +     {current_time,{{2024,5,3},{8,26,49}}},
│ │ │ │ +     {reductions,202},
│ │ │ │ +     {messages_in,2},
│ │ │ │ +     {messages_out,1}]}
│ │ │ │ +7> sys:statistics(ch4, false).
│ │ │ │ +ok
│ │ │ │ +8> sys:trace(ch4, false).
│ │ │ │ +ok
│ │ │ │ +9> sys:get_status(ch4).
│ │ │ │ +{status,<0.90.0>,
│ │ │ │ +        {module,ch4},
│ │ │ │ +        [[{'$initial_call',{ch4,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>,[],
│ │ │ │ +         {[1],[2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19|...]}]}
      
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Starting the Process
│ │ │ │  
      
│ │ │ │  
      A function in the proc_lib module is to be used to start the process. Several
│ │ │ │  functions are available, for example,
│ │ │ │  proc_lib:spawn_link/3,4
│ │ │ │  for asynchronous start and
│ │ │ │  proc_lib:start_link/3,4,5 for synchronous start.
      Information necessary for a process within a supervision tree, such as
│ │ │ │  details on ancestors and the initial call, is stored when a process
│ │ │ │  is started through one of these functions.
      If the process terminates with a reason other than normal or shutdown, a
│ │ │ │  crash report is generated. For more information about the crash report, see
│ │ │ │  Logging in Kernel User's Guide.
      In the example, synchronous start is used. The process starts by calling
│ │ │ │ -ch4:start_link():
      start_link() ->
│ │ │ │ -    proc_lib:start_link(ch4, init, [self()]).
      ch4:start_link/0 calls proc_lib:start_link/3, which takes a module
│ │ │ │ +ch4:start_link():
      start_link() ->
│ │ │ │ +    proc_lib:start_link(ch4, init, [self()]).
      ch4:start_link/0 calls proc_lib:start_link/3, which takes a module
│ │ │ │  name, a function name, and an argument list as arguments. It then
│ │ │ │  spawns a new process and establishes a link. The new process starts
│ │ │ │  by executing the given function, here ch4:init(Pid), where Pid is
│ │ │ │  the pid of the parent process (obtained by the call to
│ │ │ │  self() in the call to proc_lib:start_link/3).
      All initialization, including name registration, is done in init/1. The new
│ │ │ │ -process has to acknowledge that it has been started to the parent:
      init(Parent) ->
│ │ │ │ +process has to acknowledge that it has been started to the parent:
      init(Parent) ->
│ │ │ │      ...
│ │ │ │ -    proc_lib:init_ack(Parent, {ok, self()}),
│ │ │ │ -    loop(...).
      proc_lib:start_link/3 is synchronous and does not return until
│ │ │ │ +    proc_lib:init_ack(Parent, {ok, self()}),
│ │ │ │ +    loop(...).
      proc_lib:start_link/3 is synchronous and does not return until
│ │ │ │  proc_lib:init_ack/1,2 or
│ │ │ │  proc_lib:init_fail/2,3 has been called,
│ │ │ │  or the process has exited.
      
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Debugging
│ │ │ │  
      
│ │ │ │  
      To support the debug facilities in sys, a debug structure is needed. The
│ │ │ │ -Deb term is initialized using sys:debug_options/1:
      init(Parent) ->
│ │ │ │ +Deb term is initialized using sys:debug_options/1:
      init(Parent) ->
│ │ │ │      ...
│ │ │ │ -    Deb = sys:debug_options([]),
│ │ │ │ +    Deb = sys:debug_options([]),
│ │ │ │      ...
│ │ │ │ -    loop(Chs, Parent, Deb).
      sys:debug_options/1 takes a list of options. Given an empty list as in this
│ │ │ │ +    loop(Chs, Parent, Deb).
      sys:debug_options/1 takes a list of options. Given an empty list as in this
│ │ │ │  example means that debugging is initially disabled. For information about the
│ │ │ │  possible options, see sys in STDLIB.
      For each system event to be logged or traced, the following function
│ │ │ │ -is to be called:
      sys:handle_debug(Deb, Func, Info, Event) => Deb1
      The arguments have the follow meaning:
      • Deb is the debug structure as returned from sys:debug_options/1.
      • Func is a fun specifying a (user-defined) function used to format trace
│ │ │ │ +is to be called:
        sys:handle_debug(Deb, Func, Info, Event) => Deb1
        The arguments have the follow meaning:
        • Deb is the debug structure as returned from sys:debug_options/1.
        • Func is a fun specifying a (user-defined) function used to format trace
│ │ │ │  output. For each system event, the format function is called as
│ │ │ │  Func(Dev, Event, Info), where:
          • Dev is the I/O device to which the output is to be printed. See io
│ │ │ │  in STDLIB.
          • Event and Info are passed as-is from the call to sys:handle_debug/4.
        • Info is used to pass more information to Func. It can be any term, and it
│ │ │ │  is passed as-is.
        • Event is the system event. It is up to the user to define what a system
│ │ │ │  event is and how it is to be represented. Typically, at least incoming and
│ │ │ │  outgoing messages are considered system events and represented by the tuples
│ │ │ │  {in,Msg[,From]} and {out,Msg,To[,State]}, respectively.
        sys:handle_debug/4 returns an updated debug structure Deb1.
        In the example, sys:handle_debug/4 is called for each incoming and
│ │ │ │  outgoing message. The format function Func is the function
│ │ │ │ -ch4:write_debug/3, which prints the message using io:format/3.
        loop(Chs, Parent, Deb) ->
│ │ │ │ +ch4:write_debug/3, which prints the message using io:format/3.
        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);
│ │ │ │ +        {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);
│ │ │ │          ...
│ │ │ │      end.
│ │ │ │  
│ │ │ │ -write_debug(Dev, Event, Name) ->
│ │ │ │ -    io:format(Dev, "~p event = ~p~n", [Name, Event]).
        
│ │ │ │ +write_debug(Dev, Event, Name) ->
│ │ │ │ +    io:format(Dev, "~p event = ~p~n", [Name, Event]).
        
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Handling System Messages
│ │ │ │  
        
│ │ │ │  
        System messages are received as:
        {system, From, Request}
        The content and meaning of these messages are not to be interpreted by the
│ │ │ │ -process. Instead the following function is to be called:
        sys:handle_system_msg(Request, From, Parent, Module, Deb, State)
        The arguments have the following meaning:
        • Request and From from the received system message are to be
│ │ │ │ +process. Instead the following function is to be called:
          sys:handle_system_msg(Request, From, Parent, Module, Deb, State)
          The arguments have the following meaning:
          • Request and From from the received system message are to be
│ │ │ │  passed as-is to the call to sys:handle_system_msg/6.
          • Parent is the pid of the parent process.
          • Module is the name of the module implementing the speciall process.
          • Deb is the debug structure.
          • State is a term describing the internal state and is passed on to
│ │ │ │  Module:system_continue/3, Module:system_terminate/4/
│ │ │ │  Module:system_get_state/1, and Module:system_replace_state/2.
          sys:handle_system_msg/6 does not return. It handles the system
│ │ │ │  message and eventually calls either of the following functions:
          • Module:system_continue(Parent, Deb, State) - if process execution is to
│ │ │ │  continue.
          • Module:system_terminate(Reason, Parent, Deb, State) - if the
│ │ │ │  process is to terminate.
          While handling the system message, sys:handle_system_msg/6 can call
│ │ │ │  one of the following functions:
          • Module:system_get_state(State) - if the process is to return its state.
          • Module:system_replace_state(StateFun, State) - if the process is
│ │ │ │  to replace its state using the fun StateFun fun. See sys:replace_state/3
│ │ │ │  for more information.
          • system_code_change(Misc, Module, OldVsn, Extra) - if the process is to
│ │ │ │  perform a code change.
          A process in a supervision tree is expected to terminate with the same reason as
│ │ │ │ -its parent.
          In the example, system messages are handed by the following code:
          loop(Chs, Parent, Deb) ->
│ │ │ │ +its parent.
          In the example, system messages are handed by the following code:
          loop(Chs, Parent, Deb) ->
│ │ │ │      receive
│ │ │ │          ...
│ │ │ │  
│ │ │ │ -        {system, From, Request} ->
│ │ │ │ -            sys:handle_system_msg(Request, From, Parent,
│ │ │ │ -                                  ch4, Deb, Chs)
│ │ │ │ +        {system, From, Request} ->
│ │ │ │ +            sys:handle_system_msg(Request, From, Parent,
│ │ │ │ +                                  ch4, Deb, Chs)
│ │ │ │      end.
│ │ │ │  
│ │ │ │ -system_continue(Parent, Deb, Chs) ->
│ │ │ │ -    loop(Chs, Parent, Deb).
│ │ │ │ +system_continue(Parent, Deb, Chs) ->
│ │ │ │ +    loop(Chs, Parent, Deb).
│ │ │ │  
│ │ │ │ -system_terminate(Reason, Parent, Deb, Chs) ->
│ │ │ │ -    exit(Reason).
│ │ │ │ +system_terminate(Reason, Parent, Deb, Chs) ->
│ │ │ │ +    exit(Reason).
│ │ │ │  
│ │ │ │ -system_get_state(Chs) ->
│ │ │ │ -    {ok, Chs, Chs}.
│ │ │ │ +system_get_state(Chs) ->
│ │ │ │ +    {ok, Chs, Chs}.
│ │ │ │  
│ │ │ │ -system_replace_state(StateFun, Chs) ->
│ │ │ │ -    NChs = StateFun(Chs),
│ │ │ │ -    {ok, NChs, NChs}.
          If a special process is configured to trap exits, it must take notice
│ │ │ │ +system_replace_state(StateFun, Chs) ->
│ │ │ │ +    NChs = StateFun(Chs),
│ │ │ │ +    {ok, NChs, NChs}.
          If a special process is configured to trap exits, it must take notice
│ │ │ │  of 'EXIT' messages from its parent process and terminate using the
│ │ │ │ -same exit reason once the parent process has terminated.
          Here is an example:
          init(Parent) ->
│ │ │ │ +same exit reason once the parent process has terminated.
          Here is an example:
          init(Parent) ->
│ │ │ │      ...,
│ │ │ │ -    process_flag(trap_exit, true),
│ │ │ │ +    process_flag(trap_exit, true),
│ │ │ │      ...,
│ │ │ │ -    loop(Parent).
│ │ │ │ +    loop(Parent).
│ │ │ │  
│ │ │ │ -loop(Parent) ->
│ │ │ │ +loop(Parent) ->
│ │ │ │      receive
│ │ │ │          ...
│ │ │ │ -        {'EXIT', Parent, Reason} ->
│ │ │ │ +        {'EXIT', Parent, Reason} ->
│ │ │ │              %% Clean up here, if needed.
│ │ │ │ -            exit(Reason);
│ │ │ │ +            exit(Reason);
│ │ │ │          ...
│ │ │ │      end.
          
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    User-Defined Behaviours
│ │ │ │  
          
│ │ │ │ @@ -353,69 +353,69 @@
│ │ │ │  function. Note that the -optional_callbacks attribute is to be used together
│ │ │ │  with the -callback attribute; it cannot be combined with the
│ │ │ │  behaviour_info() function described below.
          Tools that need to know about optional callback functions can call
│ │ │ │  Behaviour:behaviour_info(optional_callbacks) to get a list of all optional
│ │ │ │  callback functions.
          Note
          We recommend using the -callback attribute rather than the
│ │ │ │  behaviour_info() function. The reason is that the extra type information can
│ │ │ │  be used by tools to produce documentation or find discrepancies.
          As an alternative to the -callback and -optional_callbacks attributes you
│ │ │ │ -may directly implement and export behaviour_info():
          behaviour_info(callbacks) ->
│ │ │ │ -    [{Name1, Arity1},...,{NameN, ArityN}].
          where each {Name, Arity} specifies the name and arity of a callback function.
│ │ │ │ +may directly implement and export behaviour_info():
          behaviour_info(callbacks) ->
│ │ │ │ +    [{Name1, Arity1},...,{NameN, ArityN}].
          where each {Name, Arity} specifies the name and arity of a callback function.
│ │ │ │  This function is otherwise automatically generated by the compiler using the
│ │ │ │  -callback attributes.
          When the compiler encounters the module attribute -behaviour(Behaviour). in a
│ │ │ │  module Mod, it calls Behaviour:behaviour_info(callbacks) and compares the
│ │ │ │  result with the set of functions actually exported from Mod, and issues a
│ │ │ │  warning if any callback function is missing.
          Example:
          %% User-defined behaviour module
│ │ │ │ --module(simple_server).
│ │ │ │ --export([start_link/2, init/3, ...]).
│ │ │ │ +-module(simple_server).
│ │ │ │ +-export([start_link/2, init/3, ...]).
│ │ │ │  
│ │ │ │ --callback init(State :: term()) -> 'ok'.
│ │ │ │ --callback handle_req(Req :: term(), State :: term()) -> {'ok', Reply :: term()}.
│ │ │ │ --callback terminate() -> 'ok'.
│ │ │ │ --callback format_state(State :: term()) -> term().
│ │ │ │ +-callback init(State :: term()) -> 'ok'.
│ │ │ │ +-callback handle_req(Req :: term(), State :: term()) -> {'ok', Reply :: term()}.
│ │ │ │ +-callback terminate() -> 'ok'.
│ │ │ │ +-callback format_state(State :: term()) -> term().
│ │ │ │  
│ │ │ │ --optional_callbacks([format_state/1]).
│ │ │ │ +-optional_callbacks([format_state/1]).
│ │ │ │  
│ │ │ │  %% Alternatively you may define:
│ │ │ │  %%
│ │ │ │  %% -export([behaviour_info/1]).
│ │ │ │  %% behaviour_info(callbacks) ->
│ │ │ │  %%     [{init,1},
│ │ │ │  %%      {handle_req,2},
│ │ │ │  %%      {terminate,0}].
│ │ │ │  
│ │ │ │ -start_link(Name, Module) ->
│ │ │ │ -    proc_lib:start_link(?MODULE, init, [self(), Name, Module]).
│ │ │ │ +start_link(Name, Module) ->
│ │ │ │ +    proc_lib:start_link(?MODULE, init, [self(), Name, Module]).
│ │ │ │  
│ │ │ │ -init(Parent, Name, Module) ->
│ │ │ │ -    register(Name, self()),
│ │ │ │ +init(Parent, Name, Module) ->
│ │ │ │ +    register(Name, self()),
│ │ │ │      ...,
│ │ │ │ -    Dbg = sys:debug_options([]),
│ │ │ │ -    proc_lib:init_ack(Parent, {ok, self()}),
│ │ │ │ -    loop(Parent, Module, Deb, ...).
│ │ │ │ +    Dbg = sys:debug_options([]),
│ │ │ │ +    proc_lib:init_ack(Parent, {ok, self()}),
│ │ │ │ +    loop(Parent, Module, Deb, ...).
│ │ │ │  
│ │ │ │ -...
          In a callback module:
          -module(db).
│ │ │ │ --behaviour(simple_server).
│ │ │ │ +...
          In a callback module:
          -module(db).
│ │ │ │ +-behaviour(simple_server).
│ │ │ │  
│ │ │ │ --export([init/1, handle_req/2, terminate/0]).
│ │ │ │ +-export([init/1, handle_req/2, terminate/0]).
│ │ │ │  
│ │ │ │  ...
          The contracts specified with -callback attributes in behaviour modules can be
│ │ │ │  further refined by adding -spec attributes in callback modules. This can be
│ │ │ │  useful as -callback contracts are usually generic. The same callback module
│ │ │ │ -with contracts for the callbacks:
          -module(db).
│ │ │ │ --behaviour(simple_server).
│ │ │ │ +with contracts for the callbacks:
          -module(db).
│ │ │ │ +-behaviour(simple_server).
│ │ │ │  
│ │ │ │ --export([init/1, handle_req/2, terminate/0]).
│ │ │ │ +-export([init/1, handle_req/2, terminate/0]).
│ │ │ │  
│ │ │ │ --record(state, {field1 :: [atom()], field2 :: integer()}).
│ │ │ │ +-record(state, {field1 :: [atom()], field2 :: integer()}).
│ │ │ │  
│ │ │ │ --type state()   :: #state{}.
│ │ │ │ --type request() :: {'store', term(), term()};
│ │ │ │ -                   {'lookup', term()}.
│ │ │ │ +-type state()   :: #state{}.
│ │ │ │ +-type request() :: {'store', term(), term()};
│ │ │ │ +                   {'lookup', term()}.
│ │ │ │  
│ │ │ │  ...
│ │ │ │  
│ │ │ │ --spec handle_req(request(), state()) -> {'ok', term()}.
│ │ │ │ +-spec handle_req(request(), state()) -> {'ok', term()}.
│ │ │ │  
│ │ │ │  ...
          Each -spec contract is to be a subtype of the respective -callback contract.
          
│ │ │ │  
│ │ │ │    
│ │ │ │  
│ │ │ ├── OEBPS/seq_prog.xhtml
│ │ │ │ @@ -41,293 +41,293 @@
│ │ │ │            7
│ │ │ │  2> 
          As shown, the Erlang shell numbers the lines that can be entered, (as 1> 2>) and
│ │ │ │  that it correctly says that 2 + 5 is 7. If you make writing mistakes in the
│ │ │ │  shell, you can delete with the backspace key, as in most shells. There are many
│ │ │ │  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().
│ │ │ │  $
          
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Modules and Functions
│ │ │ │  
          
│ │ │ │  
          A programming language is not much use if you only can run code from the shell.
│ │ │ │  So here is a small Erlang program. Enter it into a file named tut.erl using a
│ │ │ │  suitable text editor. The file name tut.erl is important, and also that it is
│ │ │ │  in the same directory as the one where you started erl). If you are lucky your
│ │ │ │  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
│ │ │ │  variables are Number, ShoeSize, and Age.
          
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Atoms
│ │ │ │  
          
│ │ │ │  
          Atom is another data type in Erlang. Atoms start with a small letter (see
│ │ │ │  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
│ │ │ │  head clause of convert_length, that is, convert_length({centimeter,X}). It
│ │ │ │  can be seen that {centimeter,X} does not match {inch,5} (the head is the bit
│ │ │ │  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.
          
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Lists
│ │ │ │  
          
│ │ │ │  
          Whereas tuples group things together, it is also needed to represent lists of
│ │ │ │  things. Lists in Erlang are surrounded by square brackets, [ and ]. For
│ │ │ │ -example, a list of the temperatures of various cities in the world can be:
          [{moscow, {c, -10}}, {cape_town, {f, 70}}, {stockholm, {c, -4}},
│ │ │ │ - {paris, {f, 28}}, {london, {f, 36}}]
          Notice that this list was so long that it did not fit on one line. This does not
│ │ │ │ +example, a list of the temperatures of various cities in the world can be:
          [{moscow, {c, -10}}, {cape_town, {f, 70}}, {stockholm, {c, -4}},
│ │ │ │ + {paris, {f, 28}}, {london, {f, 36}}]
          Notice that this list was so long that it did not fit on one line. This does not
│ │ │ │  matter, Erlang allows line breaks at all "sensible places" but not, for example,
│ │ │ │  in the middle of atoms, integers, and others.
          A useful way of looking at parts of lists, is by using |. This is best
│ │ │ │ -explained by an example using the shell:
          17> [First |TheRest] = [1,2,3,4,5].
│ │ │ │ -[1,2,3,4,5]
│ │ │ │ +explained by an example using the shell:
          17> [First |TheRest] = [1,2,3,4,5].
│ │ │ │ +[1,2,3,4,5]
│ │ │ │  18> First.
│ │ │ │  1
│ │ │ │  19> TheRest.
│ │ │ │ -[2,3,4,5]
          To separate the first elements of the list from the rest of the list, | is
│ │ │ │ -used. First has got value 1 and TheRest has got the value [2,3,4,5].
          Another example:
          20> [E1, E2 | R] = [1,2,3,4,5,6,7].
│ │ │ │ -[1,2,3,4,5,6,7]
│ │ │ │ +[2,3,4,5]
          To separate the first elements of the list from the rest of the list, | is
│ │ │ │ +used. First has got value 1 and TheRest has got the value [2,3,4,5].
          Another example:
          20> [E1, E2 | R] = [1,2,3,4,5,6,7].
│ │ │ │ +[1,2,3,4,5,6,7]
│ │ │ │  21> E1.
│ │ │ │  1
│ │ │ │  22> E2.
│ │ │ │  2
│ │ │ │  23> R.
│ │ │ │ -[3,4,5,6,7]
          Here you see the use of | to get the first two elements from the list. If you
│ │ │ │ +[3,4,5,6,7]
          Here you see the use of | to get the first two elements from the list. If you
│ │ │ │  try to get more elements from the list than there are elements in the list, an
│ │ │ │  error is returned. Notice also the special case of the list with no elements,
│ │ │ │ -[]:
          24> [A, B | C] = [1, 2].
│ │ │ │ -[1,2]
│ │ │ │ +[]:
          24> [A, B | C] = [1, 2].
│ │ │ │ +[1,2]
│ │ │ │  25> A.
│ │ │ │  1
│ │ │ │  26> B.
│ │ │ │  2
│ │ │ │  27> C.
│ │ │ │ -[]
          In the previous examples, new variable names are used, instead of reusing the
│ │ │ │ +[]
          In the previous examples, new variable names are used, instead of reusing the
│ │ │ │  old ones: First, TheRest, E1, E2, R, A, B, and C. The reason for
│ │ │ │  this is that a variable can only be given a value once in its context (scope).
│ │ │ │  More about this later.
          The following example shows how to find the length of a list. Enter the
│ │ │ │ -following code in a file named tut4.erl:
          -module(tut4).
│ │ │ │ +following code in a file named tut4.erl:
          -module(tut4).
│ │ │ │  
│ │ │ │ --export([list_length/1]).
│ │ │ │ +-export([list_length/1]).
│ │ │ │  
│ │ │ │ -list_length([]) ->
│ │ │ │ +list_length([]) ->
│ │ │ │      0;
│ │ │ │ -list_length([First | Rest]) ->
│ │ │ │ -    1 + list_length(Rest).
          Compile and test:
          28> c(tut4).
│ │ │ │ -{ok,tut4}
│ │ │ │ -29> tut4:list_length([1,2,3,4,5,6,7]).
│ │ │ │ -7
          Explanation:
          list_length([]) ->
│ │ │ │ -    0;
          The length of an empty list is obviously 0.
          list_length([First | Rest]) ->
│ │ │ │ -    1 + list_length(Rest).
          The length of a list with the first element First and the remaining elements
│ │ │ │ +list_length([First | Rest]) ->
│ │ │ │ +    1 + list_length(Rest).
          Compile and test:
          28> c(tut4).
│ │ │ │ +{ok,tut4}
│ │ │ │ +29> tut4:list_length([1,2,3,4,5,6,7]).
│ │ │ │ +7
          Explanation:
          list_length([]) ->
│ │ │ │ +    0;
          The length of an empty list is obviously 0.
          list_length([First | Rest]) ->
│ │ │ │ +    1 + list_length(Rest).
          The length of a list with the first element First and the remaining elements
│ │ │ │  Rest is 1 + the length of Rest.
          (Advanced readers only: This is not tail recursive, there is a better way to
│ │ │ │  write this function.)
          In general, tuples are used where "records" or "structs" are used in other
│ │ │ │  languages. Also, lists are used when representing things with varying sizes,
│ │ │ │  that is, where linked lists are used in other languages.
          Erlang does not have a string data type. Instead, strings can be represented by
│ │ │ │  lists of Unicode characters. This implies for example that the list [97,98,99]
│ │ │ │  is equivalent to "abc". The Erlang shell is "clever" and guesses what list you
│ │ │ │ -mean and outputs it in what it thinks is the most appropriate form, for example:
          30> [97,98,99].
│ │ │ │ +mean and outputs it in what it thinks is the most appropriate form, for example:
          30> [97,98,99].
│ │ │ │  "abc"
          
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Maps
│ │ │ │  
          
│ │ │ │  
          Maps are a set of key to value associations. These associations are encapsulated
│ │ │ │ -with #{ and }. To create an association from "key" to value 42:
          > #{ "key" => 42 }.
│ │ │ │ -#{"key" => 42}
          Let us jump straight into the deep end with an example using some interesting
│ │ │ │ +with #{ and }. To create an association from "key" to value 42:
          > #{ "key" => 42 }.
│ │ │ │ +#{"key" => 42}
          Let us jump straight into the deep end with an example using some interesting
│ │ │ │  features.
          The following example shows how to calculate alpha blending using maps to
│ │ │ │ -reference color and alpha channels. Enter the code in a file named color.erl):
          -module(color).
│ │ │ │ +reference color and alpha channels. Enter the code in a file named color.erl):
          -module(color).
│ │ │ │  
│ │ │ │ --export([new/4, blend/2]).
│ │ │ │ +-export([new/4, blend/2]).
│ │ │ │  
│ │ │ │ --define(is_channel(V), (is_float(V) andalso V >= 0.0 andalso V =< 1.0)).
│ │ │ │ +-define(is_channel(V), (is_float(V) andalso V >= 0.0 andalso V =< 1.0)).
│ │ │ │  
│ │ │ │ -new(R,G,B,A) when ?is_channel(R), ?is_channel(G),
│ │ │ │ -                  ?is_channel(B), ?is_channel(A) ->
│ │ │ │ -    #{red => R, green => G, blue => B, alpha => A}.
│ │ │ │ -
│ │ │ │ -blend(Src,Dst) ->
│ │ │ │ -    blend(Src,Dst,alpha(Src,Dst)).
│ │ │ │ -
│ │ │ │ -blend(Src,Dst,Alpha) when Alpha > 0.0 ->
│ │ │ │ -    Dst#{
│ │ │ │ -        red   := red(Src,Dst) / Alpha,
│ │ │ │ -        green := green(Src,Dst) / Alpha,
│ │ │ │ -        blue  := blue(Src,Dst) / Alpha,
│ │ │ │ +new(R,G,B,A) when ?is_channel(R), ?is_channel(G),
│ │ │ │ +                  ?is_channel(B), ?is_channel(A) ->
│ │ │ │ +    #{red => R, green => G, blue => B, alpha => A}.
│ │ │ │ +
│ │ │ │ +blend(Src,Dst) ->
│ │ │ │ +    blend(Src,Dst,alpha(Src,Dst)).
│ │ │ │ +
│ │ │ │ +blend(Src,Dst,Alpha) when Alpha > 0.0 ->
│ │ │ │ +    Dst#{
│ │ │ │ +        red   := red(Src,Dst) / Alpha,
│ │ │ │ +        green := green(Src,Dst) / Alpha,
│ │ │ │ +        blue  := blue(Src,Dst) / Alpha,
│ │ │ │          alpha := Alpha
│ │ │ │ -    };
│ │ │ │ -blend(_,Dst,_) ->
│ │ │ │ -    Dst#{
│ │ │ │ +    };
│ │ │ │ +blend(_,Dst,_) ->
│ │ │ │ +    Dst#{
│ │ │ │          red   := 0.0,
│ │ │ │          green := 0.0,
│ │ │ │          blue  := 0.0,
│ │ │ │          alpha := 0.0
│ │ │ │ -    }.
│ │ │ │ +    }.
│ │ │ │  
│ │ │ │ -alpha(#{alpha := SA}, #{alpha := DA}) ->
│ │ │ │ -    SA + DA*(1.0 - SA).
│ │ │ │ +alpha(#{alpha := SA}, #{alpha := DA}) ->
│ │ │ │ +    SA + DA*(1.0 - SA).
│ │ │ │  
│ │ │ │ -red(#{red := SV, alpha := SA}, #{red := DV, alpha := DA}) ->
│ │ │ │ -    SV*SA + DV*DA*(1.0 - SA).
│ │ │ │ -green(#{green := SV, alpha := SA}, #{green := DV, alpha := DA}) ->
│ │ │ │ -    SV*SA + DV*DA*(1.0 - SA).
│ │ │ │ -blue(#{blue := SV, alpha := SA}, #{blue := DV, alpha := DA}) ->
│ │ │ │ -    SV*SA + DV*DA*(1.0 - SA).
          Compile and test:
          > c(color).
│ │ │ │ -{ok,color}
│ │ │ │ -> C1 = color:new(0.3,0.4,0.5,1.0).
│ │ │ │ -#{alpha => 1.0,blue => 0.5,green => 0.4,red => 0.3}
│ │ │ │ -> C2 = color:new(1.0,0.8,0.1,0.3).
│ │ │ │ -#{alpha => 0.3,blue => 0.1,green => 0.8,red => 1.0}
│ │ │ │ -> color:blend(C1,C2).
│ │ │ │ -#{alpha => 1.0,blue => 0.5,green => 0.4,red => 0.3}
│ │ │ │ -> color:blend(C2,C1).
│ │ │ │ -#{alpha => 1.0,blue => 0.38,green => 0.52,red => 0.51}
          This example warrants some explanation:
          -define(is_channel(V), (is_float(V) andalso V >= 0.0 andalso V =< 1.0)).
          First a macro is_channel is defined to help with the guard tests. This is only
│ │ │ │ +red(#{red := SV, alpha := SA}, #{red := DV, alpha := DA}) ->
│ │ │ │ +    SV*SA + DV*DA*(1.0 - SA).
│ │ │ │ +green(#{green := SV, alpha := SA}, #{green := DV, alpha := DA}) ->
│ │ │ │ +    SV*SA + DV*DA*(1.0 - SA).
│ │ │ │ +blue(#{blue := SV, alpha := SA}, #{blue := DV, alpha := DA}) ->
│ │ │ │ +    SV*SA + DV*DA*(1.0 - SA).
          Compile and test:
          > c(color).
│ │ │ │ +{ok,color}
│ │ │ │ +> C1 = color:new(0.3,0.4,0.5,1.0).
│ │ │ │ +#{alpha => 1.0,blue => 0.5,green => 0.4,red => 0.3}
│ │ │ │ +> C2 = color:new(1.0,0.8,0.1,0.3).
│ │ │ │ +#{alpha => 0.3,blue => 0.1,green => 0.8,red => 1.0}
│ │ │ │ +> color:blend(C1,C2).
│ │ │ │ +#{alpha => 1.0,blue => 0.5,green => 0.4,red => 0.3}
│ │ │ │ +> color:blend(C2,C1).
│ │ │ │ +#{alpha => 1.0,blue => 0.38,green => 0.52,red => 0.51}
          This example warrants some explanation:
          -define(is_channel(V), (is_float(V) andalso V >= 0.0 andalso V =< 1.0)).
          First a macro is_channel is defined to help with the guard tests. This is only
│ │ │ │  here for convenience and to reduce syntax cluttering. For more information about
│ │ │ │ -macros, see The Preprocessor.
          new(R,G,B,A) when ?is_channel(R), ?is_channel(G),
│ │ │ │ -                  ?is_channel(B), ?is_channel(A) ->
│ │ │ │ -    #{red => R, green => G, blue => B, alpha => A}.
          The function new/4 creates a new map term and lets the keys red, green,
│ │ │ │ +macros, see The Preprocessor.
          new(R,G,B,A) when ?is_channel(R), ?is_channel(G),
│ │ │ │ +                  ?is_channel(B), ?is_channel(A) ->
│ │ │ │ +    #{red => R, green => G, blue => B, alpha => A}.
          The function new/4 creates a new map term and lets the keys red, green,
│ │ │ │  blue, and alpha be associated with an initial value. In this case, only
│ │ │ │  float values between and including 0.0 and 1.0 are allowed, as ensured by the
│ │ │ │  ?is_channel/1 macro for each argument. Only the => operator is allowed when
│ │ │ │  creating a new map.
          By calling blend/2 on any color term created by new/4, the resulting color
│ │ │ │ -can be calculated as determined by the two map terms.
          The first thing blend/2 does is to calculate the resulting alpha channel:
          alpha(#{alpha := SA}, #{alpha := DA}) ->
│ │ │ │ -    SA + DA*(1.0 - SA).
          The value associated with key alpha is fetched for both arguments using the
│ │ │ │ +can be calculated as determined by the two map terms.
          The first thing blend/2 does is to calculate the resulting alpha channel:
          alpha(#{alpha := SA}, #{alpha := DA}) ->
│ │ │ │ +    SA + DA*(1.0 - SA).
          The value associated with key alpha is fetched for both arguments using the
│ │ │ │  := operator. The other keys in the map are ignored, only the key alpha is
│ │ │ │ -required and checked for.
          This is also the case for functions red/2, blue/2, and green/2.
          red(#{red := SV, alpha := SA}, #{red := DV, alpha := DA}) ->
│ │ │ │ -    SV*SA + DV*DA*(1.0 - SA).
          The difference here is that a check is made for two keys in each map argument.
│ │ │ │ -The other keys are ignored.
          Finally, let us return the resulting color in blend/3:
          blend(Src,Dst,Alpha) when Alpha > 0.0 ->
│ │ │ │ -    Dst#{
│ │ │ │ -        red   := red(Src,Dst) / Alpha,
│ │ │ │ -        green := green(Src,Dst) / Alpha,
│ │ │ │ -        blue  := blue(Src,Dst) / Alpha,
│ │ │ │ +required and checked for.
          This is also the case for functions red/2, blue/2, and green/2.
          red(#{red := SV, alpha := SA}, #{red := DV, alpha := DA}) ->
│ │ │ │ +    SV*SA + DV*DA*(1.0 - SA).
          The difference here is that a check is made for two keys in each map argument.
│ │ │ │ +The other keys are ignored.
          Finally, let us return the resulting color in blend/3:
          blend(Src,Dst,Alpha) when Alpha > 0.0 ->
│ │ │ │ +    Dst#{
│ │ │ │ +        red   := red(Src,Dst) / Alpha,
│ │ │ │ +        green := green(Src,Dst) / Alpha,
│ │ │ │ +        blue  := blue(Src,Dst) / Alpha,
│ │ │ │          alpha := Alpha
│ │ │ │ -    };
          The Dst map is updated with new channel values. The syntax for updating an
│ │ │ │ +    };
          The Dst map is updated with new channel values. The syntax for updating an
│ │ │ │  existing key with a new value is with the := operator.
          
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Standard Modules and Manual Pages
│ │ │ │  
          
│ │ │ │  
          Erlang has many standard modules to help you do things. For example, the module
│ │ │ │ @@ -347,24 +347,24 @@
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Writing Output to a Terminal
│ │ │ │  
│ │ │ │  
          It is nice to be able to do formatted output in examples, so the next example
│ │ │ │  shows a simple way to use the io:format/2 function. Like all other exported
│ │ │ │ -functions, you can test the io:format/2 function in the shell:
          31> io:format("hello world~n", []).
│ │ │ │ +functions, you can test the io:format/2 function in the shell:
          31> io:format("hello world~n", []).
│ │ │ │  hello world
│ │ │ │  ok
│ │ │ │ -32> io:format("this outputs one Erlang term: ~w~n", [hello]).
│ │ │ │ +32> io:format("this outputs one Erlang term: ~w~n", [hello]).
│ │ │ │  this outputs one Erlang term: hello
│ │ │ │  ok
│ │ │ │ -33> io:format("this outputs two Erlang terms: ~w~w~n", [hello, world]).
│ │ │ │ +33> io:format("this outputs two Erlang terms: ~w~w~n", [hello, world]).
│ │ │ │  this outputs two Erlang terms: helloworld
│ │ │ │  ok
│ │ │ │ -34> io:format("this outputs two Erlang terms: ~w ~w~n", [hello, world]).
│ │ │ │ +34> io:format("this outputs two Erlang terms: ~w ~w~n", [hello, world]).
│ │ │ │  this outputs two Erlang terms: hello world
│ │ │ │  ok
          The function io:format/2 (that is, format with two arguments) takes two lists.
│ │ │ │  The first one is nearly always a list written between " ". This list is printed
│ │ │ │  out as it is, except that each ~w is replaced by a term taken in order from the
│ │ │ │  second list. Each ~n is replaced by a new line. The io:format/2 function
│ │ │ │  itself returns the atom ok if everything goes as planned. Like other functions
│ │ │ │  in Erlang, it crashes if an error occurs. This is not a fault in Erlang, it is a
│ │ │ │ @@ -378,34 +378,34 @@
│ │ │ │    A Larger Example
│ │ │ │  
│ │ │ │  
          Now for a larger example to consolidate what you have learnt so far. Assume that
│ │ │ │  you have a list of temperature readings from a number of cities in the world.
│ │ │ │  Some of them are in Celsius and some in Fahrenheit (as in the previous list).
│ │ │ │  First let us convert them all to Celsius, then let us print the data neatly.
          %% This module is in file tut5.erl
│ │ │ │  
│ │ │ │ --module(tut5).
│ │ │ │ --export([format_temps/1]).
│ │ │ │ +-module(tut5).
│ │ │ │ +-export([format_temps/1]).
│ │ │ │  
│ │ │ │  %% Only this function is exported
│ │ │ │ -format_temps([])->                        % No output for an empty list
│ │ │ │ +format_temps([])->                        % No output for an empty list
│ │ │ │      ok;
│ │ │ │ -format_temps([City | Rest]) ->
│ │ │ │ -    print_temp(convert_to_celsius(City)),
│ │ │ │ -    format_temps(Rest).
│ │ │ │ -
│ │ │ │ -convert_to_celsius({Name, {c, Temp}}) ->  % No conversion needed
│ │ │ │ -    {Name, {c, Temp}};
│ │ │ │ -convert_to_celsius({Name, {f, Temp}}) ->  % Do the conversion
│ │ │ │ -    {Name, {c, (Temp - 32) * 5 / 9}}.
│ │ │ │ -
│ │ │ │ -print_temp({Name, {c, Temp}}) ->
│ │ │ │ -    io:format("~-15w ~w c~n", [Name, Temp]).
          35> c(tut5).
│ │ │ │ -{ok,tut5}
│ │ │ │ -36> tut5:format_temps([{moscow, {c, -10}}, {cape_town, {f, 70}},
│ │ │ │ -{stockholm, {c, -4}}, {paris, {f, 28}}, {london, {f, 36}}]).
│ │ │ │ +format_temps([City | Rest]) ->
│ │ │ │ +    print_temp(convert_to_celsius(City)),
│ │ │ │ +    format_temps(Rest).
│ │ │ │ +
│ │ │ │ +convert_to_celsius({Name, {c, Temp}}) ->  % No conversion needed
│ │ │ │ +    {Name, {c, Temp}};
│ │ │ │ +convert_to_celsius({Name, {f, Temp}}) ->  % Do the conversion
│ │ │ │ +    {Name, {c, (Temp - 32) * 5 / 9}}.
│ │ │ │ +
│ │ │ │ +print_temp({Name, {c, Temp}}) ->
│ │ │ │ +    io:format("~-15w ~w c~n", [Name, Temp]).
          35> c(tut5).
│ │ │ │ +{ok,tut5}
│ │ │ │ +36> tut5:format_temps([{moscow, {c, -10}}, {cape_town, {f, 70}},
│ │ │ │ +{stockholm, {c, -4}}, {paris, {f, 28}}, {london, {f, 36}}]).
│ │ │ │  moscow          -10 c
│ │ │ │  cape_town       21.11111111111111 c
│ │ │ │  stockholm       -4 c
│ │ │ │  paris           -2.2222222222222223 c
│ │ │ │  london          2.2222222222222223 c
│ │ │ │  ok
          Before looking at how this program works, notice that a few comments are added
│ │ │ │  to the code. A comment starts with a %-character and goes on to the end of the
│ │ │ │ @@ -433,28 +433,28 @@
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Matching, Guards, and Scope of Variables
│ │ │ │  
│ │ │ │  
          It can be useful to find the maximum and minimum temperature in lists like this.
│ │ │ │  Before extending the program to do this, let us look at functions for finding
│ │ │ │ -the maximum value of the elements in a list:
          -module(tut6).
│ │ │ │ --export([list_max/1]).
│ │ │ │ +the maximum value of the elements in a list:
          -module(tut6).
│ │ │ │ +-export([list_max/1]).
│ │ │ │  
│ │ │ │ -list_max([Head|Rest]) ->
│ │ │ │ -   list_max(Rest, Head).
│ │ │ │ +list_max([Head|Rest]) ->
│ │ │ │ +   list_max(Rest, Head).
│ │ │ │  
│ │ │ │ -list_max([], Res) ->
│ │ │ │ +list_max([], Res) ->
│ │ │ │      Res;
│ │ │ │ -list_max([Head|Rest], Result_so_far) when Head > Result_so_far ->
│ │ │ │ -    list_max(Rest, Head);
│ │ │ │ -list_max([Head|Rest], Result_so_far)  ->
│ │ │ │ -    list_max(Rest, Result_so_far).
          37> c(tut6).
│ │ │ │ -{ok,tut6}
│ │ │ │ -38> tut6:list_max([1,2,3,4,5,7,4,3,2,1]).
│ │ │ │ +list_max([Head|Rest], Result_so_far) when Head > Result_so_far ->
│ │ │ │ +    list_max(Rest, Head);
│ │ │ │ +list_max([Head|Rest], Result_so_far)  ->
│ │ │ │ +    list_max(Rest, Result_so_far).
          37> c(tut6).
│ │ │ │ +{ok,tut6}
│ │ │ │ +38> tut6:list_max([1,2,3,4,5,7,4,3,2,1]).
│ │ │ │  7
          First notice that two functions have the same name, list_max. However, each of
│ │ │ │  these takes a different number of arguments (parameters). In Erlang these are
│ │ │ │  regarded as completely different functions. Where you need to distinguish
│ │ │ │  between these functions, you write Name/Arity, where Name is the function name
│ │ │ │  and Arity is the number of arguments, in this case list_max/1 and
│ │ │ │  list_max/2.
          In this example you walk through a list "carrying" a value, in this case
│ │ │ │  Result_so_far. list_max/1 simply assumes that the max value of the list is
│ │ │ │ @@ -483,180 +483,180 @@
│ │ │ │  5
│ │ │ │  40> M = 6.
│ │ │ │  ** exception error: no match of right hand side value 6
│ │ │ │  41> M = M + 1.
│ │ │ │  ** exception error: no match of right hand side value 6
│ │ │ │  42> N = M + 1.
│ │ │ │  6
          The use of the match operator is particularly useful for pulling apart Erlang
│ │ │ │ -terms and creating new ones.
          43> {X, Y} = {paris, {f, 28}}.
│ │ │ │ -{paris,{f,28}}
│ │ │ │ +terms and creating new ones.
          43> {X, Y} = {paris, {f, 28}}.
│ │ │ │ +{paris,{f,28}}
│ │ │ │  44> X.
│ │ │ │  paris
│ │ │ │  45> Y.
│ │ │ │ -{f,28}
          Here X gets the value paris and Y the value {f,28}.
          If you try to do the same again with another city, an error is returned:
          46> {X, Y} = {london, {f, 36}}.
│ │ │ │ +{f,28}
          Here X gets the value paris and Y the value {f,28}.
          If you try to do the same again with another city, an error is returned:
          46> {X, Y} = {london, {f, 36}}.
│ │ │ │  ** exception error: no match of right hand side value {london,{f,36}}
          Variables can also be used to improve the readability of programs. For example,
│ │ │ │ -in function list_max/2 above, you can write:
          list_max([Head|Rest], Result_so_far) when Head > Result_so_far ->
│ │ │ │ +in function list_max/2 above, you can write:
          list_max([Head|Rest], Result_so_far) when Head > Result_so_far ->
│ │ │ │      New_result_far = Head,
│ │ │ │ -    list_max(Rest, New_result_far);
          This is possibly a little clearer.
          
│ │ │ │ +    list_max(Rest, New_result_far);
          This is possibly a little clearer.
          
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    More About Lists
│ │ │ │  
          
│ │ │ │ -
          Remember that the | operator can be used to get the head of a list:
          47> [M1|T1] = [paris, london, rome].
│ │ │ │ -[paris,london,rome]
│ │ │ │ +
          Remember that the | operator can be used to get the head of a list:
          47> [M1|T1] = [paris, london, rome].
│ │ │ │ +[paris,london,rome]
│ │ │ │  48> M1.
│ │ │ │  paris
│ │ │ │  49> T1.
│ │ │ │ -[london,rome]
          The | operator can also be used to add a head to a list:
          50> L1 = [madrid | T1].
│ │ │ │ -[madrid,london,rome]
│ │ │ │ +[london,rome]
          The | operator can also be used to add a head to a list:
          50> L1 = [madrid | T1].
│ │ │ │ +[madrid,london,rome]
│ │ │ │  51> L1.
│ │ │ │ -[madrid,london,rome]
          Now an example of this when working with lists - reversing the order of a list:
          -module(tut8).
│ │ │ │ +[madrid,london,rome]
          Now an example of this when working with lists - reversing the order of a list:
          -module(tut8).
│ │ │ │  
│ │ │ │ --export([reverse/1]).
│ │ │ │ +-export([reverse/1]).
│ │ │ │  
│ │ │ │ -reverse(List) ->
│ │ │ │ -    reverse(List, []).
│ │ │ │ +reverse(List) ->
│ │ │ │ +    reverse(List, []).
│ │ │ │  
│ │ │ │ -reverse([Head | Rest], Reversed_List) ->
│ │ │ │ -    reverse(Rest, [Head | Reversed_List]);
│ │ │ │ -reverse([], Reversed_List) ->
│ │ │ │ -    Reversed_List.
          52> c(tut8).
│ │ │ │ -{ok,tut8}
│ │ │ │ -53> tut8:reverse([1,2,3]).
│ │ │ │ -[3,2,1]
          Consider how Reversed_List is built. It starts as [], then successively the
│ │ │ │ +reverse([Head | Rest], Reversed_List) ->
│ │ │ │ +    reverse(Rest, [Head | Reversed_List]);
│ │ │ │ +reverse([], Reversed_List) ->
│ │ │ │ +    Reversed_List.
          52> c(tut8).
│ │ │ │ +{ok,tut8}
│ │ │ │ +53> tut8:reverse([1,2,3]).
│ │ │ │ +[3,2,1]
          Consider how Reversed_List is built. It starts as [], then successively the
│ │ │ │  heads are taken off of the list to be reversed and added to the the
│ │ │ │ -Reversed_List, as shown in the following:
          reverse([1|2,3], []) =>
│ │ │ │ -    reverse([2,3], [1|[]])
│ │ │ │ +Reversed_List, as shown in the following:
          reverse([1|2,3], []) =>
│ │ │ │ +    reverse([2,3], [1|[]])
│ │ │ │  
│ │ │ │ -reverse([2|3], [1]) =>
│ │ │ │ -    reverse([3], [2|[1])
│ │ │ │ +reverse([2|3], [1]) =>
│ │ │ │ +    reverse([3], [2|[1])
│ │ │ │  
│ │ │ │ -reverse([3|[]], [2,1]) =>
│ │ │ │ -    reverse([], [3|[2,1]])
│ │ │ │ +reverse([3|[]], [2,1]) =>
│ │ │ │ +    reverse([], [3|[2,1]])
│ │ │ │  
│ │ │ │ -reverse([], [3,2,1]) =>
│ │ │ │ -    [3,2,1]
          The module lists contains many functions for manipulating lists, for example,
│ │ │ │ +reverse([], [3,2,1]) =>
│ │ │ │ +    [3,2,1]
          The module lists contains many functions for manipulating lists, for example,
│ │ │ │  for reversing them. So before writing a list-manipulating function it is a good
│ │ │ │  idea to check if one not already is written for you (see the lists manual
│ │ │ │  page in STDLIB).
          Now let us get back to the cities and temperatures, but take a more structured
│ │ │ │ -approach this time. First let us convert the whole list to Celsius as follows:
          -module(tut7).
│ │ │ │ --export([format_temps/1]).
│ │ │ │ +approach this time. First let us convert the whole list to Celsius as follows:
          -module(tut7).
│ │ │ │ +-export([format_temps/1]).
│ │ │ │  
│ │ │ │ -format_temps(List_of_cities) ->
│ │ │ │ -    convert_list_to_c(List_of_cities).
│ │ │ │ +format_temps(List_of_cities) ->
│ │ │ │ +    convert_list_to_c(List_of_cities).
│ │ │ │  
│ │ │ │ -convert_list_to_c([{Name, {f, F}} | Rest]) ->
│ │ │ │ -    Converted_City = {Name, {c, (F -32)* 5 / 9}},
│ │ │ │ -    [Converted_City | convert_list_to_c(Rest)];
│ │ │ │ -
│ │ │ │ -convert_list_to_c([City | Rest]) ->
│ │ │ │ -    [City | convert_list_to_c(Rest)];
│ │ │ │ -
│ │ │ │ -convert_list_to_c([]) ->
│ │ │ │ -    [].
          Test the function:
          54> c(tut7).
│ │ │ │ -{ok, tut7}.
│ │ │ │ -55> tut7:format_temps([{moscow, {c, -10}}, {cape_town, {f, 70}},
│ │ │ │ -{stockholm, {c, -4}}, {paris, {f, 28}}, {london, {f, 36}}]).
│ │ │ │ -[{moscow,{c,-10}},
│ │ │ │ - {cape_town,{c,21.11111111111111}},
│ │ │ │ - {stockholm,{c,-4}},
│ │ │ │ - {paris,{c,-2.2222222222222223}},
│ │ │ │ - {london,{c,2.2222222222222223}}]
          Explanation:
          format_temps(List_of_cities) ->
│ │ │ │ -    convert_list_to_c(List_of_cities).
          Here format_temps/1 calls convert_list_to_c/1. convert_list_to_c/1 takes
│ │ │ │ +convert_list_to_c([{Name, {f, F}} | Rest]) ->
│ │ │ │ +    Converted_City = {Name, {c, (F -32)* 5 / 9}},
│ │ │ │ +    [Converted_City | convert_list_to_c(Rest)];
│ │ │ │ +
│ │ │ │ +convert_list_to_c([City | Rest]) ->
│ │ │ │ +    [City | convert_list_to_c(Rest)];
│ │ │ │ +
│ │ │ │ +convert_list_to_c([]) ->
│ │ │ │ +    [].
          Test the function:
          54> c(tut7).
│ │ │ │ +{ok, tut7}.
│ │ │ │ +55> tut7:format_temps([{moscow, {c, -10}}, {cape_town, {f, 70}},
│ │ │ │ +{stockholm, {c, -4}}, {paris, {f, 28}}, {london, {f, 36}}]).
│ │ │ │ +[{moscow,{c,-10}},
│ │ │ │ + {cape_town,{c,21.11111111111111}},
│ │ │ │ + {stockholm,{c,-4}},
│ │ │ │ + {paris,{c,-2.2222222222222223}},
│ │ │ │ + {london,{c,2.2222222222222223}}]
          Explanation:
          format_temps(List_of_cities) ->
│ │ │ │ +    convert_list_to_c(List_of_cities).
          Here format_temps/1 calls convert_list_to_c/1. convert_list_to_c/1 takes
│ │ │ │  off the head of the List_of_cities, converts it to Celsius if needed. The |
│ │ │ │ -operator is used to add the (maybe) converted to the converted rest of the list:
          [Converted_City | convert_list_to_c(Rest)];
          or:
          [City | convert_list_to_c(Rest)];
          This is done until the end of the list is reached, that is, the list is empty:
          convert_list_to_c([]) ->
│ │ │ │ -    [].
          Now when the list is converted, a function to print it is added:
          -module(tut7).
│ │ │ │ --export([format_temps/1]).
│ │ │ │ -
│ │ │ │ -format_temps(List_of_cities) ->
│ │ │ │ -    Converted_List = convert_list_to_c(List_of_cities),
│ │ │ │ -    print_temp(Converted_List).
│ │ │ │ -
│ │ │ │ -convert_list_to_c([{Name, {f, F}} | Rest]) ->
│ │ │ │ -    Converted_City = {Name, {c, (F -32)* 5 / 9}},
│ │ │ │ -    [Converted_City | convert_list_to_c(Rest)];
│ │ │ │ -
│ │ │ │ -convert_list_to_c([City | Rest]) ->
│ │ │ │ -    [City | convert_list_to_c(Rest)];
│ │ │ │ -
│ │ │ │ -convert_list_to_c([]) ->
│ │ │ │ -    [].
│ │ │ │ -
│ │ │ │ -print_temp([{Name, {c, Temp}} | Rest]) ->
│ │ │ │ -    io:format("~-15w ~w c~n", [Name, Temp]),
│ │ │ │ -    print_temp(Rest);
│ │ │ │ -print_temp([]) ->
│ │ │ │ -    ok.
          56> c(tut7).
│ │ │ │ -{ok,tut7}
│ │ │ │ -57> tut7:format_temps([{moscow, {c, -10}}, {cape_town, {f, 70}},
│ │ │ │ -{stockholm, {c, -4}}, {paris, {f, 28}}, {london, {f, 36}}]).
│ │ │ │ +operator is used to add the (maybe) converted to the converted rest of the list:
          [Converted_City | convert_list_to_c(Rest)];
          or:
          [City | convert_list_to_c(Rest)];
          This is done until the end of the list is reached, that is, the list is empty:
          convert_list_to_c([]) ->
│ │ │ │ +    [].
          Now when the list is converted, a function to print it is added:
          -module(tut7).
│ │ │ │ +-export([format_temps/1]).
│ │ │ │ +
│ │ │ │ +format_temps(List_of_cities) ->
│ │ │ │ +    Converted_List = convert_list_to_c(List_of_cities),
│ │ │ │ +    print_temp(Converted_List).
│ │ │ │ +
│ │ │ │ +convert_list_to_c([{Name, {f, F}} | Rest]) ->
│ │ │ │ +    Converted_City = {Name, {c, (F -32)* 5 / 9}},
│ │ │ │ +    [Converted_City | convert_list_to_c(Rest)];
│ │ │ │ +
│ │ │ │ +convert_list_to_c([City | Rest]) ->
│ │ │ │ +    [City | convert_list_to_c(Rest)];
│ │ │ │ +
│ │ │ │ +convert_list_to_c([]) ->
│ │ │ │ +    [].
│ │ │ │ +
│ │ │ │ +print_temp([{Name, {c, Temp}} | Rest]) ->
│ │ │ │ +    io:format("~-15w ~w c~n", [Name, Temp]),
│ │ │ │ +    print_temp(Rest);
│ │ │ │ +print_temp([]) ->
│ │ │ │ +    ok.
          56> c(tut7).
│ │ │ │ +{ok,tut7}
│ │ │ │ +57> tut7:format_temps([{moscow, {c, -10}}, {cape_town, {f, 70}},
│ │ │ │ +{stockholm, {c, -4}}, {paris, {f, 28}}, {london, {f, 36}}]).
│ │ │ │  moscow          -10 c
│ │ │ │  cape_town       21.11111111111111 c
│ │ │ │  stockholm       -4 c
│ │ │ │  paris           -2.2222222222222223 c
│ │ │ │  london          2.2222222222222223 c
│ │ │ │  ok
          Now a function has to be added to find the cities with the maximum and minimum
│ │ │ │  temperatures. The following program is not the most efficient way of doing this
│ │ │ │  as you walk through the list of cities four times. But it is better to first
│ │ │ │  strive for clarity and correctness and to make programs efficient only if
│ │ │ │ -needed.
          -module(tut7).
│ │ │ │ --export([format_temps/1]).
│ │ │ │ +needed.
          -module(tut7).
│ │ │ │ +-export([format_temps/1]).
│ │ │ │  
│ │ │ │ -format_temps(List_of_cities) ->
│ │ │ │ -    Converted_List = convert_list_to_c(List_of_cities),
│ │ │ │ -    print_temp(Converted_List),
│ │ │ │ -    {Max_city, Min_city} = find_max_and_min(Converted_List),
│ │ │ │ -    print_max_and_min(Max_city, Min_city).
│ │ │ │ -
│ │ │ │ -convert_list_to_c([{Name, {f, Temp}} | Rest]) ->
│ │ │ │ -    Converted_City = {Name, {c, (Temp -32)* 5 / 9}},
│ │ │ │ -    [Converted_City | convert_list_to_c(Rest)];
│ │ │ │ -
│ │ │ │ -convert_list_to_c([City | Rest]) ->
│ │ │ │ -    [City | convert_list_to_c(Rest)];
│ │ │ │ -
│ │ │ │ -convert_list_to_c([]) ->
│ │ │ │ -    [].
│ │ │ │ -
│ │ │ │ -print_temp([{Name, {c, Temp}} | Rest]) ->
│ │ │ │ -    io:format("~-15w ~w c~n", [Name, Temp]),
│ │ │ │ -    print_temp(Rest);
│ │ │ │ -print_temp([]) ->
│ │ │ │ +format_temps(List_of_cities) ->
│ │ │ │ +    Converted_List = convert_list_to_c(List_of_cities),
│ │ │ │ +    print_temp(Converted_List),
│ │ │ │ +    {Max_city, Min_city} = find_max_and_min(Converted_List),
│ │ │ │ +    print_max_and_min(Max_city, Min_city).
│ │ │ │ +
│ │ │ │ +convert_list_to_c([{Name, {f, Temp}} | Rest]) ->
│ │ │ │ +    Converted_City = {Name, {c, (Temp -32)* 5 / 9}},
│ │ │ │ +    [Converted_City | convert_list_to_c(Rest)];
│ │ │ │ +
│ │ │ │ +convert_list_to_c([City | Rest]) ->
│ │ │ │ +    [City | convert_list_to_c(Rest)];
│ │ │ │ +
│ │ │ │ +convert_list_to_c([]) ->
│ │ │ │ +    [].
│ │ │ │ +
│ │ │ │ +print_temp([{Name, {c, Temp}} | Rest]) ->
│ │ │ │ +    io:format("~-15w ~w c~n", [Name, Temp]),
│ │ │ │ +    print_temp(Rest);
│ │ │ │ +print_temp([]) ->
│ │ │ │      ok.
│ │ │ │  
│ │ │ │ -find_max_and_min([City | Rest]) ->
│ │ │ │ -    find_max_and_min(Rest, City, City).
│ │ │ │ +find_max_and_min([City | Rest]) ->
│ │ │ │ +    find_max_and_min(Rest, City, City).
│ │ │ │  
│ │ │ │ -find_max_and_min([{Name, {c, Temp}} | Rest],
│ │ │ │ -         {Max_Name, {c, Max_Temp}},
│ │ │ │ -         {Min_Name, {c, Min_Temp}}) ->
│ │ │ │ +find_max_and_min([{Name, {c, Temp}} | Rest],
│ │ │ │ +         {Max_Name, {c, Max_Temp}},
│ │ │ │ +         {Min_Name, {c, Min_Temp}}) ->
│ │ │ │      if
│ │ │ │          Temp > Max_Temp ->
│ │ │ │ -            Max_City = {Name, {c, Temp}};           % Change
│ │ │ │ +            Max_City = {Name, {c, Temp}};           % Change
│ │ │ │          true ->
│ │ │ │ -            Max_City = {Max_Name, {c, Max_Temp}} % Unchanged
│ │ │ │ +            Max_City = {Max_Name, {c, Max_Temp}} % Unchanged
│ │ │ │      end,
│ │ │ │      if
│ │ │ │           Temp < Min_Temp ->
│ │ │ │ -            Min_City = {Name, {c, Temp}};           % Change
│ │ │ │ +            Min_City = {Name, {c, Temp}};           % Change
│ │ │ │          true ->
│ │ │ │ -            Min_City = {Min_Name, {c, Min_Temp}} % Unchanged
│ │ │ │ +            Min_City = {Min_Name, {c, Min_Temp}} % Unchanged
│ │ │ │      end,
│ │ │ │ -    find_max_and_min(Rest, Max_City, Min_City);
│ │ │ │ +    find_max_and_min(Rest, Max_City, Min_City);
│ │ │ │  
│ │ │ │ -find_max_and_min([], Max_City, Min_City) ->
│ │ │ │ -    {Max_City, Min_City}.
│ │ │ │ +find_max_and_min([], Max_City, Min_City) ->
│ │ │ │ +    {Max_City, Min_City}.
│ │ │ │  
│ │ │ │ -print_max_and_min({Max_name, {c, Max_temp}}, {Min_name, {c, Min_temp}}) ->
│ │ │ │ -    io:format("Max temperature was ~w c in ~w~n", [Max_temp, Max_name]),
│ │ │ │ -    io:format("Min temperature was ~w c in ~w~n", [Min_temp, Min_name]).
          58> c(tut7).
│ │ │ │ -{ok, tut7}
│ │ │ │ -59> tut7:format_temps([{moscow, {c, -10}}, {cape_town, {f, 70}},
│ │ │ │ -{stockholm, {c, -4}}, {paris, {f, 28}}, {london, {f, 36}}]).
│ │ │ │ +print_max_and_min({Max_name, {c, Max_temp}}, {Min_name, {c, Min_temp}}) ->
│ │ │ │ +    io:format("Max temperature was ~w c in ~w~n", [Max_temp, Max_name]),
│ │ │ │ +    io:format("Min temperature was ~w c in ~w~n", [Min_temp, Min_name]).
          58> c(tut7).
│ │ │ │ +{ok, tut7}
│ │ │ │ +59> tut7:format_temps([{moscow, {c, -10}}, {cape_town, {f, 70}},
│ │ │ │ +{stockholm, {c, -4}}, {paris, {f, 28}}, {london, {f, 36}}]).
│ │ │ │  moscow          -10 c
│ │ │ │  cape_town       21.11111111111111 c
│ │ │ │  stockholm       -4 c
│ │ │ │  paris           -2.2222222222222223 c
│ │ │ │  london          2.2222222222222223 c
│ │ │ │  Max temperature was 21.11111111111111 c in cape_town
│ │ │ │  Min temperature was -10 c in moscow
│ │ │ │ @@ -678,88 +678,88 @@
│ │ │ │          Action 4
│ │ │ │  end
          Notice that there is no ; before end. Conditions do the same as guards, that
│ │ │ │  is, tests that succeed or fail. Erlang starts at the top and tests until it
│ │ │ │  finds a condition that succeeds. Then it evaluates (performs) the action
│ │ │ │  following the condition and ignores all other conditions and actions before the
│ │ │ │  end. If no condition matches, a run-time failure occurs. A condition that
│ │ │ │  always succeeds is the atom true. This is often used last in an if, meaning,
│ │ │ │ -do the action following the true if all other conditions have failed.
          The following is a short program to show the workings of if.
          -module(tut9).
│ │ │ │ --export([test_if/2]).
│ │ │ │ +do the action following the true if all other conditions have failed.
          The following is a short program to show the workings of if.
          -module(tut9).
│ │ │ │ +-export([test_if/2]).
│ │ │ │  
│ │ │ │ -test_if(A, B) ->
│ │ │ │ +test_if(A, B) ->
│ │ │ │      if
│ │ │ │          A == 5 ->
│ │ │ │ -            io:format("A == 5~n", []),
│ │ │ │ +            io:format("A == 5~n", []),
│ │ │ │              a_equals_5;
│ │ │ │          B == 6 ->
│ │ │ │ -            io:format("B == 6~n", []),
│ │ │ │ +            io:format("B == 6~n", []),
│ │ │ │              b_equals_6;
│ │ │ │          A == 2, B == 3 ->                      %That is A equals 2 and B equals 3
│ │ │ │ -            io:format("A == 2, B == 3~n", []),
│ │ │ │ +            io:format("A == 2, B == 3~n", []),
│ │ │ │              a_equals_2_b_equals_3;
│ │ │ │          A == 1 ; B == 7 ->                     %That is A equals 1 or B equals 7
│ │ │ │ -            io:format("A == 1 ; B == 7~n", []),
│ │ │ │ +            io:format("A == 1 ; B == 7~n", []),
│ │ │ │              a_equals_1_or_b_equals_7
│ │ │ │ -    end.
          Testing this program gives:
          60> c(tut9).
│ │ │ │ -{ok,tut9}
│ │ │ │ -61> tut9:test_if(5,33).
│ │ │ │ +    end.
          Testing this program gives:
          60> c(tut9).
│ │ │ │ +{ok,tut9}
│ │ │ │ +61> tut9:test_if(5,33).
│ │ │ │  A == 5
│ │ │ │  a_equals_5
│ │ │ │ -62> tut9:test_if(33,6).
│ │ │ │ +62> tut9:test_if(33,6).
│ │ │ │  B == 6
│ │ │ │  b_equals_6
│ │ │ │ -63> tut9:test_if(2, 3).
│ │ │ │ +63> tut9:test_if(2, 3).
│ │ │ │  A == 2, B == 3
│ │ │ │  a_equals_2_b_equals_3
│ │ │ │ -64> tut9:test_if(1, 33).
│ │ │ │ +64> tut9:test_if(1, 33).
│ │ │ │  A == 1 ; B == 7
│ │ │ │  a_equals_1_or_b_equals_7
│ │ │ │ -65> tut9:test_if(33, 7).
│ │ │ │ +65> tut9:test_if(33, 7).
│ │ │ │  A == 1 ; B == 7
│ │ │ │  a_equals_1_or_b_equals_7
│ │ │ │ -66> tut9:test_if(33, 33).
│ │ │ │ +66> tut9:test_if(33, 33).
│ │ │ │  ** exception error: no true branch found when evaluating an if expression
│ │ │ │       in function  tut9:test_if/2 (tut9.erl, line 5)
          Notice that tut9:test_if(33,33) does not cause any condition to succeed. This
│ │ │ │  leads to the run time error if_clause, here nicely formatted by the shell. See
│ │ │ │  Guard Sequences for details of the many guard tests
│ │ │ │  available.
          case is another construct in Erlang. Recall that the convert_length function
│ │ │ │ -was written as:
          convert_length({centimeter, X}) ->
│ │ │ │ -    {inch, X / 2.54};
│ │ │ │ -convert_length({inch, Y}) ->
│ │ │ │ -    {centimeter, Y * 2.54}.
          The same program can also be written as:
          -module(tut10).
│ │ │ │ --export([convert_length/1]).
│ │ │ │ +was written as:
          convert_length({centimeter, X}) ->
│ │ │ │ +    {inch, X / 2.54};
│ │ │ │ +convert_length({inch, Y}) ->
│ │ │ │ +    {centimeter, Y * 2.54}.
          The same program can also be written as:
          -module(tut10).
│ │ │ │ +-export([convert_length/1]).
│ │ │ │  
│ │ │ │ -convert_length(Length) ->
│ │ │ │ +convert_length(Length) ->
│ │ │ │      case Length of
│ │ │ │ -        {centimeter, X} ->
│ │ │ │ -            {inch, X / 2.54};
│ │ │ │ -        {inch, Y} ->
│ │ │ │ -            {centimeter, Y * 2.54}
│ │ │ │ -    end.
          67> c(tut10).
│ │ │ │ -{ok,tut10}
│ │ │ │ -68> tut10:convert_length({inch, 6}).
│ │ │ │ -{centimeter,15.24}
│ │ │ │ -69> tut10:convert_length({centimeter, 2.5}).
│ │ │ │ -{inch,0.984251968503937}
          Both case and if have return values, that is, in the above example case
│ │ │ │ +        {centimeter, X} ->
│ │ │ │ +            {inch, X / 2.54};
│ │ │ │ +        {inch, Y} ->
│ │ │ │ +            {centimeter, Y * 2.54}
│ │ │ │ +    end.
          67> c(tut10).
│ │ │ │ +{ok,tut10}
│ │ │ │ +68> tut10:convert_length({inch, 6}).
│ │ │ │ +{centimeter,15.24}
│ │ │ │ +69> tut10:convert_length({centimeter, 2.5}).
│ │ │ │ +{inch,0.984251968503937}
          Both case and if have return values, that is, in the above example case
│ │ │ │  returned either {inch,X/2.54} or {centimeter,Y*2.54}. The behaviour of
│ │ │ │  case can also be modified by using guards. The following example clarifies
│ │ │ │  this. It tells us the length of a month, given the year. The year must be known,
│ │ │ │ -since February has 29 days in a leap year.
          -module(tut11).
│ │ │ │ --export([month_length/2]).
│ │ │ │ +since February has 29 days in a leap year.
          -module(tut11).
│ │ │ │ +-export([month_length/2]).
│ │ │ │  
│ │ │ │ -month_length(Year, Month) ->
│ │ │ │ +month_length(Year, Month) ->
│ │ │ │      %% All years divisible by 400 are leap
│ │ │ │      %% Years divisible by 100 are not leap (except the 400 rule above)
│ │ │ │      %% Years divisible by 4 are leap (except the 100 rule above)
│ │ │ │      Leap = if
│ │ │ │ -        trunc(Year / 400) * 400 == Year ->
│ │ │ │ +        trunc(Year / 400) * 400 == Year ->
│ │ │ │              leap;
│ │ │ │ -        trunc(Year / 100) * 100 == Year ->
│ │ │ │ +        trunc(Year / 100) * 100 == Year ->
│ │ │ │              not_leap;
│ │ │ │ -        trunc(Year / 4) * 4 == Year ->
│ │ │ │ +        trunc(Year / 4) * 4 == Year ->
│ │ │ │              leap;
│ │ │ │          true ->
│ │ │ │              not_leap
│ │ │ │      end,
│ │ │ │      case Month of
│ │ │ │          sep -> 30;
│ │ │ │          apr -> 30;
│ │ │ │ @@ -770,151 +770,151 @@
│ │ │ │          jan -> 31;
│ │ │ │          mar -> 31;
│ │ │ │          may -> 31;
│ │ │ │          jul -> 31;
│ │ │ │          aug -> 31;
│ │ │ │          oct -> 31;
│ │ │ │          dec -> 31
│ │ │ │ -    end.
          70> c(tut11).
│ │ │ │ -{ok,tut11}
│ │ │ │ -71> tut11:month_length(2004, feb).
│ │ │ │ +    end.
          70> c(tut11).
│ │ │ │ +{ok,tut11}
│ │ │ │ +71> tut11:month_length(2004, feb).
│ │ │ │  29
│ │ │ │ -72> tut11:month_length(2003, feb).
│ │ │ │ +72> tut11:month_length(2003, feb).
│ │ │ │  28
│ │ │ │ -73> tut11:month_length(1947, aug).
│ │ │ │ +73> tut11:month_length(1947, aug).
│ │ │ │  31
          
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Built-In Functions (BIFs)
│ │ │ │  
          
│ │ │ │  
          BIFs are functions that for some reason are built-in to the Erlang virtual
│ │ │ │  machine. BIFs often implement functionality that is impossible or is too
│ │ │ │  inefficient to implement in Erlang. Some BIFs can be called using the function
│ │ │ │  name only but they are by default belonging to the erlang module. For example,
│ │ │ │  the call to the BIF trunc below is equivalent to a call to erlang:trunc.
          As shown, first it is checked if a year is leap. If a year is divisible by 400,
│ │ │ │  it is a leap year. To determine this, first divide the year by 400 and use the
│ │ │ │  BIF trunc (more about this later) to cut off any decimals. Then multiply by
│ │ │ │  400 again and see if the same value is returned again. For example, year 2004:
          2004 / 400 = 5.01
│ │ │ │ -trunc(5.01) = 5
│ │ │ │ +trunc(5.01) = 5
│ │ │ │  5 * 400 = 2000
          2000 is not the same as 2004, so 2004 is not divisible by 400. Year 2000:
          2000 / 400 = 5.0
│ │ │ │ -trunc(5.0) = 5
│ │ │ │ +trunc(5.0) = 5
│ │ │ │  5 * 400 = 2000
          That is, a leap year. The next two trunc-tests evaluate if the year is
│ │ │ │  divisible by 100 or 4 in the same way. The first if returns leap or
│ │ │ │  not_leap, which lands up in the variable Leap. This variable is used in the
│ │ │ │  guard for feb in the following case that tells us how long the month is.
          This example showed the use of trunc. It is easier to use the Erlang operator
│ │ │ │  rem that gives the remainder after division, for example:
          74> 2004 rem 400.
│ │ │ │ -4
          So instead of writing:
          trunc(Year / 400) * 400 == Year ->
│ │ │ │ +4
          So instead of writing:
          trunc(Year / 400) * 400 == Year ->
│ │ │ │      leap;
          it can be written:
          Year rem 400 == 0 ->
│ │ │ │      leap;
          There are many other BIFs such as trunc. Only a few BIFs can be used in
│ │ │ │  guards, and you cannot use functions you have defined yourself in guards. (see
│ │ │ │  Guard Sequences) (For advanced readers: This is to
│ │ │ │  ensure that guards do not have side effects.) Let us play with a few of these
│ │ │ │ -functions in the shell:
          75> trunc(5.6).
│ │ │ │ +functions in the shell:
          75> trunc(5.6).
│ │ │ │  5
│ │ │ │ -76> round(5.6).
│ │ │ │ +76> round(5.6).
│ │ │ │  6
│ │ │ │ -77> length([a,b,c,d]).
│ │ │ │ +77> length([a,b,c,d]).
│ │ │ │  4
│ │ │ │ -78> float(5).
│ │ │ │ +78> float(5).
│ │ │ │  5.0
│ │ │ │ -79> is_atom(hello).
│ │ │ │ +79> is_atom(hello).
│ │ │ │  true
│ │ │ │ -80> is_atom("hello").
│ │ │ │ +80> is_atom("hello").
│ │ │ │  false
│ │ │ │ -81> is_tuple({paris, {c, 30}}).
│ │ │ │ +81> is_tuple({paris, {c, 30}}).
│ │ │ │  true
│ │ │ │ -82> is_tuple([paris, {c, 30}]).
│ │ │ │ +82> is_tuple([paris, {c, 30}]).
│ │ │ │  false
          All of these can be used in guards. Now for some BIFs that cannot be used in
│ │ │ │ -guards:
          83> atom_to_list(hello).
│ │ │ │ +guards:
          83> atom_to_list(hello).
│ │ │ │  "hello"
│ │ │ │ -84> list_to_atom("goodbye").
│ │ │ │ +84> list_to_atom("goodbye").
│ │ │ │  goodbye
│ │ │ │ -85> integer_to_list(22).
│ │ │ │ +85> integer_to_list(22).
│ │ │ │  "22"
          These three BIFs do conversions that would be difficult (or impossible) to do in
│ │ │ │  Erlang.
          
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Higher-Order Functions (Funs)
│ │ │ │  
          
│ │ │ │  
          Erlang, like most modern functional programming languages, has higher-order
│ │ │ │ -functions. Here is an example using the shell:
          86> Xf = fun(X) -> X * 2 end.
│ │ │ │ +functions. Here is an example using the shell:
          86> Xf = fun(X) -> X * 2 end.
│ │ │ │  #Fun<erl_eval.5.123085357>
│ │ │ │ -87> Xf(5).
│ │ │ │ +87> Xf(5).
│ │ │ │  10
          Here is defined a function that doubles the value of a number and assigned this
│ │ │ │  function to a variable. Thus Xf(5) returns value 10. Two useful functions when
│ │ │ │ -working with lists are foreach and map, which are defined as follows:
          foreach(Fun, [First|Rest]) ->
│ │ │ │ -    Fun(First),
│ │ │ │ -    foreach(Fun, Rest);
│ │ │ │ -foreach(Fun, []) ->
│ │ │ │ +working with lists are foreach and map, which are defined as follows:
          foreach(Fun, [First|Rest]) ->
│ │ │ │ +    Fun(First),
│ │ │ │ +    foreach(Fun, Rest);
│ │ │ │ +foreach(Fun, []) ->
│ │ │ │      ok.
│ │ │ │  
│ │ │ │ -map(Fun, [First|Rest]) ->
│ │ │ │ -    [Fun(First)|map(Fun,Rest)];
│ │ │ │ -map(Fun, []) ->
│ │ │ │ -    [].
          These two functions are provided in the standard module lists. foreach takes
│ │ │ │ +map(Fun, [First|Rest]) ->
│ │ │ │ +    [Fun(First)|map(Fun,Rest)];
│ │ │ │ +map(Fun, []) ->
│ │ │ │ +    [].
          These two functions are provided in the standard module lists. foreach takes
│ │ │ │  a list and applies a fun to every element in the list. map creates a new list
│ │ │ │  by applying a fun to every element in a list. Going back to the shell, map is
│ │ │ │ -used and a fun to add 3 to every element of a list:
          88> Add_3 = fun(X) -> X + 3 end.
│ │ │ │ +used and a fun to add 3 to every element of a list:
          88> Add_3 = fun(X) -> X + 3 end.
│ │ │ │  #Fun<erl_eval.5.123085357>
│ │ │ │ -89> lists:map(Add_3, [1,2,3]).
│ │ │ │ -[4,5,6]
          Let us (again) print the temperatures in a list of cities:
          90> Print_City = fun({City, {X, Temp}}) -> io:format("~-15w ~w ~w~n",
│ │ │ │ -[City, X, Temp]) end.
│ │ │ │ +89> lists:map(Add_3, [1,2,3]).
│ │ │ │ +[4,5,6]
          Let us (again) print the temperatures in a list of cities:
          90> Print_City = fun({City, {X, Temp}}) -> io:format("~-15w ~w ~w~n",
│ │ │ │ +[City, X, Temp]) end.
│ │ │ │  #Fun<erl_eval.5.123085357>
│ │ │ │ -91> lists:foreach(Print_City, [{moscow, {c, -10}}, {cape_town, {f, 70}},
│ │ │ │ -{stockholm, {c, -4}}, {paris, {f, 28}}, {london, {f, 36}}]).
│ │ │ │ +91> lists:foreach(Print_City, [{moscow, {c, -10}}, {cape_town, {f, 70}},
│ │ │ │ +{stockholm, {c, -4}}, {paris, {f, 28}}, {london, {f, 36}}]).
│ │ │ │  moscow          c -10
│ │ │ │  cape_town       f 70
│ │ │ │  stockholm       c -4
│ │ │ │  paris           f 28
│ │ │ │  london          f 36
│ │ │ │  ok
          Let us now define a fun that can be used to go through a list of cities and
│ │ │ │ -temperatures and transform them all to Celsius.
          -module(tut13).
│ │ │ │ +temperatures and transform them all to Celsius.
          -module(tut13).
│ │ │ │  
│ │ │ │ --export([convert_list_to_c/1]).
│ │ │ │ +-export([convert_list_to_c/1]).
│ │ │ │  
│ │ │ │ -convert_to_c({Name, {f, Temp}}) ->
│ │ │ │ -    {Name, {c, trunc((Temp - 32) * 5 / 9)}};
│ │ │ │ -convert_to_c({Name, {c, Temp}}) ->
│ │ │ │ -    {Name, {c, Temp}}.
│ │ │ │ -
│ │ │ │ -convert_list_to_c(List) ->
│ │ │ │ -    lists:map(fun convert_to_c/1, List).
          92> tut13:convert_list_to_c([{moscow, {c, -10}}, {cape_town, {f, 70}},
│ │ │ │ -{stockholm, {c, -4}}, {paris, {f, 28}}, {london, {f, 36}}]).
│ │ │ │ -[{moscow,{c,-10}},
│ │ │ │ - {cape_town,{c,21}},
│ │ │ │ - {stockholm,{c,-4}},
│ │ │ │ - {paris,{c,-2}},
│ │ │ │ - {london,{c,2}}]
          The convert_to_c function is the same as before, but here it is used as a fun:
          lists:map(fun convert_to_c/1, List)
          When a function defined elsewhere is used as a fun, it can be referred to as
│ │ │ │ +convert_to_c({Name, {f, Temp}}) ->
│ │ │ │ +    {Name, {c, trunc((Temp - 32) * 5 / 9)}};
│ │ │ │ +convert_to_c({Name, {c, Temp}}) ->
│ │ │ │ +    {Name, {c, Temp}}.
│ │ │ │ +
│ │ │ │ +convert_list_to_c(List) ->
│ │ │ │ +    lists:map(fun convert_to_c/1, List).
          92> tut13:convert_list_to_c([{moscow, {c, -10}}, {cape_town, {f, 70}},
│ │ │ │ +{stockholm, {c, -4}}, {paris, {f, 28}}, {london, {f, 36}}]).
│ │ │ │ +[{moscow,{c,-10}},
│ │ │ │ + {cape_town,{c,21}},
│ │ │ │ + {stockholm,{c,-4}},
│ │ │ │ + {paris,{c,-2}},
│ │ │ │ + {london,{c,2}}]
          The convert_to_c function is the same as before, but here it is used as a fun:
          lists:map(fun convert_to_c/1, List)
          When a function defined elsewhere is used as a fun, it can be referred to as
│ │ │ │  Function/Arity (remember that Arity = number of arguments). So in the
│ │ │ │  map-call lists:map(fun convert_to_c/1, List) is written. As shown,
│ │ │ │  convert_list_to_c becomes much shorter and easier to understand.
          The standard module lists also contains a function sort(Fun, List) where
│ │ │ │  Fun is a fun with two arguments. This fun returns true if the first argument
│ │ │ │  is less than the second argument, or else false. Sorting is added to the
│ │ │ │ -convert_list_to_c:
          -module(tut13).
│ │ │ │ +convert_list_to_c:
          -module(tut13).
│ │ │ │  
│ │ │ │ --export([convert_list_to_c/1]).
│ │ │ │ +-export([convert_list_to_c/1]).
│ │ │ │  
│ │ │ │ -convert_to_c({Name, {f, Temp}}) ->
│ │ │ │ -    {Name, {c, trunc((Temp - 32) * 5 / 9)}};
│ │ │ │ -convert_to_c({Name, {c, Temp}}) ->
│ │ │ │ -    {Name, {c, Temp}}.
│ │ │ │ -
│ │ │ │ -convert_list_to_c(List) ->
│ │ │ │ -    New_list = lists:map(fun convert_to_c/1, List),
│ │ │ │ -    lists:sort(fun({_, {c, Temp1}}, {_, {c, Temp2}}) ->
│ │ │ │ -                       Temp1 < Temp2 end, New_list).
          93> c(tut13).
│ │ │ │ -{ok,tut13}
│ │ │ │ -94> tut13:convert_list_to_c([{moscow, {c, -10}}, {cape_town, {f, 70}},
│ │ │ │ -{stockholm, {c, -4}}, {paris, {f, 28}}, {london, {f, 36}}]).
│ │ │ │ -[{moscow,{c,-10}},
│ │ │ │ - {stockholm,{c,-4}},
│ │ │ │ - {paris,{c,-2}},
│ │ │ │ - {london,{c,2}},
│ │ │ │ - {cape_town,{c,21}}]
          In sort the fun is used:
          fun({_, {c, Temp1}}, {_, {c, Temp2}}) -> Temp1 < Temp2 end,
          Here the concept of an anonymous variable _ is introduced. This is simply
│ │ │ │ +convert_to_c({Name, {f, Temp}}) ->
│ │ │ │ +    {Name, {c, trunc((Temp - 32) * 5 / 9)}};
│ │ │ │ +convert_to_c({Name, {c, Temp}}) ->
│ │ │ │ +    {Name, {c, Temp}}.
│ │ │ │ +
│ │ │ │ +convert_list_to_c(List) ->
│ │ │ │ +    New_list = lists:map(fun convert_to_c/1, List),
│ │ │ │ +    lists:sort(fun({_, {c, Temp1}}, {_, {c, Temp2}}) ->
│ │ │ │ +                       Temp1 < Temp2 end, New_list).
          93> c(tut13).
│ │ │ │ +{ok,tut13}
│ │ │ │ +94> tut13:convert_list_to_c([{moscow, {c, -10}}, {cape_town, {f, 70}},
│ │ │ │ +{stockholm, {c, -4}}, {paris, {f, 28}}, {london, {f, 36}}]).
│ │ │ │ +[{moscow,{c,-10}},
│ │ │ │ + {stockholm,{c,-4}},
│ │ │ │ + {paris,{c,-2}},
│ │ │ │ + {london,{c,2}},
│ │ │ │ + {cape_town,{c,21}}]
          In sort the fun is used:
          fun({_, {c, Temp1}}, {_, {c, Temp2}}) -> Temp1 < Temp2 end,
          Here the concept of an anonymous variable _ is introduced. This is simply
│ │ │ │  shorthand for a variable that gets a value, but the value is ignored. This can
│ │ │ │  be used anywhere suitable, not just in funs. Temp1 < Temp2 returns true if
│ │ │ │  Temp1 is less than Temp2.
          
│ │ │ │  
│ │ │ │    
│ │ │ │  
│ │ │ ├── OEBPS/robustness.xhtml
│ │ │ │ @@ -33,68 +33,68 @@
│ │ │ │  
│ │ │ │  
          Before improving the messenger program, let us look at some general principles,
│ │ │ │  using the ping pong program as an example. Recall that when "ping" finishes, it
│ │ │ │  tells "pong" that it has done so by sending the atom finished as a message to
│ │ │ │  "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
│ │ │ │  Pong received ping
│ │ │ │  Pong received ping
│ │ │ │  Pong timed out
          And the following is seen on (ping@gollum):
          (ping@gollum)1> tut19:start_ping(pong@kosken).
│ │ │ │  <0.36.0>
│ │ │ │  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
│ │ │ │  user out of the messenger system if they have not accessed it for, say, ten
│ │ │ │  minutes.
          
│ │ │ │    
│ │ │ │      
│ │ │ │ @@ -114,96 +114,96 @@
│ │ │ │  something called a signal to all the processes it has links to.
          The signal carries information about the pid it was sent from and the exit
│ │ │ │  reason.
          The default behaviour of a process that receives a normal exit is to ignore the
│ │ │ │  signal.
          The default behaviour in the two other cases (that is, abnormal exit) above is
│ │ │ │  to:
          • Bypass all messages to the receiving process.
          • Kill the receiving process.
          • Propagate the same error signal to the links of the killed process.
          In this way you can connect all processes in a transaction together using links.
│ │ │ │  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
│ │ │ │  Pong received ping
│ │ │ │  Ping received pong
│ │ │ │  Pong received ping
│ │ │ │  Ping received pong
          This is a slight modification of the ping pong program where both processes are
│ │ │ │  spawned from the same start/1 function, and the "ping" process can be spawned
│ │ │ │  on a separate node. Notice the use of the link BIF. "Ping" calls
│ │ │ │  exit(ping) when it finishes and this causes an exit signal to be
│ │ │ │  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) ->
│ │ │ │ -    PongPID = spawn(tut21, pong, []),
│ │ │ │ -    spawn(Ping_Node, tut21, ping, [3, PongPID]).
          (s1@bill)1> tut21:start(s2@gollum).
│ │ │ │ +start(Ping_Node) ->
│ │ │ │ +    PongPID = spawn(tut21, pong, []),
│ │ │ │ +    spawn(Ping_Node, tut21, ping, [3, PongPID]).
          (s1@bill)1> tut21:start(s2@gollum).
│ │ │ │  <3820.39.0>
│ │ │ │  Pong received ping
│ │ │ │  Ping received pong
│ │ │ │  Pong received ping
│ │ │ │  Ping received pong
│ │ │ │  Pong received ping
│ │ │ │  Ping received pong
│ │ │ │ @@ -256,135 +256,135 @@
│ │ │ │  %%% Started: messenger:client(Server_Node, Name)
│ │ │ │  %%% To client: logoff
│ │ │ │  %%% To client: {message_to, ToName, Message}
│ │ │ │  %%%
│ │ │ │  %%% Configuration: change the server_node() function to return the
│ │ │ │  %%% name of the node where the messenger server runs
│ │ │ │  
│ │ │ │ --module(messenger).
│ │ │ │ --export([start_server/0, server/0,
│ │ │ │ -         logon/1, logoff/0, message/2, client/2]).
│ │ │ │ +-module(messenger).
│ │ │ │ +-export([start_server/0, server/0,
│ │ │ │ +         logon/1, logoff/0, message/2, client/2]).
│ │ │ │  
│ │ │ │  %%% Change the function below to return the name of the node where the
│ │ │ │  %%% messenger server runs
│ │ │ │ -server_node() ->
│ │ │ │ +server_node() ->
│ │ │ │      messenger@super.
│ │ │ │  
│ │ │ │  %%% This is the server process for the "messenger"
│ │ │ │  %%% the user list has the format [{ClientPid1, Name1},{ClientPid22, Name2},...]
│ │ │ │ -server() ->
│ │ │ │ -    process_flag(trap_exit, true),
│ │ │ │ -    server([]).
│ │ │ │ +server() ->
│ │ │ │ +    process_flag(trap_exit, true),
│ │ │ │ +    server([]).
│ │ │ │  
│ │ │ │ -server(User_List) ->
│ │ │ │ +server(User_List) ->
│ │ │ │      receive
│ │ │ │ -        {From, logon, 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);
│ │ │ │ -        {From, message_to, To, Message} ->
│ │ │ │ -            server_transfer(From, To, Message, User_List),
│ │ │ │ -            io:format("list is now: ~p~n", [User_List]),
│ │ │ │ -            server(User_List)
│ │ │ │ +        {From, logon, 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);
│ │ │ │ +        {From, message_to, To, Message} ->
│ │ │ │ +            server_transfer(From, To, Message, User_List),
│ │ │ │ +            io:format("list is now: ~p~n", [User_List]),
│ │ │ │ +            server(User_List)
│ │ │ │      end.
│ │ │ │  
│ │ │ │  %%% Start the server
│ │ │ │ -start_server() ->
│ │ │ │ -    register(messenger, spawn(messenger, server, [])).
│ │ │ │ +start_server() ->
│ │ │ │ +    register(messenger, spawn(messenger, server, [])).
│ │ │ │  
│ │ │ │  %%% Server adds a new user to the user list
│ │ │ │ -server_logon(From, Name, User_List) ->
│ │ │ │ +server_logon(From, Name, User_List) ->
│ │ │ │      %% check if logged on anywhere else
│ │ │ │ -    case lists:keymember(Name, 2, User_List) of
│ │ │ │ +    case lists:keymember(Name, 2, User_List) of
│ │ │ │          true ->
│ │ │ │ -            From ! {messenger, stop, user_exists_at_other_node},  %reject logon
│ │ │ │ +            From ! {messenger, stop, user_exists_at_other_node},  %reject logon
│ │ │ │              User_List;
│ │ │ │          false ->
│ │ │ │ -            From ! {messenger, logged_on},
│ │ │ │ -            link(From),
│ │ │ │ -            [{From, Name} | User_List]        %add user to the list
│ │ │ │ +            From ! {messenger, logged_on},
│ │ │ │ +            link(From),
│ │ │ │ +            [{From, Name} | User_List]        %add user to the list
│ │ │ │      end.
│ │ │ │  
│ │ │ │  %%% Server deletes a user from the user list
│ │ │ │ -server_logoff(From, User_List) ->
│ │ │ │ -    lists:keydelete(From, 1, User_List).
│ │ │ │ +server_logoff(From, User_List) ->
│ │ │ │ +    lists:keydelete(From, 1, User_List).
│ │ │ │  
│ │ │ │  
│ │ │ │  %%% Server transfers a message between user
│ │ │ │ -server_transfer(From, To, Message, User_List) ->
│ │ │ │ +server_transfer(From, To, Message, User_List) ->
│ │ │ │      %% check that the user is logged on and who he is
│ │ │ │ -    case lists:keysearch(From, 1, User_List) of
│ │ │ │ +    case lists:keysearch(From, 1, User_List) of
│ │ │ │          false ->
│ │ │ │ -            From ! {messenger, stop, you_are_not_logged_on};
│ │ │ │ -        {value, {_, Name}} ->
│ │ │ │ -            server_transfer(From, Name, To, Message, User_List)
│ │ │ │ +            From ! {messenger, stop, you_are_not_logged_on};
│ │ │ │ +        {value, {_, Name}} ->
│ │ │ │ +            server_transfer(From, Name, To, Message, User_List)
│ │ │ │      end.
│ │ │ │  
│ │ │ │  %%% If the user exists, send the message
│ │ │ │ -server_transfer(From, Name, To, Message, User_List) ->
│ │ │ │ +server_transfer(From, Name, To, Message, User_List) ->
│ │ │ │      %% Find the receiver and send the message
│ │ │ │ -    case lists:keysearch(To, 2, User_List) of
│ │ │ │ +    case lists:keysearch(To, 2, User_List) of
│ │ │ │          false ->
│ │ │ │ -            From ! {messenger, receiver_not_found};
│ │ │ │ -        {value, {ToPid, To}} ->
│ │ │ │ -            ToPid ! {message_from, Name, Message},
│ │ │ │ -            From ! {messenger, sent}
│ │ │ │ +            From ! {messenger, receiver_not_found};
│ │ │ │ +        {value, {ToPid, To}} ->
│ │ │ │ +            ToPid ! {message_from, Name, Message},
│ │ │ │ +            From ! {messenger, sent}
│ │ │ │      end.
│ │ │ │  
│ │ │ │  %%% User Commands
│ │ │ │ -logon(Name) ->
│ │ │ │ -    case whereis(mess_client) of
│ │ │ │ +logon(Name) ->
│ │ │ │ +    case whereis(mess_client) of
│ │ │ │          undefined ->
│ │ │ │ -            register(mess_client,
│ │ │ │ -                     spawn(messenger, client, [server_node(), Name]));
│ │ │ │ +            register(mess_client,
│ │ │ │ +                     spawn(messenger, 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, ToName, Message},
│ │ │ │ +        _ -> mess_client ! {message_to, ToName, Message},
│ │ │ │               ok
│ │ │ │  end.
│ │ │ │  
│ │ │ │  %%% The client process which runs on each user node
│ │ │ │ -client(Server_Node, Name) ->
│ │ │ │ -    {messenger, Server_Node} ! {self(), logon, Name},
│ │ │ │ -    await_result(),
│ │ │ │ -    client(Server_Node).
│ │ │ │ +client(Server_Node, Name) ->
│ │ │ │ +    {messenger, Server_Node} ! {self(), logon, Name},
│ │ │ │ +    await_result(),
│ │ │ │ +    client(Server_Node).
│ │ │ │  
│ │ │ │ -client(Server_Node) ->
│ │ │ │ +client(Server_Node) ->
│ │ │ │      receive
│ │ │ │          logoff ->
│ │ │ │ -            exit(normal);
│ │ │ │ -        {message_to, ToName, Message} ->
│ │ │ │ -            {messenger, Server_Node} ! {self(), message_to, ToName, Message},
│ │ │ │ -            await_result();
│ │ │ │ -        {message_from, FromName, Message} ->
│ │ │ │ -            io:format("Message from ~p: ~p~n", [FromName, Message])
│ │ │ │ +            exit(normal);
│ │ │ │ +        {message_to, ToName, Message} ->
│ │ │ │ +            {messenger, Server_Node} ! {self(), message_to, ToName, 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
│ │ │ │ -        {messenger, stop, Why} -> % Stop the client
│ │ │ │ -            io:format("~p~n", [Why]),
│ │ │ │ -            exit(normal);
│ │ │ │ -        {messenger, What} ->  % Normal response
│ │ │ │ -            io:format("~p~n", [What])
│ │ │ │ +        {messenger, stop, Why} -> % Stop the client
│ │ │ │ +            io:format("~p~n", [Why]),
│ │ │ │ +            exit(normal);
│ │ │ │ +        {messenger, What} ->  % Normal response
│ │ │ │ +            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.
          The following changes are added:
          The messenger server traps exits. If it receives an exit signal,
│ │ │ │  {'EXIT',From,Reason}, this means that a client process has terminated or is
│ │ │ │  unreachable for one of the following reasons:
          • The user has logged off (the "logoff" message is removed).
          • The network connection to the client is broken.
          • The node on which the client process resides has gone down.
          • The client processes has done some illegal operation.
          If an exit signal is received as above, the tuple {From,Name} is deleted from
│ │ │ │  the servers User_List using the server_logoff function. If the node on which
│ │ │ │  the server runs goes down, an exit signal (automatically generated by the
│ │ │ │  system) is sent to all of the client processes:
│ │ │ │  {'EXIT',MessengerPID,noconnection} causing all the client processes to
│ │ │ ├── OEBPS/release_structure.xhtml
│ │ │ │ @@ -41,37 +41,37 @@
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Release Resource File
│ │ │ │  
          
│ │ │ │  
          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"}]
│ │ │ │ +}.
          
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Generating Boot Scripts
│ │ │ │  
          
│ │ │ │  
          systools in the SASL application includes tools to build and check
│ │ │ │  releases. The functions read the .rel and .app files and perform
│ │ │ │ @@ -95,17 +95,17 @@
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Creating a Release Package
│ │ │ │  
│ │ │ │  
          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
│ │ │ │  lib/kernel-9.2.4/ebin/application.beam
│ │ │ │  ...
│ │ │ │  lib/stdlib-5.2.3/ebin/stdlib.app
│ │ │ │  lib/stdlib-5.2.3/ebin/argparse.beam
│ │ │ ├── OEBPS/release_handling.xhtml
│ │ │ │ @@ -128,38 +128,38 @@
│ │ │ │    update
│ │ │ │  
│ │ │ │  
          If a more complex change has been made, for example, a change to the format of
│ │ │ │  the internal state of a gen_server, simple code replacement is not sufficient.
│ │ │ │  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
│ │ │ │  instead.
          The release handler suspends, asks for code change, and resumes processes by
│ │ │ │  calling the functions sys:suspend/1,2, sys:change_code/4,5, and
│ │ │ │  sys:resume/1,2, respectively.
          
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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.
          
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Application Instructions
│ │ │ │ @@ -246,60 +246,60 @@
│ │ │ │  .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
│ │ │ │  typical upgrade/downgrade cases.
        Example: Consider the release ch_rel-1 from
│ │ │ │  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}]}]
│ │ │ │ +}.
        
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Release Upgrade File
│ │ │ │  
        
│ │ │ │  
        To define how to upgrade/downgrade between the new version and previous versions
│ │ │ │  of a release, a release upgrade file, or in short .relup file, is to be
│ │ │ │ @@ -310,22 +310,22 @@
│ │ │ │  are to be added and deleted, and which applications that must be upgraded and/or
│ │ │ │  downgraded. The instructions for this are fetched from the .appup files and
│ │ │ │  transformed into a single list of low-level instructions in the right order.
        If the relup file is relatively simple, it can be created manually. It is only
│ │ │ │  to contain low-level instructions.
        For details about the syntax and contents of the release upgrade file, see
│ │ │ │  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
│ │ │ │  path, as well as the .appup and (new) .beam files. The code path can be
│ │ │ │  extended by using the option path:
        1> systools:make_relup("ch_rel-2", ["ch_rel-1"], ["ch_rel-1"],
│ │ │ │  [{path,["../ch_rel-1",
│ │ │ │  "../ch_rel-1/lib/ch_app-1/ebin"]}]).
│ │ │ │ @@ -338,25 +338,25 @@
│ │ │ │  
        When you have made a new version of a release, a release package can be created
│ │ │ │  with this new version and transferred to the target environment.
        To install the new version of the release in runtime, the release
│ │ │ │  handler is used. This is a process belonging to the SASL application,
│ │ │ │  which handles unpacking, installation, and removal of release
│ │ │ │  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
          
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Example (continued from the previous sections)
│ │ │ │ @@ -367,17 +367,17 @@
│ │ │ │  is needed, the file is to contain the empty list:
          [].
          Step 2) Start the system as a simple target system. In reality, it is to be
│ │ │ │  started as an embedded system. However, using erl with the correct boot script
│ │ │ │  and config file is enough for illustration purposes:
          % cd $ROOT
│ │ │ │  % bin/erl -boot $ROOT/releases/A/start -config $ROOT/releases/A/sys
│ │ │ │  ...
          $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
│ │ │ │  lib/kernel-9.2.4/ebin/application.beam
│ │ │ │  ...
│ │ │ │  lib/stdlib-5.2.3/ebin/stdlib.app
│ │ │ │  lib/stdlib-5.2.3/ebin/argparse.beam
│ │ │ │ @@ -390,31 +390,31 @@
│ │ │ │  lib/ch_app-2/ebin/ch_sup.beam
│ │ │ │  lib/ch_app-2/ebin/ch3.beam
│ │ │ │  releases/B/start.boot
│ │ │ │  releases/B/relup
│ │ │ │  releases/B/sys.config
│ │ │ │  releases/B/ch_rel-2.rel
│ │ │ │  releases/ch_rel-2.rel
          Step 4) Copy the release package ch_rel-2.tar.gz to the $ROOT/releases
│ │ │ │ -directory.
          Step 5) In the running target system, unpack the release package:
          1> release_handler:unpack_release("ch_rel-2").
│ │ │ │ -{ok,"B"}
          The new application version ch_app-2 is installed under $ROOT/lib next to
│ │ │ │ +directory.
          Step 5) In the running target system, unpack the release package:
          1> release_handler:unpack_release("ch_rel-2").
│ │ │ │ +{ok,"B"}
          The new application version ch_app-2 is installed under $ROOT/lib next to
│ │ │ │  ch_app-1. The kernel, stdlib, and sasl directories are not affected, as
│ │ │ │  they have not changed.
          Under $ROOT/releases, a new directory B is created, containing
│ │ │ │ -ch_rel-2.rel, start.boot, sys.config, and relup.
          Step 6) Check if the function ch3:available/0 is available:
          2> ch3:available().
│ │ │ │ +ch_rel-2.rel, start.boot, sys.config, and relup.
          Step 6) Check if the function ch3:available/0 is available:
          2> ch3:available().
│ │ │ │  ** exception error: undefined function ch3:available/0
          Step 7) Install the new release. The instructions in $ROOT/releases/B/relup
│ │ │ │  are executed one by one, resulting in the new version of ch3 being loaded. The
│ │ │ │ -function ch3:available/0 is now available:
          3> release_handler:install_release("B").
│ │ │ │ -{ok,"A",[]}
│ │ │ │ -4> ch3:available().
│ │ │ │ +function ch3:available/0 is now available:
          3> release_handler:install_release("B").
│ │ │ │ +{ok,"A",[]}
│ │ │ │ +4> ch3:available().
│ │ │ │  3
│ │ │ │ -5> code:which(ch3).
│ │ │ │ +5> code:which(ch3).
│ │ │ │  ".../lib/ch_app-2/ebin/ch3.beam"
│ │ │ │ -6> code:which(ch_sup).
│ │ │ │ +6> code:which(ch_sup).
│ │ │ │  ".../lib/ch_app-1/ebin/ch_sup.beam"
          Processes in ch_app for which code have not been updated, for example, the
│ │ │ │  supervisor, are still evaluating code from ch_app-1.
          Step 8) If the target system is now rebooted, it uses version "A" again. The
│ │ │ │ -"B" version must be made permanent, to be used when the system is rebooted.
          7> release_handler:make_permanent("B").
│ │ │ │ +"B" version must be made permanent, to be used when the system is rebooted.
          7> release_handler:make_permanent("B").
│ │ │ │  ok
          
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Updating Application Specifications
│ │ │ │  
          
│ │ │ │  
          When a new version of a release is installed, the application specifications are
│ │ │ │ @@ -423,14 +423,14 @@
│ │ │ │  boot script is generated from the same .rel file as is used to build the
│ │ │ │  release package itself.
          Specifically, the application configuration parameters are automatically updated
│ │ │ │  according to (in increasing priority order):
          • The data in the boot script, fetched from the new application resource file
│ │ │ │  App.app
          • The new sys.config
          • Command-line arguments -App Par Val
          This means that parameter values set in the other system configuration files and
│ │ │ │  values set using application:set_env/3 are disregarded.
          When an installed release is made permanent, the system process init is set to
│ │ │ │  point out the new sys.config.
          After the installation, the application controller compares the old and new
│ │ │ │  configuration parameters for all running applications and call the callback
│ │ │ │ -function:
          Module:config_change(Changed, New, Removed)
          • Module is the application callback module as defined by the mod key in the
│ │ │ │ +function:
            Module:config_change(Changed, New, Removed)
            • Module is the application callback module as defined by the mod key in the
│ │ │ │  .app file.
            • Changed and New are lists of {Par,Val} for all changed and added
│ │ │ │  configuration parameters, respectively.
            • Removed is a list of all parameters Par that have been removed.
            The function is optional and can be omitted when implementing an application
│ │ │ │  callback module.
            
│ │ │ │  
│ │ │ │    
│ │ │ │  
│ │ │ ├── OEBPS/ref_man_records.xhtml
│ │ │ │ @@ -28,17 +28,17 @@
│ │ │ │      
│ │ │ │    
│ │ │ │    Defining Records
│ │ │ │  
          
│ │ │ │  
          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
│ │ │ │  definition is placed in an include file.
          Change
          Starting from Erlang/OTP 26, records can be defined in the Erlang shell
│ │ │ │  using the syntax described in this section. In earlier releases, it was
│ │ │ │  necessary to use the shell built-in function rd/2.
          
│ │ │ │    
│ │ │ │ @@ -48,32 +48,32 @@
│ │ │ │  
          
│ │ │ │  
          The following expression creates a new Name record where the value of each
│ │ │ │  field FieldI is the value of evaluating the corresponding expression ExprI:
          #Name{Field1=Expr1, ..., FieldK=ExprK}
          The fields can be in any order, not necessarily the same order as in the record
│ │ │ │  definition, and fields can be omitted. Omitted fields get their respective
│ │ │ │  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).
          
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Updating Records
│ │ │ │  
          
│ │ │ │  
          Expr#Name{Field1=Expr1, ..., FieldK=ExprK}
          Expr is to evaluate to a Name record. A copy of this record is returned,
│ │ │ │  with the value of each specified field FieldI changed to the value of
│ │ │ │ @@ -83,48 +83,48 @@
│ │ │ │      
│ │ │ │    
│ │ │ │    Records in Guards
│ │ │ │  
        
│ │ │ │  
        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.
        
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Records in Patterns
│ │ │ │  
        
│ │ │ │  
        A pattern that matches a certain record is created in the same way as a record
│ │ │ │  is created:
        #Name{Field1=Expr1, ..., FieldK=ExprK}
        In this case, one or more of Expr1 ... ExprK can be unbound variables.
        
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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.
        
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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.
        
│ │ │ │  
│ │ │ │    
│ │ │ │  
│ │ │ ├── OEBPS/ref_man_processes.xhtml
│ │ │ │ @@ -30,18 +30,18 @@
│ │ │ │  (grow and shrink dynamically) with small memory footprint, fast to create and
│ │ │ │  terminate, and the scheduling overhead is low.
        
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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:
        
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Registered Processes
│ │ │ │  
        
│ │ │ │  
        Besides addressing a process by using its pid, there are also BIFs for
│ │ │ ├── OEBPS/ref_man_functions.xhtml
│ │ │ │ @@ -25,51 +25,51 @@
│ │ │ │      
│ │ │ │    
│ │ │ │    Function Declaration Syntax
│ │ │ │  
│ │ │ │  
        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
│ │ │ │  are two different functions.
        A function named f in module mod and with arity N is often denoted as
│ │ │ │  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
        
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Function Evaluation
│ │ │ │  
        
│ │ │ │  
        When a function M:F/N is called, first the code for the function is located.
│ │ │ │  If the function cannot be found, an undef runtime error occurs. Notice that
│ │ │ │  the function must be exported to be visible outside the module it is defined in.
        If the function is found, the function clauses are scanned sequentially until a
│ │ │ │  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
│ │ │ │  and the body is evaluated:
        1 * fact(0) =>
│ │ │ │  1 * 1 =>
│ │ │ │  1
        Evaluation has succeed and mod:fact(1) returns 1.
        If mod:fact/1 is called with a negative number as argument, no clause head
│ │ │ │  matches. A function_clause runtime error occurs.
        
│ │ │ │ @@ -78,17 +78,17 @@
│ │ │ │    
│ │ │ │    Tail recursion
│ │ │ │  
        
│ │ │ │  
        If the last expression of a function body is a function call, a
│ │ │ │  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).
        
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Built-In Functions (BIFs)
│ │ │ │  
        
│ │ │ │ @@ -96,14 +96,14 @@
│ │ │ │  system. BIFs do things that are difficult or impossible to implement
│ │ │ │  in Erlang. Most of the BIFs belong to module erlang, but there
│ │ │ │  are also BIFs belonging to a few other modules, for example lists
│ │ │ │  and ets.
        The most commonly used BIFs belonging to erlang are auto-imported. They do
│ │ │ │  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"
        
│ │ │ │  
│ │ │ │    
│ │ │ │  
│ │ │ ├── OEBPS/records_macros.xhtml
│ │ │ │ @@ -29,40 +29,40 @@
│ │ │ │  
│ │ │ │  
        To illustrate this, the messenger example from the previous section is divided
│ │ │ │  into the following five files:
        • mess_config.hrl
          Header file for configuration data
        • mess_interface.hrl
          Interface definitions between the client and the messenger
        • user_interface.erl
          Functions for the user interface
        • mess_client.erl
          Functions for the client side of the messenger
        • mess_server.erl
          Functions for the server side of the messenger
        While doing this, the message passing interface between the shell, the client,
│ │ │ │  and the server is cleaned up and is defined using records. Also, macros are
│ │ │ │  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----
│ │ │ │  
│ │ │ │  %%% Message interface between client and server and client shell for
│ │ │ │  %%% 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----
│ │ │ │  
│ │ │ │  %%% User interface to the messenger program
│ │ │ │  %%% login(Name)
│ │ │ │  %%%     One user at a time can log in from each Erlang node in the
│ │ │ │ @@ -75,177 +75,177 @@
│ │ │ │  %%%     Logs off anybody at that node
│ │ │ │  
│ │ │ │  %%% message(ToName, Message)
│ │ │ │  %%%     sends Message to ToName. Error messages if the user of this
│ │ │ │  %%%     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.
│ │ │ │  
│ │ │ │  %%%----END FILE----
        %%%----FILE mess_client.erl----
│ │ │ │  
│ │ │ │  %%% 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) ->
│ │ │ │      %% check if logged on anywhere else
│ │ │ │ -    case lists:keymember(Name, 2, User_List) of
│ │ │ │ +    case lists:keymember(Name, 2, User_List) of
│ │ │ │          true ->
│ │ │ │ -            From ! #abort_client{message=user_exists_at_other_node},
│ │ │ │ +            From ! #abort_client{message=user_exists_at_other_node},
│ │ │ │              User_List;
│ │ │ │          false ->
│ │ │ │ -            From ! #server_reply{message=logged_on},
│ │ │ │ -            link(From),
│ │ │ │ -            [{From, Name} | User_List]        %add user to the list
│ │ │ │ +            From ! #server_reply{message=logged_on},
│ │ │ │ +            link(From),
│ │ │ │ +            [{From, Name} | User_List]        %add user to the list
│ │ │ │      end.
│ │ │ │  
│ │ │ │  %%% Server deletes a user from the user list
│ │ │ │ -server_logoff(From, User_List) ->
│ │ │ │ -    lists:keydelete(From, 1, User_List).
│ │ │ │ +server_logoff(From, User_List) ->
│ │ │ │ +    lists:keydelete(From, 1, User_List).
│ │ │ │  
│ │ │ │  %%% Server transfers a message between user
│ │ │ │ -server_transfer(From, To, Message, User_List) ->
│ │ │ │ +server_transfer(From, To, Message, User_List) ->
│ │ │ │      %% check that the user is logged on and who he is
│ │ │ │ -    case lists:keysearch(From, 1, User_List) of
│ │ │ │ +    case lists:keysearch(From, 1, User_List) of
│ │ │ │          false ->
│ │ │ │ -            From ! #abort_client{message=you_are_not_logged_on};
│ │ │ │ -        {value, {_, Name}} ->
│ │ │ │ -            server_transfer(From, Name, To, Message, User_List)
│ │ │ │ +            From ! #abort_client{message=you_are_not_logged_on};
│ │ │ │ +        {value, {_, Name}} ->
│ │ │ │ +            server_transfer(From, Name, To, Message, User_List)
│ │ │ │      end.
│ │ │ │  %%% If the user exists, send the message
│ │ │ │ -server_transfer(From, Name, To, Message, User_List) ->
│ │ │ │ +server_transfer(From, Name, To, Message, User_List) ->
│ │ │ │      %% Find the receiver and send the message
│ │ │ │ -    case lists:keysearch(To, 2, User_List) of
│ │ │ │ +    case lists:keysearch(To, 2, User_List) of
│ │ │ │          false ->
│ │ │ │ -            From ! #server_reply{message=receiver_not_found};
│ │ │ │ -        {value, {ToPid, To}} ->
│ │ │ │ -            ToPid ! #message_from{from_name=Name, message=Message},
│ │ │ │ -            From !  #server_reply{message=sent}
│ │ │ │ +            From ! #server_reply{message=receiver_not_found};
│ │ │ │ +        {value, {ToPid, To}} ->
│ │ │ │ +            ToPid ! #message_from{from_name=Name, message=Message},
│ │ │ │ +            From !  #server_reply{message=sent}
│ │ │ │      end.
│ │ │ │  
│ │ │ │  %%%----END FILE---
        
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Header Files
│ │ │ │  
        
│ │ │ │  
        As shown above, some files have extension .hrl. These are header files that
│ │ │ │ -are included in the .erl files by:
        -include("File_Name").
        for example:
        -include("mess_interface.hrl").
        In the case above the file is fetched from the same directory as all the other
│ │ │ │ +are included in the .erl files by:
        -include("File_Name").
        for example:
        -include("mess_interface.hrl").
        In the case above the file is fetched from the same directory as all the other
│ │ │ │  files in the messenger example. (manual).
        .hrl files can contain any valid Erlang code but are most often used for record
│ │ │ │  and macro definitions.
        
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Records
│ │ │ │  
        
│ │ │ │ -
        A record is defined as:
        -record(name_of_record,{field_name1, field_name2, field_name3, ......}).
        For example:
        -record(message_to,{to_name, message}).
        This is equivalent to:
        {message_to, To_Name, Message}
        Creating a record is best illustrated by an example:
        #message_to{message="hello", to_name=fred)
        This creates:
        {message_to, fred, "hello"}
        Notice that you do not have to worry about the order you assign values to the
│ │ │ │ +
        A record is defined as:
        -record(name_of_record,{field_name1, field_name2, field_name3, ......}).
        For example:
        -record(message_to,{to_name, message}).
        This is equivalent to:
        {message_to, To_Name, Message}
        Creating a record is best illustrated by an example:
        #message_to{message="hello", to_name=fred)
        This creates:
        {message_to, fred, "hello"}
        Notice that you do not have to worry about the order you assign values to the
│ │ │ │  various parts of the records when you create it. The advantage of using records
│ │ │ │  is that by placing their definitions in header files you can conveniently define
│ │ │ │  interfaces that are easy to change. For example, if you want to add a new field
│ │ │ │  to the record, you only have to change the code where the new field is used and
│ │ │ │  not at every place the record is referred to. If you leave out a field when
│ │ │ │  creating a record, it gets the value of the atom undefined. (manual)
        Pattern matching with records is very similar to creating records. For example,
│ │ │ │ -inside a case or receive:
        #message_to{to_name=ToName, message=Message} ->
        This is the same as:
        {message_to, ToName, Message}
        
│ │ │ │ +inside a case or receive:
        #message_to{to_name=ToName, message=Message} ->
        This is the same as:
        {message_to, ToName, Message}
        
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Macros
│ │ │ │  
        
│ │ │ │  
        Another thing that has been added to the messenger is a macro. The file
│ │ │ │  mess_config.hrl contains the definition:
        %%% Configure the location of the server node,
│ │ │ │ --define(server_node, messenger@super).
        This file is included in mess_server.erl:
        -include("mess_config.hrl").
        Every occurrence of ?server_node in mess_server.erl is now replaced by
│ │ │ │ -messenger@super.
        A macro is also used when spawning the server process:
        spawn(?MODULE, server, [])
        This is a standard macro (that is, defined by the system, not by the user).
│ │ │ │ +-define(server_node, messenger@super).
        This file is included in mess_server.erl:
        -include("mess_config.hrl").
        Every occurrence of ?server_node in mess_server.erl is now replaced by
│ │ │ │ +messenger@super.
        A macro is also used when spawning the server process:
        spawn(?MODULE, server, [])
        This is a standard macro (that is, defined by the system, not by the user).
│ │ │ │  ?MODULE is always replaced by the name of the current module (that is, the
│ │ │ │  -module definition near the start of the file). There are more advanced ways
│ │ │ │  of using macros with, for example, parameters.
        The three Erlang (.erl) files in the messenger example are individually
│ │ │ │  compiled into object code file (.beam). The Erlang system loads and links
│ │ │ │  these files into the system when they are referred to during execution of the
│ │ │ │  code. In this case, they are simply put in our current working directory (that
│ │ │ │  is, the place you have done "cd" to). There are ways of putting the .beam
│ │ │ ├── OEBPS/prog_ex_records.xhtml
│ │ │ │ @@ -27,105 +27,105 @@
│ │ │ │    Records and Tuples
│ │ │ │  
│ │ │ │  
        The main advantage of using records rather than tuples is that fields in a
│ │ │ │  record are accessed by name, whereas fields in a tuple are accessed by position.
│ │ │ │  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}
        
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Defining a Record
│ │ │ │  
        
│ │ │ │  
        This following definition of a person is used in several examples in this
│ │ │ │  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.
        
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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.)
        
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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"
        
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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.
        
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Nested Records
│ │ │ │  
        
│ │ │ │  
        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".
        
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    A Longer Example
│ │ │ │  
        
│ │ │ │  
        Comments are embedded in the following example:
        %% File: person.hrl
│ │ │ │  
│ │ │ │ @@ -135,44 +135,44 @@
│ │ │ │  %%    name:  A string (default is undefined).
│ │ │ │  %%    age:   An integer (default is undefined).
│ │ │ │  %%    phone: A list of integers (default is []).
│ │ │ │  %%    dict:  A dictionary containing various information
│ │ │ │  %%           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]}}.
        
│ │ │ │  
│ │ │ │    
│ │ │ │  
│ │ │ ├── OEBPS/patterns.xhtml
│ │ │ │ @@ -33,16 +33,16 @@
│ │ │ │  succeeds, any unbound variables in the pattern become bound. If the matching
│ │ │ │  fails, an exception is raised.
        Examples:
        1> X.
│ │ │ │  ** 1:1: variable 'X' is unbound **
│ │ │ │  2> X = 2.
│ │ │ │  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
        
│ │ │ │  
│ │ │ │    
│ │ │ │  
│ │ │ ├── OEBPS/otp-patch-apply.xhtml
│ │ │ │ @@ -106,13 +106,13 @@
│ │ │ │    
│ │ │ │    Sanity check
│ │ │ │  
│ │ │ │  
        The application dependencies can be checked using the Erlang shell.
│ │ │ │  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.
        
│ │ │ │  
│ │ │ │    
│ │ │ │  
│ │ │ ├── OEBPS/opaques.xhtml
│ │ │ │ @@ -27,24 +27,24 @@
│ │ │ │    Opaque Type Aliases
│ │ │ │  
│ │ │ │  
        The main use case for opacity in Erlang is to hide the implementation of a data
│ │ │ │  type, enabling evolving the API while minimizing the risk of breaking consumers.
│ │ │ │  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
│ │ │ │  example, sets module provides sets:new/0, sets:add_element/2,
│ │ │ │  sets:is_element/2, and so on.
        • sets:set(a) is a subtype of sets:set(a | b) and not the
│ │ │ │  other way around. Generally, you can rely on the property that the_opaque(T)
│ │ │ │  is a subtype of the_opaque(U) when T is a subtype of U.
        When defining your own opaques, here are some recommendations:
        • Since consumers are expected to not rely on the definition of the opaque type,
│ │ │ ├── OEBPS/nif.xhtml
│ │ │ │ @@ -38,26 +38,26 @@
│ │ │ │    Erlang Program
│ │ │ │  
│ │ │ │  
          Even if all functions of a module are NIFs, an Erlang module is still needed for
│ │ │ │  two reasons:
          • The NIF library must be explicitly loaded by Erlang code in the same module.
          • All NIFs of a module must have an Erlang implementation as well.
          Normally these are minimal stub implementations that throw an exception. But
│ │ │ │  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
│ │ │ │  foo and bar to be dispatched to the NIF implementations instead.
          
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │ @@ -114,22 +114,22 @@
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Running the Example
│ │ │ │  
          
│ │ │ │  
          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")
          
│ │ │ │  
│ │ │ │    
│ │ │ │  
│ │ │ ├── OEBPS/modules.xhtml
│ │ │ │ @@ -23,20 +23,20 @@
│ │ │ │  
          
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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.
          
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Module Attributes
│ │ │ │  
          
│ │ │ │ @@ -81,71 +81,71 @@
│ │ │ │  meaning.
        
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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.
        
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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.
        
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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.
        
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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.
        
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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"
│ │ │ │     """
│ │ │ │  -doc ~B|Example "docs"|.
          For clarity it is recommended to use either normal "strings" or triple
│ │ │ │  quoted strings for documentation attributes.
        • {file, file:name/0 } - Read the contents of filename and use
│ │ │ │  that as the documentation string.
        • false - Set the current entity as hidden, that is, it should not be
│ │ │ │ @@ -158,15 +158,15 @@
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    The feature directive
│ │ │ │  
│ │ │ │  
          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.
          
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Comments
│ │ │ │  
          
│ │ │ │  
          Comments can be placed anywhere in a module except within strings and
│ │ │ ├── OEBPS/maps.xhtml
│ │ │ │ @@ -53,16 +53,16 @@
│ │ │ │  single function that constructs the map using the map syntax and always use
│ │ │ │  it.
        • Always update the map using the := operator (that is, requiring that an
│ │ │ │  element with that key already exists). The := operator is slightly more
│ │ │ │  efficient, and it helps catching mispellings of keys.
        • Whenever possible, match multiple map elements at once.
        • Whenever possible, update multiple map elements at once.
        • Avoid default values and the maps:get/3 function. If there are default
│ │ │ │  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)
      
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Using Maps as Dictionaries
│ │ │ │  
      
│ │ │ │  
      Using a map as a dictionary implies the following usage pattern:
      • Keys are usually variables not known at compile-time.
      • There can be any number of elements in the map.
      • Usually, no more than one element is looked up or updated at once.
      Given that usage pattern, the difference in performance between using the map
│ │ │ │  syntax and the maps module is usually small. Therefore, which one to use is
│ │ │ │ @@ -72,18 +72,18 @@
│ │ │ │  choice.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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
│ │ │ │  be a better choice than sets.
    • If the intersection operation is frequently used and operations that operate
│ │ │ │  on a single element in a set (such as is_element/2) must also be efficient,
│ │ │ │  gb_sets can potentially be a better choice than sets.
    • If the elements of the set are integers in a fairly compact range, the set can
│ │ │ │  be represented as an integer where each bit represents an element in the set.
│ │ │ │ @@ -108,18 +108,18 @@
│ │ │ │  for the runtime system).
    • N - The number of elements in the map.
    • Keys - A tuple with keys of the map: {Key1,...,KeyN}. The keys are
│ │ │ │  sorted.
    • Value1 - The value corresponding to the first key in the key tuple.
    • ValueN - The value corresponding to the last key in the key tuple.
    As an example, let us look at how the map #{a => foo, z => bar} is
│ │ │ │  represented:
    01234
    FLATMAP2{a,z}foobar
    Table: #{a => foo, z => bar}
    Let us update the map: M#{q => baz}. The map now looks like this:
    012345
    FLATMAP3{a,q,z}foobazbar
    Table: #{a => foo, q => baz, z => bar}
    Finally, change the value of one element: M#{z := bird}. The map now looks
│ │ │ │  like this:
    012345
    FLATMAP3{a,q,z}foobazbird
    Table: #{a => foo, q => baz, z => bird}
    When the value for an existing key is updated, the key tuple is not updated,
│ │ │ │  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
│ │ │ │  could be identical, so the operations need to be performed sequentially from
│ │ │ │  left to right.)
    The memory size for a small map is the size of all keys and values plus 5 words.
│ │ │ │  See Memory for more information about memory sizes.
    
│ │ │ │    
│ │ │ │ @@ -146,21 +146,21 @@
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Using the Map Syntax
│ │ │ │  
    
│ │ │ │  
    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.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Using the Functions in the maps Module
│ │ │ │  
    
│ │ │ │  
    Here follows some notes about most of the functions in the maps module. For
│ │ │ │ @@ -211,23 +211,23 @@
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    maps:get/3
│ │ │ │  
│ │ │ │  
    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
│ │ │ │  default values.
    Change
    Before OTP 26.0 maps:get/3 was implemented by calling the function instead
│ │ │ │  of rewriting it as an Erlang expression. It is now slightly faster but can no
│ │ │ │  longer be traced.
    
│ │ │ │    
│ │ │ ├── OEBPS/macros.xhtml
│ │ │ │ @@ -22,56 +22,56 @@
│ │ │ │      
    
│ │ │ │  
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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
│ │ │ │  the case, the value of the environment variable VAR as returned by
│ │ │ │  os:getenv(VAR) is substituted for $VAR. If os:getenv(VAR) returns false,
│ │ │ │  $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.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Predefined Macros
│ │ │ │ @@ -90,29 +90,29 @@
│ │ │ │      
│ │ │ │    
│ │ │ │    Macros Overloading
│ │ │ │  
    
│ │ │ │  
    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).
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Conditional Compilation
│ │ │ │  
    
│ │ │ │  
    The following macro directives support conditional compilation:
    • -ifdef(Macro). - Evaluate the following lines only if Macro is
│ │ │ │  defined.
    • -ifndef(Macro). - Evaluate the following lines only if Macro is not
│ │ │ │ @@ -124,43 +124,43 @@
│ │ │ │  true, and the Condition evaluates to true, the lines following the elif
│ │ │ │  are evaluated instead.
    • -endif. - Specifies the end of a series of control flow directives.
    Note
    Macro directives cannot be used inside functions.
    Syntactically, the Condition in if and elif must be a
│ │ │ │  guard expression. Other constructs (such as
│ │ │ │  a case expression) result in a compilation error.
    As opposed to the standard guard expressions, an expression in an if and
│ │ │ │  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
│ │ │ │  compiled:
    % erlc -Ddebug m.erl
│ │ │ │  
│ │ │ │  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.
│ │ │ │  -endif.
│ │ │ │  ...
    This code uses the OTP_RELEASE macro and defined(debug) to compile debug
│ │ │ │  code only for OTP 26 or later.
    
│ │ │ │    
│ │ │ │ @@ -175,40 +175,40 @@
│ │ │ │  used. In practice this means it should appear before any -export(..) or record
│ │ │ │  definitions.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    -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.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Stringifying Macro Arguments
│ │ │ │  
    
│ │ │ │  
    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.
    
│ │ │ │  
│ │ │ │    
│ │ │ │  
│ │ │ ├── OEBPS/listhandling.xhtml
│ │ │ │ @@ -25,101 +25,101 @@
│ │ │ │      
│ │ │ │    
│ │ │ │    Creating a List
│ │ │ │  
    
│ │ │ │  
    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.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Deep and Flat Lists
│ │ │ │  
    
│ │ │ │  
    lists:flatten/1 builds an entirely new list. It is therefore expensive, and
│ │ │ │  even more expensive than the ++ operator (which copies its left argument,
│ │ │ │  but not its right argument).
    In the following situations it is unnecessary to call lists:flatten/1:
    • When sending data to a port. Ports understand deep lists so there is no reason
│ │ │ │  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]

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Recursive List Functions
│ │ │ │  

│ │ │ │  
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, │ │ │ │ concentrate on writing beautiful code and forget about the performance │ │ │ │ of your list functions. In the time-critical parts of your code, │ │ │ │ measure before rewriting your code.

For a thorough discussion about tail and body recursion, see │ │ │ │ Erlang's Tail Recursion is Not a Silver Bullet.

Note

This section is about list functions that construct lists. A tail-recursive │ │ │ │ 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.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ ├── OEBPS/list_comprehensions.xhtml │ │ │ │ @@ -22,33 +22,33 @@ │ │ │ │ │ │ │ │

│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ 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 │ │ │ │ the pivot element.
    1. The sublists are recursively sorted by the same algorithm and the results │ │ │ │ are combined, resulting in a list consisting of:
    • All elements from the first sublist, that is all elements smaller than the │ │ │ │ pivot element, in sorted order.
    • The pivot element.
    • All elements from the second sublist, that is all elements greater than or │ │ │ │ equal to the pivot element, in sorted order.

Note

While the sorting algorithm as shown above serves as a nice example to │ │ │ │ @@ -56,90 +56,90 @@ │ │ │ │ lists module contains sorting functions that are implemented in a more │ │ │ │ efficient way.

│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ 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]]

│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ Pythagorean Triplets │ │ │ │

│ │ │ │

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)].

│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ Variable Bindings in List Comprehensions │ │ │ │

│ │ │ │

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

  • All variables that occur in a generator pattern are assumed to be "fresh" │ │ │ │ variables.
  • Any variables that are defined before the list comprehension, and that are │ │ │ │ used in filters, have the values they had before the list comprehension.
  • Variables cannot be exported from a list comprehension.

As an example of these rules, suppose you want to write the function select, │ │ │ │ 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, ...]
│ │ │ │      ...

│ │ │ │  
│ │ │ │    
│ │ │ │  
│ │ │ ├── OEBPS/install-win32.xhtml
│ │ │ │ @@ -200,15 +200,15 @@
│ │ │ │  $ cd erts/emulator
│ │ │ │  $ make debug
│ │ │ │  $ cd ../etc
│ │ │ │  $ make debug
│ │ │ │

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
│ │ │ │

or even in the source directory...

$ cd $ERL_TOP/lib/stdlib/src
│ │ │ │  $ make opt
│ │ │ │

Note that you're expected to have a fresh Erlang in your path when │ │ │ │ doing this, preferably the plain 27 you have built in the previous │ │ │ │ @@ -223,19 +223,19 @@ │ │ │ │ :$ERL_TOP/erts/etc/win32/wsl_tools:$ERL_TOP/bootstrap/bin:$PATH │ │ │ │

That should make it possible to rebuild any library without hassle...

If you want to copy a library (an application) newly built, to a │ │ │ │ release area, you do like with the emulator:

$ cd $ERL_TOP/lib/stdlib
│ │ │ │  $ make TESTROOT=/tmp/erlang_release release
│ │ │ │

Remember that:

That's basically all you need to get going.

│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ Frequently Asked Questions │ │ │ │

│ │ │ │

  • Q: So, now I can build Erlang using GCC on Windows?

    A: No, unfortunately not. You'll need Microsoft's Visual C++ │ │ │ ├── OEBPS/included_applications.xhtml │ │ │ │ @@ -66,72 +66,72 @@ │ │ │ │ belonging to the primary application.

    │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ 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"}]}
│ │ │ │ + ]}.

    │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ Synchronizing Processes during Startup │ │ │ │

    │ │ │ │

    The supervisor tree of an included application is started as part of the │ │ │ │ supervisor tree of the including application. If there is a need for │ │ │ │ synchronization between processes in the including and included applications, │ │ │ │ this can be achieved by using start phases.

    Start phases are defined by the start_phases key in the .app file as a list │ │ │ │ of tuples {Phase,PhaseArgs}, where Phase is an atom and PhaseArgs is a │ │ │ │ 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 │ │ │ │ Module:start_phase(Phase, Type, PhaseArgs) for each phase defined for the │ │ │ │ primary application, in that order. If a phase is not defined for an included │ │ │ │ application, the function is not called for this phase and application.

    The following requirements apply to the .app file for an included application:

    • The {mod, {Module,StartArgs}} option must be included. This option is used │ │ │ │ to find the callback module Module of the application. StartArgs is │ │ │ │ ignored, as Module:start/2 is called only for the primary application.
    • If the included application itself contains included applications, instead the │ │ │ │ {mod, {application_starter, [Module,StartArgs]}} option must be included.
    • The {start_phases, [{Phase,PhaseArgs}]} option must be included, and the set │ │ │ │ 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
    
│ │ │ │  
│ │ │ │    
│ │ │ │  
│ │ │ ├── OEBPS/gen_server_concepts.xhtml
│ │ │ │ @@ -62,63 +62,63 @@
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Example
│ │ │ │  
│ │ │ │  
    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
│ │ │ │  the gen_server is registered using global:register_name/2.
    • The second argument, ch3, is the name of the callback module, which is
│ │ │ │  the module where the callback functions are located.
      The interface functions (start_link/0, alloc/0, and free/1) are located
│ │ │ │  in the same module as the callback functions (init/1, handle_call/3, and
│ │ │ │  handle_cast/2). It is usually good programming practice to have the code
│ │ │ │  corresponding to one process contained in a single module.
    • The third argument, [], is a term that is passed as is to the callback
│ │ │ │  function init. Here, init does not need any indata and ignores the
│ │ │ │  argument.
    • The fourth argument, [], is a list of options. See gen_server
│ │ │ │  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
│ │ │ │  gen_server that is not part of a supervision tree.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │ @@ -126,32 +126,32 @@
│ │ │ │  
    
│ │ │ │  
    The synchronous request alloc() is implemented using gen_server:call/2:
    alloc() ->
│ │ │ │      gen_server:call(ch3, alloc).
    ch3 is the name of the gen_server and must agree with the name
│ │ │ │  used to start it. alloc is the actual request.
    The request is made into a message and sent to the gen_server.
│ │ │ │  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.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Stopping
│ │ │ │  
    
│ │ │ │  
    
│ │ │ │ @@ -162,65 +162,65 @@
│ │ │ │  
    
│ │ │ │  
    If the gen_server is part of a supervision tree, no stop function is needed.
│ │ │ │  The gen_server is automatically terminated by its supervisor.  Exactly how
│ │ │ │  this is done is defined by a shutdown strategy
│ │ │ │  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.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Standalone Gen_Servers
│ │ │ │  
    
│ │ │ │  
    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
│ │ │ │  of the gen_server.  This causes the gen_server to call
│ │ │ │  terminate(normal, State1) and then it terminates gracefully.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Handling Other Messages
│ │ │ │  
    
│ │ │ │  
    If the gen_server is to be able to receive other messages than requests,
│ │ │ │  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}.
    
│ │ │ │  
│ │ │ │    
│ │ │ │  
│ │ │ ├── OEBPS/funs.xhtml
│ │ │ │ @@ -22,399 +22,399 @@
│ │ │ │      
│ │ │ │  
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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
│ │ │ │  to write several different functions that have a similar structure, but differ
│ │ │ │  in some minor detail. This is done as follows:
    1. Step 1. Write one function that represents the common features of these
│ │ │ │  functions.
    2. Step 2. Parameterize the difference in terms of functions that are passed
│ │ │ │  as arguments to the common function.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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
│ │ │ │  BIF returns true if the process contains funs that depend on the old version
│ │ │ │  of a module.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Variable Bindings Within a Fun
│ │ │ │  
    
│ │ │ │  
    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'
│ │ │ │        shadowed in 'fun'

This indicates that the variable File, which is defined inside the fun, │ │ │ │ collides with the variable File, which is defined outside the fun.

The rules for importing variables into a fun has the consequence that certain │ │ │ │ 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, ...)
│ │ │ │      ...

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Funs and Module Lists
│ │ │ │  

│ │ │ │  
The following examples show a dialogue with the Erlang shell. All the higher
│ │ │ │  order functions discussed are exported from the module lists.

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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]) ->
│ │ │ │ -    case Pred(H) of
│ │ │ │ -        true  ->  all(Pred, T);
│ │ │ │ +
lists:all/2 has the same arguments as any:
all(Pred, [H|T]) ->
│ │ │ │ +    case Pred(H) of
│ │ │ │ +        true  ->  all(Pred, T);
│ │ │ │          false ->  false
│ │ │ │      end;
│ │ │ │ -all(Pred, []) ->
│ │ │ │ -    true.
It is true if the predicate applied to all elements in the list is true.
> lists:all(Big, [1,2,3,4,12,6]).
│ │ │ │ +all(Pred, []) ->
│ │ │ │ +    true.
It is true if the predicate applied to all elements in the list is true.
> lists:all(Big, [1,2,3,4,12,6]).
│ │ │ │  false
│ │ │ │ -> lists:all(Big, [12,13,14,15]).
│ │ │ │ +> lists:all(Big, [12,13,14,15]).
│ │ │ │  true

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    foreach
│ │ │ │  

│ │ │ │ -
lists:foreach/2 takes a function of one argument and a list of terms:
foreach(F, [H|T]) ->
│ │ │ │ -    F(H),
│ │ │ │ -    foreach(F, T);
│ │ │ │ -foreach(F, []) ->
│ │ │ │ +
lists:foreach/2 takes a function of one argument and a list of terms:
foreach(F, [H|T]) ->
│ │ │ │ +    F(H),
│ │ │ │ +    foreach(F, T);
│ │ │ │ +foreach(F, []) ->
│ │ │ │      ok.
The function is applied to each argument in the list. foreach returns ok. It
│ │ │ │ -is only used for its side-effect:
> lists:foreach(fun(X) -> io:format("~w~n",[X]) end, [1,2,3,4]).
│ │ │ │ +is only used for its side-effect:
> lists:foreach(fun(X) -> io:format("~w~n",[X]) end, [1,2,3,4]).
│ │ │ │  1
│ │ │ │  2
│ │ │ │  3
│ │ │ │  4
│ │ │ │  ok

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    foldl
│ │ │ │  

│ │ │ │ -
lists:foldl/3 takes a function of two arguments, an accumulator and a list:
foldl(F, Accu, [Hd|Tail]) ->
│ │ │ │ -    foldl(F, F(Hd, Accu), Tail);
│ │ │ │ -foldl(F, Accu, []) -> Accu.
The function is called with two arguments. The first argument is the successive
│ │ │ │ +
lists:foldl/3 takes a function of two arguments, an accumulator and a list:
foldl(F, Accu, [Hd|Tail]) ->
│ │ │ │ +    foldl(F, F(Hd, Accu), Tail);
│ │ │ │ +foldl(F, Accu, []) -> Accu.
The function is called with two arguments. The first argument is the successive
│ │ │ │  elements in the list. The second argument is the accumulator. The function must
│ │ │ │  return a new accumulator, which is used the next time the function is called.
If you have a list of lists L = ["I","like","Erlang"], then you can sum the
│ │ │ │ -lengths of all the strings in L as follows:
> L = ["I","like","Erlang"].
│ │ │ │ -["I","like","Erlang"]
│ │ │ │ -10> lists:foldl(fun(X, Sum) -> length(X) + Sum end, 0, L).
│ │ │ │ -11
lists:foldl/3 works like a while loop in an imperative language:
L =  ["I","like","Erlang"],
│ │ │ │ +lengths of all the strings in L as follows:
> L = ["I","like","Erlang"].
│ │ │ │ +["I","like","Erlang"]
│ │ │ │ +10> lists:foldl(fun(X, Sum) -> length(X) + Sum end, 0, L).
│ │ │ │ +11
lists:foldl/3 works like a while loop in an imperative language:
L =  ["I","like","Erlang"],
│ │ │ │  Sum = 0,
│ │ │ │ -while( L != []){
│ │ │ │ -    Sum += length(head(L)),
│ │ │ │ -    L = tail(L)
│ │ │ │ +while( L != []){
│ │ │ │ +    Sum += length(head(L)),
│ │ │ │ +    L = tail(L)
│ │ │ │  end

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    mapfoldl
│ │ │ │  

│ │ │ │ -
lists:mapfoldl/3 simultaneously maps and folds over a list:
mapfoldl(F, Accu0, [Hd|Tail]) ->
│ │ │ │ -    {R,Accu1} = F(Hd, Accu0),
│ │ │ │ -    {Rs,Accu2} = mapfoldl(F, Accu1, Tail),
│ │ │ │ -    {[R|Rs], Accu2};
│ │ │ │ -mapfoldl(F, Accu, []) -> {[], Accu}.
The following example shows how to change all letters in L to upper case and
│ │ │ │ -then count them.
First the change to upper case:
> Upcase =  fun(X) when $a =< X,  X =< $z -> X + $A - $a;
│ │ │ │ -(X) -> X
│ │ │ │ +
lists:mapfoldl/3 simultaneously maps and folds over a list:
mapfoldl(F, Accu0, [Hd|Tail]) ->
│ │ │ │ +    {R,Accu1} = F(Hd, Accu0),
│ │ │ │ +    {Rs,Accu2} = mapfoldl(F, Accu1, Tail),
│ │ │ │ +    {[R|Rs], Accu2};
│ │ │ │ +mapfoldl(F, Accu, []) -> {[], Accu}.
The following example shows how to change all letters in L to upper case and
│ │ │ │ +then count them.
First the change to upper case:
> Upcase =  fun(X) when $a =< X,  X =< $z -> X + $A - $a;
│ │ │ │ +(X) -> X
│ │ │ │  end.
│ │ │ │  #Fun<erl_eval.6.72228031>
│ │ │ │  > Upcase_word =
│ │ │ │ -fun(X) ->
│ │ │ │ -lists:map(Upcase, X)
│ │ │ │ +fun(X) ->
│ │ │ │ +lists:map(Upcase, X)
│ │ │ │  end.
│ │ │ │  #Fun<erl_eval.6.72228031>
│ │ │ │ -> Upcase_word("Erlang").
│ │ │ │ +> Upcase_word("Erlang").
│ │ │ │  "ERLANG"
│ │ │ │ -> lists:map(Upcase_word, L).
│ │ │ │ -["I","LIKE","ERLANG"]
Now, the fold and the map can be done at the same time:
> lists:mapfoldl(fun(Word, Sum) ->
│ │ │ │ -{Upcase_word(Word), Sum + length(Word)}
│ │ │ │ -end, 0, L).
│ │ │ │ -{["I","LIKE","ERLANG"],11}

│ │ │ │ +> lists:map(Upcase_word, L).
│ │ │ │ +["I","LIKE","ERLANG"]
Now, the fold and the map can be done at the same time:
> lists:mapfoldl(fun(Word, Sum) ->
│ │ │ │ +{Upcase_word(Word), Sum + length(Word)}
│ │ │ │ +end, 0, L).
│ │ │ │ +{["I","LIKE","ERLANG"],11}

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    filter
│ │ │ │  

│ │ │ │  
lists:filter/2 takes a predicate of one argument and a list and returns all elements
│ │ │ │ -in the list that satisfy the predicate:
filter(F, [H|T]) ->
│ │ │ │ -    case F(H) of
│ │ │ │ -        true  -> [H|filter(F, T)];
│ │ │ │ -        false -> filter(F, T)
│ │ │ │ +in the list that satisfy the predicate:
filter(F, [H|T]) ->
│ │ │ │ +    case F(H) of
│ │ │ │ +        true  -> [H|filter(F, T)];
│ │ │ │ +        false -> filter(F, T)
│ │ │ │      end;
│ │ │ │ -filter(F, []) -> [].
> lists:filter(Big, [500,12,2,45,6,7]).
│ │ │ │ -[500,12,45]
Combining maps and filters enables writing of very succinct code. For example,
│ │ │ │ +filter(F, []) -> [].
> lists:filter(Big, [500,12,2,45,6,7]).
│ │ │ │ +[500,12,45]
Combining maps and filters enables writing of very succinct code. For example,
│ │ │ │  to define a set difference function diff(L1, L2) to be the difference between
│ │ │ │ -the lists L1 and L2, the code can be written as follows:
diff(L1, L2) ->
│ │ │ │ -    filter(fun(X) -> not member(X, L2) end, L1).
This gives the list of all elements in L1 that are not contained in L2.
The AND intersection of the list L1 and L2 is also easily defined:
intersection(L1,L2) -> filter(fun(X) -> member(X,L1) end, L2).

│ │ │ │ +the lists L1 and L2, the code can be written as follows:
diff(L1, L2) ->
│ │ │ │ +    filter(fun(X) -> not member(X, L2) end, L1).
This gives the list of all elements in L1 that are not contained in L2.
The AND intersection of the list L1 and L2 is also easily defined:
intersection(L1,L2) -> filter(fun(X) -> member(X,L1) end, L2).

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    takewhile
│ │ │ │  

│ │ │ │  
lists:takewhile/2 takes elements X from a list L as long as the predicate
│ │ │ │ -P(X) is true:
takewhile(Pred, [H|T]) ->
│ │ │ │ -    case Pred(H) of
│ │ │ │ -        true  -> [H|takewhile(Pred, T)];
│ │ │ │ -        false -> []
│ │ │ │ +P(X) is true:
takewhile(Pred, [H|T]) ->
│ │ │ │ +    case Pred(H) of
│ │ │ │ +        true  -> [H|takewhile(Pred, T)];
│ │ │ │ +        false -> []
│ │ │ │      end;
│ │ │ │ -takewhile(Pred, []) ->
│ │ │ │ -    [].
> lists:takewhile(Big, [200,500,45,5,3,45,6]).
│ │ │ │ -[200,500,45]

│ │ │ │ +takewhile(Pred, []) ->
│ │ │ │ +    [].
> lists:takewhile(Big, [200,500,45,5,3,45,6]).
│ │ │ │ +[200,500,45]

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    dropwhile
│ │ │ │  

│ │ │ │ -
lists:dropwhile/2 is the complement of takewhile:
dropwhile(Pred, [H|T]) ->
│ │ │ │ -    case Pred(H) of
│ │ │ │ -        true  -> dropwhile(Pred, T);
│ │ │ │ -        false -> [H|T]
│ │ │ │ +
lists:dropwhile/2 is the complement of takewhile:
dropwhile(Pred, [H|T]) ->
│ │ │ │ +    case Pred(H) of
│ │ │ │ +        true  -> dropwhile(Pred, T);
│ │ │ │ +        false -> [H|T]
│ │ │ │      end;
│ │ │ │ -dropwhile(Pred, []) ->
│ │ │ │ -    [].
> lists:dropwhile(Big, [200,500,45,5,3,45,6]).
│ │ │ │ -[5,3,45,6]

│ │ │ │ +dropwhile(Pred, []) ->
│ │ │ │ +    [].
> lists:dropwhile(Big, [200,500,45,5,3,45,6]).
│ │ │ │ +[5,3,45,6]

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    splitwith
│ │ │ │  

│ │ │ │  
lists:splitwith/2 splits the list L into the two sublists {L1, L2}, where
│ │ │ │ -L = takewhile(P, L) and L2 = dropwhile(P, L):
splitwith(Pred, L) ->
│ │ │ │ -    splitwith(Pred, L, []).
│ │ │ │ +L = takewhile(P, L) and L2 = dropwhile(P, L):
splitwith(Pred, L) ->
│ │ │ │ +    splitwith(Pred, L, []).
│ │ │ │  
│ │ │ │ -splitwith(Pred, [H|T], L) ->
│ │ │ │ -    case Pred(H) of
│ │ │ │ -        true  -> splitwith(Pred, T, [H|L]);
│ │ │ │ -        false -> {reverse(L), [H|T]}
│ │ │ │ +splitwith(Pred, [H|T], L) ->
│ │ │ │ +    case Pred(H) of
│ │ │ │ +        true  -> splitwith(Pred, T, [H|L]);
│ │ │ │ +        false -> {reverse(L), [H|T]}
│ │ │ │      end;
│ │ │ │ -splitwith(Pred, [], L) ->
│ │ │ │ -    {reverse(L), []}.
> lists:splitwith(Big, [200,500,45,5,3,45,6]).
│ │ │ │ -{[200,500,45],[5,3,45,6]}

│ │ │ │ +splitwith(Pred, [], L) ->
│ │ │ │ +    {reverse(L), []}.
> lists:splitwith(Big, [200,500,45,5,3,45,6]).
│ │ │ │ +{[200,500,45],[5,3,45,6]}

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Funs Returning Funs
│ │ │ │  

│ │ │ │  
So far, only functions that take funs as arguments have been described. More
│ │ │ │  powerful functions, that themselves return funs, can also be written. The
│ │ │ │  following examples illustrate these type of functions.

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Simple Higher Order Functions
│ │ │ │  

│ │ │ │  
Adder(X) is a function that given X, returns a new function G such that
│ │ │ │ -G(K) returns K + X:
> Adder = fun(X) -> fun(Y) -> X + Y end end.
│ │ │ │ +G(K) returns K + X:
> Adder = fun(X) -> fun(Y) -> X + Y end end.
│ │ │ │  #Fun<erl_eval.6.72228031>
│ │ │ │ -> Add6 = Adder(6).
│ │ │ │ +> Add6 = Adder(6).
│ │ │ │  #Fun<erl_eval.6.72228031>
│ │ │ │ -> Add6(10).
│ │ │ │ +> Add6(10).
│ │ │ │  16

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Infinite Lists
│ │ │ │  

│ │ │ │ -
The idea is to write something like:
-module(lazy).
│ │ │ │ --export([ints_from/1]).
│ │ │ │ -ints_from(N) ->
│ │ │ │ -    fun() ->
│ │ │ │ -            [N|ints_from(N+1)]
│ │ │ │ -    end.
Then proceed as follows:
> XX = lazy:ints_from(1).
│ │ │ │ +
The idea is to write something like:
-module(lazy).
│ │ │ │ +-export([ints_from/1]).
│ │ │ │ +ints_from(N) ->
│ │ │ │ +    fun() ->
│ │ │ │ +            [N|ints_from(N+1)]
│ │ │ │ +    end.
Then proceed as follows:
> XX = lazy:ints_from(1).
│ │ │ │  #Fun<lazy.0.29874839>
│ │ │ │ -> XX().
│ │ │ │ -[1|#Fun<lazy.0.29874839>]
│ │ │ │ -> hd(XX()).
│ │ │ │ +> XX().
│ │ │ │ +[1|#Fun<lazy.0.29874839>]
│ │ │ │ +> hd(XX()).
│ │ │ │  1
│ │ │ │ -> Y = tl(XX()).
│ │ │ │ +> Y = tl(XX()).
│ │ │ │  #Fun<lazy.0.29874839>
│ │ │ │ -> hd(Y()).
│ │ │ │ +> hd(Y()).
│ │ │ │  2
And so on. This is an example of "lazy embedding".

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Parsing
│ │ │ │  

│ │ │ │ -
The following examples show parsers of the following type:
Parser(Toks) -> {ok, Tree, Toks1} | fail
Toks is the list of tokens to be parsed. A successful parse returns
│ │ │ │ +
The following examples show parsers of the following type:
Parser(Toks) -> {ok, Tree, Toks1} | fail
Toks is the list of tokens to be parsed. A successful parse returns
│ │ │ │  {ok, Tree, Toks1}.
  • Tree is a parse tree.
  • Toks1 is a tail of Tree that contains symbols encountered after the
│ │ │ │  structure that was correctly parsed.
An unsuccessful parse returns fail.
The following example illustrates a simple, functional parser that parses the
│ │ │ │  grammar:
(a | b) & (c | d)
The following code defines a function pconst(X) in the module funparse,
│ │ │ │ -which returns a fun that parses a list of tokens:
pconst(X) ->
│ │ │ │ -    fun (T) ->
│ │ │ │ +which returns a fun that parses a list of tokens:
pconst(X) ->
│ │ │ │ +    fun (T) ->
│ │ │ │         case T of
│ │ │ │ -           [X|T1] -> {ok, {const, X}, T1};
│ │ │ │ +           [X|T1] -> {ok, {const, X}, T1};
│ │ │ │             _      -> fail
│ │ │ │         end
│ │ │ │ -    end.
This function can be used as follows:
> P1 = funparse:pconst(a).
│ │ │ │ +    end.
This function can be used as follows:
> P1 = funparse:pconst(a).
│ │ │ │  #Fun<funparse.0.22674075>
│ │ │ │ -> P1([a,b,c]).
│ │ │ │ -{ok,{const,a},[b,c]}
│ │ │ │ -> P1([x,y,z]).
│ │ │ │ +> P1([a,b,c]).
│ │ │ │ +{ok,{const,a},[b,c]}
│ │ │ │ +> P1([x,y,z]).
│ │ │ │  fail
Next, the two higher order functions pand and por are defined. They combine
│ │ │ │ -primitive parsers to produce more complex parsers.
First pand:
pand(P1, P2) ->
│ │ │ │ -    fun (T) ->
│ │ │ │ -        case P1(T) of
│ │ │ │ -            {ok, R1, T1} ->
│ │ │ │ -                case P2(T1) of
│ │ │ │ -                    {ok, R2, T2} ->
│ │ │ │ -                        {ok, {'and', R1, R2}};
│ │ │ │ +primitive parsers to produce more complex parsers.
First pand:
pand(P1, P2) ->
│ │ │ │ +    fun (T) ->
│ │ │ │ +        case P1(T) of
│ │ │ │ +            {ok, R1, T1} ->
│ │ │ │ +                case P2(T1) of
│ │ │ │ +                    {ok, R2, T2} ->
│ │ │ │ +                        {ok, {'and', R1, R2}};
│ │ │ │                      fail ->
│ │ │ │                          fail
│ │ │ │                  end;
│ │ │ │              fail ->
│ │ │ │                  fail
│ │ │ │          end
│ │ │ │      end.
Given a parser P1 for grammar G1, and a parser P2 for grammar G2,
│ │ │ │  pand(P1, P2) returns a parser for the grammar, which consists of sequences of
│ │ │ │  tokens that satisfy G1, followed by sequences of tokens that satisfy G2.
por(P1, P2) returns a parser for the language described by the grammar G1 or
│ │ │ │ -G2:
por(P1, P2) ->
│ │ │ │ -    fun (T) ->
│ │ │ │ -        case P1(T) of
│ │ │ │ -            {ok, R, T1} ->
│ │ │ │ -                {ok, {'or',1,R}, T1};
│ │ │ │ +G2:
por(P1, P2) ->
│ │ │ │ +    fun (T) ->
│ │ │ │ +        case P1(T) of
│ │ │ │ +            {ok, R, T1} ->
│ │ │ │ +                {ok, {'or',1,R}, T1};
│ │ │ │              fail ->
│ │ │ │ -                case P2(T) of
│ │ │ │ -                    {ok, R1, T1} ->
│ │ │ │ -                        {ok, {'or',2,R1}, T1};
│ │ │ │ +                case P2(T) of
│ │ │ │ +                    {ok, R1, T1} ->
│ │ │ │ +                        {ok, {'or',2,R1}, T1};
│ │ │ │                      fail ->
│ │ │ │                          fail
│ │ │ │                  end
│ │ │ │          end
│ │ │ │      end.
The original problem was to parse the grammar (a | b) & (c | d). The following
│ │ │ │ -code addresses this problem:
grammar() ->
│ │ │ │ -    pand(
│ │ │ │ -         por(pconst(a), pconst(b)),
│ │ │ │ -         por(pconst(c), pconst(d))).
The following code adds a parser interface to the grammar:
parse(List) ->
│ │ │ │ -    (grammar())(List).
The parser can be tested as follows:
> funparse:parse([a,c]).
│ │ │ │ -{ok,{'and',{'or',1,{const,a}},{'or',1,{const,c}}}}
│ │ │ │ -> funparse:parse([a,d]).
│ │ │ │ -{ok,{'and',{'or',1,{const,a}},{'or',2,{const,d}}}}
│ │ │ │ -> funparse:parse([b,c]).
│ │ │ │ -{ok,{'and',{'or',2,{const,b}},{'or',1,{const,c}}}}
│ │ │ │ -> funparse:parse([b,d]).
│ │ │ │ -{ok,{'and',{'or',2,{const,b}},{'or',2,{const,d}}}}
│ │ │ │ -> funparse:parse([a,b]).
│ │ │ │ +code addresses this problem:
grammar() ->
│ │ │ │ +    pand(
│ │ │ │ +         por(pconst(a), pconst(b)),
│ │ │ │ +         por(pconst(c), pconst(d))).
The following code adds a parser interface to the grammar:
parse(List) ->
│ │ │ │ +    (grammar())(List).
The parser can be tested as follows:
> funparse:parse([a,c]).
│ │ │ │ +{ok,{'and',{'or',1,{const,a}},{'or',1,{const,c}}}}
│ │ │ │ +> funparse:parse([a,d]).
│ │ │ │ +{ok,{'and',{'or',1,{const,a}},{'or',2,{const,d}}}}
│ │ │ │ +> funparse:parse([b,c]).
│ │ │ │ +{ok,{'and',{'or',2,{const,b}},{'or',1,{const,c}}}}
│ │ │ │ +> funparse:parse([b,d]).
│ │ │ │ +{ok,{'and',{'or',2,{const,b}},{'or',2,{const,d}}}}
│ │ │ │ +> funparse:parse([a,b]).
│ │ │ │  fail

│ │ │ │  
│ │ │ │    
│ │ │ │  
│ │ │ ├── OEBPS/expressions.xhtml
│ │ │ │ @@ -56,81 +56,81 @@
│ │ │ │  Phone_number
│ │ │ │  _
│ │ │ │  _Height
│ │ │ │  name@node
Variables are bound to values using pattern matching. Erlang uses
│ │ │ │  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
│ │ │ │  the expression are always unsafe outside the expression.

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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.

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    The Compound Pattern Operator
│ │ │ │  

│ │ │ │  
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.

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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} -> ...

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    The Match Operator
│ │ │ │  

│ │ │ │  
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,
│ │ │ │     .
│ │ │ │     .
│ │ │ │     .,
│ │ │ │  Pattern2 = Temporary,
│ │ │ │ @@ -144,30 +144,30 @@
│ │ │ │  can safely be skipped on a first reading.
The = character is used to denote two similar but distinct operators: the
│ │ │ │  match operator and the compound pattern operator. Which one is meant is
│ │ │ │  determined by context.
The compound pattern operator is used to construct a compound pattern from two
│ │ │ │  patterns. Compound patterns are accepted everywhere a pattern is accepted. A
│ │ │ │  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.
│ │ │ │ +5> <<X:Y>> = begin Y = 8, <<42:8>> end, X.
│ │ │ │  42
The expression at prompt 2> first matches the value of variable M against
│ │ │ │  pattern #{key := Key}, binding variable Key. It then matches the value of
│ │ │ │  M against pattern #{Key := Value} using variable Key as the key, binding
│ │ │ │  variable Value.
The expression at prompt 3> matches expression (#{key := Key} = M) against
│ │ │ │  pattern #{Key := Value}. The expression inside the parentheses is evaluated
│ │ │ │  first. That is, M is matched against #{key := Key}, and then the value of
│ │ │ │  M is matched against pattern #{Key := Value}. That is the same evaluation
│ │ │ │ @@ -181,30 +181,30 @@
│ │ │ │  binding variable Y and creating a binary. The binary is then matched against
│ │ │ │  pattern <<X:Y>> using the value of Y as the size of the segment.

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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
│ │ │ │  Compilation and Code Loading and
│ │ │ │  Function Evaluation.

│ │ │ │    
│ │ │ │      
│ │ │ │ @@ -221,40 +221,40 @@
│ │ │ │  called instead. This is to avoid that future additions to the set of
│ │ │ │  auto-imported BIFs do not silently change the behavior of old code.
However, to avoid that old (pre R14) code changed its behavior when compiled
│ │ │ │  with Erlang/OTP version R14A or later, the following restriction applies: If you
│ │ │ │  override the name of a BIF that was auto-imported in OTP versions prior to R14A
│ │ │ │  (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
│ │ │ │  qualified function name.

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │ @@ -266,40 +266,40 @@
│ │ │ │      ...;
│ │ │ │      GuardSeqN ->
│ │ │ │          BodyN
│ │ │ │  end
The branches of an if-expression are scanned sequentially until a guard
│ │ │ │  sequence GuardSeq that evaluates to true is found. Then the corresponding
│ │ │ │  Body (a sequence of expressions separated by ,) is evaluated.
The return value of Body is the return value of the if expression.
If no guard sequence is evaluated as true, an if_clause run-time error occurs.
│ │ │ │  If necessary, the guard expression true can be used in the last branch, as
│ │ │ │ -that guard sequence is always true.
Example:
is_greater_than(X, Y) ->
│ │ │ │ +that guard sequence is always true.
Example:
is_greater_than(X, Y) ->
│ │ │ │      if
│ │ │ │          X > Y ->
│ │ │ │              true;
│ │ │ │          true -> % works as an 'else' branch
│ │ │ │              false
│ │ │ │      end

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Case
│ │ │ │  

│ │ │ │  
case Expr of
│ │ │ │ -    Pattern1 [when GuardSeq1] ->
│ │ │ │ +    Pattern1 [when GuardSeq1] ->
│ │ │ │          Body1;
│ │ │ │      ...;
│ │ │ │ -    PatternN [when GuardSeqN] ->
│ │ │ │ +    PatternN [when GuardSeqN] ->
│ │ │ │          BodyN
│ │ │ │  end
The expression Expr is evaluated and the patterns Pattern are sequentially
│ │ │ │  matched against the result. If a match succeeds and the optional guard sequence
│ │ │ │  GuardSeq is true, the corresponding Body is evaluated.
The return value of Body is the return value of the case expression.
If there is no matching pattern with a true guard sequence, a case_clause
│ │ │ │ -run-time error occurs.
Example:
is_valid_signal(Signal) ->
│ │ │ │ +run-time error occurs.
Example:
is_valid_signal(Signal) ->
│ │ │ │      case Signal of
│ │ │ │ -        {signal, _What, _From, _To} ->
│ │ │ │ +        {signal, _What, _From, _To} ->
│ │ │ │              true;
│ │ │ │ -        {signal, _What, _To} ->
│ │ │ │ +        {signal, _What, _To} ->
│ │ │ │              true;
│ │ │ │          _Else ->
│ │ │ │              false
│ │ │ │      end.

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │ @@ -317,57 +317,57 @@
│ │ │ │  the top-level of a maybe block. It matches the pattern Expr1 against
│ │ │ │  Expr2. If the matching succeeds, any unbound variable in the pattern becomes
│ │ │ │  bound. If the expression is the last expression in the maybe block, it also
│ │ │ │  returns the value of Expr2. If the matching is unsuccessful, the rest of the
│ │ │ │  expressions in the maybe block are skipped and the return value of the maybe
│ │ │ │  block is Expr2.
None of the variables bound in a maybe block must be used in the code that
│ │ │ │  follows the block.
Here is an example:
maybe
│ │ │ │ -    {ok, A} ?= a(),
│ │ │ │ +    {ok, A} ?= a(),
│ │ │ │      true = A >= 0,
│ │ │ │ -    {ok, B} ?= b(),
│ │ │ │ +    {ok, B} ?= b(),
│ │ │ │      A + B
│ │ │ │  end
Let us first assume that a() returns {ok,42} and b() returns {ok,58}.
│ │ │ │  With those return values, all of the match operators will succeed, and the
│ │ │ │  return value of the maybe block is A + B, which is equal to 42 + 58 = 100.
Now let us assume that a() returns error. The conditional match operator in
│ │ │ │  {ok, A} ?= a() fails to match, and the return value of the maybe block is
│ │ │ │  the value of the expression that failed to match, namely error. Similarly, if
│ │ │ │  b() returns wrong, the return value of the maybe block is wrong.
Finally, let us assume that a() returns {ok,-1}. Because true = A >= 0 uses
│ │ │ │  the match operator =, a {badmatch,false} run-time error occurs when the
│ │ │ │ -expression fails to match the pattern.
The example can be written in a less succient way using nested case expressions:
case a() of
│ │ │ │ -    {ok, A} ->
│ │ │ │ +expression fails to match the pattern.
The example can be written in a less succient way using nested case expressions:
case a() of
│ │ │ │ +    {ok, A} ->
│ │ │ │          true = A >= 0,
│ │ │ │ -        case b() of
│ │ │ │ -            {ok, B} ->
│ │ │ │ +        case b() of
│ │ │ │ +            {ok, B} ->
│ │ │ │                  A + B;
│ │ │ │              Other1 ->
│ │ │ │                  Other1
│ │ │ │          end;
│ │ │ │      Other2 ->
│ │ │ │          Other2
│ │ │ │  end
The maybe block can be augmented with else clauses:
maybe
│ │ │ │      Expr1,
│ │ │ │      ...,
│ │ │ │      ExprN
│ │ │ │  else
│ │ │ │ -    Pattern1 [when GuardSeq1] ->
│ │ │ │ +    Pattern1 [when GuardSeq1] ->
│ │ │ │          Body1;
│ │ │ │      ...;
│ │ │ │ -    PatternN [when GuardSeqN] ->
│ │ │ │ +    PatternN [when GuardSeqN] ->
│ │ │ │          BodyN
│ │ │ │  end
If a conditional match operator fails, the failed expression is matched against
│ │ │ │  the patterns in all clauses between the else and end keywords. If a match
│ │ │ │  succeeds and the optional guard sequence GuardSeq is true, the corresponding
│ │ │ │  Body is evaluated. The value returned from the body is the return value of the
│ │ │ │  maybe block.
If there is no matching pattern with a true guard sequence, an else_clause
│ │ │ │  run-time error occurs.
None of the variables bound in a maybe block must be used in the else
│ │ │ │  clauses. None of the variables bound in the else clauses must be used in the
│ │ │ │  code that follows the maybe block.
Here is the previous example augmented with else clauses:
maybe
│ │ │ │ -    {ok, A} ?= a(),
│ │ │ │ +    {ok, A} ?= a(),
│ │ │ │      true = A >= 0,
│ │ │ │ -    {ok, B} ?= b(),
│ │ │ │ +    {ok, B} ?= b(),
│ │ │ │      A + B
│ │ │ │  else
│ │ │ │      error -> error;
│ │ │ │      wrong -> error
│ │ │ │  end
The else clauses translate the failing value from the conditional match
│ │ │ │  operators to the value error. If the failing value is not one of the
│ │ │ │  recognized values, a else_clause run-time error occurs.

│ │ │ │ @@ -386,75 +386,75 @@
│ │ │ │  {Name,Node} (or a pid located at another node), also never fails.

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Receive
│ │ │ │  

│ │ │ │  
receive
│ │ │ │ -    Pattern1 [when GuardSeq1] ->
│ │ │ │ +    Pattern1 [when GuardSeq1] ->
│ │ │ │          Body1;
│ │ │ │      ...;
│ │ │ │ -    PatternN [when GuardSeqN] ->
│ │ │ │ +    PatternN [when GuardSeqN] ->
│ │ │ │          BodyN
│ │ │ │  end
Fetches a received message present in the message queue of the process. The
│ │ │ │  first message in the message queue is matched sequentially against the patterns
│ │ │ │  from top to bottom. If no match was found, the matching sequence is repeated for
│ │ │ │  the second message in the queue, and so on. Messages are queued in the
│ │ │ │  order they were received. If a match
│ │ │ │  succeeds, that is, if the Pattern matches and the optional guard sequence
│ │ │ │  GuardSeq is true, then the message is removed from the message queue and the
│ │ │ │  corresponding Body is evaluated. All other messages in the message queue
│ │ │ │  remain unchanged.
The return value of Body is the return value of the receive expression.
receive never fails. The execution is suspended, possibly indefinitely, until
│ │ │ │  a message arrives that matches one of the patterns and with a true guard
│ │ │ │ -sequence.
Example:
wait_for_onhook() ->
│ │ │ │ +sequence.
Example:
wait_for_onhook() ->
│ │ │ │      receive
│ │ │ │          onhook ->
│ │ │ │ -            disconnect(),
│ │ │ │ -            idle();
│ │ │ │ -        {connect, B} ->
│ │ │ │ -            B ! {busy, self()},
│ │ │ │ -            wait_for_onhook()
│ │ │ │ +            disconnect(),
│ │ │ │ +            idle();
│ │ │ │ +        {connect, B} ->
│ │ │ │ +            B ! {busy, self()},
│ │ │ │ +            wait_for_onhook()
│ │ │ │      end.
The receive expression can be augmented with a timeout:
receive
│ │ │ │ -    Pattern1 [when GuardSeq1] ->
│ │ │ │ +    Pattern1 [when GuardSeq1] ->
│ │ │ │          Body1;
│ │ │ │      ...;
│ │ │ │ -    PatternN [when GuardSeqN] ->
│ │ │ │ +    PatternN [when GuardSeqN] ->
│ │ │ │          BodyN
│ │ │ │  after
│ │ │ │      ExprT ->
│ │ │ │          BodyT
│ │ │ │  end
receive...after works exactly as receive, except that if no matching message
│ │ │ │  has arrived within ExprT milliseconds, then BodyT is evaluated instead. The
│ │ │ │  return value of BodyT then becomes the return value of the receive...after
│ │ │ │  expression. ExprT is to evaluate to an integer, or the atom infinity. The
│ │ │ │  allowed integer range is from 0 to 4294967295, that is, the longest possible
│ │ │ │  timeout is almost 50 days. With a zero value the timeout occurs immediately if
│ │ │ │  there is no matching message in the message queue.
The atom infinity will make the process wait indefinitely for a matching
│ │ │ │  message. This is the same as not using a timeout. It can be useful for timeout
│ │ │ │ -values that are calculated at runtime.
Example:
wait_for_onhook() ->
│ │ │ │ +values that are calculated at runtime.
Example:
wait_for_onhook() ->
│ │ │ │      receive
│ │ │ │          onhook ->
│ │ │ │ -            disconnect(),
│ │ │ │ -            idle();
│ │ │ │ -        {connect, B} ->
│ │ │ │ -            B ! {busy, self()},
│ │ │ │ -            wait_for_onhook()
│ │ │ │ +            disconnect(),
│ │ │ │ +            idle();
│ │ │ │ +        {connect, B} ->
│ │ │ │ +            B ! {busy, self()},
│ │ │ │ +            wait_for_onhook()
│ │ │ │      after
│ │ │ │          60000 ->
│ │ │ │ -            disconnect(),
│ │ │ │ -            error()
│ │ │ │ +            disconnect(),
│ │ │ │ +            error()
│ │ │ │      end.
It is legal to use a receive...after expression with no branches:
receive
│ │ │ │  after
│ │ │ │      ExprT ->
│ │ │ │          BodyT
│ │ │ │  end
This construction does not consume any messages, only suspends execution in the
│ │ │ │ -process for ExprT milliseconds. This can be used to implement simple timers.
Example:
timer() ->
│ │ │ │ -    spawn(m, timer, [self()]).
│ │ │ │ +process for ExprT milliseconds. This can be used to implement simple timers.
Example:
timer() ->
│ │ │ │ +    spawn(m, timer, [self()]).
│ │ │ │  
│ │ │ │ -timer(Pid) ->
│ │ │ │ +timer(Pid) ->
│ │ │ │      receive
│ │ │ │      after
│ │ │ │          5000 ->
│ │ │ │              Pid ! timeout
│ │ │ │      end.
For more information on timers in Erlang in general, see the
│ │ │ │  Timers section of the
│ │ │ │  Time and Time Correction in Erlang
│ │ │ │ @@ -496,21 +496,21 @@
│ │ │ │  false
│ │ │ │  4> 0.0 =:= -0.0.
│ │ │ │  false
│ │ │ │  5> 0.0 =:= +0.0.
│ │ │ │  true
│ │ │ │  6> 1 > a.
│ │ │ │  false
│ │ │ │ -7> #{c => 3} > #{a => 1, b => 2}.
│ │ │ │ +7> #{c => 3} > #{a => 1, b => 2}.
│ │ │ │  false
│ │ │ │ -8> #{a => 1, b => 2} == #{a => 1.0, b => 2.0}.
│ │ │ │ +8> #{a => 1, b => 2} == #{a => 1.0, b => 2.0}.
│ │ │ │  true
│ │ │ │ -9> <<2:2>> < <<128>>.
│ │ │ │ +9> <<2:2>> < <<128>>.
│ │ │ │  true
│ │ │ │ -10> <<3:2>> < <<128>>.
│ │ │ │ +10> <<3:2>> < <<128>>.
│ │ │ │  false
Note
Prior to OTP 27, the term equivalence operators considered 0.0
│ │ │ │  and -0.0 to be the same term.
This was changed in OTP 27 but legacy code may have expected them to be
│ │ │ │  considered the same. To help users catch errors that may arise from an
│ │ │ │  upgrade, the compiler raises a warning when 0.0 is pattern-matched or used
│ │ │ │  in a term equivalence test.
If you need to match 0.0 specifically, the warning can be silenced by
│ │ │ │  writing +0.0 instead, which produces the same term but makes the compiler
│ │ │ │  interpret the match as being done on purpose.

│ │ │ │ @@ -536,15 +536,15 @@
│ │ │ │  0
│ │ │ │  8> 2#10 bor 2#01.
│ │ │ │  3
│ │ │ │  9> a + 10.
│ │ │ │  ** exception error: an error occurred when evaluating an arithmetic expression
│ │ │ │       in operator  +/2
│ │ │ │          called as a + 10
│ │ │ │ -10> 1 bsl (1 bsl 64).
│ │ │ │ +10> 1 bsl (1 bsl 64).
│ │ │ │  ** exception error: a system limit has been reached
│ │ │ │       in operator  bsl/2
│ │ │ │          called as 1 bsl 18446744073709551616

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Boolean Expressions
│ │ │ │ @@ -563,136 +563,136 @@
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Short-Circuit Expressions
│ │ │ │  

│ │ │ │  
Expr1 orelse Expr2
│ │ │ │  Expr1 andalso Expr2
Expr2 is evaluated only if necessary. That is, Expr2 is evaluated only if:
  • Expr1 evaluates to false in an orelse expression.
or
  • Expr1 evaluates to true in an andalso expression.
Returns either the value of Expr1 (that is, true or false) or the value of
│ │ │ │ -Expr2 (if Expr2 is evaluated).
Example 1:
case A >= -1.0 andalso math:sqrt(A+1) > B of
This works even if A is less than -1.0, since in that case, math:sqrt/1 is
│ │ │ │ -never evaluated.
Example 2:
OnlyOne = is_atom(L) orelse
│ │ │ │ -         (is_list(L) andalso length(L) == 1),
Expr2 is not required to evaluate to a Boolean value. Because of that,
│ │ │ │ -andalso and orelse are tail-recursive.
Example 3 (tail-recursive function):
all(Pred, [Hd|Tail]) ->
│ │ │ │ -    Pred(Hd) andalso all(Pred, Tail);
│ │ │ │ -all(_, []) ->
│ │ │ │ +Expr2 (if Expr2 is evaluated).
Example 1:
case A >= -1.0 andalso math:sqrt(A+1) > B of
This works even if A is less than -1.0, since in that case, math:sqrt/1 is
│ │ │ │ +never evaluated.
Example 2:
OnlyOne = is_atom(L) orelse
│ │ │ │ +         (is_list(L) andalso length(L) == 1),
Expr2 is not required to evaluate to a Boolean value. Because of that,
│ │ │ │ +andalso and orelse are tail-recursive.
Example 3 (tail-recursive function):
all(Pred, [Hd|Tail]) ->
│ │ │ │ +    Pred(Hd) andalso all(Pred, Tail);
│ │ │ │ +all(_, []) ->
│ │ │ │      true.
Change
Before Erlang/OTP R13A, Expr2 was required to evaluate to a Boolean value,
│ │ │ │  and as consequence, andalso and orelse were not tail-recursive.

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    List Operations
│ │ │ │  

│ │ │ │  
Expr1 ++ Expr2
│ │ │ │  Expr1 -- Expr2
The list concatenation operator ++ appends its second argument to its first
│ │ │ │  and returns the resulting list.
The list subtraction operator -- produces a list that is a copy of the first
│ │ │ │  argument. The procedure is as follows: for each element in the second argument,
│ │ │ │ -the first occurrence of this element (if any) is removed.
Example:
1> [1,2,3] ++ [4,5].
│ │ │ │ -[1,2,3,4,5]
│ │ │ │ -2> [1,2,3,2,1,2] -- [2,1,2].
│ │ │ │ -[3,1,2]

│ │ │ │ +the first occurrence of this element (if any) is removed.
Example:
1> [1,2,3] ++ [4,5].
│ │ │ │ +[1,2,3,4,5]
│ │ │ │ +2> [1,2,3,2,1,2] -- [2,1,2].
│ │ │ │ +[3,1,2]

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Map Expressions
│ │ │ │  

│ │ │ │  

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Creating Maps
│ │ │ │  

│ │ │ │  
Constructing a new map is done by letting an expression K be associated with
│ │ │ │ -another expression V:
#{K => V}
New maps can include multiple associations at construction by listing every
│ │ │ │ -association:
#{K1 => V1, ..., Kn => Vn}
An empty map is constructed by not associating any terms with each other:
#{}
All keys and values in the map are terms. Any expression is first evaluated and
│ │ │ │ +another expression V:
#{K => V}
New maps can include multiple associations at construction by listing every
│ │ │ │ +association:
#{K1 => V1, ..., Kn => Vn}
An empty map is constructed by not associating any terms with each other:
#{}
All keys and values in the map are terms. Any expression is first evaluated and
│ │ │ │  then the resulting terms are used as key and value respectively.
Keys and values are separated by the => arrow and associations are separated
│ │ │ │ -by a comma (,).
Examples:
M0 = #{},                 % empty map
│ │ │ │ -M1 = #{a => <<"hello">>}, % single association with literals
│ │ │ │ -M2 = #{1 => 2, b => b},   % multiple associations with literals
│ │ │ │ -M3 = #{k => {A,B}},       % single association with variables
│ │ │ │ -M4 = #{{"w", 1} => f()}.  % compound key associated with an evaluated expression
Here, A and B are any expressions and M0 through M4 are the resulting
│ │ │ │ -map terms.
If two matching keys are declared, the latter key takes precedence.
Example:
1> #{1 => a, 1 => b}.
│ │ │ │ -#{1 => b }
│ │ │ │ -2> #{1.0 => a, 1 => b}.
│ │ │ │ -#{1 => b, 1.0 => a}
The order in which the expressions constructing the keys (and their associated
│ │ │ │ +by a comma (,).
Examples:
M0 = #{},                 % empty map
│ │ │ │ +M1 = #{a => <<"hello">>}, % single association with literals
│ │ │ │ +M2 = #{1 => 2, b => b},   % multiple associations with literals
│ │ │ │ +M3 = #{k => {A,B}},       % single association with variables
│ │ │ │ +M4 = #{{"w", 1} => f()}.  % compound key associated with an evaluated expression
Here, A and B are any expressions and M0 through M4 are the resulting
│ │ │ │ +map terms.
If two matching keys are declared, the latter key takes precedence.
Example:
1> #{1 => a, 1 => b}.
│ │ │ │ +#{1 => b }
│ │ │ │ +2> #{1.0 => a, 1 => b}.
│ │ │ │ +#{1 => b, 1.0 => a}
The order in which the expressions constructing the keys (and their associated
│ │ │ │  values) are evaluated is not defined. The syntactic order of the key-value pairs
│ │ │ │  in the construction is of no relevance, except in the recently mentioned case of
│ │ │ │  two matching keys.

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Updating Maps
│ │ │ │  

│ │ │ │  
Updating a map has a similar syntax as constructing it.
An expression defining the map to be updated is put in front of the expression
│ │ │ │ -defining the keys to be updated and their respective values:
M#{K => V}
Here M is a term of type map and K and V are any expression.
If key K does not match any existing key in the map, a new association is
│ │ │ │ +defining the keys to be updated and their respective values:
M#{K => V}
Here M is a term of type map and K and V are any expression.
If key K does not match any existing key in the map, a new association is
│ │ │ │  created from key K to value V.
If key K matches an existing key in map M, its associated value is replaced
│ │ │ │  by the new value V. In both cases, the evaluated map expression returns a new
│ │ │ │ -map.
If M is not of type map, an exception of type badmap is raised.
To only update an existing value, the following syntax is used:
M#{K := V}
Here M is a term of type map, V is an expression and K is an expression
│ │ │ │ +map.
If M is not of type map, an exception of type badmap is raised.
To only update an existing value, the following syntax is used:
M#{K := V}
Here M is a term of type map, V is an expression and K is an expression
│ │ │ │  that evaluates to an existing key in M.
If key K does not match any existing keys in map M, an exception of type
│ │ │ │  badkey is raised at runtime. If a matching key K is present in map M,
│ │ │ │  its associated value is replaced by the new value V, and the evaluated map
│ │ │ │ -expression returns a new map.
If M is not of type map, an exception of type badmap is raised.
Examples:
M0 = #{},
│ │ │ │ -M1 = M0#{a => 0},
│ │ │ │ -M2 = M1#{a => 1, b => 2},
│ │ │ │ -M3 = M2#{"function" => fun() -> f() end},
│ │ │ │ -M4 = M3#{a := 2, b := 3}.  % 'a' and 'b' was added in `M1` and `M2`.
Here M0 is any map. It follows that M1 through M4 are maps as well.
More examples:
1> M = #{1 => a}.
│ │ │ │ -#{1 => a }
│ │ │ │ -2> M#{1.0 => b}.
│ │ │ │ -#{1 => a, 1.0 => b}.
│ │ │ │ -3> M#{1 := b}.
│ │ │ │ -#{1 => b}
│ │ │ │ -4> M#{1.0 := b}.
│ │ │ │ +expression returns a new map.
If M is not of type map, an exception of type badmap is raised.
Examples:
M0 = #{},
│ │ │ │ +M1 = M0#{a => 0},
│ │ │ │ +M2 = M1#{a => 1, b => 2},
│ │ │ │ +M3 = M2#{"function" => fun() -> f() end},
│ │ │ │ +M4 = M3#{a := 2, b := 3}.  % 'a' and 'b' was added in `M1` and `M2`.
Here M0 is any map. It follows that M1 through M4 are maps as well.
More examples:
1> M = #{1 => a}.
│ │ │ │ +#{1 => a }
│ │ │ │ +2> M#{1.0 => b}.
│ │ │ │ +#{1 => a, 1.0 => b}.
│ │ │ │ +3> M#{1 := b}.
│ │ │ │ +#{1 => b}
│ │ │ │ +4> M#{1.0 := b}.
│ │ │ │  ** exception error: bad argument
As in construction, the order in which the key and value expressions are
│ │ │ │  evaluated is not defined. The syntactic order of the key-value pairs in the
│ │ │ │  update is of no relevance, except in the case where two keys match. In that
│ │ │ │  case, the latter value is used.

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Maps in Patterns
│ │ │ │  

│ │ │ │ -
Matching of key-value associations from maps is done as follows:
#{K := V} = M
Here M is any map. The key K must be a
│ │ │ │ +
Matching of key-value associations from maps is done as follows:
#{K := V} = M
Here M is any map. The key K must be a
│ │ │ │  guard expression, with all variables already
│ │ │ │  bound. V can be any pattern with either bound or unbound variables.
If the variable V is unbound, it becomes bound to the value associated with
│ │ │ │  the key K, which must exist in the map M. If the variable V is bound, it
│ │ │ │  must match the value associated with K in M.
Change
Before Erlang/OTP 23, the expression defining the key K was restricted to be
│ │ │ │ -either a single variable or a literal.
Example:
1> M = #{"tuple" => {1,2}}.
│ │ │ │ -#{"tuple" => {1,2}}
│ │ │ │ -2> #{"tuple" := {1,B}} = M.
│ │ │ │ -#{"tuple" => {1,2}}
│ │ │ │ +either a single variable or a literal.
Example:
1> M = #{"tuple" => {1,2}}.
│ │ │ │ +#{"tuple" => {1,2}}
│ │ │ │ +2> #{"tuple" := {1,B}} = M.
│ │ │ │ +#{"tuple" => {1,2}}
│ │ │ │  3> B.
│ │ │ │ -2.
This binds variable B to integer 2.
Similarly, multiple values from the map can be matched:
#{K1 := V1, ..., Kn := Vn} = M
Here keys K1 through Kn are any expressions with literals or bound
│ │ │ │ +2.
This binds variable B to integer 2.
Similarly, multiple values from the map can be matched:
#{K1 := V1, ..., Kn := Vn} = M
Here keys K1 through Kn are any expressions with literals or bound
│ │ │ │  variables. If all key expressions evaluate successfully and all keys
│ │ │ │  exist in map M, all variables in V1 .. Vn is matched to the
│ │ │ │  associated values of their respective keys.
If the matching conditions are not met the match fails.
Note that when matching a map, only the := operator (not the =>) is allowed
│ │ │ │  as a delimiter for the associations.
The order in which keys are declared in matching has no relevance.
Duplicate keys are allowed in matching and match each pattern associated to the
│ │ │ │ -keys:
#{K := V1, K := V2} = M
The empty map literal (#{}) matches any map when used as a pattern:
#{} = Expr
This expression matches if the expression Expr is of type map, otherwise it
│ │ │ │ -fails with an exception badmatch.
Here the key to be retrieved is constructed from an expression:
#{{tag,length(List)} := V} = Map
List must be an already bound variable.
Matching Syntax
Matching of literals as keys are allowed in function heads:
%% only start if not_started
│ │ │ │ -handle_call(start, From, #{state := not_started} = S) ->
│ │ │ │ +keys:
#{K := V1, K := V2} = M
The empty map literal (#{}) matches any map when used as a pattern:
#{} = Expr
This expression matches if the expression Expr is of type map, otherwise it
│ │ │ │ +fails with an exception badmatch.
Here the key to be retrieved is constructed from an expression:
#{{tag,length(List)} := V} = Map
List must be an already bound variable.
Matching Syntax
Matching of literals as keys are allowed in function heads:
%% only start if not_started
│ │ │ │ +handle_call(start, From, #{state := not_started} = S) ->
│ │ │ │  ...
│ │ │ │ -    {reply, ok, S#{state := start}};
│ │ │ │ +    {reply, ok, S#{state := start}};
│ │ │ │  
│ │ │ │  %% only change if started
│ │ │ │ -handle_call(change, From, #{state := start} = S) ->
│ │ │ │ +handle_call(change, From, #{state := start} = S) ->
│ │ │ │  ...
│ │ │ │ -    {reply, ok, S#{state := changed}};

│ │ │ │ +    {reply, ok, S#{state := changed}};

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Maps in Guards
│ │ │ │  

│ │ │ │  
Maps are allowed in guards as long as all subexpressions are valid guard
│ │ │ │  expressions.
The following guard BIFs handle maps:

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Bit Syntax Expressions
│ │ │ │  

│ │ │ │  
The bit syntax operates on bit strings. A bit string is a sequence of bits
│ │ │ │ -ordered from the most significant bit to the least significant bit.
<<>>  % The empty bit string, zero length
│ │ │ │ -<<E1>>
│ │ │ │ -<<E1,...,En>>
Each element Ei specifies a segment of the bit string. The segments are
│ │ │ │ +ordered from the most significant bit to the least significant bit.
<<>>  % The empty bit string, zero length
│ │ │ │ +<<E1>>
│ │ │ │ +<<E1,...,En>>
Each element Ei specifies a segment of the bit string. The segments are
│ │ │ │  ordered left to right from the most significant bit to the least significant bit
│ │ │ │  of the bit string.
Each segment specification Ei is a value, whose default type is integer,
│ │ │ │  followed by an optional size expression and an optional type specifier list.
Ei = Value |
│ │ │ │       Value:Size |
│ │ │ │       Value/TypeSpecifierList |
│ │ │ │       Value:Size/TypeSpecifierList
When used in a bit string construction, Value is an expression that is to
│ │ │ │  evaluate to an integer, float, or bit string. If the expression is not a single
│ │ │ │ @@ -703,34 +703,34 @@
│ │ │ │  guard expression that evaluates to an
│ │ │ │  integer. All variables in the guard expression must be already bound.
Change
Before Erlang/OTP 23, Size was restricted to be an integer or a variable
│ │ │ │  bound to an integer.
The value of Size specifies the size of the segment in units (see below). The
│ │ │ │  default value depends on the type (see below):
  • For integer it is 8.
  • For float it is 64.
  • For binary and bitstring it is the whole binary or bit string.
In matching, the default value for a binary or bit string segment is only valid
│ │ │ │  for the last element. All other bit string or binary elements in the matching
│ │ │ │  must have a size specification.
Binaries
A bit string with a length that is a multiple of 8 bits is known as a binary,
│ │ │ │  which is the most common and useful type of bit string.
A binary has a canonical representation in memory. Here follows a sequence of
│ │ │ │ -bytes where each byte's value is its sequence number:
<<1, 2, 3, 4, 5, 6, 7, 8, 9, 10>>
Bit strings are a later generalization of binaries, so many texts and much
│ │ │ │ -information about binaries apply just as well for bit strings.
Example:
1> <<A/binary, B/binary>> = <<"abcde">>.
│ │ │ │ +bytes where each byte's value is its sequence number:
<<1, 2, 3, 4, 5, 6, 7, 8, 9, 10>>
Bit strings are a later generalization of binaries, so many texts and much
│ │ │ │ +information about binaries apply just as well for bit strings.
Example:
1> <<A/binary, B/binary>> = <<"abcde">>.
│ │ │ │  * 1:3: a binary field without size is only allowed at the end of a binary pattern
│ │ │ │ -2> <<A:3/binary, B/binary>> = <<"abcde">>.
│ │ │ │ -<<"abcde">>
│ │ │ │ +2> <<A:3/binary, B/binary>> = <<"abcde">>.
│ │ │ │ +<<"abcde">>
│ │ │ │  3> A.
│ │ │ │ -<<"abc">>
│ │ │ │ +<<"abc">>
│ │ │ │  4> B.
│ │ │ │ -<<"de">>
For the utf8, utf16, and utf32 types, Size must not be given. The size
│ │ │ │ +<<"de">>
For the utf8, utf16, and utf32 types, Size must not be given. The size
│ │ │ │  of the segment is implicitly determined by the type and value itself.
TypeSpecifierList is a list of type specifiers, in any order, separated by
│ │ │ │  hyphens (-). Default values are used for any omitted type specifiers.
  • Type= integer | float | binary | bytes | bitstring | bits |
│ │ │ │  utf8 | utf16 | utf32 - The default is integer. bytes is a
│ │ │ │  shorthand for binary and bits is a shorthand for bitstring. See below
│ │ │ │  for more information about the utf types.
  • Signedness= signed | unsigned - Only matters for matching and when
│ │ │ │  the type is integer. The default is unsigned.
  • Endianness= big | little | native - Specifies byte level (octet
│ │ │ │  level) endianness (byte order). Native-endian means that the endianness is
│ │ │ │  resolved at load time to be either big-endian or little-endian, depending on
│ │ │ │  what is native for the CPU that the Erlang machine is run on. Endianness only
│ │ │ │  matters when the Type is either integer, utf16, utf32, or float. The
│ │ │ │ -default is big.
    <<16#1234:16/little>> = <<16#3412:16>> = <<16#34:8, 16#12:8>>
  • Unit= unit:IntegerLiteral - The allowed range is 1 through 256.
│ │ │ │ +default is big.
    <<16#1234:16/little>> = <<16#3412:16>> = <<16#34:8, 16#12:8>>
  • Unit= unit:IntegerLiteral - The allowed range is 1 through 256.
│ │ │ │  Defaults to 1 for integer, float, and bitstring, and to 8 for binary.
│ │ │ │  For types bitstring, bits, and bytes, it is not allowed to specify a
│ │ │ │  unit value different from the default value. No unit specifier must be given
│ │ │ │  for the types utf8, utf16, and utf32.

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │ @@ -755,41 +755,41 @@
│ │ │ │    
│ │ │ │    Binary segments
│ │ │ │  

│ │ │ │  
In this section, the phrase "binary segment" refers to any one of the segment
│ │ │ │  types binary, bitstring, bytes, and bits.
See also the paragraphs about Binaries.
When constructing binaries and no size is specified for a binary segment, the
│ │ │ │  entire binary value is interpolated into the binary being constructed. However,
│ │ │ │  the size in bits of the binary being interpolated must be evenly divisible by
│ │ │ │ -the unit value for the segment; otherwise an exception is raised.
For example, the following examples all succeed:
1> <<(<<"abc">>)/bitstring>>.
│ │ │ │ -<<"abc">>
│ │ │ │ -2> <<(<<"abc">>)/binary-unit:1>>.
│ │ │ │ -<<"abc">>
│ │ │ │ -3> <<(<<"abc">>)/binary>>.
│ │ │ │ -<<"abc">>
The first two examples have a unit value of 1 for the segment, while the third
│ │ │ │ +the unit value for the segment; otherwise an exception is raised.
For example, the following examples all succeed:
1> <<(<<"abc">>)/bitstring>>.
│ │ │ │ +<<"abc">>
│ │ │ │ +2> <<(<<"abc">>)/binary-unit:1>>.
│ │ │ │ +<<"abc">>
│ │ │ │ +3> <<(<<"abc">>)/binary>>.
│ │ │ │ +<<"abc">>
The first two examples have a unit value of 1 for the segment, while the third
│ │ │ │  segment has a unit value of 8.
Attempting to interpolate a bit string of size 1 into a binary segment with unit
│ │ │ │ -8 (the default unit for binary) fails as shown in this example:
1> <<(<<1:1>>)/binary>>.
│ │ │ │ -** exception error: bad argument
For the construction to succeed, the unit value of the segment must be 1:
2> <<(<<1:1>>)/bitstring>>.
│ │ │ │ -<<1:1>>
│ │ │ │ -3> <<(<<1:1>>)/binary-unit:1>>.
│ │ │ │ -<<1:1>>
Similarly, when matching a binary segment with no size specified, the match
│ │ │ │ +8 (the default unit for binary) fails as shown in this example:
1> <<(<<1:1>>)/binary>>.
│ │ │ │ +** exception error: bad argument
For the construction to succeed, the unit value of the segment must be 1:
2> <<(<<1:1>>)/bitstring>>.
│ │ │ │ +<<1:1>>
│ │ │ │ +3> <<(<<1:1>>)/binary-unit:1>>.
│ │ │ │ +<<1:1>>
Similarly, when matching a binary segment with no size specified, the match
│ │ │ │  succeeds if and only if the size in bits of the rest of the binary is evenly
│ │ │ │ -divisible by the unit value:
1> <<_/binary-unit:16>> = <<"">>.
│ │ │ │ -<<>>
│ │ │ │ -2> <<_/binary-unit:16>> = <<"a">>.
│ │ │ │ +divisible by the unit value:
1> <<_/binary-unit:16>> = <<"">>.
│ │ │ │ +<<>>
│ │ │ │ +2> <<_/binary-unit:16>> = <<"a">>.
│ │ │ │  ** exception error: no match of right hand side value <<"a">>
│ │ │ │ -3> <<_/binary-unit:16>> = <<"ab">>.
│ │ │ │ -<<"ab">>
│ │ │ │ -4> <<_/binary-unit:16>> = <<"abc">>.
│ │ │ │ +3> <<_/binary-unit:16>> = <<"ab">>.
│ │ │ │ +<<"ab">>
│ │ │ │ +4> <<_/binary-unit:16>> = <<"abc">>.
│ │ │ │  ** exception error: no match of right hand side value <<"abc">>
│ │ │ │ -5> <<_/binary-unit:16>> = <<"abcd">>.
│ │ │ │ -<<"abcd">>
When a size is explicitly specified for a binary segment, the segment size in
│ │ │ │ +5> <<_/binary-unit:16>> = <<"abcd">>.
│ │ │ │ +<<"abcd">>
When a size is explicitly specified for a binary segment, the segment size in
│ │ │ │  bits is the value of Size multiplied by the default or explicit unit value.
When constructing binaries, the size of the binary being interpolated into the
│ │ │ │ -constructed binary must be at least as large as the size of the binary segment.
Examples:
1> <<(<<"abc">>):2/binary>>.
│ │ │ │ -<<"ab">>
│ │ │ │ -2> <<(<<"a">>):2/binary>>.
│ │ │ │ +constructed binary must be at least as large as the size of the binary segment.
Examples:
1> <<(<<"abc">>):2/binary>>.
│ │ │ │ +<<"ab">>
│ │ │ │ +2> <<(<<"a">>):2/binary>>.
│ │ │ │  ** exception error: construction of binary failed
│ │ │ │          *** segment 1 of type 'binary': the value <<"a">> is shorter than the size of the segment

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Unicode segments
│ │ │ │  

│ │ │ │ @@ -805,78 +805,78 @@
│ │ │ │  range 0 through 16#D7FF or 16#E000 through 16#10FFFF. The match fails if the
│ │ │ │  returned value falls outside those ranges.
A segment of type utf8 matches 1-4 bytes in the bit string, if the bit string
│ │ │ │  at the match position contains a valid UTF-8 sequence. (See RFC-3629 or the
│ │ │ │  Unicode standard.)
A segment of type utf16 can match 2 or 4 bytes in the bit string. The match
│ │ │ │  fails if the bit string at the match position does not contain a legal UTF-16
│ │ │ │  encoding of a Unicode code point. (See RFC-2781 or the Unicode standard.)
A segment of type utf32 can match 4 bytes in the bit string in the same way as
│ │ │ │  an integer segment matches 32 bits. The match fails if the resulting integer
│ │ │ │ -is outside the legal ranges previously mentioned.
Examples:
1> Bin1 = <<1,17,42>>.
│ │ │ │ -<<1,17,42>>
│ │ │ │ -2> Bin2 = <<"abc">>.
│ │ │ │ -<<97,98,99>>
│ │ │ │ +is outside the legal ranges previously mentioned.
Examples:
1> Bin1 = <<1,17,42>>.
│ │ │ │ +<<1,17,42>>
│ │ │ │ +2> Bin2 = <<"abc">>.
│ │ │ │ +<<97,98,99>>
│ │ │ │  
│ │ │ │ -3> Bin3 = <<1,17,42:16>>.
│ │ │ │ -<<1,17,0,42>>
│ │ │ │ -4> <<A,B,C:16>> = <<1,17,42:16>>.
│ │ │ │ -<<1,17,0,42>>
│ │ │ │ +3> Bin3 = <<1,17,42:16>>.
│ │ │ │ +<<1,17,0,42>>
│ │ │ │ +4> <<A,B,C:16>> = <<1,17,42:16>>.
│ │ │ │ +<<1,17,0,42>>
│ │ │ │  5> C.
│ │ │ │  42
│ │ │ │ -6> <<D:16,E,F>> = <<1,17,42:16>>.
│ │ │ │ -<<1,17,0,42>>
│ │ │ │ +6> <<D:16,E,F>> = <<1,17,42:16>>.
│ │ │ │ +<<1,17,0,42>>
│ │ │ │  7> D.
│ │ │ │  273
│ │ │ │  8> F.
│ │ │ │  42
│ │ │ │ -9> <<G,H/binary>> = <<1,17,42:16>>.
│ │ │ │ -<<1,17,0,42>>
│ │ │ │ +9> <<G,H/binary>> = <<1,17,42:16>>.
│ │ │ │ +<<1,17,0,42>>
│ │ │ │  10> H.
│ │ │ │ -<<17,0,42>>
│ │ │ │ -11> <<G,J/bitstring>> = <<1,17,42:12>>.
│ │ │ │ -<<1,17,2,10:4>>
│ │ │ │ +<<17,0,42>>
│ │ │ │ +11> <<G,J/bitstring>> = <<1,17,42:12>>.
│ │ │ │ +<<1,17,2,10:4>>
│ │ │ │  12> J.
│ │ │ │ -<<17,2,10:4>>
│ │ │ │ +<<17,2,10:4>>
│ │ │ │  
│ │ │ │ -13> <<1024/utf8>>.
│ │ │ │ -<<208,128>>
│ │ │ │ +13> <<1024/utf8>>.
│ │ │ │ +<<208,128>>
│ │ │ │  
│ │ │ │ -14> <<1:1,0:7>>.
│ │ │ │ -<<128>>
│ │ │ │ -15> <<16#123:12/little>> = <<16#231:12>> = <<2:4, 3:4, 1:4>>.
│ │ │ │ -<<35,1:4>>
Notice that bit string patterns cannot be nested.
Notice also that "B=<<1>>" is interpreted as "B =< <1>>" which is a syntax
│ │ │ │ +14> <<1:1,0:7>>.
│ │ │ │ +<<128>>
│ │ │ │ +15> <<16#123:12/little>> = <<16#231:12>> = <<2:4, 3:4, 1:4>>.
│ │ │ │ +<<35,1:4>>
Notice that bit string patterns cannot be nested.
Notice also that "B=<<1>>" is interpreted as "B =< <1>>" which is a syntax
│ │ │ │  error. The correct way is to write a space after =: "B = <<1>>.
More examples are provided in Programming Examples.

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Fun Expressions
│ │ │ │  

│ │ │ │  
fun
│ │ │ │ -    [Name](Pattern11,...,Pattern1N) [when GuardSeq1] ->
│ │ │ │ +    [Name](Pattern11,...,Pattern1N) [when GuardSeq1] ->
│ │ │ │                Body1;
│ │ │ │      ...;
│ │ │ │ -    [Name](PatternK1,...,PatternKN) [when GuardSeqK] ->
│ │ │ │ +    [Name](PatternK1,...,PatternKN) [when GuardSeqK] ->
│ │ │ │                BodyK
│ │ │ │  end
A fun expression begins with the keyword fun and ends with the keyword end.
│ │ │ │  Between them is to be a function declaration, similar to a
│ │ │ │  regular function declaration,
│ │ │ │  except that the function name is optional and is to be a variable, if any.
Variables in a fun head shadow the function name and both shadow variables in
│ │ │ │  the function clause surrounding the fun expression. Variables bound in a fun
│ │ │ │ -body are local to the fun body.
The return value of the expression is the resulting fun.
Examples:
1> Fun1 = fun (X) -> X+1 end.
│ │ │ │ +body are local to the fun body.
The return value of the expression is the resulting fun.
Examples:
1> Fun1 = fun (X) -> X+1 end.
│ │ │ │  #Fun<erl_eval.6.39074546>
│ │ │ │ -2> Fun1(2).
│ │ │ │ +2> Fun1(2).
│ │ │ │  3
│ │ │ │ -3> Fun2 = fun (X) when X>=5 -> gt; (X) -> lt end.
│ │ │ │ +3> Fun2 = fun (X) when X>=5 -> gt; (X) -> lt end.
│ │ │ │  #Fun<erl_eval.6.39074546>
│ │ │ │ -4> Fun2(7).
│ │ │ │ +4> Fun2(7).
│ │ │ │  gt
│ │ │ │ -5> Fun3 = fun Fact(1) -> 1; Fact(X) when X > 1 -> X * Fact(X - 1) end.
│ │ │ │ +5> Fun3 = fun Fact(1) -> 1; Fact(X) when X > 1 -> X * Fact(X - 1) end.
│ │ │ │  #Fun<erl_eval.6.39074546>
│ │ │ │ -6> Fun3(4).
│ │ │ │ +6> Fun3(4).
│ │ │ │  24
The following fun expressions are also allowed:
fun Name/Arity
│ │ │ │  fun Module:Name/Arity
In Name/Arity, Name is an atom and Arity is an integer. Name/Arity must
│ │ │ │ -specify an existing local function. The expression is syntactic sugar for:
fun (Arg1,...,ArgN) -> Name(Arg1,...,ArgN) end
In Module:Name/Arity, Module, and Name are atoms and Arity is an
│ │ │ │ +specify an existing local function. The expression is syntactic sugar for:
fun (Arg1,...,ArgN) -> Name(Arg1,...,ArgN) end
In Module:Name/Arity, Module, and Name are atoms and Arity is an
│ │ │ │  integer. Module, Name, and Arity can also be variables. A fun defined in
│ │ │ │  this way refers to the function Name with arity Arity in the latest
│ │ │ │  version of module Module. A fun defined in this way is not dependent on the
│ │ │ │  code for the module in which it is defined.
Change
Before Erlang/OTP R15, Module, Name, and Arity were not allowed to be
│ │ │ │  variables.
More examples are provided in Programming Examples.

│ │ │ │    
│ │ │ │      
│ │ │ │ @@ -886,35 +886,35 @@
│ │ │ │  
catch Expr
Returns the value of Expr unless an exception is raised during the evaluation. In
│ │ │ │  that case, the exception is caught. The return value depends on the class of the
│ │ │ │  exception:
Reason depends on the type of error that occurred, and Stack is the stack of
│ │ │ │  recent function calls, see Exit Reasons.
Examples:
1> catch 1+2.
│ │ │ │  3
│ │ │ │  2> catch 1+a.
│ │ │ │ -{'EXIT',{badarith,[...]}}
The BIF throw(Any) can be used for non-local return from a
│ │ │ │ -function. It must be evaluated within a catch, which returns the value Any.
Example:
3> catch throw(hello).
│ │ │ │ +{'EXIT',{badarith,[...]}}
The BIF throw(Any) can be used for non-local return from a
│ │ │ │ +function. It must be evaluated within a catch, which returns the value Any.
Example:
3> catch throw(hello).
│ │ │ │  hello
If throw/1 is not evaluated within a catch, a nocatch run-time
│ │ │ │  error occurs.
Change
Before Erlang/OTP 24, the catch operator had the lowest precedence, making
│ │ │ │ -it necessary to add parentheses when combining it with the match operator:
1> A = (catch 42).
│ │ │ │ +it necessary to add parentheses when combining it with the match operator:
1> A = (catch 42).
│ │ │ │  42
│ │ │ │  2> A.
│ │ │ │  42
Starting from Erlang/OTP 24, the parentheses can be omitted:
1> A = catch 42.
│ │ │ │  42
│ │ │ │  2> A.
│ │ │ │  42

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Try
│ │ │ │  

│ │ │ │  
try Exprs
│ │ │ │  catch
│ │ │ │ -    Class1:ExceptionPattern1[:Stacktrace] [when ExceptionGuardSeq1] ->
│ │ │ │ +    Class1:ExceptionPattern1[:Stacktrace] [when ExceptionGuardSeq1] ->
│ │ │ │          ExceptionBody1;
│ │ │ │ -    ClassN:ExceptionPatternN[:Stacktrace] [when ExceptionGuardSeqN] ->
│ │ │ │ +    ClassN:ExceptionPatternN[:Stacktrace] [when ExceptionGuardSeqN] ->
│ │ │ │          ExceptionBodyN
│ │ │ │  end
This is an enhancement of catch. It gives the
│ │ │ │  possibility to:
  • Distinguish between different exception classes.
  • Choose to handle only the desired ones.
  • Passing the others on to an enclosing try or catch, or to default error
│ │ │ │  handling.
Notice that although the keyword catch is used in the try expression, there
│ │ │ │  is not a catch expression within the try expression.
It returns the value of Exprs (a sequence of expressions Expr1, ..., ExprN)
│ │ │ │  unless an exception occurs during the evaluation. In that case the exception is
│ │ │ │  caught and the patterns ExceptionPattern with the right exception class
│ │ │ │ @@ -924,47 +924,47 @@
│ │ │ │  stack trace is bound to the variable when the corresponding ExceptionPattern
│ │ │ │  matches.
If an exception occurs during evaluation of Exprs but there is no matching
│ │ │ │  ExceptionPattern of the right Class with a true guard sequence, the
│ │ │ │  exception is passed on as if Exprs had not been enclosed in a try
│ │ │ │  expression.
If an exception occurs during evaluation of ExceptionBody, it is not caught.
It is allowed to omit Class and Stacktrace. An omitted Class is shorthand
│ │ │ │  for throw:
try Exprs
│ │ │ │  catch
│ │ │ │ -    ExceptionPattern1 [when ExceptionGuardSeq1] ->
│ │ │ │ +    ExceptionPattern1 [when ExceptionGuardSeq1] ->
│ │ │ │          ExceptionBody1;
│ │ │ │ -    ExceptionPatternN [when ExceptionGuardSeqN] ->
│ │ │ │ +    ExceptionPatternN [when ExceptionGuardSeqN] ->
│ │ │ │          ExceptionBodyN
│ │ │ │  end
The try expression can have an of section:
try Exprs of
│ │ │ │ -    Pattern1 [when GuardSeq1] ->
│ │ │ │ +    Pattern1 [when GuardSeq1] ->
│ │ │ │          Body1;
│ │ │ │      ...;
│ │ │ │ -    PatternN [when GuardSeqN] ->
│ │ │ │ +    PatternN [when GuardSeqN] ->
│ │ │ │          BodyN
│ │ │ │  catch
│ │ │ │ -    Class1:ExceptionPattern1[:Stacktrace] [when ExceptionGuardSeq1] ->
│ │ │ │ +    Class1:ExceptionPattern1[:Stacktrace] [when ExceptionGuardSeq1] ->
│ │ │ │          ExceptionBody1;
│ │ │ │      ...;
│ │ │ │ -    ClassN:ExceptionPatternN[:Stacktrace] [when ExceptionGuardSeqN] ->
│ │ │ │ +    ClassN:ExceptionPatternN[:Stacktrace] [when ExceptionGuardSeqN] ->
│ │ │ │          ExceptionBodyN
│ │ │ │  end
If the evaluation of Exprs succeeds without an exception, the patterns
│ │ │ │  Pattern are sequentially matched against the result in the same way as for a
│ │ │ │  case expression, except that if the matching fails, a
│ │ │ │  try_clause run-time error occurs instead of a case_clause.
Only exceptions occurring during the evaluation of Exprs can be caught by the
│ │ │ │  catch section. Exceptions occurring in a Body or due to a failed match are
│ │ │ │  not caught.
The try expression can also be augmented with an after section, intended to
│ │ │ │  be used for cleanup with side effects:
try Exprs of
│ │ │ │ -    Pattern1 [when GuardSeq1] ->
│ │ │ │ +    Pattern1 [when GuardSeq1] ->
│ │ │ │          Body1;
│ │ │ │      ...;
│ │ │ │ -    PatternN [when GuardSeqN] ->
│ │ │ │ +    PatternN [when GuardSeqN] ->
│ │ │ │          BodyN
│ │ │ │  catch
│ │ │ │ -    Class1:ExceptionPattern1[:Stacktrace] [when ExceptionGuardSeq1] ->
│ │ │ │ +    Class1:ExceptionPattern1[:Stacktrace] [when ExceptionGuardSeq1] ->
│ │ │ │          ExceptionBody1;
│ │ │ │      ...;
│ │ │ │ -    ClassN:ExceptionPatternN[:Stacktrace] [when ExceptionGuardSeqN] ->
│ │ │ │ +    ClassN:ExceptionPatternN[:Stacktrace] [when ExceptionGuardSeqN] ->
│ │ │ │          ExceptionBodyN
│ │ │ │  after
│ │ │ │      AfterBody
│ │ │ │  end
AfterBody is evaluated after either Body or ExceptionBody, no matter which
│ │ │ │  one. The evaluated value of AfterBody is lost; the return value of the try
│ │ │ │  expression is the same with an after section as without.
Even if an exception occurs during evaluation of Body or ExceptionBody,
│ │ │ │  AfterBody is evaluated. In this case the exception is passed on after
│ │ │ │ @@ -987,40 +987,40 @@
│ │ │ │          ExpressionBody
│ │ │ │  after
│ │ │ │      AfterBody
│ │ │ │  end
│ │ │ │  
│ │ │ │  try Exprs after AfterBody end
Next is an example of using after. This closes the file, even in the event of
│ │ │ │  exceptions in file:read/2 or in binary_to_term/1. The
│ │ │ │ -exceptions are the same as without the try...after...end expression:
termize_file(Name) ->
│ │ │ │ -    {ok,F} = file:open(Name, [read,binary]),
│ │ │ │ +exceptions are the same as without the try...after...end expression:
termize_file(Name) ->
│ │ │ │ +    {ok,F} = file:open(Name, [read,binary]),
│ │ │ │      try
│ │ │ │ -        {ok,Bin} = file:read(F, 1024*1024),
│ │ │ │ -        binary_to_term(Bin)
│ │ │ │ +        {ok,Bin} = file:read(F, 1024*1024),
│ │ │ │ +        binary_to_term(Bin)
│ │ │ │      after
│ │ │ │ -        file:close(F)
│ │ │ │ +        file:close(F)
│ │ │ │      end.
Next is an example of using try to emulate catch Expr:
try Expr
│ │ │ │  catch
│ │ │ │      throw:Term -> Term;
│ │ │ │ -    exit:Reason -> {'EXIT',Reason};
│ │ │ │ -    error:Reason:Stk -> {'EXIT',{Reason,Stk}}
│ │ │ │ +    exit:Reason -> {'EXIT',Reason};
│ │ │ │ +    error:Reason:Stk -> {'EXIT',{Reason,Stk}}
│ │ │ │  end
Variables bound in the various parts of these expressions have different scopes.
│ │ │ │  Variables bound just after the try keyword are:
  • bound in the of section
  • unsafe in both the catch and after sections, as well as after the whole
│ │ │ │  construct
Variables bound in of section are:
  • unbound in the catch section
  • unsafe in both the after section, as well as after the whole construct
Variables bound in the catch section are unsafe in the after section, as
│ │ │ │  well as after the whole construct.
Variables bound in the after section are unsafe after the whole construct.

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Parenthesized Expressions
│ │ │ │  

│ │ │ │ -
(Expr)
Parenthesized expressions are useful to override
│ │ │ │ +
(Expr)
Parenthesized expressions are useful to override
│ │ │ │  operator precedences, for example, in arithmetic
│ │ │ │  expressions:
1> 1 + 2 * 3.
│ │ │ │  7
│ │ │ │ -2> (1 + 2) * 3.
│ │ │ │ +2> (1 + 2) * 3.
│ │ │ │  9

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Block Expressions
│ │ │ │  

│ │ │ │  
begin
│ │ │ │ @@ -1032,71 +1032,71 @@
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Comprehensions
│ │ │ │  

│ │ │ │  
Comprehensions provide a succinct notation for iterating over one or more terms
│ │ │ │  and constructing a new term. Comprehensions come in three different flavors,
│ │ │ │ -depending on the type of term they build.
List comprehensions construct lists. They have the following syntax:
[Expr || Qualifier1, . . ., QualifierN]
Here, Expr is an arbitrary expression, and each Qualifier is either a
│ │ │ │ +depending on the type of term they build.
List comprehensions construct lists. They have the following syntax:
[Expr || Qualifier1, . . ., QualifierN]
Here, Expr is an arbitrary expression, and each Qualifier is either a
│ │ │ │  generator or a filter.
Bit string comprehensions construct bit strings or binaries. They have the
│ │ │ │ -following syntax:
<< BitStringExpr || Qualifier1, . . ., QualifierN >>
BitStringExpr is an expression that evaluates to a bit string. If
│ │ │ │ +following syntax:
<< BitStringExpr || Qualifier1, . . ., QualifierN >>
BitStringExpr is an expression that evaluates to a bit string. If
│ │ │ │  BitStringExpr is a function call, it must be enclosed in parentheses. Each
│ │ │ │ -Qualifier is either a generator or a filter.
Map comprehensions construct maps. They have the following syntax:
#{KeyExpr => ValueExpr || Qualifier1, . . ., QualifierN}
Here, KeyExpr and ValueExpr are arbitrary expressions, and each Qualifier
│ │ │ │ +Qualifier is either a generator or a filter.
Map comprehensions construct maps. They have the following syntax:
#{KeyExpr => ValueExpr || Qualifier1, . . ., QualifierN}
Here, KeyExpr and ValueExpr are arbitrary expressions, and each Qualifier
│ │ │ │  is either a generator or a filter.
Change
Map comprehensions and map generators were introduced in Erlang/OTP 26.
There are three kinds of generators.
A list generator has the following syntax:
Pattern <- ListExpr
where ListExpr is an expression that evaluates to a list of terms.
A bit string generator has the following syntax:
BitstringPattern <= BitStringExpr
where BitStringExpr is an expression that evaluates to a bit string.
A map generator has the following syntax:
KeyPattern := ValuePattern <- MapExpression
where MapExpr is an expression that evaluates to a map, or a map iterator
│ │ │ │  obtained by calling maps:iterator/1 or maps:iterator/2.
A filter is an expression that evaluates to true or false.
The variables in the generator patterns shadow previously bound variables,
│ │ │ │  including variables bound in a previous generator pattern.
Variables bound in a generator expression are not visible outside the
│ │ │ │ -expression:
1> [{E,L} || E <- L=[1,2,3]].
│ │ │ │ +expression:
1> [{E,L} || E <- L=[1,2,3]].
│ │ │ │  * 1:5: variable 'L' is unbound
A list comprehension returns a list, where the list elements are the result
│ │ │ │  of evaluating Expr for each combination of generator elements for which all
│ │ │ │  filters are true.
A bit string comprehension returns a bit string, which is created by
│ │ │ │  concatenating the results of evaluating BitStringExpr for each combination of
│ │ │ │  bit string generator elements for which all filters are true.
A map comprehension returns a map, where the map elements are the result of
│ │ │ │  evaluating KeyExpr and ValueExpr for each combination of generator elements
│ │ │ │  for which all filters are true. If the key expressions are not unique, the last
│ │ │ │ -occurrence is stored in the map.
Examples:
Multiplying each element in a list by two:
1> [X*2 || X <- [1,2,3]].
│ │ │ │ -[2,4,6]
Multiplying each byte in a binary by two, returning a list:
1> [X*2 || <<X>> <= <<1,2,3>>].
│ │ │ │ -[2,4,6]
Multiplying each byte in a binary by two:
1> << <<(X*2)>> || <<X>> <= <<1,2,3>> >>.
│ │ │ │ -<<2,4,6>>
Multiplying each element in a list by two, returning a binary:
1> << <<(X*2)>> || X <- [1,2,3] >>.
│ │ │ │ -<<2,4,6>>
Creating a mapping from an integer to its square:
1> #{X => X*X || X <- [1,2,3]}.
│ │ │ │ -#{1 => 1,2 => 4,3 => 9}
Multiplying the value of each element in a map by two:
1> #{K => 2*V || K := V <- #{a => 1,b => 2,c => 3}}.
│ │ │ │ -#{a => 2,b => 4,c => 6}
Filtering a list, keeping odd numbers:
1> [X || X <- [1,2,3,4,5], X rem 2 =:= 1].
│ │ │ │ -[1,3,5]
Filtering a list, keeping only elements that match:
1> [X || {_,_}=X <- [{a,b}, [a], {x,y,z}, {1,2}]].
│ │ │ │ -[{a,b},{1,2}]
Combining elements from two list generators:
1> [{P,Q} || P <- [a,b,c], Q <- [1,2]].
│ │ │ │ -[{a,1},{a,2},{b,1},{b,2},{c,1},{c,2}]
More examples are provided in
│ │ │ │ +occurrence is stored in the map.
Examples:
Multiplying each element in a list by two:
1> [X*2 || X <- [1,2,3]].
│ │ │ │ +[2,4,6]
Multiplying each byte in a binary by two, returning a list:
1> [X*2 || <<X>> <= <<1,2,3>>].
│ │ │ │ +[2,4,6]
Multiplying each byte in a binary by two:
1> << <<(X*2)>> || <<X>> <= <<1,2,3>> >>.
│ │ │ │ +<<2,4,6>>
Multiplying each element in a list by two, returning a binary:
1> << <<(X*2)>> || X <- [1,2,3] >>.
│ │ │ │ +<<2,4,6>>
Creating a mapping from an integer to its square:
1> #{X => X*X || X <- [1,2,3]}.
│ │ │ │ +#{1 => 1,2 => 4,3 => 9}
Multiplying the value of each element in a map by two:
1> #{K => 2*V || K := V <- #{a => 1,b => 2,c => 3}}.
│ │ │ │ +#{a => 2,b => 4,c => 6}
Filtering a list, keeping odd numbers:
1> [X || X <- [1,2,3,4,5], X rem 2 =:= 1].
│ │ │ │ +[1,3,5]
Filtering a list, keeping only elements that match:
1> [X || {_,_}=X <- [{a,b}, [a], {x,y,z}, {1,2}]].
│ │ │ │ +[{a,b},{1,2}]
Combining elements from two list generators:
1> [{P,Q} || P <- [a,b,c], Q <- [1,2]].
│ │ │ │ +[{a,1},{a,2},{b,1},{b,2},{c,1},{c,2}]
More examples are provided in
│ │ │ │  Programming Examples.
When there are no generators, a comprehension returns either a term constructed
│ │ │ │  from a single element (the result of evaluating Expr) if all filters are true,
│ │ │ │  or a term constructed from no elements (that is, [] for list comprehension,
│ │ │ │ -<<>> for a bit string comprehension, and #{} for a map comprehension).
Example:
1> [2 || is_integer(2)].
│ │ │ │ -[2]
│ │ │ │ -2> [x || is_integer(x)].
│ │ │ │ -[]
What happens when the filter expression does not evaluate to a boolean value
│ │ │ │ +<<>> for a bit string comprehension, and #{} for a map comprehension).
Example:
1> [2 || is_integer(2)].
│ │ │ │ +[2]
│ │ │ │ +2> [x || is_integer(x)].
│ │ │ │ +[]
What happens when the filter expression does not evaluate to a boolean value
│ │ │ │  depends on the expression:
  • If the expression is a guard expression,
│ │ │ │  failure to evaluate or evaluating to a non-boolean value is equivalent to
│ │ │ │  evaluating to false.
  • If the expression is not a guard expression and evaluates to a non-Boolean
│ │ │ │  value Val, an exception {bad_filter, Val} is triggered at runtime. If the
│ │ │ │  evaluation of the expression raises an exception, it is not caught by the
│ │ │ │ -comprehension.
Examples (using a guard expression as filter):
1> List = [1,2,a,b,c,3,4].
│ │ │ │ -[1,2,a,b,c,3,4]
│ │ │ │ -2> [E || E <- List, E rem 2].
│ │ │ │ -[]
│ │ │ │ -3> [E || E <- List, E rem 2 =:= 0].
│ │ │ │ -[2,4]
Examples (using a non-guard expression as filter):
1> List = [1,2,a,b,c,3,4].
│ │ │ │ -[1,2,a,b,c,3,4]
│ │ │ │ -2> FaultyIsEven = fun(E) -> E rem 2 end.
│ │ │ │ +comprehension.
Examples (using a guard expression as filter):
1> List = [1,2,a,b,c,3,4].
│ │ │ │ +[1,2,a,b,c,3,4]
│ │ │ │ +2> [E || E <- List, E rem 2].
│ │ │ │ +[]
│ │ │ │ +3> [E || E <- List, E rem 2 =:= 0].
│ │ │ │ +[2,4]
Examples (using a non-guard expression as filter):
1> List = [1,2,a,b,c,3,4].
│ │ │ │ +[1,2,a,b,c,3,4]
│ │ │ │ +2> FaultyIsEven = fun(E) -> E rem 2 end.
│ │ │ │  #Fun<erl_eval.42.17316486>
│ │ │ │ -3> [E || E <- List, FaultyIsEven(E)].
│ │ │ │ +3> [E || E <- List, FaultyIsEven(E)].
│ │ │ │  ** exception error: bad filter 1
│ │ │ │ -4> IsEven = fun(E) -> E rem 2 =:= 0 end.
│ │ │ │ +4> IsEven = fun(E) -> E rem 2 =:= 0 end.
│ │ │ │  #Fun<erl_eval.42.17316486>
│ │ │ │ -5> [E || E <- List, IsEven(E)].
│ │ │ │ +5> [E || E <- List, IsEven(E)].
│ │ │ │  ** exception error: an error occurred when evaluating an arithmetic expression
│ │ │ │       in operator  rem/2
│ │ │ │          called as a rem 2
│ │ │ │ -6> [E || E <- List, is_integer(E), IsEven(E)].
│ │ │ │ -[2,4]

│ │ │ │ +6> [E || E <- List, is_integer(E), IsEven(E)].
│ │ │ │ +[2,4]

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Guard Sequences
│ │ │ │  

│ │ │ │  
A guard sequence is a sequence of guards, separated by semicolon (;). The
│ │ │ │  guard sequence is true if at least one of the guards is true. (The remaining
│ │ │ ├── OEBPS/example.xhtml
│ │ │ │ @@ -36,14 +36,14 @@
│ │ │ │  
│ │ │ │  int bar(int y) {
│ │ │ │    return y*2;
│ │ │ │  }
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.

│ │ │ │  
│ │ │ │    
│ │ │ │  
│ │ │ ├── OEBPS/events.xhtml
│ │ │ │ @@ -40,43 +40,43 @@
│ │ │ │  event handler.

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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.

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Starting an Event Manager
│ │ │ │  

│ │ │ │  
To start an event manager for handling errors, as described in the previous
│ │ │ │  example, call the following function:
gen_event:start_link({local, error_man})
gen_event:start_link/1 spawns and links to a new event manager process.
The argument, {local, error_man}, specifies the name under which the
│ │ │ │ @@ -89,57 +89,57 @@
│ │ │ │  manager that is not part of a supervision tree.

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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}.

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Notifying about Events
│ │ │ │  

│ │ │ │  
3> gen_event:notify(error_man, no_reply).
│ │ │ │  ***Error*** no_reply
│ │ │ │  ok
error_man is the name of the event manager and no_reply is the event.
The event is made into a message and sent to the event manager. When the event
│ │ │ │  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).

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Stopping
│ │ │ │  

│ │ │ │  
When an event manager is stopped, it gives each of the installed event handlers
│ │ │ │  the chance to clean up by calling terminate/2, the same way as when deleting a
│ │ │ │ @@ -154,29 +154,29 @@
│ │ │ │  this is done is defined by a shutdown strategy set in
│ │ │ │  the supervisor.

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Handling Other Messages
│ │ │ │  

│ │ │ │  
If the gen_event process is to be able to receive other messages
│ │ │ │  than events, the callback function handle_info(Info, State) must be
│ │ │ │  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}.

│ │ │ │  
│ │ │ │    
│ │ │ │  
│ │ │ ├── OEBPS/errors.xhtml
│ │ │ │ @@ -56,22 +56,22 @@
│ │ │ │  classes, with different origins. The try expression can
│ │ │ │  distinguish between the different classes, whereas the
│ │ │ │  catch expression cannot. try and catch are described
│ │ │ │  in Expressions.
ClassOrigin
errorRun-time error, for example, 1+a, or the process called error/1
exitThe process called exit/1
throwThe process called throw/1
Table: Exception Classes.
All of the above exceptions can also be generated by calling erlang:raise/3.
An exception consists of its class, an exit reason (see
│ │ │ │  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,[]},
│ │ │ │ + ...]

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    The call-stack back trace (stacktrace)
│ │ │ │  

│ │ │ │  
The stack back-trace (stacktrace) is a list that
│ │ │ │  contains {Module, Function, Arity, ExtraInfo} and/or {Fun, Arity, ExtraInfo}
│ │ │ ├── OEBPS/error_logging.xhtml
│ │ │ │ @@ -48,36 +48,36 @@
│ │ │ │  reports and other error and information reports are by default logged through
│ │ │ │  the log handler which is set up when the Kernel application is started.
Prior to Erlang/OTP 21.0, supervisor, crash, and progress reports were only
│ │ │ │  logged when the SASL application was running. This behaviour can, for backwards
│ │ │ │  compatibility, be enabled by setting the Kernel configuration parameter
│ │ │ │  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
│ │ │ │      started_at: nonode@nohost
│ │ │ │  =PROGRESS REPORT==== 8-Jun-2018::16:54:19.922908 ===
│ │ │ │      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>

│ │ │ │  
│ │ │ │    
│ │ │ │  
│ │ │ ├── OEBPS/erl_interface.xhtml
│ │ │ │ @@ -25,119 +25,119 @@
│ │ │ │  to read the port example in Ports before reading this section.

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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
│ │ │ │  to handle these two tuples.

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │ @@ -267,24 +267,24 @@
│ │ │ │      -L/usr/local/otp/lib/erl_interface-3.9.2/lib \
│ │ │ │      complex.c erl_comm.c ei.c -lei -lpthread
In Erlang/OTP R5B and later versions of OTP, the include and lib directories
│ │ │ │  are situated under $OTPROOT/lib/erl_interface-VSN, where $OTPROOT is the
│ │ │ │  root directory of the OTP installation (/usr/local/otp in the recent example)
│ │ │ │  and VSN is the version of the Erl_interface application (3.2.1 in the recent
│ │ │ │  example).
In R4B and earlier versions of OTP, include and lib are situated under
│ │ │ │  $OTPROOT/usr.
Step 2. Start Erlang and compile the Erlang code:
$ erl
│ │ │ │ -Erlang/OTP 26 [erts-14.2] [source] [64-bit] [smp:8:8] [ds:8:8:10] [async-threads:1] [jit:ns]
│ │ │ │ +Erlang/OTP 26 [erts-14.2] [source] [64-bit] [smp:8:8] [ds:8:8:10] [async-threads:1] [jit:ns]
│ │ │ │  
│ │ │ │ -Eshell V14.2 (press Ctrl+G to abort, type help(). for help)
│ │ │ │ -1> c(complex2).
│ │ │ │ -{ok,complex2}
Step 3. Run the example:
2> complex2:start("./extprg").
│ │ │ │ +Eshell V14.2 (press Ctrl+G to abort, type help(). for help)
│ │ │ │ +1> c(complex2).
│ │ │ │ +{ok,complex2}
Step 3. Run the example:
2> complex2:start("./extprg").
│ │ │ │  <0.34.0>
│ │ │ │ -3> complex2:foo(3).
│ │ │ │ +3> complex2:foo(3).
│ │ │ │  4
│ │ │ │ -4> complex2:bar(5).
│ │ │ │ +4> complex2:bar(5).
│ │ │ │  10
│ │ │ │ -5> complex2:bar(352).
│ │ │ │ +5> complex2:bar(352).
│ │ │ │  704
│ │ │ │ -6> complex2:stop().
│ │ │ │ +6> complex2:stop().
│ │ │ │  stop

│ │ │ │  
│ │ │ │    
│ │ │ │  
│ │ │ ├── OEBPS/eff_guide_processes.xhtml
│ │ │ │ @@ -24,45 +24,45 @@
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Creating an Erlang Process
│ │ │ │  

│ │ │ │  
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.

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Initial Heap Size
│ │ │ │  

│ │ │ │  
The default initial heap size of 233 words is quite conservative to support
│ │ │ │ @@ -94,30 +94,30 @@
│ │ │ │      
│ │ │ │    
│ │ │ │    Receiving messages
│ │ │ │  
│ │ │ │  
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
│ │ │ │  said reference, it will tell the emulator to search only the messages that
│ │ │ │  arrived after the call to monitor/2.
The above is a simple example where one is but guaranteed that the optimization
│ │ │ │  will take, but what about more complicated code?

│ │ │ │    
│ │ │ │ @@ -133,101 +133,101 @@
│ │ │ │  efficiency_guide.erl:200: Warning: NOT OPTIMIZED: all clauses do not match a suitable reference
│ │ │ │  efficiency_guide.erl:206: Warning: OPTIMIZED: reference used to mark a message queue position
│ │ │ │  efficiency_guide.erl:208: Warning: OPTIMIZED: all clauses match reference created by monitor/2 at efficiency_guide.erl:206
│ │ │ │  efficiency_guide.erl:219: Warning: INFO: passing reference created by make_ref/0 at efficiency_guide.erl:218
│ │ │ │  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.

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Literal Pool
│ │ │ │  

│ │ │ │  
Constant Erlang terms (hereafter called literals) are kept in literal pools;
│ │ │ │  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
│ │ │ │  processes that hold references to that literal.
There also exists a global literal pool that is managed by the
│ │ │ │  persistent_term module.
By default, 1 GB of virtual address space is reserved for all literal pools (in
│ │ │ │  BEAM code and persistent terms). The amount of virtual address space reserved
│ │ │ │  for literals can be changed by using the
│ │ │ │  +MIscs option when starting the emulator.
Here is an example how the reserved virtual address space for literals can be
│ │ │ │  raised to 2 GB (2048 MB):
erl +MIscs 2048

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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
│ │ │ │ -6> erts_debug:size(element(2, hd(ets:lookup(T, key)))).
│ │ │ │ +6> erts_debug:size(element(2, hd(ets:lookup(T, key)))).
│ │ │ │  4094
│ │ │ │ -7> erts_debug:flat_size(element(2, hd(ets:lookup(T, key)))).
│ │ │ │ +7> erts_debug:flat_size(element(2, hd(ets:lookup(T, key)))).
│ │ │ │  4094
When the data has passed through an Ets table, erts_debug:size/1 and
│ │ │ │  erts_debug:flat_size/1 return the same value. Sharing has been lost.
It is possible to build an experimental variant of the runtime system that
│ │ │ │  will preserve sharing when copying terms by giving the
│ │ │ │  --enable-sharing-preserving option to the configure script.

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ ├── OEBPS/eff_guide_functions.xhtml
│ │ │ │ @@ -27,67 +27,67 @@
│ │ │ │    Pattern Matching
│ │ │ │  

│ │ │ │  
Pattern matching in function head as well as in case and receive clauses are
│ │ │ │  optimized by the compiler. With a few exceptions, there is nothing to gain by
│ │ │ │  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:
  • First, the input value is compared to one, two, and three (using a
│ │ │ │  single instruction that does a binary search; thus, quite efficient even if
│ │ │ │  there are many values) to select which one of the first three clauses to
│ │ │ │  execute (if any).
  • If none of the first three clauses match, the fourth clause match as a
│ │ │ │  variable always matches.
  • If the guard test is_integer(Int) succeeds, the fourth
│ │ │ │  clause is executed.
  • If the guard test fails, the input value is compared to four, five, and
│ │ │ │  six, and the appropriate clause is selected. (There is a function_clause
│ │ │ │ -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) ->
│ │ │ │ +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
│ │ │ │  better type for the Xs variable.)

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ ├── OEBPS/drivers.xhtml
│ │ │ │ @@ -27,23 +27,23 @@
│ │ │ │    Drivers and Concurrency
│ │ │ │  

│ │ │ │  
The runtime system always takes a lock before running any code in a driver.
By default, that lock is at the driver level, that is, if several ports have
│ │ │ │  been opened to the same driver, only code for one port at the same time can be
│ │ │ │  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.

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Avoiding Copying Binaries When Calling a Driver
│ │ │ │  

│ │ │ │  
There are basically two ways to avoid copying a binary that is sent to a driver:
  • If the Data argument for port_control/3 is a
│ │ │ ├── OEBPS/documentation.xhtml
│ │ │ │ @@ -17,23 +17,23 @@
│ │ │ │    
│ │ │ │    
│ │ │ │  
│ │ │ │      
    
│ │ │ │  Documentation
│ │ │ │      
    
│ │ │ │  
    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
│ │ │ │  user-defined types
│ │ │ │  (-type and -opaque) and
│ │ │ │  behaviour module attributes
│ │ │ │  (-callback).
    By default the format used for documentation attributes is
│ │ │ │ @@ -45,55 +45,55 @@
│ │ │ │  Documentation Attributes.
    -doc attributes have been available since Erlang/OTP 27.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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.

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    External documentation files
│ │ │ │  

│ │ │ │  
The -moduledoc and -doc can also be placed in external files. To do so use
│ │ │ │  -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.

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Documenting a module
│ │ │ │  

│ │ │ │  
The module description should include details on how to use the API and examples
│ │ │ │  of the different functions working together. Here is a good place to use images
│ │ │ │  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.
│ │ │ │  
│ │ │ │     This module can be used to add and subtract values. For example:
│ │ │ │  
│ │ │ │     ```erlang
│ │ │ │     1> arith:substract(arith:add(2, 3), 1).
│ │ │ │ @@ -108,94 +108,94 @@
│ │ │ │  
There are three reserved metadata keys for -moduledoc:
  • since - Shows in which version of the application the module was added.
│ │ │ │  If this is added, all functions, types, and callbacks within will also receive
│ │ │ │  the same since value unless specified in the metadata of the function, type
│ │ │ │  or callback.
  • deprecated - Shows a text in the documentation explaining that it is
│ │ │ │  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 #{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."}.

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Documenting functions, user-defined types, and callbacks
│ │ │ │  

│ │ │ │  
Functions, types, and callbacks can be documented using the -doc attribute.
│ │ │ │  Each entry should start with a short paragraph describing the purpose of entity,
│ │ │ │  and then go into greater detail in needed.
It is not recommended to include images or diagrams in this documentation as it
│ │ │ │  is used by IDEs and c:h/1 to show the documentation to the user.
For example:
-doc """
│ │ │ │  A number that can be used by the arith module.
│ │ │ │  
│ │ │ │  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.
│ │ │ │  
│ │ │ │  ### Example:
│ │ │ │  
│ │ │ │  ```
│ │ │ │  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}.

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Doc metadata
│ │ │ │  

│ │ │ │  
There are four reserved metadata keys for -doc:
  • since => unicode:chardata() - Shows which version of the application the
│ │ │ │  module was added.
  • deprecated => unicode:chardata() - Shows a text in the documentation
│ │ │ │  explaining that it is deprecated and what to use instead. The compiler will
│ │ │ │  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.

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Doc signatures
│ │ │ │  

│ │ │ │  
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
│ │ │ │  declaration up until the ->. For example:
-doc """
│ │ │ │  add(One, Two)
│ │ │ │  
│ │ │ │  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.

│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Compiling and getting documentation
│ │ │ │ @@ -280,21 +280,21 @@
│ │ │ │    Using ExDoc to generate HTML/ePub documentation
│ │ │ │  

│ │ │ │  
ExDoc has built-in support to generate
│ │ │ │  documentation from Markdown. The simplest way is by using the
│ │ │ │  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"]},
│ │ │ │ -  {main, "README.md"},
│ │ │ │ -  {source_url, "https://github.com/namespace/your_app"}
│ │ │ │ -]}.
When configured you can run rebar3 ex_doc to generate the
│ │ │ │ +{ex_doc, [
│ │ │ │ +  {extras, ["README.md"]},
│ │ │ │ +  {main, "README.md"},
│ │ │ │ +  {source_url, "https://github.com/namespace/your_app"}
│ │ │ │ +]}.
When configured you can run rebar3 ex_doc to generate the
│ │ │ │  documentation to doc/index.html. For more details and options see
│ │ │ │  the rebar3_ex_doc documentation.
You can also download the
│ │ │ │  release escript bundle from
│ │ │ │  github and run it from the command line. The documentation for using the escript
│ │ │ │  is found by running ex_doc --help.
If you are writing documentation that will be using
│ │ │ │  ExDoc to generate HTML/ePub it is highly
│ │ │ │  recommended to read its documentation.

│ │ │ ├── OEBPS/distributed_applications.xhtml
│ │ │ │ @@ -55,36 +55,36 @@
│ │ │ │  (within the time-out specified by sync_nodes_timeout).
  • sync_nodes_timeout = integer() | infinity - Specifies how many milliseconds
│ │ │ │  to wait for the other nodes to start.
    • When started, the node waits for all nodes specified by sync_nodes_mandatory
│ │ │ │  and sync_nodes_optional to come up. When all nodes are up, or when all
│ │ │ │  mandatory nodes are up and the time specified by sync_nodes_timeout has
│ │ │ │  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.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Starting and Stopping Distributed Applications
│ │ │ │  
    
│ │ │ │  
    When all involved (mandatory) nodes have been started, the distributed
│ │ │ │  application can be started by calling application:start(Application) at all
│ │ │ │  of these nodes.
    A boot script (see Releases) can be used that
│ │ │ │  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
│ │ │ │  calling application:start(myapp) at all three nodes. It is then started at
│ │ │ │  cp1, as shown in the following figure:
    Application myapp - Situation 1
    Similarly, the application must be stopped by calling
│ │ │ │  application:stop(Application) at all involved nodes.
    
│ │ │ │    
│ │ │ │ @@ -92,30 +92,30 @@
│ │ │ │    
│ │ │ │    Failover
│ │ │ │  
    
│ │ │ │  
    If the node where the application is running goes down, the application is
│ │ │ │  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.
│ │ │ │  myapp is now restarted on cp3.
    Application myapp - Situation 3
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Takeover
│ │ │ │  
    
│ │ │ │  
    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
│ │ │ │  executed at cp1 to start the application.
    Application myapp - Situation 5
    
│ │ │ │  
│ │ │ │    
│ │ │ │  
│ │ │ ├── OEBPS/distributed.xhtml
│ │ │ │ @@ -47,25 +47,25 @@
│ │ │ │  
│ │ │ │  
    A node is an executing Erlang runtime system that has been given a name, using
│ │ │ │  the command-line flag -name (long names) or
│ │ │ │  -sname (short names).
    The format of the node name is an atom name@host. name is the name given by
│ │ │ │  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.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Node Connections
│ │ │ │  
    
│ │ │ ├── OEBPS/design_principles.xhtml
│ │ │ │ @@ -57,135 +57,135 @@
│ │ │ │  the code for a process in a generic part (a behaviour module) and a specific
│ │ │ │  part (a callback module).
    The behaviour module is part of Erlang/OTP. To implement a process such as a
│ │ │ │  supervisor, the user only needs to implement the callback module, which is to
│ │ │ │  export a pre-defined set of functions, the callback functions.
    The following example illustrate how code can be divided into a generic and a
│ │ │ │  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
│ │ │ │  without changing the code using the interface functions.
    • The functionality of server can be extended without having to change ch2
│ │ │ │  or any other callback module.
    In ch1.erl and ch2.erl above, the implementation of channels/0, alloc/1,
│ │ │ │  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
│ │ │ │  efficiency is at the expense of generality. The ability to manage all
│ │ │ │  applications in the system in a consistent manner is important.
    Using behaviours also makes it easier to read and understand code written by
│ │ │ │  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}
    
│ │ │ │ +{ok,chs3}
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Applications
│ │ │ │  
    
│ │ │ │  
    Erlang/OTP comes with a number of components, each implementing some specific
│ │ │ │  functionality. Components are with Erlang/OTP terminology called applications.
│ │ │ ├── OEBPS/data_types.xhtml
│ │ │ │ @@ -97,18 +97,18 @@
│ │ │ │    
│ │ │ │    Representation of Floating Point Numbers
│ │ │ │  
│ │ │ │  
    When working with floats you may not see what you expect when printing or doing
│ │ │ │  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
│ │ │ │  36028797018963968.0.
    For more information about floats and issues with them see:
    If you need to work with exact decimal fractions, for instance to represent
│ │ │ │  money, it is recommended to use a library that handles that, or work in
│ │ │ │  cents instead of dollars or euros so that decimal fractions are not needed.
    Also note that Erlang's floats do not exactly match IEEE 754 floats,
│ │ │ │  in that neither Inf nor NaN are supported in Erlang. Any
│ │ │ │ @@ -142,52 +142,52 @@
│ │ │ │  by eight are called binaries.
    Examples:
    1> <<10,20>>.
│ │ │ │  <<10,20>>
│ │ │ │  2> <<"ABC">>.
│ │ │ │  <<"ABC">>
│ │ │ │  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.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Reference
│ │ │ │  
    
│ │ │ │  
    A term that is unique
│ │ │ │  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
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Fun
│ │ │ │  
    
│ │ │ │  
    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.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Port Identifier
│ │ │ │  
    
│ │ │ │ @@ -205,94 +205,94 @@
│ │ │ │  for a new process after a while.
    The BIF self/0 returns the Pid of the calling process. When
│ │ │ │  creating a new process, the parent
│ │ │ │  process will be able to get the Pid of the child process either via the return
│ │ │ │  value, as is the case when calling the spawn/3 BIF, or via
│ │ │ │  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>
│ │ │ │  who_are_you
    Read more about processes in Processes.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Map
│ │ │ │  
    
│ │ │ │  
    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.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    List
│ │ │ │  
    
│ │ │ │  
    A list is a compound data type with a variable number of terms.
    [Term1,...,TermN]
    Each term Term in the list is called an element. The number of elements is
│ │ │ │  said to be the length of the list.
    Formally, a list is either the empty list [] or consists of a head (first
│ │ │ │  element) and a tail (remainder of the list). The tail is also a list. The
│ │ │ │  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.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    String
│ │ │ │  
    
│ │ │ │ @@ -412,41 +412,41 @@
│ │ │ │    Record
│ │ │ │  
│ │ │ │  
    A record is a data structure for storing a fixed number of elements. It has
│ │ │ │  named fields and is similar to a struct in C. However, a record is not a true
│ │ │ │  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) ->
│ │ │ │ -    #person{name=Name, age=Age}.
│ │ │ │ +new(Name, Age) ->
│ │ │ │ +    #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.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Boolean
│ │ │ │  
    
│ │ │ │  
    There is no Boolean data type in Erlang. Instead the atoms true and false
│ │ │ │  are used to denote Boolean values. The is_boolean/1
│ │ │ │  BIF tests whether a term is a boolean.
    Examples:
    1> 2 =< 3.
│ │ │ │  true
│ │ │ │  2> true or false.
│ │ │ │  true
│ │ │ │ -3> is_boolean(true).
│ │ │ │ +3> is_boolean(true).
│ │ │ │  true
│ │ │ │ -4> is_boolean(false).
│ │ │ │ +4> is_boolean(false).
│ │ │ │  true
│ │ │ │ -5> is_boolean(ok).
│ │ │ │ +5> is_boolean(ok).
│ │ │ │  false
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Escape Sequences
│ │ │ │  
    
│ │ │ │  
    Within strings ("-delimited), quoted atoms, and the content of
│ │ │ │ @@ -464,44 +464,44 @@
│ │ │ │  ~b or ~s sigils the escape sequences for normal
│ │ │ │  strings, above, are used.
    Change
    Triple-quoted strings and sigils were introduced in Erlang/OTP 27.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Type Conversions
│ │ │ │  
    
│ │ │ │ -
    There are a number of BIFs for type conversions.
    Examples:
    1> atom_to_list(hello).
│ │ │ │ +
    There are a number of BIFs for type conversions.
    Examples:
    1> atom_to_list(hello).
│ │ │ │  "hello"
│ │ │ │ -2> list_to_atom("hello").
│ │ │ │ +2> list_to_atom("hello").
│ │ │ │  hello
│ │ │ │ -3> binary_to_list(<<"hello">>).
│ │ │ │ +3> binary_to_list(<<"hello">>).
│ │ │ │  "hello"
│ │ │ │ -4> binary_to_list(<<104,101,108,108,111>>).
│ │ │ │ +4> binary_to_list(<<104,101,108,108,111>>).
│ │ │ │  "hello"
│ │ │ │ -5> list_to_binary("hello").
│ │ │ │ -<<104,101,108,108,111>>
│ │ │ │ -6> float_to_list(7.0).
│ │ │ │ +5> list_to_binary("hello").
│ │ │ │ +<<104,101,108,108,111>>
│ │ │ │ +6> float_to_list(7.0).
│ │ │ │  "7.00000000000000000000e+00"
│ │ │ │ -7> list_to_float("7.000e+00").
│ │ │ │ +7> list_to_float("7.000e+00").
│ │ │ │  7.0
│ │ │ │ -8> integer_to_list(77).
│ │ │ │ +8> integer_to_list(77).
│ │ │ │  "77"
│ │ │ │ -9> list_to_integer("77").
│ │ │ │ +9> list_to_integer("77").
│ │ │ │  77
│ │ │ │ -10> tuple_to_list({a,b,c}).
│ │ │ │ -[a,b,c]
│ │ │ │ -11> list_to_tuple([a,b,c]).
│ │ │ │ -{a,b,c}
│ │ │ │ -12> term_to_binary({a,b,c}).
│ │ │ │ -<<131,104,3,100,0,1,97,100,0,1,98,100,0,1,99>>
│ │ │ │ -13> binary_to_term(<<131,104,3,100,0,1,97,100,0,1,98,100,0,1,99>>).
│ │ │ │ -{a,b,c}
│ │ │ │ -14> binary_to_integer(<<"77">>).
│ │ │ │ +10> tuple_to_list({a,b,c}).
│ │ │ │ +[a,b,c]
│ │ │ │ +11> list_to_tuple([a,b,c]).
│ │ │ │ +{a,b,c}
│ │ │ │ +12> term_to_binary({a,b,c}).
│ │ │ │ +<<131,104,3,100,0,1,97,100,0,1,98,100,0,1,99>>
│ │ │ │ +13> binary_to_term(<<131,104,3,100,0,1,97,100,0,1,98,100,0,1,99>>).
│ │ │ │ +{a,b,c}
│ │ │ │ +14> binary_to_integer(<<"77">>).
│ │ │ │  77
│ │ │ │ -15> integer_to_binary(77).
│ │ │ │ -<<"77">>
│ │ │ │ -16> float_to_binary(7.0).
│ │ │ │ -<<"7.00000000000000000000e+00">>
│ │ │ │ -17> binary_to_float(<<"7.000e+00">>).
│ │ │ │ +15> integer_to_binary(77).
│ │ │ │ +<<"77">>
│ │ │ │ +16> float_to_binary(7.0).
│ │ │ │ +<<"7.00000000000000000000e+00">>
│ │ │ │ +17> binary_to_float(<<"7.000e+00">>).
│ │ │ │  7.0
    
│ │ │ │  
│ │ │ │    
│ │ │ │  
│ │ │ ├── OEBPS/create_target.xhtml
│ │ │ │ @@ -43,21 +43,21 @@
│ │ │ │    Creating a Target System
│ │ │ │  
│ │ │ │  
    It is assumed that you have a working Erlang/OTP system structured according to
│ │ │ │  the OTP design principles.
    Step 1. Create a .rel file (see the rel(4) manual page in
│ │ │ │  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
│ │ │ │  the Pea application to the code path.
    Step 3. Create the target system:
    1> target_system:create("mysystem").
    The function target_system:create/1 performs the following:
    1. Reads the file mysystem.rel and creates a new file plain.rel.
│ │ │ │  The new file is identical to the original, except that it only
│ │ │ │  lists the Kernel and STDLIB applications.
    2. From the files mysystem.rel and plain.rel creates the files
│ │ │ │  mysystem.script, mysystem.boot, plain.script, and plain.boot
│ │ │ │ @@ -147,25 +147,25 @@
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Creating the Next Version
│ │ │ │  
│ │ │ │  
      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",
│ │ │ │      "/my/old/erlang/lib/*/ebin"]}]).
    Here "mysystem" is the base release and "mysystem2" is the release to
│ │ │ │  upgrade to.
    The path option is used for pointing out the old version of all applications.
│ │ │ │  (The new versions are already in the code path - assuming of course that the
│ │ │ │  Erlang node on which this is executed is running the correct version of
│ │ │ │ @@ -197,21 +197,21 @@
│ │ │ │  {continue_after_restart,"FIRST",[]}
│ │ │ │  heart: Tue Apr  1 12:15:10 2014: Erlang has closed.
│ │ │ │  heart: Tue Apr  1 12:15:11 2014: Executed "/usr/local/erl-target/bin/start /usr/local/erl-target/releases/new_start_erl.data" -> 0. Terminating.
│ │ │ │  [End]
    The above return value and output after the call to
│ │ │ │  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"],
│ │ │ │ @@ -220,264 +220,264 @@
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Listing of target_system.erl
│ │ │ │  
│ │ │ │  
    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.
│ │ │ │  %%
│ │ │ │  
│ │ │ │  %% 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"),
│ │ │ │ +    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"])),
│ │ │ │  
│ │ │ │ -    io:fwrite("Copying files \"epmd\", \"run_erl\" and \"to_erl\" from \n"
│ │ │ │ +    io:fwrite("Copying files \"epmd\", \"run_erl\" and \"to_erl\" from \n"
│ │ │ │                "~ts to ~ts ...~n",
│ │ │ │ -              [ErtsBinDir, TmpBinDir]),
│ │ │ │ -    copy_file(filename:join([ErtsBinDir, "epmd"]),
│ │ │ │ -              filename:join([TmpBinDir, "epmd"]), [preserve]),
│ │ │ │ -    copy_file(filename:join([ErtsBinDir, "run_erl"]),
│ │ │ │ -              filename:join([TmpBinDir, "run_erl"]), [preserve]),
│ │ │ │ -    copy_file(filename:join([ErtsBinDir, "to_erl"]),
│ │ │ │ -              filename:join([TmpBinDir, "to_erl"]), [preserve]),
│ │ │ │ +              [ErtsBinDir, TmpBinDir]),
│ │ │ │ +    copy_file(filename:join([ErtsBinDir, "epmd"]),
│ │ │ │ +              filename:join([TmpBinDir, "epmd"]), [preserve]),
│ │ │ │ +    copy_file(filename:join([ErtsBinDir, "run_erl"]),
│ │ │ │ +              filename:join([TmpBinDir, "run_erl"]), [preserve]),
│ │ │ │ +    copy_file(filename:join([ErtsBinDir, "to_erl"]),
│ │ │ │ +              filename:join([TmpBinDir, "to_erl"]), [preserve]),
│ │ │ │  
│ │ │ │      %% This is needed if 'start' script created from 'start.src' shall
│ │ │ │      %% be used as it points out this directory as log dir for 'run_erl'
│ │ │ │ -    TmpLogDir = filename:join([TmpDir, "log"]),
│ │ │ │ -    io:fwrite("Creating temporary directory ~ts ...~n", [TmpLogDir]),
│ │ │ │ -    ok = file:make_dir(TmpLogDir),
│ │ │ │ -
│ │ │ │ -    StartErlDataFile = filename:join([TmpDir, "releases", "start_erl.data"]),
│ │ │ │ -    io:fwrite("Creating ~ts ...~n", [StartErlDataFile]),
│ │ │ │ -    StartErlData = io_lib:fwrite("~s ~s~n", [ErtsVsn, RelVsn]),
│ │ │ │ -    write_file(StartErlDataFile, StartErlData),
│ │ │ │ -
│ │ │ │ -    io:fwrite("Recreating tar file ~ts from contents in directory ~ts ...~n",
│ │ │ │ -	      [TarFileName,TmpDir]),
│ │ │ │ -    {ok, Tar} = erl_tar:open(TarFileName, [write, compressed]),
│ │ │ │ +    TmpLogDir = filename:join([TmpDir, "log"]),
│ │ │ │ +    io:fwrite("Creating temporary directory ~ts ...~n", [TmpLogDir]),
│ │ │ │ +    ok = file:make_dir(TmpLogDir),
│ │ │ │ +
│ │ │ │ +    StartErlDataFile = filename:join([TmpDir, "releases", "start_erl.data"]),
│ │ │ │ +    io:fwrite("Creating ~ts ...~n", [StartErlDataFile]),
│ │ │ │ +    StartErlData = io_lib:fwrite("~s ~s~n", [ErtsVsn, RelVsn]),
│ │ │ │ +    write_file(StartErlDataFile, StartErlData),
│ │ │ │ +
│ │ │ │ +    io:fwrite("Recreating tar file ~ts from contents in directory ~ts ...~n",
│ │ │ │ +	      [TarFileName,TmpDir]),
│ │ │ │ +    {ok, Tar} = erl_tar:open(TarFileName, [write, compressed]),
│ │ │ │      %% {ok, Cwd} = file:get_cwd(),
│ │ │ │      %% file:set_cwd("tmp"),
│ │ │ │      ErtsDir = "erts-"++ErtsVsn,
│ │ │ │ -    erl_tar:add(Tar, filename:join(TmpDir,"bin"), "bin", []),
│ │ │ │ -    erl_tar:add(Tar, filename:join(TmpDir,ErtsDir), ErtsDir, []),
│ │ │ │ -    erl_tar:add(Tar, filename:join(TmpDir,"releases"), "releases", []),
│ │ │ │ -    erl_tar:add(Tar, filename:join(TmpDir,"lib"), "lib", []),
│ │ │ │ -    erl_tar:add(Tar, filename:join(TmpDir,"log"), "log", []),
│ │ │ │ -    erl_tar:close(Tar),
│ │ │ │ +    erl_tar:add(Tar, filename:join(TmpDir,"bin"), "bin", []),
│ │ │ │ +    erl_tar:add(Tar, filename:join(TmpDir,ErtsDir), ErtsDir, []),
│ │ │ │ +    erl_tar:add(Tar, filename:join(TmpDir,"releases"), "releases", []),
│ │ │ │ +    erl_tar:add(Tar, filename:join(TmpDir,"lib"), "lib", []),
│ │ │ │ +    erl_tar:add(Tar, filename:join(TmpDir,"log"), "log", []),
│ │ │ │ +    erl_tar:close(Tar),
│ │ │ │      %% file:set_cwd(Cwd),
│ │ │ │ -    io:fwrite("Removing directory ~ts ...~n",[TmpDir]),
│ │ │ │ -    remove_dir_tree(TmpDir),
│ │ │ │ +    io:fwrite("Removing directory ~ts ...~n",[TmpDir]),
│ │ │ │ +    remove_dir_tree(TmpDir),
│ │ │ │      ok.
│ │ │ │  
│ │ │ │  
│ │ │ │ -install(RelFileName, RootDir) ->
│ │ │ │ +install(RelFileName, RootDir) ->
│ │ │ │      TarFile = RelFileName ++ ".tar.gz",
│ │ │ │ -    io:fwrite("Extracting ~ts ...~n", [TarFile]),
│ │ │ │ -    extract_tar(TarFile, RootDir),
│ │ │ │ -    StartErlDataFile = filename:join([RootDir, "releases", "start_erl.data"]),
│ │ │ │ -    {ok, StartErlData} = read_txt_file(StartErlDataFile),
│ │ │ │ -    [ErlVsn, _RelVsn| _] = string:tokens(StartErlData, " \n"),
│ │ │ │ -    ErtsBinDir = filename:join([RootDir, "erts-" ++ ErlVsn, "bin"]),
│ │ │ │ -    BinDir = filename:join([RootDir, "bin"]),
│ │ │ │ -    io:fwrite("Substituting in erl.src, start.src and start_erl.src to "
│ │ │ │ -              "form erl, start and start_erl ...\n"),
│ │ │ │ -    subst_src_scripts(["erl", "start", "start_erl"], ErtsBinDir, BinDir,
│ │ │ │ -                      [{"FINAL_ROOTDIR", RootDir}, {"EMU", "beam"}],
│ │ │ │ -                      [preserve]),
│ │ │ │ +    io:fwrite("Extracting ~ts ...~n", [TarFile]),
│ │ │ │ +    extract_tar(TarFile, RootDir),
│ │ │ │ +    StartErlDataFile = filename:join([RootDir, "releases", "start_erl.data"]),
│ │ │ │ +    {ok, StartErlData} = read_txt_file(StartErlDataFile),
│ │ │ │ +    [ErlVsn, _RelVsn| _] = string:tokens(StartErlData, " \n"),
│ │ │ │ +    ErtsBinDir = filename:join([RootDir, "erts-" ++ ErlVsn, "bin"]),
│ │ │ │ +    BinDir = filename:join([RootDir, "bin"]),
│ │ │ │ +    io:fwrite("Substituting in erl.src, start.src and start_erl.src to "
│ │ │ │ +              "form erl, start and start_erl ...\n"),
│ │ │ │ +    subst_src_scripts(["erl", "start", "start_erl"], ErtsBinDir, BinDir,
│ │ │ │ +                      [{"FINAL_ROOTDIR", RootDir}, {"EMU", "beam"}],
│ │ │ │ +                      [preserve]),
│ │ │ │      %%! Workaround for pre OTP 17.0: start.src and start_erl.src did
│ │ │ │      %%! not have correct permissions, so the above 'preserve' option did not help
│ │ │ │ -    ok = file:change_mode(filename:join(BinDir,"start"),8#0755),
│ │ │ │ -    ok = file:change_mode(filename:join(BinDir,"start_erl"),8#0755),
│ │ │ │ +    ok = file:change_mode(filename:join(BinDir,"start"),8#0755),
│ │ │ │ +    ok = file:change_mode(filename:join(BinDir,"start_erl"),8#0755),
│ │ │ │  
│ │ │ │ -    io:fwrite("Creating the RELEASES file ...\n"),
│ │ │ │ -    create_RELEASES(RootDir, filename:join([RootDir, "releases",
│ │ │ │ -					    filename:basename(RelFileName)])).
│ │ │ │ +    io:fwrite("Creating the RELEASES file ...\n"),
│ │ │ │ +    create_RELEASES(RootDir, filename:join([RootDir, "releases",
│ │ │ │ +					    filename:basename(RelFileName)])).
│ │ │ │  
│ │ │ │  %% LOCALS
│ │ │ │  
│ │ │ │  %% make_script(RelFileName,Opts)
│ │ │ │  %%
│ │ │ │ -make_script(RelFileName,Opts) ->
│ │ │ │ -    systools:make_script(RelFileName, [no_module_tests,
│ │ │ │ -				       {outdir,filename:dirname(RelFileName)}
│ │ │ │ -				       |Opts]).
│ │ │ │ +make_script(RelFileName,Opts) ->
│ │ │ │ +    systools:make_script(RelFileName, [no_module_tests,
│ │ │ │ +				       {outdir,filename:dirname(RelFileName)}
│ │ │ │ +				       |Opts]).
│ │ │ │  
│ │ │ │  %% make_tar(RelFileName,Opts)
│ │ │ │  %%
│ │ │ │ -make_tar(RelFileName,Opts) ->
│ │ │ │ -    RootDir = code:root_dir(),
│ │ │ │ -    systools:make_tar(RelFileName, [{erts, RootDir},
│ │ │ │ -				    {outdir,filename:dirname(RelFileName)}
│ │ │ │ -				    |Opts]).
│ │ │ │ +make_tar(RelFileName,Opts) ->
│ │ │ │ +    RootDir = code:root_dir(),
│ │ │ │ +    systools:make_tar(RelFileName, [{erts, RootDir},
│ │ │ │ +				    {outdir,filename:dirname(RelFileName)}
│ │ │ │ +				    |Opts]).
│ │ │ │  
│ │ │ │  %% extract_tar(TarFile, DestDir)
│ │ │ │  %%
│ │ │ │ -extract_tar(TarFile, DestDir) ->
│ │ │ │ -    erl_tar:extract(TarFile, [{cwd, DestDir}, compressed]).
│ │ │ │ +extract_tar(TarFile, DestDir) ->
│ │ │ │ +    erl_tar:extract(TarFile, [{cwd, DestDir}, compressed]).
│ │ │ │  
│ │ │ │ -create_RELEASES(DestDir, RelFileName) ->
│ │ │ │ -    release_handler:create_RELEASES(DestDir, RelFileName ++ ".rel").
│ │ │ │ +create_RELEASES(DestDir, RelFileName) ->
│ │ │ │ +    release_handler:create_RELEASES(DestDir, RelFileName ++ ".rel").
│ │ │ │  
│ │ │ │ -subst_src_scripts(Scripts, SrcDir, DestDir, Vars, Opts) ->
│ │ │ │ -    lists:foreach(fun(Script) ->
│ │ │ │ -                          subst_src_script(Script, SrcDir, DestDir,
│ │ │ │ -                                           Vars, Opts)
│ │ │ │ -                  end, Scripts).
│ │ │ │ -
│ │ │ │ -subst_src_script(Script, SrcDir, DestDir, Vars, Opts) ->
│ │ │ │ -    subst_file(filename:join([SrcDir, Script ++ ".src"]),
│ │ │ │ -               filename:join([DestDir, Script]),
│ │ │ │ -               Vars, Opts).
│ │ │ │ -
│ │ │ │ -subst_file(Src, Dest, Vars, Opts) ->
│ │ │ │ -    {ok, Conts} = read_txt_file(Src),
│ │ │ │ -    NConts = subst(Conts, Vars),
│ │ │ │ -    write_file(Dest, NConts),
│ │ │ │ -    case lists:member(preserve, Opts) of
│ │ │ │ +subst_src_scripts(Scripts, SrcDir, DestDir, Vars, Opts) ->
│ │ │ │ +    lists:foreach(fun(Script) ->
│ │ │ │ +                          subst_src_script(Script, SrcDir, DestDir,
│ │ │ │ +                                           Vars, Opts)
│ │ │ │ +                  end, Scripts).
│ │ │ │ +
│ │ │ │ +subst_src_script(Script, SrcDir, DestDir, Vars, Opts) ->
│ │ │ │ +    subst_file(filename:join([SrcDir, Script ++ ".src"]),
│ │ │ │ +               filename:join([DestDir, Script]),
│ │ │ │ +               Vars, Opts).
│ │ │ │ +
│ │ │ │ +subst_file(Src, Dest, Vars, Opts) ->
│ │ │ │ +    {ok, Conts} = read_txt_file(Src),
│ │ │ │ +    NConts = subst(Conts, Vars),
│ │ │ │ +    write_file(Dest, NConts),
│ │ │ │ +    case lists:member(preserve, Opts) of
│ │ │ │          true ->
│ │ │ │ -            {ok, FileInfo} = file:read_file_info(Src),
│ │ │ │ -            file:write_file_info(Dest, FileInfo);
│ │ │ │ +            {ok, FileInfo} = file:read_file_info(Src),
│ │ │ │ +            file:write_file_info(Dest, FileInfo);
│ │ │ │          false ->
│ │ │ │              ok
│ │ │ │      end.
│ │ │ │  
│ │ │ │  %% subst(Str, Vars)
│ │ │ │  %% Vars = [{Var, Val}]
│ │ │ │  %% Var = Val = string()
│ │ │ │  %% Substitute all occurrences of %Var% for Val in Str, using the list
│ │ │ │  %% of variables in Vars.
│ │ │ │  %%
│ │ │ │ -subst(Str, Vars) ->
│ │ │ │ -    subst(Str, Vars, []).
│ │ │ │ +subst(Str, Vars) ->
│ │ │ │ +    subst(Str, Vars, []).
│ │ │ │  
│ │ │ │ -subst([$%, C| Rest], Vars, Result) when $A =< C, C =< $Z ->
│ │ │ │ -    subst_var([C| Rest], Vars, Result, []);
│ │ │ │ -subst([$%, C| Rest], Vars, Result) when $a =< C, C =< $z ->
│ │ │ │ -    subst_var([C| Rest], Vars, Result, []);
│ │ │ │ -subst([$%, C| Rest], Vars, Result) when  C == $_ ->
│ │ │ │ -    subst_var([C| Rest], Vars, Result, []);
│ │ │ │ -subst([C| Rest], Vars, Result) ->
│ │ │ │ -    subst(Rest, Vars, [C| Result]);
│ │ │ │ -subst([], _Vars, Result) ->
│ │ │ │ -    lists:reverse(Result).
│ │ │ │ -
│ │ │ │ -subst_var([$%| Rest], Vars, Result, VarAcc) ->
│ │ │ │ -    Key = lists:reverse(VarAcc),
│ │ │ │ -    case lists:keysearch(Key, 1, Vars) of
│ │ │ │ -        {value, {Key, Value}} ->
│ │ │ │ -            subst(Rest, Vars, lists:reverse(Value, Result));
│ │ │ │ +subst([$%, C| Rest], Vars, Result) when $A =< C, C =< $Z ->
│ │ │ │ +    subst_var([C| Rest], Vars, Result, []);
│ │ │ │ +subst([$%, C| Rest], Vars, Result) when $a =< C, C =< $z ->
│ │ │ │ +    subst_var([C| Rest], Vars, Result, []);
│ │ │ │ +subst([$%, C| Rest], Vars, Result) when  C == $_ ->
│ │ │ │ +    subst_var([C| Rest], Vars, Result, []);
│ │ │ │ +subst([C| Rest], Vars, Result) ->
│ │ │ │ +    subst(Rest, Vars, [C| Result]);
│ │ │ │ +subst([], _Vars, Result) ->
│ │ │ │ +    lists:reverse(Result).
│ │ │ │ +
│ │ │ │ +subst_var([$%| Rest], Vars, Result, VarAcc) ->
│ │ │ │ +    Key = lists:reverse(VarAcc),
│ │ │ │ +    case lists:keysearch(Key, 1, Vars) of
│ │ │ │ +        {value, {Key, Value}} ->
│ │ │ │ +            subst(Rest, Vars, lists:reverse(Value, Result));
│ │ │ │          false ->
│ │ │ │ -            subst(Rest, Vars, [$%| VarAcc ++ [$%| Result]])
│ │ │ │ +            subst(Rest, Vars, [$%| VarAcc ++ [$%| Result]])
│ │ │ │      end;
│ │ │ │ -subst_var([C| Rest], Vars, Result, VarAcc) ->
│ │ │ │ -    subst_var(Rest, Vars, Result, [C| VarAcc]);
│ │ │ │ -subst_var([], Vars, Result, VarAcc) ->
│ │ │ │ -    subst([], Vars, [VarAcc ++ [$%| Result]]).
│ │ │ │ -
│ │ │ │ -copy_file(Src, Dest) ->
│ │ │ │ -    copy_file(Src, Dest, []).
│ │ │ │ -
│ │ │ │ -copy_file(Src, Dest, Opts) ->
│ │ │ │ -    {ok,_} = file:copy(Src, Dest),
│ │ │ │ -    case lists:member(preserve, Opts) of
│ │ │ │ +subst_var([C| Rest], Vars, Result, VarAcc) ->
│ │ │ │ +    subst_var(Rest, Vars, Result, [C| VarAcc]);
│ │ │ │ +subst_var([], Vars, Result, VarAcc) ->
│ │ │ │ +    subst([], Vars, [VarAcc ++ [$%| Result]]).
│ │ │ │ +
│ │ │ │ +copy_file(Src, Dest) ->
│ │ │ │ +    copy_file(Src, Dest, []).
│ │ │ │ +
│ │ │ │ +copy_file(Src, Dest, Opts) ->
│ │ │ │ +    {ok,_} = file:copy(Src, Dest),
│ │ │ │ +    case lists:member(preserve, Opts) of
│ │ │ │          true ->
│ │ │ │ -            {ok, FileInfo} = file:read_file_info(Src),
│ │ │ │ -            file:write_file_info(Dest, FileInfo);
│ │ │ │ +            {ok, FileInfo} = file:read_file_info(Src),
│ │ │ │ +            file:write_file_info(Dest, FileInfo);
│ │ │ │          false ->
│ │ │ │              ok
│ │ │ │      end.
│ │ │ │  
│ │ │ │ -write_file(FName, Conts) ->
│ │ │ │ -    Enc = file:native_name_encoding(),
│ │ │ │ -    {ok, Fd} = file:open(FName, [write]),
│ │ │ │ -    file:write(Fd, unicode:characters_to_binary(Conts,Enc,Enc)),
│ │ │ │ -    file:close(Fd).
│ │ │ │ -
│ │ │ │ -read_txt_file(File) ->
│ │ │ │ -    {ok, Bin} = file:read_file(File),
│ │ │ │ -    {ok, binary_to_list(Bin)}.
│ │ │ │ -
│ │ │ │ -remove_dir_tree(Dir) ->
│ │ │ │ -    remove_all_files(".", [Dir]).
│ │ │ │ -
│ │ │ │ -remove_all_files(Dir, Files) ->
│ │ │ │ -    lists:foreach(fun(File) ->
│ │ │ │ -                          FilePath = filename:join([Dir, File]),
│ │ │ │ -                          case filelib:is_dir(FilePath) of
│ │ │ │ +write_file(FName, Conts) ->
│ │ │ │ +    Enc = file:native_name_encoding(),
│ │ │ │ +    {ok, Fd} = file:open(FName, [write]),
│ │ │ │ +    file:write(Fd, unicode:characters_to_binary(Conts,Enc,Enc)),
│ │ │ │ +    file:close(Fd).
│ │ │ │ +
│ │ │ │ +read_txt_file(File) ->
│ │ │ │ +    {ok, Bin} = file:read_file(File),
│ │ │ │ +    {ok, binary_to_list(Bin)}.
│ │ │ │ +
│ │ │ │ +remove_dir_tree(Dir) ->
│ │ │ │ +    remove_all_files(".", [Dir]).
│ │ │ │ +
│ │ │ │ +remove_all_files(Dir, Files) ->
│ │ │ │ +    lists:foreach(fun(File) ->
│ │ │ │ +                          FilePath = filename:join([Dir, File]),
│ │ │ │ +                          case filelib:is_dir(FilePath) of
│ │ │ │                                true ->
│ │ │ │ -                                  {ok, DirFiles} = file:list_dir(FilePath),
│ │ │ │ -                                  remove_all_files(FilePath, DirFiles),
│ │ │ │ -                                  file:del_dir(FilePath);
│ │ │ │ +                                  {ok, DirFiles} = file:list_dir(FilePath),
│ │ │ │ +                                  remove_all_files(FilePath, DirFiles),
│ │ │ │ +                                  file:del_dir(FilePath);
│ │ │ │                                _ ->
│ │ │ │ -                                  file:delete(FilePath)
│ │ │ │ +                                  file:delete(FilePath)
│ │ │ │                            end
│ │ │ │ -                  end, Files).
    
│ │ │ │ +                  end, Files).
    
│ │ │ │  
│ │ │ │    
│ │ │ │  
│ │ │ ├── OEBPS/content.opf
│ │ │ │ ├── OEBPS/content.opf
│ │ │ │ │ @@ -1,14 +1,14 @@
│ │ │ │ │  
│ │ │ │ │  
│ │ │ │ │    
│ │ │ │ │      Erlang System Documentation - 27.3.4.11
│ │ │ │ │ -    urn:uuid:53b6ad31-0570-89ba-55d5-22e292869f6d
│ │ │ │ │ +    urn:uuid:c938b1f2-fa4a-728f-5464-93d84667a079
│ │ │ │ │      en
│ │ │ │ │ -    2026-04-22T09:07:33Z
│ │ │ │ │ +    2026-04-27T16:44:13Z
│ │ │ │ │    
│ │ │ │ │    
│ │ │ │ │      
│ │ │ │ │      
│ │ │ │ │      
│ │ │ │ │      
│ │ │ │ │      
│ │ │ │ │ @@ -82,21 +82,21 @@
│ │ │ │ │      
│ │ │ │ │      
│ │ │ │ │      
│ │ │ │ │      
│ │ │ │ │      
│ │ │ │ │      
│ │ │ │ │      
│ │ │ │ │ +    
│ │ │ │ │      
│ │ │ │ │      
│ │ │ │ │ -    
│ │ │ │ │      
│ │ │ │ │      
│ │ │ │ │ -    
│ │ │ │ │      
│ │ │ │ │ +    
│ │ │ │ │      
│ │ │ │ │    
│ │ │ │ │      
│ │ │ │ │      
│ │ │ │ │      
│ │ │ │ │      
│ │ │ ├── OEBPS/conc_prog.xhtml
│ │ │ │ @@ -37,107 +37,107 @@
│ │ │ │  threads of execution in an Erlang program and to allow these threads to
│ │ │ │  communicate with each other. In Erlang, each thread of execution is called a
│ │ │ │  process.
    (Aside: the term "process" is usually used when the threads of execution share
│ │ │ │  no data with each other and the term "thread" when they share data in some way.
│ │ │ │  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
│ │ │ │  done
    As shown, the function say_something writes its first argument the number of
│ │ │ │  times specified by second argument. The function start starts two Erlang
│ │ │ │  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>
│ │ │ │  hello
│ │ │ │  goodbye
│ │ │ │  hello
│ │ │ │  goodbye
    Notice that it did not write "hello" three times and then "goodbye" three times.
│ │ │ │  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
│ │ │ │  each line sensibly. It also tries to detect flat lists of printable characters and
│ │ │ │  to output these as strings
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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
│ │ │ │  Pong received ping
│ │ │ │  Ping received pong
│ │ │ │  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 ->
│ │ │ │         actions1;
│ │ │ │     pattern2 ->
│ │ │ │         actions2;
│ │ │ │     ....
│ │ │ │ @@ -158,84 +158,84 @@
│ │ │ │  queue (keeping the first message and any other messages in the queue). If the
│ │ │ │  second message does not match, the third message is tried, and so on, until the
│ │ │ │  end of the queue is reached. If the end of the queue is reached, the process
│ │ │ │  blocks (stops execution) and waits until a new message is received and this
│ │ │ │  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.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Registered Process Names
│ │ │ │  
    
│ │ │ │  
    In the above example, "pong" was first created to be able to give the identity
│ │ │ │  of "pong" when "ping" was started. That is, in some way "ping" must be able to
│ │ │ │  know the identity of "pong" to be able to send a message to it. Sometimes
│ │ │ │  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", []),
│ │ │ │              Ping_PID ! pong,
│ │ │ │ -            pong()
│ │ │ │ +            pong()
│ │ │ │      end.
│ │ │ │  
│ │ │ │ -start() ->
│ │ │ │ -    register(pong, spawn(tut16, pong, [])),
│ │ │ │ -    spawn(tut16, ping, [3]).
    2> c(tut16).
│ │ │ │ -{ok, tut16}
│ │ │ │ -3> tut16:start().
│ │ │ │ +start() ->
│ │ │ │ +    register(pong, spawn(tut16, pong, [])),
│ │ │ │ +    spawn(tut16, ping, [3]).
    2> c(tut16).
│ │ │ │ +{ok, tut16}
│ │ │ │ +3> tut16:start().
│ │ │ │  <0.38.0>
│ │ │ │  Pong received ping
│ │ │ │  Ping received pong
│ │ │ │  Pong received ping
│ │ │ │  Ping received pong
│ │ │ │  Pong received ping
│ │ │ │  Ping received pong
│ │ │ │  ping finished
│ │ │ │ -Pong finished
    Here the start/0 function,
    register(pong, spawn(tut16, pong, [])),
    both spawns the "pong" process and gives it the name pong. In the "ping"
│ │ │ │ -process, messages can be sent to pong by:
    pong ! {ping, self()},
    ping/2 now becomes ping/1 as the argument Pong_PID is not needed.
    
│ │ │ │ +Pong finished
    Here the start/0 function,
    register(pong, spawn(tut16, pong, [])),
    both spawns the "pong" process and gives it the name pong. In the "ping"
│ │ │ │ +process, messages can be sent to pong by:
    pong ! {ping, self()},
    ping/2 now becomes ping/1 as the argument Pong_PID is not needed.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Distributed Programming
│ │ │ │  
    
│ │ │ │  
    Let us rewrite the ping pong program with "ping" and "pong" on different
│ │ │ │  computers. First a few things are needed to set up to get this to work. The
│ │ │ │ @@ -255,106 +255,106 @@
│ │ │ │  of the file. This is a requirement.
    When you start an Erlang system that is going to talk to other Erlang systems,
│ │ │ │  you must give it a name, for example:
    $ erl -sname my_name
    We will see more details of this later. If you want to experiment with
│ │ │ │  distributed Erlang, but you only have one computer to work on, you can start two
│ │ │ │  separate Erlang systems on the same computer but give them different names. Each
│ │ │ │  Erlang system running on a computer is called an Erlang node.
    (Note: erl -sname assumes that all nodes are in the same IP domain and we can
│ │ │ │  use only the first component of the IP address, if we want to use nodes in
│ │ │ │  different domains we use -name instead, but then all IP address must be given
│ │ │ │ -in full.)
    Here is the ping pong example modified to run on two separate nodes:
    -module(tut17).
│ │ │ │ +in full.)
    Here is the ping pong example modified to run on two separate nodes:
    -module(tut17).
│ │ │ │  
│ │ │ │ --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) ->
│ │ │ │ -    {pong, Pong_Node} ! finished,
│ │ │ │ -    io:format("ping finished~n", []);
│ │ │ │ +ping(0, Pong_Node) ->
│ │ │ │ +    {pong, Pong_Node} ! finished,
│ │ │ │ +    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
│ │ │ │          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() ->
│ │ │ │ -    register(pong, spawn(tut17, pong, [])).
│ │ │ │ +start_pong() ->
│ │ │ │ +    register(pong, spawn(tut17, pong, [])).
│ │ │ │  
│ │ │ │ -start_ping(Pong_Node) ->
│ │ │ │ -    spawn(tut17, ping, [3, Pong_Node]).
    Let us assume there are two computers called gollum and kosken. First a node is
│ │ │ │ +start_ping(Pong_Node) ->
│ │ │ │ +    spawn(tut17, ping, [3, Pong_Node]).
    Let us assume there are two computers called gollum and kosken. First a node is
│ │ │ │  started on kosken, called ping, and then a node on gollum, called pong.
    On kosken (on a Linux/UNIX system):
    kosken> erl -sname ping
│ │ │ │  Erlang (BEAM) emulator version 5.2.3.7 [hipe] [threads:0]
│ │ │ │  
│ │ │ │  Eshell V5.2.3.7  (abort with ^G)
│ │ │ │  (ping@kosken)1>
    On gollum:
    gollum> erl -sname pong
│ │ │ │  Erlang (BEAM) emulator version 5.2.3.7 [hipe] [threads:0]
│ │ │ │  
│ │ │ │  Eshell V5.2.3.7  (abort with ^G)
│ │ │ │ -(pong@gollum)1>
    Now the "pong" process on gollum is started:
    (pong@gollum)1> tut17:start_pong().
│ │ │ │ +(pong@gollum)1>
    Now the "pong" process on gollum is started:
    (pong@gollum)1> tut17:start_pong().
│ │ │ │  true
    And the "ping" process on kosken is started (from the code above you can see
│ │ │ │  that a parameter of the start_ping function is the node name of the Erlang
│ │ │ │ -system where "pong" is running):
    (ping@kosken)1> tut17:start_ping(pong@gollum).
│ │ │ │ +system where "pong" is running):
    (ping@kosken)1> tut17:start_ping(pong@gollum).
│ │ │ │  <0.37.0>
│ │ │ │  Ping received pong
│ │ │ │  Ping received pong
│ │ │ │  Ping received pong
│ │ │ │  ping finished
    As shown, the ping pong program has run. On the "pong" side:
    (pong@gollum)2> 
│ │ │ │  Pong received ping
│ │ │ │  Pong received ping
│ │ │ │  Pong received ping
│ │ │ │  Pong finished
│ │ │ │ -(pong@gollum)2> 
    Looking at the tut17 code, you see that the pong function itself is
│ │ │ │ +(pong@gollum)2> 
    Looking at the tut17 code, you see that the pong function itself is
│ │ │ │  unchanged, the following lines work in the same way irrespective of on which
│ │ │ │ -node the "ping" process is executes:
    {ping, Ping_PID} ->
│ │ │ │ -    io:format("Pong received ping~n", []),
│ │ │ │ +node the "ping" process is executes:
    {ping, Ping_PID} ->
│ │ │ │ +    io:format("Pong received ping~n", []),
│ │ │ │      Ping_PID ! pong,
    Thus, Erlang pids contain information about where the process executes. So if
│ │ │ │  you know the pid of a process, the ! operator can be used to send it a
│ │ │ │ -message disregarding if the process is on the same node or on a different node.
    A difference is how messages are sent to a registered process on another node:
    {pong, Pong_Node} ! {ping, self()},
    A tuple {registered_name,node_name} is used instead of just the
│ │ │ │ +message disregarding if the process is on the same node or on a different node.
    A difference is how messages are sent to a registered process on another node:
    {pong, Pong_Node} ! {ping, self()},
    A tuple {registered_name,node_name} is used instead of just the
│ │ │ │  registered_name.
    In the previous example, "ping" and "pong" were started from the shells of two
│ │ │ │  separate Erlang nodes. spawn can also be used to start processes in other
│ │ │ │  nodes.
    The next example is the ping pong program, yet again, but this time "ping" is
│ │ │ │ -started in another node:
    -module(tut18).
│ │ │ │ +started in another node:
    -module(tut18).
│ │ │ │  
│ │ │ │ --export([start/1,  ping/2, pong/0]).
│ │ │ │ +-export([start/1,  ping/2, pong/0]).
│ │ │ │  
│ │ │ │ -ping(0, Pong_Node) ->
│ │ │ │ -    {pong, Pong_Node} ! finished,
│ │ │ │ -    io:format("ping finished~n", []);
│ │ │ │ +ping(0, Pong_Node) ->
│ │ │ │ +    {pong, Pong_Node} ! finished,
│ │ │ │ +    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
│ │ │ │          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(Ping_Node) ->
│ │ │ │ -    register(pong, spawn(tut18, pong, [])),
│ │ │ │ -    spawn(Ping_Node, tut18, ping, [3, node()]).
    Assuming an Erlang system called ping (but not the "ping" process) has already
│ │ │ │ -been started on kosken, then on gollum this is done:
    (pong@gollum)1> tut18:start(ping@kosken).
│ │ │ │ +start(Ping_Node) ->
│ │ │ │ +    register(pong, spawn(tut18, pong, [])),
│ │ │ │ +    spawn(Ping_Node, tut18, ping, [3, node()]).
    Assuming an Erlang system called ping (but not the "ping" process) has already
│ │ │ │ +been started on kosken, then on gollum this is done:
    (pong@gollum)1> tut18:start(ping@kosken).
│ │ │ │  <3934.39.0>
│ │ │ │  Pong received ping
│ │ │ │  Ping received pong
│ │ │ │  Pong received ping
│ │ │ │  Ping received pong
│ │ │ │  Pong received ping
│ │ │ │  Ping received pong
│ │ │ │ @@ -421,184 +421,184 @@
│ │ │ │  %%% Started: messenger:client(Server_Node, Name)
│ │ │ │  %%% To client: logoff
│ │ │ │  %%% To client: {message_to, ToName, Message}
│ │ │ │  %%%
│ │ │ │  %%% Configuration: change the server_node() function to return the
│ │ │ │  %%% name of the node where the messenger server runs
│ │ │ │  
│ │ │ │ --module(messenger).
│ │ │ │ --export([start_server/0, server/1, logon/1, logoff/0, message/2, client/2]).
│ │ │ │ +-module(messenger).
│ │ │ │ +-export([start_server/0, server/1, logon/1, logoff/0, message/2, client/2]).
│ │ │ │  
│ │ │ │  %%% Change the function below to return the name of the node where the
│ │ │ │  %%% messenger server runs
│ │ │ │ -server_node() ->
│ │ │ │ +server_node() ->
│ │ │ │      messenger@super.
│ │ │ │  
│ │ │ │  %%% This is the server process for the "messenger"
│ │ │ │  %%% the user list has the format [{ClientPid1, Name1},{ClientPid22, Name2},...]
│ │ │ │ -server(User_List) ->
│ │ │ │ +server(User_List) ->
│ │ │ │      receive
│ │ │ │ -        {From, logon, Name} ->
│ │ │ │ -            New_User_List = server_logon(From, Name, User_List),
│ │ │ │ -            server(New_User_List);
│ │ │ │ -        {From, logoff} ->
│ │ │ │ -            New_User_List = server_logoff(From, User_List),
│ │ │ │ -            server(New_User_List);
│ │ │ │ -        {From, message_to, To, Message} ->
│ │ │ │ -            server_transfer(From, To, Message, User_List),
│ │ │ │ -            io:format("list is now: ~p~n", [User_List]),
│ │ │ │ -            server(User_List)
│ │ │ │ +        {From, logon, Name} ->
│ │ │ │ +            New_User_List = server_logon(From, Name, User_List),
│ │ │ │ +            server(New_User_List);
│ │ │ │ +        {From, logoff} ->
│ │ │ │ +            New_User_List = server_logoff(From, User_List),
│ │ │ │ +            server(New_User_List);
│ │ │ │ +        {From, message_to, To, Message} ->
│ │ │ │ +            server_transfer(From, To, Message, User_List),
│ │ │ │ +            io:format("list is now: ~p~n", [User_List]),
│ │ │ │ +            server(User_List)
│ │ │ │      end.
│ │ │ │  
│ │ │ │  %%% Start the server
│ │ │ │ -start_server() ->
│ │ │ │ -    register(messenger, spawn(messenger, server, [[]])).
│ │ │ │ +start_server() ->
│ │ │ │ +    register(messenger, spawn(messenger, server, [[]])).
│ │ │ │  
│ │ │ │  
│ │ │ │  %%% Server adds a new user to the user list
│ │ │ │ -server_logon(From, Name, User_List) ->
│ │ │ │ +server_logon(From, Name, User_List) ->
│ │ │ │      %% check if logged on anywhere else
│ │ │ │ -    case lists:keymember(Name, 2, User_List) of
│ │ │ │ +    case lists:keymember(Name, 2, User_List) of
│ │ │ │          true ->
│ │ │ │ -            From ! {messenger, stop, user_exists_at_other_node},  %reject logon
│ │ │ │ +            From ! {messenger, stop, user_exists_at_other_node},  %reject logon
│ │ │ │              User_List;
│ │ │ │          false ->
│ │ │ │ -            From ! {messenger, logged_on},
│ │ │ │ -            [{From, Name} | User_List]        %add user to the list
│ │ │ │ +            From ! {messenger, logged_on},
│ │ │ │ +            [{From, Name} | User_List]        %add user to the list
│ │ │ │      end.
│ │ │ │  
│ │ │ │  %%% Server deletes a user from the user list
│ │ │ │ -server_logoff(From, User_List) ->
│ │ │ │ -    lists:keydelete(From, 1, User_List).
│ │ │ │ +server_logoff(From, User_List) ->
│ │ │ │ +    lists:keydelete(From, 1, User_List).
│ │ │ │  
│ │ │ │  
│ │ │ │  %%% Server transfers a message between user
│ │ │ │ -server_transfer(From, To, Message, User_List) ->
│ │ │ │ +server_transfer(From, To, Message, User_List) ->
│ │ │ │      %% check that the user is logged on and who he is
│ │ │ │ -    case lists:keysearch(From, 1, User_List) of
│ │ │ │ +    case lists:keysearch(From, 1, User_List) of
│ │ │ │          false ->
│ │ │ │ -            From ! {messenger, stop, you_are_not_logged_on};
│ │ │ │ -        {value, {From, Name}} ->
│ │ │ │ -            server_transfer(From, Name, To, Message, User_List)
│ │ │ │ +            From ! {messenger, stop, you_are_not_logged_on};
│ │ │ │ +        {value, {From, Name}} ->
│ │ │ │ +            server_transfer(From, Name, To, Message, User_List)
│ │ │ │      end.
│ │ │ │  %%% If the user exists, send the message
│ │ │ │ -server_transfer(From, Name, To, Message, User_List) ->
│ │ │ │ +server_transfer(From, Name, To, Message, User_List) ->
│ │ │ │      %% Find the receiver and send the message
│ │ │ │ -    case lists:keysearch(To, 2, User_List) of
│ │ │ │ +    case lists:keysearch(To, 2, User_List) of
│ │ │ │          false ->
│ │ │ │ -            From ! {messenger, receiver_not_found};
│ │ │ │ -        {value, {ToPid, To}} ->
│ │ │ │ -            ToPid ! {message_from, Name, Message},
│ │ │ │ -            From ! {messenger, sent}
│ │ │ │ +            From ! {messenger, receiver_not_found};
│ │ │ │ +        {value, {ToPid, To}} ->
│ │ │ │ +            ToPid ! {message_from, Name, Message},
│ │ │ │ +            From ! {messenger, sent}
│ │ │ │      end.
│ │ │ │  
│ │ │ │  
│ │ │ │  %%% User Commands
│ │ │ │ -logon(Name) ->
│ │ │ │ -    case whereis(mess_client) of
│ │ │ │ +logon(Name) ->
│ │ │ │ +    case whereis(mess_client) of
│ │ │ │          undefined ->
│ │ │ │ -            register(mess_client,
│ │ │ │ -                     spawn(messenger, client, [server_node(), Name]));
│ │ │ │ +            register(mess_client,
│ │ │ │ +                     spawn(messenger, 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, ToName, Message},
│ │ │ │ +        _ -> mess_client ! {message_to, ToName, Message},
│ │ │ │               ok
│ │ │ │  end.
│ │ │ │  
│ │ │ │  
│ │ │ │  %%% The client process which runs on each server node
│ │ │ │ -client(Server_Node, Name) ->
│ │ │ │ -    {messenger, Server_Node} ! {self(), logon, Name},
│ │ │ │ -    await_result(),
│ │ │ │ -    client(Server_Node).
│ │ │ │ +client(Server_Node, Name) ->
│ │ │ │ +    {messenger, Server_Node} ! {self(), logon, Name},
│ │ │ │ +    await_result(),
│ │ │ │ +    client(Server_Node).
│ │ │ │  
│ │ │ │ -client(Server_Node) ->
│ │ │ │ +client(Server_Node) ->
│ │ │ │      receive
│ │ │ │          logoff ->
│ │ │ │ -            {messenger, Server_Node} ! {self(), logoff},
│ │ │ │ -            exit(normal);
│ │ │ │ -        {message_to, ToName, Message} ->
│ │ │ │ -            {messenger, Server_Node} ! {self(), message_to, ToName, Message},
│ │ │ │ -            await_result();
│ │ │ │ -        {message_from, FromName, Message} ->
│ │ │ │ -            io:format("Message from ~p: ~p~n", [FromName, Message])
│ │ │ │ +            {messenger, Server_Node} ! {self(), logoff},
│ │ │ │ +            exit(normal);
│ │ │ │ +        {message_to, ToName, Message} ->
│ │ │ │ +            {messenger, Server_Node} ! {self(), message_to, ToName, 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
│ │ │ │ -        {messenger, stop, Why} -> % Stop the client
│ │ │ │ -            io:format("~p~n", [Why]),
│ │ │ │ -            exit(normal);
│ │ │ │ -        {messenger, What} ->  % Normal response
│ │ │ │ -            io:format("~p~n", [What])
│ │ │ │ +        {messenger, stop, Why} -> % Stop the client
│ │ │ │ +            io:format("~p~n", [Why]),
│ │ │ │ +            exit(normal);
│ │ │ │ +        {messenger, What} ->  % Normal response
│ │ │ │ +            io:format("~p~n", [What])
│ │ │ │      end.
    To use this program, you need to:
    • Configure the server_node() function.
    • Copy the compiled code (messenger.beam) to the directory on each computer
│ │ │ │  where you start Erlang.
    In the following example using this program, nodes are started on four different
│ │ │ │  computers. If you do not have that many machines available on your network, you
│ │ │ │  can start several nodes on the same machine.
    Four Erlang nodes are started up: messenger@super, c1@bilbo, c2@kosken,
│ │ │ │ -c3@gollum.
    First the server at messenger@super is started up:
    (messenger@super)1> messenger:start_server().
│ │ │ │ -true
    Now Peter logs on at c1@bilbo:
    (c1@bilbo)1> messenger:logon(peter).
│ │ │ │ +c3@gollum.
    First the server at messenger@super is started up:
    (messenger@super)1> messenger:start_server().
│ │ │ │ +true
    Now Peter logs on at c1@bilbo:
    (c1@bilbo)1> messenger:logon(peter).
│ │ │ │  true
│ │ │ │ -logged_on
    James logs on at c2@kosken:
    (c2@kosken)1> messenger:logon(james).
│ │ │ │ +logged_on
    James logs on at c2@kosken:
    (c2@kosken)1> messenger:logon(james).
│ │ │ │  true
│ │ │ │ -logged_on
    And Fred logs on at c3@gollum:
    (c3@gollum)1> messenger:logon(fred).
│ │ │ │ +logged_on
    And Fred logs on at c3@gollum:
    (c3@gollum)1> messenger:logon(fred).
│ │ │ │  true
│ │ │ │ -logged_on
    Now Peter sends Fred a message:
    (c1@bilbo)2> messenger:message(fred, "hello").
│ │ │ │ +logged_on
    Now Peter sends Fred a message:
    (c1@bilbo)2> messenger:message(fred, "hello").
│ │ │ │  ok
│ │ │ │  sent
    Fred receives the message and sends a message to Peter and logs off:
    Message from peter: "hello"
│ │ │ │ -(c3@gollum)2> messenger:message(peter, "go away, I'm busy").
│ │ │ │ +(c3@gollum)2> messenger:message(peter, "go away, I'm busy").
│ │ │ │  ok
│ │ │ │  sent
│ │ │ │ -(c3@gollum)3> messenger:logoff().
│ │ │ │ -logoff
    James now tries to send a message to Fred:
    (c2@kosken)2> messenger:message(fred, "peter doesn't like you").
│ │ │ │ +(c3@gollum)3> messenger:logoff().
│ │ │ │ +logoff
    James now tries to send a message to Fred:
    (c2@kosken)2> messenger:message(fred, "peter doesn't like you").
│ │ │ │  ok
│ │ │ │  receiver_not_found
    But this fails as Fred has already logged off.
    First let us look at some of the new concepts that have been introduced.
    There are two versions of the server_transfer function: one with four
│ │ │ │  arguments (server_transfer/4) and one with five (server_transfer/5). These
│ │ │ │  are regarded by Erlang as two separate functions.
    Notice how to write the server function so that it calls itself, through
│ │ │ │  server(User_List), and thus creates a loop. The Erlang compiler is "clever"
│ │ │ │  and optimizes the code so that this really is a sort of loop and not a proper
│ │ │ │  function call. But this only works if there is no code after the call.
│ │ │ │  Otherwise, the compiler expects the call to return and make a proper function
│ │ │ │  call. This would result in the process getting bigger and bigger for every loop.
    Functions in the lists module are used. This is a very useful module and a
│ │ │ │  study of the manual page is recommended (erl -man lists).
│ │ │ │  lists:keymember(Key,Position,Lists) looks through a list of tuples and looks
│ │ │ │  at Position in each tuple to see if it is the same as Key. The first element
│ │ │ │  is position 1. If it finds a tuple where the element at Position is the same
│ │ │ │ -as Key, it returns true, otherwise false.
    3> lists:keymember(a, 2, [{x,y,z},{b,b,b},{b,a,c},{q,r,s}]).
│ │ │ │ +as Key, it returns true, otherwise false.
    3> lists:keymember(a, 2, [{x,y,z},{b,b,b},{b,a,c},{q,r,s}]).
│ │ │ │  true
│ │ │ │ -4> lists:keymember(p, 2, [{x,y,z},{b,b,b},{b,a,c},{q,r,s}]).
│ │ │ │ +4> lists:keymember(p, 2, [{x,y,z},{b,b,b},{b,a,c},{q,r,s}]).
│ │ │ │  false
    lists:keydelete works in the same way but deletes the first tuple found (if
│ │ │ │ -any) and returns the remaining list:
    5> lists:keydelete(a, 2, [{x,y,z},{b,b,b},{b,a,c},{q,r,s}]).
│ │ │ │ -[{x,y,z},{b,b,b},{q,r,s}]
    lists:keysearch is like lists:keymember, but it returns
│ │ │ │ +any) and returns the remaining list:
    5> lists:keydelete(a, 2, [{x,y,z},{b,b,b},{b,a,c},{q,r,s}]).
│ │ │ │ +[{x,y,z},{b,b,b},{q,r,s}]
    lists:keysearch is like lists:keymember, but it returns
│ │ │ │  {value,Tuple_Found} or the atom false.
    There are many very useful functions in the lists module.
    An Erlang process (conceptually) runs until it does a receive and there is no
│ │ │ │  message which it wants to receive in the message queue. "conceptually" is used
│ │ │ │  here because the Erlang system shares the CPU time between the active processes
│ │ │ │  in the system.
    A process terminates when there is nothing more for it to do, that is, the last
│ │ │ │  function it calls simply returns and does not call another function. Another way
│ │ │ │  for a process to terminate is for it to call exit/1. The argument
│ │ │ │  to exit/1 has a special meaning, which is discussed later. In this
│ │ │ │  example, exit(normal) is done, which has the same effect as a
│ │ │ │  process running out of functions to call.
    The BIF whereis(RegisteredName) checks if a registered process
│ │ │ │  of name RegisteredName exists. If it exists, the pid of that process is
│ │ │ │  returned. If it does not exist, the atom undefined is returned.
    You should by now be able to understand most of the code in the
│ │ │ │  messenger-module. Let us study one case in detail: a message is sent from one
│ │ │ │ -user to another.
    The first user "sends" the message in the example above by:
    messenger:message(fred, "hello")
    After testing that the client process exists:
    whereis(mess_client)
    And a message is sent to mess_client:
    mess_client ! {message_to, fred, "hello"}
    The client sends the message to the server by:
    {messenger, messenger@super} ! {self(), message_to, fred, "hello"},
    And waits for a reply from the server.
    The server receives this message and calls:
    server_transfer(From, fred, "hello", User_List),
    This checks that the pid From is in the User_List:
    lists:keysearch(From, 1, User_List)
    If keysearch returns the atom false, some error has occurred and the server
│ │ │ │ -sends back the message:
    From ! {messenger, stop, you_are_not_logged_on}
    This is received by the client, which in turn does exit(normal)
│ │ │ │ +user to another.
    The first user "sends" the message in the example above by:
    messenger:message(fred, "hello")
    After testing that the client process exists:
    whereis(mess_client)
    And a message is sent to mess_client:
    mess_client ! {message_to, fred, "hello"}
    The client sends the message to the server by:
    {messenger, messenger@super} ! {self(), message_to, fred, "hello"},
    And waits for a reply from the server.
    The server receives this message and calls:
    server_transfer(From, fred, "hello", User_List),
    This checks that the pid From is in the User_List:
    lists:keysearch(From, 1, User_List)
    If keysearch returns the atom false, some error has occurred and the server
│ │ │ │ +sends back the message:
    From ! {messenger, stop, you_are_not_logged_on}
    This is received by the client, which in turn does exit(normal)
│ │ │ │  and terminates. If keysearch returns {value,{From,Name}} it is certain that
│ │ │ │ -the user is logged on and that his name (peter) is in variable Name.
    Let us now call:
    server_transfer(From, peter, fred, "hello", User_List)
    Notice that as this is server_transfer/5, it is not the same as the previous
│ │ │ │ +the user is logged on and that his name (peter) is in variable Name.
    Let us now call:
    server_transfer(From, peter, fred, "hello", User_List)
    Notice that as this is server_transfer/5, it is not the same as the previous
│ │ │ │  function server_transfer/4. Another keysearch is done on User_List to find
│ │ │ │ -the pid of the client corresponding to fred:
    lists:keysearch(fred, 2, User_List)
    This time argument 2 is used, which is the second element in the tuple. If this
│ │ │ │ +the pid of the client corresponding to fred:
    lists:keysearch(fred, 2, User_List)
    This time argument 2 is used, which is the second element in the tuple. If this
│ │ │ │  returns the atom false, fred is not logged on and the following message is
│ │ │ │ -sent:
    From ! {messenger, receiver_not_found};
    This is received by the client.
    If keysearch returns:
    {value, {ToPid, fred}}
    The following message is sent to fred's client:
    ToPid ! {message_from, peter, "hello"},
    The following message is sent to peter's client:
    From ! {messenger, sent}
    Fred's client receives the message and prints it:
    {message_from, peter, "hello"} ->
│ │ │ │ -    io:format("Message from ~p: ~p~n", [peter, "hello"])
    Peter's client receives the message in the await_result function.
    
│ │ │ │ +sent:
    From ! {messenger, receiver_not_found};
    This is received by the client.
    If keysearch returns:
    {value, {ToPid, fred}}
    The following message is sent to fred's client:
    ToPid ! {message_from, peter, "hello"},
    The following message is sent to peter's client:
    From ! {messenger, sent}
    Fred's client receives the message and prints it:
    {message_from, peter, "hello"} ->
│ │ │ │ +    io:format("Message from ~p: ~p~n", [peter, "hello"])
    Peter's client receives the message in the await_result function.
    
│ │ │ │  
│ │ │ │    
│ │ │ │  
│ │ │ ├── OEBPS/commoncaveats.xhtml
│ │ │ │ @@ -23,31 +23,31 @@
│ │ │ │  
    This section lists a few constructs to watch out for.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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, []).
│ │ │ │ +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) ->
│ │ │ │ +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].
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Timer Module
│ │ │ │ @@ -65,77 +65,77 @@
│ │ │ │  therefore harmless.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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#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#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).
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    list_to_atom/1
│ │ │ │  
    
│ │ │ │  
    Atoms are not garbage-collected. Once an atom is created, it is never removed.
│ │ │ │  The emulator terminates if the limit for the number of atoms (1,048,576 by
│ │ │ │  default) is reached.
    Therefore, converting arbitrary input strings to atoms can be dangerous in a
│ │ │ │  system that runs continuously. If only certain well-defined atoms are allowed as
│ │ │ │  input, list_to_existing_atom/1 or
│ │ │ │  binary_to_existing_atom/1 can be used
│ │ │ │  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)
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    length/1
│ │ │ │  
    
│ │ │ │  
    The time for calculating the length of a list is proportional to the length of
│ │ │ │  the list, as opposed to tuple_size/1,
│ │ │ │  byte_size/1, and bit_size/1, which all
│ │ │ │  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.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    setelement/3
│ │ │ │ @@ -143,18 +143,18 @@
│ │ │ │  
    setelement/3 copies the tuple it modifies. Therefore,
│ │ │ │  updating a tuple in a loop using setelement/3 creates a new
│ │ │ │  copy of the tuple every time.
    There is one exception to the rule that the tuple is copied. If the compiler
│ │ │ │  clearly can see that destructively updating the tuple would give the same result
│ │ │ │  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
│ │ │ │  best way to modify multiple elements in a large tuple is to convert the tuple to
│ │ │ │  a list, modify the list, and convert it back to a tuple.
    
│ │ │ │    
│ │ │ │      
│ │ │ ├── OEBPS/code_loading.xhtml
│ │ │ │ @@ -27,16 +27,16 @@
│ │ │ │      
│ │ │ │    
│ │ │ │    Compilation
│ │ │ │  
    
│ │ │ │  
    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
│ │ │ │  % erl -make
    The erlc program provides way to compile modules from the OS
│ │ │ │  shell, see the erlc executable in ERTS. It
│ │ │ │  understands a number of flags that can be used to define macros, add search
│ │ │ │  paths for include files, and more.
    % erlc <flags> File1.erl...FileN.erl
    
│ │ │ │ @@ -61,51 +61,51 @@
│ │ │ │  When a module is loaded into the system for the first time, the code becomes
│ │ │ │  'current'. If then a new instance of the module is loaded, the code of the
│ │ │ │  previous instance becomes 'old' and the new instance becomes 'current'.
    Both old and current code is valid, and can be evaluated concurrently. Fully
│ │ │ │  qualified function calls always refer to current code. Old code can still be
│ │ │ │  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
│ │ │ │  fun Module:FunctionName/Arity.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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
│ │ │ │  the error logger.
    If there already is current code for the module, that code will remain current
│ │ │ │  and can be called until the on_load function has returned. If the on_load
│ │ │ │  function fails, the current code (if any) will remain current. If there is no
│ │ │ │  current code for a module, any process that makes an external call to the module
│ │ │ │  before the on_load function has finished will be suspended until the on_load
│ │ │ │  function have finished.
    Change
    Before Erlang/OTP 19, if the on_load function failed, any previously current
│ │ │ │  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.
    
│ │ │ │  
│ │ │ │    
│ │ │ │  
│ │ │ ├── OEBPS/c_portdriver.xhtml
│ │ │ │ @@ -56,112 +56,112 @@
│ │ │ │  
    Like a port program, the port communicates with an Erlang process. All
│ │ │ │  communication goes through one Erlang process that is the connected process of
│ │ │ │  the port driver. Terminating this process closes the port driver.
    Before the port is created, the driver must be loaded. This is done with the
│ │ │ │  function erl_ddll:load_driver/2, with the name of the shared library as
│ │ │ │  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.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    C Driver
│ │ │ │  
    
│ │ │ │  
    The C driver is a module that is compiled and linked into a shared library. It
│ │ │ │  uses a driver structure and includes the header file erl_driver.h.
    The driver structure is filled with the driver name and function pointers. It is
│ │ │ │ @@ -252,22 +252,22 @@
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Running the Example
│ │ │ │  
    
│ │ │ │  
    Step 1. Compile the C code:
    unix> gcc -o example_drv.so -fpic -shared complex.c port_driver.c
│ │ │ │  windows> cl -LD -MD -Fe example_drv.dll complex.c port_driver.c
    Step 2. Start Erlang and compile the Erlang code:
    > erl
│ │ │ │ -Erlang/OTP 26 [erts-14.2] [source] [64-bit] [smp:8:8] [ds:8:8:10] [async-threads:1] [jit:ns]
│ │ │ │ +Erlang/OTP 26 [erts-14.2] [source] [64-bit] [smp:8:8] [ds:8:8:10] [async-threads:1] [jit:ns]
│ │ │ │  
│ │ │ │ -Eshell V14.2 (press Ctrl+G to abort, type help(). for help)
│ │ │ │ -1> c(complex5).
│ │ │ │ -{ok,complex5}
    Step 3. Run the example:
    2> complex5:start("example_drv").
│ │ │ │ +Eshell V14.2 (press Ctrl+G to abort, type help(). for help)
│ │ │ │ +1> c(complex5).
│ │ │ │ +{ok,complex5}
    Step 3. Run the example:
    2> complex5:start("example_drv").
│ │ │ │  <0.34.0>
│ │ │ │ -3> complex5:foo(3).
│ │ │ │ +3> complex5:foo(3).
│ │ │ │  4
│ │ │ │ -4> complex5:bar(5).
│ │ │ │ +4> complex5:bar(5).
│ │ │ │  10
│ │ │ │ -5> complex5:stop().
│ │ │ │ +5> complex5:stop().
│ │ │ │  stop
    
│ │ │ │  
│ │ │ │    
│ │ │ │  
│ │ │ ├── OEBPS/c_port.xhtml
│ │ │ │ @@ -53,101 +53,101 @@
│ │ │ │  external program, if it is written properly).
    The port is created using the BIF open_port/2 with
│ │ │ │  {spawn,ExtPrg} as the first argument. The string ExtPrg is the name of the
│ │ │ │  external program, including any command line arguments. The second argument is a
│ │ │ │  list of options, in this case only {packet,2}. This option says that a 2 byte
│ │ │ │  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.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    C Program
│ │ │ │  
    
│ │ │ │  
    On the C side, it is necessary to write functions for receiving and sending data
│ │ │ │  with 2 byte length indicators from/to Erlang. By default, the C program is to
│ │ │ │ @@ -238,22 +238,22 @@
│ │ │ │  and terminates.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Running the Example
│ │ │ │  
    
│ │ │ │  
    Step 1. Compile the C code:
    $ gcc -o extprg complex.c erl_comm.c port.c
    Step 2. Start Erlang and compile the Erlang code:
    $ erl
│ │ │ │ -Erlang/OTP 26 [erts-14.2] [source] [64-bit] [smp:8:8] [ds:8:8:10] [async-threads:1] [jit:ns]
│ │ │ │ +Erlang/OTP 26 [erts-14.2] [source] [64-bit] [smp:8:8] [ds:8:8:10] [async-threads:1] [jit:ns]
│ │ │ │  
│ │ │ │ -Eshell V14.2 (press Ctrl+G to abort, type help(). for help)
│ │ │ │ -1> c(complex1).
│ │ │ │ -{ok,complex1}
    Step 3. Run the example:
    2> complex1:start("./extprg").
│ │ │ │ +Eshell V14.2 (press Ctrl+G to abort, type help(). for help)
│ │ │ │ +1> c(complex1).
│ │ │ │ +{ok,complex1}
    Step 3. Run the example:
    2> complex1:start("./extprg").
│ │ │ │  <0.34.0>
│ │ │ │ -3> complex1:foo(3).
│ │ │ │ +3> complex1:foo(3).
│ │ │ │  4
│ │ │ │ -4> complex1:bar(5).
│ │ │ │ +4> complex1:bar(5).
│ │ │ │  10
│ │ │ │ -5> complex1:stop().
│ │ │ │ +5> complex1:stop().
│ │ │ │  stop
    
│ │ │ │  
│ │ │ │    
│ │ │ │  
│ │ │ ├── OEBPS/bit_syntax.xhtml
│ │ │ │ @@ -24,48 +24,48 @@
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Introduction
│ │ │ │  
│ │ │ │  
    The complete specification for the bit syntax appears in the
│ │ │ │  Reference Manual.
    In Erlang, a Bin is used for constructing binaries and matching binary patterns.
│ │ │ │ -A Bin is written with the following syntax:
    <<E1, E2, ... En>>
    A Bin is a low-level sequence of bits or bytes. The purpose of a Bin is to
│ │ │ │ -enable construction of binaries:
    Bin = <<E1, E2, ... En>>
    All elements must be bound. Or match a binary:
    <<E1, E2, ... En>> = Bin
    Here, Bin is bound and the elements are bound or unbound, as in any match.
    A Bin does not need to consist of a whole number of bytes.
    A bitstring is a sequence of zero or more bits, where the number of bits does
│ │ │ │ +A Bin is written with the following syntax:
    <<E1, E2, ... En>>
    A Bin is a low-level sequence of bits or bytes. The purpose of a Bin is to
│ │ │ │ +enable construction of binaries:
    Bin = <<E1, E2, ... En>>
    All elements must be bound. Or match a binary:
    <<E1, E2, ... En>> = Bin
    Here, Bin is bound and the elements are bound or unbound, as in any match.
    A Bin does not need to consist of a whole number of bytes.
    A bitstring is a sequence of zero or more bits, where the number of bits does
│ │ │ │  not need to be divisible by 8. If the number of bits is divisible by 8, the
│ │ │ │  bitstring is also a binary.
    Each element specifies a certain segment of the bitstring. A segment is a set
│ │ │ │  of contiguous bits of the binary (not necessarily on a byte boundary). The first
│ │ │ │  element specifies the initial segment, the second element specifies the
│ │ │ │  following segment, and so on.
    The following examples illustrate how binaries are constructed, or matched, and
│ │ │ │  how elements and tails are specified.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Examples
│ │ │ │  
    
│ │ │ │  
    Example 1: A binary can be constructed from a set of constants or a string
│ │ │ │ -literal:
    Bin11 = <<1, 17, 42>>,
│ │ │ │ -Bin12 = <<"abc">>
    This gives two binaries of size 3, with the following evaluations:
    Example 2:Similarly, a binary can be constructed from a set of bound
│ │ │ │ +literal:
    Bin11 = <<1, 17, 42>>,
│ │ │ │ +Bin12 = <<"abc">>
    This gives two binaries of size 3, with the following evaluations:
    Example 2:Similarly, a binary can be constructed from a set of bound
│ │ │ │  variables:
    A = 1, B = 17, C = 42,
│ │ │ │ -Bin2 = <<A, B, C:16>>
    This gives a binary of size 4. Here, a size expression is used for the
│ │ │ │ +Bin2 = <<A, B, C:16>>
    This gives a binary of size 4. Here, a size expression is used for the
│ │ │ │  variable C to specify a 16-bits segment of Bin2.
    binary_to_list(Bin2) evaluates to [1, 17, 00, 42].
    Example 3: A Bin can also be used for matching. D, E, and F are unbound
│ │ │ │ -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:
│ │ │ │ +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,
│ │ │ │ +    <<?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),
│ │ │ │ -        <<Opts:OptsLen/binary,Data/binary>> = RestDgram,
│ │ │ │ +      DestIP:32, RestDgram/binary>> when HLen>=5, 4*HLen=<DgramSize ->
│ │ │ │ +        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,
│ │ │ │  specifying that Opts is to bind to a binary. All other variables have the
│ │ │ │  default type equal to unsigned integer.
    An IP datagram header is of variable length. This length is measured in the
│ │ │ │  number of 32-bit words and is given in the segment corresponding to HLen. The
│ │ │ │  minimum value of HLen is 5. It is the segment corresponding to Opts that is
│ │ │ │  variable, so if HLen is equal to 5, Opts becomes an empty binary.
    The tail variables RestDgram and Data bind to binaries, as all tail
│ │ │ │ @@ -123,77 +123,77 @@
│ │ │ │  
    This section describes the rules for constructing binaries using the bit syntax.
│ │ │ │  Unlike when constructing lists or tuples, the construction of a binary can fail
│ │ │ │  with a badarg exception.
    There can be zero or more segments in a binary to be constructed. The expression
│ │ │ │  <<>> constructs a zero length binary.
    Each segment in a binary can consist of zero or more bits. There are no
│ │ │ │  alignment rules for individual segments of type integer and float. For
│ │ │ │  binaries and bitstrings without size, the unit specifies the alignment. Since
│ │ │ │  the default alignment for the binary type is 8, the size of a binary segment
│ │ │ │ -must be a multiple of 8 bits, that is, only whole bytes.
    Example:
    <<Bin/binary,Bitstring/bitstring>>
    The variable Bin must contain a whole number of bytes, because the binary
│ │ │ │ +must be a multiple of 8 bits, that is, only whole bytes.
    Example:
    <<Bin/binary,Bitstring/bitstring>>
    The variable Bin must contain a whole number of bytes, because the binary
│ │ │ │  type defaults to unit:8. A badarg exception is generated if Bin consist
│ │ │ │  of, for example, 17 bits.
    The Bitstring variable can consist of any number of bits, for example, 0, 1,
│ │ │ │  8, 11, 17, 42, and so on. This is because the default unit for bitstrings
│ │ │ │  is 1.
    For clarity, it is recommended not to change the unit size for binaries.
│ │ │ │  Instead, use binary when you need byte alignment and bitstring when you need
│ │ │ │  bit alignment.
    The following example successfully constructs a bitstring of 7 bits, provided
│ │ │ │ -that all of X and Y are integers:
    <<X:1,Y:6>>
    As mentioned earlier, segments have the following general syntax:
    Value:Size/TypeSpecifierList
    When constructing binaries, Value and Size can be any Erlang expression.
│ │ │ │ +that all of X and Y are integers:
    <<X:1,Y:6>>
    As mentioned earlier, segments have the following general syntax:
    Value:Size/TypeSpecifierList
    When constructing binaries, Value and Size can be any Erlang expression.
│ │ │ │  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>>
    
│ │ │ │ +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>>
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Including Literal Strings
│ │ │ │  
    
│ │ │ │ -
    A literal string can be written instead of an element:
    <<"hello">>
    This is syntactic sugar for the following:
    <<$h,$e,$l,$l,$o>>
    
│ │ │ │ +
    A literal string can be written instead of an element:
    <<"hello">>
    This is syntactic sugar for the following:
    <<$h,$e,$l,$l,$o>>
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Matching Binaries
│ │ │ │  
    
│ │ │ │  
    This section describes the rules for matching binaries, using the bit syntax.
    There can be zero or more segments in a binary pattern. A binary pattern can
│ │ │ │  occur wherever patterns are allowed, including inside other patterns. Binary
│ │ │ │  patterns cannot be nested. The pattern <<>> matches a zero length binary.
    Each segment in a binary can consist of zero or more bits. A segment of type
│ │ │ │  binary must have a size evenly divisible by 8 (or divisible by the unit size,
│ │ │ │  if the unit size has been changed). A segment of type bitstring has no
│ │ │ │  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) ->
│ │ │ │ -   <<X:N,T/binary>> = Bin,
│ │ │ │ -   {X,T}.
    Note
    Before OTP 23, Size was restricted to be an integer or a variable bound to
│ │ │ │ +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
│ │ │ │  an integer.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Binding and Using a Size Variable
│ │ │ │  
    
│ │ │ │  
    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.
    
│ │ │ │  
│ │ │ │    
│ │ │ │  
│ │ │ ├── OEBPS/binaryhandling.xhtml
│ │ │ │ @@ -19,43 +19,43 @@
│ │ │ │  
│ │ │ │      
    
│ │ │ │  Constructing and Matching Binaries
│ │ │ │      
    
│ │ │ │  
    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),
│ │ │ │ -    <<RevTail/binary,H>>;
│ │ │ │ -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(<<>>) -> [].
    
│ │ │ │ +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([]) ->
│ │ │ │ +    <<>>.
    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(<<>>) -> [].
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    How Binaries are Implemented
│ │ │ │  
    
│ │ │ │  
    Internally, binaries and bitstrings are implemented in the same way. In this
│ │ │ │  section, they are called binaries because that is what they are called in the
│ │ │ │ @@ -110,29 +110,29 @@
│ │ │ │  called referential transparency) of Erlang would break.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Constructing Binaries
│ │ │ │  
    
│ │ │ │  
    Appending to a binary or bitstring in the following way is specially optimized
│ │ │ │ -to avoid copying the binary:
    <<Binary/binary, ...>>
│ │ │ │ +to avoid copying the binary:
    <<Binary/binary, ...>>
│ │ │ │  %% - OR -
│ │ │ │ -<<Binary/bitstring, ...>>
    This optimization is applied by the runtime system in a way that makes it
│ │ │ │ +<<Binary/bitstring, ...>>
    This optimization is applied by the runtime system in a way that makes it
│ │ │ │  effective in most circumstances (for exceptions, see
│ │ │ │  Circumstances That Force Copying). The
│ │ │ │  optimization in its basic form does not need any help from the compiler.
│ │ │ │  However, the compiler add hints to the runtime system when it is safe to apply
│ │ │ │  the optimization in a more efficient way.
    Change
    The compiler support for making the optimization more efficient was added in
│ │ │ │  Erlang/OTP 26.
    To explain how the basic optimization works, let us examine the following code
│ │ │ │ -line by line:
    Bin0 = <<0>>,                    %% 1
│ │ │ │ -Bin1 = <<Bin0/binary,1,2,3>>,    %% 2
│ │ │ │ -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
│ │ │ │ +line by line:
      Bin0 = <<0>>,                    %% 1
│ │ │ │ +Bin1 = <<Bin0/binary,1,2,3>>,    %% 2
│ │ │ │ +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
│ │ │ │  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
│ │ │ │  binary has its size set to the size of the data stored in the binary, while
│ │ │ │  the binary object has extra space allocated. The size of the binary object is
│ │ │ │  either twice the size of Bin1 or 256, whichever is larger. In this case it
│ │ │ │  is 256.
      • Line 3 is more interesting. Bin1 has been used in an append operation, and
│ │ │ │ @@ -158,23 +158,23 @@
│ │ │ │  handle an append operation to a heap binary by copying it to a refc binary (line
│ │ │ │  2), and also handle an append operation to a previous version of the binary by
│ │ │ │  copying it (line 5). The support for doing that does not come for free. For
│ │ │ │  example, to make it possible to know when it is necessary to copy the binary,
│ │ │ │  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
│ │ │ │  already reserved; thus, the append operation in repack/2 never needs to handle
│ │ │ │  a binary not prepared for appending.
        
│ │ │ │    
│ │ │ │      
│ │ │ │ @@ -186,72 +186,72 @@
│ │ │ │  reason is that the binary object can be moved (reallocated) during an append
│ │ │ │  operation, and when that happens, the pointer in the ProcBin must be updated. If
│ │ │ │  there would be more than one ProcBin pointing to the binary object, it would not
│ │ │ │  be possible to find and update all of them.
        Therefore, certain operations on a binary mark it so that any future append
│ │ │ │  operation will be forced to copy the binary. In most cases, the binary object
│ │ │ │  will be shrunk at the same time to reclaim the extra space allocated for
│ │ │ │  growing.
        When appending to a binary as follows, only the binary returned from the latest
│ │ │ │ -append operation will support further cheap append operations:
        Bin = <<Bin0,...>>
        In the code fragment in the beginning of this section, appending to Bin will
│ │ │ │ +append operation will support further cheap append operations:
        Bin = <<Bin0,...>>
        In the code fragment in the beginning of this section, appending to Bin will
│ │ │ │  be cheap, while appending to Bin0 will force the creation of a new binary and
│ │ │ │  copying of the contents of Bin0.
        If a binary is sent as a message to a process or port, the binary will be shrunk
│ │ │ │  and any further append operation will copy the binary data into a new binary.
│ │ │ │  For example, in the following code fragment Bin1 will be copied in the third
│ │ │ │ -line:
        Bin1 = <<Bin0,...>>,
│ │ │ │ +line:
        Bin1 = <<Bin0,...>>,
│ │ │ │  PortOrPid ! Bin1,
│ │ │ │ -Bin = <<Bin1,...>>  %% Bin1 will be COPIED
        The same happens if you insert a binary into an Ets table, send it to a port
│ │ │ │ +Bin = <<Bin1,...>>  %% Bin1 will be COPIED
        The same happens if you insert a binary into an Ets table, send it to a port
│ │ │ │  using erlang:port_command/2, or pass it to
│ │ │ │  enif_inspect_binary in a NIF.
        Matching a binary will also cause it to shrink and the next append operation
│ │ │ │ -will copy the binary data:
        Bin1 = <<Bin0,...>>,
│ │ │ │ -<<X,Y,Z,T/binary>> = Bin1,
│ │ │ │ -Bin = <<Bin1,...>>  %% Bin1 will be COPIED
        The reason is that a match context contains a
│ │ │ │ +will copy the binary data:
        Bin1 = <<Bin0,...>>,
│ │ │ │ +<<X,Y,Z,T/binary>> = Bin1,
│ │ │ │ +Bin = <<Bin1,...>>  %% Bin1 will be COPIED
        The reason is that a match context contains a
│ │ │ │  direct pointer to the binary data.
        If a process simply keeps binaries (either in "loop data" or in the process
│ │ │ │  dictionary), the garbage collector can eventually shrink the binaries. If only
│ │ │ │  one such binary is kept, it will not be shrunk. If the process later appends to
│ │ │ │  a binary that has been shrunk, the binary object will be reallocated to make
│ │ │ │  place for the data to be appended.
        
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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
│ │ │ │  sub binary, but in this particular example the
│ │ │ │  compiler sees that there will soon be a call to a function (in this case, to
│ │ │ │  my_binary_to_list/1 itself) that immediately will create a new match context
│ │ │ │  and discard the sub binary.
        Therefore my_binary_to_list/1 calls itself with the match context instead of
│ │ │ │  with a sub binary. The instruction that initializes the matching operation
│ │ │ │  basically does nothing when it sees that it was passed a match context instead
│ │ │ │  of a binary.
        When the end of the binary is reached and the second clause matches, the match
│ │ │ │  context will simply be discarded (removed in the next garbage collection, as
│ │ │ │  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(<<>>) ->
│ │ │ │ -    <<>>.
        Yes, it will. The compiler will remove the building of the sub binary in the
│ │ │ │ +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?
        
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Option bin_opt_info
│ │ │ │ @@ -259,35 +259,35 @@
│ │ │ │  
        Use the bin_opt_info option to have the compiler print a lot of information
│ │ │ │  about binary optimizations. It can be given either to the compiler or erlc:
        erlc +bin_opt_info Mod.erl
        or passed through an environment variable:
        export ERL_COMPILER_OPTIONS=bin_opt_info
        Notice that the bin_opt_info is not meant to be a permanent option added to
│ │ │ │  your Makefiles, because all messages that it generates cannot be eliminated.
│ │ │ │  Therefore, passing the option through the environment is in most cases the most
│ │ │ │  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(<<>>) ->
│ │ │ │ -    <<>>.
        The warning for the first clause says that the creation of a sub binary cannot
│ │ │ │ +    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).
        
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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.
        
│ │ │ │  
│ │ │ │    
│ │ │ │  
│ │ │ ├── OEBPS/benchmarking.xhtml
│ │ │ │ @@ -49,16 +49,16 @@
│ │ │ │  fast as possible, what can we do? One way could be to generate more
│ │ │ │  than two bytes at the time.
        % erlperf 'rand:bytes(100).' 'crypto:strong_rand_bytes(100).'
│ │ │ │  Code                                   ||        QPS       Time   Rel
│ │ │ │  rand:bytes(100).                        1    2124 Ki     470 ns  100%
│ │ │ │  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.
        
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Benchmarking using Erlang/OTP functionality
│ │ │ │  
        
│ │ │ │  
        Benchmarks can measure wall-clock time or CPU time.
        • timer:tc/3 measures wall-clock time. The advantage with wall-clock time is
│ │ │ ├── OEBPS/appup_cookbook.xhtml
│ │ │ │ @@ -25,18 +25,18 @@
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Changing a Functional Module
│ │ │ │  
│ │ │ │  
          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}]}]
│ │ │ │ +}.
          
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Changing a Residence Module
│ │ │ │  
          
│ │ │ │  
          In a system implemented according to the OTP design principles, all processes,
│ │ │ │  except system processes and special processes, reside in one of the behaviours
│ │ │ │ @@ -47,46 +47,46 @@
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Changing a Callback Module
│ │ │ │  
│ │ │ │  
          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.
          
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Changing Internal State
│ │ │ │  
          
│ │ │ │  
          In this case, simple code replacement is not sufficient. The process must
│ │ │ │  explicitly transform its state using the callback function code_change/3 before
│ │ │ │  switching to the new version of the callback module. Thus, synchronized code
│ │ │ │  replacement is used.
          Example
          Consider the ch3 module from
│ │ │ │  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)
│ │ │ │  of the beam file, an uninteresting value, which is ignored.
          The other callback functions of ch3 must also be modified and perhaps a new
│ │ │ │  interface function must be added, but this is not shown here.
          
│ │ │ │    
│ │ │ │      
│ │ │ │ @@ -95,67 +95,67 @@
│ │ │ │  
          
│ │ │ │  
          Assume that a module is extended by adding an interface function, as in the
│ │ │ │  example in Release Handling, where a function
│ │ │ │  available/0 is added to ch3.
          If a call is added to this function, say in module m1, a runtime error could
│ │ │ │  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.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Changing Code for a Special Process
│ │ │ │  
    
│ │ │ │  
    In this case, simple code replacement is not sufficient. When a new version of a
│ │ │ │  residence module for a special process is loaded, the process must make a fully
│ │ │ │  qualified call to its loop function to switch to the new code. Thus,
│ │ │ │  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}.
    In this case, all arguments but the first are ignored and the function simply
│ │ │ │  returns the internal state again. This is enough if the code only has been
│ │ │ │  extended. If instead the internal state is changed (similar to the example in
│ │ │ │ @@ -176,85 +176,85 @@
│ │ │ │    Changing Properties
│ │ │ │  
│ │ │ │  
    Since the supervisor is to change its internal state, synchronized code
│ │ │ │  replacement is required. However, a special update instruction must be used.
    First, the new version of the callback module must be loaded, both in the case
│ │ │ │  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
│ │ │ │  affected when doing a synchronized code replacement.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Adding and Deleting Child Processes
│ │ │ │  
    
│ │ │ │  
    As stated earlier, changing child specifications does not affect existing child
│ │ │ │  processes. New child specifications are automatically added, but not deleted.
│ │ │ │  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]}}
│ │ │ │ +   ]}],
│ │ │ │ + [{"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
│ │ │ │  supervisor is not registered, it cannot be accessed directly from the script.
│ │ │ │  Instead a help function that finds the pid of the supervisor and calls
│ │ │ │  supervisor:restart_child, and so on, must be written. This function is then to
│ │ │ │  be called from the script using the apply instruction.
    If the module m1 is introduced in version "2" of ch_app, it must also be
│ │ │ │ -loaded when upgrading and deleted when downgrading:
    {"2",
│ │ │ │ - [{"1",
│ │ │ │ -   [{add_module, m1},
│ │ │ │ -    {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},
│ │ │ │ -    {delete_module, m1}
│ │ │ │ -   ]}]
│ │ │ │ -}.
    As stated earlier, the order of the instructions is important. When upgrading,
│ │ │ │ +loaded when upgrading and deleted when downgrading:
    {"2",
│ │ │ │ + [{"1",
│ │ │ │ +   [{add_module, m1},
│ │ │ │ +    {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},
│ │ │ │ +    {delete_module, m1}
│ │ │ │ +   ]}]
│ │ │ │ +}.
    As stated earlier, the order of the instructions is important. When upgrading,
│ │ │ │  m1 must be loaded, and the supervisor child specification changed, before the
│ │ │ │  new child process can be started. When downgrading, the child process must be
│ │ │ │  terminated before the child specification is changed and the module is deleted.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Adding or Deleting a Module
│ │ │ │  
    
│ │ │ │ -
    _Example
    _ A new functional module m is added to ch_app:
    {"2",
│ │ │ │ - [{"1", [{add_module, m}]}],
│ │ │ │ - [{"1", [{delete_module, m}]}]
    
│ │ │ │ +
    _Example
    _ A new functional module m is added to ch_app:
    {"2",
│ │ │ │ + [{"1", [{add_module, m}]}],
│ │ │ │ + [{"1", [{delete_module, m}]}]
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Starting or Terminating a Process
│ │ │ │  
    
│ │ │ │  
    In a system structured according to the OTP design principles, any process would
│ │ │ │  be a child process belonging to a supervisor, see
│ │ │ │ @@ -274,29 +274,29 @@
│ │ │ │    Restarting an Application
│ │ │ │  
│ │ │ │  
    Restarting an application is useful when a change is too complicated to be made
│ │ │ │  without restarting the processes, for example, if the supervisor hierarchy has
│ │ │ │  been restructured.
    Example
    When adding a child m1 to ch_sup, as in
│ │ │ │  Adding and Deleting Child Processes in Changing a
│ │ │ │  Supervisor, an alternative to updating the supervisor is to restart the entire
│ │ │ │ -application:
    {"2",
│ │ │ │ - [{"1", [{restart_application, ch_app}]}],
│ │ │ │ - [{"1", [{restart_application, ch_app}]}]
│ │ │ │ -}.
    
│ │ │ │ +application:
    {"2",
│ │ │ │ + [{"1", [{restart_application, ch_app}]}],
│ │ │ │ + [{"1", [{restart_application, ch_app}]}]
│ │ │ │ +}.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Changing an Application Specification
│ │ │ │  
    
│ │ │ │  
    When installing a release, the application specifications are automatically
│ │ │ │  updated before evaluating the relup script. Thus, no instructions are needed
│ │ │ │ -in the .appup file:
    {"2",
│ │ │ │ - [{"1", []}],
│ │ │ │ - [{"1", []}]
│ │ │ │ -}.
    
│ │ │ │ +in the .appup file:
    {"2",
│ │ │ │ + [{"1", []}],
│ │ │ │ + [{"1", []}]
│ │ │ │ +}.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Changing Application Configuration
│ │ │ │  
    
│ │ │ │  
    Changing an application configuration by updating the env key in the .app
│ │ │ │  file is an instance of changing an application specification, see the previous
│ │ │ │ @@ -311,26 +311,26 @@
│ │ │ │  applications apply to primary applications only. There are no corresponding
│ │ │ │  instructions for included applications. However, since an included application
│ │ │ │  is really a supervision tree with a topmost supervisor, started as a child
│ │ │ │  process to a supervisor in the including application, a .relup file can be
│ │ │ │  manually created.
    Example
    Assume there is a release containing an application prim_app, which
│ │ │ │  have a supervisor prim_sup in its supervision tree.
    In a new version of the release, the application ch_app is to be included in
│ │ │ │  prim_app. That is, its topmost supervisor ch_sup is to be started as a child
│ │ │ │ -process to prim_sup.
    The workflow is as follows:
    Step 1) Edit the code for prim_sup:
    init(...) ->
│ │ │ │ -    {ok, {...supervisor flags...,
│ │ │ │ -          [...,
│ │ │ │ -           {ch_sup, {ch_sup,start_link,[]},
│ │ │ │ -            permanent,infinity,supervisor,[ch_sup]},
│ │ │ │ -           ...]}}.
    Step 2) Edit the .app file for prim_app:
    {application, prim_app,
│ │ │ │ - [...,
│ │ │ │ -  {vsn, "2"},
│ │ │ │ +process to prim_sup.
    The workflow is as follows:
    Step 1) Edit the code for prim_sup:
    init(...) ->
│ │ │ │ +    {ok, {...supervisor flags...,
│ │ │ │ +          [...,
│ │ │ │ +           {ch_sup, {ch_sup,start_link,[]},
│ │ │ │ +            permanent,infinity,supervisor,[ch_sup]},
│ │ │ │ +           ...]}}.
    Step 2) Edit the .app file for prim_app:
    {application, prim_app,
│ │ │ │ + [...,
│ │ │ │ +  {vsn, "2"},
│ │ │ │    ...,
│ │ │ │ -  {included_applications, [ch_app]},
│ │ │ │ +  {included_applications, [ch_app]},
│ │ │ │    ...
│ │ │ │ - ]}.
    Step 3) Create a new .rel file, including ch_app:
    {release,
│ │ │ │ + ]}.
    Step 3) Create a new .rel file, including ch_app:
    {release,
│ │ │ │   ...,
│ │ │ │   [...,
│ │ │ │    {prim_app, "2"},
│ │ │ │    {ch_app, "1"}]}.
    The included application can be started in two ways. This is described in the
│ │ │ │  next two sections.
    
│ │ │ │    
│ │ │ │      
│ │ │ │ @@ -385,74 +385,74 @@
│ │ │ │  
    Step 4b) Another way to start the included application (or stop it in the case
│ │ │ │  of downgrade) is by combining instructions for adding and removing child
│ │ │ │  processes to/from prim_sup with instructions for loading/unloading all
│ │ │ │  ch_app code and its application specification.
    Again, the .relup file is created manually, either from scratch or by editing a
│ │ │ │  generated version. Load all code for ch_app first, and also load the
│ │ │ │  application specification, before prim_sup is updated. When downgrading,
│ │ │ │  prim_sup is to updated first, before the code for ch_app and its application
│ │ │ │ -specification are unloaded.
    {"B",
│ │ │ │ - [{"A",
│ │ │ │ -   [],
│ │ │ │ -   [{load_object_code,{ch_app,"1",[ch_sup,ch3]}},
│ │ │ │ -    {load_object_code,{prim_app,"2",[prim_sup]}},
│ │ │ │ +specification are unloaded.
    {"B",
│ │ │ │ + [{"A",
│ │ │ │ +   [],
│ │ │ │ +   [{load_object_code,{ch_app,"1",[ch_sup,ch3]}},
│ │ │ │ +    {load_object_code,{prim_app,"2",[prim_sup]}},
│ │ │ │      point_of_no_return,
│ │ │ │ -    {load,{ch_sup,brutal_purge,brutal_purge}},
│ │ │ │ -    {load,{ch3,brutal_purge,brutal_purge}},
│ │ │ │ -    {apply,{application,load,[ch_app]}},
│ │ │ │ -    {suspend,[prim_sup]},
│ │ │ │ -    {load,{prim_sup,brutal_purge,brutal_purge}},
│ │ │ │ -    {code_change,up,[{prim_sup,[]}]},
│ │ │ │ -    {resume,[prim_sup]},
│ │ │ │ -    {apply,{supervisor,restart_child,[prim_sup,ch_sup]}}]}],
│ │ │ │ - [{"A",
│ │ │ │ -   [],
│ │ │ │ -   [{load_object_code,{prim_app,"1",[prim_sup]}},
│ │ │ │ +    {load,{ch_sup,brutal_purge,brutal_purge}},
│ │ │ │ +    {load,{ch3,brutal_purge,brutal_purge}},
│ │ │ │ +    {apply,{application,load,[ch_app]}},
│ │ │ │ +    {suspend,[prim_sup]},
│ │ │ │ +    {load,{prim_sup,brutal_purge,brutal_purge}},
│ │ │ │ +    {code_change,up,[{prim_sup,[]}]},
│ │ │ │ +    {resume,[prim_sup]},
│ │ │ │ +    {apply,{supervisor,restart_child,[prim_sup,ch_sup]}}]}],
│ │ │ │ + [{"A",
│ │ │ │ +   [],
│ │ │ │ +   [{load_object_code,{prim_app,"1",[prim_sup]}},
│ │ │ │      point_of_no_return,
│ │ │ │ -    {apply,{supervisor,terminate_child,[prim_sup,ch_sup]}},
│ │ │ │ -    {apply,{supervisor,delete_child,[prim_sup,ch_sup]}},
│ │ │ │ -    {suspend,[prim_sup]},
│ │ │ │ -    {load,{prim_sup,brutal_purge,brutal_purge}},
│ │ │ │ -    {code_change,down,[{prim_sup,[]}]},
│ │ │ │ -    {resume,[prim_sup]},
│ │ │ │ -    {remove,{ch_sup,brutal_purge,brutal_purge}},
│ │ │ │ -    {remove,{ch3,brutal_purge,brutal_purge}},
│ │ │ │ -    {purge,[ch_sup,ch3]},
│ │ │ │ -    {apply,{application,unload,[ch_app]}}]}]
│ │ │ │ -}.
    
│ │ │ │ +    {apply,{supervisor,terminate_child,[prim_sup,ch_sup]}},
│ │ │ │ +    {apply,{supervisor,delete_child,[prim_sup,ch_sup]}},
│ │ │ │ +    {suspend,[prim_sup]},
│ │ │ │ +    {load,{prim_sup,brutal_purge,brutal_purge}},
│ │ │ │ +    {code_change,down,[{prim_sup,[]}]},
│ │ │ │ +    {resume,[prim_sup]},
│ │ │ │ +    {remove,{ch_sup,brutal_purge,brutal_purge}},
│ │ │ │ +    {remove,{ch3,brutal_purge,brutal_purge}},
│ │ │ │ +    {purge,[ch_sup,ch3]},
│ │ │ │ +    {apply,{application,unload,[ch_app]}}]}]
│ │ │ │ +}.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Changing Non-Erlang Code
│ │ │ │  
    
│ │ │ │  
    Changing code for a program written in another programming language than Erlang,
│ │ │ │  for example, a port program, is application-dependent and OTP provides no
│ │ │ │  special support.
    Example
    When changing code for a port program, assume that the Erlang process
│ │ │ │  controlling the port is a gen_server portc and that the port is opened in
│ │ │ │ -the callback function init/1:
    init(...) ->
│ │ │ │ +the callback function init/1:
    init(...) ->
│ │ │ │      ...,
│ │ │ │ -    PortPrg = filename:join(code:priv_dir(App), "portc"),
│ │ │ │ -    Port = open_port({spawn,PortPrg}, [...]),
│ │ │ │ +    PortPrg = filename:join(code:priv_dir(App), "portc"),
│ │ │ │ +    Port = open_port({spawn,PortPrg}, [...]),
│ │ │ │      ...,
│ │ │ │ -    {ok, #state{port=Port, ...}}.
    If the port program is to be updated, the code for the gen_server can be
│ │ │ │ +    {ok, #state{port=Port, ...}}.
    If the port program is to be updated, the code for the gen_server can be
│ │ │ │  extended with a code_change/3 function, which closes the old port and opens a
│ │ │ │  new port. (If necessary, the gen_server can first request data that must be
│ │ │ │ -saved from the port program and pass this data to the new port):
    code_change(_OldVsn, State, port) ->
│ │ │ │ +saved from the port program and pass this data to the new port):
    code_change(_OldVsn, State, port) ->
│ │ │ │      State#state.port ! close,
│ │ │ │      receive
│ │ │ │ -        {Port,close} ->
│ │ │ │ +        {Port,close} ->
│ │ │ │              true
│ │ │ │      end,
│ │ │ │ -    PortPrg = filename:join(code:priv_dir(App), "portc"),
│ │ │ │ -    Port = open_port({spawn,PortPrg}, [...]),
│ │ │ │ -    {ok, #state{port=Port, ...}}.
    Update the application version number in the .app file and write an .appup
│ │ │ │ -file:
    ["2",
│ │ │ │ - [{"1", [{update, portc, {advanced,port}}]}],
│ │ │ │ - [{"1", [{update, portc, {advanced,port}}]}]
│ │ │ │ -].
    Ensure that the priv directory, where the C program is located, is included in
│ │ │ │ -the new release package:
    1> systools:make_tar("my_release", [{dirs,[priv]}]).
│ │ │ │ +    PortPrg = filename:join(code:priv_dir(App), "portc"),
│ │ │ │ +    Port = open_port({spawn,PortPrg}, [...]),
│ │ │ │ +    {ok, #state{port=Port, ...}}.
    Update the application version number in the .app file and write an .appup
│ │ │ │ +file:
    ["2",
│ │ │ │ + [{"1", [{update, portc, {advanced,port}}]}],
│ │ │ │ + [{"1", [{update, portc, {advanced,port}}]}]
│ │ │ │ +].
    Ensure that the priv directory, where the C program is located, is included in
│ │ │ │ +the new release package:
    1> systools:make_tar("my_release", [{dirs,[priv]}]).
│ │ │ │  ...
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Runtime System Restart and Upgrade
│ │ │ │  
    
│ │ │ │  
    Two upgrade instructions restart the runtime system:
    • restart_new_emulator
      Intended when ERTS, Kernel, STDLIB, or SASL is upgraded. It is automatically
│ │ │ │ @@ -460,20 +460,20 @@
│ │ │ │  executed before all other upgrade instructions. For more information about
│ │ │ │  this instruction, see restart_new_emulator (Low-Level) in
│ │ │ │  Release Handling Instructions.
    • restart_emulator
      Used when a restart of the runtime system is required after all other upgrade
│ │ │ │  instructions are executed. For more information about this instruction, see
│ │ │ │  restart_emulator (Low-Level) in
│ │ │ │  Release Handling Instructions.
    If a runtime system restart is necessary and no upgrade instructions are needed,
│ │ │ │  that is, if the restart itself is enough for the upgraded applications to start
│ │ │ │ -running the new versions, a simple .relup file can be created manually:
    {"B",
│ │ │ │ - [{"A",
│ │ │ │ -   [],
│ │ │ │ -   [restart_emulator]}],
│ │ │ │ - [{"A",
│ │ │ │ -   [],
│ │ │ │ -   [restart_emulator]}]
│ │ │ │ -}.
    In this case, the release handler framework with automatic packing and unpacking
│ │ │ │ +running the new versions, a simple .relup file can be created manually:
    {"B",
│ │ │ │ + [{"A",
│ │ │ │ +   [],
│ │ │ │ +   [restart_emulator]}],
│ │ │ │ + [{"A",
│ │ │ │ +   [],
│ │ │ │ +   [restart_emulator]}]
│ │ │ │ +}.
    In this case, the release handler framework with automatic packing and unpacking
│ │ │ │  of release packages, automatic path updates, and so on, can be used without
│ │ │ │  having to specify .appup files.
    
│ │ │ │  
│ │ │ │    
│ │ │ │  
│ │ │ ├── OEBPS/applications.xhtml
│ │ │ │ @@ -40,34 +40,34 @@
│ │ │ │  directory structure.
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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
│ │ │ │  of a takeover or failover; see
│ │ │ │  Distributed Applications.
      • StartArgs is defined by the key mod in the
│ │ │ │  application resource file.
      • stop/1 is called after the application has been stopped and is to do any
│ │ │ │  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.
      
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Application Resource File
│ │ │ │  
      
│ │ │ │ @@ -78,22 +78,22 @@
│ │ │ │  keys.
    The contents of a minimal .app file for a library application libapp looks
│ │ │ │  as follows:
    {application, libapp, []}.
    The contents of a minimal .app file ch_app.app for a supervision tree
│ │ │ │  application like ch_app looks as follows:
    {application, ch_app,
│ │ │ │   [{mod, {ch_app,[]}}]}.
    The key mod defines the callback module and start argument of the application,
│ │ │ │  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.
│ │ │ │  Defaults to [].
      • applications - All applications that must be started before this
│ │ │ │  application is started. systools uses this list to generate correct boot
│ │ │ │  scripts. Defaults to []. Notice that all applications have dependencies to
│ │ │ │  at least Kernel and STDLIB.
      Note
      For details about the syntax and contents of the application resource file,
│ │ │ │ @@ -205,38 +205,38 @@
│ │ │ │  stop applications.
      
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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
│ │ │ │  the application.
      The application master establishes itself as the group
│ │ │ │  leader of all processes in the application
│ │ │ │  and will forward I/O to the previous group leader.
      Note
      The purpose of the application master being the group leader is to easily
│ │ │ │  keep track of which processes that belong to the application. That is needed
│ │ │ │ @@ -252,55 +252,55 @@
│ │ │ │  defined by the mod key.
      
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    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"}
    
│ │ │ │    
│ │ │ │      
│ │ │ │    
│ │ │ │    Application Start Types
│ │ │ │  
    
│ │ │ │  
    A start type is defined when starting the application:
    application:start(Application, Type)
    application:start(Application) is the same as calling
│ │ │ │  application:start(Application, temporary). The type can also be permanent or
│ │ ├── ./usr/share/doc/erlang-doc/html/doc/system/applications.html
│ │ │ @@ -135,34 +135,34 @@
│ │ │  directory structure.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    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
│ │ │  of a takeover or failover; see
│ │ │  Distributed Applications.
      • StartArgs is defined by the key mod in the
│ │ │  application resource file.
      • stop/1 is called after the application has been stopped and is to do any
│ │ │  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.
      
│ │ │    
│ │ │      
│ │ │    
│ │ │    Application Resource File
│ │ │  
      
│ │ │ @@ -173,22 +173,22 @@
│ │ │  keys.
    The contents of a minimal .app file for a library application libapp looks
│ │ │  as follows:
    {application, libapp, []}.
    The contents of a minimal .app file ch_app.app for a supervision tree
│ │ │  application like ch_app looks as follows:
    {application, ch_app,
│ │ │   [{mod, {ch_app,[]}}]}.
    The key mod defines the callback module and start argument of the application,
│ │ │  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.
│ │ │  Defaults to [].
      • applications - All applications that must be started before this
│ │ │  application is started. systools uses this list to generate correct boot
│ │ │  scripts. Defaults to []. Notice that all applications have dependencies to
│ │ │  at least Kernel and STDLIB.
      Note
      For details about the syntax and contents of the application resource file,
│ │ │ @@ -300,38 +300,38 @@
│ │ │  stop applications.
      
│ │ │    
│ │ │      
│ │ │    
│ │ │    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
│ │ │  the application.
      The application master establishes itself as the group
│ │ │  leader of all processes in the application
│ │ │  and will forward I/O to the previous group leader.
      Note
      The purpose of the application master being the group leader is to easily
│ │ │  keep track of which processes that belong to the application. That is needed
│ │ │ @@ -347,55 +347,55 @@
│ │ │  defined by the mod key.
      
│ │ │    
│ │ │      
│ │ │    
│ │ │    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"}
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Application Start Types
│ │ │  
    
│ │ │  
    A start type is defined when starting the application:
    application:start(Application, Type)
    application:start(Application) is the same as calling
│ │ │  application:start(Application, temporary). The type can also be permanent or
│ │ ├── ./usr/share/doc/erlang-doc/html/doc/system/appup_cookbook.html
│ │ │ @@ -120,18 +120,18 @@
│ │ │    
│ │ │      
│ │ │    
│ │ │    Changing a Functional Module
│ │ │  
│ │ │  
    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}]}]
│ │ │ +}.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Changing a Residence Module
│ │ │  
    
│ │ │  
    In a system implemented according to the OTP design principles, all processes,
│ │ │  except system processes and special processes, reside in one of the behaviours
│ │ │ @@ -142,46 +142,46 @@
│ │ │    
│ │ │      
│ │ │    
│ │ │    Changing a Callback Module
│ │ │  
│ │ │  
    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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Changing Internal State
│ │ │  
    
│ │ │  
    In this case, simple code replacement is not sufficient. The process must
│ │ │  explicitly transform its state using the callback function code_change/3 before
│ │ │  switching to the new version of the callback module. Thus, synchronized code
│ │ │  replacement is used.
    Example
    Consider the ch3 module from
│ │ │  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)
│ │ │  of the beam file, an uninteresting value, which is ignored.
    The other callback functions of ch3 must also be modified and perhaps a new
│ │ │  interface function must be added, but this is not shown here.
    
│ │ │    
│ │ │      
│ │ │ @@ -190,67 +190,67 @@
│ │ │  
    
│ │ │  
    Assume that a module is extended by adding an interface function, as in the
│ │ │  example in Release Handling, where a function
│ │ │  available/0 is added to ch3.
    If a call is added to this function, say in module m1, a runtime error could
│ │ │  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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Changing Code for a Special Process
│ │ │  
    
│ │ │  
    In this case, simple code replacement is not sufficient. When a new version of a
│ │ │  residence module for a special process is loaded, the process must make a fully
│ │ │  qualified call to its loop function to switch to the new code. Thus,
│ │ │  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}.
    In this case, all arguments but the first are ignored and the function simply
│ │ │  returns the internal state again. This is enough if the code only has been
│ │ │  extended. If instead the internal state is changed (similar to the example in
│ │ │ @@ -271,85 +271,85 @@
│ │ │    Changing Properties
│ │ │  
│ │ │  
    Since the supervisor is to change its internal state, synchronized code
│ │ │  replacement is required. However, a special update instruction must be used.
    First, the new version of the callback module must be loaded, both in the case
│ │ │  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
│ │ │  affected when doing a synchronized code replacement.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Adding and Deleting Child Processes
│ │ │  
    
│ │ │  
    As stated earlier, changing child specifications does not affect existing child
│ │ │  processes. New child specifications are automatically added, but not deleted.
│ │ │  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]}}
│ │ │ +   ]}],
│ │ │ + [{"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
│ │ │  supervisor is not registered, it cannot be accessed directly from the script.
│ │ │  Instead a help function that finds the pid of the supervisor and calls
│ │ │  supervisor:restart_child, and so on, must be written. This function is then to
│ │ │  be called from the script using the apply instruction.
    If the module m1 is introduced in version "2" of ch_app, it must also be
│ │ │ -loaded when upgrading and deleted when downgrading:
    {"2",
│ │ │ - [{"1",
│ │ │ -   [{add_module, m1},
│ │ │ -    {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},
│ │ │ -    {delete_module, m1}
│ │ │ -   ]}]
│ │ │ -}.
    As stated earlier, the order of the instructions is important. When upgrading,
│ │ │ +loaded when upgrading and deleted when downgrading:
    {"2",
│ │ │ + [{"1",
│ │ │ +   [{add_module, m1},
│ │ │ +    {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},
│ │ │ +    {delete_module, m1}
│ │ │ +   ]}]
│ │ │ +}.
    As stated earlier, the order of the instructions is important. When upgrading,
│ │ │  m1 must be loaded, and the supervisor child specification changed, before the
│ │ │  new child process can be started. When downgrading, the child process must be
│ │ │  terminated before the child specification is changed and the module is deleted.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Adding or Deleting a Module
│ │ │  
    
│ │ │ -
    _Example
    _ A new functional module m is added to ch_app:
    {"2",
│ │ │ - [{"1", [{add_module, m}]}],
│ │ │ - [{"1", [{delete_module, m}]}]
    
│ │ │ +
    _Example
    _ A new functional module m is added to ch_app:
    {"2",
│ │ │ + [{"1", [{add_module, m}]}],
│ │ │ + [{"1", [{delete_module, m}]}]
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Starting or Terminating a Process
│ │ │  
    
│ │ │  
    In a system structured according to the OTP design principles, any process would
│ │ │  be a child process belonging to a supervisor, see
│ │ │ @@ -369,29 +369,29 @@
│ │ │    Restarting an Application
│ │ │  
│ │ │  
    Restarting an application is useful when a change is too complicated to be made
│ │ │  without restarting the processes, for example, if the supervisor hierarchy has
│ │ │  been restructured.
    Example
    When adding a child m1 to ch_sup, as in
│ │ │  Adding and Deleting Child Processes in Changing a
│ │ │  Supervisor, an alternative to updating the supervisor is to restart the entire
│ │ │ -application:
    {"2",
│ │ │ - [{"1", [{restart_application, ch_app}]}],
│ │ │ - [{"1", [{restart_application, ch_app}]}]
│ │ │ -}.
    
│ │ │ +application:
    {"2",
│ │ │ + [{"1", [{restart_application, ch_app}]}],
│ │ │ + [{"1", [{restart_application, ch_app}]}]
│ │ │ +}.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Changing an Application Specification
│ │ │  
    
│ │ │  
    When installing a release, the application specifications are automatically
│ │ │  updated before evaluating the relup script. Thus, no instructions are needed
│ │ │ -in the .appup file:
    {"2",
│ │ │ - [{"1", []}],
│ │ │ - [{"1", []}]
│ │ │ -}.
    
│ │ │ +in the .appup file:
    {"2",
│ │ │ + [{"1", []}],
│ │ │ + [{"1", []}]
│ │ │ +}.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Changing Application Configuration
│ │ │  
    
│ │ │  
    Changing an application configuration by updating the env key in the .app
│ │ │  file is an instance of changing an application specification, see the previous
│ │ │ @@ -406,26 +406,26 @@
│ │ │  applications apply to primary applications only. There are no corresponding
│ │ │  instructions for included applications. However, since an included application
│ │ │  is really a supervision tree with a topmost supervisor, started as a child
│ │ │  process to a supervisor in the including application, a .relup file can be
│ │ │  manually created.
    Example
    Assume there is a release containing an application prim_app, which
│ │ │  have a supervisor prim_sup in its supervision tree.
    In a new version of the release, the application ch_app is to be included in
│ │ │  prim_app. That is, its topmost supervisor ch_sup is to be started as a child
│ │ │ -process to prim_sup.
    The workflow is as follows:
    Step 1) Edit the code for prim_sup:
    init(...) ->
│ │ │ -    {ok, {...supervisor flags...,
│ │ │ -          [...,
│ │ │ -           {ch_sup, {ch_sup,start_link,[]},
│ │ │ -            permanent,infinity,supervisor,[ch_sup]},
│ │ │ -           ...]}}.
    Step 2) Edit the .app file for prim_app:
    {application, prim_app,
│ │ │ - [...,
│ │ │ -  {vsn, "2"},
│ │ │ +process to prim_sup.
    The workflow is as follows:
    Step 1) Edit the code for prim_sup:
    init(...) ->
│ │ │ +    {ok, {...supervisor flags...,
│ │ │ +          [...,
│ │ │ +           {ch_sup, {ch_sup,start_link,[]},
│ │ │ +            permanent,infinity,supervisor,[ch_sup]},
│ │ │ +           ...]}}.
    Step 2) Edit the .app file for prim_app:
    {application, prim_app,
│ │ │ + [...,
│ │ │ +  {vsn, "2"},
│ │ │    ...,
│ │ │ -  {included_applications, [ch_app]},
│ │ │ +  {included_applications, [ch_app]},
│ │ │    ...
│ │ │ - ]}.
    Step 3) Create a new .rel file, including ch_app:
    {release,
│ │ │ + ]}.
    Step 3) Create a new .rel file, including ch_app:
    {release,
│ │ │   ...,
│ │ │   [...,
│ │ │    {prim_app, "2"},
│ │ │    {ch_app, "1"}]}.
    The included application can be started in two ways. This is described in the
│ │ │  next two sections.
    
│ │ │    
│ │ │      
│ │ │ @@ -480,74 +480,74 @@
│ │ │  
    Step 4b) Another way to start the included application (or stop it in the case
│ │ │  of downgrade) is by combining instructions for adding and removing child
│ │ │  processes to/from prim_sup with instructions for loading/unloading all
│ │ │  ch_app code and its application specification.
    Again, the .relup file is created manually, either from scratch or by editing a
│ │ │  generated version. Load all code for ch_app first, and also load the
│ │ │  application specification, before prim_sup is updated. When downgrading,
│ │ │  prim_sup is to updated first, before the code for ch_app and its application
│ │ │ -specification are unloaded.
    {"B",
│ │ │ - [{"A",
│ │ │ -   [],
│ │ │ -   [{load_object_code,{ch_app,"1",[ch_sup,ch3]}},
│ │ │ -    {load_object_code,{prim_app,"2",[prim_sup]}},
│ │ │ +specification are unloaded.
    {"B",
│ │ │ + [{"A",
│ │ │ +   [],
│ │ │ +   [{load_object_code,{ch_app,"1",[ch_sup,ch3]}},
│ │ │ +    {load_object_code,{prim_app,"2",[prim_sup]}},
│ │ │      point_of_no_return,
│ │ │ -    {load,{ch_sup,brutal_purge,brutal_purge}},
│ │ │ -    {load,{ch3,brutal_purge,brutal_purge}},
│ │ │ -    {apply,{application,load,[ch_app]}},
│ │ │ -    {suspend,[prim_sup]},
│ │ │ -    {load,{prim_sup,brutal_purge,brutal_purge}},
│ │ │ -    {code_change,up,[{prim_sup,[]}]},
│ │ │ -    {resume,[prim_sup]},
│ │ │ -    {apply,{supervisor,restart_child,[prim_sup,ch_sup]}}]}],
│ │ │ - [{"A",
│ │ │ -   [],
│ │ │ -   [{load_object_code,{prim_app,"1",[prim_sup]}},
│ │ │ +    {load,{ch_sup,brutal_purge,brutal_purge}},
│ │ │ +    {load,{ch3,brutal_purge,brutal_purge}},
│ │ │ +    {apply,{application,load,[ch_app]}},
│ │ │ +    {suspend,[prim_sup]},
│ │ │ +    {load,{prim_sup,brutal_purge,brutal_purge}},
│ │ │ +    {code_change,up,[{prim_sup,[]}]},
│ │ │ +    {resume,[prim_sup]},
│ │ │ +    {apply,{supervisor,restart_child,[prim_sup,ch_sup]}}]}],
│ │ │ + [{"A",
│ │ │ +   [],
│ │ │ +   [{load_object_code,{prim_app,"1",[prim_sup]}},
│ │ │      point_of_no_return,
│ │ │ -    {apply,{supervisor,terminate_child,[prim_sup,ch_sup]}},
│ │ │ -    {apply,{supervisor,delete_child,[prim_sup,ch_sup]}},
│ │ │ -    {suspend,[prim_sup]},
│ │ │ -    {load,{prim_sup,brutal_purge,brutal_purge}},
│ │ │ -    {code_change,down,[{prim_sup,[]}]},
│ │ │ -    {resume,[prim_sup]},
│ │ │ -    {remove,{ch_sup,brutal_purge,brutal_purge}},
│ │ │ -    {remove,{ch3,brutal_purge,brutal_purge}},
│ │ │ -    {purge,[ch_sup,ch3]},
│ │ │ -    {apply,{application,unload,[ch_app]}}]}]
│ │ │ -}.
    
│ │ │ +    {apply,{supervisor,terminate_child,[prim_sup,ch_sup]}},
│ │ │ +    {apply,{supervisor,delete_child,[prim_sup,ch_sup]}},
│ │ │ +    {suspend,[prim_sup]},
│ │ │ +    {load,{prim_sup,brutal_purge,brutal_purge}},
│ │ │ +    {code_change,down,[{prim_sup,[]}]},
│ │ │ +    {resume,[prim_sup]},
│ │ │ +    {remove,{ch_sup,brutal_purge,brutal_purge}},
│ │ │ +    {remove,{ch3,brutal_purge,brutal_purge}},
│ │ │ +    {purge,[ch_sup,ch3]},
│ │ │ +    {apply,{application,unload,[ch_app]}}]}]
│ │ │ +}.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Changing Non-Erlang Code
│ │ │  
    
│ │ │  
    Changing code for a program written in another programming language than Erlang,
│ │ │  for example, a port program, is application-dependent and OTP provides no
│ │ │  special support.
    Example
    When changing code for a port program, assume that the Erlang process
│ │ │  controlling the port is a gen_server portc and that the port is opened in
│ │ │ -the callback function init/1:
    init(...) ->
│ │ │ +the callback function init/1:
    init(...) ->
│ │ │      ...,
│ │ │ -    PortPrg = filename:join(code:priv_dir(App), "portc"),
│ │ │ -    Port = open_port({spawn,PortPrg}, [...]),
│ │ │ +    PortPrg = filename:join(code:priv_dir(App), "portc"),
│ │ │ +    Port = open_port({spawn,PortPrg}, [...]),
│ │ │      ...,
│ │ │ -    {ok, #state{port=Port, ...}}.
    If the port program is to be updated, the code for the gen_server can be
│ │ │ +    {ok, #state{port=Port, ...}}.
    If the port program is to be updated, the code for the gen_server can be
│ │ │  extended with a code_change/3 function, which closes the old port and opens a
│ │ │  new port. (If necessary, the gen_server can first request data that must be
│ │ │ -saved from the port program and pass this data to the new port):
    code_change(_OldVsn, State, port) ->
│ │ │ +saved from the port program and pass this data to the new port):
    code_change(_OldVsn, State, port) ->
│ │ │      State#state.port ! close,
│ │ │      receive
│ │ │ -        {Port,close} ->
│ │ │ +        {Port,close} ->
│ │ │              true
│ │ │      end,
│ │ │ -    PortPrg = filename:join(code:priv_dir(App), "portc"),
│ │ │ -    Port = open_port({spawn,PortPrg}, [...]),
│ │ │ -    {ok, #state{port=Port, ...}}.
    Update the application version number in the .app file and write an .appup
│ │ │ -file:
    ["2",
│ │ │ - [{"1", [{update, portc, {advanced,port}}]}],
│ │ │ - [{"1", [{update, portc, {advanced,port}}]}]
│ │ │ -].
    Ensure that the priv directory, where the C program is located, is included in
│ │ │ -the new release package:
    1> systools:make_tar("my_release", [{dirs,[priv]}]).
│ │ │ +    PortPrg = filename:join(code:priv_dir(App), "portc"),
│ │ │ +    Port = open_port({spawn,PortPrg}, [...]),
│ │ │ +    {ok, #state{port=Port, ...}}.
    Update the application version number in the .app file and write an .appup
│ │ │ +file:
    ["2",
│ │ │ + [{"1", [{update, portc, {advanced,port}}]}],
│ │ │ + [{"1", [{update, portc, {advanced,port}}]}]
│ │ │ +].
    Ensure that the priv directory, where the C program is located, is included in
│ │ │ +the new release package:
    1> systools:make_tar("my_release", [{dirs,[priv]}]).
│ │ │  ...
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Runtime System Restart and Upgrade
│ │ │  
    
│ │ │  
    Two upgrade instructions restart the runtime system:
    • restart_new_emulator
      Intended when ERTS, Kernel, STDLIB, or SASL is upgraded. It is automatically
│ │ │ @@ -555,22 +555,22 @@
│ │ │  executed before all other upgrade instructions. For more information about
│ │ │  this instruction, see restart_new_emulator (Low-Level) in
│ │ │  Release Handling Instructions.
    • restart_emulator
      Used when a restart of the runtime system is required after all other upgrade
│ │ │  instructions are executed. For more information about this instruction, see
│ │ │  restart_emulator (Low-Level) in
│ │ │  Release Handling Instructions.
    If a runtime system restart is necessary and no upgrade instructions are needed,
│ │ │  that is, if the restart itself is enough for the upgraded applications to start
│ │ │ -running the new versions, a simple .relup file can be created manually:
    {"B",
│ │ │ - [{"A",
│ │ │ -   [],
│ │ │ -   [restart_emulator]}],
│ │ │ - [{"A",
│ │ │ -   [],
│ │ │ -   [restart_emulator]}]
│ │ │ -}.
    In this case, the release handler framework with automatic packing and unpacking
│ │ │ +running the new versions, a simple .relup file can be created manually:
    {"B",
│ │ │ + [{"A",
│ │ │ +   [],
│ │ │ +   [restart_emulator]}],
│ │ │ + [{"A",
│ │ │ +   [],
│ │ │ +   [restart_emulator]}]
│ │ │ +}.
    In this case, the release handler framework with automatic packing and unpacking
│ │ │  of release packages, automatic path updates, and so on, can be used without
│ │ │  having to specify .appup files.
    
│ │ │  
│ │ │  
│ │ │  
    
│ │ │    
    
│ │ ├── ./usr/share/doc/erlang-doc/html/doc/system/benchmarking.html
│ │ │ @@ -144,16 +144,16 @@
│ │ │  fast as possible, what can we do? One way could be to generate more
│ │ │  than two bytes at the time.
    % erlperf 'rand:bytes(100).' 'crypto:strong_rand_bytes(100).'
│ │ │  Code                                   ||        QPS       Time   Rel
│ │ │  rand:bytes(100).                        1    2124 Ki     470 ns  100%
│ │ │  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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Benchmarking using Erlang/OTP functionality
│ │ │  
    
│ │ │  
    Benchmarks can measure wall-clock time or CPU time.
    • timer:tc/3 measures wall-clock time. The advantage with wall-clock time is
│ │ ├── ./usr/share/doc/erlang-doc/html/doc/system/binaryhandling.html
│ │ │ @@ -114,43 +114,43 @@
│ │ │  
│ │ │      Constructing and Matching Binaries
│ │ │    
│ │ │  
│ │ │  
      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),
│ │ │ -    <<RevTail/binary,H>>;
│ │ │ -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(<<>>) -> [].
      
│ │ │ +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([]) ->
│ │ │ +    <<>>.
      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(<<>>) -> [].
      
│ │ │    
│ │ │      
│ │ │    
│ │ │    How Binaries are Implemented
│ │ │  
      
│ │ │  
      Internally, binaries and bitstrings are implemented in the same way. In this
│ │ │  section, they are called binaries because that is what they are called in the
│ │ │ @@ -205,29 +205,29 @@
│ │ │  called referential transparency) of Erlang would break.
      
│ │ │    
│ │ │      
│ │ │    
│ │ │    Constructing Binaries
│ │ │  
      
│ │ │  
      Appending to a binary or bitstring in the following way is specially optimized
│ │ │ -to avoid copying the binary:
      <<Binary/binary, ...>>
│ │ │ +to avoid copying the binary:
      <<Binary/binary, ...>>
│ │ │  %% - OR -
│ │ │ -<<Binary/bitstring, ...>>
      This optimization is applied by the runtime system in a way that makes it
│ │ │ +<<Binary/bitstring, ...>>
      This optimization is applied by the runtime system in a way that makes it
│ │ │  effective in most circumstances (for exceptions, see
│ │ │  Circumstances That Force Copying). The
│ │ │  optimization in its basic form does not need any help from the compiler.
│ │ │  However, the compiler add hints to the runtime system when it is safe to apply
│ │ │  the optimization in a more efficient way.
      Change
      The compiler support for making the optimization more efficient was added in
│ │ │  Erlang/OTP 26.
      To explain how the basic optimization works, let us examine the following code
│ │ │ -line by line:
      Bin0 = <<0>>,                    %% 1
│ │ │ -Bin1 = <<Bin0/binary,1,2,3>>,    %% 2
│ │ │ -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
│ │ │ +line by line:
        Bin0 = <<0>>,                    %% 1
│ │ │ +Bin1 = <<Bin0/binary,1,2,3>>,    %% 2
│ │ │ +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
│ │ │  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
│ │ │  binary has its size set to the size of the data stored in the binary, while
│ │ │  the binary object has extra space allocated. The size of the binary object is
│ │ │  either twice the size of Bin1 or 256, whichever is larger. In this case it
│ │ │  is 256.
        • Line 3 is more interesting. Bin1 has been used in an append operation, and
│ │ │ @@ -253,23 +253,23 @@
│ │ │  handle an append operation to a heap binary by copying it to a refc binary (line
│ │ │  2), and also handle an append operation to a previous version of the binary by
│ │ │  copying it (line 5). The support for doing that does not come for free. For
│ │ │  example, to make it possible to know when it is necessary to copy the binary,
│ │ │  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
│ │ │  already reserved; thus, the append operation in repack/2 never needs to handle
│ │ │  a binary not prepared for appending.
          
│ │ │    
│ │ │      
│ │ │ @@ -281,72 +281,72 @@
│ │ │  reason is that the binary object can be moved (reallocated) during an append
│ │ │  operation, and when that happens, the pointer in the ProcBin must be updated. If
│ │ │  there would be more than one ProcBin pointing to the binary object, it would not
│ │ │  be possible to find and update all of them.
          Therefore, certain operations on a binary mark it so that any future append
│ │ │  operation will be forced to copy the binary. In most cases, the binary object
│ │ │  will be shrunk at the same time to reclaim the extra space allocated for
│ │ │  growing.
          When appending to a binary as follows, only the binary returned from the latest
│ │ │ -append operation will support further cheap append operations:
          Bin = <<Bin0,...>>
          In the code fragment in the beginning of this section, appending to Bin will
│ │ │ +append operation will support further cheap append operations:
          Bin = <<Bin0,...>>
          In the code fragment in the beginning of this section, appending to Bin will
│ │ │  be cheap, while appending to Bin0 will force the creation of a new binary and
│ │ │  copying of the contents of Bin0.
          If a binary is sent as a message to a process or port, the binary will be shrunk
│ │ │  and any further append operation will copy the binary data into a new binary.
│ │ │  For example, in the following code fragment Bin1 will be copied in the third
│ │ │ -line:
          Bin1 = <<Bin0,...>>,
│ │ │ +line:
          Bin1 = <<Bin0,...>>,
│ │ │  PortOrPid ! Bin1,
│ │ │ -Bin = <<Bin1,...>>  %% Bin1 will be COPIED
          The same happens if you insert a binary into an Ets table, send it to a port
│ │ │ +Bin = <<Bin1,...>>  %% Bin1 will be COPIED
          The same happens if you insert a binary into an Ets table, send it to a port
│ │ │  using erlang:port_command/2, or pass it to
│ │ │  enif_inspect_binary in a NIF.
          Matching a binary will also cause it to shrink and the next append operation
│ │ │ -will copy the binary data:
          Bin1 = <<Bin0,...>>,
│ │ │ -<<X,Y,Z,T/binary>> = Bin1,
│ │ │ -Bin = <<Bin1,...>>  %% Bin1 will be COPIED
          The reason is that a match context contains a
│ │ │ +will copy the binary data:
          Bin1 = <<Bin0,...>>,
│ │ │ +<<X,Y,Z,T/binary>> = Bin1,
│ │ │ +Bin = <<Bin1,...>>  %% Bin1 will be COPIED
          The reason is that a match context contains a
│ │ │  direct pointer to the binary data.
          If a process simply keeps binaries (either in "loop data" or in the process
│ │ │  dictionary), the garbage collector can eventually shrink the binaries. If only
│ │ │  one such binary is kept, it will not be shrunk. If the process later appends to
│ │ │  a binary that has been shrunk, the binary object will be reallocated to make
│ │ │  place for the data to be appended.
          
│ │ │    
│ │ │      
│ │ │    
│ │ │    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
│ │ │  sub binary, but in this particular example the
│ │ │  compiler sees that there will soon be a call to a function (in this case, to
│ │ │  my_binary_to_list/1 itself) that immediately will create a new match context
│ │ │  and discard the sub binary.
          Therefore my_binary_to_list/1 calls itself with the match context instead of
│ │ │  with a sub binary. The instruction that initializes the matching operation
│ │ │  basically does nothing when it sees that it was passed a match context instead
│ │ │  of a binary.
          When the end of the binary is reached and the second clause matches, the match
│ │ │  context will simply be discarded (removed in the next garbage collection, as
│ │ │  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(<<>>) ->
│ │ │ -    <<>>.
          Yes, it will. The compiler will remove the building of the sub binary in the
│ │ │ +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?
          
│ │ │    
│ │ │      
│ │ │    
│ │ │    Option bin_opt_info
│ │ │ @@ -354,38 +354,38 @@
│ │ │  
          Use the bin_opt_info option to have the compiler print a lot of information
│ │ │  about binary optimizations. It can be given either to the compiler or erlc:
          erlc +bin_opt_info Mod.erl
          or passed through an environment variable:
          export ERL_COMPILER_OPTIONS=bin_opt_info
          Notice that the bin_opt_info is not meant to be a permanent option added to
│ │ │  your Makefiles, because all messages that it generates cannot be eliminated.
│ │ │  Therefore, passing the option through the environment is in most cases the most
│ │ │  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(<<>>) ->
│ │ │ -    <<>>.
          The warning for the first clause says that the creation of a sub binary cannot
│ │ │ +    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).
          
│ │ │    
│ │ │      
│ │ │    
│ │ │    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.
          
│ │ │  
│ │ │  
│ │ │  
          
│ │ │    
          
│ │ │  
│ │ │        
│ │ │      
│ │ │    
│ │ │    Introduction
│ │ │  
│ │ │  
          The complete specification for the bit syntax appears in the
│ │ │  Reference Manual.
          In Erlang, a Bin is used for constructing binaries and matching binary patterns.
│ │ │ -A Bin is written with the following syntax:
          <<E1, E2, ... En>>
          A Bin is a low-level sequence of bits or bytes. The purpose of a Bin is to
│ │ │ -enable construction of binaries:
          Bin = <<E1, E2, ... En>>
          All elements must be bound. Or match a binary:
          <<E1, E2, ... En>> = Bin
          Here, Bin is bound and the elements are bound or unbound, as in any match.
          A Bin does not need to consist of a whole number of bytes.
          A bitstring is a sequence of zero or more bits, where the number of bits does
│ │ │ +A Bin is written with the following syntax:
          <<E1, E2, ... En>>
          A Bin is a low-level sequence of bits or bytes. The purpose of a Bin is to
│ │ │ +enable construction of binaries:
          Bin = <<E1, E2, ... En>>
          All elements must be bound. Or match a binary:
          <<E1, E2, ... En>> = Bin
          Here, Bin is bound and the elements are bound or unbound, as in any match.
          A Bin does not need to consist of a whole number of bytes.
          A bitstring is a sequence of zero or more bits, where the number of bits does
│ │ │  not need to be divisible by 8. If the number of bits is divisible by 8, the
│ │ │  bitstring is also a binary.
          Each element specifies a certain segment of the bitstring. A segment is a set
│ │ │  of contiguous bits of the binary (not necessarily on a byte boundary). The first
│ │ │  element specifies the initial segment, the second element specifies the
│ │ │  following segment, and so on.
          The following examples illustrate how binaries are constructed, or matched, and
│ │ │  how elements and tails are specified.
          
│ │ │    
│ │ │      
│ │ │    
│ │ │    Examples
│ │ │  
          
│ │ │  
          Example 1: A binary can be constructed from a set of constants or a string
│ │ │ -literal:
          Bin11 = <<1, 17, 42>>,
│ │ │ -Bin12 = <<"abc">>
          This gives two binaries of size 3, with the following evaluations:
          Example 2:Similarly, a binary can be constructed from a set of bound
│ │ │ +literal:
          Bin11 = <<1, 17, 42>>,
│ │ │ +Bin12 = <<"abc">>
          This gives two binaries of size 3, with the following evaluations:
          Example 2:Similarly, a binary can be constructed from a set of bound
│ │ │  variables:
          A = 1, B = 17, C = 42,
│ │ │ -Bin2 = <<A, B, C:16>>
          This gives a binary of size 4. Here, a size expression is used for the
│ │ │ +Bin2 = <<A, B, C:16>>
          This gives a binary of size 4. Here, a size expression is used for the
│ │ │  variable C to specify a 16-bits segment of Bin2.
          binary_to_list(Bin2) evaluates to [1, 17, 00, 42].
          Example 3: A Bin can also be used for matching. D, E, and F are unbound
│ │ │ -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:
│ │ │ +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,
│ │ │ +    <<?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),
│ │ │ -        <<Opts:OptsLen/binary,Data/binary>> = RestDgram,
│ │ │ +      DestIP:32, RestDgram/binary>> when HLen>=5, 4*HLen=<DgramSize ->
│ │ │ +        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,
│ │ │  specifying that Opts is to bind to a binary. All other variables have the
│ │ │  default type equal to unsigned integer.
          An IP datagram header is of variable length. This length is measured in the
│ │ │  number of 32-bit words and is given in the segment corresponding to HLen. The
│ │ │  minimum value of HLen is 5. It is the segment corresponding to Opts that is
│ │ │  variable, so if HLen is equal to 5, Opts becomes an empty binary.
          The tail variables RestDgram and Data bind to binaries, as all tail
│ │ │ @@ -218,80 +218,80 @@
│ │ │  
          This section describes the rules for constructing binaries using the bit syntax.
│ │ │  Unlike when constructing lists or tuples, the construction of a binary can fail
│ │ │  with a badarg exception.
          There can be zero or more segments in a binary to be constructed. The expression
│ │ │  <<>> constructs a zero length binary.
          Each segment in a binary can consist of zero or more bits. There are no
│ │ │  alignment rules for individual segments of type integer and float. For
│ │ │  binaries and bitstrings without size, the unit specifies the alignment. Since
│ │ │  the default alignment for the binary type is 8, the size of a binary segment
│ │ │ -must be a multiple of 8 bits, that is, only whole bytes.
          Example:
          <<Bin/binary,Bitstring/bitstring>>
          The variable Bin must contain a whole number of bytes, because the binary
│ │ │ +must be a multiple of 8 bits, that is, only whole bytes.
          Example:
          <<Bin/binary,Bitstring/bitstring>>
          The variable Bin must contain a whole number of bytes, because the binary
│ │ │  type defaults to unit:8. A badarg exception is generated if Bin consist
│ │ │  of, for example, 17 bits.
          The Bitstring variable can consist of any number of bits, for example, 0, 1,
│ │ │  8, 11, 17, 42, and so on. This is because the default unit for bitstrings
│ │ │  is 1.
          For clarity, it is recommended not to change the unit size for binaries.
│ │ │  Instead, use binary when you need byte alignment and bitstring when you need
│ │ │  bit alignment.
          The following example successfully constructs a bitstring of 7 bits, provided
│ │ │ -that all of X and Y are integers:
          <<X:1,Y:6>>
          As mentioned earlier, segments have the following general syntax:
          Value:Size/TypeSpecifierList
          When constructing binaries, Value and Size can be any Erlang expression.
│ │ │ +that all of X and Y are integers:
          <<X:1,Y:6>>
          As mentioned earlier, segments have the following general syntax:
          Value:Size/TypeSpecifierList
          When constructing binaries, Value and Size can be any Erlang expression.
│ │ │  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>>
          
│ │ │ +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>>
          
│ │ │    
│ │ │      
│ │ │    
│ │ │    Including Literal Strings
│ │ │  
          
│ │ │ -
          A literal string can be written instead of an element:
          <<"hello">>
          This is syntactic sugar for the following:
          <<$h,$e,$l,$l,$o>>
          
│ │ │ +
          A literal string can be written instead of an element:
          <<"hello">>
          This is syntactic sugar for the following:
          <<$h,$e,$l,$l,$o>>
          
│ │ │    
│ │ │      
│ │ │    
│ │ │    Matching Binaries
│ │ │  
          
│ │ │  
          This section describes the rules for matching binaries, using the bit syntax.
          There can be zero or more segments in a binary pattern. A binary pattern can
│ │ │  occur wherever patterns are allowed, including inside other patterns. Binary
│ │ │  patterns cannot be nested. The pattern <<>> matches a zero length binary.
          Each segment in a binary can consist of zero or more bits. A segment of type
│ │ │  binary must have a size evenly divisible by 8 (or divisible by the unit size,
│ │ │  if the unit size has been changed). A segment of type bitstring has no
│ │ │  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) ->
│ │ │ -   <<X:N,T/binary>> = Bin,
│ │ │ -   {X,T}.
          Note
          Before OTP 23, Size was restricted to be an integer or a variable bound to
│ │ │ +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
│ │ │  an integer.
          
│ │ │    
│ │ │      
│ │ │    
│ │ │    Binding and Using a Size Variable
│ │ │  
          
│ │ │  
          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.
          
│ │ │  
│ │ │  
│ │ │  
          
│ │ │    
          
│ │ │  
│ │ │        
          open_port/2 with
│ │ │  {spawn,ExtPrg} as the first argument. The string ExtPrg is the name of the
│ │ │  external program, including any command line arguments. The second argument is a
│ │ │  list of options, in this case only {packet,2}. This option says that a 2 byte
│ │ │  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.
          
│ │ │    
│ │ │      
│ │ │    
│ │ │    C Program
│ │ │  
          
│ │ │  
          On the C side, it is necessary to write functions for receiving and sending data
│ │ │  with 2 byte length indicators from/to Erlang. By default, the C program is to
│ │ │ @@ -333,25 +333,25 @@
│ │ │  and terminates.
          
│ │ │    
│ │ │      
│ │ │    
│ │ │    Running the Example
│ │ │  
          
│ │ │  
          Step 1. Compile the C code:
          $ gcc -o extprg complex.c erl_comm.c port.c
          Step 2. Start Erlang and compile the Erlang code:
          $ erl
│ │ │ -Erlang/OTP 26 [erts-14.2] [source] [64-bit] [smp:8:8] [ds:8:8:10] [async-threads:1] [jit:ns]
│ │ │ +Erlang/OTP 26 [erts-14.2] [source] [64-bit] [smp:8:8] [ds:8:8:10] [async-threads:1] [jit:ns]
│ │ │  
│ │ │ -Eshell V14.2 (press Ctrl+G to abort, type help(). for help)
│ │ │ -1> c(complex1).
│ │ │ -{ok,complex1}
          Step 3. Run the example:
          2> complex1:start("./extprg").
│ │ │ +Eshell V14.2 (press Ctrl+G to abort, type help(). for help)
│ │ │ +1> c(complex1).
│ │ │ +{ok,complex1}
          Step 3. Run the example:
          2> complex1:start("./extprg").
│ │ │  <0.34.0>
│ │ │ -3> complex1:foo(3).
│ │ │ +3> complex1:foo(3).
│ │ │  4
│ │ │ -4> complex1:bar(5).
│ │ │ +4> complex1:bar(5).
│ │ │  10
│ │ │ -5> complex1:stop().
│ │ │ +5> complex1:stop().
│ │ │  stop
          
│ │ │  
          
│ │ │  
│ │ │  
          
│ │ │    
          
│ │ │  
│ │ │        
          erl_ddll:load_driver/2, with the name of the shared library as
│ │ │  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.
          
│ │ │    
│ │ │      
│ │ │    
│ │ │    C Driver
│ │ │  
          
│ │ │  
          The C driver is a module that is compiled and linked into a shared library. It
│ │ │  uses a driver structure and includes the header file erl_driver.h.
          The driver structure is filled with the driver name and function pointers. It is
│ │ │ @@ -347,25 +347,25 @@
│ │ │    
│ │ │      
│ │ │    
│ │ │    Running the Example
│ │ │  
│ │ │  
          Step 1. Compile the C code:
          unix> gcc -o example_drv.so -fpic -shared complex.c port_driver.c
│ │ │  windows> cl -LD -MD -Fe example_drv.dll complex.c port_driver.c
          Step 2. Start Erlang and compile the Erlang code:
          > erl
│ │ │ -Erlang/OTP 26 [erts-14.2] [source] [64-bit] [smp:8:8] [ds:8:8:10] [async-threads:1] [jit:ns]
│ │ │ +Erlang/OTP 26 [erts-14.2] [source] [64-bit] [smp:8:8] [ds:8:8:10] [async-threads:1] [jit:ns]
│ │ │  
│ │ │ -Eshell V14.2 (press Ctrl+G to abort, type help(). for help)
│ │ │ -1> c(complex5).
│ │ │ -{ok,complex5}
          Step 3. Run the example:
          2> complex5:start("example_drv").
│ │ │ +Eshell V14.2 (press Ctrl+G to abort, type help(). for help)
│ │ │ +1> c(complex5).
│ │ │ +{ok,complex5}
          Step 3. Run the example:
          2> complex5:start("example_drv").
│ │ │  <0.34.0>
│ │ │ -3> complex5:foo(3).
│ │ │ +3> complex5:foo(3).
│ │ │  4
│ │ │ -4> complex5:bar(5).
│ │ │ +4> complex5:bar(5).
│ │ │  10
│ │ │ -5> complex5:stop().
│ │ │ +5> complex5:stop().
│ │ │  stop
          
│ │ │  
          
│ │ │  
│ │ │  
          
│ │ │    
          
│ │ │  
│ │ │        
│ │ │    Compilation
│ │ │  
│ │ │  
          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
│ │ │  % erl -make
          The erlc program provides way to compile modules from the OS
│ │ │  shell, see the erlc executable in ERTS. It
│ │ │  understands a number of flags that can be used to define macros, add search
│ │ │  paths for include files, and more.
          % erlc <flags> File1.erl...FileN.erl
          
│ │ │ @@ -156,54 +156,54 @@
│ │ │  When a module is loaded into the system for the first time, the code becomes
│ │ │  'current'. If then a new instance of the module is loaded, the code of the
│ │ │  previous instance becomes 'old' and the new instance becomes 'current'.
          Both old and current code is valid, and can be evaluated concurrently. Fully
│ │ │  qualified function calls always refer to current code. Old code can still be
│ │ │  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
│ │ │  fun Module:FunctionName/Arity.
          
│ │ │    
│ │ │      
│ │ │    
│ │ │    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
│ │ │  the error logger.
          If there already is current code for the module, that code will remain current
│ │ │  and can be called until the on_load function has returned. If the on_load
│ │ │  function fails, the current code (if any) will remain current. If there is no
│ │ │  current code for a module, any process that makes an external call to the module
│ │ │  before the on_load function has finished will be suspended until the on_load
│ │ │  function have finished.
          Change
          Before Erlang/OTP 19, if the on_load function failed, any previously current
│ │ │  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.
          
│ │ │  
          
│ │ │  
│ │ │  
          
│ │ │    
          
│ │ │  
│ │ │        
          
│ │ │      
│ │ │    
│ │ │    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, []).
│ │ │ +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) ->
│ │ │ +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].
          
│ │ │    
│ │ │      
│ │ │    
│ │ │    Timer Module
│ │ │ @@ -160,77 +160,77 @@
│ │ │  therefore harmless.
          
│ │ │    
│ │ │      
│ │ │    
│ │ │    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#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#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).
          
│ │ │    
│ │ │      
│ │ │    
│ │ │    list_to_atom/1
│ │ │  
          
│ │ │  
          Atoms are not garbage-collected. Once an atom is created, it is never removed.
│ │ │  The emulator terminates if the limit for the number of atoms (1,048,576 by
│ │ │  default) is reached.
          Therefore, converting arbitrary input strings to atoms can be dangerous in a
│ │ │  system that runs continuously. If only certain well-defined atoms are allowed as
│ │ │  input, list_to_existing_atom/1 or
│ │ │  binary_to_existing_atom/1 can be used
│ │ │  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)
          
│ │ │    
│ │ │      
│ │ │    
│ │ │    length/1
│ │ │  
          
│ │ │  
          The time for calculating the length of a list is proportional to the length of
│ │ │  the list, as opposed to tuple_size/1,
│ │ │  byte_size/1, and bit_size/1, which all
│ │ │  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.
          
│ │ │    
│ │ │      
│ │ │    
│ │ │    setelement/3
│ │ │ @@ -238,18 +238,18 @@
│ │ │  
          setelement/3 copies the tuple it modifies. Therefore,
│ │ │  updating a tuple in a loop using setelement/3 creates a new
│ │ │  copy of the tuple every time.
          There is one exception to the rule that the tuple is copied. If the compiler
│ │ │  clearly can see that destructively updating the tuple would give the same result
│ │ │  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
│ │ │  best way to modify multiple elements in a large tuple is to convert the tuple to
│ │ │  a list, modify the list, and convert it back to a tuple.
          
│ │ │    
│ │ │      
│ │ ├── ./usr/share/doc/erlang-doc/html/doc/system/conc_prog.html
│ │ │ @@ -132,107 +132,107 @@
│ │ │  threads of execution in an Erlang program and to allow these threads to
│ │ │  communicate with each other. In Erlang, each thread of execution is called a
│ │ │  process.
          (Aside: the term "process" is usually used when the threads of execution share
│ │ │  no data with each other and the term "thread" when they share data in some way.
│ │ │  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
│ │ │  done
          As shown, the function say_something writes its first argument the number of
│ │ │  times specified by second argument. The function start starts two Erlang
│ │ │  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>
│ │ │  hello
│ │ │  goodbye
│ │ │  hello
│ │ │  goodbye
          Notice that it did not write "hello" three times and then "goodbye" three times.
│ │ │  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
│ │ │  each line sensibly. It also tries to detect flat lists of printable characters and
│ │ │  to output these as strings
          
│ │ │    
│ │ │      
│ │ │    
│ │ │    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
│ │ │  Pong received ping
│ │ │  Ping received pong
│ │ │  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 ->
│ │ │         actions1;
│ │ │     pattern2 ->
│ │ │         actions2;
│ │ │     ....
│ │ │ @@ -253,84 +253,84 @@
│ │ │  queue (keeping the first message and any other messages in the queue). If the
│ │ │  second message does not match, the third message is tried, and so on, until the
│ │ │  end of the queue is reached. If the end of the queue is reached, the process
│ │ │  blocks (stops execution) and waits until a new message is received and this
│ │ │  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.
          
│ │ │    
│ │ │      
│ │ │    
│ │ │    Registered Process Names
│ │ │  
          
│ │ │  
          In the above example, "pong" was first created to be able to give the identity
│ │ │  of "pong" when "ping" was started. That is, in some way "ping" must be able to
│ │ │  know the identity of "pong" to be able to send a message to it. Sometimes
│ │ │  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", []),
│ │ │              Ping_PID ! pong,
│ │ │ -            pong()
│ │ │ +            pong()
│ │ │      end.
│ │ │  
│ │ │ -start() ->
│ │ │ -    register(pong, spawn(tut16, pong, [])),
│ │ │ -    spawn(tut16, ping, [3]).
          2> c(tut16).
│ │ │ -{ok, tut16}
│ │ │ -3> tut16:start().
│ │ │ +start() ->
│ │ │ +    register(pong, spawn(tut16, pong, [])),
│ │ │ +    spawn(tut16, ping, [3]).
          2> c(tut16).
│ │ │ +{ok, tut16}
│ │ │ +3> tut16:start().
│ │ │  <0.38.0>
│ │ │  Pong received ping
│ │ │  Ping received pong
│ │ │  Pong received ping
│ │ │  Ping received pong
│ │ │  Pong received ping
│ │ │  Ping received pong
│ │ │  ping finished
│ │ │ -Pong finished
          Here the start/0 function,
          register(pong, spawn(tut16, pong, [])),
          both spawns the "pong" process and gives it the name pong. In the "ping"
│ │ │ -process, messages can be sent to pong by:
          pong ! {ping, self()},
          ping/2 now becomes ping/1 as the argument Pong_PID is not needed.
          
│ │ │ +Pong finished
          Here the start/0 function,
          register(pong, spawn(tut16, pong, [])),
          both spawns the "pong" process and gives it the name pong. In the "ping"
│ │ │ +process, messages can be sent to pong by:
          pong ! {ping, self()},
          ping/2 now becomes ping/1 as the argument Pong_PID is not needed.
          
│ │ │    
│ │ │      
│ │ │    
│ │ │    Distributed Programming
│ │ │  
          
│ │ │  
          Let us rewrite the ping pong program with "ping" and "pong" on different
│ │ │  computers. First a few things are needed to set up to get this to work. The
│ │ │ @@ -350,106 +350,106 @@
│ │ │  of the file. This is a requirement.
          When you start an Erlang system that is going to talk to other Erlang systems,
│ │ │  you must give it a name, for example:
          $ erl -sname my_name
          We will see more details of this later. If you want to experiment with
│ │ │  distributed Erlang, but you only have one computer to work on, you can start two
│ │ │  separate Erlang systems on the same computer but give them different names. Each
│ │ │  Erlang system running on a computer is called an Erlang node.
          (Note: erl -sname assumes that all nodes are in the same IP domain and we can
│ │ │  use only the first component of the IP address, if we want to use nodes in
│ │ │  different domains we use -name instead, but then all IP address must be given
│ │ │ -in full.)
          Here is the ping pong example modified to run on two separate nodes:
          -module(tut17).
│ │ │ +in full.)
          Here is the ping pong example modified to run on two separate nodes:
          -module(tut17).
│ │ │  
│ │ │ --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) ->
│ │ │ -    {pong, Pong_Node} ! finished,
│ │ │ -    io:format("ping finished~n", []);
│ │ │ +ping(0, Pong_Node) ->
│ │ │ +    {pong, Pong_Node} ! finished,
│ │ │ +    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
│ │ │          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() ->
│ │ │ -    register(pong, spawn(tut17, pong, [])).
│ │ │ +start_pong() ->
│ │ │ +    register(pong, spawn(tut17, pong, [])).
│ │ │  
│ │ │ -start_ping(Pong_Node) ->
│ │ │ -    spawn(tut17, ping, [3, Pong_Node]).
          Let us assume there are two computers called gollum and kosken. First a node is
│ │ │ +start_ping(Pong_Node) ->
│ │ │ +    spawn(tut17, ping, [3, Pong_Node]).
          Let us assume there are two computers called gollum and kosken. First a node is
│ │ │  started on kosken, called ping, and then a node on gollum, called pong.
          On kosken (on a Linux/UNIX system):
          kosken> erl -sname ping
│ │ │  Erlang (BEAM) emulator version 5.2.3.7 [hipe] [threads:0]
│ │ │  
│ │ │  Eshell V5.2.3.7  (abort with ^G)
│ │ │  (ping@kosken)1>
          On gollum:
          gollum> erl -sname pong
│ │ │  Erlang (BEAM) emulator version 5.2.3.7 [hipe] [threads:0]
│ │ │  
│ │ │  Eshell V5.2.3.7  (abort with ^G)
│ │ │ -(pong@gollum)1>
          Now the "pong" process on gollum is started:
          (pong@gollum)1> tut17:start_pong().
│ │ │ +(pong@gollum)1>
          Now the "pong" process on gollum is started:
          (pong@gollum)1> tut17:start_pong().
│ │ │  true
          And the "ping" process on kosken is started (from the code above you can see
│ │ │  that a parameter of the start_ping function is the node name of the Erlang
│ │ │ -system where "pong" is running):
          (ping@kosken)1> tut17:start_ping(pong@gollum).
│ │ │ +system where "pong" is running):
          (ping@kosken)1> tut17:start_ping(pong@gollum).
│ │ │  <0.37.0>
│ │ │  Ping received pong
│ │ │  Ping received pong
│ │ │  Ping received pong
│ │ │  ping finished
          As shown, the ping pong program has run. On the "pong" side:
          (pong@gollum)2> 
│ │ │  Pong received ping
│ │ │  Pong received ping
│ │ │  Pong received ping
│ │ │  Pong finished
│ │ │ -(pong@gollum)2> 
          Looking at the tut17 code, you see that the pong function itself is
│ │ │ +(pong@gollum)2> 
          Looking at the tut17 code, you see that the pong function itself is
│ │ │  unchanged, the following lines work in the same way irrespective of on which
│ │ │ -node the "ping" process is executes:
          {ping, Ping_PID} ->
│ │ │ -    io:format("Pong received ping~n", []),
│ │ │ +node the "ping" process is executes:
          {ping, Ping_PID} ->
│ │ │ +    io:format("Pong received ping~n", []),
│ │ │      Ping_PID ! pong,
          Thus, Erlang pids contain information about where the process executes. So if
│ │ │  you know the pid of a process, the ! operator can be used to send it a
│ │ │ -message disregarding if the process is on the same node or on a different node.
          A difference is how messages are sent to a registered process on another node:
          {pong, Pong_Node} ! {ping, self()},
          A tuple {registered_name,node_name} is used instead of just the
│ │ │ +message disregarding if the process is on the same node or on a different node.
          A difference is how messages are sent to a registered process on another node:
          {pong, Pong_Node} ! {ping, self()},
          A tuple {registered_name,node_name} is used instead of just the
│ │ │  registered_name.
          In the previous example, "ping" and "pong" were started from the shells of two
│ │ │  separate Erlang nodes. spawn can also be used to start processes in other
│ │ │  nodes.
          The next example is the ping pong program, yet again, but this time "ping" is
│ │ │ -started in another node:
          -module(tut18).
│ │ │ +started in another node:
          -module(tut18).
│ │ │  
│ │ │ --export([start/1,  ping/2, pong/0]).
│ │ │ +-export([start/1,  ping/2, pong/0]).
│ │ │  
│ │ │ -ping(0, Pong_Node) ->
│ │ │ -    {pong, Pong_Node} ! finished,
│ │ │ -    io:format("ping finished~n", []);
│ │ │ +ping(0, Pong_Node) ->
│ │ │ +    {pong, Pong_Node} ! finished,
│ │ │ +    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
│ │ │          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(Ping_Node) ->
│ │ │ -    register(pong, spawn(tut18, pong, [])),
│ │ │ -    spawn(Ping_Node, tut18, ping, [3, node()]).
          Assuming an Erlang system called ping (but not the "ping" process) has already
│ │ │ -been started on kosken, then on gollum this is done:
          (pong@gollum)1> tut18:start(ping@kosken).
│ │ │ +start(Ping_Node) ->
│ │ │ +    register(pong, spawn(tut18, pong, [])),
│ │ │ +    spawn(Ping_Node, tut18, ping, [3, node()]).
          Assuming an Erlang system called ping (but not the "ping" process) has already
│ │ │ +been started on kosken, then on gollum this is done:
          (pong@gollum)1> tut18:start(ping@kosken).
│ │ │  <3934.39.0>
│ │ │  Pong received ping
│ │ │  Ping received pong
│ │ │  Pong received ping
│ │ │  Ping received pong
│ │ │  Pong received ping
│ │ │  Ping received pong
│ │ │ @@ -516,188 +516,188 @@
│ │ │  %%% Started: messenger:client(Server_Node, Name)
│ │ │  %%% To client: logoff
│ │ │  %%% To client: {message_to, ToName, Message}
│ │ │  %%%
│ │ │  %%% Configuration: change the server_node() function to return the
│ │ │  %%% name of the node where the messenger server runs
│ │ │  
│ │ │ --module(messenger).
│ │ │ --export([start_server/0, server/1, logon/1, logoff/0, message/2, client/2]).
│ │ │ +-module(messenger).
│ │ │ +-export([start_server/0, server/1, logon/1, logoff/0, message/2, client/2]).
│ │ │  
│ │ │  %%% Change the function below to return the name of the node where the
│ │ │  %%% messenger server runs
│ │ │ -server_node() ->
│ │ │ +server_node() ->
│ │ │      messenger@super.
│ │ │  
│ │ │  %%% This is the server process for the "messenger"
│ │ │  %%% the user list has the format [{ClientPid1, Name1},{ClientPid22, Name2},...]
│ │ │ -server(User_List) ->
│ │ │ +server(User_List) ->
│ │ │      receive
│ │ │ -        {From, logon, Name} ->
│ │ │ -            New_User_List = server_logon(From, Name, User_List),
│ │ │ -            server(New_User_List);
│ │ │ -        {From, logoff} ->
│ │ │ -            New_User_List = server_logoff(From, User_List),
│ │ │ -            server(New_User_List);
│ │ │ -        {From, message_to, To, Message} ->
│ │ │ -            server_transfer(From, To, Message, User_List),
│ │ │ -            io:format("list is now: ~p~n", [User_List]),
│ │ │ -            server(User_List)
│ │ │ +        {From, logon, Name} ->
│ │ │ +            New_User_List = server_logon(From, Name, User_List),
│ │ │ +            server(New_User_List);
│ │ │ +        {From, logoff} ->
│ │ │ +            New_User_List = server_logoff(From, User_List),
│ │ │ +            server(New_User_List);
│ │ │ +        {From, message_to, To, Message} ->
│ │ │ +            server_transfer(From, To, Message, User_List),
│ │ │ +            io:format("list is now: ~p~n", [User_List]),
│ │ │ +            server(User_List)
│ │ │      end.
│ │ │  
│ │ │  %%% Start the server
│ │ │ -start_server() ->
│ │ │ -    register(messenger, spawn(messenger, server, [[]])).
│ │ │ +start_server() ->
│ │ │ +    register(messenger, spawn(messenger, server, [[]])).
│ │ │  
│ │ │  
│ │ │  %%% Server adds a new user to the user list
│ │ │ -server_logon(From, Name, User_List) ->
│ │ │ +server_logon(From, Name, User_List) ->
│ │ │      %% check if logged on anywhere else
│ │ │ -    case lists:keymember(Name, 2, User_List) of
│ │ │ +    case lists:keymember(Name, 2, User_List) of
│ │ │          true ->
│ │ │ -            From ! {messenger, stop, user_exists_at_other_node},  %reject logon
│ │ │ +            From ! {messenger, stop, user_exists_at_other_node},  %reject logon
│ │ │              User_List;
│ │ │          false ->
│ │ │ -            From ! {messenger, logged_on},
│ │ │ -            [{From, Name} | User_List]        %add user to the list
│ │ │ +            From ! {messenger, logged_on},
│ │ │ +            [{From, Name} | User_List]        %add user to the list
│ │ │      end.
│ │ │  
│ │ │  %%% Server deletes a user from the user list
│ │ │ -server_logoff(From, User_List) ->
│ │ │ -    lists:keydelete(From, 1, User_List).
│ │ │ +server_logoff(From, User_List) ->
│ │ │ +    lists:keydelete(From, 1, User_List).
│ │ │  
│ │ │  
│ │ │  %%% Server transfers a message between user
│ │ │ -server_transfer(From, To, Message, User_List) ->
│ │ │ +server_transfer(From, To, Message, User_List) ->
│ │ │      %% check that the user is logged on and who he is
│ │ │ -    case lists:keysearch(From, 1, User_List) of
│ │ │ +    case lists:keysearch(From, 1, User_List) of
│ │ │          false ->
│ │ │ -            From ! {messenger, stop, you_are_not_logged_on};
│ │ │ -        {value, {From, Name}} ->
│ │ │ -            server_transfer(From, Name, To, Message, User_List)
│ │ │ +            From ! {messenger, stop, you_are_not_logged_on};
│ │ │ +        {value, {From, Name}} ->
│ │ │ +            server_transfer(From, Name, To, Message, User_List)
│ │ │      end.
│ │ │  %%% If the user exists, send the message
│ │ │ -server_transfer(From, Name, To, Message, User_List) ->
│ │ │ +server_transfer(From, Name, To, Message, User_List) ->
│ │ │      %% Find the receiver and send the message
│ │ │ -    case lists:keysearch(To, 2, User_List) of
│ │ │ +    case lists:keysearch(To, 2, User_List) of
│ │ │          false ->
│ │ │ -            From ! {messenger, receiver_not_found};
│ │ │ -        {value, {ToPid, To}} ->
│ │ │ -            ToPid ! {message_from, Name, Message},
│ │ │ -            From ! {messenger, sent}
│ │ │ +            From ! {messenger, receiver_not_found};
│ │ │ +        {value, {ToPid, To}} ->
│ │ │ +            ToPid ! {message_from, Name, Message},
│ │ │ +            From ! {messenger, sent}
│ │ │      end.
│ │ │  
│ │ │  
│ │ │  %%% User Commands
│ │ │ -logon(Name) ->
│ │ │ -    case whereis(mess_client) of
│ │ │ +logon(Name) ->
│ │ │ +    case whereis(mess_client) of
│ │ │          undefined ->
│ │ │ -            register(mess_client,
│ │ │ -                     spawn(messenger, client, [server_node(), Name]));
│ │ │ +            register(mess_client,
│ │ │ +                     spawn(messenger, 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, ToName, Message},
│ │ │ +        _ -> mess_client ! {message_to, ToName, Message},
│ │ │               ok
│ │ │  end.
│ │ │  
│ │ │  
│ │ │  %%% The client process which runs on each server node
│ │ │ -client(Server_Node, Name) ->
│ │ │ -    {messenger, Server_Node} ! {self(), logon, Name},
│ │ │ -    await_result(),
│ │ │ -    client(Server_Node).
│ │ │ +client(Server_Node, Name) ->
│ │ │ +    {messenger, Server_Node} ! {self(), logon, Name},
│ │ │ +    await_result(),
│ │ │ +    client(Server_Node).
│ │ │  
│ │ │ -client(Server_Node) ->
│ │ │ +client(Server_Node) ->
│ │ │      receive
│ │ │          logoff ->
│ │ │ -            {messenger, Server_Node} ! {self(), logoff},
│ │ │ -            exit(normal);
│ │ │ -        {message_to, ToName, Message} ->
│ │ │ -            {messenger, Server_Node} ! {self(), message_to, ToName, Message},
│ │ │ -            await_result();
│ │ │ -        {message_from, FromName, Message} ->
│ │ │ -            io:format("Message from ~p: ~p~n", [FromName, Message])
│ │ │ +            {messenger, Server_Node} ! {self(), logoff},
│ │ │ +            exit(normal);
│ │ │ +        {message_to, ToName, Message} ->
│ │ │ +            {messenger, Server_Node} ! {self(), message_to, ToName, 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
│ │ │ -        {messenger, stop, Why} -> % Stop the client
│ │ │ -            io:format("~p~n", [Why]),
│ │ │ -            exit(normal);
│ │ │ -        {messenger, What} ->  % Normal response
│ │ │ -            io:format("~p~n", [What])
│ │ │ +        {messenger, stop, Why} -> % Stop the client
│ │ │ +            io:format("~p~n", [Why]),
│ │ │ +            exit(normal);
│ │ │ +        {messenger, What} ->  % Normal response
│ │ │ +            io:format("~p~n", [What])
│ │ │      end.
          To use this program, you need to:
          • Configure the server_node() function.
          • Copy the compiled code (messenger.beam) to the directory on each computer
│ │ │  where you start Erlang.
          In the following example using this program, nodes are started on four different
│ │ │  computers. If you do not have that many machines available on your network, you
│ │ │  can start several nodes on the same machine.
          Four Erlang nodes are started up: messenger@super, c1@bilbo, c2@kosken,
│ │ │ -c3@gollum.
          First the server at messenger@super is started up:
          (messenger@super)1> messenger:start_server().
│ │ │ -true
          Now Peter logs on at c1@bilbo:
          (c1@bilbo)1> messenger:logon(peter).
│ │ │ +c3@gollum.
          First the server at messenger@super is started up:
          (messenger@super)1> messenger:start_server().
│ │ │ +true
          Now Peter logs on at c1@bilbo:
          (c1@bilbo)1> messenger:logon(peter).
│ │ │  true
│ │ │ -logged_on
          James logs on at c2@kosken:
          (c2@kosken)1> messenger:logon(james).
│ │ │ +logged_on
          James logs on at c2@kosken:
          (c2@kosken)1> messenger:logon(james).
│ │ │  true
│ │ │ -logged_on
          And Fred logs on at c3@gollum:
          (c3@gollum)1> messenger:logon(fred).
│ │ │ +logged_on
          And Fred logs on at c3@gollum:
          (c3@gollum)1> messenger:logon(fred).
│ │ │  true
│ │ │ -logged_on
          Now Peter sends Fred a message:
          (c1@bilbo)2> messenger:message(fred, "hello").
│ │ │ +logged_on
          Now Peter sends Fred a message:
          (c1@bilbo)2> messenger:message(fred, "hello").
│ │ │  ok
│ │ │  sent
          Fred receives the message and sends a message to Peter and logs off:
          Message from peter: "hello"
│ │ │ -(c3@gollum)2> messenger:message(peter, "go away, I'm busy").
│ │ │ +(c3@gollum)2> messenger:message(peter, "go away, I'm busy").
│ │ │  ok
│ │ │  sent
│ │ │ -(c3@gollum)3> messenger:logoff().
│ │ │ -logoff
          James now tries to send a message to Fred:
          (c2@kosken)2> messenger:message(fred, "peter doesn't like you").
│ │ │ +(c3@gollum)3> messenger:logoff().
│ │ │ +logoff
          James now tries to send a message to Fred:
          (c2@kosken)2> messenger:message(fred, "peter doesn't like you").
│ │ │  ok
│ │ │  receiver_not_found
          But this fails as Fred has already logged off.
          First let us look at some of the new concepts that have been introduced.
          There are two versions of the server_transfer function: one with four
│ │ │  arguments (server_transfer/4) and one with five (server_transfer/5). These
│ │ │  are regarded by Erlang as two separate functions.
          Notice how to write the server function so that it calls itself, through
│ │ │  server(User_List), and thus creates a loop. The Erlang compiler is "clever"
│ │ │  and optimizes the code so that this really is a sort of loop and not a proper
│ │ │  function call. But this only works if there is no code after the call.
│ │ │  Otherwise, the compiler expects the call to return and make a proper function
│ │ │  call. This would result in the process getting bigger and bigger for every loop.
          Functions in the lists module are used. This is a very useful module and a
│ │ │  study of the manual page is recommended (erl -man lists).
│ │ │  lists:keymember(Key,Position,Lists) looks through a list of tuples and looks
│ │ │  at Position in each tuple to see if it is the same as Key. The first element
│ │ │  is position 1. If it finds a tuple where the element at Position is the same
│ │ │ -as Key, it returns true, otherwise false.
          3> lists:keymember(a, 2, [{x,y,z},{b,b,b},{b,a,c},{q,r,s}]).
│ │ │ +as Key, it returns true, otherwise false.
          3> lists:keymember(a, 2, [{x,y,z},{b,b,b},{b,a,c},{q,r,s}]).
│ │ │  true
│ │ │ -4> lists:keymember(p, 2, [{x,y,z},{b,b,b},{b,a,c},{q,r,s}]).
│ │ │ +4> lists:keymember(p, 2, [{x,y,z},{b,b,b},{b,a,c},{q,r,s}]).
│ │ │  false
          lists:keydelete works in the same way but deletes the first tuple found (if
│ │ │ -any) and returns the remaining list:
          5> lists:keydelete(a, 2, [{x,y,z},{b,b,b},{b,a,c},{q,r,s}]).
│ │ │ -[{x,y,z},{b,b,b},{q,r,s}]
          lists:keysearch is like lists:keymember, but it returns
│ │ │ +any) and returns the remaining list:
          5> lists:keydelete(a, 2, [{x,y,z},{b,b,b},{b,a,c},{q,r,s}]).
│ │ │ +[{x,y,z},{b,b,b},{q,r,s}]
          lists:keysearch is like lists:keymember, but it returns
│ │ │  {value,Tuple_Found} or the atom false.
          There are many very useful functions in the lists module.
          An Erlang process (conceptually) runs until it does a receive and there is no
│ │ │  message which it wants to receive in the message queue. "conceptually" is used
│ │ │  here because the Erlang system shares the CPU time between the active processes
│ │ │  in the system.
          A process terminates when there is nothing more for it to do, that is, the last
│ │ │  function it calls simply returns and does not call another function. Another way
│ │ │  for a process to terminate is for it to call exit/1. The argument
│ │ │  to exit/1 has a special meaning, which is discussed later. In this
│ │ │  example, exit(normal) is done, which has the same effect as a
│ │ │  process running out of functions to call.
          The BIF whereis(RegisteredName) checks if a registered process
│ │ │  of name RegisteredName exists. If it exists, the pid of that process is
│ │ │  returned. If it does not exist, the atom undefined is returned.
          You should by now be able to understand most of the code in the
│ │ │  messenger-module. Let us study one case in detail: a message is sent from one
│ │ │ -user to another.
          The first user "sends" the message in the example above by:
          messenger:message(fred, "hello")
          After testing that the client process exists:
          whereis(mess_client)
          And a message is sent to mess_client:
          mess_client ! {message_to, fred, "hello"}
          The client sends the message to the server by:
          {messenger, messenger@super} ! {self(), message_to, fred, "hello"},
          And waits for a reply from the server.
          The server receives this message and calls:
          server_transfer(From, fred, "hello", User_List),
          This checks that the pid From is in the User_List:
          lists:keysearch(From, 1, User_List)
          If keysearch returns the atom false, some error has occurred and the server
│ │ │ -sends back the message:
          From ! {messenger, stop, you_are_not_logged_on}
          This is received by the client, which in turn does exit(normal)
│ │ │ +user to another.
          The first user "sends" the message in the example above by:
          messenger:message(fred, "hello")
          After testing that the client process exists:
          whereis(mess_client)
          And a message is sent to mess_client:
          mess_client ! {message_to, fred, "hello"}
          The client sends the message to the server by:
          {messenger, messenger@super} ! {self(), message_to, fred, "hello"},
          And waits for a reply from the server.
          The server receives this message and calls:
          server_transfer(From, fred, "hello", User_List),
          This checks that the pid From is in the User_List:
          lists:keysearch(From, 1, User_List)
          If keysearch returns the atom false, some error has occurred and the server
│ │ │ +sends back the message:
          From ! {messenger, stop, you_are_not_logged_on}
          This is received by the client, which in turn does exit(normal)
│ │ │  and terminates. If keysearch returns {value,{From,Name}} it is certain that
│ │ │ -the user is logged on and that his name (peter) is in variable Name.
          Let us now call:
          server_transfer(From, peter, fred, "hello", User_List)
          Notice that as this is server_transfer/5, it is not the same as the previous
│ │ │ +the user is logged on and that his name (peter) is in variable Name.
          Let us now call:
          server_transfer(From, peter, fred, "hello", User_List)
          Notice that as this is server_transfer/5, it is not the same as the previous
│ │ │  function server_transfer/4. Another keysearch is done on User_List to find
│ │ │ -the pid of the client corresponding to fred:
          lists:keysearch(fred, 2, User_List)
          This time argument 2 is used, which is the second element in the tuple. If this
│ │ │ +the pid of the client corresponding to fred:
          lists:keysearch(fred, 2, User_List)
          This time argument 2 is used, which is the second element in the tuple. If this
│ │ │  returns the atom false, fred is not logged on and the following message is
│ │ │ -sent:
          From ! {messenger, receiver_not_found};
          This is received by the client.
          If keysearch returns:
          {value, {ToPid, fred}}
          The following message is sent to fred's client:
          ToPid ! {message_from, peter, "hello"},
          The following message is sent to peter's client:
          From ! {messenger, sent}
          Fred's client receives the message and prints it:
          {message_from, peter, "hello"} ->
│ │ │ -    io:format("Message from ~p: ~p~n", [peter, "hello"])
          Peter's client receives the message in the await_result function.
          
│ │ │ +sent:
          From ! {messenger, receiver_not_found};
          This is received by the client.
          If keysearch returns:
          {value, {ToPid, fred}}
          The following message is sent to fred's client:
          ToPid ! {message_from, peter, "hello"},
          The following message is sent to peter's client:
          From ! {messenger, sent}
          Fred's client receives the message and prints it:
          {message_from, peter, "hello"} ->
│ │ │ +    io:format("Message from ~p: ~p~n", [peter, "hello"])
          Peter's client receives the message in the await_result function.
          
│ │ │  
          
│ │ │  
│ │ │  
          
│ │ │    
          
│ │ │  
│ │ │        
          rel(4) manual page in
│ │ │  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
│ │ │  the Pea application to the code path.
          Step 3. Create the target system:
          1> target_system:create("mysystem").
          The function target_system:create/1 performs the following:
          1. Reads the file mysystem.rel and creates a new file plain.rel.
│ │ │  The new file is identical to the original, except that it only
│ │ │  lists the Kernel and STDLIB applications.
          2. From the files mysystem.rel and plain.rel creates the files
│ │ │  mysystem.script, mysystem.boot, plain.script, and plain.boot
│ │ │ @@ -242,25 +242,25 @@
│ │ │    
│ │ │      
│ │ │    
│ │ │    Creating the Next Version
│ │ │  
│ │ │  
            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",
│ │ │      "/my/old/erlang/lib/*/ebin"]}]).
      Here "mysystem" is the base release and "mysystem2" is the release to
│ │ │  upgrade to.
      The path option is used for pointing out the old version of all applications.
│ │ │  (The new versions are already in the code path - assuming of course that the
│ │ │  Erlang node on which this is executed is running the correct version of
│ │ │ @@ -292,21 +292,21 @@
│ │ │  {continue_after_restart,"FIRST",[]}
│ │ │  heart: Tue Apr  1 12:15:10 2014: Erlang has closed.
│ │ │  heart: Tue Apr  1 12:15:11 2014: Executed "/usr/local/erl-target/bin/start /usr/local/erl-target/releases/new_start_erl.data" -> 0. Terminating.
│ │ │  [End]
      The above return value and output after the call to
│ │ │  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"],
│ │ │ @@ -315,268 +315,268 @@
│ │ │    
│ │ │      
│ │ │    
│ │ │    Listing of target_system.erl
│ │ │  
│ │ │  
      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.
│ │ │  %%
│ │ │  
│ │ │  %% 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"),
│ │ │ +    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"])),
│ │ │  
│ │ │ -    io:fwrite("Copying files \"epmd\", \"run_erl\" and \"to_erl\" from \n"
│ │ │ +    io:fwrite("Copying files \"epmd\", \"run_erl\" and \"to_erl\" from \n"
│ │ │                "~ts to ~ts ...~n",
│ │ │ -              [ErtsBinDir, TmpBinDir]),
│ │ │ -    copy_file(filename:join([ErtsBinDir, "epmd"]),
│ │ │ -              filename:join([TmpBinDir, "epmd"]), [preserve]),
│ │ │ -    copy_file(filename:join([ErtsBinDir, "run_erl"]),
│ │ │ -              filename:join([TmpBinDir, "run_erl"]), [preserve]),
│ │ │ -    copy_file(filename:join([ErtsBinDir, "to_erl"]),
│ │ │ -              filename:join([TmpBinDir, "to_erl"]), [preserve]),
│ │ │ +              [ErtsBinDir, TmpBinDir]),
│ │ │ +    copy_file(filename:join([ErtsBinDir, "epmd"]),
│ │ │ +              filename:join([TmpBinDir, "epmd"]), [preserve]),
│ │ │ +    copy_file(filename:join([ErtsBinDir, "run_erl"]),
│ │ │ +              filename:join([TmpBinDir, "run_erl"]), [preserve]),
│ │ │ +    copy_file(filename:join([ErtsBinDir, "to_erl"]),
│ │ │ +              filename:join([TmpBinDir, "to_erl"]), [preserve]),
│ │ │  
│ │ │      %% This is needed if 'start' script created from 'start.src' shall
│ │ │      %% be used as it points out this directory as log dir for 'run_erl'
│ │ │ -    TmpLogDir = filename:join([TmpDir, "log"]),
│ │ │ -    io:fwrite("Creating temporary directory ~ts ...~n", [TmpLogDir]),
│ │ │ -    ok = file:make_dir(TmpLogDir),
│ │ │ -
│ │ │ -    StartErlDataFile = filename:join([TmpDir, "releases", "start_erl.data"]),
│ │ │ -    io:fwrite("Creating ~ts ...~n", [StartErlDataFile]),
│ │ │ -    StartErlData = io_lib:fwrite("~s ~s~n", [ErtsVsn, RelVsn]),
│ │ │ -    write_file(StartErlDataFile, StartErlData),
│ │ │ -
│ │ │ -    io:fwrite("Recreating tar file ~ts from contents in directory ~ts ...~n",
│ │ │ -	      [TarFileName,TmpDir]),
│ │ │ -    {ok, Tar} = erl_tar:open(TarFileName, [write, compressed]),
│ │ │ +    TmpLogDir = filename:join([TmpDir, "log"]),
│ │ │ +    io:fwrite("Creating temporary directory ~ts ...~n", [TmpLogDir]),
│ │ │ +    ok = file:make_dir(TmpLogDir),
│ │ │ +
│ │ │ +    StartErlDataFile = filename:join([TmpDir, "releases", "start_erl.data"]),
│ │ │ +    io:fwrite("Creating ~ts ...~n", [StartErlDataFile]),
│ │ │ +    StartErlData = io_lib:fwrite("~s ~s~n", [ErtsVsn, RelVsn]),
│ │ │ +    write_file(StartErlDataFile, StartErlData),
│ │ │ +
│ │ │ +    io:fwrite("Recreating tar file ~ts from contents in directory ~ts ...~n",
│ │ │ +	      [TarFileName,TmpDir]),
│ │ │ +    {ok, Tar} = erl_tar:open(TarFileName, [write, compressed]),
│ │ │      %% {ok, Cwd} = file:get_cwd(),
│ │ │      %% file:set_cwd("tmp"),
│ │ │      ErtsDir = "erts-"++ErtsVsn,
│ │ │ -    erl_tar:add(Tar, filename:join(TmpDir,"bin"), "bin", []),
│ │ │ -    erl_tar:add(Tar, filename:join(TmpDir,ErtsDir), ErtsDir, []),
│ │ │ -    erl_tar:add(Tar, filename:join(TmpDir,"releases"), "releases", []),
│ │ │ -    erl_tar:add(Tar, filename:join(TmpDir,"lib"), "lib", []),
│ │ │ -    erl_tar:add(Tar, filename:join(TmpDir,"log"), "log", []),
│ │ │ -    erl_tar:close(Tar),
│ │ │ +    erl_tar:add(Tar, filename:join(TmpDir,"bin"), "bin", []),
│ │ │ +    erl_tar:add(Tar, filename:join(TmpDir,ErtsDir), ErtsDir, []),
│ │ │ +    erl_tar:add(Tar, filename:join(TmpDir,"releases"), "releases", []),
│ │ │ +    erl_tar:add(Tar, filename:join(TmpDir,"lib"), "lib", []),
│ │ │ +    erl_tar:add(Tar, filename:join(TmpDir,"log"), "log", []),
│ │ │ +    erl_tar:close(Tar),
│ │ │      %% file:set_cwd(Cwd),
│ │ │ -    io:fwrite("Removing directory ~ts ...~n",[TmpDir]),
│ │ │ -    remove_dir_tree(TmpDir),
│ │ │ +    io:fwrite("Removing directory ~ts ...~n",[TmpDir]),
│ │ │ +    remove_dir_tree(TmpDir),
│ │ │      ok.
│ │ │  
│ │ │  
│ │ │ -install(RelFileName, RootDir) ->
│ │ │ +install(RelFileName, RootDir) ->
│ │ │      TarFile = RelFileName ++ ".tar.gz",
│ │ │ -    io:fwrite("Extracting ~ts ...~n", [TarFile]),
│ │ │ -    extract_tar(TarFile, RootDir),
│ │ │ -    StartErlDataFile = filename:join([RootDir, "releases", "start_erl.data"]),
│ │ │ -    {ok, StartErlData} = read_txt_file(StartErlDataFile),
│ │ │ -    [ErlVsn, _RelVsn| _] = string:tokens(StartErlData, " \n"),
│ │ │ -    ErtsBinDir = filename:join([RootDir, "erts-" ++ ErlVsn, "bin"]),
│ │ │ -    BinDir = filename:join([RootDir, "bin"]),
│ │ │ -    io:fwrite("Substituting in erl.src, start.src and start_erl.src to "
│ │ │ -              "form erl, start and start_erl ...\n"),
│ │ │ -    subst_src_scripts(["erl", "start", "start_erl"], ErtsBinDir, BinDir,
│ │ │ -                      [{"FINAL_ROOTDIR", RootDir}, {"EMU", "beam"}],
│ │ │ -                      [preserve]),
│ │ │ +    io:fwrite("Extracting ~ts ...~n", [TarFile]),
│ │ │ +    extract_tar(TarFile, RootDir),
│ │ │ +    StartErlDataFile = filename:join([RootDir, "releases", "start_erl.data"]),
│ │ │ +    {ok, StartErlData} = read_txt_file(StartErlDataFile),
│ │ │ +    [ErlVsn, _RelVsn| _] = string:tokens(StartErlData, " \n"),
│ │ │ +    ErtsBinDir = filename:join([RootDir, "erts-" ++ ErlVsn, "bin"]),
│ │ │ +    BinDir = filename:join([RootDir, "bin"]),
│ │ │ +    io:fwrite("Substituting in erl.src, start.src and start_erl.src to "
│ │ │ +              "form erl, start and start_erl ...\n"),
│ │ │ +    subst_src_scripts(["erl", "start", "start_erl"], ErtsBinDir, BinDir,
│ │ │ +                      [{"FINAL_ROOTDIR", RootDir}, {"EMU", "beam"}],
│ │ │ +                      [preserve]),
│ │ │      %%! Workaround for pre OTP 17.0: start.src and start_erl.src did
│ │ │      %%! not have correct permissions, so the above 'preserve' option did not help
│ │ │ -    ok = file:change_mode(filename:join(BinDir,"start"),8#0755),
│ │ │ -    ok = file:change_mode(filename:join(BinDir,"start_erl"),8#0755),
│ │ │ +    ok = file:change_mode(filename:join(BinDir,"start"),8#0755),
│ │ │ +    ok = file:change_mode(filename:join(BinDir,"start_erl"),8#0755),
│ │ │  
│ │ │ -    io:fwrite("Creating the RELEASES file ...\n"),
│ │ │ -    create_RELEASES(RootDir, filename:join([RootDir, "releases",
│ │ │ -					    filename:basename(RelFileName)])).
│ │ │ +    io:fwrite("Creating the RELEASES file ...\n"),
│ │ │ +    create_RELEASES(RootDir, filename:join([RootDir, "releases",
│ │ │ +					    filename:basename(RelFileName)])).
│ │ │  
│ │ │  %% LOCALS
│ │ │  
│ │ │  %% make_script(RelFileName,Opts)
│ │ │  %%
│ │ │ -make_script(RelFileName,Opts) ->
│ │ │ -    systools:make_script(RelFileName, [no_module_tests,
│ │ │ -				       {outdir,filename:dirname(RelFileName)}
│ │ │ -				       |Opts]).
│ │ │ +make_script(RelFileName,Opts) ->
│ │ │ +    systools:make_script(RelFileName, [no_module_tests,
│ │ │ +				       {outdir,filename:dirname(RelFileName)}
│ │ │ +				       |Opts]).
│ │ │  
│ │ │  %% make_tar(RelFileName,Opts)
│ │ │  %%
│ │ │ -make_tar(RelFileName,Opts) ->
│ │ │ -    RootDir = code:root_dir(),
│ │ │ -    systools:make_tar(RelFileName, [{erts, RootDir},
│ │ │ -				    {outdir,filename:dirname(RelFileName)}
│ │ │ -				    |Opts]).
│ │ │ +make_tar(RelFileName,Opts) ->
│ │ │ +    RootDir = code:root_dir(),
│ │ │ +    systools:make_tar(RelFileName, [{erts, RootDir},
│ │ │ +				    {outdir,filename:dirname(RelFileName)}
│ │ │ +				    |Opts]).
│ │ │  
│ │ │  %% extract_tar(TarFile, DestDir)
│ │ │  %%
│ │ │ -extract_tar(TarFile, DestDir) ->
│ │ │ -    erl_tar:extract(TarFile, [{cwd, DestDir}, compressed]).
│ │ │ +extract_tar(TarFile, DestDir) ->
│ │ │ +    erl_tar:extract(TarFile, [{cwd, DestDir}, compressed]).
│ │ │  
│ │ │ -create_RELEASES(DestDir, RelFileName) ->
│ │ │ -    release_handler:create_RELEASES(DestDir, RelFileName ++ ".rel").
│ │ │ +create_RELEASES(DestDir, RelFileName) ->
│ │ │ +    release_handler:create_RELEASES(DestDir, RelFileName ++ ".rel").
│ │ │  
│ │ │ -subst_src_scripts(Scripts, SrcDir, DestDir, Vars, Opts) ->
│ │ │ -    lists:foreach(fun(Script) ->
│ │ │ -                          subst_src_script(Script, SrcDir, DestDir,
│ │ │ -                                           Vars, Opts)
│ │ │ -                  end, Scripts).
│ │ │ -
│ │ │ -subst_src_script(Script, SrcDir, DestDir, Vars, Opts) ->
│ │ │ -    subst_file(filename:join([SrcDir, Script ++ ".src"]),
│ │ │ -               filename:join([DestDir, Script]),
│ │ │ -               Vars, Opts).
│ │ │ -
│ │ │ -subst_file(Src, Dest, Vars, Opts) ->
│ │ │ -    {ok, Conts} = read_txt_file(Src),
│ │ │ -    NConts = subst(Conts, Vars),
│ │ │ -    write_file(Dest, NConts),
│ │ │ -    case lists:member(preserve, Opts) of
│ │ │ +subst_src_scripts(Scripts, SrcDir, DestDir, Vars, Opts) ->
│ │ │ +    lists:foreach(fun(Script) ->
│ │ │ +                          subst_src_script(Script, SrcDir, DestDir,
│ │ │ +                                           Vars, Opts)
│ │ │ +                  end, Scripts).
│ │ │ +
│ │ │ +subst_src_script(Script, SrcDir, DestDir, Vars, Opts) ->
│ │ │ +    subst_file(filename:join([SrcDir, Script ++ ".src"]),
│ │ │ +               filename:join([DestDir, Script]),
│ │ │ +               Vars, Opts).
│ │ │ +
│ │ │ +subst_file(Src, Dest, Vars, Opts) ->
│ │ │ +    {ok, Conts} = read_txt_file(Src),
│ │ │ +    NConts = subst(Conts, Vars),
│ │ │ +    write_file(Dest, NConts),
│ │ │ +    case lists:member(preserve, Opts) of
│ │ │          true ->
│ │ │ -            {ok, FileInfo} = file:read_file_info(Src),
│ │ │ -            file:write_file_info(Dest, FileInfo);
│ │ │ +            {ok, FileInfo} = file:read_file_info(Src),
│ │ │ +            file:write_file_info(Dest, FileInfo);
│ │ │          false ->
│ │ │              ok
│ │ │      end.
│ │ │  
│ │ │  %% subst(Str, Vars)
│ │ │  %% Vars = [{Var, Val}]
│ │ │  %% Var = Val = string()
│ │ │  %% Substitute all occurrences of %Var% for Val in Str, using the list
│ │ │  %% of variables in Vars.
│ │ │  %%
│ │ │ -subst(Str, Vars) ->
│ │ │ -    subst(Str, Vars, []).
│ │ │ +subst(Str, Vars) ->
│ │ │ +    subst(Str, Vars, []).
│ │ │  
│ │ │ -subst([$%, C| Rest], Vars, Result) when $A =< C, C =< $Z ->
│ │ │ -    subst_var([C| Rest], Vars, Result, []);
│ │ │ -subst([$%, C| Rest], Vars, Result) when $a =< C, C =< $z ->
│ │ │ -    subst_var([C| Rest], Vars, Result, []);
│ │ │ -subst([$%, C| Rest], Vars, Result) when  C == $_ ->
│ │ │ -    subst_var([C| Rest], Vars, Result, []);
│ │ │ -subst([C| Rest], Vars, Result) ->
│ │ │ -    subst(Rest, Vars, [C| Result]);
│ │ │ -subst([], _Vars, Result) ->
│ │ │ -    lists:reverse(Result).
│ │ │ -
│ │ │ -subst_var([$%| Rest], Vars, Result, VarAcc) ->
│ │ │ -    Key = lists:reverse(VarAcc),
│ │ │ -    case lists:keysearch(Key, 1, Vars) of
│ │ │ -        {value, {Key, Value}} ->
│ │ │ -            subst(Rest, Vars, lists:reverse(Value, Result));
│ │ │ +subst([$%, C| Rest], Vars, Result) when $A =< C, C =< $Z ->
│ │ │ +    subst_var([C| Rest], Vars, Result, []);
│ │ │ +subst([$%, C| Rest], Vars, Result) when $a =< C, C =< $z ->
│ │ │ +    subst_var([C| Rest], Vars, Result, []);
│ │ │ +subst([$%, C| Rest], Vars, Result) when  C == $_ ->
│ │ │ +    subst_var([C| Rest], Vars, Result, []);
│ │ │ +subst([C| Rest], Vars, Result) ->
│ │ │ +    subst(Rest, Vars, [C| Result]);
│ │ │ +subst([], _Vars, Result) ->
│ │ │ +    lists:reverse(Result).
│ │ │ +
│ │ │ +subst_var([$%| Rest], Vars, Result, VarAcc) ->
│ │ │ +    Key = lists:reverse(VarAcc),
│ │ │ +    case lists:keysearch(Key, 1, Vars) of
│ │ │ +        {value, {Key, Value}} ->
│ │ │ +            subst(Rest, Vars, lists:reverse(Value, Result));
│ │ │          false ->
│ │ │ -            subst(Rest, Vars, [$%| VarAcc ++ [$%| Result]])
│ │ │ +            subst(Rest, Vars, [$%| VarAcc ++ [$%| Result]])
│ │ │      end;
│ │ │ -subst_var([C| Rest], Vars, Result, VarAcc) ->
│ │ │ -    subst_var(Rest, Vars, Result, [C| VarAcc]);
│ │ │ -subst_var([], Vars, Result, VarAcc) ->
│ │ │ -    subst([], Vars, [VarAcc ++ [$%| Result]]).
│ │ │ -
│ │ │ -copy_file(Src, Dest) ->
│ │ │ -    copy_file(Src, Dest, []).
│ │ │ -
│ │ │ -copy_file(Src, Dest, Opts) ->
│ │ │ -    {ok,_} = file:copy(Src, Dest),
│ │ │ -    case lists:member(preserve, Opts) of
│ │ │ +subst_var([C| Rest], Vars, Result, VarAcc) ->
│ │ │ +    subst_var(Rest, Vars, Result, [C| VarAcc]);
│ │ │ +subst_var([], Vars, Result, VarAcc) ->
│ │ │ +    subst([], Vars, [VarAcc ++ [$%| Result]]).
│ │ │ +
│ │ │ +copy_file(Src, Dest) ->
│ │ │ +    copy_file(Src, Dest, []).
│ │ │ +
│ │ │ +copy_file(Src, Dest, Opts) ->
│ │ │ +    {ok,_} = file:copy(Src, Dest),
│ │ │ +    case lists:member(preserve, Opts) of
│ │ │          true ->
│ │ │ -            {ok, FileInfo} = file:read_file_info(Src),
│ │ │ -            file:write_file_info(Dest, FileInfo);
│ │ │ +            {ok, FileInfo} = file:read_file_info(Src),
│ │ │ +            file:write_file_info(Dest, FileInfo);
│ │ │          false ->
│ │ │              ok
│ │ │      end.
│ │ │  
│ │ │ -write_file(FName, Conts) ->
│ │ │ -    Enc = file:native_name_encoding(),
│ │ │ -    {ok, Fd} = file:open(FName, [write]),
│ │ │ -    file:write(Fd, unicode:characters_to_binary(Conts,Enc,Enc)),
│ │ │ -    file:close(Fd).
│ │ │ -
│ │ │ -read_txt_file(File) ->
│ │ │ -    {ok, Bin} = file:read_file(File),
│ │ │ -    {ok, binary_to_list(Bin)}.
│ │ │ -
│ │ │ -remove_dir_tree(Dir) ->
│ │ │ -    remove_all_files(".", [Dir]).
│ │ │ -
│ │ │ -remove_all_files(Dir, Files) ->
│ │ │ -    lists:foreach(fun(File) ->
│ │ │ -                          FilePath = filename:join([Dir, File]),
│ │ │ -                          case filelib:is_dir(FilePath) of
│ │ │ +write_file(FName, Conts) ->
│ │ │ +    Enc = file:native_name_encoding(),
│ │ │ +    {ok, Fd} = file:open(FName, [write]),
│ │ │ +    file:write(Fd, unicode:characters_to_binary(Conts,Enc,Enc)),
│ │ │ +    file:close(Fd).
│ │ │ +
│ │ │ +read_txt_file(File) ->
│ │ │ +    {ok, Bin} = file:read_file(File),
│ │ │ +    {ok, binary_to_list(Bin)}.
│ │ │ +
│ │ │ +remove_dir_tree(Dir) ->
│ │ │ +    remove_all_files(".", [Dir]).
│ │ │ +
│ │ │ +remove_all_files(Dir, Files) ->
│ │ │ +    lists:foreach(fun(File) ->
│ │ │ +                          FilePath = filename:join([Dir, File]),
│ │ │ +                          case filelib:is_dir(FilePath) of
│ │ │                                true ->
│ │ │ -                                  {ok, DirFiles} = file:list_dir(FilePath),
│ │ │ -                                  remove_all_files(FilePath, DirFiles),
│ │ │ -                                  file:del_dir(FilePath);
│ │ │ +                                  {ok, DirFiles} = file:list_dir(FilePath),
│ │ │ +                                  remove_all_files(FilePath, DirFiles),
│ │ │ +                                  file:del_dir(FilePath);
│ │ │                                _ ->
│ │ │ -                                  file:delete(FilePath)
│ │ │ +                                  file:delete(FilePath)
│ │ │                            end
│ │ │ -                  end, Files).
      
│ │ │ +                  end, Files).
      
│ │ │  
│ │ │  
│ │ │  
      
│ │ │    
      
│ │ │  
│ │ │        
│ │ │    Representation of Floating Point Numbers
│ │ │  
│ │ │  
      When working with floats you may not see what you expect when printing or doing
│ │ │  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
│ │ │  36028797018963968.0.
    For more information about floats and issues with them see:
    If you need to work with exact decimal fractions, for instance to represent
│ │ │  money, it is recommended to use a library that handles that, or work in
│ │ │  cents instead of dollars or euros so that decimal fractions are not needed.
    Also note that Erlang's floats do not exactly match IEEE 754 floats,
│ │ │  in that neither Inf nor NaN are supported in Erlang. Any
│ │ │ @@ -237,52 +237,52 @@
│ │ │  by eight are called binaries.
    Examples:
    1> <<10,20>>.
│ │ │  <<10,20>>
│ │ │  2> <<"ABC">>.
│ │ │  <<"ABC">>
│ │ │  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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Reference
│ │ │  
    
│ │ │  
    A term that is unique
│ │ │  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
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Fun
│ │ │  
    
│ │ │  
    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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Port Identifier
│ │ │  
    
│ │ │ @@ -300,94 +300,94 @@
│ │ │  for a new process after a while.
    The BIF self/0 returns the Pid of the calling process. When
│ │ │  creating a new process, the parent
│ │ │  process will be able to get the Pid of the child process either via the return
│ │ │  value, as is the case when calling the spawn/3 BIF, or via
│ │ │  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>
│ │ │  who_are_you
    Read more about processes in Processes.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    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
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Map
│ │ │  
    
│ │ │  
    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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    List
│ │ │  
    
│ │ │  
    A list is a compound data type with a variable number of terms.
    [Term1,...,TermN]
    Each term Term in the list is called an element. The number of elements is
│ │ │  said to be the length of the list.
    Formally, a list is either the empty list [] or consists of a head (first
│ │ │  element) and a tail (remainder of the list). The tail is also a list. The
│ │ │  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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    String
│ │ │  
    
│ │ │ @@ -507,41 +507,41 @@
│ │ │    Record
│ │ │  
│ │ │  
    A record is a data structure for storing a fixed number of elements. It has
│ │ │  named fields and is similar to a struct in C. However, a record is not a true
│ │ │  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) ->
│ │ │ -    #person{name=Name, age=Age}.
│ │ │ +new(Name, Age) ->
│ │ │ +    #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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Boolean
│ │ │  
    
│ │ │  
    There is no Boolean data type in Erlang. Instead the atoms true and false
│ │ │  are used to denote Boolean values. The is_boolean/1
│ │ │  BIF tests whether a term is a boolean.
    Examples:
    1> 2 =< 3.
│ │ │  true
│ │ │  2> true or false.
│ │ │  true
│ │ │ -3> is_boolean(true).
│ │ │ +3> is_boolean(true).
│ │ │  true
│ │ │ -4> is_boolean(false).
│ │ │ +4> is_boolean(false).
│ │ │  true
│ │ │ -5> is_boolean(ok).
│ │ │ +5> is_boolean(ok).
│ │ │  false
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Escape Sequences
│ │ │  
    
│ │ │  
    Within strings ("-delimited), quoted atoms, and the content of
│ │ │ @@ -559,47 +559,47 @@
│ │ │  ~b or ~s sigils the escape sequences for normal
│ │ │  strings, above, are used.
    Change
    Triple-quoted strings and sigils were introduced in Erlang/OTP 27.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Type Conversions
│ │ │  
    
│ │ │ -
    There are a number of BIFs for type conversions.
    Examples:
    1> atom_to_list(hello).
│ │ │ +
    There are a number of BIFs for type conversions.
    Examples:
    1> atom_to_list(hello).
│ │ │  "hello"
│ │ │ -2> list_to_atom("hello").
│ │ │ +2> list_to_atom("hello").
│ │ │  hello
│ │ │ -3> binary_to_list(<<"hello">>).
│ │ │ +3> binary_to_list(<<"hello">>).
│ │ │  "hello"
│ │ │ -4> binary_to_list(<<104,101,108,108,111>>).
│ │ │ +4> binary_to_list(<<104,101,108,108,111>>).
│ │ │  "hello"
│ │ │ -5> list_to_binary("hello").
│ │ │ -<<104,101,108,108,111>>
│ │ │ -6> float_to_list(7.0).
│ │ │ +5> list_to_binary("hello").
│ │ │ +<<104,101,108,108,111>>
│ │ │ +6> float_to_list(7.0).
│ │ │  "7.00000000000000000000e+00"
│ │ │ -7> list_to_float("7.000e+00").
│ │ │ +7> list_to_float("7.000e+00").
│ │ │  7.0
│ │ │ -8> integer_to_list(77).
│ │ │ +8> integer_to_list(77).
│ │ │  "77"
│ │ │ -9> list_to_integer("77").
│ │ │ +9> list_to_integer("77").
│ │ │  77
│ │ │ -10> tuple_to_list({a,b,c}).
│ │ │ -[a,b,c]
│ │ │ -11> list_to_tuple([a,b,c]).
│ │ │ -{a,b,c}
│ │ │ -12> term_to_binary({a,b,c}).
│ │ │ -<<131,104,3,100,0,1,97,100,0,1,98,100,0,1,99>>
│ │ │ -13> binary_to_term(<<131,104,3,100,0,1,97,100,0,1,98,100,0,1,99>>).
│ │ │ -{a,b,c}
│ │ │ -14> binary_to_integer(<<"77">>).
│ │ │ +10> tuple_to_list({a,b,c}).
│ │ │ +[a,b,c]
│ │ │ +11> list_to_tuple([a,b,c]).
│ │ │ +{a,b,c}
│ │ │ +12> term_to_binary({a,b,c}).
│ │ │ +<<131,104,3,100,0,1,97,100,0,1,98,100,0,1,99>>
│ │ │ +13> binary_to_term(<<131,104,3,100,0,1,97,100,0,1,98,100,0,1,99>>).
│ │ │ +{a,b,c}
│ │ │ +14> binary_to_integer(<<"77">>).
│ │ │  77
│ │ │ -15> integer_to_binary(77).
│ │ │ -<<"77">>
│ │ │ -16> float_to_binary(7.0).
│ │ │ -<<"7.00000000000000000000e+00">>
│ │ │ -17> binary_to_float(<<"7.000e+00">>).
│ │ │ +15> integer_to_binary(77).
│ │ │ +<<"77">>
│ │ │ +16> float_to_binary(7.0).
│ │ │ +<<"7.00000000000000000000e+00">>
│ │ │ +17> binary_to_float(<<"7.000e+00">>).
│ │ │  7.0
    
│ │ │  
│ │ │  
│ │ │  
    
│ │ │    
    
│ │ │  
│ │ │        
    -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
│ │ │  without changing the code using the interface functions.
    • The functionality of server can be extended without having to change ch2
│ │ │  or any other callback module.
    In ch1.erl and ch2.erl above, the implementation of channels/0, alloc/1,
│ │ │  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
│ │ │  efficiency is at the expense of generality. The ability to manage all
│ │ │  applications in the system in a consistent manner is important.
    Using behaviours also makes it easier to read and understand code written by
│ │ │  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}
    
│ │ │ +{ok,chs3}
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Applications
│ │ │  
    
│ │ │  
    Erlang/OTP comes with a number of components, each implementing some specific
│ │ │  functionality. Components are with Erlang/OTP terminology called applications.
│ │ ├── ./usr/share/doc/erlang-doc/html/doc/system/distributed.html
│ │ │ @@ -142,25 +142,25 @@
│ │ │  
│ │ │  
    A node is an executing Erlang runtime system that has been given a name, using
│ │ │  the command-line flag -name (long names) or
│ │ │  -sname (short names).
    The format of the node name is an atom name@host. name is the name given by
│ │ │  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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Node Connections
│ │ │  
    
│ │ ├── ./usr/share/doc/erlang-doc/html/doc/system/distributed_applications.html
│ │ │ @@ -150,36 +150,36 @@
│ │ │  (within the time-out specified by sync_nodes_timeout).
  • sync_nodes_timeout = integer() | infinity - Specifies how many milliseconds
│ │ │  to wait for the other nodes to start.
    • When started, the node waits for all nodes specified by sync_nodes_mandatory
│ │ │  and sync_nodes_optional to come up. When all nodes are up, or when all
│ │ │  mandatory nodes are up and the time specified by sync_nodes_timeout has
│ │ │  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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Starting and Stopping Distributed Applications
│ │ │  
    
│ │ │  
    When all involved (mandatory) nodes have been started, the distributed
│ │ │  application can be started by calling application:start(Application) at all
│ │ │  of these nodes.
    A boot script (see Releases) can be used that
│ │ │  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
│ │ │  calling application:start(myapp) at all three nodes. It is then started at
│ │ │  cp1, as shown in the following figure:
    Application myapp - Situation 1
    Similarly, the application must be stopped by calling
│ │ │  application:stop(Application) at all involved nodes.
    
│ │ │    
│ │ │ @@ -187,30 +187,30 @@
│ │ │    
│ │ │    Failover
│ │ │  
    
│ │ │  
    If the node where the application is running goes down, the application is
│ │ │  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.
│ │ │  myapp is now restarted on cp3.
    Application myapp - Situation 3
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Takeover
│ │ │  
    
│ │ │  
    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
│ │ │  executed at cp1 to start the application.
    Application myapp - Situation 5
    
│ │ │  
    
│ │ │  
│ │ │  
    
│ │ ├── ./usr/share/doc/erlang-doc/html/doc/system/documentation.html
│ │ │ @@ -112,23 +112,23 @@
│ │ │        
│ │ │  
│ │ │  
│ │ │      Documentation
│ │ │    
│ │ │  
│ │ │  
    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
│ │ │  user-defined types
│ │ │  (-type and -opaque) and
│ │ │  behaviour module attributes
│ │ │  (-callback).
    By default the format used for documentation attributes is
│ │ │ @@ -140,55 +140,55 @@
│ │ │  Documentation Attributes.
    -doc attributes have been available since Erlang/OTP 27.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    External documentation files
│ │ │  
    
│ │ │  
    The -moduledoc and -doc can also be placed in external files. To do so use
│ │ │  -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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Documenting a module
│ │ │  
    
│ │ │  
    The module description should include details on how to use the API and examples
│ │ │  of the different functions working together. Here is a good place to use images
│ │ │  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.
│ │ │  
│ │ │     This module can be used to add and subtract values. For example:
│ │ │  
│ │ │     ```erlang
│ │ │     1> arith:substract(arith:add(2, 3), 1).
│ │ │ @@ -203,94 +203,94 @@
│ │ │  
    There are three reserved metadata keys for -moduledoc:
    • since - Shows in which version of the application the module was added.
│ │ │  If this is added, all functions, types, and callbacks within will also receive
│ │ │  the same since value unless specified in the metadata of the function, type
│ │ │  or callback.
    • deprecated - Shows a text in the documentation explaining that it is
│ │ │  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 #{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."}.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Documenting functions, user-defined types, and callbacks
│ │ │  
    
│ │ │  
    Functions, types, and callbacks can be documented using the -doc attribute.
│ │ │  Each entry should start with a short paragraph describing the purpose of entity,
│ │ │  and then go into greater detail in needed.
    It is not recommended to include images or diagrams in this documentation as it
│ │ │  is used by IDEs and c:h/1 to show the documentation to the user.
    For example:
    -doc """
│ │ │  A number that can be used by the arith module.
│ │ │  
│ │ │  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.
│ │ │  
│ │ │  ### Example:
│ │ │  
│ │ │  ```
│ │ │  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}.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Doc metadata
│ │ │  
    
│ │ │  
    There are four reserved metadata keys for -doc:
    • since => unicode:chardata() - Shows which version of the application the
│ │ │  module was added.
    • deprecated => unicode:chardata() - Shows a text in the documentation
│ │ │  explaining that it is deprecated and what to use instead. The compiler will
│ │ │  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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Doc signatures
│ │ │  
    
│ │ │  
    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
│ │ │  declaration up until the ->. For example:
    -doc """
│ │ │  add(One, Two)
│ │ │  
│ │ │  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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Compiling and getting documentation
│ │ │ @@ -375,21 +375,21 @@
│ │ │    Using ExDoc to generate HTML/ePub documentation
│ │ │  
    
│ │ │  
    ExDoc has built-in support to generate
│ │ │  documentation from Markdown. The simplest way is by using the
│ │ │  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"]},
│ │ │ -  {main, "README.md"},
│ │ │ -  {source_url, "https://github.com/namespace/your_app"}
│ │ │ -]}.
    When configured you can run rebar3 ex_doc to generate the
│ │ │ +{ex_doc, [
│ │ │ +  {extras, ["README.md"]},
│ │ │ +  {main, "README.md"},
│ │ │ +  {source_url, "https://github.com/namespace/your_app"}
│ │ │ +]}.
    When configured you can run rebar3 ex_doc to generate the
│ │ │  documentation to doc/index.html. For more details and options see
│ │ │  the rebar3_ex_doc documentation.
    You can also download the
│ │ │  release escript bundle from
│ │ │  github and run it from the command line. The documentation for using the escript
│ │ │  is found by running ex_doc --help.
    If you are writing documentation that will be using
│ │ │  ExDoc to generate HTML/ePub it is highly
│ │ │  recommended to read its documentation.
    
│ │ ├── ./usr/share/doc/erlang-doc/html/doc/system/drivers.html
│ │ │ @@ -122,23 +122,23 @@
│ │ │    Drivers and Concurrency
│ │ │  
│ │ │  
    The runtime system always takes a lock before running any code in a driver.
    By default, that lock is at the driver level, that is, if several ports have
│ │ │  been opened to the same driver, only code for one port at the same time can be
│ │ │  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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Avoiding Copying Binaries When Calling a Driver
│ │ │  
    
│ │ │  
    There are basically two ways to avoid copying a binary that is sent to a driver:
    • If the Data argument for port_control/3 is a
│ │ ├── ./usr/share/doc/erlang-doc/html/doc/system/eff_guide_functions.html
│ │ │ @@ -122,67 +122,67 @@
│ │ │    Pattern Matching
│ │ │  
│ │ │  
      Pattern matching in function head as well as in case and receive clauses are
│ │ │  optimized by the compiler. With a few exceptions, there is nothing to gain by
│ │ │  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:
      • First, the input value is compared to one, two, and three (using a
│ │ │  single instruction that does a binary search; thus, quite efficient even if
│ │ │  there are many values) to select which one of the first three clauses to
│ │ │  execute (if any).
      • If none of the first three clauses match, the fourth clause match as a
│ │ │  variable always matches.
      • If the guard test is_integer(Int) succeeds, the fourth
│ │ │  clause is executed.
      • If the guard test fails, the input value is compared to four, five, and
│ │ │  six, and the appropriate clause is selected. (There is a function_clause
│ │ │ -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) ->
│ │ │ +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
│ │ │  better type for the Xs variable.)
    
│ │ │    
│ │ │      
│ │ │    
│ │ ├── ./usr/share/doc/erlang-doc/html/doc/system/eff_guide_processes.html
│ │ │ @@ -119,45 +119,45 @@
│ │ │    
│ │ │      
│ │ │    
│ │ │    Creating an Erlang Process
│ │ │  
    
│ │ │  
    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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Initial Heap Size
│ │ │  
    
│ │ │  
    The default initial heap size of 233 words is quite conservative to support
│ │ │ @@ -189,30 +189,30 @@
│ │ │      
│ │ │    
│ │ │    Receiving messages
│ │ │  
│ │ │  
    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
│ │ │  said reference, it will tell the emulator to search only the messages that
│ │ │  arrived after the call to monitor/2.
    The above is a simple example where one is but guaranteed that the optimization
│ │ │  will take, but what about more complicated code?
    
│ │ │    
│ │ │ @@ -228,101 +228,101 @@
│ │ │  efficiency_guide.erl:200: Warning: NOT OPTIMIZED: all clauses do not match a suitable reference
│ │ │  efficiency_guide.erl:206: Warning: OPTIMIZED: reference used to mark a message queue position
│ │ │  efficiency_guide.erl:208: Warning: OPTIMIZED: all clauses match reference created by monitor/2 at efficiency_guide.erl:206
│ │ │  efficiency_guide.erl:219: Warning: INFO: passing reference created by make_ref/0 at efficiency_guide.erl:218
│ │ │  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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Literal Pool
│ │ │  
    
│ │ │  
    Constant Erlang terms (hereafter called literals) are kept in literal pools;
│ │ │  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
│ │ │  processes that hold references to that literal.
    There also exists a global literal pool that is managed by the
│ │ │  persistent_term module.
    By default, 1 GB of virtual address space is reserved for all literal pools (in
│ │ │  BEAM code and persistent terms). The amount of virtual address space reserved
│ │ │  for literals can be changed by using the
│ │ │  +MIscs option when starting the emulator.
    Here is an example how the reserved virtual address space for literals can be
│ │ │  raised to 2 GB (2048 MB):
    erl +MIscs 2048
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    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
│ │ │ -6> erts_debug:size(element(2, hd(ets:lookup(T, key)))).
│ │ │ +6> erts_debug:size(element(2, hd(ets:lookup(T, key)))).
│ │ │  4094
│ │ │ -7> erts_debug:flat_size(element(2, hd(ets:lookup(T, key)))).
│ │ │ +7> erts_debug:flat_size(element(2, hd(ets:lookup(T, key)))).
│ │ │  4094
    When the data has passed through an Ets table, erts_debug:size/1 and
│ │ │  erts_debug:flat_size/1 return the same value. Sharing has been lost.
    It is possible to build an experimental variant of the runtime system that
│ │ │  will preserve sharing when copying terms by giving the
│ │ │  --enable-sharing-preserving option to the configure script.
    
│ │ │    
│ │ │      
│ │ │    
│ │ ├── ./usr/share/doc/erlang-doc/html/doc/system/erl_interface.html
│ │ │ @@ -120,119 +120,119 @@
│ │ │  to read the port example in Ports before reading this section.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    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
│ │ │  to handle these two tuples.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │ @@ -362,27 +362,27 @@
│ │ │      -L/usr/local/otp/lib/erl_interface-3.9.2/lib \
│ │ │      complex.c erl_comm.c ei.c -lei -lpthread
    In Erlang/OTP R5B and later versions of OTP, the include and lib directories
│ │ │  are situated under $OTPROOT/lib/erl_interface-VSN, where $OTPROOT is the
│ │ │  root directory of the OTP installation (/usr/local/otp in the recent example)
│ │ │  and VSN is the version of the Erl_interface application (3.2.1 in the recent
│ │ │  example).
    In R4B and earlier versions of OTP, include and lib are situated under
│ │ │  $OTPROOT/usr.
    Step 2. Start Erlang and compile the Erlang code:
    $ erl
│ │ │ -Erlang/OTP 26 [erts-14.2] [source] [64-bit] [smp:8:8] [ds:8:8:10] [async-threads:1] [jit:ns]
│ │ │ +Erlang/OTP 26 [erts-14.2] [source] [64-bit] [smp:8:8] [ds:8:8:10] [async-threads:1] [jit:ns]
│ │ │  
│ │ │ -Eshell V14.2 (press Ctrl+G to abort, type help(). for help)
│ │ │ -1> c(complex2).
│ │ │ -{ok,complex2}
    Step 3. Run the example:
    2> complex2:start("./extprg").
│ │ │ +Eshell V14.2 (press Ctrl+G to abort, type help(). for help)
│ │ │ +1> c(complex2).
│ │ │ +{ok,complex2}
    Step 3. Run the example:
    2> complex2:start("./extprg").
│ │ │  <0.34.0>
│ │ │ -3> complex2:foo(3).
│ │ │ +3> complex2:foo(3).
│ │ │  4
│ │ │ -4> complex2:bar(5).
│ │ │ +4> complex2:bar(5).
│ │ │  10
│ │ │ -5> complex2:bar(352).
│ │ │ +5> complex2:bar(352).
│ │ │  704
│ │ │ -6> complex2:stop().
│ │ │ +6> complex2:stop().
│ │ │  stop
    
│ │ │  
│ │ │  
│ │ │  
    
│ │ │    
    
│ │ │  
│ │ │        
    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
│ │ │      started_at: nonode@nohost
│ │ │  =PROGRESS REPORT==== 8-Jun-2018::16:54:19.922908 ===
│ │ │      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>
    
│ │ │  
    
│ │ │  
│ │ │  
    
│ │ │    
    
│ │ │  
│ │ │        try expression can
│ │ │  distinguish between the different classes, whereas the
│ │ │  catch expression cannot. try and catch are described
│ │ │  in Expressions.
    ClassOrigin
    errorRun-time error, for example, 1+a, or the process called error/1
    exitThe process called exit/1
    throwThe process called throw/1
    Table: Exception Classes.
    All of the above exceptions can also be generated by calling erlang:raise/3.
    An exception consists of its class, an exit reason (see
│ │ │  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,[]},
│ │ │ + ...]
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    The call-stack back trace (stacktrace)
│ │ │  
    
│ │ │  
    The stack back-trace (stacktrace) is a list that
│ │ │  contains {Module, Function, Arity, ExtraInfo} and/or {Fun, Arity, ExtraInfo}
│ │ ├── ./usr/share/doc/erlang-doc/html/doc/system/events.html
│ │ │ @@ -135,43 +135,43 @@
│ │ │  event handler.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Starting an Event Manager
│ │ │  
    
│ │ │  
    To start an event manager for handling errors, as described in the previous
│ │ │  example, call the following function:
    gen_event:start_link({local, error_man})
    gen_event:start_link/1 spawns and links to a new event manager process.
    The argument, {local, error_man}, specifies the name under which the
│ │ │ @@ -184,57 +184,57 @@
│ │ │  manager that is not part of a supervision tree.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    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}.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Notifying about Events
│ │ │  
    
│ │ │  
    3> gen_event:notify(error_man, no_reply).
│ │ │  ***Error*** no_reply
│ │ │  ok
    error_man is the name of the event manager and no_reply is the event.
    The event is made into a message and sent to the event manager. When the event
│ │ │  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).
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Stopping
│ │ │  
    
│ │ │  
    When an event manager is stopped, it gives each of the installed event handlers
│ │ │  the chance to clean up by calling terminate/2, the same way as when deleting a
│ │ │ @@ -249,33 +249,33 @@
│ │ │  this is done is defined by a shutdown strategy set in
│ │ │  the supervisor.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    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
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Handling Other Messages
│ │ │  
    
│ │ │  
    If the gen_event process is to be able to receive other messages
│ │ │  than events, the callback function handle_info(Info, State) must be
│ │ │  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}.
    
│ │ │  
    
│ │ │  
│ │ │  
    pattern matching. Erlang uses
│ │ │  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
│ │ │  the expression are always unsafe outside the expression.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    The Compound Pattern Operator
│ │ │  
    
│ │ │  
    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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    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} -> ...
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    The Match Operator
│ │ │  
    
│ │ │  
    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,
│ │ │     .
│ │ │     .
│ │ │     .,
│ │ │  Pattern2 = Temporary,
│ │ │ @@ -239,30 +239,30 @@
│ │ │  can safely be skipped on a first reading.
    The = character is used to denote two similar but distinct operators: the
│ │ │  match operator and the compound pattern operator. Which one is meant is
│ │ │  determined by context.
    The compound pattern operator is used to construct a compound pattern from two
│ │ │  patterns. Compound patterns are accepted everywhere a pattern is accepted. A
│ │ │  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.
│ │ │ +5> <<X:Y>> = begin Y = 8, <<42:8>> end, X.
│ │ │  42
    The expression at prompt 2> first matches the value of variable M against
│ │ │  pattern #{key := Key}, binding variable Key. It then matches the value of
│ │ │  M against pattern #{Key := Value} using variable Key as the key, binding
│ │ │  variable Value.
    The expression at prompt 3> matches expression (#{key := Key} = M) against
│ │ │  pattern #{Key := Value}. The expression inside the parentheses is evaluated
│ │ │  first. That is, M is matched against #{key := Key}, and then the value of
│ │ │  M is matched against pattern #{Key := Value}. That is the same evaluation
│ │ │ @@ -276,30 +276,30 @@
│ │ │  binding variable Y and creating a binary. The binary is then matched against
│ │ │  pattern <<X:Y>> using the value of Y as the size of the segment.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    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
│ │ │  Compilation and Code Loading and
│ │ │  Function Evaluation.
    
│ │ │    
│ │ │      
│ │ │ @@ -316,40 +316,40 @@
│ │ │  called instead. This is to avoid that future additions to the set of
│ │ │  auto-imported BIFs do not silently change the behavior of old code.
    However, to avoid that old (pre R14) code changed its behavior when compiled
│ │ │  with Erlang/OTP version R14A or later, the following restriction applies: If you
│ │ │  override the name of a BIF that was auto-imported in OTP versions prior to R14A
│ │ │  (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
│ │ │  qualified function name.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │ @@ -361,40 +361,40 @@
│ │ │      ...;
│ │ │      GuardSeqN ->
│ │ │          BodyN
│ │ │  end
    The branches of an if-expression are scanned sequentially until a guard
│ │ │  sequence GuardSeq that evaluates to true is found. Then the corresponding
│ │ │  Body (a sequence of expressions separated by ,) is evaluated.
    The return value of Body is the return value of the if expression.
    If no guard sequence is evaluated as true, an if_clause run-time error occurs.
│ │ │  If necessary, the guard expression true can be used in the last branch, as
│ │ │ -that guard sequence is always true.
    Example:
    is_greater_than(X, Y) ->
│ │ │ +that guard sequence is always true.
    Example:
    is_greater_than(X, Y) ->
│ │ │      if
│ │ │          X > Y ->
│ │ │              true;
│ │ │          true -> % works as an 'else' branch
│ │ │              false
│ │ │      end
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Case
│ │ │  
    
│ │ │  
    case Expr of
│ │ │ -    Pattern1 [when GuardSeq1] ->
│ │ │ +    Pattern1 [when GuardSeq1] ->
│ │ │          Body1;
│ │ │      ...;
│ │ │ -    PatternN [when GuardSeqN] ->
│ │ │ +    PatternN [when GuardSeqN] ->
│ │ │          BodyN
│ │ │  end
    The expression Expr is evaluated and the patterns Pattern are sequentially
│ │ │  matched against the result. If a match succeeds and the optional guard sequence
│ │ │  GuardSeq is true, the corresponding Body is evaluated.
    The return value of Body is the return value of the case expression.
    If there is no matching pattern with a true guard sequence, a case_clause
│ │ │ -run-time error occurs.
    Example:
    is_valid_signal(Signal) ->
│ │ │ +run-time error occurs.
    Example:
    is_valid_signal(Signal) ->
│ │ │      case Signal of
│ │ │ -        {signal, _What, _From, _To} ->
│ │ │ +        {signal, _What, _From, _To} ->
│ │ │              true;
│ │ │ -        {signal, _What, _To} ->
│ │ │ +        {signal, _What, _To} ->
│ │ │              true;
│ │ │          _Else ->
│ │ │              false
│ │ │      end.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │ @@ -412,57 +412,57 @@
│ │ │  the top-level of a maybe block. It matches the pattern Expr1 against
│ │ │  Expr2. If the matching succeeds, any unbound variable in the pattern becomes
│ │ │  bound. If the expression is the last expression in the maybe block, it also
│ │ │  returns the value of Expr2. If the matching is unsuccessful, the rest of the
│ │ │  expressions in the maybe block are skipped and the return value of the maybe
│ │ │  block is Expr2.
    None of the variables bound in a maybe block must be used in the code that
│ │ │  follows the block.
    Here is an example:
    maybe
│ │ │ -    {ok, A} ?= a(),
│ │ │ +    {ok, A} ?= a(),
│ │ │      true = A >= 0,
│ │ │ -    {ok, B} ?= b(),
│ │ │ +    {ok, B} ?= b(),
│ │ │      A + B
│ │ │  end
    Let us first assume that a() returns {ok,42} and b() returns {ok,58}.
│ │ │  With those return values, all of the match operators will succeed, and the
│ │ │  return value of the maybe block is A + B, which is equal to 42 + 58 = 100.
    Now let us assume that a() returns error. The conditional match operator in
│ │ │  {ok, A} ?= a() fails to match, and the return value of the maybe block is
│ │ │  the value of the expression that failed to match, namely error. Similarly, if
│ │ │  b() returns wrong, the return value of the maybe block is wrong.
    Finally, let us assume that a() returns {ok,-1}. Because true = A >= 0 uses
│ │ │  the match operator =, a {badmatch,false} run-time error occurs when the
│ │ │ -expression fails to match the pattern.
    The example can be written in a less succient way using nested case expressions:
    case a() of
│ │ │ -    {ok, A} ->
│ │ │ +expression fails to match the pattern.
    The example can be written in a less succient way using nested case expressions:
    case a() of
│ │ │ +    {ok, A} ->
│ │ │          true = A >= 0,
│ │ │ -        case b() of
│ │ │ -            {ok, B} ->
│ │ │ +        case b() of
│ │ │ +            {ok, B} ->
│ │ │                  A + B;
│ │ │              Other1 ->
│ │ │                  Other1
│ │ │          end;
│ │ │      Other2 ->
│ │ │          Other2
│ │ │  end
    The maybe block can be augmented with else clauses:
    maybe
│ │ │      Expr1,
│ │ │      ...,
│ │ │      ExprN
│ │ │  else
│ │ │ -    Pattern1 [when GuardSeq1] ->
│ │ │ +    Pattern1 [when GuardSeq1] ->
│ │ │          Body1;
│ │ │      ...;
│ │ │ -    PatternN [when GuardSeqN] ->
│ │ │ +    PatternN [when GuardSeqN] ->
│ │ │          BodyN
│ │ │  end
    If a conditional match operator fails, the failed expression is matched against
│ │ │  the patterns in all clauses between the else and end keywords. If a match
│ │ │  succeeds and the optional guard sequence GuardSeq is true, the corresponding
│ │ │  Body is evaluated. The value returned from the body is the return value of the
│ │ │  maybe block.
    If there is no matching pattern with a true guard sequence, an else_clause
│ │ │  run-time error occurs.
    None of the variables bound in a maybe block must be used in the else
│ │ │  clauses. None of the variables bound in the else clauses must be used in the
│ │ │  code that follows the maybe block.
    Here is the previous example augmented with else clauses:
    maybe
│ │ │ -    {ok, A} ?= a(),
│ │ │ +    {ok, A} ?= a(),
│ │ │      true = A >= 0,
│ │ │ -    {ok, B} ?= b(),
│ │ │ +    {ok, B} ?= b(),
│ │ │      A + B
│ │ │  else
│ │ │      error -> error;
│ │ │      wrong -> error
│ │ │  end
    The else clauses translate the failing value from the conditional match
│ │ │  operators to the value error. If the failing value is not one of the
│ │ │  recognized values, a else_clause run-time error occurs.
    
│ │ │ @@ -481,75 +481,75 @@
│ │ │  {Name,Node} (or a pid located at another node), also never fails.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Receive
│ │ │  
    
│ │ │  
    receive
│ │ │ -    Pattern1 [when GuardSeq1] ->
│ │ │ +    Pattern1 [when GuardSeq1] ->
│ │ │          Body1;
│ │ │      ...;
│ │ │ -    PatternN [when GuardSeqN] ->
│ │ │ +    PatternN [when GuardSeqN] ->
│ │ │          BodyN
│ │ │  end
    Fetches a received message present in the message queue of the process. The
│ │ │  first message in the message queue is matched sequentially against the patterns
│ │ │  from top to bottom. If no match was found, the matching sequence is repeated for
│ │ │  the second message in the queue, and so on. Messages are queued in the
│ │ │  order they were received. If a match
│ │ │  succeeds, that is, if the Pattern matches and the optional guard sequence
│ │ │  GuardSeq is true, then the message is removed from the message queue and the
│ │ │  corresponding Body is evaluated. All other messages in the message queue
│ │ │  remain unchanged.
    The return value of Body is the return value of the receive expression.
    receive never fails. The execution is suspended, possibly indefinitely, until
│ │ │  a message arrives that matches one of the patterns and with a true guard
│ │ │ -sequence.
    Example:
    wait_for_onhook() ->
│ │ │ +sequence.
    Example:
    wait_for_onhook() ->
│ │ │      receive
│ │ │          onhook ->
│ │ │ -            disconnect(),
│ │ │ -            idle();
│ │ │ -        {connect, B} ->
│ │ │ -            B ! {busy, self()},
│ │ │ -            wait_for_onhook()
│ │ │ +            disconnect(),
│ │ │ +            idle();
│ │ │ +        {connect, B} ->
│ │ │ +            B ! {busy, self()},
│ │ │ +            wait_for_onhook()
│ │ │      end.
    The receive expression can be augmented with a timeout:
    receive
│ │ │ -    Pattern1 [when GuardSeq1] ->
│ │ │ +    Pattern1 [when GuardSeq1] ->
│ │ │          Body1;
│ │ │      ...;
│ │ │ -    PatternN [when GuardSeqN] ->
│ │ │ +    PatternN [when GuardSeqN] ->
│ │ │          BodyN
│ │ │  after
│ │ │      ExprT ->
│ │ │          BodyT
│ │ │  end
    receive...after works exactly as receive, except that if no matching message
│ │ │  has arrived within ExprT milliseconds, then BodyT is evaluated instead. The
│ │ │  return value of BodyT then becomes the return value of the receive...after
│ │ │  expression. ExprT is to evaluate to an integer, or the atom infinity. The
│ │ │  allowed integer range is from 0 to 4294967295, that is, the longest possible
│ │ │  timeout is almost 50 days. With a zero value the timeout occurs immediately if
│ │ │  there is no matching message in the message queue.
    The atom infinity will make the process wait indefinitely for a matching
│ │ │  message. This is the same as not using a timeout. It can be useful for timeout
│ │ │ -values that are calculated at runtime.
    Example:
    wait_for_onhook() ->
│ │ │ +values that are calculated at runtime.
    Example:
    wait_for_onhook() ->
│ │ │      receive
│ │ │          onhook ->
│ │ │ -            disconnect(),
│ │ │ -            idle();
│ │ │ -        {connect, B} ->
│ │ │ -            B ! {busy, self()},
│ │ │ -            wait_for_onhook()
│ │ │ +            disconnect(),
│ │ │ +            idle();
│ │ │ +        {connect, B} ->
│ │ │ +            B ! {busy, self()},
│ │ │ +            wait_for_onhook()
│ │ │      after
│ │ │          60000 ->
│ │ │ -            disconnect(),
│ │ │ -            error()
│ │ │ +            disconnect(),
│ │ │ +            error()
│ │ │      end.
    It is legal to use a receive...after expression with no branches:
    receive
│ │ │  after
│ │ │      ExprT ->
│ │ │          BodyT
│ │ │  end
    This construction does not consume any messages, only suspends execution in the
│ │ │ -process for ExprT milliseconds. This can be used to implement simple timers.
    Example:
    timer() ->
│ │ │ -    spawn(m, timer, [self()]).
│ │ │ +process for ExprT milliseconds. This can be used to implement simple timers.
    Example:
    timer() ->
│ │ │ +    spawn(m, timer, [self()]).
│ │ │  
│ │ │ -timer(Pid) ->
│ │ │ +timer(Pid) ->
│ │ │      receive
│ │ │      after
│ │ │          5000 ->
│ │ │              Pid ! timeout
│ │ │      end.
    For more information on timers in Erlang in general, see the
│ │ │  Timers section of the
│ │ │  Time and Time Correction in Erlang
│ │ │ @@ -591,21 +591,21 @@
│ │ │  false
│ │ │  4> 0.0 =:= -0.0.
│ │ │  false
│ │ │  5> 0.0 =:= +0.0.
│ │ │  true
│ │ │  6> 1 > a.
│ │ │  false
│ │ │ -7> #{c => 3} > #{a => 1, b => 2}.
│ │ │ +7> #{c => 3} > #{a => 1, b => 2}.
│ │ │  false
│ │ │ -8> #{a => 1, b => 2} == #{a => 1.0, b => 2.0}.
│ │ │ +8> #{a => 1, b => 2} == #{a => 1.0, b => 2.0}.
│ │ │  true
│ │ │ -9> <<2:2>> < <<128>>.
│ │ │ +9> <<2:2>> < <<128>>.
│ │ │  true
│ │ │ -10> <<3:2>> < <<128>>.
│ │ │ +10> <<3:2>> < <<128>>.
│ │ │  false
    Note
    Prior to OTP 27, the term equivalence operators considered 0.0
│ │ │  and -0.0 to be the same term.
    This was changed in OTP 27 but legacy code may have expected them to be
│ │ │  considered the same. To help users catch errors that may arise from an
│ │ │  upgrade, the compiler raises a warning when 0.0 is pattern-matched or used
│ │ │  in a term equivalence test.
    If you need to match 0.0 specifically, the warning can be silenced by
│ │ │  writing +0.0 instead, which produces the same term but makes the compiler
│ │ │  interpret the match as being done on purpose.
    
│ │ │ @@ -631,15 +631,15 @@
│ │ │  0
│ │ │  8> 2#10 bor 2#01.
│ │ │  3
│ │ │  9> a + 10.
│ │ │  ** exception error: an error occurred when evaluating an arithmetic expression
│ │ │       in operator  +/2
│ │ │          called as a + 10
│ │ │ -10> 1 bsl (1 bsl 64).
│ │ │ +10> 1 bsl (1 bsl 64).
│ │ │  ** exception error: a system limit has been reached
│ │ │       in operator  bsl/2
│ │ │          called as 1 bsl 18446744073709551616
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Boolean Expressions
│ │ │ @@ -658,136 +658,136 @@
│ │ │    
│ │ │      
│ │ │    
│ │ │    Short-Circuit Expressions
│ │ │  
    
│ │ │  
    Expr1 orelse Expr2
│ │ │  Expr1 andalso Expr2
    Expr2 is evaluated only if necessary. That is, Expr2 is evaluated only if:
    • Expr1 evaluates to false in an orelse expression.
    or
    • Expr1 evaluates to true in an andalso expression.
    Returns either the value of Expr1 (that is, true or false) or the value of
│ │ │ -Expr2 (if Expr2 is evaluated).
    Example 1:
    case A >= -1.0 andalso math:sqrt(A+1) > B of
    This works even if A is less than -1.0, since in that case, math:sqrt/1 is
│ │ │ -never evaluated.
    Example 2:
    OnlyOne = is_atom(L) orelse
│ │ │ -         (is_list(L) andalso length(L) == 1),
    Expr2 is not required to evaluate to a Boolean value. Because of that,
│ │ │ -andalso and orelse are tail-recursive.
    Example 3 (tail-recursive function):
    all(Pred, [Hd|Tail]) ->
│ │ │ -    Pred(Hd) andalso all(Pred, Tail);
│ │ │ -all(_, []) ->
│ │ │ +Expr2 (if Expr2 is evaluated).
    Example 1:
    case A >= -1.0 andalso math:sqrt(A+1) > B of
    This works even if A is less than -1.0, since in that case, math:sqrt/1 is
│ │ │ +never evaluated.
    Example 2:
    OnlyOne = is_atom(L) orelse
│ │ │ +         (is_list(L) andalso length(L) == 1),
    Expr2 is not required to evaluate to a Boolean value. Because of that,
│ │ │ +andalso and orelse are tail-recursive.
    Example 3 (tail-recursive function):
    all(Pred, [Hd|Tail]) ->
│ │ │ +    Pred(Hd) andalso all(Pred, Tail);
│ │ │ +all(_, []) ->
│ │ │      true.
    Change
    Before Erlang/OTP R13A, Expr2 was required to evaluate to a Boolean value,
│ │ │  and as consequence, andalso and orelse were not tail-recursive.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    List Operations
│ │ │  
    
│ │ │  
    Expr1 ++ Expr2
│ │ │  Expr1 -- Expr2
    The list concatenation operator ++ appends its second argument to its first
│ │ │  and returns the resulting list.
    The list subtraction operator -- produces a list that is a copy of the first
│ │ │  argument. The procedure is as follows: for each element in the second argument,
│ │ │ -the first occurrence of this element (if any) is removed.
    Example:
    1> [1,2,3] ++ [4,5].
│ │ │ -[1,2,3,4,5]
│ │ │ -2> [1,2,3,2,1,2] -- [2,1,2].
│ │ │ -[3,1,2]
    
│ │ │ +the first occurrence of this element (if any) is removed.
    Example:
    1> [1,2,3] ++ [4,5].
│ │ │ +[1,2,3,4,5]
│ │ │ +2> [1,2,3,2,1,2] -- [2,1,2].
│ │ │ +[3,1,2]
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Map Expressions
│ │ │  
    
│ │ │  
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Creating Maps
│ │ │  
    
│ │ │  
    Constructing a new map is done by letting an expression K be associated with
│ │ │ -another expression V:
    #{K => V}
    New maps can include multiple associations at construction by listing every
│ │ │ -association:
    #{K1 => V1, ..., Kn => Vn}
    An empty map is constructed by not associating any terms with each other:
    #{}
    All keys and values in the map are terms. Any expression is first evaluated and
│ │ │ +another expression V:
    #{K => V}
    New maps can include multiple associations at construction by listing every
│ │ │ +association:
    #{K1 => V1, ..., Kn => Vn}
    An empty map is constructed by not associating any terms with each other:
    #{}
    All keys and values in the map are terms. Any expression is first evaluated and
│ │ │  then the resulting terms are used as key and value respectively.
    Keys and values are separated by the => arrow and associations are separated
│ │ │ -by a comma (,).
    Examples:
    M0 = #{},                 % empty map
│ │ │ -M1 = #{a => <<"hello">>}, % single association with literals
│ │ │ -M2 = #{1 => 2, b => b},   % multiple associations with literals
│ │ │ -M3 = #{k => {A,B}},       % single association with variables
│ │ │ -M4 = #{{"w", 1} => f()}.  % compound key associated with an evaluated expression
    Here, A and B are any expressions and M0 through M4 are the resulting
│ │ │ -map terms.
    If two matching keys are declared, the latter key takes precedence.
    Example:
    1> #{1 => a, 1 => b}.
│ │ │ -#{1 => b }
│ │ │ -2> #{1.0 => a, 1 => b}.
│ │ │ -#{1 => b, 1.0 => a}
    The order in which the expressions constructing the keys (and their associated
│ │ │ +by a comma (,).
    Examples:
    M0 = #{},                 % empty map
│ │ │ +M1 = #{a => <<"hello">>}, % single association with literals
│ │ │ +M2 = #{1 => 2, b => b},   % multiple associations with literals
│ │ │ +M3 = #{k => {A,B}},       % single association with variables
│ │ │ +M4 = #{{"w", 1} => f()}.  % compound key associated with an evaluated expression
    Here, A and B are any expressions and M0 through M4 are the resulting
│ │ │ +map terms.
    If two matching keys are declared, the latter key takes precedence.
    Example:
    1> #{1 => a, 1 => b}.
│ │ │ +#{1 => b }
│ │ │ +2> #{1.0 => a, 1 => b}.
│ │ │ +#{1 => b, 1.0 => a}
    The order in which the expressions constructing the keys (and their associated
│ │ │  values) are evaluated is not defined. The syntactic order of the key-value pairs
│ │ │  in the construction is of no relevance, except in the recently mentioned case of
│ │ │  two matching keys.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Updating Maps
│ │ │  
    
│ │ │  
    Updating a map has a similar syntax as constructing it.
    An expression defining the map to be updated is put in front of the expression
│ │ │ -defining the keys to be updated and their respective values:
    M#{K => V}
    Here M is a term of type map and K and V are any expression.
    If key K does not match any existing key in the map, a new association is
│ │ │ +defining the keys to be updated and their respective values:
    M#{K => V}
    Here M is a term of type map and K and V are any expression.
    If key K does not match any existing key in the map, a new association is
│ │ │  created from key K to value V.
    If key K matches an existing key in map M, its associated value is replaced
│ │ │  by the new value V. In both cases, the evaluated map expression returns a new
│ │ │ -map.
    If M is not of type map, an exception of type badmap is raised.
    To only update an existing value, the following syntax is used:
    M#{K := V}
    Here M is a term of type map, V is an expression and K is an expression
│ │ │ +map.
    If M is not of type map, an exception of type badmap is raised.
    To only update an existing value, the following syntax is used:
    M#{K := V}
    Here M is a term of type map, V is an expression and K is an expression
│ │ │  that evaluates to an existing key in M.
    If key K does not match any existing keys in map M, an exception of type
│ │ │  badkey is raised at runtime. If a matching key K is present in map M,
│ │ │  its associated value is replaced by the new value V, and the evaluated map
│ │ │ -expression returns a new map.
    If M is not of type map, an exception of type badmap is raised.
    Examples:
    M0 = #{},
│ │ │ -M1 = M0#{a => 0},
│ │ │ -M2 = M1#{a => 1, b => 2},
│ │ │ -M3 = M2#{"function" => fun() -> f() end},
│ │ │ -M4 = M3#{a := 2, b := 3}.  % 'a' and 'b' was added in `M1` and `M2`.
    Here M0 is any map. It follows that M1 through M4 are maps as well.
    More examples:
    1> M = #{1 => a}.
│ │ │ -#{1 => a }
│ │ │ -2> M#{1.0 => b}.
│ │ │ -#{1 => a, 1.0 => b}.
│ │ │ -3> M#{1 := b}.
│ │ │ -#{1 => b}
│ │ │ -4> M#{1.0 := b}.
│ │ │ +expression returns a new map.
    If M is not of type map, an exception of type badmap is raised.
    Examples:
    M0 = #{},
│ │ │ +M1 = M0#{a => 0},
│ │ │ +M2 = M1#{a => 1, b => 2},
│ │ │ +M3 = M2#{"function" => fun() -> f() end},
│ │ │ +M4 = M3#{a := 2, b := 3}.  % 'a' and 'b' was added in `M1` and `M2`.
    Here M0 is any map. It follows that M1 through M4 are maps as well.
    More examples:
    1> M = #{1 => a}.
│ │ │ +#{1 => a }
│ │ │ +2> M#{1.0 => b}.
│ │ │ +#{1 => a, 1.0 => b}.
│ │ │ +3> M#{1 := b}.
│ │ │ +#{1 => b}
│ │ │ +4> M#{1.0 := b}.
│ │ │  ** exception error: bad argument
    As in construction, the order in which the key and value expressions are
│ │ │  evaluated is not defined. The syntactic order of the key-value pairs in the
│ │ │  update is of no relevance, except in the case where two keys match. In that
│ │ │  case, the latter value is used.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Maps in Patterns
│ │ │  
    
│ │ │ -
    Matching of key-value associations from maps is done as follows:
    #{K := V} = M
    Here M is any map. The key K must be a
│ │ │ +
    Matching of key-value associations from maps is done as follows:
    #{K := V} = M
    Here M is any map. The key K must be a
│ │ │  guard expression, with all variables already
│ │ │  bound. V can be any pattern with either bound or unbound variables.
    If the variable V is unbound, it becomes bound to the value associated with
│ │ │  the key K, which must exist in the map M. If the variable V is bound, it
│ │ │  must match the value associated with K in M.
    Change
    Before Erlang/OTP 23, the expression defining the key K was restricted to be
│ │ │ -either a single variable or a literal.
    Example:
    1> M = #{"tuple" => {1,2}}.
│ │ │ -#{"tuple" => {1,2}}
│ │ │ -2> #{"tuple" := {1,B}} = M.
│ │ │ -#{"tuple" => {1,2}}
│ │ │ +either a single variable or a literal.
    Example:
    1> M = #{"tuple" => {1,2}}.
│ │ │ +#{"tuple" => {1,2}}
│ │ │ +2> #{"tuple" := {1,B}} = M.
│ │ │ +#{"tuple" => {1,2}}
│ │ │  3> B.
│ │ │ -2.
    This binds variable B to integer 2.
    Similarly, multiple values from the map can be matched:
    #{K1 := V1, ..., Kn := Vn} = M
    Here keys K1 through Kn are any expressions with literals or bound
│ │ │ +2.
    This binds variable B to integer 2.
    Similarly, multiple values from the map can be matched:
    #{K1 := V1, ..., Kn := Vn} = M
    Here keys K1 through Kn are any expressions with literals or bound
│ │ │  variables. If all key expressions evaluate successfully and all keys
│ │ │  exist in map M, all variables in V1 .. Vn is matched to the
│ │ │  associated values of their respective keys.
    If the matching conditions are not met the match fails.
    Note that when matching a map, only the := operator (not the =>) is allowed
│ │ │  as a delimiter for the associations.
    The order in which keys are declared in matching has no relevance.
    Duplicate keys are allowed in matching and match each pattern associated to the
│ │ │ -keys:
    #{K := V1, K := V2} = M
    The empty map literal (#{}) matches any map when used as a pattern:
    #{} = Expr
    This expression matches if the expression Expr is of type map, otherwise it
│ │ │ -fails with an exception badmatch.
    Here the key to be retrieved is constructed from an expression:
    #{{tag,length(List)} := V} = Map
    List must be an already bound variable.
    Matching Syntax
    Matching of literals as keys are allowed in function heads:
    %% only start if not_started
│ │ │ -handle_call(start, From, #{state := not_started} = S) ->
│ │ │ +keys:
    #{K := V1, K := V2} = M
    The empty map literal (#{}) matches any map when used as a pattern:
    #{} = Expr
    This expression matches if the expression Expr is of type map, otherwise it
│ │ │ +fails with an exception badmatch.
    Here the key to be retrieved is constructed from an expression:
    #{{tag,length(List)} := V} = Map
    List must be an already bound variable.
    Matching Syntax
    Matching of literals as keys are allowed in function heads:
    %% only start if not_started
│ │ │ +handle_call(start, From, #{state := not_started} = S) ->
│ │ │  ...
│ │ │ -    {reply, ok, S#{state := start}};
│ │ │ +    {reply, ok, S#{state := start}};
│ │ │  
│ │ │  %% only change if started
│ │ │ -handle_call(change, From, #{state := start} = S) ->
│ │ │ +handle_call(change, From, #{state := start} = S) ->
│ │ │  ...
│ │ │ -    {reply, ok, S#{state := changed}};
    
│ │ │ +    {reply, ok, S#{state := changed}};
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Maps in Guards
│ │ │  
    
│ │ │  
    Maps are allowed in guards as long as all subexpressions are valid guard
│ │ │  expressions.
    The following guard BIFs handle maps:
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Bit Syntax Expressions
│ │ │  
    
│ │ │  
    The bit syntax operates on bit strings. A bit string is a sequence of bits
│ │ │ -ordered from the most significant bit to the least significant bit.
    <<>>  % The empty bit string, zero length
│ │ │ -<<E1>>
│ │ │ -<<E1,...,En>>
    Each element Ei specifies a segment of the bit string. The segments are
│ │ │ +ordered from the most significant bit to the least significant bit.
    <<>>  % The empty bit string, zero length
│ │ │ +<<E1>>
│ │ │ +<<E1,...,En>>
    Each element Ei specifies a segment of the bit string. The segments are
│ │ │  ordered left to right from the most significant bit to the least significant bit
│ │ │  of the bit string.
    Each segment specification Ei is a value, whose default type is integer,
│ │ │  followed by an optional size expression and an optional type specifier list.
    Ei = Value |
│ │ │       Value:Size |
│ │ │       Value/TypeSpecifierList |
│ │ │       Value:Size/TypeSpecifierList
    When used in a bit string construction, Value is an expression that is to
│ │ │  evaluate to an integer, float, or bit string. If the expression is not a single
│ │ │ @@ -798,34 +798,34 @@
│ │ │  guard expression that evaluates to an
│ │ │  integer. All variables in the guard expression must be already bound.
    Change
    Before Erlang/OTP 23, Size was restricted to be an integer or a variable
│ │ │  bound to an integer.
    The value of Size specifies the size of the segment in units (see below). The
│ │ │  default value depends on the type (see below):
    • For integer it is 8.
    • For float it is 64.
    • For binary and bitstring it is the whole binary or bit string.
    In matching, the default value for a binary or bit string segment is only valid
│ │ │  for the last element. All other bit string or binary elements in the matching
│ │ │  must have a size specification.
    Binaries
    A bit string with a length that is a multiple of 8 bits is known as a binary,
│ │ │  which is the most common and useful type of bit string.
    A binary has a canonical representation in memory. Here follows a sequence of
│ │ │ -bytes where each byte's value is its sequence number:
    <<1, 2, 3, 4, 5, 6, 7, 8, 9, 10>>
    Bit strings are a later generalization of binaries, so many texts and much
│ │ │ -information about binaries apply just as well for bit strings.
    Example:
    1> <<A/binary, B/binary>> = <<"abcde">>.
│ │ │ +bytes where each byte's value is its sequence number:
    <<1, 2, 3, 4, 5, 6, 7, 8, 9, 10>>
    Bit strings are a later generalization of binaries, so many texts and much
│ │ │ +information about binaries apply just as well for bit strings.
    Example:
    1> <<A/binary, B/binary>> = <<"abcde">>.
│ │ │  * 1:3: a binary field without size is only allowed at the end of a binary pattern
│ │ │ -2> <<A:3/binary, B/binary>> = <<"abcde">>.
│ │ │ -<<"abcde">>
│ │ │ +2> <<A:3/binary, B/binary>> = <<"abcde">>.
│ │ │ +<<"abcde">>
│ │ │  3> A.
│ │ │ -<<"abc">>
│ │ │ +<<"abc">>
│ │ │  4> B.
│ │ │ -<<"de">>
    For the utf8, utf16, and utf32 types, Size must not be given. The size
│ │ │ +<<"de">>
    For the utf8, utf16, and utf32 types, Size must not be given. The size
│ │ │  of the segment is implicitly determined by the type and value itself.
    TypeSpecifierList is a list of type specifiers, in any order, separated by
│ │ │  hyphens (-). Default values are used for any omitted type specifiers.
    • Type= integer | float | binary | bytes | bitstring | bits |
│ │ │  utf8 | utf16 | utf32 - The default is integer. bytes is a
│ │ │  shorthand for binary and bits is a shorthand for bitstring. See below
│ │ │  for more information about the utf types.
    • Signedness= signed | unsigned - Only matters for matching and when
│ │ │  the type is integer. The default is unsigned.
    • Endianness= big | little | native - Specifies byte level (octet
│ │ │  level) endianness (byte order). Native-endian means that the endianness is
│ │ │  resolved at load time to be either big-endian or little-endian, depending on
│ │ │  what is native for the CPU that the Erlang machine is run on. Endianness only
│ │ │  matters when the Type is either integer, utf16, utf32, or float. The
│ │ │ -default is big.
      <<16#1234:16/little>> = <<16#3412:16>> = <<16#34:8, 16#12:8>>
    • Unit= unit:IntegerLiteral - The allowed range is 1 through 256.
│ │ │ +default is big.
      <<16#1234:16/little>> = <<16#3412:16>> = <<16#34:8, 16#12:8>>
    • Unit= unit:IntegerLiteral - The allowed range is 1 through 256.
│ │ │  Defaults to 1 for integer, float, and bitstring, and to 8 for binary.
│ │ │  For types bitstring, bits, and bytes, it is not allowed to specify a
│ │ │  unit value different from the default value. No unit specifier must be given
│ │ │  for the types utf8, utf16, and utf32.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │ @@ -850,41 +850,41 @@
│ │ │    
│ │ │    Binary segments
│ │ │  
    
│ │ │  
    In this section, the phrase "binary segment" refers to any one of the segment
│ │ │  types binary, bitstring, bytes, and bits.
    See also the paragraphs about Binaries.
    When constructing binaries and no size is specified for a binary segment, the
│ │ │  entire binary value is interpolated into the binary being constructed. However,
│ │ │  the size in bits of the binary being interpolated must be evenly divisible by
│ │ │ -the unit value for the segment; otherwise an exception is raised.
    For example, the following examples all succeed:
    1> <<(<<"abc">>)/bitstring>>.
│ │ │ -<<"abc">>
│ │ │ -2> <<(<<"abc">>)/binary-unit:1>>.
│ │ │ -<<"abc">>
│ │ │ -3> <<(<<"abc">>)/binary>>.
│ │ │ -<<"abc">>
    The first two examples have a unit value of 1 for the segment, while the third
│ │ │ +the unit value for the segment; otherwise an exception is raised.
    For example, the following examples all succeed:
    1> <<(<<"abc">>)/bitstring>>.
│ │ │ +<<"abc">>
│ │ │ +2> <<(<<"abc">>)/binary-unit:1>>.
│ │ │ +<<"abc">>
│ │ │ +3> <<(<<"abc">>)/binary>>.
│ │ │ +<<"abc">>
    The first two examples have a unit value of 1 for the segment, while the third
│ │ │  segment has a unit value of 8.
    Attempting to interpolate a bit string of size 1 into a binary segment with unit
│ │ │ -8 (the default unit for binary) fails as shown in this example:
    1> <<(<<1:1>>)/binary>>.
│ │ │ -** exception error: bad argument
    For the construction to succeed, the unit value of the segment must be 1:
    2> <<(<<1:1>>)/bitstring>>.
│ │ │ -<<1:1>>
│ │ │ -3> <<(<<1:1>>)/binary-unit:1>>.
│ │ │ -<<1:1>>
    Similarly, when matching a binary segment with no size specified, the match
│ │ │ +8 (the default unit for binary) fails as shown in this example:
    1> <<(<<1:1>>)/binary>>.
│ │ │ +** exception error: bad argument
    For the construction to succeed, the unit value of the segment must be 1:
    2> <<(<<1:1>>)/bitstring>>.
│ │ │ +<<1:1>>
│ │ │ +3> <<(<<1:1>>)/binary-unit:1>>.
│ │ │ +<<1:1>>
    Similarly, when matching a binary segment with no size specified, the match
│ │ │  succeeds if and only if the size in bits of the rest of the binary is evenly
│ │ │ -divisible by the unit value:
    1> <<_/binary-unit:16>> = <<"">>.
│ │ │ -<<>>
│ │ │ -2> <<_/binary-unit:16>> = <<"a">>.
│ │ │ +divisible by the unit value:
    1> <<_/binary-unit:16>> = <<"">>.
│ │ │ +<<>>
│ │ │ +2> <<_/binary-unit:16>> = <<"a">>.
│ │ │  ** exception error: no match of right hand side value <<"a">>
│ │ │ -3> <<_/binary-unit:16>> = <<"ab">>.
│ │ │ -<<"ab">>
│ │ │ -4> <<_/binary-unit:16>> = <<"abc">>.
│ │ │ +3> <<_/binary-unit:16>> = <<"ab">>.
│ │ │ +<<"ab">>
│ │ │ +4> <<_/binary-unit:16>> = <<"abc">>.
│ │ │  ** exception error: no match of right hand side value <<"abc">>
│ │ │ -5> <<_/binary-unit:16>> = <<"abcd">>.
│ │ │ -<<"abcd">>
    When a size is explicitly specified for a binary segment, the segment size in
│ │ │ +5> <<_/binary-unit:16>> = <<"abcd">>.
│ │ │ +<<"abcd">>
    When a size is explicitly specified for a binary segment, the segment size in
│ │ │  bits is the value of Size multiplied by the default or explicit unit value.
    When constructing binaries, the size of the binary being interpolated into the
│ │ │ -constructed binary must be at least as large as the size of the binary segment.
    Examples:
    1> <<(<<"abc">>):2/binary>>.
│ │ │ -<<"ab">>
│ │ │ -2> <<(<<"a">>):2/binary>>.
│ │ │ +constructed binary must be at least as large as the size of the binary segment.
    Examples:
    1> <<(<<"abc">>):2/binary>>.
│ │ │ +<<"ab">>
│ │ │ +2> <<(<<"a">>):2/binary>>.
│ │ │  ** exception error: construction of binary failed
│ │ │          *** segment 1 of type 'binary': the value <<"a">> is shorter than the size of the segment
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Unicode segments
│ │ │  
    
│ │ │ @@ -900,78 +900,78 @@
│ │ │  range 0 through 16#D7FF or 16#E000 through 16#10FFFF. The match fails if the
│ │ │  returned value falls outside those ranges.
    A segment of type utf8 matches 1-4 bytes in the bit string, if the bit string
│ │ │  at the match position contains a valid UTF-8 sequence. (See RFC-3629 or the
│ │ │  Unicode standard.)
    A segment of type utf16 can match 2 or 4 bytes in the bit string. The match
│ │ │  fails if the bit string at the match position does not contain a legal UTF-16
│ │ │  encoding of a Unicode code point. (See RFC-2781 or the Unicode standard.)
    A segment of type utf32 can match 4 bytes in the bit string in the same way as
│ │ │  an integer segment matches 32 bits. The match fails if the resulting integer
│ │ │ -is outside the legal ranges previously mentioned.
    Examples:
    1> Bin1 = <<1,17,42>>.
│ │ │ -<<1,17,42>>
│ │ │ -2> Bin2 = <<"abc">>.
│ │ │ -<<97,98,99>>
│ │ │ +is outside the legal ranges previously mentioned.
    Examples:
    1> Bin1 = <<1,17,42>>.
│ │ │ +<<1,17,42>>
│ │ │ +2> Bin2 = <<"abc">>.
│ │ │ +<<97,98,99>>
│ │ │  
│ │ │ -3> Bin3 = <<1,17,42:16>>.
│ │ │ -<<1,17,0,42>>
│ │ │ -4> <<A,B,C:16>> = <<1,17,42:16>>.
│ │ │ -<<1,17,0,42>>
│ │ │ +3> Bin3 = <<1,17,42:16>>.
│ │ │ +<<1,17,0,42>>
│ │ │ +4> <<A,B,C:16>> = <<1,17,42:16>>.
│ │ │ +<<1,17,0,42>>
│ │ │  5> C.
│ │ │  42
│ │ │ -6> <<D:16,E,F>> = <<1,17,42:16>>.
│ │ │ -<<1,17,0,42>>
│ │ │ +6> <<D:16,E,F>> = <<1,17,42:16>>.
│ │ │ +<<1,17,0,42>>
│ │ │  7> D.
│ │ │  273
│ │ │  8> F.
│ │ │  42
│ │ │ -9> <<G,H/binary>> = <<1,17,42:16>>.
│ │ │ -<<1,17,0,42>>
│ │ │ +9> <<G,H/binary>> = <<1,17,42:16>>.
│ │ │ +<<1,17,0,42>>
│ │ │  10> H.
│ │ │ -<<17,0,42>>
│ │ │ -11> <<G,J/bitstring>> = <<1,17,42:12>>.
│ │ │ -<<1,17,2,10:4>>
│ │ │ +<<17,0,42>>
│ │ │ +11> <<G,J/bitstring>> = <<1,17,42:12>>.
│ │ │ +<<1,17,2,10:4>>
│ │ │  12> J.
│ │ │ -<<17,2,10:4>>
│ │ │ +<<17,2,10:4>>
│ │ │  
│ │ │ -13> <<1024/utf8>>.
│ │ │ -<<208,128>>
│ │ │ +13> <<1024/utf8>>.
│ │ │ +<<208,128>>
│ │ │  
│ │ │ -14> <<1:1,0:7>>.
│ │ │ -<<128>>
│ │ │ -15> <<16#123:12/little>> = <<16#231:12>> = <<2:4, 3:4, 1:4>>.
│ │ │ -<<35,1:4>>
    Notice that bit string patterns cannot be nested.
    Notice also that "B=<<1>>" is interpreted as "B =< <1>>" which is a syntax
│ │ │ +14> <<1:1,0:7>>.
│ │ │ +<<128>>
│ │ │ +15> <<16#123:12/little>> = <<16#231:12>> = <<2:4, 3:4, 1:4>>.
│ │ │ +<<35,1:4>>
    Notice that bit string patterns cannot be nested.
    Notice also that "B=<<1>>" is interpreted as "B =< <1>>" which is a syntax
│ │ │  error. The correct way is to write a space after =: "B = <<1>>.
    More examples are provided in Programming Examples.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Fun Expressions
│ │ │  
    
│ │ │  
    fun
│ │ │ -    [Name](Pattern11,...,Pattern1N) [when GuardSeq1] ->
│ │ │ +    [Name](Pattern11,...,Pattern1N) [when GuardSeq1] ->
│ │ │                Body1;
│ │ │      ...;
│ │ │ -    [Name](PatternK1,...,PatternKN) [when GuardSeqK] ->
│ │ │ +    [Name](PatternK1,...,PatternKN) [when GuardSeqK] ->
│ │ │                BodyK
│ │ │  end
    A fun expression begins with the keyword fun and ends with the keyword end.
│ │ │  Between them is to be a function declaration, similar to a
│ │ │  regular function declaration,
│ │ │  except that the function name is optional and is to be a variable, if any.
    Variables in a fun head shadow the function name and both shadow variables in
│ │ │  the function clause surrounding the fun expression. Variables bound in a fun
│ │ │ -body are local to the fun body.
    The return value of the expression is the resulting fun.
    Examples:
    1> Fun1 = fun (X) -> X+1 end.
│ │ │ +body are local to the fun body.
    The return value of the expression is the resulting fun.
    Examples:
    1> Fun1 = fun (X) -> X+1 end.
│ │ │  #Fun<erl_eval.6.39074546>
│ │ │ -2> Fun1(2).
│ │ │ +2> Fun1(2).
│ │ │  3
│ │ │ -3> Fun2 = fun (X) when X>=5 -> gt; (X) -> lt end.
│ │ │ +3> Fun2 = fun (X) when X>=5 -> gt; (X) -> lt end.
│ │ │  #Fun<erl_eval.6.39074546>
│ │ │ -4> Fun2(7).
│ │ │ +4> Fun2(7).
│ │ │  gt
│ │ │ -5> Fun3 = fun Fact(1) -> 1; Fact(X) when X > 1 -> X * Fact(X - 1) end.
│ │ │ +5> Fun3 = fun Fact(1) -> 1; Fact(X) when X > 1 -> X * Fact(X - 1) end.
│ │ │  #Fun<erl_eval.6.39074546>
│ │ │ -6> Fun3(4).
│ │ │ +6> Fun3(4).
│ │ │  24
    The following fun expressions are also allowed:
    fun Name/Arity
│ │ │  fun Module:Name/Arity
    In Name/Arity, Name is an atom and Arity is an integer. Name/Arity must
│ │ │ -specify an existing local function. The expression is syntactic sugar for:
    fun (Arg1,...,ArgN) -> Name(Arg1,...,ArgN) end
    In Module:Name/Arity, Module, and Name are atoms and Arity is an
│ │ │ +specify an existing local function. The expression is syntactic sugar for:
    fun (Arg1,...,ArgN) -> Name(Arg1,...,ArgN) end
    In Module:Name/Arity, Module, and Name are atoms and Arity is an
│ │ │  integer. Module, Name, and Arity can also be variables. A fun defined in
│ │ │  this way refers to the function Name with arity Arity in the latest
│ │ │  version of module Module. A fun defined in this way is not dependent on the
│ │ │  code for the module in which it is defined.
    Change
    Before Erlang/OTP R15, Module, Name, and Arity were not allowed to be
│ │ │  variables.
    More examples are provided in Programming Examples.
    
│ │ │    
│ │ │      
│ │ │ @@ -981,35 +981,35 @@
│ │ │  
    catch Expr
    Returns the value of Expr unless an exception is raised during the evaluation. In
│ │ │  that case, the exception is caught. The return value depends on the class of the
│ │ │  exception:
    Reason depends on the type of error that occurred, and Stack is the stack of
│ │ │  recent function calls, see Exit Reasons.
    Examples:
    1> catch 1+2.
│ │ │  3
│ │ │  2> catch 1+a.
│ │ │ -{'EXIT',{badarith,[...]}}
    The BIF throw(Any) can be used for non-local return from a
│ │ │ -function. It must be evaluated within a catch, which returns the value Any.
    Example:
    3> catch throw(hello).
│ │ │ +{'EXIT',{badarith,[...]}}
    The BIF throw(Any) can be used for non-local return from a
│ │ │ +function. It must be evaluated within a catch, which returns the value Any.
    Example:
    3> catch throw(hello).
│ │ │  hello
    If throw/1 is not evaluated within a catch, a nocatch run-time
│ │ │  error occurs.
    Change
    Before Erlang/OTP 24, the catch operator had the lowest precedence, making
│ │ │ -it necessary to add parentheses when combining it with the match operator:
    1> A = (catch 42).
│ │ │ +it necessary to add parentheses when combining it with the match operator:
    1> A = (catch 42).
│ │ │  42
│ │ │  2> A.
│ │ │  42
    Starting from Erlang/OTP 24, the parentheses can be omitted:
    1> A = catch 42.
│ │ │  42
│ │ │  2> A.
│ │ │  42
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Try
│ │ │  
    
│ │ │  
    try Exprs
│ │ │  catch
│ │ │ -    Class1:ExceptionPattern1[:Stacktrace] [when ExceptionGuardSeq1] ->
│ │ │ +    Class1:ExceptionPattern1[:Stacktrace] [when ExceptionGuardSeq1] ->
│ │ │          ExceptionBody1;
│ │ │ -    ClassN:ExceptionPatternN[:Stacktrace] [when ExceptionGuardSeqN] ->
│ │ │ +    ClassN:ExceptionPatternN[:Stacktrace] [when ExceptionGuardSeqN] ->
│ │ │          ExceptionBodyN
│ │ │  end
    This is an enhancement of catch. It gives the
│ │ │  possibility to:
    • Distinguish between different exception classes.
    • Choose to handle only the desired ones.
    • Passing the others on to an enclosing try or catch, or to default error
│ │ │  handling.
    Notice that although the keyword catch is used in the try expression, there
│ │ │  is not a catch expression within the try expression.
    It returns the value of Exprs (a sequence of expressions Expr1, ..., ExprN)
│ │ │  unless an exception occurs during the evaluation. In that case the exception is
│ │ │  caught and the patterns ExceptionPattern with the right exception class
│ │ │ @@ -1019,47 +1019,47 @@
│ │ │  stack trace is bound to the variable when the corresponding ExceptionPattern
│ │ │  matches.
    If an exception occurs during evaluation of Exprs but there is no matching
│ │ │  ExceptionPattern of the right Class with a true guard sequence, the
│ │ │  exception is passed on as if Exprs had not been enclosed in a try
│ │ │  expression.
    If an exception occurs during evaluation of ExceptionBody, it is not caught.
    It is allowed to omit Class and Stacktrace. An omitted Class is shorthand
│ │ │  for throw:
    try Exprs
│ │ │  catch
│ │ │ -    ExceptionPattern1 [when ExceptionGuardSeq1] ->
│ │ │ +    ExceptionPattern1 [when ExceptionGuardSeq1] ->
│ │ │          ExceptionBody1;
│ │ │ -    ExceptionPatternN [when ExceptionGuardSeqN] ->
│ │ │ +    ExceptionPatternN [when ExceptionGuardSeqN] ->
│ │ │          ExceptionBodyN
│ │ │  end
    The try expression can have an of section:
    try Exprs of
│ │ │ -    Pattern1 [when GuardSeq1] ->
│ │ │ +    Pattern1 [when GuardSeq1] ->
│ │ │          Body1;
│ │ │      ...;
│ │ │ -    PatternN [when GuardSeqN] ->
│ │ │ +    PatternN [when GuardSeqN] ->
│ │ │          BodyN
│ │ │  catch
│ │ │ -    Class1:ExceptionPattern1[:Stacktrace] [when ExceptionGuardSeq1] ->
│ │ │ +    Class1:ExceptionPattern1[:Stacktrace] [when ExceptionGuardSeq1] ->
│ │ │          ExceptionBody1;
│ │ │      ...;
│ │ │ -    ClassN:ExceptionPatternN[:Stacktrace] [when ExceptionGuardSeqN] ->
│ │ │ +    ClassN:ExceptionPatternN[:Stacktrace] [when ExceptionGuardSeqN] ->
│ │ │          ExceptionBodyN
│ │ │  end
    If the evaluation of Exprs succeeds without an exception, the patterns
│ │ │  Pattern are sequentially matched against the result in the same way as for a
│ │ │  case expression, except that if the matching fails, a
│ │ │  try_clause run-time error occurs instead of a case_clause.
    Only exceptions occurring during the evaluation of Exprs can be caught by the
│ │ │  catch section. Exceptions occurring in a Body or due to a failed match are
│ │ │  not caught.
    The try expression can also be augmented with an after section, intended to
│ │ │  be used for cleanup with side effects:
    try Exprs of
│ │ │ -    Pattern1 [when GuardSeq1] ->
│ │ │ +    Pattern1 [when GuardSeq1] ->
│ │ │          Body1;
│ │ │      ...;
│ │ │ -    PatternN [when GuardSeqN] ->
│ │ │ +    PatternN [when GuardSeqN] ->
│ │ │          BodyN
│ │ │  catch
│ │ │ -    Class1:ExceptionPattern1[:Stacktrace] [when ExceptionGuardSeq1] ->
│ │ │ +    Class1:ExceptionPattern1[:Stacktrace] [when ExceptionGuardSeq1] ->
│ │ │          ExceptionBody1;
│ │ │      ...;
│ │ │ -    ClassN:ExceptionPatternN[:Stacktrace] [when ExceptionGuardSeqN] ->
│ │ │ +    ClassN:ExceptionPatternN[:Stacktrace] [when ExceptionGuardSeqN] ->
│ │ │          ExceptionBodyN
│ │ │  after
│ │ │      AfterBody
│ │ │  end
    AfterBody is evaluated after either Body or ExceptionBody, no matter which
│ │ │  one. The evaluated value of AfterBody is lost; the return value of the try
│ │ │  expression is the same with an after section as without.
    Even if an exception occurs during evaluation of Body or ExceptionBody,
│ │ │  AfterBody is evaluated. In this case the exception is passed on after
│ │ │ @@ -1082,40 +1082,40 @@
│ │ │          ExpressionBody
│ │ │  after
│ │ │      AfterBody
│ │ │  end
│ │ │  
│ │ │  try Exprs after AfterBody end
    Next is an example of using after. This closes the file, even in the event of
│ │ │  exceptions in file:read/2 or in binary_to_term/1. The
│ │ │ -exceptions are the same as without the try...after...end expression:
    termize_file(Name) ->
│ │ │ -    {ok,F} = file:open(Name, [read,binary]),
│ │ │ +exceptions are the same as without the try...after...end expression:
    termize_file(Name) ->
│ │ │ +    {ok,F} = file:open(Name, [read,binary]),
│ │ │      try
│ │ │ -        {ok,Bin} = file:read(F, 1024*1024),
│ │ │ -        binary_to_term(Bin)
│ │ │ +        {ok,Bin} = file:read(F, 1024*1024),
│ │ │ +        binary_to_term(Bin)
│ │ │      after
│ │ │ -        file:close(F)
│ │ │ +        file:close(F)
│ │ │      end.
    Next is an example of using try to emulate catch Expr:
    try Expr
│ │ │  catch
│ │ │      throw:Term -> Term;
│ │ │ -    exit:Reason -> {'EXIT',Reason};
│ │ │ -    error:Reason:Stk -> {'EXIT',{Reason,Stk}}
│ │ │ +    exit:Reason -> {'EXIT',Reason};
│ │ │ +    error:Reason:Stk -> {'EXIT',{Reason,Stk}}
│ │ │  end
    Variables bound in the various parts of these expressions have different scopes.
│ │ │  Variables bound just after the try keyword are:
    • bound in the of section
    • unsafe in both the catch and after sections, as well as after the whole
│ │ │  construct
    Variables bound in of section are:
    • unbound in the catch section
    • unsafe in both the after section, as well as after the whole construct
    Variables bound in the catch section are unsafe in the after section, as
│ │ │  well as after the whole construct.
    Variables bound in the after section are unsafe after the whole construct.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Parenthesized Expressions
│ │ │  
    
│ │ │ -
    (Expr)
    Parenthesized expressions are useful to override
│ │ │ +
    (Expr)
    Parenthesized expressions are useful to override
│ │ │  operator precedences, for example, in arithmetic
│ │ │  expressions:
    1> 1 + 2 * 3.
│ │ │  7
│ │ │ -2> (1 + 2) * 3.
│ │ │ +2> (1 + 2) * 3.
│ │ │  9
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Block Expressions
│ │ │  
    
│ │ │  
    begin
│ │ │ @@ -1127,71 +1127,71 @@
│ │ │    
│ │ │      
│ │ │    
│ │ │    Comprehensions
│ │ │  
    
│ │ │  
    Comprehensions provide a succinct notation for iterating over one or more terms
│ │ │  and constructing a new term. Comprehensions come in three different flavors,
│ │ │ -depending on the type of term they build.
    List comprehensions construct lists. They have the following syntax:
    [Expr || Qualifier1, . . ., QualifierN]
    Here, Expr is an arbitrary expression, and each Qualifier is either a
│ │ │ +depending on the type of term they build.
    List comprehensions construct lists. They have the following syntax:
    [Expr || Qualifier1, . . ., QualifierN]
    Here, Expr is an arbitrary expression, and each Qualifier is either a
│ │ │  generator or a filter.
    Bit string comprehensions construct bit strings or binaries. They have the
│ │ │ -following syntax:
    << BitStringExpr || Qualifier1, . . ., QualifierN >>
    BitStringExpr is an expression that evaluates to a bit string. If
│ │ │ +following syntax:
    << BitStringExpr || Qualifier1, . . ., QualifierN >>
    BitStringExpr is an expression that evaluates to a bit string. If
│ │ │  BitStringExpr is a function call, it must be enclosed in parentheses. Each
│ │ │ -Qualifier is either a generator or a filter.
    Map comprehensions construct maps. They have the following syntax:
    #{KeyExpr => ValueExpr || Qualifier1, . . ., QualifierN}
    Here, KeyExpr and ValueExpr are arbitrary expressions, and each Qualifier
│ │ │ +Qualifier is either a generator or a filter.
    Map comprehensions construct maps. They have the following syntax:
    #{KeyExpr => ValueExpr || Qualifier1, . . ., QualifierN}
    Here, KeyExpr and ValueExpr are arbitrary expressions, and each Qualifier
│ │ │  is either a generator or a filter.
    Change
    Map comprehensions and map generators were introduced in Erlang/OTP 26.
    There are three kinds of generators.
    A list generator has the following syntax:
    Pattern <- ListExpr
    where ListExpr is an expression that evaluates to a list of terms.
    A bit string generator has the following syntax:
    BitstringPattern <= BitStringExpr
    where BitStringExpr is an expression that evaluates to a bit string.
    A map generator has the following syntax:
    KeyPattern := ValuePattern <- MapExpression
    where MapExpr is an expression that evaluates to a map, or a map iterator
│ │ │  obtained by calling maps:iterator/1 or maps:iterator/2.
    A filter is an expression that evaluates to true or false.
    The variables in the generator patterns shadow previously bound variables,
│ │ │  including variables bound in a previous generator pattern.
    Variables bound in a generator expression are not visible outside the
│ │ │ -expression:
    1> [{E,L} || E <- L=[1,2,3]].
│ │ │ +expression:
    1> [{E,L} || E <- L=[1,2,3]].
│ │ │  * 1:5: variable 'L' is unbound
    A list comprehension returns a list, where the list elements are the result
│ │ │  of evaluating Expr for each combination of generator elements for which all
│ │ │  filters are true.
    A bit string comprehension returns a bit string, which is created by
│ │ │  concatenating the results of evaluating BitStringExpr for each combination of
│ │ │  bit string generator elements for which all filters are true.
    A map comprehension returns a map, where the map elements are the result of
│ │ │  evaluating KeyExpr and ValueExpr for each combination of generator elements
│ │ │  for which all filters are true. If the key expressions are not unique, the last
│ │ │ -occurrence is stored in the map.
    Examples:
    Multiplying each element in a list by two:
    1> [X*2 || X <- [1,2,3]].
│ │ │ -[2,4,6]
    Multiplying each byte in a binary by two, returning a list:
    1> [X*2 || <<X>> <= <<1,2,3>>].
│ │ │ -[2,4,6]
    Multiplying each byte in a binary by two:
    1> << <<(X*2)>> || <<X>> <= <<1,2,3>> >>.
│ │ │ -<<2,4,6>>
    Multiplying each element in a list by two, returning a binary:
    1> << <<(X*2)>> || X <- [1,2,3] >>.
│ │ │ -<<2,4,6>>
    Creating a mapping from an integer to its square:
    1> #{X => X*X || X <- [1,2,3]}.
│ │ │ -#{1 => 1,2 => 4,3 => 9}
    Multiplying the value of each element in a map by two:
    1> #{K => 2*V || K := V <- #{a => 1,b => 2,c => 3}}.
│ │ │ -#{a => 2,b => 4,c => 6}
    Filtering a list, keeping odd numbers:
    1> [X || X <- [1,2,3,4,5], X rem 2 =:= 1].
│ │ │ -[1,3,5]
    Filtering a list, keeping only elements that match:
    1> [X || {_,_}=X <- [{a,b}, [a], {x,y,z}, {1,2}]].
│ │ │ -[{a,b},{1,2}]
    Combining elements from two list generators:
    1> [{P,Q} || P <- [a,b,c], Q <- [1,2]].
│ │ │ -[{a,1},{a,2},{b,1},{b,2},{c,1},{c,2}]
    More examples are provided in
│ │ │ +occurrence is stored in the map.
    Examples:
    Multiplying each element in a list by two:
    1> [X*2 || X <- [1,2,3]].
│ │ │ +[2,4,6]
    Multiplying each byte in a binary by two, returning a list:
    1> [X*2 || <<X>> <= <<1,2,3>>].
│ │ │ +[2,4,6]
    Multiplying each byte in a binary by two:
    1> << <<(X*2)>> || <<X>> <= <<1,2,3>> >>.
│ │ │ +<<2,4,6>>
    Multiplying each element in a list by two, returning a binary:
    1> << <<(X*2)>> || X <- [1,2,3] >>.
│ │ │ +<<2,4,6>>
    Creating a mapping from an integer to its square:
    1> #{X => X*X || X <- [1,2,3]}.
│ │ │ +#{1 => 1,2 => 4,3 => 9}
    Multiplying the value of each element in a map by two:
    1> #{K => 2*V || K := V <- #{a => 1,b => 2,c => 3}}.
│ │ │ +#{a => 2,b => 4,c => 6}
    Filtering a list, keeping odd numbers:
    1> [X || X <- [1,2,3,4,5], X rem 2 =:= 1].
│ │ │ +[1,3,5]
    Filtering a list, keeping only elements that match:
    1> [X || {_,_}=X <- [{a,b}, [a], {x,y,z}, {1,2}]].
│ │ │ +[{a,b},{1,2}]
    Combining elements from two list generators:
    1> [{P,Q} || P <- [a,b,c], Q <- [1,2]].
│ │ │ +[{a,1},{a,2},{b,1},{b,2},{c,1},{c,2}]
    More examples are provided in
│ │ │  Programming Examples.
    When there are no generators, a comprehension returns either a term constructed
│ │ │  from a single element (the result of evaluating Expr) if all filters are true,
│ │ │  or a term constructed from no elements (that is, [] for list comprehension,
│ │ │ -<<>> for a bit string comprehension, and #{} for a map comprehension).
    Example:
    1> [2 || is_integer(2)].
│ │ │ -[2]
│ │ │ -2> [x || is_integer(x)].
│ │ │ -[]
    What happens when the filter expression does not evaluate to a boolean value
│ │ │ +<<>> for a bit string comprehension, and #{} for a map comprehension).
    Example:
    1> [2 || is_integer(2)].
│ │ │ +[2]
│ │ │ +2> [x || is_integer(x)].
│ │ │ +[]
    What happens when the filter expression does not evaluate to a boolean value
│ │ │  depends on the expression:
    • If the expression is a guard expression,
│ │ │  failure to evaluate or evaluating to a non-boolean value is equivalent to
│ │ │  evaluating to false.
    • If the expression is not a guard expression and evaluates to a non-Boolean
│ │ │  value Val, an exception {bad_filter, Val} is triggered at runtime. If the
│ │ │  evaluation of the expression raises an exception, it is not caught by the
│ │ │ -comprehension.
    Examples (using a guard expression as filter):
    1> List = [1,2,a,b,c,3,4].
│ │ │ -[1,2,a,b,c,3,4]
│ │ │ -2> [E || E <- List, E rem 2].
│ │ │ -[]
│ │ │ -3> [E || E <- List, E rem 2 =:= 0].
│ │ │ -[2,4]
    Examples (using a non-guard expression as filter):
    1> List = [1,2,a,b,c,3,4].
│ │ │ -[1,2,a,b,c,3,4]
│ │ │ -2> FaultyIsEven = fun(E) -> E rem 2 end.
│ │ │ +comprehension.
    Examples (using a guard expression as filter):
    1> List = [1,2,a,b,c,3,4].
│ │ │ +[1,2,a,b,c,3,4]
│ │ │ +2> [E || E <- List, E rem 2].
│ │ │ +[]
│ │ │ +3> [E || E <- List, E rem 2 =:= 0].
│ │ │ +[2,4]
    Examples (using a non-guard expression as filter):
    1> List = [1,2,a,b,c,3,4].
│ │ │ +[1,2,a,b,c,3,4]
│ │ │ +2> FaultyIsEven = fun(E) -> E rem 2 end.
│ │ │  #Fun<erl_eval.42.17316486>
│ │ │ -3> [E || E <- List, FaultyIsEven(E)].
│ │ │ +3> [E || E <- List, FaultyIsEven(E)].
│ │ │  ** exception error: bad filter 1
│ │ │ -4> IsEven = fun(E) -> E rem 2 =:= 0 end.
│ │ │ +4> IsEven = fun(E) -> E rem 2 =:= 0 end.
│ │ │  #Fun<erl_eval.42.17316486>
│ │ │ -5> [E || E <- List, IsEven(E)].
│ │ │ +5> [E || E <- List, IsEven(E)].
│ │ │  ** exception error: an error occurred when evaluating an arithmetic expression
│ │ │       in operator  rem/2
│ │ │          called as a rem 2
│ │ │ -6> [E || E <- List, is_integer(E), IsEven(E)].
│ │ │ -[2,4]
    
│ │ │ +6> [E || E <- List, is_integer(E), IsEven(E)].
│ │ │ +[2,4]
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Guard Sequences
│ │ │  
    
│ │ │  
    A guard sequence is a sequence of guards, separated by semicolon (;). The
│ │ │  guard sequence is true if at least one of the guards is true. (The remaining
│ │ ├── ./usr/share/doc/erlang-doc/html/doc/system/funs.html
│ │ │ @@ -117,402 +117,402 @@
│ │ │  
│ │ │  
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    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
│ │ │  to write several different functions that have a similar structure, but differ
│ │ │  in some minor detail. This is done as follows:
    1. Step 1. Write one function that represents the common features of these
│ │ │  functions.
    2. Step 2. Parameterize the difference in terms of functions that are passed
│ │ │  as arguments to the common function.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    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
│ │ │  BIF returns true if the process contains funs that depend on the old version
│ │ │  of a module.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Variable Bindings Within a Fun
│ │ │  
    
│ │ │  
    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'
│ │ │        shadowed in 'fun'
    This indicates that the variable File, which is defined inside the fun,
│ │ │  collides with the variable File, which is defined outside the fun.
    The rules for importing variables into a fun has the consequence that certain
│ │ │  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, ...)
│ │ │      ...
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Funs and Module Lists
│ │ │  
    
│ │ │  
    The following examples show a dialogue with the Erlang shell. All the higher
│ │ │  order functions discussed are exported from the module lists.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    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]) ->
│ │ │ -    case Pred(H) of
│ │ │ -        true  ->  all(Pred, T);
│ │ │ +
    lists:all/2 has the same arguments as any:
    all(Pred, [H|T]) ->
│ │ │ +    case Pred(H) of
│ │ │ +        true  ->  all(Pred, T);
│ │ │          false ->  false
│ │ │      end;
│ │ │ -all(Pred, []) ->
│ │ │ -    true.
    It is true if the predicate applied to all elements in the list is true.
    > lists:all(Big, [1,2,3,4,12,6]).
│ │ │ +all(Pred, []) ->
│ │ │ +    true.
    It is true if the predicate applied to all elements in the list is true.
    > lists:all(Big, [1,2,3,4,12,6]).
│ │ │  false
│ │ │ -> lists:all(Big, [12,13,14,15]).
│ │ │ +> lists:all(Big, [12,13,14,15]).
│ │ │  true
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    foreach
│ │ │  
    
│ │ │ -
    lists:foreach/2 takes a function of one argument and a list of terms:
    foreach(F, [H|T]) ->
│ │ │ -    F(H),
│ │ │ -    foreach(F, T);
│ │ │ -foreach(F, []) ->
│ │ │ +
    lists:foreach/2 takes a function of one argument and a list of terms:
    foreach(F, [H|T]) ->
│ │ │ +    F(H),
│ │ │ +    foreach(F, T);
│ │ │ +foreach(F, []) ->
│ │ │      ok.
    The function is applied to each argument in the list. foreach returns ok. It
│ │ │ -is only used for its side-effect:
    > lists:foreach(fun(X) -> io:format("~w~n",[X]) end, [1,2,3,4]).
│ │ │ +is only used for its side-effect:
    > lists:foreach(fun(X) -> io:format("~w~n",[X]) end, [1,2,3,4]).
│ │ │  1
│ │ │  2
│ │ │  3
│ │ │  4
│ │ │  ok
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    foldl
│ │ │  
    
│ │ │ -
    lists:foldl/3 takes a function of two arguments, an accumulator and a list:
    foldl(F, Accu, [Hd|Tail]) ->
│ │ │ -    foldl(F, F(Hd, Accu), Tail);
│ │ │ -foldl(F, Accu, []) -> Accu.
    The function is called with two arguments. The first argument is the successive
│ │ │ +
    lists:foldl/3 takes a function of two arguments, an accumulator and a list:
    foldl(F, Accu, [Hd|Tail]) ->
│ │ │ +    foldl(F, F(Hd, Accu), Tail);
│ │ │ +foldl(F, Accu, []) -> Accu.
    The function is called with two arguments. The first argument is the successive
│ │ │  elements in the list. The second argument is the accumulator. The function must
│ │ │  return a new accumulator, which is used the next time the function is called.
    If you have a list of lists L = ["I","like","Erlang"], then you can sum the
│ │ │ -lengths of all the strings in L as follows:
    > L = ["I","like","Erlang"].
│ │ │ -["I","like","Erlang"]
│ │ │ -10> lists:foldl(fun(X, Sum) -> length(X) + Sum end, 0, L).
│ │ │ -11
    lists:foldl/3 works like a while loop in an imperative language:
    L =  ["I","like","Erlang"],
│ │ │ +lengths of all the strings in L as follows:
    > L = ["I","like","Erlang"].
│ │ │ +["I","like","Erlang"]
│ │ │ +10> lists:foldl(fun(X, Sum) -> length(X) + Sum end, 0, L).
│ │ │ +11
    lists:foldl/3 works like a while loop in an imperative language:
    L =  ["I","like","Erlang"],
│ │ │  Sum = 0,
│ │ │ -while( L != []){
│ │ │ -    Sum += length(head(L)),
│ │ │ -    L = tail(L)
│ │ │ +while( L != []){
│ │ │ +    Sum += length(head(L)),
│ │ │ +    L = tail(L)
│ │ │  end
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    mapfoldl
│ │ │  
    
│ │ │ -
    lists:mapfoldl/3 simultaneously maps and folds over a list:
    mapfoldl(F, Accu0, [Hd|Tail]) ->
│ │ │ -    {R,Accu1} = F(Hd, Accu0),
│ │ │ -    {Rs,Accu2} = mapfoldl(F, Accu1, Tail),
│ │ │ -    {[R|Rs], Accu2};
│ │ │ -mapfoldl(F, Accu, []) -> {[], Accu}.
    The following example shows how to change all letters in L to upper case and
│ │ │ -then count them.
    First the change to upper case:
    > Upcase =  fun(X) when $a =< X,  X =< $z -> X + $A - $a;
│ │ │ -(X) -> X
│ │ │ +
    lists:mapfoldl/3 simultaneously maps and folds over a list:
    mapfoldl(F, Accu0, [Hd|Tail]) ->
│ │ │ +    {R,Accu1} = F(Hd, Accu0),
│ │ │ +    {Rs,Accu2} = mapfoldl(F, Accu1, Tail),
│ │ │ +    {[R|Rs], Accu2};
│ │ │ +mapfoldl(F, Accu, []) -> {[], Accu}.
    The following example shows how to change all letters in L to upper case and
│ │ │ +then count them.
    First the change to upper case:
    > Upcase =  fun(X) when $a =< X,  X =< $z -> X + $A - $a;
│ │ │ +(X) -> X
│ │ │  end.
│ │ │  #Fun<erl_eval.6.72228031>
│ │ │  > Upcase_word =
│ │ │ -fun(X) ->
│ │ │ -lists:map(Upcase, X)
│ │ │ +fun(X) ->
│ │ │ +lists:map(Upcase, X)
│ │ │  end.
│ │ │  #Fun<erl_eval.6.72228031>
│ │ │ -> Upcase_word("Erlang").
│ │ │ +> Upcase_word("Erlang").
│ │ │  "ERLANG"
│ │ │ -> lists:map(Upcase_word, L).
│ │ │ -["I","LIKE","ERLANG"]
    Now, the fold and the map can be done at the same time:
    > lists:mapfoldl(fun(Word, Sum) ->
│ │ │ -{Upcase_word(Word), Sum + length(Word)}
│ │ │ -end, 0, L).
│ │ │ -{["I","LIKE","ERLANG"],11}
    
│ │ │ +> lists:map(Upcase_word, L).
│ │ │ +["I","LIKE","ERLANG"]
    Now, the fold and the map can be done at the same time:
    > lists:mapfoldl(fun(Word, Sum) ->
│ │ │ +{Upcase_word(Word), Sum + length(Word)}
│ │ │ +end, 0, L).
│ │ │ +{["I","LIKE","ERLANG"],11}
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    filter
│ │ │  
    
│ │ │  
    lists:filter/2 takes a predicate of one argument and a list and returns all elements
│ │ │ -in the list that satisfy the predicate:
    filter(F, [H|T]) ->
│ │ │ -    case F(H) of
│ │ │ -        true  -> [H|filter(F, T)];
│ │ │ -        false -> filter(F, T)
│ │ │ +in the list that satisfy the predicate:
    filter(F, [H|T]) ->
│ │ │ +    case F(H) of
│ │ │ +        true  -> [H|filter(F, T)];
│ │ │ +        false -> filter(F, T)
│ │ │      end;
│ │ │ -filter(F, []) -> [].
    > lists:filter(Big, [500,12,2,45,6,7]).
│ │ │ -[500,12,45]
    Combining maps and filters enables writing of very succinct code. For example,
│ │ │ +filter(F, []) -> [].
    > lists:filter(Big, [500,12,2,45,6,7]).
│ │ │ +[500,12,45]
    Combining maps and filters enables writing of very succinct code. For example,
│ │ │  to define a set difference function diff(L1, L2) to be the difference between
│ │ │ -the lists L1 and L2, the code can be written as follows:
    diff(L1, L2) ->
│ │ │ -    filter(fun(X) -> not member(X, L2) end, L1).
    This gives the list of all elements in L1 that are not contained in L2.
    The AND intersection of the list L1 and L2 is also easily defined:
    intersection(L1,L2) -> filter(fun(X) -> member(X,L1) end, L2).
    
│ │ │ +the lists L1 and L2, the code can be written as follows:
    diff(L1, L2) ->
│ │ │ +    filter(fun(X) -> not member(X, L2) end, L1).
    This gives the list of all elements in L1 that are not contained in L2.
    The AND intersection of the list L1 and L2 is also easily defined:
    intersection(L1,L2) -> filter(fun(X) -> member(X,L1) end, L2).
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    takewhile
│ │ │  
    
│ │ │  
    lists:takewhile/2 takes elements X from a list L as long as the predicate
│ │ │ -P(X) is true:
    takewhile(Pred, [H|T]) ->
│ │ │ -    case Pred(H) of
│ │ │ -        true  -> [H|takewhile(Pred, T)];
│ │ │ -        false -> []
│ │ │ +P(X) is true:
    takewhile(Pred, [H|T]) ->
│ │ │ +    case Pred(H) of
│ │ │ +        true  -> [H|takewhile(Pred, T)];
│ │ │ +        false -> []
│ │ │      end;
│ │ │ -takewhile(Pred, []) ->
│ │ │ -    [].
    > lists:takewhile(Big, [200,500,45,5,3,45,6]).
│ │ │ -[200,500,45]
    
│ │ │ +takewhile(Pred, []) ->
│ │ │ +    [].
    > lists:takewhile(Big, [200,500,45,5,3,45,6]).
│ │ │ +[200,500,45]
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    dropwhile
│ │ │  
    
│ │ │ -
    lists:dropwhile/2 is the complement of takewhile:
    dropwhile(Pred, [H|T]) ->
│ │ │ -    case Pred(H) of
│ │ │ -        true  -> dropwhile(Pred, T);
│ │ │ -        false -> [H|T]
│ │ │ +
    lists:dropwhile/2 is the complement of takewhile:
    dropwhile(Pred, [H|T]) ->
│ │ │ +    case Pred(H) of
│ │ │ +        true  -> dropwhile(Pred, T);
│ │ │ +        false -> [H|T]
│ │ │      end;
│ │ │ -dropwhile(Pred, []) ->
│ │ │ -    [].
    > lists:dropwhile(Big, [200,500,45,5,3,45,6]).
│ │ │ -[5,3,45,6]
    
│ │ │ +dropwhile(Pred, []) ->
│ │ │ +    [].
    > lists:dropwhile(Big, [200,500,45,5,3,45,6]).
│ │ │ +[5,3,45,6]
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    splitwith
│ │ │  
    
│ │ │  
    lists:splitwith/2 splits the list L into the two sublists {L1, L2}, where
│ │ │ -L = takewhile(P, L) and L2 = dropwhile(P, L):
    splitwith(Pred, L) ->
│ │ │ -    splitwith(Pred, L, []).
│ │ │ +L = takewhile(P, L) and L2 = dropwhile(P, L):
    splitwith(Pred, L) ->
│ │ │ +    splitwith(Pred, L, []).
│ │ │  
│ │ │ -splitwith(Pred, [H|T], L) ->
│ │ │ -    case Pred(H) of
│ │ │ -        true  -> splitwith(Pred, T, [H|L]);
│ │ │ -        false -> {reverse(L), [H|T]}
│ │ │ +splitwith(Pred, [H|T], L) ->
│ │ │ +    case Pred(H) of
│ │ │ +        true  -> splitwith(Pred, T, [H|L]);
│ │ │ +        false -> {reverse(L), [H|T]}
│ │ │      end;
│ │ │ -splitwith(Pred, [], L) ->
│ │ │ -    {reverse(L), []}.
    > lists:splitwith(Big, [200,500,45,5,3,45,6]).
│ │ │ -{[200,500,45],[5,3,45,6]}
    
│ │ │ +splitwith(Pred, [], L) ->
│ │ │ +    {reverse(L), []}.
    > lists:splitwith(Big, [200,500,45,5,3,45,6]).
│ │ │ +{[200,500,45],[5,3,45,6]}
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Funs Returning Funs
│ │ │  
    
│ │ │  
    So far, only functions that take funs as arguments have been described. More
│ │ │  powerful functions, that themselves return funs, can also be written. The
│ │ │  following examples illustrate these type of functions.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Simple Higher Order Functions
│ │ │  
    
│ │ │  
    Adder(X) is a function that given X, returns a new function G such that
│ │ │ -G(K) returns K + X:
    > Adder = fun(X) -> fun(Y) -> X + Y end end.
│ │ │ +G(K) returns K + X:
    > Adder = fun(X) -> fun(Y) -> X + Y end end.
│ │ │  #Fun<erl_eval.6.72228031>
│ │ │ -> Add6 = Adder(6).
│ │ │ +> Add6 = Adder(6).
│ │ │  #Fun<erl_eval.6.72228031>
│ │ │ -> Add6(10).
│ │ │ +> Add6(10).
│ │ │  16
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Infinite Lists
│ │ │  
    
│ │ │ -
    The idea is to write something like:
    -module(lazy).
│ │ │ --export([ints_from/1]).
│ │ │ -ints_from(N) ->
│ │ │ -    fun() ->
│ │ │ -            [N|ints_from(N+1)]
│ │ │ -    end.
    Then proceed as follows:
    > XX = lazy:ints_from(1).
│ │ │ +
    The idea is to write something like:
    -module(lazy).
│ │ │ +-export([ints_from/1]).
│ │ │ +ints_from(N) ->
│ │ │ +    fun() ->
│ │ │ +            [N|ints_from(N+1)]
│ │ │ +    end.
    Then proceed as follows:
    > XX = lazy:ints_from(1).
│ │ │  #Fun<lazy.0.29874839>
│ │ │ -> XX().
│ │ │ -[1|#Fun<lazy.0.29874839>]
│ │ │ -> hd(XX()).
│ │ │ +> XX().
│ │ │ +[1|#Fun<lazy.0.29874839>]
│ │ │ +> hd(XX()).
│ │ │  1
│ │ │ -> Y = tl(XX()).
│ │ │ +> Y = tl(XX()).
│ │ │  #Fun<lazy.0.29874839>
│ │ │ -> hd(Y()).
│ │ │ +> hd(Y()).
│ │ │  2
    And so on. This is an example of "lazy embedding".
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Parsing
│ │ │  
    
│ │ │ -
    The following examples show parsers of the following type:
    Parser(Toks) -> {ok, Tree, Toks1} | fail
    Toks is the list of tokens to be parsed. A successful parse returns
│ │ │ +
    The following examples show parsers of the following type:
    Parser(Toks) -> {ok, Tree, Toks1} | fail
    Toks is the list of tokens to be parsed. A successful parse returns
│ │ │  {ok, Tree, Toks1}.
    • Tree is a parse tree.
    • Toks1 is a tail of Tree that contains symbols encountered after the
│ │ │  structure that was correctly parsed.
    An unsuccessful parse returns fail.
    The following example illustrates a simple, functional parser that parses the
│ │ │  grammar:
    (a | b) & (c | d)
    The following code defines a function pconst(X) in the module funparse,
│ │ │ -which returns a fun that parses a list of tokens:
    pconst(X) ->
│ │ │ -    fun (T) ->
│ │ │ +which returns a fun that parses a list of tokens:
    pconst(X) ->
│ │ │ +    fun (T) ->
│ │ │         case T of
│ │ │ -           [X|T1] -> {ok, {const, X}, T1};
│ │ │ +           [X|T1] -> {ok, {const, X}, T1};
│ │ │             _      -> fail
│ │ │         end
│ │ │ -    end.
    This function can be used as follows:
    > P1 = funparse:pconst(a).
│ │ │ +    end.
    This function can be used as follows:
    > P1 = funparse:pconst(a).
│ │ │  #Fun<funparse.0.22674075>
│ │ │ -> P1([a,b,c]).
│ │ │ -{ok,{const,a},[b,c]}
│ │ │ -> P1([x,y,z]).
│ │ │ +> P1([a,b,c]).
│ │ │ +{ok,{const,a},[b,c]}
│ │ │ +> P1([x,y,z]).
│ │ │  fail
    Next, the two higher order functions pand and por are defined. They combine
│ │ │ -primitive parsers to produce more complex parsers.
    First pand:
    pand(P1, P2) ->
│ │ │ -    fun (T) ->
│ │ │ -        case P1(T) of
│ │ │ -            {ok, R1, T1} ->
│ │ │ -                case P2(T1) of
│ │ │ -                    {ok, R2, T2} ->
│ │ │ -                        {ok, {'and', R1, R2}};
│ │ │ +primitive parsers to produce more complex parsers.
    First pand:
    pand(P1, P2) ->
│ │ │ +    fun (T) ->
│ │ │ +        case P1(T) of
│ │ │ +            {ok, R1, T1} ->
│ │ │ +                case P2(T1) of
│ │ │ +                    {ok, R2, T2} ->
│ │ │ +                        {ok, {'and', R1, R2}};
│ │ │                      fail ->
│ │ │                          fail
│ │ │                  end;
│ │ │              fail ->
│ │ │                  fail
│ │ │          end
│ │ │      end.
    Given a parser P1 for grammar G1, and a parser P2 for grammar G2,
│ │ │  pand(P1, P2) returns a parser for the grammar, which consists of sequences of
│ │ │  tokens that satisfy G1, followed by sequences of tokens that satisfy G2.
    por(P1, P2) returns a parser for the language described by the grammar G1 or
│ │ │ -G2:
    por(P1, P2) ->
│ │ │ -    fun (T) ->
│ │ │ -        case P1(T) of
│ │ │ -            {ok, R, T1} ->
│ │ │ -                {ok, {'or',1,R}, T1};
│ │ │ +G2:
    por(P1, P2) ->
│ │ │ +    fun (T) ->
│ │ │ +        case P1(T) of
│ │ │ +            {ok, R, T1} ->
│ │ │ +                {ok, {'or',1,R}, T1};
│ │ │              fail ->
│ │ │ -                case P2(T) of
│ │ │ -                    {ok, R1, T1} ->
│ │ │ -                        {ok, {'or',2,R1}, T1};
│ │ │ +                case P2(T) of
│ │ │ +                    {ok, R1, T1} ->
│ │ │ +                        {ok, {'or',2,R1}, T1};
│ │ │                      fail ->
│ │ │                          fail
│ │ │                  end
│ │ │          end
│ │ │      end.
    The original problem was to parse the grammar (a | b) & (c | d). The following
│ │ │ -code addresses this problem:
    grammar() ->
│ │ │ -    pand(
│ │ │ -         por(pconst(a), pconst(b)),
│ │ │ -         por(pconst(c), pconst(d))).
    The following code adds a parser interface to the grammar:
    parse(List) ->
│ │ │ -    (grammar())(List).
    The parser can be tested as follows:
    > funparse:parse([a,c]).
│ │ │ -{ok,{'and',{'or',1,{const,a}},{'or',1,{const,c}}}}
│ │ │ -> funparse:parse([a,d]).
│ │ │ -{ok,{'and',{'or',1,{const,a}},{'or',2,{const,d}}}}
│ │ │ -> funparse:parse([b,c]).
│ │ │ -{ok,{'and',{'or',2,{const,b}},{'or',1,{const,c}}}}
│ │ │ -> funparse:parse([b,d]).
│ │ │ -{ok,{'and',{'or',2,{const,b}},{'or',2,{const,d}}}}
│ │ │ -> funparse:parse([a,b]).
│ │ │ +code addresses this problem:
    grammar() ->
│ │ │ +    pand(
│ │ │ +         por(pconst(a), pconst(b)),
│ │ │ +         por(pconst(c), pconst(d))).
    The following code adds a parser interface to the grammar:
    parse(List) ->
│ │ │ +    (grammar())(List).
    The parser can be tested as follows:
    > funparse:parse([a,c]).
│ │ │ +{ok,{'and',{'or',1,{const,a}},{'or',1,{const,c}}}}
│ │ │ +> funparse:parse([a,d]).
│ │ │ +{ok,{'and',{'or',1,{const,a}},{'or',2,{const,d}}}}
│ │ │ +> funparse:parse([b,c]).
│ │ │ +{ok,{'and',{'or',2,{const,b}},{'or',1,{const,c}}}}
│ │ │ +> funparse:parse([b,d]).
│ │ │ +{ok,{'and',{'or',2,{const,b}},{'or',2,{const,d}}}}
│ │ │ +> funparse:parse([a,b]).
│ │ │  fail
    
│ │ │  
│ │ │  
│ │ │  
    
│ │ │  
    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
│ │ │  the gen_server is registered using global:register_name/2.
    • The second argument, ch3, is the name of the callback module, which is
│ │ │  the module where the callback functions are located.
      The interface functions (start_link/0, alloc/0, and free/1) are located
│ │ │  in the same module as the callback functions (init/1, handle_call/3, and
│ │ │  handle_cast/2). It is usually good programming practice to have the code
│ │ │  corresponding to one process contained in a single module.
    • The third argument, [], is a term that is passed as is to the callback
│ │ │  function init. Here, init does not need any indata and ignores the
│ │ │  argument.
    • The fourth argument, [], is a list of options. See gen_server
│ │ │  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
│ │ │  gen_server that is not part of a supervision tree.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │ @@ -221,32 +221,32 @@
│ │ │  
    
│ │ │  
    The synchronous request alloc() is implemented using gen_server:call/2:
    alloc() ->
│ │ │      gen_server:call(ch3, alloc).
    ch3 is the name of the gen_server and must agree with the name
│ │ │  used to start it. alloc is the actual request.
    The request is made into a message and sent to the gen_server.
│ │ │  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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Stopping
│ │ │  
    
│ │ │  
    
│ │ │ @@ -257,69 +257,69 @@
│ │ │  
    
│ │ │  
    If the gen_server is part of a supervision tree, no stop function is needed.
│ │ │  The gen_server is automatically terminated by its supervisor.  Exactly how
│ │ │  this is done is defined by a shutdown strategy
│ │ │  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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Standalone Gen_Servers
│ │ │  
    
│ │ │  
    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
│ │ │  of the gen_server.  This causes the gen_server to call
│ │ │  terminate(normal, State1) and then it terminates gracefully.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Handling Other Messages
│ │ │  
    
│ │ │  
    If the gen_server is to be able to receive other messages than requests,
│ │ │  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}.
    
│ │ │  
│ │ │  
│ │ │  
    
│ │ │    
    
│ │ │  
│ │ │        
    
│ │ │      
│ │ │    
│ │ │    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"}]}
│ │ │ + ]}.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Synchronizing Processes during Startup
│ │ │  
    
│ │ │  
    The supervisor tree of an included application is started as part of the
│ │ │  supervisor tree of the including application. If there is a need for
│ │ │  synchronization between processes in the including and included applications,
│ │ │  this can be achieved by using start phases.
    Start phases are defined by the start_phases key in the .app file as a list
│ │ │  of tuples {Phase,PhaseArgs}, where Phase is an atom and PhaseArgs is a
│ │ │  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
│ │ │  Module:start_phase(Phase, Type, PhaseArgs) for each phase defined for the
│ │ │  primary application, in that order. If a phase is not defined for an included
│ │ │  application, the function is not called for this phase and application.
    The following requirements apply to the .app file for an included application:
    • The {mod, {Module,StartArgs}} option must be included. This option is used
│ │ │  to find the callback module Module of the application. StartArgs is
│ │ │  ignored, as Module:start/2 is called only for the primary application.
    • If the included application itself contains included applications, instead the
│ │ │  {mod, {application_starter, [Module,StartArgs]}} option must be included.
    • The {start_phases, [{Phase,PhaseArgs}]} option must be included, and the set
│ │ │  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
    
│ │ │  
    
│ │ │  
│ │ │  
    
│ │ │      
│ │ │    
│ │ │    Frequently Asked Questions
│ │ │  
    
│ │ │  
    •   Q: So, now I can build Erlang using GCC on Windows?
      A: No, unfortunately not. You'll need Microsoft's Visual C++
│ │ ├── ./usr/share/doc/erlang-doc/html/doc/system/list_comprehensions.html
│ │ │ @@ -117,33 +117,33 @@
│ │ │  
│ │ │  
      
│ │ │    
│ │ │      
│ │ │    
│ │ │    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
│ │ │  the pivot element.
        1. The sublists are recursively sorted by the same algorithm and the results
│ │ │  are combined, resulting in a list consisting of:
        • All elements from the first sublist, that is all elements smaller than the
│ │ │  pivot element, in sorted order.
        • The pivot element.
        • All elements from the second sublist, that is all elements greater than or
│ │ │  equal to the pivot element, in sorted order.
      Note
      While the sorting algorithm as shown above serves as a nice example to
│ │ │ @@ -151,93 +151,93 @@
│ │ │  lists module contains sorting functions that are implemented in a more
│ │ │  efficient way.
      
│ │ │    
│ │ │      
│ │ │    
│ │ │    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]]
      
│ │ │    
│ │ │      
│ │ │    
│ │ │    Pythagorean Triplets
│ │ │  
      
│ │ │  
      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)].
      
│ │ │    
│ │ │      
│ │ │    
│ │ │    Variable Bindings in List Comprehensions
│ │ │  
      
│ │ │  
      The scope rules for variables that occur in list comprehensions are as follows:
      • All variables that occur in a generator pattern are assumed to be "fresh"
│ │ │  variables.
      • Any variables that are defined before the list comprehension, and that are
│ │ │  used in filters, have the values they had before the list comprehension.
      • Variables cannot be exported from a list comprehension.
      As an example of these rules, suppose you want to write the function select,
│ │ │  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, ...]
│ │ │      ...
      
│ │ │  
│ │ │  
│ │ │  
      
│ │ │    
      
│ │ │  
│ │ │        
│ │ │    Creating a List
│ │ │  
│ │ │  
      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.
      
│ │ │    
│ │ │      
│ │ │    
│ │ │    Deep and Flat Lists
│ │ │  
      
│ │ │  
      lists:flatten/1 builds an entirely new list. It is therefore expensive, and
│ │ │  even more expensive than the ++ operator (which copies its left argument,
│ │ │  but not its right argument).
      In the following situations it is unnecessary to call lists:flatten/1:
      • When sending data to a port. Ports understand deep lists so there is no reason
│ │ │  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]
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Recursive List Functions
│ │ │  
    
│ │ │  
    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,
│ │ │  concentrate on writing beautiful code and forget about the performance
│ │ │  of your list functions. In the time-critical parts of your code,
│ │ │  measure before rewriting your code.
    For a thorough discussion about tail and body recursion, see
│ │ │  Erlang's Tail Recursion is Not a Silver Bullet.
    Note
    This section is about list functions that construct lists. A tail-recursive
│ │ │  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.
    
│ │ │  
│ │ │  
│ │ │  
    
│ │ │    
    
│ │ │  
│ │ │        
    
│ │ │      
│ │ │    
│ │ │    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
│ │ │  the case, the value of the environment variable VAR as returned by
│ │ │  os:getenv(VAR) is substituted for $VAR. If os:getenv(VAR) returns false,
│ │ │  $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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Predefined Macros
│ │ │ @@ -185,29 +185,29 @@
│ │ │      
│ │ │    
│ │ │    Macros Overloading
│ │ │  
    
│ │ │  
    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).
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Conditional Compilation
│ │ │  
    
│ │ │  
    The following macro directives support conditional compilation:
    • -ifdef(Macro). - Evaluate the following lines only if Macro is
│ │ │  defined.
    • -ifndef(Macro). - Evaluate the following lines only if Macro is not
│ │ │ @@ -219,43 +219,43 @@
│ │ │  true, and the Condition evaluates to true, the lines following the elif
│ │ │  are evaluated instead.
    • -endif. - Specifies the end of a series of control flow directives.
    Note
    Macro directives cannot be used inside functions.
    Syntactically, the Condition in if and elif must be a
│ │ │  guard expression. Other constructs (such as
│ │ │  a case expression) result in a compilation error.
    As opposed to the standard guard expressions, an expression in an if and
│ │ │  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
│ │ │  compiled:
    % erlc -Ddebug m.erl
│ │ │  
│ │ │  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.
│ │ │  -endif.
│ │ │  ...
    This code uses the OTP_RELEASE macro and defined(debug) to compile debug
│ │ │  code only for OTP 26 or later.
    
│ │ │    
│ │ │ @@ -270,44 +270,44 @@
│ │ │  used. In practice this means it should appear before any -export(..) or record
│ │ │  definitions.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    -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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Stringifying Macro Arguments
│ │ │  
    
│ │ │  
    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.
    
│ │ │  
    
│ │ │  
│ │ │  
    
│ │ │    
    
│ │ │  
│ │ │        
  • maps:get/3 function. If there are default
│ │ │  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)
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Using Maps as Dictionaries
│ │ │  
    
│ │ │  
    Using a map as a dictionary implies the following usage pattern:
    • Keys are usually variables not known at compile-time.
    • There can be any number of elements in the map.
    • Usually, no more than one element is looked up or updated at once.
    Given that usage pattern, the difference in performance between using the map
│ │ │  syntax and the maps module is usually small. Therefore, which one to use is
│ │ │ @@ -167,18 +167,18 @@
│ │ │  choice.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    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
│ │ │  be a better choice than sets.
    • If the intersection operation is frequently used and operations that operate
│ │ │  on a single element in a set (such as is_element/2) must also be efficient,
│ │ │  gb_sets can potentially be a better choice than sets.
    • If the elements of the set are integers in a fairly compact range, the set can
│ │ │  be represented as an integer where each bit represents an element in the set.
│ │ │ @@ -203,18 +203,18 @@
│ │ │  for the runtime system).
    • N - The number of elements in the map.
    • Keys - A tuple with keys of the map: {Key1,...,KeyN}. The keys are
│ │ │  sorted.
    • Value1 - The value corresponding to the first key in the key tuple.
    • ValueN - The value corresponding to the last key in the key tuple.
    As an example, let us look at how the map #{a => foo, z => bar} is
│ │ │  represented:
    01234
    FLATMAP2{a,z}foobar
    Table: #{a => foo, z => bar}
    Let us update the map: M#{q => baz}. The map now looks like this:
    012345
    FLATMAP3{a,q,z}foobazbar
    Table: #{a => foo, q => baz, z => bar}
    Finally, change the value of one element: M#{z := bird}. The map now looks
│ │ │  like this:
    012345
    FLATMAP3{a,q,z}foobazbird
    Table: #{a => foo, q => baz, z => bird}
    When the value for an existing key is updated, the key tuple is not updated,
│ │ │  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
│ │ │  could be identical, so the operations need to be performed sequentially from
│ │ │  left to right.)
    The memory size for a small map is the size of all keys and values plus 5 words.
│ │ │  See Memory for more information about memory sizes.
    
│ │ │    
│ │ │ @@ -241,21 +241,21 @@
│ │ │    
│ │ │      
│ │ │    
│ │ │    Using the Map Syntax
│ │ │  
    
│ │ │  
    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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Using the Functions in the maps Module
│ │ │  
    
│ │ │  
    Here follows some notes about most of the functions in the maps module. For
│ │ │ @@ -306,23 +306,23 @@
│ │ │    
│ │ │      
│ │ │    
│ │ │    maps:get/3
│ │ │  
│ │ │  
    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
│ │ │  default values.
    Change
    Before OTP 26.0 maps:get/3 was implemented by calling the function instead
│ │ │  of rewriting it as an Erlang expression. It is now slightly faster but can no
│ │ │  longer be traced.
    
│ │ │    
│ │ ├── ./usr/share/doc/erlang-doc/html/doc/system/modules.html
│ │ │ @@ -118,20 +118,20 @@
│ │ │  
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Module Attributes
│ │ │  
    
│ │ │ @@ -176,71 +176,71 @@
│ │ │  meaning.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    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"
│ │ │     """
│ │ │  -doc ~B|Example "docs"|.
      For clarity it is recommended to use either normal "strings" or triple
│ │ │  quoted strings for documentation attributes.
    • {file, file:name/0 } - Read the contents of filename and use
│ │ │  that as the documentation string.
    • false - Set the current entity as hidden, that is, it should not be
│ │ │ @@ -253,15 +253,15 @@
│ │ │    
│ │ │      
│ │ │    
│ │ │    The feature directive
│ │ │  
    
│ │ │  
    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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Comments
│ │ │  
    
│ │ │  
    Comments can be placed anywhere in a module except within strings and
│ │ ├── ./usr/share/doc/erlang-doc/html/doc/system/nif.html
│ │ │ @@ -133,26 +133,26 @@
│ │ │    Erlang Program
│ │ │  
│ │ │  
    Even if all functions of a module are NIFs, an Erlang module is still needed for
│ │ │  two reasons:
    • The NIF library must be explicitly loaded by Erlang code in the same module.
    • All NIFs of a module must have an Erlang implementation as well.
    Normally these are minimal stub implementations that throw an exception. But
│ │ │  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
│ │ │  foo and bar to be dispatched to the NIF implementations instead.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │ @@ -209,23 +209,23 @@
│ │ │    
│ │ │      
│ │ │    
│ │ │    Running the Example
│ │ │  
    
│ │ │  
    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/erlang-doc/html/doc/system/opaques.html
│ │ │ @@ -122,24 +122,24 @@
│ │ │    Opaque Type Aliases
│ │ │  
│ │ │  
    The main use case for opacity in Erlang is to hide the implementation of a data
│ │ │  type, enabling evolving the API while minimizing the risk of breaking consumers.
│ │ │  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
│ │ │  example, sets module provides sets:new/0, sets:add_element/2,
│ │ │  sets:is_element/2, and so on.
    • sets:set(a) is a subtype of sets:set(a | b) and not the
│ │ │  other way around. Generally, you can rely on the property that the_opaque(T)
│ │ │  is a subtype of the_opaque(U) when T is a subtype of U.
    When defining your own opaques, here are some recommendations:
    • Since consumers are expected to not rely on the definition of the opaque type,
│ │ ├── ./usr/share/doc/erlang-doc/html/doc/system/otp-patch-apply.html
│ │ │ @@ -201,15 +201,15 @@
│ │ │    
│ │ │    Sanity check
│ │ │  
│ │ │  
      The application dependencies can be checked using the Erlang shell.
│ │ │  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/erlang-doc/html/doc/system/patterns.html
│ │ │ @@ -128,18 +128,18 @@
│ │ │  succeeds, any unbound variables in the pattern become bound. If the matching
│ │ │  fails, an exception is raised.
    Examples:
    1> X.
│ │ │  ** 1:1: variable 'X' is unbound **
│ │ │  2> X = 2.
│ │ │  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/erlang-doc/html/doc/system/prog_ex_records.html
│ │ │ @@ -122,105 +122,105 @@
│ │ │    Records and Tuples
│ │ │  
│ │ │  
    The main advantage of using records rather than tuples is that fields in a
│ │ │  record are accessed by name, whereas fields in a tuple are accessed by position.
│ │ │  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}
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Defining a Record
│ │ │  
    
│ │ │  
    This following definition of a person is used in several examples in this
│ │ │  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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    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.)
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    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"
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Nested Records
│ │ │  
    
│ │ │  
    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".
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    A Longer Example
│ │ │  
    
│ │ │  
    Comments are embedded in the following example:
    %% File: person.hrl
│ │ │  
│ │ │ @@ -230,48 +230,48 @@
│ │ │  %%    name:  A string (default is undefined).
│ │ │  %%    age:   An integer (default is undefined).
│ │ │  %%    phone: A list of integers (default is []).
│ │ │  %%    dict:  A dictionary containing various information
│ │ │  %%           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]}}.
    
│ │ │  
    
│ │ │  
│ │ │  
    
│ │ │    
    
│ │ │  
│ │ │        
    
│ │ │      
│ │ │    
│ │ │    Header Files
│ │ │  
    
│ │ │  
    As shown above, some files have extension .hrl. These are header files that
│ │ │ -are included in the .erl files by:
    -include("File_Name").
    for example:
    -include("mess_interface.hrl").
    In the case above the file is fetched from the same directory as all the other
│ │ │ +are included in the .erl files by:
    -include("File_Name").
    for example:
    -include("mess_interface.hrl").
    In the case above the file is fetched from the same directory as all the other
│ │ │  files in the messenger example. (manual).
    .hrl files can contain any valid Erlang code but are most often used for record
│ │ │  and macro definitions.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Records
│ │ │  
    
│ │ │ -
    A record is defined as:
    -record(name_of_record,{field_name1, field_name2, field_name3, ......}).
    For example:
    -record(message_to,{to_name, message}).
    This is equivalent to:
    {message_to, To_Name, Message}
    Creating a record is best illustrated by an example:
    #message_to{message="hello", to_name=fred)
    This creates:
    {message_to, fred, "hello"}
    Notice that you do not have to worry about the order you assign values to the
│ │ │ +
    A record is defined as:
    -record(name_of_record,{field_name1, field_name2, field_name3, ......}).
    For example:
    -record(message_to,{to_name, message}).
    This is equivalent to:
    {message_to, To_Name, Message}
    Creating a record is best illustrated by an example:
    #message_to{message="hello", to_name=fred)
    This creates:
    {message_to, fred, "hello"}
    Notice that you do not have to worry about the order you assign values to the
│ │ │  various parts of the records when you create it. The advantage of using records
│ │ │  is that by placing their definitions in header files you can conveniently define
│ │ │  interfaces that are easy to change. For example, if you want to add a new field
│ │ │  to the record, you only have to change the code where the new field is used and
│ │ │  not at every place the record is referred to. If you leave out a field when
│ │ │  creating a record, it gets the value of the atom undefined. (manual)
    Pattern matching with records is very similar to creating records. For example,
│ │ │ -inside a case or receive:
    #message_to{to_name=ToName, message=Message} ->
    This is the same as:
    {message_to, ToName, Message}
    
│ │ │ +inside a case or receive:
    #message_to{to_name=ToName, message=Message} ->
    This is the same as:
    {message_to, ToName, Message}
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Macros
│ │ │  
    
│ │ │  
    Another thing that has been added to the messenger is a macro. The file
│ │ │  mess_config.hrl contains the definition:
    %%% Configure the location of the server node,
│ │ │ --define(server_node, messenger@super).
    This file is included in mess_server.erl:
    -include("mess_config.hrl").
    Every occurrence of ?server_node in mess_server.erl is now replaced by
│ │ │ -messenger@super.
    A macro is also used when spawning the server process:
    spawn(?MODULE, server, [])
    This is a standard macro (that is, defined by the system, not by the user).
│ │ │ +-define(server_node, messenger@super).
    This file is included in mess_server.erl:
    -include("mess_config.hrl").
    Every occurrence of ?server_node in mess_server.erl is now replaced by
│ │ │ +messenger@super.
    A macro is also used when spawning the server process:
    spawn(?MODULE, server, [])
    This is a standard macro (that is, defined by the system, not by the user).
│ │ │  ?MODULE is always replaced by the name of the current module (that is, the
│ │ │  -module definition near the start of the file). There are more advanced ways
│ │ │  of using macros with, for example, parameters.
    The three Erlang (.erl) files in the messenger example are individually
│ │ │  compiled into object code file (.beam). The Erlang system loads and links
│ │ │  these files into the system when they are referred to during execution of the
│ │ │  code. In this case, they are simply put in our current working directory (that
│ │ │  is, the place you have done "cd" to). There are ways of putting the .beam
│ │ ├── ./usr/share/doc/erlang-doc/html/doc/system/ref_man_functions.html
│ │ │ @@ -120,51 +120,51 @@
│ │ │      
│ │ │    
│ │ │    Function Declaration Syntax
│ │ │  
│ │ │  
    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
│ │ │  are two different functions.
    A function named f in module mod and with arity N is often denoted as
│ │ │  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
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Function Evaluation
│ │ │  
    
│ │ │  
    When a function M:F/N is called, first the code for the function is located.
│ │ │  If the function cannot be found, an undef runtime error occurs. Notice that
│ │ │  the function must be exported to be visible outside the module it is defined in.
    If the function is found, the function clauses are scanned sequentially until a
│ │ │  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
│ │ │  and the body is evaluated:
    1 * fact(0) =>
│ │ │  1 * 1 =>
│ │ │  1
    Evaluation has succeed and mod:fact(1) returns 1.
    If mod:fact/1 is called with a negative number as argument, no clause head
│ │ │  matches. A function_clause runtime error occurs.
    
│ │ │ @@ -173,17 +173,17 @@
│ │ │    
│ │ │    Tail recursion
│ │ │  
    
│ │ │  
    If the last expression of a function body is a function call, a
│ │ │  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).
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Built-In Functions (BIFs)
│ │ │  
    
│ │ │ @@ -191,17 +191,17 @@
│ │ │  system. BIFs do things that are difficult or impossible to implement
│ │ │  in Erlang. Most of the BIFs belong to module erlang, but there
│ │ │  are also BIFs belonging to a few other modules, for example lists
│ │ │  and ets.
    The most commonly used BIFs belonging to erlang are auto-imported. They do
│ │ │  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"
    
│ │ │  
│ │ │  
│ │ │  
    
│ │ │    
    
│ │ │  
│ │ │        
    
│ │ │      
│ │ │    
│ │ │    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:
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Registered Processes
│ │ │  
    
│ │ │  
    Besides addressing a process by using its pid, there are also BIFs for
│ │ ├── ./usr/share/doc/erlang-doc/html/doc/system/ref_man_records.html
│ │ │ @@ -123,17 +123,17 @@
│ │ │      
│ │ │    
│ │ │    Defining Records
│ │ │  
│ │ │  
    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
│ │ │  definition is placed in an include file.
    Change
    Starting from Erlang/OTP 26, records can be defined in the Erlang shell
│ │ │  using the syntax described in this section. In earlier releases, it was
│ │ │  necessary to use the shell built-in function rd/2.
    
│ │ │    
│ │ │ @@ -143,32 +143,32 @@
│ │ │  
    
│ │ │  
    The following expression creates a new Name record where the value of each
│ │ │  field FieldI is the value of evaluating the corresponding expression ExprI:
    #Name{Field1=Expr1, ..., FieldK=ExprK}
    The fields can be in any order, not necessarily the same order as in the record
│ │ │  definition, and fields can be omitted. Omitted fields get their respective
│ │ │  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).
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Updating Records
│ │ │  
    
│ │ │  
    Expr#Name{Field1=Expr1, ..., FieldK=ExprK}
    Expr is to evaluate to a Name record. A copy of this record is returned,
│ │ │  with the value of each specified field FieldI changed to the value of
│ │ │ @@ -178,51 +178,51 @@
│ │ │      
│ │ │    
│ │ │    Records in Guards
│ │ │  
│ │ │  
    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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Records in Patterns
│ │ │  
    
│ │ │  
    A pattern that matches a certain record is created in the same way as a record
│ │ │  is created:
    #Name{Field1=Expr1, ..., FieldK=ExprK}
    In this case, one or more of Expr1 ... ExprK can be unbound variables.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    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.
    
│ │ │  
    
│ │ │  
│ │ │  
    
│ │ │    
    
│ │ │  
│ │ │        
    gen_server, simple code replacement is not sufficient.
│ │ │  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
│ │ │  instead.
    The release handler suspends, asks for code change, and resumes processes by
│ │ │  calling the functions sys:suspend/1,2, sys:change_code/4,5, and
│ │ │  sys:resume/1,2, respectively.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Application Instructions
│ │ │ @@ -341,60 +341,60 @@
│ │ │  .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
│ │ │  typical upgrade/downgrade cases.
    Example: Consider the release ch_rel-1 from
│ │ │  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}]}]
│ │ │ +}.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Release Upgrade File
│ │ │  
    
│ │ │  
    To define how to upgrade/downgrade between the new version and previous versions
│ │ │  of a release, a release upgrade file, or in short .relup file, is to be
│ │ │ @@ -405,22 +405,22 @@
│ │ │  are to be added and deleted, and which applications that must be upgraded and/or
│ │ │  downgraded. The instructions for this are fetched from the .appup files and
│ │ │  transformed into a single list of low-level instructions in the right order.
    If the relup file is relatively simple, it can be created manually. It is only
│ │ │  to contain low-level instructions.
    For details about the syntax and contents of the release upgrade file, see
│ │ │  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
│ │ │  path, as well as the .appup and (new) .beam files. The code path can be
│ │ │  extended by using the option path:
    1> systools:make_relup("ch_rel-2", ["ch_rel-1"], ["ch_rel-1"],
│ │ │  [{path,["../ch_rel-1",
│ │ │  "../ch_rel-1/lib/ch_app-1/ebin"]}]).
│ │ │ @@ -433,25 +433,25 @@
│ │ │  
    When you have made a new version of a release, a release package can be created
│ │ │  with this new version and transferred to the target environment.
    To install the new version of the release in runtime, the release
│ │ │  handler is used. This is a process belonging to the SASL application,
│ │ │  which handles unpacking, installation, and removal of release
│ │ │  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
      
│ │ │    
│ │ │      
│ │ │    
│ │ │    Example (continued from the previous sections)
│ │ │ @@ -462,17 +462,17 @@
│ │ │  is needed, the file is to contain the empty list:
      [].
      Step 2) Start the system as a simple target system. In reality, it is to be
│ │ │  started as an embedded system. However, using erl with the correct boot script
│ │ │  and config file is enough for illustration purposes:
      % cd $ROOT
│ │ │  % bin/erl -boot $ROOT/releases/A/start -config $ROOT/releases/A/sys
│ │ │  ...
      $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
│ │ │  lib/kernel-9.2.4/ebin/application.beam
│ │ │  ...
│ │ │  lib/stdlib-5.2.3/ebin/stdlib.app
│ │ │  lib/stdlib-5.2.3/ebin/argparse.beam
│ │ │ @@ -485,31 +485,31 @@
│ │ │  lib/ch_app-2/ebin/ch_sup.beam
│ │ │  lib/ch_app-2/ebin/ch3.beam
│ │ │  releases/B/start.boot
│ │ │  releases/B/relup
│ │ │  releases/B/sys.config
│ │ │  releases/B/ch_rel-2.rel
│ │ │  releases/ch_rel-2.rel
      Step 4) Copy the release package ch_rel-2.tar.gz to the $ROOT/releases
│ │ │ -directory.
      Step 5) In the running target system, unpack the release package:
      1> release_handler:unpack_release("ch_rel-2").
│ │ │ -{ok,"B"}
      The new application version ch_app-2 is installed under $ROOT/lib next to
│ │ │ +directory.
      Step 5) In the running target system, unpack the release package:
      1> release_handler:unpack_release("ch_rel-2").
│ │ │ +{ok,"B"}
      The new application version ch_app-2 is installed under $ROOT/lib next to
│ │ │  ch_app-1. The kernel, stdlib, and sasl directories are not affected, as
│ │ │  they have not changed.
      Under $ROOT/releases, a new directory B is created, containing
│ │ │ -ch_rel-2.rel, start.boot, sys.config, and relup.
      Step 6) Check if the function ch3:available/0 is available:
      2> ch3:available().
│ │ │ +ch_rel-2.rel, start.boot, sys.config, and relup.
      Step 6) Check if the function ch3:available/0 is available:
      2> ch3:available().
│ │ │  ** exception error: undefined function ch3:available/0
      Step 7) Install the new release. The instructions in $ROOT/releases/B/relup
│ │ │  are executed one by one, resulting in the new version of ch3 being loaded. The
│ │ │ -function ch3:available/0 is now available:
      3> release_handler:install_release("B").
│ │ │ -{ok,"A",[]}
│ │ │ -4> ch3:available().
│ │ │ +function ch3:available/0 is now available:
      3> release_handler:install_release("B").
│ │ │ +{ok,"A",[]}
│ │ │ +4> ch3:available().
│ │ │  3
│ │ │ -5> code:which(ch3).
│ │ │ +5> code:which(ch3).
│ │ │  ".../lib/ch_app-2/ebin/ch3.beam"
│ │ │ -6> code:which(ch_sup).
│ │ │ +6> code:which(ch_sup).
│ │ │  ".../lib/ch_app-1/ebin/ch_sup.beam"
      Processes in ch_app for which code have not been updated, for example, the
│ │ │  supervisor, are still evaluating code from ch_app-1.
      Step 8) If the target system is now rebooted, it uses version "A" again. The
│ │ │ -"B" version must be made permanent, to be used when the system is rebooted.
      7> release_handler:make_permanent("B").
│ │ │ +"B" version must be made permanent, to be used when the system is rebooted.
      7> release_handler:make_permanent("B").
│ │ │  ok
      
│ │ │    
│ │ │      
│ │ │    
│ │ │    Updating Application Specifications
│ │ │  
      
│ │ │  
      When a new version of a release is installed, the application specifications are
│ │ │ @@ -518,15 +518,15 @@
│ │ │  boot script is generated from the same .rel file as is used to build the
│ │ │  release package itself.
      Specifically, the application configuration parameters are automatically updated
│ │ │  according to (in increasing priority order):
      • The data in the boot script, fetched from the new application resource file
│ │ │  App.app
      • The new sys.config
      • Command-line arguments -App Par Val
      This means that parameter values set in the other system configuration files and
│ │ │  values set using application:set_env/3 are disregarded.
      When an installed release is made permanent, the system process init is set to
│ │ │  point out the new sys.config.
      After the installation, the application controller compares the old and new
│ │ │  configuration parameters for all running applications and call the callback
│ │ │ -function:
      Module:config_change(Changed, New, Removed)
      • Module is the application callback module as defined by the mod key in the
│ │ │ +function:
        Module:config_change(Changed, New, Removed)
        • Module is the application callback module as defined by the mod key in the
│ │ │  .app file.
        • Changed and New are lists of {Par,Val} for all changed and added
│ │ │  configuration parameters, respectively.
        • Removed is a list of all parameters Par that have been removed.
        The function is optional and can be omitted when implementing an application
│ │ │  callback module.
        
│ │ │  
    
│ │ │  
│ │ │  
    
│ │ │    
    
│ │ ├── ./usr/share/doc/erlang-doc/html/doc/system/release_structure.html
│ │ │ @@ -136,37 +136,37 @@
│ │ │    
│ │ │      
│ │ │    
│ │ │    Release Resource File
│ │ │  
│ │ │  
    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"}]
│ │ │ +}.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Generating Boot Scripts
│ │ │  
    
│ │ │  
    systools in the SASL application includes tools to build and check
│ │ │  releases. The functions read the .rel and .app files and perform
│ │ │ @@ -190,17 +190,17 @@
│ │ │    
│ │ │      
│ │ │    
│ │ │    Creating a Release Package
│ │ │  
│ │ │  
    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
│ │ │  lib/kernel-9.2.4/ebin/application.beam
│ │ │  ...
│ │ │  lib/stdlib-5.2.3/ebin/stdlib.app
│ │ │  lib/stdlib-5.2.3/ebin/argparse.beam
│ │ ├── ./usr/share/doc/erlang-doc/html/doc/system/robustness.html
│ │ │ @@ -128,68 +128,68 @@
│ │ │  
│ │ │  
    Before improving the messenger program, let us look at some general principles,
│ │ │  using the ping pong program as an example. Recall that when "ping" finishes, it
│ │ │  tells "pong" that it has done so by sending the atom finished as a message to
│ │ │  "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
│ │ │  Pong received ping
│ │ │  Pong received ping
│ │ │  Pong timed out
    And the following is seen on (ping@gollum):
    (ping@gollum)1> tut19:start_ping(pong@kosken).
│ │ │  <0.36.0>
│ │ │  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
│ │ │  user out of the messenger system if they have not accessed it for, say, ten
│ │ │  minutes.
    
│ │ │    
│ │ │      
│ │ │ @@ -209,96 +209,96 @@
│ │ │  something called a signal to all the processes it has links to.
    The signal carries information about the pid it was sent from and the exit
│ │ │  reason.
    The default behaviour of a process that receives a normal exit is to ignore the
│ │ │  signal.
    The default behaviour in the two other cases (that is, abnormal exit) above is
│ │ │  to:
    • Bypass all messages to the receiving process.
    • Kill the receiving process.
    • Propagate the same error signal to the links of the killed process.
    In this way you can connect all processes in a transaction together using links.
│ │ │  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
│ │ │  Pong received ping
│ │ │  Ping received pong
│ │ │  Pong received ping
│ │ │  Ping received pong
    This is a slight modification of the ping pong program where both processes are
│ │ │  spawned from the same start/1 function, and the "ping" process can be spawned
│ │ │  on a separate node. Notice the use of the link BIF. "Ping" calls
│ │ │  exit(ping) when it finishes and this causes an exit signal to be
│ │ │  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) ->
│ │ │ -    PongPID = spawn(tut21, pong, []),
│ │ │ -    spawn(Ping_Node, tut21, ping, [3, PongPID]).
    (s1@bill)1> tut21:start(s2@gollum).
│ │ │ +start(Ping_Node) ->
│ │ │ +    PongPID = spawn(tut21, pong, []),
│ │ │ +    spawn(Ping_Node, tut21, ping, [3, PongPID]).
    (s1@bill)1> tut21:start(s2@gollum).
│ │ │  <3820.39.0>
│ │ │  Pong received ping
│ │ │  Ping received pong
│ │ │  Pong received ping
│ │ │  Ping received pong
│ │ │  Pong received ping
│ │ │  Ping received pong
│ │ │ @@ -351,135 +351,135 @@
│ │ │  %%% Started: messenger:client(Server_Node, Name)
│ │ │  %%% To client: logoff
│ │ │  %%% To client: {message_to, ToName, Message}
│ │ │  %%%
│ │ │  %%% Configuration: change the server_node() function to return the
│ │ │  %%% name of the node where the messenger server runs
│ │ │  
│ │ │ --module(messenger).
│ │ │ --export([start_server/0, server/0,
│ │ │ -         logon/1, logoff/0, message/2, client/2]).
│ │ │ +-module(messenger).
│ │ │ +-export([start_server/0, server/0,
│ │ │ +         logon/1, logoff/0, message/2, client/2]).
│ │ │  
│ │ │  %%% Change the function below to return the name of the node where the
│ │ │  %%% messenger server runs
│ │ │ -server_node() ->
│ │ │ +server_node() ->
│ │ │      messenger@super.
│ │ │  
│ │ │  %%% This is the server process for the "messenger"
│ │ │  %%% the user list has the format [{ClientPid1, Name1},{ClientPid22, Name2},...]
│ │ │ -server() ->
│ │ │ -    process_flag(trap_exit, true),
│ │ │ -    server([]).
│ │ │ +server() ->
│ │ │ +    process_flag(trap_exit, true),
│ │ │ +    server([]).
│ │ │  
│ │ │ -server(User_List) ->
│ │ │ +server(User_List) ->
│ │ │      receive
│ │ │ -        {From, logon, 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);
│ │ │ -        {From, message_to, To, Message} ->
│ │ │ -            server_transfer(From, To, Message, User_List),
│ │ │ -            io:format("list is now: ~p~n", [User_List]),
│ │ │ -            server(User_List)
│ │ │ +        {From, logon, 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);
│ │ │ +        {From, message_to, To, Message} ->
│ │ │ +            server_transfer(From, To, Message, User_List),
│ │ │ +            io:format("list is now: ~p~n", [User_List]),
│ │ │ +            server(User_List)
│ │ │      end.
│ │ │  
│ │ │  %%% Start the server
│ │ │ -start_server() ->
│ │ │ -    register(messenger, spawn(messenger, server, [])).
│ │ │ +start_server() ->
│ │ │ +    register(messenger, spawn(messenger, server, [])).
│ │ │  
│ │ │  %%% Server adds a new user to the user list
│ │ │ -server_logon(From, Name, User_List) ->
│ │ │ +server_logon(From, Name, User_List) ->
│ │ │      %% check if logged on anywhere else
│ │ │ -    case lists:keymember(Name, 2, User_List) of
│ │ │ +    case lists:keymember(Name, 2, User_List) of
│ │ │          true ->
│ │ │ -            From ! {messenger, stop, user_exists_at_other_node},  %reject logon
│ │ │ +            From ! {messenger, stop, user_exists_at_other_node},  %reject logon
│ │ │              User_List;
│ │ │          false ->
│ │ │ -            From ! {messenger, logged_on},
│ │ │ -            link(From),
│ │ │ -            [{From, Name} | User_List]        %add user to the list
│ │ │ +            From ! {messenger, logged_on},
│ │ │ +            link(From),
│ │ │ +            [{From, Name} | User_List]        %add user to the list
│ │ │      end.
│ │ │  
│ │ │  %%% Server deletes a user from the user list
│ │ │ -server_logoff(From, User_List) ->
│ │ │ -    lists:keydelete(From, 1, User_List).
│ │ │ +server_logoff(From, User_List) ->
│ │ │ +    lists:keydelete(From, 1, User_List).
│ │ │  
│ │ │  
│ │ │  %%% Server transfers a message between user
│ │ │ -server_transfer(From, To, Message, User_List) ->
│ │ │ +server_transfer(From, To, Message, User_List) ->
│ │ │      %% check that the user is logged on and who he is
│ │ │ -    case lists:keysearch(From, 1, User_List) of
│ │ │ +    case lists:keysearch(From, 1, User_List) of
│ │ │          false ->
│ │ │ -            From ! {messenger, stop, you_are_not_logged_on};
│ │ │ -        {value, {_, Name}} ->
│ │ │ -            server_transfer(From, Name, To, Message, User_List)
│ │ │ +            From ! {messenger, stop, you_are_not_logged_on};
│ │ │ +        {value, {_, Name}} ->
│ │ │ +            server_transfer(From, Name, To, Message, User_List)
│ │ │      end.
│ │ │  
│ │ │  %%% If the user exists, send the message
│ │ │ -server_transfer(From, Name, To, Message, User_List) ->
│ │ │ +server_transfer(From, Name, To, Message, User_List) ->
│ │ │      %% Find the receiver and send the message
│ │ │ -    case lists:keysearch(To, 2, User_List) of
│ │ │ +    case lists:keysearch(To, 2, User_List) of
│ │ │          false ->
│ │ │ -            From ! {messenger, receiver_not_found};
│ │ │ -        {value, {ToPid, To}} ->
│ │ │ -            ToPid ! {message_from, Name, Message},
│ │ │ -            From ! {messenger, sent}
│ │ │ +            From ! {messenger, receiver_not_found};
│ │ │ +        {value, {ToPid, To}} ->
│ │ │ +            ToPid ! {message_from, Name, Message},
│ │ │ +            From ! {messenger, sent}
│ │ │      end.
│ │ │  
│ │ │  %%% User Commands
│ │ │ -logon(Name) ->
│ │ │ -    case whereis(mess_client) of
│ │ │ +logon(Name) ->
│ │ │ +    case whereis(mess_client) of
│ │ │          undefined ->
│ │ │ -            register(mess_client,
│ │ │ -                     spawn(messenger, client, [server_node(), Name]));
│ │ │ +            register(mess_client,
│ │ │ +                     spawn(messenger, 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, ToName, Message},
│ │ │ +        _ -> mess_client ! {message_to, ToName, Message},
│ │ │               ok
│ │ │  end.
│ │ │  
│ │ │  %%% The client process which runs on each user node
│ │ │ -client(Server_Node, Name) ->
│ │ │ -    {messenger, Server_Node} ! {self(), logon, Name},
│ │ │ -    await_result(),
│ │ │ -    client(Server_Node).
│ │ │ +client(Server_Node, Name) ->
│ │ │ +    {messenger, Server_Node} ! {self(), logon, Name},
│ │ │ +    await_result(),
│ │ │ +    client(Server_Node).
│ │ │  
│ │ │ -client(Server_Node) ->
│ │ │ +client(Server_Node) ->
│ │ │      receive
│ │ │          logoff ->
│ │ │ -            exit(normal);
│ │ │ -        {message_to, ToName, Message} ->
│ │ │ -            {messenger, Server_Node} ! {self(), message_to, ToName, Message},
│ │ │ -            await_result();
│ │ │ -        {message_from, FromName, Message} ->
│ │ │ -            io:format("Message from ~p: ~p~n", [FromName, Message])
│ │ │ +            exit(normal);
│ │ │ +        {message_to, ToName, Message} ->
│ │ │ +            {messenger, Server_Node} ! {self(), message_to, ToName, 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
│ │ │ -        {messenger, stop, Why} -> % Stop the client
│ │ │ -            io:format("~p~n", [Why]),
│ │ │ -            exit(normal);
│ │ │ -        {messenger, What} ->  % Normal response
│ │ │ -            io:format("~p~n", [What])
│ │ │ +        {messenger, stop, Why} -> % Stop the client
│ │ │ +            io:format("~p~n", [Why]),
│ │ │ +            exit(normal);
│ │ │ +        {messenger, What} ->  % Normal response
│ │ │ +            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.
    The following changes are added:
    The messenger server traps exits. If it receives an exit signal,
│ │ │  {'EXIT',From,Reason}, this means that a client process has terminated or is
│ │ │  unreachable for one of the following reasons:
    • The user has logged off (the "logoff" message is removed).
    • The network connection to the client is broken.
    • The node on which the client process resides has gone down.
    • The client processes has done some illegal operation.
    If an exit signal is received as above, the tuple {From,Name} is deleted from
│ │ │  the servers User_List using the server_logoff function. If the node on which
│ │ │  the server runs goes down, an exit signal (automatically generated by the
│ │ │  system) is sent to all of the client processes:
│ │ │  {'EXIT',MessengerPID,noconnection} causing all the client processes to
│ │ ├── ./usr/share/doc/erlang-doc/html/doc/system/seq_prog.html
│ │ │ @@ -136,293 +136,293 @@
│ │ │  7
│ │ │  2> 
    As shown, the Erlang shell numbers the lines that can be entered, (as 1> 2>) and
│ │ │  that it correctly says that 2 + 5 is 7. If you make writing mistakes in the
│ │ │  shell, you can delete with the backspace key, as in most shells. There are many
│ │ │  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().
│ │ │  $
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Modules and Functions
│ │ │  
    
│ │ │  
    A programming language is not much use if you only can run code from the shell.
│ │ │  So here is a small Erlang program. Enter it into a file named tut.erl using a
│ │ │  suitable text editor. The file name tut.erl is important, and also that it is
│ │ │  in the same directory as the one where you started erl). If you are lucky your
│ │ │  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
│ │ │  variables are Number, ShoeSize, and Age.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Atoms
│ │ │  
    
│ │ │  
    Atom is another data type in Erlang. Atoms start with a small letter (see
│ │ │  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
│ │ │  head clause of convert_length, that is, convert_length({centimeter,X}). It
│ │ │  can be seen that {centimeter,X} does not match {inch,5} (the head is the bit
│ │ │  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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Lists
│ │ │  
    
│ │ │  
    Whereas tuples group things together, it is also needed to represent lists of
│ │ │  things. Lists in Erlang are surrounded by square brackets, [ and ]. For
│ │ │ -example, a list of the temperatures of various cities in the world can be:
    [{moscow, {c, -10}}, {cape_town, {f, 70}}, {stockholm, {c, -4}},
│ │ │ - {paris, {f, 28}}, {london, {f, 36}}]
    Notice that this list was so long that it did not fit on one line. This does not
│ │ │ +example, a list of the temperatures of various cities in the world can be:
    [{moscow, {c, -10}}, {cape_town, {f, 70}}, {stockholm, {c, -4}},
│ │ │ + {paris, {f, 28}}, {london, {f, 36}}]
    Notice that this list was so long that it did not fit on one line. This does not
│ │ │  matter, Erlang allows line breaks at all "sensible places" but not, for example,
│ │ │  in the middle of atoms, integers, and others.
    A useful way of looking at parts of lists, is by using |. This is best
│ │ │ -explained by an example using the shell:
    17> [First |TheRest] = [1,2,3,4,5].
│ │ │ -[1,2,3,4,5]
│ │ │ +explained by an example using the shell:
    17> [First |TheRest] = [1,2,3,4,5].
│ │ │ +[1,2,3,4,5]
│ │ │  18> First.
│ │ │  1
│ │ │  19> TheRest.
│ │ │ -[2,3,4,5]
    To separate the first elements of the list from the rest of the list, | is
│ │ │ -used. First has got value 1 and TheRest has got the value [2,3,4,5].
    Another example:
    20> [E1, E2 | R] = [1,2,3,4,5,6,7].
│ │ │ -[1,2,3,4,5,6,7]
│ │ │ +[2,3,4,5]
    To separate the first elements of the list from the rest of the list, | is
│ │ │ +used. First has got value 1 and TheRest has got the value [2,3,4,5].
    Another example:
    20> [E1, E2 | R] = [1,2,3,4,5,6,7].
│ │ │ +[1,2,3,4,5,6,7]
│ │ │  21> E1.
│ │ │  1
│ │ │  22> E2.
│ │ │  2
│ │ │  23> R.
│ │ │ -[3,4,5,6,7]
    Here you see the use of | to get the first two elements from the list. If you
│ │ │ +[3,4,5,6,7]
    Here you see the use of | to get the first two elements from the list. If you
│ │ │  try to get more elements from the list than there are elements in the list, an
│ │ │  error is returned. Notice also the special case of the list with no elements,
│ │ │ -[]:
    24> [A, B | C] = [1, 2].
│ │ │ -[1,2]
│ │ │ +[]:
    24> [A, B | C] = [1, 2].
│ │ │ +[1,2]
│ │ │  25> A.
│ │ │  1
│ │ │  26> B.
│ │ │  2
│ │ │  27> C.
│ │ │ -[]
    In the previous examples, new variable names are used, instead of reusing the
│ │ │ +[]
    In the previous examples, new variable names are used, instead of reusing the
│ │ │  old ones: First, TheRest, E1, E2, R, A, B, and C. The reason for
│ │ │  this is that a variable can only be given a value once in its context (scope).
│ │ │  More about this later.
    The following example shows how to find the length of a list. Enter the
│ │ │ -following code in a file named tut4.erl:
    -module(tut4).
│ │ │ +following code in a file named tut4.erl:
    -module(tut4).
│ │ │  
│ │ │ --export([list_length/1]).
│ │ │ +-export([list_length/1]).
│ │ │  
│ │ │ -list_length([]) ->
│ │ │ +list_length([]) ->
│ │ │      0;
│ │ │ -list_length([First | Rest]) ->
│ │ │ -    1 + list_length(Rest).
    Compile and test:
    28> c(tut4).
│ │ │ -{ok,tut4}
│ │ │ -29> tut4:list_length([1,2,3,4,5,6,7]).
│ │ │ -7
    Explanation:
    list_length([]) ->
│ │ │ -    0;
    The length of an empty list is obviously 0.
    list_length([First | Rest]) ->
│ │ │ -    1 + list_length(Rest).
    The length of a list with the first element First and the remaining elements
│ │ │ +list_length([First | Rest]) ->
│ │ │ +    1 + list_length(Rest).
    Compile and test:
    28> c(tut4).
│ │ │ +{ok,tut4}
│ │ │ +29> tut4:list_length([1,2,3,4,5,6,7]).
│ │ │ +7
    Explanation:
    list_length([]) ->
│ │ │ +    0;
    The length of an empty list is obviously 0.
    list_length([First | Rest]) ->
│ │ │ +    1 + list_length(Rest).
    The length of a list with the first element First and the remaining elements
│ │ │  Rest is 1 + the length of Rest.
    (Advanced readers only: This is not tail recursive, there is a better way to
│ │ │  write this function.)
    In general, tuples are used where "records" or "structs" are used in other
│ │ │  languages. Also, lists are used when representing things with varying sizes,
│ │ │  that is, where linked lists are used in other languages.
    Erlang does not have a string data type. Instead, strings can be represented by
│ │ │  lists of Unicode characters. This implies for example that the list [97,98,99]
│ │ │  is equivalent to "abc". The Erlang shell is "clever" and guesses what list you
│ │ │ -mean and outputs it in what it thinks is the most appropriate form, for example:
    30> [97,98,99].
│ │ │ +mean and outputs it in what it thinks is the most appropriate form, for example:
    30> [97,98,99].
│ │ │  "abc"
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Maps
│ │ │  
    
│ │ │  
    Maps are a set of key to value associations. These associations are encapsulated
│ │ │ -with #{ and }. To create an association from "key" to value 42:
    > #{ "key" => 42 }.
│ │ │ -#{"key" => 42}
    Let us jump straight into the deep end with an example using some interesting
│ │ │ +with #{ and }. To create an association from "key" to value 42:
    > #{ "key" => 42 }.
│ │ │ +#{"key" => 42}
    Let us jump straight into the deep end with an example using some interesting
│ │ │  features.
    The following example shows how to calculate alpha blending using maps to
│ │ │ -reference color and alpha channels. Enter the code in a file named color.erl):
    -module(color).
│ │ │ +reference color and alpha channels. Enter the code in a file named color.erl):
    -module(color).
│ │ │  
│ │ │ --export([new/4, blend/2]).
│ │ │ +-export([new/4, blend/2]).
│ │ │  
│ │ │ --define(is_channel(V), (is_float(V) andalso V >= 0.0 andalso V =< 1.0)).
│ │ │ +-define(is_channel(V), (is_float(V) andalso V >= 0.0 andalso V =< 1.0)).
│ │ │  
│ │ │ -new(R,G,B,A) when ?is_channel(R), ?is_channel(G),
│ │ │ -                  ?is_channel(B), ?is_channel(A) ->
│ │ │ -    #{red => R, green => G, blue => B, alpha => A}.
│ │ │ -
│ │ │ -blend(Src,Dst) ->
│ │ │ -    blend(Src,Dst,alpha(Src,Dst)).
│ │ │ -
│ │ │ -blend(Src,Dst,Alpha) when Alpha > 0.0 ->
│ │ │ -    Dst#{
│ │ │ -        red   := red(Src,Dst) / Alpha,
│ │ │ -        green := green(Src,Dst) / Alpha,
│ │ │ -        blue  := blue(Src,Dst) / Alpha,
│ │ │ +new(R,G,B,A) when ?is_channel(R), ?is_channel(G),
│ │ │ +                  ?is_channel(B), ?is_channel(A) ->
│ │ │ +    #{red => R, green => G, blue => B, alpha => A}.
│ │ │ +
│ │ │ +blend(Src,Dst) ->
│ │ │ +    blend(Src,Dst,alpha(Src,Dst)).
│ │ │ +
│ │ │ +blend(Src,Dst,Alpha) when Alpha > 0.0 ->
│ │ │ +    Dst#{
│ │ │ +        red   := red(Src,Dst) / Alpha,
│ │ │ +        green := green(Src,Dst) / Alpha,
│ │ │ +        blue  := blue(Src,Dst) / Alpha,
│ │ │          alpha := Alpha
│ │ │ -    };
│ │ │ -blend(_,Dst,_) ->
│ │ │ -    Dst#{
│ │ │ +    };
│ │ │ +blend(_,Dst,_) ->
│ │ │ +    Dst#{
│ │ │          red   := 0.0,
│ │ │          green := 0.0,
│ │ │          blue  := 0.0,
│ │ │          alpha := 0.0
│ │ │ -    }.
│ │ │ +    }.
│ │ │  
│ │ │ -alpha(#{alpha := SA}, #{alpha := DA}) ->
│ │ │ -    SA + DA*(1.0 - SA).
│ │ │ +alpha(#{alpha := SA}, #{alpha := DA}) ->
│ │ │ +    SA + DA*(1.0 - SA).
│ │ │  
│ │ │ -red(#{red := SV, alpha := SA}, #{red := DV, alpha := DA}) ->
│ │ │ -    SV*SA + DV*DA*(1.0 - SA).
│ │ │ -green(#{green := SV, alpha := SA}, #{green := DV, alpha := DA}) ->
│ │ │ -    SV*SA + DV*DA*(1.0 - SA).
│ │ │ -blue(#{blue := SV, alpha := SA}, #{blue := DV, alpha := DA}) ->
│ │ │ -    SV*SA + DV*DA*(1.0 - SA).
    Compile and test:
    > c(color).
│ │ │ -{ok,color}
│ │ │ -> C1 = color:new(0.3,0.4,0.5,1.0).
│ │ │ -#{alpha => 1.0,blue => 0.5,green => 0.4,red => 0.3}
│ │ │ -> C2 = color:new(1.0,0.8,0.1,0.3).
│ │ │ -#{alpha => 0.3,blue => 0.1,green => 0.8,red => 1.0}
│ │ │ -> color:blend(C1,C2).
│ │ │ -#{alpha => 1.0,blue => 0.5,green => 0.4,red => 0.3}
│ │ │ -> color:blend(C2,C1).
│ │ │ -#{alpha => 1.0,blue => 0.38,green => 0.52,red => 0.51}
    This example warrants some explanation:
    -define(is_channel(V), (is_float(V) andalso V >= 0.0 andalso V =< 1.0)).
    First a macro is_channel is defined to help with the guard tests. This is only
│ │ │ +red(#{red := SV, alpha := SA}, #{red := DV, alpha := DA}) ->
│ │ │ +    SV*SA + DV*DA*(1.0 - SA).
│ │ │ +green(#{green := SV, alpha := SA}, #{green := DV, alpha := DA}) ->
│ │ │ +    SV*SA + DV*DA*(1.0 - SA).
│ │ │ +blue(#{blue := SV, alpha := SA}, #{blue := DV, alpha := DA}) ->
│ │ │ +    SV*SA + DV*DA*(1.0 - SA).
    Compile and test:
    > c(color).
│ │ │ +{ok,color}
│ │ │ +> C1 = color:new(0.3,0.4,0.5,1.0).
│ │ │ +#{alpha => 1.0,blue => 0.5,green => 0.4,red => 0.3}
│ │ │ +> C2 = color:new(1.0,0.8,0.1,0.3).
│ │ │ +#{alpha => 0.3,blue => 0.1,green => 0.8,red => 1.0}
│ │ │ +> color:blend(C1,C2).
│ │ │ +#{alpha => 1.0,blue => 0.5,green => 0.4,red => 0.3}
│ │ │ +> color:blend(C2,C1).
│ │ │ +#{alpha => 1.0,blue => 0.38,green => 0.52,red => 0.51}
    This example warrants some explanation:
    -define(is_channel(V), (is_float(V) andalso V >= 0.0 andalso V =< 1.0)).
    First a macro is_channel is defined to help with the guard tests. This is only
│ │ │  here for convenience and to reduce syntax cluttering. For more information about
│ │ │ -macros, see The Preprocessor.
    new(R,G,B,A) when ?is_channel(R), ?is_channel(G),
│ │ │ -                  ?is_channel(B), ?is_channel(A) ->
│ │ │ -    #{red => R, green => G, blue => B, alpha => A}.
    The function new/4 creates a new map term and lets the keys red, green,
│ │ │ +macros, see The Preprocessor.
    new(R,G,B,A) when ?is_channel(R), ?is_channel(G),
│ │ │ +                  ?is_channel(B), ?is_channel(A) ->
│ │ │ +    #{red => R, green => G, blue => B, alpha => A}.
    The function new/4 creates a new map term and lets the keys red, green,
│ │ │  blue, and alpha be associated with an initial value. In this case, only
│ │ │  float values between and including 0.0 and 1.0 are allowed, as ensured by the
│ │ │  ?is_channel/1 macro for each argument. Only the => operator is allowed when
│ │ │  creating a new map.
    By calling blend/2 on any color term created by new/4, the resulting color
│ │ │ -can be calculated as determined by the two map terms.
    The first thing blend/2 does is to calculate the resulting alpha channel:
    alpha(#{alpha := SA}, #{alpha := DA}) ->
│ │ │ -    SA + DA*(1.0 - SA).
    The value associated with key alpha is fetched for both arguments using the
│ │ │ +can be calculated as determined by the two map terms.
    The first thing blend/2 does is to calculate the resulting alpha channel:
    alpha(#{alpha := SA}, #{alpha := DA}) ->
│ │ │ +    SA + DA*(1.0 - SA).
    The value associated with key alpha is fetched for both arguments using the
│ │ │  := operator. The other keys in the map are ignored, only the key alpha is
│ │ │ -required and checked for.
    This is also the case for functions red/2, blue/2, and green/2.
    red(#{red := SV, alpha := SA}, #{red := DV, alpha := DA}) ->
│ │ │ -    SV*SA + DV*DA*(1.0 - SA).
    The difference here is that a check is made for two keys in each map argument.
│ │ │ -The other keys are ignored.
    Finally, let us return the resulting color in blend/3:
    blend(Src,Dst,Alpha) when Alpha > 0.0 ->
│ │ │ -    Dst#{
│ │ │ -        red   := red(Src,Dst) / Alpha,
│ │ │ -        green := green(Src,Dst) / Alpha,
│ │ │ -        blue  := blue(Src,Dst) / Alpha,
│ │ │ +required and checked for.
    This is also the case for functions red/2, blue/2, and green/2.
    red(#{red := SV, alpha := SA}, #{red := DV, alpha := DA}) ->
│ │ │ +    SV*SA + DV*DA*(1.0 - SA).
    The difference here is that a check is made for two keys in each map argument.
│ │ │ +The other keys are ignored.
    Finally, let us return the resulting color in blend/3:
    blend(Src,Dst,Alpha) when Alpha > 0.0 ->
│ │ │ +    Dst#{
│ │ │ +        red   := red(Src,Dst) / Alpha,
│ │ │ +        green := green(Src,Dst) / Alpha,
│ │ │ +        blue  := blue(Src,Dst) / Alpha,
│ │ │          alpha := Alpha
│ │ │ -    };
    The Dst map is updated with new channel values. The syntax for updating an
│ │ │ +    };
    The Dst map is updated with new channel values. The syntax for updating an
│ │ │  existing key with a new value is with the := operator.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Standard Modules and Manual Pages
│ │ │  
    
│ │ │  
    Erlang has many standard modules to help you do things. For example, the module
│ │ │ @@ -442,24 +442,24 @@
│ │ │    
│ │ │      
│ │ │    
│ │ │    Writing Output to a Terminal
│ │ │  
    
│ │ │  
    It is nice to be able to do formatted output in examples, so the next example
│ │ │  shows a simple way to use the io:format/2 function. Like all other exported
│ │ │ -functions, you can test the io:format/2 function in the shell:
    31> io:format("hello world~n", []).
│ │ │ +functions, you can test the io:format/2 function in the shell:
    31> io:format("hello world~n", []).
│ │ │  hello world
│ │ │  ok
│ │ │ -32> io:format("this outputs one Erlang term: ~w~n", [hello]).
│ │ │ +32> io:format("this outputs one Erlang term: ~w~n", [hello]).
│ │ │  this outputs one Erlang term: hello
│ │ │  ok
│ │ │ -33> io:format("this outputs two Erlang terms: ~w~w~n", [hello, world]).
│ │ │ +33> io:format("this outputs two Erlang terms: ~w~w~n", [hello, world]).
│ │ │  this outputs two Erlang terms: helloworld
│ │ │  ok
│ │ │ -34> io:format("this outputs two Erlang terms: ~w ~w~n", [hello, world]).
│ │ │ +34> io:format("this outputs two Erlang terms: ~w ~w~n", [hello, world]).
│ │ │  this outputs two Erlang terms: hello world
│ │ │  ok
    The function io:format/2 (that is, format with two arguments) takes two lists.
│ │ │  The first one is nearly always a list written between " ". This list is printed
│ │ │  out as it is, except that each ~w is replaced by a term taken in order from the
│ │ │  second list. Each ~n is replaced by a new line. The io:format/2 function
│ │ │  itself returns the atom ok if everything goes as planned. Like other functions
│ │ │  in Erlang, it crashes if an error occurs. This is not a fault in Erlang, it is a
│ │ │ @@ -473,34 +473,34 @@
│ │ │    A Larger Example
│ │ │  
│ │ │  
    Now for a larger example to consolidate what you have learnt so far. Assume that
│ │ │  you have a list of temperature readings from a number of cities in the world.
│ │ │  Some of them are in Celsius and some in Fahrenheit (as in the previous list).
│ │ │  First let us convert them all to Celsius, then let us print the data neatly.
    %% This module is in file tut5.erl
│ │ │  
│ │ │ --module(tut5).
│ │ │ --export([format_temps/1]).
│ │ │ +-module(tut5).
│ │ │ +-export([format_temps/1]).
│ │ │  
│ │ │  %% Only this function is exported
│ │ │ -format_temps([])->                        % No output for an empty list
│ │ │ +format_temps([])->                        % No output for an empty list
│ │ │      ok;
│ │ │ -format_temps([City | Rest]) ->
│ │ │ -    print_temp(convert_to_celsius(City)),
│ │ │ -    format_temps(Rest).
│ │ │ -
│ │ │ -convert_to_celsius({Name, {c, Temp}}) ->  % No conversion needed
│ │ │ -    {Name, {c, Temp}};
│ │ │ -convert_to_celsius({Name, {f, Temp}}) ->  % Do the conversion
│ │ │ -    {Name, {c, (Temp - 32) * 5 / 9}}.
│ │ │ -
│ │ │ -print_temp({Name, {c, Temp}}) ->
│ │ │ -    io:format("~-15w ~w c~n", [Name, Temp]).
    35> c(tut5).
│ │ │ -{ok,tut5}
│ │ │ -36> tut5:format_temps([{moscow, {c, -10}}, {cape_town, {f, 70}},
│ │ │ -{stockholm, {c, -4}}, {paris, {f, 28}}, {london, {f, 36}}]).
│ │ │ +format_temps([City | Rest]) ->
│ │ │ +    print_temp(convert_to_celsius(City)),
│ │ │ +    format_temps(Rest).
│ │ │ +
│ │ │ +convert_to_celsius({Name, {c, Temp}}) ->  % No conversion needed
│ │ │ +    {Name, {c, Temp}};
│ │ │ +convert_to_celsius({Name, {f, Temp}}) ->  % Do the conversion
│ │ │ +    {Name, {c, (Temp - 32) * 5 / 9}}.
│ │ │ +
│ │ │ +print_temp({Name, {c, Temp}}) ->
│ │ │ +    io:format("~-15w ~w c~n", [Name, Temp]).
    35> c(tut5).
│ │ │ +{ok,tut5}
│ │ │ +36> tut5:format_temps([{moscow, {c, -10}}, {cape_town, {f, 70}},
│ │ │ +{stockholm, {c, -4}}, {paris, {f, 28}}, {london, {f, 36}}]).
│ │ │  moscow          -10 c
│ │ │  cape_town       21.11111111111111 c
│ │ │  stockholm       -4 c
│ │ │  paris           -2.2222222222222223 c
│ │ │  london          2.2222222222222223 c
│ │ │  ok
    Before looking at how this program works, notice that a few comments are added
│ │ │  to the code. A comment starts with a %-character and goes on to the end of the
│ │ │ @@ -528,28 +528,28 @@
│ │ │    
│ │ │      
│ │ │    
│ │ │    Matching, Guards, and Scope of Variables
│ │ │  
│ │ │  
    It can be useful to find the maximum and minimum temperature in lists like this.
│ │ │  Before extending the program to do this, let us look at functions for finding
│ │ │ -the maximum value of the elements in a list:
    -module(tut6).
│ │ │ --export([list_max/1]).
│ │ │ +the maximum value of the elements in a list:
    -module(tut6).
│ │ │ +-export([list_max/1]).
│ │ │  
│ │ │ -list_max([Head|Rest]) ->
│ │ │ -   list_max(Rest, Head).
│ │ │ +list_max([Head|Rest]) ->
│ │ │ +   list_max(Rest, Head).
│ │ │  
│ │ │ -list_max([], Res) ->
│ │ │ +list_max([], Res) ->
│ │ │      Res;
│ │ │ -list_max([Head|Rest], Result_so_far) when Head > Result_so_far ->
│ │ │ -    list_max(Rest, Head);
│ │ │ -list_max([Head|Rest], Result_so_far)  ->
│ │ │ -    list_max(Rest, Result_so_far).
    37> c(tut6).
│ │ │ -{ok,tut6}
│ │ │ -38> tut6:list_max([1,2,3,4,5,7,4,3,2,1]).
│ │ │ +list_max([Head|Rest], Result_so_far) when Head > Result_so_far ->
│ │ │ +    list_max(Rest, Head);
│ │ │ +list_max([Head|Rest], Result_so_far)  ->
│ │ │ +    list_max(Rest, Result_so_far).
    37> c(tut6).
│ │ │ +{ok,tut6}
│ │ │ +38> tut6:list_max([1,2,3,4,5,7,4,3,2,1]).
│ │ │  7
    First notice that two functions have the same name, list_max. However, each of
│ │ │  these takes a different number of arguments (parameters). In Erlang these are
│ │ │  regarded as completely different functions. Where you need to distinguish
│ │ │  between these functions, you write Name/Arity, where Name is the function name
│ │ │  and Arity is the number of arguments, in this case list_max/1 and
│ │ │  list_max/2.
    In this example you walk through a list "carrying" a value, in this case
│ │ │  Result_so_far. list_max/1 simply assumes that the max value of the list is
│ │ │ @@ -578,180 +578,180 @@
│ │ │  5
│ │ │  40> M = 6.
│ │ │  ** exception error: no match of right hand side value 6
│ │ │  41> M = M + 1.
│ │ │  ** exception error: no match of right hand side value 6
│ │ │  42> N = M + 1.
│ │ │  6
    The use of the match operator is particularly useful for pulling apart Erlang
│ │ │ -terms and creating new ones.
    43> {X, Y} = {paris, {f, 28}}.
│ │ │ -{paris,{f,28}}
│ │ │ +terms and creating new ones.
    43> {X, Y} = {paris, {f, 28}}.
│ │ │ +{paris,{f,28}}
│ │ │  44> X.
│ │ │  paris
│ │ │  45> Y.
│ │ │ -{f,28}
    Here X gets the value paris and Y the value {f,28}.
    If you try to do the same again with another city, an error is returned:
    46> {X, Y} = {london, {f, 36}}.
│ │ │ +{f,28}
    Here X gets the value paris and Y the value {f,28}.
    If you try to do the same again with another city, an error is returned:
    46> {X, Y} = {london, {f, 36}}.
│ │ │  ** exception error: no match of right hand side value {london,{f,36}}
    Variables can also be used to improve the readability of programs. For example,
│ │ │ -in function list_max/2 above, you can write:
    list_max([Head|Rest], Result_so_far) when Head > Result_so_far ->
│ │ │ +in function list_max/2 above, you can write:
    list_max([Head|Rest], Result_so_far) when Head > Result_so_far ->
│ │ │      New_result_far = Head,
│ │ │ -    list_max(Rest, New_result_far);
    This is possibly a little clearer.
    
│ │ │ +    list_max(Rest, New_result_far);
    This is possibly a little clearer.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    More About Lists
│ │ │  
    
│ │ │ -
    Remember that the | operator can be used to get the head of a list:
    47> [M1|T1] = [paris, london, rome].
│ │ │ -[paris,london,rome]
│ │ │ +
    Remember that the | operator can be used to get the head of a list:
    47> [M1|T1] = [paris, london, rome].
│ │ │ +[paris,london,rome]
│ │ │  48> M1.
│ │ │  paris
│ │ │  49> T1.
│ │ │ -[london,rome]
    The | operator can also be used to add a head to a list:
    50> L1 = [madrid | T1].
│ │ │ -[madrid,london,rome]
│ │ │ +[london,rome]
    The | operator can also be used to add a head to a list:
    50> L1 = [madrid | T1].
│ │ │ +[madrid,london,rome]
│ │ │  51> L1.
│ │ │ -[madrid,london,rome]
    Now an example of this when working with lists - reversing the order of a list:
    -module(tut8).
│ │ │ +[madrid,london,rome]
    Now an example of this when working with lists - reversing the order of a list:
    -module(tut8).
│ │ │  
│ │ │ --export([reverse/1]).
│ │ │ +-export([reverse/1]).
│ │ │  
│ │ │ -reverse(List) ->
│ │ │ -    reverse(List, []).
│ │ │ +reverse(List) ->
│ │ │ +    reverse(List, []).
│ │ │  
│ │ │ -reverse([Head | Rest], Reversed_List) ->
│ │ │ -    reverse(Rest, [Head | Reversed_List]);
│ │ │ -reverse([], Reversed_List) ->
│ │ │ -    Reversed_List.
    52> c(tut8).
│ │ │ -{ok,tut8}
│ │ │ -53> tut8:reverse([1,2,3]).
│ │ │ -[3,2,1]
    Consider how Reversed_List is built. It starts as [], then successively the
│ │ │ +reverse([Head | Rest], Reversed_List) ->
│ │ │ +    reverse(Rest, [Head | Reversed_List]);
│ │ │ +reverse([], Reversed_List) ->
│ │ │ +    Reversed_List.
    52> c(tut8).
│ │ │ +{ok,tut8}
│ │ │ +53> tut8:reverse([1,2,3]).
│ │ │ +[3,2,1]
    Consider how Reversed_List is built. It starts as [], then successively the
│ │ │  heads are taken off of the list to be reversed and added to the the
│ │ │ -Reversed_List, as shown in the following:
    reverse([1|2,3], []) =>
│ │ │ -    reverse([2,3], [1|[]])
│ │ │ +Reversed_List, as shown in the following:
    reverse([1|2,3], []) =>
│ │ │ +    reverse([2,3], [1|[]])
│ │ │  
│ │ │ -reverse([2|3], [1]) =>
│ │ │ -    reverse([3], [2|[1])
│ │ │ +reverse([2|3], [1]) =>
│ │ │ +    reverse([3], [2|[1])
│ │ │  
│ │ │ -reverse([3|[]], [2,1]) =>
│ │ │ -    reverse([], [3|[2,1]])
│ │ │ +reverse([3|[]], [2,1]) =>
│ │ │ +    reverse([], [3|[2,1]])
│ │ │  
│ │ │ -reverse([], [3,2,1]) =>
│ │ │ -    [3,2,1]
    The module lists contains many functions for manipulating lists, for example,
│ │ │ +reverse([], [3,2,1]) =>
│ │ │ +    [3,2,1]
    The module lists contains many functions for manipulating lists, for example,
│ │ │  for reversing them. So before writing a list-manipulating function it is a good
│ │ │  idea to check if one not already is written for you (see the lists manual
│ │ │  page in STDLIB).
    Now let us get back to the cities and temperatures, but take a more structured
│ │ │ -approach this time. First let us convert the whole list to Celsius as follows:
    -module(tut7).
│ │ │ --export([format_temps/1]).
│ │ │ +approach this time. First let us convert the whole list to Celsius as follows:
    -module(tut7).
│ │ │ +-export([format_temps/1]).
│ │ │  
│ │ │ -format_temps(List_of_cities) ->
│ │ │ -    convert_list_to_c(List_of_cities).
│ │ │ +format_temps(List_of_cities) ->
│ │ │ +    convert_list_to_c(List_of_cities).
│ │ │  
│ │ │ -convert_list_to_c([{Name, {f, F}} | Rest]) ->
│ │ │ -    Converted_City = {Name, {c, (F -32)* 5 / 9}},
│ │ │ -    [Converted_City | convert_list_to_c(Rest)];
│ │ │ -
│ │ │ -convert_list_to_c([City | Rest]) ->
│ │ │ -    [City | convert_list_to_c(Rest)];
│ │ │ -
│ │ │ -convert_list_to_c([]) ->
│ │ │ -    [].
    Test the function:
    54> c(tut7).
│ │ │ -{ok, tut7}.
│ │ │ -55> tut7:format_temps([{moscow, {c, -10}}, {cape_town, {f, 70}},
│ │ │ -{stockholm, {c, -4}}, {paris, {f, 28}}, {london, {f, 36}}]).
│ │ │ -[{moscow,{c,-10}},
│ │ │ - {cape_town,{c,21.11111111111111}},
│ │ │ - {stockholm,{c,-4}},
│ │ │ - {paris,{c,-2.2222222222222223}},
│ │ │ - {london,{c,2.2222222222222223}}]
    Explanation:
    format_temps(List_of_cities) ->
│ │ │ -    convert_list_to_c(List_of_cities).
    Here format_temps/1 calls convert_list_to_c/1. convert_list_to_c/1 takes
│ │ │ +convert_list_to_c([{Name, {f, F}} | Rest]) ->
│ │ │ +    Converted_City = {Name, {c, (F -32)* 5 / 9}},
│ │ │ +    [Converted_City | convert_list_to_c(Rest)];
│ │ │ +
│ │ │ +convert_list_to_c([City | Rest]) ->
│ │ │ +    [City | convert_list_to_c(Rest)];
│ │ │ +
│ │ │ +convert_list_to_c([]) ->
│ │ │ +    [].
    Test the function:
    54> c(tut7).
│ │ │ +{ok, tut7}.
│ │ │ +55> tut7:format_temps([{moscow, {c, -10}}, {cape_town, {f, 70}},
│ │ │ +{stockholm, {c, -4}}, {paris, {f, 28}}, {london, {f, 36}}]).
│ │ │ +[{moscow,{c,-10}},
│ │ │ + {cape_town,{c,21.11111111111111}},
│ │ │ + {stockholm,{c,-4}},
│ │ │ + {paris,{c,-2.2222222222222223}},
│ │ │ + {london,{c,2.2222222222222223}}]
    Explanation:
    format_temps(List_of_cities) ->
│ │ │ +    convert_list_to_c(List_of_cities).
    Here format_temps/1 calls convert_list_to_c/1. convert_list_to_c/1 takes
│ │ │  off the head of the List_of_cities, converts it to Celsius if needed. The |
│ │ │ -operator is used to add the (maybe) converted to the converted rest of the list:
    [Converted_City | convert_list_to_c(Rest)];
    or:
    [City | convert_list_to_c(Rest)];
    This is done until the end of the list is reached, that is, the list is empty:
    convert_list_to_c([]) ->
│ │ │ -    [].
    Now when the list is converted, a function to print it is added:
    -module(tut7).
│ │ │ --export([format_temps/1]).
│ │ │ -
│ │ │ -format_temps(List_of_cities) ->
│ │ │ -    Converted_List = convert_list_to_c(List_of_cities),
│ │ │ -    print_temp(Converted_List).
│ │ │ -
│ │ │ -convert_list_to_c([{Name, {f, F}} | Rest]) ->
│ │ │ -    Converted_City = {Name, {c, (F -32)* 5 / 9}},
│ │ │ -    [Converted_City | convert_list_to_c(Rest)];
│ │ │ -
│ │ │ -convert_list_to_c([City | Rest]) ->
│ │ │ -    [City | convert_list_to_c(Rest)];
│ │ │ -
│ │ │ -convert_list_to_c([]) ->
│ │ │ -    [].
│ │ │ -
│ │ │ -print_temp([{Name, {c, Temp}} | Rest]) ->
│ │ │ -    io:format("~-15w ~w c~n", [Name, Temp]),
│ │ │ -    print_temp(Rest);
│ │ │ -print_temp([]) ->
│ │ │ -    ok.
    56> c(tut7).
│ │ │ -{ok,tut7}
│ │ │ -57> tut7:format_temps([{moscow, {c, -10}}, {cape_town, {f, 70}},
│ │ │ -{stockholm, {c, -4}}, {paris, {f, 28}}, {london, {f, 36}}]).
│ │ │ +operator is used to add the (maybe) converted to the converted rest of the list:
    [Converted_City | convert_list_to_c(Rest)];
    or:
    [City | convert_list_to_c(Rest)];
    This is done until the end of the list is reached, that is, the list is empty:
    convert_list_to_c([]) ->
│ │ │ +    [].
    Now when the list is converted, a function to print it is added:
    -module(tut7).
│ │ │ +-export([format_temps/1]).
│ │ │ +
│ │ │ +format_temps(List_of_cities) ->
│ │ │ +    Converted_List = convert_list_to_c(List_of_cities),
│ │ │ +    print_temp(Converted_List).
│ │ │ +
│ │ │ +convert_list_to_c([{Name, {f, F}} | Rest]) ->
│ │ │ +    Converted_City = {Name, {c, (F -32)* 5 / 9}},
│ │ │ +    [Converted_City | convert_list_to_c(Rest)];
│ │ │ +
│ │ │ +convert_list_to_c([City | Rest]) ->
│ │ │ +    [City | convert_list_to_c(Rest)];
│ │ │ +
│ │ │ +convert_list_to_c([]) ->
│ │ │ +    [].
│ │ │ +
│ │ │ +print_temp([{Name, {c, Temp}} | Rest]) ->
│ │ │ +    io:format("~-15w ~w c~n", [Name, Temp]),
│ │ │ +    print_temp(Rest);
│ │ │ +print_temp([]) ->
│ │ │ +    ok.
    56> c(tut7).
│ │ │ +{ok,tut7}
│ │ │ +57> tut7:format_temps([{moscow, {c, -10}}, {cape_town, {f, 70}},
│ │ │ +{stockholm, {c, -4}}, {paris, {f, 28}}, {london, {f, 36}}]).
│ │ │  moscow          -10 c
│ │ │  cape_town       21.11111111111111 c
│ │ │  stockholm       -4 c
│ │ │  paris           -2.2222222222222223 c
│ │ │  london          2.2222222222222223 c
│ │ │  ok
    Now a function has to be added to find the cities with the maximum and minimum
│ │ │  temperatures. The following program is not the most efficient way of doing this
│ │ │  as you walk through the list of cities four times. But it is better to first
│ │ │  strive for clarity and correctness and to make programs efficient only if
│ │ │ -needed.
    -module(tut7).
│ │ │ --export([format_temps/1]).
│ │ │ +needed.
    -module(tut7).
│ │ │ +-export([format_temps/1]).
│ │ │  
│ │ │ -format_temps(List_of_cities) ->
│ │ │ -    Converted_List = convert_list_to_c(List_of_cities),
│ │ │ -    print_temp(Converted_List),
│ │ │ -    {Max_city, Min_city} = find_max_and_min(Converted_List),
│ │ │ -    print_max_and_min(Max_city, Min_city).
│ │ │ -
│ │ │ -convert_list_to_c([{Name, {f, Temp}} | Rest]) ->
│ │ │ -    Converted_City = {Name, {c, (Temp -32)* 5 / 9}},
│ │ │ -    [Converted_City | convert_list_to_c(Rest)];
│ │ │ -
│ │ │ -convert_list_to_c([City | Rest]) ->
│ │ │ -    [City | convert_list_to_c(Rest)];
│ │ │ -
│ │ │ -convert_list_to_c([]) ->
│ │ │ -    [].
│ │ │ -
│ │ │ -print_temp([{Name, {c, Temp}} | Rest]) ->
│ │ │ -    io:format("~-15w ~w c~n", [Name, Temp]),
│ │ │ -    print_temp(Rest);
│ │ │ -print_temp([]) ->
│ │ │ +format_temps(List_of_cities) ->
│ │ │ +    Converted_List = convert_list_to_c(List_of_cities),
│ │ │ +    print_temp(Converted_List),
│ │ │ +    {Max_city, Min_city} = find_max_and_min(Converted_List),
│ │ │ +    print_max_and_min(Max_city, Min_city).
│ │ │ +
│ │ │ +convert_list_to_c([{Name, {f, Temp}} | Rest]) ->
│ │ │ +    Converted_City = {Name, {c, (Temp -32)* 5 / 9}},
│ │ │ +    [Converted_City | convert_list_to_c(Rest)];
│ │ │ +
│ │ │ +convert_list_to_c([City | Rest]) ->
│ │ │ +    [City | convert_list_to_c(Rest)];
│ │ │ +
│ │ │ +convert_list_to_c([]) ->
│ │ │ +    [].
│ │ │ +
│ │ │ +print_temp([{Name, {c, Temp}} | Rest]) ->
│ │ │ +    io:format("~-15w ~w c~n", [Name, Temp]),
│ │ │ +    print_temp(Rest);
│ │ │ +print_temp([]) ->
│ │ │      ok.
│ │ │  
│ │ │ -find_max_and_min([City | Rest]) ->
│ │ │ -    find_max_and_min(Rest, City, City).
│ │ │ +find_max_and_min([City | Rest]) ->
│ │ │ +    find_max_and_min(Rest, City, City).
│ │ │  
│ │ │ -find_max_and_min([{Name, {c, Temp}} | Rest],
│ │ │ -         {Max_Name, {c, Max_Temp}},
│ │ │ -         {Min_Name, {c, Min_Temp}}) ->
│ │ │ +find_max_and_min([{Name, {c, Temp}} | Rest],
│ │ │ +         {Max_Name, {c, Max_Temp}},
│ │ │ +         {Min_Name, {c, Min_Temp}}) ->
│ │ │      if
│ │ │          Temp > Max_Temp ->
│ │ │ -            Max_City = {Name, {c, Temp}};           % Change
│ │ │ +            Max_City = {Name, {c, Temp}};           % Change
│ │ │          true ->
│ │ │ -            Max_City = {Max_Name, {c, Max_Temp}} % Unchanged
│ │ │ +            Max_City = {Max_Name, {c, Max_Temp}} % Unchanged
│ │ │      end,
│ │ │      if
│ │ │           Temp < Min_Temp ->
│ │ │ -            Min_City = {Name, {c, Temp}};           % Change
│ │ │ +            Min_City = {Name, {c, Temp}};           % Change
│ │ │          true ->
│ │ │ -            Min_City = {Min_Name, {c, Min_Temp}} % Unchanged
│ │ │ +            Min_City = {Min_Name, {c, Min_Temp}} % Unchanged
│ │ │      end,
│ │ │ -    find_max_and_min(Rest, Max_City, Min_City);
│ │ │ +    find_max_and_min(Rest, Max_City, Min_City);
│ │ │  
│ │ │ -find_max_and_min([], Max_City, Min_City) ->
│ │ │ -    {Max_City, Min_City}.
│ │ │ +find_max_and_min([], Max_City, Min_City) ->
│ │ │ +    {Max_City, Min_City}.
│ │ │  
│ │ │ -print_max_and_min({Max_name, {c, Max_temp}}, {Min_name, {c, Min_temp}}) ->
│ │ │ -    io:format("Max temperature was ~w c in ~w~n", [Max_temp, Max_name]),
│ │ │ -    io:format("Min temperature was ~w c in ~w~n", [Min_temp, Min_name]).
    58> c(tut7).
│ │ │ -{ok, tut7}
│ │ │ -59> tut7:format_temps([{moscow, {c, -10}}, {cape_town, {f, 70}},
│ │ │ -{stockholm, {c, -4}}, {paris, {f, 28}}, {london, {f, 36}}]).
│ │ │ +print_max_and_min({Max_name, {c, Max_temp}}, {Min_name, {c, Min_temp}}) ->
│ │ │ +    io:format("Max temperature was ~w c in ~w~n", [Max_temp, Max_name]),
│ │ │ +    io:format("Min temperature was ~w c in ~w~n", [Min_temp, Min_name]).
    58> c(tut7).
│ │ │ +{ok, tut7}
│ │ │ +59> tut7:format_temps([{moscow, {c, -10}}, {cape_town, {f, 70}},
│ │ │ +{stockholm, {c, -4}}, {paris, {f, 28}}, {london, {f, 36}}]).
│ │ │  moscow          -10 c
│ │ │  cape_town       21.11111111111111 c
│ │ │  stockholm       -4 c
│ │ │  paris           -2.2222222222222223 c
│ │ │  london          2.2222222222222223 c
│ │ │  Max temperature was 21.11111111111111 c in cape_town
│ │ │  Min temperature was -10 c in moscow
│ │ │ @@ -773,88 +773,88 @@
│ │ │          Action 4
│ │ │  end
    Notice that there is no ; before end. Conditions do the same as guards, that
│ │ │  is, tests that succeed or fail. Erlang starts at the top and tests until it
│ │ │  finds a condition that succeeds. Then it evaluates (performs) the action
│ │ │  following the condition and ignores all other conditions and actions before the
│ │ │  end. If no condition matches, a run-time failure occurs. A condition that
│ │ │  always succeeds is the atom true. This is often used last in an if, meaning,
│ │ │ -do the action following the true if all other conditions have failed.
    The following is a short program to show the workings of if.
    -module(tut9).
│ │ │ --export([test_if/2]).
│ │ │ +do the action following the true if all other conditions have failed.
    The following is a short program to show the workings of if.
    -module(tut9).
│ │ │ +-export([test_if/2]).
│ │ │  
│ │ │ -test_if(A, B) ->
│ │ │ +test_if(A, B) ->
│ │ │      if
│ │ │          A == 5 ->
│ │ │ -            io:format("A == 5~n", []),
│ │ │ +            io:format("A == 5~n", []),
│ │ │              a_equals_5;
│ │ │          B == 6 ->
│ │ │ -            io:format("B == 6~n", []),
│ │ │ +            io:format("B == 6~n", []),
│ │ │              b_equals_6;
│ │ │          A == 2, B == 3 ->                      %That is A equals 2 and B equals 3
│ │ │ -            io:format("A == 2, B == 3~n", []),
│ │ │ +            io:format("A == 2, B == 3~n", []),
│ │ │              a_equals_2_b_equals_3;
│ │ │          A == 1 ; B == 7 ->                     %That is A equals 1 or B equals 7
│ │ │ -            io:format("A == 1 ; B == 7~n", []),
│ │ │ +            io:format("A == 1 ; B == 7~n", []),
│ │ │              a_equals_1_or_b_equals_7
│ │ │ -    end.
    Testing this program gives:
    60> c(tut9).
│ │ │ -{ok,tut9}
│ │ │ -61> tut9:test_if(5,33).
│ │ │ +    end.
    Testing this program gives:
    60> c(tut9).
│ │ │ +{ok,tut9}
│ │ │ +61> tut9:test_if(5,33).
│ │ │  A == 5
│ │ │  a_equals_5
│ │ │ -62> tut9:test_if(33,6).
│ │ │ +62> tut9:test_if(33,6).
│ │ │  B == 6
│ │ │  b_equals_6
│ │ │ -63> tut9:test_if(2, 3).
│ │ │ +63> tut9:test_if(2, 3).
│ │ │  A == 2, B == 3
│ │ │  a_equals_2_b_equals_3
│ │ │ -64> tut9:test_if(1, 33).
│ │ │ +64> tut9:test_if(1, 33).
│ │ │  A == 1 ; B == 7
│ │ │  a_equals_1_or_b_equals_7
│ │ │ -65> tut9:test_if(33, 7).
│ │ │ +65> tut9:test_if(33, 7).
│ │ │  A == 1 ; B == 7
│ │ │  a_equals_1_or_b_equals_7
│ │ │ -66> tut9:test_if(33, 33).
│ │ │ +66> tut9:test_if(33, 33).
│ │ │  ** exception error: no true branch found when evaluating an if expression
│ │ │       in function  tut9:test_if/2 (tut9.erl, line 5)
    Notice that tut9:test_if(33,33) does not cause any condition to succeed. This
│ │ │  leads to the run time error if_clause, here nicely formatted by the shell. See
│ │ │  Guard Sequences for details of the many guard tests
│ │ │  available.
    case is another construct in Erlang. Recall that the convert_length function
│ │ │ -was written as:
    convert_length({centimeter, X}) ->
│ │ │ -    {inch, X / 2.54};
│ │ │ -convert_length({inch, Y}) ->
│ │ │ -    {centimeter, Y * 2.54}.
    The same program can also be written as:
    -module(tut10).
│ │ │ --export([convert_length/1]).
│ │ │ +was written as:
    convert_length({centimeter, X}) ->
│ │ │ +    {inch, X / 2.54};
│ │ │ +convert_length({inch, Y}) ->
│ │ │ +    {centimeter, Y * 2.54}.
    The same program can also be written as:
    -module(tut10).
│ │ │ +-export([convert_length/1]).
│ │ │  
│ │ │ -convert_length(Length) ->
│ │ │ +convert_length(Length) ->
│ │ │      case Length of
│ │ │ -        {centimeter, X} ->
│ │ │ -            {inch, X / 2.54};
│ │ │ -        {inch, Y} ->
│ │ │ -            {centimeter, Y * 2.54}
│ │ │ -    end.
    67> c(tut10).
│ │ │ -{ok,tut10}
│ │ │ -68> tut10:convert_length({inch, 6}).
│ │ │ -{centimeter,15.24}
│ │ │ -69> tut10:convert_length({centimeter, 2.5}).
│ │ │ -{inch,0.984251968503937}
    Both case and if have return values, that is, in the above example case
│ │ │ +        {centimeter, X} ->
│ │ │ +            {inch, X / 2.54};
│ │ │ +        {inch, Y} ->
│ │ │ +            {centimeter, Y * 2.54}
│ │ │ +    end.
    67> c(tut10).
│ │ │ +{ok,tut10}
│ │ │ +68> tut10:convert_length({inch, 6}).
│ │ │ +{centimeter,15.24}
│ │ │ +69> tut10:convert_length({centimeter, 2.5}).
│ │ │ +{inch,0.984251968503937}
    Both case and if have return values, that is, in the above example case
│ │ │  returned either {inch,X/2.54} or {centimeter,Y*2.54}. The behaviour of
│ │ │  case can also be modified by using guards. The following example clarifies
│ │ │  this. It tells us the length of a month, given the year. The year must be known,
│ │ │ -since February has 29 days in a leap year.
    -module(tut11).
│ │ │ --export([month_length/2]).
│ │ │ +since February has 29 days in a leap year.
    -module(tut11).
│ │ │ +-export([month_length/2]).
│ │ │  
│ │ │ -month_length(Year, Month) ->
│ │ │ +month_length(Year, Month) ->
│ │ │      %% All years divisible by 400 are leap
│ │ │      %% Years divisible by 100 are not leap (except the 400 rule above)
│ │ │      %% Years divisible by 4 are leap (except the 100 rule above)
│ │ │      Leap = if
│ │ │ -        trunc(Year / 400) * 400 == Year ->
│ │ │ +        trunc(Year / 400) * 400 == Year ->
│ │ │              leap;
│ │ │ -        trunc(Year / 100) * 100 == Year ->
│ │ │ +        trunc(Year / 100) * 100 == Year ->
│ │ │              not_leap;
│ │ │ -        trunc(Year / 4) * 4 == Year ->
│ │ │ +        trunc(Year / 4) * 4 == Year ->
│ │ │              leap;
│ │ │          true ->
│ │ │              not_leap
│ │ │      end,
│ │ │      case Month of
│ │ │          sep -> 30;
│ │ │          apr -> 30;
│ │ │ @@ -865,152 +865,152 @@
│ │ │          jan -> 31;
│ │ │          mar -> 31;
│ │ │          may -> 31;
│ │ │          jul -> 31;
│ │ │          aug -> 31;
│ │ │          oct -> 31;
│ │ │          dec -> 31
│ │ │ -    end.
    70> c(tut11).
│ │ │ -{ok,tut11}
│ │ │ -71> tut11:month_length(2004, feb).
│ │ │ +    end.
    70> c(tut11).
│ │ │ +{ok,tut11}
│ │ │ +71> tut11:month_length(2004, feb).
│ │ │  29
│ │ │ -72> tut11:month_length(2003, feb).
│ │ │ +72> tut11:month_length(2003, feb).
│ │ │  28
│ │ │ -73> tut11:month_length(1947, aug).
│ │ │ +73> tut11:month_length(1947, aug).
│ │ │  31
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Built-In Functions (BIFs)
│ │ │  
    
│ │ │  
    BIFs are functions that for some reason are built-in to the Erlang virtual
│ │ │  machine. BIFs often implement functionality that is impossible or is too
│ │ │  inefficient to implement in Erlang. Some BIFs can be called using the function
│ │ │  name only but they are by default belonging to the erlang module. For example,
│ │ │  the call to the BIF trunc below is equivalent to a call to erlang:trunc.
    As shown, first it is checked if a year is leap. If a year is divisible by 400,
│ │ │  it is a leap year. To determine this, first divide the year by 400 and use the
│ │ │  BIF trunc (more about this later) to cut off any decimals. Then multiply by
│ │ │  400 again and see if the same value is returned again. For example, year 2004:
    2004 / 400 = 5.01
│ │ │ -trunc(5.01) = 5
│ │ │ +trunc(5.01) = 5
│ │ │  5 * 400 = 2000
    2000 is not the same as 2004, so 2004 is not divisible by 400. Year 2000:
    2000 / 400 = 5.0
│ │ │ -trunc(5.0) = 5
│ │ │ +trunc(5.0) = 5
│ │ │  5 * 400 = 2000
    That is, a leap year. The next two trunc-tests evaluate if the year is
│ │ │  divisible by 100 or 4 in the same way. The first if returns leap or
│ │ │  not_leap, which lands up in the variable Leap. This variable is used in the
│ │ │  guard for feb in the following case that tells us how long the month is.
    This example showed the use of trunc. It is easier to use the Erlang operator
│ │ │  rem that gives the remainder after division, for example:
    74> 2004 rem 400.
│ │ │ -4
    So instead of writing:
    trunc(Year / 400) * 400 == Year ->
│ │ │ +4
    So instead of writing:
    trunc(Year / 400) * 400 == Year ->
│ │ │      leap;
    it can be written:
    Year rem 400 == 0 ->
│ │ │      leap;
    There are many other BIFs such as trunc. Only a few BIFs can be used in
│ │ │  guards, and you cannot use functions you have defined yourself in guards. (see
│ │ │  Guard Sequences) (For advanced readers: This is to
│ │ │  ensure that guards do not have side effects.) Let us play with a few of these
│ │ │ -functions in the shell:
    75> trunc(5.6).
│ │ │ +functions in the shell:
    75> trunc(5.6).
│ │ │  5
│ │ │ -76> round(5.6).
│ │ │ +76> round(5.6).
│ │ │  6
│ │ │ -77> length([a,b,c,d]).
│ │ │ +77> length([a,b,c,d]).
│ │ │  4
│ │ │ -78> float(5).
│ │ │ +78> float(5).
│ │ │  5.0
│ │ │ -79> is_atom(hello).
│ │ │ +79> is_atom(hello).
│ │ │  true
│ │ │ -80> is_atom("hello").
│ │ │ +80> is_atom("hello").
│ │ │  false
│ │ │ -81> is_tuple({paris, {c, 30}}).
│ │ │ +81> is_tuple({paris, {c, 30}}).
│ │ │  true
│ │ │ -82> is_tuple([paris, {c, 30}]).
│ │ │ +82> is_tuple([paris, {c, 30}]).
│ │ │  false
    All of these can be used in guards. Now for some BIFs that cannot be used in
│ │ │ -guards:
    83> atom_to_list(hello).
│ │ │ +guards:
    83> atom_to_list(hello).
│ │ │  "hello"
│ │ │ -84> list_to_atom("goodbye").
│ │ │ +84> list_to_atom("goodbye").
│ │ │  goodbye
│ │ │ -85> integer_to_list(22).
│ │ │ +85> integer_to_list(22).
│ │ │  "22"
    These three BIFs do conversions that would be difficult (or impossible) to do in
│ │ │  Erlang.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Higher-Order Functions (Funs)
│ │ │  
    
│ │ │  
    Erlang, like most modern functional programming languages, has higher-order
│ │ │ -functions. Here is an example using the shell:
    86> Xf = fun(X) -> X * 2 end.
│ │ │ +functions. Here is an example using the shell:
    86> Xf = fun(X) -> X * 2 end.
│ │ │  #Fun<erl_eval.5.123085357>
│ │ │ -87> Xf(5).
│ │ │ +87> Xf(5).
│ │ │  10
    Here is defined a function that doubles the value of a number and assigned this
│ │ │  function to a variable. Thus Xf(5) returns value 10. Two useful functions when
│ │ │ -working with lists are foreach and map, which are defined as follows:
    foreach(Fun, [First|Rest]) ->
│ │ │ -    Fun(First),
│ │ │ -    foreach(Fun, Rest);
│ │ │ -foreach(Fun, []) ->
│ │ │ +working with lists are foreach and map, which are defined as follows:
    foreach(Fun, [First|Rest]) ->
│ │ │ +    Fun(First),
│ │ │ +    foreach(Fun, Rest);
│ │ │ +foreach(Fun, []) ->
│ │ │      ok.
│ │ │  
│ │ │ -map(Fun, [First|Rest]) ->
│ │ │ -    [Fun(First)|map(Fun,Rest)];
│ │ │ -map(Fun, []) ->
│ │ │ -    [].
    These two functions are provided in the standard module lists. foreach takes
│ │ │ +map(Fun, [First|Rest]) ->
│ │ │ +    [Fun(First)|map(Fun,Rest)];
│ │ │ +map(Fun, []) ->
│ │ │ +    [].
    These two functions are provided in the standard module lists. foreach takes
│ │ │  a list and applies a fun to every element in the list. map creates a new list
│ │ │  by applying a fun to every element in a list. Going back to the shell, map is
│ │ │ -used and a fun to add 3 to every element of a list:
    88> Add_3 = fun(X) -> X + 3 end.
│ │ │ +used and a fun to add 3 to every element of a list:
    88> Add_3 = fun(X) -> X + 3 end.
│ │ │  #Fun<erl_eval.5.123085357>
│ │ │ -89> lists:map(Add_3, [1,2,3]).
│ │ │ -[4,5,6]
    Let us (again) print the temperatures in a list of cities:
    90> Print_City = fun({City, {X, Temp}}) -> io:format("~-15w ~w ~w~n",
│ │ │ -[City, X, Temp]) end.
│ │ │ +89> lists:map(Add_3, [1,2,3]).
│ │ │ +[4,5,6]
    Let us (again) print the temperatures in a list of cities:
    90> Print_City = fun({City, {X, Temp}}) -> io:format("~-15w ~w ~w~n",
│ │ │ +[City, X, Temp]) end.
│ │ │  #Fun<erl_eval.5.123085357>
│ │ │ -91> lists:foreach(Print_City, [{moscow, {c, -10}}, {cape_town, {f, 70}},
│ │ │ -{stockholm, {c, -4}}, {paris, {f, 28}}, {london, {f, 36}}]).
│ │ │ +91> lists:foreach(Print_City, [{moscow, {c, -10}}, {cape_town, {f, 70}},
│ │ │ +{stockholm, {c, -4}}, {paris, {f, 28}}, {london, {f, 36}}]).
│ │ │  moscow          c -10
│ │ │  cape_town       f 70
│ │ │  stockholm       c -4
│ │ │  paris           f 28
│ │ │  london          f 36
│ │ │  ok
    Let us now define a fun that can be used to go through a list of cities and
│ │ │ -temperatures and transform them all to Celsius.
    -module(tut13).
│ │ │ +temperatures and transform them all to Celsius.
    -module(tut13).
│ │ │  
│ │ │ --export([convert_list_to_c/1]).
│ │ │ +-export([convert_list_to_c/1]).
│ │ │  
│ │ │ -convert_to_c({Name, {f, Temp}}) ->
│ │ │ -    {Name, {c, trunc((Temp - 32) * 5 / 9)}};
│ │ │ -convert_to_c({Name, {c, Temp}}) ->
│ │ │ -    {Name, {c, Temp}}.
│ │ │ -
│ │ │ -convert_list_to_c(List) ->
│ │ │ -    lists:map(fun convert_to_c/1, List).
    92> tut13:convert_list_to_c([{moscow, {c, -10}}, {cape_town, {f, 70}},
│ │ │ -{stockholm, {c, -4}}, {paris, {f, 28}}, {london, {f, 36}}]).
│ │ │ -[{moscow,{c,-10}},
│ │ │ - {cape_town,{c,21}},
│ │ │ - {stockholm,{c,-4}},
│ │ │ - {paris,{c,-2}},
│ │ │ - {london,{c,2}}]
    The convert_to_c function is the same as before, but here it is used as a fun:
    lists:map(fun convert_to_c/1, List)
    When a function defined elsewhere is used as a fun, it can be referred to as
│ │ │ +convert_to_c({Name, {f, Temp}}) ->
│ │ │ +    {Name, {c, trunc((Temp - 32) * 5 / 9)}};
│ │ │ +convert_to_c({Name, {c, Temp}}) ->
│ │ │ +    {Name, {c, Temp}}.
│ │ │ +
│ │ │ +convert_list_to_c(List) ->
│ │ │ +    lists:map(fun convert_to_c/1, List).
    92> tut13:convert_list_to_c([{moscow, {c, -10}}, {cape_town, {f, 70}},
│ │ │ +{stockholm, {c, -4}}, {paris, {f, 28}}, {london, {f, 36}}]).
│ │ │ +[{moscow,{c,-10}},
│ │ │ + {cape_town,{c,21}},
│ │ │ + {stockholm,{c,-4}},
│ │ │ + {paris,{c,-2}},
│ │ │ + {london,{c,2}}]
    The convert_to_c function is the same as before, but here it is used as a fun:
    lists:map(fun convert_to_c/1, List)
    When a function defined elsewhere is used as a fun, it can be referred to as
│ │ │  Function/Arity (remember that Arity = number of arguments). So in the
│ │ │  map-call lists:map(fun convert_to_c/1, List) is written. As shown,
│ │ │  convert_list_to_c becomes much shorter and easier to understand.
    The standard module lists also contains a function sort(Fun, List) where
│ │ │  Fun is a fun with two arguments. This fun returns true if the first argument
│ │ │  is less than the second argument, or else false. Sorting is added to the
│ │ │ -convert_list_to_c:
    -module(tut13).
│ │ │ +convert_list_to_c:
    -module(tut13).
│ │ │  
│ │ │ --export([convert_list_to_c/1]).
│ │ │ +-export([convert_list_to_c/1]).
│ │ │  
│ │ │ -convert_to_c({Name, {f, Temp}}) ->
│ │ │ -    {Name, {c, trunc((Temp - 32) * 5 / 9)}};
│ │ │ -convert_to_c({Name, {c, Temp}}) ->
│ │ │ -    {Name, {c, Temp}}.
│ │ │ -
│ │ │ -convert_list_to_c(List) ->
│ │ │ -    New_list = lists:map(fun convert_to_c/1, List),
│ │ │ -    lists:sort(fun({_, {c, Temp1}}, {_, {c, Temp2}}) ->
│ │ │ -                       Temp1 < Temp2 end, New_list).
    93> c(tut13).
│ │ │ -{ok,tut13}
│ │ │ -94> tut13:convert_list_to_c([{moscow, {c, -10}}, {cape_town, {f, 70}},
│ │ │ -{stockholm, {c, -4}}, {paris, {f, 28}}, {london, {f, 36}}]).
│ │ │ -[{moscow,{c,-10}},
│ │ │ - {stockholm,{c,-4}},
│ │ │ - {paris,{c,-2}},
│ │ │ - {london,{c,2}},
│ │ │ - {cape_town,{c,21}}]
    In sort the fun is used:
    fun({_, {c, Temp1}}, {_, {c, Temp2}}) -> Temp1 < Temp2 end,
    Here the concept of an anonymous variable _ is introduced. This is simply
│ │ │ +convert_to_c({Name, {f, Temp}}) ->
│ │ │ +    {Name, {c, trunc((Temp - 32) * 5 / 9)}};
│ │ │ +convert_to_c({Name, {c, Temp}}) ->
│ │ │ +    {Name, {c, Temp}}.
│ │ │ +
│ │ │ +convert_list_to_c(List) ->
│ │ │ +    New_list = lists:map(fun convert_to_c/1, List),
│ │ │ +    lists:sort(fun({_, {c, Temp1}}, {_, {c, Temp2}}) ->
│ │ │ +                       Temp1 < Temp2 end, New_list).
    93> c(tut13).
│ │ │ +{ok,tut13}
│ │ │ +94> tut13:convert_list_to_c([{moscow, {c, -10}}, {cape_town, {f, 70}},
│ │ │ +{stockholm, {c, -4}}, {paris, {f, 28}}, {london, {f, 36}}]).
│ │ │ +[{moscow,{c,-10}},
│ │ │ + {stockholm,{c,-4}},
│ │ │ + {paris,{c,-2}},
│ │ │ + {london,{c,2}},
│ │ │ + {cape_town,{c,21}}]
    In sort the fun is used:
    fun({_, {c, Temp1}}, {_, {c, Temp2}}) -> Temp1 < Temp2 end,
    Here the concept of an anonymous variable _ is introduced. This is simply
│ │ │  shorthand for a variable that gets a value, but the value is ignored. This can
│ │ │  be used anywhere suitable, not just in funs. Temp1 < Temp2 returns true if
│ │ │  Temp1 is less than Temp2.
    
│ │ │  
    
│ │ │  
│ │ │  
    
│ │ │    
    
│ │ ├── ./usr/share/doc/erlang-doc/html/doc/system/spec_proc.html
│ │ │ @@ -123,72 +123,72 @@
│ │ │    
│ │ │      
│ │ │    
│ │ │    Simple Debugging
│ │ │  
│ │ │  
    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).
│ │ │ -ok
│ │ │ -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 => []}}}]}]]}
    
│ │ │ +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).
│ │ │ +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 => []}}}]}]]}
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Special Processes
│ │ │  
    
│ │ │  
    This section describes how to write a process that complies to the OTP design
│ │ │  principles, without using a standard behaviour. Such a process is to:
    System messages are messages with a special meaning, used in the supervision
│ │ │ @@ -198,238 +198,238 @@
│ │ │    
│ │ │      
│ │ │    
│ │ │    Example
│ │ │  
│ │ │  
    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)
│ │ │      end.
│ │ │  
│ │ │ -system_continue(Parent, Deb, Chs) ->
│ │ │ -    loop(Chs, Parent, Deb).
│ │ │ +system_continue(Parent, Deb, Chs) ->
│ │ │ +    loop(Chs, Parent, Deb).
│ │ │  
│ │ │ -system_terminate(Reason, _Parent, _Deb, _Chs) ->
│ │ │ -    exit(Reason).
│ │ │ +system_terminate(Reason, _Parent, _Deb, _Chs) ->
│ │ │ +    exit(Reason).
│ │ │  
│ │ │ -system_get_state(Chs) ->
│ │ │ -    {ok, Chs}.
│ │ │ +system_get_state(Chs) ->
│ │ │ +    {ok, Chs}.
│ │ │  
│ │ │ -system_replace_state(StateFun, Chs) ->
│ │ │ -    NChs = StateFun(Chs),
│ │ │ -    {ok, NChs, NChs}.
│ │ │ +system_replace_state(StateFun, Chs) ->
│ │ │ +    NChs = StateFun(Chs),
│ │ │ +    {ok, NChs, NChs}.
│ │ │  
│ │ │ -write_debug(Dev, Event, Name) ->
│ │ │ -    io:format(Dev, "~p event = ~p~n", [Name, Event]).
    As it is not relevant to the example, the channel handling functions have been
│ │ │ +write_debug(Dev, Event, Name) ->
│ │ │ +    io:format(Dev, "~p event = ~p~n", [Name, Event]).
    As it is not relevant to the example, the channel handling functions have been
│ │ │  omitted. To compile this example, the
│ │ │  implementation of channel handling
│ │ │  needs to be added to the module.
    Here is an example showing how the debugging functions in the sys
│ │ │  module can be used for ch4:
    % erl
│ │ │ -Erlang/OTP 27 [erts-15.0] [64-bit] [smp:8:8] [ds:8:8:10] [async-threads:1] [jit]
│ │ │ +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> ch4:start_link().
│ │ │ -{ok,<0.90.0>}
│ │ │ -2> sys:statistics(ch4, true).
│ │ │ -ok
│ │ │ -3> sys:trace(ch4, true).
│ │ │ -ok
│ │ │ -4> ch4:alloc().
│ │ │ -ch4 event = {in,alloc,<0.88.0>}
│ │ │ -ch4 event = {out,{ch4,1},<0.88.0>}
│ │ │ +Eshell V15.0 (press Ctrl+G to abort, type help(). for help)
│ │ │ +1> ch4:start_link().
│ │ │ +{ok,<0.90.0>}
│ │ │ +2> sys:statistics(ch4, true).
│ │ │ +ok
│ │ │ +3> sys:trace(ch4, true).
│ │ │ +ok
│ │ │ +4> ch4:alloc().
│ │ │ +ch4 event = {in,alloc,<0.88.0>}
│ │ │ +ch4 event = {out,{ch4,1},<0.88.0>}
│ │ │  1
│ │ │ -5> ch4:free(ch1).
│ │ │ -ch4 event = {in,{free,ch1}}
│ │ │ +5> ch4:free(ch1).
│ │ │ +ch4 event = {in,{free,ch1}}
│ │ │  ok
│ │ │ -6> sys:statistics(ch4, get).
│ │ │ -{ok,[{start_time,{{2024,5,3},{8,26,13}}},
│ │ │ -     {current_time,{{2024,5,3},{8,26,49}}},
│ │ │ -     {reductions,202},
│ │ │ -     {messages_in,2},
│ │ │ -     {messages_out,1}]}
│ │ │ -7> sys:statistics(ch4, false).
│ │ │ -ok
│ │ │ -8> sys:trace(ch4, false).
│ │ │ -ok
│ │ │ -9> sys:get_status(ch4).
│ │ │ -{status,<0.90.0>,
│ │ │ -        {module,ch4},
│ │ │ -        [[{'$initial_call',{ch4,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>,[],
│ │ │ -         {[1],[2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19|...]}]}
    
│ │ │ +6> sys:statistics(ch4, get).
│ │ │ +{ok,[{start_time,{{2024,5,3},{8,26,13}}},
│ │ │ +     {current_time,{{2024,5,3},{8,26,49}}},
│ │ │ +     {reductions,202},
│ │ │ +     {messages_in,2},
│ │ │ +     {messages_out,1}]}
│ │ │ +7> sys:statistics(ch4, false).
│ │ │ +ok
│ │ │ +8> sys:trace(ch4, false).
│ │ │ +ok
│ │ │ +9> sys:get_status(ch4).
│ │ │ +{status,<0.90.0>,
│ │ │ +        {module,ch4},
│ │ │ +        [[{'$initial_call',{ch4,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>,[],
│ │ │ +         {[1],[2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19|...]}]}
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Starting the Process
│ │ │  
    
│ │ │  
    A function in the proc_lib module is to be used to start the process. Several
│ │ │  functions are available, for example,
│ │ │  proc_lib:spawn_link/3,4
│ │ │  for asynchronous start and
│ │ │  proc_lib:start_link/3,4,5 for synchronous start.
    Information necessary for a process within a supervision tree, such as
│ │ │  details on ancestors and the initial call, is stored when a process
│ │ │  is started through one of these functions.
    If the process terminates with a reason other than normal or shutdown, a
│ │ │  crash report is generated. For more information about the crash report, see
│ │ │  Logging in Kernel User's Guide.
    In the example, synchronous start is used. The process starts by calling
│ │ │ -ch4:start_link():
    start_link() ->
│ │ │ -    proc_lib:start_link(ch4, init, [self()]).
    ch4:start_link/0 calls proc_lib:start_link/3, which takes a module
│ │ │ +ch4:start_link():
    start_link() ->
│ │ │ +    proc_lib:start_link(ch4, init, [self()]).
    ch4:start_link/0 calls proc_lib:start_link/3, which takes a module
│ │ │  name, a function name, and an argument list as arguments. It then
│ │ │  spawns a new process and establishes a link. The new process starts
│ │ │  by executing the given function, here ch4:init(Pid), where Pid is
│ │ │  the pid of the parent process (obtained by the call to
│ │ │  self() in the call to proc_lib:start_link/3).
    All initialization, including name registration, is done in init/1. The new
│ │ │ -process has to acknowledge that it has been started to the parent:
    init(Parent) ->
│ │ │ +process has to acknowledge that it has been started to the parent:
    init(Parent) ->
│ │ │      ...
│ │ │ -    proc_lib:init_ack(Parent, {ok, self()}),
│ │ │ -    loop(...).
    proc_lib:start_link/3 is synchronous and does not return until
│ │ │ +    proc_lib:init_ack(Parent, {ok, self()}),
│ │ │ +    loop(...).
    proc_lib:start_link/3 is synchronous and does not return until
│ │ │  proc_lib:init_ack/1,2 or
│ │ │  proc_lib:init_fail/2,3 has been called,
│ │ │  or the process has exited.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Debugging
│ │ │  
    
│ │ │  
    To support the debug facilities in sys, a debug structure is needed. The
│ │ │ -Deb term is initialized using sys:debug_options/1:
    init(Parent) ->
│ │ │ +Deb term is initialized using sys:debug_options/1:
    init(Parent) ->
│ │ │      ...
│ │ │ -    Deb = sys:debug_options([]),
│ │ │ +    Deb = sys:debug_options([]),
│ │ │      ...
│ │ │ -    loop(Chs, Parent, Deb).
    sys:debug_options/1 takes a list of options. Given an empty list as in this
│ │ │ +    loop(Chs, Parent, Deb).
    sys:debug_options/1 takes a list of options. Given an empty list as in this
│ │ │  example means that debugging is initially disabled. For information about the
│ │ │  possible options, see sys in STDLIB.
    For each system event to be logged or traced, the following function
│ │ │ -is to be called:
    sys:handle_debug(Deb, Func, Info, Event) => Deb1
    The arguments have the follow meaning:
    • Deb is the debug structure as returned from sys:debug_options/1.
    • Func is a fun specifying a (user-defined) function used to format trace
│ │ │ +is to be called:
      sys:handle_debug(Deb, Func, Info, Event) => Deb1
      The arguments have the follow meaning:
      • Deb is the debug structure as returned from sys:debug_options/1.
      • Func is a fun specifying a (user-defined) function used to format trace
│ │ │  output. For each system event, the format function is called as
│ │ │  Func(Dev, Event, Info), where:
        • Dev is the I/O device to which the output is to be printed. See io
│ │ │  in STDLIB.
        • Event and Info are passed as-is from the call to sys:handle_debug/4.
      • Info is used to pass more information to Func. It can be any term, and it
│ │ │  is passed as-is.
      • Event is the system event. It is up to the user to define what a system
│ │ │  event is and how it is to be represented. Typically, at least incoming and
│ │ │  outgoing messages are considered system events and represented by the tuples
│ │ │  {in,Msg[,From]} and {out,Msg,To[,State]}, respectively.
      sys:handle_debug/4 returns an updated debug structure Deb1.
      In the example, sys:handle_debug/4 is called for each incoming and
│ │ │  outgoing message. The format function Func is the function
│ │ │ -ch4:write_debug/3, which prints the message using io:format/3.
      loop(Chs, Parent, Deb) ->
│ │ │ +ch4:write_debug/3, which prints the message using io:format/3.
      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);
│ │ │ +        {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);
│ │ │          ...
│ │ │      end.
│ │ │  
│ │ │ -write_debug(Dev, Event, Name) ->
│ │ │ -    io:format(Dev, "~p event = ~p~n", [Name, Event]).
      
│ │ │ +write_debug(Dev, Event, Name) ->
│ │ │ +    io:format(Dev, "~p event = ~p~n", [Name, Event]).
      
│ │ │    
│ │ │      
│ │ │    
│ │ │    Handling System Messages
│ │ │  
      
│ │ │  
      System messages are received as:
      {system, From, Request}
      The content and meaning of these messages are not to be interpreted by the
│ │ │ -process. Instead the following function is to be called:
      sys:handle_system_msg(Request, From, Parent, Module, Deb, State)
      The arguments have the following meaning:
      • Request and From from the received system message are to be
│ │ │ +process. Instead the following function is to be called:
        sys:handle_system_msg(Request, From, Parent, Module, Deb, State)
        The arguments have the following meaning:
        • Request and From from the received system message are to be
│ │ │  passed as-is to the call to sys:handle_system_msg/6.
        • Parent is the pid of the parent process.
        • Module is the name of the module implementing the speciall process.
        • Deb is the debug structure.
        • State is a term describing the internal state and is passed on to
│ │ │  Module:system_continue/3, Module:system_terminate/4/
│ │ │  Module:system_get_state/1, and Module:system_replace_state/2.
        sys:handle_system_msg/6 does not return. It handles the system
│ │ │  message and eventually calls either of the following functions:
        • Module:system_continue(Parent, Deb, State) - if process execution is to
│ │ │  continue.
        • Module:system_terminate(Reason, Parent, Deb, State) - if the
│ │ │  process is to terminate.
        While handling the system message, sys:handle_system_msg/6 can call
│ │ │  one of the following functions:
        • Module:system_get_state(State) - if the process is to return its state.
        • Module:system_replace_state(StateFun, State) - if the process is
│ │ │  to replace its state using the fun StateFun fun. See sys:replace_state/3
│ │ │  for more information.
        • system_code_change(Misc, Module, OldVsn, Extra) - if the process is to
│ │ │  perform a code change.
        A process in a supervision tree is expected to terminate with the same reason as
│ │ │ -its parent.
        In the example, system messages are handed by the following code:
        loop(Chs, Parent, Deb) ->
│ │ │ +its parent.
        In the example, system messages are handed by the following code:
        loop(Chs, Parent, Deb) ->
│ │ │      receive
│ │ │          ...
│ │ │  
│ │ │ -        {system, From, Request} ->
│ │ │ -            sys:handle_system_msg(Request, From, Parent,
│ │ │ -                                  ch4, Deb, Chs)
│ │ │ +        {system, From, Request} ->
│ │ │ +            sys:handle_system_msg(Request, From, Parent,
│ │ │ +                                  ch4, Deb, Chs)
│ │ │      end.
│ │ │  
│ │ │ -system_continue(Parent, Deb, Chs) ->
│ │ │ -    loop(Chs, Parent, Deb).
│ │ │ +system_continue(Parent, Deb, Chs) ->
│ │ │ +    loop(Chs, Parent, Deb).
│ │ │  
│ │ │ -system_terminate(Reason, Parent, Deb, Chs) ->
│ │ │ -    exit(Reason).
│ │ │ +system_terminate(Reason, Parent, Deb, Chs) ->
│ │ │ +    exit(Reason).
│ │ │  
│ │ │ -system_get_state(Chs) ->
│ │ │ -    {ok, Chs, Chs}.
│ │ │ +system_get_state(Chs) ->
│ │ │ +    {ok, Chs, Chs}.
│ │ │  
│ │ │ -system_replace_state(StateFun, Chs) ->
│ │ │ -    NChs = StateFun(Chs),
│ │ │ -    {ok, NChs, NChs}.
        If a special process is configured to trap exits, it must take notice
│ │ │ +system_replace_state(StateFun, Chs) ->
│ │ │ +    NChs = StateFun(Chs),
│ │ │ +    {ok, NChs, NChs}.
        If a special process is configured to trap exits, it must take notice
│ │ │  of 'EXIT' messages from its parent process and terminate using the
│ │ │ -same exit reason once the parent process has terminated.
        Here is an example:
        init(Parent) ->
│ │ │ +same exit reason once the parent process has terminated.
        Here is an example:
        init(Parent) ->
│ │ │      ...,
│ │ │ -    process_flag(trap_exit, true),
│ │ │ +    process_flag(trap_exit, true),
│ │ │      ...,
│ │ │ -    loop(Parent).
│ │ │ +    loop(Parent).
│ │ │  
│ │ │ -loop(Parent) ->
│ │ │ +loop(Parent) ->
│ │ │      receive
│ │ │          ...
│ │ │ -        {'EXIT', Parent, Reason} ->
│ │ │ +        {'EXIT', Parent, Reason} ->
│ │ │              %% Clean up here, if needed.
│ │ │ -            exit(Reason);
│ │ │ +            exit(Reason);
│ │ │          ...
│ │ │      end.
        
│ │ │    
│ │ │      
│ │ │    
│ │ │    User-Defined Behaviours
│ │ │  
        
│ │ │ @@ -448,71 +448,71 @@
│ │ │  function. Note that the -optional_callbacks attribute is to be used together
│ │ │  with the -callback attribute; it cannot be combined with the
│ │ │  behaviour_info() function described below.
        Tools that need to know about optional callback functions can call
│ │ │  Behaviour:behaviour_info(optional_callbacks) to get a list of all optional
│ │ │  callback functions.
        Note
        We recommend using the -callback attribute rather than the
│ │ │  behaviour_info() function. The reason is that the extra type information can
│ │ │  be used by tools to produce documentation or find discrepancies.
        As an alternative to the -callback and -optional_callbacks attributes you
│ │ │ -may directly implement and export behaviour_info():
        behaviour_info(callbacks) ->
│ │ │ -    [{Name1, Arity1},...,{NameN, ArityN}].
        where each {Name, Arity} specifies the name and arity of a callback function.
│ │ │ +may directly implement and export behaviour_info():
        behaviour_info(callbacks) ->
│ │ │ +    [{Name1, Arity1},...,{NameN, ArityN}].
        where each {Name, Arity} specifies the name and arity of a callback function.
│ │ │  This function is otherwise automatically generated by the compiler using the
│ │ │  -callback attributes.
        When the compiler encounters the module attribute -behaviour(Behaviour). in a
│ │ │  module Mod, it calls Behaviour:behaviour_info(callbacks) and compares the
│ │ │  result with the set of functions actually exported from Mod, and issues a
│ │ │  warning if any callback function is missing.
        Example:
        %% User-defined behaviour module
│ │ │ --module(simple_server).
│ │ │ --export([start_link/2, init/3, ...]).
│ │ │ +-module(simple_server).
│ │ │ +-export([start_link/2, init/3, ...]).
│ │ │  
│ │ │ --callback init(State :: term()) -> 'ok'.
│ │ │ --callback handle_req(Req :: term(), State :: term()) -> {'ok', Reply :: term()}.
│ │ │ --callback terminate() -> 'ok'.
│ │ │ --callback format_state(State :: term()) -> term().
│ │ │ +-callback init(State :: term()) -> 'ok'.
│ │ │ +-callback handle_req(Req :: term(), State :: term()) -> {'ok', Reply :: term()}.
│ │ │ +-callback terminate() -> 'ok'.
│ │ │ +-callback format_state(State :: term()) -> term().
│ │ │  
│ │ │ --optional_callbacks([format_state/1]).
│ │ │ +-optional_callbacks([format_state/1]).
│ │ │  
│ │ │  %% Alternatively you may define:
│ │ │  %%
│ │ │  %% -export([behaviour_info/1]).
│ │ │  %% behaviour_info(callbacks) ->
│ │ │  %%     [{init,1},
│ │ │  %%      {handle_req,2},
│ │ │  %%      {terminate,0}].
│ │ │  
│ │ │ -start_link(Name, Module) ->
│ │ │ -    proc_lib:start_link(?MODULE, init, [self(), Name, Module]).
│ │ │ +start_link(Name, Module) ->
│ │ │ +    proc_lib:start_link(?MODULE, init, [self(), Name, Module]).
│ │ │  
│ │ │ -init(Parent, Name, Module) ->
│ │ │ -    register(Name, self()),
│ │ │ +init(Parent, Name, Module) ->
│ │ │ +    register(Name, self()),
│ │ │      ...,
│ │ │ -    Dbg = sys:debug_options([]),
│ │ │ -    proc_lib:init_ack(Parent, {ok, self()}),
│ │ │ -    loop(Parent, Module, Deb, ...).
│ │ │ +    Dbg = sys:debug_options([]),
│ │ │ +    proc_lib:init_ack(Parent, {ok, self()}),
│ │ │ +    loop(Parent, Module, Deb, ...).
│ │ │  
│ │ │ -...
        In a callback module:
        -module(db).
│ │ │ --behaviour(simple_server).
│ │ │ +...
        In a callback module:
        -module(db).
│ │ │ +-behaviour(simple_server).
│ │ │  
│ │ │ --export([init/1, handle_req/2, terminate/0]).
│ │ │ +-export([init/1, handle_req/2, terminate/0]).
│ │ │  
│ │ │  ...
        The contracts specified with -callback attributes in behaviour modules can be
│ │ │  further refined by adding -spec attributes in callback modules. This can be
│ │ │  useful as -callback contracts are usually generic. The same callback module
│ │ │ -with contracts for the callbacks:
        -module(db).
│ │ │ --behaviour(simple_server).
│ │ │ +with contracts for the callbacks:
        -module(db).
│ │ │ +-behaviour(simple_server).
│ │ │  
│ │ │ --export([init/1, handle_req/2, terminate/0]).
│ │ │ +-export([init/1, handle_req/2, terminate/0]).
│ │ │  
│ │ │ --record(state, {field1 :: [atom()], field2 :: integer()}).
│ │ │ +-record(state, {field1 :: [atom()], field2 :: integer()}).
│ │ │  
│ │ │ --type state()   :: #state{}.
│ │ │ --type request() :: {'store', term(), term()};
│ │ │ -                   {'lookup', term()}.
│ │ │ +-type state()   :: #state{}.
│ │ │ +-type request() :: {'store', term(), term()};
│ │ │ +                   {'lookup', term()}.
│ │ │  
│ │ │  ...
│ │ │  
│ │ │ --spec handle_req(request(), state()) -> {'ok', term()}.
│ │ │ +-spec handle_req(request(), state()) -> {'ok', term()}.
│ │ │  
│ │ │  ...
        Each -spec contract is to be a subtype of the respective -callback contract.
        
│ │ │  
│ │ │  
│ │ │  
        
│ │ │    
        
│ │ ├── ./usr/share/doc/erlang-doc/html/doc/system/statem.html
│ │ │ @@ -124,15 +124,15 @@
│ │ │  
│ │ │  
        Established Automata Theory does not deal much with how a state transition
│ │ │  is triggered, but assumes that the output is a function of the input
│ │ │  (and the state) and that they are some kind of values.
        For an Event-Driven State Machine, the input is an event that triggers
│ │ │  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
│ │ │  new state S' is different from the current state S, where "different" means
│ │ │  Erlang's strict inequality: =/= also known as "does not match". gen_statem
│ │ │  does more things during state changes than during other state transitions.
        As A and S' depend only on S and E, the kind of state machine described
│ │ │  here is a Mealy machine (see, for example, the Wikipedia article
│ │ │ @@ -405,20 +405,20 @@
│ │ │    
│ │ │    State Enter Calls
│ │ │  
│ │ │  
        The gen_statem behaviour can, if this is enabled, regardless of callback
│ │ │  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
│ │ │  callback module.
        The first state that is entered after gen_statem:init/1 will get
│ │ │  a state enter call with OldState equal to the current state.
        You may repeat the state enter call using the {repeat_state,...} return
│ │ │  value from the state callback. In this case
│ │ │  OldState will also be equal to the current state.
        Depending on how your state machine is specified, this can be a very useful
│ │ │ @@ -499,72 +499,72 @@
│ │ │  
│ │ │      locked      --> check_code : {button, Button}\n* Collect Buttons
│ │ │      check_code  --> locked     : Incorrect code
│ │ │      check_code  --> open       : Correct code\n* do_unlock()\n* Clear Buttons\n* Set state_timeout 10 s
│ │ │  
│ │ │      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.
        
│ │ │    
│ │ │      
│ │ │    
│ │ │    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
│ │ │  gen_statem is registered using global:register_name/2 in Kernel.
        • The second argument, ?MODULE, is the name of the callback module,
│ │ │  that is, the module where the callback functions are located,
│ │ │  which is this module.
          The interface functions (start_link/1 and button/1) are located in the
│ │ │  same module as the callback functions (init/1, locked/3, and open/3).
│ │ │ @@ -574,184 +574,184 @@
│ │ │  see gen_statem:start_link/3.
        If name registration succeeds, the new gen_statem process calls callback
│ │ │  function code_lock:init(Code). This function is expected to return
│ │ │  {ok, State, Data}, where State is the initial state of the gen_statem,
│ │ │  in this case locked; assuming that the door is locked to begin with.
│ │ │  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,
│ │ │  started by a supervisor.  Function,
│ │ │  gen_statem:start/3,4 can be used to start
│ │ │  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.
        
│ │ │    
│ │ │      
│ │ │    
│ │ │    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
│ │ │  to return a tuple {next_state, NewStateName, NewData}, or
│ │ │  {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}}
│ │ │ +            {next_state, locked, Data#{buttons := NewButtons}}
│ │ │      end.
        In state locked, when a button is pressed, it is collected with the
│ │ │  previously pressed buttons up to the length of the correct code, then
│ │ │  compared with the correct code. Depending on the result, the door is
│ │ │  either unlocked and the gen_statem goes to state open, or the door
│ │ │  remains in state locked.
        When changing to state open, the collected buttons are reset, the lock
│ │ │ -unlocked, and a state time-out for 10 seconds is started.
        open(cast, {button,_}, Data) ->
│ │ │ -    {next_state, open, Data}.
        In state open, a button event is ignored by staying in the same state.
│ │ │ +unlocked, and a state time-out for 10 seconds is started.
        open(cast, {button,_}, Data) ->
│ │ │ +    {next_state, open, Data}.
        In state open, a button event is ignored by staying in the same state.
│ │ │  This can also be done by returning {keep_state, Data}, or in this case
│ │ │  since Data is unchanged, by returning keep_state_and_data.
        
│ │ │    
│ │ │      
│ │ │    
│ │ │    State Time-Outs
│ │ │  
        
│ │ │  
        When a correct code has been given, the door is unlocked and the following
│ │ │ -tuple is returned from locked/2:
        {next_state, open, Data#{buttons := []},
│ │ │ - [{state_timeout,10_000,lock}]}; % Time in milliseconds
        10,000 is a time-out value in milliseconds. After this time (10 seconds),
│ │ │ +tuple is returned from locked/2:
        {next_state, open, Data#{buttons := []},
│ │ │ + [{state_timeout,10_000,lock}]}; % Time in milliseconds
        10,000 is a time-out value in milliseconds. After this time (10 seconds),
│ │ │  a time-out occurs. Then, StateName(state_timeout, lock, Data) is called.
│ │ │  The time-out occurs when the door has been in state open for 10 seconds.
│ │ │ -After that the door is locked again:
        open(state_timeout, lock,  Data) ->
│ │ │ -    do_lock(),
│ │ │ -    {next_state, locked, Data};
        The timer for a state time-out is automatically canceled when
│ │ │ +After that the door is locked again:
        open(state_timeout, lock,  Data) ->
│ │ │ +    do_lock(),
│ │ │ +    {next_state, locked, Data};
        The timer for a state time-out is automatically canceled when
│ │ │  the state machine does a state change.
        You can restart, cancel, or update a state time-out. See section
│ │ │  Time-Outs for details.
        
│ │ │    
│ │ │      
│ │ │    
│ │ │    All State Events
│ │ │  
        
│ │ │  
        Sometimes events can arrive in any state of the gen_statem. It is convenient
│ │ │  to handle these in a common state handler function that all state functions
│ │ │  call for events not specific to the state.
        Consider a code_length/0 function that returns the length
│ │ │  of the correct code.  We dispatch all events that are not state-specific
│ │ │  to the common function handle_common/3:
        ...
│ │ │ --export([button/1,code_length/0]).
│ │ │ +-export([button/1,code_length/0]).
│ │ │  ...
│ │ │  
│ │ │ -code_length() ->
│ │ │ -    gen_statem:call(?NAME, code_length).
│ │ │ +code_length() ->
│ │ │ +    gen_statem:call(?NAME, code_length).
│ │ │  
│ │ │  ...
│ │ │ -locked(...) -> ... ;
│ │ │ -locked(EventType, EventContent, Data) ->
│ │ │ -    handle_common(EventType, EventContent, Data).
│ │ │ +locked(...) -> ... ;
│ │ │ +locked(EventType, EventContent, Data) ->
│ │ │ +    handle_common(EventType, EventContent, Data).
│ │ │  
│ │ │  ...
│ │ │ -open(...) -> ... ;
│ │ │ -open(EventType, EventContent, Data) ->
│ │ │ -    handle_common(EventType, EventContent, Data).
│ │ │ -
│ │ │ -handle_common({call,From}, code_length, #{code := Code} = Data) ->
│ │ │ -    {keep_state, Data,
│ │ │ -     [{reply,From,length(Code)}]}.
        Another way to do it is through a convenience macro ?HANDLE_COMMON/0:
        ...
│ │ │ --export([button/1,code_length/0]).
│ │ │ +open(...) -> ... ;
│ │ │ +open(EventType, EventContent, Data) ->
│ │ │ +    handle_common(EventType, EventContent, Data).
│ │ │ +
│ │ │ +handle_common({call,From}, code_length, #{code := Code} = Data) ->
│ │ │ +    {keep_state, Data,
│ │ │ +     [{reply,From,length(Code)}]}.
        Another way to do it is through a convenience macro ?HANDLE_COMMON/0:
        ...
│ │ │ +-export([button/1,code_length/0]).
│ │ │  ...
│ │ │  
│ │ │ -code_length() ->
│ │ │ -    gen_statem:call(?NAME, code_length).
│ │ │ +code_length() ->
│ │ │ +    gen_statem:call(?NAME, code_length).
│ │ │  
│ │ │ --define(HANDLE_COMMON,
│ │ │ -    ?FUNCTION_NAME(T, C, D) -> handle_common(T, C, D)).
│ │ │ +-define(HANDLE_COMMON,
│ │ │ +    ?FUNCTION_NAME(T, C, D) -> handle_common(T, C, D)).
│ │ │  %%
│ │ │ -handle_common({call,From}, code_length, #{code := Code} = Data) ->
│ │ │ -    {keep_state, Data,
│ │ │ -     [{reply,From,length(Code)}]}.
│ │ │ +handle_common({call,From}, code_length, #{code := Code} = Data) ->
│ │ │ +    {keep_state, Data,
│ │ │ +     [{reply,From,length(Code)}]}.
│ │ │  
│ │ │  ...
│ │ │ -locked(...) -> ... ;
│ │ │ +locked(...) -> ... ;
│ │ │  ?HANDLE_COMMON.
│ │ │  
│ │ │  ...
│ │ │ -open(...) -> ... ;
│ │ │ +open(...) -> ... ;
│ │ │  ?HANDLE_COMMON.
        This example uses gen_statem:call/2, which waits for a reply from the server.
│ │ │  The reply is sent with a {reply, From, Reply} tuple in an action list in the
│ │ │  {keep_state, ...} tuple that retains the current state. This return form is
│ │ │  convenient when you want to stay in the current state but do not know or care
│ │ │  about what it is.
        If the common state callback needs to know the current state a function
│ │ │ -handle_common/4 can be used instead:
        -define(HANDLE_COMMON,
│ │ │ -    ?FUNCTION_NAME(T, C, D) -> handle_common(T, C, ?FUNCTION_NAME, D)).
        
│ │ │ +handle_common/4 can be used instead:
        -define(HANDLE_COMMON,
│ │ │ +    ?FUNCTION_NAME(T, C, D) -> handle_common(T, C, ?FUNCTION_NAME, D)).
        
│ │ │    
│ │ │      
│ │ │    
│ │ │    One State Callback
│ │ │  
        
│ │ │  
        If callback mode handle_event_function is used,
│ │ │  all events are handled in
│ │ │  Module:handle_event/4 and we can
│ │ │  (but do not have to) use an event-centered approach where we first branch
│ │ │  depending on event and then depending on state:
        ...
│ │ │ --export([handle_event/4]).
│ │ │ +-export([handle_event/4]).
│ │ │  
│ │ │  ...
│ │ │ -callback_mode() ->
│ │ │ +callback_mode() ->
│ │ │      handle_event_function.
│ │ │  
│ │ │ -handle_event(cast, {button,Button}, State, #{code := Code} = Data) ->
│ │ │ +handle_event(cast, {button,Button}, State, #{code := Code} = Data) ->
│ │ │      case State of
│ │ │  	locked ->
│ │ │ -            #{length := Length, buttons := Buttons} = Data,
│ │ │ +            #{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
│ │ │ -                    {keep_state, Data#{buttons := NewButtons}}
│ │ │ +                    {keep_state, Data#{buttons := NewButtons}}
│ │ │              end;
│ │ │  	open ->
│ │ │              keep_state_and_data
│ │ │      end;
│ │ │ -handle_event(state_timeout, lock, open, Data) ->
│ │ │ -    do_lock(),
│ │ │ -    {next_state, locked, Data};
│ │ │ -handle_event(
│ │ │ -  {call,From}, code_length, _State, #{code := Code} = Data) ->
│ │ │ -    {keep_state, Data,
│ │ │ -     [{reply,From,length(Code)}]}.
│ │ │ +handle_event(state_timeout, lock, open, Data) ->
│ │ │ +    do_lock(),
│ │ │ +    {next_state, locked, Data};
│ │ │ +handle_event(
│ │ │ +  {call,From}, code_length, _State, #{code := Code} = Data) ->
│ │ │ +    {keep_state, Data,
│ │ │ +     [{reply,From,length(Code)}]}.
│ │ │  
│ │ │  ...
        
│ │ │    
│ │ │      
│ │ │    
│ │ │    Stopping
│ │ │  
        
│ │ │ @@ -763,59 +763,59 @@
│ │ │  
│ │ │  
        If the gen_statem is part of a supervision tree, no stop function is needed.
│ │ │  The gen_statem is automatically terminated by its supervisor. Exactly how
│ │ │  this is done is defined by a shutdown strategy
│ │ │  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_statem must in function init/1
│ │ │  set itself to trap exit signals by calling
│ │ │ -process_flag(trap_exit, true):
        init(Args) ->
│ │ │ -    process_flag(trap_exit, true),
│ │ │ -    do_lock(),
│ │ │ +process_flag(trap_exit, true):
        init(Args) ->
│ │ │ +    process_flag(trap_exit, true),
│ │ │ +    do_lock(),
│ │ │      ...
        When ordered to shut down, the gen_statem then calls callback function
│ │ │  terminate(shutdown, State, Data).
        In this example, function terminate/3 locks the door if it is open,
│ │ │  so we do not accidentally leave the door open
│ │ │ -when the supervision tree terminates:
        terminate(_Reason, State, _Data) ->
│ │ │ -    State =/= locked andalso do_lock(),
│ │ │ +when the supervision tree terminates:
        terminate(_Reason, State, _Data) ->
│ │ │ +    State =/= locked andalso do_lock(),
│ │ │      ok.
        
│ │ │    
│ │ │      
│ │ │    
│ │ │    Standalone gen_statem
│ │ │  
        
│ │ │  
        If the gen_statem is not part of a supervision tree, it can be stopped
│ │ │  using gen_statem:stop/1, preferably through
│ │ │  an API function:
        ...
│ │ │ --export([start_link/1,stop/0]).
│ │ │ +-export([start_link/1,stop/0]).
│ │ │  
│ │ │  ...
│ │ │ -stop() ->
│ │ │ -    gen_statem:stop(?NAME).
        This makes the gen_statem call callback function terminate/3 just like
│ │ │ +stop() ->
│ │ │ +    gen_statem:stop(?NAME).
        This makes the gen_statem call callback function terminate/3 just like
│ │ │  for a supervised server and waits for the process to terminate.
        
│ │ │    
│ │ │      
│ │ │    
│ │ │    Event Time-Outs
│ │ │  
        
│ │ │  
        A time-out feature inherited from gen_statem's predecessor gen_fsm,
│ │ │  is an event time-out, that is, if an event arrives the timer is canceled.
│ │ │  You get either an event or a time-out, but not both.
        It is ordered by the
│ │ │  transition action {timeout, Time, EventContent},
│ │ │  or just an integer Time, even without the enclosing actions list (the latter
│ │ │  is a form inherited from gen_fsm).
        This type of time-out is useful, for example, to act on inactivity.
│ │ │  Let's restart the code sequence if no button is pressed for say 30 seconds:
        ...
│ │ │  
│ │ │ -locked(timeout, _, Data) ->
│ │ │ -    {next_state, locked, Data#{buttons := []}};
│ │ │ -locked(
│ │ │ -  cast, {button,Button},
│ │ │ -  #{code := Code, length := Length, buttons := Buttons} = Data) ->
│ │ │ +locked(timeout, _, Data) ->
│ │ │ +    {next_state, locked, Data#{buttons := []}};
│ │ │ +locked(
│ │ │ +  cast, {button,Button},
│ │ │ +  #{code := Code, length := Length, buttons := Buttons} = Data) ->
│ │ │  ...
│ │ │  	true -> % Incomplete | Incorrect
│ │ │ -            {next_state, locked, Data#{buttons := NewButtons},
│ │ │ -             30_000} % Time in milliseconds
│ │ │ +            {next_state, locked, Data#{buttons := NewButtons},
│ │ │ +             30_000} % Time in milliseconds
│ │ │  ...
        Whenever we receive a button event we start an event time-out of 30 seconds,
│ │ │  and if we get an event type of timeout we reset the remaining
│ │ │  code sequence.
        An event time-out is canceled by any other event so you either get
│ │ │  some other event or the time-out event. Therefore, canceling,
│ │ │  restarting, or updating an event time-out is neither possible nor
│ │ │  necessary. Whatever event you act on has already canceled
│ │ │  the event time-out, so there is never a running event time-out
│ │ │ @@ -834,30 +834,30 @@
│ │ │  another, maybe cancel the time-out without changing states, or perhaps run
│ │ │  multiple time-outs in parallel. All this can be accomplished with
│ │ │  generic time-outs. They may look a little
│ │ │  bit like event time-outs but contain
│ │ │  a name to allow for any number of them simultaneously and they are
│ │ │  not automatically canceled.
        Here is how to accomplish the state time-out in the previous example
│ │ │  by instead using a generic time-out named for example open:
        ...
│ │ │ -locked(
│ │ │ -  cast, {button,Button},
│ │ │ -  #{code := Code, length := Length, buttons := Buttons} = Data) ->
│ │ │ +locked(
│ │ │ +  cast, {button,Button},
│ │ │ +  #{code := Code, length := Length, buttons := Buttons} = Data) ->
│ │ │  ...
│ │ │      if
│ │ │          NewButtons =:= Code -> % Correct
│ │ │ -	    do_unlock(),
│ │ │ -            {next_state, open, Data#{buttons := []},
│ │ │ -             [{{timeout,open},10_000,lock}]}; % Time in milliseconds
│ │ │ +	    do_unlock(),
│ │ │ +            {next_state, open, Data#{buttons := []},
│ │ │ +             [{{timeout,open},10_000,lock}]}; % Time in milliseconds
│ │ │  ...
│ │ │  
│ │ │ -open({timeout,open}, lock, Data) ->
│ │ │ -    do_lock(),
│ │ │ -    {next_state,locked,Data};
│ │ │ -open(cast, {button,_}, Data) ->
│ │ │ -    {keep_state,Data};
│ │ │ +open({timeout,open}, lock, Data) ->
│ │ │ +    do_lock(),
│ │ │ +    {next_state,locked,Data};
│ │ │ +open(cast, {button,_}, Data) ->
│ │ │ +    {keep_state,Data};
│ │ │  ...
        Specific generic time-outs can just as state time-outs
│ │ │  be restarted or canceled by setting it to a new time or infinity.
        In this particular case we do not need to cancel the time-out since
│ │ │  the time-out event is the only possible reason to do a state change
│ │ │  from open to locked.
        Instead of bothering with when to cancel a time-out, a late time-out event
│ │ │  can be handled by ignoring it if it arrives in a state
│ │ │  where it is known to be late.
        You can restart, cancel, or update a generic time-out.
│ │ │  See section Time-Outs for details.
        
│ │ │ @@ -869,32 +869,32 @@
│ │ │  
        The most versatile way to handle time-outs is to use Erlang Timers; see
│ │ │  erlang:start_timer/3,4. Most time-out tasks
│ │ │  can be performed with the time-out features in gen_statem,
│ │ │  but an example of one that cannot is if you should need the return value
│ │ │  from erlang:cancel_timer(Tref), that is,
│ │ │  the remaining time of the timer.
        Here is how to accomplish the state time-out in the previous example
│ │ │  by instead using an Erlang Timer:
        ...
│ │ │ -locked(
│ │ │ -  cast, {button,Button},
│ │ │ -  #{code := Code, length := Length, buttons := Buttons} = Data) ->
│ │ │ +locked(
│ │ │ +  cast, {button,Button},
│ │ │ +  #{code := Code, length := Length, buttons := Buttons} = Data) ->
│ │ │  ...
│ │ │      if
│ │ │          NewButtons =:= Code -> % Correct
│ │ │ -	    do_unlock(),
│ │ │ +	    do_unlock(),
│ │ │  	    Tref =
│ │ │ -                 erlang:start_timer(
│ │ │ -                     10_000, self(), lock), % Time in milliseconds
│ │ │ -            {next_state, open, Data#{buttons := [], timer => Tref}};
│ │ │ +                 erlang:start_timer(
│ │ │ +                     10_000, self(), lock), % Time in milliseconds
│ │ │ +            {next_state, open, Data#{buttons := [], timer => Tref}};
│ │ │  ...
│ │ │  
│ │ │ -open(info, {timeout,Tref,lock}, #{timer := Tref} = Data) ->
│ │ │ -    do_lock(),
│ │ │ -    {next_state,locked,maps:remove(timer, Data)};
│ │ │ -open(cast, {button,_}, Data) ->
│ │ │ -    {keep_state,Data};
│ │ │ +open(info, {timeout,Tref,lock}, #{timer := Tref} = Data) ->
│ │ │ +    do_lock(),
│ │ │ +    {next_state,locked,maps:remove(timer, Data)};
│ │ │ +open(cast, {button,_}, Data) ->
│ │ │ +    {keep_state,Data};
│ │ │  ...
        Removing the timer key from the map when we do a state change to locked
│ │ │  is not strictly necessary since we can only get into state open
│ │ │  with an updated timer map value. But it can be nice to not have
│ │ │  outdated values in the state Data.
        If you need to cancel a timer because of some other event, you can use
│ │ │  erlang:cancel_timer(Tref). Note that no time-out
│ │ │  message will arrive after this (because the timer has been
│ │ │  explicitly canceled), unless you have already postponed one earlier
│ │ │ @@ -910,16 +910,16 @@
│ │ │    Postponing Events
│ │ │  
        
│ │ │  
        If you want to ignore a particular event in the current state and handle it
│ │ │  in a future state, you can postpone the event. A postponed event
│ │ │  is retried after a state change, that is, OldState =/= NewState.
        Postponing is ordered by the
│ │ │  transition action postpone.
        In this example, instead of ignoring button events while in the open state,
│ │ │  we can postpone them handle them later in the locked state:
        ...
│ │ │ -open(cast, {button,_}, Data) ->
│ │ │ -    {keep_state,Data,[postpone]};
│ │ │ +open(cast, {button,_}, Data) ->
│ │ │ +    {keep_state,Data,[postpone]};
│ │ │  ...
        Since a postponed event is only retried after a state change, you have to
│ │ │  think about where to keep a state data item. You can keep it in the server
│ │ │  Data or in the State itself, for example by having two more or less
│ │ │  identical states to keep a boolean value, or by using a complex state (see
│ │ │  section Complex State) with
│ │ │  callback mode
│ │ │  handle_event_function. If a change
│ │ │ @@ -940,55 +940,55 @@
│ │ │    
│ │ │      
│ │ │    
│ │ │    Selective Receive
│ │ │  
│ │ │  
        Erlang's selective receive statement is often used to describe simple state
│ │ │  machine examples in straightforward Erlang code. The following is a possible
│ │ │ -implementation of the first example:
        -module(code_lock).
│ │ │ --define(NAME, code_lock_1).
│ │ │ --export([start_link/1,button/1]).
│ │ │ -
│ │ │ -start_link(Code) ->
│ │ │ -    spawn(
│ │ │ -      fun () ->
│ │ │ -	      true = register(?NAME, self()),
│ │ │ -	      do_lock(),
│ │ │ -	      locked(Code, length(Code), [])
│ │ │ -      end).
│ │ │ +implementation of the first example:
        -module(code_lock).
│ │ │ +-define(NAME, code_lock_1).
│ │ │ +-export([start_link/1,button/1]).
│ │ │ +
│ │ │ +start_link(Code) ->
│ │ │ +    spawn(
│ │ │ +      fun () ->
│ │ │ +	      true = register(?NAME, self()),
│ │ │ +	      do_lock(),
│ │ │ +	      locked(Code, length(Code), [])
│ │ │ +      end).
│ │ │  
│ │ │ -button(Button) ->
│ │ │ -    ?NAME ! {button,Button}.
        locked(Code, Length, Buttons) ->
│ │ │ +button(Button) ->
│ │ │ +    ?NAME ! {button,Button}.
        locked(Code, Length, Buttons) ->
│ │ │      receive
│ │ │ -        {button,Button} ->
│ │ │ +        {button,Button} ->
│ │ │              NewButtons =
│ │ │                  if
│ │ │ -                    length(Buttons) < Length ->
│ │ │ +                    length(Buttons) < Length ->
│ │ │                          Buttons;
│ │ │                      true ->
│ │ │ -                        tl(Buttons)
│ │ │ -                end ++ [Button],
│ │ │ +                        tl(Buttons)
│ │ │ +                end ++ [Button],
│ │ │              if
│ │ │                  NewButtons =:= Code -> % Correct
│ │ │ -                    do_unlock(),
│ │ │ -		    open(Code, Length);
│ │ │ +                    do_unlock(),
│ │ │ +		    open(Code, Length);
│ │ │                  true -> % Incomplete | Incorrect
│ │ │ -                    locked(Code, Length, NewButtons)
│ │ │ +                    locked(Code, Length, NewButtons)
│ │ │              end
│ │ │ -    end.
        open(Code, Length) ->
│ │ │ +    end.
        open(Code, Length) ->
│ │ │      receive
│ │ │      after 10_000 -> % Time in milliseconds
│ │ │ -	    do_lock(),
│ │ │ -	    locked(Code, Length, [])
│ │ │ +	    do_lock(),
│ │ │ +	    locked(Code, Length, [])
│ │ │      end.
│ │ │  
│ │ │ -do_lock() ->
│ │ │ -    io:format("Locked~n", []).
│ │ │ -do_unlock() ->
│ │ │ -    io:format("Open~n", []).
        The selective receive in this case causes open to implicitly postpone any
│ │ │ +do_lock() ->
│ │ │ +    io:format("Locked~n", []).
│ │ │ +do_unlock() ->
│ │ │ +    io:format("Open~n", []).
        The selective receive in this case causes open to implicitly postpone any
│ │ │  events to the locked state.
        A catch-all receive should never be used from a gen_statem behaviour
│ │ │  (or from any gen_* behaviour), as the receive statement is within
│ │ │  the gen_* engine itself. sys-compatible behaviours must respond to
│ │ │  system messages and therefore do that in their engine receive loop,
│ │ │  passing non-system messages to the callback module. Using a catch-all
│ │ │  receive can result in system messages being discarded, which in turn
│ │ │  can lead to unexpected behaviour. If a selective receive must be used,
│ │ │ @@ -1011,40 +1011,40 @@
│ │ │  section), especially if only one or a few states have state enter actions,
│ │ │  this is a perfect use case for the built in
│ │ │  state enter calls.
        You return a list containing state_enter from your
│ │ │  callback_mode/0 function and the
│ │ │  gen_statem engine will call your state callback once with an event
│ │ │  (enter, OldState, ...) whenever it does a state change. Then you
│ │ │  just need to handle these event-like calls in all states.
        ...
│ │ │ -init(Code) ->
│ │ │ -    process_flag(trap_exit, true),
│ │ │ -    Data = #{code => Code, length = length(Code)},
│ │ │ -    {ok, locked, Data}.
│ │ │ -
│ │ │ -callback_mode() ->
│ │ │ -    [state_functions,state_enter].
│ │ │ -
│ │ │ -locked(enter, _OldState, Data) ->
│ │ │ -    do_lock(),
│ │ │ -    {keep_state,Data#{buttons => []}};
│ │ │ -locked(
│ │ │ -  cast, {button,Button},
│ │ │ -  #{code := Code, length := Length, buttons := Buttons} = Data) ->
│ │ │ +init(Code) ->
│ │ │ +    process_flag(trap_exit, true),
│ │ │ +    Data = #{code => Code, length = length(Code)},
│ │ │ +    {ok, locked, Data}.
│ │ │ +
│ │ │ +callback_mode() ->
│ │ │ +    [state_functions,state_enter].
│ │ │ +
│ │ │ +locked(enter, _OldState, Data) ->
│ │ │ +    do_lock(),
│ │ │ +    {keep_state,Data#{buttons => []}};
│ │ │ +locked(
│ │ │ +  cast, {button,Button},
│ │ │ +  #{code := Code, length := Length, buttons := Buttons} = Data) ->
│ │ │  ...
│ │ │      if
│ │ │          NewButtons =:= Code -> % Correct
│ │ │ -            {next_state, open, Data};
│ │ │ +            {next_state, open, Data};
│ │ │  ...
│ │ │  
│ │ │ -open(enter, _OldState, _Data) ->
│ │ │ -    do_unlock(),
│ │ │ -    {keep_state_and_data,
│ │ │ -     [{state_timeout,10_000,lock}]}; % Time in milliseconds
│ │ │ -open(state_timeout, lock, Data) ->
│ │ │ -    {next_state, locked, Data};
│ │ │ +open(enter, _OldState, _Data) ->
│ │ │ +    do_unlock(),
│ │ │ +    {keep_state_and_data,
│ │ │ +     [{state_timeout,10_000,lock}]}; % Time in milliseconds
│ │ │ +open(state_timeout, lock, Data) ->
│ │ │ +    {next_state, locked, Data};
│ │ │  ...
        You can repeat the state enter code by returning one of
│ │ │  {repeat_state, ...},{repeat_state_and_data, _},
│ │ │  or repeat_state_and_data that otherwise behaves exactly like their
│ │ │  keep_state siblings.  See the type
│ │ │  state_callback_result()
│ │ │  in the Reference Manual.
        
│ │ │    
│ │ │ @@ -1066,44 +1066,44 @@
│ │ │  to dispatch pre-processed events as internal events to the main state
│ │ │  machine.
        Using internal events also can make it easier to synchronize the state
│ │ │  machines.
        A variant of this is to use a complex state with
│ │ │  one state callback, modeling the state
│ │ │  with, for example, a tuple {MainFSMState, SubFSMState}.
        To illustrate this we make up an example where the buttons instead generate
│ │ │  down and up (press and release) events, and the lock responds
│ │ │  to an up event only after the corresponding down event.
        ...
│ │ │ --export([down/1, up/1]).
│ │ │ +-export([down/1, up/1]).
│ │ │  ...
│ │ │ -down(Button) ->
│ │ │ -    gen_statem:cast(?NAME, {down,Button}).
│ │ │ +down(Button) ->
│ │ │ +    gen_statem:cast(?NAME, {down,Button}).
│ │ │  
│ │ │ -up(Button) ->
│ │ │ -    gen_statem:cast(?NAME, {up,Button}).
│ │ │ +up(Button) ->
│ │ │ +    gen_statem:cast(?NAME, {up,Button}).
│ │ │  
│ │ │  ...
│ │ │  
│ │ │ -locked(enter, _OldState, Data) ->
│ │ │ -    do_lock(),
│ │ │ -    {keep_state,Data#{buttons => []}};
│ │ │ -locked(
│ │ │ -  internal, {button,Button},
│ │ │ -  #{code := Code, length := Length, buttons := Buttons} = Data) ->
│ │ │ -...
        handle_common(cast, {down,Button}, Data) ->
│ │ │ -    {keep_state, Data#{button => Button}};
│ │ │ -handle_common(cast, {up,Button}, Data) ->
│ │ │ +locked(enter, _OldState, Data) ->
│ │ │ +    do_lock(),
│ │ │ +    {keep_state,Data#{buttons => []}};
│ │ │ +locked(
│ │ │ +  internal, {button,Button},
│ │ │ +  #{code := Code, length := Length, buttons := Buttons} = Data) ->
│ │ │ +...
        handle_common(cast, {down,Button}, Data) ->
│ │ │ +    {keep_state, Data#{button => Button}};
│ │ │ +handle_common(cast, {up,Button}, Data) ->
│ │ │      case Data of
│ │ │ -        #{button := Button} ->
│ │ │ -            {keep_state,maps:remove(button, Data),
│ │ │ -             [{next_event,internal,{button,Button}}]};
│ │ │ -        #{} ->
│ │ │ +        #{button := Button} ->
│ │ │ +            {keep_state,maps:remove(button, Data),
│ │ │ +             [{next_event,internal,{button,Button}}]};
│ │ │ +        #{} ->
│ │ │              keep_state_and_data
│ │ │      end;
│ │ │  ...
│ │ │  
│ │ │ -open(internal, {button,_}, Data) ->
│ │ │ -    {keep_state,Data,[postpone]};
│ │ │ +open(internal, {button,_}, Data) ->
│ │ │ +    {keep_state,Data,[postpone]};
│ │ │  ...
        If you start this program with code_lock:start([17]) you can unlock with
│ │ │  code_lock:down(17), code_lock:up(17).
        
│ │ │    
│ │ │      
│ │ │    
│ │ │    Example Revisited
│ │ │  
        
│ │ │ @@ -1131,152 +1131,152 @@
│ │ │  Also, the state diagram does not show that the code_length/0 call
│ │ │  must be handled in every state.
        
│ │ │    
│ │ │      
│ │ │    
│ │ │    Callback Mode: state_functions
│ │ │  
        
│ │ │ -
        Using state functions:
        -module(code_lock).
│ │ │ --behaviour(gen_statem).
│ │ │ --define(NAME, code_lock_2).
│ │ │ +
        Using state functions:
        -module(code_lock).
│ │ │ +-behaviour(gen_statem).
│ │ │ +-define(NAME, code_lock_2).
│ │ │  
│ │ │ --export([start_link/1,stop/0]).
│ │ │ --export([down/1,up/1,code_length/0]).
│ │ │ --export([init/1,callback_mode/0,terminate/3]).
│ │ │ --export([locked/3,open/3]).
│ │ │ -
│ │ │ -start_link(Code) ->
│ │ │ -    gen_statem:start_link({local,?NAME}, ?MODULE, Code, []).
│ │ │ -stop() ->
│ │ │ -    gen_statem:stop(?NAME).
│ │ │ -
│ │ │ -down(Button) ->
│ │ │ -    gen_statem:cast(?NAME, {down,Button}).
│ │ │ -up(Button) ->
│ │ │ -    gen_statem:cast(?NAME, {up,Button}).
│ │ │ -code_length() ->
│ │ │ -    gen_statem:call(?NAME, code_length).
        init(Code) ->
│ │ │ -    process_flag(trap_exit, true),
│ │ │ -    Data = #{code => Code, length => length(Code), buttons => []},
│ │ │ -    {ok, locked, Data}.
│ │ │ +-export([start_link/1,stop/0]).
│ │ │ +-export([down/1,up/1,code_length/0]).
│ │ │ +-export([init/1,callback_mode/0,terminate/3]).
│ │ │ +-export([locked/3,open/3]).
│ │ │ +
│ │ │ +start_link(Code) ->
│ │ │ +    gen_statem:start_link({local,?NAME}, ?MODULE, Code, []).
│ │ │ +stop() ->
│ │ │ +    gen_statem:stop(?NAME).
│ │ │ +
│ │ │ +down(Button) ->
│ │ │ +    gen_statem:cast(?NAME, {down,Button}).
│ │ │ +up(Button) ->
│ │ │ +    gen_statem:cast(?NAME, {up,Button}).
│ │ │ +code_length() ->
│ │ │ +    gen_statem:call(?NAME, code_length).
        init(Code) ->
│ │ │ +    process_flag(trap_exit, true),
│ │ │ +    Data = #{code => Code, length => length(Code), buttons => []},
│ │ │ +    {ok, locked, Data}.
│ │ │  
│ │ │ -callback_mode() ->
│ │ │ -    [state_functions,state_enter].
│ │ │ +callback_mode() ->
│ │ │ +    [state_functions,state_enter].
│ │ │  
│ │ │ --define(HANDLE_COMMON,
│ │ │ -    ?FUNCTION_NAME(T, C, D) -> handle_common(T, C, D)).
│ │ │ +-define(HANDLE_COMMON,
│ │ │ +    ?FUNCTION_NAME(T, C, D) -> handle_common(T, C, D)).
│ │ │  %%
│ │ │ -handle_common(cast, {down,Button}, Data) ->
│ │ │ -    {keep_state, Data#{button => Button}};
│ │ │ -handle_common(cast, {up,Button}, Data) ->
│ │ │ +handle_common(cast, {down,Button}, Data) ->
│ │ │ +    {keep_state, Data#{button => Button}};
│ │ │ +handle_common(cast, {up,Button}, Data) ->
│ │ │      case Data of
│ │ │ -        #{button := Button} ->
│ │ │ -            {keep_state, maps:remove(button, Data),
│ │ │ -             [{next_event,internal,{button,Button}}]};
│ │ │ -        #{} ->
│ │ │ +        #{button := Button} ->
│ │ │ +            {keep_state, maps:remove(button, Data),
│ │ │ +             [{next_event,internal,{button,Button}}]};
│ │ │ +        #{} ->
│ │ │              keep_state_and_data
│ │ │      end;
│ │ │ -handle_common({call,From}, code_length, #{code := Code}) ->
│ │ │ -    {keep_state_and_data,
│ │ │ -     [{reply,From,length(Code)}]}.
        locked(enter, _OldState, Data) ->
│ │ │ -    do_lock(),
│ │ │ -    {keep_state, Data#{buttons := []}};
│ │ │ -locked(state_timeout, button, Data) ->
│ │ │ -    {keep_state, Data#{buttons := []}};
│ │ │ -locked(
│ │ │ -  internal, {button,Button},
│ │ │ -  #{code := Code, length := Length, buttons := Buttons} = Data) ->
│ │ │ +handle_common({call,From}, code_length, #{code := Code}) ->
│ │ │ +    {keep_state_and_data,
│ │ │ +     [{reply,From,length(Code)}]}.
        locked(enter, _OldState, Data) ->
│ │ │ +    do_lock(),
│ │ │ +    {keep_state, Data#{buttons := []}};
│ │ │ +locked(state_timeout, button, Data) ->
│ │ │ +    {keep_state, Data#{buttons := []}};
│ │ │ +locked(
│ │ │ +  internal, {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
│ │ │ -            {next_state, open, Data};
│ │ │ +            {next_state, open, Data};
│ │ │  	true -> % Incomplete | Incorrect
│ │ │ -            {keep_state, Data#{buttons := NewButtons},
│ │ │ -             [{state_timeout,30_000,button}]} % Time in milliseconds
│ │ │ +            {keep_state, Data#{buttons := NewButtons},
│ │ │ +             [{state_timeout,30_000,button}]} % Time in milliseconds
│ │ │      end;
│ │ │ -?HANDLE_COMMON.
        open(enter, _OldState, _Data) ->
│ │ │ -    do_unlock(),
│ │ │ -    {keep_state_and_data,
│ │ │ -     [{state_timeout,10_000,lock}]}; % Time in milliseconds
│ │ │ -open(state_timeout, lock, Data) ->
│ │ │ -    {next_state, locked, Data};
│ │ │ -open(internal, {button,_}, _) ->
│ │ │ -    {keep_state_and_data, [postpone]};
│ │ │ +?HANDLE_COMMON.
        open(enter, _OldState, _Data) ->
│ │ │ +    do_unlock(),
│ │ │ +    {keep_state_and_data,
│ │ │ +     [{state_timeout,10_000,lock}]}; % Time in milliseconds
│ │ │ +open(state_timeout, lock, Data) ->
│ │ │ +    {next_state, locked, Data};
│ │ │ +open(internal, {button,_}, _) ->
│ │ │ +    {keep_state_and_data, [postpone]};
│ │ │  ?HANDLE_COMMON.
│ │ │  
│ │ │ -do_lock() ->
│ │ │ -    io:format("Locked~n", []).
│ │ │ -do_unlock() ->
│ │ │ -    io:format("Open~n", []).
│ │ │ +do_lock() ->
│ │ │ +    io:format("Locked~n", []).
│ │ │ +do_unlock() ->
│ │ │ +    io:format("Open~n", []).
│ │ │  
│ │ │ -terminate(_Reason, State, _Data) ->
│ │ │ -    State =/= locked andalso do_lock(),
│ │ │ +terminate(_Reason, State, _Data) ->
│ │ │ +    State =/= locked andalso do_lock(),
│ │ │      ok.
        
│ │ │    
│ │ │      
│ │ │    
│ │ │    Callback Mode: handle_event_function
│ │ │  
        
│ │ │  
        This section describes what to change in the example to use one
│ │ │  handle_event/4 function.  The previously used approach to first branch
│ │ │  depending on event does not work that well here because of
│ │ │ -the state enter calls, so this example first branches depending on state:
        -export([handle_event/4]).
        callback_mode() ->
│ │ │ -    [handle_event_function,state_enter].
        %%
│ │ │ +the state enter calls, so this example first branches depending on state:
        -export([handle_event/4]).
        callback_mode() ->
│ │ │ +    [handle_event_function,state_enter].
        %%
│ │ │  %% State: locked
│ │ │ -handle_event(enter, _OldState, locked, Data) ->
│ │ │ -    do_lock(),
│ │ │ -    {keep_state, Data#{buttons := []}};
│ │ │ -handle_event(state_timeout, button, locked, Data) ->
│ │ │ -    {keep_state, Data#{buttons := []}};
│ │ │ -handle_event(
│ │ │ -  internal, {button,Button}, locked,
│ │ │ -  #{code := Code, length := Length, buttons := Buttons} = Data) ->
│ │ │ +handle_event(enter, _OldState, locked, Data) ->
│ │ │ +    do_lock(),
│ │ │ +    {keep_state, Data#{buttons := []}};
│ │ │ +handle_event(state_timeout, button, locked, Data) ->
│ │ │ +    {keep_state, Data#{buttons := []}};
│ │ │ +handle_event(
│ │ │ +  internal, {button,Button}, locked,
│ │ │ +  #{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
│ │ │ -            {next_state, open, Data};
│ │ │ +            {next_state, open, Data};
│ │ │  	true -> % Incomplete | Incorrect
│ │ │ -            {keep_state, Data#{buttons := NewButtons},
│ │ │ -             [{state_timeout,30_000,button}]} % Time in milliseconds
│ │ │ +            {keep_state, Data#{buttons := NewButtons},
│ │ │ +             [{state_timeout,30_000,button}]} % Time in milliseconds
│ │ │      end;
        %%
│ │ │  %% State: open
│ │ │ -handle_event(enter, _OldState, open, _Data) ->
│ │ │ -    do_unlock(),
│ │ │ -    {keep_state_and_data,
│ │ │ -     [{state_timeout,10_000,lock}]}; % Time in milliseconds
│ │ │ -handle_event(state_timeout, lock, open, Data) ->
│ │ │ -    {next_state, locked, Data};
│ │ │ -handle_event(internal, {button,_}, open, _) ->
│ │ │ -    {keep_state_and_data,[postpone]};
        %% Common events
│ │ │ -handle_event(cast, {down,Button}, _State, Data) ->
│ │ │ -    {keep_state, Data#{button => Button}};
│ │ │ -handle_event(cast, {up,Button}, _State, Data) ->
│ │ │ +handle_event(enter, _OldState, open, _Data) ->
│ │ │ +    do_unlock(),
│ │ │ +    {keep_state_and_data,
│ │ │ +     [{state_timeout,10_000,lock}]}; % Time in milliseconds
│ │ │ +handle_event(state_timeout, lock, open, Data) ->
│ │ │ +    {next_state, locked, Data};
│ │ │ +handle_event(internal, {button,_}, open, _) ->
│ │ │ +    {keep_state_and_data,[postpone]};
        %% Common events
│ │ │ +handle_event(cast, {down,Button}, _State, Data) ->
│ │ │ +    {keep_state, Data#{button => Button}};
│ │ │ +handle_event(cast, {up,Button}, _State, Data) ->
│ │ │      case Data of
│ │ │ -        #{button := Button} ->
│ │ │ -            {keep_state, maps:remove(button, Data),
│ │ │ -             [{next_event,internal,{button,Button}},
│ │ │ -              {state_timeout,30_000,button}]}; % Time in milliseconds
│ │ │ -        #{} ->
│ │ │ +        #{button := Button} ->
│ │ │ +            {keep_state, maps:remove(button, Data),
│ │ │ +             [{next_event,internal,{button,Button}},
│ │ │ +              {state_timeout,30_000,button}]}; % Time in milliseconds
│ │ │ +        #{} ->
│ │ │              keep_state_and_data
│ │ │      end;
│ │ │ -handle_event({call,From}, code_length, _State, #{length := Length}) ->
│ │ │ -    {keep_state_and_data,
│ │ │ -     [{reply,From,Length}]}.
        Notice that postponing buttons from the open state to the locked state
│ │ │ +handle_event({call,From}, code_length, _State, #{length := Length}) ->
│ │ │ +    {keep_state_and_data,
│ │ │ +     [{reply,From,Length}]}.
        Notice that postponing buttons from the open state to the locked state
│ │ │  seems like a strange thing to do for a code lock, but it at least
│ │ │  illustrates event postponing.
        
│ │ │    
│ │ │      
│ │ │    
│ │ │    Filter the State
│ │ │  
        
│ │ │ @@ -1286,30 +1286,30 @@
│ │ │  and which digits that remain to unlock.
        This state data can be regarded as sensitive, and maybe not what you want
│ │ │  in the error log because of some unpredictable event.
        Another reason to filter the state can be that the state is too large to print,
│ │ │  as it fills the error log with uninteresting details.
        To avoid this, you can format the internal state that gets in the error log
│ │ │  and gets returned from sys:get_status/1,2
│ │ │  by implementing function
│ │ │  Module:format_status/2,
│ │ │  for example like this:
        ...
│ │ │ --export([init/1,terminate/3,format_status/2]).
│ │ │ +-export([init/1,terminate/3,format_status/2]).
│ │ │  ...
│ │ │  
│ │ │ -format_status(Opt, [_PDict,State,Data]) ->
│ │ │ +format_status(Opt, [_PDict,State,Data]) ->
│ │ │      StateData =
│ │ │ -	{State,
│ │ │ -	 maps:filter(
│ │ │ -	   fun (code, _) -> false;
│ │ │ -	       (_, _) -> true
│ │ │ +	{State,
│ │ │ +	 maps:filter(
│ │ │ +	   fun (code, _) -> false;
│ │ │ +	       (_, _) -> true
│ │ │  	   end,
│ │ │ -	   Data)},
│ │ │ +	   Data)},
│ │ │      case Opt of
│ │ │  	terminate ->
│ │ │  	    StateData;
│ │ │  	normal ->
│ │ │ -	    [{data,[{"State",StateData}]}]
│ │ │ +	    [{data,[{"State",StateData}]}]
│ │ │      end.
        It is not mandatory to implement a
│ │ │  Module:format_status/2 function.
│ │ │  If you do not, a default implementation is used that does the same
│ │ │  as this example function without filtering the Data term, that is,
│ │ │  StateData = {State, Data}, in this example containing sensitive information.
        
│ │ │    
│ │ │      
│ │ │ @@ -1322,104 +1322,104 @@
│ │ │  like a tuple.
        One reason to use this is when you have a state item that when changed
│ │ │  should cancel the state time-out, or one that affects
│ │ │  the event handling in combination with postponing events. We will go for
│ │ │  the latter and complicate the previous example by introducing
│ │ │  a configurable lock button (this is the state item in question),
│ │ │  which in the open state immediately locks the door, and an API function
│ │ │  set_lock_button/1 to set the lock button.
        Suppose now that we call set_lock_button while the door is open,
│ │ │ -and we have already postponed a button event that was the new lock button:
        1> code_lock:start_link([a,b,c], x).
│ │ │ -{ok,<0.666.0>}
│ │ │ -2> code_lock:button(a).
│ │ │ +and we have already postponed a button event that was the new lock button:
        1> code_lock:start_link([a,b,c], x).
│ │ │ +{ok,<0.666.0>}
│ │ │ +2> code_lock:button(a).
│ │ │  ok
│ │ │ -3> code_lock:button(b).
│ │ │ +3> code_lock:button(b).
│ │ │  ok
│ │ │ -4> code_lock:button(c).
│ │ │ +4> code_lock:button(c).
│ │ │  ok
│ │ │  Open
│ │ │ -5> code_lock:button(y).
│ │ │ +5> code_lock:button(y).
│ │ │  ok
│ │ │ -6> code_lock:set_lock_button(y).
│ │ │ +6> code_lock:set_lock_button(y).
│ │ │  x
│ │ │  % What should happen here?  Immediate lock or nothing?
        We could say that the button was pressed too early so it should not be
│ │ │  recognized as the lock button. Or we can make the lock button part of
│ │ │  the state so when we then change the lock button in the locked state,
│ │ │  the change becomes a state change and all postponed events are retried,
│ │ │  therefore the lock is immediately locked!
        We define the state as {StateName, LockButton}, where StateName
│ │ │ -is as before and LockButton is the current lock button:
        -module(code_lock).
│ │ │ --behaviour(gen_statem).
│ │ │ --define(NAME, code_lock_3).
│ │ │ +is as before and LockButton is the current lock button:
        -module(code_lock).
│ │ │ +-behaviour(gen_statem).
│ │ │ +-define(NAME, code_lock_3).
│ │ │  
│ │ │ --export([start_link/2,stop/0]).
│ │ │ --export([button/1,set_lock_button/1]).
│ │ │ --export([init/1,callback_mode/0,terminate/3]).
│ │ │ --export([handle_event/4]).
│ │ │ -
│ │ │ -start_link(Code, LockButton) ->
│ │ │ -    gen_statem:start_link(
│ │ │ -        {local,?NAME}, ?MODULE, {Code,LockButton}, []).
│ │ │ -stop() ->
│ │ │ -    gen_statem:stop(?NAME).
│ │ │ -
│ │ │ -button(Button) ->
│ │ │ -    gen_statem:cast(?NAME, {button,Button}).
│ │ │ -set_lock_button(LockButton) ->
│ │ │ -    gen_statem:call(?NAME, {set_lock_button,LockButton}).
        init({Code,LockButton}) ->
│ │ │ -    process_flag(trap_exit, true),
│ │ │ -    Data = #{code => Code, length => length(Code), buttons => []},
│ │ │ -    {ok, {locked,LockButton}, Data}.
│ │ │ +-export([start_link/2,stop/0]).
│ │ │ +-export([button/1,set_lock_button/1]).
│ │ │ +-export([init/1,callback_mode/0,terminate/3]).
│ │ │ +-export([handle_event/4]).
│ │ │ +
│ │ │ +start_link(Code, LockButton) ->
│ │ │ +    gen_statem:start_link(
│ │ │ +        {local,?NAME}, ?MODULE, {Code,LockButton}, []).
│ │ │ +stop() ->
│ │ │ +    gen_statem:stop(?NAME).
│ │ │ +
│ │ │ +button(Button) ->
│ │ │ +    gen_statem:cast(?NAME, {button,Button}).
│ │ │ +set_lock_button(LockButton) ->
│ │ │ +    gen_statem:call(?NAME, {set_lock_button,LockButton}).
        init({Code,LockButton}) ->
│ │ │ +    process_flag(trap_exit, true),
│ │ │ +    Data = #{code => Code, length => length(Code), buttons => []},
│ │ │ +    {ok, {locked,LockButton}, Data}.
│ │ │  
│ │ │ -callback_mode() ->
│ │ │ -    [handle_event_function,state_enter].
│ │ │ +callback_mode() ->
│ │ │ +    [handle_event_function,state_enter].
│ │ │  
│ │ │  %% State: locked
│ │ │ -handle_event(enter, _OldState, {locked,_}, Data) ->
│ │ │ -    do_lock(),
│ │ │ -    {keep_state, Data#{buttons := []}};
│ │ │ -handle_event(state_timeout, button, {locked,_}, Data) ->
│ │ │ -    {keep_state, Data#{buttons := []}};
│ │ │ -handle_event(
│ │ │ -  cast, {button,Button}, {locked,LockButton},
│ │ │ -  #{code := Code, length := Length, buttons := Buttons} = Data) ->
│ │ │ +handle_event(enter, _OldState, {locked,_}, Data) ->
│ │ │ +    do_lock(),
│ │ │ +    {keep_state, Data#{buttons := []}};
│ │ │ +handle_event(state_timeout, button, {locked,_}, Data) ->
│ │ │ +    {keep_state, Data#{buttons := []}};
│ │ │ +handle_event(
│ │ │ +  cast, {button,Button}, {locked,LockButton},
│ │ │ +  #{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
│ │ │ -            {next_state, {open,LockButton}, Data};
│ │ │ +            {next_state, {open,LockButton}, Data};
│ │ │  	true -> % Incomplete | Incorrect
│ │ │ -            {keep_state, Data#{buttons := NewButtons},
│ │ │ -             [{state_timeout,30_000,button}]} % Time in milliseconds
│ │ │ +            {keep_state, Data#{buttons := NewButtons},
│ │ │ +             [{state_timeout,30_000,button}]} % Time in milliseconds
│ │ │      end;
        %%
│ │ │  %% State: open
│ │ │ -handle_event(enter, _OldState, {open,_}, _Data) ->
│ │ │ -    do_unlock(),
│ │ │ -    {keep_state_and_data,
│ │ │ -     [{state_timeout,10_000,lock}]}; % Time in milliseconds
│ │ │ -handle_event(state_timeout, lock, {open,LockButton}, Data) ->
│ │ │ -    {next_state, {locked,LockButton}, Data};
│ │ │ -handle_event(cast, {button,LockButton}, {open,LockButton}, Data) ->
│ │ │ -    {next_state, {locked,LockButton}, Data};
│ │ │ -handle_event(cast, {button,_}, {open,_}, _Data) ->
│ │ │ -    {keep_state_and_data,[postpone]};
        %%
│ │ │ +handle_event(enter, _OldState, {open,_}, _Data) ->
│ │ │ +    do_unlock(),
│ │ │ +    {keep_state_and_data,
│ │ │ +     [{state_timeout,10_000,lock}]}; % Time in milliseconds
│ │ │ +handle_event(state_timeout, lock, {open,LockButton}, Data) ->
│ │ │ +    {next_state, {locked,LockButton}, Data};
│ │ │ +handle_event(cast, {button,LockButton}, {open,LockButton}, Data) ->
│ │ │ +    {next_state, {locked,LockButton}, Data};
│ │ │ +handle_event(cast, {button,_}, {open,_}, _Data) ->
│ │ │ +    {keep_state_and_data,[postpone]};
        %%
│ │ │  %% Common events
│ │ │ -handle_event(
│ │ │ -  {call,From}, {set_lock_button,NewLockButton},
│ │ │ -  {StateName,OldLockButton}, Data) ->
│ │ │ -    {next_state, {StateName,NewLockButton}, Data,
│ │ │ -     [{reply,From,OldLockButton}]}.
        do_lock() ->
│ │ │ -    io:format("Locked~n", []).
│ │ │ -do_unlock() ->
│ │ │ -    io:format("Open~n", []).
│ │ │ +handle_event(
│ │ │ +  {call,From}, {set_lock_button,NewLockButton},
│ │ │ +  {StateName,OldLockButton}, Data) ->
│ │ │ +    {next_state, {StateName,NewLockButton}, Data,
│ │ │ +     [{reply,From,OldLockButton}]}.
        do_lock() ->
│ │ │ +    io:format("Locked~n", []).
│ │ │ +do_unlock() ->
│ │ │ +    io:format("Open~n", []).
│ │ │  
│ │ │ -terminate(_Reason, State, _Data) ->
│ │ │ -    State =/= locked andalso do_lock(),
│ │ │ +terminate(_Reason, State, _Data) ->
│ │ │ +    State =/= locked andalso do_lock(),
│ │ │      ok.
        
│ │ │    
│ │ │      
│ │ │    
│ │ │    Hibernation
│ │ │  
        
│ │ │  
        If you have many servers in one node and they have some state(s) in their
│ │ │ @@ -1428,19 +1428,19 @@
│ │ │  footprint of a server can be minimized by hibernating it through
│ │ │  proc_lib:hibernate/3.
        Note
        It is rather costly to hibernate a process; see erlang:hibernate/3. It is
│ │ │  not something you want to do after every event.
        We can in this example hibernate in the {open, _} state,
│ │ │  because what normally occurs in that state is that the state time-out
│ │ │  after a while triggers a transition to {locked, _}:
        ...
│ │ │  %%
│ │ │  %% State: open
│ │ │ -handle_event(enter, _OldState, {open,_}, _Data) ->
│ │ │ -    do_unlock(),
│ │ │ -    {keep_state_and_data,
│ │ │ -     [{state_timeout,10_000,lock}, % Time in milliseconds
│ │ │ -      hibernate]};
│ │ │ +handle_event(enter, _OldState, {open,_}, _Data) ->
│ │ │ +    do_unlock(),
│ │ │ +    {keep_state_and_data,
│ │ │ +     [{state_timeout,10_000,lock}, % Time in milliseconds
│ │ │ +      hibernate]};
│ │ │  ...
        The atom hibernate in the action list on the
│ │ │  last line when entering the {open, _} state is the only change. If any event
│ │ │  arrives in the {open, _}, state, we do not bother to rehibernate,
│ │ │  so the server stays awake after any event.
        To change that we would need to insert action hibernate in more places.
│ │ │  For example, the state-independent set_lock_button operation
│ │ │  would have to use hibernate but only in the {open, _} state,
│ │ │  which would clutter the code.
        Another not uncommon scenario is to use the
│ │ ├── ./usr/share/doc/erlang-doc/html/doc/system/sup_princ.html
│ │ │ @@ -128,48 +128,48 @@
│ │ │  the order specified by this list, and are terminated in the reverse order.
        
│ │ │    
│ │ │      
│ │ │    
│ │ │    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.
        
│ │ │    
│ │ │      
│ │ │    
│ │ │    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
        
│ │ │    
│ │ │      
│ │ │    
│ │ │ @@ -408,28 +408,28 @@
│ │ │  exhaust the Maximum Restart Intensity of the
│ │ │  parent supervisor.
        
│ │ │    
│ │ │      
│ │ │    
│ │ │    Child Specification
│ │ │  
        
│ │ │ -
        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
│ │ │  module-function-arguments tuple used as apply(M, F, A).
            It is to be (or result in) a call to any of the following:
            The start key is mandatory.
          •  restart defines when a terminated child process is to be
│ │ │  restarted.
            • A permanent child process is always restarted.
            • A temporary child process is never restarted (not even when the supervisor
│ │ │  restart strategy is rest_for_one or one_for_all and a sibling death
│ │ │ @@ -457,53 +457,53 @@
│ │ │  supervisor, the default value infinity will be used.
            • type specifies whether the child process is a supervisor or a worker.
              The type key is optional. If it is not given, the default value worker
│ │ │  will be used.
            • modules has to be a list consisting of a single element. The value
│ │ │  of that element depends on the behaviour of the process:
              • If the child process is a gen_event, the element has to be the atom
│ │ │  dynamic.
              • Otherwise, the element should be Module, where Module is the
│ │ │  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
│ │ │  name can be specified by calling
│ │ │  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.
            
│ │ │    
│ │ │      
│ │ │    
│ │ │    Adding a Child Process
│ │ │ @@ -532,31 +532,31 @@
│ │ │      
│ │ │    
│ │ │    Simplified one_for_one Supervisors
│ │ │  
            
│ │ │  
            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
│ │ │  specification. If the start function is specified as {M, F, A}, the child
│ │ │  process is started by calling apply(M, F, A++List).
            For example, adding a child to simple_sup above:
            supervisor:start_child(Pid, [id1])
            The result is that the child process is started by calling
│ │ │  apply(call, start_link, []++[id1]), or actually:
            call:start_link(id1)
            A child under a simple_one_for_one supervisor can be terminated with the
│ │ │  following:
            supervisor:terminate_child(Sup, Pid)
            Sup is the pid, or name, of the supervisor and Pid is the pid of the child.
            Because a simple_one_for_one supervisor can have many children, it shuts them
│ │ ├── ./usr/share/doc/erlang-doc/html/doc/system/tablesdatabases.html
│ │ │ @@ -146,73 +146,73 @@
│ │ │      
│ │ │    
│ │ │    Deleting an Element
│ │ │  
        
│ │ │  
        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,
        
│ │ │    
│ │ │      
│ │ │    
│ │ │    Fetching Data
│ │ │  
        
│ │ │  
        Do not fetch data that you already have.
        Consider that you have a module that handles the abstract data type Person.
│ │ │  You export the interface function print_person/1, which uses the internal
│ │ │  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]).
        
│ │ │    
│ │ │      
│ │ │    
│ │ │    Non-Persistent Database Storage
│ │ │  
        
│ │ │  
        For non-persistent database storage, prefer Ets tables over Mnesia
│ │ │  local_content tables. Even the Mnesia dirty_write operations carry a fixed
│ │ │ @@ -226,38 +226,38 @@
│ │ │  
│ │ │  
        Assuming an Ets table that uses idno as key and contains the following:
        [#person{idno = 1, name = "Adam",  age = 31, occupation = "mailman"},
│ │ │   #person{idno = 2, name = "Bryan", age = 31, occupation = "cashier"},
│ │ │   #person{idno = 3, name = "Bryan", age = 35, occupation = "banker"},
│ │ │   #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),
        
│ │ │    
│ │ │      
│ │ │    
│ │ │    ordered_set Tables
│ │ │  
        
│ │ │  
        If the data in the table is to be accessed so that the order of the keys in the
│ │ │  table is significant, the table type ordered_set can be used instead of the
│ │ │ @@ -293,20 +293,20 @@
│ │ │  Clearly, the second table would have to be kept consistent with the master
│ │ │  table. Mnesia can do this for you, but a home-brew index table can be very
│ │ │  efficient compared to the overhead involved in using Mnesia.
        An index table for the table in the previous examples would have to be a bag (as
│ │ │  keys would appear more than once) and can have the following contents:
        [#index_entry{name="Adam", idno=1},
│ │ │   #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
│ │ │  table. The number of operations gained from the table must therefore be compared
│ │ │  against the number of operations inserting objects in the table. However, notice
│ │ │  that the gain is significant when the key can be used to lookup elements.
        
│ │ │    
│ │ │ @@ -321,51 +321,51 @@
│ │ │    Secondary Index
│ │ │  
        
│ │ │  
        If you frequently do lookups on a field that is not the key of the table, you
│ │ │  lose performance using mnesia:select() or
│ │ │  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),
        
│ │ │    
│ │ │      
│ │ │    
│ │ │    Transactions
│ │ │  
        
│ │ │  
        Using transactions is a way to guarantee that the distributed Mnesia database
│ │ │  remains consistent, even when many different processes update it in parallel.
│ │ │  However, if you have real-time requirements it is recommended to use dirtry
│ │ │  operations instead of transactions. When using dirty operations, you lose the
│ │ │  consistency guarantee; this is usually solved by only letting one process update
│ │ │  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,
│ │ │  
│ │ │ -{atomic, [Result1, Result2]}  = mnesia:transaction(Fun),
│ │ │ +{atomic, [Result1, Result2]}  = mnesia:transaction(Fun),
│ │ │  ...
│ │ │  
│ │ │  %% Same thing using dirty operations
│ │ │  ...
│ │ │  
│ │ │ -Result1 = mnesia:dirty_read({Table, Key}),
│ │ │ -Result2 = mnesia:dirty_read({Table2, Key2}),
        
│ │ │ +        Result1 = mnesia:dirty_read({Table, Key}),
│ │ │ +Result2 = mnesia:dirty_read({Table2, Key2}),
        
│ │ │  
│ │ │  
│ │ │  
        
│ │ │    
        
│ │ │  
│ │ │        
        map/0 type.
        For convenience, the following types are also built-in. They can be thought as
│ │ │  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.
        
│ │ │    
│ │ │      
│ │ │    
│ │ │    Redefining built-in types
│ │ │  
        
│ │ │  
        Change
        Starting from Erlang/OTP 26, it is permitted to define a type having the same
│ │ │  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.
        
│ │ │    
│ │ │      
│ │ │    
│ │ │    Type Declarations of User-Defined Types
│ │ │  
        
│ │ │  
        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
│ │ │  the module
        • Remote type, that is, type defined in, and exported by, other modules; more
│ │ │  about this soon.
        For module-local types, the restriction that their definition exists in the
│ │ │  module is enforced by the compiler and results in a compilation error. (A
│ │ │  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
│ │ │  accessible by other modules anyway - and is always to be exported.
        Read more on Opaques
        
│ │ │    
│ │ │      
│ │ │    
│ │ │    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{}.
        
│ │ │    
│ │ │      
│ │ │    
│ │ │    Specifications for Functions
│ │ │  
        
│ │ │  
        A specification (or contract) for a function is given using the -spec
│ │ │  attribute. The general format is as follows:
        -spec Function(ArgType1, ..., ArgTypeN) -> ReturnType.
        An implementation of the function with the same name Function must exist in
│ │ │  the current module, and the arity of the function must match the number of
│ │ │  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/erlang-doc/html/doc/upcoming_incompatibilities.html
│ │ │ @@ -149,45 +149,45 @@
│ │ │  occurrences of maybe without quotes.
        
│ │ │    
│ │ │      
│ │ │    
│ │ │    0.0 and -0.0 will no longer be exactly equal
│ │ │  
        
│ │ │  
        Currently, the floating point numbers 0.0 and -0.0 have distinct internal
│ │ │ -representations. That can be seen if they are converted to binaries:
        1> <<0.0/float>>.
│ │ │ -<<0,0,0,0,0,0,0,0>>
│ │ │ -2> <<-0.0/float>>.
│ │ │ -<<128,0,0,0,0,0,0,0>>
        However, when they are matched against each other or compared using the =:=
│ │ │ +representations. That can be seen if they are converted to binaries:
        1> <<0.0/float>>.
│ │ │ +<<0,0,0,0,0,0,0,0>>
│ │ │ +2> <<-0.0/float>>.
│ │ │ +<<128,0,0,0,0,0,0,0>>
        However, when they are matched against each other or compared using the =:=
│ │ │  operator, they are considered to be equal. Thus, 0.0 =:= -0.0 currently
│ │ │  returns true.
        In Erlang/OTP 27, 0.0 =:= -0.0 will return false, and matching 0.0 against
│ │ │  -0.0 will fail. When used as map keys, 0.0 and -0.0 will be considered to
│ │ │  be distinct.
        The == operator will continue to return true for 0.0 == -0.0.
        To help to find code that might need to be revised, in OTP 27 there will be a
│ │ │  new compiler warning when matching against 0.0 or comparing to that value
│ │ │  using the =:= operator. The warning can be suppressed by matching against
│ │ │  +0.0 instead of 0.0.
        We plan to introduce the same warning in OTP 26.1, but by default it will be
│ │ │  disabled.
        
│ │ │    
│ │ │      
│ │ │    
│ │ │    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.
        
│ │ │    
│ │ │      
│ │ │    
│ │ │    Escripts will be compiled by default
│ │ │  
        
│ │ │  
        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.
        
│ │ │    
│ │ │      
│ │ │    
│ │ │    -code_path_choice will default to strict
│ │ │  
        
│ │ │  
        This command line option controls if paths given in the command line, boot
│ │ │  scripts, and the code server should be interpreted as is strict or relaxed.
        OTP 26 and earlier defaults to relaxed, which means -pa myapp/ebin would
│ │ │ @@ -231,18 +231,18 @@
│ │ │  "
│ │ │  String Content
│ │ │  "
│ │ │  %%
│ │ │  %% 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
│ │ │  "++ foo() ++"
        From Erlang/OTP 26.1 up to 27.0 the compiler issues a warning for a sequence of
│ │ │  3 or more double-quote characters since that is almost certainly a mistake or
│ │ │  something like a result of bad automatic code generation. If a users gets that
│ │ │  warning, the code should be corrected for example by inserting appropriate
│ │ ├── ./usr/share/doc/erlang-doc/html/erts-15.2.7.8/doc/html/alt_dist.html
│ │ │ @@ -237,50 +237,50 @@
│ │ │  uds_dist example using a port driver written in C, erl_uds_dist is written
│ │ │  entirely in Erlang.
        
│ │ │    
│ │ │      
│ │ │    
│ │ │    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
│ │ │  after the @ sign in the full node name. It is always a string.
            The return value consists of a Listen handle (which is later passed to the
│ │ │  accept/1 callback), Address which is a
│ │ │  #net_address{} record with information about the address for the node (the
│ │ │  #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
│ │ │  return value of the listen/1 callback above.
│ │ │  accept/1 is called only once when the distribution protocol is started.
            The caller of this function is a representative for net_kernel (this may or
│ │ │  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
│ │ │  SupervisorPid is the process identifier of the connection supervisor
│ │ │  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
│ │ │  process should preferably execute on max priority and should be linked to
│ │ │  the caller. The dist_util:net_ticker_spawn_options() function can be called
│ │ │  to get spawn options suitable for this process which can be passed directly to
│ │ │  erlang:spawn_opt/4. dist_util:net_ticker_spawn_options() will by default
│ │ │ @@ -294,15 +294,15 @@
│ │ │  dist_util:handshake_other_started(HsData).
          • Allowed - To be passed along to
│ │ │  dist_util:handshake_other_started(HsData).
          • SetupTime - Time used for creating a setup timer by a call to
│ │ │  dist_util:start_timer(SetupTime). The timer should be passed along to
│ │ │  dist_util:handshake_other_started(HsData).
          The created process should provide callbacks and other information needed for
│ │ │  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
│ │ │  function as a connection supervisor. This process should preferably execute on
│ │ │  max priority and should be linked to the caller. The
│ │ │  dist_util:net_ticker_spawn_options() function can be called to get spawn
│ │ │  options suitable for this process which can be passed directly to
│ │ │ @@ -320,23 +320,23 @@
│ │ │  may not be the process registered as net_kernel) and is in this document
│ │ │  identified as Kernel.
          This function should, besides spawning the connection supervisor, also create
│ │ │  a distribution controller. The distribution controller is either a process or
│ │ │  a port which is responsible for dispatching traffic.
          The created process should provide callbacks and other information needed for
│ │ │  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.
        
│ │ │    
│ │ │      
│ │ │    
│ │ │    The #hs_data{} Record
│ │ │  
        
│ │ │ @@ -350,44 +350,44 @@
│ │ │  accept_connection/5.
      • other_node - Name of the other node. This field
│ │ │  is only mandatory when this node initiates the connection. That is, when
│ │ │  connection is set up via setup/5.
      • this_node - The node name of this node.
      • socket - The identifier of the distribution
│ │ │  controller.
      • timer - The timer created using
│ │ │  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
│ │ │  channel is up. The distribution controller can begin dispatching traffic over
│ │ │  the channel. This function is optional.
        Only used during handshake phase.
      • add_flags -
│ │ │  Distribution flags to add to the connection.
│ │ │  Currently all (non obsolete) flags will automatically be enabled.
        This flag field is optional.
      • reject_flags -
│ │ ├── ./usr/share/doc/erlang-doc/html/erts-15.2.7.8/doc/html/automaticyieldingofccode.html
│ │ │ @@ -209,17 +209,17 @@
│ │ │  they have to follow certain restrictions. The convention for making
│ │ │  this clear is to have a comment above the function that explains that
│ │ │  the function is transformed by YCF (see maps_values_1_helper in
│ │ │  erl_map.c for an example). If only the transformed version of the
│ │ │  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.
        
│ │ │    
│ │ │      
│ │ │    
│ │ │    Where to Place YCF Transformed Functions
│ │ ├── ./usr/share/doc/erlang-doc/html/erts-15.2.7.8/doc/html/beam_makeops.html
│ │ │ @@ -151,17 +151,17 @@
│ │ │  The loader translates generic instructions to specific instructions.
│ │ │  In general, for each generic instruction, there exists a family of
│ │ │  specific instructions.  The OTP 20 release has 389 specific
│ │ │  instructions.
      • The implementation of specific instructions for the traditional
│ │ │  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
│ │ │  specific instructions.  The types that an instance of a specific
│ │ │  instruction can handle are encoded in the instruction names.  For
│ │ │  example, move_xy takes an X register number as the first operand and
│ │ │  a Y register number as the second operand.  move_cx takes a tagged
│ │ │ @@ -185,17 +185,17 @@
│ │ │  move c x
    Each specific instructions is defined by following the name of the
│ │ │  instruction with the types for each operand.  An operand type is a
│ │ │  single letter.  For example, x means an X register, y
│ │ │  means a Y register, and c is a "constant" (a tagged term such as
│ │ │  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
│ │ │  the instruction and $Dst to the code for the destination register.
    We will look at the code for each specific instruction in turn.  To
│ │ │  make the code easier to understand, let's first look at the memory
│ │ │  layout for the instruction {move,{atom,id},{x,5}}:
         +--------------------+--------------------+
│ │ │  I -> |                 40 |       &&lb_move_cx |
│ │ │ @@ -204,61 +204,61 @@
│ │ │       +--------------------+--------------------+
    This example and all other examples in the document assumes a 64-bit
│ │ │  architecture, and furthermore that pointers to C code fit in 32 bits.
    I in the BEAM virtual machine is the instruction pointer.  When BEAM
│ │ │  executes an instruction, I points to the first word of the
│ │ │  instruction.
    &&lb_move_cx is the address to C code that implements move_cx.  It
│ │ │  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()
│ │ │  macro extracts the pointer from the lower 32 bits of the instruction
│ │ │  word.
    • xb(BeamExtraData(I[0])) = I[1]; is the expansion of $Dst = $Src.
│ │ │  BeamExtraData() is a macro that will extract the upper 32 bits from
│ │ │  the instruction word.  In this example, it will return 40 which is the
│ │ │  byte offset for X register 5.  The xb() macro will cast a byte
│ │ │  pointer to an Eterm pointer and dereference it.  The I[1] on
│ │ │  the right-hand side of the = fetches an Erlang term (the atom id in
│ │ │  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
│ │ │  into the instruction word, the next instruction is in the very next
│ │ │  word.
    • xb((tmp_packed1>>BEAM_TIGHT_SHIFT)) = xb(tmp_packed1&BEAM_TIGHT_MASK);
│ │ │  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);
│ │ │ +}
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Transformation rules
│ │ │  
    
│ │ │  
    Next let's look at how we can do some optimizations using transformation
│ │ │  rules.  For simple instructions such as move/2, the instruction dispatch
│ │ │ @@ -271,21 +271,21 @@
│ │ │  with an uppercase letter just as in Erlang.  A pattern variable may be
│ │ │  followed = and one or more type letters to constrain the match to
│ │ │  one of those types.  The variables that are bound on the left-hand side can
│ │ │  be used on the right-hand side.
    We will also need to define a specific instruction and an implementation:
    # In ops.tab
│ │ │  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 =>
│ │ │        move3 X1 Y1 X2 Y2 X3 Y3
    (For readability, a long transformation line can be broken after |
│ │ │  and => operators.)
    It would also be possible to define it like this:
    move X1=x Y1=y | move X2=x Y2=y | move X3=x Y3=y =>
│ │ │       move3 X1 Y1 X2 Y2 X3 Y3
    but in that case it must be defined before the rule for move2/4
│ │ │  because the first matching rule will be applied.
    One must be careful not to create infinite loops.  For example, if we
│ │ │ @@ -433,29 +433,29 @@
│ │ │  i_bs_get_integer_32 x f? x
│ │ │  %endif
    The specific instruction i_bs_get_integer_32 will only be defined
│ │ │  on a 64-bit machine.
    The condition can be inverted by using %unless instead of %if:
    %unless NO_FPE_SIGNALS
│ │ │  fcheckerror p => i_fcheckerror
│ │ │  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
│ │ │  probes (support for dtrace or systemtap), 0 otherwise.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │ @@ -676,15 +676,15 @@
│ │ │  match both source and destination registers.  As an operand in a specific
│ │ │  instruction, it must only be used for a destination register.)
  • o - Overflow.  An untagged integer that does not fit in a machine word.
    • Predicates
    If the constraints described so far is not enough, additional
│ │ │  constraints can be implemented in C and be called as a guard function
│ │ │  on the left-hand side of the transformation.  If the guard function returns
│ │ │  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.
│ │ │  Predicates only used by the emulator can be found in
│ │ │  emu/predicates.tab.
    
│ │ │    
│ │ │      
│ │ │ @@ -692,41 +692,41 @@
│ │ │    A very brief note on implementation of predicates
│ │ │  
    
│ │ │  
    It is outside the scope for this document to describe in detail how
│ │ │  predicates are implemented because it requires knowledge of the
│ │ │  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=* =>
│ │ │      i_const_select_val Src Fail Size List
    This transformation renames a select_val/3 instruction
│ │ │  with a constant source operand to i_const_select_val/3.
    Constructing new instructions on the right-hand side
    The most common operand on the right-hand side is a variable that was
│ │ │  bound while matching the pattern on the left-hand side.  For example:
    trim N Remaining => i_trim N
    An operand can also be a type letter to construct an operand of that
│ │ │  type.  Each type has a default value.  For example, the type x has
│ │ │  the default value 1023, which is the highest X register.  That makes
│ │ │  x on the right-hand side a convenient shortcut for a temporary X
│ │ │ @@ -746,53 +746,53 @@
│ │ │  transformation rule.
    • u - Construct an untagged integer.  The default value is 0.
    • x - X register.  The default value is 1023.  That makes x convenient to
│ │ │  use as a temporary X register.
    • y - Y register.  The default value is 0.
    • l - Floating point register number.  The default value is 0.
    • i - Tagged literal integer.  The default value is 0.
    • a - Tagged atom.  The default value is the empty atom (am_Empty).
    • p - Zero failure label.
    • n - NIL ([], the empty list).
    Function call on the right-hand side
    Transformations that are not possible to describe with the rule
│ │ │  language as described here can be implemented as a generator function
│ │ │  in C and called from the right-hand side of a transformation.  The left-hand
│ │ │  side of the transformation will perform the match and bind operands to
│ │ │  variables.  The variables can then be passed to a generator function
│ │ │  on the right-hand side.  For example:
    bif2 Fail=j u$bif:erlang:element/2 Index=s Tuple=xy Dst=d =>
│ │ │ -    element(Jump, Index, Tuple, Dst)
    This transformation rule matches a call to the BIF element/2.
│ │ │ +    element(Jump, Index, Tuple, Dst)
    This transformation rule matches a call to the BIF element/2.
│ │ │  The operands will be captured and the generator function element() will
│ │ │  be called.
    The element() generator will produce one of two instructions
│ │ │  depending on Index.  If Index is an integer in the range from 1 up
│ │ │  to the maximum tuple size, the instruction i_fast_element/2 will be
│ │ │  produced, otherwise the instruction i_element/4 will be produced.
│ │ │  The corresponding specific instructions are:
    i_fast_element xy j? I d
│ │ │  i_element xy j? s d
    The i_fast_element/2 instruction is faster because the tuple is
│ │ │  already an untagged integer.  It also knows that the index is at least
│ │ │  1, so it does not have to test for that.  The i_element/4
│ │ │  instruction will have to fetch the index from a register, test that it
│ │ │  is an integer, and untag the integer.
    At the time of writing, all generators functions were defined in files
│ │ │  named generators.tab in several directories (in the same directories
│ │ │  as the predicates.tab files).
    It is outside the scope of this document to describe in detail how
│ │ │  generator functions are written, but here is the implementation of
│ │ │ -element():
    gen.element(Fail, Index, Tuple, Dst) {
│ │ │ +element():
    gen.element(Fail, Index, Tuple, Dst) {
│ │ │      BeamOp* op;
│ │ │  
│ │ │ -    $NewBeamOp(S, op);
│ │ │ +    $NewBeamOp(S, op);
│ │ │  
│ │ │ -    if (Index.type == TAG_i && Index.val > 0 &&
│ │ │ +    if (Index.type == TAG_i && Index.val > 0 &&
│ │ │          Index.val <= ERTS_MAX_TUPLE_SIZE &&
│ │ │ -        (Tuple.type == TAG_x || Tuple.type == TAG_y)) {
│ │ │ -        $BeamOpNameArity(op, i_fast_element, 4);
│ │ │ -        op->a[0] = Tuple;
│ │ │ -        op->a[1] = Fail;
│ │ │ -        op->a[2].type = TAG_u;
│ │ │ -        op->a[2].val = Index.val;
│ │ │ -        op->a[3] = Dst;
│ │ │ -    } else {
│ │ │ -        $BeamOpNameArity(op, i_element, 4);
│ │ │ -        op->a[0] = Tuple;
│ │ │ -        op->a[1] = Fail;
│ │ │ -        op->a[2] = Index;
│ │ │ -        op->a[3] = Dst;
│ │ │ -    }
│ │ │ +        (Tuple.type == TAG_x || Tuple.type == TAG_y)) {
│ │ │ +        $BeamOpNameArity(op, i_fast_element, 4);
│ │ │ +        op->a[0] = Tuple;
│ │ │ +        op->a[1] = Fail;
│ │ │ +        op->a[2].type = TAG_u;
│ │ │ +        op->a[2].val = Index.val;
│ │ │ +        op->a[3] = Dst;
│ │ │ +    } else {
│ │ │ +        $BeamOpNameArity(op, i_element, 4);
│ │ │ +        op->a[0] = Tuple;
│ │ │ +        op->a[1] = Fail;
│ │ │ +        op->a[2] = Index;
│ │ │ +        op->a[3] = Dst;
│ │ │ +    }
│ │ │  
│ │ │      return op;
│ │ │ -}
    The gen. prefix tells beam_makeops that this function is a
│ │ │ +}
    The gen. prefix tells beam_makeops that this function is a
│ │ │  generator.  Without the prefix, it would have been interpreted as the
│ │ │  implementation of an instruction (described in Defining the
│ │ │  implementation).
    Generator functions have a magic variabled called S, which is a
│ │ │  pointer to a state struct.  In the example, S is used in the invocation
│ │ │  of the NewBeamOp macro.
    
│ │ │    
│ │ │      
│ │ │ @@ -814,473 +814,473 @@
│ │ │  msg_instrs.tab
│ │ │  select_instrs.tab
│ │ │  trace_instrs.tab
    There is also a file that only contains macro definitions:
    macros.tab
    The syntax of each file is similar to C code.  In fact, most of
│ │ │  the contents is C code, interspersed with macro invocations.
    To allow Emacs to auto-indent the code, each file starts with the
│ │ │  following line:
    // -*- c -*-
    To avoid messing up the indentation, all comments are written
│ │ │  as C++ style comments (//) instead of #.  Note that a comment
│ │ │  must start at the beginning of a line.
    The meat of an instruction definition file are macro definitions.
│ │ │ -We have seen this macro definition before:
    move(Src, Dst) {
│ │ │ +We have seen this macro definition before:
    move(Src, Dst) {
│ │ │      $Dst = $Src;
│ │ │ -}
    A macro definitions must start at the beginning of the line (no spaces
│ │ │ +}
    A macro definitions must start at the beginning of the line (no spaces
│ │ │  allowed), the opening curly bracket must be on the same line, and the
│ │ │  finishing curly bracket must be at the beginning of a line.  It is
│ │ │  recommended that the macro body is properly indented.
    As a convention, the macro arguments in the head all start with an
│ │ │  uppercase letter.  In the body, the macro arguments can be expanded
│ │ │  by preceding them with $.
    A macro definition whose name and arity matches a family of
│ │ │  specific instructions is assumed to be the implementation of that
│ │ │  instruction.
    A macro can also be invoked from within another macro.  For example,
│ │ │  move_deallocate_return/2 avoids repeating code by invoking
│ │ │ -$deallocate_return() as a macro:
    move_deallocate_return(Src, Deallocate) {
│ │ │ -    x(0) = $Src;
│ │ │ -    $deallocate_return($Deallocate);
│ │ │ -}
    Here is the definition of deallocate_return/1:
    deallocate_return(Deallocate) {
│ │ │ +$deallocate_return() as a macro:
    move_deallocate_return(Src, Deallocate) {
│ │ │ +    x(0) = $Src;
│ │ │ +    $deallocate_return($Deallocate);
│ │ │ +}
    Here is the definition of deallocate_return/1:
    deallocate_return(Deallocate) {
│ │ │      //| -no_next
│ │ │      int words_to_pop = $Deallocate;
│ │ │ -    SET_I((BeamInstr *) cp_val(*E));
│ │ │ -    E = ADD_BYTE_OFFSET(E, words_to_pop);
│ │ │ -    CHECK_TERM(x(0));
│ │ │ +    SET_I((BeamInstr *) cp_val(*E));
│ │ │ +    E = ADD_BYTE_OFFSET(E, words_to_pop);
│ │ │ +    CHECK_TERM(x(0));
│ │ │      DispatchReturn;
│ │ │ -}
    The expanded code for move_deallocate_return will look this:
    OpCase(move_deallocate_return_cQ):
│ │ │ -{
│ │ │ -  x(0) = I[1];
│ │ │ -  do {
│ │ │ -    int words_to_pop = Qb(BeamExtraData(I[0]));
│ │ │ -    SET_I((BeamInstr *) cp_val(*E));
│ │ │ -    E = ADD_BYTE_OFFSET(E, words_to_pop);
│ │ │ -    CHECK_TERM(x(0));
│ │ │ +}
    The expanded code for move_deallocate_return will look this:
    OpCase(move_deallocate_return_cQ):
│ │ │ +{
│ │ │ +  x(0) = I[1];
│ │ │ +  do {
│ │ │ +    int words_to_pop = Qb(BeamExtraData(I[0]));
│ │ │ +    SET_I((BeamInstr *) cp_val(*E));
│ │ │ +    E = ADD_BYTE_OFFSET(E, words_to_pop);
│ │ │ +    CHECK_TERM(x(0));
│ │ │      DispatchReturn;
│ │ │ -  } while (0);
│ │ │ -}
    When expanding macros, beam_makeops wraps the expansion in a
│ │ │ +  } while (0);
│ │ │ +}
    When expanding macros, beam_makeops wraps the expansion in a
│ │ │  do/while wrapper unless beam_makeops can clearly see that no
│ │ │  wrapper is needed.  In this case, the wrapper is needed.
    Note that arguments for macros cannot be complex expressions, because
│ │ │  the arguments are split on ,.  For example, the following would
│ │ │  not work because beam_makeops would split the expression into
│ │ │ -two arguments:
    $deallocate_return(get_deallocation(y, $Deallocate));
    Code generation directives
    Within macro definitions, // comments are in general not treated
│ │ │ +two arguments:
    $deallocate_return(get_deallocation(y, $Deallocate));
    Code generation directives
    Within macro definitions, // comments are in general not treated
│ │ │  specially.  They will be copied to the file with the generated code
│ │ │  along with the rest of code in the body.
    However, there is an exception. Within a macro definition, a line that
│ │ │  starts with whitespace followed by //| is treated specially.  The
│ │ │  rest of the line is assumed to contain directives to control code
│ │ │  generation.
    Currently, two code generation directives are recognized:
    The -no_prefetch directive
    To see what -no_prefetch does, let's first look at the default code
│ │ │ -generation.  Here is the code generated for move_cx:
    OpCase(move_cx):
│ │ │ -{
│ │ │ -  BeamInstr next_pf = BeamCodeAddr(I[2]);
│ │ │ -  xb(BeamExtraData(I[0])) = I[1];
│ │ │ +generation.  Here is the code generated for move_cx:
    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);
│ │ │ -}
    Note that the very first thing done is to fetch the address to the
│ │ │ +  ASSERT(VALID_INSTR(next_pf));
│ │ │ +  GotoPF(next_pf);
│ │ │ +}
    Note that the very first thing done is to fetch the address to the
│ │ │  next instruction.  The reason is that it usually improves performance.
    Just as a demonstration, we can add a -no_prefetch directive to
│ │ │ -the move/2 instruction:
    move(Src, Dst) {
│ │ │ +the move/2 instruction:
    move(Src, Dst) {
│ │ │      //| -no_prefetch
│ │ │      $Dst = $Src;
│ │ │ -}
    We can see that the prefetch is no longer done:
    OpCase(move_cx):
│ │ │ -{
│ │ │ -  xb(BeamExtraData(I[0])) = I[1];
│ │ │ +}
    We can see that the prefetch is no longer done:
    OpCase(move_cx):
│ │ │ +{
│ │ │ +  xb(BeamExtraData(I[0])) = I[1];
│ │ │    I += 2;
│ │ │ -  ASSERT(VALID_INSTR(*I));
│ │ │ -  Goto(*I);
│ │ │ -}
    When would we want to turn off the prefetch in practice?
    In instructions that will not always execute the next instruction.
│ │ │ -For example:
    is_atom(Fail, Src) {
│ │ │ -    if (is_not_atom($Src)) {
│ │ │ -        $FAIL($Fail);
│ │ │ -    }
│ │ │ -}
│ │ │ +  ASSERT(VALID_INSTR(*I));
│ │ │ +  Goto(*I);
│ │ │ +}
    When would we want to turn off the prefetch in practice?
    In instructions that will not always execute the next instruction.
│ │ │ +For example:
    is_atom(Fail, Src) {
│ │ │ +    if (is_not_atom($Src)) {
│ │ │ +        $FAIL($Fail);
│ │ │ +    }
│ │ │ +}
│ │ │  
│ │ │  // From macros.tab
│ │ │ -FAIL(Fail) {
│ │ │ +FAIL(Fail) {
│ │ │      //| -no_prefetch
│ │ │ -    $SET_I_REL($Fail);
│ │ │ -    Goto(*I);
│ │ │ -}
    is_atom/2 may either execute the next instruction (if the second
│ │ │ -operand is an atom) or branch to the failure label.
    The generated code looks like this:
    OpCase(is_atom_fx):
│ │ │ -{
│ │ │ -  if (is_not_atom(xb(I[1]))) {
│ │ │ -    ASSERT(VALID_INSTR(*(I + (fb(BeamExtraData(I[0]))) + 0)));
│ │ │ -    I += fb(BeamExtraData(I[0])) + 0;;
│ │ │ -    Goto(*I);;
│ │ │ -  }
│ │ │ +    $SET_I_REL($Fail);
│ │ │ +    Goto(*I);
│ │ │ +}
    is_atom/2 may either execute the next instruction (if the second
│ │ │ +operand is an atom) or branch to the failure label.
    The generated code looks like this:
    OpCase(is_atom_fx):
│ │ │ +{
│ │ │ +  if (is_not_atom(xb(I[1]))) {
│ │ │ +    ASSERT(VALID_INSTR(*(I + (fb(BeamExtraData(I[0]))) + 0)));
│ │ │ +    I += fb(BeamExtraData(I[0])) + 0;;
│ │ │ +    Goto(*I);;
│ │ │ +  }
│ │ │    I += 2;
│ │ │ -  ASSERT(VALID_INSTR(*I));
│ │ │ -  Goto(*I);
│ │ │ -}
    The -no_next directive
    Next we will look at when the -no_next directive can be used.  Here
│ │ │ -is the jump/1 instruction:
    jump(Fail) {
│ │ │ -    $JUMP($Fail);
│ │ │ -}
│ │ │ +  ASSERT(VALID_INSTR(*I));
│ │ │ +  Goto(*I);
│ │ │ +}
    The -no_next directive
    Next we will look at when the -no_next directive can be used.  Here
│ │ │ +is the jump/1 instruction:
    jump(Fail) {
│ │ │ +    $JUMP($Fail);
│ │ │ +}
│ │ │  
│ │ │  // From macros.tab
│ │ │ -JUMP(Fail) {
│ │ │ +JUMP(Fail) {
│ │ │      //| -no_next
│ │ │ -    $SET_I_REL($Fail);
│ │ │ -    Goto(*I);
│ │ │ -}
    The generated code looks like this:
    OpCase(jump_f):
│ │ │ -{
│ │ │ -  ASSERT(VALID_INSTR(*(I + (fb(BeamExtraData(I[0]))) + 0)));
│ │ │ -  I += fb(BeamExtraData(I[0])) + 0;;
│ │ │ -  Goto(*I);;
│ │ │ -}
    If we remove the -no_next directive, the code would look like this:
    OpCase(jump_f):
│ │ │ -{
│ │ │ -  BeamInstr next_pf = BeamCodeAddr(I[1]);
│ │ │ -  ASSERT(VALID_INSTR(*(I + (fb(BeamExtraData(I[0]))) + 0)));
│ │ │ -  I += fb(BeamExtraData(I[0])) + 0;;
│ │ │ -  Goto(*I);;
│ │ │ +    $SET_I_REL($Fail);
│ │ │ +    Goto(*I);
│ │ │ +}
    The generated code looks like this:
    OpCase(jump_f):
│ │ │ +{
│ │ │ +  ASSERT(VALID_INSTR(*(I + (fb(BeamExtraData(I[0]))) + 0)));
│ │ │ +  I += fb(BeamExtraData(I[0])) + 0;;
│ │ │ +  Goto(*I);;
│ │ │ +}
    If we remove the -no_next directive, the code would look like this:
    OpCase(jump_f):
│ │ │ +{
│ │ │ +  BeamInstr next_pf = BeamCodeAddr(I[1]);
│ │ │ +  ASSERT(VALID_INSTR(*(I + (fb(BeamExtraData(I[0]))) + 0)));
│ │ │ +  I += fb(BeamExtraData(I[0])) + 0;;
│ │ │ +  Goto(*I);;
│ │ │    I += 1;
│ │ │ -  ASSERT(VALID_INSTR(next_pf));
│ │ │ -  GotoPF(next_pf);
│ │ │ -}
    In the end, the C compiler will probably optimize this code to the
│ │ │ +  ASSERT(VALID_INSTR(next_pf));
│ │ │ +  GotoPF(next_pf);
│ │ │ +}
    In the end, the C compiler will probably optimize this code to the
│ │ │  same native code as the first version, but the first version is certainly
│ │ │  much easier to read for human readers.
    Macros in the macros.tab file
    The file macros.tab contains many useful macros.  When implementing
│ │ │  new instructions it is good practice to look through macros.tab to
│ │ │  see if any of existing macros can be used rather than re-inventing
│ │ │  the wheel.
    We will describe a few of the most useful macros here.
    The GC_REGEXP definition
    The following line defines a regular expression that will recognize
│ │ │  a call to a function that does a garbage collection:
     GC_REGEXP=erts_garbage_collect|erts_gc|GcBifFunction;
    The purpose is that beam_makeops can verify that an instruction
│ │ │  that does a garbage collection and has an d operand uses the
│ │ │  $REFRESH_GEN_DEST() macro.
    If you need to define a new function that does garbage collection,
│ │ │  you should give it the prefix erts_gc_.  If that is not possible
│ │ │  you should update the regular expression so that it will match your
│ │ │ -new function.
    FAIL(Fail)
    Branch to $Fail.  Will suppress prefetch (-no_prefetch).  Typical use:
    is_nonempty_list(Fail, Src) {
│ │ │ -    if (is_not_list($Src)) {
│ │ │ -        $FAIL($Fail);
│ │ │ -    }
│ │ │ -}
    JUMP(Fail)
    Branch to $Fail.  Suppresses generation of dispatch of the next
│ │ │ -instruction (-no_next).  Typical use:
    jump(Fail) {
│ │ │ -    $JUMP($Fail);
│ │ │ -}
    GC_TEST(NeedStack, NeedHeap, Live)
    $GC_TEST(NeedStack, NeedHeap, Live) tests that given amount of
│ │ │ +new function.
    FAIL(Fail)
    Branch to $Fail.  Will suppress prefetch (-no_prefetch).  Typical use:
    is_nonempty_list(Fail, Src) {
│ │ │ +    if (is_not_list($Src)) {
│ │ │ +        $FAIL($Fail);
│ │ │ +    }
│ │ │ +}
    JUMP(Fail)
    Branch to $Fail.  Suppresses generation of dispatch of the next
│ │ │ +instruction (-no_next).  Typical use:
    jump(Fail) {
│ │ │ +    $JUMP($Fail);
│ │ │ +}
    GC_TEST(NeedStack, NeedHeap, Live)
    $GC_TEST(NeedStack, NeedHeap, Live) tests that given amount of
│ │ │  stack space and heap space is available.  If not it will do a
│ │ │ -garbage collection.  Typical use:
    test_heap(Nh, Live) {
│ │ │ -    $GC_TEST(0, $Nh, $Live);
│ │ │ -}
    AH(NeedStack, NeedHeap, Live)
    AH(NeedStack, NeedHeap, Live) allocates a stack frame and
│ │ │ +garbage collection.  Typical use:
    test_heap(Nh, Live) {
│ │ │ +    $GC_TEST(0, $Nh, $Live);
│ │ │ +}
    AH(NeedStack, NeedHeap, Live)
    AH(NeedStack, NeedHeap, Live) allocates a stack frame and
│ │ │  optionally additional heap space.
    Pre-defined macros and variables
    beam_makeops defines several built-in macros and pre-bound variables.
    The NEXT_INSTRUCTION pre-bound variable
    The NEXT_INSTRUCTION is a pre-bound variable that is available in
│ │ │ -all instructions.  It expands to the address of the next instruction.
    Here is an example:
    i_call(CallDest) {
│ │ │ +all instructions.  It expands to the address of the next instruction.
    Here is an example:
    i_call(CallDest) {
│ │ │      //| -no_next
│ │ │ -    $SAVE_CONTINUATION_POINTER($NEXT_INSTRUCTION);
│ │ │ -    $DISPATCH_REL($CallDest);
│ │ │ -}
    When calling a function, the return address is first stored in E[0]
│ │ │ +    $SAVE_CONTINUATION_POINTER($NEXT_INSTRUCTION);
│ │ │ +    $DISPATCH_REL($CallDest);
│ │ │ +}
    When calling a function, the return address is first stored in E[0]
│ │ │  (using the $SAVE_CONTINUATION_POINTER() macro), and then control is
│ │ │ -transferred to the callee.  Here is the generated code:
    OpCase(i_call_f):
│ │ │ -{
│ │ │ -    ASSERT(VALID_INSTR(*(I+2)));
│ │ │ -    *E = (BeamInstr) (I+2);;
│ │ │ +transferred to the callee.  Here is the generated code:
    OpCase(i_call_f):
│ │ │ +{
│ │ │ +    ASSERT(VALID_INSTR(*(I+2)));
│ │ │ +    *E = (BeamInstr) (I+2);;
│ │ │  
│ │ │      /* ... dispatch code intentionally left out ... */
│ │ │ -}
    We can see that that $NEXT_INSTRUCTION has been expanded to I+2.
│ │ │ +}
    We can see that that $NEXT_INSTRUCTION has been expanded to I+2.
│ │ │  That makes sense since the size of the i_call_f/1 instruction is
│ │ │  two words.
    The IP_ADJUSTMENT pre-bound variable
    $IP_ADJUSTMENT is usually 0.  In a few combined instructions
│ │ │  (described below) it can be non-zero.  It is used like this
│ │ │ -in macros.tab:
    SET_I_REL(Offset) {
│ │ │ -    ASSERT(VALID_INSTR(*(I + ($Offset) + $IP_ADJUSTMENT)));
│ │ │ +in macros.tab:
    SET_I_REL(Offset) {
│ │ │ +    ASSERT(VALID_INSTR(*(I + ($Offset) + $IP_ADJUSTMENT)));
│ │ │      I += $Offset + $IP_ADJUSTMENT;
│ │ │ -}
    Avoid using IP_ADJUSTMENT directly.  Use SET_I_REL() or
│ │ │ +}
    Avoid using IP_ADJUSTMENT directly.  Use SET_I_REL() or
│ │ │  one of the macros that invoke such as FAIL() or JUMP()
│ │ │  defined in macros.tab.
    Pre-defined macro functions
    The IF() macro
    $IF(Expr, IfTrue, IfFalse) evaluates Expr, which must be a valid
│ │ │  Perl expression (which for simple numeric expressions have the same
│ │ │  syntax as C).  If Expr evaluates to 0, the entire IF() expression will be
│ │ │  replaced with IfFalse, otherwise it will be replaced with IfTrue.
    See the description of OPERAND_POSITION() for an example.
    The OPERAND_POSITION() macro
    $OPERAND_POSITION(Expr) returns the position for Expr, if
│ │ │  Expr is an operand that is not packed.  The first operand is
│ │ │ -at position 1.
    Returns 0 otherwise.
    This macro could be used like this in order to share code:
    FAIL(Fail) {
│ │ │ +at position 1.
    Returns 0 otherwise.
    This macro could be used like this in order to share code:
    FAIL(Fail) {
│ │ │      //| -no_prefetch
│ │ │ -    $IF($OPERAND_POSITION($Fail) == 1 && $IP_ADJUSTMENT == 0,
│ │ │ +    $IF($OPERAND_POSITION($Fail) == 1 && $IP_ADJUSTMENT == 0,
│ │ │          goto common_jump,
│ │ │ -        $DO_JUMP($Fail));
│ │ │ -}
│ │ │ +        $DO_JUMP($Fail));
│ │ │ +}
│ │ │  
│ │ │ -DO_JUMP(Fail) {
│ │ │ -    $SET_I_REL($Fail);
│ │ │ -    Goto(*I));
│ │ │ -}
│ │ │ +DO_JUMP(Fail) {
│ │ │ +    $SET_I_REL($Fail);
│ │ │ +    Goto(*I));
│ │ │ +}
│ │ │  
│ │ │  // In beam_emu.c:
│ │ │  common_jump:
│ │ │ -   I += I[1];
│ │ │ -   Goto(*I));
    The $REFRESH_GEN_DEST() macro
    When a specific instruction has a d operand, early during execution
│ │ │ +   I += I[1];
│ │ │ +   Goto(*I));
    The $REFRESH_GEN_DEST() macro
    When a specific instruction has a d operand, early during execution
│ │ │  of the instruction, a pointer will be initialized to point to the X or
│ │ │  Y register in question.
    If there is a garbage collection before the result is stored,
│ │ │  the stack will move and if the d operand referred to a Y
│ │ │  register, the pointer will no longer be valid.  (Y registers are
│ │ │  stored on the stack.)
    In those circumstances, $REFRESH_GEN_DEST() must be invoked
│ │ │  to set up the pointer again. beam_makeops will notice
│ │ │  if there is a call to a function that does a garbage collection and
│ │ │  $REFRESH_GEN_DEST() is not called.
    Here is a complete example.  The new_map instruction is defined
│ │ │ -like this:
    new_map d t I
    It is implemented like this:
    new_map(Dst, Live, N) {
│ │ │ +like this:
    new_map d t I
    It is implemented like this:
    new_map(Dst, Live, N) {
│ │ │      Eterm res;
│ │ │  
│ │ │      HEAVY_SWAPOUT;
│ │ │ -    res = erts_gc_new_map(c_p, reg, $Live, $N, $NEXT_INSTRUCTION);
│ │ │ +    res = erts_gc_new_map(c_p, reg, $Live, $N, $NEXT_INSTRUCTION);
│ │ │      HEAVY_SWAPIN;
│ │ │ -    $REFRESH_GEN_DEST();
│ │ │ +    $REFRESH_GEN_DEST();
│ │ │      $Dst = res;
│ │ │ -    $NEXT($NEXT_INSTRUCTION+$N);
│ │ │ -}
    If we have forgotten the $REFRESH_GEN_DEST() there would be a message
│ │ │ -similar to this:
    pointer to destination register is invalid after GC -- use $REFRESH_GEN_DEST()
│ │ │ -... from the body of new_map at beam/map_instrs.tab(30)
    Variable number of operands
    Here follows an example of how to handle an instruction with a variable number
│ │ │ +    $NEXT($NEXT_INSTRUCTION+$N);
│ │ │ +}
    If we have forgotten the $REFRESH_GEN_DEST() there would be a message
│ │ │ +similar to this:
    pointer to destination register is invalid after GC -- use $REFRESH_GEN_DEST()
│ │ │ +... from the body of new_map at beam/map_instrs.tab(30)
    Variable number of operands
    Here follows an example of how to handle an instruction with a variable number
│ │ │  of operands for the interpreter.  Here is the instruction definition in emu/ops.tab:
    put_tuple2 xy I *
    For the interpreter, the * is optional, because it does not effect code generation
│ │ │  in any way. However, it is recommended to include it to make it clear for human readers
│ │ │  that there is a variable number of operands.
    Use the $NEXT_INSTRUCTION macro to obtain a pointer to the first of the variable
│ │ │ -operands.
    Here is the implementation:
    put_tuple2(Dst, Arity) {
│ │ │ +operands.
    Here is the implementation:
    put_tuple2(Dst, Arity) {
│ │ │  Eterm* hp = HTOP;
│ │ │  Eterm arity = $Arity;
│ │ │ -Eterm* dst_ptr = &($Dst);
│ │ │ +Eterm* dst_ptr = &($Dst);
│ │ │  
│ │ │  //| -no_next
│ │ │ -ASSERT(arity != 0);
│ │ │ -*hp++ = make_arityval(arity);
│ │ │ +ASSERT(arity != 0);
│ │ │ +*hp++ = make_arityval(arity);
│ │ │  
│ │ │  /*
│ │ │   * The $NEXT_INSTRUCTION macro points just beyond the fixed
│ │ │   * operands. In this case it points to the descriptor of
│ │ │   * the first element to be put into the tuple.
│ │ │   */
│ │ │  I = $NEXT_INSTRUCTION;
│ │ │ -do {
│ │ │ +do {
│ │ │      Eterm term = *I++;
│ │ │ -    switch (loader_tag(term)) {
│ │ │ +    switch (loader_tag(term)) {
│ │ │      case LOADER_X_REG:
│ │ │ -    *hp++ = x(loader_x_reg_index(term));
│ │ │ +    *hp++ = x(loader_x_reg_index(term));
│ │ │      break;
│ │ │      case LOADER_Y_REG:
│ │ │ -    *hp++ = y(loader_y_reg_index(term));
│ │ │ +    *hp++ = y(loader_y_reg_index(term));
│ │ │      break;
│ │ │      default:
│ │ │      *hp++ = term;
│ │ │      break;
│ │ │ -    }
│ │ │ -} while (--arity != 0);
│ │ │ -*dst_ptr = make_tuple(HTOP);
│ │ │ +    }
│ │ │ +} while (--arity != 0);
│ │ │ +*dst_ptr = make_tuple(HTOP);
│ │ │  HTOP = hp;
│ │ │ -ASSERT(VALID_INSTR(* (Eterm *)I));
│ │ │ -Goto(*I);
│ │ │ -}
    Combined instructions
    Problem: For frequently executed instructions we want to use
│ │ │ +ASSERT(VALID_INSTR(* (Eterm *)I));
│ │ │ +Goto(*I);
│ │ │ +}
    Combined instructions
    Problem: For frequently executed instructions we want to use
│ │ │  "fast" operands types such as x and y, as opposed to s or S.
│ │ │  To avoid an explosion in code size, we want to share most of the
│ │ │  implementation between the instructions.  Here are the specific
│ │ │  instructions for i_increment/5:
    i_increment r W t d
│ │ │  i_increment x W t d
│ │ │ -i_increment y W t d
    The i_increment instruction is implemented like this:
    i_increment(Source, IncrementVal, Live, Dst) {
│ │ │ +i_increment y W t d
    The i_increment instruction is implemented like this:
    i_increment(Source, IncrementVal, Live, Dst) {
│ │ │      Eterm increment_reg_source = $Source;
│ │ │      Eterm increment_val = $IncrementVal;
│ │ │      Uint live;
│ │ │      Eterm result;
│ │ │  
│ │ │ -    if (ERTS_LIKELY(is_small(increment_reg_val))) {
│ │ │ -        Sint i = signed_val(increment_reg_val) + increment_val;
│ │ │ -        if (ERTS_LIKELY(IS_SSMALL(i))) {
│ │ │ -            $Dst = make_small(i);
│ │ │ -            $NEXT0();
│ │ │ -        }
│ │ │ -    }
│ │ │ +    if (ERTS_LIKELY(is_small(increment_reg_val))) {
│ │ │ +        Sint i = signed_val(increment_reg_val) + increment_val;
│ │ │ +        if (ERTS_LIKELY(IS_SSMALL(i))) {
│ │ │ +            $Dst = make_small(i);
│ │ │ +            $NEXT0();
│ │ │ +        }
│ │ │ +    }
│ │ │      live = $Live;
│ │ │      HEAVY_SWAPOUT;
│ │ │ -    reg[live] = increment_reg_val;
│ │ │ -    reg[live+1] = make_small(increment_val);
│ │ │ -    result = erts_gc_mixed_plus(c_p, reg, live);
│ │ │ +    reg[live] = increment_reg_val;
│ │ │ +    reg[live+1] = make_small(increment_val);
│ │ │ +    result = erts_gc_mixed_plus(c_p, reg, live);
│ │ │      HEAVY_SWAPIN;
│ │ │ -    ERTS_HOLE_CHECK(c_p);
│ │ │ -    if (ERTS_LIKELY(is_value(result))) {
│ │ │ -        $REFRESH_GEN_DEST();
│ │ │ +    ERTS_HOLE_CHECK(c_p);
│ │ │ +    if (ERTS_LIKELY(is_value(result))) {
│ │ │ +        $REFRESH_GEN_DEST();
│ │ │          $Dst = result;
│ │ │ -        $NEXT0();
│ │ │ -    }
│ │ │ -    ASSERT(c_p->freason != BADMATCH || is_value(c_p->fvalue));
│ │ │ +        $NEXT0();
│ │ │ +    }
│ │ │ +    ASSERT(c_p->freason != BADMATCH || is_value(c_p->fvalue));
│ │ │      goto find_func_info;
│ │ │ -}
    There will be three almost identical copies of the code.  Given the
│ │ │ +}
    There will be three almost identical copies of the code.  Given the
│ │ │  size of the code, that could be too high cost to pay.
    To avoid the three copies of the code, we could use only one specific
│ │ │  instruction:
    i_increment S W t d
    (The same implementation as above will work.)
    That reduces the code size, but is slower because S means that
│ │ │  there will be extra code to test whether the operand refers to an X
│ │ │  register or a Y register.
    Solution: We can use "combined instructions".  Combined
│ │ │  instructions are combined from instruction fragments.  The
│ │ │  bulk of the code can be shared.
    Here we will show how i_increment can be implemented as a combined
│ │ │  instruction.  We will show each individual fragment first, and then
│ │ │  show how to connect them together.  First we will need a variable that
│ │ │ -we can store the value fetched from the register in:
    increment.head() {
│ │ │ +we can store the value fetched from the register in:
    increment.head() {
│ │ │      Eterm increment_reg_val;
│ │ │ -}
    The name increment is the name of the group that the fragment
│ │ │ +}
    The name increment is the name of the group that the fragment
│ │ │  belongs to.  Note that it does not need to have the same
│ │ │  name as the instruction.  The group name is followed by . and
│ │ │  the name of the fragment.  The name head is pre-defined.
│ │ │  The code in it will be placed at the beginning of a block, so
│ │ │  that all fragments in the group can access it.
    Next we define the fragment that will pick up the value from the
│ │ │ -register from the first operand:
    increment.fetch(Src) {
│ │ │ +register from the first operand:
    increment.fetch(Src) {
│ │ │      increment_reg_val = $Src;
│ │ │ -}
    We call this fragment fetch.  This fragment will be duplicated three
│ │ │ -times, one for each value of the first operand (r, x, and y).
    Next we define the main part of the code that do the actual incrementing.
    increment.execute(IncrementVal, Live, Dst) {
│ │ │ +}
    We call this fragment fetch.  This fragment will be duplicated three
│ │ │ +times, one for each value of the first operand (r, x, and y).
    Next we define the main part of the code that do the actual incrementing.
    increment.execute(IncrementVal, Live, Dst) {
│ │ │      Eterm increment_val = $IncrementVal;
│ │ │      Uint live;
│ │ │      Eterm result;
│ │ │  
│ │ │ -    if (ERTS_LIKELY(is_small(increment_reg_val))) {
│ │ │ -        Sint i = signed_val(increment_reg_val) + increment_val;
│ │ │ -        if (ERTS_LIKELY(IS_SSMALL(i))) {
│ │ │ -            $Dst = make_small(i);
│ │ │ -            $NEXT0();
│ │ │ -        }
│ │ │ -    }
│ │ │ +    if (ERTS_LIKELY(is_small(increment_reg_val))) {
│ │ │ +        Sint i = signed_val(increment_reg_val) + increment_val;
│ │ │ +        if (ERTS_LIKELY(IS_SSMALL(i))) {
│ │ │ +            $Dst = make_small(i);
│ │ │ +            $NEXT0();
│ │ │ +        }
│ │ │ +    }
│ │ │      live = $Live;
│ │ │      HEAVY_SWAPOUT;
│ │ │ -    reg[live] = increment_reg_val;
│ │ │ -    reg[live+1] = make_small(increment_val);
│ │ │ -    result = erts_gc_mixed_plus(c_p, reg, live);
│ │ │ +    reg[live] = increment_reg_val;
│ │ │ +    reg[live+1] = make_small(increment_val);
│ │ │ +    result = erts_gc_mixed_plus(c_p, reg, live);
│ │ │      HEAVY_SWAPIN;
│ │ │ -    ERTS_HOLE_CHECK(c_p);
│ │ │ -    if (ERTS_LIKELY(is_value(result))) {
│ │ │ -        $REFRESH_GEN_DEST();
│ │ │ +    ERTS_HOLE_CHECK(c_p);
│ │ │ +    if (ERTS_LIKELY(is_value(result))) {
│ │ │ +        $REFRESH_GEN_DEST();
│ │ │          $Dst = result;
│ │ │ -        $NEXT0();
│ │ │ -    }
│ │ │ -    ASSERT(c_p->freason != BADMATCH || is_value(c_p->fvalue));
│ │ │ +        $NEXT0();
│ │ │ +    }
│ │ │ +    ASSERT(c_p->freason != BADMATCH || is_value(c_p->fvalue));
│ │ │      goto find_func_info;
│ │ │ -}
    We call this fragment execute.  It will handle the three remaining
│ │ │ +}
    We call this fragment execute.  It will handle the three remaining
│ │ │  operands (W t d).  There will only be one copy of this fragment.
    Now that we have defined the fragments, we need to inform
│ │ │  beam_makeops how they should be connected:
    i_increment := increment.fetch.execute;
    To the left of the := is the name of the specific instruction that
│ │ │  should be implemented by the fragments, in this case i_increment.
│ │ │  To the right of := is the name of the group with the fragments,
│ │ │  followed by a ..  Then the name of the fragments in the group are
│ │ │  listed in the order they should be executed.  Note that the head
│ │ │  fragment is not listed.
    The line ends in ; (to avoid messing up the indentation in Emacs).
    (Note that in practice the := line is usually placed before the
│ │ │ -fragments.)
    The generated code looks like this:
    {
│ │ │ +fragments.)
    The generated code looks like this:
    {
│ │ │    Eterm increment_reg_val;
│ │ │ -  OpCase(i_increment_rWtd):
│ │ │ -  {
│ │ │ -    increment_reg_val = r(0);
│ │ │ -  }
│ │ │ +  OpCase(i_increment_rWtd):
│ │ │ +  {
│ │ │ +    increment_reg_val = r(0);
│ │ │ +  }
│ │ │    goto increment__execute;
│ │ │  
│ │ │ -  OpCase(i_increment_xWtd):
│ │ │ -  {
│ │ │ -    increment_reg_val = xb(BeamExtraData(I[0]));
│ │ │ -  }
│ │ │ +  OpCase(i_increment_xWtd):
│ │ │ +  {
│ │ │ +    increment_reg_val = xb(BeamExtraData(I[0]));
│ │ │ +  }
│ │ │    goto increment__execute;
│ │ │  
│ │ │ -  OpCase(i_increment_yWtd):
│ │ │ -  {
│ │ │ -    increment_reg_val = yb(BeamExtraData(I[0]));
│ │ │ -  }
│ │ │ +  OpCase(i_increment_yWtd):
│ │ │ +  {
│ │ │ +    increment_reg_val = yb(BeamExtraData(I[0]));
│ │ │ +  }
│ │ │    goto increment__execute;
│ │ │  
│ │ │    increment__execute:
│ │ │ -  {
│ │ │ -    // Here follows the code from increment.execute()
│ │ │ +  {
│ │ │ +    // Here follows the code from increment.execute()
│ │ │      .
│ │ │      .
│ │ │      .
│ │ │ -}
    Some notes about combined instructions
    The operands that are different must be at
│ │ │ +}
    Some notes about combined instructions
    The operands that are different must be at
│ │ │  the beginning of the instruction.  All operands in the last
│ │ │  fragment must have the same operands in all variants of
│ │ │  the specific instruction.
    As an example, the following specific instructions cannot be
│ │ │  implemented as a combined instruction:
    i_times j? t x x d
│ │ │  i_times j? t x y d
│ │ │  i_times j? t s s d
    We would have to change the order of the operands so that the
│ │ │  two operands that are different are placed first:
    i_times x x j? t d
│ │ │  i_times x y j? t d
│ │ │  i_times s s j? t d
    We can then define:
    i_times := times.fetch.execute;
│ │ │  
│ │ │ -times.head {
│ │ │ +times.head {
│ │ │      Eterm op1, op2;
│ │ │ -}
│ │ │ +}
│ │ │  
│ │ │ -times.fetch(Src1, Src2) {
│ │ │ +times.fetch(Src1, Src2) {
│ │ │      op1 = $Src1;
│ │ │      op2 = $Src2;
│ │ │ -}
│ │ │ +}
│ │ │  
│ │ │ -times.execute(Fail, Live, Dst) {
│ │ │ +times.execute(Fail, Live, Dst) {
│ │ │      // Multiply op1 and op2.
│ │ │      .
│ │ │      .
│ │ │      .
│ │ │ -}
    Several instructions can share a group.  As an example, the following
│ │ │ +}
    Several instructions can share a group.  As an example, the following
│ │ │  instructions have different names, but in the end they all create a
│ │ │  binary.  The last two operands are common for all of them:
    i_bs_init_fail       xy j? t? x
│ │ │  i_bs_init_fail_heap s I j? t? x
│ │ │  i_bs_init                W t? x
│ │ │  i_bs_init_heap         W I t? x
    The instructions are defined like this (formatted with extra
│ │ │  spaces for clarity):
    i_bs_init_fail_heap := bs_init . fail_heap . verify . execute;
│ │ │  i_bs_init_fail      := bs_init . fail      . verify . execute;
│ │ │  i_bs_init           := bs_init .           .  plain . execute;
│ │ │  i_bs_init_heap      := bs_init .               heap . execute;
    Note that the first two instruction have three fragments, while the
│ │ │ -other two only have two fragments.  Here are the fragments:
    bs_init_bits.head() {
│ │ │ +other two only have two fragments.  Here are the fragments:
    bs_init_bits.head() {
│ │ │      Eterm num_bits_term;
│ │ │      Uint num_bits;
│ │ │      Uint alloc;
│ │ │ -}
│ │ │ +}
│ │ │  
│ │ │ -bs_init_bits.plain(NumBits) {
│ │ │ +bs_init_bits.plain(NumBits) {
│ │ │      num_bits = $NumBits;
│ │ │      alloc = 0;
│ │ │ -}
│ │ │ +}
│ │ │  
│ │ │ -bs_init_bits.heap(NumBits, Alloc) {
│ │ │ +bs_init_bits.heap(NumBits, Alloc) {
│ │ │      num_bits = $NumBits;
│ │ │      alloc = $Alloc;
│ │ │ -}
│ │ │ +}
│ │ │  
│ │ │ -bs_init_bits.fail(NumBitsTerm) {
│ │ │ +bs_init_bits.fail(NumBitsTerm) {
│ │ │      num_bits_term = $NumBitsTerm;
│ │ │      alloc = 0;
│ │ │ -}
│ │ │ +}
│ │ │  
│ │ │ -bs_init_bits.fail_heap(NumBitsTerm, Alloc) {
│ │ │ +bs_init_bits.fail_heap(NumBitsTerm, Alloc) {
│ │ │      num_bits_term = $NumBitsTerm;
│ │ │      alloc = $Alloc;
│ │ │ -}
│ │ │ +}
│ │ │  
│ │ │ -bs_init_bits.verify(Fail) {
│ │ │ +bs_init_bits.verify(Fail) {
│ │ │      // Verify the num_bits_term, fail using $FAIL
│ │ │      // if there is a problem.
│ │ │  .
│ │ │  .
│ │ │  .
│ │ │ -}
│ │ │ +}
│ │ │  
│ │ │ -bs_init_bits.execute(Live, Dst) {
│ │ │ +bs_init_bits.execute(Live, Dst) {
│ │ │     // Long complicated code to a create a binary.
│ │ │     .
│ │ │     .
│ │ │     .
│ │ │ -}
    The full definitions of those instructions can be found in bs_instrs.tab.
│ │ │ +}
    The full definitions of those instructions can be found in bs_instrs.tab.
│ │ │  The generated code can be found in beam_warm.h.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Code generation for BeamAsm
│ │ │  
    
│ │ │  
    For the BeamAsm runtime system, the implementation of each instruction is defined
│ │ │  by emitter functions written in C++ that emit the assembly code for each instruction.
│ │ │  There is one emitter function for each family of specific instructions.
    Take for example the move instruction. In beam/asm/ops.tab there is a
│ │ │ -single specific instruction for move defined like this:
    move s d
    The implementation is found in beam/asm/instr_common.cpp:
    void BeamModuleAssembler::emit_move(const ArgVal &Src, const ArgVal &Dst) {
│ │ │ -    mov_arg(Dst, Src);
│ │ │ -}
    The mov_arg() helper function will handle all combinations of source and destination
│ │ │ -operands.  For example, the instruction {move,{x,1},{y,1}} will be translated like this:
    mov rdi, qword [rbx+8]
│ │ │ -mov qword [rsp+8], rdi
    while {move,{integer,42},{x,0}} will be translated like this:
    mov qword [rbx], 687
    It is possible to define more than one specific instruction, but there will still be
│ │ │ +single specific instruction for move defined like this:
    move s d
    The implementation is found in beam/asm/instr_common.cpp:
    void BeamModuleAssembler::emit_move(const ArgVal &Src, const ArgVal &Dst) {
│ │ │ +    mov_arg(Dst, Src);
│ │ │ +}
    The mov_arg() helper function will handle all combinations of source and destination
│ │ │ +operands.  For example, the instruction {move,{x,1},{y,1}} will be translated like this:
    mov rdi, qword [rbx+8]
│ │ │ +mov qword [rsp+8], rdi
    while {move,{integer,42},{x,0}} will be translated like this:
    mov qword [rbx], 687
    It is possible to define more than one specific instruction, but there will still be
│ │ │  only one emitter function. For example:
    fload S l
│ │ │  fload q l
    By defining fload like this, the source operand must be a X register, Y register, or
│ │ │  a literal.  If not, the loading will be aborted.  If the instruction instead had been
│ │ │  defined like this:
    fload s l
    attempting to load an invalid instruction such as {fload,{atom,clearly_bad},{fr,0}}
│ │ │  would cause a crash (either at load time or when the instruction was executed).
    Regardless on how many specific instructions there are in the family,
│ │ │ -only a single emit_fload() function is allowed:
    void BeamModuleAssembler::emit_fload(const ArgVal &Src, const ArgVal &Dst) {
│ │ │ +only a single emit_fload() function is allowed:
    void BeamModuleAssembler::emit_fload(const ArgVal &Src, const ArgVal &Dst) {
│ │ │      .
│ │ │      .
│ │ │      .
│ │ │ -}
    Handling a variable number of operands
    Here follows an example of how an instruction with a variable number
│ │ │ +}
    Handling a variable number of operands
    Here follows an example of how an instruction with a variable number
│ │ │  of operands could be handled.  One such instructions is
│ │ │ -select_val/3. Here is an example how it can look like in BEAM code:
    {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
│ │ │ +select_val/3. Here is an example how it can look like in BEAM code:
    {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
│ │ │ -instruction:
    {select_val,{x,0},{f,1},{u,4},{atom,b},{f,4},{atom,a},{f,5}}
    A definition of a specific instruction for that instruction would look
│ │ │ +instruction:
    {select_val,{x,0},{f,1},{u,4},{atom,b},{f,4},{atom,a},{f,5}}
    A definition of a specific instruction for that instruction would look
│ │ │  like this:
    select_val s f I *
    The * as the last operand will make sure that the variable operands
│ │ │  are passed in as a Span of ArgVal (will be std::span in C++20 onwards).
│ │ │ -Here is the emitter function:
    void BeamModuleAssembler::emit_select_val(const ArgVal &Src,
│ │ │ +Here is the emitter function:
    void BeamModuleAssembler::emit_select_val(const ArgVal &Src,
│ │ │                                            const ArgVal &Fail,
│ │ │                                            const ArgVal &Size,
│ │ │ -                                          const Span<ArgVal> &args) {
│ │ │ -    ASSERT(Size.getValue() == args.size());
│ │ │ +                                          const Span<ArgVal> &args) {
│ │ │ +    ASSERT(Size.getValue() == args.size());
│ │ │         .
│ │ │         .
│ │ │         .
│ │ │ -}
    
│ │ │ +    }
    
│ │ │  
│ │ │  
│ │ │  
    
│ │ │    
    
│ │ │  
│ │ │        
    beam_makeops. The transformations
│ │ │  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
│ │ │  this implementation to minimize the instruction dispatch overhead for
│ │ │  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.
│ │ │  r12: Active code index
│ │ │  r13: Current running process
│ │ │  r14: Remaining reductions
│ │ │  r15: Erlang heap pointer
    Note that all of these are callee save registers under the System V and Windows
│ │ │ @@ -183,21 +183,21 @@
│ │ │  shared and only the arguments to the instructions vary. Using as little memory as
│ │ │  possible has many advantages; less memory is used, loading time decreases,
│ │ │  higher cache hit-rate.
    In BeamAsm we need to achieve something similar since the load-time of a module
│ │ │  scales almost linearly with the amount of memory it uses. Early BeamAsm prototypes
│ │ │  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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Running Erlang code
│ │ │ @@ -239,43 +239,43 @@
│ │ │    
│ │ │      
│ │ │    
│ │ │    Running C code
│ │ │  
    
│ │ │  
    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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Tracing and NIF Loading
│ │ │  
    
│ │ │  
    To make tracing and NIF loading work there needs to be a way to intercept
│ │ │  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
│ │ │  which skips the prologue and starts to execute the code directly.
    When we want to enable a certain breakpoint we set the jmp target to be 1,
│ │ │  which means it will land on the call to the shared breakpoint fragment. This
│ │ │  fragment checks the current breakpoint_flag stored in the ErtsCodeInfo of
│ │ │  this function, and then calls erts_call_nif_early and
│ │ │ @@ -289,31 +289,31 @@
│ │ │    Updating code
│ │ │  
│ │ │  
    Because many environments enforce W^X it's not always possible to write
│ │ │  directly to the code pages. Because of this we map code twice: once with an
│ │ │  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;
│ │ │ +    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);
│ │ │ +    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
│ │ │  unsealed by erts_unseal_module.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │ @@ -393,15 +393,15 @@
│ │ │  perf script > out.perf
│ │ │  ## run stackcollapse
│ │ │  stackcollapse-perf.pl out.perf > out.folded
│ │ │  ## Create the svg
│ │ │  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:
    ## Strip [0-9]+_ and/or _[0-9]+ from all scheduler names
│ │ │ +has been merged by using sed:
    ## 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
│ │ │  flamegraph.pl out.folded_sched > out_sched.svg
    Linux Perf FlameGraph: dialyzer PLT build
    You can view a larger version here.
│ │ │  There are many different transformations that you can do to make the graph show
│ │ │  you what you want.
    
│ │ │    
│ │ ├── ./usr/share/doc/erlang-doc/html/erts-15.2.7.8/doc/html/codeloading.html
│ │ │ @@ -163,16 +163,16 @@
│ │ │  only be done by one loader process at a time. A second loader process
│ │ │  trying to enter finishing phase will be suspended until the first
│ │ │  loader is done. This will only block the process, the scheduler is
│ │ │  free to schedule other work while the second loader is waiting. (See
│ │ │  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
│ │ │  implemented in Erlang by calling the above two functions in
│ │ │  sequence. Function finish_loading is limited to only accepts a list
│ │ │  with one module state as we do not yet use the multi module loading
│ │ │  feature.
    
│ │ ├── ./usr/share/doc/erlang-doc/html/erts-15.2.7.8/doc/html/crash_dump.html
│ │ │ @@ -401,21 +401,21 @@
│ │ │  put/2 and get/1 thing) is non-empty.
    The raw memory information can be decoded by the Crashdump Viewer tool. You can
│ │ │  then see the stack dump, the message queue (if any), and the dictionary (if
│ │ │  any).
    The stack dump is a dump of the Erlang process stack. Most of the live data
│ │ │  (that is, variables currently in use) are placed on the stack; thus this can be
│ │ │  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
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Atoms
│ │ │  
    
│ │ ├── ./usr/share/doc/erlang-doc/html/erts-15.2.7.8/doc/html/driver.html
│ │ │ @@ -364,41 +364,41 @@
│ │ │  
    Before a driver can be called from Erlang, it must be loaded and opened. Loading
│ │ │  is done using the erl_ddll module (the erl_ddll driver that loads dynamic
│ │ │  driver is actually a driver itself). If loading is successful, the port can be
│ │ │  opened with open_port/2. The port name must match the name of
│ │ │  the shared library and the name in the driver entry structure.
    When the port has been opened, the driver can be called. In the pg_sync
│ │ │  example, we do not have any data from the port, only the return value from the
│ │ │  port_control/3.
    The following code is the Erlang part of the synchronous postgres driver,
│ │ │ -pg_sync.erl:
    -module(pg_sync).
│ │ │ +pg_sync.erl:
    -module(pg_sync).
│ │ │  
│ │ │ --define(DRV_CONNECT, 1).
│ │ │ --define(DRV_DISCONNECT, 2).
│ │ │ --define(DRV_SELECT, 3).
│ │ │ +-define(DRV_CONNECT, 1).
│ │ │ +-define(DRV_DISCONNECT, 2).
│ │ │ +-define(DRV_SELECT, 3).
│ │ │  
│ │ │ --export([connect/1, disconnect/1, select/2]).
│ │ │ +-export([connect/1, disconnect/1, select/2]).
│ │ │  
│ │ │ -connect(ConnectStr) ->
│ │ │ -    case erl_ddll:load_driver(".", "pg_sync") of
│ │ │ +connect(ConnectStr) ->
│ │ │ +    case erl_ddll:load_driver(".", "pg_sync") of
│ │ │          ok -> ok;
│ │ │ -        {error, already_loaded} -> ok;
│ │ │ -        E -> exit({error, E})
│ │ │ +        {error, already_loaded} -> ok;
│ │ │ +        E -> exit({error, E})
│ │ │      end,
│ │ │ -    Port = open_port({spawn, ?MODULE}, []),
│ │ │ -    case binary_to_term(port_control(Port, ?DRV_CONNECT, ConnectStr)) of
│ │ │ -        ok -> {ok, Port};
│ │ │ +    Port = open_port({spawn, ?MODULE}, []),
│ │ │ +    case binary_to_term(port_control(Port, ?DRV_CONNECT, ConnectStr)) of
│ │ │ +        ok -> {ok, Port};
│ │ │          Error -> Error
│ │ │      end.
│ │ │  
│ │ │ -disconnect(Port) ->
│ │ │ -    R = binary_to_term(port_control(Port, ?DRV_DISCONNECT, "")),
│ │ │ -    port_close(Port),
│ │ │ +disconnect(Port) ->
│ │ │ +    R = binary_to_term(port_control(Port, ?DRV_DISCONNECT, "")),
│ │ │ +    port_close(Port),
│ │ │      R.
│ │ │  
│ │ │ -select(Port, Query) ->
│ │ │ -    binary_to_term(port_control(Port, ?DRV_SELECT, Query)).
    The API is simple:
    • connect/1 loads the driver, opens it, and logs on to the database, returning
│ │ │ +select(Port, Query) ->
│ │ │ +    binary_to_term(port_control(Port, ?DRV_SELECT, Query)).
    The API is simple:
    • connect/1 loads the driver, opens it, and logs on to the database, returning
│ │ │  the Erlang port if successful.
    • select/2 sends a query to the driver and returns the result.
    • disconnect/1 closes the database connection and the driver. (However, it
│ │ │  does not unload it.)
    The connection string is to be a connection string for postgres.
    The driver is loaded with erl_ddll:load_driver/2. If this is successful, or if
│ │ │  it is already loaded, it is opened. This will call the start function in the
│ │ │  driver.
    We use the port_control/3 function for all calls into the
│ │ │  driver. The result from the driver is returned immediately and converted to
│ │ │  terms by calling binary_to_term/1. (We trust that the
│ │ │  terms returned from the driver are well-formed, otherwise the binary_to_term/1
│ │ │ @@ -536,51 +536,51 @@
│ │ │  successful, or error if it is not. If the connection is not yet established, we
│ │ │  simply return; ready_io is called again.
    If we have a result from a connect, indicated by having data in the x buffer,
│ │ │  we no longer need to select on output (ready_output), so we remove this by
│ │ │  calling driver_select.
    If we are not connecting, we wait for results from a PQsendQuery, so we get
│ │ │  the result and return it. The encoding is done with the same functions as in the
│ │ │  earlier example.
    Error handling is to be added here, for example, checking that the socket is
│ │ │  still open, but this is only a simple example.
    The Erlang part of the asynchronous driver consists of the sample file
│ │ │ -pg_async.erl.
    -module(pg_async).
│ │ │ +pg_async.erl.
    -module(pg_async).
│ │ │  
│ │ │ --define(DRV_CONNECT, $C).
│ │ │ --define(DRV_DISCONNECT, $D).
│ │ │ --define(DRV_SELECT, $S).
│ │ │ +-define(DRV_CONNECT, $C).
│ │ │ +-define(DRV_DISCONNECT, $D).
│ │ │ +-define(DRV_SELECT, $S).
│ │ │  
│ │ │ --export([connect/1, disconnect/1, select/2]).
│ │ │ +-export([connect/1, disconnect/1, select/2]).
│ │ │  
│ │ │ -connect(ConnectStr) ->
│ │ │ -    case erl_ddll:load_driver(".", "pg_async") of
│ │ │ +connect(ConnectStr) ->
│ │ │ +    case erl_ddll:load_driver(".", "pg_async") of
│ │ │          ok -> ok;
│ │ │ -        {error, already_loaded} -> ok;
│ │ │ -        _ -> exit({error, could_not_load_driver})
│ │ │ +        {error, already_loaded} -> ok;
│ │ │ +        _ -> exit({error, could_not_load_driver})
│ │ │      end,
│ │ │ -    Port = open_port({spawn, ?MODULE}, [binary]),
│ │ │ -    port_control(Port, ?DRV_CONNECT, ConnectStr),
│ │ │ -    case return_port_data(Port) of
│ │ │ +    Port = open_port({spawn, ?MODULE}, [binary]),
│ │ │ +    port_control(Port, ?DRV_CONNECT, ConnectStr),
│ │ │ +    case return_port_data(Port) of
│ │ │          ok ->
│ │ │ -            {ok, Port};
│ │ │ +            {ok, Port};
│ │ │          Error ->
│ │ │              Error
│ │ │      end.
│ │ │  
│ │ │ -disconnect(Port) ->
│ │ │ -    port_control(Port, ?DRV_DISCONNECT, ""),
│ │ │ -    R = return_port_data(Port),
│ │ │ -    port_close(Port),
│ │ │ +disconnect(Port) ->
│ │ │ +    port_control(Port, ?DRV_DISCONNECT, ""),
│ │ │ +    R = return_port_data(Port),
│ │ │ +    port_close(Port),
│ │ │      R.
│ │ │  
│ │ │ -select(Port, Query) ->
│ │ │ -    port_control(Port, ?DRV_SELECT, Query),
│ │ │ -    return_port_data(Port).
│ │ │ +select(Port, Query) ->
│ │ │ +    port_control(Port, ?DRV_SELECT, Query),
│ │ │ +    return_port_data(Port).
│ │ │  
│ │ │ -return_port_data(Port) ->
│ │ │ +return_port_data(Port) ->
│ │ │      receive
│ │ │ -        {Port, {data, Data}} ->
│ │ │ -            binary_to_term(Data)
│ │ │ +        {Port, {data, Data}} ->
│ │ │ +            binary_to_term(Data)
│ │ │      end.
    The Erlang code is slightly different, as we do not return the result
│ │ │  synchronously from port_control/3, instead we get it from driver_output as
│ │ │  data in the message queue. The function return_port_data above receives data
│ │ │  from the port. As the data is in binary format, we use
│ │ │  binary_to_term/1 to convert it to an Erlang term. Notice
│ │ │  that the driver is opened in binary mode (open_port/2 is
│ │ │  called with option [binary]). This means that data sent from the driver to the
│ │ │ @@ -677,59 +677,59 @@
│ │ │      *rp++ = ERL_DRV_LIST;
│ │ │      *rp++ = n+1;
│ │ │      driver_output_term(port, result, result_n);
│ │ │      delete[] result;
│ │ │      delete d;
│ │ │  }
    This driver is called like the others from Erlang. However, as we use
│ │ │  driver_output_term, there is no need to call binary_to_term/1. The Erlang code
│ │ │ -is in the sample file next_perm.erl.
    The input is changed into a list of integers and sent to the driver.
    -module(next_perm).
│ │ │ +is in the sample file next_perm.erl.
    The input is changed into a list of integers and sent to the driver.
    -module(next_perm).
│ │ │  
│ │ │ --export([next_perm/1, prev_perm/1, load/0, all_perm/1]).
│ │ │ +-export([next_perm/1, prev_perm/1, load/0, all_perm/1]).
│ │ │  
│ │ │ -load() ->
│ │ │ -    case whereis(next_perm) of
│ │ │ +load() ->
│ │ │ +    case whereis(next_perm) of
│ │ │          undefined ->
│ │ │ -            case erl_ddll:load_driver(".", "next_perm") of
│ │ │ +            case erl_ddll:load_driver(".", "next_perm") of
│ │ │                  ok -> ok;
│ │ │ -                {error, already_loaded} -> ok;
│ │ │ -                E -> exit(E)
│ │ │ +                {error, already_loaded} -> ok;
│ │ │ +                E -> exit(E)
│ │ │              end,
│ │ │ -            Port = open_port({spawn, "next_perm"}, []),
│ │ │ -            register(next_perm, Port);
│ │ │ +            Port = open_port({spawn, "next_perm"}, []),
│ │ │ +            register(next_perm, Port);
│ │ │          _ ->
│ │ │              ok
│ │ │      end.
│ │ │  
│ │ │ -list_to_integer_binaries(L) ->
│ │ │ -    [<<I:32/integer-native>> || I <- L].
│ │ │ +list_to_integer_binaries(L) ->
│ │ │ +    [<<I:32/integer-native>> || I <- L].
│ │ │  
│ │ │ -next_perm(L) ->
│ │ │ -    next_perm(L, 1).
│ │ │ +next_perm(L) ->
│ │ │ +    next_perm(L, 1).
│ │ │  
│ │ │ -prev_perm(L) ->
│ │ │ -    next_perm(L, 2).
│ │ │ +prev_perm(L) ->
│ │ │ +    next_perm(L, 2).
│ │ │  
│ │ │ -next_perm(L, Nxt) ->
│ │ │ -    load(),
│ │ │ -    B = list_to_integer_binaries(L),
│ │ │ -    port_control(next_perm, Nxt, B),
│ │ │ +next_perm(L, Nxt) ->
│ │ │ +    load(),
│ │ │ +    B = list_to_integer_binaries(L),
│ │ │ +    port_control(next_perm, Nxt, B),
│ │ │      receive
│ │ │          Result ->
│ │ │              Result
│ │ │      end.
│ │ │  
│ │ │ -all_perm(L) ->
│ │ │ -    New = prev_perm(L),
│ │ │ -    all_perm(New, L, [New]).
│ │ │ +all_perm(L) ->
│ │ │ +    New = prev_perm(L),
│ │ │ +    all_perm(New, L, [New]).
│ │ │  
│ │ │ -all_perm(L, L, Acc) ->
│ │ │ +all_perm(L, L, Acc) ->
│ │ │      Acc;
│ │ │ -all_perm(L, Orig, Acc) ->
│ │ │ -    New = prev_perm(L),
│ │ │ -    all_perm(New, Orig, [New | Acc]).
    
│ │ │ +    all_perm(L, Orig, Acc) ->
│ │ │ +    New = prev_perm(L),
│ │ │ +    all_perm(New, Orig, [New | Acc]).
    
│ │ │  
    
│ │ │  
│ │ │  
    
│ │ │    
    
│ │ │  
│ │ │        init.
    The init process itself interprets some of these flags, the init flags. It
│ │ │  also stores any remaining flags, the user flags. The latter can be retrieved
│ │ │  by calling init:get_argument/1.
    A small number of "-" flags exist, which now actually are emulator flags, see
│ │ │  the description below.
  • Plain arguments are not interpreted in any way. They are also stored by the
│ │ │  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.
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Flags
│ │ │  
    
│ │ │  
    In the following list, init flags are marked "(init flag)". Unless otherwise
│ │ │ @@ -700,15 +700,15 @@
│ │ │  processes) into a smaller set of schedulers when schedulers frequently run
│ │ │  out of work. When disabled, the frequency with which schedulers run out of
│ │ │  work is not taken into account by the load balancing logic.
    +scl false is similar to +sub true, but +sub true
│ │ │  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. This option must be before
│ │ │ -+sbt on the command-line.
    <Id> = integer(); when 0 =< <Id> =< 65535
│ │ │ ++sbt on the command-line.
    <Id> = integer(); when 0 =< <Id> =< 65535
│ │ │  <IdRange> = <Id>-<Id>
│ │ │  <IdOrIdRange> = <Id> | <IdRange>
│ │ │  <IdList> = <IdOrIdRange>,<IdOrIdRange> | <IdOrIdRange>
│ │ │  <LogicalIds> = L<IdList>
│ │ │  <ThreadIds> = T<IdList> | t<IdList>
│ │ │  <CoreIds> = C<IdList> | c<IdList>
│ │ │  <ProcessorIds> = P<IdList> | p<IdList>
│ │ │ @@ -733,30 +733,30 @@
│ │ │  node.
  • <LogicalIds><ThreadIds><CoreIds><NodeIds><ProcessorIds>, that is, thread
│ │ │  is part of a core that is part of a NUMA node, which is part of a
│ │ │  processor.
    • A CPU topology can consist of both processor external, and processor
│ │ │  internal NUMA nodes as long as each logical processor belongs to only one
│ │ │  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
│ │ │  on the same machine, you want to reduce the number of schedulers used and
│ │ │  manipulate the CPU topology so that they bind to different logical CPUs. An
│ │ │  example, with two Erlang runtime systems on a quad core machine:
    % erl +sct L0-3c0-3 +sbt db +S3:2 -detached -noinput -noshell -sname one
│ │ │  % erl +sct L3-0c0-3 +sbt db +S3:2 -detached -noinput -noshell -sname two
    In this example, each runtime system have two schedulers each online, and
│ │ │ @@ -923,18 +923,18 @@
│ │ │  
│ │ │  
    The standard Erlang/OTP system can be reconfigured to change the default
│ │ │  behavior on startup.
    • The .erlang startup file - When Erlang/OTP is started, the system
│ │ │  searches for a file named .erlang in the
│ │ │  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
│ │ │  add the following argument as the first line in the .erlang file:
      code:load_abs("..../user_default").
    • erl - If the contents of .erlang are changed and a private version of
│ │ │  user_default is defined, the Erlang/OTP environment can be customized. More
│ │ │  powerful changes can be made by supplying command-line arguments in the
│ │ │  startup script erl. For more information, see init.
    
│ │ ├── ./usr/share/doc/erlang-doc/html/erts-15.2.7.8/doc/html/erl_dist_protocol.html
│ │ │ @@ -252,32 +252,32 @@
│ │ │  ---
│ │ │  sequenceDiagram
│ │ │      participant client as Client (or Node)
│ │ │      participant EPMD
│ │ │      
│ │ │      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]).
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Dump All Data from EPMD
│ │ │  
    
│ │ │  
    This request is not really used, it is to be regarded as a debug feature.
    ---
│ │ │  title: Dump All Data from EPMD
│ │ │  ---
│ │ │  sequenceDiagram
│ │ │      participant client as Client (or Node)
│ │ │      participant EPMD
│ │ │      
│ │ │      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]).
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    Kill EPMD
│ │ │  
    
│ │ │  
    This request kills the running EPMD. It is almost never used.
    ---
│ │ │  title: Kill EPMD
│ │ │ @@ -407,54 +407,54 @@
│ │ │  received from A is correct and generates a digest from the challenge
│ │ │  received from A. The digest is then sent to A. The message is as follows:
    116
    'a'Digest
    Table: The challenge_ack message
    Digest is the digest calculated by B for A's challenge.
  • 7) check - A checks the digest from B and the connection is up.
    • 
│ │ │    
│ │ │      
│ │ │    
│ │ │    Semigraphic View
│ │ │  
    
│ │ │ -
    A (initiator)                                      B (acceptor)
│ │ │ +
    A (initiator)                                      B (acceptor)
│ │ │  
│ │ │  TCP connect ------------------------------------>
│ │ │                                                     TCP accept
│ │ │  
│ │ │  send_name -------------------------------------->
│ │ │                                                     recv_name
│ │ │  
│ │ │    <---------------------------------------------- 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:
│ │ │   CLOSE
    
│ │ │    
│ │ │      
│ │ │    
│ │ ├── ./usr/share/doc/erlang-doc/html/erts-15.2.7.8/doc/html/erl_ext_dist.html
│ │ │ @@ -436,15 +436,15 @@
│ │ │    
│ │ │    SMALL_BIG_EXT
│ │ │  
    
│ │ │  
    111n
    110nSignd(0) ... d(n-1)
    Bignums are stored in unary form with a Sign byte, that is, 0 if the bignum is
│ │ │  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))
    
│ │ │    
│ │ │      
│ │ │    
│ │ │    LARGE_BIG_EXT
│ │ │  
    
│ │ │  
    141n
    111nSignd(0) ... d(n-1)
    Same as SMALL_BIG_EXT except that the length
│ │ │  field is an unsigned 4 byte integer.
    
│ │ ├── ./usr/share/doc/erlang-doc/html/erts-15.2.7.8/doc/html/erl_nif.html
│ │ │ @@ -161,27 +161,27 @@
│ │ │  }
│ │ │  
│ │ │  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).
│ │ │  {ok,niftest}
│ │ │  2> niftest:hello().
│ │ │  "Hello world!"
    In the example above the on_load
│ │ │  directive is used get function init called automatically when the module is
│ │ ├── ./usr/share/doc/erlang-doc/html/erts-15.2.7.8/doc/html/erl_prim_loader.html
│ │ │ @@ -398,15 +398,15 @@
│ │ │                          when Filename :: string(), FileInfo :: file:file_info().
    
│ │ │  
│ │ │        
│ │ │  
│ │ │  
    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.
    
│ │ │    
│ │ │  
│ │ │  
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │        
│ │ │ @@ -6878,18 +6878,18 @@
│ │ │                               FirstAdler :: non_neg_integer(),
│ │ │                               SecondAdler :: non_neg_integer(),
│ │ │                               SecondSize :: non_neg_integer().
    
│ │ │  
│ │ │        
│ │ │  
│ │ │  
    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)).
    
│ │ │    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │        
│ │ │ @@ -6934,16 +6934,16 @@
│ │ │        
    
│ │ │  
│ │ │            
    -spec crc32(OldCrc, Data) -> non_neg_integer() when OldCrc :: non_neg_integer(), Data :: iodata().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │  
    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]).
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │        
│ │ │ @@ -6966,18 +6966,18 @@
│ │ │                             FirstCrc :: non_neg_integer(),
│ │ │                             SecondCrc :: non_neg_integer(),
│ │ │                             SecondSize :: non_neg_integer().
    
│ │ │  
│ │ │        
│ │ │  
│ │ │  
    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)).
    
│ │ │    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │        
│ │ │ @@ -8129,19 +8129,19 @@
│ │ │  the Info map in the returned result will contain the key node_type
│ │ │  associated with the value NodeTypeInfo. Currently the following node types
│ │ │  exist:
    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>
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │        
│ │ │ @@ -8237,17 +8237,17 @@
│ │ │  
│ │ │            
    -spec abs(Float) -> float() when Float :: float();
│ │ │           (Int) -> non_neg_integer() when Int :: integer().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │  
    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
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │ @@ -8269,16 +8269,16 @@
│ │ │            
    -spec append_element(Tuple1, Term) -> Tuple2 when Tuple1 :: tuple(), Tuple2 :: tuple(), Term :: term().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │  
    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}
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │        
│ │ │ @@ -8333,16 +8333,16 @@
│ │ │  
│ │ │        
    
│ │ │  
│ │ │  
    Returns a binary corresponding to the text representation of Atom.
    If Encoding is latin1, one byte exists for each character in the text
│ │ │  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).
│ │ │ -<<"Erlang">>
    
│ │ │ +representation for Atom contains a Unicode character > 255.
    Example:
    > atom_to_binary('Erlang', latin1).
│ │ │ +<<"Erlang">>
    
│ │ │    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │        
│ │ │ @@ -8363,17 +8363,17 @@
│ │ │        
    
│ │ │  
│ │ │            
    -spec atom_to_list(Atom) -> string() when Atom :: atom().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │  
    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.
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │        
│ │ │ @@ -8400,19 +8400,19 @@
│ │ │            
    -spec binary_part(Subject, PosLen) -> binary()
│ │ │                       when
│ │ │                           Subject :: binary(),
│ │ │                           PosLen :: {Start :: non_neg_integer(), Length :: integer()}.
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │ -
    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}).
│ │ │ -<<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}).
│ │ │ -<<1,2>>
    For details about the PosLen semantics, see binary.
    
│ │ │ +
    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}).
│ │ │ +<<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}).
│ │ │ +<<1,2>>
    For details about the PosLen semantics, see binary.
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │        
│ │ │ @@ -8505,16 +8505,16 @@
│ │ │  capable of decoding any Unicode character. Earlier versions would fail if the
│ │ │  binary contained Unicode characters > 255.
    Note
    The number of characters that are permitted in an atom name is limited. The
│ │ │  default limits can be found in the
│ │ │  Efficiency Guide (section System Limits).
    Note
    There is configurable limit on how many atoms that can exist and atoms are not
│ │ │  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).
│ │ │  'Ѐ'
    
│ │ │    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │ @@ -8613,15 +8613,15 @@
│ │ │  
│ │ │        
    
│ │ │  
│ │ │            
    -spec binary_to_float(Binary) -> float() when Binary :: binary().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │ -
    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.
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │ @@ -8646,15 +8646,15 @@
│ │ │  
│ │ │        
    
│ │ │  
│ │ │            
    -spec binary_to_integer(Binary) -> integer() when Binary :: binary().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │ -
    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.
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │ @@ -8678,15 +8678,15 @@
│ │ │  
│ │ │        
    
│ │ │  
│ │ │            
    -spec binary_to_integer(Binary, Base) -> integer() when Binary :: binary(), Base :: 2..36.
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │ -
    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.
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │ @@ -8771,17 +8771,17 @@
│ │ │  
│ │ │            
    -spec binary_to_term(Binary) -> term() when Binary :: ext_binary().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │  
    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).
│ │ │ -<<131,100,0,5,104,101,108,108,111>>
│ │ │ -> hello = binary_to_term(Bin).
│ │ │ +Erlang external term format.
    > Bin = term_to_binary(hello).
│ │ │ +<<131,100,0,5,104,101,108,108,111>>
│ │ │ +> 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
│ │ │  cases, consider using binary_to_term/2 with the safe
│ │ │  option.
    See also term_to_binary/1 and binary_to_term/2.
    
│ │ │    
    
│ │ │  
│ │ │ @@ -8820,30 +8820,30 @@
│ │ │  
    Equivalent to binary_to_term(Binary), but can be configured to
│ │ │  fit special purposes.
    The allowed options are:
    • safe - Use this option when receiving binaries from an untrusted source.
      When enabled, it prevents decoding data that can be used to attack the Erlang
│ │ │  runtime. In the event of receiving unsafe data, decoding fails with a badarg
│ │ │  error.
      This prevents creation of new atoms directly, creation of new atoms indirectly
│ │ │  (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
│ │ │  transits through untrusted sources, you should also consider
│ │ │  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.
    
│ │ │ +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.
    
│ │ │    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │        
│ │ │ @@ -8865,17 +8865,17 @@
│ │ │  
│ │ │        
    
│ │ │  
│ │ │            
    -spec bit_size(Bitstring) -> non_neg_integer() when Bitstring :: bitstring().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │ -
    Returns an integer that is the size in bits of Bitstring.
    For example:
    > bit_size(<<433:16,3:3>>).
│ │ │ +
    Returns an integer that is the size in bits of Bitstring.
    For example:
    > bit_size(<<433:16,3:3>>).
│ │ │  19
│ │ │ -> bit_size(<<1,2,3>>).
│ │ │ +> bit_size(<<1,2,3>>).
│ │ │  24
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │ @@ -8897,17 +8897,17 @@
│ │ │        
    
│ │ │  
│ │ │            
    -spec bitstring_to_list(Bitstring) -> [byte() | bitstring()] when Bitstring :: bitstring().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │  
    Returns a list of integers corresponding to the bytes of Bitstring.
    If the number of bits in the binary is not divisible by 8, the last element of
│ │ │ -the list is a bitstring containing the remaining 1-7 bits.
    For example:
    > bitstring_to_list(<<433:16>>).
│ │ │ -[1,177]
    > bitstring_to_list(<<433:16,3:3>>).
│ │ │ -[1,177,<<3:3>>]
    
│ │ │ +the list is a bitstring containing the remaining 1-7 bits.
    For example:
    > bitstring_to_list(<<433:16>>).
│ │ │ +[1,177]
    > bitstring_to_list(<<433:16,3:3>>).
│ │ │ +[1,177,<<3:3>>]
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │        
│ │ │ @@ -8931,17 +8931,17 @@
│ │ │  
│ │ │            
    -spec byte_size(Bitstring) -> non_neg_integer() when Bitstring :: bitstring().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │  
    Returns an integer that is the number of bytes needed to contain Bitstring.
│ │ │  That is, if the number of bits in Bitstring is not divisible by 8, the
│ │ │ -resulting number of bytes is rounded up.
    For example:
    > byte_size(<<433:16,3:3>>).
│ │ │ +resulting number of bytes is rounded up.
    For example:
    > byte_size(<<433:16,3:3>>).
│ │ │  3
│ │ │ -> byte_size(<<1,2,3>>).
│ │ │ +> byte_size(<<1,2,3>>).
│ │ │  3
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │ @@ -8966,15 +8966,15 @@
│ │ │  
│ │ │        
    
│ │ │  
│ │ │            
    -spec ceil(Number) -> integer() when Number :: number().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │ -
    Returns the smallest integer not less than Number.
    For example:
    > ceil(5.5).
│ │ │ +
    Returns the smallest integer not less than Number.
    For example:
    > ceil(5.5).
│ │ │  6
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │ @@ -9074,18 +9074,18 @@
│ │ │  RFC2732 .
    Options:
    • {packet_size, integer() >= 0} - Sets the maximum allowed size of the
│ │ │  packet body. If the packet header indicates that the length of the packet is
│ │ │  longer than the maximum allowed length, the packet is considered invalid.
│ │ │  Defaults to 0, which means no size limit.
    • {line_length, integer() >= 0} - For packet type line, lines longer
│ │ │  than the indicated length are truncated.
      Option line_length also applies to http* packet types as an alias for
│ │ │  option packet_size if packet_size itself is not set. This use is only
│ │ │  intended for backward compatibility.
    • {line_delimiter, 0 =< byte() =< 255} - For packet type line, sets the
│ │ │ -delimiting byte. Default is the latin-1 character $\n.
    Examples:
    > erlang:decode_packet(1,<<3,"abcd">>,[]).
│ │ │ -{ok,<<"abc">>,<<"d">>}
│ │ │ -> erlang:decode_packet(1,<<5,"abcd">>,[]).
│ │ │ -{more,6}
    
│ │ │ +delimiting byte. Default is the latin-1 character $\n.
    Examples:
    > erlang:decode_packet(1,<<3,"abcd">>,[]).
│ │ │ +{ok,<<"abc">>,<<"d">>}
│ │ │ +> erlang:decode_packet(1,<<5,"abcd">>,[]).
│ │ │ +{more,6}
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │        
│ │ │ @@ -9106,16 +9106,16 @@
│ │ │        
    
│ │ │  
│ │ │            
    -spec delete_element(Index, Tuple1) -> Tuple2
│ │ │                          when Index :: pos_integer(), Tuple1 :: tuple(), Tuple2 :: tuple().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │ -
    Returns a new tuple with element at Index removed from tuple Tuple1.
    For example:
    > erlang:delete_element(2, {one, two, three}).
│ │ │ -{one,three}
    
│ │ │ +
    Returns a new tuple with element at Index removed from tuple Tuple1.
    For example:
    > erlang:delete_element(2, {one, two, three}).
│ │ │ +{one,three}
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │        
│ │ │ @@ -9165,15 +9165,15 @@
│ │ │  
│ │ │        
    
│ │ │  
│ │ │            
    -spec element(N, Tuple) -> term() when N :: pos_integer(), Tuple :: tuple().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │ -
    Returns the Nth element (numbering from 1) of Tuple.
    For example:
    > element(2, {a, b, c}).
│ │ │ +
    Returns the Nth element (numbering from 1) of Tuple.
    For example:
    > element(2, {a, b, c}).
│ │ │  b
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │ @@ -9195,18 +9195,18 @@
│ │ │        
    
│ │ │  
│ │ │            
    -spec external_size(Term) -> non_neg_integer() when Term :: term().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │  
    Calculates, without doing the encoding, the maximum byte size for a term encoded
│ │ │ -in the Erlang external term format.
    The following condition applies always:
    > Size1 = byte_size(term_to_binary(Term)),
│ │ │ -> Size2 = erlang:external_size(Term),
│ │ │ +in the Erlang external term format.
    The following condition applies always:
    > Size1 = byte_size(term_to_binary(Term)),
│ │ │ +> Size2 = erlang:external_size(Term),
│ │ │  > true = Size1 =< Size2.
│ │ │ -true
    This is equivalent to a call to:
    erlang:external_size(Term, [])
    
│ │ │ +    true
    This is equivalent to a call to:
    erlang:external_size(Term, [])
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │        
│ │ │ @@ -9235,16 +9235,16 @@
│ │ │                                  deterministic |
│ │ │                                  {minor_version, Version :: 0..2} |
│ │ │                                  local].
    
│ │ │  
│ │ │        
│ │ │  
│ │ │  
    Calculates, without doing the encoding, the maximum byte size for a term encoded
│ │ │ -in the Erlang external term format.
    The following condition applies always:
    > Size1 = byte_size(term_to_binary(Term, Options)),
│ │ │ -> Size2 = erlang:external_size(Term, Options),
│ │ │ +in the Erlang external term format.
    The following condition applies always:
    > Size1 = byte_size(term_to_binary(Term, Options)),
│ │ │ +> Size2 = erlang:external_size(Term, Options),
│ │ │  > true = Size1 =< Size2.
│ │ │  true
    Option {minor_version, Version} specifies how floats are encoded. For a
│ │ │  detailed description, see term_to_binary/2.
    
│ │ │    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │ @@ -9269,15 +9269,15 @@
│ │ │  
│ │ │        
    
│ │ │  
│ │ │            
    -spec float(Number) -> float() when Number :: number().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │ -
    Returns a float by converting Number to a float.
    For example:
    > float(55).
│ │ │ +
    Returns a float by converting Number to a float.
    For example:
    > float(55).
│ │ │  55.0
    Note
    If used on the top level in a guard, it tests whether the argument is a
│ │ │  floating point number; for clarity, use is_float/1 instead.
    When float/1 is used in an expression in a guard, such as
│ │ │  'float(A) == 4.0', it converts a number as described earlier.
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │ @@ -9340,26 +9340,26 @@
│ │ │                                   {decimals, Decimals :: 0..253} |
│ │ │                                   {scientific, Decimals :: 0..249} |
│ │ │                                   compact | short.
    
│ │ │  
│ │ │        
│ │ │  
│ │ │  
    Returns a binary corresponding to the text representation of Float using fixed
│ │ │ -decimal point formatting.
    Options behaves in the same way as float_to_list/2.
    For example:
    > float_to_binary(7.12, [{decimals, 4}]).
│ │ │ -<<"7.1200">>
│ │ │ -> float_to_binary(7.12, [{decimals, 4}, compact]).
│ │ │ -<<"7.12">>
│ │ │ -> float_to_binary(7.12, [{scientific, 3}]).
│ │ │ -<<"7.120e+00">>
│ │ │ -> float_to_binary(7.12, [short]).
│ │ │ -<<"7.12">>
│ │ │ -> float_to_binary(0.1+0.2, [short]).
│ │ │ -<<"0.30000000000000004">>
│ │ │ -> float_to_binary(0.1+0.2)
│ │ │ -<<"3.00000000000000044409e-01">>
    
│ │ │ +decimal point formatting.
    Options behaves in the same way as float_to_list/2.
    For example:
    > float_to_binary(7.12, [{decimals, 4}]).
│ │ │ +<<"7.1200">>
│ │ │ +> float_to_binary(7.12, [{decimals, 4}, compact]).
│ │ │ +<<"7.12">>
│ │ │ +> float_to_binary(7.12, [{scientific, 3}]).
│ │ │ +<<"7.120e+00">>
│ │ │ +> float_to_binary(7.12, [short]).
│ │ │ +<<"7.12">>
│ │ │ +> float_to_binary(0.1+0.2, [short]).
│ │ │ +<<"0.30000000000000004">>
│ │ │ +> float_to_binary(0.1+0.2)
│ │ │ +<<"3.00000000000000044409e-01">>
    
│ │ │    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │        
│ │ │ @@ -9427,25 +9427,25 @@
│ │ │  are truncated. This option is only meaningful together with option decimals.
  • If option scientific is specified, the float is formatted using scientific
│ │ │  notation with Decimals digits of precision.
  • If option short is specified, the float is formatted with the smallest
│ │ │  number of digits that still guarantees that
│ │ │  F =:= list_to_float(float_to_list(F, [short])). When the float is inside the
│ │ │  range (-2⁵³, 2⁵³), the notation that yields the smallest number of characters
│ │ │  is used (scientific notation or normal decimal notation). Floats outside the
│ │ │  range (-2⁵³, 2⁵³) are always formatted using scientific notation to avoid
│ │ │ -confusing results when doing arithmetic operations.
  • If Options is [], the function behaves as float_to_list/1.
    • Examples:
    > float_to_list(7.12, [{decimals, 4}]).
│ │ │ +confusing results when doing arithmetic operations.
  • If Options is [], the function behaves as float_to_list/1.
    • Examples:
    > float_to_list(7.12, [{decimals, 4}]).
│ │ │  "7.1200"
│ │ │ -> float_to_list(7.12, [{decimals, 4}, compact]).
│ │ │ +> float_to_list(7.12, [{decimals, 4}, compact]).
│ │ │  "7.12"
│ │ │ -> float_to_list(7.12, [{scientific, 3}]).
│ │ │ +> float_to_list(7.12, [{scientific, 3}]).
│ │ │  "7.120e+00"
│ │ │ -> float_to_list(7.12, [short]).
│ │ │ +> float_to_list(7.12, [short]).
│ │ │  "7.12"
│ │ │ -> float_to_list(0.1+0.2, [short]).
│ │ │ +> float_to_list(0.1+0.2, [short]).
│ │ │  "0.30000000000000004"
│ │ │ -> float_to_list(0.1+0.2)
│ │ │ +> float_to_list(0.1+0.2)
│ │ │  "3.00000000000000044409e-01"
    In the last example, float_to_list(0.1+0.2) evaluates to
│ │ │  "3.00000000000000044409e-01". The reason for this is explained in
│ │ │  Representation of Floating Point Numbers.
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │ @@ -9472,15 +9472,15 @@
│ │ │  
│ │ │        
    
│ │ │  
│ │ │            
    -spec floor(Number) -> integer() when Number :: number().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │ -
    Returns the largest integer not greater than Number.
    For example:
    > floor(-10.5).
│ │ │ +
    Returns the largest integer not greater than Number.
    For example:
    > floor(-10.5).
│ │ │  -11
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │ @@ -9600,25 +9600,25 @@
│ │ │  named module, index and uniq in the result of
│ │ │  erlang:fun_info(Fun).
  • uncompiled code - All funs created from fun expressions in uncompiled code
│ │ │  with the same arity are mapped to the same list by
│ │ │  fun_to_list/1.
    • Note
    Generally, one can not use fun_to_list/1 to check if two
│ │ │  funs are equal as fun_to_list/1 does not take the fun's
│ │ │  environment into account. See erlang:fun_info/1 for how to
│ │ │  get the environment of a fun.
    Change
    The output of fun_to_list/1 can differ between Erlang
│ │ │ -implementations and may change in future versions.
    Examples:
    -module(test).
│ │ │ --export([add/1, add2/0, fun_tuple/0]).
│ │ │ -add(A) -> fun(B) -> A + B end.
│ │ │ -add2() -> fun add/1.
│ │ │ -fun_tuple() -> {fun() -> 1 end, fun() -> 1 end}.
    > {fun test:add/1, test:add2()}.
│ │ │ -{fun test:add/1,#Fun<test.1.107738983>}
    Explanation: fun test:add/1 is upgradable but test:add2() is not upgradable.
    > {test:add(1), test:add(42)}.
│ │ │ -{#Fun<test.0.107738983>,#Fun<test.0.107738983>}
    Explanation: test:add(1) and test:add(42) has the same string representation
│ │ │ -as the environment is not taken into account.
    >test:fun_tuple().
│ │ │ -{#Fun<test.2.107738983>,#Fun<test.3.107738983>}
    Explanation: The string representations differ because the funs come from
│ │ │ -different fun expressions.
    > {fun() -> 1 end, fun() -> 1 end}. >
│ │ │ -{#Fun<erl_eval.45.97283095>,#Fun<erl_eval.45.97283095>}
    Explanation: All funs created from fun expressions of this form in uncompiled
│ │ │ +implementations and may change in future versions.
    Examples:
    -module(test).
│ │ │ +-export([add/1, add2/0, fun_tuple/0]).
│ │ │ +add(A) -> fun(B) -> A + B end.
│ │ │ +add2() -> fun add/1.
│ │ │ +fun_tuple() -> {fun() -> 1 end, fun() -> 1 end}.
    > {fun test:add/1, test:add2()}.
│ │ │ +{fun test:add/1,#Fun<test.1.107738983>}
    Explanation: fun test:add/1 is upgradable but test:add2() is not upgradable.
    > {test:add(1), test:add(42)}.
│ │ │ +{#Fun<test.0.107738983>,#Fun<test.0.107738983>}
    Explanation: test:add(1) and test:add(42) has the same string representation
│ │ │ +as the environment is not taken into account.
    >test:fun_tuple().
│ │ │ +{#Fun<test.2.107738983>,#Fun<test.3.107738983>}
    Explanation: The string representations differ because the funs come from
│ │ │ +different fun expressions.
    > {fun() -> 1 end, fun() -> 1 end}. >
│ │ │ +{#Fun<erl_eval.45.97283095>,#Fun<erl_eval.45.97283095>}
    Explanation: All funs created from fun expressions of this form in uncompiled
│ │ │  code with the same arity are mapped to the same list by
│ │ │  fun_to_list/1.
    
│ │ │    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │ @@ -9642,16 +9642,16 @@
│ │ │  
│ │ │        
    
│ │ │  
│ │ │            
    -spec hd(List) -> Head when List :: nonempty_maybe_improper_list(), Head :: term().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │ -
    Returns the head of List, that is, the first element.
    It works with improper lists.
    Examples:
    > hd([1,2,3,4,5]).
│ │ │ -1
    > hd([first, second, third, so_on | improper_end]).
│ │ │ +
    Returns the head of List, that is, the first element.
    It works with improper lists.
    Examples:
    > hd([1,2,3,4,5]).
│ │ │ +1
    > hd([first, second, third, so_on | improper_end]).
│ │ │  first
    Failure: badarg if List is an empty list [].
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │ @@ -9676,16 +9676,16 @@
│ │ │                          when
│ │ │                              Index :: pos_integer(), Tuple1 :: tuple(), Tuple2 :: tuple(), Term :: term().
    
│ │ │  
│ │ │        
│ │ │  
│ │ │  
    Returns a new tuple with element Term inserted at position Index in tuple
│ │ │  Tuple1. All elements from position Index and upwards are pushed one step
│ │ │ -higher in the new tuple Tuple2.
    For example:
    > erlang:insert_element(2, {one, two, three}, new).
│ │ │ -{one,new,two,three}
    
│ │ │ +higher in the new tuple Tuple2.
    For example:
    > erlang:insert_element(2, {one, two, three}, new).
│ │ │ +{one,new,two,three}
    
│ │ │    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │        
│ │ │ @@ -9707,16 +9707,16 @@
│ │ │  
│ │ │        
    
│ │ │  
│ │ │            
    -spec integer_to_binary(Integer) -> binary() when Integer :: integer().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │ -
    Returns a binary corresponding to the text representation of Integer.
    For example:
    > integer_to_binary(77).
│ │ │ -<<"77">>
    
│ │ │ +
    Returns a binary corresponding to the text representation of Integer.
    For example:
    > integer_to_binary(77).
│ │ │ +<<"77">>
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │        
│ │ │ @@ -9739,16 +9739,16 @@
│ │ │        
    
│ │ │  
│ │ │            
    -spec integer_to_binary(Integer, Base) -> binary() when Integer :: integer(), Base :: 2..36.
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │  
    Returns a binary corresponding to the text representation of Integer in base
│ │ │ -Base.
    For example:
    > integer_to_binary(1023, 16).
│ │ │ -<<"3FF">>
    
│ │ │ +Base.
    For example:
    > integer_to_binary(1023, 16).
│ │ │ +<<"3FF">>
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │        
│ │ │ @@ -9768,15 +9768,15 @@
│ │ │  
│ │ │        
    
│ │ │  
│ │ │            
    -spec integer_to_list(Integer) -> string() when Integer :: integer().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │ -
    Returns a string corresponding to the text representation of Integer.
    For example:
    > integer_to_list(77).
│ │ │ +
    Returns a string corresponding to the text representation of Integer.
    For example:
    > integer_to_list(77).
│ │ │  "77"
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │ @@ -9798,15 +9798,15 @@
│ │ │        
    
│ │ │  
│ │ │            
    -spec integer_to_list(Integer, Base) -> string() when Integer :: integer(), Base :: 2..36.
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │  
    Returns a string corresponding to the text representation of Integer in base
│ │ │ -Base.
    For example:
    > integer_to_list(1023, 16).
│ │ │ +Base.
    For example:
    > integer_to_list(1023, 16).
│ │ │  "3FF"
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │ @@ -9828,15 +9828,15 @@
│ │ │        
    
│ │ │  
│ │ │            
    -spec iolist_size(Item) -> non_neg_integer() when Item :: iolist() | binary().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │  
    Returns an integer, that is the size in bytes, of the binary that would be the
│ │ │ -result of iolist_to_binary(Item).
    For example:
    > iolist_size([1,2|<<3,4>>]).
│ │ │ +result of iolist_to_binary(Item).
    For example:
    > iolist_size([1,2|<<3,4>>]).
│ │ │  4
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │ @@ -9858,22 +9858,22 @@
│ │ │        
    
│ │ │  
│ │ │            
    -spec iolist_to_binary(IoListOrBinary) -> binary() when IoListOrBinary :: iolist() | binary().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │  
    Returns a binary that is made from the integers and binaries in
│ │ │ -IoListOrBinary.
    For example:
    > Bin1 = <<1,2,3>>.
│ │ │ -<<1,2,3>>
│ │ │ -> Bin2 = <<4,5>>.
│ │ │ -<<4,5>>
│ │ │ -> Bin3 = <<6>>.
│ │ │ -<<6>>
│ │ │ -> iolist_to_binary([Bin1,1,[2,3,Bin2],4|Bin3]).
│ │ │ -<<1,2,3,1,2,3,4,5,4,6>>
    
│ │ │ +IoListOrBinary.
    For example:
    > Bin1 = <<1,2,3>>.
│ │ │ +<<1,2,3>>
│ │ │ +> Bin2 = <<4,5>>.
│ │ │ +<<4,5>>
│ │ │ +> Bin3 = <<6>>.
│ │ │ +<<6>>
│ │ │ +> iolist_to_binary([Bin1,1,[2,3,Bin2],4|Bin3]).
│ │ │ +<<1,2,3,1,2,3,4,5,4,6>>
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │        
│ │ │ @@ -9899,31 +9899,31 @@
│ │ │  
│ │ │  
    Returns an iovec that is made from the integers and binaries in
│ │ │  IoListOrBinary. This function is useful when you want to flatten an iolist but
│ │ │  you do not need a single binary. This can be useful for passing the data to nif
│ │ │  functions such as enif_inspect_iovec or do
│ │ │  more efficient message passing. The advantage of using this function over
│ │ │  iolist_to_binary/1 is that it does not have to copy
│ │ │ -off-heap binaries.
    For example:
    > Bin1 = <<1,2,3>>.
│ │ │ -<<1,2,3>>
│ │ │ -> Bin2 = <<4,5>>.
│ │ │ -<<4,5>>
│ │ │ -> Bin3 = <<6>>.
│ │ │ -<<6>>
│ │ │ +off-heap binaries.
    For example:
    > Bin1 = <<1,2,3>>.
│ │ │ +<<1,2,3>>
│ │ │ +> Bin2 = <<4,5>>.
│ │ │ +<<4,5>>
│ │ │ +> Bin3 = <<6>>.
│ │ │ +<<6>>
│ │ │  %% If you pass small binaries and integers it works as iolist_to_binary
│ │ │ -> erlang:iolist_to_iovec([Bin1,1,[2,3,Bin2],4|Bin3]).
│ │ │ -[<<1,2,3,1,2,3,4,5,4,6>>]
│ │ │ +> erlang:iolist_to_iovec([Bin1,1,[2,3,Bin2],4|Bin3]).
│ │ │ +[<<1,2,3,1,2,3,4,5,4,6>>]
│ │ │  %% If you pass larger binaries, they are split and returned in a form
│ │ │  %% optimized for calling the C function writev.
│ │ │ -> erlang:iolist_to_iovec([<<1>>,<<2:8096>>,<<3:8096>>]).
│ │ │ -[<<1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
│ │ │ -   0,...>>,
│ │ │ - <<0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
│ │ │ -   ...>>,
│ │ │ - <<0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,...>>]
    
│ │ │ +    > erlang:iolist_to_iovec([<<1>>,<<2:8096>>,<<3:8096>>]).
│ │ │ +[<<1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
│ │ │ +   0,...>>,
│ │ │ + <<0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
│ │ │ +   ...>>,
│ │ │ + <<0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,...>>]
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │        
│ │ │ @@ -10253,19 +10253,19 @@
│ │ │        
    
│ │ │  
│ │ │            
    -spec is_map_key(Key, Map) -> boolean() when Key :: term(), Map :: map().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │  
    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}
│ │ │ -> is_map_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}
│ │ │ +> is_map_key("42",Map).
│ │ │  true
│ │ │ -> is_map_key(value,Map).
│ │ │ +> is_map_key(value,Map).
│ │ │  false
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │ @@ -10508,15 +10508,15 @@
│ │ │  
│ │ │        
    
│ │ │  
│ │ │            
    -spec length(List) -> non_neg_integer() when List :: [term()].
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │ -
    Returns the length of List.
    For example:
    > length([1,2,3,4,5,6,7,8,9]).
│ │ │ +
    Returns the length of List.
    For example:
    > length([1,2,3,4,5,6,7,8,9]).
│ │ │  9
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │ @@ -10546,15 +10546,15 @@
│ │ │  Unicode characters above 255.
    Note
    The number of characters that are permitted in an atom name is limited. The
│ │ │  default limits can be found in the
│ │ │  efficiency guide (section System Limits).
    Note
    There is a configurable limit
│ │ │  on how many atoms that can exist and atoms are not
│ │ │  garbage collected. Therefore, it is recommended to consider if
│ │ │  list_to_existing_atom/1 is a better option than
│ │ │  list_to_atom/1. The default limits can be found in the
│ │ │ -Efficiency Guide (section System Limits).
    Example:
    > list_to_atom("Erlang").
│ │ │ +Efficiency Guide (section System Limits).
    Example:
    > list_to_atom("Erlang").
│ │ │  'Erlang'
    
│ │ │    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │ @@ -10575,22 +10575,22 @@
│ │ │  
│ │ │        
    
│ │ │  
│ │ │            
    -spec list_to_binary(IoList) -> binary() when IoList :: iolist().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │ -
    Returns a binary that is made from the integers and binaries in IoList.
    For example:
    > Bin1 = <<1,2,3>>.
│ │ │ -<<1,2,3>>
│ │ │ -> Bin2 = <<4,5>>.
│ │ │ -<<4,5>>
│ │ │ -> Bin3 = <<6>>.
│ │ │ -<<6>>
│ │ │ -> list_to_binary([Bin1,1,[2,3,Bin2],4|Bin3]).
│ │ │ -<<1,2,3,1,2,3,4,5,4,6>>
    
│ │ │ +
    Returns a binary that is made from the integers and binaries in IoList.
    For example:
    > Bin1 = <<1,2,3>>.
│ │ │ +<<1,2,3>>
│ │ │ +> Bin2 = <<4,5>>.
│ │ │ +<<4,5>>
│ │ │ +> Bin3 = <<6>>.
│ │ │ +<<6>>
│ │ │ +> list_to_binary([Bin1,1,[2,3,Bin2],4|Bin3]).
│ │ │ +<<1,2,3,1,2,3,4,5,4,6>>
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │        
│ │ │ @@ -10612,22 +10612,22 @@
│ │ │  
│ │ │            
    -spec list_to_bitstring(BitstringList) -> bitstring() when BitstringList :: bitstring_list().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │  
    Returns a bitstring that is made from the integers and bitstrings in
│ │ │  BitstringList. (The last tail in BitstringList is allowed to be a
│ │ │ -bitstring.)
    For example:
    > Bin1 = <<1,2,3>>.
│ │ │ -<<1,2,3>>
│ │ │ -> Bin2 = <<4,5>>.
│ │ │ -<<4,5>>
│ │ │ -> Bin3 = <<6,7:4>>.
│ │ │ -<<6,7:4>>
│ │ │ -> list_to_bitstring([Bin1,1,[2,3,Bin2],4|Bin3]).
│ │ │ -<<1,2,3,1,2,3,4,5,4,6,7:4>>
    
│ │ │ +bitstring.)
    For example:
    > Bin1 = <<1,2,3>>.
│ │ │ +<<1,2,3>>
│ │ │ +> Bin2 = <<4,5>>.
│ │ │ +<<4,5>>
│ │ │ +> Bin3 = <<6,7:4>>.
│ │ │ +<<6,7:4>>
│ │ │ +> list_to_bitstring([Bin1,1,[2,3,Bin2],4|Bin3]).
│ │ │ +<<1,2,3,1,2,3,4,5,4,6,7:4>>
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │        
│ │ │ @@ -10683,15 +10683,15 @@
│ │ │  
│ │ │        
    
│ │ │  
│ │ │            
    -spec list_to_float(String) -> float() when String :: string().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │ -
    Returns the float whose text representation is String. 
    For example:
    > list_to_float("2.2017764e+0").
│ │ │ +
    Returns the float whose text representation is String. 
    For example:
    > list_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 String contains a bad representation of a float.
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │ @@ -10714,17 +10714,17 @@
│ │ │  
│ │ │        
    
│ │ │  
│ │ │            
    -spec list_to_integer(String) -> integer() when String :: string().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │ -
    Returns an integer whose text representation is String.
    For example:
    > list_to_integer("123").
│ │ │ -123
    > list_to_integer("-123").
│ │ │ --123
    > list_to_integer("+123234982304982309482093833234234").
│ │ │ +
    Returns an integer whose text representation is String.
    For example:
    > list_to_integer("123").
│ │ │ +123
    > list_to_integer("-123").
│ │ │ +-123
    > list_to_integer("+123234982304982309482093833234234").
│ │ │  123234982304982309482093833234234
    String must contain at least one digit character and can have an optional
│ │ │  prefix consisting of a single "+" or "-" character (that is, String must
│ │ │  match the regular expression "^[+-]?[0-9]+$").
    Failure: badarg if String contains a bad representation of an integer.
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │ @@ -10747,19 +10747,19 @@
│ │ │  
│ │ │        
    
│ │ │  
│ │ │            
    -spec list_to_integer(String, Base) -> integer() when String :: string(), Base :: 2..36.
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │ -
    Returns an integer whose text representation in base Base is String.
    For example:
    > list_to_integer("3FF", 16).
│ │ │ -1023
    > list_to_integer("+3FF", 16).
│ │ │ -1023
    > list_to_integer("3ff", 16).
│ │ │ -1023
    > list_to_integer("3fF", 16).
│ │ │ -1023
    > list_to_integer("-3FF", 16).
│ │ │ +
    Returns an integer whose text representation in base Base is String.
    For example:
    > list_to_integer("3FF", 16).
│ │ │ +1023
    > list_to_integer("+3FF", 16).
│ │ │ +1023
    > list_to_integer("3ff", 16).
│ │ │ +1023
    > list_to_integer("3fF", 16).
│ │ │ +1023
    > list_to_integer("-3FF", 16).
│ │ │  -1023
    For example, when Base is 16, String must match the regular expression
│ │ │  "^[+-]?([0-9]|[A-F]|[a-f])+$".
    Failure: badarg if String contains a bad representation of an integer.
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │ @@ -10781,15 +10781,15 @@
│ │ │  
│ │ │        
    
│ │ │  
│ │ │            
    -spec list_to_pid(String) -> pid() when String :: string().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │ -
    Returns a process identifier whose text representation is a String.
    For example:
    > list_to_pid("<0.4.1>").
│ │ │ +
    Returns a process identifier whose text representation is a String.
    For example:
    > list_to_pid("<0.4.1>").
│ │ │  <0.4.1>
    Failure: badarg if String contains a bad representation of a process
│ │ │  identifier.
    Warning
    This BIF is intended for debugging and is not to be used in application
│ │ │  programs.
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │ @@ -10814,15 +10814,15 @@
│ │ │  
│ │ │        
    
│ │ │  
│ │ │            
    -spec list_to_port(String) -> port() when String :: string().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │ -
    Returns a port identifier whose text representation is a String.
    For example:
    > list_to_port("#Port<0.4>").
│ │ │ +
    Returns a port identifier whose text representation is a String.
    For example:
    > list_to_port("#Port<0.4>").
│ │ │  #Port<0.4>
    Failure: badarg if String contains a bad representation of a port
│ │ │  identifier.
    Warning
    This BIF is intended for debugging and is not to be used in application
│ │ │  programs.
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │ @@ -10847,15 +10847,15 @@
│ │ │  
│ │ │        
    
│ │ │  
│ │ │            
    -spec list_to_ref(String) -> reference() when String :: string().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │ -
    Returns a reference whose text representation is a String.
    For example:
    > list_to_ref("#Ref<0.4192537678.4073193475.71181>").
│ │ │ +
    Returns a reference whose text representation is a String.
    For example:
    > list_to_ref("#Ref<0.4192537678.4073193475.71181>").
│ │ │  #Ref<0.4192537678.4073193475.71181>
    Failure: badarg if String contains a bad representation of a reference.
    Warning
    This BIF is intended for debugging and is not to be used in application
│ │ │  programs.
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │ @@ -10877,16 +10877,16 @@
│ │ │  
│ │ │        
    
│ │ │  
│ │ │            
    -spec list_to_tuple(List) -> tuple() when List :: [term()].
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │ -
    Returns a tuple corresponding to List, for example
    > list_to_tuple([share, ['Ericsson_B', 163]]).
│ │ │ -{share, ['Ericsson_B', 163]}
    List can contain any Erlang terms.
    
│ │ │ +
    Returns a tuple corresponding to List, for example
    > list_to_tuple([share, ['Ericsson_B', 163]]).
│ │ │ +{share, ['Ericsson_B', 163]}
    List can contain any Erlang terms.
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │        
│ │ │ @@ -10936,16 +10936,16 @@
│ │ │        
    
│ │ │  
│ │ │            
    -spec make_tuple(Arity, InitialValue) -> tuple() when Arity :: arity(), InitialValue :: term().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │  
    Creates a new tuple of the specified Arity, where all elements are
│ │ │ -InitialValue.
    For example:
    > erlang:make_tuple(4, []).
│ │ │ -{[],[],[],[]}
    
│ │ │ +InitialValue.
    For example:
    > erlang:make_tuple(4, []).
│ │ │ +{[],[],[],[]}
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │        
│ │ │ @@ -10971,16 +10971,16 @@
│ │ │  
│ │ │        
    
│ │ │  
│ │ │  
    Creates a tuple of size Arity, where each element has value DefaultValue,
│ │ │  and then fills in values from InitList.
    Each list element in InitList must be a two-tuple, where the first element is
│ │ │  a position in the newly created tuple and the second element is any term. If a
│ │ │  position occurs more than once in the list, the term corresponding to the last
│ │ │ -occurrence is used.
    For example:
    > erlang:make_tuple(5, [], [{2,ignored},{5,zz},{2,aa}]).
│ │ │ -{[],aa,[],[],zz}
    
│ │ │ +occurrence is used.
    For example:
    > erlang:make_tuple(5, [], [{2,ignored},{5,zz},{2,aa}]).
│ │ │ +{[],aa,[],[],zz}
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │        
│ │ │ @@ -11006,16 +11006,16 @@
│ │ │  
│ │ │            
    -spec map_get(Key, Map) -> Value when Map :: map(), Key :: any(), Value :: any().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │  
    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},
│ │ │ -  map_get(Key,Map).
│ │ │ +  Map = #{42 => value_two,1337 => "value one","a" => 1},
│ │ │ +  map_get(Key,Map).
│ │ │  "value one"
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │ @@ -11040,15 +11040,15 @@
│ │ │  
│ │ │        
    
│ │ │  
│ │ │            
    -spec map_size(Map) -> non_neg_integer() when Map :: map().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │ -
    Returns an integer, which is the number of key-value pairs in Map.
    For example:
    > map_size(#{a=>1, b=>2, c=>3}).
│ │ │ +
    Returns an integer, which is the number of key-value pairs in Map.
    For example:
    > map_size(#{a=>1, b=>2, c=>3}).
│ │ │  3
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │ @@ -11119,18 +11119,18 @@
│ │ │  
│ │ │            
    -spec max(Term1, Term2) -> Maximum when Term1 :: term(), Term2 :: term(), Maximum :: term().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │  
    Returns the largest of Term1 and Term2. If the terms compare equal with the
│ │ │  == operator, Term1 is returned.
    The Expressions section contains
│ │ │ -descriptions of the == operator and how terms are ordered.
    Examples:
    > max(1, 2).
│ │ │ -2
    > max(1.0, 1).
│ │ │ -1.0
    > max(1, 1.0).
│ │ │ -1
    > max("abc", "b").
│ │ │ +descriptions of the == operator and how terms are ordered.
    Examples:
    > max(1, 2).
│ │ │ +2
    > max(1.0, 1).
│ │ │ +1.0
    > max(1, 1.0).
│ │ │ +1
    > max("abc", "b").
│ │ │  "b"
    Change
    Allowed in guards tests from Erlang/OTP 26.
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │ @@ -11155,18 +11155,18 @@
│ │ │  
│ │ │            
    -spec min(Term1, Term2) -> Minimum when Term1 :: term(), Term2 :: term(), Minimum :: term().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │  
    Returns the smallest of Term1 and Term2. If the terms compare equal with the
│ │ │  == operator, Term1 is returned.
    The Expressions section contains
│ │ │ -descriptions of the == operator and how terms are ordered.
    Examples:
    > min(1, 2).
│ │ │ -1
    > min(1.0, 1).
│ │ │ -1.0
    > min(1, 1.0).
│ │ │ -1
    > min("abc", "b").
│ │ │ +descriptions of the == operator and how terms are ordered.
    Examples:
    > min(1, 2).
│ │ │ +1
    > min(1.0, 1).
│ │ │ +1.0
    > min(1, 1.0).
│ │ │ +1
    > min("abc", "b").
│ │ │  "abc"
    Change
    Allowed in guards tests from Erlang/OTP 26.
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │ @@ -11276,15 +11276,15 @@
│ │ │  
│ │ │        
    
│ │ │  
│ │ │            
    -spec pid_to_list(Pid) -> string() when Pid :: pid().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │ -
    Returns a string corresponding to the text representation of Pid.
    For example:
    > erlang:pid_to_list(self()).
│ │ │ +
    Returns a string corresponding to the text representation of Pid.
    For example:
    > erlang:pid_to_list(self()).
│ │ │  "<0.85.0>"
    Note
    The creation for the node is not included in the list
│ │ │  representation of Pid. This means that processes in different incarnations
│ │ │  of a node with a specific name can get the same list representation.
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │ @@ -11367,18 +11367,18 @@
│ │ │  
│ │ │        
    
│ │ │  
│ │ │            
    -spec round(Number) -> integer() when Number :: number().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │ -
    Returns an integer by rounding Number.
    For example:
    round(42.1).
│ │ │ -42
    round(5.5).
│ │ │ -6
    round(-5.5).
│ │ │ --6
    round(36028797018963969.0).
│ │ │ +
    Returns an integer by rounding Number.
    For example:
    round(42.1).
│ │ │ +42
    round(5.5).
│ │ │ +6
    round(-5.5).
│ │ │ +-6
    round(36028797018963969.0).
│ │ │  36028797018963968
    In the last example, round(36028797018963969.0) evaluates to
│ │ │  36028797018963968. The reason for this is that the number
│ │ │  36028797018963969.0 cannot be represented exactly as a float value. Instead,
│ │ │  the float literal is represented as 36028797018963968.0, which is the closest
│ │ │  number that can be represented exactly as a float value. See
│ │ │  Representation of Floating Point Numbers
│ │ │  for additional information.
    
│ │ │ @@ -11408,16 +11408,16 @@
│ │ │            
    -spec setelement(Index, Tuple1, Value) -> Tuple2
│ │ │                      when Index :: pos_integer(), Tuple1 :: tuple(), Tuple2 :: tuple(), Value :: term().
    
│ │ │  
│ │ │        
│ │ │  
│ │ │  
    Returns a tuple that is a copy of argument Tuple1 with the element specified
│ │ │  by integer argument Index (the first element is the element with index 1)
│ │ │ -replaced by argument Value.
    For example:
    > setelement(2, {10, green, bottles}, red).
│ │ │ -{10,red,bottles}
    
│ │ │ +replaced by argument Value.
    For example:
    > setelement(2, {10, green, bottles}, red).
│ │ │ +{10,red,bottles}
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │        
│ │ │ @@ -11440,17 +11440,17 @@
│ │ │        
    
│ │ │  
│ │ │            
    -spec size(Item) -> non_neg_integer() when Item :: tuple() | binary().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │  
    Returns the number of elements in a tuple or the number of bytes in a binary or
│ │ │ -bitstring.
    For example:
    > size({morni, mulle, bwange}).
│ │ │ +bitstring.
    For example:
    > size({morni, mulle, bwange}).
│ │ │  3
│ │ │ -> size(<<11, 22, 33>>).
│ │ │ +> size(<<11, 22, 33>>).
│ │ │  3
    For bitstrings, the number of whole bytes is returned. That is, if the number of
│ │ │  bits in the bitstring is not divisible by 8, the resulting number of bytes is
│ │ │  rounded down.
    See also tuple_size/1, byte_size/1, and bit_size/1.
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │ @@ -11474,23 +11474,23 @@
│ │ │        
    
│ │ │  
│ │ │            
    -spec split_binary(Bin, Pos) -> {binary(), binary()} when Bin :: binary(), Pos :: non_neg_integer().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │  
    Returns a tuple containing the binaries that are the result of splitting Bin
│ │ │ -into two parts at position Pos.
    This is not a destructive operation. After the operation, there are three binaries altogether.
    For example:
    > B = list_to_binary("0123456789").
│ │ │ -<<"0123456789">>
│ │ │ -> byte_size(B).
│ │ │ +into two parts at position Pos.
    This is not a destructive operation. After the operation, there are three binaries altogether.
    For example:
    > B = list_to_binary("0123456789").
│ │ │ +<<"0123456789">>
│ │ │ +> byte_size(B).
│ │ │  10
│ │ │ -> {B1, B2} = split_binary(B,3).
│ │ │ -{<<"012">>,<<"3456789">>}
│ │ │ -> byte_size(B1).
│ │ │ +> {B1, B2} = split_binary(B,3).
│ │ │ +{<<"012">>,<<"3456789">>}
│ │ │ +> byte_size(B1).
│ │ │  3
│ │ │ -> byte_size(B2).
│ │ │ +> byte_size(B2).
│ │ │  7
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │ @@ -11514,17 +11514,17 @@
│ │ │            
    -spec term_to_binary(Term) -> ext_binary() when Term :: term().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │  
    Returns a binary data object that is the result of encoding Term according to
│ │ │  the Erlang external term format.
    This can be used for various purposes, for example, writing a term to a file in
│ │ │  an efficient way, or sending an Erlang term to some type of communications
│ │ │ -channel not supported by distributed Erlang.
    > Bin = term_to_binary(hello).
│ │ │ -<<131,100,0,5,104,101,108,108,111>>
│ │ │ -> hello = binary_to_term(Bin).
│ │ │ +channel not supported by distributed Erlang.
    > Bin = term_to_binary(hello).
│ │ │ +<<131,100,0,5,104,101,108,108,111>>
│ │ │ +> hello = binary_to_term(Bin).
│ │ │  hello
    See also binary_to_term/1.
    Note
    There is no guarantee that this function will return the same encoded
│ │ │  representation for the same term.
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │ @@ -11741,18 +11741,18 @@
│ │ │  
│ │ │        
    
│ │ │  
│ │ │            
    -spec tl(List) -> Tail when List :: nonempty_maybe_improper_list(), Tail :: term().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │ -
    Returns the tail of List, that is, the list minus the first element
    It works with improper lists.
    Examples:
    > tl([geesties, guilies, beasties]).
│ │ │ -[guilies, beasties]
    > tl([geesties]).
│ │ │ -[]
    > tl([geesties, guilies, beasties | improper_end]).
│ │ │ -[guilies, beasties | improper_end]
    > tl([geesties | improper_end]).
│ │ │ +
    Returns the tail of List, that is, the list minus the first element
    It works with improper lists.
    Examples:
    > tl([geesties, guilies, beasties]).
│ │ │ +[guilies, beasties]
    > tl([geesties]).
│ │ │ +[]
    > tl([geesties, guilies, beasties | improper_end]).
│ │ │ +[guilies, beasties | improper_end]
    > tl([geesties | improper_end]).
│ │ │  improper_end
    Failure: badarg if List is an empty list [].
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │ @@ -11775,18 +11775,18 @@
│ │ │  
│ │ │        
    
│ │ │  
│ │ │            
    -spec trunc(Number) -> integer() when Number :: number().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │ -
    Truncates the decimals of Number.
    For example:
    > trunc(5.7).
│ │ │ -5
    > trunc(-5.7).
│ │ │ --5
    > trunc(5).
│ │ │ -5
    > trunc(36028797018963969.0).
│ │ │ +
    Truncates the decimals of Number.
    For example:
    > trunc(5.7).
│ │ │ +5
    > trunc(-5.7).
│ │ │ +-5
    > trunc(5).
│ │ │ +5
    > trunc(36028797018963969.0).
│ │ │  36028797018963968
    In the last example, trunc(36028797018963969.0) evaluates to
│ │ │  36028797018963968. The reason for this is that the number
│ │ │  36028797018963969.0 cannot be represented exactly as a float value. Instead,
│ │ │  the float literal is represented as 36028797018963968.0, which is the closest
│ │ │  number that can be represented exactly as a float value. See
│ │ │  Representation of Floating Point Numbers
│ │ │  for additional information.
    
│ │ │ @@ -11815,15 +11815,15 @@
│ │ │  
│ │ │        
    
│ │ │  
│ │ │            
    -spec tuple_size(Tuple) -> non_neg_integer() when Tuple :: tuple().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │ -
    Returns an integer that is the number of elements in Tuple.
    For example:
    > tuple_size({morni, mulle, bwange}).
│ │ │ +
    Returns an integer that is the number of elements in Tuple.
    For example:
    > tuple_size({morni, mulle, bwange}).
│ │ │  3
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │ @@ -11845,16 +11845,16 @@
│ │ │        
    
│ │ │  
│ │ │            
    -spec tuple_to_list(Tuple) -> [term()] when Tuple :: tuple().
    
│ │ │  
│ │ │        
    
│ │ │  
│ │ │  
    Returns a list corresponding to Tuple. Tuple can contain any Erlang terms.
│ │ │ -Example:
    > tuple_to_list({share, {'Ericsson_B', 163}}).
│ │ │ -[share,{'Ericsson_B',163}]
    
│ │ │ +Example:
    > tuple_to_list({share, {'Ericsson_B', 163}}).
│ │ │ +[share,{'Ericsson_B',163}]
    
│ │ │    
    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │        
│ │ │ @@ -12009,35 +12009,35 @@
│ │ │  
│ │ │  
    Create an alias which can be used when sending messages to the process that
│ │ │  created the alias. When the alias has been deactivated, messages sent using the
│ │ │  alias will be dropped. An alias can be deactivated using unalias/1.
    Currently available options for alias/1:
    • explicit_unalias - The alias can only be deactivated via a call to
│ │ │  unalias/1. This is also the default behaviour if no options
│ │ │  are passed or if alias/0 is called.
    • reply - The alias will be automatically deactivated when a reply message
│ │ │  sent via the alias is received. The alias can also still be deactivated via a
│ │ │ -call to unalias/1.
    Example:
    server() ->
│ │ │ +call to unalias/1.
    Example:
    server() ->
│ │ │      receive
│ │ │ -        {request, AliasReqId, Request} ->
│ │ │ -            Result = perform_request(Request),
│ │ │ -            AliasReqId ! {reply, AliasReqId, Result}
│ │ │ +        {request, AliasReqId, Request} ->
│ │ │ +            Result = perform_request(Request),
│ │ │ +            AliasReqId ! {reply, AliasReqId, Result}
│ │ │      end,
│ │ │ -    server().
│ │ │ +    server().
│ │ │  
│ │ │ -client(ServerPid, Request) ->
│ │ │ -    AliasReqId = alias([reply]),
│ │ │ -    ServerPid ! {request, AliasReqId, Request},
│ │ │ +client(ServerPid, Request) ->
│ │ │ +    AliasReqId = alias([reply]),
│ │ │ +    ServerPid ! {request, AliasReqId, Request},
│ │ │      %% Alias will be automatically deactivated if we receive a reply
│ │ │      %% since we used the 'reply' option...
│ │ │      receive
│ │ │ -        {reply, AliasReqId, Result} -> Result
│ │ │ +        {reply, AliasReqId, Result} -> Result
│ │ │      after 5000 ->
│ │ │ -            unalias(AliasReqId),
│ │ │ +            unalias(AliasReqId),
│ │ │              %% Flush message queue in case the reply arrived
│ │ │              %% just before the alias was deactivated...
│ │ │ -            receive {reply, AliasReqId, Result} -> Result
│ │ │ -            after 0 -> exit(timeout)
│ │ │ +            receive {reply, AliasReqId, Result} -> Result
│ │ │ +            after 0 -> exit(timeout)
│ │ │              end
│ │ │      end.
    Note that both the server and the client in this example must be executing on at
│ │ │  least OTP 24 systems in order for this to work.
    For more information on process aliases see the
│ │ │  Process Aliases section of
│ │ │  the Erlang Reference Manual.
    
│ │ │    
    
│ │ │  
│ │ │ @@ -12096,17 +12096,17 @@
│ │ │            
    -spec apply(Module, Function, Args) -> term()
│ │ │                 when Module :: module(), Function :: atom(), Args :: [term()].
    
│ │ │  
│ │ │        
│ │ │  
│ │ │  
    Returns the result of applying Function in Module to Args. The applied
│ │ │  function must be exported from Module. The arity of the function is the length
│ │ │ -of Args.
    For example:
    > apply(lists, reverse, [[a, b, c]]).
│ │ │ -[c,b,a]
│ │ │ -> apply(erlang, atom_to_list, ['Erlang']).
│ │ │ +of Args.
    For example:
    > apply(lists, reverse, [[a, b, c]]).
│ │ │ +[c,b,a]
│ │ │ +> apply(erlang, atom_to_list, ['Erlang']).
│ │ │  "Erlang"
    If the number of arguments are known at compile time, the call is better written
│ │ │  as Module:Function(Arg1, Arg2, ..., ArgN).
    Failure: error_handler:undefined_function/3 is called if the applied function
│ │ │  is not exported. The error handler can be redefined (see process_flag/2). If
│ │ │  error_handler is undefined, or if the user has redefined the default
│ │ │  error_handler so the replacement module is undefined, an error with reason
│ │ │  undef is generated.
    
│ │ │    
│ │ │ @@ -12213,17 +12213,17 @@
│ │ │                     when MonitorRef :: reference(), OptionList :: [Option], Option :: flush | info.
    
│ │ │  
│ │ │        
│ │ │  
│ │ │  
    The returned value is true unless info is part of OptionList.
    demonitor(MonitorRef, []) is equivalent to
│ │ │  demonitor(MonitorRef).
    Options:
    • flush - Removes (one) {_, MonitorRef, _, _, _} message, if there is
│ │ │  one, from the caller message queue after monitoring has been stopped.
      Calling demonitor(MonitorRef, [flush]) is equivalent to the
│ │ │ -following, but more efficient:
      demonitor(MonitorRef),
│ │ │ +following, but more efficient:
      demonitor(MonitorRef),
│ │ │  receive
│ │ │ -    {_, MonitorRef, _, _, _} ->
│ │ │ +    {_, MonitorRef, _, _, _} ->
│ │ │          true
│ │ │  after 0 ->
│ │ │          true
│ │ │  end
    • info - The returned value is one of the following:
      • true - The monitor was found and removed. In this case, no 'DOWN'
│ │ │  message corresponding to this monitor has been delivered and will not be
│ │ │  delivered.
      • false - The monitor was not found and could not be removed. This
│ │ │  probably because someone already has placed a 'DOWN' message corresponding
│ │ │ @@ -12252,18 +12252,18 @@
│ │ │  
│ │ │        
        
│ │ │  
│ │ │            
        -spec erase() -> [{Key, Val}] when Key :: term(), Val :: term().
        
│ │ │  
│ │ │        
        
│ │ │  
│ │ │ -
        Returns the process dictionary and deletes it.
        For example:
        > put(key1, {1, 2, 3}),
│ │ │ -put(key2, [a, b, c]),
│ │ │ -erase().
│ │ │ -[{key1,{1,2,3}},{key2,[a,b,c]}]
        
│ │ │ +
        Returns the process dictionary and deletes it.
        For example:
        > put(key1, {1, 2, 3}),
│ │ │ +put(key2, [a, b, c]),
│ │ │ +erase().
│ │ │ +[{key1,{1,2,3}},{key2,[a,b,c]}]
        
│ │ │    
│ │ │  
│ │ │  
        
│ │ │  
│ │ │    
        
│ │ │      
│ │ │        
│ │ │ @@ -12286,18 +12286,18 @@
│ │ │            
        -spec erase(Key) -> Val | undefined when Key :: term(), Val :: term().
        
│ │ │  
│ │ │        
        
│ │ │  
│ │ │  
        Returns the value Val associated with Key and deletes it from the process
│ │ │  dictionary. Returns undefined if no value is associated with Key.
        The average time complexity for the current implementation of this function is
│ │ │  O(1) and the worst case time complexity is O(N), where N is the number of
│ │ │ -items in the process dictionary.
        For example:
        > put(key1, {merry, lambs, are, playing}),
│ │ │ -X = erase(key1),
│ │ │ -{X, erase(key1)}.
│ │ │ -{{merry,lambs,are,playing},undefined}
        
│ │ │ +items in the process dictionary.
        For example:
        > put(key1, {merry, lambs, are, playing}),
│ │ │ +X = erase(key1),
│ │ │ +{X, erase(key1)}.
│ │ │ +{{merry,lambs,are,playing},undefined}
        
│ │ │    
        
│ │ │  
│ │ │  
        
│ │ │  
│ │ │    
        
│ │ │      
│ │ │        
│ │ │ @@ -12321,22 +12321,22 @@
│ │ │  
│ │ │        
        
│ │ │  
│ │ │  
        Raises an exception of class error with the reason Reason.
        As evaluating this function causes an exception to be thrown, it has no return value.
        The intent of the exception class error is to signal that an unexpected error
│ │ │  has happened (for example, a function is called with a parameter that has an
│ │ │  incorrect type). See the guide about
│ │ │  errors and error handling for additional information.
│ │ │ -Example:
        > catch error(foobar).
│ │ │ -{'EXIT',{foobar,[{shell,apply_fun,3,
│ │ │ -                        [{file,"shell.erl"},{line,906}]},
│ │ │ -                 {erl_eval,do_apply,6,[{file,"erl_eval.erl"},{line,677}]},
│ │ │ -                 {erl_eval,expr,5,[{file,"erl_eval.erl"},{line,430}]},
│ │ │ -                 {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}]}]}}
        
│ │ │ +Example:
        > catch error(foobar).
│ │ │ +{'EXIT',{foobar,[{shell,apply_fun,3,
│ │ │ +                        [{file,"shell.erl"},{line,906}]},
│ │ │ +                 {erl_eval,do_apply,6,[{file,"erl_eval.erl"},{line,677}]},
│ │ │ +                 {erl_eval,expr,5,[{file,"erl_eval.erl"},{line,430}]},
│ │ │ +                 {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}]}]}}
        
│ │ │    
        
│ │ │  
│ │ │  
        
│ │ │  
│ │ │    
        
│ │ │      
│ │ │        
│ │ │ @@ -12365,21 +12365,21 @@
│ │ │  none.
        If Args is a list, it is used to provide the arguments for the current
│ │ │  function in the stack back-trace. If it is none, the arity of the calling
│ │ │  function is used in the stacktrace. As evaluating this function causes an
│ │ │  exception to be raised, it has no return value.
        The intent of the exception class error is to signal that an unexpected error
│ │ │  has happened (for example, a function is called with a parameter that has an
│ │ │  incorrect type). See the guide about
│ │ │  errors and error handling for additional information.
│ │ │ -Example:
        test.erl:
        -module(test).
│ │ │ --export([example_fun/2]).
│ │ │ +Example:
        test.erl:
        -module(test).
│ │ │ +-export([example_fun/2]).
│ │ │  
│ │ │ -example_fun(A1, A2) ->
│ │ │ -    erlang:error(my_error, [A1, A2]).
        Erlang shell:
        6> c(test).
│ │ │ -{ok,test}
│ │ │ -7> test:example_fun(arg1,"this is the second argument").
│ │ │ +example_fun(A1, A2) ->
│ │ │ +    erlang:error(my_error, [A1, A2]).
        Erlang shell:
        6> c(test).
│ │ │ +{ok,test}
│ │ │ +7> test:example_fun(arg1,"this is the second argument").
│ │ │  ** exception error: my_error
│ │ │       in function  test:example_fun/2
│ │ │           called as test:example_fun(arg1,"this is the second argument")
        
│ │ │    
        
│ │ │  
│ │ │  
        
│ │ │  
│ │ │ @@ -12456,18 +12456,18 @@
│ │ │  
│ │ │        
│ │ │  
│ │ │  
        Raises an exception of class exit with exit reason Reason.
        As evaluating this function causes an exception to be raised, it has no return value.
        The intent of the exception class exit is that the current process should be
│ │ │  stopped (for example when a message telling a process to stop is received).
        This function differ from error/1,2,3 by causing an exception of
│ │ │  a different class and by having a reason that does not include the list of
│ │ │  functions from the call stack.
        See the guide about errors and error handling for
│ │ │ -additional information.
        Example:
        > exit(foobar).
│ │ │ +additional information.
        Example:
        > exit(foobar).
│ │ │  ** exception exit: foobar
│ │ │ -> catch exit(foobar).
│ │ │ -{'EXIT',foobar}
        Note
        If a process calls exit(kill) and does not catch the exception,
│ │ │ +> catch exit(foobar).
│ │ │ +{'EXIT',foobar}
        Note
        If a process calls exit(kill) and does not catch the exception,
│ │ │  it will terminate with exit reason kill and also emit exit signals with exit
│ │ │  reason kill (not killed) to all linked processes. Such exit signals with
│ │ │  exit reason kill can be trapped by the linked processes. Note that this
│ │ │  means that signals with exit reason kill behave differently depending on how
│ │ │  they are sent because the signal will be untrappable if a process sends such a
│ │ │  signal to another process with erlang:exit/2.
        
│ │ │    
        
│ │ │ @@ -12660,19 +12660,19 @@
│ │ │        
        
│ │ │  
│ │ │            
        -spec get() -> [{Key, Val}] when Key :: term(), Val :: term().
        
│ │ │  
│ │ │        
        
│ │ │  
│ │ │  
        Returns the process dictionary as a list of {Key, Val} tuples. The items in
│ │ │ -the returned list can be in any order.
        For example:
        > put(key1, merry),
│ │ │ -put(key2, lambs),
│ │ │ -put(key3, {are, playing}),
│ │ │ -get().
│ │ │ -[{key1,merry},{key2,lambs},{key3,{are,playing}}]
        
│ │ │ +the returned list can be in any order.
        For example:
        > put(key1, merry),
│ │ │ +put(key2, lambs),
│ │ │ +put(key3, {are, playing}),
│ │ │ +get().
│ │ │ +[{key1,merry},{key2,lambs},{key3,{are,playing}}]
        
│ │ │    
│ │ │  
│ │ │  
        
│ │ │  
│ │ │    
        
│ │ │      
│ │ │        
│ │ │ @@ -12695,19 +12695,19 @@
│ │ │            
        -spec get(Key) -> Val | undefined when Key :: term(), Val :: term().
        
│ │ │  
│ │ │        
        
│ │ │  
│ │ │  
        Returns the value Val associated with Key in the process dictionary, or
│ │ │  undefined if Key does not exist.
        The expected time complexity for the current implementation of this function is
│ │ │  O(1) and the worst case time complexity is O(N), where N is the number of
│ │ │ -items in the process dictionary.
        For example:
        > put(key1, merry),
│ │ │ -put(key2, lambs),
│ │ │ -put({any, [valid, term]}, {are, playing}),
│ │ │ -get({any, [valid, term]}).
│ │ │ -{are,playing}
        
│ │ │ +items in the process dictionary.
        For example:
        > put(key1, merry),
│ │ │ +put(key2, lambs),
│ │ │ +put({any, [valid, term]}, {are, playing}),
│ │ │ +get({any, [valid, term]}).
│ │ │ +{are,playing}
        
│ │ │    
        
│ │ │  
│ │ │  
        
│ │ │  
│ │ │    
        
│ │ │      
│ │ │        
│ │ │ @@ -12730,19 +12730,19 @@
│ │ │        
        
│ │ │  
│ │ │            
        -spec get_keys() -> [Key] when Key :: term().
        
│ │ │  
│ │ │        
        
│ │ │  
│ │ │  
        Returns a list of all keys present in the process dictionary. The items in the
│ │ │ -returned list can be in any order.
        For example:
        > put(dog, {animal,1}),
│ │ │ -put(cow, {animal,2}),
│ │ │ -put(lamb, {animal,3}),
│ │ │ -get_keys().
│ │ │ -[dog,cow,lamb]
        
│ │ │ +returned list can be in any order.
        For example:
        > put(dog, {animal,1}),
│ │ │ +put(cow, {animal,2}),
│ │ │ +put(lamb, {animal,3}),
│ │ │ +get_keys().
│ │ │ +[dog,cow,lamb]
        
│ │ │    
        
│ │ │  
│ │ │  
        
│ │ │  
│ │ │    
        
│ │ │      
│ │ │        
│ │ │ @@ -12763,22 +12763,22 @@
│ │ │        
        
│ │ │  
│ │ │            
        -spec get_keys(Val) -> [Key] when Val :: term(), Key :: term().
        
│ │ │  
│ │ │        
        
│ │ │  
│ │ │  
        Returns a list of keys that are associated with the value Val in the process
│ │ │ -dictionary. The items in the returned list can be in any order.
        For example:
        > put(mary, {1, 2}),
│ │ │ -put(had, {1, 2}),
│ │ │ -put(a, {1, 2}),
│ │ │ -put(little, {1, 2}),
│ │ │ -put(dog, {1, 3}),
│ │ │ -put(lamb, {1, 2}),
│ │ │ -get_keys({1, 2}).
│ │ │ -[mary,had,a,little,lamb]
        
│ │ │ +dictionary. The items in the returned list can be in any order.
        For example:
        > put(mary, {1, 2}),
│ │ │ +put(had, {1, 2}),
│ │ │ +put(a, {1, 2}),
│ │ │ +put(little, {1, 2}),
│ │ │ +put(dog, {1, 3}),
│ │ │ +put(lamb, {1, 2}),
│ │ │ +get_keys({1, 2}).
│ │ │ +[mary,had,a,little,lamb]
        
│ │ │    
        
│ │ │  
│ │ │  
        
│ │ │  
│ │ │    
        
│ │ │      
│ │ │        
│ │ │ @@ -12925,17 +12925,17 @@
│ │ │  
        Pid must refer to a process at the local node.
        Returns true if the process exists and is alive, that is, is not exiting and
│ │ │  has not exited. Otherwise returns false.
        If process P1 calls is_process_alive(P2Pid) it is
│ │ │  guaranteed that all signals, sent from P1 to P2 (P2 is the process with
│ │ │  identifier P2Pid) before the call, will be delivered to P2 before the
│ │ │  aliveness of P2 is checked. This guarantee means that one can use
│ │ │  is_process_alive/1 to let a process P1 wait until a
│ │ │  process P2, which has got an exit signal with reason kill from P1, is
│ │ │ -killed.
        For example:
        exit(P2Pid, kill),
│ │ │ +killed.
        For example:
        exit(P2Pid, kill),
│ │ │  % P2 might not be killed
│ │ │ -is_process_alive(P2Pid),
│ │ │ +is_process_alive(P2Pid),
│ │ │  % P2 is not alive (the call above always return false)
        See the documentation about signals
│ │ │  and erlang:exit/2 for more information about signals and exit
│ │ │  signals.
        
│ │ │    
        
│ │ │  
│ │ │  
        
│ │ │  
│ │ │ @@ -13016,24 +13016,24 @@
│ │ │            
        -spec monitor(process, monitor_process_identifier()) -> MonitorRef when MonitorRef :: reference();
│ │ │               (port, monitor_port_identifier()) -> MonitorRef when MonitorRef :: reference();
│ │ │               (time_offset, clock_service) -> MonitorRef when MonitorRef :: reference().
        
│ │ │  
│ │ │        
│ │ │  
│ │ │  
        Sends a monitor request of type Type to the entity identified by Item.
        If the monitored entity does not exist or it changes monitored state, the caller
│ │ │ -of monitor/2 is notified by a message on the following format:
        {Tag, MonitorRef, Type, Object, Info}
        Note
        The monitor request is an asynchronous signal. That is, it takes time before
│ │ │ +of monitor/2 is notified by a message on the following format:
        {Tag, MonitorRef, Type, Object, Info}
        Note
        The monitor request is an asynchronous signal. That is, it takes time before
│ │ │  the signal reaches its destination.
        Type can be one of the following atoms: process, port or time_offset.
        A process or port monitor is triggered only once, after that it is removed
│ │ │  from both monitoring process and the monitored entity. Monitors are fired when
│ │ │  the monitored process or port terminates, does not exist at the moment of
│ │ │  creation, or if the connection to it is lost. If the connection to it is lost,
│ │ │  we do not know if it still exists. The monitoring is also turned off when
│ │ │  demonitor/1 is called.
        A process or port monitor by name resolves the RegisteredName to pid/0
│ │ │  or port/0 only once at the moment of monitor instantiation, later changes to
│ │ │  the name registration will not affect the existing monitor.
        When a process or port monitor is triggered, a 'DOWN' message is sent that
│ │ │ -has the following pattern:
        {'DOWN', MonitorRef, Type, Object, Info}
        In the monitor message MonitorRef and Type are the same as described
│ │ │ +has the following pattern:
        {'DOWN', MonitorRef, Type, Object, Info}
        In the monitor message MonitorRef and Type are the same as described
│ │ │  earlier, and:
        • Object - The monitored entity, which triggered the event. When
│ │ │  monitoring a process or a local port, Object will be equal to the pid/0
│ │ │  or port/0 that was being monitored. When monitoring process or port by
│ │ │  name, Object will have format {RegisteredName, Node} where
│ │ │  RegisteredName is the name which has been used with
│ │ │  monitor/2 call and Node is local or remote node name (for
│ │ │  ports monitored by name, Node is always local node name).
        • Info - Either the exit reason of the process, noproc (process or port
│ │ │ @@ -13069,15 +13069,15 @@
│ │ │  offset is changed when the runtime system detects that the
│ │ │  OS system time has changed. The runtime
│ │ │  system does, however, not detect this immediately when it occurs. A task
│ │ │  checking the time offset is scheduled to execute at least once a minute, so
│ │ │  under normal operation this is to be detected within a minute, but during
│ │ │  heavy load it can take longer time.
          The monitor is not automatically removed after it has been triggered. That
│ │ │  is, repeated changes of the time offset trigger the monitor repeatedly.
          When the monitor is triggered a 'CHANGE' message is sent to the monitoring
│ │ │ -process. A 'CHANGE' message has the following pattern:
          {'CHANGE', MonitorRef, Type, Item, NewTimeOffset}
          where MonitorRef, Type, and Item are the same as described above, and
│ │ │ +process. A 'CHANGE' message has the following pattern:
          {'CHANGE', MonitorRef, Type, Item, NewTimeOffset}
          where MonitorRef, Type, and Item are the same as described above, and
│ │ │  NewTimeOffset is the new time offset.
          When the 'CHANGE' message has been received you are guaranteed not to
│ │ │  retrieve the old time offset when calling
│ │ │  erlang:time_offset/0. Notice that you can observe the
│ │ │  change of the time offset when calling erlang:time_offset/0 before you get
│ │ │  the 'CHANGE' message.
          Available since OTP 18.0.
        Making several calls to monitor/2 for the same Item and/or
│ │ │  Type is not an error; it results in as many independent monitoring instances.
        The monitor functionality is expected to be extended. That is, other Types and
│ │ │  Items are expected to be supported in a future release.
        Note
        If or when monitor/2 is extended, other possible values for
│ │ │ @@ -13133,78 +13133,78 @@
│ │ │  via the alias is received. When a reply message is received via the alias
│ │ │  the monitor will also be automatically removed. This is useful in
│ │ │  client/server scenarios when a client monitors the server and will get the
│ │ │  reply via the alias. Once the response is received both the alias and the
│ │ │  monitor will be automatically removed regardless of whether the response is
│ │ │  a reply or a 'DOWN' message. The alias can also still be deactivated via a
│ │ │  call to unalias/1. Note that if the alias is removed using
│ │ │ -the unalias/1 BIF, the monitor will still be left active.
      Example:
      server() ->
│ │ │ +the unalias/1 BIF, the monitor will still be left active.
    Example:
    server() ->
│ │ │      receive
│ │ │ -        {request, AliasReqId, Request} ->
│ │ │ -            Result = perform_request(Request),
│ │ │ -            AliasReqId ! {reply, AliasReqId, Result}
│ │ │ +        {request, AliasReqId, Request} ->
│ │ │ +            Result = perform_request(Request),
│ │ │ +            AliasReqId ! {reply, AliasReqId, Result}
│ │ │      end,
│ │ │ -    server().
│ │ │ +    server().
│ │ │  
│ │ │ -client(ServerPid, Request) ->
│ │ │ -    AliasMonReqId = monitor(process, ServerPid, [{alias, reply_demonitor}]),
│ │ │ -    ServerPid ! {request, AliasMonReqId, Request},
│ │ │ +client(ServerPid, Request) ->
│ │ │ +    AliasMonReqId = monitor(process, ServerPid, [{alias, reply_demonitor}]),
│ │ │ +    ServerPid ! {request, AliasMonReqId, Request},
│ │ │      %% Alias as well as monitor will be automatically deactivated if we
│ │ │      %% receive a reply or a 'DOWN' message since we used 'reply_demonitor'
│ │ │      %% as unalias option...
│ │ │      receive
│ │ │ -        {reply, AliasMonReqId, Result} ->
│ │ │ +        {reply, AliasMonReqId, Result} ->
│ │ │              Result;
│ │ │ -        {'DOWN', AliasMonReqId, process, ServerPid, ExitReason} ->
│ │ │ -            error(ExitReason)
│ │ │ +        {'DOWN', AliasMonReqId, process, ServerPid, ExitReason} ->
│ │ │ +            error(ExitReason)
│ │ │      end.
    Note that both the server and the client in this example must be executing on
│ │ │  at least OTP 24 systems in order for this to work.
    For more information on process aliases see the
│ │ │  Process Aliases section
│ │ │  of the Erlang Reference Manual.
  • {tag, UserDefinedTag} - Replace the default Tag with UserDefinedTag
│ │ │  in the monitor message delivered when the
│ │ │  monitor is triggered. For example, when monitoring a process, the 'DOWN' tag
│ │ │  in the down message will be replaced by UserDefinedTag.
    An example of how the {tag, UserDefinedTag} option can be used in order to
│ │ │  enable the new
│ │ │  selective receive optimization,
│ │ │ -introduced in OTP 24, when making multiple requests to different servers:
    server() ->
│ │ │ +introduced in OTP 24, when making multiple requests to different servers:
    server() ->
│ │ │      receive
│ │ │ -        {request, From, ReqId, Request} ->
│ │ │ -            Result = perform_request(Request),
│ │ │ -            From ! {reply, self(), ReqId, Result}
│ │ │ +        {request, From, ReqId, Request} ->
│ │ │ +            Result = perform_request(Request),
│ │ │ +            From ! {reply, self(), ReqId, Result}
│ │ │      end,
│ │ │ -    server().
│ │ │ +    server().
│ │ │  
│ │ │ -client(ServerPids, Request) when is_list(ServerPids) ->
│ │ │ -    ReqId = make_ref(),
│ │ │ -    lists:foreach(fun (ServerPid) ->
│ │ │ -                          _ = monitor(process, ServerPid,
│ │ │ -                                      [{tag, {'DOWN', ReqId}}]),
│ │ │ -                          ServerPid ! {request, self(), ReqId, Request}
│ │ │ +client(ServerPids, Request) when is_list(ServerPids) ->
│ │ │ +    ReqId = make_ref(),
│ │ │ +    lists:foreach(fun (ServerPid) ->
│ │ │ +                          _ = monitor(process, ServerPid,
│ │ │ +                                      [{tag, {'DOWN', ReqId}}]),
│ │ │ +                          ServerPid ! {request, self(), ReqId, Request}
│ │ │                    end,
│ │ │ -                  ServerPids),
│ │ │ -    receive_replies(ReqId, length(ServerPids), []).
│ │ │ +                  ServerPids),
│ │ │ +    receive_replies(ReqId, length(ServerPids), []).
│ │ │  
│ │ │ -receive_replies(_ReqId, 0, Acc) ->
│ │ │ +receive_replies(_ReqId, 0, Acc) ->
│ │ │      Acc;
│ │ │ -receive_replies(ReqId, N, Acc) ->
│ │ │ +receive_replies(ReqId, N, Acc) ->
│ │ │      %% The compiler will detect that we match on the 'ReqId'
│ │ │      %% reference in all clauses, and will enable the selective
│ │ │      %% receive optimization which makes the receive able to
│ │ │      %% skip past all messages present in the message queue at
│ │ │      %% the time when the 'ReqId' reference was created...
│ │ │      Res = receive
│ │ │ -              {reply, ServerPid, ReqId, Result} ->
│ │ │ +              {reply, ServerPid, ReqId, Result} ->
│ │ │                    %% Here we typically would have deactivated the
│ │ │                    %% monitor by a call to demonitor(Mon, [flush]) but
│ │ │                    %% we ignore this in this example for simplicity...
│ │ │ -                  {ok, ServerPid, Result};
│ │ │ -              {{'DOWN', ReqId}, _Mon, process, ServerPid, ExitReason} ->
│ │ │ -                  {error, ServerPid, ExitReason}
│ │ │ +                  {ok, ServerPid, Result};
│ │ │ +              {{'DOWN', ReqId}, _Mon, process, ServerPid, ExitReason} ->
│ │ │ +                  {error, ServerPid, ExitReason}
│ │ │            end,
│ │ │ -    receive_replies(ReqId, N-1, [Res | Acc]).
    In order for this example to work as intended, the client must be executing on
│ │ │ +    receive_replies(ReqId, N-1, [Res | Acc]).
    In order for this example to work as intended, the client must be executing on
│ │ │  at least an OTP 24 system, but the servers may execute on older systems.
    • 
│ │ │    
│ │ │  
│ │ │  
    
│ │ │  
│ │ │    
    
│ │ │      
│ │ │ @@ -13910,15 +13910,15 @@
│ │ │                    (sensitive, Boolean) -> OldBoolean when Boolean :: boolean(), OldBoolean :: boolean();
│ │ │                    ({monitor_nodes, term()}, term()) -> term();
│ │ │                    (monitor_nodes, term()) -> term().
    
│ │ │  
│ │ │        
│ │ │  
│ │ │  
    Sets the process flag indicated to the specified value. Returns the previous value
│ │ │ -of the flag.
    Flag is one of the following:
    • process_flag(async_dist, boolean())
      Enable or disable fully asynchronous distributed signaling for the calling
│ │ │ +of the flag.
      Flag is one of the following:
      • process_flag(async_dist, boolean())
        Enable or disable fully asynchronous distributed signaling for the calling
│ │ │  process. When disabled, which is the default, the process sending a distributed
│ │ │  signal will block in the send operation if the buffer for the distribution
│ │ │  channel reach the distribution buffer busy limit. The
│ │ │  process will remain blocked until the buffer shrinks enough. This might in some
│ │ │  cases take a substantial amount of time. When async_dist is enabled, send
│ │ │  operations of distributed signals will always buffer the signal on the outgoing
│ │ │  distribution channel and then immediately return. That is, these send operations
│ │ │ @@ -13935,22 +13935,22 @@
│ │ │  caller.
        The async_dist flag can also be set on a new process when spawning it using
│ │ │  the spawn_opt() BIF with the option
│ │ │  {async_dist, Enable}. The default
│ │ │  async_dist flag to use on newly spawned processes can be set by passing the
│ │ │  command line argument +pad <boolean> when starting the
│ │ │  runtime system. If the +pad <boolean> command line argument is not passed, the
│ │ │  default value of the async_dist flag will be false.
        You can inspect the state of the async_dist process flag of a process by
│ │ │ -calling process_info(Pid, async_dist).
      • process_flag(trap_exit, boolean())
        When trap_exit is set to true, exit signals arriving to a process are
│ │ │ +calling process_info(Pid, async_dist).
      • process_flag(trap_exit, boolean())
        When trap_exit is set to true, exit signals arriving to a process are
│ │ │  converted to {'EXIT', From, Reason} messages, which can be received as
│ │ │  ordinary messages. If trap_exit is set to false, the process exits if it
│ │ │  receives an exit signal other than normal and the exit signal is propagated to
│ │ │ -its linked processes. Application processes are normally not to trap exits.
        See also exit/2.
      • process_flag(error_handler, module())
        Used by a process to redefine the error_handler for undefined function calls and
│ │ │ +its linked processes. Application processes are normally not to trap exits.
        See also exit/2.
      • process_flag(error_handler, module())
        Used by a process to redefine the error_handler for undefined function calls and
│ │ │  undefined registered processes. Use this flag with substantial caution, as code
│ │ │ -auto-loading depends on the correct operation of the error handling module.
      • process_flag(fullsweep_after,  non_neg_integer())
        Changes the maximum number of generational collections before forcing a
│ │ │ -fullsweep for the calling process.
      • process_flag(min_heap_size, non_neg_integer())
        Changes the minimum heap size for the calling process.
      • process_flag(min_bin_vheap_size, non_neg_integer())
        Changes the minimum binary virtual heap size for the calling process.
      • process_flag(max_heap_size, max_heap_size())
        This flag sets the maximum heap size for the calling process. If MaxHeapSize
│ │ │ +auto-loading depends on the correct operation of the error handling module.
      • process_flag(fullsweep_after,  non_neg_integer())
        Changes the maximum number of generational collections before forcing a
│ │ │ +fullsweep for the calling process.
      • process_flag(min_heap_size, non_neg_integer())
        Changes the minimum heap size for the calling process.
      • process_flag(min_bin_vheap_size, non_neg_integer())
        Changes the minimum binary virtual heap size for the calling process.
      • process_flag(max_heap_size, max_heap_size())
        This flag sets the maximum heap size for the calling process. If MaxHeapSize
│ │ │  is an integer, the system default values for kill and error_logger are used.
        For details on how the heap grows, see
│ │ │  Sizing the heap in the ERTS internal
│ │ │  documentation.
        • size - The maximum size in words of the process. If set to zero, the
│ │ │  heap size limit is disabled. badarg is be thrown if the value is smaller
│ │ │  than min_heap_size. The size check
│ │ │  is only done when a garbage collection is triggered.
          size is the entire heap of the process when garbage collection is triggered.
│ │ │  This includes all generational heaps, the process stack, any
│ │ │ @@ -13978,27 +13978,27 @@
│ │ │  of it is referred by the process.
          If include_shared_binaries is not defined in the map, the system default is
│ │ │  used. The default system default is false. It can be changed by either the
│ │ │  option +hmaxib in erl, or
│ │ │  erlang:system_flag(max_heap_size, MaxHeapSize).
        The heap size of a process is quite hard to predict, especially the amount of
│ │ │  memory that is used during the garbage collection. When contemplating using this
│ │ │  option, it is recommended to first run it in production with kill set to
│ │ │  false and inspect the log events to see what the normal peak sizes of the
│ │ │ -processes in the system is and then tune the value accordingly.
      • process_flag(message_queue_data, message_queue_data())
        Determines how messages in the message queue are stored, as follows:
        • off_heap - All messages in the message queue will be stored outside
│ │ │ +processes in the system is and then tune the value accordingly.
        • process_flag(message_queue_data, message_queue_data())
          Determines how messages in the message queue are stored, as follows:
          • off_heap - All messages in the message queue will be stored outside
│ │ │  the process heap. This implies that no messages in the message queue will be
│ │ │  part of a garbage collection of the process.
          • on_heap - All messages in the message queue will eventually be placed on
│ │ │  the process heap. They can, however, be temporarily stored off the heap. This
│ │ │  is how messages have always been stored up until ERTS 8.0.
          The default value of the message_queue_data process flag is determined by the
│ │ │  command-line argument +hmqd in erl.
          If the process may potentially accumulate a large number of messages in its
│ │ │  queue it is recommended to set the flag value to off_heap. This is due to the
│ │ │  fact that the garbage collection of a process that has a large number of
│ │ │  messages stored on the heap can become extremely expensive and the process can
│ │ │  consume large amounts of memory. The performance of the actual message passing
│ │ │  is, however, generally better when the flag value is on_heap.
          Changing the flag value causes any existing messages to be moved. The move
│ │ │  operation is initiated, but not necessarily completed, by the time the function
│ │ │ -returns.
        • process_flag(priority, priority_level())
          Sets the process priority. Level is an atom. Four priority levels exist:
│ │ │ +returns.
        • process_flag(priority, priority_level())
          Sets the process priority. Level is an atom. Four priority levels exist:
│ │ │  low, normal, high, and max. Default is normal.
          Note
          Priority level max is reserved for internal use in the Erlang runtime
│ │ │  system, and is not to be used by others.
          Internally in each priority level, processes are scheduled in a round robin
│ │ │  fashion.
          Execution of processes on priority normal and low are interleaved. Processes
│ │ │  on priority low are selected for execution less frequently than processes on
│ │ │  priority normal.
          When runnable processes on priority high exist, no processes on priority low
│ │ │  or normal are selected for execution. Notice however that this does not mean
│ │ │  that no processes on priority low or normal can run when processes are
│ │ │ @@ -14019,24 +14019,24 @@
│ │ │  process during the call. Even if this is not the case with one version of the
│ │ │  code that you have no control over, it can be the case in a future version of
│ │ │  it. This can, for example, occur if a high priority process triggers code
│ │ │  loading, as the code server runs on priority normal.
          Other priorities than normal are normally not needed. When other priorities
│ │ │  are used, use them with care, especially priority high. A process on
│ │ │  priority high is only to perform work for short periods. Busy looping for long
│ │ │  periods in a high priority process causes most likely problems, as important
│ │ │ -OTP servers run on priority normal.
        • process_flag(save_calls, 0..10000)
          N must be an integer in the interval 0..10000. If N > 0, call saving is made
│ │ │ +OTP servers run on priority normal.
        • process_flag(save_calls, 0..10000)
          N must be an integer in the interval 0..10000. If N > 0, call saving is made
│ │ │  active for the process. This means that information about the N most recent
│ │ │  global function calls, BIF calls, sends, and receives made by the process are
│ │ │  saved in a list, which can be retrieved with
│ │ │  process_info(Pid, last_calls). A global function call is
│ │ │  one in which the module of the function is explicitly mentioned. Only a fixed
│ │ │  amount of information is saved, as follows:
          • A tuple {Module, Function, Arity} for function calls
          • The atoms send, 'receive', and timeout for sends and receives
│ │ │  ('receive' when a message is received and timeout when a receive times
│ │ │  out)
          If N = 0, call saving is disabled for the process, which is the default.
│ │ │ -Whenever the size of the call saving list is set, its contents are reset.
        • process_flag(sensitive, boolean())
          Sets or clears flag sensitive for the current process. When a process has been
│ │ │ +Whenever the size of the call saving list is set, its contents are reset.
        • process_flag(sensitive, boolean())
          Sets or clears flag sensitive for the current process. When a process has been
│ │ │  marked as sensitive by calling
│ │ │  process_flag(sensitive, true), features in the runtime
│ │ │  system that can be used for examining the data or inner working of the process
│ │ │  are silently disabled.
          Features that are disabled include (but are not limited to) the following:
          • Tracing. Trace flags can still be set for the process, but no trace messages
│ │ │  of any kind are generated. (If flag sensitive is turned off, trace messages
│ │ │  are again generated if any trace flags are set.)
          • Sequential tracing. The sequential trace token is propagated as usual, but no
│ │ │  sequential trace messages are generated.
          process_info/1,2 cannot be used to read out the message queue or the process
│ │ │ @@ -14280,16 +14280,16 @@
│ │ │  
│ │ │        
│ │ │  
│ │ │  
          Returns a list of process identifiers corresponding to all the processes
│ │ │  currently existing on the local node.
          Notice that an exiting process exists, but is not alive. That is,
│ │ │  is_process_alive/1 returns false for an exiting
│ │ │  process, but its process identifier is part of the result returned from
│ │ │ -processes/0.
          Example:
          > processes().
│ │ │ -[<0.0.0>,<0.2.0>,<0.4.0>,<0.5.0>,<0.7.0>,<0.8.0>]
          
│ │ │ +processes/0.
          Example:
          > processes().
│ │ │ +[<0.0.0>,<0.2.0>,<0.4.0>,<0.5.0>,<0.7.0>,<0.8.0>]
          
│ │ │    
│ │ │  
│ │ │  
          
│ │ │  
│ │ │    
          
│ │ │      
│ │ │        
│ │ │ @@ -14313,18 +14313,18 @@
│ │ │  
│ │ │        
          
│ │ │  
│ │ │  
          Adds a new Key to the process dictionary, associated with the value Val, and
│ │ │  returns undefined. If Key exists, the old value is deleted and replaced by
│ │ │  Val, and the function returns the old value.
          The average time complexity for the current implementation of this function is
│ │ │  O(1) and the worst case time complexity is O(N), where N is the number of
│ │ │ -items in the process dictionary.
          For example:
          > X = put(name, walrus), Y = put(name, carpenter),
│ │ │ -Z = get(name),
│ │ │ -{X, Y, Z}.
│ │ │ -{undefined,walrus,carpenter}
          Note
          The values stored when put is evaluated within the scope of a catch are
│ │ │ +items in the process dictionary.
          For example:
          > X = put(name, walrus), Y = put(name, carpenter),
│ │ │ +Z = get(name),
│ │ │ +{X, Y, Z}.
│ │ │ +{undefined,walrus,carpenter}
          Note
          The values stored when put is evaluated within the scope of a catch are
│ │ │  not retracted if a throw is evaluated, or if an error occurs.
          
│ │ │    
          
│ │ │  
          
│ │ │  
          
│ │ │  
│ │ │    
          
│ │ │      
│ │ │ @@ -14395,15 +14395,15 @@
│ │ │        
          
│ │ │  
│ │ │  
          Registers the name RegName with a process identifier (pid) or a port
│ │ │  identifier in the
│ │ │  name registry.
│ │ │  RegName, which must be an atom, can be used instead of the pid or port
│ │ │  identifier in send operator (RegName ! Message) and most other BIFs that take
│ │ │ -a pid or port identifies as an argument.
          For example:
          > register(db, Pid).
│ │ │ +a pid or port identifies as an argument.
          For example:
          > register(db, Pid).
│ │ │  true
          The registered name is considered a
│ │ │  Directly Visible Erlang Resource
│ │ │  and is automatically unregistered when the process terminates.
          Failures:
          • badarg - If PidOrPort is not an existing local process or port.
          • badarg - If RegName is already in use.
          • badarg - If the process or port is already registered (already has a
│ │ │  name).
          • badarg - If RegName is the atom undefined.
          
│ │ │    
          
│ │ │  
│ │ │  
          
│ │ │ @@ -14427,16 +14427,16 @@
│ │ │  
│ │ │        
          
│ │ │  
│ │ │            
          -spec registered() -> [RegName] when RegName :: atom().
          
│ │ │  
│ │ │        
          
│ │ │  
│ │ │ -
          Returns a list of names that have been registered using register/2.
          For example:
          > registered().
│ │ │ -[code_server, file_server, init, user, my_db]
          
│ │ │ +
          Returns a list of names that have been registered using register/2.
          For example:
          > registered().
│ │ │ +[code_server, file_server, init, user, my_db]
          
│ │ │    
          
│ │ │  
│ │ │  
          
│ │ │  
│ │ │    
          
│ │ │      
│ │ │        
│ │ │ @@ -14491,15 +14491,15 @@
│ │ │  
│ │ │        
          
│ │ │  
│ │ │            
          -spec self() -> pid().
          
│ │ │  
│ │ │        
          
│ │ │  
│ │ │ -
          Returns the process identifier of the calling process.
          For example:
          > self().
│ │ │ +
          Returns the process identifier of the calling process.
          For example:
          > self().
│ │ │  <0.26.0>
          
│ │ │    
          
│ │ │  
│ │ │  
          
│ │ │  
│ │ │    
          
│ │ │      
│ │ │ @@ -14741,15 +14741,15 @@
│ │ │  
          Returns the process identifier of a new process started by the application of
│ │ │  Module:Function to Args.
          error_handler:undefined_function(Module, Function, Args) is
│ │ │   evaluated by the new process if Module:Function/Arity does not exist
│ │ │  (where Arity is the length of Args). The error handler can be redefined
│ │ │  (see process_flag/2). If
│ │ │  error_handler is undefined, or the user has redefined the default
│ │ │  error_handler and its replacement is undefined, a failure with reason undef
│ │ │ -occurs.
          Example:
          > spawn(speed, regulator, [high_speed, thin_cut]).
│ │ │ +occurs.
          Example:
          > spawn(speed, regulator, [high_speed, thin_cut]).
│ │ │  <0.13.1>
          
│ │ │    
          
│ │ │  
│ │ │  
          
│ │ │  
│ │ │    
          
│ │ │      
│ │ │ @@ -15689,22 +15689,22 @@
│ │ │  
│ │ │            
          -spec throw(Any) -> no_return() when Any :: term().
          
│ │ │  
│ │ │        
          
│ │ │  
│ │ │  
          Raises an exception of class throw. Intended to be used to do non-local
│ │ │  returns from functions.
          If evaluated within a catch expression, the
│ │ │ -catch expression returns value Any.
          For example:
          > catch throw({hello, there}).
│ │ │ -        {hello,there}
          If evaluated within a try-block of a
│ │ │ +catch expression returns value Any.
          For example:
          > catch throw({hello, there}).
│ │ │ +        {hello,there}
          If evaluated within a try-block of a
│ │ │  try expression, the value Any can be caught
│ │ │  within the catch block.
          For example:
          try
│ │ │ -    throw({my_exception, "Something happened"})
│ │ │ +    throw({my_exception, "Something happened"})
│ │ │  catch
│ │ │ -    throw:{my_exception, Desc} ->
│ │ │ -        io:format(standard_error, "Error: ~s~n", [Desc])
│ │ │ +    throw:{my_exception, Desc} ->
│ │ │ +        io:format(standard_error, "Error: ~s~n", [Desc])
│ │ │  end
          Failure: nocatch if not caught by an exception handler.
          See the guide about errors and error handling for
│ │ │  additional information.
          
│ │ │    
          
│ │ │  
│ │ │  
          
│ │ │  
│ │ │    
          
│ │ │ @@ -15774,17 +15774,17 @@
│ │ │  trapping exits, an
│ │ │  {'EXIT', Id, ExitReason} message due to the link may have been placed in the
│ │ │  message queue of the caller before the unlink(Id) call
│ │ │  completed. Also note that the {'EXIT', Id, ExitReason} message may be the
│ │ │  result of the link, but may also be the result of the unlikee sending the caller
│ │ │  an exit signal by calling the exit/2 BIF. Therefore, it may or may not be
│ │ │  appropriate to clean up the message queue after a call to
│ │ │ -unlink(Id) as follows, when trapping exits:
          unlink(Id),
│ │ │ +unlink(Id) as follows, when trapping exits:
          unlink(Id),
│ │ │  receive
│ │ │ -    {'EXIT', Id, _} ->
│ │ │ +    {'EXIT', Id, _} ->
│ │ │          true
│ │ │  after 0 ->
│ │ │          true
│ │ │  end
          The link removal is performed asynchronously. If such a link does not exist,
│ │ │  nothing is done. A detailed description of the
│ │ │  link protocol can be found in the
│ │ │  Distribution Protocol chapter of the ERTS User's Guide.
          Note
          For some important information about distributed signals, see the
│ │ │ @@ -15815,15 +15815,15 @@
│ │ │  
│ │ │            
          -spec unregister(RegName) -> true when RegName :: atom().
          
│ │ │  
│ │ │        
          
│ │ │  
│ │ │  
          Removes the registered name RegName associated with a
│ │ │  process identifier or a port identifier from the
│ │ │ -name registry.
          For example:
          > unregister(db).
│ │ │ +name registry.
          For example:
          > unregister(db).
│ │ │  true
          Keep in mind that you can still receive signals associated with the registered
│ │ │  name after it has been unregistered as the sender may have looked up the name
│ │ │  before sending to it.
          Users are advised not to unregister system processes.
          Failure: badarg if RegName is not a registered name.
          
│ │ │    
          
│ │ │  
│ │ │  
          
│ │ │  
│ │ │ @@ -15849,15 +15849,15 @@
│ │ │            
          -spec whereis(RegName) -> pid() | port() | undefined when RegName :: atom().
          
│ │ │  
│ │ │        
│ │ │  
│ │ │  
          Returns the process identifier or port identifier with the
│ │ │  registered name RegName from the
│ │ │  name registry. Returns
│ │ │ -undefined if the name is not registered.
          For example:
          > whereis(db).
│ │ │ +undefined if the name is not registered.
          For example:
          > whereis(db).
│ │ │  <0.43.0>
          
│ │ │    
          
│ │ │  
│ │ │  
          
│ │ │  
│ │ │    
          
│ │ │      
│ │ │ @@ -15924,15 +15924,15 @@
│ │ │  
│ │ │        
          
│ │ │  
│ │ │            
          -spec halt() -> no_return().
          
│ │ │  
│ │ │        
          
│ │ │  
│ │ │ -
          Equivalent to calling halt(0, []).
          For example:
          > halt().
│ │ │ +
          Equivalent to calling halt(0, []).
          For example:
          > halt().
│ │ │  os_prompt%
          
│ │ │    
          
│ │ │  
│ │ │  
          
│ │ │  
│ │ │    
          
│ │ │      
│ │ │ @@ -15955,15 +15955,15 @@
│ │ │  
│ │ │            
          -spec halt(Status :: non_neg_integer()) -> no_return();
│ │ │            (Abort :: abort) -> no_return();
│ │ │            (CrashDumpSlogan :: string()) -> no_return().
          
│ │ │  
│ │ │        
          
│ │ │  
│ │ │ -
          Equivalent to calling halt(HaltType, []).
          For example:
          > halt(17).
│ │ │ +
          Equivalent to calling halt(HaltType, []).
          For example:
          > halt(17).
│ │ │  os_prompt% echo $?
│ │ │  17
│ │ │  os_prompt%
          
│ │ │    
          
│ │ │  
│ │ │  
          
│ │ │  
│ │ │ @@ -15990,15 +15990,15 @@
│ │ │  
│ │ │            
          -spec halt(Status :: non_neg_integer(), Options :: halt_options()) -> no_return();
│ │ │            (Abort :: abort, Options :: halt_options()) -> no_return();
│ │ │            (CrashDumpSlogan :: string(), Options :: halt_options()) -> no_return().
          
│ │ │  
│ │ │        
│ │ │  
│ │ │ -
          Halt the runtime system.
          • halt(Status :: non_neg_integer(), Options :: halt_options())
            Halt the runtime system with status code Status.
            Note
            On many platforms, the OS supports only status codes 0-255. A too large
│ │ │ +
            Halt the runtime system.
            • halt(Status :: non_neg_integer(), Options :: halt_options())
              Halt the runtime system with status code Status.
              Note
              On many platforms, the OS supports only status codes 0-255. A too large
│ │ │  status code is truncated by clearing the high bits.
              Currently the following options are valid:
              • {flush, EnableFlushing} - If EnableFlushing equals
│ │ │  true, which also is the default behavior, the runtime system will perform
│ │ │  the following operations before terminating:
                • Flush all outstanding output.
                • Send all Erlang ports exit signals and wait for them to exit.
                • Wait for all async threads to complete all outstanding async jobs.
                • Call all installed NIF on halt callbacks.
                • Wait for all ongoing
│ │ │  NIF calls with the delay halt setting enabled
│ │ │  to return.
                • Call all installed atexit/on_exit callbacks.
                If EnableFlushing equals false, the runtime system will terminate
│ │ │  immediately without performing any of the above listed operations.
                Change
                Runtime systems prior to OTP 26.0 called all installed atexit/on_exit
│ │ │  callbacks also when flush was disabled, but as of OTP 26.0 this is no
│ │ │ @@ -16007,18 +16007,18 @@
│ │ │  termination of the runtime system. Timeout is in milliseconds. The default
│ │ │  value is determined by the the erl +zhft <Timeout>
│ │ │  command line flag.
                If flushing has been ongoing for Timeout milliseconds, flushing operations
│ │ │  will be interrupted and the runtime system will immediately be terminated
│ │ │  with the exit code 255. If flushing is not enabled, the timeout will have
│ │ │  no effect on the system.
                See also the erl +zhft <Timeout> command line flag.
│ │ │  Note that the shortest timeout set by the command line flag and the
│ │ │ -flush_timeout option will be the actual timeout value in effect.
                Since: OTP 27.0
            • halt(Abort :: abort, Options :: halt_options())
              Halt the Erlang runtime system by aborting and produce a core dump if core
│ │ │ +flush_timeout option will be the actual timeout value in effect.
              Since: OTP 27.0
          • halt(Abort :: abort, Options :: halt_options())
            Halt the Erlang runtime system by aborting and produce a core dump if core
│ │ │  dumping has been enabled in the environment that the runtime system is
│ │ │  executing in.
            Note
            The {flush, boolean()} option will be ignored, and
│ │ │ -flushing will be disabled.
          • halt(CrashDumpSlogan :: string(), Options :: halt_options())
            Halt the Erlang runtime system and generate an
│ │ │ +flushing will be disabled.
        • halt(CrashDumpSlogan :: string(), Options :: halt_options())
          Halt the Erlang runtime system and generate an
│ │ │  Erlang crash dump. The string CrashDumpSlogan will be used
│ │ │  as slogan in the Erlang crash dump created. The slogan will be trunkated if
│ │ │  CrashDumpSlogan is longer than 1023 characters.
          Note
          The {flush, boolean()} option will be ignored, and
│ │ │  flushing will be disabled.
          Change
          Behavior changes compared to earlier versions:
          • Before OTP 24.2, the slogan was truncated if CrashDumpSlogan was longer
│ │ │  than 200 characters. Now it will be truncated if longer than 1023
│ │ │  characters.
          • Before OTP 20.1, only code points in the range 0-255 were accepted in the
│ │ │  slogan. Now any Unicode string is valid.
        
│ │ │ @@ -16195,19 +16195,19 @@
│ │ │                  (wall_clock) -> {Total_Wallclock_Time, Wallclock_Time_Since_Last_Call}
│ │ │                      when
│ │ │                          Total_Wallclock_Time :: non_neg_integer(),
│ │ │                          Wallclock_Time_Since_Last_Call :: non_neg_integer().
    
│ │ │  
│ │ │        
│ │ │  
│ │ │ -
    Returns statistics about the current system.
    The possible flags are:
    • statistics(active_tasks) -> [non_neg_integer()]
      Returns the same as
│ │ │ +
      Returns statistics about the current system.
      The possible flags are:
      • statistics(active_tasks) -> [non_neg_integer()]
        Returns the same as
│ │ │  statistics(active_tasks_all) with
│ │ │  the exception that no information about the dirty IO run queue and its
│ │ │  associated schedulers is part of the result. That is, only tasks that are
│ │ │ -expected to be CPU bound are part of the result.
        Available since OTP 18.3
      • statistics(active_tasks_all) -> [non_neg_integer()]
        Returns a list where each element represents the amount of active processes and
│ │ │ +expected to be CPU bound are part of the result.
        Available since OTP 18.3
      • statistics(active_tasks_all) -> [non_neg_integer()]
        Returns a list where each element represents the amount of active processes and
│ │ │  ports on each run queue and its associated schedulers. That is, the number of
│ │ │  processes and ports that are ready to run, or are currently running. Values for
│ │ │  normal run queues and their associated schedulers are located first in the
│ │ │  resulting list. The first element corresponds to scheduler number 1 and so on.
│ │ │  If support for dirty schedulers exist, an element with the value for the dirty
│ │ │  CPU run queue and its associated dirty CPU schedulers follow and then as last
│ │ │  element the value for the dirty IO run queue and its associated dirty IO
│ │ │ @@ -16221,44 +16221,44 @@
│ │ │  migrate to other normal run queues. This has to be taken into account when
│ │ │  evaluating the result.
        See also
│ │ │  statistics(total_active_tasks),
│ │ │  statistics(run_queue_lengths),
│ │ │  statistics(run_queue_lengths_all),
│ │ │  statistics(total_run_queue_lengths),
│ │ │  and
│ │ │ -statistics(total_run_queue_lengths_all).
        Available since OTP 20.0
      • statistics(context_switches) -> {non_neg_integer(), 0}
        Returns the total number of context switches since the system started.
      • statistics(exact_reductions) -> {Total :: non_neg_integer(), SinceLastCall :: non_neg_integer()}
        Returns the number of exact reductions.
        Note
        statistics(exact_reductions) is a more expensive operation
│ │ │ -than statistics(reductions).
      • statistics(garbage_collection) ->
│ │ │ -  { NumerOfGCs :: non_neg_integer(), WordsReclaimed :: non_neg_integer(), 0}
        Returns information about garbage collection, for example:
        > statistics(garbage_collection).
│ │ │ -{85,23961,0}
        This information can be invalid for some implementations.
      • statistics(io) -> {{input, non_neg_integer()}, {output, non_neg_integer()}}
        Returns Input, which is the total number of bytes received through ports, and
│ │ │ -Output, which is the total number of bytes output to ports.
      • statistics(microstate_accounting) -> [MSAcc_Thread]
        Microstate accounting can be used to measure how much time the Erlang runtime
│ │ │ +statistics(total_run_queue_lengths_all).
        Available since OTP 20.0
      • statistics(context_switches) -> {non_neg_integer(), 0}
        Returns the total number of context switches since the system started.
      • statistics(exact_reductions) -> {Total :: non_neg_integer(), SinceLastCall :: non_neg_integer()}
        Returns the number of exact reductions.
        Note
        statistics(exact_reductions) is a more expensive operation
│ │ │ +than statistics(reductions).
      • statistics(garbage_collection) ->
│ │ │ +  { NumerOfGCs :: non_neg_integer(), WordsReclaimed :: non_neg_integer(), 0}
        Returns information about garbage collection, for example:
        > statistics(garbage_collection).
│ │ │ +{85,23961,0}
        This information can be invalid for some implementations.
      • statistics(io) -> {{input, non_neg_integer()}, {output, non_neg_integer()}}
        Returns Input, which is the total number of bytes received through ports, and
│ │ │ +Output, which is the total number of bytes output to ports.
      • statistics(microstate_accounting) -> [MSAcc_Thread]
        Microstate accounting can be used to measure how much time the Erlang runtime
│ │ │  system spends doing various tasks. It is designed to be as lightweight as
│ │ │  possible, but some overhead exists when this is enabled. Microstate accounting
│ │ │  is meant to be a profiling tool to help finding performance bottlenecks. To
│ │ │  start/stop/reset microstate accounting, use system flag
│ │ │  microstate_accounting.
        statistics(microstate_accounting) returns a list of maps
│ │ │  representing some of the OS threads within ERTS. Each map contains type and
│ │ │  id fields that can be used to identify what thread it is, and also a counters
│ │ │  field that contains data about how much time has been spent in the various
│ │ │ -states.
        Example:
        > erlang:statistics(microstate_accounting).
│ │ │ -[#{counters => #{aux => 1899182914,
│ │ │ +states.
        Example:
        > erlang:statistics(microstate_accounting).
│ │ │ +[#{counters => #{aux => 1899182914,
│ │ │                   check_io => 2605863602,
│ │ │                   emulator => 45731880463,
│ │ │                   gc => 1512206910,
│ │ │                   other => 5421338456,
│ │ │                   port => 221631,
│ │ │ -                 sleep => 5150294100},
│ │ │ +                 sleep => 5150294100},
│ │ │     id => 1,
│ │ │ -   type => scheduler}|...]
        The time unit is the same as returned by os:perf_counter/0. So, to convert it
│ │ │ -to milliseconds, you can do something like this:
        lists:map(
│ │ │ -  fun(#{ counters := Cnt } = M) ->
│ │ │ -         MsCnt = maps:map(fun(_K, PerfCount) ->
│ │ │ -                                    erlang:convert_time_unit(PerfCount, perf_counter, 1000)
│ │ │ -                           end, Cnt),
│ │ │ -         M#{ counters := MsCnt }
│ │ │ -  end, erlang:statistics(microstate_accounting)).
        Notice that these values are not guaranteed to be the exact time spent in each
│ │ │ +   type => scheduler}|...]
        The time unit is the same as returned by os:perf_counter/0. So, to convert it
│ │ │ +to milliseconds, you can do something like this:
        lists:map(
│ │ │ +  fun(#{ counters := Cnt } = M) ->
│ │ │ +         MsCnt = maps:map(fun(_K, PerfCount) ->
│ │ │ +                                    erlang:convert_time_unit(PerfCount, perf_counter, 1000)
│ │ │ +                           end, Cnt),
│ │ │ +         M#{ counters := MsCnt }
│ │ │ +  end, erlang:statistics(microstate_accounting)).
        Notice that these values are not guaranteed to be the exact time spent in each
│ │ │  state. This is because of various optimisation done to keep the overhead as
│ │ │  small as possible.
        MSAcc_Thread_Types:
        • scheduler - The main execution threads that do most of the work. See
│ │ │  erl +S for more details.
        • dirty_cpu_scheduler - The threads for long running cpu intensive work.
│ │ │  See erl +SDcpu for more details.
        • dirty_io_scheduler - The threads for long running I/O work. See
│ │ │  erl +SDio for more details.
        • async - Async threads are used by various linked-in drivers (mainly the
│ │ │  file drivers) do offload non-CPU intensive work. See
│ │ │  erl +A for more details.
        • aux - Takes care of any work that is not specifically assigned to a
│ │ │ @@ -16282,28 +16282,28 @@
│ │ │  states this time is part of the gc state.
        • nif - Time spent in NIFs. Without extra states this time is part of the
│ │ │  emulator state.
        • send - Time spent sending messages (processes only). Without extra
│ │ │  states this time is part of the emulator state.
        • timers - Time spent managing timers. Without extra states this time is
│ │ │  part of the other state.
        The utility module msacc can be used to more easily analyse these
│ │ │  statistics.
        Returns undefined if system flag
│ │ │  microstate_accounting is
│ │ │  turned off.
        The list of thread information is unsorted and can appear in different order
│ │ │ -between calls.
        Note
        The threads and states are subject to change without any prior notice.
        Available since OTP 19.0
      • statistics(reductions) -> {Reductions :: non_neg_integer(), SinceLastCall :: non_neg_integer()}
        Returns information about reductions, for example:
        > statistics(reductions).
│ │ │ -{2046,11}
        Change
        As from ERTS 5.5 (Erlang/OTP R11B), this value does not include reductions
│ │ │ +between calls.
        Note
        The threads and states are subject to change without any prior notice.
        Available since OTP 19.0
      • statistics(reductions) -> {Reductions :: non_neg_integer(), SinceLastCall :: non_neg_integer()}
        Returns information about reductions, for example:
        > statistics(reductions).
│ │ │ +{2046,11}
        Change
        As from ERTS 5.5 (Erlang/OTP R11B), this value does not include reductions
│ │ │  performed in current time slices of currently scheduled processes. If an exact
│ │ │  value is wanted, use
│ │ │ -statistics(exact_reductions).
      • statistics(run_queue) -> non_neg_integer()
        Returns the total length of all normal and dirty CPU run queues. That is, queued
│ │ │ +statistics(exact_reductions).
      • statistics(run_queue) -> non_neg_integer()
        Returns the total length of all normal and dirty CPU run queues. That is, queued
│ │ │  work that is expected to be CPU bound. The information is gathered atomically.
│ │ │  That is, the result is a consistent snapshot of the state, but this operation is
│ │ │  much more expensive compared to
│ │ │  statistics(total_run_queue_lengths),
│ │ │ -especially when a large amount of schedulers is used.
      • statistics(run_queue_lengths) -> [non_neg_integer()]
        Returns the same as
│ │ │ +especially when a large amount of schedulers is used.
      • statistics(run_queue_lengths) -> [non_neg_integer()]
        Returns the same as
│ │ │  statistics(run_queue_lengths_all)
│ │ │  with the exception that no information about the dirty IO run queue is part of
│ │ │  the result. That is, only run queues with work that is expected to be CPU bound
│ │ │ -is part of the result.
        Available since OTP 18.3
      • statistics(run_queue_lengths_all) -> [non_neg_integer()]
        Returns a list where each element represents the amount of processes and ports
│ │ │ +is part of the result.
        Available since OTP 18.3
      • statistics(run_queue_lengths_all) -> [non_neg_integer()]
        Returns a list where each element represents the amount of processes and ports
│ │ │  ready to run for each run queue. Values for normal run queues are located first
│ │ │  in the resulting list. The first element corresponds to the normal run queue of
│ │ │  scheduler number 1 and so on. If support for dirty schedulers exist, values for
│ │ │  the dirty CPU run queue and the dirty IO run queue follow (in that order) at the
│ │ │  end. The information is not gathered atomically. That is, the result is not
│ │ │  necessarily a consistent snapshot of the state, but instead quite efficiently
│ │ │  gathered.
        Note
        Each normal scheduler has one run queue that it manages. If dirty schedulers
│ │ │ @@ -16315,21 +16315,21 @@
│ │ │  evaluating the result.
        See also
│ │ │  statistics(run_queue_lengths),
│ │ │  statistics(total_run_queue_lengths_all),
│ │ │  statistics(total_run_queue_lengths),
│ │ │  statistics(active_tasks),
│ │ │  statistics(active_tasks_all), and
│ │ │  statistics(total_active_tasks),
│ │ │ -statistics(total_active_tasks_all).
        Available since OTP 20.0
      • statistics(runtime) -> {Total :: non_neg_integer(), SinceLastCall :: non_neg_integer()}
        Returns information about runtime, in milliseconds.
        This is the sum of the runtime for all threads in the Erlang runtime system and
│ │ │ +statistics(total_active_tasks_all).
        Available since OTP 20.0
      • statistics(runtime) -> {Total :: non_neg_integer(), SinceLastCall :: non_neg_integer()}
        Returns information about runtime, in milliseconds.
        This is the sum of the runtime for all threads in the Erlang runtime system and
│ │ │  can therefore be greater than the wall clock time.
        Warning
        This value might wrap due to limitations in the underlying functionality
│ │ │ -provided by the operating system that is used.
        Example:
        > statistics(runtime).
│ │ │ -{1690,1620}
      • statistics(scheduler_wall_time) ->
│ │ │ -  [{Id :: pos_integer,
│ │ │ -    ActiveTime :: non_neg_integer(),
│ │ │ -    TotalTime :: non_neg_integer()}] |
│ │ │ +provided by the operating system that is used.
        Example:
        > statistics(runtime).
│ │ │ +{1690,1620}
      • statistics(scheduler_wall_time) ->
│ │ │ +  [{Id :: pos_integer,
│ │ │ +    ActiveTime :: non_neg_integer(),
│ │ │ +    TotalTime :: non_neg_integer()}] |
│ │ │    undefined
        Returns information describing how much time
│ │ │  normal and
│ │ │  dirty CPU schedulers in the
│ │ │  system have been busy. This value is normally a better indicator of how much
│ │ │  load an Erlang node is under instead of looking at the CPU utilization provided
│ │ │  by tools such as top or sysstat. This is because scheduler_wall_time also
│ │ │  includes time where the scheduler is waiting for some other reasource (such as
│ │ │ @@ -16361,60 +16361,60 @@
│ │ │  Dirty CPU schedulers will have scheduler identifiers in the range
│ │ │  erlang:system_info(schedulers) < SchedulerId =< erlang:system_info(schedulers) +erlang:system_info(dirty_cpu_schedulers).
        Note
        The different types of schedulers handle specific types of jobs. Every job is
│ │ │  assigned to a specific scheduler type. Jobs can migrate between different
│ │ │  schedulers of the same type, but never between schedulers of different types.
│ │ │  This fact has to be taken under consideration when evaluating the result
│ │ │  returned.
        You can use scheduler_wall_time to calculate scheduler utilization. First you
│ │ │  take a sample of the values returned by
│ │ │ -erlang:statistics(scheduler_wall_time).
        > erlang:system_flag(scheduler_wall_time, true).
│ │ │ +erlang:statistics(scheduler_wall_time).
        > erlang:system_flag(scheduler_wall_time, true).
│ │ │  false
│ │ │ -> Ts0 = lists:sort(erlang:statistics(scheduler_wall_time)), ok.
│ │ │ +> Ts0 = lists:sort(erlang:statistics(scheduler_wall_time)), ok.
│ │ │  ok
        Some time later the user takes another snapshot and calculates scheduler
│ │ │ -utilization per scheduler, for example:
        > Ts1 = lists:sort(erlang:statistics(scheduler_wall_time)), ok.
│ │ │ +utilization per scheduler, for example:
        > Ts1 = lists:sort(erlang:statistics(scheduler_wall_time)), ok.
│ │ │  ok
│ │ │ -> lists:map(fun({{I, A0, T0}, {I, A1, T1}}) ->
│ │ │ -        {I, (A1 - A0)/(T1 - T0)} end, lists:zip(Ts0,Ts1)).
│ │ │ -[{1,0.9743474730177548},
│ │ │ - {2,0.9744843782751444},
│ │ │ - {3,0.9995902361669045},
│ │ │ - {4,0.9738012596572161},
│ │ │ - {5,0.9717956667018103},
│ │ │ - {6,0.9739235846420741},
│ │ │ - {7,0.973237033077876},
│ │ │ - {8,0.9741297293248656}]
        Using the same snapshots to calculate a total scheduler utilization:
        > {A, T} = lists:foldl(fun({{_, A0, T0}, {_, A1, T1}}, {Ai,Ti}) ->
│ │ │ -        {Ai + (A1 - A0), Ti + (T1 - T0)} end, {0, 0}, lists:zip(Ts0,Ts1)),
│ │ │ +> lists:map(fun({{I, A0, T0}, {I, A1, T1}}) ->
│ │ │ +        {I, (A1 - A0)/(T1 - T0)} end, lists:zip(Ts0,Ts1)).
│ │ │ +[{1,0.9743474730177548},
│ │ │ + {2,0.9744843782751444},
│ │ │ + {3,0.9995902361669045},
│ │ │ + {4,0.9738012596572161},
│ │ │ + {5,0.9717956667018103},
│ │ │ + {6,0.9739235846420741},
│ │ │ + {7,0.973237033077876},
│ │ │ + {8,0.9741297293248656}]
        Using the same snapshots to calculate a total scheduler utilization:
        > {A, T} = lists:foldl(fun({{_, A0, T0}, {_, A1, T1}}, {Ai,Ti}) ->
│ │ │ +        {Ai + (A1 - A0), Ti + (T1 - T0)} end, {0, 0}, lists:zip(Ts0,Ts1)),
│ │ │    TotalSchedulerUtilization = A/T.
│ │ │  0.9769136803764825
        Total scheduler utilization will equal 1.0 when all schedulers have been
│ │ │  active all the time between the two measurements.
        Another (probably more) useful value is to calculate total scheduler utilization
│ │ │ -weighted against maximum amount of available CPU time:
        > WeightedSchedulerUtilization = (TotalSchedulerUtilization
│ │ │ -                                  * (erlang:system_info(schedulers)
│ │ │ -                                     + erlang:system_info(dirty_cpu_schedulers)))
│ │ │ -                                 / erlang:system_info(logical_processors_available).
│ │ │ +weighted against maximum amount of available CPU time:
        > WeightedSchedulerUtilization = (TotalSchedulerUtilization
│ │ │ +                                  * (erlang:system_info(schedulers)
│ │ │ +                                     + erlang:system_info(dirty_cpu_schedulers)))
│ │ │ +                                 / erlang:system_info(logical_processors_available).
│ │ │  0.9769136803764825
        This weighted scheduler utilization will reach 1.0 when schedulers are active
│ │ │  the same amount of time as maximum available CPU time. If more schedulers exist
│ │ │  than available logical processors, this value may be greater than 1.0.
        As of ERTS version 9.0, the Erlang runtime system will as default have more
│ │ │  schedulers than logical processors. This due to the dirty schedulers.
        Note
        scheduler_wall_time is by default disabled. To enable it, use
│ │ │ -erlang:system_flag(scheduler_wall_time, true).
        Available since OTP R15B01
      • statistics(scheduler_wall_time_all) ->
│ │ │ -  [