carray.h

来自「Amarok是一款在LINUX或其他类UNIX操作系统中运行的音频播放器软件。 」· C头文件 代码 · 共 359 行

/*
 *
 * This software is released under the provisions of the GPL version 2.
 * see file "COPYING".  If that file is not available, the full statement 
 * of the license can be found at
 *
 * http://www.fsf.org/licensing/licenses/gpl.txt
 *
 * Portions Copyright (c) 1995-2004 RealNetworks, Inc. All Rights Reserved.
 *
 */

#ifndef CARRAY_H_
#define CARRAY_H_

#include "hxcom.h"
#include "hxassert.h"

class HXEXPORT_CLASS CHXPtrArray {
public:
    CHXPtrArray();
    ~CHXPtrArray();

                                // return num elements == 0
    HXBOOL IsEmpty() const;
                                // return number of elements
    int GetSize() const;
                                // return largest index
    int GetUpperBound() const;
                                // set size and grow by size
    void SetSize(int nelems, int growSize=-1);


                                // free un-assigned slots
    void FreeExtra();
                                // free the entire array
    void RemoveAll();
                                // return the value at the given index
    void* GetAt(int index) const;
                                // set the value at the given index
    void SetAt(int index, void* value);
                                // return reference to value at given index
    void*& ElementAt(int index);
                                // set value, grow array if needed
    void SetAtGrow(int index, void* value);
                                // add the element, ret index of added element
    int Add(void* value);
                                // append another array
    void Append(const CHXPtrArray& other);

                                // add the element if not already in array
    HXBOOL AddIfUnique(void* value);
                                // same as GetAt()
    void* operator[](int index) const;
                                // same as ElementAt()
    void*& operator[](int index);

                                // insert value at index
    void InsertAt(int index, void* value, int repeat=1);
                                // insert array at index
    void InsertAt(int index, CHXPtrArray* pPtrArray);
                                // remove value(s) at index
    void RemoveAt(int index, int repeat=1);

                                // search for value in array
    inline HXBOOL Find(void* value, int* index=NULL);
                                // search for and remove first occurrence
    HXBOOL FindAndRemoveOne(void* value);
                                // search for and remove all occurrences
    HXBOOL FindAndRemoveAll(void* value);

    class Iterator 
    {
        friend class CHXPtrArray;
    public:
	    Iterator();
	    Iterator& operator++();
	    HXBOOL operator==(const Iterator& iter) const;
	    HXBOOL operator!=(const Iterator& iter) const;
	    void* operator*();

    private:
	    Iterator(CHXPtrArray* pArray, int idx);

	    CHXPtrArray* m_pArray;
	    int m_idx;
    };

    Iterator Begin();
    Iterator End();

private:
                                // not implemented
    CHXPtrArray(const CHXPtrArray&);
                                // not implemented
    void operator=(const CHXPtrArray&);

                                // resize the array to given size
    void Resize(int size);
                                // get the size to grow array by
    int GetGrowSize(int newSize);
                                // common code for insertions
    void InsertCommon(int index, int len);


                                // total slots allocated
    int m_size;
                                // number of elements in array
    int m_nelems;
                                // use set grow size for resizing ops
    int m_userGrowSize;
                                // default grow size if user does not set
    int m_defGrowSize;
                                // data array
    void** m_pData;

};

///
/// IsEmpty() const
///
/// return num elements == 0
///
inline HXBOOL
CHXPtrArray::IsEmpty() const
{
    return m_nelems == 0;
}

///
/// GetSize() const
///
/// return size of the array
///
inline int
CHXPtrArray::GetSize() const
{
    return m_nelems;
}

///
/// GetUpperBound() const
///
/// return largest index
///
inline int
CHXPtrArray::GetUpperBound() const
{
    return m_nelems - 1;
}

///
/// GetAt(int index) const
///
/// return the value at the given index
///
inline void*
CHXPtrArray::GetAt(int index) const
{
    HX_ASSERT(index >= 0 && index < m_nelems);
    return m_pData[index];
}

///
/// SetAt(int index, void* value)
///
/// set the value at the given index
///
inline void
CHXPtrArray::SetAt(int index, void* value)
{
    HX_ASSERT(index >= 0 && index < m_nelems);
    m_pData[index] = value;
}

///
/// ElementAt(int index)
///
/// return reference to value at given index
///
inline void*&
CHXPtrArray::ElementAt(int index)
{
    HX_ASSERT(index >= 0 && index < m_nelems);
    return m_pData[index];
}

///
/// Add(void* value)
///
/// append the element to the array
///
inline int
CHXPtrArray::Add(void* value)
{
    int ret = m_nelems;
    SetAtGrow(m_nelems, value);
    return ret;
}

///
/// void* operator[]
///
/// same as GetAt()
///
inline void*
CHXPtrArray::operator[] (int index) const
{
    return GetAt(index);
}

///
/// void*& operator[]
///
/// same as ElementAt()
///
inline void*&
CHXPtrArray::operator[] (int index)
{
    return ElementAt(index);
}

///
/// AddIfUnique(void* value)
///
/// add the element if not already in array
///
inline HXBOOL
CHXPtrArray::AddIfUnique(void* value)
{
    int index;
    if (Find(value, &index)) return FALSE;
    Add(value);
    return TRUE;
}

///
/// Find(void* value, int* index=NULL)
///
/// search for value in array
///
inline HXBOOL
CHXPtrArray::Find(void* value, int* index)
{
    int i = 0;
    for (void** cur = m_pData; i < m_nelems; ++i, ++cur)
    {
        if (*cur == value)
        {
            if (index) *index = i;
            return TRUE;
        }
    }
    return FALSE;
}

///
/// FindAndRemoveOne(void* value)
///
/// search for and remove first occurrence
///
inline HXBOOL
CHXPtrArray::FindAndRemoveOne(void* value)
{
    int index = -1;
    if (Find(value, &index) && index >= 0)
    {
        RemoveAt(index, 1);
        return TRUE;
    }
    return FALSE;
}

///
/// FindAndRemoveAll(void* value)
///
/// search for and remove all occurrences
///
inline HXBOOL
CHXPtrArray::FindAndRemoveAll(void* value)
{
    void** src = m_pData;
    void** dest = m_pData;

    for (int i = 0; i < m_nelems; ++i, ++src)
        if (value == *src) *dest++ = *src;

    if (src != dest)
    {
        SetSize(dest - m_pData);
        return TRUE;
    }

    return FALSE;
}

inline CHXPtrArray::Iterator 
CHXPtrArray::Begin()
{
    return Iterator(this, 0);
}

inline CHXPtrArray::Iterator 
CHXPtrArray::End()
{
    return Iterator(this, GetSize());
}

///
/// CHXPtrArray::Iterator methods
///
inline 	
CHXPtrArray::Iterator::Iterator()
    : m_pArray(0),
      m_idx(0)
{
}

inline 	
CHXPtrArray::Iterator::Iterator(CHXPtrArray* pArray, int idx)
    : m_pArray(pArray),
      m_idx(idx)
{
}

inline CHXPtrArray::Iterator& 
CHXPtrArray::Iterator::operator++()
{
    HX_ASSERT(m_pArray);
    HX_ASSERT(!m_pArray->IsEmpty());
    HX_ASSERT(m_idx < m_pArray->GetSize());
    ++m_idx;
    return *this;
}

inline HXBOOL 
CHXPtrArray::Iterator::operator==(const Iterator& iter) const
{
    return m_pArray == iter.m_pArray && m_idx == iter.m_idx;
}

inline HXBOOL 
CHXPtrArray::Iterator::operator!=(const Iterator& iter) const
{
    return !operator==(iter);
}

inline void* 
CHXPtrArray::Iterator::operator*()
{
    HX_ASSERT(m_pArray);
    HX_ASSERT(!m_pArray->IsEmpty());
    HX_ASSERT(m_idx < m_pArray->GetSize());
    return m_pArray->GetAt(m_idx);
}

#endif /* CARRAY_H_ */