Symbian^3 Application Developer Library >

RHashSet Class Reference

class RHashSet : public RHashTableBase

A templated class which implements an unordered extensional set of objects of type T using a probe-sequence hash table. The objects are copied into the set when they are added. A bitwise binary copy is used here, so the type T must not implement a nontrivial copy constructor.

Inherits from

Nested Classes and Structures

Public Member Functions
RHashSet (const THashFunction32 < T > &, const TIdentityRelation < T > &)
RHashSet ()
void Close ()
TInt Count ()
const T * Find (const T &)
T * Find (const T &)
const T & FindL (const T &)
T & FindL (const T &)
TInt Insert (const T &)
void InsertL (const T &)
TInt Remove (const T &)
TInt Reserve ( TInt )
void ReserveL ( TInt )
Inherited Functions
RHashTableBase::ConsistencyCheck(TUint32 *,TUint32 *,TUint32,TUint32 *)
RHashTableBase::Find(const TAny *,TInt)const
RHashTableBase::FindL(const TAny *,TInt)const
RHashTableBase::Insert(const TAny *,TAny *&)
RHashTableBase::PtrInsert(const TAny *,const TAny *)
RHashTableBase::PtrInsertL(const TAny *,const TAny *)
RHashTableBase::RHashTableBase(TGeneralHashFunction32,TGeneralIdentityRelation,TInt,TInt)
RHashTableBase::Remove(const TAny *)
RHashTableBase::ValueInsert(const TAny *,TInt,const TAny *,TInt,TInt)
RHashTableBase::ValueInsertL(const TAny *,TInt,const TAny *,TInt,TInt)
Inherited Enumerations
RHashTableBase:TDefaultSpecifier
RHashTableBase:TElementState
Public Member Type Definitions
typedef THashSetIter < T > TIter

Constructor & Destructor Documentation

RHashSet(const THashFunction32< T > &, const TIdentityRelation< T > &)

RHashSet ( const THashFunction32 < T > & aHash,
const TIdentityRelation < T > & aIdentity
) [inline]

Construct a set of objects of type T using a specified hash function and identity relation. The set is initially empty.

Parameters

const THashFunction32 < T > & aHash The hash function used to hash the objects of type T.
const TIdentityRelation < T > & aIdentity The identity relation used to determine if two objects of type T should be considered identical.

RHashSet()

RHashSet ( ) [inline]

Construct a set of objects of type T using a default hash function and identity relation. The set is initially empty.

Member Functions Documentation

Close()

void Close ( ) [inline]

Free all memory used by this set. Returns the set to the same state it had following construction.

Count()

TInt Count ( ) const [inline]

Query the number of elements in the set.

Find(const T &)

const T * Find ( const T & aKey ) const [inline]

Locate a specified element in the set.

Parameters

const T & aKey The object of type T to search for.

Find(const T &)

T * Find ( const T & aKey ) [inline]

Locate a specified element in the set.

Parameters

const T & aKey The object of type T to search for.

FindL(const T &)

const T & FindL ( const T & aKey ) const [inline]

Locate a specified element in the set.

leave
KErrNotFound if the specified object is not a member of this set.

Parameters

const T & aKey The object of type T to search for.

FindL(const T &)

T & FindL ( const T & aKey ) [inline]

Locate a specified element in the set.

leave
KErrNotFound if the specified object is not a member of this set.

Parameters

const T & aKey The object of type T to search for.

Insert(const T &)

TInt Insert ( const T & aKey ) [inline]

Insert an element into the set.

If the specified object is not currently a member of the set, a copy of the object is added to the set and KErrNone is returned. If the specified object is currently a member of the set, the existing copy of the object is replaced by the provided object and KErrNone is returned. In both cases the object is copied bitwise into the set.

Parameters

const T & aKey The object of type T to add to the set.

InsertL(const T &)

void InsertL ( const T & aKey ) [inline]

Insert an element into the set.

If the specified object is not currently a member of the set, a copy of the object is added to the set and KErrNone is returned. If the specified object is currently a member of the set, the existing copy of the object is replaced by the provided object and KErrNone is returned. In both cases the object is copied bitwise into the set.

leave
KErrNoMemory if memory could not be allocated to store the copy of aKey.

Parameters

const T & aKey The object of type T to add to the set.

Remove(const T &)

TInt Remove ( const T & aKey ) [inline]

Remove an element from the set.

Parameters

const T & aKey The object to be removed.

Reserve(TInt)

TInt Reserve ( TInt aCount ) [inline]

Expand the set to accommodate a specified number of elements. If the set already has enough space for the specified number of elements, no action is taken. Any elements already in the set are retained.

Parameters

TInt aCount The number of elements for which space should be allocated.

ReserveL(TInt)

void ReserveL ( TInt aCount ) [inline]

Expand the set to accommodate a specified number of elements. If the set already has enough space for the specified number of elements, no action is taken. Any elements already in the set are retained.

leave
KErrNoMemory if sufficient memory could not be allocated.

Parameters

TInt aCount The number of elements for which space should be allocated.

Member Type Definitions Documentation

Typedef TIter

typedef THashSetIter < T > TIter

A class which allows iteration over the elements of a RHashSet<T> class.

The set being iterated over may not be modified while an iteration is in progress or the iteration operations may malfunction or panic.

THashSetIter<T>

Copyright ©2010 Nokia Corporation and/or its subsidiary(-ies).
All rights reserved. Unless otherwise stated, these materials are provided under the terms of the Eclipse Public License v1.0.