* Override this method to avoid clone childResults. When the childResult is * !is_nothrow_copy_constructible (such as std::string), the default i

* @brief Allocate a vertex subset represented with ParallelBitset. * * @return A ParallelBitset sized |V| of the Graph. */

* Reserve enough space in the table for the given number of elements. If * the table can already hold that many elements, the function will shrink

! * \fn inline void SleepS(double second) * * \brief Sleep for some seconds. * * \param second The number of seconds. */

* Gets the property of the current edge * * \return The edge property. */

! * \fn char * BinaryBuffer::GetBuf() * * \brief Gets the pointer to valid content. * * \return Pointer to the next read

return iterator end (needed for range-based for)

* @brief Access the in-degree of some vertex. * * @param vid The vertex id (in the Graph) to access. * * @return The in-degre

* Resizes the memory block. If *this is a const reference, a new memory block * is created so *this will own the memory. * * \param s

! @brief return whether pointer points to the root document @return true iff the JSON pointer points to the root document @complexity Co

! @brief return the value of an iterator @pre The iterator is initialized; i.e. `m_object != nullptr`. */

return iterator end (needed for range-based for)

* Gets the current edge unique id. * * \return The current edge unique id. */

load index form serialization

return iterator begin (needed for range-based for)

return iterator begin (needed for range-based for)

! @brief remove last reference token @pre not `empty()` @liveexample{The example shows the usage of `pop_back`.,json_pointer__pop_back}

* @brief Change ParallelVector size. * Note the new size should be larger than or equal to elder size. * * @param size

* Gets the edge id stored in the key. Valid only for edge nodes. * * @param v A Value storing the key. * * @return The eid.