Implementations that provide random access to their stored nodes have to implement this method to allow read or write access to certain nodes based on their integer handle which can be requested by applications through the method getCurrentNode(). After finishing access to the node the application must invoke closeNode().
This method can only be used to open existing nodes, not to create new ones. To create new nodes, first the parent node needs to be opened. Then the method createNode can be used to create a new child node of the opened node. Child nodes can similiarly be read with nextNode() after their parent has been opened, although it is also possible to open them directly with openNode().
Although it depends on the implementation users of random access should normally assume that opening an arbitrary node with this method is only possible if a previously accessed hierarchy of nodes has been closed completely. That means that for all previous calls to create/next/openNode() there must have been a call to the closeNode() method. Otherwise an exception may be thrown. After a node has been opened with this method it is possible to create new child nodes with createNode() or iterate through it's children with nextNode().
@param nNodeHandle The integer handle of the node (always positive)
@param bForWriting TRUE for write and FALSE for read access
@see #getCurrentNode()