Abstract: Systems and methods for visually creating scroll-triggered animation in a document. Based on input received, a key position is determined that is associated with an element that is to be animated. An indicator may be displayed to visually show the location of the key position on an editing canvas. A scroll-triggered animation is defined for the element based on the specified key position. The scroll-triggered animation defines attributes of the element during scroll of the document in the end use environment. For example, the animation may specify that the element has a particular location when the scroll is at the specified key position. The scroll-triggered animation may additionally or alternatively comprise a before-effect and an after-effect, performing one animation before the scroll reaches the key position and another animation after the scroll reaches the key position.

Abstract: Techniques for responsive design controls are described. A user interface is provided having a breakpoint bar configured to display multiple selectable breakpoints. When the breakpoints are selected, digital content displayed on a design surface located adjacent to the breakpoint bar is resized according to a relative size of the breakpoint. The user interface additionally has a central axis along which the multiple breakpoints are distributed. The design surface enables the digital content to be viewed and resized around the central axis responsive to selection of one of the breakpoints. Additional tools and techniques are provided to implement responsive design controls.

Abstract: Methods and apparatus for calculating paragraph layout. A method begins with a first node in a paragraph and calculates an optimal line break scheme for paragraph layout that ended in the node. For every subsequent node in the paragraph, the method calculates an optimal line break scheme for paragraph layout that ends respectively in every subsequent node. Each optimal line break scheme is calculated by minimizing the total of a penalty value of a current line and all preceding penalties of all preceding lines. The preceding penalties of all preceding lines are defined by a previously calculated optimal line break scheme.

Abstract: Systems and methods for visually creating scroll-triggered animation in a document. Based on input received, a key position is determined that is associated with an element that is to be animated. An indicator may be displayed to visually show the location of the key position on an editing canvas. A scroll-triggered animation is defined for the element based on the specified key position. The scroll-triggered animation defines attributes of the element during scroll of the document in the end use environment. For example, the animation may specify that the element has a particular location when the scroll is at the specified key position. The scroll-triggered animation may additionally or alternatively comprise a before-effect and an after-effect, performing one animation before the scroll reaches the key position and another animation after the scroll reaches the key position.

Abstract: Systems and techniques manage commands generated through user interface dialogs. In general, in one implementation, commands resulting from interaction with controls of a dialog are received, and first and second commands are distinguished. The first command is held upon receipt to be performed later, and the second command is passed through the dialog to be performed upon receipt. Both of the commands are retained in a command sequence managed by a cancel control of the dialog. The dialog can include a preview control operable to specify whether effects of interaction with the controls are to be previewed. The first command can be subject to the preview control, while the second command is not subject to the preview control. Distinguishing between the commands can involve performing the second command but not the first command when the preview control specifies the effects of interaction are not to be previewed.

Abstract: Techniques are provided for text composition. In some implementations, a computer-implemented method is provided. The method includes receiving text to compose, the text including a plurality of paragraphs, and composing the text using paragraph composition, the paragraph composition determining a layout for the lines of each paragraph according to a line break scheme that determines line breaks for the paragraph as a whole. The method also includes, identifying limited recomposition for one or more paragraphs of the plurality of paragraphs, receiving a modification to a line of a paragraph, the paragraph having a plurality of lines and where the modified line is subsequent to a first line in the paragraph, determining whether the paragraph of the modified line is identified as having limited recomposition and, if the paragraph has limited recomposition, recomposing a portion of the paragraph using a multi-line paragraph composition process without recomposing the full paragraph.

Abstract: Methods and apparatus for calculating paragraph layout. A method begins with a first node in a paragraph and calculates an optimal line break scheme for paragraph layout that ended in the node. For every subsequent node in the paragraph, the method calculates an optimal line break scheme for paragraph layout that ends respectively in every subsequent node. Each optimal line break scheme is calculated by minimizing the total of a penalty value of a current line and all preceding penalties of all preceding lines. The preceding penalties of all preceding lines are defined by a previously calculated optimal line break scheme.

Abstract: Systems and techniques manage commands generated through user interface dialogs. In general, in one implementation, commands resulting from interaction with controls of a dialog are received, and first and second commands are distinguished. The first command is held upon receipt to be performed later, and the second command is passed through the dialog to be performed upon receipt. Both of the commands are retained in a command sequence managed by a cancel control of the dialog. The dialog can include a preview control operable to specify whether effects of interaction with the controls are to be previewed. The first command can be subject to the preview control, while the second command is not subject to the preview control. Distinguishing between the commands can involve performing the second command but not the first command when the preview control specifies the effects of interaction are not to be previewed.

Abstract: Methods and apparatus for calculating paragraph layout. A method begins with a first node in a paragraph and calculates an optimal line break scheme for paragraph layout that ended in the node. For every subsequent node in the paragraph, the method calculates an optimal line break scheme for paragraph layout that ends respectively in every subsequent node. Each optimal line break scheme is calculated by minimizing the total of a penalty value of a current line and all preceding penalties of all preceding lines. The preceding penalties of all preceding lines are defined by a previously calculated optimal line break scheme.

Abstract: Methods and apparatus for calculating paragraph layout. A method begins with a first node in a paragraph and calculates an optimal line break scheme for paragraph layout that ended in the node. For every subsequent node in the paragraph, the method calculates an optimal line break scheme for paragraph layout that ends respectively in every subsequent node. Each optimal line break scheme is calculated by minimizing the total of a penalty value of a current line and all preceding penalties of all preceding lines. The preceding penalties of all preceding lines are defined by a previously calculated optimal line break scheme.

Abstract: Methods and apparatus for calculating paragraph layout. A method begins with a first node in a paragraph and calculates an optimal line break scheme for paragraph layout that ended in the node (140). For every subsequent node in the paragraph, the method calculates an optimal line break scheme for paragraph layout that ends respectively in every subsequent node (142). Each optimal line break scheme is calculated by minimizing the total of a penalty value of a current line and all preceding penalties of all preceding lines (144). The preceding penalties of all preceding lines are defined by a previously calculated optimal line break scheme (150).

Abstract: Methods and apparatus for calculating paragraph layout. A method begins with a first node in a paragraph and calculates an optimal line break scheme for paragraph layout that ended in the node. For every subsequent node in the paragraph, the method calculates an optimal line break scheme for paragraph layout that ends respectively in every subsequent node. Each optimal line break scheme is calculated by minimizing the total of a penalty value of a current line and all preceding penalties of all preceding lines. The preceding penalties of all preceding lines are defined by a previously calculated optimal line break scheme.

Abstract: Methods and apparatus for calculating paragraph layout. A method begins with a first node in a paragraph and calculates an optimal line break scheme for paragraph layout that ended in the node. For every subsequent node in the paragraph, the method calculates an optimal line break scheme for paragraph layout that ends respectively in every subsequent node. Each optimal line break scheme is calculated by minimizing the total of a penalty value of a current line and all preceding penalties of all preceding lines. The preceding penalties of all preceding lines are defined by a previously calculated optimal line break scheme.

Abstract: Methods and apparatus for calculating paragraph layout. A method begins with a first node in a paragraph and calculates an optimal line break scheme for paragraph layout that ended in the node. For every subsequent node in the paragraph, the method calculates an optimal line break scheme for paragraph layout that ends respectively in every subsequent node. Each optimal line break scheme is calculated by minimizing the total of a penalty value of a current line and all preceding penalties of all preceding lines. The preceding penalties of all preceding lines are defined by a previously calculated optimal line break scheme.

Abstract: Methods and apparatus for calculating paragraph layout. A method begins with a first node in a paragraph and calculates an optimal line break scheme for paragraph layout that ended in the node. For every subsequent node in the paragraph, the method calculates an optimal line break scheme for paragraph layout that ends respectively in every subsequent node. Each optimal line break scheme is calculated by minimizing the total of a penalty value of a current line and all preceding penalties of all preceding lines. The preceding penalties of all preceding lines are defined by a previously calculated optimal line break scheme.

Abstract: Methods and apparatus, for calculating paragraph layout. A method begins with a first node in a paragraph and calculates an optimal line break scheme for paragraph layout that ended in the node (140). For every subsequent node in the paragraph, the method calculates an optimal line break scheme for paragraph layout that ends respectively in every subsequent node (142). Each optimal line break scheme is calculated by minimizing the total of a penalty value of a current line and all preceding penalties of all preceding lines (144). The preceding penalties of all preceding lines are defined by a previously calculated optimal line break scheme (150).

Abstract: A type of switching fabric for exchanging variable-size frames of digital information between frame processors coupled directly or indirectly to one or more digital communication lines. It comprises one or more multi-line serial communication controllers (MSCCs), and a backplane providing a full mesh of serial point-to-point bi-directional links between each MSCC, and, in a loopback, from each MSCC back to itself. The MSCCs collectively manage the transfer of variable-size frames between the frame processors. To transfer digital information from a source line to a destination line, a frame processor coupled to the ingress line drives the switching fabric by signaling its MSCC that there is information. The ingress MSCC then switches the digital information through the backplane to the MSCC serving the frame processor coupled to the egress line. The switching fabric uses a clocking scheme that makes possible high throughput rates.