final String key = StringUtil.join(parts, Constants.DOLLAR); if (cacheMap.get(key) == null) { final THashSet<VirtualFile> files = new THashSet<>(1000); for (VirtualFile file : FilenameIndex.getVirtualFilesByName(project, name, scope)) { if (file.isValid() && MatcherUtil.matchAllParts(parts, file.getPath())) { files.add(file);
/** * 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()]); }
private Set<Sdk> sdkByModuleToSdkSet(@NotNull Map<Module, Sdk> sdkByModule) { Set<Sdk> sdkSet = new THashSet<>(); for (@Nullable Sdk sdk : sdkByModule.values()) { if (sdk != null) { sdkSet.add(sdk); } } return sdkSet; }
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 boolean add(Object object, boolean checkSorted) { if (!(object instanceof Variable)) throw new IllegalArgumentException (object.toString ()); if (!verts.contains (object)) { vertsList.add (object); boolean ret = verts.add (object); if (checkSorted) Collections.sort (vertsList); return ret; } else { return false; } }
private static void checkChoice(BnfChoice choice, ProblemsHolder problemsHolder) { Set<BnfExpression> visited = new THashSet<>(); THashSet<BnfExpression> first = new THashSet<>(); BnfFirstNextAnalyzer analyzer = new BnfFirstNextAnalyzer().setPredicateLookAhead(true); List<BnfExpression> list = choice.getExpressionList(); for (int i = 0, listSize = list.size() - 1; i < listSize; i++) { BnfExpression child = list.get(i); Set<BnfExpression> firstSet = analyzer.calcFirstInner(child, first, visited); if (firstSet.contains(BnfFirstNextAnalyzer.BNF_MATCHES_NOTHING)) { registerProblem(choice, child, "Branch is unable to match anything due to & or ! conditions", problemsHolder); } else if (firstSet.contains(BnfFirstNextAnalyzer.BNF_MATCHES_EOF)) { registerProblem(choice, child, "Branch matches empty input making the rest branches unreachable", problemsHolder); break; } first.clear(); visited.clear(); } }
/** Returns true is term t is a stopword */ public boolean isStopword(final String t) { return stopWords.contains(t); }
/** * 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()]); } }
/** Instantiate this object. Terms in skipTokens will be passed to the last term pipeline * object instead of the next. */ public SkipTermPipeline(TermPipeline _next, TermPipeline _last, String[] _skipTokens) { this.next = _next; this.last = _last; for (String st : _skipTokens) { skipTerms.add(st); } }
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); }
/** Clear all stopwords from this stopword list object. * @since 1.1.0 */ public void clear() { stopWords.clear(); }
public Object clone() { return verts.clone(); }
/** * 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()]); }
@NotNull private static Set<StringRef> stringRefSet(@NotNull Set<String> stringSet) { Set<StringRef> stringRefSet = new THashSet<>(); for (String string : stringSet) { stringRefSet.add(StringRef.fromNullableString(string)); } return stringRefSet; }
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 boolean add(Object object, boolean checkSorted) { if (!(object instanceof Variable)) throw new IllegalArgumentException (object.toString ()); if (!verts.contains (object)) { vertsList.add (object); boolean ret = verts.add (object); if (checkSorted) Collections.sort (vertsList); return ret; } else { return false; } }
/** Returns true is term t is a stopword */ public boolean isStopword(final String t) { return stopWords.contains(t); }