Advertisement
Guest User

Untitled

a guest
Apr 22nd, 2018
67
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Delphi 1.11 KB | None | 0 0
  1. procedure TMainForm.btnBuildClick(Sender: TObject);
  2. var
  3.    I: Integer;
  4. begin
  5.    Tree := TBTree.Create;
  6.    SetLength(Arr, StrToInt(edtA.Text));
  7.    if not CheckIfNonDescendingAndCorrectSG(sgA) then
  8.    begin
  9.       MessageBox(0, PChar('List A must be NONdecreasing'), PChar('Warning!'),
  10.         MB_ICONERROR);
  11.       Exit;
  12.    end;
  13.    with sgA do
  14.    begin
  15.       for I := 0 to ColCount - 1 do
  16.          try
  17.             Arr[I] := StrToInt(Cells[I, 0]);
  18.          except
  19.             MessageBox(0, PChar('List shouldn''t contain empty cells.'),
  20.               PChar('Warning!'), MB_ICONERROR);
  21.             Exit;
  22.          end;
  23.    end;
  24.    try
  25.       Tree.BinarySearch(0, Length(Arr) - 1, StrToInt(edtWanted.Text),
  26.         Arr, Tree);
  27.    except
  28.       MessageBox(0, PChar('Wanted value is not correct.'), PChar('Warning!'),
  29.         MB_ICONERROR);
  30.       Exit;
  31.    end;
  32.    fCanvas := TCanvasForm.Create(Self);
  33.    fCanvas.Show;
  34.    DrawTree(MAX_WIDTH div 2, MAX_HEIGHT div Tree.Depth div 2,
  35.      MAX_CANVAS_WIDTH div 2, MAX_HEIGHT div Tree.Depth, RADIUS, Tree,
  36.      fCanvas.Canvas);
  37.    Tree.Destroy;
  38.    Tree := nil;
  39. end;
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement