60.scm

;; Copyright 2011 Shiro Kawai
;; SPDX-License-Identifier: MIT

;; TODO: There are more tests for procedure sin this SRFI in Gauche's
;; test/numbers.scm.

(test-begin "srfi-60")

(test-eqv "bitwise-if"
  #b01100110 (bitwise-if #b10101100 #b00110101 #b11001010))

(for-each (lambda (n r)
            (test-equal (string-append "log2-binary-factors("
                                       (number->string n) ")")
              r (log2-binary-factors n)))
          '(0  1  2  3  4  5  6  7  8  9  10  11  12  13  14  15  16
               -1 -2 -3 -4 -5 -6 -7 -8 -9 -10 -11 -12 -13 -14 -15 -16)
          '(-1 0  1  0  2  0  1  0  3  0   1   0   2   0   1   0   4
               0  1  0  2  0  1  0  3  0   1   0   2   0   1   0   4))

(define (test-rotate-bit-field n c s e r)
  (test-equal (string-append "rotate-bit-field("
                             (number->string n 2) ","
                             (number->string c) ","
                             (number->string s) ","
                             (number->string e) ")")
    r (number->string (rotate-bit-field n c s e) 2)))
(test-rotate-bit-field #b0100 3 4 0 "100") ; trivial path
(test-rotate-bit-field #b0100 3 0 4 "10")
(test-rotate-bit-field #b0100 -1 0 4 "10")
(test-rotate-bit-field #b0100 10 0 4 "1")
(test-rotate-bit-field #b110100100010000 -1 5 9 "110100010010000")
(test-rotate-bit-field #b110100100010000 1 5 9 "110100000110000")

(define (test-reverse-bit-field n s e r)
  (test-equal (string-append "reverse-bit-field("
                             (number->string n 2) ","
                             (number->string s) ","
                             (number->string e) ")")
    r (number->string (reverse-bit-field n s e) 2)))
(test-reverse-bit-field #xa7 8 0 "10100111")
(test-reverse-bit-field #xa7 0 8 "11100101")
(test-reverse-bit-field #xa7 1 5 "10111001")

(test-equal "integer->list" '(#t #f #f #t) (integer->list 9))
(test-equal "integer->list" '(#f #f #t #f #f #t) (integer->list 9 6))
(test-eqv "list->integer" 9 (list->integer '(#t #f #f #t)))
(test-eqv "list->integer" 9 (list->integer '(#f #f #t #f #f #t)))
;; tests bignum path
(test-eqv "list->integer"
  (+ (expt 2 63) (expt 2 62) (expt 2 31) (expt 2 30) 1)
  (list->integer '(#t #t #f #f #f #f #f #f
                      #f #f #f #f #f #f #f #f
                      #f #f #f #f #f #f #f #f
                      #f #f #f #f #f #f #f #f
                      #t #t #f #f #f #f #f #f
                      #f #f #f #f #f #f #f #f
                      #f #f #f #f #f #f #f #f
                      #f #f #f #f #f #f #f #t)))

(test-equal "booleans->integer" 9 (booleans->integer #f #f #t #f #f #t))

(test-end "srfi-60")