Returns true if the function is true for any element in the slice.

Delete the element at index from this slice requires the 0-value of this type.

Filter all elements of this slice that are type R This runs in O(2n) because of the t -> interface{} conversion.

Returns the first element that satisfies the predicate and a boolean indicating if it could find any.

Inserts the element at index in this slice requires the 0-value of this type.

Returns true if elem is inside the slice.

Like LabelMapValues but short circuits on error.

Like MapSlice but short circuits in case of error.

Prepends the given ident before each line of the string.

Creates a range with the specified start and end (inclusive).

Returns a new slice with elements reversed.

Returns the last index of elem in the slice.

Returns the last index of elem in the slice.

Returns both slices zipped together.

A Direct Acyclic Graph.

A node in the DAG `value` has to be unique for every node.