Decision tables: Difference between revisions
Content added Content deleted
(→{{header|Perl 6}}: add entry) |
(→{{header|Perl 6}}: more explanation) |
||
Line 517:
say '';
}</lang>
A bit of explanation: we pass in two pair lists for the
generated by regarding them as a binary counter from right to left, with the least significant bit on the bottom. The <tt>@q.map</tt> runs the prompts and maps them to booleans
using case-insensitive matching. We reverse that list and zip multiply with powers of two to figure out which bit we're going to grep for. (The zip stops on the shorter list, which is always going to be the list of booleans, since the list of powers of two is infinite.) The solutions list of pairs is conveniently keyed on binary numbers written in colon radix notation, so we grep the keys containing the correct bit, then map the pair list to its values using a hyperoperator to parallelize it. Unlike in Perl 5, we can use <tt>||</tt> on lists as well as scalars to provide a default result if nothing matches.▼
using case-insensitive matching. We reverse that list and zip multiply with powers of two to figure out which bit we're going to grep for. (The zip stops on the shorter list, which is always going to be the list of booleans, since the list of powers of two is infinite.) We sum up those powers of two using a <tt>[+]</tt> reduction metaoperator, which in this case gives us a number from 0 to 7. Then we take 2 to that power.
▲
{{out}}
<pre>Printer does not print? n
Line 538 ⟶ 541:
Printer does not print? ^C</pre>
=={{header|PicoLisp}}==
We allow ourselves a luxurious user interface:
| |||