Arrays.sort(switchPos);  if (switchPos.length < 2)
if (idx < 2)
	private void findSwitchDuplicates(CFG cfg, Method method, BasicBlock bb) {				Iterator<Edge> iei = cfg.outgoingEdgeIterator(bb);						int[] switchPos = new int[cfg.getNumOutgoingEdges(bb)+1];		int idx = 0;				while (iei.hasNext()) {			Edge e = iei.next();			if (EdgeTypes.SWITCH_EDGE == e.getType()) {				BasicBlock target = e.getTarget();				InstructionHandle firstIns = target.getFirstInstruction();				if (firstIns == null)					return;				switchPos[idx++] = firstIns.getPosition();			} else if (EdgeTypes.SWITCH_DEFAULT_EDGE == e.getType()) {				BasicBlock target = e.getTarget();				InstructionHandle firstIns = target.getFirstInstruction();				if (firstIns == null)					return;				switchPos[idx++] = firstIns.getPosition();			} else				return;		}				Arrays.sort(switchPos);				if (switchPos.length < 2)			return;								HashMap<BigInteger, Collection<Integer>> map = new HashMap<BigInteger,Collection<Integer>>();		for (int i = 0; i < switchPos.length-1; i++) {			if (switchPos[i] +1 >=  switchPos[i+1]) continue;			byte[] clause = getCodeBytes(method, switchPos[i], switchPos[i+1]);						BigInteger clauseAsInt = new BigInteger(clause);						Collection<Integer> values = map.get(clauseAsInt);						if (values == null) {				values = new LinkedList<Integer>();				map.put(clauseAsInt,values);			}			values.add((Integer)i);		}		for(Collection<Integer> clauses : map.values()) {			if (clauses.size() > 1) {				BugInstance bug = new BugInstance(this, "DB_DUPLICATE_SWITCH_CLAUSES", LOW_PRIORITY)						.addClass(classContext.getJavaClass())						.addMethod(classContext.getJavaClass(), method);				for(int i : clauses) 					bug.addSourceLineRange(this.classContext, this, 							switchPos[i],							switchPos[i+1]-1);				bugReporter.reportBug(bug);			}		}	}