indexedtopducontext.h

Go to the documentation of this file.

/* This file is part of KDevelop
    Copyright 2007 David Nolden <[email protected]>
 
   This library is free software; you can redistribute it and/or
   modify it under the terms of the GNU Library General Public
   License version 2 as published by the Free Software Foundation.
 
   This library is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
   Library General Public License for more details.
 
   You should have received a copy of the GNU Library General Public License
   along with this library; see the file COPYING.LIB.  If not, write to
   the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
   Boston, MA 02110-1301, USA.
 */
 
#ifndef KDEVPLATFORM_INDEXEDTOPDUCONTEXT_H
#define KDEVPLATFORM_INDEXEDTOPDUCONTEXT_H
 
#include <QMetaType>
#include <QPair>
 
#include <language/languageexport.h>
 
namespace KDevelop {
class IndexedString;
class IndexedTopDUContextEmbeddedTreeHandler;
class TopDUContext;
 
class KDEVPLATFORMLANGUAGE_EXPORT IndexedTopDUContext
{
public:
    inline IndexedTopDUContext(uint index) : m_index(index)
    {
        if (!index)
            setIsDummy(true);
    }
    IndexedTopDUContext(TopDUContext* context = nullptr);
 
    enum {
        DummyMask = 1u << 31u
    };
 
    TopDUContext* data() const;
 
    bool isLoaded() const;
 
    inline bool operator==(const IndexedTopDUContext& rhs) const
    {
        return m_index == rhs.m_index;
    }
 
    inline bool operator!=(const IndexedTopDUContext& rhs) const
    {
        return m_index != rhs.m_index;
    }
 
    inline bool operator<(const IndexedTopDUContext& rhs) const
    {
        return m_index < rhs.m_index;
    }
 
    inline bool isValid() const
    {
        return m_index && !isDummy();
    }
 
    inline uint index() const
    {
        if (isDummy())
            return 0;
        else
            return m_index;
    }
 
    inline bool isDummy() const
    {
        return m_index & DummyMask;
    }
 
    void setIsDummy(bool isDummy)
    {
        if (isDummy)
            m_index |= DummyMask;
        else
            m_index &= ~(( uint )DummyMask);
    }
 
    void setDummyData(ushort first, ushort second)
    {
        Q_ASSERT(isDummy());
        m_index = (((( uint )first) << 16) + second) | DummyMask;
    }
 
    QPair<ushort, ushort> dummyData() const
    {
        uint withoutMask = m_index & (~(( uint )DummyMask));
        return qMakePair(( ushort )(withoutMask >> 16), ( ushort )withoutMask);
    }
 
    IndexedString url() const;
 
private:
    uint m_index;
    friend class IndexedTopDUContextEmbeddedTreeHandler;
};
 
struct IndexedTopDUContextIndexConversion
{
    inline static uint toIndex(const IndexedTopDUContext& top)
    {
        return top.index();
    }
 
    inline static IndexedTopDUContext toItem(uint index)
    {
        return IndexedTopDUContext(index);
    }
};
 
inline uint qHash(const IndexedTopDUContext& ctx)
{
    return ctx.index();
}
}
 
Q_DECLARE_METATYPE(KDevelop::IndexedTopDUContext)
Q_DECLARE_TYPEINFO(KDevelop::IndexedTopDUContext, Q_MOVABLE_TYPE);
 
#endif // KDEVPLATFORM_INDEXEDTOPDUCONTEXT_H