HPL_ladd(3)

💖 HPL_ladd(3) 💖

okay bestie, welcome to the HPL library functions corner of the manual 🎀 this one is literally the moment two long positive integers get added together, no cap.

---

✨ NAME ✨

HPL_ladd — adds two long positive integers. that's it, that's the whole job description 💅

---

🌸 SYNOPSIS 🌸

#include "hpl.h"

void HPL_ladd( int * J, int * K, int * I );

---

🦋 DESCRIPTION 🦋

okay so here's the tea 🍓 HPL_ladd adds without carry two long positive integers K and J, and puts the result into I.

⚠️ and yes, bestie, clock the "without carry" part. that is not a vibe, that is the actual spec. no carry. periodt.

the long integers I, J, and K are encoded on 64 bits using an array of 2 integers. the 32-lower bits are stored in the first entry of each array, and the 32-higher bits are stored in the second entry. lowkey elegant, highkey cursed, iykyk 💀

---

👑 ARGUMENTS 👑

• J (local input) int * — on entry, J is an integer array of dimension 2 containing the encoded long integer J. it's giving... an integer, encoded. ✨
• K (local input) int * — on entry, K is an integer array of dimension 2 containing the encoded long integer K. the other half of the duo, main character energy fr fr 🫶
• I (local output) int * — on entry, I is an integer array of dimension 2. on exit, this array contains the encoded long integer result. the glow-up arc goes here 💖🔥

---

🌈 SEE ALSO 🌈

• HPL_lmul (3)
• HPL_setran (3)
• HPL_xjumpm (3)
• HPL_jumpit (3)
• HPL_rand (3)

---

and that's the whole page, bestie, you ate it up 🎀 this was HPL 2.2, dated February 24, 2016 — slay, iconic, no notes 💅✨