jorge-d

# list the possibly-unwanted jobs
launchctl list | grep -v apple | grep -v homebrew

# find the agents path
launchctl dumpstate | grep -v apple | grep -v homebrew | grep plist

# unload the job
launchctl unload -w /path/to/the_file.plist

jorge-d

def gen(nb, max)
  pool = (1..max).to_a
  nb.times.map { pool.shuffle!.pop }.sort
end

# LOTO
numbers = gen(5, 49) + gen(1, 10)
puts "Draw: #{numbers.slice(0..-2).join(" - ")} | #{numbers.last}"

# Euromillion

jorge-d

# FROM ubuntu:16.04
apt-get update
apt-get install -y build-essential software-properties-common autoconf libssl-dev libboost-dev libboost-chrono-dev libboost-filesystem-dev libboost-program-options-dev libboost-system-dev libboost-test-dev libboost-thread-dev sudo automake git
add-apt-repository ppa:bitcoin/bitcoin -y
apt-get update
apt-get install libdb4.8-dev bsdmainutils libdb4.8++-dev -y

mkdir ~/arc
cd ~/arc
apt-get install wget nano -y

jorge-d

var metric = probe.metric({
  name  : 'Realtime user',
  agg_type: 'avg', // 'sum' / 'avg' / 'min' / 'max'
  value : function() {
    return Object.keys(users).length;
  }
});

jorge-d

[  
   {  
      "created_at":"Fri Oct 03 2014 13:01:27 GMT+00:00",
      "data":{  
         "active":false,
         "process":[  
            {  
               "axm_actions":[  

               ],

jorge-d

Pure CSS pie timer

Thanks @Joshua Hibbert for the border-radius trick. :)

Be sure to have a look at :

• The GitHub repo: https://github.com/HugoGiraudel/CSS-Pie-Timer
• The article about it on CSS-tricks : http://css-tricks.com/css-pie-timer/
• Ludvig Lindblom's version allowing gradients : http://codepen.io/ludviglindblom/details/dfjAt
• Mahroof Ali's version built slightly differently : http://codepen.io/anon/pen/ItEni
• Anders Grimsrud's version with SVG : http://codepen.io/agrimsrud/details/EmCoa.

jorge-d

# For this week, take a stab at implementing a hash table in your favorite
# programming language. That is to say, write a data structure that
# will let you map keys
# to values and give you amortized constant-time access.
# Your implementation should have some form of collision handling--what do
# you do when your hash function maps two keys to the same place?
# This is a game of taboo—don't use any associative arrays
# (dictionaries, hash.*s, {}s, PHP array(k=>v)s etc) in your implementation.
# Time yourself, and time box your attempt to one hour.
# As Yegge notes: "You should be able to implement one using only arrays in