Daily Challenge #194 - Spread Number

const spreadNumber = n => [...Array(n).keys()]

spreadNumber n = [1..n]
spreadNumber = enumFromTo 1
spreadNumber = flip take [1..]

-- The most flexible way
spreadEnum :: Enum a => a -> a
spreadEnum = enumFromTo $ toEnum 1

def spreadNumber(n):
    return range(1,n+1)

Func<int, int[]> SpreadNumber = (int n) => Enumerable.Range(1, n).ToArray();

foreach(int i in SpreadNumber(10)) {
    Console.WriteLine(i);
}

const spreadNumber = (number) => {
  let returnArray = [];

  for (let i = 0; i < number; i++) {
    returnArray.push(i+1);
  }

  return returnArray;
}

(ns daily-challenge.one-ninety-four)

(defn spreadNumber [n]
;; precondition check to bound domain
 {:pre [(> 0 n)]}

  (unless (= n 1)
   (vec (range 1 n))
   [1])) 

(deftest one-ninety-four
  (is (= [1 2 3] (spreadNumber 3)))
  (is (= [1 2 3 4 5 6] (spreadNumber 6)))
  (is (= [1 2 3 4 5 6 7 8 9] (spreadNumber 9))))


(run-tests 'daily-challenge.one-ninety-four)

=> Testing daily-challenge.one-ninety-four

Ran 1 tests containing 3 assertions.
0 failures, 0 errors.
{:type :summary, :test 1, :pass 3, :fail 0, :error 0}

List<int> spreadNumber(int n) {
  var nums = List<int>();
  for(var x = 1; x <= n.abs(); x++) {
    nums.add(x);
  }
  return nums;
}

List<int> spreadNumber(int n) {
  return List<int>.generate(n.abs(), (n) => n + 1);
}

lambda  x: [i+1 for i in range(x)]

def spread_number(n), do: Enum.to_list 1..n

spreadNumber :: Int -> [Int]
spreadNumber n = [1..n]