From 7f0caeb7bc8d9bcb361a8732b6d70eea18953fea Mon Sep 17 00:00:00 2001 From: skypjack Date: Wed, 26 Nov 2025 14:37:04 +0100 Subject: [PATCH] doc: cleanup the bit section --- docs/md/core.md | 12 ++++-------- 1 file changed, 4 insertions(+), 8 deletions(-) diff --git a/docs/md/core.md b/docs/md/core.md index d967ad176..612760571 100644 --- a/docs/md/core.md +++ b/docs/md/core.md @@ -201,19 +201,15 @@ in order to meet them. # Bit -Finding out the population count of an unsigned integral value (`popcount`), -whether a number is a power of two or not (`has_single_bit`) as well as the next -power of two given a random value (`next_power_of_two`) can be useful.
-For example, it helps to allocate memory in pages having a size suitable for the -fast modulus: +Some general purpose utilities, such as the fast module function: ```cpp const std::size_t result = entt::fast_mod(value, modulus); ``` -Where `modulus` is necessarily a power of two. Perhaps not everyone knows that -this type of operation is far superior in terms of performance to the basic -modulus and for this reason preferred in many areas. +Where `modulus` is necessarily a power of two. This type of operation is far +superior in terms of performance to the basic modulus and for this reason +preferred in many areas. # Compressed pair