docstr: Split the entries in half.
  
  Keep the lower part in the node and return the upper one.
docstr_tok: ["Split","the","entries","in","half",".","Keep","the","lower","part","in","the","node","and","return","the","upper","one","."]
code: def split_entries(self) -> list:
      """Split the entries in half.
  
      Keep the lower part in the node and return the upper one.
      """
      len_entries = len(self.entries)
      rv = self.entries[len_entries // 2 :]
      self.entries = self.entries[: len_entries // 2]
      assert len(self.entries) + len(rv) == len_entries
      return rv
  
imports: import abc
  import bisect
  import math
  from typing import Optional
  from .const import ENDIAN, NODE_TYPE_BYTES, USED_PAGE_LENGTH_BYTES, PAGE_REFERENCE_BYTES, TreeConf
  from .entry import Entry, Record, Reference, OpaqueData
label_desc: Use image node_id 18 for calling the Node obj's underlying member method code with example usage: obj.split_entries() and returns: rv