Abstract: Technologies are described herein for correcting the layout of shapes in a diagram. A request is received to correct the diagram layout. The positional relationships between the shapes in the diagram are determined through the creation of a dependency tree. According to various embodiments, the dependency tree defines parent-child relationships within the diagram and the physical position of shapes with respect to one another. Using the dependency tree and layout rules, the shapes within the diagram may be repositioned to correct misalignment and uneven spacing to make minor corrections in the layout while preserving the general configuration of the original layout. Embodiments provide for layout corrections of diagrams including regions that encompass member shapes and provide for conflict resolution when layout corrective actions result in overlaps of shapes, regions, or page breaks.

Abstract: Technologies are described herein for correcting the layout of shapes in a diagram. A request is received to correct the diagram layout. The positional relationships between the shapes in the diagram are determined through the creation of a dependency tree. According to various embodiments, the dependency tree defines parent-child relationships within the diagram and the physical position of shapes with respect to one another. Using the dependency tree and layout rules, the shapes within the diagram may be repositioned to correct misalignment and uneven spacing to make minor corrections in the layout while preserving the general configuration of the original layout. Embodiments provide for layout corrections of diagrams including regions that encompass member shapes and provide for conflict resolution when layout corrective actions result in overlaps of shapes, regions, or page breaks.

Abstract: Source code including application defined expressions and non-conforming identifiers are compiled to executable code. The source code is written with an application defined expression or non-conforming identifier enclosed between a predefined pair of matching separators, such as square brackets. When a sequence of characters between the predefined separators is encountered in the source code during compiling, a symbol table is searched for a matching identifier. If found, the characters are interpreted as a non-conforming identifier and bound to the matching identifier. If not found, the characters are interpreted as an application defined expression and bound to a function call for an evaluating function provided in an application library.