clrnd

-- Ezequiel Alvarez (421/13) - Virginia Napoli (418/13) - Turno Noche
-- utilidades
base10aEntero :: [Int] -> Int
base10aEntero [x] = x
base10aEntero (x:xs) = x*(10^indice) + base10aEntero xs
    where indice = length xs

divisiblePor :: Int -> Int -> (Int -> Int -> Int) -> Bool
divisiblePor dividendo x test | x == 0 = True
                              | x == dividendo = True

clrnd

import Text.Printf
import Control.Exception
import System.CPUTime
 
time :: IO t -> IO t
time a = do
    start <- getCPUTime
    v <- a
    end   <- getCPUTime
    let diff = (fromIntegral (end - start)) / (10^12)

clrnd

import Text.Printf
import System.CPUTime
import qualified Data.Sequence as Seq
import Data.Sequence ((><), (<|), (|>))
import Data.Foldable (toList)
 
time :: IO t -> IO t
time a = do
  start <- getCPUTime
  v <- a

clrnd

Keybase proof

I hereby claim:

• I am alvare on github.
• I am alvare (https://keybase.io/alvare) on keybase.
• I have a public key whose fingerprint is 299F A304 4E77 184C 7831 7E7D A45B 3D40 CF96 B477

To claim this, I am signing this object:

clrnd

# coding: utf-8
import csv
import json
import numpy as np


def r_tree(points, K):
    """ STR method for building R-Tree like structure.
        http://stats.stackexchange.com/a/40785
        http://www.dtic.mil/dtic/tr/fulltext/u2/a324493.pdf (pag. 8)

clrnd

module Main where

import Control.Concurrent.Async.Pool

main :: IO ()
main = do
    withTaskGroup 5 $ \g ->
        mapTasks_ g $ map print [1..10]
    putStrLn "Done!"

clrnd

(ns alphabet-cipher.coder)

;  Vemos que encodear un caracter `m` con
;  una letra de keyword `k` es equivalente a sumar sus indices
;  en el abecedario modulo 26.
;
;  Por ejemplo: con indice("m") = 12 y indice("s") = 18 tenemos
;  12 + 18 ≡ 4 (mod 26)
;  y 4 = indice("e")
;

clrnd

-- stack --resolver lts-5.8 runghc --package "aeson scalpel bytestring text"
{-# LANGUAGE LambdaCase #-}
module Main where

import           Control.Monad (forM)
import           Text.HTML.Scalpel
import           Data.Aeson
import           Data.Text (Text, unpack, pack, strip)
import qualified Data.Text.IO as T
import qualified Data.ByteString.Lazy as B

clrnd

module Main where

data Ball = R | B deriving (Show, Eq)

data Coin = Ca | Ce deriving (Show, Eq)

s_a = [(Ca, [a, b, c, d]) | a <- l, b <- l, c <- l, d <- l]
    where l = [R, R, R, R, B, B]

s_e = [(Ce, [a, b, c, d]) | a <- l, b <- l, c <- l, d <- l]

clrnd

[ Launch: proba ] 037ea62c55b3be75628b1ef7c6b40658 by alvare