Skip to content

A finite benchmark diagrams ​

A finite benchmark

Start with how the application begins, then follow data between its folders. Open an operation to see its decisions, calls, failures and cleanup. Its explanation supplies the exact contract and linked dependencies.

This view includes 1 application source files. Package and interface boundaries show checked contracts; their runtime implementations are not expanded. The views describe the checked program, not desired requirements or a recorded execution.

Where execution begins ​

Startup ​

It stores a context-typed empty collection with no items in owned values (Map<int,int>). It stores a context-typed empty collection with no items in owned unique (Set<int>). It sets index to 0. While index is less than 20000, it stores index times 3 in values under index; then it adds index to unique; then it increases index by 1. source

After the loop, it sets checksum to 0. For each key and value in a snapshot of values, if whether unique contains key returns true, it increases checksum by value. After the loop, it prints checksum. It prints the number of elements in values equals the number of elements in unique. source

Data flow ​

No calls cross the source files in this view. Follow local operations in the file sequences below.

Open a module ​

ModuleRead
main.augFlow and sequences · Explanation

These are static call boundaries, not a request trace. Interface implementations and foreign internals stop at their checked contracts. Dotted arrows defer a callback or browser action. Imports alone do not imply a call.

Last updated:

The world runs on language