static gboolean
ufo_node_equal_real (UfoNode *n1,
UfoNode *n2)
{
g_return_val_if_fail (UFO_IS_NODE (n1) && UFO_IS_NODE (n2), FALSE);
/* FIXME: When done we should just check if the types match */
return n1 == n2;
}
void
ufo_task_node_set_proc_node (UfoTaskNode *task_node,
UfoNode *proc_node)
{
g_return_if_fail (UFO_IS_TASK_NODE (task_node) && UFO_IS_NODE (proc_node));
task_node->priv->proc_node = proc_node;
}
/**
* ufo_node_get_label:
* @node: A #UfoNode
*
* Get arbitrary label data of @node.
*
* Returns: (transfer none): The label of @node.
*/
gpointer
ufo_node_get_label (UfoNode *node)
{
g_return_val_if_fail (UFO_IS_NODE (node), NULL);
return node->priv->label;
}
/**
* ufo_node_get_total:
* @node: A #UfoNode
*
* Get the total amount of copied nodes.
*
* Returns: The number of copied nodes.
*/
guint
ufo_node_get_total (UfoNode *node)
{
g_return_val_if_fail (UFO_IS_NODE (node), 0);
return node->priv->orig->priv->total;
}
/**
* ufo_node_get_index:
* @node: A #UfoNode
*
* Get the index of this node. When a graph is expanded, nodes are copied. The
* original node has index 1, all successive copies receive a monotonous
* increasing index. The total amount of copied nodes can be queried with
* ufo_node_get_total().
*
* Returns: The index of @node.
*/
guint
ufo_node_get_index (UfoNode *node)
{
g_return_val_if_fail (UFO_IS_NODE (node), 0);
return node->priv->index;
}
