%!PS

% begin included library code

/test.end {
    ( ) print
    test.count 0 gt {
        (Passed ) print
        test.pass (...) cvs print
        (/) print
        test.count (...) cvs print
        ( \() print
        test.pass 100 mul test.count idiv (...) cvs print
        (%\)) print
        (\r\n) print
    } if
} bind def

/quicksort.swap {
    2 dict begin
    /bi exch def
    /ai exch def
    arr ai get
    arr bi get
    arr exch ai exch put
    arr exch bi exch put
    end
} bind def

/test {
    /test.count test.count 1 add def
    {
        /test.pass test.pass 1 add def
    } {
        ( ) print
        test.count (....) cvs print
        (-fail) print
    } ifelse
} bind def

/quicksort.main { % lo hi -> (null)
    3 dict begin
    /hi exch def
    /lo exch def
    /xit false def
    lo 0 lt {
        /xit true def
    } if
    hi 0 lt {
        /xit true def
    } if
    lo hi ge {
        /xit true def
    } if
    xit not {
        /p quicksort.partition def
        lo p quicksort.main
        p 1 add hi quicksort.main
    } if
    end
} bind def

/keys { % dict -> array of dict keys
    [ exch
      {
          pop
      } forall
    ]
} bind def

/quicksort { % [ a c b ] -> [ a b c ]
    1 dict begin
    /arr exch def
    0 arr length 1 sub quicksort.main
    arr
    end
} bind def

/deepeq {
    2 dict begin
    /a exch def
    /b exch def
    a type b type eq {
        a type /dicttype eq {
            a length b length eq {
                <<
                    a {
                        pop
                        true
                    } forall
                    b {
                        pop
                        true
                    } forall
                >>
                true exch
                {
                    pop
                    dup a exch known {
                        dup b exch known {
                            dup a exch get exch b exch get deepeq not {
                                pop false
                            } if
                        } {
                            false
                        } ifelse
                    } {
                        false
                    } ifelse
                } forall
            } {
                false
            } ifelse
        } {
            a type dup /arraytype eq exch /stringtype eq or {
                a length b length eq {
                    true
                    0 1 a length 1 sub {
                        dup a exch get exch b exch get deepeq not {
                            pop false
                            exit
                        } if
                    } for
                } {
                    false
                } ifelse
            } {
                a b eq
            } ifelse
        } ifelse
    } {
        false
    } ifelse
    end
} bind def

/isprime {
    4 dict begin
    /candidate exch def
    1 {
        candidate 2 lt {
            false
            exit
        } if
        candidate 2 eq {
            true
            exit
        } if
        candidate 2 mod 0 eq {
            false
            exit
        } if
        candidate 3 eq {
            true
            exit
        } if
        candidate 3 mod 0 eq {
            false
            exit
        } if
        /prime true def
        /limit candidate sqrt cvi 1 add def
        /anchor 0 def
        {
            /anchor anchor 6 add def
            anchor limit gt {
                exit
            } if
            [ -1 1 ] {
                anchor add candidate exch mod 0 eq {
                    /prime false def
                    exit
                } if
            } forall
            prime false eq {
                exit
            } if
        } loop
        prime
    } repeat
    end
} bind def

/quicksort.partition {
    3 dict begin
    /pivot arr hi lo add 2 idiv get def
    /i lo 1 sub def
    /j hi 1 add def
    {
        {
            /i i 1 add def
            arr i get pivot ge {
                exit
            } if
        } loop
        {
            /j j 1 sub def
            arr j get pivot le {
                exit
            } if
        } loop
        i j ge {
            j
            exit
        } if
        i j quicksort.swap
    } loop
    end
} bind def

/test.start {
    print (:) print
    /test.pass 0 def
    /test.count 0 def
} bind def

% end included library code

/perrinprime {
    4 dict begin
    /n exch def
    /out n dict def
    /seq [ 3 0 2 ] def
    {
        /nv seq 0 get seq 1 get add def
        seq 0 seq 1 get put
        seq 1 seq 2 get put
        seq 2 nv put
        nv isprime {
            out nv true put
            out length n ge {
                exit
            } if
        } if
    } loop
    out keys quicksort
    end
} bind def

(perrinprime) test.start
13 perrinprime
[ 2 3 5 7 17 29 277 367 853 14197 43721 1442968193 792606555396977 ]
deepeq test
test.end