QInt64Set Class Reference

Public Functions
void	clear ()
bool	contains (quint64 key) const
void	insert (quint64 key)
bool	isValid () const
	QInt64Set (int capacity=64)
	~QInt64Set ()

Private Functions
bool	rehash (int capacity)

Properties
quint64 *	m_array
int	m_capacity
int	m_count

Static Private Attributes
static const quint64	UNUSED = quint64(-1)

Detailed Description

Definition at line 1137 of file qtriangulator.cpp.

Constructors and Destructors

QInt64Set()

QInt64Set::QInt64Set ( int  capacity = 64 )

inline

Definition at line 1158 of file qtriangulator.cpp.

{
    m_capacity = primeForCount(capacity);
    m_array = new quint64[m_capacity];
    if (m_array)
        clear();
    else
        m_capacity = 0;
}

~QInt64Set()

QInt64Set::~QInt64Set ( )

inline

Definition at line 1141 of file qtriangulator.cpp.

{if (m_array) delete[] m_array;}

Functions

clear()

void QInt64Set::clear ( )

inline

Definition at line 1229 of file qtriangulator.cpp.

{
    Q_ASSERT_X(m_array, "QInt64Hash<T>::clear", "Hash set not allocated.");
    for (int i = 0; i < m_capacity; ++i)
        m_array[i] = UNUSED;
    m_count = 0;
}

contains()

bool QInt64Set::contains

(

quint64

key

)

const

Definition at line 1213 of file qtriangulator.cpp.

{
    Q_ASSERT_X(m_array, "QInt64Hash<T>::contains", "Hash set not allocated.");
    int index = int(key % m_capacity);
    for (int i = 0; i < m_capacity; ++i) {
        index += i;
        if (index >= m_capacity)
            index -= m_capacity;
        if (m_array[index] == key)
            return true;
        if (m_array[index] == UNUSED)
            return false;
    }
    return false;
}

insert()

void QInt64Set::insert

(

quint64

key

)

Definition at line 1192 of file qtriangulator.cpp.

{
    if (m_count > 3 * m_capacity / 4)
        rehash(primeForCount(2 * m_capacity));
    Q_ASSERT_X(m_array, "QInt64Hash<T>::insert", "Hash set not allocated.");
    int index = int(key % m_capacity);
    for (int i = 0; i < m_capacity; ++i) {
        index += i;
        if (index >= m_capacity)
            index -= m_capacity;
        if (m_array[index] == key)
            return;
        if (m_array[index] == UNUSED) {
            ++m_count;
            m_array[index] = key;
            return;
        }
    }
    Q_ASSERT_X(0, "QInt64Hash<T>::insert", "Hash set full.");
}

isValid()

bool QInt64Set::isValid ( ) const

inline

Definition at line 1142 of file qtriangulator.cpp.

{return m_array;}

rehash()

bool QInt64Set::rehash ( int  capacity )

private

Definition at line 1168 of file qtriangulator.cpp.

{
    quint64 *oldArray = m_array;
    int oldCapacity = m_capacity;

    m_capacity = capacity;
    m_array = new quint64[m_capacity];
    if (m_array) {
        clear();
        if (oldArray) {
            for (int i = 0; i < oldCapacity; ++i) {
                if (oldArray[i] != UNUSED)
                    insert(oldArray[i]);
            }
            delete[] oldArray;
        }
        return true;
    } else {
        m_capacity = oldCapacity;
        m_array = oldArray;
        return false;
    }
}

Properties

m_array

quint64* QInt64Set::m_array

private

Definition at line 1151 of file qtriangulator.cpp.

m_capacity

int QInt64Set::m_capacity

private

Definition at line 1152 of file qtriangulator.cpp.

m_count

int QInt64Set::m_count

private

Definition at line 1153 of file qtriangulator.cpp.

UNUSED

const quint64 QInt64Set::UNUSED = quint64(-1)

staticprivate

Definition at line 1149 of file qtriangulator.cpp.

---

The documentation for this class was generated from the following file:

• /src/opengl/gl2paintengineex/qtriangulator.cpp