public int size() { return verts.size(); }
public int size() { return verts.size(); }
public int size() { return verts.size(); }
public boolean equals(Object other) { if (! (other instanceof Set)) { return false; } Set that = (Set)other; if (that.size() != this.size()) { return false; } return containsAll(that); }
/** * Get the frame elements for the given frame * @param frame the frame to look up * @return an array of frame elements of `frame` */ public String [] lookupFrameElements(String frame){ THashSet<String> frameElements = frameElementsForFrame.get(frame); if(frameElements == null) return new String[0]; return frameElements.toArray(new String[frameElements.size()]); } }
/** * Returns the numbe of relevant documents for a given query. * @param queryid String The identifier of a query. * @return int The number of relevant documents for the given query. */ public int getNumberOfRelevant(String queryid){ for (int i = 0; i < this.getNumberOfQueries(); i++){ if (qrelsPerQuery[i].queryid.equalsIgnoreCase(queryid)){ return qrelsPerQuery[i].getAllRelevantDocuments().size(); } } return 0; }
/** * Returns the numbe of relevant documents for a given query. * @param queryid String The identifier of a query. * @return int The number of relevant documents for the given query. */ public int getNumberOfRelevant(String queryid){ for (int i = 0; i < this.getNumberOfQueries(); i++){ if (qrelsPerQuery[i].queryid.equalsIgnoreCase(queryid)){ return qrelsPerQuery[i].getAllRelevantDocuments().size(); } } return 0; }
/** * Get the pooled relevant documents for the given query. * @param queryid The id of the given query. * @return A hashset containing the docnos of the pooled relevant documents for the * given query. */ public String[] getRelevantDocumentsToArray(String queryid, int grades[]){ THashSet<String> docnoSet = getRelevantDocuments(queryid, grades); return (String[])docnoSet.toArray(new String[docnoSet.size()]); } /**
/** * Get all the pooled non-relevant documents. * @return All the pooled non-relevant documents. */ public String[] getNonRelevantDocumentsToArray(){ THashSet<String> docnoSet = this.getNonRelevantDocuments(); return (String[])docnoSet.toArray(new String[docnoSet.size()]); } /**
/** * Get the pooled relevant documents for the given query. * @param queryid The id of the given query. * @return A hashset containing the docnos of the pooled relevant documents for the * given query. */ public String[] getRelevantDocumentsToArray(String queryid, int grades[]){ THashSet<String> docnoSet = getRelevantDocuments(queryid, grades); return (String[])docnoSet.toArray(new String[docnoSet.size()]); } /**
/** * Returns a new array containing the objects in the set. * * @return an <code>Object[]</code> value */ public Object[] toArray() { Object[] result = new Object[size()]; forEach(new ToObjectArrayProcedure(result)); return result; }
/** * Get all the pooled non-relevant documents. * @return All the pooled non-relevant documents. */ public String[] getNonRelevantDocumentsToArray(){ THashSet<String> docnoSet = this.getNonRelevantDocuments(); return (String[])docnoSet.toArray(new String[docnoSet.size()]); } /**
/** * Get the relevant documents for a given relevance grade. * @param grade The given relevance grade. * @return The identifiers of the relevant documents with the given relevance * grade. */ public String[] getRelevantDocumentsToArray(int grade){ if (!relGrade.contains(grade)) return null; THashSet<String> docnos = (THashSet<String>)relGradeDocnosMap.get(grade); return (String[])docnos.toArray(new String[docnos.size()]); } /**
/** * Get the relevant documents for a given relevance grade. * @param grade The given relevance grade. * @return The identifiers of the relevant documents with the given relevance * grade. */ public String[] getRelevantDocumentsToArray(int grade){ if (!relGrade.contains(grade)) return null; THashSet<String> docnos = (THashSet<String>)relGradeDocnosMap.get(grade); return (String[])docnos.toArray(new String[docnos.size()]); } /**
/** * Get the identifiers of all relevant documents with the given relevance grades. * @param grades The relevance grades. * @return The identifiers of all relevant documents with the given relevance grades. */ public String[] getRelevantDocuments(int[] grades){ THashSet<String> docnoSet = new THashSet<String>(); for (int i=0; i<grades.length; i++){ String[] docnos = this.getRelevantDocumentsToArray(grades[i]); int N = docnos.length; for (int j=0; j<N; j++) docnoSet.add(docnos[j]); } return (String[])docnoSet.toArray(new String[docnoSet.size()]); }
/** * Get the identifiers of all relevant documents in the pool. * @return The identifiers of all relevant documents in the pool. */ public String[] getAllRelevantDocumentsToArray(){ THashSet<String> docnos = new THashSet<String>(); String[] queryids = this.getQueryids(); for (int i=0; i<queryids.length; i++){ String[] docnosTmp = this.getRelevantDocumentsToArray(queryids[i]); if (docnosTmp!=null) for (int j=0; j<docnosTmp.length; j++) docnos.add(docnosTmp[j]); } return (String[])docnos.toArray(new String[docnos.size()]); }
/** * Get the identifiers of all relevant documents in the pool. * @return The identifiers of all relevant documents in the pool. */ public String[] getAllRelevantDocumentsToArray(){ THashSet<String> docnos = new THashSet<String>(); String[] queryids = this.getQueryids(); for (int i=0; i<queryids.length; i++){ String[] docnosTmp = this.getRelevantDocumentsToArray(queryids[i]); if (docnosTmp!=null) for (int j=0; j<docnosTmp.length; j++) docnos.add(docnosTmp[j]); } return (String[])docnos.toArray(new String[docnos.size()]); }
public static VarSet defaultIntersection (VarSet v1, VarSet v2) {// Grossly inefficient implementation THashSet hset = new THashSet (v1); hset.retainAll (v2); Variable[] ret = new Variable [hset.size ()]; int vai = 0; for (int vi = 0; vi < v1.size(); vi++) { Variable var = v1.get (vi); if (hset.contains (var)) { ret[vai++] = var; } } return new HashVarSet (ret); } }
public static VarSet defaultIntersection (VarSet v1, VarSet v2) {// Grossly inefficient implementation THashSet hset = new THashSet (v1); hset.retainAll (v2); Variable[] ret = new Variable [hset.size ()]; int vai = 0; for (int vi = 0; vi < v1.size(); vi++) { Variable var = v1.get (vi); if (hset.contains (var)) { ret[vai++] = var; } } return new HashVarSet (ret); } }
public static VarSet defaultIntersection (VarSet v1, VarSet v2) {// Grossly inefficient implementation THashSet hset = new THashSet (v1); hset.retainAll (v2); Variable[] ret = new Variable [hset.size ()]; int vai = 0; for (int vi = 0; vi < v1.size(); vi++) { Variable var = v1.get (vi); if (hset.contains (var)) { ret[vai++] = var; } } return new HashVarSet (ret); } }