diff options
author | David Kalnischkies <david@kalnischkies.de> | 2018-08-29 17:01:25 +0200 |
---|---|---|
committer | David Kalnischkies <david@kalnischkies.de> | 2018-08-29 17:51:43 +0200 |
commit | c4862d49bbc30c37f4fca966ac515692e26d93be (patch) | |
tree | 59d3fdd94fa88eb80ff929ab10e85020a35914c5 /apt-pkg/orderlist.cc | |
parent | 55585d0f93de1a0e60858e594b1b3b46f4a0831f (diff) |
Fix typos reported by codespell & spellintian
No user-visible change as it effects mostly code comments and
not a single error message, manpage or similar.
Reported-By: codespell & spellintian
Gbp-Dch: Ignore
Diffstat (limited to 'apt-pkg/orderlist.cc')
-rw-r--r-- | apt-pkg/orderlist.cc | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/apt-pkg/orderlist.cc b/apt-pkg/orderlist.cc index 670b5e2bd..a826f2853 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 appling progressivly fewer ordering + points in the ordering. By applying progressivly fewer ordering operations it is possible to give each consideration it's own priority and create an order that satisfies the lowest applicable consideration. @@ -562,7 +562,7 @@ bool pkgOrderList::VisitProvides(DepIterator D,bool Critical) // OrderList::VisitNode - Recursive ordering director /*{{{*/ // --------------------------------------------------------------------- /* This is the core ordering routine. It calls the set dependency - consideration functions which then potentialy call this again. Finite + consideration functions which then potentially call this again. Finite depth is achieved through the colouring mechinism. */ bool pkgOrderList::VisitNode(PkgIterator Pkg, char const* from) { |