diff options
Diffstat (limited to 'apt-inst')
| -rw-r--r-- | apt-inst/CMakeLists.txt | 4 | ||||
| -rw-r--r-- | apt-inst/extract.cc | 2 | ||||
| -rw-r--r-- | apt-inst/filelist.cc | 2 | ||||
| -rw-r--r-- | apt-inst/filelist.h | 2 |
4 files changed, 6 insertions, 4 deletions
diff --git a/apt-inst/CMakeLists.txt b/apt-inst/CMakeLists.txt index f7578231a..31da115e4 100644 --- a/apt-inst/CMakeLists.txt +++ b/apt-inst/CMakeLists.txt @@ -6,7 +6,9 @@ set(MAJOR 2.0) set(MINOR 0) set(APT_INST_MAJOR ${MAJOR} PARENT_SCOPE) -# Definition of the C++ files used to build the library +# Definition of the C++ files used to build the library - note that this +# is expanded at CMake time, so you have to rerun cmake if you add or remove +# a file (you can just run cmake . in the build directory) file(GLOB_RECURSE library "*.cc") file(GLOB_RECURSE headers "*.h") 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. |