supercharge / set Goto Github PK

Add a new .first(predicate?: (value: T, set: SuperchargedSet) method returns the first item in the set. If a predicate function is provided, return the first item found by predicate. When providing a predicate function, .first(predicate) is an alias for .find(predicate).

Example

Set.of([1, 2, 3]).first()
// 1

Set.of([1, 2, 3, 4, 5]).first(value => {
  return value > 3
})
// 4

Add a new .count(predicate: T => boolean) method that returns the number of items matching the given predicate

Example

Set.of([1, 2, 3, 4, 5]).count(value => {
  return value > 3
})

// 2

Add a new .last(predicate?: (value: T, set: SuperchargedSet) method returns the last item in the set. If a predicate function is provided, return the last item found by predicate.

Example

Set.of([1, 2, 3]).last()
// 3

Set.of([5, 4, 3, 2, 1]).last(value => {
  return value > 3
})
// 4

Implement an any method that returns true if at least one item in the set matches a given predicate function, otherwise false.

Requirements

• please use the prepared method-any branch (contains tests)
• make sure the automated tests pass

Add a new .reduce(operation, initialValue) method executes a reducer function on each item of the set, resulting in a single output value.

The method signature may look like this (I’m writing this freestyle, you may need to refine it when working in the code 😄 )

reduce<U>((operation: (previous: U, current: T, set: Set), initial: U): U`

Example

Set.of([1, 2, 3, 4]).reduce((sum, value) => {
  return sum + value
}, 0)

// 10

Implement a findLastIndex method that returns the index of the last item in the set matching the given predicate function. Returns -1 if no item matching the predicate was found in the set.

Requirements

• please use the prepared method-findLastIndex branch (contains tests)
• make sure the automated tests pass

Implement an intersect method that returns a set containing all items that are contained in all collections, the given set and and all candidate sets.

Requirements

• please use the prepared method-intersect branch (contains tests)
• make sure the automated tests pass

Add a new .concat(...values) method that appends the given values to the end of the set.

Example

Set.of([1, 2, 3]).concat([4, 5]).toArray()
// [1, 2, 3, 4, 5]

Set.of([1, 2, 3]).concat(4, 5).toArray()
// [1, 2, 3, 4, 5]

Add a new .includes(value: T | predicate: T => boolean) method that determines whether the set includes the given value or a value identified by the predicate function.

Returns true if the value is found in the collection or the predicate function returns an item from the collection. Returns false otherwise.

Example

Set.of([1, 2, 3, 4, 5]).includes(2)
// true

Set.of([1, 2, 3, 4, 5]).includes(value => {
  return value > 3
})
// true

Set.of([1, 2, 3, 4, 5]).includes(value => {
  return value === 0
})
// false

Implement an all method that returns true if all items in the set match a given predicate function, otherwise false.

Requirements

• please use the prepared method-all branch (contains tests)
• make sure the automated tests pass

Implement a findLast method that returns the last item in the set matching the given predicate function. Returns undefined if no item matching the predicate was found in the set.

Requirements

• please use the prepared method-findLast branch (contains tests)
• make sure the automated tests pass