qt_double_min(3)

💖 qt_double_min — bestie's guide to finding the littlest number 💖

ok so this is the libqthread manual page for qt_double_min(3), and honestly? she's giving parallel minimum-finding and I'm obsessed 🫶

✨ NAME ✨

qt_double_min, qt_uint_min, qt_int_min — find the minimum value within an array in parallel 🌸

🌈 SYNOPSIS 🌈

#include <qthread/qloop.h>

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

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

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

🎀 DESCRIPTION 🎀

ok so picture this: you hand these functions an array of length numbers, and they hand you back the smallest one. that's it. that's the whole vibe. 💅

but here's the part that's actually iconic — this value gets computed in parallel, by splitting the iterations up evenly among the shepherds. so like, no single shepherd is out here doing all the work alone, they're sharing the load. main character energy but make it collaborative ✨

🦋 about checkfeb 🦋

if checkfeb is non-zero, these functions will wait for the entries in the array to be full before comparing them. lowkey patient of them ngl 🧚

⚠️ but bestie listen — they DO NOT check whether the array entries are properly aligned. that's not their job, they did not sign up for that, and if you assumed they did… that's on you 😭

⭐ RETURN VALUE ⭐

the minimum value of the first length entries of array. that's the tea. 🍓

💜 SEE ALSO 💜

• qt_double_prod(3)
• qt_double_sum(3)
• qt_double_max(3)
• qt_uint_prod(3)
• qt_uint_sum(3)
• qt_uint_max(3)
• qt_int_prod(3)
• qt_int_sum(3)
• qt_int_max(3)
• qt_loop(3)
• qt_loop_balance(3)
• qt_loopaccum_balance(3)

and that's the page, bestie!! 🎉 this whole thing comes to you from libqthread, dated JUNE 2007 — yes she's a vintage queen and she still slays 💖✨👑