cStrPathTree.h

Go to the documentation of this file.

//
//
#ifndef _INC_cStrPathTree_H
#define _INC_cStrPathTree_H
#ifndef NO_PRAGMA_ONCE
#pragma once
#endif
 
#include "../GrayLibBase.h"
#include "GrayCore/include/cHashTable.h"
#include "GrayCore/include/cString.h"
 
namespace GrayLib
{
        UNITTEST2_PREDEF(cStrPathTree);
        class cStrPathNode;
        typedef cRefPtr<cStrPathNode> cStrPathNodePtr;
 
        class GRAYLIB_LINK cStrPathNode : public cRefBase
        {
        private:
                cStrPathNodePtr m_pParent;
                HASHCODE32_t m_nHashCode;       
                cString m_sVal;                 
                cRefPtr<> m_pUserData;  
 
        public:
                cStrPathNode(HASHCODE32_t nHashCode, cString sVal) noexcept
                : m_nHashCode(nHashCode)
                , m_sVal(sVal)
                {
                }
                HASHCODE32_t get_HashCode() const noexcept
                {
                        return m_nHashCode;
                }
                cString get_Name() const
                {
                        return m_sVal;
                }
                cString get_Path() const;       // Construct the full path back to the root.
        };
 
        class GRAYLIB_LINK cStrPathTree
        {
        public:
                cStrPathTree(void);
                ~cStrPathTree(void);
 
                cStrPathNodePtr FindPathNode(const GChar_t* pszPath) const;
                HRESULT AddPath(const GChar_t* pszPath, cRefPtr<> pUserData);
                HRESULT RemovePathNode(cStrPathNode* pNode);
 
                UNITTEST_FRIEND(cStrPathTree);
 
        public:
                cStrPathNodePtr m_pRoot;        // Root of the tree. Name sorted.
                cHashTableRef<cStrPathNode> m_aHash;                    // Has sorted array of nodes.
        };
}
#endif