apk-tools - Adélie Linux patches for Alpine Package Keeper (apk-tools)

Age	Commit message (Collapse)	Author	Files	Lines
2012-02-29	solver, test: make conflicts unconditional	Timo Teräs	1	-2/+1
	Solver will now never report partial solution where a conflict constraint is not satisfied. The is because with --force we might install the partial solution; and if conflicted packages were to be installed we might have extra trouble.
2012-02-21	solver: implement backwards jumping and various other optimizations	Timo Teräs	1	-0/+1

2011-10-24	solver, pkg: implement versioned conflicts	Timo Teräs	1	-1/+0
	One can now say in dependency "!foo<2" which means, that if foo is installed, it needs to be >=2, but it's not a required dependency.
2011-09-13	all: update copyright year statement	Timo Teräs	1	-1/+1

2011-01-01	pkg: dependencies to specific package checksum	Timo Teräs	1	-0/+5
	When package is installed from commandline, we should always install that specific instance of package (never favor repository version if it has difference identity). Otherwise we might not always end-up installing the .apk given on command line. The dependency is now against specific checksum identity (marked with >< dependency comparison). Fixes #492.
2009-06-22	version: added apk_version_compare_blob() function	Natanael Copa	1	-0/+1
	We want be able to compare blobs so we basicly revert the old change, and make a wrapper that takes version strings.
2009-06-20	ver: only compare the given packages, show version	Natanael Copa	1	-1/+1
	make apk_version_compare() take strings rather than blobs add apk_pkgversion_compare(), a wrapper that takes packages
2009-06-16	add: support for forced versions	Natanael Copa	1	-0/+1
	Support version numbers specified with packages. For example: apk add 'busybox<1.14' apk add 'squid=>3.0'
2009-04-16	pkg: clean up writing of dependencies	Timo Teras	1	-0/+1

2009-04-14	state: rework changeset calculation algorithm	Timo Teras	1	-5/+3
	Calculate changesets directly by stabilizating the package graph instead of recalculating the whole graph and then diffing (similar approach as seen in 'smart' package manager). The algorithm is not complete: defferred search space forking is missing. So you don't always get a solution on complex graphs. Benefits: - usually the search state tree is smaller (less memory used) - speed relational to changeset size, not database size (usually faster) - touch only packages related to users request (can work on partitially broken state; upgrades only necessary packages, fixes #7) Also implemented: - command prompt to confirm operation if packages are deleted or downgraded - requesting deletion of package suggests removal of all packages depending on the package being removed (you'll get list of packages that also get removed if you want package X removed) - option --simulate to see what would have been done (mainly for testing) - an untested implementation of versioned dependencies and conflicts A lot has changed, so expect new bugs too.
2008-04-17	Initial commit of some stuff written so far. Still in state of flux. Expect	Timo Teras	1	-0/+26
	breakage and major changes.