Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.java.gui > #1870
| From | "Roedy Green" <roedy.green@THRWHITE.remove-dii-this> |
|---|---|
| Subject | Re: JFace, CheckboxTreeVi |
| Message-ID | <1oth739m1qrl1fsioj90pran7197n3cb57@4ax.com> (permalink) |
| Newsgroups | comp.lang.java.gui |
| References | <1182324673.729864.180420@q69g2000hsb.googlegroups.com> |
| Date | 2011-04-27 15:35 +0000 |
| Organization | TDS.net |
To: comp.lang.java.gui On Wed, 20 Jun 2007 00:31:13 -0700, Markward <markward.schubert@gmail.com> wrote, quoted or indirectly quoted someone who said : >Does that mean, that we have to implement the search in the tree >ourselfs and memorize the references to the proper tree-items in the >Object[] ? I don't properly understand your question, so I will just make some general observations that might be useful. I apologise If am belabouring the obvious. Your objects you use to represent your nodes and leaves will be a custom class or two custom classes . They can have all manner of additional information in them. The tree structure is for controlling collapse of detail. You can have your own search stuff that works quite independently e.g. by adding your objects to various sorted ArrayLists or HashMaps or TreeMaps. -- Roedy Green Canadian Mind Products The Java Glossary http://mindprod.com --- * Synchronet * The Whitehouse BBS --- whitehouse.hulds.com --- check it out free usenet! --- Synchronet 3.15a-Win32 NewsLink 1.92 Time Warp of the Future BBS - telnet://time.synchro.net:24
Back to comp.lang.java.gui | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
JFace, CheckboxTreeViewer "Markward" <markward@THRWHITE.remove-dii-this> - 2011-04-27 15:35 +0000
Re: JFace, CheckboxTreeVi "Roedy Green" <roedy.green@THRWHITE.remove-dii-this> - 2011-04-27 15:35 +0000
Re: JFace, CheckboxTreeVi "Markward" <markward@THRWHITE.remove-dii-this> - 2011-04-27 15:35 +0000
csiph-web