Collection

Register a custom macro.

Checks if macro is registered.

Dynamically handle calls to the class.

Dynamically handle calls to the class.

Create a new collection.

Create a new collection instance if the value isn't one already.

Create a new collection by invoking the callback a given number of times.

Get all of the items in the collection.

Get the average value of a given key.

Alias for the "avg" method.

Get the median of a given key.

Get the mode of a given key.

Collapse the collection of items into a single array.

Determine if an item exists in the collection.

Determine if an item exists in the collection using strict comparison.

Cross join with the given lists, returning all possible permutations.

Get the items in the collection that are not present in the given items.

Get the items in the collection whose keys and values are not present in the given items.

Get the items in the collection whose keys are not present in the given items.

Execute a callback over each item.

Execute a callback over each nested chunk of items.

Determine if all items in the collection pass the given test.

Get all items except for those with the specified keys.

Run a filter over each of the items.

Apply the callback if the value is truthy.

Apply the callback if the value is falsy.

Filter items by the given key value pair.

Get an operator checker callback.

Filter items by the given key value pair using strict comparison.

Filter items by the given key value pair.

Filter items by the given key value pair using strict comparison.

Filter items by the given key value pair.

Filter items by the given key value pair using strict comparison.

Get the first item from the collection.

Get a flattened array of the items in the collection.

Flip the items in the collection.

Remove an item from the collection by key.

Get an item from the collection by key.

Group an associative array by a field or using a callback.

Key an associative array by a field or using a callback.

Determine if an item exists in the collection by key.

Concatenate values of a given key as a string.

Intersect the collection with the given items.

Intersect the collection with the given items by key.

Determine if the collection is empty or not.

Determine if the collection is not empty.

Determine if the given value is callable, but not a string.

Get the keys of the collection items.

Get the last item from the collection.

Get the values of a given key.

Run a map over each of the items.

Run a map over each nested chunk of items.

Run a grouping map over the items.

The callback should return an associative array with a single key/value pair.

Run an associative map over each of the items.

The callback should return an associative array with a single key/value pair.

Map a collection and flatten the result by a single level.

Get the max value of a given key.

Merge the collection with the given items.

Create a collection by using this collection for keys and another for its values.

Union the collection with the given items.

Get the min value of a given key.

Create a new collection consisting of every n-th element.

Get the items with the specified keys.

"Paginate" the collection by slicing it into a smaller collection.

Partition the collection into two arrays using the given callback or key.

Pass the collection to the given callback and return the result.

Get and remove the last item from the collection.

Push an item onto the beginning of the collection.

Push an item onto the end of the collection.

Push all of the given items onto the collection.

Get and remove an item from the collection.

Put an item in the collection by key.

Get one or a specified number of items randomly from the collection.

Reduce the collection to a single value.

Create a collection of all elements that do not pass a given truth test.

Reverse items order.

Search the collection for a given value and return the corresponding key if successful.

Get and remove the first item from the collection.

Shuffle the items in the collection.

Slice the underlying collection array.

Split a collection into a certain number of groups.

Chunk the underlying collection array.

Sort through each item with a callback.

Sort the collection using the given callback.

Sort the collection in descending order using the given callback.

Splice a portion of the underlying collection array.

Get the sum of the given values.

Take the first or last {$limit} items.

Pass the collection to the given callback and then return it.

Transform each item in the collection using a callback.

Return only unique items from the collection array.

Return only unique items from the collection array using strict comparison.

Reset the keys on the underlying array.

Get a value retrieving callback.

Zip the collection together with one or more arrays.

e.g. new Collection([1, 2, 3])->zip([4, 5, 6]); => [[1, 4], [2, 5], [3, 6]]

Get the collection of items as a plain array.

Convert the object into something JSON serializable.

Get the collection of items as JSON.

Get an iterator for the items.

Get a CachingIterator instance.

Count the number of items in the collection.

Get a base Support collection instance from this collection.

Determine if an item exists at an offset.

Get an item at a given offset.

Set the item at a given offset.

Unset the item at a given offset.

Convert the collection to its string representation.

Results array of items from Collection or Arrayable.

Add a method to the list of proxied methods.

Dynamically access collection proxies.