MCPcopy Create free account
hub / github.com/KentBeck/BPlusTree3 / is_underfull

Method is_underfull

python/bplustree/bplus_tree.py:664–666  ·  view source on GitHub ↗

Returns True if the node has fewer than minimum required keys

(self)

Source from the content-addressed store, hash-verified

662
663 @abstractmethod
664 def is_underfull(self) -> bool:
665 """Returns True if the node has fewer than minimum required keys"""
666 pass
667
668
669class LeafNode(Node):

Callers 3

check_nodeMethod · 0.45
_delete_recursiveMethod · 0.45
_handle_underflowMethod · 0.45

Calls

no outgoing calls

Tested by 1

check_nodeMethod · 0.36