Java Utililty Methods Collection Element Get

HashMap count = new HashMap();
Iterator it = col.iterator();
while (it.hasNext()) {
    Object obj = it.next();
    Integer c = (Integer) (count.get(obj));
    if (null == c) {
        count.put(obj, new Integer(1));
    } else {
...

Map count = new HashMap<T, Integer>();
for (T item : coll) {
    Integer c = (Integer) (count.get(item));
    if (c == null) {
        count.put(item, INTEGER_ONE);
    } else {
        count.put(item, new Integer(c.intValue() + 1));
return count;

for (String curString : data)
    if (curString.equalsIgnoreCase(needle))
        return curString;
return null;

Class<?> c = Object.class;
if (collection != null) {
    if (!collection.isEmpty()) {
        c = collection.iterator().next().getClass();
    } else {
        c = Object.class;
return c;

int score = -1;
String best = null;
for (String target : targets) {
    int thisScore = matchLength(pattern, target);
    if (thisScore > score) {
        score = thisScore;
        best = target;
return best;

final Enumeration<Object[]> e = new Enumeration<Object[]>() {
    final Iterator<Path> inner = iterable.iterator();
    public boolean hasMoreElements() {
        return inner.hasNext();
    @Override
    public Object[] nextElement() {
        return new Object[] { inner.next() };
...

final StringBuilder buffer = new StringBuilder();
int openPos = iText.indexOf(COLLECTION_BEGIN, iStartPosition);
if (openPos == -1)
    return -1;
int currentPos, deep;
for (currentPos = openPos + 1, deep = 1; deep > 0; currentPos++) {
    if (currentPos >= iText.length()) {
        return -1;
...

List<Object> rs = new ArrayList<Object>();
rs.add(entity);
return rs;

List<T> list = new ArrayList<T>();
for (T item : items) {
    list.add(item);
return list;

return (Class<Collection<TT>>) Collection.class.asSubclass(Collection.class);