The way <hierarchy-tree> does updates makes it impossible to play with
it interactively.
If I cut & paste the entire example into the *scheme* buffer (in
emacs), namely:
(define T (make <Hierarchy-tree>))
(pack T :expand #t :fill "both")
(define d1 (add-node T #f "dir1"))
(define d2 (add-node T #f "dir2"))
(define d3 (add-node T d1 "dir3"))
(add-leave T d1 "file2")
(add-leave T d1 "file1")
(add-leave T d3 "file3")
(add-leave T d2 "file4")
and hit enter to send the whole thing to the STk interpreter, then it
works fine.
However, if I execute each line individually, then the nodes never get
drawn.
I guess the difference is that the former keeps the interpreter
running so that everything gets added before
(after 'idle (lambda() (update-hierarchy self))
from the <hierarchy-tree>'s initialize method fires off.
One can't add things oneself & then run update-hierarchy (without
cheating) because it's not exported.
It looks to me like Hierarchy.stklos needs to be rewritten to
incrementally adjust the view when adding & deleting objects.
--
Harvey Stein
Bloomberg LP
hjstein_at_bfr.co.il
Received on Mon Sep 13 1999 - 23:31:39 CEST