# GLib.spaced_primes_closest

function spaced_primes_closest(num: Number(guint)): Number(guint) { // Gjs wrapper for g_spaced_primes_closest() }

Gets the smallest prime number from a built-in array of primes which is larger than num. This is used within GLib to calculate the optimum size of a GLib.HashTable.

The built-in array of primes ranges from 11 to 13845163 such that each prime is approximately 1.5-2 times the previous prime.

- num
a #guint

- Returns
the smallest prime number from a built-in array of primes which is larger than num