refactor key removal code to reuse it in next step

[apt.git] / apt-inst / filelist.cc

diff --git a/apt-inst/filelist.cc b/apt-inst/filelist.cc
index ee8cbbf7385c0c0f6d5c3a41b45ed7ec9fd67597..4dbc4a2d70d4db1333a6c69392f3ef3874e5d075 100644 (file)
--- a/apt-inst/filelist.cc
+++ b/apt-inst/filelist.cc
@@ -1,18 +1,18 @@
 // -*- mode: cpp; mode: fold -*-
 // Description                                                         /*{{{*/
 // -*- mode: cpp; mode: fold -*-
 // Description                                                         /*{{{*/

-// $Id: filelist.cc,v 1.5 2004/01/07 20:39:37 mdz Exp $
+// $Id: filelist.cc,v 1.4.2.1 2004/01/16 18:58:50 mdz Exp $

 /* ######################################################################
 
    File Listing - Manages a Cache of File -> Package names.
 
 /* ######################################################################
 
    File Listing - Manages a Cache of File -> Package names.
 

-   Diversions add some signficant complexity to the system. To keep 
+   Diversions add some significant complexity to the system. To keep

    storage space down in the very special case of a diverted file no
    extra bytes are allocated in the Node structure. Instead a diversion
    is inserted directly into the hash table and its flag bit set. Every
    lookup for that filename will always return the diversion.
    
    The hash buckets are stored in sorted form, with diversions having 
    storage space down in the very special case of a diverted file no
    extra bytes are allocated in the Node structure. Instead a diversion
    is inserted directly into the hash table and its flag bit set. Every
    lookup for that filename will always return the diversion.
    
    The hash buckets are stored in sorted form, with diversions having 

-   the higest sort order. Identical files are assigned the same file
+   the highest sort order. Identical files are assigned the same file

    pointer, thus after a search all of the nodes owning that file can be
    found by iterating down the bucket.
    
    pointer, thus after a search all of the nodes owning that file can be
    found by iterating down the bucket.
    


@@ -32,17 +32,13 @@
    ##################################################################### */
                                                                        /*}}}*/
 // Include Files                                                       /*{{{*/
    ##################################################################### */
                                                                        /*}}}*/
 // Include Files                                                       /*{{{*/

-#ifdef __GNUG__
-#pragma implementation "apt-pkg/filelist.h"
-#endif
+#include<config.h>

 
 #include <apt-pkg/filelist.h>
 #include <apt-pkg/mmap.h>
 #include <apt-pkg/error.h>
 #include <apt-pkg/strutl.h>
 
 
 #include <apt-pkg/filelist.h>
 #include <apt-pkg/mmap.h>
 #include <apt-pkg/error.h>
 #include <apt-pkg/strutl.h>
 

-#include <stdio.h>
-#include <stdlib.h>

 #include <string.h>
 #include <iostream>
 #include <apti18n.h>
 #include <string.h>
 #include <iostream>
 #include <apti18n.h>


@@ -89,7 +85,7 @@ pkgFLCache::Header::Header()
 // FLCache::Header::CheckSizes - Check if the two headers have same *sz        /*{{{*/
 // ---------------------------------------------------------------------
 /* Compare to make sure we are matching versions */
 // FLCache::Header::CheckSizes - Check if the two headers have same *sz        /*{{{*/
 // ---------------------------------------------------------------------
 /* Compare to make sure we are matching versions */

-bool pkgFLCache::Header::CheckSizes(Header &Against) const
+APT_PURE bool pkgFLCache::Header::CheckSizes(Header &Against) const

 {
    if (HeaderSz == Against.HeaderSz &&
        NodeSz == Against.NodeSz &&
 {
    if (HeaderSz == Against.HeaderSz &&
        NodeSz == Against.NodeSz &&


@@ -357,7 +353,7 @@ pkgFLCache::NodeIterator pkgFLCache::GetNode(const char *Name,
 // ---------------------------------------------------------------------
 /* This is one of two hashing functions. The other is inlined into the
    GetNode routine. */
 // ---------------------------------------------------------------------
 /* This is one of two hashing functions. The other is inlined into the
    GetNode routine. */

-pkgFLCache::Node *pkgFLCache::HashNode(NodeIterator const &Nde)
+APT_PURE pkgFLCache::Node *pkgFLCache::HashNode(NodeIterator const &Nde)

 {
    // Hash the node
    unsigned long HashPos = 0;
 {
    // Hash the node
    unsigned long HashPos = 0;


@@ -465,7 +461,7 @@ bool pkgFLCache::AddDiversion(PkgIterator const &Owner,
    // Should never happen
    if ((FromN->Flags & Node::Diversion) != Node::Diversion ||
        (ToN->Flags & Node::Diversion) != Node::Diversion)
    // Should never happen
    if ((FromN->Flags & Node::Diversion) != Node::Diversion ||
        (ToN->Flags & Node::Diversion) != Node::Diversion)

-      return _error->Error(_("Internal Error in AddDiversion"));
+      return _error->Error(_("Internal error in AddDiversion"));

 
    // Now, try to reclaim an existing diversion..
    map_ptrloc Diver = 0;
 
    // Now, try to reclaim an existing diversion..
    map_ptrloc Diver = 0;


@@ -574,7 +570,7 @@ bool pkgFLCache::AddConfFile(const char *Name,const char *NameEnd,
 // ---------------------------------------------------------------------
 /* Since the package pointer is indirected in all sorts of interesting ways
    this is used to get a pointer to the owning package */
 // ---------------------------------------------------------------------
 /* Since the package pointer is indirected in all sorts of interesting ways
    this is used to get a pointer to the owning package */

-pkgFLCache::Package *pkgFLCache::NodeIterator::RealPackage() const
+APT_PURE pkgFLCache::Package *pkgFLCache::NodeIterator::RealPackage() const

 {
    if (Nde->Pointer == 0)
       return 0;
 {
    if (Nde->Pointer == 0)
       return 0;