Github will be the main account and bitbucket the secondary.
ssh-keygen -t rsa -C "github email"
Enter passphrase when prompted. If you see an option to save the passphrase in your keychain, do it for an easier life.
#! /bin/sh | |
# ================================================================== | |
# ______ __ _____ | |
# /_ __/___ ____ ___ _________ _/ /_ /__ / | |
# / / / __ \/ __ `__ \/ ___/ __ `/ __/ / / | |
# / / / /_/ / / / / / / /__/ /_/ / /_ / / | |
#/_/ \____/_/ /_/ /_/\___/\__,_/\__/ /_/ | |
# Multi-instance Apache Tomcat installation with a focus | |
# on best-practices as defined by Apache, SpringSource, and MuleSoft |
qsort [] = [] | |
qsort(x:xs) = qsort smaller ++ [x] ++ qsort larger | |
where | |
smaller = [ a | a <- xs, a <= x] | |
larger = [ b | b <- xs, b > x] |
defmodule Sieve.Eratosthenes do | |
def primes_to(n) do | |
sieve([], candidates(n)) | |
end | |
defp sieve(primes, []) do | |
primes | |
end |
Hola,
Estamos buscando un desarrollador iOS para la ciudad de México, que tenga conocimientos sólidos en aplicaciones móviles. Los requisitos son los siguientes:
(defun is-prime (n) | |
(cond ((= 2 n) t) ;; Hard-code "2 is a prime" | |
((= 3 n) t) ;; Hard-code "3 is a prime" | |
((evenp n) nil) ;; If we're looking at an even now, it's not a prime | |
(t ;; If it is divisible by an odd number below its square root, it's not prime | |
(loop for i from 3 to (isqrt n) by 2 | |
never (zerop (mod n i)))))) | |
(print (is-prime 13195)) |
Hola!!!
Estamos buscando un desarrollador con conocimientos en:
groupsToDelete = [] | |
Group.list().each { group -> | |
if(group.members.isEmpty()) | |
groupsToDelete << link | |
} | |
groupsToDelete*.delete() |