diff options
| author | Paul Buetow <paul@buetow.org> | 2021-05-31 10:09:19 +0100 |
|---|---|---|
| committer | Paul Buetow <paul@buetow.org> | 2021-05-31 10:09:19 +0100 |
| commit | d3a70f706d57530e6c3a12364af0fdcf51ec6e20 (patch) | |
| tree | 2eb8d872ee3ae5254850c4cc9e2f3372659f594e | |
| parent | c7d03dc1b79d2214db40e322a31d1844b1c64d87 (diff) | |
Publishing new version
| -rw-r--r-- | contact-information.html | 10 | ||||
| -rw-r--r-- | gemfeed/2010-04-09-standard-ml-and-haskell.html | 12 | ||||
| -rw-r--r-- | gemfeed/2010-05-07-lazy-evaluation-with-standarn-ml.html | 6 | ||||
| -rw-r--r-- | gemfeed/2010-05-09-the-fype-programming-language.html | 52 | ||||
| -rw-r--r-- | gemfeed/2011-05-07-perl-daemon-service-framework.html | 22 | ||||
| -rw-r--r-- | gemfeed/2014-03-24-the-fibonacci.pl.c-polyglot.html | 14 | ||||
| -rw-r--r-- | gemfeed/2015-12-05-run-debian-on-your-phone-with-debroid.html | 8 | ||||
| -rw-r--r-- | gemfeed/2016-04-03-offsite-backup-with-zfs.html | 14 | ||||
| -rw-r--r-- | gemfeed/2016-04-16-offsite-backup-with-zfs-part2.html | 6 | ||||
| -rw-r--r-- | gemfeed/2016-05-22-spinning-up-my-own-authoritative-dns-servers.html | 24 | ||||
| -rw-r--r-- | gemfeed/2016-11-20-methods-in-c.html | 12 | ||||
| -rw-r--r-- | gemfeed/2021-04-24-welcome-to-the-geminispace.html | 22 | ||||
| -rw-r--r-- | gemfeed/2021-05-16-personal-bash-coding-style-guide.html | 16 | ||||
| -rw-r--r-- | gemfeed/atom.xml | 210 | ||||
| -rw-r--r-- | gemfeed/index.html | 32 | ||||
| -rw-r--r-- | index.html | 43 | ||||
| -rw-r--r-- | resources.html | 94 |
17 files changed, 300 insertions, 297 deletions
diff --git a/contact-information.html b/contact-information.html index 446ecb63..27e68c3d 100644 --- a/contact-information.html +++ b/contact-information.html @@ -54,14 +54,16 @@ h2, h3 { <li>Secure E-Mail: paul.buetow at protonmail dot com</li> <li>E-Mail: paul at buetow dot org (forwards to the ProtonMail address)</li> </ul> -<p>Why did I just mention 2 E-Mail addresses here? The buetow.org address will always stay. It is my lifetime E-Mail address as I own the domain name. The address will stay even when I decided to change my email provider.</p> -<p>Use the ProtonMail address if you care about security for now. The address stays valid as long as I am ProtonMail user. Especially if you are ProtonMail user too we could have real E-Mail end-2-end encryption for our conversation.</p> +<p>Why did I mention 2 E-Mail addresses here? The buetow.org address will always stay. It is my lifetime E-Mail address as I own the domain name. The address will remain even when I decided to change my e-mail provider.</p> +<p>Use the ProtonMail address if you care about security for now. The address stays valid as long as I am ProtonMail user. Especially if you are ProtonMail user too, we could have real E-Mail end-2-end encryption for our conversation.</p> <h2>Quick Links</h2> <h3>Social Media</h3> -<p>I am sharing articles which I found interesting regularly on all the social media channels. To get you navigated quickly, here are the links:</p> +<p>I am sharing articles that I found interesting regularly on all the social media channels. To get you navigated quickly, here are the links:</p> <a class="textlink" href="https://www.linkedin.com/in/paul-buetow-b4857270/">My LinkedIn profile</a><br /> <a class="textlink" href="https://twitter.com/snonux">My Twitter profile</a><br /> <a class="textlink" href="https://t.me/snonux">My Telegram channel</a><br /> +<h3>Internet Relay Chat</h3> +<p>I am on irc.german-elite.net in #coding and #linux (and maybe in others) as rantanplan.</p> <h3>My Open Source code repositories</h3> <a class="textlink" href="https://github.com/snonux">My personal GitHub page</a><br /> <a class="textlink" href="https://github.com/mimecast/dtail">DTail at Mimecast</a><br /> @@ -69,7 +71,7 @@ h2, h3 { <h3>My old personal website</h3> <p>It's still there for fun + profit.</p> <a class="textlink" href="http://paul.buetow.org">http://paul.buetow.org</a><br /> -<p>It's powered by Xerl, my own CMS:</p> +<p>Xerl, my own CMS, powers it:</p> <a class="textlink" href="http://xerl.buetow.org">http://xerl.buetow.org</a><br /> <a class="textlink" href="./">Go back to the main site</a><br /> <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> diff --git a/gemfeed/2010-04-09-standard-ml-and-haskell.html b/gemfeed/2010-04-09-standard-ml-and-haskell.html index 256c8faf..4602f248 100644 --- a/gemfeed/2010-04-09-standard-ml-and-haskell.html +++ b/gemfeed/2010-04-09-standard-ml-and-haskell.html @@ -50,10 +50,10 @@ h2, h3 { <body> <h1>Standard ML and Haskell</h1> <p class="quote"><i>Written by Paul Buetow 2010-04-09</i></p> -<p>I am currently looking into the functional programming language Standard ML (aka SML). The purpose is to refresh my functional programming skills and to learn something new too. Since I already know a little Haskell, could I do not help myself and I implemented the same exercises in Haskell too.</p> -<p>As you will see, SML and Haskell are very similar (at least when it comes to the basics). However, the syntax of Haskell is a bit more "advanced". Haskell utilizes fewer keywords (e.g. no val, end, fun, fn ...). Haskell also allows to explicitly write down the function types. What I have been missing in SML so far is the so-called pattern guards. Although this is a very superficial comparison for now, so far I like Haskell more than SML. Nevertheless, I thought it would be fun to demonstrate a few simple functions of both languages to show off the similarities. </p> -<p>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:</p> -<h2>Defining a multi data type</h2> +<p>I am currently looking into the functional programming language Standard ML (aka SML). The purpose is to refresh my functional programming skills and to learn something new too. Since I already knew a little Haskell, I could not help myself, and I also implemented the same exercises in Haskell.</p> +<p>As you will see, SML and Haskell are very similar (at least when it comes to the basics). However, the syntax of Haskell is a bit more "advanced". Haskell utilizes fewer keywords (e.g. no val, end, fun, fn ...). Haskell also allows to write down the function types explicitly. What I have been missing in SML so far is the so-called pattern guards. Although this is a very superficial comparison for now, so far, I like Haskell more than SML. Nevertheless, I thought it would be fun to demonstrate a few simple functions of both languages to show off the similarities. </p> +<p>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:</p> +<h2>Defining a multi-data type</h2> <p>Standard ML:</p> <pre> datatype ’a multi @@ -171,8 +171,8 @@ delete_one m w = do if x == w then (Empty, True) else (Elem x, False) delete_one’ x = (x, False) </pre> -<h2>Higher order functions</h2> -<p>The first line is always the SML code, the second line always the Haskell variant:</p> +<h2>Higher-order functions</h2> +<p>The first line is always the SML code, the second line the Haskell variant:</p> <pre> fun make_map_fn f1 = fn (x,y) => f1 x :: y make_map_fn f1 = \x y -> f1 x : y 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 b81aa18b..fa1e5a06 100644 --- a/gemfeed/2010-05-07-lazy-evaluation-with-standarn-ml.html +++ b/gemfeed/2010-05-07-lazy-evaluation-with-standarn-ml.html @@ -62,10 +62,10 @@ h2, h3 { `|||| </pre> <p class="quote"><i>Written by Paul Buetow 2010-05-07</i></p> -<p>In contrast to Haskell, Standard SML does not use lazy evaluation by default, but eager evaluation. </p> +<p>In contrast to Haskell, Standard SML does not use lazy evaluation by default but an eager evaluation. </p> <a class="textlink" href="https://en.wikipedia.org/wiki/Eager_evaluation">https://en.wikipedia.org/wiki/Eager_evaluation</a><br /> <a class="textlink" href="https://en.wikipedia.org/wiki/Lazy_evaluation">https://en.wikipedia.org/wiki/Lazy_evaluation</a><br /> -<p>You can solve certain 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.</p> +<p>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.</p> <h2>Emulating lazy evaluation in SML</h2> <p>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):</p> <pre> @@ -109,7 +109,7 @@ val test = first 10 (nat_pairs_not_null ()); </pre> <a class="textlink" href="http://smlnj.org/">http://smlnj.org/</a><br /> <h2>Real laziness with Haskell </h2> -<p>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 because of that. </p> +<p>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. </p> <pre> {- Just to make it look like the ML example -} first = take diff --git a/gemfeed/2010-05-09-the-fype-programming-language.html b/gemfeed/2010-05-09-the-fype-programming-language.html index a49d5ba5..7f0382ee 100644 --- a/gemfeed/2010-05-09-the-fype-programming-language.html +++ b/gemfeed/2010-05-09-the-fype-programming-language.html @@ -58,12 +58,12 @@ h2, h3 { |___/|_| |___/ |___/ </pre> <p class="quote"><i>Written by Paul Buetow 2010-05-09, last updated 2021-05-05</i></p> -<p>Fype is an interpreted programming language created by me for learning and fun. The interpreter is written in C. It has been tested on FreeBSD and NetBSD and may also work on other Unix like operating systems such as Linux based ones. To be honest, besides learning and fun there is really no other use case of why Fype actually exists as many other programming languages are much faster and more powerful.</p> -<p>The Fype syntax is very simple and is using a maximum look ahead of 1 and a very easy top down parsing mechanism. Fype is parsing and interpreting its code simultaneously. This means, that syntax errors are only detected during program runtime. </p> -<p>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's not a hype - it's Fype!".</p> -<h2>Object oriented C style</h2> -<p>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. </p> -<p>To give you an idea how it works here as an example is a snippet from the main Fype "class header":</p> +<p>Fype is an interpreted programming language created by me for learning and fun. The interpreter is written in C. It has been tested on FreeBSD and NetBSD and may also work on other Unix like operating systems such as Linux based ones. Besides learning and fun, there is no other use case of why Fype exists as many other programming languages are much faster and more powerful.</p> +<p>The Fype syntax is straightforward and uses a maximum look ahead of 1 and an effortless top-down parsing mechanism. Fype is parsing and interpreting its code simultaneously. This means that syntax errors are only detected during program runtime. </p> +<p>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's not a hype - it's Fype!".</p> +<h2>Object-oriented C style</h2> +<p>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. </p> +<p>To give you an idea of how it works here as an example is a snippet from the main Fype "class header":</p> <pre> typedef struct { Tupel *p_tupel_argv; // Contains command line options @@ -72,7 +72,7 @@ typedef struct { char *c_basename; } Fype; </pre> -<p>And here is a snippet from the main Fype "class implementation":</p> +<p>And here is a snippet from the primary Fype "class implementation":</p> <pre> Fype* fype_new() { @@ -123,22 +123,22 @@ fype_run(int i_argc, char **pc_argv) { } </pre> <h2>Data types</h2> -<p>Fype uses auto type conversion. However, if you want to know what's going on you may take a look at the following basic data types:</p> +<p>Fype uses auto type conversion. However, if you want to know what's going on, you may take a look at the following basic data types:</p> <ul> <li>integer - Specifies a number</li> -<li>double - Specifies a double precision number</li> +<li>double - Specifies a double-precision number</li> <li>string - Specifies a string</li> <li>number - May be an integer or a double number</li> <li>any- May be any type above</li> <li>void - No type</li> -<li>identifier - It's a variable name or a procedure name or a function name</li> +<li>identifier - It's a variable name or a procedure name, or a function name</li> </ul> <p>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.</p> <h2>Syntax</h2> <h3>Comments</h3> -<p>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.</p> +<p>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.</p> <h3>Variables</h3> -<p>Variables can be defined with the "my" keyword (inspired by Perl :-). If you don't assign a value during declaration, then it's using the default integer value 0. Variables may be changed during program runtime. Variables may be deleted using the "undef" keyword! Example:</p> +<p>Variables are defined with the "my" keyword (inspired by Perl :-). If you don'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:</p> <pre> my foo = 1 + 2; say foo; @@ -164,7 +164,7 @@ if defined foo { } </pre> <h3>Synonyms</h3> -<p>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 is:</p> +<p>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:</p> <pre> my foo = "foo"; my bar = \foo; @@ -173,7 +173,7 @@ foo = "bar"; # The synonym variable should now also set to "bar" assert "bar" == bar; </pre> -<p>Synonyms can be used for all kind of identifiers. It's not limited to normal variables but can be also used for function and procedure names etc (more about functions and procedures later).</p> +<p>Synonyms can be used for all kind of identifiers. It's not limited to standard variables but can also be used for function and procedure names (more about functions and procedures later).</p> <pre> # Create a new procedure baz proc baz { say "I am baz"; } @@ -206,7 +206,7 @@ say foo; exit foo - bar; </pre> <h3>Parenthesis</h3> -<p>All parenthesis for function arguments are optional. They help to make the code better readable. They also help to force precedence of expressions.</p> +<p>All parenthesis for function arguments is optional. They help to make the code better readable. They also help to force the precedence of expressions.</p> <h3>Basic expressions</h3> <p>Any "any" value holding a string will be automatically converted to an integer value.</p> <pre> @@ -238,7 +238,7 @@ exit foo - bar; <pre> (integer) no <integer> </pre> -<p>... returns 1 if the argument is 0, otherwise it will return 0! If no argument is given, then 0 is returned!</p> +<p>... returns 1 if the argument is 0; otherwise, it will return 0! If no argument is given, then 0 is returned!</p> <pre> (integer) yes <integer> </pre> @@ -266,7 +266,7 @@ until <expression> { <statements> } </pre> <p>... runs the statements as long as the expression evaluates to a false value.</p> <h2>Scopes</h2> -<p>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:</p> +<p>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:</p> <pre> my foo = 1; @@ -333,7 +333,7 @@ SYM_FUNCTION: bar <pre> (integer) fork </pre> -<p>... forks a subprocess. It returns 0 for the child process and the pid of the child process otherwise! Example:</p> +<p>... forks a subprocess. It returns 0 for the child process and the PID of the child process otherwise! Example:</p> <pre> my pid = fork; @@ -347,9 +347,9 @@ if pid { </pre> <p>To execute the garbage collector do:</p> <pre> -(integer) gc +(integer) GC </pre> -<p>It returns the number of items freed! You may wonder why most of the time it will return a value of 0! Fype tries to free not needed memory ASAP. This may change in future versions in order to gain faster execution speed!</p> +<p>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!</p> <h3>I/O </h3> <pre> (any) put <any> @@ -362,7 +362,7 @@ if pid { <pre> (void) ln </pre> -<p>... just prints a newline.</p> +<p>... just prints a new line.</p> <h2>Procedures and functions</h2> <h3>Procedures</h3> <p>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's using already defined variables (e.g. global variables). A procedure does not have its own namespace. It's using the calling namespace. It is possible to define new variables inside of a procedure in the current namespace.</p> @@ -378,7 +378,7 @@ foo; # Run the procedure. Print out "11\n" say c; # Print out "6\n"; </pre> <h3>Nested procedures</h3> -<p>It's possible to define procedures inside of procedures. Since procedures don't have its 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 in order to check if a procedure has been defined or not.</p> +<p>It's possible to define procedures inside of procedures. Since procedures don'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.</p> <pre> proc foo { say "I am foo"; @@ -408,10 +408,10 @@ func foo { my a = 2, b = 4; foo; # Run the procedure. Print out "11\n" -say c; # Will produce an error, because c is out of scoped! +say c; # Will produce an error because c is out of scope! </pre> <h3>Nested functions</h3> -<p>Nested functions work the same way the nested procedures work, with the exception that nested functions will not be available anymore after the function has been left!</p> +<p>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!</p> <pre> func foo { func bar { @@ -422,10 +422,10 @@ func foo { } foo; -bar; # Will produce an error, because bar is out of scope! +bar; # Will produce an error because bar is out of scope! </pre> <h2>Arrays</h2> -<p>Some progress on arrays has been made too. The following example creates a multi dimensional array "foo". Its first element is the return value of the func which is "bar". The fourth value is a string ”3” converted to a double number. The last element is an anonymous array which itself contains another anonymous array as its last element:</p> +<p>Some progress on arrays has been made too. The following example creates a multidimensional array "foo". Its first element is the return value of the func which is "bar". The fourth value is a string" 3" converted to a double number. The last element is an anonymous array which itself contains another anonymous array as its final element:</p> <pre> func bar { say ”bar” } my foo = [bar, 1, 4/2, double ”3”, [”A”, [”BA”, ”BB”]]]; diff --git a/gemfeed/2011-05-07-perl-daemon-service-framework.html b/gemfeed/2011-05-07-perl-daemon-service-framework.html index 5a8e0c2d..ea22da58 100644 --- a/gemfeed/2011-05-07-perl-daemon-service-framework.html +++ b/gemfeed/2011-05-07-perl-daemon-service-framework.html @@ -56,18 +56,18 @@ h2, h3 { //\ //\\ //\ //\\ //\ //\\jrei </pre> <p class="quote"><i>Written by Paul Buetow 2011-05-07, last updated 2021-05-07</i></p> -<p>PerlDaemon is a minimal daemon for Linux and other Unix like operating systems programmed in Perl. It is a minimal but pretty functional and fairly generic service framework. This means that it does not do anything useful other than providing a framework for starting, stopping, configuring and logging. In order to do something useful, a module (written in Perl) must be provided.</p> +<p>PerlDaemon is a minimal daemon for Linux and other Unix like operating systems programmed in Perl. It is a minimal but pretty functional and fairly generic service framework. This means that it does not do anything useful other than providing a framework for starting, stopping, configuring and logging. To do something useful, a module (written in Perl) must be provided.</p> <h2>Features</h2> <p>PerlDaemon supports:</p> <ul> <li>Automatic daemonizing</li> <li>Logging</li> -<li>logrotation (via SIGHUP)</li> +<li>log rotation (via SIGHUP)</li> <li>Clean shutdown support (SIGTERM)</li> <li>Pid file support (incl. check on startup)</li> <li>Easy to configure</li> <li>Easy to extend</li> -<li>Multi instance support (just use a different directory for each instance).</li> +<li>Multi-instance support (just use a different directory for each instance).</li> </ul> <h2>Quick Guide</h2> <pre> @@ -80,9 +80,9 @@ h2, h3 { # Alternatively: Starting in foreground ./bin/perldaemon start daemon.daemonize=no (or shortcut ./control foreground) </pre> -<p>To stop a daemon running in foreground mode "Ctrl+C" must be hit. To see more available startup options run "./control" without any argument.</p> +<p>To stop a daemon from running in foreground mode, "Ctrl+C" must be hit. To see more available startup options run "./control" without any argument.</p> <h2>How to configure</h2> -<p>The daemon instance can be configured in "./conf/perldaemon.conf". If you want to change a property only once, it is also possible to specify it on command line (that then will take precedence over the config file). All available config properties can be viewed via "./control keys":</p> +<p>The daemon instance can be configured in "./conf/perldaemon.conf". If you want to change a property only once, it is also possible to specify it on the command line (which will take precedence over the config file). All available config properties can be displayed via "./control keys":</p> <pre> pb@titania:~/svn/utils/perldaemon/trunk$ ./control keys # Path to the logfile @@ -100,10 +100,10 @@ daemon.daemonize=yes # Path to the pidfile daemon.pidfile=./run/perldaemon.pid -# Each module should run every runinterval seconds +# Each module should run every run interval seconds daemon.modules.runinterval=3 -# Path to the alive file (is touched every loopinterval seconds, usable to monitor) +# Path to the alive file (is touched every loop interval seconds, usable for monitoring) daemon.alivefile=./run/perldaemon.alive # Specifies the working directory @@ -124,15 +124,15 @@ Mon Jun 13 11:29:27 2011 (PID 2838): ExampleModule Test 2 $ ./control stop Stopping daemon now... </pre> -<p>If you want to change that property forever either edit perldaemon.conf or do this:</p> +<p>If you want to change that property forever, either edit perldaemon.conf or do this:</p> <pre> $ ./control keys daemon.loopinterval=10 > new.conf; mv new.conf conf/perldaemon.conf </pre> <h2>HiRes event loop</h2> -<p>PerlDaemon uses `Time::HiRes` to make sure that all the events run in correct intervals. Each loop run a time carry value is recorded and added to the next loop run in order to catch up lost time.</p> +<p>PerlDaemon uses `Time::HiRes` to make sure that all the events run incorrect intervals. For each loop run, a time carry value is recorded and added to the next loop run to catch up on lost time.</p> <h2>Writing your own modules</h2> <h3>Example module</h3> -<p>This is one of the example modules you will find in the source code. It should be quite self-explanatory if you know Perl :-).</p> +<p>This is one of the example modules you will find in the source code. It should be pretty self-explanatory if you know Perl :-).</p> <pre> package PerlDaemonModules::ExampleModule; @@ -174,7 +174,7 @@ sub do ($) { ./bin/perldaemon restart (or shortcurt ./control restart) </pre> <p>Now watch `./log/perldaemon.log` closely. It is a good practice to test your modules in 'foreground mode' (see above how to do that).</p> -<p>BTW: You can install as many modules within the same instance as desired. But they are run in sequential order (in future they can also run in parallel using several threads or processes).</p> +<p>BTW: You can install as many modules within the same instance as desired. But they are run in sequential order (in future, they can also run in parallel using several threads or processes).</p> <h2>May the source be with you</h2> <p>You can find PerlDaemon (including the examples) at:</p> <a class="textlink" href="https://github.com/snonux/perldaemon">https://github.com/snonux/perldaemon</a><br /> diff --git a/gemfeed/2014-03-24-the-fibonacci.pl.c-polyglot.html b/gemfeed/2014-03-24-the-fibonacci.pl.c-polyglot.html index 8f52ca73..f529263d 100644 --- a/gemfeed/2014-03-24-the-fibonacci.pl.c-polyglot.html +++ b/gemfeed/2014-03-24-the-fibonacci.pl.c-polyglot.html @@ -50,10 +50,10 @@ h2, h3 { <body> <h1>The fibonacci.pl.c Polyglot</h1> <p class="quote"><i>Written by Paul Buetow 2014-03-24</i></p> -<p>In computing, a polyglot is a computer program or script written in a valid form of multiple programming languages, which performs the same operations or output independent of the programming language used to compile or interpret it</p> +<p>In computing, a polyglot is a computer program or script written in a valid form of multiple programming languages, which performs the same operations or output independent of the programming language used to compile or interpret it.</p> <a class="textlink" href="https://en.wikipedia.org/wiki/Polyglot_(computing)">https://en.wikipedia.org/wiki/Polyglot_(computing)</a><br /> <h2>The Fibonacci numbers</h2> -<p>For fun, I programmed my own Polyglot, which is both, valid Perl and C code. The interesting part about C is, that $ is a valid character to start variable names with:</p> +<p>For fun, I programmed my own Polyglot, which is both valid Perl and C code. The exciting part about C is that $ is a valid character to start variable names with:</p> <pre> #include <stdio.h> @@ -66,7 +66,7 @@ my $arg; sub hello() { printf("Hello, welcome to Perl-C!\n"); - printf("This program is both, valid C and Perl code!\n"); + printf("This program is both valid C and Perl code!\n"); printf("It calculates all fibonacci numbers from 0 to 9!\n\n"); return 0; } @@ -98,13 +98,13 @@ BEGIN { return 0; } </pre> -<p>You can find the whole source code at GitHub:</p> +<p>You can find the full source code at GitHub:</p> <a class="textlink" href="https://github.com/snonux/perl-c-fibonacci">https://github.com/snonux/perl-c-fibonacci</a><br /> <h3>Let's run it with Perl:</h3> <pre> ❯ perl fibonacci.pl.c Hello, welcome to Perl-C! -This program is both, valid C and Perl code! +This program is both valid C and Perl code! It calculates all fibonacci numbers from 0 to 9! fib(0) = 0 @@ -124,7 +124,7 @@ fib(10) = 55 ❯ gcc fibonacci.pl.c -o fibonacci ❯ ./fibonacci Hello, welcome to Perl-C! -This program is both, valid C and Perl code! +This program is both valid C and Perl code! It calculates all fibonacci numbers from 0 to 9! fib(0) = 0 @@ -139,7 +139,7 @@ fib(8) = 21 fib(9) = 34 fib(10) = 55 </pre> -<p>It's really fun to play with :-).</p> +<p>It's entertaining to play with :-).</p> <p>E-Mail me your thoughts at comments@mx.buetow.org!</p> <a class="textlink" href="../">Go back to the main site</a><br /> <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> diff --git a/gemfeed/2015-12-05-run-debian-on-your-phone-with-debroid.html b/gemfeed/2015-12-05-run-debian-on-your-phone-with-debroid.html index b150a70c..10edd29f 100644 --- a/gemfeed/2015-12-05-run-debian-on-your-phone-with-debroid.html +++ b/gemfeed/2015-12-05-run-debian-on-your-phone-with-debroid.html @@ -58,15 +58,15 @@ h2, h3 { </pre> <p class="quote"><i>Written by Paul Buetow 2015-12-05, last updated 2021-05-16</i></p> -<p>You can use the following tutorial to install a full-blown Debian GNU/Linux Chroot on a LG G3 D855 CyanogenMod 13 (Android 6). First of all you need to have root permissions on your phone and you also need to have the developer mode activated. The following steps have been tested on Linux (Fedora 23).</p> +<p>You can use the following tutorial to install a full-blown Debian GNU/Linux Chroot on an LG G3 D855 CyanogenMod 13 (Android 6). First of all, you need to have root permissions on your phone, and you also need to have the developer mode activated. The following steps have been tested on Linux (Fedora 23).</p> <a href="./2015-12-05-run-debian-on-your-phone-with-debroid/Deboroid.png"><img src="./2015-12-05-run-debian-on-your-phone-with-debroid/Deboroid.png" /></a><br /> <h2>Foreword</h2> -<p>A couple of years have passed since I last worked on Debroid. At the moment I am using the Termux app on Android, which is less sophisticated than a fully blown Debian installation, but sufficient for my current requirements. The content of this site may be still relevant and it would also work with more recent versions of Debian and Android. I would expect that some minor modifications need to be made though. </p> +<p>A couple of years have passed since I last worked on Debroid. Currently, I am using the Termux app on Android, which is less sophisticated than a fully blown Debian installation but sufficient for my current requirements. The content of this site may be still relevant, and it would also work with more recent versions of Debian and Android. I would expect that some minor modifications need to be made, though. </p> <h2>Step by step guide</h2> <p>All scripts mentioned here can be found on GitHub at:</p> <a class="textlink" href="https://github.com/snonux/debroid">https://github.com/snonux/debroid</a><br /> <h3>First debootstrap stage</h3> -<p>This is to be performed on a Fedora Linux machine (could work on a Debian too, but Fedora is just what I use on my personal Laptop). The following steps prepare an initial Debian base image, which then later can be transferred to the phone.</p> +<p>This is to be performed on a Fedora Linux machine (could work on a Debian too, but Fedora is just what I use on my Laptop). The following steps prepare an initial Debian base image, which can then be transferred to the phone.</p> <pre> sudo dnf install debootstrap # 5g @@ -188,7 +188,7 @@ exit # Exit chroot exit # Exit adb shell </pre> <h3>Include to Android startup:</h3> -<p>I you want to start Debroid automatically every time when your phone starts, then do the following:</p> +<p>If you want to start Debroid automatically whenever your phone starts, then do the following:</p> <pre> adb push data/local/userinit.sh /data/local/userinit.sh adb shell diff --git a/gemfeed/2016-04-03-offsite-backup-with-zfs.html b/gemfeed/2016-04-03-offsite-backup-with-zfs.html index 104ba814..3c32601a 100644 --- a/gemfeed/2016-04-03-offsite-backup-with-zfs.html +++ b/gemfeed/2016-04-03-offsite-backup-with-zfs.html @@ -63,16 +63,16 @@ h2, h3 { </pre> <p class="quote"><i>Written by Paul Buetow 2016-04-03</i></p> <h2>Please don't lose all my pictures again!</h2> -<p>When it comes to data storage and potential data loss I am a paranoid person. It is not just due to my job but also due to a personal experience I encountered over 10 years ago: A single drive failure and loss of all my data (pictures, music, ....).</p> -<p>A little about my personal infrastructure: I am running my own (mostly FreeBSD based) root servers (across several countries: Two in Germany, one in Canada, one in Bulgaria) which store all my online data (E-Mail and my Git repositories). I am syncing incremental (and encrypted) ZFS snapshots between these servers forth and back so either data could be recovered from the other server.</p> +<p>When it comes to data storage and potential data loss, I am a paranoid person. It is due to my job and a personal experience I encountered over ten years ago: A single drive failure and loss of all my data (pictures, music, etc.).</p> +<p>A little about my personal infrastructure: I am running my own (mostly FreeBSD based) root servers (across several countries: Two in Germany, one in Canada, one in Bulgaria) which store all my online data (E-Mail and my Git repositories). I am syncing incremental (and encrypted) ZFS snapshots between these servers forth and back so either data can be recovered from the other server.</p> <h2>Local storage box for offline data</h2> -<p>Also, I am operating a local server (an HP MicroServer) at home in my apartment. Full snapshots of all ZFS volumes are pulled from the "online" servers to the local server every other week and the incremental ZFS snapshots every day. That local server has a ZFS ZMIRROR with 3 disks configured (local triple redundancy). I keep up to half a year worth of ZFS snapshots of all volumes. That local server also contains all my offline data such as pictures, private documents, videos, books, various other backups, etc.</p> -<p>Once weekly all the data of that local server is copied to two external USB drives as a backup (without the historic snapshots). For simplicity these USB drives are not formatted with ZFS but with good old UFS. This gives me a chance to recover from a (potential) ZFS disaster. ZFS is a complex thing. Sometimes it is good not to trust complex things!</p> +<p>Also, I am operating a local server (an HP MicroServer) at home in my apartment. Full snapshots of all ZFS volumes are pulled from the "online" servers to the local server every other week and the incremental ZFS snapshots every day. That local server has a ZFS ZMIRROR with three disks configured (local triple redundancy). I keep up to half a year worth of ZFS snapshots of all volumes. That local server also contains all my offline data such as pictures, private documents, videos, books, various other backups, etc.</p> +<p>Once weekly, all the local server data is copied to two external USB drives as a backup (without the historic snapshots). For simplicity, these USB drives are not formatted with ZFS but with good old UFS. This gives me a chance to recover from a (potential) ZFS disaster. ZFS is a complex thing. Sometimes it is good not to trust complicated things!</p> <h2>Storing it at my apartment is not enough</h2> -<p>Now I am thinking about an offsite backup of all this local data. The problem is, that all the data remains on a single physical location: My local MicroServer. What happens when the house burns or someone steals my server including the internal disks and the attached USB drives? My first thought was to back up everything to the "cloud". The major issue here is however the limited amount of available upload bandwidth (only 1MBit/s).</p> -<p>The solution is adding another USB drive (2TB) with an encryption container (GELI) and a ZFS pool on it. The GELI encryption requires a secret key and a secret passphrase. I am updating the data to that drive once every 3 months (my calendar is reminding me about it) and afterwards I keep that drive at a secret location outside of my apartment. All the information needed to decrypt (mounting the GELI container) is stored at another (secure) place. Key and passphrase are kept at different places though. Even if someone would know of it, he would not be able to decrypt it as some additional insider knowledge would be required as well.</p> +<p>Now I am thinking about an offsite backup of all this local data. The problem is that all the data remains on a single physical location: My local MicroServer. What happens when the house burns or my server, including the internal disks and the attached USB drives, gets stolen? My first thought was to back up everything to the "cloud". However, the significant issue here is the limited amount of available upload bandwidth (only 1MBit/s).</p> +<p>The solution is adding another USB drive (2TB) with an encryption container (GELI) and a ZFS pool. The GELI encryption requires a secret key and a secret passphrase. I am updating the data to that drive once every three months (my calendar is reminding me about it), and afterwards, I keep that drive at a secret location outside of my apartment. All the information needed to decrypt (mounting the GELI container) is stored at another (secure) place. Key and passphrase are kept at different sites, though. Even if someone knew of it, he would not be able to decrypt it as some additional insider knowledge would be required as well.</p> <h2>Walking one round less</h2> -<p>I am thinking of buying a second 2TB USB drive and to set it up the same way as the first one. So I could alternate the backups. One drive would be at the secret location, and the other drive would be at home. And these drives would swap location after each cycle. This would give some security about the failure of that drive and I would have to go to the secret location only once (swapping the drives) instead of twice (picking that drive up in order to update the data + bringing it back to the secret location).</p> +<p>I am thinking of buying a second 2TB USB drive and setting it up the same way as the first one. So I could alternate the backups. One drive would be at the secret location, and the other drive would be at home. And these drives would swap place after each cycle. This would give some security about the failure of that drive, and I would have to go to the secret location only once (swapping the drives) instead of twice (picking that drive up to update the data + bringing it back to the remote location).</p> <p>E-Mail me your thoughts at comments@mx.buetow.org!</p> <a class="textlink" href="../">Go back to the main site</a><br /> <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> diff --git a/gemfeed/2016-04-16-offsite-backup-with-zfs-part2.html b/gemfeed/2016-04-16-offsite-backup-with-zfs-part2.html index 714b39ea..559c83b4 100644 --- a/gemfeed/2016-04-16-offsite-backup-with-zfs-part2.html +++ b/gemfeed/2016-04-16-offsite-backup-with-zfs-part2.html @@ -65,9 +65,9 @@ h2, h3 { </pre> <p class="quote"><i>Written by Paul Buetow 2016-04-16</i></p> <a class="textlink" href="./2016-04-03-offsite-backup-with-zfs.html">Read the first part before reading any furter here...</a><br /> -<p>I enhanced the procedure a bit. From now on I am having two external 2TB USB hard drives. Both are setup exactly the same way. To decrease the probability that they will not fail at about the same time both drives are of different brands. One drive is kept at the secret location. The other one is kept at home right next to my HP MicroServer.</p> -<p>Whenever I am updating offsite backup, I am doing it to the drive which is kept locally. Afterwards I bring it to the secret location and swap the drives and bring the other one back home. This ensures that I will always have an offiste backup available at a different location than my home - even while updating one copy of it.</p> -<p>Furthermore, I added scrubbing (*zpool scrub...*) to the script. It ensures that the file system is consistent and that there are no bad blocks on the disk and the file system. To increase the reliability I also run a *zfs set copies=2 zroot*. That setting is also synchronized to the offsite ZFS pool. ZFS stores every data block to disk twice now. Yes, it consumes twice as much disk space but it makes it better fault tolerant against hardware errors (e.g. only individual disk sectors going bad). </p> +<p>I enhanced the procedure a bit. From now on, I have two external 2TB USB hard drives. Both are set up precisely the same way. To decrease the probability that both drives will not fail simultaneously, they are of different brands. One drive is kept at a secret location. The other one is held at home, right next to my HP MicroServer.</p> +<p>Whenever I update the offsite backup, I am doing it to the drive, which is kept locally. Afterwards, I bring it to the secret location, swap the drives, and bring the other back home. This ensures that I will always have an offsite backup available at a different location than my home - even while updating one copy of it.</p> +<p>Furthermore, I added scrubbing ("zpool scrub...") to the script. It ensures that the file system is consistent and that there are no bad blocks on the disk and the file system. To increase the reliability, I also run a "zfs set copies=2 zroot". That setting is also synchronized to the offsite ZFS pool. ZFS stores every data block to disk twice now. Yes, it consumes twice as much disk space, making it better fault-tolerant against hardware errors (e.g. only individual disk sectors going bad). </p> <p>E-Mail me your thoughts at comments@mx.buetow.org!</p> <a class="textlink" href="../">Go back to the main site</a><br /> <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> diff --git a/gemfeed/2016-05-22-spinning-up-my-own-authoritative-dns-servers.html b/gemfeed/2016-05-22-spinning-up-my-own-authoritative-dns-servers.html index 893f25c4..dfe52e25 100644 --- a/gemfeed/2016-05-22-spinning-up-my-own-authoritative-dns-servers.html +++ b/gemfeed/2016-05-22-spinning-up-my-own-authoritative-dns-servers.html @@ -51,10 +51,10 @@ h2, h3 { <h1>Spinning up my own authoritative DNS servers</h1> <p class="quote"><i>Written by Paul Buetow 2016-05-22</i></p> <h2>Background</h2> -<p>Finally, I had time to deploy my own authoritative DNS servers (master and slave) for my domains "buetow.org" and "buetow.zone". My domain name provider is Schlund Technologies. They allow their customers to manually edit the DNS records (BIND files). And they also give you the opportunity to set your own authoritative DNS servers for your domains. From now, I am making use of that option.</p> +<p>Finally, I had time to deploy my authoritative DNS servers (master and slave) for my domains "buetow.org" and "buetow.zone". My domain name provider is Schlund Technologies. They allow their customers to edit the DNS records (BIND files) manually. And they also allow you to set your authoritative DNS servers for your domains. From now, I am making use of that option.</p> <a class="textlink" href="http://www.schlundtech.de">Schlund Technologies</a><br /> <h2>All FreeBSD Jails</h2> -<p>In order to set up my authoritative DNS servers I installed a FreeBSD Jail dedicated for DNS with Puppet on my root machine as follows:</p> +<p>To set up my authoritative DNS servers, I installed a FreeBSD Jail dedicated for DNS with Puppet on my root machine as follows:</p> <pre> include freebsd @@ -88,7 +88,7 @@ class { 'jail': } </pre> <h2>PF firewall</h2> -<p>Please note that "dns.ian.buetow.org" is just the Jail name of the master DNS server (and "caprica.ian.buetow.org" the name of the Jail for the slave DNS server) and that I am using the DNS names "dns1.buetow.org" (master) and "dns2.buetow.org" (slave) for the actual service names (these are the DNS servers visible to the public). Please also note that the IPv4 address is an internal one. I have a PF to use NAT and PAT. The DNS ports are being forwarded (TCP and UDP) to that Jail. By default, all ports are blocked, so I am adding an exception rule for the IPv6 address as well. These are the PF rules in use:</p> +<p>Please note that "dns.ian.buetow.org" is just the Jail name of the master DNS server (and "caprica.ian.buetow.org" the name of the Jail for the slave DNS server) and that I am using the DNS names "dns1.buetow.org" (master) and "dns2.buetow.org" (slave) for the actual service names (these are the DNS servers visible to the public). Please also note that the IPv4 address is an internal one. I have a PF to use NAT and PAT. The DNS ports are being forwarded (TCP and UDP) to that Jail. By default, all ports are blocked, so I am adding an exception rule for the IPv6 address. These are the PF rules in use:</p> <pre> % cat /etc/pf.conf . @@ -102,15 +102,15 @@ pass in on re0 inet6 proto udp from any to 2a01:4f8:120:30e8::15 port {53} flags . </pre> <h2>Puppet managed BIND zone files</h2> -<p>In "manifests/dns.pp" (the Puppet manifest for the Master DNS Jail itself) I configured the BIND DNS server this way:</p> +<p>In "manifests/dns.pp" (the Puppet manifest for the Master DNS Jail itself), I configured the BIND DNS server this way:</p> <pre> class { 'bind_freebsd': config => "puppet:///files/bind/named.${::hostname}.conf", dynamic_config => "puppet:///files/bind/dynamic.${::hostname}", } </pre> -<p>The Puppet module is actually a pretty simple one. It installs the file "/usr/local/etc/named/named.conf" and it populates the "/usr/local/etc/named/dynamicdb" directory with all my zone files.</p> -<p>Once (Puppet-) applied inside of the Jail I get this:</p> +<p>The Puppet module is a pretty simple one. It installs the file "/usr/local/etc/named/named.conf" and it populates the "/usr/local/etc/named/dynamicdb" directory with all my zone files.</p> +<p>Once (Puppet-) applied inside of the Jail, I get this:</p> <pre> paul uranus:~/git/blog/source [4268]% ssh admin@dns1.buetow.org.buetow.org pgrep -lf named 60748 /usr/local/sbin/named -u bind -c /usr/local/etc/namedb/named.conf @@ -152,7 +152,7 @@ dns2 86400 IN AAAA 2a03:2500:1:6:20:: . . </pre> -<p>That is my master DNS server. My slave DNS server runs in another Jail on another bare metal machine. Everything is set up similar to the master DNS server. However, that server is located in a different DC and in different IP subnets. The only difference is the "named.conf". It's configured to be a slave and that means that the "dynamicdb" gets populated by BIND itself while doing zone transfers from the master.</p> +<p>That is my master DNS server. My slave DNS server runs in another Jail on another bare-metal machine. Everything is set up similar to the master DNS server. However, that server is located in a different DC and different IP subnets. The only difference is the "named.conf". It's configured to be a slave, and that means that the "dynamicdb" gets populated by BIND itself while doing zone transfers from the master.</p> <pre> paul uranus:~/git/blog/source [4279]% ssh admin@dns2.buetow.org tail -n 11 /usr/local/etc/namedb/named.conf zone "buetow.org" { @@ -167,8 +167,8 @@ zone "buetow.zone" { file "/usr/local/etc/namedb/dynamic/buetow.zone"; }; </pre> -<h2>The end result</h2> -<p>The end result looks like this now:</p> +<h2>The result</h2> +<p>The result looks like this now:</p> <pre> % dig -t ns buetow.org ; <<>> DiG 9.10.3-P4-RedHat-9.10.3-12.P4.fc23 <<>> -t ns buetow.org @@ -225,7 +225,7 @@ dns2.buetow.org. 86400 IN AAAA 2a03:2500:1:6:20:: ;; MSG SIZE rcvd: 322 </pre> <h2>Monitoring</h2> -<p>For monitoring I am using Icinga2 (I am operating two Icinga2 instances in two different DCs). I may have to post another blog article about Icinga2 but to get the idea these were the snippets added to my Icinga2 configuration:</p> +<p>For monitoring, I am using Icinga2 (I am operating two Icinga2 instances in two different DCs). I may have to post another blog article about Icinga2, but to get the idea, these were the snippets added to my Icinga2 configuration:</p> <pre> apply Service "dig" { import "generic-service" @@ -249,12 +249,12 @@ apply Service "dig6" { } </pre> <h2>DNS update workflow</h2> -<p>Whenever I have to change a DNS entry all have to do is:</p> +<p>Whenever I have to change a DNS entry, all I have to do is:</p> <ul> <li>Git clone or update the Puppet repository</li> <li>Update/commit and push the zone file (e.g. "buetow.org")</li> <li>Wait for Puppet. Puppet will deploy that updated zone file. And it will reload the BIND server.</li> -<li>The BIND server will notify all slave DNS servers (at the moment only one). And it will transfer the new version of the zone.</li> +<li>The BIND server will notify all slave DNS servers (at the moment, only one). And it will transfer the new version of the zone.</li> </ul> <p>That's much more comfortable now than manually clicking at some web UIs at Schlund Technologies.</p> <p>E-Mail me your thoughts at comments@mx.buetow.org!</p> diff --git a/gemfeed/2016-11-20-methods-in-c.html b/gemfeed/2016-11-20-methods-in-c.html index 4187e741..02677add 100644 --- a/gemfeed/2016-11-20-methods-in-c.html +++ b/gemfeed/2016-11-20-methods-in-c.html @@ -50,9 +50,9 @@ h2, h3 { <body> <h1>Methods in C</h1> <p class="quote"><i>Written by Paul Buetow 2016-11-20</i></p> -<p>You can do some sort of object oriented programming in the C Programming Language. However, that is very limited. But also very easy and straight forward to use.</p> +<p>You can do some sort of object-oriented programming in the C Programming Language. However, that is very limited. But also very easy and straightforward to use.</p> <h2>Example</h2> -<p>Lets have a look at the following sample program. Basically all you have to do is to add a function pointer such as "calculate" to the definition of struct "something_s". Later, during the struct initialization, assign a function address to that function pointer:</p> +<p>Let's have a look at the following sample program. All you have to do is to add a function pointer such as "calculate" to the definition of struct "something_s". Later, during the struct initialization, assign a function address to that function pointer:</p> <pre> #include <stdio.h> @@ -86,7 +86,7 @@ int main(void) { printf("%s(%f, %f) => %f\n", div.name, a, b, div.calculate(a,b)); } </pre> -<p>As you can see you can call the function (pointed by the function pointer) the same way as in C++ or Java via:</p> +<p>As you can see, you can call the function (pointed by the function pointer) the same way as in C++ or Java via:</p> <pre> printf("%s(%f, %f) => %f\n", mult.name, a, b, mult.calculate(a,b)); printf("%s(%f, %f) => %f\n", div.name, a, b, div.calculate(a,b)); @@ -105,13 +105,13 @@ Division(3.000000, 2.000000) => 1.500000 </pre> <p>Not complicated at all, but nice to know and helps to make the code easier to read!</p> <h2>The flaw</h2> -<p>That's actually not really how it works in object oriented languages such as Java and C++. The method call in this example is not really a method call as "mult" and "div" in this example are not "message receivers". What I mean by that is that the functions can not access the state of the "mult" and "div" struct objects. In C you would need to do something like this instead if you wanted to access the state of "mult" from within the calculate function, you would have to pass it as an argument:</p> +<p>However, that's not really how it works in object-oriented languages such as Java and C++. The method call in this example is not a method call as "mult" and "div" in this example are not "message receivers". I mean that the functions can not access the state of the "mult" and "div" struct objects. In C, you would need to do something like this instead if you wanted to access the state of "mult" from within the calculate function, you would have to pass it as an argument:</p> <pre> mult.calculate(mult,a,b)); </pre> -<p>How to overcome this? You need to take it further...</p> +<p>How to overcome this? You need to take it further.</p> <h2>Taking it further</h2> -<p>If you want to take it further type "Object-Oriented Programming with ANSI-C" into your favorite internet search engine, you will find some crazy stuff. Some go as far as writing a C preprocessor in AWK, which takes some object oriented pseudo-C and transforms it to plain C so that the C compiler can compile it to machine code. This is actually similar to how the C++ language had its origins.</p> +<p>If you want to take it further, type "Object-Oriented Programming with ANSI-C" into your favourite internet search engine, you will find some crazy stuff. Some go as far as writing a C preprocessor in AWK, which takes some object-oriented pseudo-C and transforms it to plain C so that the C compiler can compile it to machine code. This is similar to how the C++ language had its origins.</p> <p>E-Mail me your thoughts at comments@mx.buetow.org!</p> <a class="textlink" href="../">Go back to the main site</a><br /> <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> diff --git a/gemfeed/2021-04-24-welcome-to-the-geminispace.html b/gemfeed/2021-04-24-welcome-to-the-geminispace.html index d8f52543..268ab9c6 100644 --- a/gemfeed/2021-04-24-welcome-to-the-geminispace.html +++ b/gemfeed/2021-04-24-welcome-to-the-geminispace.html @@ -50,9 +50,9 @@ h2, h3 { <body> <h1>Welcome to the Geminispace</h1> <p class="quote"><i>Written by Paul Buetow 2021-04-24, last updated 2021-04-30, ASCII Art by Andy Hood</i></p> -<p>Have you reached this article already via Gemini? You need a special client for that, web browsers such as Firefox, Chrome, Safari etc. don't support the Gemini protocol. The Gemini address of this site (or the address of this capsule as people say in Geminispace) is:</p> +<p>Have you reached this article already via Gemini? It requires a Gemini client; web browsers such as Firefox, Chrome, Safari, etc., don't support the Gemini protocol. The Gemini address of this site (or the address of this capsule as people say in Geminispace) is:</p> <a class="textlink" href="gemini://buetow.org">gemini://buetow.org</a><br /> -<p>If you however still use HTTP then you are just surfing the fallback HTML version of this capsule. In that case I suggest reading on what this is all about :-).</p> +<p>However, if you still use HTTP, you are just surfing the fallback HTML version of this capsule. In that case, I suggest reading on what this is all about :-).</p> <pre> /\ @@ -74,17 +74,17 @@ h2, h3 { </pre> <h2>Motivation</h2> <h3>My urge to revamp my personal website</h3> -<p>For some time I had to urge to revamp my personal website. Not to update the technology and the design of it but to update all the content (+ keep it current) and also to start a small tech blog again. So unconsciously I started to search for a good platform and/or software to do all of that in a KISS (keep it simple & stupid) way.</p> +<p>For some time, I had to urge to revamp my personal website. Not to update the technology and its design but to update all the content (+ keep it current) and start a small tech blog again. So unconsciously, I began to search for an excellent platform to do all of that in a KISS (keep it simple & stupid) way.</p> <h3>My still great Laptop running hot</h3> -<p>Earlier this year (2021) I noticed that my almost 7 year old but still great Laptop started to become hot and slowed down while surfing the web. Also, the Laptop's fan became quite noisy. This is all due to the additional bloat such as JavaScript, excessive use of CSS, tracking cookies+pixels, ads and so on there was on the website. </p> -<p>All what I wanted was to read an interesting article but after a big advertising pop-up banner appeared and made everything worse I gave up and closed the browser tab.</p> +<p>Earlier this year (2021), I noticed that my almost seven-year-old but still great Laptop started to become hot and slowed down while surfing the web. Also, the Laptop's fan became quite noisy. This was all due to the additional bloat such as JavaScript, excessive use of CSS, tracking cookies+pixels, ads, and so on there was on the website. </p> +<p>All I wanted was to read an interesting article, but after a big advertising pop-up banner appeared and made everything worse, I gave up and closed the browser tab.</p> <h2>Discovering the Gemini internet protocol</h2> -<p>Around the same time I discovered a relatively new more lightweight protocol named Gemini which does not support all these CPU intensive features like HTML, JavaScript and CSS do. Also, tracking and ads is not supported by the Gemini protocol.</p> -<p>The "downside" is that due to the limited capabilities of the Gemini protocol all sites look very old and spartan. But that is not really a downside, that is in fact a design choice people made. It is up to the client software how your capsule looks. For example, you could use a graphical client with nice font renderings and colors to improve the appearance. Or you could just use a very minimalistic command line black-and-white Gemini client. It's your (the user's) choice.</p> +<p>Around the same time, I discovered a relatively new, more lightweight protocol named Gemini, which does not support all these CPU-intensive features like HTML, JavaScript, and CSS. Also, tracking and ads are unsupported by the Gemini protocol.</p> +<p>The "downside" is that due to the limited capabilities of the Gemini protocol, all sites look very old and spartan. But that is not a downside; that is, in fact, a design choice people made. It is up to the client software how your capsule looks. For example, you could use a graphical client with nice font renderings and colours to improve the appearance. Or you could use a very minimalistic command line black-and-white Gemini client. It's your (the user's) choice.</p> <i>Screenshot Amfora Gemini terminal client surfing this site:</i><a href="./2021-04-24-welcome-to-the-geminispace/amfora-screenshot.png"><img alt="Screenshot Amfora Gemini terminal client surfing this site" title="Screenshot Amfora Gemini terminal client surfing this site" src="./2021-04-24-welcome-to-the-geminispace/amfora-screenshot.png" /></a><br /> -<p>Why is there a need for a new protocol? As the modern web is a superset of Gemini, can't we just use simple HTML 1.0? That's a good and valid question. It is not a technical problem but a human problem. We tend to abuse the features once they are available. You can be sure that things stay simple and efficient as long as you are using the Gemini protocol. On the other hand you can't force every website in the modern web to only create plain and simple looking HTML pages.</p> +<p>Why is there a need for a new protocol? As the modern web is a superset of Gemini, can't we use simple HTML 1.0 instead? That's a good and valid question. It is not a technical problem but a human problem. We tend to abuse the features once they are available. You can ensure that things stay efficient and straightforward as long as you are using the Gemini protocol. On the other hand, you can't force every website on the modern web to only create plain and straightforward-looking HTML pages.</p> <h2>My own Gemini capsule</h2> -<p>As it is very easy to set up and maintain your own Gemini capsule (Gemini server + content composed via the Gemtext markup language) I decided to create my own. What I really like about Gemini is that I can just use my favorite text editor and get typing. I don't need to worry about the style and design of the presence and I also don't have to test anything in ten different web browsers. I can only focus on the content! As a matter of fact, I am using the Vim editor + it's spellchecker + auto word completion functionality to write this. </p> +<p>As it is effortless to set up and maintain your own Gemini capsule (Gemini server + content composed via the Gemtext markup language), I decided to create my own. What I like about Gemini is that I can use my favourite text editor and get typing. I don't need to worry about the style and design of the presence, and I also don't have to test anything in ten different web browsers. I can only focus on the content! As a matter of fact, I am using the Vim editor + its spellchecker + auto word completion functionality to write this. </p> <h2>Advantages summarised</h2> <ul> <li>Supports an alternative to the modern bloated web</li> @@ -93,10 +93,10 @@ h2, h3 { <li>It's the client's responsibility how the content is designed+presented</li> <li>Lightweight (although not as lightweight as the Gopher protocol)</li> <li>Supports privacy (no cookies, no request header fingerprinting, TLS encryption)</li> -<li>Fun to play with (it's a bit geeky yes, but a lot of fun!)</li> +<li>Fun to play with (it's a bit geeky, yes, but a lot of fun!)</li> </ul> <h2>Dive into deep Gemini space</h2> -<p>Check out one of the following links for more information about Gemini. For example, you will find a FAQ which explains why the protocol is named "Gemini". Many Gemini capsules are dual hosted via Gemini and HTTP(S), so that people new to Gemini can sneak peek the content with a normal web browser. As a matter of fact, some people go as far as tri-hosting all their content via HTTP(S), Gemini and Gopher.</p> +<p>Check out one of the following links for more information about Gemini. For example, you will find a FAQ that explains why the protocol is named Gemini. Many Gemini capsules are dual-hosted via Gemini and HTTP(S) so that people new to Gemini can sneak peek at the content with a regular web browser. Some people go as far as tri-hosting all their content via HTTP(S), Gemini and Gopher.</p> <a class="textlink" href="gemini://gemini.circumlunar.space">gemini://gemini.circumlunar.space</a><br /> <a class="textlink" href="https://gemini.circumlunar.space">https://gemini.circumlunar.space</a><br /> <p>E-Mail me your thoughts at comments@mx.buetow.org!</p> diff --git a/gemfeed/2021-05-16-personal-bash-coding-style-guide.html b/gemfeed/2021-05-16-personal-bash-coding-style-guide.html index 59a2d5c4..2bb03c9a 100644 --- a/gemfeed/2021-05-16-personal-bash-coding-style-guide.html +++ b/gemfeed/2021-05-16-personal-bash-coding-style-guide.html @@ -67,11 +67,11 @@ h2, h3 { <h2>My modifications</h2> <p>These are my modifications to the Google Guide.</p> <h3>Shebang</h3> -<p>Google recommends using always</p> +<p>Google recommends using always...</p> <pre> #!/bin/bash </pre> -<p>as the shebang line, but that does not work on all Unix and Unix-like operating systems (e.g., the *BSDs don't have Bash installed to /bin/bash). Better is:</p> +<p>... as the shebang line, but that does not work on all Unix and Unix-like operating systems (e.g., the *BSDs don't have Bash installed to /bin/bash). Better is:</p> <pre> #!/usr/bin/env bash </pre> @@ -101,7 +101,7 @@ command1 | command4 </pre> <h3>Quoting your variables</h3> -<p>Google recommends always quote your variables. Generally, you should do that only for variables where you are unsure about the content/values of the variables (e.g., content is from an external input source and may contain whitespace or other special characters). In my opinion, the code will become quite noisy when you always quote your variables like this:</p> +<p>Google recommends always quote your variables. Generally, it would be best if you did that only for variables where you are unsure about the content/values of the variables (e.g., content is from an external input source and may contain whitespace or other special characters). In my opinion, the code will become quite noisy when you always quote your variables like this:</p> <pre> greet () { local -r greeting="${1}" @@ -135,10 +135,10 @@ substitution="${string/#foo/bar}" addition="$(expr "${X}" + "${Y}")" substitution="$(echo "${string}" | sed -e 's/^foo/bar/')" </pre> -<p>I can't entirely agree here. The external commands (especially sed) are much more sophisticated and powerful than the Bash built-in versions. Sed can do much more than the Bash can ever do by itself when it comes to text manipulation (the name "sed" stands for streaming editor, after all).</p> -<p>I prefer to do light text processing with the Bash built-ins and more complicated text processing with external programs such as sed, grep, awk, cut, and tr. However, there is also the case of medium-light text processing where I would want to use external programs. That is so because I remember using them better than the Bash built-ins. The Bash can get relatively obscure here (even Perl will be more readable then - Side note: I love Perl).</p> +<p>I can't entirely agree here. The external commands (especially sed) are much more sophisticated and powerful than the built-in Bash versions. Sed can do much more than the Bash can ever do by itself when it comes to text manipulation (the name "sed" stands for streaming editor, after all).</p> +<p>I prefer to do light text processing with the Bash built-ins and more complicated text processing with external programs such as sed, grep, awk, cut, and tr. However, there is also medium-light text processing where I would want to use external programs. That is so because I remember using them better than the Bash built-ins. The Bash can get relatively obscure here (even Perl will be more readable then - Side note: I love Perl).</p> <p>Also, you would like to use an external command for floating-point calculation (e.g., bc) instead of using the Bash built-ins (worth noticing that ZSH supports built-in floating-points).</p> -<p>I even didn't get started with what you can do with Awk (especially GNU Awk), a fully-fledged programming language. Tiny Awk snippets tend to be used quite often in Shell scripts without honoring the real power of Awk. But if you did everything in Perl or Awk or another scripting language, then it wouldn't be a Bash script anymore, wouldn't it? ;-)</p> +<p>I even didn't get started with what you can do with awk (especially GNU Awk), a fully-fledged programming language. Tiny Awk snippets tend to be used quite often in Shell scripts without honouring the real power of Awk. But if you did everything in Perl or Awk or another scripting language, then it wouldn't be a Bash script anymore, wouldn't it? ;-)</p> <h2>My additions</h2> <h3>Use of 'yes' and 'no'</h3> <p>Bash does not support a boolean type. I tend just to use the strings 'yes' and 'no' here. I used 0 for false and 1 for true for some time, but I think that the yes/no strings are easier to read. Yes, the Bash script would need to perform string comparisons on every check, but if performance is crucial to you, you wouldn't want to use a Bash script anyway, correct?</p> @@ -169,7 +169,7 @@ eval $(set_my_variables) variable="$(eval some_function)" </pre> -<p>However, if I want to read variables from another file, I don't have to use eval here. I just source the file:</p> +<p>However, if I want to read variables from another file, I don't have to use eval here. I only have to source the file:</p> <pre> % cat vars.source.sh declare foo=bar @@ -232,7 +232,7 @@ main <p>The stdout is always passed as a pipe to the next following stage. The stderr is used for info logging.</p> <h3>Assign-then-shift</h3> <p>I often refactor existing Bash code. That leads me to add and removing function arguments quite often. It's pretty repetitive work changing the $1, $2.... function argument numbers every time you change the order or add/remove possible arguments.</p> -<p>The solution is to use of the "assign-then-shift"-method, which goes like this: "local -r var1=$1; shift; local -r var2=$1; shift". The idea is that you only use "$1" to assign function arguments to named (better readable) local function variables. You will never have to bother about "$2" or above. That is very useful when you constantly refactor your code and remove or add function arguments. It's something what I picked up from a colleague (a pure Bash wizard) some time ago:</p> +<p>The solution is to use of the "assign-then-shift"-method, which goes like this: "local -r var1=$1; shift; local -r var2=$1; shift". The idea is that you only use "$1" to assign function arguments to named (better readable) local function variables. You will never have to bother about "$2" or above. That is very useful when you constantly refactor your code and remove or add function arguments. It's something that I picked up from a colleague (a pure Bash wizard) some time ago:</p> <pre> some_function () { local -r param_foo="$1"; shift diff --git a/gemfeed/atom.xml b/gemfeed/atom.xml index 2413369f..0309ec08 100644 --- a/gemfeed/atom.xml +++ b/gemfeed/atom.xml @@ -1,6 +1,6 @@ <?xml version="1.0" encoding="utf-8"?> <feed xmlns="http://www.w3.org/2005/Atom"> - <updated>2021-05-23T21:44:07+01:00</updated> + <updated>2021-05-25T19:37:12+01:00</updated> <title>buetow.org feed</title> <subtitle>Having fun with computers!</subtitle> <link href="https://buetow.org/gemfeed/atom.xml" rel="self" /> @@ -37,11 +37,11 @@ <h2>My modifications</h2> <p>These are my modifications to the Google Guide.</p> <h3>Shebang</h3> -<p>Google recommends using always</p> +<p>Google recommends using always...</p> <pre> #!/bin/bash </pre> -<p>as the shebang line, but that does not work on all Unix and Unix-like operating systems (e.g., the *BSDs don't have Bash installed to /bin/bash). Better is:</p> +<p>... as the shebang line, but that does not work on all Unix and Unix-like operating systems (e.g., the *BSDs don't have Bash installed to /bin/bash). Better is:</p> <pre> #!/usr/bin/env bash </pre> @@ -71,7 +71,7 @@ command1 | command4 </pre> <h3>Quoting your variables</h3> -<p>Google recommends always quote your variables. Generally, you should do that only for variables where you are unsure about the content/values of the variables (e.g., content is from an external input source and may contain whitespace or other special characters). In my opinion, the code will become quite noisy when you always quote your variables like this:</p> +<p>Google recommends always quote your variables. Generally, it would be best if you did that only for variables where you are unsure about the content/values of the variables (e.g., content is from an external input source and may contain whitespace or other special characters). In my opinion, the code will become quite noisy when you always quote your variables like this:</p> <pre> greet () { local -r greeting="${1}" @@ -105,10 +105,10 @@ substitution="${string/#foo/bar}" addition="$(expr "${X}" + "${Y}")" substitution="$(echo "${string}" | sed -e 's/^foo/bar/')" </pre> -<p>I can't entirely agree here. The external commands (especially sed) are much more sophisticated and powerful than the Bash built-in versions. Sed can do much more than the Bash can ever do by itself when it comes to text manipulation (the name "sed" stands for streaming editor, after all).</p> -<p>I prefer to do light text processing with the Bash built-ins and more complicated text processing with external programs such as sed, grep, awk, cut, and tr. However, there is also the case of medium-light text processing where I would want to use external programs. That is so because I remember using them better than the Bash built-ins. The Bash can get relatively obscure here (even Perl will be more readable then - Side note: I love Perl).</p> +<p>I can't entirely agree here. The external commands (especially sed) are much more sophisticated and powerful than the built-in Bash versions. Sed can do much more than the Bash can ever do by itself when it comes to text manipulation (the name "sed" stands for streaming editor, after all).</p> +<p>I prefer to do light text processing with the Bash built-ins and more complicated text processing with external programs such as sed, grep, awk, cut, and tr. However, there is also medium-light text processing where I would want to use external programs. That is so because I remember using them better than the Bash built-ins. The Bash can get relatively obscure here (even Perl will be more readable then - Side note: I love Perl).</p> <p>Also, you would like to use an external command for floating-point calculation (e.g., bc) instead of using the Bash built-ins (worth noticing that ZSH supports built-in floating-points).</p> -<p>I even didn't get started with what you can do with Awk (especially GNU Awk), a fully-fledged programming language. Tiny Awk snippets tend to be used quite often in Shell scripts without honoring the real power of Awk. But if you did everything in Perl or Awk or another scripting language, then it wouldn't be a Bash script anymore, wouldn't it? ;-)</p> +<p>I even didn't get started with what you can do with awk (especially GNU Awk), a fully-fledged programming language. Tiny Awk snippets tend to be used quite often in Shell scripts without honouring the real power of Awk. But if you did everything in Perl or Awk or another scripting language, then it wouldn't be a Bash script anymore, wouldn't it? ;-)</p> <h2>My additions</h2> <h3>Use of 'yes' and 'no'</h3> <p>Bash does not support a boolean type. I tend just to use the strings 'yes' and 'no' here. I used 0 for false and 1 for true for some time, but I think that the yes/no strings are easier to read. Yes, the Bash script would need to perform string comparisons on every check, but if performance is crucial to you, you wouldn't want to use a Bash script anyway, correct?</p> @@ -139,7 +139,7 @@ eval $(set_my_variables) variable="$(eval some_function)" </pre> -<p>However, if I want to read variables from another file, I don't have to use eval here. I just source the file:</p> +<p>However, if I want to read variables from another file, I don't have to use eval here. I only have to source the file:</p> <pre> % cat vars.source.sh declare foo=bar @@ -202,7 +202,7 @@ main <p>The stdout is always passed as a pipe to the next following stage. The stderr is used for info logging.</p> <h3>Assign-then-shift</h3> <p>I often refactor existing Bash code. That leads me to add and removing function arguments quite often. It's pretty repetitive work changing the $1, $2.... function argument numbers every time you change the order or add/remove possible arguments.</p> -<p>The solution is to use of the "assign-then-shift"-method, which goes like this: "local -r var1=$1; shift; local -r var2=$1; shift". The idea is that you only use "$1" to assign function arguments to named (better readable) local function variables. You will never have to bother about "$2" or above. That is very useful when you constantly refactor your code and remove or add function arguments. It's something what I picked up from a colleague (a pure Bash wizard) some time ago:</p> +<p>The solution is to use of the "assign-then-shift"-method, which goes like this: "local -r var1=$1; shift; local -r var2=$1; shift". The idea is that you only use "$1" to assign function arguments to named (better readable) local function variables. You will never have to bother about "$2" or above. That is very useful when you constantly refactor your code and remove or add function arguments. It's something that I picked up from a colleague (a pure Bash wizard) some time ago:</p> <pre> some_function () { local -r param_foo="$1"; shift @@ -328,9 +328,9 @@ fi <div xmlns="http://www.w3.org/1999/xhtml"> <h1>Welcome to the Geminispace</h1> <p class="quote"><i>Written by Paul Buetow 2021-04-24, last updated 2021-04-30, ASCII Art by Andy Hood</i></p> -<p>Have you reached this article already via Gemini? You need a special client for that, web browsers such as Firefox, Chrome, Safari etc. don't support the Gemini protocol. The Gemini address of this site (or the address of this capsule as people say in Geminispace) is:</p> +<p>Have you reached this article already via Gemini? It requires a Gemini client; web browsers such as Firefox, Chrome, Safari, etc., don't support the Gemini protocol. The Gemini address of this site (or the address of this capsule as people say in Geminispace) is:</p> <a class="textlink" href="https://buetow.org">https://buetow.org</a><br /> -<p>If you however still use HTTP then you are just surfing the fallback HTML version of this capsule. In that case I suggest reading on what this is all about :-).</p> +<p>However, if you still use HTTP, you are just surfing the fallback HTML version of this capsule. In that case, I suggest reading on what this is all about :-).</p> <pre> /\ @@ -352,17 +352,17 @@ fi </pre> <h2>Motivation</h2> <h3>My urge to revamp my personal website</h3> -<p>For some time I had to urge to revamp my personal website. Not to update the technology and the design of it but to update all the content (+ keep it current) and also to start a small tech blog again. So unconsciously I started to search for a good platform and/or software to do all of that in a KISS (keep it simple & stupid) way.</p> +<p>For some time, I had to urge to revamp my personal website. Not to update the technology and its design but to update all the content (+ keep it current) and start a small tech blog again. So unconsciously, I began to search for an excellent platform to do all of that in a KISS (keep it simple & stupid) way.</p> <h3>My still great Laptop running hot</h3> -<p>Earlier this year (2021) I noticed that my almost 7 year old but still great Laptop started to become hot and slowed down while surfing the web. Also, the Laptop's fan became quite noisy. This is all due to the additional bloat such as JavaScript, excessive use of CSS, tracking cookies+pixels, ads and so on there was on the website. </p> -<p>All what I wanted was to read an interesting article but after a big advertising pop-up banner appeared and made everything worse I gave up and closed the browser tab.</p> +<p>Earlier this year (2021), I noticed that my almost seven-year-old but still great Laptop started to become hot and slowed down while surfing the web. Also, the Laptop's fan became quite noisy. This was all due to the additional bloat such as JavaScript, excessive use of CSS, tracking cookies+pixels, ads, and so on there was on the website. </p> +<p>All I wanted was to read an interesting article, but after a big advertising pop-up banner appeared and made everything worse, I gave up and closed the browser tab.</p> <h2>Discovering the Gemini internet protocol</h2> -<p>Around the same time I discovered a relatively new more lightweight protocol named Gemini which does not support all these CPU intensive features like HTML, JavaScript and CSS do. Also, tracking and ads is not supported by the Gemini protocol.</p> -<p>The "downside" is that due to the limited capabilities of the Gemini protocol all sites look very old and spartan. But that is not really a downside, that is in fact a design choice people made. It is up to the client software how your capsule looks. For example, you could use a graphical client with nice font renderings and colors to improve the appearance. Or you could just use a very minimalistic command line black-and-white Gemini client. It's your (the user's) choice.</p> +<p>Around the same time, I discovered a relatively new, more lightweight protocol named Gemini, which does not support all these CPU-intensive features like HTML, JavaScript, and CSS. Also, tracking and ads are unsupported by the Gemini protocol.</p> +<p>The "downside" is that due to the limited capabilities of the Gemini protocol, all sites look very old and spartan. But that is not a downside; that is, in fact, a design choice people made. It is up to the client software how your capsule looks. For example, you could use a graphical client with nice font renderings and colours to improve the appearance. Or you could use a very minimalistic command line black-and-white Gemini client. It's your (the user's) choice.</p> <i>Screenshot Amfora Gemini terminal client surfing this site:</i><a href="https://buetow.org/gemfeed/2021-04-24-welcome-to-the-geminispace/amfora-screenshot.png"><img alt="Screenshot Amfora Gemini terminal client surfing this site" title="Screenshot Amfora Gemini terminal client surfing this site" src="https://buetow.org/gemfeed/2021-04-24-welcome-to-the-geminispace/amfora-screenshot.png" /></a><br /> -<p>Why is there a need for a new protocol? As the modern web is a superset of Gemini, can't we just use simple HTML 1.0? That's a good and valid question. It is not a technical problem but a human problem. We tend to abuse the features once they are available. You can be sure that things stay simple and efficient as long as you are using the Gemini protocol. On the other hand you can't force every website in the modern web to only create plain and simple looking HTML pages.</p> +<p>Why is there a need for a new protocol? As the modern web is a superset of Gemini, can't we use simple HTML 1.0 instead? That's a good and valid question. It is not a technical problem but a human problem. We tend to abuse the features once they are available. You can ensure that things stay efficient and straightforward as long as you are using the Gemini protocol. On the other hand, you can't force every website on the modern web to only create plain and straightforward-looking HTML pages.</p> <h2>My own Gemini capsule</h2> -<p>As it is very easy to set up and maintain your own Gemini capsule (Gemini server + content composed via the Gemtext markup language) I decided to create my own. What I really like about Gemini is that I can just use my favorite text editor and get typing. I don't need to worry about the style and design of the presence and I also don't have to test anything in ten different web browsers. I can only focus on the content! As a matter of fact, I am using the Vim editor + it's spellchecker + auto word completion functionality to write this. </p> +<p>As it is effortless to set up and maintain your own Gemini capsule (Gemini server + content composed via the Gemtext markup language), I decided to create my own. What I like about Gemini is that I can use my favourite text editor and get typing. I don't need to worry about the style and design of the presence, and I also don't have to test anything in ten different web browsers. I can only focus on the content! As a matter of fact, I am using the Vim editor + its spellchecker + auto word completion functionality to write this. </p> <h2>Advantages summarised</h2> <ul> <li>Supports an alternative to the modern bloated web</li> @@ -371,10 +371,10 @@ fi <li>It's the client's responsibility how the content is designed+presented</li> <li>Lightweight (although not as lightweight as the Gopher protocol)</li> <li>Supports privacy (no cookies, no request header fingerprinting, TLS encryption)</li> -<li>Fun to play with (it's a bit geeky yes, but a lot of fun!)</li> +<li>Fun to play with (it's a bit geeky, yes, but a lot of fun!)</li> </ul> <h2>Dive into deep Gemini space</h2> -<p>Check out one of the following links for more information about Gemini. For example, you will find a FAQ which explains why the protocol is named "Gemini". Many Gemini capsules are dual hosted via Gemini and HTTP(S), so that people new to Gemini can sneak peek the content with a normal web browser. As a matter of fact, some people go as far as tri-hosting all their content via HTTP(S), Gemini and Gopher.</p> +<p>Check out one of the following links for more information about Gemini. For example, you will find a FAQ that explains why the protocol is named Gemini. Many Gemini capsules are dual-hosted via Gemini and HTTP(S) so that people new to Gemini can sneak peek at the content with a regular web browser. Some people go as far as tri-hosting all their content via HTTP(S), Gemini and Gopher.</p> <a class="textlink" href="https://gemini.circumlunar.space">https://gemini.circumlunar.space</a><br /> <a class="textlink" href="https://gemini.circumlunar.space">https://gemini.circumlunar.space</a><br /> <p>E-Mail me your thoughts at comments@mx.buetow.org!</p> @@ -615,9 +615,9 @@ Total time: 1213.00s <div xmlns="http://www.w3.org/1999/xhtml"> <h1>Methods in C</h1> <p class="quote"><i>Written by Paul Buetow 2016-11-20</i></p> -<p>You can do some sort of object oriented programming in the C Programming Language. However, that is very limited. But also very easy and straight forward to use.</p> +<p>You can do some sort of object-oriented programming in the C Programming Language. However, that is very limited. But also very easy and straightforward to use.</p> <h2>Example</h2> -<p>Lets have a look at the following sample program. Basically all you have to do is to add a function pointer such as "calculate" to the definition of struct "something_s". Later, during the struct initialization, assign a function address to that function pointer:</p> +<p>Let's have a look at the following sample program. All you have to do is to add a function pointer such as "calculate" to the definition of struct "something_s". Later, during the struct initialization, assign a function address to that function pointer:</p> <pre> #include <stdio.h> @@ -651,7 +651,7 @@ int main(void) { printf("%s(%f, %f) => %f\n", div.name, a, b, div.calculate(a,b)); } </pre> -<p>As you can see you can call the function (pointed by the function pointer) the same way as in C++ or Java via:</p> +<p>As you can see, you can call the function (pointed by the function pointer) the same way as in C++ or Java via:</p> <pre> printf("%s(%f, %f) => %f\n", mult.name, a, b, mult.calculate(a,b)); printf("%s(%f, %f) => %f\n", div.name, a, b, div.calculate(a,b)); @@ -670,13 +670,13 @@ Division(3.000000, 2.000000) => 1.500000 </pre> <p>Not complicated at all, but nice to know and helps to make the code easier to read!</p> <h2>The flaw</h2> -<p>That's actually not really how it works in object oriented languages such as Java and C++. The method call in this example is not really a method call as "mult" and "div" in this example are not "message receivers". What I mean by that is that the functions can not access the state of the "mult" and "div" struct objects. In C you would need to do something like this instead if you wanted to access the state of "mult" from within the calculate function, you would have to pass it as an argument:</p> +<p>However, that's not really how it works in object-oriented languages such as Java and C++. The method call in this example is not a method call as "mult" and "div" in this example are not "message receivers". I mean that the functions can not access the state of the "mult" and "div" struct objects. In C, you would need to do something like this instead if you wanted to access the state of "mult" from within the calculate function, you would have to pass it as an argument:</p> <pre> mult.calculate(mult,a,b)); </pre> -<p>How to overcome this? You need to take it further...</p> +<p>How to overcome this? You need to take it further.</p> <h2>Taking it further</h2> -<p>If you want to take it further type "Object-Oriented Programming with ANSI-C" into your favorite internet search engine, you will find some crazy stuff. Some go as far as writing a C preprocessor in AWK, which takes some object oriented pseudo-C and transforms it to plain C so that the C compiler can compile it to machine code. This is actually similar to how the C++ language had its origins.</p> +<p>If you want to take it further, type "Object-Oriented Programming with ANSI-C" into your favourite internet search engine, you will find some crazy stuff. Some go as far as writing a C preprocessor in AWK, which takes some object-oriented pseudo-C and transforms it to plain C so that the C compiler can compile it to machine code. This is similar to how the C++ language had its origins.</p> <p>E-Mail me your thoughts at comments@mx.buetow.org!</p> </div> </content> @@ -696,10 +696,10 @@ mult.calculate(mult,a,b)); <h1>Spinning up my own authoritative DNS servers</h1> <p class="quote"><i>Written by Paul Buetow 2016-05-22</i></p> <h2>Background</h2> -<p>Finally, I had time to deploy my own authoritative DNS servers (master and slave) for my domains "buetow.org" and "buetow.zone". My domain name provider is Schlund Technologies. They allow their customers to manually edit the DNS records (BIND files). And they also give you the opportunity to set your own authoritative DNS servers for your domains. From now, I am making use of that option.</p> +<p>Finally, I had time to deploy my authoritative DNS servers (master and slave) for my domains "buetow.org" and "buetow.zone". My domain name provider is Schlund Technologies. They allow their customers to edit the DNS records (BIND files) manually. And they also allow you to set your authoritative DNS servers for your domains. From now, I am making use of that option.</p> <a class="textlink" href="http://www.schlundtech.de">Schlund Technologies</a><br /> <h2>All FreeBSD Jails</h2> -<p>In order to set up my authoritative DNS servers I installed a FreeBSD Jail dedicated for DNS with Puppet on my root machine as follows:</p> +<p>To set up my authoritative DNS servers, I installed a FreeBSD Jail dedicated for DNS with Puppet on my root machine as follows:</p> <pre> include freebsd @@ -733,7 +733,7 @@ class { 'jail': } </pre> <h2>PF firewall</h2> -<p>Please note that "dns.ian.buetow.org" is just the Jail name of the master DNS server (and "caprica.ian.buetow.org" the name of the Jail for the slave DNS server) and that I am using the DNS names "dns1.buetow.org" (master) and "dns2.buetow.org" (slave) for the actual service names (these are the DNS servers visible to the public). Please also note that the IPv4 address is an internal one. I have a PF to use NAT and PAT. The DNS ports are being forwarded (TCP and UDP) to that Jail. By default, all ports are blocked, so I am adding an exception rule for the IPv6 address as well. These are the PF rules in use:</p> +<p>Please note that "dns.ian.buetow.org" is just the Jail name of the master DNS server (and "caprica.ian.buetow.org" the name of the Jail for the slave DNS server) and that I am using the DNS names "dns1.buetow.org" (master) and "dns2.buetow.org" (slave) for the actual service names (these are the DNS servers visible to the public). Please also note that the IPv4 address is an internal one. I have a PF to use NAT and PAT. The DNS ports are being forwarded (TCP and UDP) to that Jail. By default, all ports are blocked, so I am adding an exception rule for the IPv6 address. These are the PF rules in use:</p> <pre> % cat /etc/pf.conf . @@ -747,15 +747,15 @@ pass in on re0 inet6 proto udp from any to 2a01:4f8:120:30e8::15 port {53} flags . </pre> <h2>Puppet managed BIND zone files</h2> -<p>In "manifests/dns.pp" (the Puppet manifest for the Master DNS Jail itself) I configured the BIND DNS server this way:</p> +<p>In "manifests/dns.pp" (the Puppet manifest for the Master DNS Jail itself), I configured the BIND DNS server this way:</p> <pre> class { 'bind_freebsd': config => "puppet:///files/bind/named.${::hostname}.conf", dynamic_config => "puppet:///files/bind/dynamic.${::hostname}", } </pre> -<p>The Puppet module is actually a pretty simple one. It installs the file "/usr/local/etc/named/named.conf" and it populates the "/usr/local/etc/named/dynamicdb" directory with all my zone files.</p> -<p>Once (Puppet-) applied inside of the Jail I get this:</p> +<p>The Puppet module is a pretty simple one. It installs the file "/usr/local/etc/named/named.conf" and it populates the "/usr/local/etc/named/dynamicdb" directory with all my zone files.</p> +<p>Once (Puppet-) applied inside of the Jail, I get this:</p> <pre> paul uranus:~/git/blog/source [4268]% ssh admin@dns1.buetow.org.buetow.org pgrep -lf named 60748 /usr/local/sbin/named -u bind -c /usr/local/etc/namedb/named.conf @@ -797,7 +797,7 @@ dns2 86400 IN AAAA 2a03:2500:1:6:20:: . . </pre> -<p>That is my master DNS server. My slave DNS server runs in another Jail on another bare metal machine. Everything is set up similar to the master DNS server. However, that server is located in a different DC and in different IP subnets. The only difference is the "named.conf". It's configured to be a slave and that means that the "dynamicdb" gets populated by BIND itself while doing zone transfers from the master.</p> +<p>That is my master DNS server. My slave DNS server runs in another Jail on another bare-metal machine. Everything is set up similar to the master DNS server. However, that server is located in a different DC and different IP subnets. The only difference is the "named.conf". It's configured to be a slave, and that means that the "dynamicdb" gets populated by BIND itself while doing zone transfers from the master.</p> <pre> paul uranus:~/git/blog/source [4279]% ssh admin@dns2.buetow.org tail -n 11 /usr/local/etc/namedb/named.conf zone "buetow.org" { @@ -812,8 +812,8 @@ zone "buetow.zone" { file "/usr/local/etc/namedb/dynamic/buetow.zone"; }; </pre> -<h2>The end result</h2> -<p>The end result looks like this now:</p> +<h2>The result</h2> +<p>The result looks like this now:</p> <pre> % dig -t ns buetow.org ; <<>> DiG 9.10.3-P4-RedHat-9.10.3-12.P4.fc23 <<>> -t ns buetow.org @@ -870,7 +870,7 @@ dns2.buetow.org. 86400 IN AAAA 2a03:2500:1:6:20:: ;; MSG SIZE rcvd: 322 </pre> <h2>Monitoring</h2> -<p>For monitoring I am using Icinga2 (I am operating two Icinga2 instances in two different DCs). I may have to post another blog article about Icinga2 but to get the idea these were the snippets added to my Icinga2 configuration:</p> +<p>For monitoring, I am using Icinga2 (I am operating two Icinga2 instances in two different DCs). I may have to post another blog article about Icinga2, but to get the idea, these were the snippets added to my Icinga2 configuration:</p> <pre> apply Service "dig" { import "generic-service" @@ -894,12 +894,12 @@ apply Service "dig6" { } </pre> <h2>DNS update workflow</h2> -<p>Whenever I have to change a DNS entry all have to do is:</p> +<p>Whenever I have to change a DNS entry, all I have to do is:</p> <ul> <li>Git clone or update the Puppet repository</li> <li>Update/commit and push the zone file (e.g. "buetow.org")</li> <li>Wait for Puppet. Puppet will deploy that updated zone file. And it will reload the BIND server.</li> -<li>The BIND server will notify all slave DNS servers (at the moment only one). And it will transfer the new version of the zone.</li> +<li>The BIND server will notify all slave DNS servers (at the moment, only one). And it will transfer the new version of the zone.</li> </ul> <p>That's much more comfortable now than manually clicking at some web UIs at Schlund Technologies.</p> <p>E-Mail me your thoughts at comments@mx.buetow.org!</p> @@ -935,9 +935,9 @@ apply Service "dig6" { </pre> <p class="quote"><i>Written by Paul Buetow 2016-04-16</i></p> <a class="textlink" href="https://buetow.org/gemfeed/2016-04-03-offsite-backup-with-zfs.html">Read the first part before reading any furter here...</a><br /> -<p>I enhanced the procedure a bit. From now on I am having two external 2TB USB hard drives. Both are setup exactly the same way. To decrease the probability that they will not fail at about the same time both drives are of different brands. One drive is kept at the secret location. The other one is kept at home right next to my HP MicroServer.</p> -<p>Whenever I am updating offsite backup, I am doing it to the drive which is kept locally. Afterwards I bring it to the secret location and swap the drives and bring the other one back home. This ensures that I will always have an offiste backup available at a different location than my home - even while updating one copy of it.</p> -<p>Furthermore, I added scrubbing (*zpool scrub...*) to the script. It ensures that the file system is consistent and that there are no bad blocks on the disk and the file system. To increase the reliability I also run a *zfs set copies=2 zroot*. That setting is also synchronized to the offsite ZFS pool. ZFS stores every data block to disk twice now. Yes, it consumes twice as much disk space but it makes it better fault tolerant against hardware errors (e.g. only individual disk sectors going bad). </p> +<p>I enhanced the procedure a bit. From now on, I have two external 2TB USB hard drives. Both are set up precisely the same way. To decrease the probability that both drives will not fail simultaneously, they are of different brands. One drive is kept at a secret location. The other one is held at home, right next to my HP MicroServer.</p> +<p>Whenever I update the offsite backup, I am doing it to the drive, which is kept locally. Afterwards, I bring it to the secret location, swap the drives, and bring the other back home. This ensures that I will always have an offsite backup available at a different location than my home - even while updating one copy of it.</p> +<p>Furthermore, I added scrubbing ("zpool scrub...") to the script. It ensures that the file system is consistent and that there are no bad blocks on the disk and the file system. To increase the reliability, I also run a "zfs set copies=2 zroot". That setting is also synchronized to the offsite ZFS pool. ZFS stores every data block to disk twice now. Yes, it consumes twice as much disk space, making it better fault-tolerant against hardware errors (e.g. only individual disk sectors going bad). </p> <p>E-Mail me your thoughts at comments@mx.buetow.org!</p> </div> </content> @@ -1349,16 +1349,16 @@ Notice: Finished catalog run in 206.09 seconds </pre> <p class="quote"><i>Written by Paul Buetow 2016-04-03</i></p> <h2>Please don't lose all my pictures again!</h2> -<p>When it comes to data storage and potential data loss I am a paranoid person. It is not just due to my job but also due to a personal experience I encountered over 10 years ago: A single drive failure and loss of all my data (pictures, music, ....).</p> -<p>A little about my personal infrastructure: I am running my own (mostly FreeBSD based) root servers (across several countries: Two in Germany, one in Canada, one in Bulgaria) which store all my online data (E-Mail and my Git repositories). I am syncing incremental (and encrypted) ZFS snapshots between these servers forth and back so either data could be recovered from the other server.</p> +<p>When it comes to data storage and potential data loss, I am a paranoid person. It is due to my job and a personal experience I encountered over ten years ago: A single drive failure and loss of all my data (pictures, music, etc.).</p> +<p>A little about my personal infrastructure: I am running my own (mostly FreeBSD based) root servers (across several countries: Two in Germany, one in Canada, one in Bulgaria) which store all my online data (E-Mail and my Git repositories). I am syncing incremental (and encrypted) ZFS snapshots between these servers forth and back so either data can be recovered from the other server.</p> <h2>Local storage box for offline data</h2> -<p>Also, I am operating a local server (an HP MicroServer) at home in my apartment. Full snapshots of all ZFS volumes are pulled from the "online" servers to the local server every other week and the incremental ZFS snapshots every day. That local server has a ZFS ZMIRROR with 3 disks configured (local triple redundancy). I keep up to half a year worth of ZFS snapshots of all volumes. That local server also contains all my offline data such as pictures, private documents, videos, books, various other backups, etc.</p> -<p>Once weekly all the data of that local server is copied to two external USB drives as a backup (without the historic snapshots). For simplicity these USB drives are not formatted with ZFS but with good old UFS. This gives me a chance to recover from a (potential) ZFS disaster. ZFS is a complex thing. Sometimes it is good not to trust complex things!</p> +<p>Also, I am operating a local server (an HP MicroServer) at home in my apartment. Full snapshots of all ZFS volumes are pulled from the "online" servers to the local server every other week and the incremental ZFS snapshots every day. That local server has a ZFS ZMIRROR with three disks configured (local triple redundancy). I keep up to half a year worth of ZFS snapshots of all volumes. That local server also contains all my offline data such as pictures, private documents, videos, books, various other backups, etc.</p> +<p>Once weekly, all the local server data is copied to two external USB drives as a backup (without the historic snapshots). For simplicity, these USB drives are not formatted with ZFS but with good old UFS. This gives me a chance to recover from a (potential) ZFS disaster. ZFS is a complex thing. Sometimes it is good not to trust complicated things!</p> <h2>Storing it at my apartment is not enough</h2> -<p>Now I am thinking about an offsite backup of all this local data. The problem is, that all the data remains on a single physical location: My local MicroServer. What happens when the house burns or someone steals my server including the internal disks and the attached USB drives? My first thought was to back up everything to the "cloud". The major issue here is however the limited amount of available upload bandwidth (only 1MBit/s).</p> -<p>The solution is adding another USB drive (2TB) with an encryption container (GELI) and a ZFS pool on it. The GELI encryption requires a secret key and a secret passphrase. I am updating the data to that drive once every 3 months (my calendar is reminding me about it) and afterwards I keep that drive at a secret location outside of my apartment. All the information needed to decrypt (mounting the GELI container) is stored at another (secure) place. Key and passphrase are kept at different places though. Even if someone would know of it, he would not be able to decrypt it as some additional insider knowledge would be required as well.</p> +<p>Now I am thinking about an offsite backup of all this local data. The problem is that all the data remains on a single physical location: My local MicroServer. What happens when the house burns or my server, including the internal disks and the attached USB drives, gets stolen? My first thought was to back up everything to the "cloud". However, the significant issue here is the limited amount of available upload bandwidth (only 1MBit/s).</p> +<p>The solution is adding another USB drive (2TB) with an encryption container (GELI) and a ZFS pool. The GELI encryption requires a secret key and a secret passphrase. I am updating the data to that drive once every three months (my calendar is reminding me about it), and afterwards, I keep that drive at a secret location outside of my apartment. All the information needed to decrypt (mounting the GELI container) is stored at another (secure) place. Key and passphrase are kept at different sites, though. Even if someone knew of it, he would not be able to decrypt it as some additional insider knowledge would be required as well.</p> <h2>Walking one round less</h2> -<p>I am thinking of buying a second 2TB USB drive and to set it up the same way as the first one. So I could alternate the backups. One drive would be at the secret location, and the other drive would be at home. And these drives would swap location after each cycle. This would give some security about the failure of that drive and I would have to go to the secret location only once (swapping the drives) instead of twice (picking that drive up in order to update the data + bringing it back to the secret location).</p> +<p>I am thinking of buying a second 2TB USB drive and setting it up the same way as the first one. So I could alternate the backups. One drive would be at the secret location, and the other drive would be at home. And these drives would swap place after each cycle. This would give some security about the failure of that drive, and I would have to go to the secret location only once (swapping the drives) instead of twice (picking that drive up to update the data + bringing it back to the remote location).</p> <p>E-Mail me your thoughts at comments@mx.buetow.org!</p> </div> </content> @@ -1385,15 +1385,15 @@ Notice: Finished catalog run in 206.09 seconds </pre> <p class="quote"><i>Written by Paul Buetow 2015-12-05, last updated 2021-05-16</i></p> -<p>You can use the following tutorial to install a full-blown Debian GNU/Linux Chroot on a LG G3 D855 CyanogenMod 13 (Android 6). First of all you need to have root permissions on your phone and you also need to have the developer mode activated. The following steps have been tested on Linux (Fedora 23).</p> +<p>You can use the following tutorial to install a full-blown Debian GNU/Linux Chroot on an LG G3 D855 CyanogenMod 13 (Android 6). First of all, you need to have root permissions on your phone, and you also need to have the developer mode activated. The following steps have been tested on Linux (Fedora 23).</p> <a href="https://buetow.org/gemfeed/2015-12-05-run-debian-on-your-phone-with-debroid/Deboroid.png"><img src="https://buetow.org/gemfeed/2015-12-05-run-debian-on-your-phone-with-debroid/Deboroid.png" /></a><br /> <h2>Foreword</h2> -<p>A couple of years have passed since I last worked on Debroid. At the moment I am using the Termux app on Android, which is less sophisticated than a fully blown Debian installation, but sufficient for my current requirements. The content of this site may be still relevant and it would also work with more recent versions of Debian and Android. I would expect that some minor modifications need to be made though. </p> +<p>A couple of years have passed since I last worked on Debroid. Currently, I am using the Termux app on Android, which is less sophisticated than a fully blown Debian installation but sufficient for my current requirements. The content of this site may be still relevant, and it would also work with more recent versions of Debian and Android. I would expect that some minor modifications need to be made, though. </p> <h2>Step by step guide</h2> <p>All scripts mentioned here can be found on GitHub at:</p> <a class="textlink" href="https://github.com/snonux/debroid">https://github.com/snonux/debroid</a><br /> <h3>First debootstrap stage</h3> -<p>This is to be performed on a Fedora Linux machine (could work on a Debian too, but Fedora is just what I use on my personal Laptop). The following steps prepare an initial Debian base image, which then later can be transferred to the phone.</p> +<p>This is to be performed on a Fedora Linux machine (could work on a Debian too, but Fedora is just what I use on my Laptop). The following steps prepare an initial Debian base image, which can then be transferred to the phone.</p> <pre> sudo dnf install debootstrap # 5g @@ -1515,7 +1515,7 @@ exit # Exit chroot exit # Exit adb shell </pre> <h3>Include to Android startup:</h3> -<p>I you want to start Debroid automatically every time when your phone starts, then do the following:</p> +<p>If you want to start Debroid automatically whenever your phone starts, then do the following:</p> <pre> adb push data/local/userinit.sh /data/local/userinit.sh adb shell @@ -1541,10 +1541,10 @@ exit <div xmlns="http://www.w3.org/1999/xhtml"> <h1>The fibonacci.pl.c Polyglot</h1> <p class="quote"><i>Written by Paul Buetow 2014-03-24</i></p> -<p>In computing, a polyglot is a computer program or script written in a valid form of multiple programming languages, which performs the same operations or output independent of the programming language used to compile or interpret it</p> +<p>In computing, a polyglot is a computer program or script written in a valid form of multiple programming languages, which performs the same operations or output independent of the programming language used to compile or interpret it.</p> <a class="textlink" href="https://en.wikipedia.org/wiki/Polyglot_(computing)">https://en.wikipedia.org/wiki/Polyglot_(computing)</a><br /> <h2>The Fibonacci numbers</h2> -<p>For fun, I programmed my own Polyglot, which is both, valid Perl and C code. The interesting part about C is, that $ is a valid character to start variable names with:</p> +<p>For fun, I programmed my own Polyglot, which is both valid Perl and C code. The exciting part about C is that $ is a valid character to start variable names with:</p> <pre> #include <stdio.h> @@ -1557,7 +1557,7 @@ my $arg; sub hello() { printf("Hello, welcome to Perl-C!\n"); - printf("This program is both, valid C and Perl code!\n"); + printf("This program is both valid C and Perl code!\n"); printf("It calculates all fibonacci numbers from 0 to 9!\n\n"); return 0; } @@ -1589,13 +1589,13 @@ BEGIN { return 0; } </pre> -<p>You can find the whole source code at GitHub:</p> +<p>You can find the full source code at GitHub:</p> <a class="textlink" href="https://github.com/snonux/perl-c-fibonacci">https://github.com/snonux/perl-c-fibonacci</a><br /> <h3>Let's run it with Perl:</h3> <pre> ❯ perl fibonacci.pl.c Hello, welcome to Perl-C! -This program is both, valid C and Perl code! +This program is both valid C and Perl code! It calculates all fibonacci numbers from 0 to 9! fib(0) = 0 @@ -1615,7 +1615,7 @@ fib(10) = 55 ❯ gcc fibonacci.pl.c -o fibonacci ❯ ./fibonacci Hello, welcome to Perl-C! -This program is both, valid C and Perl code! +This program is both valid C and Perl code! It calculates all fibonacci numbers from 0 to 9! fib(0) = 0 @@ -1630,7 +1630,7 @@ fib(8) = 21 fib(9) = 34 fib(10) = 55 </pre> -<p>It's really fun to play with :-).</p> +<p>It's entertaining to play with :-).</p> <p>E-Mail me your thoughts at comments@mx.buetow.org!</p> </div> </content> @@ -1655,18 +1655,18 @@ fib(10) = 55 //\ //\\ //\ //\\ //\ //\\jrei </pre> <p class="quote"><i>Written by Paul Buetow 2011-05-07, last updated 2021-05-07</i></p> -<p>PerlDaemon is a minimal daemon for Linux and other Unix like operating systems programmed in Perl. It is a minimal but pretty functional and fairly generic service framework. This means that it does not do anything useful other than providing a framework for starting, stopping, configuring and logging. In order to do something useful, a module (written in Perl) must be provided.</p> +<p>PerlDaemon is a minimal daemon for Linux and other Unix like operating systems programmed in Perl. It is a minimal but pretty functional and fairly generic service framework. This means that it does not do anything useful other than providing a framework for starting, stopping, configuring and logging. To do something useful, a module (written in Perl) must be provided.</p> <h2>Features</h2> <p>PerlDaemon supports:</p> <ul> <li>Automatic daemonizing</li> <li>Logging</li> -<li>logrotation (via SIGHUP)</li> +<li>log rotation (via SIGHUP)</li> <li>Clean shutdown support (SIGTERM)</li> <li>Pid file support (incl. check on startup)</li> <li>Easy to configure</li> <li>Easy to extend</li> -<li>Multi instance support (just use a different directory for each instance).</li> +<li>Multi-instance support (just use a different directory for each instance).</li> </ul> <h2>Quick Guide</h2> <pre> @@ -1679,9 +1679,9 @@ fib(10) = 55 # Alternatively: Starting in foreground ./bin/perldaemon start daemon.daemonize=no (or shortcut ./control foreground) </pre> -<p>To stop a daemon running in foreground mode "Ctrl+C" must be hit. To see more available startup options run "./control" without any argument.</p> +<p>To stop a daemon from running in foreground mode, "Ctrl+C" must be hit. To see more available startup options run "./control" without any argument.</p> <h2>How to configure</h2> -<p>The daemon instance can be configured in "./conf/perldaemon.conf". If you want to change a property only once, it is also possible to specify it on command line (that then will take precedence over the config file). All available config properties can be viewed via "./control keys":</p> +<p>The daemon instance can be configured in "./conf/perldaemon.conf". If you want to change a property only once, it is also possible to specify it on the command line (which will take precedence over the config file). All available config properties can be displayed via "./control keys":</p> <pre> pb@titania:~/svn/utils/perldaemon/trunk$ ./control keys # Path to the logfile @@ -1699,10 +1699,10 @@ daemon.daemonize=yes # Path to the pidfile daemon.pidfile=./run/perldaemon.pid -# Each module should run every runinterval seconds +# Each module should run every run interval seconds daemon.modules.runinterval=3 -# Path to the alive file (is touched every loopinterval seconds, usable to monitor) +# Path to the alive file (is touched every loop interval seconds, usable for monitoring) daemon.alivefile=./run/perldaemon.alive # Specifies the working directory @@ -1723,15 +1723,15 @@ Mon Jun 13 11:29:27 2011 (PID 2838): ExampleModule Test 2 $ ./control stop Stopping daemon now... </pre> -<p>If you want to change that property forever either edit perldaemon.conf or do this:</p> +<p>If you want to change that property forever, either edit perldaemon.conf or do this:</p> <pre> $ ./control keys daemon.loopinterval=10 > new.conf; mv new.conf conf/perldaemon.conf </pre> <h2>HiRes event loop</h2> -<p>PerlDaemon uses `Time::HiRes` to make sure that all the events run in correct intervals. Each loop run a time carry value is recorded and added to the next loop run in order to catch up lost time.</p> +<p>PerlDaemon uses `Time::HiRes` to make sure that all the events run incorrect intervals. For each loop run, a time carry value is recorded and added to the next loop run to catch up on lost time.</p> <h2>Writing your own modules</h2> <h3>Example module</h3> -<p>This is one of the example modules you will find in the source code. It should be quite self-explanatory if you know Perl :-).</p> +<p>This is one of the example modules you will find in the source code. It should be pretty self-explanatory if you know Perl :-).</p> <pre> package PerlDaemonModules::ExampleModule; @@ -1773,7 +1773,7 @@ sub do ($) { ./bin/perldaemon restart (or shortcurt ./control restart) </pre> <p>Now watch `./log/perldaemon.log` closely. It is a good practice to test your modules in 'foreground mode' (see above how to do that).</p> -<p>BTW: You can install as many modules within the same instance as desired. But they are run in sequential order (in future they can also run in parallel using several threads or processes).</p> +<p>BTW: You can install as many modules within the same instance as desired. But they are run in sequential order (in future, they can also run in parallel using several threads or processes).</p> <h2>May the source be with you</h2> <p>You can find PerlDaemon (including the examples) at:</p> <a class="textlink" href="https://github.com/snonux/perldaemon">https://github.com/snonux/perldaemon</a><br /> @@ -1803,12 +1803,12 @@ sub do ($) { |___/|_| |___/ |___/ </pre> <p class="quote"><i>Written by Paul Buetow 2010-05-09, last updated 2021-05-05</i></p> -<p>Fype is an interpreted programming language created by me for learning and fun. The interpreter is written in C. It has been tested on FreeBSD and NetBSD and may also work on other Unix like operating systems such as Linux based ones. To be honest, besides learning and fun there is really no other use case of why Fype actually exists as many other programming languages are much faster and more powerful.</p> -<p>The Fype syntax is very simple and is using a maximum look ahead of 1 and a very easy top down parsing mechanism. Fype is parsing and interpreting its code simultaneously. This means, that syntax errors are only detected during program runtime. </p> -<p>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's not a hype - it's Fype!".</p> -<h2>Object oriented C style</h2> -<p>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. </p> -<p>To give you an idea how it works here as an example is a snippet from the main Fype "class header":</p> +<p>Fype is an interpreted programming language created by me for learning and fun. The interpreter is written in C. It has been tested on FreeBSD and NetBSD and may also work on other Unix like operating systems such as Linux based ones. Besides learning and fun, there is no other use case of why Fype exists as many other programming languages are much faster and more powerful.</p> +<p>The Fype syntax is straightforward and uses a maximum look ahead of 1 and an effortless top-down parsing mechanism. Fype is parsing and interpreting its code simultaneously. This means that syntax errors are only detected during program runtime. </p> +<p>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's not a hype - it's Fype!".</p> +<h2>Object-oriented C style</h2> +<p>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. </p> +<p>To give you an idea of how it works here as an example is a snippet from the main Fype "class header":</p> <pre> typedef struct { Tupel *p_tupel_argv; // Contains command line options @@ -1817,7 +1817,7 @@ typedef struct { char *c_basename; } Fype; </pre> -<p>And here is a snippet from the main Fype "class implementation":</p> +<p>And here is a snippet from the primary Fype "class implementation":</p> <pre> Fype* fype_new() { @@ -1868,22 +1868,22 @@ fype_run(int i_argc, char **pc_argv) { } </pre> <h2>Data types</h2> -<p>Fype uses auto type conversion. However, if you want to know what's going on you may take a look at the following basic data types:</p> +<p>Fype uses auto type conversion. However, if you want to know what's going on, you may take a look at the following basic data types:</p> <ul> <li>integer - Specifies a number</li> -<li>double - Specifies a double precision number</li> +<li>double - Specifies a double-precision number</li> <li>string - Specifies a string</li> <li>number - May be an integer or a double number</li> <li>any- May be any type above</li> <li>void - No type</li> -<li>identifier - It's a variable name or a procedure name or a function name</li> +<li>identifier - It's a variable name or a procedure name, or a function name</li> </ul> <p>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.</p> <h2>Syntax</h2> <h3>Comments</h3> -<p>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.</p> +<p>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.</p> <h3>Variables</h3> -<p>Variables can be defined with the "my" keyword (inspired by Perl :-). If you don't assign a value during declaration, then it's using the default integer value 0. Variables may be changed during program runtime. Variables may be deleted using the "undef" keyword! Example:</p> +<p>Variables are defined with the "my" keyword (inspired by Perl :-). If you don'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:</p> <pre> my foo = 1 + 2; say foo; @@ -1909,7 +1909,7 @@ if defined foo { } </pre> <h3>Synonyms</h3> -<p>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 is:</p> +<p>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:</p> <pre> my foo = "foo"; my bar = \foo; @@ -1918,7 +1918,7 @@ foo = "bar"; # The synonym variable should now also set to "bar" assert "bar" == bar; </pre> -<p>Synonyms can be used for all kind of identifiers. It's not limited to normal variables but can be also used for function and procedure names etc (more about functions and procedures later).</p> +<p>Synonyms can be used for all kind of identifiers. It's not limited to standard variables but can also be used for function and procedure names (more about functions and procedures later).</p> <pre> # Create a new procedure baz proc baz { say "I am baz"; } @@ -1951,7 +1951,7 @@ say foo; exit foo - bar; </pre> <h3>Parenthesis</h3> -<p>All parenthesis for function arguments are optional. They help to make the code better readable. They also help to force precedence of expressions.</p> +<p>All parenthesis for function arguments is optional. They help to make the code better readable. They also help to force the precedence of expressions.</p> <h3>Basic expressions</h3> <p>Any "any" value holding a string will be automatically converted to an integer value.</p> <pre> @@ -1983,7 +1983,7 @@ exit foo - bar; <pre> (integer) no <integer> </pre> -<p>... returns 1 if the argument is 0, otherwise it will return 0! If no argument is given, then 0 is returned!</p> +<p>... returns 1 if the argument is 0; otherwise, it will return 0! If no argument is given, then 0 is returned!</p> <pre> (integer) yes <integer> </pre> @@ -2011,7 +2011,7 @@ until <expression> { <statements> } </pre> <p>... runs the statements as long as the expression evaluates to a false value.</p> <h2>Scopes</h2> -<p>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:</p> +<p>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:</p> <pre> my foo = 1; @@ -2078,7 +2078,7 @@ SYM_FUNCTION: bar <pre> (integer) fork </pre> -<p>... forks a subprocess. It returns 0 for the child process and the pid of the child process otherwise! Example:</p> +<p>... forks a subprocess. It returns 0 for the child process and the PID of the child process otherwise! Example:</p> <pre> my pid = fork; @@ -2092,9 +2092,9 @@ if pid { </pre> <p>To execute the garbage collector do:</p> <pre> -(integer) gc +(integer) GC </pre> -<p>It returns the number of items freed! You may wonder why most of the time it will return a value of 0! Fype tries to free not needed memory ASAP. This may change in future versions in order to gain faster execution speed!</p> +<p>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!</p> <h3>I/O </h3> <pre> (any) put <any> @@ -2107,7 +2107,7 @@ if pid { <pre> (void) ln </pre> -<p>... just prints a newline.</p> +<p>... just prints a new line.</p> <h2>Procedures and functions</h2> <h3>Procedures</h3> <p>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's using already defined variables (e.g. global variables). A procedure does not have its own namespace. It's using the calling namespace. It is possible to define new variables inside of a procedure in the current namespace.</p> @@ -2123,7 +2123,7 @@ foo; # Run the procedure. Print out "11\n" say c; # Print out "6\n"; </pre> <h3>Nested procedures</h3> -<p>It's possible to define procedures inside of procedures. Since procedures don't have its 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 in order to check if a procedure has been defined or not.</p> +<p>It's possible to define procedures inside of procedures. Since procedures don'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.</p> <pre> proc foo { say "I am foo"; @@ -2153,10 +2153,10 @@ func foo { my a = 2, b = 4; foo; # Run the procedure. Print out "11\n" -say c; # Will produce an error, because c is out of scoped! +say c; # Will produce an error because c is out of scope! </pre> <h3>Nested functions</h3> -<p>Nested functions work the same way the nested procedures work, with the exception that nested functions will not be available anymore after the function has been left!</p> +<p>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!</p> <pre> func foo { func bar { @@ -2167,10 +2167,10 @@ func foo { } foo; -bar; # Will produce an error, because bar is out of scope! +bar; # Will produce an error because bar is out of scope! </pre> <h2>Arrays</h2> -<p>Some progress on arrays has been made too. The following example creates a multi dimensional array "foo". Its first element is the return value of the func which is "bar". The fourth value is a string ”3” converted to a double number. The last element is an anonymous array which itself contains another anonymous array as its last element:</p> +<p>Some progress on arrays has been made too. The following example creates a multidimensional array "foo". Its first element is the return value of the func which is "bar". The fourth value is a string" 3" converted to a double number. The last element is an anonymous array which itself contains another anonymous array as its final element:</p> <pre> func bar { say ”bar” } my foo = [bar, 1, 4/2, double ”3”, [”A”, [”BA”, ”BB”]]]; @@ -2222,10 +2222,10 @@ BB `|||| </pre> <p class="quote"><i>Written by Paul Buetow 2010-05-07</i></p> -<p>In contrast to Haskell, Standard SML does not use lazy evaluation by default, but eager evaluation. </p> +<p>In contrast to Haskell, Standard SML does not use lazy evaluation by default but an eager evaluation. </p> <a class="textlink" href="https://en.wikipedia.org/wiki/Eager_evaluation">https://en.wikipedia.org/wiki/Eager_evaluation</a><br /> <a class="textlink" href="https://en.wikipedia.org/wiki/Lazy_evaluation">https://en.wikipedia.org/wiki/Lazy_evaluation</a><br /> -<p>You can solve certain 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.</p> +<p>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.</p> <h2>Emulating lazy evaluation in SML</h2> <p>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):</p> <pre> @@ -2269,7 +2269,7 @@ val test = first 10 (nat_pairs_not_null ()); </pre> <a class="textlink" href="http://smlnj.org/">http://smlnj.org/</a><br /> <h2>Real laziness with Haskell </h2> -<p>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 because of that. </p> +<p>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. </p> <pre> {- Just to make it look like the ML example -} first = take @@ -2310,10 +2310,10 @@ first 10 nat_pairs_not_null <div xmlns="http://www.w3.org/1999/xhtml"> <h1>Standard ML and Haskell</h1> <p class="quote"><i>Written by Paul Buetow 2010-04-09</i></p> -<p>I am currently looking into the functional programming language Standard ML (aka SML). The purpose is to refresh my functional programming skills and to learn something new too. Since I already know a little Haskell, could I do not help myself and I implemented the same exercises in Haskell too.</p> -<p>As you will see, SML and Haskell are very similar (at least when it comes to the basics). However, the syntax of Haskell is a bit more "advanced". Haskell utilizes fewer keywords (e.g. no val, end, fun, fn ...). Haskell also allows to explicitly write down the function types. What I have been missing in SML so far is the so-called pattern guards. Although this is a very superficial comparison for now, so far I like Haskell more than SML. Nevertheless, I thought it would be fun to demonstrate a few simple functions of both languages to show off the similarities. </p> -<p>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:</p> -<h2>Defining a multi data type</h2> +<p>I am currently looking into the functional programming language Standard ML (aka SML). The purpose is to refresh my functional programming skills and to learn something new too. Since I already knew a little Haskell, I could not help myself, and I also implemented the same exercises in Haskell.</p> +<p>As you will see, SML and Haskell are very similar (at least when it comes to the basics). However, the syntax of Haskell is a bit more "advanced". Haskell utilizes fewer keywords (e.g. no val, end, fun, fn ...). Haskell also allows to write down the function types explicitly. What I have been missing in SML so far is the so-called pattern guards. Although this is a very superficial comparison for now, so far, I like Haskell more than SML. Nevertheless, I thought it would be fun to demonstrate a few simple functions of both languages to show off the similarities. </p> +<p>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:</p> +<h2>Defining a multi-data type</h2> <p>Standard ML:</p> <pre> datatype ’a multi @@ -2431,8 +2431,8 @@ delete_one m w = do if x == w then (Empty, True) else (Elem x, False) delete_one’ x = (x, False) </pre> -<h2>Higher order functions</h2> -<p>The first line is always the SML code, the second line always the Haskell variant:</p> +<h2>Higher-order functions</h2> +<p>The first line is always the SML code, the second line the Haskell variant:</p> <pre> fun make_map_fn f1 = fn (x,y) => f1 x :: y make_map_fn f1 = \x y -> f1 x : y diff --git a/gemfeed/index.html b/gemfeed/index.html index 5952cdd3..beb08fae 100644 --- a/gemfeed/index.html +++ b/gemfeed/index.html @@ -50,22 +50,22 @@ h2, h3 { <body> <h1>buetow.org's Gemfeed</h1> <h2>Having fun with computers!</h2> -<a class="textlink" href="./2021-05-16-personal-bash-coding-style-guide.html">2021-05-16 - Personal Bash coding style guide</a><br /> -<a class="textlink" href="./2021-04-24-welcome-to-the-geminispace.html">2021-04-24 - Welcome to the Geminispace</a><br /> -<a class="textlink" href="./2021-04-22-dtail-the-distributed-log-tail-program.html">2021-04-22 - DTail - The distributed log tail program</a><br /> -<a class="textlink" href="./2018-06-01-realistic-load-testing-with-ioriot-for-linux.html">2018-06-01 - Realistic load testing with I/O Riot for Linux</a><br /> -<a class="textlink" href="./2016-11-20-methods-in-c.html">2016-11-20 - Methods in C</a><br /> -<a class="textlink" href="./2016-05-22-spinning-up-my-own-authoritative-dns-servers.html">2016-05-22 - Spinning up my own authoritative DNS servers</a><br /> -<a class="textlink" href="./2016-04-16-offsite-backup-with-zfs-part2.html">2016-04-16 - Offsite backup with ZFS (Part 2)</a><br /> -<a class="textlink" href="./2016-04-09-jails-and-zfs-on-freebsd-with-puppet.html">2016-04-09 - Jails and ZFS with Puppet on FreeBSD</a><br /> -<a class="textlink" href="./2016-04-03-offsite-backup-with-zfs.html">2016-04-03 - Offsite backup with ZFS</a><br /> -<a class="textlink" href="./2015-12-05-run-debian-on-your-phone-with-debroid.html">2015-12-05 - Run Debian on your phone with Debroid</a><br /> -<a class="textlink" href="./2014-03-24-the-fibonacci.pl.c-polyglot.html">2014-03-24 - The fibonacci.pl.c Polyglot</a><br /> -<a class="textlink" href="./2011-05-07-perl-daemon-service-framework.html">2011-05-07 - Perl Daemon (Service Framework)</a><br /> -<a class="textlink" href="./2010-05-09-the-fype-programming-language.html">2010-05-09 - The Fype Programming Language</a><br /> -<a class="textlink" href="./2010-05-07-lazy-evaluation-with-standarn-ml.html">2010-05-07 - Lazy Evaluation with Standard ML</a><br /> -<a class="textlink" href="./2010-04-09-standard-ml-and-haskell.html">2010-04-09 - Standard ML and Haskell</a><br /> -<a class="textlink" href="./2008-06-26-perl-poetry.html">2008-06-26 - Perl Poetry</a><br /> +<a class="textlink" href="./2021-05-16-personal-bash-coding-style-guide.html">2021-05-16 (1717 words) - Personal Bash coding style guide</a><br /> +<a class="textlink" href="./2021-04-24-welcome-to-the-geminispace.html">2021-04-24 (0759 words) - Welcome to the Geminispace</a><br /> +<a class="textlink" href="./2021-04-22-dtail-the-distributed-log-tail-program.html">2021-04-22 (2117 words) - DTail - The distributed log tail program</a><br /> +<a class="textlink" href="./2018-06-01-realistic-load-testing-with-ioriot-for-linux.html">2018-06-01 (2171 words) - Realistic load testing with I/O Riot for Linux</a><br /> +<a class="textlink" href="./2016-11-20-methods-in-c.html">2016-11-20 (0314 words) - Methods in C</a><br /> +<a class="textlink" href="./2016-05-22-spinning-up-my-own-authoritative-dns-servers.html">2016-05-22 (0508 words) - Spinning up my own authoritative DNS servers</a><br /> +<a class="textlink" href="./2016-04-16-offsite-backup-with-zfs-part2.html">2016-04-16 (0244 words) - Offsite backup with ZFS (Part 2)</a><br /> +<a class="textlink" href="./2016-04-09-jails-and-zfs-on-freebsd-with-puppet.html">2016-04-09 (0423 words) - Jails and ZFS with Puppet on FreeBSD</a><br /> +<a class="textlink" href="./2016-04-03-offsite-backup-with-zfs.html">2016-04-03 (0594 words) - Offsite backup with ZFS</a><br /> +<a class="textlink" href="./2015-12-05-run-debian-on-your-phone-with-debroid.html">2015-12-05 (0339 words) - Run Debian on your phone with Debroid</a><br /> +<a class="textlink" href="./2014-03-24-the-fibonacci.pl.c-polyglot.html">2014-03-24 (0132 words) - The fibonacci.pl.c Polyglot</a><br /> +<a class="textlink" href="./2011-05-07-perl-daemon-service-framework.html">2011-05-07 (0399 words) - Perl Daemon (Service Framework)</a><br /> +<a class="textlink" href="./2010-05-09-the-fype-programming-language.html">2010-05-09 (1272 words) - The Fype Programming Language</a><br /> +<a class="textlink" href="./2010-05-07-lazy-evaluation-with-standarn-ml.html">2010-05-07 (0192 words) - Lazy Evaluation with Standard ML</a><br /> +<a class="textlink" href="./2010-04-09-standard-ml-and-haskell.html">2010-04-09 (0266 words) - Standard ML and Haskell</a><br /> +<a class="textlink" href="./2008-06-26-perl-poetry.html">2008-06-26 (0147 words) - Perl Poetry</a><br /> <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> <html xmlns="http://www.w3.org/1999/xhtml" lang="en" xml:lang="en"> <head> @@ -56,7 +56,7 @@ h2, h3 { | | Paul's | | | | personal | | | | internet | | - | | site | | + | | site! | | | \_____________________/ | |___________________________| ,---\_____ [] _______/------, @@ -75,34 +75,33 @@ h2, h3 { <p>If you reach this site via the modern web, please read this:</p> <a class="textlink" href="./gemfeed/2021-04-24-welcome-to-the-geminispace.html">Welcome to the Geminispace</a><br /> <h2>Introduction</h2> -<p>My name is Paul Buetow and this is my personal internet site. You can call me a Linux/*BSD enthusiast and hobbyist. Although I also have many other interests, you will encounter mostly (if not only) technical content on this site.</p> -<p>I have published some Open-Source software, you will find some reference to it on this site or on my GitHub page(s). I also read a lot of tech newsletters and blogs. I re-share the most interesting ones on my social media feeds. You can find links to my GitHub pages and to my social media accounts on my contact information page:</p> +<p>My name is Paul Buetow, and this is my internet site. You can call me a Linux/*BSD enthusiast and hobbyist. Although I also have many other interests, you will encounter mostly (if not only) technical content on this site.</p> +<p>I have published some Open-Source software; you will find references to it on this site or my GitHub page(s). I also read a lot of tech newsletters and blogs. I re-share the most interesting ones on my social media feeds. You can find links to my GitHub pages and my social media accounts on my contact information page:</p> <a class="textlink" href="./contact-information.html">Contact information</a><br /> -<p>I have also compiled a list of resources which made an impact on me:</p> +<p>I have also compiled a list of resources that made an impact on me:</p> <a class="textlink" href="./resources.html">List of resources</a><br /> <h2>Personal blog</h2> -<p>English is not my mother tongue. So please ignore any errors you might encounter.</p> <h3>Stay updated</h3> <a class="textlink" href="./gemfeed/atom.xml">Subscribe to this blog's Atom feed</a><br /> <a class="textlink" href="./gemfeed/index.html">Subscribe to this blog's Gemfeed</a><br /> <h3>Posts</h3> -<p>I have switched blog software multiple times. I might be back filling some of the older articles here. So please don't wonder when suddenly very old posts appear here.</p> -<a class="textlink" href="./gemfeed/2021-05-16-personal-bash-coding-style-guide.html">2021-05-16 - Personal Bash coding style guide</a><br /> -<a class="textlink" href="./gemfeed/2021-04-24-welcome-to-the-geminispace.html">2021-04-24 - Welcome to the Geminispace</a><br /> -<a class="textlink" href="./gemfeed/2021-04-22-dtail-the-distributed-log-tail-program.html">2021-04-22 - DTail - The distributed log tail program</a><br /> -<a class="textlink" href="./gemfeed/2018-06-01-realistic-load-testing-with-ioriot-for-linux.html">2018-06-01 - Realistic load testing with I/O Riot for Linux</a><br /> -<a class="textlink" href="./gemfeed/2016-11-20-methods-in-c.html">2016-11-20 - Methods in C</a><br /> -<a class="textlink" href="./gemfeed/2016-05-22-spinning-up-my-own-authoritative-dns-servers.html">2016-05-22 - Spinning up my own authoritative DNS servers</a><br /> -<a class="textlink" href="./gemfeed/2016-04-16-offsite-backup-with-zfs-part2.html">2016-04-16 - Offsite backup with ZFS (Part 2)</a><br /> -<a class="textlink" href="./gemfeed/2016-04-09-jails-and-zfs-on-freebsd-with-puppet.html">2016-04-09 - Jails and ZFS with Puppet on FreeBSD</a><br /> -<a class="textlink" href="./gemfeed/2016-04-03-offsite-backup-with-zfs.html">2016-04-03 - Offsite backup with ZFS</a><br /> -<a class="textlink" href="./gemfeed/2015-12-05-run-debian-on-your-phone-with-debroid.html">2015-12-05 - Run Debian on your phone with Debroid</a><br /> -<a class="textlink" href="./gemfeed/2014-03-24-the-fibonacci.pl.c-polyglot.html">2014-03-24 - The fibonacci.pl.c Polyglot</a><br /> -<a class="textlink" href="./gemfeed/2011-05-07-perl-daemon-service-framework.html">2011-05-07 - Perl Daemon (Service Framework)</a><br /> -<a class="textlink" href="./gemfeed/2010-05-09-the-fype-programming-language.html">2010-05-09 - The Fype Programming Language</a><br /> -<a class="textlink" href="./gemfeed/2010-05-07-lazy-evaluation-with-standarn-ml.html">2010-05-07 - Lazy Evaluation with Standard ML</a><br /> -<a class="textlink" href="./gemfeed/2010-04-09-standard-ml-and-haskell.html">2010-04-09 - Standard ML and Haskell</a><br /> -<a class="textlink" href="./gemfeed/2008-06-26-perl-poetry.html">2008-06-26 - Perl Poetry</a><br /> +<p>I have switched blog software multiple times. I might be backfilling some of the older articles here. So please don't wonder when suddenly old posts appear here.</p> +<a class="textlink" href="./gemfeed/2021-05-16-personal-bash-coding-style-guide.html">2021-05-16 (1717 words) - Personal Bash coding style guide</a><br /> +<a class="textlink" href="./gemfeed/2021-04-24-welcome-to-the-geminispace.html">2021-04-24 (0759 words) - Welcome to the Geminispace</a><br /> +<a class="textlink" href="./gemfeed/2021-04-22-dtail-the-distributed-log-tail-program.html">2021-04-22 (2117 words) - DTail - The distributed log tail program</a><br /> +<a class="textlink" href="./gemfeed/2018-06-01-realistic-load-testing-with-ioriot-for-linux.html">2018-06-01 (2171 words) - Realistic load testing with I/O Riot for Linux</a><br /> +<a class="textlink" href="./gemfeed/2016-11-20-methods-in-c.html">2016-11-20 (0314 words) - Methods in C</a><br /> +<a class="textlink" href="./gemfeed/2016-05-22-spinning-up-my-own-authoritative-dns-servers.html">2016-05-22 (0508 words) - Spinning up my own authoritative DNS servers</a><br /> +<a class="textlink" href="./gemfeed/2016-04-16-offsite-backup-with-zfs-part2.html">2016-04-16 (0244 words) - Offsite backup with ZFS (Part 2)</a><br /> +<a class="textlink" href="./gemfeed/2016-04-09-jails-and-zfs-on-freebsd-with-puppet.html">2016-04-09 (0423 words) - Jails and ZFS with Puppet on FreeBSD</a><br /> +<a class="textlink" href="./gemfeed/2016-04-03-offsite-backup-with-zfs.html">2016-04-03 (0594 words) - Offsite backup with ZFS</a><br /> +<a class="textlink" href="./gemfeed/2015-12-05-run-debian-on-your-phone-with-debroid.html">2015-12-05 (0339 words) - Run Debian on your phone with Debroid</a><br /> +<a class="textlink" href="./gemfeed/2014-03-24-the-fibonacci.pl.c-polyglot.html">2014-03-24 (0132 words) - The fibonacci.pl.c Polyglot</a><br /> +<a class="textlink" href="./gemfeed/2011-05-07-perl-daemon-service-framework.html">2011-05-07 (0399 words) - Perl Daemon (Service Framework)</a><br /> +<a class="textlink" href="./gemfeed/2010-05-09-the-fype-programming-language.html">2010-05-09 (1272 words) - The Fype Programming Language</a><br /> +<a class="textlink" href="./gemfeed/2010-05-07-lazy-evaluation-with-standarn-ml.html">2010-05-07 (0192 words) - Lazy Evaluation with Standard ML</a><br /> +<a class="textlink" href="./gemfeed/2010-04-09-standard-ml-and-haskell.html">2010-04-09 (0266 words) - Standard ML and Haskell</a><br /> +<a class="textlink" href="./gemfeed/2008-06-26-perl-poetry.html">2008-06-26 (0147 words) - Perl Poetry</a><br /> <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> <html xmlns="http://www.w3.org/1999/xhtml" lang="en" xml:lang="en"> <head> diff --git a/resources.html b/resources.html index 8fe895a5..fc21d7fd 100644 --- a/resources.html +++ b/resources.html @@ -49,9 +49,9 @@ h2, h3 { </head> <body> <h1>Resources</h1> -<p>This is a list of resources I found useful. I am not an expert in all of these topics but all the resources listed here made an impact on me. I've read some of the books quite a long time ago, so there might be newer editions out there already and I might need to refresh some of the knowledge.</p> -<p>The list may not be exhaustive but I will be adding more in the future. I strongly believe that educating yourself further is one of the most important things you should do in order to advance. The lists are in random order and reshuffled every time (via *sort -R*) when updates are made.</p> -<p>You won't find any links on this site because over time the links will break. Please use your favorite search engine when you are interested in one of the resources...</p> +<p>This site contains a list of resources I found helpful. I am not an expert in all of these topics, but all the resources listed here impacted me. I read some of the books quite a long time ago, so there might be newer editions out there already, and I might need to refresh some of the knowledge.</p> +<p>The list may not be exhaustive, but I will be adding more in the future. I firmly believe that educating yourself further is one of the most important things to advance. The lists are in random order and reshuffled every time (via *sort -R*) when updates are made.</p> +<p>You won't find any links on this site because, over time, the links will break. Please use your favourite search engine when you are interested in one of the resources...</p> <pre> .--. .---. .-. .---|--| .-. | A | .---. |~| .--. @@ -64,32 +64,33 @@ h2, h3 { </pre> <h2>Technical books</h2> <ul> -<li>C++ Programming Language; Bjarne Stroustrup; (I've to admit that was a long time ago I've read this book)</li> -<li>Learn You Some Erlang for Great Good; Fred Herbert; No Starch Press</li> -<li>Pro Git; Scott Chacon, Ben Straub; Apress</li> -<li>Systemprogrammierung in Go; Frank Müller; dpunkt</li> -<li>DNS and BIND; Cricket Liu; O'Reilly</li> +<li>Site Reliability Engineering; How Google runs production systems; O'Reilly</li> <li>Concurrency in Go; Katherine Cox-Buday; O'Reilly</li> -<li>Modern Perl; Chromatic ; Onyx Neon Press</li> +<li>Learn You Some Erlang for Great Good; Fred Herbert; No Starch Press</li> +<li>21st Century C: C Tips from the New School; Ben Klemens; O'Reilly</li> +<li>Advanced Bash-Scripting Guide; Not an actual book, but could be</li> +<li>Learn You a Haskell for Great Good!; Miran Lipovaca; No Starch Press</li> <li>Java ist auch eine Insel; Christian Ullenboom; </li> -<li>Think Raku (aka Think Perl 6); Laurent Rosenfeld, Allen B. Downey; O'Reilly</li> -<li>Advanced Bash-Scripting Guide; Not a book by per-se but could be</li> -<li>Site Reliability Engineering; How Google runs production systems; O'Reilly</li> -<li>Systems Performance Tuning; Gian-Paolo D. Musumeci and others...; O'Reilly</li> +<li>Data Science at the Command Line; Jeroen Janssens; O'Reilly</li> <li>The Practise of System and Network Administration; Thomas A. Limoncelli, Christina J. Hogan, Strata R. Chalup; Addison-Wesley Professional</li> <li>Clusterbau mit Linux-HA; Michael Schwartzkopff; O'Reilly</li> -<li>Object-Oriented Programming with ANSI-C; Axel-Tobias Schreiner</li> +<li>Funktionale Programmierung; Peter Pepper; Springer</li> +<li>Systemprogrammierung in Go; Frank Müller; dpunkt</li> <li>Programming Perl aka "The Camel Book"; Tom Christiansen, brian d foy, Larry Wall & Jon Orwant; O'Reilly</li> -<li>Higher Order Perl; Mark Dominus; Morgan Kaufmann</li> -<li>The Docker Book; James Turnbull; Kindle</li> -<li>Developing Games in Java; David Brackeen and others...; New Riders</li> +<li>Pro Git; Scott Chacon, Ben Straub; Apress</li> +<li>DNS and BIND; Cricket Liu; O'Reilly</li> <li>Effective awk programming; Arnold Robbins; O'Reilly</li> -<li>Learn You a Haskell for Great Good!; Miran Lipovaca; No Starch Press</li> -<li>Funktionale Programmierung; Peter Pepper; Springer</li> +<li>The Docker Book; James Turnbull; Kindle</li> +<li>C++ Programming Language; Bjarne Stroustrup;</li> +<li>Distributed Systems: Principles and Paradigms; Andrew S. Tanenbaum; Pearson</li> <li>Pro Puppet; James Turnbull, Jeffrey McCune; Apress</li> +<li>Object-Oriented Programming with ANSI-C; Axel-Tobias Schreiner</li> +<li>Modern Perl; Chromatic ; Onyx Neon Press</li> +<li>Developing Games in Java; David Brackeen and others...; New Riders</li> +<li>Higher Order Perl; Mark Dominus; Morgan Kaufmann</li> +<li>Systems Performance Tuning; Gian-Paolo D. Musumeci and others...; O'Reilly</li> +<li>Think Raku (aka Think Perl 6); Laurent Rosenfeld, Allen B. Downey; O'Reilly</li> <li>The Go Programming Language; Alan A. A. Donovan; Addison-Wesley Professional</li> -<li>21st Century C: C Tips from the New School; Ben Klemens; O'Reilly</li> -<li>Distributed Systems: Principles and Paradigms; Andrew S. Tanenbaum; Pearson</li> </ul> <h2>Technical bibles</h2> <p>I didn't read them from the beginning to the end, but I am using them to look up things.</p> @@ -100,56 +101,57 @@ h2, h3 { </ul> <h2>Self-development and soft-skills books</h2> <ul> -<li>Atomic Habits; James Clear; Random House Business</li> +<li>The Off Switch; Mark Cropley; Virgin Books</li> <li>The Complete Software Developer's Career Guide; John Sonmez; Unabridged Audiobook</li> -<li>Eat That Frog!; Brian Tracy; Hodder Paperbacks</li> +<li>Soft Skills; John Sommez; Manning Publications</li> <li>Time Management for System Administrators; Thomas A. Limoncelli; O'Reilly</li> -<li>Digital Minimalism; Cal Newport; Portofolio Penguin</li> <li>Stop starting, start finishing; Arne Roock; Lean-Kanban University</li> +<li>Psycho-Cybernetics; Maxwell Maltz; Perigee Books</li> <li>Ultralearning; Scott Young; Thorsons</li> -<li>The Joy of Missing Out; Christina Crook; New Society Publishers</li> -<li>Soft Skills; John Sommez; Manning Publications</li> +<li>Eat That Frog!; Brian Tracy; Hodder Paperbacks</li> +<li>Deep Work; Cal Newport; Piatkus</li> +<li>The Daily Stoic; Ryan Holiday, Stephen Hanselman; Profile Books</li> +<li>The Obstacle Is The Way; Ryan Holiday; Profile Books Ltd</li> <li>So Good They Can't Ignore You; Cal Newport; Business Plus</li> <li>The Bullet Journal Method; Ryder Carroll; Fourth Estate</li> -<li>Psycho-Cybernetics; Maxwell Maltz; Perigee Books</li> +<li>The Power of Now; Eckhard Tolle; Yellow Kite</li> +<li>The Joy of Missing Out; Christina Crook; New Society Publishers</li> +<li>Atomic Habits; James Clear; Random House Business</li> <li>Who Moved My Cheese?; Dr. Spencer Johnson; Vermilion</li> -<li>The Off Switch; Mark Cropley; Virgin Books</li> -<li>The Daily Stoic; Ryan Holiday, Stephen Hanselman; Profile Books</li> -<li>Deep Work; Cal Newport; Piatkus</li> <li>The 7 Habits Of Highly Effective People; Stephen R. Covey; Simon & Schuster UK</li> -<li>The Power of Now; Eckhard Tolle; Yellow Kite</li> +<li>Digital Minimalism; Cal Newport; Portofolio Penguin</li> </ul> <h2>Technical video lectures and courses</h2> -<p>Some of these were in-person with exams, others were online learning lectures only.</p> +<p>Some of these were in-person with exams; others were online learning lectures only.</p> <ul> -<li>Linux Security and Isolation APIs Training; Michael Kerrisk; 3 day on-site training</li> -<li>MySQL Deep Dive Workshop; 2 day on-site training</li> +<li>Linux Security and Isolation APIs Training; Michael Kerrisk; 3-day on-site training</li> +<li>MySQL Deep Dive Workshop; 2-day on-site training</li> <li>Protocol buffers; O'Reilly Online</li> <li>Algorithms Video Lectures; Robert Sedgewick; O'Reilly Online</li> -<li>Red Hat Certified System Administrator; Course + certification (Although I had the option I decided not to take the next course as it is more effective to self learn what I need)</li> +<li>Red Hat Certified System Administrator; Course + certification (Although I had the option, I decided not to take the next course as it is more effective to self learn what I need)</li> <li>Scripting Vim; Damian Conway; O'Reilly Online</li> <li>The Ultimate Kubernetes Bootcamp; School of Devops; O'Reilly Online</li> <li>Ultimate Go Programming; Bill Kennedy; O'Reilly Online</li> <li>Structure and Interpretation of Computer Programs; Harold Abelson and more...; </li> -<li>F5 Loadbalancers Training; 2 day on-site training; F5, Inc. </li> -<li>Apache Tomcat Best Practises; 3 day on-site training</li> +<li>F5 Loadbalancers Training; 2-day on-site training; F5, Inc. </li> +<li>Apache Tomcat Best Practises; 3-day on-site training</li> <li>Functional programming lecture; Remote University of Hagen</li> </ul> <h2>Fiction and more books</h2> -<p>Many fiction and non-fiction books I read are not listed here. This site mostly includes resources which made an impact on me regarding the work I do only and not on my personal life. Do you recommend a good Science Fiction Novel? E-Mail me; I can also provide my own recommendations! :-)</p> +<p>Many fiction and non-fiction books I read are not listed here. This site primarily includes resources that impacted me regarding my work and not on my personal life. Do you recommend a good Science Fiction Novel? E-Mail me; I can also provide my recommendations! :-)</p> <h2>Formal education</h2> -<p>I have met many self-taught IT professionals I highly respect. In my own opinion a formal degree does not automatically qualify a person for a certain job. It is more about how you educate yourself further *after* formal education. The pragmatic way of thinking and getting things done do not require a college or university degree.</p> -<p>However, I still believe a degree in Computer Science helps to achieve a good understanding of all the theory involved which you would have never learned about otherwise. Isn't it cool to understand how compiler work under the hood (automata theory) even if in your current position you are not required to hack the compiler? You could apply the same theory for other things too. This was just *one* example.</p> +<p>I have met many self-taught IT professionals I highly respect. In my own opinion, a formal degree does not automatically qualify a person for a particular job. It is more about how you educate yourself further *after* formal education. The pragmatic way of thinking and getting things done do not require a college or university degree.</p> +<p>However, I still believe a degree in Computer Science helps to understand all the theories involved that you would have never learned otherwise. Isn't it cool to understand how compilers work under the hood (automata theory) even if you are not required to hack the compiler in your current position? You could apply the same theory for other things too. This was just *one* example.</p> <ul> -<li>One year Student exchange programme in OH, USA</li> +<li>One year Student exchange program in OH, USA</li> <li>German School Majors (Abitur), focus areas: German and Mathematics</li> -<li>Half year internship as a C/C++ programmer in Sofia, Bulgaria</li> -<li>Graduaded from University as Diplom-Inform. (FH) at the Aachen University of Applied Sciences, Germany</li> +<li>Half-year internship as a C/C++ programmer in Sofia, Bulgaria</li> +<li>Graduated from University as Diplom-Inform. (FH) at the Aachen University of Applied Sciences, Germany</li> </ul> -<p>My diploma thesis "Object oriented development of a GUI based tool for event based simulation of distributed systems" can be found at:</p> +<p>My diploma thesis, "Object-oriented development of a GUI based tool for event-based simulation of distributed systems," can be found at:</p> <a class="textlink" href="https://github.com/snonux/vs-sim">https://github.com/snonux/vs-sim</a><br /> -<p>I was one of the last students to whom was handed out an "old fashioned" German Diploma degree before the University switched to the international Bachelor and Master versions. To give you an idea: The "Diplom-Inform. (FH)" means literally translated "Diploma in Informatics from a University of Applied Sciences (FH: Fachhochschule)". Going after the international student credit score it is settled between a Bachelor of Computer Science and a Master of Computer Science degree. </p> -<p>Colleges and Universities are very expensive in many countries. Come to Germany, the first college degree is for free (if you finish within a certain deadline!)</p> +<p>I was one of the last students handed out an "old fashioned" German Diploma degree before the University switched to the international Bachelor and Master versions. To give you an idea: The "Diplom-Inform. (FH)" means translated "Diploma in Informatics from a University of Applied Sciences (FH: Fachhochschule)". Going after the international student credit score, it settles between a Bachelor of Computer Science and a Master of Computer Science degree. </p> +<p>Colleges and Universities are costly in many countries. Come to Germany, the first college degree is for free (if you finish within a certain deadline!)</p> <a class="textlink" href="./">Go back to the main site</a><br /> <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> <html xmlns="http://www.w3.org/1999/xhtml" lang="en" xml:lang="en"> |