1 USING: binary-search math.order sequences kernel tools.test ;
2 IN: binary-search.tests
4 { f } [ 3 { } [ <=> ] with search drop ] unit-test
5 { 0 } [ 3 { 3 } [ <=> ] with search drop ] unit-test
6 { 1 } [ 2 { 1 2 3 } [ <=> ] with search drop ] unit-test
7 { 3 } [ 4 { 1 2 3 4 5 6 } [ <=> ] with search drop ] unit-test
8 { 2 } [ 3.5 { 1 2 3 4 5 6 7 8 } [ <=> ] with search drop ] unit-test
9 { 4 } [ 5.5 { 1 2 3 4 5 6 7 8 } [ <=> ] with search drop ] unit-test
10 { 10 } [ 10 20 iota [ <=> ] with search drop ] unit-test
12 { 0 } [ "alligator" { "alligator" "cat" "fish" "hello" "ikarus" "java" } sorted-index ] unit-test
13 { 3 } [ "hey" { "alligator" "cat" "fish" "hello" "ikarus" "java" } sorted-index ] unit-test
14 { 5 } [ "java" { "alligator" "cat" "fish" "hello" "ikarus" "java" } sorted-index ] unit-test
15 { t } [ "hello" { "alligator" "cat" "fish" "hello" "ikarus" "java" } sorted-member? ] unit-test
16 { f } [ "hello" { "alligator" "cat" "fish" "ikarus" "java" } sorted-member? ] unit-test
17 { f } [ "zebra" { "alligator" "cat" "fish" "ikarus" "java" } sorted-member? ] unit-test