Abstract: Using a language model attention matrix to facilitate a “code radar” source code navigation experience that highlights related source code locations. A computer system identifies a first source code location within source code that is displayed at a code editor user interface (UI). From a set of mappings generated based on a language model attention matrix, the computer system identifies a second source code location as being related to the first source code location. Concurrent with presenting the first source code location in the code editor UI, the computer system presents a related source code navigation experience, which includes both (i) presenting the second source code location in the code editor UI, and (ii) presenting a visual indication that the second source code location is related to the first source code location. Some embodiments include generating the set of mappings based on a language model attention matrix.

Abstract: Using indentation to trim output of a language synthesis model. A computer system determines a first indentation level associated with a cursor within an editor buffer. The computer system identifies a block of line(s) from an output from a language synthesis model. Each line in the block meets at least one criterion from a set of criteria, including a first criterion that the line is an initial line in the output from the language synthesis model, a second criterion that the line has a second indentation level that is greater than the first indentation level, and a third criterion that the line contains a continuation token. The computer system identifies a particular line, immediately following the block, that does not meet any criterion from the set of criteria. The computer system trims the output from the language synthesis model from the particular line onward.

Abstract: Inferring source code structure based on indentation. A portion of source code comprising a plurality of lines is identified, and a corresponding indentation level for each line is determined. A plurality of nodes, each representing a different line in the plurality of lines are generated. The nodes are arranged into an ordered tree based on the corresponding indentation level for each line. Based on an identified line in the plurality of lines, a subset of the plurality of lines are identified from the ordered tree, based on identifying a subtree that comprises a node representing the identified line. A source code action is initiated based on the subset of the plurality of lines.

Abstract: Inferring source code structure based on indentation. A portion of source code comprising a plurality of lines is identified, and a corresponding indentation level for each line is determined. A plurality of nodes, each representing a different line in the plurality of lines are generated. The nodes are arranged into an ordered tree based on the corresponding indentation level for each line. Based on an identified line in the plurality of lines, a subset of the plurality of lines are identified from the ordered tree, based on identifying a subtree that comprises a node representing the identified line. A source code action is initiated based on the subset of the plurality of lines.

Abstract: Classifying packages based on generic feature extraction. A computer system identifies a set of training packages, including a first subset known to be malicious, and a second subset known to be benign. The computer system extracts a set of training feature vectors from the set of training packages by inputting each training package to a feature extraction model, which generates a training feature vector for each training package. The computer system trains a classification model using the set of training feature vectors. After training the classification model using the set of training feature vectors, a subject package is classified as malicious or benign based on extracting a feature vector for the subject package by inputting the subject package to the feature extraction model, and inputting the feature vector to the classification model.

Abstract: A computer system identifies a code synthesis model and a set of software repositories, each comprising corresponding source code and corresponding tests for testing the corresponding source code. The computer system tests a plurality of generated source code predictions using the set of software repositories. The testing includes, for each software repository in the set of software repositories, identifying a portion of the corresponding source code of the software repository that is covered by the corresponding tests of the software repository, using the code synthesis model to generate a source code prediction for the portion of the corresponding source code, and using the corresponding tests of the software repository to test the source code prediction that was generated using the code synthesis model. Based on testing the plurality of generated source code predictions using the set of software repositories, the computer system generates an evaluation of the code synthesis model.

Abstract: A computer system is configured to identify a position of a cursor in an editor where a code file is displayed and identify one or more wish items based on the position of the cursor or metadata associated with the code file. The computer system is further configured to identify one or more first portions of text from the one or more wish items that are relevant to text immediately preceding the cursor, and prioritize the one or more first portions of text to identify a particular first portion of text that is most relevant to the text immediately preceding the cursor. The computer system then generates a second portion of text based on the particular first portion of text and suggest that the second portion of text be entered at the cursor.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for receiving a source code change; computing a distribution of standard coding durations using a model that takes as input features of source code changes; and computing a representative duration for the code change using the distribution of standard coding durations, wherein the representative duration represents a measure of how long a standard developer defined by the model would take to make the code change.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for receiving a source code change; computing a distribution of standard coding durations using a model that takes as input features of source code changes; and computing a representative duration for the code change using the distribution of standard coding durations, wherein the representative duration represents a measure of how long a standard developer defined by the model would take to make the code change.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for obtaining a commit time history of a developer entity, wherein the commit time history indicates, for each unit time interval of a plurality of unit time intervals, whether or not the developer entity committed source code during the unit time interval; and generating a model that takes the commit history as input and generates an output sequence of final probabilities, each final probability representing how likely it was that the developer entity was active during the corresponding unit time interval.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for obtaining a commit time history of a developer entity, wherein the commit time history indicates, for each unit time interval of a plurality of unit time intervals, whether or not the developer entity committed source code during the unit time interval; and generating a model that takes the commit history as input and generates an output sequence of final probabilities, each final probability representing how likely it was that the developer entity was active during the corresponding unit time interval.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for receiving a source code change; computing a distribution of standard coding durations using a model that takes as input features of source code changes; and computing a representative duration for the code change using the distribution of standard coding durations, wherein the representative duration represents a measure of how long a standard developer defined by the model would take to make the code change.

Abstract: Fluid-cooled fast breeder reactor includes an outer cylindrical boundary wall, a plurality of canless fuel elements and breeder material elements received within the boundary wall and being in an array therein forming a fissionable fuel zone and a breeder material zone coaxially surrounding the fissionable fuel zone, a coolant supply system for applying fluid coolant at uniform pressure to the entire cross section within the cylindrical boundary wall, and flow guide devices extending substantially horizontally and disposed at different levels one above the other within the breeder material zone which coaxially surrounds the fissionable fuel zone, means for elastically securing the flow guide devices at alternate levels within the breeder material to the boundary wall, the flow guide devices at the levels intermediate the alternate levels being spaced by an annular gap from the boundary wall.