bool CHotKeys::FindFirstConflict(ARRAY& keys, INT_PTR* pX, INT_PTR* pY) { bool bConflict = false; INT_PTR i, j; INT_PTR count = keys.GetSize(); DWORD key; for(i = 0; i < count && !bConflict; i++) { key = keys.ElementAt(i); // only check valid keys if(key == 0) continue; // scan the array for a duplicate for(j = i+1; j < count; j++ ) { if(keys.ElementAt(j) == key) { bConflict = true; break; } } } if(bConflict) { if(pX) *pX = i-1; if(pY) *pY = j; } return bConflict; }