mirror of
				https://github.com/RGBCube/serenity
				synced 2025-10-31 16:32:45 +00:00 
			
		
		
		
	
		
			
				
	
	
		
			173 lines
		
	
	
	
		
			6.7 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			173 lines
		
	
	
	
		
			6.7 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
| /*
 | |
|  * Copyright (c) 2020, the SerenityOS developers.
 | |
|  *
 | |
|  * SPDX-License-Identifier: BSD-2-Clause
 | |
|  */
 | |
| 
 | |
| #include <AK/Function.h>
 | |
| #include <LibLine/SuggestionManager.h>
 | |
| 
 | |
| namespace Line {
 | |
| 
 | |
| CompletionSuggestion::CompletionSuggestion(const StringView& completion, const StringView& trailing_trivia, Style style)
 | |
|     : style(style)
 | |
|     , text_string(completion)
 | |
|     , is_valid(true)
 | |
| {
 | |
|     Utf8View text_u8 { completion };
 | |
|     Utf8View trivia_u8 { trailing_trivia };
 | |
| 
 | |
|     for (auto cp : text_u8)
 | |
|         text.append(cp);
 | |
| 
 | |
|     for (auto cp : trivia_u8)
 | |
|         this->trailing_trivia.append(cp);
 | |
| 
 | |
|     text_view = Utf32View { text.data(), text.size() };
 | |
|     trivia_view = Utf32View { this->trailing_trivia.data(), this->trailing_trivia.size() };
 | |
| }
 | |
| 
 | |
| void SuggestionManager::set_suggestions(Vector<CompletionSuggestion>&& suggestions)
 | |
| {
 | |
|     m_suggestions = move(suggestions);
 | |
| 
 | |
|     // make sure we were not given invalid suggestions
 | |
|     for (auto& suggestion : m_suggestions)
 | |
|         VERIFY(suggestion.is_valid);
 | |
| 
 | |
|     size_t common_suggestion_prefix { 0 };
 | |
|     if (m_suggestions.size() == 1) {
 | |
|         m_largest_common_suggestion_prefix_length = m_suggestions[0].text_view.length();
 | |
|     } else if (m_suggestions.size()) {
 | |
|         u32 last_valid_suggestion_code_point;
 | |
| 
 | |
|         for (;; ++common_suggestion_prefix) {
 | |
|             if (m_suggestions[0].text_view.length() <= common_suggestion_prefix)
 | |
|                 goto no_more_commons;
 | |
| 
 | |
|             last_valid_suggestion_code_point = m_suggestions[0].text_view.code_points()[common_suggestion_prefix];
 | |
| 
 | |
|             for (auto& suggestion : m_suggestions) {
 | |
|                 if (suggestion.text_view.length() <= common_suggestion_prefix || suggestion.text_view.code_points()[common_suggestion_prefix] != last_valid_suggestion_code_point) {
 | |
|                     goto no_more_commons;
 | |
|                 }
 | |
|             }
 | |
|         }
 | |
|     no_more_commons:;
 | |
|         m_largest_common_suggestion_prefix_length = common_suggestion_prefix;
 | |
|     } else {
 | |
|         m_largest_common_suggestion_prefix_length = 0;
 | |
|     }
 | |
| }
 | |
| 
 | |
| void SuggestionManager::next()
 | |
| {
 | |
|     if (m_suggestions.size())
 | |
|         m_next_suggestion_index = (m_next_suggestion_index + 1) % m_suggestions.size();
 | |
|     else
 | |
|         m_next_suggestion_index = 0;
 | |
| }
 | |
| 
 | |
| void SuggestionManager::previous()
 | |
| {
 | |
|     if (m_next_suggestion_index == 0)
 | |
|         m_next_suggestion_index = m_suggestions.size();
 | |
|     m_next_suggestion_index--;
 | |
| }
 | |
| 
 | |
| const CompletionSuggestion& SuggestionManager::suggest()
 | |
| {
 | |
|     m_last_shown_suggestion = m_suggestions[m_next_suggestion_index];
 | |
|     m_selected_suggestion_index = m_next_suggestion_index;
 | |
|     return m_last_shown_suggestion;
 | |
| }
 | |
| 
 | |
| void SuggestionManager::set_current_suggestion_initiation_index(size_t index)
 | |
| {
 | |
|     if (m_last_shown_suggestion_display_length)
 | |
|         m_last_shown_suggestion.start_index = index - m_next_suggestion_static_offset - m_last_shown_suggestion_display_length;
 | |
|     else
 | |
|         m_last_shown_suggestion.start_index = index - m_next_suggestion_static_offset - m_next_suggestion_invariant_offset;
 | |
| 
 | |
|     m_last_shown_suggestion_display_length = m_last_shown_suggestion.text_view.length();
 | |
|     m_last_shown_suggestion_was_complete = true;
 | |
| }
 | |
| 
 | |
| SuggestionManager::CompletionAttemptResult SuggestionManager::attempt_completion(CompletionMode mode, size_t initiation_start_index)
 | |
| {
 | |
|     CompletionAttemptResult result { mode };
 | |
| 
 | |
|     if (m_next_suggestion_index < m_suggestions.size()) {
 | |
|         auto can_complete = m_next_suggestion_invariant_offset <= m_largest_common_suggestion_prefix_length;
 | |
|         ssize_t actual_offset;
 | |
|         size_t shown_length = m_last_shown_suggestion_display_length;
 | |
|         switch (mode) {
 | |
|         case CompletePrefix:
 | |
|             actual_offset = 0;
 | |
|             break;
 | |
|         case ShowSuggestions:
 | |
|             actual_offset = 0 - m_largest_common_suggestion_prefix_length + m_next_suggestion_invariant_offset;
 | |
|             if (can_complete)
 | |
|                 shown_length = m_largest_common_suggestion_prefix_length + m_last_shown_suggestion.trivia_view.length();
 | |
|             break;
 | |
|         default:
 | |
|             if (m_last_shown_suggestion_display_length == 0)
 | |
|                 actual_offset = 0;
 | |
|             else
 | |
|                 actual_offset = 0 - m_last_shown_suggestion_display_length + m_next_suggestion_invariant_offset;
 | |
|             break;
 | |
|         }
 | |
| 
 | |
|         result.offset_region_to_remove = { m_next_suggestion_invariant_offset, shown_length };
 | |
|         result.new_cursor_offset = actual_offset;
 | |
| 
 | |
|         auto& suggestion = suggest();
 | |
|         set_current_suggestion_initiation_index(initiation_start_index);
 | |
| 
 | |
|         if (mode == CompletePrefix) {
 | |
|             // Only auto-complete *if possible*.
 | |
|             if (can_complete) {
 | |
|                 result.insert.append(suggestion.text_view.substring_view(m_next_suggestion_invariant_offset, m_largest_common_suggestion_prefix_length - m_next_suggestion_invariant_offset));
 | |
|                 m_last_shown_suggestion_display_length = m_largest_common_suggestion_prefix_length;
 | |
|                 // Do not increment the suggestion index, as the first tab should only be a *peek*.
 | |
|                 if (m_suggestions.size() == 1) {
 | |
|                     // If there's one suggestion, commit and forget.
 | |
|                     result.new_completion_mode = DontComplete;
 | |
|                     // Add in the trivia of the last selected suggestion.
 | |
|                     result.insert.append(suggestion.trivia_view);
 | |
|                     m_last_shown_suggestion_display_length = 0;
 | |
|                     result.style_to_apply = suggestion.style;
 | |
|                     m_last_shown_suggestion_was_complete = true;
 | |
|                     return result;
 | |
|                 }
 | |
|             } else {
 | |
|                 m_last_shown_suggestion_display_length = 0;
 | |
|             }
 | |
|             result.new_completion_mode = CompletionMode::ShowSuggestions;
 | |
|             m_last_shown_suggestion_was_complete = false;
 | |
|             m_last_shown_suggestion = String::empty();
 | |
|         } else {
 | |
|             result.insert.append(suggestion.text_view.substring_view(m_next_suggestion_invariant_offset, suggestion.text_view.length() - m_next_suggestion_invariant_offset));
 | |
|             // Add in the trivia of the last selected suggestion.
 | |
|             result.insert.append(suggestion.trivia_view);
 | |
|             m_last_shown_suggestion_display_length += suggestion.trivia_view.length();
 | |
|         }
 | |
|     } else {
 | |
|         m_next_suggestion_index = 0;
 | |
|     }
 | |
|     return result;
 | |
| }
 | |
| 
 | |
| size_t SuggestionManager::for_each_suggestion(Function<IterationDecision(const CompletionSuggestion&, size_t)> callback) const
 | |
| {
 | |
|     size_t start_index { 0 };
 | |
|     for (auto& suggestion : m_suggestions) {
 | |
|         if (start_index++ < m_last_displayed_suggestion_index)
 | |
|             continue;
 | |
|         if (callback(suggestion, start_index - 1) == IterationDecision::Break)
 | |
|             break;
 | |
|     }
 | |
|     return start_index;
 | |
| }
 | |
| 
 | |
| }
 | 
