Lazarus
Home
Help
TinyPortal
Search
Login
Register
Lazarus
»
Forum
»
Programming
»
LCL
»
VirtualStringTree...
Free Pascal
Website
Downloads
Wiki
Bugtracker
Mailing List
Lazarus
Website
Downloads (Laz+FPC)
Packages (OPM)
FAQ
Wiki
Bugtracker
CCR Bugs
IRC channel
GIT
Mailing List
Other languages
Foundation
Website
Useful Wiki Links
Project Roadmap
Getting the Source
Screenshots
How to use the forum
About donations (wiki)
Bookstore
Computer Math and Games in Pascal
(preview)
Lazarus Handbook
Search
Advanced search
Recent
Pack Files into one and e...
by
DreamVB
[
Today
at 01:56:38 am]
Fuzzy Math
by
Thausand
[
Today
at 01:17:56 am]
Procedure declaration bef...
by
Thausand
[
Today
at 12:53:59 am]
Cursor position in TMemo ...
by
bobby100
[
Today
at 12:35:47 am]
LibreDWG with fpc?
by
zamtmn
[
Today
at 12:03:11 am]
[SOLVED] USB connected de...
by
bobby100
[June 27, 2022, 11:24:58 pm]
Can Absolute be used on s...
by
andresayang
[June 27, 2022, 11:06:43 pm]
Are there any limits on q...
by
MarkMLl
[June 27, 2022, 10:39:39 pm]
Error Insert TSQLQuery Co...
by
Root2
[June 27, 2022, 10:32:38 pm]
StrToFloat - formatted
by
BrunoK
[June 27, 2022, 08:06:00 pm]
« previous
next »
Print
Pages: [
1
]
Author
Topic: VirtualStringTree... (Read 277 times)
Espectr0
New Member
Posts: 44
VirtualStringTree...
«
on:
May 19, 2022, 12:28:34 am »
Hola,
Is there a fast way in VirtualStringTree to select a node by index without having to go through each node to know its position?
Thanks!
Logged
Wallaby
New Member
Posts: 42
Re: VirtualStringTree...
«
Reply #1 on:
May 19, 2022, 12:41:15 pm »
None. They are a linked list, there is no index really.
Logged
Print
Pages: [
1
]
« previous
next »
Lazarus
»
Forum
»
Programming
»
LCL
»
VirtualStringTree...
TinyPortal
© 2005-2018