Woodsphreaker

"use strict";

const arr = [[-1, 3, 4, 1], [2, 2, 4, 9], [4, 5, -7, 9]];
const flatten = [].concat(...arr);
const find = () => flatten.filter(_a => _a < 0).length;
console.log(find()) //2

ronaiza-cardoso

/*
* Count Negative Integers in Matrix
*/

M = [                                                                                                                                              
  [ -1, 3,  4, 1],                                                                                                                               
  [  2, 2,  4, 9],                                                                                                                               
  [  4, 5, -7, 9]                                                                                                                                
 ]                                                                                                                                               

anabastos

const criaArrayPrimos = x =>
  criaArray(x)
    .slice(2)
    .filter(checaFatores)

const criaArray = tamanho => Array.from({ length: tamanho }, (el, index) => index)

const checaFatores = n =>
  criaArray(maiorDivisor(n))
  	.slice(2)

Woodsphreaker

"use strict";

const divisors = [1, 2, 3, 4, 5, 6, 7, 8, 9];
const max = Math.max.apply(null, divisors);
const base = (num) => num > max ? [].concat(divisors, num) : divisors;
const numbers = (num) => [...Array(num).keys()];
const numberTest = (num) => base(num).map((_a) => num % _a === 0).filter(_a => _a === true);
const prime = (num) => numbers(num).filter(_a => numberTest(_a).length === 2);

console.log(prime(100)); // [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]

anabastos

/**
* Show Me the Evens - Show me the Odds 
* Diana is learning to count and she just learned the difference between odds and even numbers. 
* She wants to have some fun, so she picks a random number. 
* If that number is even, she decides to count all the even numbers up to it starting from 0 up to (but not including) the input. 
* If not, she decides to count all the odd numbers up to that number starting from 1 (but not including) the input. 
**/

const counting = (x) => {
	return arrayFrom(x)

chrismccord

If you want a run-down of the 1.3 changes and the design decisions behidn those changes, check out the LonestarElixir Phoenix 1.3 keynote: https://www.youtube.com/watch?v=tMO28ar0lW8

To use the new phx.new project generator, you can install the archive with the following command:

$ mix archive.install https://github.com/phoenixframework/archives/raw/master/phx_new.ez

Bump your phoenix dep

Phoenix v1.3.0 is a backwards compatible release with v1.2.x. To upgrade your existing 1.2.x project, simply bump your phoenix dependency in mix.exs:

akatrevorjay

#!/usr/bin/env zsh
#
# loc: mlocate + fzf integration
#
# https://gist.github.com/06dc1238b2fcbfb6c10bbad05ad79bc1
# https://asciinema.org/a/102006
#
# ~ trevorj <[email protected]>
#
setopt pipe_fail err_return err_exit

akatrevorjay

#!/bin/zsh
# git-fshow - git commit browser
#
# https://gist.github.com/akatrevorjay/9fc061e8371529c4007689a696d33c62
# https://asciinema.org/a/101366
#

git-fshow() {
	local g=(
		git log

deadkff01

// Multiplication and division rules... ((+)*(+)=+) ((-)*(-)=+) ((+)*(-)=-) ((-)*(+)=-) 
const multiply = (x, y) => {
  let r = Math.exp(Math.log(Math.abs(x)) + Math.log(Math.abs(y))).toFixed(2)
  return Number((x < 0 && y < 0) ? r : (x < 0 || y < 0) ? -r : r)
}

const divide = (x, y) => {
  return (x === 0) ? 0 : multiply(((multiply(x, y) < 0) ? -1.0 : 1.0), Math.exp(Math.log(Math.abs(x)) - Math.log(Math.abs(y))))
}

alkrauss48

var gulp        = require('gulp');

var browserify  = require('browserify');
var babelify    = require('babelify');
var source      = require('vinyl-source-stream');
var buffer      = require('vinyl-buffer');
var uglify      = require('gulp-uglify');
var sourcemaps  = require('gulp-sourcemaps');
var livereload  = require('gulp-livereload');