92 lines
9.2 KiB
HTML
92 lines
9.2 KiB
HTML
|
<p style="text-align: left;">
|
|||
|
|
The Buridan’s donkey is an illustration of a paradox regarding the philosophy of moral determinism and free will.
|
|||
|
|
</p>
|
|||
|
|
|
|||
|
|
<p style="text-align: left;">
|
|||
|
|
The paradox shows an hypothetical situation in which a donkey searching for food is caught in the middle of two equally appealing stacks of hay located at the same distance from the donkey. Because the donkey has no real reason to choose one over the other he dies of starvation.
|
|||
|
|
</p>
|
|||
|
|
|
|||
|
|
<p><a href="https://en.wikipedia.org/wiki/Buridan's_ass"><img class="aligncenter size-full wp-image-209" src="http://francescomecca.eu/wp-content/uploads/2015/09/Deliberations_of_Congress.jpg" alt="Deliberations_of_Congress" width="431" height="425" srcset="http://francescomecca.eu/wp-content/uploads/2015/09/Deliberations_of_Congress-300x296.jpg 300w, http://francescomecca.eu/wp-content/uploads/2015/09/Deliberations_of_Congress.jpg 431w" sizes="(max-width: 431px) 100vw, 431px" /></a>I have decided to write a cli program that chooses for me when I can’t make up my mind.</p>
|
|||
|
|
|
|||
|
|
<p>The program is written in C++ and when invoked along with two or more arguments it puts them in a vector and then changes the order randomly.</p>
|
|||
|
|
|
|||
|
|
<figure class="highlight"><pre><code class="language-c" data-lang="c"><span class="cp">#include <iostream>
|
|||
|
|
#include <vector>
|
|||
|
|
#include <algorithm>
|
|||
|
|
#include <random>
|
|||
|
|
#include <string>
|
|||
|
|
#include <sys/poll.h>
|
|||
|
|
</span><span class="n">using</span> <span class="n">namespace</span> <span class="n">std</span><span class="p">;</span>
|
|||
|
|
|
|||
|
|
<span class="k">struct</span> <span class="n">pollfd</span> <span class="n">stdin_poll</span> <span class="o">=</span> <span class="p">{</span>
|
|||
|
|
<span class="p">.</span><span class="n">fd</span> <span class="o">=</span> <span class="n">fileno</span> <span class="p">(</span><span class="n">stdin</span><span class="p">),</span> <span class="p">.</span><span class="n">events</span> <span class="o">=</span> <span class="n">POLLIN</span>
|
|||
|
|
<span class="p">};</span>
|
|||
|
|
|
|||
|
|
<span class="kt">void</span> <span class="nf">read_from_piped_input</span> <span class="p">(</span><span class="n">vector</span><span class="o"><</span><span class="n">string</span><span class="o">>&</span> <span class="n">lst</span><span class="p">)</span>
|
|||
|
|
<span class="p">{</span>
|
|||
|
|
<span class="n">string</span> <span class="n">x</span><span class="p">;</span>
|
|||
|
|
<span class="k">while</span> <span class="p">(</span><span class="n">getline</span> <span class="p">(</span><span class="n">cin</span><span class="p">,</span> <span class="n">x</span><span class="p">))</span> <span class="p">{</span>
|
|||
|
|
<span class="n">lst</span><span class="p">.</span><span class="n">push_back</span> <span class="p">(</span><span class="n">x</span><span class="p">);</span>
|
|||
|
|
<span class="p">}</span>
|
|||
|
|
<span class="p">}</span>
|
|||
|
|
|
|||
|
|
<span class="kt">void</span> <span class="nf">read_from_arguments</span> <span class="p">(</span><span class="k">const</span> <span class="kt">int</span><span class="o">&</span> <span class="n">argc</span><span class="p">,</span> <span class="kt">char</span><span class="o">*</span> <span class="n">argv</span><span class="p">[],</span> <span class="n">vector</span><span class="o"><</span><span class="n">string</span><span class="o">>&</span> <span class="n">lst</span><span class="p">)</span>
|
|||
|
|
<span class="p">{</span>
|
|||
|
|
<span class="k">if</span> <span class="p">(</span><span class="n">argc</span> <span class="o">==</span> <span class="mi">1</span><span class="p">)</span> <span class="p">{</span>
|
|||
|
|
<span class="n">cout</span> <span class="o"><<</span> <span class="s">"Usage: asino [string] [string] ..."</span> <span class="o"><<</span> <span class="n">endl</span><span class="p">;</span>
|
|||
|
|
<span class="n">exit</span><span class="p">;</span>
|
|||
|
|
<span class="p">}</span>
|
|||
|
|
<span class="k">for</span> <span class="p">(</span><span class="n">vector</span><span class="o"><</span><span class="n">string</span><span class="o">>::</span><span class="n">size_type</span> <span class="n">i</span> <span class="o">=</span> <span class="mi">1</span><span class="p">;</span> <span class="n">i</span> <span class="o"><</span> <span class="n">argc</span><span class="p">;</span> <span class="o">++</span><span class="n">i</span><span class="p">)</span> <span class="p">{</span>
|
|||
|
|
<span class="n">lst</span><span class="p">.</span><span class="n">push_back</span> <span class="p">(</span><span class="n">argv</span><span class="p">[</span><span class="n">i</span><span class="p">]);</span>
|
|||
|
|
<span class="p">}</span>
|
|||
|
|
<span class="p">}</span>
|
|||
|
|
|
|||
|
|
<span class="kt">int</span> <span class="nf">main</span> <span class="p">(</span><span class="kt">int</span> <span class="n">argc</span><span class="p">,</span> <span class="kt">char</span><span class="o">*</span> <span class="n">argv</span><span class="p">[])</span>
|
|||
|
|
<span class="p">{</span>
|
|||
|
|
<span class="n">vector</span><span class="o"><</span><span class="n">string</span><span class="o">></span> <span class="n">lst</span><span class="p">;</span>
|
|||
|
|
<span class="kt">int</span> <span class="n">poll_ret</span> <span class="o">=</span> <span class="n">poll</span> <span class="p">(</span><span class="o">&</span><span class="n">stdin_poll</span><span class="p">,</span> <span class="mi">1</span><span class="p">,</span> <span class="mi">0</span><span class="p">);</span>
|
|||
|
|
<span class="k">if</span> <span class="p">(</span><span class="n">poll_ret</span> <span class="o">></span> <span class="mi">0</span><span class="p">)</span> <span class="p">{</span>
|
|||
|
|
<span class="n">read_from_piped_input</span> <span class="p">(</span><span class="n">lst</span><span class="p">);</span>
|
|||
|
|
<span class="p">}</span>
|
|||
|
|
<span class="k">else</span> <span class="p">{</span>
|
|||
|
|
<span class="n">read_from_arguments</span> <span class="p">(</span><span class="n">argc</span><span class="p">,</span> <span class="n">argv</span><span class="p">,</span> <span class="n">lst</span><span class="p">);</span>
|
|||
|
|
<span class="p">}</span>
|
|||
|
|
|
|||
|
|
<span class="n">random_device</span> <span class="n">rd</span><span class="p">;</span>
|
|||
|
|
<span class="n">mt19937</span> <span class="n">m</span><span class="p">(</span><span class="n">rd</span><span class="p">());</span>
|
|||
|
|
<span class="n">shuffle</span> <span class="p">(</span><span class="n">lst</span><span class="p">.</span><span class="n">begin</span> <span class="p">(),</span> <span class="n">lst</span><span class="p">.</span><span class="n">end</span> <span class="p">(),</span> <span class="n">m</span><span class="p">);</span>
|
|||
|
|
|
|||
|
|
<span class="kt">int</span> <span class="n">i</span> <span class="o">=</span> <span class="mi">1</span><span class="p">;</span>
|
|||
|
|
<span class="k">for</span> <span class="p">(</span><span class="n">vector</span><span class="o"><</span><span class="n">string</span><span class="o">>::</span><span class="n">iterator</span> <span class="n">it</span> <span class="o">=</span> <span class="n">lst</span><span class="p">.</span><span class="n">begin</span> <span class="p">();</span> <span class="n">it</span> <span class="o">!=</span> <span class="n">lst</span><span class="p">.</span><span class="n">end</span> <span class="p">();</span> <span class="o">++</span><span class="n">it</span><span class="p">)</span> <span class="p">{</span>
|
|||
|
|
<span class="n">cout</span> <span class="o"><<</span> <span class="n">i</span><span class="o">++</span> <span class="o"><<</span> <span class="s">". "</span> <span class="o"><<</span> <span class="o">*</span><span class="n">it</span> <span class="o"><<</span> <span class="n">endl</span><span class="p">;</span>
|
|||
|
|
<span class="p">}</span>
|
|||
|
|
<span class="p">}</span></code></pre></figure>
|
|||
|
|
|
|||
|
|
<p>I have used the <a href="http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine" target="_blank">Mersenne Twister PRNG</a> just to give it a try.</p>
|
|||
|
|
|
|||
|
|
<p style="text-align: left;">
|
|||
|
|
One of the challenges was to read from stdin instead of arguments when the program is piped after another program in the shell:
|
|||
|
|
</p>
|
|||
|
|
|
|||
|
|
<figure class="highlight"><pre><code class="language-sh" data-lang="sh">ls /media/my_movies/ | buridan</code></pre></figure>
|
|||
|
|
|
|||
|
|
<p>So I have used poll() that checks for a specified amount of time if the selected device (/dev/stdin in my case) can perform I/O operations; in my code:</p>
|
|||
|
|
|
|||
|
|
<figure class="highlight"><pre><code class="language-bash" data-lang="bash">poll <span class="o">(</span>&stdin_poll, 1, 0<span class="o">)</span></code></pre></figure>
|
|||
|
|
|
|||
|
|
<p>I selected the POLLIN as event so poll() only checks if there is data to read, 1 as the number of items in the fds array, 0 milliseconds of timeout because when the program is invoked /dev/stdin may already contain input.</p>
|
|||
|
|
|
|||
|
|
<p>The program should be compiled this way:</p>
|
|||
|
|
|
|||
|
|
<figure class="highlight"><pre><code class="language-bash" data-lang="bash">g++ -std<span class="o">=</span>c++11 ./program.cpp -o output</code></pre></figure>
|
|||
|
|
|
|||
|
|
<p>You are free to reuse this little piece of code as you wish.</p>
|
|||
|
|
|
|||
|
|
<p>EDIT: 02-04-2016
|
|||
|
|
The original idea for the Buridan’s donkey came from my mentor <a href="https://twitter.com/bassosimone">Simone Basso</a> who wrote the original one in haskell.</p>
|
|||
|
|
|
|||
|
|
<p style="text-align: right;">
|
|||
|
|
Francesco Mecca
|
|||
|
|
</p>
|
|||
|
|
|