Abstract: Systems and methods are disclosed for searching a corpus using regular expressions. The method includes determining whether a received query has parameters that include a regular expression and creating an automaton representation of the regular expression, the automaton having a starting node, a number of termination nodes, and at least one edge between nodes. The method further includes traversing the automaton from the termination nodes to the starting node to determine a suffix array range for the starting node and using the suffix array range to identify documents in the corpus. The method may also include determining whether the query parameters match parameters for a stored high-cost recurring query and identifying documents associated with prepared results for the high-cost recurring query. The method may generate search results including the documents associated with the prepared results and at least some documents identified using the suffix array range.

Abstract: A system is disclosed for using features of source code to provide more relevant search results in a timelier manner. The system includes at least one processor and a memory storing instructions configured to cause the system to calculate a priority score for each file in associated with a code repository. The priority score is based on at least one of a version score, a build status score, a momentum score, and a social score. The instructions may cause the system to store the priority score in a memory. The instructions may also cause the system to receive a search query, use the stored priority scores to identify files in the code repository responsive to the query, and generate data used to display the identified files. The display may include depictions of the scores used to calculate a priority score for the identified files.