This algorithm returns the points that form an orthogonal path between two rectangles.
// Define shapes
const shapeA = {left: 50, top: 50, width: 100, height: 100};
const shapeB = {left: 200, top: 200, width: 50, height: 100};| /* package.json: | |
| { | |
| "name": "sgr_demo", | |
| "version": "1.0.0", | |
| "description": "TS-port of https://abdullin.com/schema-guided-reasoning/demo", | |
| "scripts": { | |
| "start": "bun src/sgr.ts" | |
| }, | |
| "keywords": [], | |
| "author": "mail@antonkuzmin.ru", |
| // Claude Code is a Beta product per Anthropic's Commercial Terms of Service. | |
| // By using Claude Code, you agree that all code acceptance or rejection decisions you make, | |
| // and the associated conversations in context, constitute Feedback under Anthropic's Commercial Terms, | |
| // and may be used to improve Anthropic's products, including training models. | |
| // You are responsible for reviewing any code suggestions before use. | |
| // (c) Anthropic PBC. All rights reserved. Use is subject to Anthropic's Commercial Terms of Service (https://www.anthropic.com/legal/commercial-terms). | |
| // Version: 0.2.9 |
This algorithm returns the points that form an orthogonal path between two rectangles.
// Define shapes
const shapeA = {left: 50, top: 50, width: 100, height: 100};
const shapeB = {left: 200, top: 200, width: 50, height: 100};| import javax.print.Doc; | |
| import javax.print.DocFlavor; | |
| import javax.print.DocPrintJob; | |
| import javax.print.PrintException; | |
| import javax.print.PrintService; | |
| import javax.print.SimpleDoc; | |
| import javax.print.event.PrintJobListener; | |
| import java.awt.print.Book; | |
| import java.awt.print.PageFormat; | |
| import java.awt.print.Pageable; |