Assoc the given value into the given resolvable once it was resolved to a map.

Assoc the given value into the given resolvable, once the value at the given path was resolved to a map.

Drop first n elements of the given resolvable.

Get the first element of the given resolvable.

Apply the given function to the given, potentially partially resolved values.

Apply the given function to the given values once they are fully resolved.

Apply the given function to the given, potentially partially resolved values once the given predicate is fulfilled. Note that the predicate has to have an arity matching the number of values.

Iterate the given function over every element of the given, potentially partially resolved values. The collection type might not be maintained.

Get the nth element of the given resolvable.

Wrap the given value with a processing function that gets called the moment the given value is neither a Resolvable nor wrapped, plus fulfills the given predicate.

Wrap the given value to select only the given keys once they are available.

Get first n elements of the given resolvable.

Wrap the given value with a processing function that gets called the moment the given value is neither a Resolvable nor wrapped.

Wrap the given value with a processing function that gets called once the value has been fully resolved.

Only use this for guaranteed finite expansion!

Wrap the given value to perform an update on a key once it’s available.

Wrap the given value to perform an update on a nested key once it’s available.