new (fEntries[newIndex++]) AliHLTDomainEntry(kTRUE, intersect);
if (currentEntry->IdenticalTo(intersect))
{
new (fEntries[newIndex++]) AliHLTDomainEntry(kTRUE, intersect);
if (currentEntry->IdenticalTo(intersect))
{
for (Int_t i = startOfIntersects; i < fEntries.GetEntriesFast(); i++)
{
const AliHLTDomainEntry* ientry = static_cast<const AliHLTDomainEntry*>( fEntries[i] );
for (Int_t i = startOfIntersects; i < fEntries.GetEntriesFast(); i++)
{
const AliHLTDomainEntry* ientry = static_cast<const AliHLTDomainEntry*>( fEntries[i] );
for (Int_t i = min; i < fEntries.GetEntriesFast(); i++)
{
AliHLTDomainEntry* ientry = static_cast<AliHLTDomainEntry*>( fEntries[i] );
for (Int_t i = min; i < fEntries.GetEntriesFast(); i++)
{
AliHLTDomainEntry* ientry = static_cast<AliHLTDomainEntry*>( fEntries[i] );
for (Int_t i = 0; i < fEntries.GetEntriesFast(); i++)
{
const AliHLTDomainEntry* ientry = static_cast<const AliHLTDomainEntry*>( fEntries[i] );
for (Int_t i = 0; i < fEntries.GetEntriesFast(); i++)
{
const AliHLTDomainEntry* ientry = static_cast<const AliHLTDomainEntry*>( fEntries[i] );
// Check that the first entry is not and exclusion which would be redundent.
if (fEntries.GetEntriesFast() == 0) return;
AliHLTDomainEntry* firstEntry = static_cast<AliHLTDomainEntry*>( fEntries[0] );
// Check that the first entry is not and exclusion which would be redundent.
if (fEntries.GetEntriesFast() == 0) return;
AliHLTDomainEntry* firstEntry = static_cast<AliHLTDomainEntry*>( fEntries[0] );
for (Int_t j = i-1; j >= 0; j--)
{
AliHLTDomainEntry* jentry = static_cast<AliHLTDomainEntry*>( fEntries[j] );
for (Int_t j = i-1; j >= 0; j--)
{
AliHLTDomainEntry* jentry = static_cast<AliHLTDomainEntry*>( fEntries[j] );
// Find entries that intersect
if (jentry->SubsetOf(*ientry))
{
// jentry is a subset of ientry so it is redundant because for all values
// ientry will override jentry when calling IncludeInReadout.
// Find entries that intersect
if (jentry->SubsetOf(*ientry))
{
// jentry is a subset of ientry so it is redundant because for all values
// ientry will override jentry when calling IncludeInReadout.
// (pattern matching) list without hitting any and overlapping entries.
// So now we need to check if ientry is an exclusion. If it is, then it is
// redundant and we can mark it for removal.
// (pattern matching) list without hitting any and overlapping entries.
// So now we need to check if ientry is an exclusion. If it is, then it is
// redundant and we can mark it for removal.