docstr: Make sure that after of a reference matches before of the next one.
  
  Probably very inefficient approach.
docstr_tok: ["Make","sure","that","after","of","a","reference","matches","before","of","the","next","one",".","Probably","very","inefficient","approach","."]
code: def insert_entry(self, entry: "Reference"):
      """Make sure that after of a reference matches before of the next one.
  
      Probably very inefficient approach.
      """
      super().insert_entry(entry)
      i = self.entries.index(entry)
      if i > 0:
          previous_entry = self.entries[i - 1]
          previous_entry.after = entry.before
      try:
          next_entry = self.entries[i + 1]
      except IndexError:
          pass
      else:
          next_entry.before = entry.after
  
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 3 for calling the ReferenceNode obj's underlying member method code with example usage: obj.insert_entry(entry) without return types