Command line unicode search

2016-01-06 in Programming

Similar to Monday’s post about command line emoji search, I often find myself wanting to look up Unicode characters. I have a custom search engine / bookmark set up in Chrome / Firefox (uni %s maps to http://unicode-search.net/unicode-namesearch.pl?term=%s&.submit=Submit&subs=1). That actually works great, but given how relatively much of my day I spend on the command line, I thought it would be interesting to do something there:

$ uni delta
⍋	apl functional symbol delta stile
⍙	apl functional symbol delta underbar
⍍	apl functional symbol quad delta
≜	delta equal to
Δ	greek capital letter delta
δ	greek small letter delta
ẟ	latin small letter delta
ƍ	latin small letter turned delta
𝚫	mathematical bold capital delta
𝜟	mathematical bold italic capital delta
𝜹	mathematical bold italic small delta
𝛅	mathematical bold small delta
𝛥	mathematical italic capital delta
𝛿	mathematical italic small delta
𝝙	mathematical sans-serif bold capital delta
𝞓	mathematical sans-serif bold italic capital delta
𝞭	mathematical sans-serif bold italic small delta
𝝳	mathematical sans-serif bold small delta
ᵟ	modifier letter small delta

Command line emoji search

2016-01-04 in Programming

Sometimes, I find myself wanting to communicate in emoji.

🐔

How about this:

$ emoji chicken
🐔

$ emoji "which came first, the :chicken: or the :egg:"
which came first, the 🐔 or the 🍳

Advent of Code: Day 25

2015-12-25 in Programming

Source

Part 1: Take the relation:

F(n) = \left\{\begin{matrix} 20151225 & \textrm{if}\ n = 1 \\ 252533F(n-1) \mod 33554393 & \textrm{otherwise} \end{matrix}\right.

Arrange the values according to Cantor’s diagonal argument. Find the value at a specific cell.

Advent of Code: Day 24

2015-12-24 in Programming

Source

Part 1: Split a list of integers into three groups of equal sum. Find the grouping such that the smallest group has the least items, breaking ties by the smallest product for that group.

Advent of Code: Day 23

2015-12-23 in Programming

Source

Part 1: Create a simple virtual machine with two registers (a and b, non-negative integers) and six instructions:

hlf (a|b) - divide the given register by half, round down
tpl (a|b) - triple the given register
inc (a|b) - add 1 to the given register
jmp [+-]\d+ - jump forward/backwards by the given number of instructions
jie (a|b), [+-]\d+ - if the given register is even, jump
jio (a|b), [+-]\d+ - if the given register equals one, jump

Advent of Code: Day 22

2015-12-22 in Programming

Source

Part 1: Simulate an RPG mage battle; finding the winning solution using the least mana. See the original writeup for more details.

Advent of Code: Day 21

2015-12-21 in Programming

Source

Part 1: Given a shop full of weapons (buy exactly one), armor (buy zero or one), and rings (buy 0, 1, or 2), determine the set of items that will defeat a given enemy for the minimum cost (see the original writeup for more details).

Advent of Code: Day 20

2015-12-20 in Programming

Source

Part 1: P(n) is defined such that for each number i, add 10i to any number divisible by i. Find the first value n such that P(n) is at least a given target number.