lubien

/**
* 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
  range = x => y =>

lubien

const
  range = x => y =>
    Array.from({length: y - x})
      .map((_, i) => x + i)
      
, {ceil, sqrt} = Math

, lt = y => x =>
    x < y
    

lubien

const
 composeN = (...fs) => y =>
    fs.reduceRight((x, f) => f(x), y)
  
, concat = ys => xs =>
    xs.concat(ys)

, flatten = xs =>
    reduce(uncurry2(concat))(xs)

lubien

const
  id = x =>
    x

, always = x => () =>
    x

, not = prop =>
    !prop
    

lubien

const clamp = l => h => x =>
  x > h
    ? h
    : x < l
      ? l
      : x

const
  ascend = i => xs => {
    let

lubien

const max = (x, y) => x > y ? x : y
console.log([1, 2, 3, 4, 5, 6].reduce(max))

lubien

const len = x => x.length
const maxBy = fn => (x, y) => fn(x) > fn(y) ? x : y
console.log(['a', 'ab', 'abc'].reduce(maxBy(len)))

lubien

crie uma função chamada MaiorPalavra(str) que recebe um parâmetro do tipo string e retorna a maior palavra.

tenha como casos de entrada os exemplos abaixo:
"Olá mundo"
"Letra após letra"
"uma confusa /:cadeia de caracteres:/[ isso não é!!!!!!!~"
"uma bonita sequência^&"

lubien

const
  composeN = (...fs) => y =>
    fs.reduceRight((x, f) => f(x), y)

, flatten = xs =>
    xs.reduce((acc, x) => acc.concat(x))
    
, filter = pred => xs =>
    xs.filter(pred)
    

lubien

const Poller = (time, callback) => {
  const queue = [];
  
  const add = op => {
    queue.push(op)
  }
  
  const exec = () => {
    callback(queue.shift())