[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: SRFI-151 (Bitwise Operations) Implementation
From: |
Zelphir Kaltstahl |
Subject: |
Re: SRFI-151 (Bitwise Operations) Implementation |
Date: |
Thu, 9 Jan 2020 07:50:14 +0100 |
User-agent: |
Mozilla/5.0 (X11; Linux x86_64; rv:52.0) Gecko/20100101 Icedove/52.9.1 |
Hello Frank,
I think I might find good use for this library in one of my projects!
Thanks for sharing!
Regards,
Zelphir
On 09.01.2020 05:28, Frank Terbeck wrote:
> Hey Guilers!
>
> Since I got a project that uses (potentially large) integers to encode
> bits in registers, I was looking at SRFIs that deal with that type of
> domain. The most recent entry is SRFI-151, which is in final status.
>
> Since Guile currently doesn't have an implementation of this SRFI, I fi-
> gured I might as well add one.
>
> I tried to reuse as many facilities that are already in Guile to get to
> a complete implementation. So it reuses stuff from the R6RS bitwise li-
> brary, as well as SRFI-60 (which is titled “Integers as Bits”) and other
> functions from Guile's core.
>
> SRFI-151 has one API that returns a SRFI-121 generator¹ to traverse an
> integer. Since Guile currently doesn't have a SRFI-121 implementation²,
> this function³ is missing from this implementation.
>
> The implementation can be found here: https://gitlab.com/ft/srfi-151
>
> The test-suite reproduces the examples from the specification, plus a
> couple of additional ones. Maybe this is useful for someone.
>
>
> Regards, Frank
>
> ¹ http://srfi.schemers.org/srfi-121/srfi-121.html
> ² https://www.mail-archive.com/address@hidden/msg14950.html
> ³ make-bitwise-generator
>