range

import { range } from '@accelint/core';

// Iterate from 1 to 10
for (const n of range(1, 10)) {
  console.log(n);
}
// 1, 2, 3, 4, 5, 6, 7, 8, 9, 10

// Convert to array
const rangeArr = [...range(1, 5)];
// [1, 2, 3, 4, 5]

function range(
  start: number,
  end: number
): IterableIterator<number>

import { range } from '@accelint/core';

[...range(1, 5)]; // [1, 2, 3, 4, 5]
[...range(0, 3)]; // [0, 1, 2, 3]
[...range(10, 15)]; // [10, 11, 12, 13, 14, 15]

import { range } from '@accelint/core';

[...range(5, 5)]; // [5]

import { range } from '@accelint/core';

// Instead of creating an array with 1 million elements
// const arr = Array.from({ length: 1000000 }, (_, i) => i);

// Use range to iterate without allocating the array
let sum = 0;
for (const n of range(0, 999999)) {
  sum += n;
}
// Iterates efficiently without creating a large array

import { range } from '@accelint/core';

interface User {
  id: number;
  name: string;
}

const generateUsers = (count: number): User[] => {
  const users: User[] = [];
  for (const id of range(1, count)) {
    users.push({ id, name: `User ${id}` });
  }
  return users;
};

generateUsers(3);
// [
//   { id: 1, name: 'User 1' },
//   { id: 2, name: 'User 2' },
//   { id: 3, name: 'User 3' }
// ]

import { range } from '@accelint/core';

const pageSize = 10;
const totalItems = 47;
const totalPages = Math.ceil(totalItems / pageSize);

const pageNumbers = [...range(1, totalPages)];
// [1, 2, 3, 4, 5]

import { range } from '@accelint/core';

// Map over range
const squares = [...range(1, 5)].map(n => n * n);
// [1, 4, 9, 16, 25]

// Filter range
const evenNumbers = [...range(1, 10)].filter(n => n % 2 === 0);
// [2, 4, 6, 8, 10]

import { range, reverse } from '@accelint/core';

// range doesn't support descending directly
// Use reverse to get descending order
const descending = reverse([...range(1, 5)]);
// [5, 4, 3, 2, 1]