Re: apt-get install sysvinit-core removes gnome?
On Sun Oct 19, 2014 09:32:54AM +0200, Matthias Urlichs wrote: > David Kalnischkies: > > Selecting one package in an or-group is a grand example of people not > > understand their tools although the policy is simple and logic: If it > > isn't impossible to let it win, the first alternative wins. If the > > package manager would go for any heuristic based on simplicity of > > installation instead everyone would have lsb-invalid-mta as MTA because > > that is damn easy to install by any standard. Maintainers are very > > heavily relying on this property while e.g. building packages. > > You don't have to drop that part of its logic. Choosing a different package > as a dependency should of course be a "last resort" action (i.e. be heavily > penalized). I'm not talking about changing that. I'm talking about the fact > that aptitude treats upgrading to a slightly-lower-prioritized version of a > package as a *way* worse solution than removing that package (and/or 500 > others). > > Basically, this boils down to the fact that people shouldn't have to read a > manpage about a complex priority scheme in an equally-complex resolver. > All I want is for aptitude to behave in a sane way by default. I think it's time to use apt-cudf. On a standard sid installation with gnome, it could perfectly resolve this situation: % apt-get -s --solver aspcud install sysvinit-core Reading package lists... Done Building dependency tree Reading state information... Done Execute external solver... Done The following extra packages will be installed: cgmanager libcgmanager0 libnih-dbus1 libnih1 systemd-shim The following packages will be REMOVED: systemd-sysv The following NEW packages will be installed: cgmanager libcgmanager0 libnih-dbus1 libnih1 systemd-shim sysvinit-core 0 upgraded, 6 newly installed, 1 to remove and 0 not upgraded. Compare with apt-get without aspcud: % sudo apt-get -s install sysvinit-core Reading package lists... Done Building dependency tree Reading state information... Done The following package was automatically installed and is no longer required: linux-image-amd64 Use 'apt-get autoremove' to remove it. The following extra packages will be installed: cgmanager libcgmanager0 libnih-dbus1 libnih1 systemd-shim The following packages will be REMOVED: aptdaemon brasero colord gdm3 gnome gnome-bluetooth gnome-color-manager gnome-control-center gnome-core gnome-disk-utility gnome-packagekit gnome-packagekit-session gnome-session gnome-settings-daemon gnome-shell gnome-shell-extensions gnome-sushi gnome-system-log gnome-user-share gvfs gvfs-backends gvfs-daemons gvfs-fuse libpam-systemd nautilus nautilus-sendto network-manager network-manager-gnome packagekit packagekit-tools policykit-1 policykit-1-gnome systemd-sysv task-gnome-desktop udisks2 The following NEW packages will be installed: cgmanager libcgmanager0 libnih-dbus1 libnih1 systemd-shim sysvinit-core 0 upgraded, 6 newly installed, 35 to remove and 0 not upgraded. Best, TK -- To UNSUBSCRIBE, email to debian-devel-requ...@lists.debian.org with a subject of "unsubscribe". Trouble? Contact listmas...@lists.debian.org Archive: https://lists.debian.org/20141019090313.ga29...@kr.tuwien.ac.at
Re: Boost defaults change (1.46.1 --> 1.48)
Hi! On Tue Dec 27, 2011 10:42:07AM +0100, Rene Engelhard wrote: > > I'd like to point out that any resulting build failures are quite easy > > to fix: either > > (a) contact package upstream for boost 1.48 changes; or > > It is? #652681 doesn't look like it. > Will 1.46 be around long enough that reverting to 1.46 is an option there? > The wheezy release should be with 3.5.0.. As long as something depends on 1.46, I assume that it should be around. The current situation is sub-optimal, because almost everything depends on the non-versioned boost libs of boost-defaults, despite boost's tendency to break packages when switching to a new version. The question is, which strategy is better? (1) Clearly record the dependencies in packages that depend on boost, i.e., Build-Depends on libboost-foo1.46-dev instead of libboost-foo-dev, or (2) let boost-defaults decide which version of boost is the currently stable boost. IMHO (2) just hides FTBSes of the packages. Cheers, TK -- Thomas Krennwallner University assistant . TU Wien - Vienna University of Technology Institute of Information Systems Favoritenstrasse 9-11, 1040 Wien, Austria . T: +43 1 58801 18469 F: +43 1 58801 918469 tkren AT kr DOT tuwien DOT ac DOT at http://www.kr.tuwien.ac.at/staff/tkren/ . DVR: 0005886 -- To UNSUBSCRIBE, email to debian-devel-requ...@lists.debian.org with a subject of "unsubscribe". Trouble? Contact listmas...@lists.debian.org Archive: http://lists.debian.org/20111227102814.ga15...@kr.tuwien.ac.at
Bug#639363: ITP: depqbf -- solver for quantified boolean formulae
Package: wnpp Severity: wishlist Owner: Thomas Krennwallner * Package name: depqbf Version : 0.1 Upstream Author : Florian Lonsing * URL : http://fmv.jku.at/depqbf/ * License : GPL Programming Lang: C Description : solver for quantified boolean formulae DepQBF is a search-based solver for quantified boolean formulae (QBF) in prenex conjunctive normal form. It is based on the DPLL algorithm for QBF with conflict-driven clause and solution-driven cube learning. By analyzing the structure of a formula, DepQBF tries to identify independent variables. In addition to other benefits, this often increases freedom for decision making. -- To UNSUBSCRIBE, email to debian-devel-requ...@lists.debian.org with a subject of "unsubscribe". Trouble? Contact listmas...@lists.debian.org Archive: http://lists.debian.org/20110826114256.ga7...@debian.lan
Bug#616651: ITP: bool2cnf -- tool for converting a boolean formula into CNF
Package: wnpp Severity: wishlist Owner: Thomas Krennwallner * Package name: bool2cnf Version : 20110304 Upstream Author : Tatsuhiro Tsuchiya * URL : http://www-ise4.ist.osaka-u.ac.jp/~t-tutiya/sources/bool2cnf/ * License : BSD Programming Lang: C Description : tool for converting a boolean formula into CNF Given a Boolean formula, this tool constructs a Boolean formula in CNF that is satisfiable iff so is the given formula. The output CNF formula is in DIMACS format. -- To UNSUBSCRIBE, email to debian-devel-requ...@lists.debian.org with a subject of "unsubscribe". Trouble? Contact listmas...@lists.debian.org Archive: http://lists.debian.org/20110306100419.19197.85095.report...@gluck.kr.tuwien.ac.at
Bug#613986: ITP: run -- tool for sampling time and memory usage
Package: wnpp Severity: wishlist Owner: Thomas Krennwallner * Package name: run Version : 1.4 Upstream Author : Armin Biere and Toni Jussila * URL : http://fmv.jku.at/run/ * License : BSD Programming Lang: C Description : tool for sampling time and memory usage run is a tool for sampling time and memory usage of a program and its children using the proc file system of Linux. Time and space limits are also supported. It is very helpful for benchmarking and running competitions. It also supports limits on wall clock time and thus can control runs of multi-threaded programs on multi-core machines as well. -- To UNSUBSCRIBE, email to debian-devel-requ...@lists.debian.org with a subject of "unsubscribe". Trouble? Contact listmas...@lists.debian.org Archive: http://lists.debian.org/20110218173058.18570.38703.report...@gluck.kr.tuwien.ac.at
Bug#605881: ITP: coala -- translates action languages into answer set programs
Package: wnpp Severity: wishlist Owner: Thomas Krennwallner * Package name: coala Version : 1.0.1 Upstream Author : Torsten Grote * URL : http://www.cs.uni-potsdam.de/~tgrote/coala/ * License : GPL Programming Lang: C++ Description : translates action languages into answer set programs The coala tool translates an action language into a logic program under the answer set semantics. After being grounded by lparse or gringo, the logic program can be solved by an answer set solver such as clasp. At the moment coala is able to translate the action language AL, B, C, a subset of C+ and the action language CTAID. The type of input language can be specified with a command line option. -- To UNSUBSCRIBE, email to debian-devel-requ...@lists.debian.org with a subject of "unsubscribe". Trouble? Contact listmas...@lists.debian.org Archive: http://lists.debian.org/20101204110640.15298.56534.report...@gluck.kr.tuwien.ac.at
Bug#605879: ITP: gringo -- An lparse-compatible grounder for (disjunctive) logic programs
Package: wnpp Severity: wishlist Owner: Thomas Krennwallner * Package name: gringo Version : 3.0.3 Upstream Author : Potassco team * URL : http://www.cs.uni-potsdam.de/gringo/ * License : GPL Programming Lang: C++ Description : An lparse-compatible grounder for (disjunctive) logic programs Current answer set solvers work on variable-free programs. Hence, a grounder is needed that, given an input program with first-order variables, computes an equivalent ground (variable-free) program. Gringo is such a grounder. Its output can be processed further with clasp, claspD, claspar, or claspfolio. -- To UNSUBSCRIBE, email to debian-devel-requ...@lists.debian.org with a subject of "unsubscribe". Trouble? Contact listmas...@lists.debian.org Archive: http://lists.debian.org/20101204105916.15165.7213.report...@gluck.kr.tuwien.ac.at
Bug#605877: ITP: clasp -- A conflict-driven nogood learning answer set solver
Package: wnpp Severity: wishlist Owner: Thomas Krennwallner * Package name: clasp Version : 1.3.6 Upstream Author : Benjamin Kaufmann * URL : http://www.cs.uni-potsdam.de/clasp/ * License : GPL Programming Lang: C++ Description : A conflict-driven nogood learning answer set solver clasp is an answer set solver for (extended) normal logic programs. It combines the high-level modeling capacities of answer set programming (ASP) with state-of-the-art techniques from the area of Boolean constraint solving. The primary clasp algorithm relies on conflict-driven nogood learning, a technique that proved very successful for satisfiability checking (SAT). Unlike other learning ASP solvers, clasp does not rely on legacy software, such as a SAT solver or any other existing ASP solver. Rather, clasp has been genuinely developed for answer set solving based on conflict-driven nogood learning. clasp can be applied as an ASP solver (on SMODELS format, as output by Gringo), as a SAT solver (on a simplified version of DIMACS/CNF format), or as a PB solver (on OPB format). -- To UNSUBSCRIBE, email to debian-devel-requ...@lists.debian.org with a subject of "unsubscribe". Trouble? Contact listmas...@lists.debian.org Archive: http://lists.debian.org/20101204103103.15124.48401.report...@gluck.kr.tuwien.ac.at
