This is libsolv, a free package dependency solver using a satisfiability
algorithm.
-This code is based on two major, but independent, blocks:
+The code is based on two major, but independent, blocks:
1. Using a dictionary approach to store and retrieve package
and dependency information.
resolving package dependencies.
The sat-solver code has been written to aim for the newest packages,
-record the decison tree to provide introspection, and also allows to
+record the decision tree to provide introspection, and also allows to
provide the user with suggestions on how to deal with unsolvable
problems. It also takes advantage of the repository storage to
minimize memory usage.
Supported package formats:
+
- rpm/rpm5
- deb
- arch linux
- haiku
Supported repository formats:
+
- rpmmd (primary, filelists, comps, deltainfo/presto, updateinfo)
- susetags, suse product formats
- mandriva/mageia (synthesis, info, files)
- red carpet helix format
- haiku
+Build instructions
+==================
+
Requires: cmake 2.4.x
-mkdir build
-cd build
-cmake ..
-make
+ mkdir build
+ cd build
+ cmake ..
+ make
-To create a package:
-make srcpackage
-see package/
+////
+vim: syntax=asciidoc
+////