<title>libsmartcols Reference Manual</title>
<releaseinfo>for libsmartcols version &version;</releaseinfo>
<copyright>
- <year>2014-2016</year>
+ <year>2014-2017</year>
<holder>Karel Zak <kzak@redhat.com></holder>
</copyright>
</bookinfo>
<title>Index of new symbols in 2.29</title>
<xi:include href="xml/api-index-2.29.xml"><xi:fallback /></xi:include>
</index>
+ <index role="2.30">
+ <title>Index of new symbols in 2.30</title>
+ <xi:include href="xml/api-index-2.30.xml"><xi:fallback /></xi:include>
+ </index>
</book>
* scols_cell_get_alignment:
* @ce: a pointer to a struct libscols_cell instance
*
+ * Since: 2.30
+ *
* Returns: SCOLS_CELL_FL_{RIGHT,CELNTER,LEFT}
*/
int scols_cell_get_alignment(const struct libscols_cell *ce)
*
* The function is designed to detect circular dependencies between @ln and
* @parent. It checks if @ln is not any (grand) parent in the @parent's tree.
+ *
+ * Since: 2.30
+ *
+ * Returns: 0 or 1
*/
int scols_line_is_ancestor(struct libscols_line *ln, struct libscols_line *parent)
{
* @pre: column before the column
* @cl: colum to move
*
- * Move the @cl behind @pre. The the @pre is NULL then the @col is the fist
+ * Move the @cl behind @pre. If the @pre is NULL then the @col is the first
* column in the table.
*
+ * Since: 2.30
+ *
* Returns: 0, a negative number in case of an error.
*/
int scols_table_move_column(struct libscols_table *tb,
* Reorders lines in the table by parent->child relation. Note that order of
* the lines in the table is independent on the tree hierarchy.
*
+ * Since: 2.30
+ *
* Returns: 0, a negative value in case of an error.
*/
int scols_sort_table_by_tree(struct libscols_table *tb)