SftTree/DLL 7.5 - Tree Control
SftBox/OCX 5.0 - Combo Box Control
SftButton/OCX 3.0 - Button Control
SftMask/OCX 7.0 - Masked Edit Control
SftTabs/OCX 6.5 - Tab Control (VB6 only)
SftTree/OCX 7.5 - Tree Control
SftPrintPreview/DLL 2.0 - Print Preview Control (discontinued)
SftTree/DLL 7.5 - Tree Control
SftBox/OCX 5.0 - Combo Box Control
SftButton/OCX 3.0 - Button Control
SftDirectory 3.5 - File/Folder Control (discontinued)
SftMask/OCX 7.0 - Masked Edit Control
SftOptions 1.0 - Registry/INI Control (discontinued)
SftPrintPreview/OCX 1.0 - Print Preview Control (discontinued)
SftTabs/OCX 6.5 - Tab Control (VB6 only)
SftTree/OCX 7.5 - Tree Control
SftTabs/NET 6.0 - Tab Control (discontinued)
SftTree/NET 2.0 - Tree Control
Returns the item's next sibling.
Get
| VB.NET | ItemIndex = object.NextSibling As Integer |
| VB | ItemIndex = object.NextSibling As Long |
| C#.NET | int ItemIndex = object.NextSibling; |
| VC++ | long ItemIndex = object->NextSibling; long ItemIndex = object->GetNextSibling(); |
| C | HRESULT object->get_NextSibling(long* ItemIndex); |
object
A SftTreeItem object.
ItemIndex
Returns the item's next sibling. -1 is returned if the item doesn't have a next sibling.
The NextSibling property returns the item's next sibling.
The next sibling of the item is found by scanning towards the end of the tree control and locating an item on the same level (Item.Level property) as the item without encountering a parent item.
The Item.PrevSibling property can be used to retrieve an item's previous sibling. The Item.FirstSibling and Item.LastSibling properties can be used to retrieve an item's first or last sibling.
End If
Else
If SortedColumn = 3 Then
AxSftTree1.Items.SortDependents(ItemIndex, SortedColumn, SftTreeSortTypeConstants.sortSftTreeDscCellItemData)
Else
AxSftTree1.Items.SortDependents(ItemIndex, SortedColumn, SftTreeSortTypeConstants.sortSftTreeDescending)
End If
End If
ItemIndex = AxSftTree1.get_Item(ItemIndex).NextSibling
Loop While ItemIndex >= 0
End If
' update column headers by calling CaretChange
AxSftTree1_CaretChange(Me, New _DSftTreeEvents_CaretChangeEvent(AxSftTree1.Items.Current))
End If
End If
End Sub
End If
Else
If SortedColumn = 3 Then
.Items.SortDependents ItemIndex, SortedColumn, sortSftTreeDscCellItemData
Else
.Items.SortDependents ItemIndex, SortedColumn, sortSftTreeDescending
End If
End If
ItemIndex = .Item(ItemIndex).NextSibling
Loop Until ItemIndex < 0
End Select
SftTree1_CaretChange .Items.Current
End If
End If
End With
else
axSftTree1.Items.SortDependents(ItemIndex, sortedColumn, SftTreeSortTypeConstants.sortSftTreeAscending);
} else {
if (sortedColumn == 3)
axSftTree1.Items.SortDependents(ItemIndex, sortedColumn, SftTreeSortTypeConstants.sortSftTreeDscCellItemData);
else
axSftTree1.Items.SortDependents(ItemIndex, sortedColumn, SftTreeSortTypeConstants.sortSftTreeDescending);
}
ItemIndex = axSftTree1.get_Item(ItemIndex).NextSibling;
} while (ItemIndex >= 0);
}
// update column headers by calling CaretChange
axSftTree1_CaretChange(this, new _DSftTreeEvents_CaretChangeEvent(axSftTree1.Items.Current));
}
}
}
else
m_vTree->Items->SortDependents(ItemIndex, sortedColumn, sortSftTreeAscending);
} else {
if (sortedColumn == 3)
m_vTree->Items->SortDependents(ItemIndex, sortedColumn, sortSftTreeDscCellItemData);
else
m_vTree->Items->SortDependents(ItemIndex, sortedColumn, sortSftTreeDescending);
}
ItemIndex = m_vTree->Item[ItemIndex]->NextSibling;
} while (ItemIndex >= 0);
}
}
// update column headers by calling CaretChange
OnCaretChangeSftTree1(m_vTree->Items->Current);
}
}See Also SftTreeItem Object | Object Hierarchy
