public override Boolean GetModelExport(AxDrawModelMatchList drawModelModel)
{
drawModelModel.RemoveAll();
Int32 nPyramidCnt = m_oEvent.GetPyramidCount();
if (nPyramidCnt < 1)
{
return(false);
}
//填入源信息时底层的需要排序位置
Int32 nPosIndex = 0; //来自人员的顺序ID
//AryKoStartPos aryPos; //来自人员序列
ArrayList aryPos = new ArrayList();
GetStartPos(m_oEvent.GetLayerCount(), aryPos);
//1. 先循环一次,把所有比赛加入队列, 这样我们内存的结构里,就有了Match的RowNumber
for (Int32 nPyramid = 0; nPyramid < nPyramidCnt; nPyramid++)
{
stKoPyramid pPrramid = m_oEvent.GetPyramidObj(nPyramid);
Int32 nLayerCnt = pPrramid.GetLayerCount();
for (Int32 nLayer = nLayerCnt - 1; nLayer >= 0; nLayer--)
{
stKoLayer pLayer = pPrramid.GetLayerObj(nLayer);
Int32 nNodeCnt = pLayer.GetNodeCount();
for (Int32 nNode = 0; nNode < nNodeCnt; nNode++)
{
stKoMatchNode pNode = pLayer.GetNodeObj(nNode);
AxDrawModelMatchRow matchInfo = new AxDrawModelMatchRow();
matchInfo.m_byteRoundOrder = (Byte)(nLayerCnt - nLayer + nPyramid * 10);
matchInfo.m_strMatchDesc = String.Format("{0:D}-{1:D}-{2:D}", nPyramid + 1, nLayer + 1, nNode + 1);
//将此场比赛添加到列表后,会返还行号,正好填给内存中的塔
drawModelModel.m_aryMatchRow.Add(matchInfo);
Int32 nCurNodeRowInMatchList = drawModelModel.m_aryMatchRow.Count - 1;
pNode.m_nRowTemp = nCurNodeRowInMatchList;
}
}
}
//2.再循环一次,把目标和源填入
for (Int32 nPyramid = 0; nPyramid < nPyramidCnt; nPyramid++)
{
stKoPyramid pPyramid = m_oEvent.GetPyramidObj(nPyramid);
Int32 nLayerCnt = pPyramid.GetLayerCount();
for (Int32 nLayer = 0; nLayer < nLayerCnt; nLayer++)
{
stKoLayer pLayer = pPyramid.GetLayerObj(nLayer);
Int32 nNodeCnt = pLayer.GetNodeCount();
for (Int32 nNode = 0; nNode < nNodeCnt; nNode++)
{
stKoMatchNode pNode = pLayer.GetNodeObj(nNode);
AxDrawModelMatchRow pMatchInfoInList = drawModelModel.m_aryMatchRow[pNode.m_nRowTemp];
//1.轮次信息
{
if (nPyramid == 0) //第一个塔里的结构就是从金牌赛往下顺
{
switch (nLayer)
{
case 8: pMatchInfoInList.m_emLayerCode = EDrawModelLayerCode.emLayerRound_512to256; break;
case 7: pMatchInfoInList.m_emLayerCode = EDrawModelLayerCode.emLayerRound_256to128; break;
case 6: pMatchInfoInList.m_emLayerCode = EDrawModelLayerCode.emLayerRound_128to64; break;
case 5: pMatchInfoInList.m_emLayerCode = EDrawModelLayerCode.emLayerRound_64to32; break;
case 4: pMatchInfoInList.m_emLayerCode = EDrawModelLayerCode.emLayerRound_32to16; break;
case 3: pMatchInfoInList.m_emLayerCode = EDrawModelLayerCode.emLayerRound_16to8; break;
case 2: pMatchInfoInList.m_emLayerCode = EDrawModelLayerCode.emLayerRound_8to4; break;
case 1: pMatchInfoInList.m_emLayerCode = EDrawModelLayerCode.emLayerRound_4to2; break;
case 0: pMatchInfoInList.m_emLayerCode = EDrawModelLayerCode.emLayerRound_2to1; break;
default: break;
}
}
else if (nPyramid == 1) //第二个塔里只能有铜牌赛
{
pMatchInfoInList.m_emLayerCode = EDrawModelLayerCode.emLayerRound_34to3;
}
else if (nPyramid == 2) //第三个塔是5-8名
{
if (nLayer == 0)
{
pMatchInfoInList.m_emLayerCode = EDrawModelLayerCode.emLayerRound_56to5;
}
else
{
pMatchInfoInList.m_emLayerCode = EDrawModelLayerCode.emLayerRound_58to56;
}
}
else if (nPyramid == 3) //第四个塔是7,8名
{
pMatchInfoInList.m_emLayerCode = EDrawModelLayerCode.emLayerRound_78to7;
}
}
//2. 跳跃信息
pMatchInfoInList.m_eWinGotoKind = pNode.m_oJumpWin.m_byJumpKind;
pMatchInfoInList.m_eLostGotoKind = pNode.m_oJumpLost.m_byJumpKind;
if (pNode.m_oJumpWin.IsJumpPos()) //是跳跃到位置,那么在金字塔中找到那Node, Node里肯定有行号,把目标行号拿到即可
{
stKoMatchNode pNodeWinGoto = m_oEvent.GetMatchObj(pNode.m_oJumpWin);
pMatchInfoInList.m_byWinGotoLineOrRank = pNodeWinGoto.m_nRowTemp;
}
else // 不是跳到位置,那要么是Rank,或者是Out
{
pMatchInfoInList.m_byWinGotoLineOrRank = pNode.m_oJumpWin.m_byPyramindIndexOrRank;
}
if (pNode.m_oJumpLost.IsJumpPos())
{
stKoMatchNode pNodeLostGoto = m_oEvent.GetMatchObj(pNode.m_oJumpLost);
pMatchInfoInList.m_byLostGotoLineOrRank = pNodeLostGoto.m_nRowTemp;
}
else
{
pMatchInfoInList.m_byLostGotoLineOrRank = pNode.m_oJumpLost.m_byPyramindIndexOrRank;
}
//3. 来源信息
stKoJumpInfo JumpThisInfo = new stKoJumpInfo();
JumpThisInfo.SetJumpToPointer((Byte)nPyramid, (Byte)nLayer, (Byte)nNode, false); //本Node的Jump坐标
{
//左来源
stKoJumpInfo jumpFromLeft = m_oEvent.GetMatchPlayerFrom(JumpThisInfo, true);
if (jumpFromLeft.IsJumpAsPointer()) //从其他地方来的
{
stKoMatchNode pNodeLeftFrom = m_oEvent.GetMatchObj(jumpFromLeft);
pMatchInfoInList.m_eLeftFromKind = jumpFromLeft.m_byIsWin ? EKnockOutFromKind.emKoFromWin : EKnockOutFromKind.emKoFromLost;
pMatchInfoInList.m_nLeftFromLineOrIndex = pNodeLeftFrom.m_nRowTemp;
}
else //最底层的
{
pMatchInfoInList.m_eLeftFromKind = EKnockOutFromKind.emKoFromInit;
pMatchInfoInList.m_nLeftFromLineOrIndex = Convert.ToInt32(aryPos[nPosIndex++]);
}
//右来源
stKoJumpInfo jumpFromRight = m_oEvent.GetMatchPlayerFrom(JumpThisInfo, false);
if (jumpFromRight.IsJumpAsPointer())
{
stKoMatchNode pNodeRightFrom = m_oEvent.GetMatchObj(jumpFromRight);
pMatchInfoInList.m_eRightFromKind = jumpFromRight.m_byIsWin ? EKnockOutFromKind.emKoFromWin : EKnockOutFromKind.emKoFromLost;
pMatchInfoInList.m_nRightFromLineOrIndex = pNodeRightFrom.m_nRowTemp;
}
else
{
pMatchInfoInList.m_eRightFromKind = EKnockOutFromKind.emKoFromInit;
pMatchInfoInList.m_nRightFromLineOrIndex = Convert.ToInt32(aryPos[nPosIndex++]);
}
}
} //For Node
} //For layer
} //For Pyramid
return(true);
}
public Boolean _Create(int nLayerCnt, int nResultPlayerCnt)
{
//1. 先把内部所有内容清空
{
m_oEvent.RemoveAll();
m_strLastError = "";
}
//2. 首先建立主 塔0
{
Int32 nPyramidIdx = 0; //主金字塔位于第一个
stKoPyramid matchPyramid0 = new stKoPyramid();
//4人比赛,需要3层, 我们的内部只有2层就够, 因为我们不存在顶端的一层
for (Int32 nLayer = 0; nLayer <= nLayerCnt - 1; nLayer++)
{
stKoLayer matchLayer = new stKoLayer();
//第1层 2个节点; 第2层 4个节点; 第3层 8个节点...
Int32 nNodeCnt = (Int32)Math.Pow(2, nLayer);
for (Int32 nNode = 0; nNode < nNodeCnt; nNode++)
{
stKoMatchNode matchNode = new stKoMatchNode();
if (nLayer == 0) //第1层产生1,2名
{
matchNode.m_oJumpWin.SetJumpToRank(1);
if (nResultPlayerCnt > 1)
{
matchNode.m_oJumpLost.SetJumpToRank(2);
}
else
{
matchNode.m_oJumpLost.SetJumpToOut();
}
}
else
{
//这场比赛如果赢了应该去上层的一个节点
Int32 nTargetNode = (nNode / 2); // 0,1->0; 2,3->1; 4,5->2; 6,7->3
Boolean bTargetLeft = (nNode % 2 == 0); // 0,2,4->Left; 1,3,5->Right
matchNode.m_oJumpWin.SetJumpToPos((Byte)nPyramidIdx, (Byte)(nLayer - 1), (Byte)nTargetNode, bTargetLeft);
//除了最冠军赛,其他失败的都淘汰
matchNode.m_oJumpLost.SetJumpToOut();
}
matchLayer.AddNodeObj(matchNode);
}//for Layer
matchPyramid0.AddLayerObj(matchLayer);
}//for Pyramid
m_oEvent.AddPyramidObj(matchPyramid0);
}
//3.根据需要建立其他附塔
if (nResultPlayerCnt >= 3)
{
//建立争3,4名用的 塔1
{
stKoMatchNode matchNode = new stKoMatchNode();
matchNode.m_oJumpWin.SetJumpToRank(3);
if (nResultPlayerCnt == 3) //如果只要3个排名的话,第4名置淘汰
{
matchNode.m_oJumpLost.SetJumpToOut();
}
else
{
matchNode.m_oJumpLost.SetJumpToRank(4);
}
stKoLayer matchLayer = new stKoLayer();
matchLayer.AddNodeObj(matchNode);
stKoPyramid matchPyramid1 = new stKoPyramid();
matchPyramid1.AddLayerObj(matchLayer);
m_oEvent.AddPyramidObj(matchPyramid1);
}
//更改主塔中3,4名的链接
{
stKoJumpInfo jumpInfoL = new stKoJumpInfo(), jumpInfoR = new stKoJumpInfo();
jumpInfoL.SetJumpToPointer(0, 1, 0, false);
jumpInfoR.SetJumpToPointer(0, 1, 1, false);
stKoMatchNode pNodeL = m_oEvent.GetMatchObj(jumpInfoL);
stKoMatchNode pNodeR = m_oEvent.GetMatchObj(jumpInfoR);
if (pNodeL == null || pNodeR == null)
{
return(false);
}
pNodeL.m_oJumpLost.SetJumpToPos(1, 0, 0, true);
pNodeR.m_oJumpLost.SetJumpToPos(1, 0, 0, false);
}
}//if
if (nResultPlayerCnt >= 5)
{
//建立争5,6名用的 塔2
{
stKoLayer matchLayer1 = new stKoLayer();
{
stKoMatchNode matchNode11 = new stKoMatchNode();
matchNode11.m_oJumpWin.SetJumpToRank(5);
if (nResultPlayerCnt == 5) //如果只要5个排名的话,第6名置淘汰
{
matchNode11.m_oJumpLost.SetJumpToOut();
}
else
{
matchNode11.m_oJumpLost.SetJumpToRank(6);
}
matchLayer1.AddNodeObj(matchNode11);
}
stKoLayer matchLayer2 = new stKoLayer();
{
stKoMatchNode matchNode21 = new stKoMatchNode();
stKoMatchNode matchNode22 = new stKoMatchNode();
matchNode21.m_oJumpLost.SetJumpToOut();
matchNode21.m_oJumpWin.SetJumpToPos(2, 0, 0, true);
matchNode22.m_oJumpLost.SetJumpToOut();
matchNode22.m_oJumpWin.SetJumpToPos(2, 0, 0, false);
matchLayer2.AddNodeObj(matchNode21);
matchLayer2.AddNodeObj(matchNode22);
}
stKoPyramid matchPyramid2 = new stKoPyramid();
matchPyramid2.AddLayerObj(matchLayer1);
matchPyramid2.AddLayerObj(matchLayer2);
m_oEvent.AddPyramidObj(matchPyramid2);
}
//更改主塔中5,6,7,8名的链接
{
stKoJumpInfo jumpInfo1L = new stKoJumpInfo(), jumpInfo1R = new stKoJumpInfo(), jumpInfo2L = new stKoJumpInfo(), jumpInfo2R = new stKoJumpInfo();
jumpInfo1L.SetJumpToPointer(0, 2, 0, false);
jumpInfo1R.SetJumpToPointer(0, 2, 1, false);
jumpInfo2L.SetJumpToPointer(0, 2, 2, false);
jumpInfo2R.SetJumpToPointer(0, 2, 3, false);
stKoMatchNode pNode1L = m_oEvent.GetMatchObj(jumpInfo1L);
stKoMatchNode pNode1R = m_oEvent.GetMatchObj(jumpInfo1R);
stKoMatchNode pNode2L = m_oEvent.GetMatchObj(jumpInfo2L);
stKoMatchNode pNode2R = m_oEvent.GetMatchObj(jumpInfo2R);
if (pNode1L == null || pNode1R == null || pNode2L == null || pNode2R == null)
{
return(false);
}
pNode1L.m_oJumpLost.SetJumpToPos(2, 1, 0, true);
pNode1R.m_oJumpLost.SetJumpToPos(2, 1, 0, false);
pNode2L.m_oJumpLost.SetJumpToPos(2, 1, 1, true);
pNode2R.m_oJumpLost.SetJumpToPos(2, 1, 1, false);
}
}//if
if (nResultPlayerCnt >= 7)
{
//建立争7,8名用的 塔3
{
stKoMatchNode matchNode = new stKoMatchNode();
matchNode.m_oJumpWin.SetJumpToRank(7);
if (nResultPlayerCnt == 7) //如果只要7个排名的话,第8名置淘汰
{
matchNode.m_oJumpLost.SetJumpToOut();
}
else
{
matchNode.m_oJumpLost.SetJumpToRank(8);
}
stKoLayer matchLayer = new stKoLayer();
matchLayer.AddNodeObj(matchNode);
stKoPyramid matchPyramid3 = new stKoPyramid();
matchPyramid3.AddLayerObj(matchLayer);
m_oEvent.AddPyramidObj(matchPyramid3);
}
//更改塔2中7,8名的链接
{
stKoJumpInfo jumpInfoL = new stKoJumpInfo(), jumpInfoR = new stKoJumpInfo();
jumpInfoL.SetJumpToPointer(2, 1, 0, false);
jumpInfoR.SetJumpToPointer(2, 1, 1, false);
stKoMatchNode pNodeL = m_oEvent.GetMatchObj(jumpInfoL);
stKoMatchNode pNodeR = m_oEvent.GetMatchObj(jumpInfoR);
if (pNodeL == null || pNodeR == null)
{
return(false);
}
pNodeL.m_oJumpLost.SetJumpToPos(3, 0, 0, true);
pNodeR.m_oJumpLost.SetJumpToPos(3, 0, 0, false);
}
}
return(true);
}
//一个节点左边运动员来自哪
public stKoJumpInfo GetMatchPlayerFrom(stKoJumpInfo jumpInfo, Boolean bIsFromLeft)
{
stKoJumpInfo jumpInfoRet = new stKoJumpInfo();
int nPyramidCnt = GetPyramidCount();
for (int nPyramid = 0; nPyramid < nPyramidCnt; nPyramid++)
{
stKoPyramid pPyramid = GetPyramidObj(nPyramid);
if (pPyramid == null)
{
return(null);
}
int nLayerCnt = pPyramid.GetLayerCount();
for (Int32 nLayer = 0; nLayer < nLayerCnt; nLayer++)
{
stKoLayer pLayer = pPyramid.GetLayerObj(nLayer);
if (pLayer == null)
{
return(null);
}
int nNodeCnt = pLayer.GetNodeCount();
for (int nNode = 0; nNode < nNodeCnt; nNode++)
{
stKoMatchNode pNode = pLayer.GetNodeObj(nNode);
if (pNode == null)
{
return(null);
}
if (pNode.m_oJumpWin.IsJumpPos())
{
if (pNode.m_oJumpWin.m_byPyramindIndexOrRank == jumpInfo.m_byPyramindIndexOrRank &&
pNode.m_oJumpWin.m_byLayerIndex == jumpInfo.m_byLayerIndex &&
pNode.m_oJumpWin.m_byNodeIndex == jumpInfo.m_byNodeIndex &&
pNode.m_oJumpWin.IsJumpLeft() == bIsFromLeft)
{
jumpInfoRet.SetJumpToPointer((Byte)nPyramid, (Byte)nLayer, (Byte)nNode, true);
return(jumpInfoRet);
}
}
if (pNode.m_oJumpLost.IsJumpPos())
{
if (pNode.m_oJumpLost.m_byPyramindIndexOrRank == jumpInfo.m_byPyramindIndexOrRank &&
pNode.m_oJumpLost.m_byLayerIndex == jumpInfo.m_byLayerIndex &&
pNode.m_oJumpLost.m_byNodeIndex == jumpInfo.m_byNodeIndex &&
pNode.m_oJumpLost.IsJumpLeft() == bIsFromLeft)
{
jumpInfoRet.SetJumpToPointer((Byte)nPyramid, (Byte)nLayer, (Byte)nNode, false);
return(jumpInfoRet);
}
}
}
}
}
return(jumpInfoRet);
}