ascpial

-- This is a simple implementation of BTree Currently including only the hard part: insertions and deletions
--
-- This implementation supports using custom comparison functions (this allows to include more data in the keys for example).
-- I also designed this implementation to allow easy support for on-disk storage.
--
-- Copyright © 2025 ascpial
-- This project is licensed under the [MIT License](https://mit-license.org/).


--- @class BTreeNode

ascpial

      MOV R12, #1 //resultat
      MOV R0, #0 //iteration 
      INP R2, 2
boucle1:
      CMP R0, R2 //max
      BEQ finboucle1
      MOV R1, R0 //iteration mutliplication
      MOV R11, R12
boucle2:
      CMP R1, #0