gnu: Add perl-sys-sigaction. - guix - Wojtek's customized Guix

diff options

author	Danny Milosavljevic <dannym@friendly-machines.com>	2024-12-06 20:05:53 +0100
committer	Danny Milosavljevic <dannym@friendly-machines.com>	2024-12-06 22:12:14 +0100
commit	6e6b1c2ceb595415cc9eff6cda1cea6bea2cd7ac (patch)
tree	c674ab6dfdc8556cfa73c6d4c1b9e155687c98f4 /gnu/services/cgit.scm
parent	9f5ee1684481a9ce7150e2e571e69aeee2b65c53 (diff)
download	guix-6e6b1c2ceb595415cc9eff6cda1cea6bea2cd7ac.tar.gz guix-6e6b1c2ceb595415cc9eff6cda1cea6bea2cd7ac.zip

gnu: Add perl-sys-sigaction.

* gnu/packages/perl.scm (perl-sys-sigaction): New variable.

Diffstat (limited to 'gnu/services/cgit.scm')

0 files changed, 0 insertions, 0 deletions

p://www.gnu.org/licenses/>. (define-module (test-combinators) #:use-module (guix combinators) #:use-module (srfi srfi-1) #:use-module (srfi srfi-64) #:use-module (ice-9 vlist)) (test-begin "combinators") (test-equal "fold2, 1 list" (list (reverse (iota 5)) (map - (reverse (iota 5)))) (call-with-values (lambda () (fold2 (lambda (i r1 r2) (values (cons i r1) (cons (- i) r2))) '() '() (iota 5))) list)) (test-equal "fold2, 2 lists" (list (reverse '((a . 0) (b . 1) (c . 2) (d . 3))) (reverse '((a . 0) (b . -1) (c . -2) (d . -3)))) (call-with-values (lambda () (fold2 (lambda (k v r1 r2) (values (alist-cons k v r1) (alist-cons k (- v) r2))) '() '() '(a b c d) '(0 1 2 3))) list)) (let* ((tree (alist->vhash '((0 2 3) (1 3 4) (2) (3 5 6) (4 6) (5) (6)) hashq)) (add-one (lambda (_ r) (1+ r))) (tree-lookup (lambda (n) (cdr (vhash-assq n tree))))) (test-equal "fold-tree, single root" 5 (fold-tree add-one 0 tree-lookup '(0))) (test-equal "fold-tree, two roots" 7 (fold-tree add-one 0 tree-lookup '(0 1))) (test-equal "fold-tree, sum" 16 (fold-tree + 0 tree-lookup '(0))) (test-equal "fold-tree, internal" 18 (fold-tree + 0 tree-lookup '(3 4))) (test-equal "fold-tree, cons" '(1 3 4 5 6) (sort (fold-tree cons '() tree-lookup '(1)) <)) (test-equal "fold-tree, overlapping paths" '(1 3 4 5 6) (sort (fold-tree cons '() tree-lookup '(1 4)) <)) (test-equal "fold-tree, cons, two roots" '(0 2 3 4 5 6) (sort (fold-tree cons '() tree-lookup '(0 4)) <)) (test-equal "fold-tree-leaves, single root" 2 (fold-tree-leaves add-one 0 tree-lookup '(1))) (test-equal "fold-tree-leaves, single root, sum" 11 (fold-tree-leaves + 0 tree-lookup '(1))) (test-equal "fold-tree-leaves, two roots" 3 (fold-tree-leaves add-one 0 tree-lookup '(0 1))) (test-equal "fold-tree-leaves, two roots, sum" 13 (fold-tree-leaves + 0 tree-lookup '(0 1)))) (test-end)


context:
space:
mode: