SDC C-Project CF Review 프로그램
LYW
2021-07-09 6bb39b058bce38f80645e1e54d03a172f74dba3b
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
#include "StdAfx.h"
#include "PathScheduler_Sorting.h"
#include <algorithm>
 
CPathScheduler_Sorting::CPathScheduler_Sorting(void)
{
}
 
 
CPathScheduler_Sorting::~CPathScheduler_Sorting(void)
{
}
 
int CPathScheduler_Sorting::CalculatePath( const SPathData& startPath, const VectorPathData& vecTotalPathData, CPathSchedulerResult& scheduleResult )
{
    scheduleResult.Reset();
 
    // get path data
    VectorPathData vecPathData;
    for (constVectorPathDataIt it=vecTotalPathData.begin(); it!=vecTotalPathData.end(); it++)
    {
        if (*it == startPath )
        {
            vecPathData.push_back(*it);
        }
    }
 
    // check path count
    int nPathCount = (int) vecPathData.size();
    if (nPathCount<1) return 0;
 
    switch(m_PathSchedulerParam.GetSortAxisType())
    {
    case 0: // x Axis
        if (m_PathSchedulerParam.GetSortOrderType()==0) // ascend
        {
            std::sort(vecPathData.begin(), vecPathData.end(), AscendAxisX);
        }
        else // descend
        {
            std::sort(vecPathData.begin(), vecPathData.end(), DescendAxisX);
        }
        break;
 
    case 1: // y Axis
        if (m_PathSchedulerParam.GetSortOrderType()==0) // ascend
        {
            std::sort(vecPathData.begin(), vecPathData.end(), AscendAxisY);
        }
        else // descend
        {
            std::sort(vecPathData.begin(), vecPathData.end(), DescendAxisY);
        }
        break;
 
    default:
        return 0;
        break;
    }
 
    // resize result count
    scheduleResult.SetScheduleResultCount(nPathCount);
 
    // ½ºÄÉÁì ½ÃÀÛÀ§Ä¡..
    BOOL bStartPos = FALSE;
    SSchedulerResult sStartPos;
    if (startPath.nPosX!=NO_PATH_DATA && startPath.nPosY!=NO_PATH_DATA)
    {
        sStartPos.nTotalIndex        = -1;
        sStartPos.nPointIndex        = -1;
        sStartPos.dPositionX        = startPath.nPosX / 1000.0;
        sStartPos.dPositionY        = startPath.nPosY / 1000.0;
        sStartPos.dAutoFocusTime    = m_PathSchedulerParam.GetAutoFocusTime();
        sStartPos.dImageGrabTime    = m_PathSchedulerParam.GetImageGrabTime();
        sStartPos.dMotionDelayTime    = m_PathSchedulerParam.GetMotionDelayTime();
        bStartPos = TRUE;
    }
 
    for (int i=0; i<nPathCount; i++)
    {
        SSchedulerResult *pCurResult = scheduleResult.GetPathSchedulerResult(i);
        if (pCurResult==NULL) continue;
 
        pCurResult->nPointIndex = i;
 
        const SPathData *pPathData = &vecPathData[pCurResult->nPointIndex];
        if (pPathData==NULL) continue;
        pCurResult->nTotalIndex            = pPathData->nIndex;
        pCurResult->dPositionX            = double(pPathData->nPosX) / 1000.0;
        pCurResult->dPositionY            = double(pPathData->nPosY) / 1000.0;
        pCurResult->dAutoFocusTime        = m_PathSchedulerParam.GetAutoFocusTime();
        pCurResult->dImageGrabTime        = m_PathSchedulerParam.GetImageGrabTime();
        pCurResult->dMotionDelayTime    = m_PathSchedulerParam.GetMotionDelayTime();
 
        memcpy(pCurResult->pDataType, pPathData->pDataType, sizeof(int)*PATH_DATA_TYPE_COUNT);
 
        if (i==0) // first point
        {
            // exist start pos
            if (bStartPos)
            {
                if (!CalculateDistanceSpeedTime(*pCurResult, sStartPos))
                {
                    continue;
                }
            }
            else if(!CalculateDistanceSpeedTime(*pCurResult, *pCurResult))
            {
                continue;
            }
        }
        else // from second point
        {
            SSchedulerResult *pPrevResult = scheduleResult.GetPathSchedulerResult(i-1);
            if (!CalculateDistanceSpeedTime(*pCurResult, *pPrevResult))
            {
                continue;
            }
        }
    }
 
    return scheduleResult.GetPathSchedulerResultCount();
}