inline bool CollisionHull::solveIntersection(
const ConvexPolygon& other,
const ruukku::GLFloatMat3& transformNew,
const ruukku::GLFloatMat3& transformOther,
const ruukku::GLFloatMat3& transformOtherRelative,
std::vector< IntersectionSolution >& solutionList
) const {
bool didIntersect = false;
for (const CollisionHullEntry& entry : getEntryList()) {
for (const ConvexPolygon& polygon : entry.convexPolygonList) {
if (intersectionTester.solveIntersection(
polygon,
other,
transformation,
transformNew,
transformOther,
transformOtherRelative,
solutionList
)) didIntersect = true;
}
}
return didIntersect;
}
void drawEntryList(int y, int m, int d){
emptyEntryList();
int nle= getEntryList(le, y, m, d);
for( int i= 0; i< nle; i++ ){
wmove(winList, i*nEntryHeight, 0);
wprintw(winList, "%d TITLE: %s (%s-%s)", i+1, le[i].title, le[i].beginTime, le[i].endTime);
wmove(winList, i*nEntryHeight+1, 0);
wprintw(winList, " INFO: %s", le[i].info);
}
wrefresh(winList);
}
bool ossimLasReader::setCurrentEntry(ossim_uint32 entryIdx)
{
bool result = false;
if ( isOpen() )
{
std::vector<ossim_uint32> entryList;
getEntryList( entryList );
std::vector<ossim_uint32>::const_iterator i = entryList.begin();
while ( i != entryList.end() )
{
if ( (*i) == entryIdx )
{
m_entry = entryIdx;
result = true;
}
++i;
}
}
return result;
}
//ディレクトリ内のディレクトリリスト
QStringList QMLFile::getEntryList(const QString &path)
{
QStringList list;
return getEntryList(path, Dirs, list);
}