diff options
| author | Paul Buetow <paul@buetow.org> | 2021-05-07 21:37:52 +0100 |
|---|---|---|
| committer | Paul Buetow <paul@buetow.org> | 2021-05-07 21:37:52 +0100 |
| commit | 41d3ad261f3b524e111c18b154bc61a580706fb5 (patch) | |
| tree | 41065c7618a79a5e9084d4536d8e3b6e20a7ce04 /content/html | |
| parent | fa48d143323c68dbc34007e559adc0644e011fe7 (diff) | |
| parent | 304031453e562ebb6b3de28ff771068348519e0f (diff) | |
Merge branch 'master' into draft
Diffstat (limited to 'content/html')
| -rw-r--r-- | content/html/contact-information.html | 8 | ||||
| -rw-r--r-- | content/html/gemfeed/2008-06-26-perl-poetry.html | 172 | ||||
| -rw-r--r-- | content/html/gemfeed/2010-05-09-the-fype-programming-language.html | 424 | ||||
| -rw-r--r-- | content/html/gemfeed/2016-04-03-offsite-backup-with-zfs.html | 8 | ||||
| -rw-r--r-- | content/html/gemfeed/2016-04-16-offsite-backup-with-zfs-part2.html | 8 | ||||
| -rw-r--r-- | content/html/gemfeed/2016-05-22-spinning-up-my-own-authoritative-dns-servers.html | 8 | ||||
| -rw-r--r-- | content/html/gemfeed/2016-11-20-methods-in-c.html | 8 | ||||
| -rw-r--r-- | content/html/gemfeed/2021-04-22-dtail-the-distributed-log-tail-program.html | 10 | ||||
| -rw-r--r-- | content/html/gemfeed/2021-04-24-welcome-to-the-geminispace.html | 10 | ||||
| -rw-r--r-- | content/html/gemfeed/atom.xml | 1039 | ||||
| -rw-r--r-- | content/html/gemfeed/index.html | 32 | ||||
| -rw-r--r-- | content/html/index.html | 18 | ||||
| -rw-r--r-- | content/html/resources.html | 31 |
13 files changed, 1717 insertions, 59 deletions
diff --git a/content/html/contact-information.html b/content/html/contact-information.html index 8ba376ed..20bbec62 100644 --- a/content/html/contact-information.html +++ b/content/html/contact-information.html @@ -1,10 +1,10 @@ -<!DOCTYPE html> -<html lang="en"> +<!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> +<meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> <title>Having fun with computers!</title> -<meta charset='utf-8'> <link rel="shortcut icon" type="image/gif" href="/favicon.ico" /> -<style> +<style type="text/css"> body { background-color: #282c34; color: #dfdfdf; margin: auto; max-width: 900px; } img { display: block; max-width: 70%;} pre { color: #ecbe7b; } diff --git a/content/html/gemfeed/2008-06-26-perl-poetry.html b/content/html/gemfeed/2008-06-26-perl-poetry.html new file mode 100644 index 00000000..adb8c0df --- /dev/null +++ b/content/html/gemfeed/2008-06-26-perl-poetry.html @@ -0,0 +1,172 @@ +<!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> +<meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> +<title>Having fun with computers!</title> +<link rel="shortcut icon" type="image/gif" href="/favicon.ico" /> +<style type="text/css"> +body { background-color: #282c34; color: #dfdfdf; margin: auto; max-width: 900px; } +img { display: block; max-width: 70%;} +pre { color: #ecbe7b; } +blockquote { color: #ecbe7b; } +a { color: #c678dd; text-decoration: none; } +a.textlink:before { content: " > "; padding-left: 2px; } +a:hover { color: #51afef; text-decoration: underline; } +h1 { color: #ff6c6b; } +h2, h3, h4, h5, h6 { color: #51afef; } +li { color: #98be65; } +</style> +</head> +<body> +<pre>Written by Paul Buetow 2008-06-26, last updated 2021-05-04</pre> +<a class="textlink" href="../">Go back to the main site</a><br /> +<h1>Perl Poetry</h1> +<pre> + '\|/' * +-- * ----- + /|\ ____ + ' | ' {_ o^> * + : -_ /) + : ( ( .-''`'. + . \ \ / \ + . \ \ / \ + \ `-' `'. + \ . ' / `. + \ ( \ ) ( .') + ,, t '. | / | ( + '|``_/^\___ '| |`'-..-'| ( () +_~~|~/_|_|__/|~~~~~~~ | / ~~~~~ | | ~~~~~~~~ + -_ |L[|]L|/ | |\ MJP ) ) + ( |( / /| + ~~ ~ ~ ~~~~ | /\\ / /| | + || \\ _/ / | | + ~ ~ ~~~ _|| (_/ (___)_| |Nov291999 + (__) (____) +</pre> +<p>Here are some Perl Poems I wrote. They don't do anything useful when you run them, but they don't produce a compiler error either. They only exist for fun and demonstrate what you can do with Perl syntax.</p> +<p>Wikipedia: "Perl poetry is the practice of writing poems that can be compiled as legal Perl code, for example the piece known as Black Perl. Perl poetry is made possible by the large number of English words that are used in the Perl language. New poems are regularly submitted to the community at PerlMonks."</p> +<a class="textlink" href="https://en.wikipedia.org/wiki/Perl">https://en.wikipedia.org/wiki/Perl</a><br /> +<h2>math.pl</h2> +<pre> +#!/usr/bin/perl + +# (C) 2006 by Paul C. Buetow (http://paul.buetow.org) + +goto library for study $math; +BEGIN { s/earching/ books/ +and read $them, $at, $the } library: + +our $topics, cos and tan, +require strict; import { of, tied $patience }; + +do { int'egrate'; sub trade; }; +do { exp'onentize' and abs'olutize' }; +study and study and study and study; + +foreach $topic ({of, math}) { +you, m/ay /go, to, limits } + +do { not qw/erk / unless $success +and m/ove /o;$n and study }; + +do { int'egrate'; sub trade; }; +do { exp'onentize' and abs'olutize' }; +study and study and study and study; + +grep /all/, exp'onents' and cos'inuses'; +/seek results/ for @all, log'4rithms'; + +'you' =~ m/ay /go, not home +unless each %book ne#ars +$completion; + +do { int'egrate'; sub trade; }; +do { exp'onentize' and abs'olutize' }; + +#at +home: //ig,'nore', time and sleep $very =~ s/tr/on/g; +__END__ + +</pre> +<h2>christmas.pl</h2> +<pre> +#!/usr/bin/perl + +# (C) 2006 by Paul C. Buetow (http://paul.buetow.org) + +Christmas:{time;#!!! + +Children: do tell $wishes; + +Santa: for $each (@children) { +BEGIN { read $each, $their, wishes and study them; use Memoize#ing + +} use constant gift, 'wrapping'; +package Gifts; pack $each, gift and bless $each and goto deliver +or do import if not local $available,!!! HO, HO, HO; + +redo Santa, pipe $gifts, to_childs; +redo Santa and do return if last one, is, delivered; + +deliver: gift and require diagnostics if our $gifts ,not break; +do{ use NEXT; time; tied $gifts} if broken and dump the, broken, ones; +The_children: sleep and wait for (each %gift) and try { to => untie $gifts }; + +redo Santa, pipe $gifts, to_childs; +redo Santa and do return if last one, is, delivered; + +The_christmas_tree: formline s/ /childrens/, $gifts; +alarm and warn if not exists $Christmas{ tree}, @t, $ENV{HOME}; +write <<EMail + to the parents to buy a new christmas tree!!!!111 + and send the +EMail +;wait and redo deliver until defined local $tree; + +redo Santa, pipe $gifts, to_childs; +redo Santa and do return if last one, is, delivered ;} + +END {} our $mission and do sleep until next Christmas ;} + +__END__ + +This is perl, v5.8.8 built for i386-freebsd-64int +</pre> +<h2>shopping.pl</h2> +<pre> +#!/usr/bin/perl + +# (C) 2007 by Paul C. Buetow (http://paul.buetow.org) + +BEGIN{} goto mall for $shopping; + +m/y/; mall: seek$s, cool products(), { to => $sell }; +for $their (@business) { to:; earn:; a:; lot:; of:; money: } + +do not goto home and exit mall if exists $new{product}; +foreach $of (q(uality rich products)){} package products; + +our $news; do tell cool products() and do{ sub#tract +cool{ $products and shift @the, @bad, @ones; + +do bless [q(uality)], $products +and return not undef $stuff if not (local $available) }}; + +do { study and study and study for cool products() } +and do { seek $all, cool products(), { to => $buy } }; + +do { write $them, $down } and do { order: foreach (@case) { package s } }; +goto home if not exists $more{money} or die q(uerying) ;for( @money){}; + +at:;home: do { END{} and:; rest:; a:; bit: exit $shopping } +and sleep until unpack$ing, cool products(); + +__END__ +This is perl, v5.8.8 built for i386-freebsd-64int +</pre> +<h2>More...</h2> +<p>Did you like what you saw? Have a look at Github to see my other poems too:</p> +<a class="textlink" href="https://github.com/snonux/perl-poetry">https://github.com/snonux/perl-poetry</a><br /> +<p>E-Mail me your thoughts at comments@mx.buetow.org!</p> +</body> +</html> diff --git a/content/html/gemfeed/2010-05-09-the-fype-programming-language.html b/content/html/gemfeed/2010-05-09-the-fype-programming-language.html new file mode 100644 index 00000000..b2444da3 --- /dev/null +++ b/content/html/gemfeed/2010-05-09-the-fype-programming-language.html @@ -0,0 +1,424 @@ +<!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> +<meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> +<title>Having fun with computers!</title> +<link rel="shortcut icon" type="image/gif" href="/favicon.ico" /> +<style type="text/css"> +body { background-color: #282c34; color: #dfdfdf; margin: auto; max-width: 900px; } +img { display: block; max-width: 70%;} +pre { color: #ecbe7b; } +blockquote { color: #ecbe7b; } +a { color: #c678dd; text-decoration: none; } +a.textlink:before { content: " > "; padding-left: 2px; } +a:hover { color: #51afef; text-decoration: underline; } +h1 { color: #ff6c6b; } +h2, h3, h4, h5, h6 { color: #51afef; } +li { color: #98be65; } +</style> +</head> +<body> +<pre>Written by Paul Buetow 2010-05-09, last updated 2021-05-05</pre> +<a class="textlink" href="../">Go back to the main site</a><br /> +<pre> + ____ _ __ + / / _|_ _ _ __ ___ _ _ ___ __ _| |__ / _|_ _ + / / |_| | | | '_ \ / _ \ | | | |/ _ \/ _` | '_ \ | |_| | | | + _ / /| _| |_| | |_) | __/ | |_| | __/ (_| | | | |_| _| |_| | +(_)_/ |_| \__, | .__/ \___| \__, |\___|\__,_|_| |_(_)_| \__, | + |___/|_| |___/ |___/ + +</pre> +<h1>The Fype Programming Language</h1> +<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> +<pre> +typedef struct { + Tupel *p_tupel_argv; // Contains command line options + List *p_list_token; // Initial list of token + Hash *p_hash_syms; // Symbol table + char *c_basename; +} Fype; +</pre> +<p>And here is a snippet from the main Fype "class implementation":</p> +<pre> +Fype* +fype_new() { + Fype *p_fype = malloc(sizeof(Fype)); + + p_fype->p_hash_syms = hash_new(512); + p_fype->p_list_token = list_new(); + p_fype->p_tupel_argv = tupel_new(); + p_fype->c_basename = NULL; + + garbage_init(); + + return (p_fype); +} + +void +fype_delete(Fype *p_fype) { + argv_tupel_delete(p_fype->p_tupel_argv); + + hash_iterate(p_fype->p_hash_syms, symbol_cleanup_hash_syms_cb); + hash_delete(p_fype->p_hash_syms); + + list_iterate(p_fype->p_list_token, token_ref_down_cb); + list_delete(p_fype->p_list_token); + + if (p_fype->c_basename) + free(p_fype->c_basename); + + garbage_destroy(); +} + +int +fype_run(int i_argc, char **pc_argv) { + Fype *p_fype = fype_new(); + + // argv: Maintains command line options + argv_run(p_fype, i_argc, pc_argv); + + // scanner: Creates a list of token + scanner_run(p_fype); + + // interpret: Interpret the list of token + interpret_run(p_fype); + + fype_delete(p_fype); + + return (0); +} +</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> +<ul> +<li>integer - Specifies a 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> +</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> +<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> +<pre> +my foo = 1 + 2; +say foo; + +my bar = 12, baz = foo; +say 1 + bar; +say bar; + +my baz; +say baz; # Will print out 0 +</pre> +<p>You may use the "defined" keyword to check if an identifier has been defined or not:</p> +<pre> +ifnot defined foo { + say "No foo yet defined"; +} + +my foo = 1; + +if defined foo { + put "foo is defined and has the value "; + say 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> +<pre> +my foo = "foo"; +my bar = \foo; +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> +<pre> +# Create a new procedure baz +proc baz { say "I am baz"; } + +# Make a synonym baz, and undefine baz +my bay = \baz; + +undef baz; + +# bay still has a reference of the original procedure baz +bay; # this prints aut "I am baz" +</pre> +<p>The "syms" keyword gives you the total number of synonyms pointing to a specific value:</p> +<pre> +my foo = 1; +say syms foo; # Prints 1 + +my baz = \foo; +say syms foo; # Prints 2 +say syms baz; # Prints 2 + +undef baz; +say syms foo; # Prints 1 +</pre> +<h2>Statements and expressions</h2> +<p>A Fype program is a list of statements. Each keyword, expression or function call is part of a statement. Each statement is ended with a semicolon. Example:</p> +<pre> +my bar = 3, foo = 1 + 2; +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> +<h3>Basic expressions</h3> +<p>Any "any" value holding a string will be automatically converted to an integer value.</p> +<pre> +(any) <any> + <any> +(any) <any> - <any> +(any) <any> * <any> +(any) <any> / <any> +(integer) <any> == <any> +(integer) <any> != <any> +(integer) <any> <= <any> +(integer) <any> gt <any> +(integer) <any> <> <any> +(integer) <any> gt <any> +(integer) not <any> +</pre> +<h3>Bitwise expressions</h3> +<pre> +(integer) <any> :< <any> +(integer) <any> :> <any> +(integer) <any> and <any> +(integer) <any> or <any> +(integer) <any> xor <any> +</pre> +<h3>Numeric expressions</h3> +<pre> +(number) neg <number> +</pre> +<p>... returns the negative value of "number":</p> +<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> +<pre> +(integer) yes <integer> +</pre> +<p>... always returns 1. The parameter is optional. Example:</p> +<pre> +# Prints out 1, because foo is not defined +if yes { say no defined foo; } +</pre> +<h2>Control statements</h2> +<p>Control statements available in Fype:</p> +<pre> +if <expression> { <statements> } +</pre> +<p>... runs the statements if the expression evaluates to a true value.</p> +<pre> +ifnot <expression> { <statements> } +</pre> +<p>... runs the statements if the expression evaluates to a false value.</p> +<pre> +while <expression> { <statements> } +</pre> +<p>... runs the statements as long as the expression evaluates to a true value.</p> +<pre> +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> +<pre> +my foo = 1; + +{ + # Prints out 1 + put defined foo; + { + my bar = 2; + + # Prints out 1 + put defined bar; + + # Prints out all available symbols at this + # point to stdout. Those are: bar and foo + scope; + } + + # Prints out 0 + put defined bar; + + my baz = 3; +} + +# Prints out 0 +say defined bar; +</pre> +<p>Another example including an actual output:</p> +<pre> +./fype -e ’my global; func foo { my var4; func bar { my var2, var3; func baz { my var1; scope; } baz; } bar; } foo;’ +Scopes: +Scope stack size: 3 +Global symbols: +SYM_VARIABLE: global (id=00034, line=-0001, pos=-001, type=TT_INTEGER, dval=0.000000, refs=-1) +SYM_FUNCTION: foo +Local symbols: +SYM_VARIABLE: var1 (id=00038, line=-0001, pos=-001, type=TT_INTEGER, dval=0.000000, refs=-1) +1 level(s) up: +SYM_VARIABLE: var2 (id=00036, line=-0001, pos=-001, type=TT_INTEGER, dval=0.000000, refs=-1) +SYM_VARIABLE: var3 (id=00037, line=-0001, pos=-001, type=TT_INTEGER, dval=0.000000, refs=-1) +SYM_FUNCTION: baz +2 level(s) up: +SYM_VARIABLE: var4 (id=00035, line=-0001, pos=-001, type=TT_INTEGER, dval=0.000000, refs=-1) +SYM_FUNCTION: bar +</pre> +<h2>Definedness </h2> +<pre> +(integer) defined <identifier> +</pre> +<p>... returns 1 if "identifier" has been defined. Returns 0 otherwise.</p> +<pre> +(integer) undef <identifier> +</pre> +<p>... tries to undefine/delete the "identifier". Returns 1 if it succeeded, otherwise 0 is returned.</p> +<h2>System </h2> +<p>These are some system and interpreter specific built-in functions supported:</p> +<pre> +(void) end +</pre> +<p>... exits the program with the exit status of 0.</p> +<pre> +(void) exit <integer> +</pre> +<p>... exits the program with the specified exit status.</p> +<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> +<pre> +my pid = fork; + +if pid { + put "I am the parent process; child has the pid "; + say pid; + +} ifnot pid { + say "I am the child process"; +} +</pre> +<p>To execute the garbage collector do:</p> +<pre> +(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> +<h3>I/O </h3> +<pre> +(any) put <any> +</pre> +<p>... prints out the argument</p> +<pre> +(any) say <any> +</pre> +<p>is the same as put, but also includes an ending newline.</p> +<pre> +(void) ln +</pre> +<p>... just prints a newline.</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> +<pre> +proc foo { + say 1 + a * 3 + b; + my c = 6; +} + +my a = 2, b = 4; + +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> +<pre> +proc foo { + say "I am foo"; + + undef bar; + proc bar { + say "I am bar"; + } +} + +# Here bar would produce an error because +# the proc is not yet defined! +# bar; + +foo; # Here the procedure foo will define the procedure bar! +bar; # Now the procedure bar is defined! +foo; # Here the procedure foo will redefine bar again! +</pre> +<h3>Functions</h3> +<p>A function can be defined with the "func" keyword and deleted with the "undef" keyword. Function do not yet return values and do not yet supports parameter passing. It's using local (lexical scoped) variables. If a certain variable does not exist, when It's using already defined variables (e.g. one scope above). </p> +<pre> +func foo { + say 1 + a * 3 + b; + my c = 6; +} + +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! +</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> +<pre> +func foo { + func bar { + say "Hello i am nested"; + } + + bar; # Calling nested +} + +foo; +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> +<pre> +func bar { say ”bar” } +my foo = [bar, 1, 4/2, double ”3”, [”A”, [”BA”, ”BB”]]]; +say foo; +</pre> +<p>It produces the following output:</p> +<pre> +% ./fype arrays.fy +bar +01 +2 +3.000000 +A +BA +BB +</pre> +<h2>Fancy stuff</h2> +<p>Fancy stuff like OOP or Unicode or threading is not planed. But fancy stuff like function pointers and closures may be considered.:) </p> +<h2>May the source be with you</h2> +<p>You can find all of this on the GitHub page. There is also an "examples" folders containing some Fype scripts!</p> +<a class="textlink" href="https://github.com/snonux/fype">https://github.com/snonux/fype</a><br /> +<p>E-Mail me your thoughts at comments@mx.buetow.org!</p> +</body> +</html> diff --git a/content/html/gemfeed/2016-04-03-offsite-backup-with-zfs.html b/content/html/gemfeed/2016-04-03-offsite-backup-with-zfs.html index a7faf514..3a143014 100644 --- a/content/html/gemfeed/2016-04-03-offsite-backup-with-zfs.html +++ b/content/html/gemfeed/2016-04-03-offsite-backup-with-zfs.html @@ -1,10 +1,10 @@ -<!DOCTYPE html> -<html lang="en"> +<!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> +<meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> <title>Having fun with computers!</title> -<meta charset='utf-8'> <link rel="shortcut icon" type="image/gif" href="/favicon.ico" /> -<style> +<style type="text/css"> body { background-color: #282c34; color: #dfdfdf; margin: auto; max-width: 900px; } img { display: block; max-width: 70%;} pre { color: #ecbe7b; } diff --git a/content/html/gemfeed/2016-04-16-offsite-backup-with-zfs-part2.html b/content/html/gemfeed/2016-04-16-offsite-backup-with-zfs-part2.html index 892a982b..054d752b 100644 --- a/content/html/gemfeed/2016-04-16-offsite-backup-with-zfs-part2.html +++ b/content/html/gemfeed/2016-04-16-offsite-backup-with-zfs-part2.html @@ -1,10 +1,10 @@ -<!DOCTYPE html> -<html lang="en"> +<!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> +<meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> <title>Having fun with computers!</title> -<meta charset='utf-8'> <link rel="shortcut icon" type="image/gif" href="/favicon.ico" /> -<style> +<style type="text/css"> body { background-color: #282c34; color: #dfdfdf; margin: auto; max-width: 900px; } img { display: block; max-width: 70%;} pre { color: #ecbe7b; } diff --git a/content/html/gemfeed/2016-05-22-spinning-up-my-own-authoritative-dns-servers.html b/content/html/gemfeed/2016-05-22-spinning-up-my-own-authoritative-dns-servers.html index f7479c8d..bd0a49f9 100644 --- a/content/html/gemfeed/2016-05-22-spinning-up-my-own-authoritative-dns-servers.html +++ b/content/html/gemfeed/2016-05-22-spinning-up-my-own-authoritative-dns-servers.html @@ -1,10 +1,10 @@ -<!DOCTYPE html> -<html lang="en"> +<!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> +<meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> <title>Having fun with computers!</title> -<meta charset='utf-8'> <link rel="shortcut icon" type="image/gif" href="/favicon.ico" /> -<style> +<style type="text/css"> body { background-color: #282c34; color: #dfdfdf; margin: auto; max-width: 900px; } img { display: block; max-width: 70%;} pre { color: #ecbe7b; } diff --git a/content/html/gemfeed/2016-11-20-methods-in-c.html b/content/html/gemfeed/2016-11-20-methods-in-c.html index 18e7accb..c17c2cc3 100644 --- a/content/html/gemfeed/2016-11-20-methods-in-c.html +++ b/content/html/gemfeed/2016-11-20-methods-in-c.html @@ -1,10 +1,10 @@ -<!DOCTYPE html> -<html lang="en"> +<!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> +<meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> <title>Having fun with computers!</title> -<meta charset='utf-8'> <link rel="shortcut icon" type="image/gif" href="/favicon.ico" /> -<style> +<style type="text/css"> body { background-color: #282c34; color: #dfdfdf; margin: auto; max-width: 900px; } img { display: block; max-width: 70%;} pre { color: #ecbe7b; } diff --git a/content/html/gemfeed/2021-04-22-dtail-the-distributed-log-tail-program.html b/content/html/gemfeed/2021-04-22-dtail-the-distributed-log-tail-program.html index bc73f30e..18cf586b 100644 --- a/content/html/gemfeed/2021-04-22-dtail-the-distributed-log-tail-program.html +++ b/content/html/gemfeed/2021-04-22-dtail-the-distributed-log-tail-program.html @@ -1,10 +1,10 @@ -<!DOCTYPE html> -<html lang="en"> +<!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> +<meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> <title>Having fun with computers!</title> -<meta charset='utf-8'> <link rel="shortcut icon" type="image/gif" href="/favicon.ico" /> -<style> +<style type="text/css"> body { background-color: #282c34; color: #dfdfdf; margin: auto; max-width: 900px; } img { display: block; max-width: 70%;} pre { color: #ecbe7b; } @@ -27,7 +27,7 @@ li { color: #98be65; } <p>Running a large cloud-based service requires monitoring the state of huge numbers of machines, a task for which many standard UNIX tools were not really designed. In this post, I will describe a simple program, DTail, that Mimecast has built and released as Open-Source, which enables us to monitor log files of many servers at once without the costly overhead of a full-blown log management system.</p> <p>At Mimecast, we run over 10 thousand server boxes. Most of them host multiple microservices and each of them produces log files. Even with the use of time series databases and monitoring systems, raw application logs are still an important source of information when it comes to analysing, debugging, and troubleshooting services.</p> <p>Every engineer familiar with UNIX or a UNIX-like platform (e.g., Linux) is well aware of tail, a command-line program for displaying a text file content on the terminal which is also especially useful for following application or system log files with tail -f logfile.</p> -<p>Think of DTail as a distributed version of the tail program which is very useful when you have a distributed application running on many servers. DTail is an Open-Source, cross-platform, fairly easy to use, support and maintain log file analysis & statistics gathering tool designed for Engineers and Systems Administrators. It is programmed in Google Go.</p> +<p>Think of DTail as a distributed version of the tail program which is very useful when you have a distributed application running on many servers. DTail is an Open-Source, cross-platform, fairly easy to use, support and maintain log file analysis & statistics gathering tool designed for Engineers and Systems Administrators. It is programmed in Google Go.</p> <h2>A Mimecast Pet Project</h2> <p>DTail got its inspiration from public domain tools available already in this area but it is a blue sky from-scratch development which was first presented at Mimecast’s annual internal Pet Project competition (awarded with a Bronze prize). It has gained popularity since and is one of the most widely deployed DevOps tools at Mimecast (reaching nearly 10k server installations) and many engineers use it on a regular basis. The Open-Source version of DTail is available at:</p> <a class="textlink" href="https://dtail.dev">https://dtail.dev</a><br /> diff --git a/content/html/gemfeed/2021-04-24-welcome-to-the-geminispace.html b/content/html/gemfeed/2021-04-24-welcome-to-the-geminispace.html index eaf5b841..c8b7daf0 100644 --- a/content/html/gemfeed/2021-04-24-welcome-to-the-geminispace.html +++ b/content/html/gemfeed/2021-04-24-welcome-to-the-geminispace.html @@ -1,10 +1,10 @@ -<!DOCTYPE html> -<html lang="en"> +<!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> +<meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> <title>Having fun with computers!</title> -<meta charset='utf-8'> <link rel="shortcut icon" type="image/gif" href="/favicon.ico" /> -<style> +<style type="text/css"> body { background-color: #282c34; color: #dfdfdf; margin: auto; max-width: 900px; } img { display: block; max-width: 70%;} pre { color: #ecbe7b; } @@ -46,7 +46,7 @@ li { color: #98be65; } </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 p |
