summaryrefslogtreecommitdiff
path: root/apt-pkg/orderlist.cc
diff options
context:
space:
mode:
authorJulian Andres Klode <jak@debian.org>2022-01-05 16:37:11 +0000
committerJulian Andres Klode <jak@debian.org>2022-01-05 16:37:11 +0000
commit0ce8ea6f1920a700a088ab9815cf63197fcf4dfb (patch)
tree1b6bd910a7fbbe3dd8ce68732c626c3448a6cbf7 /apt-pkg/orderlist.cc
parenteac32564d294caf264cabb62c776444f973b111a (diff)
parent01eed4234440d82fc52c8186cf4268517bcd28bc (diff)
Merge branch 'spelling' into 'main'
Spelling fixes See merge request apt-team/apt!194
Diffstat (limited to 'apt-pkg/orderlist.cc')
-rw-r--r--apt-pkg/orderlist.cc4
1 files changed, 2 insertions, 2 deletions
diff --git a/apt-pkg/orderlist.cc b/apt-pkg/orderlist.cc
index 20631bfc1..49a3126b7 100644
--- a/apt-pkg/orderlist.cc
+++ b/apt-pkg/orderlist.cc
@@ -12,7 +12,7 @@
This is a modified version of Manoj's Routine B. It consists of four
independent ordering algorithms that can be applied at for different
- points in the ordering. By applying progressivly fewer ordering
+ points in the ordering. By applying progressively fewer ordering
operations it is possible to give each consideration it's own
priority and create an order that satisfies the lowest applicable
consideration.
@@ -563,7 +563,7 @@ bool pkgOrderList::VisitProvides(DepIterator D,bool Critical)
// ---------------------------------------------------------------------
/* This is the core ordering routine. It calls the set dependency
consideration functions which then potentially call this again. Finite
- depth is achieved through the colouring mechinism. */
+ depth is achieved through the colouring mechanism. */
bool pkgOrderList::VisitNode(PkgIterator Pkg, char const* from)
{
// Looping or irrelevant.