mirror of
https://github.com/apple/swift.git
synced 2025-12-21 12:14:44 +01:00
8d8b60f973
ASTContexts This introduces swift::ide::CodeCompletionCache, which is a persistent code completion result cache. Right now REPL happens to use it (try importing Cocoa and doing code completion), and the difference is noticeable. But completion in REPL is still slow, because Cocoa goes through the AST Verifier on every completion (for unknown reasons). This commit does not implement cache invalidation yet, and it does not use libcache to evict cache entries under memory pressure. This commit also introduces two regressions: - We get fewer Cocoa results that expected. Module::isModuleVisible in Clang does not incorrectly reports that that ObjectiveC.NSObject submodule is not visible from Cocoa. - We are not implementing the decl hiding rules correctly. We used to rely on visible decl lookup to do it for us, but now we have a different data structure we have real decls from the current module and we have a text-only cache, so we are forced to reimplement this part of name lookup in code completion. Swift SVN r9633
107 lines
3.5 KiB
C++
107 lines
3.5 KiB
C++
//===--- REPLCodeCompletion.h - Code completion for REPL ----------* C++ *-===//
|
|
//
|
|
// This source file is part of the Swift.org open source project
|
|
//
|
|
// Copyright (c) 2014 - 2015 Apple Inc. and the Swift project authors
|
|
// Licensed under Apache License v2.0 with Runtime Library Exception
|
|
//
|
|
// See http://swift.org/LICENSE.txt for license information
|
|
// See http://swift.org/CONTRIBUTORS.txt for the list of Swift project authors
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This module provides completions to the immediate mode environment.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "swift/Basic/LLVM.h"
|
|
#include "swift/IDE/CodeCompletion.h"
|
|
#include "swift/Parse/CodeCompletionCallbacks.h"
|
|
#include "llvm/ADT/ArrayRef.h"
|
|
#include "llvm/ADT/StringRef.h"
|
|
#include <memory>
|
|
#include <vector>
|
|
#include <string>
|
|
#include <utility>
|
|
|
|
namespace swift {
|
|
|
|
/// State of a completion operation.
|
|
enum class CompletionState {
|
|
/// An invalid completion set.
|
|
Invalid,
|
|
/// No matching completions were found. Subsequent <TAB>s just beep.
|
|
Empty,
|
|
/// A unique completion was found. Subsequent <TAB>s just beep.
|
|
Unique,
|
|
/// Completions have been looked up and the root has been completed. This is
|
|
/// the state after the first <TAB> event. The next <TAB> will display
|
|
/// available completions.
|
|
CompletedRoot,
|
|
/// Displayed the list of available completions. Subsequent <TAB> events will
|
|
/// cycle through completing different stems.
|
|
DisplayedCompletionList
|
|
};
|
|
|
|
/// Represents a completion set and maintains state for navigating through
|
|
/// a set of completions.
|
|
class REPLCompletions {
|
|
friend class REPLCodeCompletionConsumer;
|
|
CompletionState State;
|
|
|
|
ide::CodeCompletionCache CompletionCache;
|
|
ide::CodeCompletionContext CompletionContext;
|
|
std::unique_ptr<ide::CodeCompletionConsumer> Consumer;
|
|
std::unique_ptr<CodeCompletionCallbacksFactory> CompletionCallbacksFactory;
|
|
|
|
std::vector<StringRef> CompletionStrings;
|
|
std::vector<StringRef> CompletionInsertableStrings;
|
|
|
|
std::string Prefix;
|
|
mutable Optional<std::string> Root;
|
|
size_t CurrentCompletionIdx;
|
|
|
|
public:
|
|
/// Create an invalid completion set.
|
|
REPLCompletions();
|
|
|
|
/// Create completion results for the given string.
|
|
void populate(SourceFile &SF, StringRef EnteredCode);
|
|
|
|
/// Returns true if this is a valid completion set.
|
|
explicit operator bool() const { return State != CompletionState::Invalid; }
|
|
bool isValid() const { return State != CompletionState::Invalid; }
|
|
|
|
// True if no completions were found.
|
|
bool isEmpty() const { return State == CompletionState::Empty; }
|
|
|
|
/// True if the completion is unique.
|
|
bool isUnique() const { return State == CompletionState::Unique; }
|
|
|
|
/// Returns the current state of the completion.
|
|
CompletionState getState() const { return State; }
|
|
/// Sets the state of the completion.
|
|
void setState(CompletionState S) { State = S; }
|
|
|
|
/// Returns the common root of all the found completions (or the entire
|
|
/// completion for a unique completion).
|
|
StringRef getRoot() const;
|
|
|
|
/// Returns the stem (if any) returned by the previous getNextStem() call.
|
|
StringRef getPreviousStem() const;
|
|
|
|
/// Returns the next completion stem. Cycles to the beginning of the list if
|
|
/// the end was reached.
|
|
StringRef getNextStem();
|
|
|
|
/// Returns a list of all complete names for which completions were found.
|
|
ArrayRef<StringRef> getCompletionList() const {
|
|
return CompletionStrings;
|
|
}
|
|
|
|
/// Reset the completion set to an invalid state.
|
|
void reset();
|
|
};
|
|
|
|
}
|