tests.inc 565 B

123456789101112131415161718192021222324
  1. Test:y_bintree_1()
  2. {
  3. new BinaryInput:values<100>;
  4. for (new i = 0; i != sizeof (values); ++i)
  5. {
  6. values[i][E_BINTREE_INPUT_VALUE] = i;
  7. values[i][E_BINTREE_INPUT_POINTER] = i * 2 + 1;
  8. }
  9. new BinaryTree:tree<100>;
  10. Bintree_Generate(tree, values);
  11. for (new i = 0; i != sizeof (values); ++i)
  12. {
  13. ASSERT(Bintree_FindValue(tree, i) == i * 2 + 1);
  14. }
  15. for (new i = -100; i != 0; ++i)
  16. {
  17. ASSERT(Bintree_FindValue(tree, i) == BINTREE_NOT_FOUND);
  18. }
  19. for (new i = sizeof (values); i != 1000; ++i)
  20. {
  21. ASSERT(Bintree_FindValue(tree, i) == BINTREE_NOT_FOUND);
  22. }
  23. }