Skip to content

Instantly share code, notes, and snippets.

// ##########################################
// GENERATING KEYS
// ##########################################
my_user_id = "John Test <john_test@someserver.com>";
my_passphrase = "123qwe"; // Key Pairs is always protected with a password to safety.
my_key = openpgp.generateKeyPair({numBits: 1024, userId: my_user_id, passphrase: my_passphrase});
// My Private Key String
console.log("My private key:\n\n" + my_key.privateKeyArmored + "\n\n");
defmodule Math do
def zero?(0) do
true
end
def zero?(x) when is_integer(x) do
false
end
end
@fschuindt
fschuindt / recursion.exs
Last active April 24, 2016 00:20
Recursion rather than ground-level loop structures in Elixir.
defmodule Recursion do
def print_multiple_times(msg, n) when n <= 1 do
IO.puts msg
end
def print_multiple_times(msg, n) do
IO.puts msg
print_multiple_times(msg, n - 1)
end
end
@fschuindt
fschuindt / list_sum.exs
Last active April 25, 2016 19:49
Sum of elements on a list. "The process of taking a list and reducing it down to one value is known as a reduce algorithm and is central to functional programming."
defmodule Math do
def sum_list([head | tail], accumulator) do
sum_list(tail, head + accumulator)
end
def sum_list([], accumulator) do
accumulator
end
end
:: Elixir study notes.
# get some help:
iex> i 'hello'
Term
'hello'
Data type
List
Description
...
@fschuindt
fschuindt / loop.rb
Last active July 9, 2016 00:50
loop.rb is faster, besides that recusion.rb faces "stack level too deep" with approximately 8 thousands interactions.
def print_msg_n_times(msg, n)
n.times do
puts msg
end
end
print_msg_n_times('Hello world', 6_000)
defmodule Math do
def sum_list(list, accumulator \\ 0)
def sum_list([head | tail], accumulator) do
sum_list(tail, head + accumulator)
end
def sum_list([], accumulator) do
accumulator
end
defmodule Triple do
def pythagorean(n) when n > 0 do
for a <- 1..n,
b <- 1..n,
c <- 1..n,
do: IO.puts "#{a} #{b} #{c}"
end
end
Triple.pythagorean(10)
# Challenge 1: Given a list of integers, create a module that maps that list
# into different processes. Deliver to those processes the element and a
# function to be performed with it. This function can be anything, for
# instance: "Returns square of the number". Finally each process shoud send
# a message to the spawning process with the result.
defmodule Spawner do
@moduledoc """
Maps a list into processes performing a given function. Each one sends a
message to the spawning process, this one uses the IO module to print it out.
local return_code="%(?..%{$fg[red]%}%? ↵%{$reset_color%})"
if [[ $UID -eq 0 ]]; then
local user_host='%{$terminfo[bold]$fg[red]%}%n@%m%{$reset_color%}'
local user_symbol='#'
else
local user_host='%{$terminfo[bold]$fg[grey]%}%n@%m%{$reset_color%}'
local user_symbol='$'
fi