#include <MessageTree.h>

Classes
struct	Position

Public Member Functions
	MessageTree (int nDepth)
	MessageTree (int nDepth, int nWidth)
int	depth () const
int	width () const
int64_t	minReplyID () const
int64_t	maxReplyID () const
int64_t	getSiblingGap (int nDepthIndex) const
void	getPosition (int64_t nReplyID, Position &rPos) const
int64_t	getFirstChildID (int64_t nReplyID) const
int64_t	getLastChildID (int64_t nReplyID) const
int64_t	getChildID (int64_t nReplyID, int nWidthIndex) const

Static Public Member Functions
static int	getDefaultWidth (int nDepth)

Detailed Description

Definition at line 41 of file MessageTree.h.

Constructor & Destructor Documentation

◆ MessageTree() [1/2]

MessageTree::MessageTree ( int nDepth )

Definition at line 285 of file MessageTree.cpp.

{
    __DCL_ASSERT(2 <= nDepth && nDepth <= 17);
 
    __nWidth = __aWidth[nDepth - 2];
    __nDepth = nDepth;
 
    __nMinReplyID = 1;
    __nMaxReplyID = ((POWER(__nDepth) - 1) / (__nWidth - 1));
}

◆ MessageTree() [2/2]

MessageTree::MessageTree	(	int	nDepth,
		int	nWidth )

Definition at line 296 of file MessageTree.cpp.

{
    __DCL_ASSERT(nWidth >= 2);
    __DCL_ASSERT(nDepth >= 2);
 
    __nWidth = nWidth;
    __nDepth = nDepth;
 
    __nMinReplyID = 1;
    __nMaxReplyID = ((POWER(__nDepth) - 1) / (__nWidth - 1));
}

Member Function Documentation

◆ depth()

int MessageTree::depth ( ) const

inline

Definition at line 91 of file MessageTree.h.

{
    return __nDepth;
}

◆ getChildID()

int64_t MessageTree::getChildID	(	int64_t	nReplyID,
		int	nWidthIndex ) const

Definition at line 407 of file MessageTree.cpp.

{
    __DCL_ASSERT(0 <= nReplyID);
    __DCL_ASSERT(0 <= nWidthIndex && nWidthIndex < __nWidth);
 
    Position rPos;
    getPosition(nReplyID, rPos);
 
    __DCL_ASSERT(rPos.nDepthIndex < __nDepth);
 
    return nReplyID + 1 + getSiblingGap(rPos.nDepthIndex + 1) * nWidthIndex;
}

◆ getDefaultWidth()

int MessageTree::getDefaultWidth ( int nDepth )

static

Definition at line 263 of file MessageTree.cpp.

{
    __DCL_ASSERT(2 <= nDepth && nDepth <= 17);
 
    return __aWidth[nDepth - 2];
}

◆ getFirstChildID()

int64_t MessageTree::getFirstChildID ( int64_t nReplyID ) const

Definition at line 378 of file MessageTree.cpp.

{
    __DCL_ASSERT(0 <= nReplyID);
    return nReplyID + 1;
}

◆ getLastChildID()

int64_t MessageTree::getLastChildID ( int64_t nReplyID ) const

Definition at line 384 of file MessageTree.cpp.

{
    __DCL_ASSERT(0 <= nReplyID);
 
    Position rPos;
    getPosition(nReplyID, rPos);
 
    __DCL_ASSERT(rPos.nDepthIndex < (__nDepth - 1));
 
    // nReplyID + 전체 자식노드의 개수 중 직 하위의 (nWidth - 1)/__nWidth
    // POWER(__nDepth - rPos.nDepthIndex) / (__nWidth - 1)
    //      * (__nWidth - 1) / __nWidth
 
    return nReplyID
        + POWER(__nDepth - rPos.nDepthIndex) / __nWidth;
 
    /*
    // FirstChildID + 자식노드의 간격 * (__nWidth - 1)의 개수
    return nReplyID + 1
        + getSiblingGap(rPos.nDepthIndex + 1) * (__nWidth - 1);
    */
}

◆ getPosition()

void MessageTree::getPosition	(	int64_t	nReplyID,
		Position &	rPos ) const

Definition at line 332 of file MessageTree.cpp.

{
    __DCL_ASSERT(__nMinReplyID <= nReplyID);    // 0 < nReplyID
    __DCL_ASSERT(nReplyID <= __nMaxReplyID);
 
    rPos.nParentID = 0;
    rPos.nDepthIndex = 0;
    rPos.nWidthIndex = 0;
 
    int64_t __n = nReplyID - 1;
    if (__n == 0) {
        // 시작글(최상위 노드) ==> (0, 0)
        return;
    }
 
    for(int i = 1; i < __nDepth; i++) {
        // i == 1 ==> 0번째, 즉, 최상위 노드는 건너뛴다.
        --__n;
        int64_t nGap = getSiblingGap(i);
        if (nGap > 1) {
            int64_t nRemainder = __n % nGap;
            if (nRemainder == 0) {
                // nDepthIndex가 결정되었다.
                rPos.nDepthIndex = i;
                rPos.nWidthIndex = (int)(__n / nGap);
                rPos.nParentID = nReplyID - (nGap * rPos.nWidthIndex) - 1;
 
                break;
            }
 
            // tree의 가장 좌측으로 이동한다.
            __n = nRemainder;
        }
        else {
//          __DCL_TRACE2(L"i[%d], __n[%lld]\n", i, __n);
            rPos.nDepthIndex = i;
            rPos.nWidthIndex = (int)__n;
            rPos.nParentID = nReplyID - (nGap * rPos.nWidthIndex) - 1;
            break;
        }
    }
}

◆ getSiblingGap()

int64_t MessageTree::getSiblingGap ( int nDepthIndex ) const

Definition at line 318 of file MessageTree.cpp.

{
    __DCL_ASSERT(nDepthIndex >= 0);
 
    // 형제노드간의 간격
    // 전체 노드의 개수 중 nDepthIndex - 1 까지의 개수를 뺀 값에서 
    // nDepthIndex 까지의 개수로 나눈 값
    if (nDepthIndex > 0)
        return (__nMaxReplyID - POWER(nDepthIndex - 1))
            / POWER(nDepthIndex);
    else
        return __nMaxReplyID;
}

◆ maxReplyID()

int64_t MessageTree::maxReplyID ( ) const

Definition at line 313 of file MessageTree.cpp.

{
    return __nMaxReplyID;
}

◆ minReplyID()

int64_t MessageTree::minReplyID ( ) const

Definition at line 308 of file MessageTree.cpp.

{
    return __nMinReplyID;
}

◆ width()

int MessageTree::width ( ) const