public static void findUsages(
@NotNull FindModel findModel,
@NotNull final Project project,
@NotNull final Processor<UsageInfo> consumer,
@NotNull FindUsagesProcessPresentation processPresentation) {
findUsages(findModel, project, consumer, processPresentation, Collections.emptySet());
}
public String[] knownNamespaces() {
final PsiElement parentElement = getParent();
BidirectionalMap<String, String> map = initNamespaceMaps(parentElement);
Set<String> known = Collections.emptySet();
if (map != null) {
known = new HashSet<String>(map.values());
}
if (parentElement instanceof XmlTag) {
if (known.isEmpty()) return ((XmlTag) parentElement).knownNamespaces();
ContainerUtil.addAll(known, ((XmlTag) parentElement).knownNamespaces());
} else {
XmlExtension xmlExtension = XmlExtension.getExtensionByElement(this);
if (xmlExtension != null) {
final XmlFile xmlFile = xmlExtension.getContainingFile(this);
if (xmlFile != null) {
final XmlTag rootTag = xmlFile.getRootTag();
if (rootTag != null && rootTag != this) {
if (known.isEmpty()) return rootTag.knownNamespaces();
ContainerUtil.addAll(known, rootTag.knownNamespaces());
}
}
}
}
return ArrayUtil.toStringArray(known);
}
/**
* Update the tree according to the list of loaded roots
*
* @param roots the list of roots to add to the tree
* @param uncheckedCommits the map from vcs root to commit identifiers that should be
* uncheckedCommits
*/
private void updateTree(List<Root> roots, Map<VirtualFile, Set<String>> uncheckedCommits) {
myTreeRoot.removeAllChildren();
if (roots == null) {
roots = Collections.emptyList();
}
for (Root r : roots) {
CheckedTreeNode rootNode = new CheckedTreeNode(r);
Status status = new Status();
status.root = r;
rootNode.add(new DefaultMutableTreeNode(status, false));
Set<String> unchecked =
uncheckedCommits != null && uncheckedCommits.containsKey(r.root)
? uncheckedCommits.get(r.root)
: Collections.<String>emptySet();
for (Commit c : r.commits) {
CheckedTreeNode child = new CheckedTreeNode(c);
rootNode.add(child);
child.setChecked(r.remoteName != null && !unchecked.contains(c.commitId()));
}
myTreeRoot.add(rootNode);
}
}
public void setProviders(List<FrameworkSupportInModuleProvider> providers) {
setProviders(providers, Collections.<String>emptySet(), Collections.<String>emptySet());
}
public Set<Move> getAllowedMoves() {
// If there is already a winn
if (gipfBoardState.players.winner() != null) {
return Collections.emptySet();
}
// Create a set of incomplete moves containing the starting positions and directions for the
// current piece
Set<Move> potentialMoves = getPotentialStartMoves(getCurrentPiece());
// If the current piece is a GIPF piece, the player is also allowed to place normal pieces.
if (getCurrentPiece().getPieceType() == GIPF)
potentialMoves.addAll(
getPotentialStartMoves(Piece.of(NORMAL, getCurrentPiece().getPieceColor())));
// These moves are marked as complete so a temporary game won't ask for user input.
potentialMoves.stream().forEach(m -> m.isCompleteMove = true);
Set<Move> potentialMovesIncludingLineSegmentRemoval = new HashSet<>();
for (Move potentialMove : potentialMoves) {
try {
Map<Position, Piece> temporaryPieceMap = new HashMap<>(getGipfBoardState().getPieceMap());
temporaryPieceMap.put(potentialMove.startPos, potentialMove.addedPiece);
movePiecesTowards(
temporaryPieceMap, potentialMove.getStartingPosition(), potentialMove.getDirection());
Set<List<Pair<PieceColor, Line.Segment>>> RLineOrderingsSet =
getRemovableLineOrderingsSetFromGipfBoard(
temporaryPieceMap, getCurrentPiece().getPieceColor());
if (RLineOrderingsSet.size() > 0) {
for (List<Pair<PieceColor, Line.Segment>> RLineOrdering : RLineOrderingsSet) {
Set<Position> piecesToWhite = new HashSet<>();
Set<Position> piecesToBlack = new HashSet<>();
Set<Position> piecesRemoved = new HashSet<>();
for (Pair<PieceColor, Line.Segment> RLine : RLineOrdering) {
Line.Segment removedSegment = RLine.getValue();
// The color of the player who removed the line
PieceColor colorRemoved = RLine.getKey();
// Determine per segment to whom the pieces are given. Pieces can only be given to the
// player
// who removed the line, or deleted from the game.
Set<Position> occupiedPositions =
removedSegment.getOccupiedPositions(temporaryPieceMap);
Set<Position> piecesFromSegmentBackToReserve =
occupiedPositions
.stream()
.filter(
position ->
temporaryPieceMap.get(position).getPieceColor() == colorRemoved)
.collect(toSet());
Set<Position> piecesFromSegmentRemoved =
occupiedPositions
.stream()
.filter(position -> !piecesFromSegmentBackToReserve.contains(position))
.collect(toSet());
if (colorRemoved == WHITE) piecesToWhite.addAll(piecesFromSegmentBackToReserve);
if (colorRemoved == BLACK) piecesToBlack.addAll(piecesFromSegmentBackToReserve);
piecesRemoved.addAll(piecesFromSegmentRemoved);
}
// And finally add the move
// the constructor will define this as a complete move, because all the parameters have
// a value.
potentialMovesIncludingLineSegmentRemoval.add(
new Move(
potentialMove.addedPiece,
potentialMove.startPos,
potentialMove.direction,
piecesToWhite,
piecesToBlack,
piecesRemoved));
}
} else {
// If no line segments can be removed, just add the original move
potentialMovesIncludingLineSegmentRemoval.add(potentialMove);
}
} catch (InvalidMoveException e) {
// We don't consider this move if it is invalid
}
}
return potentialMovesIncludingLineSegmentRemoval;
}
private static Pair<Set<String>, Set<TextWithImports>> findReferencedVars(
Set<String> visibleVars, SourcePosition position) {
final int line = position.getLine();
if (line < 0) {
return Pair.create(Collections.<String>emptySet(), Collections.<TextWithImports>emptySet());
}
final PsiFile positionFile = position.getFile();
if (!positionFile.getLanguage().isKindOf(JavaLanguage.INSTANCE)) {
return Pair.create(visibleVars, Collections.<TextWithImports>emptySet());
}
final VirtualFile vFile = positionFile.getVirtualFile();
final Document doc =
vFile != null ? FileDocumentManager.getInstance().getDocument(vFile) : null;
if (doc == null || doc.getLineCount() == 0 || line > (doc.getLineCount() - 1)) {
return Pair.create(Collections.<String>emptySet(), Collections.<TextWithImports>emptySet());
}
final TextRange limit = calculateLimitRange(positionFile, doc, line);
int startLine = Math.max(limit.getStartOffset(), line - 1);
startLine = Math.min(startLine, limit.getEndOffset());
while (startLine > limit.getStartOffset() && shouldSkipLine(positionFile, doc, startLine)) {
startLine--;
}
final int startOffset = doc.getLineStartOffset(startLine);
int endLine = Math.min(line + 2, limit.getEndOffset());
while (endLine < limit.getEndOffset() && shouldSkipLine(positionFile, doc, endLine)) {
endLine++;
}
final int endOffset = doc.getLineEndOffset(endLine);
final TextRange lineRange = new TextRange(startOffset, endOffset);
if (!lineRange.isEmpty()) {
final int offset =
CharArrayUtil.shiftForward(doc.getCharsSequence(), doc.getLineStartOffset(line), " \t");
PsiElement element = positionFile.findElementAt(offset);
if (element != null) {
PsiMethod method = PsiTreeUtil.getNonStrictParentOfType(element, PsiMethod.class);
if (method != null) {
element = method;
} else {
PsiField field = PsiTreeUtil.getNonStrictParentOfType(element, PsiField.class);
if (field != null) {
element = field;
} else {
final PsiClassInitializer initializer =
PsiTreeUtil.getNonStrictParentOfType(element, PsiClassInitializer.class);
if (initializer != null) {
element = initializer;
}
}
}
//noinspection unchecked
if (element instanceof PsiCompiledElement) {
return Pair.create(visibleVars, Collections.<TextWithImports>emptySet());
} else {
VariablesCollector collector =
new VariablesCollector(visibleVars, adjustRange(element, lineRange));
element.accept(collector);
return Pair.create(collector.getVars(), collector.getExpressions());
}
}
}
return Pair.create(Collections.<String>emptySet(), Collections.<TextWithImports>emptySet());
}