<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet href="https://kamilborys.com/feed_style.xsl" type="text/xsl"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
    <tabi:metadata xmlns:tabi="https://github.com/welpo/tabi">
        <tabi:base_url>https:&#x2F;&#x2F;kamilborys.com</tabi:base_url>
        <tabi:separator>
            •
        </tabi:separator>
        <tabi:about_feeds>This is a web feed, also known as an Atom feed. Subscribe by copying the URL from the address bar into your newsreader. Visit About Feeds to learn more and get started. It&#x27;s free.</tabi:about_feeds>
        <tabi:visit_the_site>Visit website</tabi:visit_the_site>
        <tabi:recent_posts>Recent posts</tabi:recent_posts>
        <tabi:last_updated_on>Updated on $DATE</tabi:last_updated_on>
        <tabi:default_theme>dark</tabi:default_theme>
        <tabi:post_listing_date>date</tabi:post_listing_date>
        <tabi:current_section>Perl</tabi:current_section>
    </tabi:metadata><link rel="extra-stylesheet" href="https://kamilborys.com/skins/amber.css?h=f8925a89cfb5bc099f43" /><title>KamilCase - Perl</title>
    <link href="https://kamilborys.com/tags/perl/atom.xml" rel="self" type="application/atom+xml"/>
    <link href="https://kamilborys.com/tags/perl/" rel="alternate" type="text/html"/>
    <generator uri="https://www.getzola.org/">Zola</generator>
    <updated>2018-08-15T11:08:11+00:00</updated>
    <id>https://kamilborys.com/tags/perl/atom.xml</id><entry xml:lang="en">
        <title>Dots and Dashes</title>
        <published>2018-08-15T11:08:11+00:00</published>
        <updated>2018-08-15T11:08:11+00:00</updated>
        <author>
            <name>Kamil Borys</name>
        </author>
        <link rel="alternate" href="https://kamilborys.com/blog/dots-and-dashes/" type="text/html"/>
        <id>https://kamilborys.com/blog/dots-and-dashes/</id>
        <summary type="html">#!perl -p
y/.-/01/;s#\d+/?#substr&#39;01etianmsurwdkgohvf,l.pjbxcyzq&#39;,31&amp;oct b1.$&amp;,1#ge

Perl is (in)famous for the ability to write programs that look like line noise, and today I will take apart this beautiful piece of code.  Written by tybalt89, it can decode sequences of dots and dashes to Latin letters in just 73 characters of code…</summary>
        </entry><entry xml:lang="en">
        <title>Anatomy of the heart</title>
        <published>2018-03-13T08:01:46+00:00</published>
        <updated>2018-03-13T08:01:46+00:00</updated>
        <author>
            <name>Kamil Borys</name>
        </author>
        <link rel="alternate" href="https://kamilborys.com/blog/anatomy-of-the-heart/" type="text/html"/>
        <id>https://kamilborys.com/blog/anatomy-of-the-heart/</id>
        <summary type="html">#!/usr/bin/perl -w
use strict;

     my$f=           $[;my
   $ch=0;sub       l{length}
 sub r{join&quot;&quot;,   reverse split
(&quot;&quot;,$_[$[])}sub ss{substr($_[0]
,$_[1],$_[2])}sub be{$_=$_[0];p
 (ss($_,$f,1));$f+=l()/2;$f%=l 
  ();$f++if$ch%2;$ch++}my$q=r
   (&quot;\ntfgpfdfal,thg?bngbj&quot;.    
    &quot;naxfcixz&quot;);$_=$q; $q=~
      tr/f[a-z]/ [l-za-k] 
        /;my@ever=1..&amp;l
          ;my$mine=$q
            ;sub p{
             print
              @_;
               }
                         
       be $mine for @ever 

This heart-shaped program is written in the language of choice for producing unreadable and obfuscated code: Perl 5. It also serves an unusual purpose of a proposal…</summary>
        </entry><entry xml:lang="en">
        <title>Regex prime checker</title>
        <published>2017-10-07T13:26:38+00:00</published>
        <updated>2017-10-07T13:26:38+00:00</updated>
        <author>
            <name>Kamil Borys</name>
        </author>
        <link rel="alternate" href="https://kamilborys.com/blog/regex-prime-checker/" type="text/html"/>
        <id>https://kamilborys.com/blog/regex-prime-checker/</id>
        <summary type="html">This Java snippet uses a regular expression for something way different than they were designed for: a primality check.
public static boolean prime(int n) {
    return !new String(new char[n]).matches(&quot;.?|(..+?)\\1+&quot;);
}
…</summary>
        </entry>
</feed>
