@Override public Set<String> keySet() { //TODO implement more efficiently return NamedList.this.asMap(1).keySet(); }
@Override public Set<Entry<String,T>> entrySet() { //TODO implement more efficiently return NamedList.this.asMap(1).entrySet(); }
@Override public Collection values() { //TODO implement more efficiently return NamedList.this.asMap(1).values(); }
@Override @SuppressWarnings("unchecked") public void setResponse(NamedList<Object> response) { super.setResponse(response); dynamicFields = SchemaResponse.getDynamicFields(response.asMap(3)); }
public Map asMap(int maxDepth) { LinkedHashMap result = new LinkedHashMap(); for(int i=0;i<size();i++){ Object val = getVal(i); if (val instanceof NamedList && maxDepth> 0) { //the maxDepth check is to avoid stack overflow due to infinite recursion val = ((NamedList) val).asMap(maxDepth-1); } Object old = result.put(getName(i), val); if(old!=null){ if (old instanceof List) { List list = (List) old; list.add(val); result.put(getName(i),old); } else { ArrayList l = new ArrayList(); l.add(old); l.add(val); result.put(getName(i), l); } } } return result; } /**
public Map asMap(int maxDepth) { LinkedHashMap result = new LinkedHashMap(); for(int i=0;i<size();i++){ Object val = getVal(i); if (val instanceof NamedList && maxDepth> 0) { //the maxDepth check is to avoid stack overflow due to infinite recursion val = ((NamedList) val).asMap(maxDepth-1); } Object old = result.put(getName(i), val); if(old!=null){ if (old instanceof List) { List list = (List) old; list.add(val); result.put(getName(i),old); } else { ArrayList l = new ArrayList(); l.add(old); l.add(val); result.put(getName(i), l); } } } return result; }
Map m = rsp.nl.asMap(4); if (requestedTags.contains(FREEDISK.tagName)) { Object n = Utils.getObjectByPath(m, true, "metrics/solr.node/CONTAINER.fs.usableSpace");
((NamedList) cluster.get("collections")).get(collection)); } else { collectionsMap = ((NamedList)cluster.get("collections")).asMap(10);
_expandedResults = map.asMap(1);
_expandedResults = map.asMap(1);