Lines Matching full:nodes

237  * @brief Process all the child nodes of a parent.
252         // node before continuing to encode the child nodes of the current  in bejProcessChildNodes()
276     // We need to encode a parent node before its child nodes. So encoding the  in bejEncodeTree()
280     // nodes. We need to keep a parent in this stack until all the child nodes  in bejEncodeTree()
290         // Encode all the child nodes of the current parent node. If one of  in bejEncodeTree()
291         // these child nodes has its own child nodes, that child node will be  in bejEncodeTree()
294         // (after processing all the nodes under the child node added to the  in bejEncodeTree()
299         // bejProcessChildNodes(), we know that this parent's child nodes have  in bejEncodeTree()
334     // First we need to encode a parent node before its child nodes. But before  in bejEncode()
336     // need to encode the parent's child nodes. Therefore first the encoder need  in bejEncode()
337     // to visit the child nodes and calculate the size need to encode them  in bejEncode()
340     // So first the encoder will visit child nodes and calculate the size need  in bejEncode()
361     // Produce the encoded bytes for the nodes using the previously calculated  in bejEncode()