76 lines
2.4 KiB
Factor
Executable File
76 lines
2.4 KiB
Factor
Executable File
! Copyright 2007, 2008 Ryan Murphy, Slava Pestov
|
|
! See http://factorcode.org/license.txt for BSD license.
|
|
|
|
USING: arrays kernel math namespaces tools.test
|
|
heaps heaps.private math.parser random assocs sequences sorting
|
|
accessors math.order ;
|
|
IN: heaps.tests
|
|
|
|
[ <min-heap> heap-pop ] must-fail
|
|
[ <max-heap> heap-pop ] must-fail
|
|
|
|
[ t ] [ <min-heap> heap-empty? ] unit-test
|
|
[ f ] [ <min-heap> 1 t pick heap-push heap-empty? ] unit-test
|
|
[ t ] [ <max-heap> heap-empty? ] unit-test
|
|
[ f ] [ <max-heap> 1 t pick heap-push heap-empty? ] unit-test
|
|
|
|
! Binary Min Heap
|
|
{ 1 2 3 4 5 6 } [ 0 left 0 right 1 left 1 right 2 left 2 right ] unit-test
|
|
{ t } [ t 5 f <entry> t 3 f <entry> T{ min-heap } heap-compare ] unit-test
|
|
{ f } [ t 5 f <entry> t 3 f <entry> T{ max-heap } heap-compare ] unit-test
|
|
|
|
[ t 2 ] [ <min-heap> t 300 pick heap-push t 200 pick heap-push t 400 pick heap-push t 3 pick heap-push t 2 pick heap-push heap-pop ] unit-test
|
|
|
|
[ t 1 ] [ <min-heap> t 300 pick heap-push t 200 pick heap-push t 400 pick heap-push t 3 pick heap-push t 2 pick heap-push t 1 pick heap-push heap-pop ] unit-test
|
|
|
|
[ t 400 ] [ <max-heap> t 300 pick heap-push t 200 pick heap-push t 400 pick heap-push t 3 pick heap-push t 2 pick heap-push t 1 pick heap-push heap-pop ] unit-test
|
|
|
|
[ 0 ] [ <max-heap> heap-size ] unit-test
|
|
[ 1 ] [ <max-heap> t 1 pick heap-push heap-size ] unit-test
|
|
|
|
: heap-sort ( alist -- keys )
|
|
<min-heap> [ heap-push-all ] keep heap-pop-all ;
|
|
|
|
: random-alist ( n -- alist )
|
|
[
|
|
[
|
|
32 random-bits dup number>string swap set
|
|
] times
|
|
] H{ } make-assoc ;
|
|
|
|
: test-heap-sort ( n -- ? )
|
|
random-alist dup >alist sort-keys swap heap-sort = ;
|
|
|
|
14 [
|
|
[ t ] swap [ 2^ test-heap-sort ] curry unit-test
|
|
] each
|
|
|
|
: test-entry-indices ( n -- ? )
|
|
random-alist
|
|
<min-heap> [ heap-push-all ] keep
|
|
data>> dup length swap [ entry-index ] map sequence= ;
|
|
|
|
14 [
|
|
[ t ] swap [ 2^ test-entry-indices ] curry unit-test
|
|
] each
|
|
|
|
: delete-random ( seq -- elt )
|
|
dup length random dup pick nth >r swap delete-nth r> ;
|
|
|
|
: sort-entries ( entries -- entries' )
|
|
[ [ entry-key ] compare ] sort ;
|
|
|
|
: delete-test ( n -- ? )
|
|
[
|
|
random-alist
|
|
<min-heap> [ heap-push-all ] keep
|
|
dup data>> clone swap
|
|
] keep 3 /i [ 2dup >r delete-random r> heap-delete ] times
|
|
data>>
|
|
[ [ entry-key ] map ] bi@
|
|
[ natural-sort ] bi@ ;
|
|
|
|
11 [
|
|
[ t ] swap [ 2^ delete-test sequence= ] curry unit-test
|
|
] each
|