jwaldmann
commented
2 years ago The top functions (nearly 50 percent of all time!) are
640 bit_cut_integer :: Integer -> (Integer, Bool);
641 bit_cut_integer k =
642 (if k == (0 :: Integer) then ((0 :: Integer), False)
643 else (case divMod (abs k) (abs (2 :: Integer)) of {
644 (r, s) ->
645 ((if (0 :: Integer) < k then r else negate r - s),
646 s == (1 :: Integer));
647 }));
649 data Char = Char Bool Bool Bool Bool Bool Bool Bool Bool;
650
651 char_of_integer :: Integer -> Char;
652 char_of_integer k =
653 (case bit_cut_integer k of {
654 (q0, b0) ->
655 (case bit_cut_integer q0 of {
656 (q1, b1) ->
657 (case bit_cut_integer q1 of {
658 (q2, b2) ->
659 (case bit_cut_integer q2 of {
660 (q3, b3) ->
661 (case bit_cut_integer q3 of {
662 (q4, b4) ->
663 (case bit_cut_integer q4 of {
664 (q5, b5) ->
665 (case bit_cut_integer q5 of {
666 (q6, b6) ->
667 let {
668 a = bit_cut_integer q6;
669 } in (case a of {
670 (_, aa) -> Char b0 b1 b2 b3 b4 b5 b6 aa;
671 });
672 });
673 });
674 });
675 });
676 });
677 });
678 });
679 certainly we can do better here?
for verifying a long-ish SRS loop:
input and full output: see data/ directory (53216. and babababaa-aaaabababababa.)
executable built with