/// <summary>
/// TODO：计算一段可能跨链的铁路，用于生成火车漫游路径，由startDKM开始，长度为disFromStart的一段路
/// </summary>
/// <param name="startDKM">起始里程</param>
/// <param name="disFromStart">起点里程偏移,为正时，小里程至大里程，为负数时，大里程至小里程</param>
/// <param name="stepm">每两个采样点的间隔距离</param>
/// <param name="x">采样点经度</param>
/// <param name="y">采样点纬度</param>
/// <param name="z">采样点高度</param>
/// <param name="dir">采样点方位角（朝向）</param>
/// <returns>采样点个数</returns>
public int getSubLine(string startDKM, double disFromStart, double stepm, out double[] x, out double[] y, out double[] z, out double[] dir)
{
x = y = z = dir = null;
string startDKCode, endDKCode, endDKM;
double startMileage, endMileage;
//拆分code
parseDKCode(startDKM, out startDKCode, out startMileage, -1);
//获取起点所在的链
int startNumber = 0;
double startDis;
CRailwayLine startChain = null;
for (int count = 0; count < mLineList.Count; count++)
{
if (mLineList[count].isInSide(startDKCode, startMileage, out startDis))
{
startChain = mLineList[count];
startNumber = count;
}
}
if (startChain == null)
{
return(0);
}
double desMileage = startMileage + disFromStart;
if ((!startChain.mIsReverse && desMileage <= startChain.mEnd && desMileage >= startChain.mStart) || (startChain.mIsReverse && desMileage <= startChain.mStart && desMileage >= startChain.mEnd))
{
int pointNumber = startChain.getSubLine(startMileage, desMileage, stepm, out x, out y, out z, out dir);
return(pointNumber);
}
else
{
int pointNum = 0;
if (disFromStart >= 0) //小里程至大里程
{
double remain = disFromStart - Math.Abs(startChain.mEnd - startMileage);
double chainsLength = 0;
for (int i = startNumber + 1; i < mLineList.Count; i++)
{
chainsLength += mLineList[i].mLength;
if (chainsLength >= remain)
{
if (mLineList[i].mIsReverse)
{
endMileage = mLineList[i].mEnd + (chainsLength - remain);
}
else
{
endMileage = mLineList[i].mEnd - (chainsLength - remain);
}
endDKCode = mLineList[i].mDKCode;
endDKM = CombiDKCode(endDKCode, endMileage);
pointNum = getSubLineByDKCode(startDKM, endDKM, stepm, out x, out y, out z, out dir);
break;
}
}
}
else //大里程至小里程
{
double remain = -disFromStart - Math.Abs(startMileage - startChain.mStart);
double chainsLength = 0;
for (int i = startNumber - 1; i >= 0; i--)
{
chainsLength += mLineList[i].mLength;
if (chainsLength >= remain)
{
if (mLineList[i].mIsReverse)
{
endMileage = mLineList[i].mStart - (chainsLength - remain);
}
else
{
endMileage = mLineList[i].mStart + (chainsLength - remain);
}
endDKCode = mLineList[i].mDKCode;
endDKM = CombiDKCode(endDKCode, endMileage);
pointNum = getSubLineByDKCode(startDKM, endDKM, stepm, out x, out y, out z, out dir);
break;
}
}
}
return(pointNum);
}
}
public int getSubLineByDKCode(string startDKCode, double startMileage, string endDKCode, double endMileage, double stepm, out double[] x, out double[] y, out double[] z, out double[] dir)
{
x = y = z = dir = null;
//获取两点所在的链
int startNumber = 0, endNumber = 0;
double startDis, endDis;
CRailwayLine startChain = null, endChain = null;
for (int count = 0; count < mLineList.Count; count++)
{
if (mLineList[count].isInSide(startDKCode, startMileage, out startDis))
{
startChain = mLineList[count];
startNumber = count;
}
if (mLineList[count].isInSide(endDKCode, endMileage, out endDis))
{
endChain = mLineList[count];
endNumber = count;
}
}
if (startChain == null || endChain == null)
{
return(0);
}
//保证startChain小于等于endChain
if (startNumber > endNumber)
{
int temp = startNumber;
double tempMileage = startMileage;
CRailwayLine tempChain = startChain;
startNumber = endNumber;
startMileage = endMileage;
startChain = endChain;
endNumber = temp;
endMileage = tempMileage;
endChain = tempChain;
}
int[] ccount = new int[endNumber - startNumber + 1];
double[][] xx = new double[endNumber - startNumber + 1][];
double[][] yy = new double[endNumber - startNumber + 1][];
double[][] zz = new double[endNumber - startNumber + 1][];
double[][] dd = new double[endNumber - startNumber + 1][]; //double[][] XX :交错数组 instead of 二维数组
if (startNumber == endNumber) //start和end是同一条链
{
int pointNumber = startChain.getSubLine(startMileage, endMileage, stepm, out x, out y, out z, out dir);
return(pointNumber);
}
else //两点不在同一条链
{
//首链
ccount[0] = startChain.getSubLine(startMileage, startChain.mEnd, stepm, out xx[0], out yy[0], out zz[0], out dd[0]);
//中间链
int account = ccount[0];
if (Math.Abs(endNumber - startNumber) > 1)
{
int i = 1;
for (int ii = startNumber + 1; ii < endNumber; ii++)
{
ccount[i] = mLineList[ii].getSubLine(mLineList[ii].mStart, mLineList[ii].mEnd, stepm, out xx[i], out yy[i], out zz[i], out dd[i]);
account += ccount[i];
i++;
}
}
//末链
ccount[endNumber - startNumber] = endChain.getSubLine(endChain.mStart, endMileage, stepm, out xx[endNumber - startNumber], out yy[endNumber - startNumber], out zz[endNumber - startNumber], out dd[endNumber - startNumber]);
account += ccount[endNumber - startNumber];
//声明输出数组
x = new double[account];
y = new double[account];
z = new double[account];
dir = new double[account];
//首链
for (int num = 0; num < ccount[0]; num++)
{
x[num] = xx[0][num];
y[num] = yy[0][num];
z[num] = zz[0][num];
dir[num] = dd[0][num];
}
int account0 = ccount[0];
//中间链
if (Math.Abs(endNumber - startNumber) > 1)
{
int i = 1;
for (int ii = startNumber + 1; ii < endNumber; ii++)
{
for (int num = 0; num < ccount[i]; num++)
{
x[account0 + num] = xx[i][num];
y[account0 + num] = yy[i][num];
z[account0 + num] = zz[i][num];
dir[account0 + num] = dd[i][num];
}
account0 += ccount[i];
i++;
}
}
//末链
for (int num = 0; num < ccount[endNumber - startNumber]; num++)
{
x[account0 + num] = xx[endNumber - startNumber][num];
y[account0 + num] = yy[endNumber - startNumber][num];
z[account0 + num] = zz[endNumber - startNumber][num];
dir[account0 + num] = dd[endNumber - startNumber][num];
}
return(account);
}
}