diff options
| author | Ville Skyttä <ville.skytta@iki.fi> | 2021-11-04 00:08:07 +0200 |
|---|---|---|
| committer | Ville Skyttä <ville.skytta@iki.fi> | 2021-11-27 12:22:38 +0200 |
| commit | 01eed4234440d82fc52c8186cf4268517bcd28bc (patch) | |
| tree | 0a21bc964c35024494df59a1ee186520b61ca6eb /apt-pkg/orderlist.cc | |
| parent | 2662f6f255a2f1fee25632dc7666d4153bf5248c (diff) | |
Spelling fixes
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 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. |