Display
Find

Find your next step

Filter public starting points, or search the full product catalog.

Public starting points

8 shown

Focused checks / Useful results

Make your next step
a little clearer.

Prepare text, check data against your rules, or trace the effects of a change. Each tool has a defined scope and a private result.

See a fictional example report →

A focused tool.
A clear scope.

Prefer to pay with a wallet?

Checking wallet choices…

Dock Door Appointment Plan

Build a clear dock appointment schedule around door hours and blocked periods.

Build a clear dock appointment schedule around door hours and blocked periods. Supply sourceRevision; up to 16 doors with id, openMinute and closeMinute; up to 64 blocked periods with id, doorId, startMinute and endMinute; and up to 64 appointments with id, earliestStartMinute, latestFinishMinute, durationMinutes and allowedDoorIds. Minutes are integers from 0 through 1440 on one supplied timeline. Windows must increase, blockers must fit their door hours and cannot overlap on a door; adjacent intervals are valid. Duration is positive. Empty lists and empty allowedDoorIds are valid. IDs are case-sensitive opaque ASCII labels of 1 to 48 letters, digits, underscores, periods, colons, pipes or hyphens; each collection has its own namespace. Unknown door references and repeated allowed doors reject. Appointments run by earliest latestFinishMinute, then original appointment order. Each receives the earliest integer start that fits its own window, allowed door hours, blockers and earlier assignments; ties use original door order, regardless of allowedDoorIds order. Intervals are half-open, so adjacent appointments and blockers fit. Earlier assignments never move. Unassigned appointments do not stop later work: no-compatible-door means its allowed list is empty, and no-fitting-window means no allowed door has a fitting interval. appointmentPlans preserves input order. doorSchedules reports each chronological assigned schedule, unused windows and exact minute totals. Invalid requests reject before quoting. Shared limits remain 36,000 input bytes, 6,000 nodes, depth 24 and 500,000 output bytes. This declared greedy policy provides a supplied-record plan without a global scheduling optimum, external booking, equipment suitability or physical availability guarantee. The reference explains scheduling concepts and does not certify this policy. Use authorized, non-sensitive data. The report describes supplied records and does not change external systems.

Agent API guide → · Website orders show the report on your private order page.

The complete checkout request must fit within 40,000 UTF-8 bytes. Your input is validated again before an order is created.

Before you begin

Use non-sensitive information you are authorized to process. Do not include passwords, wallet keys, personal records or confidential material. Examples stay in your browser until you submit checkout.

Payment options appear only when available for your selected service. Confirmed payment starts processing. Save your private order link to retrieve the JSON result during its 30-day access period. These checks do not establish factual accuracy, regulatory compliance or complete dependency coverage.

Purchase terms and support · Privacy policy