LI_TYPE_PACKAGE_GRAPH

#define LI_TYPE_PACKAGE_GRAPH (li_package_graph_get_type ())

li_package_graph_new ()

LiPackageGraph *
li_package_graph_new (void);

Creates a new LiPackageGraph.

li_package_graph_new_from_pkiarray ()

LiPackageGraph *
li_package_graph_new_from_pkiarray (GPtrArray *pkiarray,
                                    GError **error);

Create a new package graph and populate it with data from an array of LiPkgInfo objects.

li_package_graph_initialize ()

void
li_package_graph_initialize (LiPackageGraph *pg,
                             GError **error);

Load additional data to aid the resolving process.

li_package_graph_reset ()

void
li_package_graph_reset (LiPackageGraph *pg);

Remove all nodes from the graph, except for the root node.

li_package_graph_branch_to_array ()

GPtrArray *
li_package_graph_branch_to_array (LiPackageGraph *pg,
                                  LiPkgInfo *root,
                                  gboolean include_root);

Get an array of LiPkgInfo objects this node depends on.

li_package_graph_node_get_any_parent_manual ()

gboolean
li_package_graph_node_get_any_parent_manual
                               (LiPackageGraph *pg,
                                LiPkgInfo *root);

Check if a node has children containing packages which were installed manually.

li_package_graph_add_package ()

GPtrArray *
li_package_graph_add_package (LiPackageGraph *pg,
                              LiPkgInfo *parent,
                              LiPkgInfo *pki,
                              LiPkgInfo *satisfied_dep);

li_package_graph_add_package_install_todo ()

GPtrArray *
li_package_graph_add_package_install_todo
                               (LiPackageGraph *pg,
                                LiPkgInfo *parent,
                                LiPackage *pkg,
                                LiPkgInfo *satisfied_dep);

li_package_graph_get_install_candidate ()

LiPackage *
li_package_graph_get_install_candidate
                               (LiPackageGraph *pg,
                                LiPkgInfo *pki);

li_package_graph_mark_installed ()

gboolean
li_package_graph_mark_installed (LiPackageGraph *pg,
                                 LiPkgInfo *pki);

li_package_graph_get_install_todo_count ()

guint
li_package_graph_get_install_todo_count
                               (LiPackageGraph *pg);

Get the number of packages which need to be installed.

li_package_graph_test_foundation_dependency ()

gboolean
li_package_graph_test_foundation_dependency
                               (LiPackageGraph *pg,
                                LiPkgInfo *dep_pki,
                                GError **error);

Check if we have a foundation dependency.

li_package_graph_set_ignore_foundations ()

void
li_package_graph_set_ignore_foundations
                               (LiPackageGraph *pg,
                                gboolean ignore);

li_package_graph_node_is_origin ()

gboolean
li_package_graph_node_is_origin (LiPackageGraph *pg,
                                 LiPkgInfo *root);

Check if this node is an origin (it is no child of any other node).

li_find_satisfying_pkg ()

LiPkgInfo *
li_find_satisfying_pkg (GPtrArray *pkglist,
                        LiPkgInfo *dep);

Return a package from the given package-list which matches the criteria defined in dep.

TODO: Return the highest version of a package matching the constraints.

struct LiPackageGraphClass

struct LiPackageGraphClass {
	GObjectClass		parent_class;
};

LiPackageGraph

typedef struct _LiPackageGraph LiPackageGraph;

The “progress” signal

void
user_function (LiPackageGraph *lipackagegraph,
               guint           arg1,
               gpointer        arg2,
               gpointer        user_data)

Flags: Run Last

The “stage-changed” signal

void
user_function (LiPackageGraph *lipackagegraph,
               guint           arg1,
               gpointer        arg2,
               gpointer        user_data)

Flags: Run Last