It is the map we need iterate to find valid items, since we don't have "alive" storage anywhere

Allocates array of count elements. Can throw std::bad_alloc

<b>Effects</b>: Returns a const_iterator to the end of the list. <b>Throws</b>: Nothing. <b>Complexity</b>: Constant.

<b>Effects</b>: Determines the effective length rlen of the string to compare as the smaller of size() and str.size(). The function then compares the

Deallocates an array pointed by ptr. Never throws

<b>Effects</b>: Returns true if the list contains no elements. <b>Throws</b>: Nothing. <b>Complexity</b>: Constant.

<b>Effects</b>: Erases the element after the element pointed by prev of the list. No destructors are called. <b>Returns</b>: the first element remain

<summary> Gets the handle to the current add-on module. </summary>

@brief return whether the value has a subtype @sa https://json.nlohmann.me/api/byte_container_with_subtype/has_subtype/

@brief return whether value is a string @sa https://json.nlohmann.me/api/basic_json/is_string/

@brief add an object to an array @sa https://json.nlohmann.me/api/basic_json/push_back/

--------------------------------------------------------------------------- function : push_back @brief Insert one element in the back of the containe

<b>Effects</b>: Returns a reverse_iterator pointing to the beginning of the reversed list. <b>Throws</b>: Nothing. <b>Complexity</b>: Constant.