Array and List functions

listSet

The listSet function clears the existing elements associated with a given list key and sets the provided values as the new list elements. It effectively replaces any previously stored data under the key with the new list.

-> Read More


listIset

The listIset function allows users to insert or replace an element at a specified index in a list stored at the provided key. This operation is index-based, and it does not extend the list—an out-of-range index returns an error.

-> Read More


listPush

The listPush function inserts one or more elements at the beginning of a list associated with a specific key in the Fleare in-memory database. If the key does not exist, a new list is created. If the key exists but holds a non-list data type, an error is returned.

-> Read More


listPop

The listPop function return (pops) a single element from the beginning (index 0) of a list stored at a specified key. If the list becomes empty after the pop, the key is removed from the store.

-> Read More


listGPop

The listGPop function return (pops) a single element from the beginning (index 0) of a list stored at a specified key. If the list becomes empty after the pop, the key is removed from the store.

-> Read More


listGet

The listGet function retrieves one or more elements from a list stored at a specific key. If an index is provided, it returns the value at that index; otherwise, it returns the entire list.

-> Read More


listLen

The listLen function is used to retrieve the number of elements in a list stored at a given key. It validates the key, checks for the appropriate data type, and returns the size of the list. If the key is not associated with a list, or if the key doesn’t exist, a relevant error or response is returned.

-> Read More


listFind

The listFind function filters elements from a list stored at a specified key using various comparison operators and path-based expressions. It supports FIND primitives (strings, numbers, booleans) and objects (using nested field paths).

-> Read More