interval-management v3.0.1
Intervals documentation
Interval-management is a no-dependency library allowing you to create intervals between two values.
Also can receive a generator function and create array of values between two values, use iterators, merge, diff, compare, sort and fill in intervals. Advanced operations with intervals are "shallow-compare".
This means that a value belongs in the interval if it is between two values, not because an interval generates it. Same goes for merging and diffing intervals.
Setup an interval
const interval = interval(); // (0, Infinity), generates all whole numbers
const interval = interval(new Date(2019, 1, 1, 12), new Date(2019, 1, 1, 20), addHour) // Generates time between two dates by hour
Example of use - unit tests
expect(interval(2, 10).diff(interval(5, 10))?.array()).toEqual([2, 3, 4, 5]);
expect(interval(2, 4).diff(interval(5, 10))?.array()).toEqual([2, 3, 4]);
expect(interval(2, 5).overlap(interval(5, 6))).toBe(true);
expect(interval(2, 5).overlap(interval(7, 8))).toBe(false);
/**
* Generator function should not mutate the original value
*/
const byHour = (date: Date) => {
const next = new Date(date);
next.setHours(date.getHours() + 1);
return next;
};
expect(interval(date5, date7, byHour).concat(interval(date6, date8, byHour))?.array()).toEqual([date5, date6, date7, date8]);
expect(interval(date5, date6, byHour).concat(interval(date6, date7, byHour))?.array()).toEqual([date5, date6, date7]);
Relevant information
If you set undefined/Infinity on 'end' parameter of interval function, the interval will be infinite. Interval function does not have a sanity check for infinite generation (generator function never reaching end parameter). Type of interval will be decided based on 'typeof' and 'instance of' (for Date).
Another important feature is the custom comparing functions for object intervals
class TestData {
public date: Date;
constructor(date: Date) {
this.date = date;
}
public byHour = () => new TestData(this.byHourImpl(this.date));
private byHourImpl = (date: Date) => {
const next = new Date(date);
next.setHours(date.getHours() + 1);
return next;
};
}
const compare = (a: TestData, b: TestData) => a.date.getTime() - b.date.getTime();
const i = interval(comparable1, comparable2, byHour, compare);
expect(i.array()).dateEqual((i.copy().array() as TestData[]));
Added functionality since 1.4.0:
Interval now supports conversion to another type of interval and infinity-interval compatible functions:
1) map 2) reduce 3) forEach
Unit test examples
expect(interval(1, 3, c => c + 1).convert(
i => i.toString(), i => (parseInt(i, 10) + 1).toString()
).array()).toEqual(['1', '2', '3']);
expect(interval(1, 3, c => c + 1).map(c => c.toString())).toEqual(['1', '2', '3']);
expect(interval(1, 3, c => c + 1).reduce((p, c) => p + c, 0)).toBe(6);
let counter = 1;
interval(1, 3, c => c + 1).forEach(c => {
expect(c).toBe(counter);
counter++;
});
expect(interval(1, undefined, c => c + 1).map((c, escape) => {
if (c > 2) {
escape();
}
return c.toString();
})).toEqual(['1', '2', '3']);
expect(interval(1, undefined, c => c + 1).reduce((p, c, escape) => {
if (c > 2) {
escape();
}
return p + c;
}, 0)).toBe(6);
let infCounter = 1;
interval(1, undefined, c => c + 1).forEach((c, escape) => {
if (c > 2) {
escape();
}
expect(c).toBe(infCounter);
infCounter++;
});
Added functionality since 1.5.0:
Can find closest neighbours of value. Example:
expect(interval(2, 4, c => c + 1).closest(3)).toEqual([3]);
expect(interval(2, 4, c => c + 1).closest(-1)).toEqual([2]);
expect(interval(2, 4, c => c + 1).closest(5)).toEqual([4]);
expect(interval(2, 6, c => c + 2).closest(5)).toEqual([4, 6]);
Added functionality since 1.6.0:
Can create an interval out of an array. Example:
expect(interval([1, 2, 4, 5]).it(2).val()).toBe(4);
expect(interval([1, 2, 4, 5]).it(10).val()).toBe(5);
expect(interval([1, 2, 3, 4]).concat(interval([3, 8, 9, 10]))[0].it(3).val()).toBe(8);
Changes since 2.0.0:
Concat and diff functions now return only one interval (in case of diff it can be null if diffing an interval with one that completely overlaps it).
Changes since 2.1.0:
Convert function can now be created without explicitly defining 'next' function. This will however fail on infinite intervals.
Changes since 2.2.0:
Next to a find function you can now find 'all'. Function will return an array of all elements matching a certain pattern. Will fail, similarly to 'find', if you apply it on an infinite interval without an 'end' item to finish the search.
Changes since 2.3.0:
Added unshift, pop and push functions. Push will not work on infinite intervals.
Also, changed the build to be targetted to ES5, fixed a bug in interval.reset() to reset done() function result
Examples:
expect(interval([1, 2, 3, 4]).unshift(0).array()).toEqual([0, 1, 2, 3, 4]);
expect(interval(2, 8, n => n + 2).unshift(1).array()).toEqual([1, 2, 4, 6, 8]);
expect(interval(0, Infinity, c => c + 1).unshift(-1).unshift(-2).has(-1)).toBe(true);
expect(interval([1, 2, 3, 4]).push(5).array()).toEqual([1, 2, 3, 4, 5]);
expect(interval(2, 8, n => n + 2).push(9).array()).toEqual([2, 4, 6, 8, 9]);
expect(interval([1, 2, 3, 4]).pop()).toBe(1);
expect(interval(2, 8, n => n + 2).pop()).toBe(2);
const poppy = interval(1, 5, c => c + 2);
poppy.pop();
poppy.pop();
expect(poppy.array()).toEqual([5]);
const inf = interval(0, Infinity, c => c + 1);
inf.pop();
expect(inf.has(0)).toBe(false);
Changes since 2.4.0
Added .filter and .shuffle functions. Filter will work with infinite intervals, provided that at least one of the values will match to criteria. Shuffle will only work with finite intervals and it will generate values from interval in randomized order.
Changes since 3.0.0
You don't need to define complicated classes implementing Comparable interface. Instead, there is now a fourth parameter on interval function, which lets you define how do you want objects to be compared. This parameter is only accessible when needed - e.g. when comparing objects.
Fixed a bug in .array() function where it returns a value even after .done() evaluates as true.
This library does NOT allow you to:
1) Use array() for an explicitly infinite interval 2) Create an object array without next function 3) Start and end parameters cannot be 'function' or 'bigint' 4) Creating an interval with 'end' being before 'start' 5) For an interval to have 'infinite' start 6) Define an array-like interval with values which serialize to the same string
If there are any problems, do not hesitate to create an issue or a pull request. Thank you.
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago