_            _    _        _         _
      /\ \         /\ \ /\ \     /\_\      / /\
      \_\ \       /  \ \\ \ \   / / /     / /  \
      /\__ \     / /\ \ \\ \ \_/ / /     / / /\ \__
     / /_ \ \   / / /\ \ \\ \___/ /     / / /\ \___\
    / / /\ \ \ / / /  \ \_\\ \ \_/      \ \ \ \/___/
   / / /  \/_// / /   / / / \ \ \        \ \ \
  / / /      / / /   / / /   \ \ \   _    \ \ \
 / / /      / / /___/ / /     \ \ \ /_/\__/ / /
/_/ /      / / /____\/ /       \ \_\\ \/___/ /
\_\/       \/_________/         \/_/ \_____\/
guile-srfi-125 0.0.1-0.556827a
Dependencies: guile@3.0.9
Propagated dependencies: guile-srfi-126@0.0.1-0.f480cf2 guile-srfi-128@0.1.0
Channel: guix
Location: gnu/packages/guile-xyz.scm (gnu packages guile-xyz)
Home page: https://github.com/scheme-requests-for-implementation/srfi-125
Licenses: Expat
Synopsis: SRFI 125: Intermediate hash tables
Description:

Procedures in this SRFI are drawn primarily from SRFI 69 and R6RS. In addition, the following sources are acknowledged:

  • hash-table-mutable? procedure and the second argument of hash-table-copy (which allows the creation of immutable hash tables) are from R6RS, renamed in the style of this SRFI.

  • hash-table-intern! procedure is from Racket, renamed in the style of this SRFI.

  • hash-table-find procedure is a modified version of table-search in Gambit.

  • procedures hash-table-unfold and hash-table-count were suggested by SRFI 1.

  • procedures hash-table=? and hash-table-map were suggested by Haskell's Data.Map.Strict module.

  • procedure hash-table-map->list is from Guile.

The procedures hash-table-empty?, hash-table-empty-copy, hash-table-pop!, hash-table-map!, hash-table-intersection!, hash-table-difference!, and hash-table-xor! were added for convenience and completeness.

Total results: 1