ListStore —
The database for simple (non-hierarchical) tables.
listStoreNew:: [TMType] -> IO ListStore |
listStoreAppend:: ListStoreClass ts => ts -> IO TreeIter |
listStoreClear:: ListStoreClass ts => ts -> IO () |
listStoreInsert:: ListStoreClass ts => ts -> Int -> IO TreeIter |
listStoreInsertAfter:: ListStoreClass ts => ts -> TreeIter -> IO TreeIter |
listStoreInsertBefore:: ListStoreClass ts => ts -> TreeIter -> IO TreeIter |
listStorePrepend:: ListStoreClass ts => ts -> IO TreeIter |
listStoreRemove:: ListStoreClass ts => ts -> TreeIter -> IO Bool |
listStoreSetValue:: ListStoreClass ts => ts -> TreeIter -> Int -> GenericValue -> IO () |
Insert a row at the end of the table .
| listStoreAppend | :: ts | :: IO TreeIter |
| ts |
This is equivalent to listStoreInsert (-1).
Insert a new row into the list.
| listStoreInsert | :: ts | :: Int | :: IO TreeIter |
| ts | pos |
The pos parameter determines the row number where the row should be inserted. Set this to -1 to insert at the end of the list.
Insert a row behind the sibling row.
| listStoreInsertAfter | :: ts | :: TreeIter | :: IO TreeIter |
| ts | sibling |
Insert a row in front of the sibling node.
| listStoreInsertBefore | :: ts | :: TreeIter | :: IO TreeIter |
| ts | sibling |
Insert a row in front of every other row.
| listStorePrepend | :: ts | :: IO TreeIter |
| ts |
This is equivalent to listStoreInsert 0.
Remove a specific node.
| listStoreRemove | :: ts | :: TreeIter | :: IO Bool |
| ts | ti |
The TreeIter will point to the entry following the one which was just removed. The function returns False if the tiTreeIter does not point to a valid element (i.e. the function just removed the bottom entry from the list).
<warning><para>This function returned () in Gtk version 2.0.X</warning><para>