/usr/include/sipxtapi/utl/UtlHashBagIterator.h is in libsipxtapi-dev 3.3.0~test17-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 | //
// Copyright (C) 2004-2006 SIPfoundry Inc.
// Licensed by SIPfoundry under the LGPL license.
//
// Copyright (C) 2004-2006 Pingtel Corp. All rights reserved.
// Licensed to SIPfoundry under a Contributor Agreement.
//
// $$
///////////////////////////////////////////////////////////////////////////////
#ifndef _UtlHashBagIterator_h_
#define _UtlHashBagIterator_h_
// SYSTEM INCLUDES
// APPLICATION INCLUDES
#include "utl/UtlDefs.h"
#include "utl/UtlIterator.h"
#include "utl/UtlHashBag.h"
// DEFINES
// MACROS
// EXTERNAL FUNCTIONS
// EXTERNAL VARIABLES
// CONSTANTS
// STRUCTS
// TYPEDEFS
// FORWARD DECLARATIONS
class UtlContainable ;
/**
* UtlHashBagIterator allows developers to iterator (walks through) an
* UtlHashBag.
*
* @see UtlIterator
* @see UtlSList
*/
class UtlHashBagIterator : public UtlIterator
{
/* //////////////////////////// PUBLIC //////////////////////////////////// */
public:
/* ============================ CREATORS ================================== */
/**
* Construct an iterator over all objects in a given UtlHashBag
* If key is specified, iterate only over objects that match that key
* (UtlHashBags may have any number of copies of a given object)
*/
UtlHashBagIterator(const UtlHashBag& hashBag, UtlContainable* key = NULL);
/**
* Destructor
*/
virtual ~UtlHashBagIterator();
/* ============================ MANIPULATORS ============================== */
/**
* Return the next element.
*
* @return The next element or NULL if no more elements are available.
*/
virtual UtlContainable* operator()() ;
/**
* Reset the list by moving the iterator cursor to the location before the
* first element.
*/
virtual void reset() ;
/* ============================ ACCESSORS ================================= */
/**
* Gets the key of the current element
*/
UtlContainable* key() const ;
/* ============================ INQUIRY =================================== */
/* //////////////////////////// PROTECTED ///////////////////////////////// */
protected:
friend class UtlHashBag;
/**
* removing is called by the UtlHashMap when an element is about to be
* removed from the container. The iterator must ensure that the element
* for the removed node is not returned by any subsequent call.
*/
virtual void removing(const UtlLink* node);
/* //////////////////////////// PRIVATE /////////////////////////////////// */
private:
void init(const UtlHashBag& hashBag);
UtlContainable* mpSubsetMatch; ///< if non-NULL, points to the key that defines the subset
unsigned mSubsetHash; ///< if mpSubsetMatch != NULL, this is its hash code
size_t mPosition; ///< current bucket number [0..numberOfBuckets-1]
UtlLink* mpCurrentLink; ///< current UtlLink within the bucket, or BEFORE_FIRST
bool mLinkIsValid; /**< true if mpCurrentLink is the valid current position
* The only time this is false is when the UtlContainable
* at the current position was removed while it was current. */
// no copy constructor
UtlHashBagIterator(UtlHashBagIterator&);
} ;
/* ============================ INLINE METHODS ============================ */
#endif // _UtlHashBagIterator_h_
|