Lines Matching defs:aids
48 // mAidServices maps AIDs to services that have registered them.
50 // of AIDs that conflict with each other.
182 Log.e(TAG, "Different defaults for conflicting AIDs!");
229 * AIDs. Note that the AID itself is not an input to the decision
339 " preference, ignoring conflicting AIDs.");
360 " default, ignoring conflicting AIDs.");
486 final HashSet<String> aids = new HashSet<String>();
529 if (DBG) Log.d(TAG, "Finding AIDs in range [" + plainAid + " - " +
540 prefixConflicts.aids.add(entry.getKey());
553 if (DBG) Log.d(TAG, "Finding AIDs in range [" + firstAid + " - " +
572 subsetConflicts.aids.add(entry.getKey());
580 // Get all exact and prefix AIDs in an ordered list
590 // Because of the lexicographical ordering, all following AIDs either start with the
603 // and all conflicting AIDs as its children.
605 // "A000000003", "A00000000301*", "A0000000030102" are all conflicting children AIDs
618 // This prefix is the default; therefore, AIDs of all conflicting children
620 resolvedAids.addAll(prefixConflicts.aids);
622 if (prefixConflicts.aids.contains(aid)) {
634 // conflicting children. So, for all conflicting AIDs, just add
645 // Special case: in this case all children AIDs must be routed to the
667 // so by necessity all other AIDs are different than this AID or longer.
675 // Remove the AIDs we resolved from the list of AIDs to resolve
676 if (DBG) Log.d(TAG, "AIDs: " + resolvedAids + " were resolved.");
706 // This subset is the default; therefore, AIDs of all conflicting children
718 resolvedAids.addAll(aidConflicts.aids);
721 // conflicting children. So, for all conflicting AIDs, just add
733 // Special case: in this case all children AIDs must be routed to the
766 // so by necessity all other AIDs are different than this AID or shorter.
772 // Remove the AIDs we resolved from the list of AIDs to resolve
773 if (DBG) Log.d(TAG, "AIDs: " + resolvedAids + " were resolved.");
