Searched refs:m_currInter (Results 1 – 4 of 4) sorted by relevance
406 b.m_currInter = currInt; in getFillData()526 vector<UINT> branchesBefore(v[branchCount - 1].m_currInter + 1); in setFillData()531 if (i == 0 || v[i].m_currInter != v[i - 1].m_currInter) { in setFillData()532 assert(i == 0 || v[i].m_currInter == v[i - 1].m_currInter + 1); in setFillData()534 branchesBefore[v[i].m_currInter] = i; in setFillData()564 std::advance(it1, v[b.m_nextBranch].m_currInter); in setFillData()566 assert(b.m_nextBranch - branchesBefore[v[b.m_nextBranch].m_currInter] >= in setFillData()570 it2, b.m_nextBranch - branchesBefore[v[b.m_nextBranch].m_currInter]); in setFillData()595 if (i == branchCount - 1 || v[i].m_currInter != v[i + 1].m_currInter) { in setFillData()598 ((j > 0 && v[j].m_currInter == v[j - 1].m_currInter) || j == 0)) in setFillData()
644 b.m_currInter = currInt; in getFillData()768 UINT size = v[branchCount - 1].m_currInter + 1; in setFillData()774 if (i == 0 || v[i].m_currInter != v[i - 1].m_currInter) { in setFillData()775 if (v[i].m_currInter >= in setFillData()781 branchesBefore[v[i].m_currInter] = i; in setFillData()811 p1 = intList.getElemAt(v[b.m_nextBranch].m_currInter); in setFillData()813 assert(b.m_nextBranch - branchesBefore[v[b.m_nextBranch].m_currInter] >= in setFillData()816 b.m_nextBranch - branchesBefore[v[b.m_nextBranch].m_currInter]); in setFillData()841 if (i == branchCount - 1 || v[i].m_currInter != v[i + 1].m_currInter) { in setFillData()844 ((j > 0 && v[j].m_currInter == v[j - 1].m_currInter) || j == 0)) in setFillData()
69 UINT m_currInter; member
1723 branchArray[i].m_currInter = -currInter - 1; in readIntersectionDataTag()1726 branchArray[i].m_currInter = currInter - 1; in readIntersectionDataTag()2239 ? (TINT32)(tag->m_branchArray[i].m_currInter + 1) in writeIntersectionDataTag()2240 : -(TINT32)(tag->m_branchArray[i].m_currInter + 1)); in writeIntersectionDataTag()