neodevelop

#include <stdio.h>

void guess(int n, int low, int upper){
  int guess_number = (upper + low) / 2;
  if(guess_number < n){
    printf("Tu número no es %d\n", guess_number);
    guess(n, guess_number, upper);
  }
  if(guess_number > n){
    printf("Tu número no es %d\n", guess_number);

neodevelop

# migrating from https://github.com/robbyrussell/oh-my-zsh/blob/master/plugins/git/git.plugin.zsh 

# Aliases
alias g='git'
#compdef g=git
alias gst='git status'
#compdef _git gst=git-status
alias gd='git diff'
#compdef _git gd=git-diff
alias gdc='git diff --cached'

neodevelop

#! /bin/sh
# ==================================================================
#  ______                           __     _____
# /_  __/___  ____ ___  _________ _/ /_   /__  /
#  / / / __ \/ __ `__ \/ ___/ __ `/ __/     / /
# / / / /_/ / / / / / / /__/ /_/ / /_      / /
#/_/  \____/_/ /_/ /_/\___/\__,_/\__/     /_/

# Multi-instance Apache Tomcat installation with a focus
# on best-practices as defined by Apache, SpringSource, and MuleSoft

neodevelop

Setting up github and bitbucket on the same computer

Github will be the main account and bitbucket the secondary.

Create SSH Keys

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.

neodevelop

Haskell Class

chapter 3 - Types and classes

A type is a collection of related values

For example type Bool

neodevelop

Digital Toolchain for Book Authors

Text markup and structure

• So many light markup formats to consider
  • Markdown
  • Textile
  • reStructuredText
  • Asciidoc
  • Most compile to HTML, PDF, DocBook
• Get handy with PanDoc (but man, the haskell bootstrapping is a pain)

neodevelop

qsort [] = []
qsort(x:xs) = qsort smaller ++ [x] ++ qsort larger
              where
                smaller = [ a | a <- xs, a <= x]
                larger = [ b | b <- xs, b > x]

neodevelop

defmodule Sieve.Eratosthenes do

  def primes_to(n) do
    sieve([], candidates(n))
  end

  defp sieve(primes, []) do
    primes
  end

neodevelop

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:

• Swift 2
  • Core Data
  • Llamadas a WebServices
  • StoryBoards
  • Manejo de la cámara
• Manejo del hardware en general de los dispositivos

neodevelop

(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))