diff options
author | David Kalnischkies <david@kalnischkies.de> | 2017-01-19 15:14:19 +0100 |
---|---|---|
committer | David Kalnischkies <david@kalnischkies.de> | 2017-01-19 15:59:38 +0100 |
commit | 93cff633a830e222693fc0f3d78e6e534d1126ee (patch) | |
tree | 2606a090e446e9b938e349b85aa62c3d8417c21c /apt-inst | |
parent | 99b1cdd3a07576542c8bda40d93368f3f76db912 (diff) |
fix various typos reported by spellintian
Most of them in (old) code comments. The two instances of user visible
string changes the po files of the manpages are fixed up as well.
Gbp-Dch: Ignore
Reported-By: spellintian
Diffstat (limited to 'apt-inst')
-rw-r--r-- | apt-inst/extract.cc | 2 | ||||
-rw-r--r-- | apt-inst/filelist.cc | 2 | ||||
-rw-r--r-- | apt-inst/filelist.h | 2 |
3 files changed, 3 insertions, 3 deletions
diff --git a/apt-inst/extract.cc b/apt-inst/extract.cc index 5d42adf87..f50c23e46 100644 --- a/apt-inst/extract.cc +++ b/apt-inst/extract.cc @@ -37,7 +37,7 @@ is invoked. As we unpack we record the file list differences in the FL cache. If - we need to unroll the the FL cache knows which files have been unpacked + we need to unroll the FL cache knows which files have been unpacked and can undo. When we need to erase then it knows which files have not been unpacked. diff --git a/apt-inst/filelist.cc b/apt-inst/filelist.cc index a55416d6b..6251b79b5 100644 --- a/apt-inst/filelist.cc +++ b/apt-inst/filelist.cc @@ -195,7 +195,7 @@ map_ptrloc pkgFLCache::TreeLookup(map_ptrloc *Base,const char *Text, /*}}}*/ // FLCache::PrintTree - Print out a tree /*{{{*/ // --------------------------------------------------------------------- -/* This is a simple generic tree dumper, ment for debugging. */ +/* This is a simple generic tree dumper, meant for debugging. */ void pkgFLCache::PrintTree(map_ptrloc Base,unsigned long Size) { if (Base == 0) diff --git a/apt-inst/filelist.h b/apt-inst/filelist.h index 8c4891bcf..5d5327f6c 100644 --- a/apt-inst/filelist.h +++ b/apt-inst/filelist.h @@ -12,7 +12,7 @@ The storage content of the class is maintained in a memory map and is written directly to the file system. Performance is traded against space to give something that performs well and remains small. - The average per file usage is 32 bytes which yeilds about a meg every + The average per file usage is 32 bytes which yields about a meg every 36k files. Directory paths are collected into a binary tree and stored only once, this offsets the cost of the hash nodes enough to keep memory usage slightly less than the sum of the filenames. |