|
Ruud H.G. van Tol on Sat, 05 Jul 2025 21:19:25 +0200
|
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
- To: pari-dev@pari.math.u-bordeaux.fr
- Subject: Re: flags in a bitmap
- From: "Ruud H.G. van Tol" <rvtol@isolution.nl>
- Date: Sat, 5 Jul 2025 21:19:19 +0200
- Delivery-date: Sat, 05 Jul 2025 21:19:25 +0200
- Dkim-signature: v=1; a=rsa-sha256; c=simple/simple; d=isolution.nl; s=soverin; t=1751743160; bh=3leyhXyrQuVH7HSXKKtGzZT/SQSLZqxKUaUWjLAxNbM=; h=Date:Subject:To:References:From:In-Reply-To:From; b=G/KTHBHVL2URs8pux8Qe3cEKBKMhMSZk4OqdszhyRWFLlRMpO8YymCLuKz/6PKtDf CBIVAUCDyadfiagBPzPYQMs0yhORlDuVwFhC7O+PlEaBSjzbTiWyptzZgTv0x+Os/H 2xYDTXuKkKvWQjdTKz+OprUxjSsgUTIB0zOpEmvo+fvipKRVBs/NKrX5ncmU2yzzfx cVR57VI2APKYcYTGmo8F43ti1O7fVKq3xU7v8bgTOG/2RLEBwKWx8gn316me4kP51R E9pTUjGBBPTXMO9wfALYt3qOwrezZW0cjkdA2lIeWDWoOFKBQqUo+kl86igYUbzAZB M7rYqwngvPzgw==
- In-reply-to: <aGlw2a2QZlP7iH6M@seventeen>
- References: <0d611e03-20d3-4bf9-852e-f4be6858439e@isolution.nl> <aGZ8wfx91Ru1EToq@seventeen> <66438921-ed04-4927-97e0-b1ecee7a6aa3@isolution.nl> <aGeLgs8ZF0E5JYR1@seventeen> <ecaea112-19b6-4a91-a6fc-9cb68482dd71@isolution.nl> <aGfcTzcK9eDsSNep@seventeen> <b839c566-f12d-4d70-ac76-dfa9169c9ec8@isolution.nl> <848410c1-1477-4db4-b2f9-bdb8d5d08b85@isolution.nl> <035ccac2-2eda-40f9-9007-f1abe4f92ffd@isolution.nl> <aGlw2a2QZlP7iH6M@seventeen>
On 2025-07-05 20:37, Bill Allombert wrote:
[...]
I have made a updated version (which no more allow to clear the highest bit).
? ??bitclear
'bitclear' not found !
? ?bitset
bitset(~x,n): set bit n of x in place, assuming x >= 2^n.
? ?bitclear
bitclear(~x,n): clear bit n of x in place, assuming x >= 2^(n+1).
? ?bitflip
bitflip(~x,n): flip bit n of x in place, assuming x >= 2^{n+1}.
The brackets are {} vs ().
-- Ruud