mirror of
https://github.com/openSUSE/libsolv.git
synced 2026-02-05 12:45:46 +01:00
8780860b34
The code adds new rules in a FOR_RULELITERALS loop. The iterator needs to access elements of the rule it iterates over, so if we add a new rule in the loop body, we have to make sure that the pointer to the current rule stays valid. Fixes issue #594
Libsolv
=======
This is libsolv, a free package dependency solver using a satisfiability
algorithm.
The code is based on two major, but independent, blocks:
1. Using a dictionary approach to store and retrieve package and
dependency information in a fast and space efficient manner.
2. Using satisfiability, a well known and researched topic, for
resolving package dependencies.
The sat-solver code has been written to aim for the newest packages,
record the decision tree to provide introspection, and also provides
the user with suggestions on how to deal with unsolvable
problems. It also takes advantage of repository storage to
minimize memory usage.
Supported package formats:
- rpm/rpm5
- deb
- arch linux
- haiku
- apk
Supported repository formats:
- rpmmd (primary, filelists, comps, deltainfo/presto, updateinfo)
- susetags, suse product formats
- mandriva/mageia (synthesis, info, files)
- arch linux
- red carpet helix format
- haiku
- apk
Build instructions
==================
Requires: cmake 3.5 or later
mkdir build
cd build
cmake ..
make
////
vim: syntax=asciidoc
////