! @brief set the iterator to the first value @pre The iterator is initialized; i.e. `m_object != nullptr`. */

! @brief set the iterator to the first value @pre The iterator is initialized; i.e. `m_object != nullptr`. */

! @brief returns the number of elements Returns the number of elements in a JSON value. @return The return value depends on the different type

Indicates the beginning of a boolean literal (<code>true</code> or <code>false</code>) in the JSON input. This method will be called when reading the

Indicates the beginning of a boolean literal (<code>true</code> or <code>false</code>) in the JSON input. This method will be called when reading the

! @brief exchanges the values Exchanges the contents of the JSON value with those of @a other. Does not invoke any move, copy, or swap operatio

* Merge an Array of Objects into a single Object.

* Upgrades a specific element rather than all in the DOM. * * @param {!Element} element The element we wish to upgrade. * @param {string=} op

Writes the JSON representation of this value to the given writer in its minimal form, without any additional whitespace. <p> Writing performance can b

Writes the JSON representation of this value to the given writer in its minimal form, without any additional whitespace. <p> Writing performance can b

! @brief[in] j JSON value to serialize */

! @brief[in] j JSON value to serialize */

! @brief[in] j JSON value to serialize */

! @brief[in] j JSON value to serialize */

! @param[in] j JSON value to serialize @param[in] use_count whether to use '#' prefixes (optimized format) @param[in] use_type whether to

! @param[in] j JSON value to serialize @param[in] use_count whether to use '#' prefixes (optimized format) @param[in] use_type whether to

Advances L by k steps.

Transforms a BST into a sorted doubly linked list in-place, and return the head and tail of the list.

Transform a BST into a circular sorted doubly linked list in-place, return the head of the list.

Builds the subtree with preorder[preorder_start, preorder_end - 1] and inorder[inorder_start, inorder_end - 1].

Returns the root of the corresponding BST. The prev and next fields of the list nodes are used as the BST nodes left and right fields, respectively. T

Returns the root of the corresponding BST. The prev and next fields of the list nodes are used as the BST nodes left and right fields, respectively. T

Build a BST from the (s + 1)-th to the e-th node in L.

Builds a BST from the (start + 1)-th to the end-th node, inclusive, in l, and returns the root.

Build a min-height BST over the entries in A[start, end - 1].

First value of the return value indicates if tree is balanced, and if balanced the second value of the return value is the height of tree.