workbench.desktop.main.js · part 101

60 text occurrences from desktop/Cursor.app/Contents/Resources/app/out/vs/workbench/workbench.desktop.main.js, part 101. Every entry preserves the shipped literal and its saved verdict or selection reason.

File contents and all parts · All files

Desired index of node

The rectangles are ordered. Normally according to their definition the the model. This option allows to specify a desired position that has preference over the original position.

In new Row

If set to true this node begins in a new row. Consequently this node cannot be moved in a previous layer during compaction. Width approximation does does not take this into account.

Order nodes by height

If set to true the nodes will be sorted by their height before computing the layout. The largest node will be in the first position.

Width Approximation Strategy

Strategy for finding an initial width of the drawing.

Target Width

Option to place the rectangles in the given target width instead of approximating the width using the desired aspect ratio. The padding is not included in this. Meaning a drawing will have width of targetwidth + horizontal padding.

Optimization Goal

Optimization goal for approximation of the bounding box given by the first iteration. Determines whether layout is sorted by the maximum scaling, aspect ratio, or area. Depending on the strategy the aspect ratio might be nearly ignored.

Shift Last Placed.

When placing a rectangle behind or below the last placed rectangle in the first iteration, it is sometimes possible to shift the rectangle further to the left or right, resulting in less whitespace. True (default) enables the shift and false disables it. Disabling the shift produces a greater approximated area by the first iteration and a layout, when using ONLY the first iteration (default not the case), where it is sometimes impossible to implement a size transformation of rectangles that will fill the bounding box and eliminate empty spaces.

Strategy for finding an initial placement on nodes.

Row Height Reevaluation

During the compaction step the height of a row is normally not changed. If this options is set, the blocks of other rows might be added if they exceed the row height. If this is the case the whole row has to be packed again to be optimal regarding the new row height. This option should, therefore, be used with care since it might be computation heavy.

Compaction iterations

Defines the number of compaction iterations. E.g. if set to 2 the width is initially approximated, then the drawing is compacted and based on the resulting drawing the target width is decreased or increased and a second compaction step is executed and the result compared to the first one. The best run is used based on the scale measure.

White Space Approximation Strategy

Strategy for expanding nodes such that whitespace in the parent is eliminated.

To Aspect Ratio Whitesapce Eliminator

Overlap removal

Underlying Layout Algorithm

A layout algorithm that is applied to the graph before it is compacted. If this is null, nothing is applied before compaction.

Structure Extraction Strategy

This option defines what kind of triangulation or other partitioning of the plane is applied to the vertices.

Tree Construction Strategy

Whether a minimum spanning tree or a maximum spanning tree should be constructed.

Cost Function for Spanning Tree

The cost function is used in the creation of the spanning tree.

Root node for spanning tree construction

The identifier of the node that is preferred as the root of the spanning tree. If this is null, the first node is chosen.

Root selection for spanning tree

This sets the method used to select a root node for the construction of a spanning tree

This option defines how the compaction is applied.

Orthogonal Compaction

Restricts the translation of nodes to orthogonal directions in the compaction phase.

Upper limit for iterations of overlap removal

Whether to run a supplementary scanline overlap check.

Minimum spanning tree construction

Maximum spanning tree construction

Layout Algorithm: 

Layout Type: 

'. Make sure it's type is registered with the 

Layout Option: 

The given string does not contain any numbers.

Exactly two numbers are expected, 

 were found.

The given string does not match the expected format for vectors.

Layout Algorithm

Select a specific layout algorithm.

Resolved Layout Algorithm

Meta data associated with the selected algorithm.

Alignment of the selected node relative to other nodes; the exact meaning depends on the used algorithm.

Aspect Ratio

The desired aspect ratio of the drawing, that is the quotient of width by height.

Bend Points

A fixed list of bend points for the edge. This is used by the 'Fixed Layout' algorithm to specify a pre-defined routing for an edge. The vector chain must include the source point, any bend points, and the target point, so it must have at least two points.

Content Alignment