workbench.desktop.main.js · part 92

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

File contents and all parts · All files

Token#intersectRanges(): Internal Error: [

Label dummy removal

Invalid value: '

' for datatype :

Interactive crossing minimization

Minimizes the stress within a layout using stress majorization. Stress exists if the euclidean distance between a pair of nodes doesn't match their graph theoretic distance, that is, the shortest path between the two nodes. The method allows to specify individual edge lengths.

Token#subtractRanges(): Internal Error: [

Missing trailing '

Label dummy insertions

Before removing overlaps

After removing overlaps

Child movement 

StretchWidth layering

Graph must not contain hyperedges.

Node promotion heuristic

Anonymous function

Inverted port preprocessing

The node type 

 is not supported by the 

Comment pre-processing

 comment boxes

Invalid port label placement: 

Invalid node label placement: 

Processor determine the coords for each level

Breadth first model order layering

Calculate Graph Size

Polyline edge routing

The edge must have at least one source or target.

ELK Radial

A radial layout provider which is based on the algorithm of Peter Eades published in "Drawing free trees.", published by International Institute for Advanced Study of Social Information Science, Fujitsu Limited in 1991. The radial layouter takes a tree and places the nodes in radial order around the root. The nodes of the same tree level are placed on the same radius.

Interactive node layering

Compound graph postprocessor

ELK Force

Force-based algorithm provided by the Eclipse Layout Kernel. Implements methods that follow physical analogies by simulating forces that move the nodes into a balanced distribution. Currently the original Eades model and the Fruchterman - Reingold model are supported.

ELK Mr. Tree

Tree-based algorithm provided by the Eclipse Layout Kernel. Computes a spanning tree of the input graph and arranges all nodes according to the resulting parent-children hierarchy. I pity the fool who doesn't use Mr. Tree Layout.

MinWidth layering

Spline edge routing

Expecting , or ]

Depth first model order layering

Network simplex node placement

Straight Edges Pre-Processing

Flexible Where Space Processing

Straight Edges Post-Processing

An edge must have a source node (edge id: '

The source port of an edge must be a port of the edge's source node (edge id: '

An edge must have a target node (edge id: '

The target port of an edge must be a port of the edge's target node (edge id: '

' is not a valid enumerator of '

' does not match any member types of the union datatype '

' is not a date formatted string of the form yyyy-MM-dd'T'HH:mm:ss'.'SSSZ or a valid subset thereof

' is invalid. 

Scale out of range.

InterfaceIsAbstract AtMostOneID UniqueFeatureNames UniqueOperationSignatures NoCircularSuperTypes WellFormedMapEntryClass ConsistentSuperTypes DisjointFeatureAndOperationSignatures

WellFormedInstanceTypeName UniqueTypeParameterNames

UniqueEnumeratorNames UniqueEnumeratorLiterals

UniqueParameterNames UniqueTypeParameterNames NoRepeatingVoid

WellFormedNsURI WellFormedNsPrefix UniqueSubpackageNames UniqueClassifierNames UniqueNsURIs

ConsistentOpposite SingleContainer ConsistentKeys ConsistentUnique ConsistentContainer

ValidLowerBound ValidUpperBound ConsistentBounds ValidType