%!PS % begin included library code % see https://codeberg.org/Firedrake/postscript-libraries/ /keys { % dict -> array of dict keys [ exch { pop } forall ] } 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 /toset { % array -> dict of (value, true) << exch { true } forall >> } 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 /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 cmp 0 ge { exit } if } loop { /j j 1 sub def arr j get pivot cmp 0 le { exit } if } loop i j ge { j exit } if i j quicksort.swap } loop end } bind def /values { % dict -> array of dict values [ exch { exch pop } forall ] } bind def /quicksort.with_comparator { % [ a c b ] { comparator } -> [ a b c ] 2 dict begin /cmp exch def /arr exch def arr length 0 gt { 0 arr length 1 sub quicksort.main } if arr end } bind def /all { % [a b] proc -> bool 1 dict begin /p exch def true exch { p not { pop false exit } if } forall end } bind def /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 /quicksort.cmp { 2 copy lt { pop pop -1 } { gt { 1 } { 0 } ifelse } ifelse } bind def /quicksort { { quicksort.cmp } quicksort.with_comparator } bind def /test.start { print (:) print /test.pass 0 def /test.count 0 def } bind def % end included library code /counterify { 2 dict begin /c 0 dict def { /n exch def c n known { c n 2 copy get 1 add put } { c n 1 put } ifelse } forall c end } bind def /equalgroup { 0 dict begin counterify values toset keys quicksort /v exch def /l v 0 get def false l 2 ge { 2 1 l { /t exch def v { t mod 0 eq } all { pop true exit } if } for } if end } bind def (equalgroup) test.start [1 1 2 2 2 2] equalgroup test [1 1 1 2 2 2 3 3] equalgroup not test [5 5 5 5 5 5 7 7 7 7 7 7] equalgroup test [1 2 3 4] equalgroup not test [8 8 9 9 10 10 11 11] equalgroup test test.end