qutil_double_sum(3)

💖 qutil_double_sum — bestie we're doing MATH in PARALLEL 💖

okay so this is a page from libqthread (that's the manual, the whole section 3 vibe, iykyk) and it's about three lil functions that all do the same iconic thing: they add up an array. But like. In parallel. 🦋

✨ NAME ✨

qutil_double_sum, qutil_uint_sum, qutil_int_sum — add up an array in parallel

🌸 SYNOPSIS 🌸

#include <qthread.h>
#include <qthread/qutil.h>

double
qutil_double_sum (double *array, size_t length, int checkfeb);

unsigned int
qutil_uint_sum (unsigned int *array, size_t length, int checkfeb);

int
qutil_int_sum (int *array, size_t length, int checkfeb);

💅 DESCRIPTION 💅

so these functions take an array of length numbers as input, and they hand you back the sum of those numbers. That's it. That's the whole job. 👑

but here's the part that's giving main character energy: the sum is computed in parallel, by using a lagging-loop structure. periodt. 🔥

If checkfeb is non-zero, these functions will wait for the entries in the array to be full before adding them. 🌈

⚠️ okay bestie listen: they DO NOT check whether the array entries are properly aligned. Like, zero vibe check on alignment. And if the datatype is too small to do a FEB operation on, they will abort, if sanity checks are turned on. 😭 So pls be careful out there.

🎀 RETURN VALUE 🎀

The sum of the first length entries of array. that's the tea. 🍓

🫶 SEE ALSO 🫶

• qutil_double_mult(3)
• qutil_double_max(3)
• qutil_double_min(3)
• qutil_uint_mult(3)
• qutil_uint_max(3)
• qutil_uint_min(3)
• qutil_int_mult(3)
• qutil_int_max(3)
• qutil_int_min(3)
• qutil_mergesort(3)
• qutil_qsort(3)

and that's a wrap on the qutil_double_sum(3) page 💖 this lil masterpiece lives in libqthread, and it was last touched in APRIL 2011 — yeah, she's vintage, she's iconic, she's still slaying. 👑✨ bye bestie, go sum something 🧚💜