private boolean checkMultiple( ResolveSession session, UsedBlames usedBlames, Blame usedBlame, Candidates permutation) { // Check the root requirement to see if it is a multiple cardinality // requirement. List<Capability> candidates = null; Requirement req = usedBlame.m_reqs.get(0); if (Util.isMultiple(req)) { // Create a copy of the current permutation so we can remove the // candidates causing the blame. if (session.getMultipleCardCandidates() == null) { session.setMultipleCardCandidates(permutation.copy()); } // Get the current candidate list and remove all the offending root // cause candidates from a copy of the current permutation. candidates = session.getMultipleCardCandidates().getCandidates(req); candidates.removeAll(usedBlames.getRootCauses(req)); } // We only are successful if there is at least one candidate left // for the requirement return (candidates != null) && !candidates.isEmpty(); }
private boolean checkMultiple( ResolveSession session, UsedBlames usedBlames, Blame usedBlame, Candidates permutation) { // Check the root requirement to see if it is a multiple cardinality // requirement. List<Capability> candidates = null; Requirement req = usedBlame.m_reqs.get(0); if (Util.isMultiple(req)) { // Create a copy of the current permutation so we can remove the // candidates causing the blame. if (session.getMultipleCardCandidates() == null) { session.setMultipleCardCandidates(permutation.copy()); } // Get the current candidate list and remove all the offending root // cause candidates from a copy of the current permutation. candidates = session.getMultipleCardCandidates().clearCandidates(req, usedBlames.getRootCauses(req)); } // We only are successful if there is at least one candidate left // for the requirement return (candidates != null) && !candidates.isEmpty(); }
private boolean checkMultiple( ResolveSession session, UsedBlames usedBlames, Blame usedBlame, Candidates permutation) { // Check the root requirement to see if it is a multiple cardinality // requirement. List<Capability> candidates = null; Requirement req = usedBlame.m_reqs.get(0); if (Util.isMultiple(req)) { // Create a copy of the current permutation so we can remove the // candidates causing the blame. if (session.getMultipleCardCandidates() == null) { session.setMultipleCardCandidates(permutation.copy()); } // Get the current candidate list and remove all the offending root // cause candidates from a copy of the current permutation. candidates = session.getMultipleCardCandidates().clearCandidates(req, usedBlames.getRootCauses(req)); } // We only are successful if there is at least one candidate left // for the requirement return (candidates != null) && !candidates.isEmpty(); }
private boolean checkMultiple( ResolveSession session, UsedBlames usedBlames, Blame usedBlame, Candidates permutation) { // Check the root requirement to see if it is a multiple cardinality // requirement. List<Capability> candidates = null; Requirement req = usedBlame.m_reqs.get(0); if (Util.isMultiple(req)) { // Create a copy of the current permutation so we can remove the // candidates causing the blame. if (session.getMultipleCardCandidates() == null) { session.setMultipleCardCandidates(permutation.copy()); } // Get the current candidate list and remove all the offending root // cause candidates from a copy of the current permutation. candidates = session.getMultipleCardCandidates().clearCandidates(req, usedBlames.getRootCauses(req)); } // We only are successful if there is at least one candidate left // for the requirement return (candidates != null) && !candidates.isEmpty(); }
boolean checkMultiple( UsedBlames usedBlames, Blame usedBlame, Candidates permutation) { // Check the root requirement to see if it is a multiple cardinality // requirement. CandidateSelector candidates = null; Requirement req = usedBlame.m_reqs.get(0); if (Util.isMultiple(req)) { // Create a copy of the current permutation so we can remove the // candidates causing the blame. if (m_multipleCardCandidates == null) { m_multipleCardCandidates = permutation.copy(); } // Get the current candidate list and remove all the offending root // cause candidates from a copy of the current permutation. candidates = m_multipleCardCandidates.clearMultipleCardinalityCandidates(req, usedBlames.getRootCauses(req)); } // We only are successful if there is at least one candidate left // for the requirement return (candidates != null) && !candidates.isEmpty(); }
boolean checkMultiple( UsedBlames usedBlames, Blame usedBlame, Candidates permutation) { // Check the root requirement to see if it is a multiple cardinality // requirement. CandidateSelector candidates = null; Requirement req = usedBlame.m_reqs.get(0); if (Util.isMultiple(req)) { // Create a copy of the current permutation so we can remove the // candidates causing the blame. if (m_multipleCardCandidates == null) { m_multipleCardCandidates = permutation.copy(); } // Get the current candidate list and remove all the offending root // cause candidates from a copy of the current permutation. candidates = m_multipleCardCandidates.clearMultipleCardinalityCandidates(req, usedBlames.getRootCauses(req)); } // We only are successful if there is at least one candidate left // for the requirement return (candidates != null) && !candidates.isEmpty(); }
boolean checkMultiple( UsedBlames usedBlames, Blame usedBlame, Candidates permutation) { // Check the root requirement to see if it is a multiple cardinality // requirement. CandidateSelector candidates = null; Requirement req = usedBlame.m_reqs.get(0); if (Util.isMultiple(req)) { // Create a copy of the current permutation so we can remove the // candidates causing the blame. if (m_multipleCardCandidates == null) { m_multipleCardCandidates = permutation.copy(); } // Get the current candidate list and remove all the offending root // cause candidates from a copy of the current permutation. candidates = m_multipleCardCandidates.clearMultipleCardinalityCandidates(req, usedBlames.getRootCauses(req)); } // We only are successful if there is at least one candidate left // for the requirement return (candidates != null) && !candidates.isEmpty(); }
boolean checkMultiple( UsedBlames usedBlames, Blame usedBlame, Candidates permutation) { // Check the root requirement to see if it is a multiple cardinality // requirement. CandidateSelector candidates = null; Requirement req = usedBlame.m_reqs.get(0); if (Util.isMultiple(req)) { // Create a copy of the current permutation so we can remove the // candidates causing the blame. if (m_multipleCardCandidates == null) { m_multipleCardCandidates = permutation.copy(); } // Get the current candidate list and remove all the offending root // cause candidates from a copy of the current permutation. candidates = m_multipleCardCandidates.clearMultipleCardinalityCandidates(req, usedBlames.getRootCauses(req)); } // We only are successful if there is at least one candidate left // for the requirement return (candidates != null) && !candidates.isEmpty(); }
boolean checkMultiple( UsedBlames usedBlames, Blame usedBlame, Candidates permutation) { // Check the root requirement to see if it is a multiple cardinality // requirement. CandidateSelector candidates = null; Requirement req = usedBlame.m_reqs.get(0); if (Util.isMultiple(req)) { // Create a copy of the current permutation so we can remove the // candidates causing the blame. if (m_multipleCardCandidates == null) { m_multipleCardCandidates = permutation.copy(); } // Get the current candidate list and remove all the offending root // cause candidates from a copy of the current permutation. candidates = m_multipleCardCandidates.clearMultipleCardinalityCandidates(req, usedBlames.getRootCauses(req)); } // We only are successful if there is at least one candidate left // for the requirement return (candidates != null) && !candidates.isEmpty(); }
boolean checkMultiple( UsedBlames usedBlames, Blame usedBlame, Candidates permutation) { // Check the root requirement to see if it is a multiple cardinality // requirement. CandidateSelector candidates = null; Requirement req = usedBlame.m_reqs.get(0); if (Util.isMultiple(req)) { // Create a copy of the current permutation so we can remove the // candidates causing the blame. if (m_multipleCardCandidates == null) { m_multipleCardCandidates = permutation.copy(); } // Get the current candidate list and remove all the offending root // cause candidates from a copy of the current permutation. candidates = m_multipleCardCandidates.clearMultipleCardinalityCandidates(req, usedBlames.getRootCauses(req)); } // We only are successful if there is at least one candidate left // for the requirement return (candidates != null) && !candidates.isEmpty(); }