reinaldorauch

(async() => {
  const jsonComOsRegistros = [];
  const arrayComAsRespostasDaPrimeiraFuncao = await Promise.all(jsonComOsRegistro.map(primeiraFuncaoQueRetornaPromise)
  const arrayComAsRespostasDaSegundaFuncao = await Promise.all(jsonComOsRegistros.map(segundaFuncaoQueRetornaPromise)
})();

reinaldorauch

{
  "mysql": "mysql://root:@localhost/passe_livre_fixer",
  "credenciais": {
    "prefeitura": "Credenciais Prefeitura",
    "vcg": "Credenciais VCG"
  },
  "urls": {
    "prefeitura": {
      "relatorio": "http://intranet.prefeitura/blabla",
      "autenticacao": "http://intranet.prefeitura/blabla"

reinaldorauch

$if2(%albumartist%,%artist%)/[$if(%date%,$left(%date%,4))][$if2($if($inmulti(%releasetype%,single),Single,),$if($inmulti(%releasetype%,compilation),Compilation),Album)] %album%/$if($gt(%totaldiscs%,1),$num(%discnumber%,2)) $num(%tracknumber%,2) %title%

reinaldorauch

Referências sobre adicionar checksum em mensagens http

• RFC especificando o Content-MD5

• Pergunta no stackexchange sobre o Content-MD5

• Trecho de livro falando sobre o Content-MD5

reinaldorauch

AngularJS Unit Testing

Best Pratices

Promises

Example gist

Testing ui-router states

reinaldorauch

#!/bin/bash

for TAG in `git tag`
do
    git tag "v$TAG" "$TAG"
    git tag -d "$TAG"
    git push origin :refs/tags/$TAG
done

git push origin --tags

reinaldorauch

(function (argument) {
  var mysql = require('mysql');

  var db = mysql.createConnection('mysql://root:amigen@localhost/bestuse_main');

  db.query('SELECT  * FROM customers', function (err, res) {
    if (err) { throw err; }

    for (var i = 0; i < res.length; i++) {
      console.log(res[i].orgname);

reinaldorauch

#include <stdio.h>
#include <stdlib.h>

#define ITERACOES 10000

double calcPi() {
    long int a = 1, b = 2;
    double result = 1;

    for (int i = 0; i < ITERACOES; i++)

reinaldorauch

data Tree a = EmptyTree | Node a (Tree a) (Tree a) deriving (Show)

treeInsert :: (Ord a) => a -> Tree a -> Tree a
treeInsert x EmptyTree = Node x EmptyTree EmptyTree
treeInsert x (Node a left right)
  | x == a = Node x left right
  | x < a  = Node a (treeInsert x left) right
  | x > a  = Node a left (treeInsert x right)

treeElement :: (Ord a) => a -> Tree a -> Bool

reinaldorauch

import Data.List

media :: Fractional a => [a] -> a
media l= let (t,n) = foldl' (\(!b,!c) a -> (a+b,c+1)) (0,0) l in t / n

desvios :: Fractional a => [a] -> a -> [a]
desvios xs m = [ a - m | a <- xs ]

powtwo :: Fractional a => [a] -> [a]
powtwo xs = [ a ^ 2 | a <- xs ]