Each instance of BTreeEntry stores one key and two child page ids. It is used by BTreeInternalPage as an abstraction to iterate through the entries stored inside. All of the entries or tuples in the left child page should be less than or equal to the key, and all of the entries or tuples in the righ
source not stored for this graph (policy: none)
nothing calls this directly
no outgoing calls
no test coverage detected