WebCore/CachedResourceClientWalker.h

   1 /*
   2     Copyright (C) 1998 Lars Knoll (knoll@mpi-hd.mpg.de)
   3     Copyright (C) 2001 Dirk Mueller <mueller@kde.org>
   4     Copyright (C) 2004, 2005, 2006, 2007 Apple Inc. All rights reserved.
   5
   6     This library is free software; you can redistribute it and/or
   7     modify it under the terms of the GNU Library General Public
   8     License as published by the Free Software Foundation; either
   9     version 2 of the License, or (at your option) any later version.
  10
  11     This library is distributed in the hope that it will be useful,
  12     but WITHOUT ANY WARRANTY; without even the implied warranty of
  13     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  14     Library General Public License for more details.
  15
  16     You should have received a copy of the GNU Library General Public License
  17     along with this library; see the file COPYING.LIB.  If not, write to
  18     the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
  19     Boston, MA 02110-1301, USA.
  20
  21     This class provides all functionality needed for loading images, style sheets and html
  22     pages from the web. It has a memory cache for these objects.
  23 */
  24
  25 #ifndef CachedResourceClientWalker_h
  26 #define CachedResourceClientWalker_h
  27
  28 #include <wtf/HashCountedSet.h>
  29 #include <wtf/Vector.h>
  30
  31 namespace WebCore {
  32
  33     class CachedResourceClient;
  34
  35     // Call this "walker" instead of iterator so people won't expect Qt or STL-style iterator interface.
  36     // Just keep calling next() on this. It's safe from deletions of items.
  37     class CachedResourceClientWalker {
  38     public:
  39         CachedResourceClientWalker(const HashCountedSet<CachedResourceClient*>&);
  40         CachedResourceClient* next();
  41     private:
  42         const HashCountedSet<CachedResourceClient*>& m_clientSet;
  43         Vector<CachedResourceClient*> m_clientVector;
  44         size_t m_index;
  45     };
  46
  47 }
  48
  49 #endif