Ergebnis der Suchanfrage

• Forum: Object-Pascal / Delphi-Language

  AW: Count tree root nodes

    Delphi
    by Sir Rufo, 26. Aug 2014
  It is fast, because it did not count all wanted nodes ;)
  
  +-n1
  +-n2
  +-n3
  +-n4
  +-n5
  +-n6
  
  Counting all nodes at level 1 should return 4 and not 2 ;)
• Forum: Object-Pascal / Delphi-Language

  AW: Count tree root nodes

    Delphi
    by Sir Rufo, 26. Aug 2014
  You are right that this is very slow and the documentation also stated this TTreeView.Items
  
  Note: Accessing tree view items by index can be time-intensive, particularly when the tree view contains many items. For optimal performance, try to design your application so that it has as few dependencies on the tree view's item index as possible.
  
  But there are some methods to walk through the...