# File rdoc-sources/FXTreeListBox.rb, line 124 def removeItem(item, notify=false); # Remove items in range [_fromItem_, _toItem_] inclusively. # If _notify_ is +true+, a +SEL_DELETED+ message is sent to the list's message # target before each item is removed. def removeItems(fromItem, toItem, notify=false); end # Remove all items from the list. # If _notify_ is +true+, a +SEL_DELETED+ message is sent to the list's message # target before each item is removed. def clearItems(notify=false); end # # Move _item_ under _father_ before _other_ item and return a reference to # _item_. # def moveItem(other, father, item); end # # Extract item from list and return a reference to the item. # def extractItem(item); end # # Search items by _text_, beginning from item _start_. If the # start item is +nil+ the search will start at the first, top-most item # in the list. Flags may be +SEARCH_FORWARD+ or +SEARCH_BACKWARD+ to control # the search direction; this can be combined with +SEARCH_NOWRAP+ or +SEARCH_WRAP+ # to control whether the search wraps at the start or end of the list. # The option +SEARCH_IGNORECASE+ causes a case-insensitive match. Finally, # passing +SEARCH_PREFIX+ causes searching for a prefix of the item text. # Return +nil+ if no matching item is found. # def findItem(text, start=nil, flags=SEARCH_FORWARD|SEARCH_WRAP); end # # Search items by associated user _data_, beginning from item _start_. If the # start item is +nil+ the search will start at the first, top-most item # in the list. Flags may be +SEARCH_FORWARD+ or +SEARCH_BACKWARD+ to control # the search direction; this can be combined with +SEARCH_NOWRAP+ or +SEARCH_WRAP+ # to control whether the search wraps at the start or end of the list. # Return +nil+ if no matching item is found. # def findItemByData(data, start=nil, flags=SEARCH_FORWARD|SEARCH_WRAP); end # Return +true+ if item is current def itemCurrent?(item); end # Return +true+ if item is a leaf-item, i.e. has no children def itemLeaf?(item); end # Sort root items def sortRootItems(); end # Sort all items recursively. def sortItems(); end # Sort children of _item_ def sortChildItems(item); end # # Change current item. # If _notify_ is +true+, a SEL_CHANGED message is sent to the tree list box's # message target. # def setCurrentItem(item, notify=false); end # Change item's text def setItemText(item, text); end # Return item's text def getItemText(item); end # Change item's open icon def setItemOpenIcon(item, openIcon); end # Return item's open icon def getItemOpenIcon(item); end # Change item's closed icon def setItemClosedIcon(item, closedIcon); end # Return item's closed icon def getItemClosedIcon(item); end # Change item's user data def setItemData(item, data); end # Return item's user data def getItemData(item); end # Return +true+ if the pane is shown. def paneShown?; end end