summaryrefslogtreecommitdiff
path: root/gemfeed
diff options
context:
space:
mode:
Diffstat (limited to 'gemfeed')
-rw-r--r--gemfeed/2008-06-26-perl-poetry.html10
-rw-r--r--gemfeed/2008-12-29-using-my-nokia-n95-for-fixing-my-mta.html2
-rw-r--r--gemfeed/2010-04-09-standard-ml-and-haskell.html14
-rw-r--r--gemfeed/2010-05-07-lazy-evaluation-with-standarn-ml.html6
-rw-r--r--gemfeed/2010-05-09-the-fype-programming-language.html50
-rw-r--r--gemfeed/2011-05-07-perl-daemon-service-framework.html20
-rw-r--r--gemfeed/2014-03-24-the-fibonacci.pl.c-polyglot.html8
-rw-r--r--gemfeed/2015-12-05-run-debian-on-your-phone-with-debroid.html18
-rw-r--r--gemfeed/2016-04-03-offsite-backup-with-zfs.html10
-rw-r--r--gemfeed/2016-04-09-jails-and-zfs-on-freebsd-with-puppet.html10
-rw-r--r--gemfeed/2016-04-16-offsite-backup-with-zfs-part2.html2
-rw-r--r--gemfeed/2016-05-22-spinning-up-my-own-authoritative-dns-servers.html16
-rw-r--r--gemfeed/2016-11-20-object-oriented-programming-with-ansi-c.html10
-rw-r--r--gemfeed/2018-06-01-realistic-load-testing-with-ioriot-for-linux.html28
-rw-r--r--gemfeed/2021-04-22-dtail-the-distributed-log-tail-program.html20
-rw-r--r--gemfeed/2021-04-24-welcome-to-the-geminispace.html16
-rw-r--r--gemfeed/2021-05-16-personal-bash-coding-style-guide.html36
-rw-r--r--gemfeed/2021-06-05-gemtexter-one-bash-script-to-rule-it-all.html26
-rw-r--r--gemfeed/2021-07-04-the-well-grounded-rubyist.html22
-rw-r--r--gemfeed/2021-08-01-on-being-pedantic-about-open-source.html30
-rw-r--r--gemfeed/2021-09-12-keep-it-simple-and-stupid.html28
-rw-r--r--gemfeed/2021-10-22-defensive-devops.html18
-rw-r--r--gemfeed/2021-11-29-bash-golf-part-1.html18
-rw-r--r--gemfeed/2021-12-26-how-to-stay-sane-as-a-devops-person.html30
-rw-r--r--gemfeed/2022-01-01-bash-golf-part-2.html16
-rw-r--r--gemfeed/2022-01-23-welcome-to-the-foo.zone.html8
-rw-r--r--gemfeed/2022-02-04-computer-operating-systems-i-use.html42
-rw-r--r--gemfeed/2022-03-06-the-release-of-dtail-4.0.0.html28
-rw-r--r--gemfeed/2022-04-10-creative-universe.html22
-rw-r--r--gemfeed/2022-05-27-perl-is-still-a-great-choice.html12
-rw-r--r--gemfeed/2022-06-15-sweating-the-small-stuff.html44
-rw-r--r--gemfeed/2022-07-30-lets-encrypt-with-openbsd-and-rex.html26
-rw-r--r--gemfeed/2022-08-27-gemtexter-1.1.0-lets-gemtext-again.html20
-rw-r--r--gemfeed/2022-09-30-after-a-bad-nights-sleep.html32
-rw-r--r--gemfeed/2022-10-30-installing-dtail-on-openbsd.html22
-rw-r--r--gemfeed/2022-11-24-i-tried-emacs-but-i-switched-back-to-neovim.html16
-rw-r--r--gemfeed/2022-12-24-ultrarelearning-java-my-takeaways.html24
-rw-r--r--gemfeed/2023-01-23-why-grapheneos-rox.html18
-rw-r--r--gemfeed/2023-02-26-how-to-shut-down-after-work.html16
-rw-r--r--gemfeed/2023-03-16-the-pragmatic-programmer-book-notes.html8
-rw-r--r--gemfeed/2023-03-25-gemtexter-2.0.0-lets-gemtext-again-2.html14
-rw-r--r--gemfeed/2023-04-01-never-split-the-difference-book-notes.html24
-rw-r--r--gemfeed/2023-04-09-algorithms-and-data-structures-in-golang-part-1.html12
-rw-r--r--gemfeed/2023-05-01-unveiling-guprecords:-uptime-records-with-raku.html10
-rw-r--r--gemfeed/2023-05-06-the-obstacle-is-the-way-book-notes.html26
-rw-r--r--gemfeed/2023-06-01-kiss-server-monitoring-with-gogios.html30
-rw-r--r--gemfeed/2023-07-17-career-guide-and-soft-skills-book-notes.html58
-rw-r--r--gemfeed/2023-07-21-gemtexter-2.1.0-lets-gemtext-again-3.html16
-rw-r--r--gemfeed/2023-08-18-site-reliability-engineering-part-1.html4
-rw-r--r--gemfeed/2023-09-25-dtail-usage-examples.html20
-rw-r--r--gemfeed/2023-10-29-kiss-static-web-photo-albums-with-photoalbum.sh.html18
-rw-r--r--gemfeed/2023-11-11-mind-management-book-notes.html18
-rw-r--r--gemfeed/2023-11-19-site-reliability-engineering-part-2.html4
-rw-r--r--gemfeed/2023-12-10-bash-golf-part-3.html18
-rw-r--r--gemfeed/2024-01-09-site-reliability-engineering-part-3.html4
-rw-r--r--gemfeed/2024-01-13-one-reason-why-i-love-openbsd.html2
-rw-r--r--gemfeed/2024-02-04-from-babylon5.buetow.org-to-.cloud.html28
-rw-r--r--gemfeed/2024-03-03-a-fine-fyne-android-app-for-quickly-logging-ideas-programmed-in-golang.html4
-rw-r--r--gemfeed/2024-04-01-KISS-high-availability-with-OpenBSD.html48
-rw-r--r--gemfeed/2024-05-01-slow-productivity-book-notes.html12
-rw-r--r--gemfeed/DRAFT-KISS-high-availability-with-OpenBSD.html22
-rw-r--r--gemfeed/DRAFT-site-reliability-engineering.html18
-rw-r--r--gemfeed/atom.xml522
-rw-r--r--gemfeed/index.html4
64 files changed, 871 insertions, 867 deletions
diff --git a/gemfeed/2008-06-26-perl-poetry.html b/gemfeed/2008-06-26-perl-poetry.html
index 055e75b9..7d1ce809 100644
--- a/gemfeed/2008-06-26-perl-poetry.html
+++ b/gemfeed/2008-06-26-perl-poetry.html
@@ -8,7 +8,7 @@
<link rel="stylesheet" href="style-override.css" />
</head>
<body>
-<h1 style='display: inline'>Perl Poetry</h1><br />
+<h1 style='display: inline' id='PerlPoetry'>Perl Poetry</h1><br />
<br />
<span class='quote'>Published at 2008-06-26T21:43:51+01:00; Updated at 2021-05-04</span><br />
<br />
@@ -41,7 +41,7 @@ _~~|~/_|_|__/|~~~~~~~ | / ~~~~~ | | ~~~~~~~~
<br />
<a class='textlink' href='https://en.wikipedia.org/wiki/Perl'>https://en.wikipedia.org/wiki/Perl</a><br />
<br />
-<h2 style='display: inline'>math.pl</h2><br />
+<h2 style='display: inline' id='mathpl'>math.pl</h2><br />
<br />
<!-- Generator: GNU source-highlight 3.1.9
by Lorenzo Bettini
@@ -88,7 +88,7 @@ __END__
</pre>
<br />
-<h2 style='display: inline'>christmas.pl</h2><br />
+<h2 style='display: inline' id='christmaspl'>christmas.pl</h2><br />
<br />
<!-- Generator: GNU source-highlight 3.1.9
by Lorenzo Bettini
@@ -137,7 +137,7 @@ __END__
This is perl<font color="#990000">,</font> v5<font color="#990000">.</font><font color="#993399">8.8</font> built <b><font color="#0000FF">for</font></b> i386<font color="#990000">-</font>freebsd<font color="#990000">-</font>64int
</pre>
<br />
-<h2 style='display: inline'>shopping.pl</h2><br />
+<h2 style='display: inline' id='shoppingpl'>shopping.pl</h2><br />
<br />
<!-- Generator: GNU source-highlight 3.1.9
by Lorenzo Bettini
@@ -174,7 +174,7 @@ __END__
This is perl<font color="#990000">,</font> v5<font color="#990000">.</font><font color="#993399">8.8</font> built <b><font color="#0000FF">for</font></b> i386<font color="#990000">-</font>freebsd<font color="#990000">-</font>64int
</pre>
<br />
-<h2 style='display: inline'>More...</h2><br />
+<h2 style='display: inline' id='More'>More...</h2><br />
<br />
<span>Did you like what you saw? Have a look at Codeberg to see my other poems too:</span><br />
<br />
diff --git a/gemfeed/2008-12-29-using-my-nokia-n95-for-fixing-my-mta.html b/gemfeed/2008-12-29-using-my-nokia-n95-for-fixing-my-mta.html
index 968cb122..7bc71b9b 100644
--- a/gemfeed/2008-12-29-using-my-nokia-n95-for-fixing-my-mta.html
+++ b/gemfeed/2008-12-29-using-my-nokia-n95-for-fixing-my-mta.html
@@ -8,7 +8,7 @@
<link rel="stylesheet" href="style-override.css" />
</head>
<body>
-<h1 style='display: inline'>Using my Nokia N95 for fixing my MTA</h1><br />
+<h1 style='display: inline' id='UsingmyNokiaN95forfixingmyMTA'>Using my Nokia N95 for fixing my MTA</h1><br />
<br />
<span class='quote'>Published at 2008-12-29T09:10:41+00:00; Updated at 2021-12-01</span><br />
<br />
diff --git a/gemfeed/2010-04-09-standard-ml-and-haskell.html b/gemfeed/2010-04-09-standard-ml-and-haskell.html
index 276d4c1d..84ae1fc7 100644
--- a/gemfeed/2010-04-09-standard-ml-and-haskell.html
+++ b/gemfeed/2010-04-09-standard-ml-and-haskell.html
@@ -8,7 +8,7 @@
<link rel="stylesheet" href="style-override.css" />
</head>
<body>
-<h1 style='display: inline'>Standard ML and Haskell</h1><br />
+<h1 style='display: inline' id='StandardMLandHaskell'>Standard ML and Haskell</h1><br />
<br />
<span class='quote'>Published at 2010-04-09T22:57:36+01:00</span><br />
<br />
@@ -18,7 +18,7 @@
<br />
<span>Haskell is also a "pure functional" programming language, whereas SML also makes explicit use of imperative concepts. I am by far not a specialist in either of these languages, but here are a few functions implemented in both SML and Haskell:</span><br />
<br />
-<h2 style='display: inline'>Defining a multi-data type</h2><br />
+<h2 style='display: inline' id='Definingamultidatatype'>Defining a multi-data type</h2><br />
<br />
<span>Standard ML:</span><br />
<br />
@@ -45,7 +45,7 @@ http://www.gnu.org/software/src-highlite -->
<b><font color="#0000FF">deriving</font></b> <font color="#009900">Show</font>
</pre>
<br />
-<h2 style='display: inline'>Processing a multi</h2><br />
+<h2 style='display: inline' id='Processingamulti'>Processing a multi</h2><br />
<br />
<span>Standard ML:</span><br />
<br />
@@ -74,7 +74,7 @@ test_number w <font color="#990000">=</font> number <font color="#990000">(</fon
<font color="#990000">(</font><font color="#009900">Union</font> <font color="#990000">(</font><font color="#009900">Union</font> <font color="#990000">(</font><font color="#009900">Elem</font> <font color="#993399">4</font><font color="#990000">)</font> <font color="#990000">(</font><font color="#009900">Elem</font> <font color="#993399">4</font><font color="#990000">))</font> <font color="#009900">Empty</font><font color="#990000">))))</font> w
</pre>
<br />
-<h2 style='display: inline'>Simplify function</h2><br />
+<h2 style='display: inline' id='Simplifyfunction'>Simplify function</h2><br />
<br />
<span>Standard ML:</span><br />
<br />
@@ -116,7 +116,7 @@ http://www.gnu.org/software/src-highlite -->
simplify x <font color="#990000">=</font> x
</pre>
<br />
-<h2 style='display: inline'>Delete all</h2><br />
+<h2 style='display: inline' id='Deleteall'>Delete all</h2><br />
<br />
<span>Standard ML:</span><br />
<br />
@@ -145,7 +145,7 @@ http://www.gnu.org/software/src-highlite -->
delete_all’ x <font color="#990000">=</font> x
</pre>
<br />
-<h2 style='display: inline'>Delete one</h2><br />
+<h2 style='display: inline' id='Deleteone'>Delete one</h2><br />
<br />
<span>Standard ML:</span><br />
<br />
@@ -191,7 +191,7 @@ http://www.gnu.org/software/src-highlite -->
delete_one’ x <font color="#990000">=</font> <font color="#990000">(</font>x<font color="#990000">,</font> <font color="#009900">False</font><font color="#990000">)</font>
</pre>
<br />
-<h2 style='display: inline'>Higher-order functions</h2><br />
+<h2 style='display: inline' id='Higherorderfunctions'>Higher-order functions</h2><br />
<br />
<span>The first line is always the SML code, the second line the Haskell variant:</span><br />
<br />
diff --git a/gemfeed/2010-05-07-lazy-evaluation-with-standarn-ml.html b/gemfeed/2010-05-07-lazy-evaluation-with-standarn-ml.html
index ce4ba30a..7dcabdaf 100644
--- a/gemfeed/2010-05-07-lazy-evaluation-with-standarn-ml.html
+++ b/gemfeed/2010-05-07-lazy-evaluation-with-standarn-ml.html
@@ -8,7 +8,7 @@
<link rel="stylesheet" href="style-override.css" />
</head>
<body>
-<h1 style='display: inline'>Lazy Evaluation with Standard ML</h1><br />
+<h1 style='display: inline' id='LazyEvaluationwithStandardML'>Lazy Evaluation with Standard ML</h1><br />
<br />
<span class='quote'>Published at 2010-05-07T08:17:59+01:00</span><br />
<br />
@@ -32,7 +32,7 @@
<br />
<span>You can solve specific problems with lazy evaluation easier than with eager evaluation. For example, you might want to list the number Pi or another infinite list of something. With the help of lazy evaluation, each element of the list is calculated when it is accessed first, but not earlier.</span><br />
<br />
-<h2 style='display: inline'>Emulating lazy evaluation in SML</h2><br />
+<h2 style='display: inline' id='EmulatinglazyevaluationinSML'>Emulating lazy evaluation in SML</h2><br />
<br />
<span>However, it is possible to emulate lazy evaluation in most eager evaluation languages. This is how it is done with Standard ML (with some play with an infinite list of natural number tuples filtering out 0 elements):</span><br />
<br />
@@ -78,7 +78,7 @@ val test = first 10 (nat_pairs_not_null ());
<br />
<a class='textlink' href='http://smlnj.org/'>http://smlnj.org/</a><br />
<br />
-<h2 style='display: inline'>Real laziness with Haskell </h2><br />
+<h2 style='display: inline' id='ReallazinesswithHaskell'>Real laziness with Haskell </h2><br />
<br />
<span>As Haskell already uses lazy evaluation by default, there is no need to construct a new data type. Lists in Haskell are lazy by default. You will notice that the code is also much shorter and easier to understand than the SML version. </span><br />
<br />
diff --git a/gemfeed/2010-05-09-the-fype-programming-language.html b/gemfeed/2010-05-09-the-fype-programming-language.html
index 454a4621..1728107d 100644
--- a/gemfeed/2010-05-09-the-fype-programming-language.html
+++ b/gemfeed/2010-05-09-the-fype-programming-language.html
@@ -8,7 +8,7 @@
<link rel="stylesheet" href="style-override.css" />
</head>
<body>
-<h1 style='display: inline'>The Fype Programming Language</h1><br />
+<h1 style='display: inline' id='TheFypeProgrammingLanguage'>The Fype Programming Language</h1><br />
<br />
<span class='quote'>Published at 2010-05-09T12:48:29+01:00; Updated at 2021-05-05</span><br />
<br />
@@ -27,7 +27,7 @@
<br />
<span>Fype is a recursive acronym and means "Fype is For Your Program Execution" or "Fype is Free Yak Programmed for ELF". You could also say, "It&#39;s not a hype - it&#39;s Fype!".</span><br />
<br />
-<h2 style='display: inline'>Object-oriented C style</h2><br />
+<h2 style='display: inline' id='ObjectorientedCstyle'>Object-oriented C style</h2><br />
<br />
<span>The Fype interpreter is written in an object-oriented style of C. Each "main component" has its own .h and .c file. There is a struct type for each (most components at least) component, which can be initialized using a "COMPONENT_new" function and destroyed using a "COMPONENT_delete" function. Method calls follow the same schema, e.g. "COMPONENT_METHODNAME". There is no such as class inheritance and polymorphism involved. </span><br />
<br />
@@ -100,7 +100,7 @@ http://www.gnu.org/software/src-highlite -->
<font color="#FF0000">}</font>
</pre>
<br />
-<h2 style='display: inline'>Data types</h2><br />
+<h2 style='display: inline' id='Datatypes'>Data types</h2><br />
<br />
<span>Fype uses auto type conversion. However, if you want to know what&#39;s going on, you may take a look at the following basic data types:</span><br />
<ul>
@@ -114,13 +114,13 @@ http://www.gnu.org/software/src-highlite -->
</ul><br />
<span>There is no boolean type, but we can use the integer values 0 for false and 1 for true. There is support for explicit type casting too.</span><br />
<br />
-<h2 style='display: inline'>Syntax</h2><br />
+<h2 style='display: inline' id='Syntax'>Syntax</h2><br />
<br />
-<h3 style='display: inline'>Comments</h3><br />
+<h3 style='display: inline' id='Comments'>Comments</h3><br />
<br />
<span>Text from a # character until the end of the current line is considered being a comment. Multi-line comments may start with an #* and with a *# anywhere. Exceptions are if those signs are inside of strings.</span><br />
<br />
-<h3 style='display: inline'>Variables</h3><br />
+<h3 style='display: inline' id='Variables'>Variables</h3><br />
<br />
<span>Variables are defined with the "my" keyword (inspired by Perl :-). If you don&#39;t assign a value during declaration, it uses the default integer value 0. Variables may be changed during program runtime. Variables may be deleted using the "undef" keyword! Example:</span><br />
<br />
@@ -151,7 +151,7 @@ if defined foo {
}
</pre>
<br />
-<h3 style='display: inline'>Synonyms</h3><br />
+<h3 style='display: inline' id='Synonyms'>Synonyms</h3><br />
<br />
<span>Each variable can have as many synonyms as wished. A synonym is another name to access the content of a specific variable. Here is an example of how to use it:</span><br />
<br />
@@ -193,7 +193,7 @@ undef baz;
say syms foo; # Prints 1
</pre>
<br />
-<h2 style='display: inline'>Statements and expressions</h2><br />
+<h2 style='display: inline' id='Statementsandexpressions'>Statements and expressions</h2><br />
<br />
<span>A Fype program is a list of statements. Each keyword, expression or function call is part of a statement. Each statement is ended with a semicolon. Example:</span><br />
<br />
@@ -203,11 +203,11 @@ say foo;
exit foo - bar;
</pre>
<br />
-<h3 style='display: inline'>Parenthesis</h3><br />
+<h3 style='display: inline' id='Parenthesis'>Parenthesis</h3><br />
<br />
<span>All parenthesis for function arguments is optional. They help to make the code better readable. They also help to force the precedence of expressions.</span><br />
<br />
-<h3 style='display: inline'>Basic expressions</h3><br />
+<h3 style='display: inline' id='Basicexpressions'>Basic expressions</h3><br />
<br />
<span>Any "any" value holding a string will be automatically converted to an integer value.</span><br />
<br />
@@ -225,7 +225,7 @@ exit foo - bar;
(integer) not &lt;any&gt;
</pre>
<br />
-<h3 style='display: inline'>Bitwise expressions</h3><br />
+<h3 style='display: inline' id='Bitwiseexpressions'>Bitwise expressions</h3><br />
<br />
<pre>
(integer) &lt;any&gt; :&lt; &lt;any&gt;
@@ -235,7 +235,7 @@ exit foo - bar;
(integer) &lt;any&gt; xor &lt;any&gt;
</pre>
<br />
-<h3 style='display: inline'>Numeric expressions</h3><br />
+<h3 style='display: inline' id='Numericexpressions'>Numeric expressions</h3><br />
<br />
<pre>
(number) neg &lt;number&gt;
@@ -260,7 +260,7 @@ exit foo - bar;
if yes { say no defined foo; }
</pre>
<br />
-<h2 style='display: inline'>Control statements</h2><br />
+<h2 style='display: inline' id='Controlstatements'>Control statements</h2><br />
<br />
<span>Control statements available in Fype:</span><br />
<br />
@@ -288,7 +288,7 @@ until &lt;expression&gt; { &lt;statements&gt; }
<br />
<span>... runs the statements as long as the expression evaluates to a false value.</span><br />
<br />
-<h2 style='display: inline'>Scopes</h2><br />
+<h2 style='display: inline' id='Scopes'>Scopes</h2><br />
<br />
<span>A new scope starts with an { and ends with an }. An exception is a procedure, which does not use its own scope (see later in this manual). Control statements and functions support scopes. The "scope" function prints out all available symbols at the current scope. Here is a small example:</span><br />
<br />
@@ -339,7 +339,7 @@ SYM_VARIABLE: var4 (id=00035, line=-0001, pos=-001, type=TT_INTEGER, dval=0.0000
SYM_FUNCTION: bar
</pre>
<br />
-<h2 style='display: inline'>Definedness </h2><br />
+<h2 style='display: inline' id='Definedness'>Definedness </h2><br />
<br />
<pre>
(integer) defined &lt;identifier&gt;
@@ -353,7 +353,7 @@ SYM_FUNCTION: bar
<br />
<span>... tries to undefine/delete the "identifier". Returns 1 if it succeeded, otherwise 0 is returned.</span><br />
<br />
-<h2 style='display: inline'>System </h2><br />
+<h2 style='display: inline' id='System'>System </h2><br />
<br />
<span>These are some system and interpreter specific built-in functions supported:</span><br />
<br />
@@ -395,7 +395,7 @@ if pid {
<br />
<span>It returns the number of items freed! You may wonder why most of the time, it will produce a value of 0! Fype tries to free not needed memory ASAP. This may change in future versions to gain faster execution speed!</span><br />
<br />
-<h3 style='display: inline'>I/O </h3><br />
+<h3 style='display: inline' id='IO'>I/O </h3><br />
<br />
<pre>
(any) put &lt;any&gt;
@@ -415,9 +415,9 @@ if pid {
<br />
<span>... just prints a new line.</span><br />
<br />
-<h2 style='display: inline'>Procedures and functions</h2><br />
+<h2 style='display: inline' id='Proceduresandfunctions'>Procedures and functions</h2><br />
<br />
-<h3 style='display: inline'>Procedures</h3><br />
+<h3 style='display: inline' id='Procedures'>Procedures</h3><br />
<br />
<span>A procedure can be defined with the "proc" keyword and deleted with the "undef" keyword. A procedure does not return any value and does not support parameter passing. It&#39;s using already defined variables (e.g. global variables). A procedure does not have its own namespace. It&#39;s using the calling namespace. It is possible to define new variables inside of a procedure in the current namespace.</span><br />
<br />
@@ -433,7 +433,7 @@ foo; # Run the procedure. Print out "11\n"
say c; # Print out "6\n";
</pre>
<br />
-<h3 style='display: inline'>Nested procedures</h3><br />
+<h3 style='display: inline' id='Nestedprocedures'>Nested procedures</h3><br />
<br />
<span>It&#39;s possible to define procedures inside of procedures. Since procedures don&#39;t have their own scope, nested procedures will be available to the current scope as soon as the main procedure has run the first time. You may use the "defined" keyword to check if a procedure has been defined or not.</span><br />
<br />
@@ -456,7 +456,7 @@ bar; # Now the procedure bar is defined!
foo; # Here the procedure foo will redefine bar again!
</pre>
<br />
-<h3 style='display: inline'>Functions</h3><br />
+<h3 style='display: inline' id='Functions'>Functions</h3><br />
<br />
<span>A function can be defined with the "func" keyword and deleted with the "undef" keyword. Function do not yet return values and do not yet supports parameter passing. It&#39;s using local (lexical scoped) variables. If a certain variable does not exist, when It&#39;s using already defined variables (e.g. one scope above). </span><br />
<br />
@@ -472,7 +472,7 @@ foo; # Run the procedure. Print out "11\n"
say c; # Will produce an error because c is out of scope!
</pre>
<br />
-<h3 style='display: inline'>Nested functions</h3><br />
+<h3 style='display: inline' id='Nestedfunctions'>Nested functions</h3><br />
<br />
<span>Nested functions work the same way the nested procedures work, except that nested functions will not be available anymore after the function has been left!</span><br />