<summary> Gets a value from one of ReShade's config files. This can use either the global config file (ReShade.ini next to the application executable)

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

break link to left child node and attach it to left tree pointed to by l | complexity : constant | exception : nothrow

F models ForwardIterator

------------------------------------------------------------------------ function :pop_move_front @brief erase the first element of the tree and retur

<b>Requires</b>: value must be an lvalue. <b>Effects</b>: Inserts the value in the front of the list. No copy constructors are called. <b>Throws</b>

! @brief replace all occurrences of a substring by another string @param[in,out] s the string to manipulate; changed so that all occu

Resize a vector to a smaller size, guaranteed not to cause a reallocation

< Call in response to WM_DISPLAYCHANGE

set iterator to a defined past the end

<b>Effects</b>: Returns the number of elements stored in the unordered_set. <b>Complexity</b>: Linear to elements contained in *this if constant_time

<b>Effects</b>: Returns the number of the elements contained in the list. <b>Throws</b>: Nothing. <b>Complexity</b>: Linear to the number of element

<b>Effects</b>: This function sorts the list *this according to std::less<value_type>. The sort is stable, that is, the relative order of equivalent e

delete characters while updating undo

delete characters while updating undo

Not re-entrant, but that should not matter. Original function courtesy of paxdiablo

<b>Effects</b>: Swaps the elements of x and *this. <b>Throws</b>: Nothing. <b>Complexity</b>: Linear to the number of elements of both lists. Consta

@copydoc ::boost::intrusive::bstree_algorithms::swap_nodes(node_ptr,node_ptr)

@copydoc ::boost::container::pmr::unsynchronized_pool_resource::unsynchronized_pool_resource(memory_resource*)

<b>Effects</b>: Copy constructs the container. <b>Complexity</b>: Linear in x.size().

<b>Requires</b>: header is the header of a tree. <b>Effects</b>: Unlinks the leftmost node from the tree, and updates the header link to the new left

<b>Effects</b>: Same as `unsynchronized_pool_resource(pool_options(), upstream)`.

TODO: Thickness anti-aliased lines cap are missing their AA fringe. We avoid using the ImVec2 math operators here to reduce cost to a minimum for debu